haskell-enumerator 0.4.14-1build1 source package in Ubuntu

Changelog

haskell-enumerator (0.4.14-1build1) precise; urgency=low

  * No-change rebuild
 -- Iain Lane <email address hidden>   Wed, 14 Dec 2011 12:08:23 +0000

Upload details

Uploaded by:
Iain Lane
Uploaded to:
Precise
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
haskell-enumerator_0.4.14.orig.tar.gz 29.0 KiB 2d6486f51ce444ff384077c16f91adac9a1d98434987d8431c59046f4ece7b19
haskell-enumerator_0.4.14-1build1.debian.tar.gz 2.8 KiB 1241f85267fab5b0e80061b184b9a0deb87e3fb983060a62dcd040f61d031841
haskell-enumerator_0.4.14-1build1.dsc 2.4 KiB 2fcd85a107ab2c68fc2ddd1f5062136f4539c6aca88a21354a96bf6251d7b82b

View changes file

Binary packages built by this source

libghc-enumerator-dev: high-performance left-fold enumerators

 This package provides a library for the Haskell programming language.
 See http://www.haskell.org/ for more information on Haskell.
 .
 Typical buffer–based incremental I/O is based around a single loop,
 which reads data from some source (such as a socket or file),
 transforms it, and generates one or more outputs (such as a line
 count, HTTP responses, or modified file). Although efficient and
 safe, these loops are all single–purpose; it is difficult or
 impossible to compose buffer–based processing loops.
 .
 Haskell's concept of "lazy I/O" allows pure code to operate on data
 from an external source. However, lazy I/O has several shortcomings.
 Most notably, resources such as memory and file handles can be
 retained for arbitrarily long periods of time, causing unpredictable
 performance and error conditions.
 .
 Enumerators are an efficient, predictable, and safe alternative to
 lazy I/O. Discovered by Oleg Kiselyov, they allow large datasets to
 be processed in near–constant space by pure code. Although somewhat
 more complex to write, using enumerators instead of lazy I/O
 produces more correct programs.
 .
 This library contains an enumerator implementation for Haskell,
 designed to be both simple and efficient. Three core types are
 defined, along with numerous helper functions:
 .
 Iteratee: Data sinks, analogous to left folds. Iteratees consume
 a sequence of input values, and generate a single output value. Many
 iteratees are designed to perform side effects (such as printing to
 stdout), so they can also be used as monad transformers.
 .
 Enumerator: Data sources, which generate input sequences. Typical
 enumerators read from a file handle, socket, random number generator,
 or other external stream. To operate, enumerators are passed an
 iteratee, and provide that iteratee with input until either the
 iteratee has completed its computation, or EOF.
 .
 Enumeratee: Data transformers, which operate as both enumerators
 and iteratees. Enumeratees read from an outer enumerator, and
 provide the transformed data to an inner iteratee.

libghc-enumerator-doc: high-performance left-fold enumerators; documentation

 This package provides the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-enumerator-prof: high-performance left-fold enumerators; profiling libraries

 This package provides a library for the Haskell programming language,
 compiled for profiling.
 See http://www.haskell.org/ for more information on Haskell.