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

    classy-prelude-yesod ClassyPrelude.Yesod

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

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

    classy-prelude-yesod ClassyPrelude.Yesod

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

  3. mapAccumWhileMC :: Monad m => (a -> s -> m (Either s (s, b))) -> s -> ConduitT a b m s

    classy-prelude-yesod ClassyPrelude.Yesod

    Monadic mapAccumWhileC.

  4. mapC :: forall (m :: Type -> Type) a b . Monad m => (a -> b) -> ConduitT a b m ()

    classy-prelude-yesod ClassyPrelude.Yesod

    Apply a transformation to all values in a stream.

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

    classy-prelude-yesod ClassyPrelude.Yesod

    Apply a transformation to all elements in a chunked stream.

  6. mapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b)

    classy-prelude-yesod ClassyPrelude.Yesod

    Executes a Traversable container of items concurrently, it uses the Flat type internally.

  7. mapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m ()

    classy-prelude-yesod ClassyPrelude.Yesod

    Executes a Traversable container of items concurrently, it uses the Flat type internally. This function ignores the results.

  8. mapExceptionM :: (Exception e1, Exception e2, MonadUnliftIO m) => (e1 -> e2) -> m a -> m a

    classy-prelude-yesod ClassyPrelude.Yesod

    Same as mapException, except works in a monadic context.

  9. mapFromList :: IsMap map => [(ContainerKey map, MapValue map)] -> map

    classy-prelude-yesod ClassyPrelude.Yesod

    Convert a list of key-value pairs to a map

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

    classy-prelude-yesod ClassyPrelude.Yesod

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

Page 334 of many | Previous | Next