Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. mapM_CE :: (Monad m, MonoFoldable mono) => (Element mono -> m ()) -> ConduitT mono o m ()

   conduit	Conduit

   Apply the action to all elements in the chunked stream. Note: the same caveat as with mapM_C applies. If you don't want to consume the values, you can use iterM:

   iterM (omapM_ f)
   

2. mapWhileC :: forall (m :: Type -> Type) a b . Monad m => (a -> Maybe b) -> ConduitT a b m ()

   conduit	Conduit

   Map values as long as the result is Just.

3. mapInput :: forall (m :: Type -> Type) i1 i2 o r . Monad m => (i1 -> i2) -> (i2 -> Maybe i1) -> ConduitT i2 o m r -> ConduitT i1 o m r

   conduit	Data.Conduit

   Apply a function to all the input values of a ConduitT. Since 0.5.0

4. mapInputM :: Monad m => (i1 -> m i2) -> (i2 -> m (Maybe i1)) -> ConduitT i2 o m r -> ConduitT i1 o m r

   conduit	Data.Conduit

   Apply a monadic action to all the input values of a ConduitT. Since 1.3.2

5. 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

6. 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

7. 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]]
   

8. 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

9. 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

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

Page 77 of many | Previous | Next