Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. mapOutput :: forall (m :: Type -> Type) o1 o2 i r . Monad m => (o1 -> o2) -> ConduitT i o1 m r -> ConduitT i o2 m r

    conduit Data.Conduit

    Apply a function to all the output values of a ConduitT. This mimics the behavior of fmap for a Source and Conduit in pre-0.4 days. It can also be simulated by fusing with the map conduit from Data.Conduit.List. Since 0.4.1

  2. mapOutputMaybe :: forall (m :: Type -> Type) o1 o2 i r . Monad m => (o1 -> Maybe o2) -> ConduitT i o1 m r -> ConduitT i o2 m r

    conduit Data.Conduit

    Same as mapOutput, but use a function that returns Maybe values. Since 0.5.0

  3. mapAccumS :: forall (m :: Type -> Type) a s b . Monad m => (a -> s -> ConduitT b Void m s) -> s -> ConduitT () b m () -> ConduitT a Void m s

    conduit Data.Conduit.Combinators

    Consume a source with a strict accumulator, in a way piecewise defined by a controlling stream. The latter will be evaluated until it terminates. 

    >>> let f a s = liftM (:s) $ mapC (*a) =$ CL.take a

>>> reverse $ runIdentity $ yieldMany [0..3] $$ mapAccumS f [] (yieldMany [1..])
[[],[1],[4,6],[12,15,18]] :: [[Int]]

  4. mapAccumWhile :: forall (m :: Type -> Type) a s b . Monad m => (a -> s -> Either s (s, b)) -> s -> ConduitT a b m s

    conduit Data.Conduit.Combinators

    mapWhile with a break condition dependent on a strict accumulator. Equivalently, mapAccum as long as the result is Right. Instead of producing a leftover, the breaking input determines the resulting accumulator via Left. Subject to fusion

  5. mapAccumWhileM :: Monad m => (a -> s -> m (Either s (s, b))) -> s -> ConduitT a b m s

    conduit Data.Conduit.Combinators

    Monadic mapAccumWhile. Subject to fusion

  6. mapE :: forall (m :: Type -> Type) f a b . (Monad m, Functor f) => (a -> b) -> ConduitT (f a) (f b) m ()

    conduit Data.Conduit.Combinators

    Apply a transformation to all elements in a chunked stream. Subject to fusion

  7. mapM :: Monad m => (a -> m b) -> ConduitT a b m ()

    conduit Data.Conduit.Combinators

    Apply a monadic transformation to all values in a stream. If you do not need the transformed values, and instead just want the monadic side-effects of running the action, see mapM_. Subject to fusion

  8. mapME :: (Monad m, Traversable f) => (a -> m b) -> ConduitT (f a) (f b) m ()

    conduit Data.Conduit.Combinators

    Apply a monadic transformation to all elements in a chunked stream. Subject to fusion

  9. mapM_ :: Monad m => (a -> m ()) -> ConduitT a o m ()

    conduit Data.Conduit.Combinators

    Apply the action to all values in the stream. Note: if you want to pass the values instead of consuming them, use iterM instead. Subject to fusion

  10. 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 fusion

Page 77 of many | Previous | Next