Hoogle Search
Within LTS Haskell 24.49 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
premapM :: Monad m => (a -> m b) -> ScanM m b r -> ScanM m a rfoldl Control.Scanl (premapM f scaner) returns a new ScanM where f is applied to each input element
premapM return = id premapM (f <=< g) = premap g . premap f
premapM k (pure r) = pure r premapM k (f <*> x) = premapM k f <*> premapM k x
intMapMaybe :: Int -> T (IntMap elem) (Maybe elem)data-accessor Data.Accessor.Container No documentation available.
gmapM :: (GTraversable t, Monad m) => (a -> m b) -> t a -> m (t b)generic-deriving Generics.Deriving.Traversable No documentation available.
contramapM :: (a -> IO b) -> OutputStream b -> IO (OutputStream a)io-streams System.IO.Streams.Combinators Contravariant counterpart to mapM. contramapM f s passes all input to s through the IO action f Satisfies the following laws:
Streams.contramapM (f >=> g) = Streams.contramapM g >=> Streams.contramapM f Streams.contramapM return = return
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