|
System.IO.Lazy.Input.Internals | Portability | | Stability | provisional | Maintainer | Nicolas Pouillard <nicolas.pouillard@gmail.com> |
|
|
|
|
|
Description |
|
|
Synopsis |
|
|
|
|
Finalized values
|
|
|
Values with their finalizer.
| Constructors | Finally | | finalized :: a | | finalizer :: IO () | |
|
| Instances | |
|
|
|
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.
| Constructors | | Instances | |
|
|
|
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.
|
|
Misc
|
|
|
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 |