Hoogle Search
Within LTS Haskell 24.33 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapAndUnzip5M :: Monad m => (a -> m (b, c, d, e, f)) -> [a] -> m ([b], [c], [d], [e], [f])ghc-lib-parser GHC.Utils.Monad No documentation available.
mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])ghc-lib-parser GHC.Utils.Monad The mapAndUnzipM function maps its first argument over a list, returning the result as a pair of lists. This function is mainly used with complicated data structures or a state monad.
mapMaybeM :: Applicative m => (a -> m (Maybe b)) -> [a] -> m [b]ghc-lib-parser GHC.Utils.Monad Applicative version of mapMaybe
mapSndM :: (Applicative m, Traversable f) => (b -> m c) -> f (a, b) -> m (f (a, c))ghc-lib-parser GHC.Utils.Monad Monadic version of mapSnd
mapXRec :: (MapXRec p, Anno a ~ Anno b) => (a -> b) -> XRec p a -> XRec p bghc-lib-parser Language.Haskell.Syntax.Extension No documentation available.
-
ghc-lib-parser Language.Haskell.Syntax.Type No documentation available.
mapEither :: (Ord b, Ord c) => (a -> Either b c) -> MaxQueue a -> (MaxQueue b, MaxQueue c)pqueue Data.PQueue.Max Maps a function over the elements of the queue, and separates the Left and Right values.
mapMaybe :: Ord b => (a -> Maybe b) -> MaxQueue a -> MaxQueue bpqueue Data.PQueue.Max Maps a function over the elements of the queue, and collects the Just values.
mapU :: (a -> b) -> MaxQueue a -> MaxQueue bpqueue Data.PQueue.Max Assumes that the function it is given is monotonic, and applies this function to every element of the priority queue. Does not check the precondition.
mapEither :: (Ord b, Ord c) => (a -> Either b c) -> MinQueue a -> (MinQueue b, MinQueue c)pqueue Data.PQueue.Min