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.
bimapM_ :: (Bifoldable t, Applicative f) => (a -> f c) -> (b -> f d) -> t a b -> f ()base Data.Bifoldable Alias for bitraverse_.
imapM_ :: (FoldableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m ()lens Control.Lens.Combinators Run monadic actions for each target of an IndexedFold or IndexedTraversal with access to the index, discarding the results. When you don't need access to the index then mapMOf_ is more flexible in what it accepts.
mapM_ ≡ imapM . const
imapM_ :: (FoldableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m ()lens Control.Lens.Indexed Run monadic actions for each target of an IndexedFold or IndexedTraversal with access to the index, discarding the results. When you don't need access to the index then mapMOf_ is more flexible in what it accepts.
mapM_ ≡ imapM . const
imapM_ :: (FoldableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m ()indexed-traversable Data.Foldable.WithIndex Run monadic actions for each target of an IndexedFold or IndexedTraversal with access to the index, discarding the results. When you don't need access to the index then mapMOf_ is more flexible in what it accepts.
mapM_ ≡ imapM . const
contramapM_ :: (a -> IO b) -> OutputStream a -> IO (OutputStream a)io-streams System.IO.Streams.Combinators Equivalent to mapM_ for output. contramapM f s passes all input to s through the side-effecting IO action f.
omapM_ :: (MonoFoldable mono, Applicative m) => (Element mono -> m ()) -> mono -> m ()mono-traversable Data.MonoTraversable Map each element of a monomorphic container to a monadic action, evaluate these actions from left to right, and ignore the results.
forkMapM_ :: (a -> IO b) -> [a] -> IO [Maybe SomeException]monad-loops Control.Monad.Loops like forkMapM but without bothering to keep the return values
forkMapM__ :: (a -> IO b) -> [a] -> IO ()monad-loops Control.Monad.Loops like forkMapM_ but not even bothering to track success or failure of the child threads. Still waits for them all though.
imapM_ :: (Monad m, Vector v a) => (Int -> a -> m b) -> v a -> m ()rio RIO.Vector No documentation available.
imapM_ :: Monad m => (Int -> a -> m b) -> Vector a -> m ()rio RIO.Vector.Boxed No documentation available.