Copyright	2013-2017 Luis Pedro Coelho
License	MIT
Maintainer	luis@luispedro.org
Safe Haskell	None
Language	Haskell2010

Data.Conduit.Algorithms

Description

Simple algorithms packaged as Conduits

Synopsis

Documentation

uniqueOnC :: (Ord b, Monad m) => (a -> b) -> Conduit a m a Source #

Unique conduit.

Note that this conduit **does not** assume that the input is sorted. Instead it uses a Set to store previously seen elements. Thus, memory usage is O(N).

uniqueC :: (Ord a, Monad m) => Conduit a m a Source #

See uniqueOnC

mergeC :: (Ord a, Monad m) => [Source m a] -> Source m a Source #

Merge a list of sorted sources

See mergeC2

mergeC2 :: (Ord a, Monad m) => Source m a -> Source m a -> Source m a Source #

Take two sorted sources and merge them.

See mergeC