Result for 22AC474FCF33E6B3E89F38C948D28380D3523254

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/aarch64-linux-ghc-8.0.1/enumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn/Data/Enumerator/Text.hi
FileSize77981
MD5677E3B8B9A9F9211B209A2A93E025AB3
SHA-122AC474FCF33E6B3E89F38C948D28380D3523254
SHA-2561D058DBACDA710D5D628668E6091B33339EDB5281392A2AE8130976B01E9DA76
SSDEEP768:P+u0+2aDzdCYM/HGYbE5YV1Jd4DsLg3CJOHL4WLw5v9z74zwiuxMQeB6cBLuu2Mu:P0xEoJ0doIQEvrgA0LU8Y0yk+Y
TLSHT1E1734375BF97D21AD4294B76E8B9431DBB31EEC107269F4310043035ECF66D82EB5A8A
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
FileSize287680
MD51EC89D2545AF899DC02FE715B6983EA4
PackageDescriptionhigh-performance left-fold enumerators 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. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNamelibghc-enumerator-dev
PackageSectionhaskell
PackageVersion0.4.20-6+b1
SHA-1FDC8E6977E43AAD84641AA7A91D812D11ED5B2BE
SHA-25682EE5736AAB1D89018DBA006FB2538A7F22F9AEF1CAC582409642E8075DFD1BD