Hoogle Search

Within LTS Haskell 22.21 (ghc-9.6.5)

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

Exact lookup

1. mapM :: (Monad m, Unbox a, Unbox b) => (a -> m b) -> Vector a -> m (Vector b)

   vector	Data.Vector.Unboxed

   O(n) Apply the monadic action to all elements of the vector, yielding a vector of results.

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

   amazonka-core	Amazonka.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.

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

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

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

   base-compat	Control.Monad.Compat

   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.

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

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

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

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

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

Page 2 of many | Previous | Next