Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. mapM :: Monad m => (b -> m c) -> Unfold m a b -> Unfold m a c

   streamly-core	Streamly.Internal.Data.Unfold

   Apply a monadic function to each element of the stream and replace it with the output of the resulting action.

   >>> mapM f = Unfold.mapM2 (const f)
   

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

   vector-stream	Data.Stream.Monadic

   Map a monadic function over a Stream

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

   clash-prelude	Clash.HaskellPrelude

   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 => (i -> m o) -> Pipe i o u m u

   conduino	Data.Conduino.Combinators

   Map a monadic function to process every input, and yield its output.

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

   control-monad-free	Control.Monad.Free

   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)

   dimensional	Numeric.Units.Dimensional.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 :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   distribution-opensuse	OpenSuse.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)

   distribution-opensuse	OpenSuse.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.

9. mapM :: (Functor m, Monad m) => (a -> m b) -> Stream m a -> Stream m b

   leveldb-haskell	Data.Stream.Monadic

   No documentation available.

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

    pinch	Pinch.Internal.FoldList

    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 9 of many | Previous | Next