Parents (Total: 4)

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

Key	Value
FileSize	200240
MD5	A722833FFB9F87B74BDEBF63924F5CCF
PackageDescription	Pure priority search queues This package provides Priority Search Queues in three different flavors. . * OrdPSQ k p v, which uses the Ord k instance to provide fast insertion, deletion and lookup. This implementation is based on Ralf Hinze's "A Simple Implementation Technique for Priority Search Queues". Hence, it is similar to the PSQueue library, although it is considerably faster and provides a slightly different API. . * IntPSQ p v is a far more efficient implementation. It fixes the key type to Int and uses a radix tree (like IntMap) with an additional min-heap property. . * HashPSQ k p v is a fairly straightforward extension of IntPSQ: it simply uses the keys' hashes as indices in the IntPSQ. If there are any hash collisions, it uses an OrdPSQ to resolve those. The performance of this implementation is comparable to that of IntPSQ, but it is more widely applicable since the keys are not restricted to Int, but rather to any Hashable datatype. . Each of the three implementations provides the same API, so they can be used interchangeably. . Typical applications of Priority Search Queues include: . * Caches, and more specifically LRU Caches; . * Schedulers; . * Pathfinding algorithms, such as Dijkstra's and A*. . This package provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-psqueues-dev
PackageSection	haskell
PackageVersion	0.2.7.0-2+b2
SHA-1	0304D28E2400034AFE1CB6C6D6255FFED92AF341
SHA-256	60E60545BBA056A1833F877566E055D8B18E7F94EFADF7DC6F4E8A6DB9626515

Key	Value
FileSize	85732
MD5	FA318944270DB886100F4DB3024155F6
PackageDescription	memory-efficient representation of Unicode text strings This Haskell library provides the 'ShortText' type which is suitable for keeping many short strings in memory. This is similiar to the relationship between 'ShortByteString' and 'ByteString'. . The main differences between 'Text' and 'ShortText' is that 'ShortText' uses UTF-8 instead of UTF-16 internally and 'ShortText' doesn't support zero-copy slicing (thereby saving 2 words). Consequently, the memory footprint of a (boxed) 'ShortText' value is 4 words (2 words when unboxed) plus the length of the UTF-8 encoded payload. . This package provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-text-short-dev
PackageSection	haskell
PackageVersion	0.1.2-4+b2
SHA-1	513207DC762D4BA8E682BB4569911890248EB0D3
SHA-256	74639245A9BB7F96BB936243F1B89083406DCCBAABCC6410C600CC88EE5D283C

Key	Value
FileSize	180176
MD5	10B23E49B8A254898059710893423D7C
PackageDescription	Pure priority search queues; profiling libraries This package provides Priority Search Queues in three different flavors. . * OrdPSQ k p v, which uses the Ord k instance to provide fast insertion, deletion and lookup. This implementation is based on Ralf Hinze's "A Simple Implementation Technique for Priority Search Queues". Hence, it is similar to the PSQueue library, although it is considerably faster and provides a slightly different API. . * IntPSQ p v is a far more efficient implementation. It fixes the key type to Int and uses a radix tree (like IntMap) with an additional min-heap property. . * HashPSQ k p v is a fairly straightforward extension of IntPSQ: it simply uses the keys' hashes as indices in the IntPSQ. If there are any hash collisions, it uses an OrdPSQ to resolve those. The performance of this implementation is comparable to that of IntPSQ, but it is more widely applicable since the keys are not restricted to Int, but rather to any Hashable datatype. . Each of the three implementations provides the same API, so they can be used interchangeably. . Typical applications of Priority Search Queues include: . * Caches, and more specifically LRU Caches; . * Schedulers; . * Pathfinding algorithms, such as Dijkstra's and A*. . This package provides a library for the Haskell programming language, compiled for profiling. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-psqueues-prof
PackageSection	haskell
PackageVersion	0.2.7.0-2+b2
SHA-1	1DFBA97C1F0C2437A314DE58EDDDCF6331E04F34
SHA-256	85F6368BEE0FA7DAAC1222F03A578DE532C00EFA7EF522E57AFE8365D8ED7202

Key	Value
FileSize	74048
MD5	57245A85902C72569B6282084D254B54
PackageDescription	memory-efficient representation of Unicode text strings; profiling libraries This Haskell library provides the 'ShortText' type which is suitable for keeping many short strings in memory. This is similiar to the relationship between 'ShortByteString' and 'ByteString'. . The main differences between 'Text' and 'ShortText' is that 'ShortText' uses UTF-8 instead of UTF-16 internally and 'ShortText' doesn't support zero-copy slicing (thereby saving 2 words). Consequently, the memory footprint of a (boxed) 'ShortText' value is 4 words (2 words when unboxed) plus the length of the UTF-8 encoded payload. . This package provides a library for the Haskell programming language, compiled for profiling. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-text-short-prof
PackageSection	haskell
PackageVersion	0.1.2-4+b2
SHA-1	510F908D9BEA20315C727EEA814EC3D76891C75A
SHA-256	729A7813747E79F11139AF20C9A9806DCEA0A3236C05841DEC49A8DA0F2A2DFE