Result for E5999F7EF8AF925B50450A3A02DB5C2853BFF7CF

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.0.1/enumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn/Data/Enumerator/Internal.p_hi
FileSize44779
MD5763EB949D40FE76C678C4B61B137121D
SHA-1E5999F7EF8AF925B50450A3A02DB5C2853BFF7CF
SHA-2564F90134931C1E464F2215BE247C7F94863C9DC7B7C3E93449AECFA048928DEB7
SSDEEP768:BxdnPlt9sTIAiKh31rV3nrQSm9r+4k/OLkW+Vws+n46jQ72T/aK6VRx4o+Qp+vHY:B6T7l
TLSHT10C138185BF83D30AE9168A718E7DF34D7B25DB8006319B57801A6C38FE76EC81D3525A
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
FileSize212028
MD5C410D357E11B400B85EDD47D20815CAA
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-1ABCB8F71DE95320564E79BB49D7D26BCA59389DE
SHA-2568348C353E6CA2ECFE87E3EB506D670A04E70079123BEC53FA753892CF640FBD0