Result for 3819CB2D604570CA1CD7C2618F7FEBD32B38B56F

Query result

Key Value
FileName./usr/share/doc/libghc-enumerator-doc/changelog.Debian.gz
FileSize814
MD5C7CA55DD76E314F53DEA141C63A4CBF0
SHA-13819CB2D604570CA1CD7C2618F7FEBD32B38B56F
SHA-256D3E00C53ACD8CC21B8BDF600D35717B1CEA6B5D711D231EDCD9396D8C80E5987
SSDEEP24:XNdU+TrKeBDU5/BIo6AieAmrcWy0hat3X2lYOpaU:XvU+50/SReN1hatnvOpaU
TLSHT142018664FDBA122FDA490A34FC560328CC0DF0E7879C0807D01C0C29C92DA0C706A06F
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize87508
MD52B2695A77ABAEC2C835EC8D435B2E4EE
PackageDescriptionhigh-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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-enumerator-doc
PackageSectiondoc
PackageVersion0.4.20-4build1
SHA-17896A159BF10A32C65E02236895E39F2030069A7
SHA-256473FB9C2D414FE8678BF940CB139AB2C77A14B84DC1C72A304FC6956126AC302