Result for 53D7F8AE57D521CC32E0C68054615AB809E89028

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.0.1/enumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn/Data/Enumerator.p_hi
FileSize35199
MD5B85AF9C557A7E82A17C18A063CC213CD
SHA-153D7F8AE57D521CC32E0C68054615AB809E89028
SHA-2560E980EE4516FEAFF8691A6FBF08F42A3A65FE1604430816568DD2D9444ECE436
SSDEEP768:2OsHpxUnpn3CQQKTeV0A7z2jlXi3QU/ora/f:2Jn
TLSHT11EF22465EF82C74EE436CA7090B977587B30FAE42B10D74342593432AE3AEDC9E76149
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
FileSize298830
MD50699E4CBC2E6F5935DDDF2F1770265B5
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-1F894B6C24EF6E2FB1F9C00BB479B7066F41159B7
SHA-2566179382F69B28ED7B5B62464110ECB5ED4CF12CF57ECBD6B68B59CF4C7138E28