Result for 12952B3856252E6D91884E2456D96CE2FF654B39

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/Internal.p_hi
FileSize44779
MD5852FFE380D53897D0F131E90A22F8E3E
SHA-112952B3856252E6D91884E2456D96CE2FF654B39
SHA-25669645FA182302ECAC020F18F56A702B13F67BCFD750B606DC69AEBB0A9F4EF95
SSDEEP768:Rftq7xl0/ociiLHpBxP7ha4Q3AKkgOpQa+FyIZFfM2tfnAXsUA6VPx4o+Qp+vH0n:JHL9
TLSHT17A139085BF83D30AE9168A718E7DF74D7B28DB8416309B53805A6C38FD76EC81C3525A
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