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	90824
MD5	5DB203D24D730C9F7B1FF9528FD083C9
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	964AC12F9BC7AFEC605DDCB0ECB7715548A0B744
SHA-256	CB8C5483A3A3C7381E28CDAF5B2F0A88A0D2F853680F7087C1E4E8EC8F4E8D58

Key	Value
FileSize	221916
MD5	35C95A6FB5340993F13C230B2D75440F
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	0AAEFB202911604762CE1C5E46A2FB2424B280A3
SHA-256	4A722689AA2544E856A41C36AC467941B61F81AAEB8FC9B074044B675055CD7A

Key	Value
FileSize	79112
MD5	317F22135F6F6B1BCB9D242DD6555FF7
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	D69227EB4DDB254B4C499850138BC58193886E03
SHA-256	280C4237FC2509F0207B9FEECCE7369C4146E2DA05803B8FC605AC491C6787ED

Key	Value
FileSize	254984
MD5	54FB742E51245B0178041BDA5FE0A3B0
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	8BEDA97355D2FF93F7BC2FE64C8A5DCA1758AB73
SHA-256	D632330B2186903BFAB396AE7303225B5D22E671EA7D3EA5577DDCB0C181E952