Hoogle Search
Within LTS Haskell 24.10 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapM_ :: (Source r a, Index ix, Monad m) => (a -> m b) -> Array r ix a -> m ()massiv Data.Massiv.Array Map a monadic function over an array sequentially, while discarding the result.
Examples
>>> import Data.Massiv.Array as A >>> rangeStepM Par (Ix1 10) 12 60 >>= A.mapM_ print 10 22 34 46 58
mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()protolude Protolude 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.
mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()numeric-prelude NumericPrelude 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.
mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()numeric-prelude NumericPrelude.Base 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.
mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()numhask NumHask.Prelude 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.
mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()numhask NumHask.Prelude 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.
mapM_ :: (Monad m, FoldableLL full item) => (item -> m b) -> full -> m ()ListLike Data.ListLike A map in monad space, discarding results.
mapM_ :: (Monad m, FoldableLL full item) => (item -> m b) -> full -> m ()ListLike Data.ListLike.FoldableLL A map in monad space, discarding results.
mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()basic-prelude BasicPrelude 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.
mapM_ :: Monad m => (input -> m ()) -> UnfoldlM m input -> m ()deferred-folds DeferredFolds.UnfoldlM A more efficient implementation of mapM_