Result for 0D3748437261DDFADF8436EECFBEBA61A812FE83

Query result

Key Value
FileName./usr/lib64/ghc-7.4.2/enumerator-0.4.19/Data/Enumerator/Internal.p_hi
FileSize36066
MD5B4A9274752C434BF901A889725E0AA72
SHA-10D3748437261DDFADF8436EECFBEBA61A812FE83
SHA-2562D7ECACF8EB6D2EF9668BDD3794138A89A70A49E5F7C360FB4995C49CA8B4AA3
SSDEEP384:T7dN7OqcCTo7IVgSFcM64GnT/F+gQhVmZC9iM2RT2gz8K+N6kDU+YIvgNcKSit3g:TTc+gxRpBzZ+N6kKU9kvXQp1GNsbYI
TLSHT1E9F2378A8D059725EC160A37C497DB482FE4D34B6961C27FE4CA7F1EBE172EB0C15A06
hashlookup:parent-total2
hashlookup:trust60

Network graph view

Parents (Total: 2)

The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD5047BAE5102F607703827669A5ECD28AD
PackageArchs390x
PackageDescriptionEnumerators 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 contains the development files.
PackageMaintainerFedora Project
PackageNameghc-enumerator-devel
PackageRelease5.fc19
PackageVersion0.4.19
SHA-14F74FE55963D0B361C491200B483AC595AE98B45
SHA-2562A41A955E5D756D4F4D28A56EA9907CAF4A3B9172FCCBC6DCE056E9A3EFBA37E
Key Value
MD53270DD96359290C2A2CAC524B7E0BB64
PackageArchppc64
PackageDescriptionEnumerators 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 contains the development files.
PackageMaintainerFedora Project
PackageNameghc-enumerator-devel
PackageRelease5.fc19
PackageVersion0.4.19
SHA-158768C9430F23AC4630FA5C67C2E5D177A432FC2
SHA-256F2F28E9F63CD1F5F10C09B37BE7DA0C8E8AF9B0B3170063710CDEB224B0745AA