Result for 83FEF17905E9E859F9B070C51F378E2E07C00E2F

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.0.1/enumerator-0.4.20-K8vNbK1y7M61lUuHqoKMzn/Data/Enumerator/Util.p_hi
FileSize5907
MD53BFF317A730F6DA79653CD246DBDC96B
SHA-183FEF17905E9E859F9B070C51F378E2E07C00E2F
SHA-256A4FD27E0D39F0A5E3693D1D65279CBC9FE33D1DFAA92667B5AB4B8809357809A
SSDEEP96:w8W5Oo7QJKbMenZ2/9vCjGmUWDAki6cYDFdlzJAmbzFx0vwITf:wDOokUrn3imULtmjbzfITf
TLSHT1CDC1232E9FC4EB39D8651BB588B243417F70EE625A53CBA751D42125CCD78E03E31269
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
FileSize318020
MD585F91BD450C8BDBD5A7418F0CB21C59C
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-1C3B401A36BDDF172CD5AC147D723EE99D4C9C293
SHA-2569E231A8535DBFCB6DEBA51FCF78DB29A8834FC2037B2D0961777ADC5628076DB