Result for 7B3EE0BD355FBC27A97E0D1995485A4267DC9099

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.0.1/enumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn/Data/Enumerator/Binary.p_hi
FileSize62620
MD518D0BDEF83EF3E01855BD1C61A8ABAF9
SHA-17B3EE0BD355FBC27A97E0D1995485A4267DC9099
SHA-25614C46C2589EEDE1BF5723CF67E9AFEFAEDE4BE7CBDEC9D04E12A7692DAC4BD75
SSDEEP768:rA2VnpttdW6cGewUn2ojXZRUAT+N5Wn2zvGjLfz3D7Jcs8D5uQi27ZIwaLDIsqjh:cCmLy
TLSHT1CC53F311EF86D71AD936877584BA473E7732EDC56722CB9314083830AC7EAD42DB3689
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
FileSize275392
MD5E780A11476A75DE046F4C2E40FA9807E
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-185776B4872D2701B6DFCE2A5248F094EBA29BBBB
SHA-25671C33F9D4AA613D8E69B53061752A5982D7DF4D7BE637FBB0963235ABD9087E2