Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapM_E :: (Monad m, MonoFoldable mono) => (Element mono -> m ()) -> ConduitT mono o m ()conduit Data.Conduit.Combinators Apply the action to all elements in the chunked stream. Note: the same caveat as with mapM_ applies. If you don't want to consume the values, you can use iterM:
iterM (omapM_ f)
Subject to fusionmapMS :: Monad m => (a -> m b) -> StreamConduit a m bconduit Data.Conduit.Internal.List.Stream No documentation available.
mapM_S :: Monad m => (a -> m ()) -> StreamConsumer a m ()conduit Data.Conduit.Internal.List.Stream No documentation available.
mapMaybeMS :: Monad m => (a -> m (Maybe b)) -> StreamConduit a m bconduit Data.Conduit.Internal.List.Stream No documentation available.
mapMaybeS :: forall (m :: Type -> Type) a b . Monad m => (a -> Maybe b) -> StreamConduit a m bconduit Data.Conduit.Internal.List.Stream No documentation available.
mapM_ :: Monad m => (a -> m ()) -> ConduitT a o m ()conduit Data.Conduit.List Apply the action to all values in the stream. Subject to fusion Since 0.3.0
mapMaybe :: forall (m :: Type -> Type) a b . Monad m => (a -> Maybe b) -> ConduitT a b m ()conduit Data.Conduit.List Apply a transformation that may fail to all values in a stream, discarding the failures. Subject to fusion Since 0.5.1
mapMaybeM :: Monad m => (a -> m (Maybe b)) -> ConduitT a b m ()conduit Data.Conduit.List Apply a monadic transformation that may fail to all values in a stream, discarding the failures. Subject to fusion Since 0.5.1
mapMaybe :: (MonadGen m, GenBase m ~ Identity) => (a -> Maybe b) -> m a -> m bhedgehog Hedgehog.Gen Generates a value which is the result of the given function returning a Just. The original generator's shrink tree will be retained, with values returning Nothing removed. Subsequent shrinks of those values will be retained. Compared to mapMaybeT, shrinking may be slower but will be optimal. It's possible that the function will never return Just, or will only do so a larger size than we're currently running at. To avoid looping forever, we limit the number of retries, and grow the size with each retry. If we retry too many times then the whole generator is discarded.
mapMaybeT :: MonadGen m => (a -> Maybe b) -> m a -> m bhedgehog Hedgehog.Gen Generates a value which is the result of the given function returning a Just. The original generator's shrink tree will be retained, with values returning Nothing removed. Subsequent shrinks of those values will be retained. Compared to mapMaybeT, shrinking may be slower but will be optimal. The type is also more general, because the shrink behavior from mapMaybe would force the entire shrink tree to be evaluated when applied to an impure tree. It's possible that the function will never return Just, or will only do so a larger size than we're currently running at. To avoid looping forever, we limit the number of retries, and grow the size with each retry. If we retry too many times then the whole generator is discarded.