Hoogle Search

Within LTS Haskell 23.19 (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 :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   haskell-gi-base	Data.GI.Base.ShortPrelude

   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.

9. mapM :: Monad m => (a -> m b) -> Pipe a b m r

   pipes	Pipes.Prelude

   Apply a monadic function to all values flowing downstream

   mapM return = cat
   
   mapM (f >=> g) = mapM f >-> mapM g
   

10. mapM :: (a -> IO b) -> InputStream a -> IO (InputStream b)

    io-streams	System.IO.Streams.Combinators

    Maps an impure function over an InputStream. mapM f s passes all output from s through the IO action f. Satisfies the following laws:

    Streams.mapM (f >=> g) === Streams.mapM f >=> Streams.mapM g
    Streams.mapM return === Streams.makeInputStream . Streams.read
    

Page 1 of many | Next