Hoogle Search

Within LTS Haskell 23.26 (ghc-9.8.4)

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

Exact lookup

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

   base	Prelude

   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.

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

   base	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.

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

   base	Data.Traversable

   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.

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

   base	GHC.Base

   mapM f is equivalent to sequence . map f.

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

   conduit	Data.Conduit.Combinators

   Apply a monadic transformation to all values in a stream. If you do not need the transformed values, and instead just want the monadic side-effects of running the action, see mapM_. Subject to fusion

6. mapM :: Monad m => (a -> m b) -> ConduitT a b m ()

   conduit	Data.Conduit.List

   Apply a monadic transformation to all values in a stream. If you do not need the transformed values, and instead just want the monadic side-effects of running the action, see mapM_. Subject to fusion Since 0.3.0

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

   hedgehog	Hedgehog.Internal.Prelude

   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.

8. mapM :: Monad m => (a -> m b) -> Stream m a x -> Stream m b x

   ghc	GHC.Data.Stream

   Apply a monadic operation to each element of a Stream, lazily

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

   ghc	GHC.HsToCore.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.

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

    ghc	GHC.Prelude.Basic

    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 1 of many | Next