Data.Conduit.Algorithms

Simple algorithms packaged as Conduits

Documentation

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

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

See uniqueOnC

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

Merge a list of sorted sources

See mergeC2

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

Take two sorted sources and merge them.

See mergeC