Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. mapMaybe :: (a -> Maybe b) -> EnumMap k a -> EnumMap k b

   enummapset	Data.EnumMap.Strict

   No documentation available.

2. mapMaybeWithKey :: Enum k => (k -> a -> Maybe b) -> EnumMap k a -> EnumMap k b

   enummapset	Data.EnumMap.Strict

   No documentation available.

3. mapWithKey :: Enum k => (k -> a -> b) -> EnumMap k a -> EnumMap k b

   enummapset	Data.EnumMap.Strict

   No documentation available.

4. mapFB :: (elt -> lst -> lst) -> (a -> elt) -> a -> lst -> lst

   ghc-internal	GHC.Internal.Base

   No documentation available.

5. mapM :: Monad m => (a -> m b) -> [a] -> m [b]

   ghc-internal	GHC.Internal.Base

   mapM f is equivalent to sequence . map f.

6. mappend :: Monoid a => a -> a -> a

   ghc-internal	GHC.Internal.Base

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

7. mapException :: (Exception e1, Exception e2) => (e1 -> e2) -> a -> a

   ghc-internal	GHC.Internal.Control.Exception

   This function maps one exception into another as proposed in the paper "A semantics for imprecise exceptions".

8. mapException :: (Exception e1, Exception e2) => (e1 -> e2) -> a -> a

   ghc-internal	GHC.Internal.Control.Exception.Base

   This function maps one exception into another as proposed in the paper "A semantics for imprecise exceptions".

9. mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])

   ghc-internal	GHC.Internal.Control.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.

10. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

    ghc-internal	GHC.Internal.Control.Monad

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

    Examples

    mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

Page 157 of many | Previous | Next