haskell-enumerator 0.4.20-10 source package in Ubuntu

Changelog

haskell-enumerator (0.4.20-10) unstable; urgency=medium

  * Patch to build with ghc-8.4

 -- Dmitry Bogatov <email address hidden>  Fri, 05 Oct 2018 00:56:15 +0000

Upload details

Uploaded by:
Debian Haskell Group on 2018-10-05
Uploaded to:
Sid
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Disco release on 2018-12-20 universe haskell

Downloads

File Size SHA-256 Checksum
haskell-enumerator_0.4.20-10.dsc 2.3 KiB bb613ff5f9d7d946b6154eedbf93c91c4ed7c7555e78c644dc521b85ee4de633
haskell-enumerator_0.4.20.orig.tar.gz 52.7 KiB 33e21054352bb579e8db8697256ff3c61b3dc862c567f9e0fc2509f95e2b4709
haskell-enumerator_0.4.20-10.debian.tar.xz 3.9 KiB 7a621a834afe4fe808e8010c8dad48224faa2d1afcdf94ae80cb0005a4d05fc9

Available diffs

No changes file available.

Binary packages built by this source

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

 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.
 .
 This package provides a library for the Haskell programming language.
 See http://www.haskell.org/ for more information on Haskell.

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

 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.
 .
 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

 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.
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.