Agda-2.2.10: A dependently typed functional programming language and proof assistant




data EitherOrBoth a b Source


L a 
B a b 
R b 

unionWithM :: (Ord k, Functor m, Monad m) => (a -> a -> m a) -> Map k a -> Map k a -> m (Map k a)Source

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)Source

filterKeys :: Ord k => (k -> Bool) -> Map k a -> Map k aSource

Filter a map based on the keys.