Result for 3F1C1B2F1AF6422FD2088709D94246A4B65B31E7

Query result

Key Value
FileName./usr/share/doc/libghc-enumerator-doc/html/Data-Enumerator-Binary.html
FileSize104617
MD574A6D36B6E086FEDBFE29DCA2B603DBB
SHA-13F1C1B2F1AF6422FD2088709D94246A4B65B31E7
SHA-2566CDACF0A5378DD7FD4820CAA70C4C0F8846960B8AF34179EB4DD4F4FEE2EA185
SSDEEP768:ouMvRKynju7x8eaYGIeR8olNlcAYCsPGpJri8+F4d8hTyeOjh77fiZAcHz7fZJj/:oxR7E1wAyetH
TLSHT1D3A37A6063C3C2B897C09B4692C5A5AF370374F2C251DB14F19CDD17D68EBAC616BAA3
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
FileSize101486
MD59782A75CF57F1225CF31BB14DE8F9840
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.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNamelibghc-enumerator-doc
PackageSectiondoc
PackageVersion0.4.20-6
SHA-186B12ACCACE70F99338DA0D4D4B2638A17A452FC
SHA-256B35A4C700AD60E2105281BA00ACFE9646B76AC12225491895081CA99ACF255C2