Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- tailC :: Monad m => Int -> ConduitT i i m ()
- sinkTail :: Monad m => Int -> ConduitT i o m (Seq i)
- takeCWhileStopEarly :: Monad m => (i -> Bool) -> Int -> ConduitT i i m (Int, Int)
- countProduction :: (Num n, MonadIO m) => (i -> Bool) -> IORef n -> ConduitT i i m ()
- withInputProductionCount :: MonadIO m => (i -> Bool) -> ConduitT i o m a -> ConduitT i o m (Int, a)
- withMessageLimit :: MonadIO m => (a -> Bool) -> Int -> Int -> ConduitT a a m () -> (Int -> ConduitT a a m ()) -> (Int -> ConduitT a a m ()) -> ConduitT a a m ()
Documentation
takeCWhileStopEarly :: Monad m => (i -> Bool) -> Int -> ConduitT i i m (Int, Int) Source #
Take at most n
items that satisfy the predicate, then stop consuming,
even if the next item does not match the predicate.
Return the number of counted messages and the total number of messages written.
withInputProductionCount :: MonadIO m => (i -> Bool) -> ConduitT i o m a -> ConduitT i o m (Int, a) Source #
:: MonadIO m | |
=> (a -> Bool) | |
-> Int | First limit |
-> Int | Max tail part limit |
-> ConduitT a a m () | What to do when truncatable output starts (waiting starts) |
-> (Int -> ConduitT a a m ()) | What to do before yielding a truncated tail |
-> (Int -> ConduitT a a m ()) | What to do after yielding a truncated tail |
-> ConduitT a a m () |