Filewatcher File Search File Search
Content Search
» » » » »


high-performance left-fold enumerators

This package provides a library for the Haskell programming language. See 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.

Package version:0.4.19-1+b1


haskell-enumerator (0.4.19-1+b1) sid; urgency=low

  * Binary-only non-maintainer upload for powerpc; no source changes.
  * Rebuild against new transformers/mtl

 -- powerpc Build Daemon (parry) <>  Fri, 25 May 2012 16:57:47 +0000

haskell-enumerator (0.4.19-1) unstable; urgency=low

  * New upstream version.
  * Bump to Standards-Version 3.9.3.

 -- Clint Ad


This package was debianized by Clint Adams <> on
Sun, 29 May 2011 16:04:27 -0000

It was downloaded from

Upstream Author:

    John Millikin <>


    2010 John Millikin


Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation

Browse inside libghc-enumerator-dev_0.4.19-1+b1_powerpc.deb

         [DIR]DEBIAN/ (2)  65535+ mirrors
         [DIR]usr/ (2)  65535+ mirrors
         [DIR]var/ (1)  56408+ mirrors

Download libghc-enumerator-dev_0.4.19-1+b1_powerpc.deb

Results 1 - 1 of 1
Help - FTP Sites List - Software Dir.
Search over 15 billion files
© 1997-2016