Result for 0B01CE537A6799B3CB50B1354FD9B4D84F0B3F0D

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/powerpc64le-linux-ghc-8.0.1/enumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn/Data/Enumerator/Util.p_hi
FileSize5903
MD5C5409B7CA5AC8CEA7B9429DBC835A86E
SHA-10B01CE537A6799B3CB50B1354FD9B4D84F0B3F0D
SHA-256786F5C4CA6B9C60E8046214BD1EFDF0D7BE243522A33980C7A6CF4A85E176BF9
SSDEEP96:1dQcPH0JKbcenZ2/5vm3amUKDBqAi6ccDFhdvzJAmbzFx0vwITf:1XPUU7nfqmU/tGjbzfITf
TLSHT178C1246E9F84EA39D8651FB688B243417F70EF625753CB5712D46025DCD78E03E302A9
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
FileSize306380
MD55AF491D0920E33D15A1051EEFDCFF232
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-11FB4E374388118E88A547045B8C8FDFD8B766EC3
SHA-256CD67FC75F6A8D443E3AD1DA282EBBCD263928749C89CA7552D6572113A166350