Result for 2CFFCC8E218085C1D36EA6F4EBD1D3B3C8231200

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.0.1/enumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn/Data/Enumerator/Internal.p_hi
FileSize44775
MD528D93574965A3B7573E51BDCFB920492
SHA-12CFFCC8E218085C1D36EA6F4EBD1D3B3C8231200
SHA-2563CA3A33C2C93F1AED67A934AD9602F14A881175B791FBBE69B9309E424B2C301
SSDEEP768:/10OOBdfoNwyPoNbFHTjPFcCCVLkCelH+ArOEiT0wm/Sk94smVRx4o+Qp+vH0We:Isl
TLSHT1A1137E85BF83D30AE9168A748E7DF74D7B29DB8006309B53415A6C38FD76EC82C3525A
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