Result for BE0DF748E1578C1E722230234540B46D866DB796

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.0.1/enumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn/libHSenumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn_p.a
FileSize2059870
MD562B7F717CDB0FE73B311CAAED8FC6520
SHA-1BE0DF748E1578C1E722230234540B46D866DB796
SHA-256BBB23C31A9FA74C66EFFFA55E967C53C7687D7A81AD0E203AD7ABD36A2384325
SSDEEP12288:3TwSijIFPxuvjqu1lF2ey2fJswBfXA9HG5ggIGZY61k5I1+0Ukq40GlxZyLLQVEz:QRBG9DuS6YpR4R46RZqnE4/qR9A8T
TLSHT10695D659D7D04F03C9EC6278F25BEF302319CEE5C383974A4008927A7F663D62E695A9
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
FileSize310982
MD547DF9A68B976845CBF6B56736AB830F7
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-1E6CE0B1E0D00AF565396517D84CD681C118995DE
SHA-2563F3B72ADD9F7851EF4C2D8710CEA7CC052014002AD09C6E3B7153BB0849FFB98