Result for 06C6F16586501B793029DC28DC328612431F758F

Query result

Key Value
FileName./usr/lib64/ghc-7.4.2/enumerator-0.4.19/Data/Enumerator/IO.p_hi
FileSize2547
MD51F01E5D6F0C122985CFC7C32B0D78E71
SHA-106C6F16586501B793029DC28DC328612431F758F
SHA-25669C3F73443D195EFD20F155EF82A0B26847D1554D140A8EC0EB24E0D9C635F85
SSDEEP48:TMCV7MIdWx+64n96rWKHpO+ehvUKrqdwv/+lHibfHEhJbZt1LIF2s+az6Q5qPfGB:TNpdWxZ46evUKrU2+lHibfHEhJlt18Fl
TLSHT14B5175DE8DC4877CC898167AC0C6E7412320AB6AF847FBEB51DCA3027C878341F456A6
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