Result for 0CF9E04333BFBFA70788A1EED85A6F043FD64DAD

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.0.1/enumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn/Data/Enumerator.p_hi
FileSize35191
MD53E8F4A86FD37800006954598A43DDCE9
SHA-10CF9E04333BFBFA70788A1EED85A6F043FD64DAD
SHA-256462E23392D2CA8F42D32DB9A8C43BC83C862728FD2FD39580B20850AD7CD52A8
SSDEEP768:RG+/9y5zCL6MVkTbQldFP5U9zaKGsCbz8FU/ora/f:RbDdh5ln
TLSHT169F22765EF83C75EE43ACA7094B977087B30FAE41A20D75342583436AE3AED8DE32145
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
FileSize257224
MD53688CBA265194784384B26E710037AC1
PackageDescriptionhigh-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.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNamelibghc-enumerator-prof
PackageSectionhaskell
PackageVersion0.4.20-6+b1
SHA-14F48053CF73446EABA582A318D3738701EE8299E
SHA-256EAABFC0AA771A4D02E7433FFB68535A4A1EEC2268B31AC750CCCEBBF11862902