Result for 43F923C18D48E54C5EAA8B7044DF1C70532CF4B3

Query result

Key Value
FileName./usr/share/doc/libghc-enumerator-doc/html/Data-Enumerator-Internal.html
FileSize46383
MD557801E28346A21BB8F0E2410BD8C7815
SHA-143F923C18D48E54C5EAA8B7044DF1C70532CF4B3
SHA-2568BBC1A69A1FD08ED735A005D8CF16767FFA4E52728B4B27105D2409965F1229B
SSDEEP768:cnypR0cJqqSiBlO2MfIIy9Xqwt4mmqK4p0Wl+gsC8DjfAX9U4KvZo4a:c6R0QGNQ6QffT9+a
TLSHT1BC23AEA263CB677A4381638ED2C5F27E764314F6D1518D0871BCDB83ED8AF20511BA9B
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
FileSize88558
MD5341BC0727A34E6D33B1EF982C204CEF2
PackageDescriptionhigh-performance left-fold enumerators; documentation 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 the documentation for 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-doc
PackageSectiondoc
PackageVersion0.4.20-6build2
SHA-184B927FEA9B0B9C54F2D8AB3B4A121EB59BFC36C
SHA-25658300AD12247E2E6630A38FD7762C7EA2D029D1025D8426F37AA322A33EF38FE