Result for 325749CC0A9A1B40070CCB05E767848CE2C3BE1C

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/aarch64-linux-ghc-8.0.1/enumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn/Data/Enumerator/Util.p_hi
FileSize5907
MD5A6F4381ACA9D7D108D69070B36FE11B9
SHA-1325749CC0A9A1B40070CCB05E767848CE2C3BE1C
SHA-256AEA71B8C87D3B70DD17D72F35FD8DCE29ABDC355FD8186FDC32C5B4833052D17
SSDEEP96:Z8WPso7QJKbMenZ2/9vCjGmUWDAki6cYDFdJ8zJAmbzFx0vwITf:ZBsokUrn3imULtnjbzfITf
TLSHT18DC1222E9FC4EA39D8641BB688B24341BF71EF621B93CB5711D46125DCD78E02E312A9
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
FileSize287446
MD55DB7581E69EF469CA878CF50810989B1
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-137D9517674BF48B5AF697333AB4924281FF6D14B
SHA-2562324C5B6A379A38F283D846DBC424F0D9CE68B560658BA8220C7D134E8A73555