Safe Haskell | Safe-Infered |
---|
Agda.Utils.Map
Documentation
data EitherOrBoth a b
unionWithM :: (Ord k, Functor m, Monad m) => (a -> a -> m a) -> Map k a -> Map k a -> m (Map k a)
Not very efficient (goes via a list), but it'll do.
insertWithKeyM :: (Ord k, Monad m) => (k -> a -> a -> m a) -> k -> a -> Map k a -> m (Map k a)
filterKeys :: Ord k => (k -> Bool) -> Map k a -> Map k a
Filter a map based on the keys.