Result for 395506C0715D623A8157E1A57622632ACFD0AA41

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-7.10.3/enumerator-0.4.20-DW14jhPkunT9F2YsGRve5H/Data/Enumerator/Text.p_hi
FileSize80556
MD5DB11AC4D2BA15BC9F06EFF8E95BF86D4
SHA-1395506C0715D623A8157E1A57622632ACFD0AA41
SHA-256075398230A1A37DE8EC5012BA04BDD8D94D9AE8475DE398BEFC7F9EFD21D6F49
SSDEEP1536:Zb84IzlM8JVGlYaWQD8Q6OuOtzN2N2OGfy7tOb3ngl9MZ07aPIikS:F8489tNQIikS
TLSHT1C0732425EF41E45BD4146DB9087627BA7B30A5DC2F91826B100D7A32ECD33D42EB99CE
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
FileSize194596
MD592B3D5C0441D9118EA1E6FE930AA9F10
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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-enumerator-prof
PackageSectionhaskell
PackageVersion0.4.20-4build1
SHA-13C9CF5EBDF1167F096BD491EAAE370662C9A815F
SHA-256AF173787893A9C33C511FFDE998DBD9FBA7DC7A63523CC5353AAAD9DFB8F38D0