|Maintainer||Nicolas Pouillard <email@example.com>|
|Values with their finalizer.
|finalized :: a|
|finalizer :: IO ()|
|Run a finalized computation.
|Lazy inputs internals
This the type lazy input data.
Note that the lazy input type (LI) is a member of Functor,
this means that one can update the contents of the input with
any pure function.
LI could be a strict monad and a strict applicative functor.
However it is not a lazy monad nor a lazy applicative functor as required Haskell.
Hopefully it is a lazy (pointed) functor at least.
|Build lazy input (LI) from an IO computation.
Use this function when the computation does not require a finalizer.
|Build lazy input (LI) from an IO computation and a finalizer.
|Update the underlying Finalized value.
|x `catchEOF` y performs x and if it fails due to the EOF error then performs y.
|Take a list and returns a new channel the list written in it.
|This function lazily returns an element strict list.
It is lazier than rnf and stricter than map (\x-> rnf x seq x).
|Produced by Haddock version 2.4.2|