Copyright | (c) Tristan Wibberley Eric Mertens 2017 |
---|---|
License | GPL-2 |
Maintainer | tristan.wibberley@gmail.com |
Stability | experimental |
Safe Haskell | Safe |
Language | Haskell2010 |
Documentation
An applicative map that discards mismatched keys ie, it uses intersection for it's applicative instance
It has a case in which every key is occupied and equal
A class for maps so IMap can be generic
intersectionWith :: IsMap m => (a -> b -> c) -> m a -> m b -> m c Source #