Hoogle Search
Within LTS Haskell 24.19 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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.
contramapMaybe :: (a -> Maybe b) -> OutputStream b -> IO (OutputStream a)io-streams System.IO.Streams.Combinators Contravariant counterpart to contramapMaybe. contramap f s passes all input to s through the function f. Discards all the elements for which f returns Nothing. Since: 1.2.1.0
-
mono-traversable Data.MonoTraversable Map each element of a monomorphic container to a monadic action, evaluate these actions from left to right, and collect the results.
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 [Either SomeException b]monad-loops Control.Monad.Loops Like mapM, but run all the actions in parallel threads, collecting up the results and returning them all. Does not return until all actions finish.
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.
contramapMaybeGLogFunc :: (a -> Maybe b) -> GLogFunc b -> GLogFunc ario RIO A vesion of contramapMaybeGLogFunc which supports filering.
foldMapM :: (Monad m, Monoid w, Foldable t) => (a -> m w) -> t a -> m wrio RIO.Prelude Extend foldMap to allow side effects. Internally, this is implemented using a strict left fold. This is used for performance reasons. It also necessitates that this function has a Monad constraint and not just an Applicative constraint. For more information, see https://github.com/commercialhaskell/rio/pull/99#issuecomment-394179757.
gmapM :: (Data a, Monad m) => (forall d . Data d => d -> m d) -> a -> m ario RIO.Prelude.Types A generic monadic transformation that maps over the immediate subterms The default definition instantiates the type constructor c in the type of gfoldl to the monad datatype constructor, defining injection and projection using return and >>=.