Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])breakpoint Debug.Breakpoint.GhcFacade 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]breakpoint Debug.Breakpoint.GhcFacade Applicative version of mapMaybe
mapPlugins :: Plugins -> (Plugin -> [CommandLineOption] -> a) -> [a]breakpoint Debug.Breakpoint.GhcFacade No documentation available.
mapSndM :: (Applicative m, Traversable f) => (b -> m c) -> f (a, b) -> m (f (a, c))breakpoint Debug.Breakpoint.GhcFacade Monadic version of mapSnd
mapBy :: (ByteString -> a -> Maybe b) -> Trie a -> Trie bbytestring-trie Data.Trie Keyed version of filterMap. Warning: This function suffers Bug #25.
mapBy :: (ByteString -> a -> Maybe b) -> Trie a -> Trie bbytestring-trie Data.Trie.Internal Keyed version of filterMap. Warning: This function suffers Bug #25.
mapCabal :: forall (m :: Type -> Type) . Monad m => PackageName -> DebBase -> CabalT m ()cabal-debian Debian.Debianize Map all versions of Cabal package pname to Debian package dname. Not really a debian package name, but the name of a cabal package that maps to the debian package name we want. (Should this be a SrcPkgName?)
mapCabal :: forall (m :: Type -> Type) . Monad m => PackageName -> DebBase -> CabalT m ()cabal-debian Debian.Debianize.DebianName Map all versions of Cabal package pname to Debian package dname. Not really a debian package name, but the name of a cabal package that maps to the debian package name we want. (Should this be a SrcPkgName?)
mapFieldNames :: (String -> String) -> [FieldDescr a] -> [FieldDescr a]cabal-install Distribution.Client.ParseUtils Apply a name mangling function to the field names of all the field descriptions. The typical use case is to apply some prefix.
mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()calligraphy Calligraphy.Prelude Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.