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_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

   ghc-lib-parser	GHC.Prelude.Basic

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

2. mapM_ :: (Contiguous arr, Element arr a, Element arr b, Applicative f) => (a -> f b) -> arr a -> f ()

   contiguous	Data.Primitive.Contiguous

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ = traverse_

3. mapM_ :: (Mappable col, Applicative m, Monad m) => (a -> m b) -> col a -> m ()

   foundation	Foundation.Collection

   Evaluate each action in the collection from left to right, and ignore the results. For a version that doesn't ignore the results see sequenceA. sequenceA_ :: (Mappable col, Applicative f) => col (f a) -> f () sequenceA_ col = sequenceA col *> pure () Map each element of a collection to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM.

4. mapM_ :: (Context a, Monad m) => (a -> m b) -> Matrix a -> m ()

   matrices	Data.Matrix

   No documentation available.

5. mapM_ :: forall (v :: Type -> Type) a m b . (Vector v a, Monad m) => (a -> m b) -> Matrix v a -> m ()

   matrices	Data.Matrix.Generic

   No documentation available.

6. mapM_ :: (Context a, Monad m) => (a -> m b) -> Matrix a -> m ()

   matrices	Data.Matrix.Storable

   No documentation available.

7. mapM_ :: (Context a, Monad m) => (a -> m b) -> Matrix a -> m ()

   matrices	Data.Matrix.Unboxed

   No documentation available.

8. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

   prelude-compat	Prelude2010

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

9. mapM_ :: Monad m => (a -> m b) -> Vector a -> m ()

   rebase	Rebase.Data.Vector

   No documentation available.

10. mapM_ :: Monad m => (a -> m b) -> Stream m a -> m ()

    rebase	Rebase.Data.Vector.Fusion.Stream.Monadic

    Execute a monadic action for each element of the Stream

Page 6 of many | Previous | Next