Result for 87E11280BF3EC02446B1D1527745DC39D9DD74B0

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.0.1/enumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn/Data/Enumerator/Util.p_hi
FileSize5903
MD51ABC4F6FA3437258913E317DD5C6CBE0
SHA-187E11280BF3EC02446B1D1527745DC39D9DD74B0
SHA-256353A5A709E3CA067E4E90528432A25F2B31E0242A86FE134C56CCE5719D9F834
SSDEEP96:+Jj3PH0JKb8enZk/5v23G0U0DRqpizDVh0glzJAmbzFx0vwITf:+93PUUbnN20Uc4gdjbzfITf
TLSHT111C1542E9FD4EE39D8641B7688B28301BF70EF615B93CB5742D42125DCD78E42E302A9
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
FileSize279146
MD5B98C15C5475C1E541750C31359758558
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-1547257ABEBFFF426C2FB59EF32EC56BFD46EBCBA
SHA-256EC94E4B0A00D2F7A45241A7368725AEE1918DBA8E7AD81B8E5D871C1E7F6C51E