Portability  portable 

Maintainer  jmillikin@gmail.com 
An implementation of Oleg Kiselyov’s leftfold enumerators
 data Stream a
 data Step a m b
 newtype Iteratee a m b = Iteratee {
 runIteratee :: m (Step a m b)
 type Enumerator a m b = Step a m b > Iteratee a m b
 type Enumeratee aOut aIn m b = Step aIn m b > Iteratee aOut m (Step aIn m b)
 returnI :: Monad m => Step a m b > Iteratee a m b
 yield :: Monad m => b > Stream a > Iteratee a m b
 continue :: Monad m => (Stream a > Iteratee a m b) > Iteratee a m b
 throwError :: (Monad m, Exception e) => e > Iteratee a m b
 catchError :: Monad m => Iteratee a m b > (SomeException > Iteratee a m b) > Iteratee a m b
 liftI :: Monad m => (Stream a > Step a m b) > Iteratee a m b
 (>>==) :: Monad m => Iteratee a m b > (Step a m b > Iteratee a' m b') > Iteratee a' m b'
 (==<<) :: Monad m => (Step a m b > Iteratee a' m b') > Iteratee a m b > Iteratee a' m b'
 ($$) :: Monad m => (Step a m b > Iteratee a' m b') > Iteratee a m b > Iteratee a' m b'
 (>==>) :: Monad m => Enumerator a m b > (Step a m b > Iteratee a' m b') > Step a m b > Iteratee a' m b'
 (<==<) :: Monad m => (Step a m b > Iteratee a' m b') > Enumerator a m b > Step a m b > Iteratee a' m b'
 run :: Monad m => Iteratee a m b > m (Either SomeException b)
 run_ :: Monad m => Iteratee a m b > m b
 consume :: Monad m => Iteratee a m [a]
 isEOF :: Monad m => Iteratee a m Bool
 liftTrans :: (Monad m, MonadTrans t, Monad (t m)) => Iteratee a m b > Iteratee a (t m) b
 liftFoldL :: Monad m => (b > a > b) > b > Iteratee a m b
 liftFoldL' :: Monad m => (b > a > b) > b > Iteratee a m b
 liftFoldM :: Monad m => (b > a > m b) > b > Iteratee a m b
 printChunks :: (MonadIO m, Show a) => Bool > Iteratee a m ()
 enumEOF :: Monad m => Enumerator a m b
 enumList :: Monad m => Integer > [a] > Enumerator a m b
 concatEnums :: Monad m => [Enumerator a m b] > Enumerator a m b
 checkDone :: Monad m => ((Stream a > Iteratee a m b) > Iteratee a' m (Step a m b)) > Enumeratee a' a m b
 map :: Monad m => (ao > ai) > Enumeratee ao ai m b
 sequence :: Monad m => Iteratee ao m ai > Enumeratee ao ai m b
 joinI :: Monad m => Iteratee a m (Step a' m b) > Iteratee a m b
 head :: Monad m => Iteratee a m (Maybe a)
 peek :: Monad m => Iteratee a m (Maybe a)
 last :: Monad m => Iteratee a m (Maybe a)
 length :: Monad m => Iteratee a m Integer
 drop :: Monad m => Integer > Iteratee a m ()
 dropWhile :: Monad m => (a > Bool) > Iteratee a m ()
 span :: Monad m => (a > Bool) > Iteratee a m [a]
 break :: Monad m => (a > Bool) > Iteratee a m [a]
Types
Not to be confused with types from the Stream
or
streamfusion
packages, a Stream
is a sequence of chunks
generated by an Enumerator
. In contrast to Oleg’s implementation,
this stream does not support error handling  errors encountered
while generating a stream are reported in the Step
type instead.
(Chunks [])
is used to indicate that a stream is still active, but
currently has no available data. Iteratees should ignore empty chunks.
Continue (Stream a > Iteratee a m b)  The 
Yield b (Stream a)  The 
Error SomeException  The 
The primary data type for this library, which consumes
input from a Stream
until it either generates a value or encounters
an error. Rather than requiring all input at once, an iteratee will
return Continue
when it is capable of processing more data.
In general, iteratees begin in the Continue
state. As each chunk is
passed to the continuation, the iteratee returns the next step:
Continue
for more data, Yield
when it's finished, or Error
to
abort processing.
Iteratee  

MonadTrans (Iteratee a)  
Monad m => Monad (Iteratee a m)  
Monad m => Functor (Iteratee a m)  
Monad m => Applicative (Iteratee a m)  
MonadCatchIO m => MonadCatchIO (Iteratee a m)  
MonadIO m => MonadIO (Iteratee a m) 
type Enumerator a m b = Step a m b > Iteratee a m bSource
While Iteratee
s consume data, enumerators generate it. Since
is an alias for Iteratee
m (
, Step
a m b)Enumerator
s can
be considered step transformers of type
.
Step
a m b > m (Step
a m b)
Enumerator
s typically read from an external source (parser, handle,
random generator, etc). They feed chunks into an Iteratee
until the
source runs out of data (triggering EOF
) or the iteratee finishes
processing (Yield
s a value).
type Enumeratee aOut aIn m b = Step aIn m b > Iteratee aOut m (Step aIn m b)Source
In cases where an enumerator acts as both a source and sink, the resulting
type is named an Enumeratee
. Enumeratees have two input types,
“outer a” (aOut
) and “inner a” (aIn
).
Primitives
Combinators
These are common patterns which occur whenever iteratees are being defined.
continue :: Monad m => (Stream a > Iteratee a m b) > Iteratee a m bSource
continue k = returnI (Continue k)
throwError :: (Monad m, Exception e) => e > Iteratee a m bSource
throwError err = returnI (Error err)
catchError :: Monad m => Iteratee a m b > (SomeException > Iteratee a m b) > Iteratee a m bSource
liftI :: Monad m => (Stream a > Step a m b) > Iteratee a m bSource
liftI f = continue (returnI . f)
(>>==) :: Monad m => Iteratee a m b > (Step a m b > Iteratee a' m b') > Iteratee a' m b'Source
Equivalent to (>>=), but allows Iteratee
s with different input types
to be composed.
(==<<) :: Monad m => (Step a m b > Iteratee a' m b') > Iteratee a m b > Iteratee a' m b'Source
(==<<) = flip (>>==)
($$) :: Monad m => (Step a m b > Iteratee a' m b') > Iteratee a m b > Iteratee a' m b'Source
($$) = (==<<)
This might be easier to read when passing a chain of iteratees to an enumerator.
(>==>) :: Monad m => Enumerator a m b > (Step a m b > Iteratee a' m b') > Step a m b > Iteratee a' m b'Source
(>==>) e1 e2 s = e1 s >>== e2
(<==<) :: Monad m => (Step a m b > Iteratee a' m b') > Enumerator a m b > Step a m b > Iteratee a' m b'Source
(<==<) = flip (>==>)
Iteratees
run :: Monad m => Iteratee a m b > m (Either SomeException b)Source
Run an iteratee until it finishes, and return either the final value (if it succeeded) or the error (if it failed).
consume :: Monad m => Iteratee a m [a]Source
Consume all input until EOF
, then return consumed input as a list.
liftFoldL :: Monad m => (b > a > b) > b > Iteratee a m bSource
Lifts a pure left fold into an iteratee.
liftFoldL' :: Monad m => (b > a > b) > b > Iteratee a m bSource
As liftFoldL
, but strict in its accumulator.
liftFoldM :: Monad m => (b > a > m b) > b > Iteratee a m bSource
Lifts a monadic left fold into an iteratee.
printChunks :: (MonadIO m, Show a) => Bool > Iteratee a m ()Source
Print chunks as they're received from the enumerator, optionally printing empty chunks.
Enumerators
enumEOF :: Monad m => Enumerator a m bSource
enumList :: Monad m => Integer > [a] > Enumerator a m bSource
Another small, useful enumerator separates an input list into chunks, and sends them to the iteratee. This is useful for testing iteratees in pure code.
concatEnums :: Monad m => [Enumerator a m b] > Enumerator a m bSource
Compose a list of Enumerator
s using '(>>==)'
Enumeratees
checkDone :: Monad m => ((Stream a > Iteratee a m b) > Iteratee a' m (Step a m b)) > Enumeratee a' a m bSource
A common pattern in Enumeratee
implementations is to check whether
the inner Iteratee
has finished, and if so, to return its output.
checkDone
passes its parameter a continuation if the Iteratee
can still consume input, or yields otherwise.
map :: Monad m => (ao > ai) > Enumeratee ao ai m bSource
sequence :: Monad m => Iteratee ao m ai > Enumeratee ao ai m bSource
joinI :: Monad m => Iteratee a m (Step a' m b) > Iteratee a m bSource
joinI
is used to “flatten” Enumeratee
s into an
Iteratee
.
Parser combinators
Oleg’s original IterateeM.hs
includes some basic iteratees
for parsing, so this section ports them to the new interface. However,
in practice most parsing will be performed with enumeratorbased
interfaces to existing parser libraries (such as Parsec or Attoparsec).