conduit-algorithms-0.0.2.0: Conduit-based algorithms

Copyright2013-2017 Luis Pedro Coelho
LicenseMIT
Maintainerluis@luispedro.org
Safe HaskellSafe
LanguageHaskell2010

Data.Conduit.Algorithms.Utils

Description

A few miscellaneous set of conduit utilities

Synopsis

Documentation

awaitJust :: Monad m => (a -> Conduit a m b) -> Conduit a m b Source #

This is a simple utility adapted from http://neilmitchell.blogspot.de/2015/07/thoughts-on-conduits.html

groupC :: Monad m => Int -> Conduit a m [a] Source #

groupC yields the input as groups of n elements. If the input is not a multiple of n, the last element will be incomplete