Result for 1C88D042FB4AB15239EA7AA15775C1814DDBD781

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.0.2/enumerator-0.4.20-HUVdpxt1VegEbrHuKg3sQV/Data/Enumerator/Trans.hi
FileSize20638
MD55E54E94D973CE8BA4DBCFDFDB0578D5A
SHA-11C88D042FB4AB15239EA7AA15775C1814DDBD781
SHA-2569D07FC49B8F4DCAD26A68B75488C271C26461E88116BC368D90A9E84C6E43A43
SSDEEP384:tOsFGsVXjEiXln4J9xwJS2SXj0u+XlTL2Ghe9uGO/KGsP5GOeGGsXj9p4CXl1zal:tT1RCCkQkhuEhoOjrZ5pP5Ja
TLSHT1EE92F714BFA3C35AD6278E30887E530CBF21DBD106609F53A0463530EDB1BD9AD69A5E
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
FileSize205628
MD5A2753500DF35E832212064422ABBABA4
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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-enumerator-dev
PackageSectionhaskell
PackageVersion0.4.20-6build2
SHA-145D57AED5C180A33865DE307CBF0C6E42B05D3AE
SHA-256AE80905E1BC578BFA836D3282FFC1915068F00F2B878C0C84F346A94DDF6CE6D