Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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)

   numeric-prelude	NumericPrelude

   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)

   numeric-prelude	NumericPrelude.Base

   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)

   numhask	NumHask.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.

4. mapM :: (ListLike full item, Applicative m, ListLike full' item') => (item -> m item') -> full -> m full'

   ListLike	Data.ListLike

   A map in monad space. Same as sequence . map See also rigidMapM

5. mapM :: (ListLike full item, Applicative m, ListLike full' item') => (item -> m item') -> full -> m full'

   ListLike	Data.ListLike.Base

   A map in monad space. Same as sequence . map See also rigidMapM

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

   basic-prelude	BasicPrelude

   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.

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

   classy-prelude	ClassyPrelude

   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-lib-parser	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-lib-parser	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.

10. mapM :: (Contiguous arr1, Contiguous arr2, Element arr1 a, Element arr2 b, Monad m) => (a -> m b) -> arr1 a -> m (arr2 b)

    contiguous	Data.Primitive.Contiguous

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

Page 5 of many | Previous | Next