Result for 41B439D0DDDC49B81FF4827F946989DCA8B3E65F

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.0.2/enumerator-0.4.20-HUVdpxt1VegEbrHuKg3sQV/Data/Enumerator.p_hi
FileSize35186
MD5C394EC626CD02DB426370E6A42A3D787
SHA-141B439D0DDDC49B81FF4827F946989DCA8B3E65F
SHA-2568928628FF77053B3D080E3ACC7968A6E1D03D72781C57D614056BDC2AF3DAA2E
SSDEEP768:eujt8Jjw8sc4s8LXRUzv0zJMq78AW+/ora/f:eu7n
TLSHT1A1F21665EF83C71EE436CAB194B963487B30FAF41A10D74382952436EE3AED8DE72145
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
FileSize213182
MD5CD80DA605992149B43F6F446FB9A6597
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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-enumerator-prof
PackageSectionhaskell
PackageVersion0.4.20-6build2
SHA-10044F33ADEE6A50B2B49225F89323A8BE3620E0A
SHA-2565B09225B2432B45A1BECDFC5CECF2A9DC74A8A6600FE103610E18D14CF878EC7