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	86640
MD5	A65F977574EF62E2030C7339A849EF08
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	3BDB3F98745CA381F2B0B9748ECA9B9B4F9267F2
SHA-256	B37447D150E1A71DB0832D1CF2441A80C0F016A56A0000EC9EFCBC65A53D0C5D

Key	Value
FileSize	96188
MD5	CFB16046312103A59EF1E97DFD987372
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	B0301ECCEBB771B72404CD64B4BAFB8C511CF373
SHA-256	9F12293AA0EC90C380B7632C7AAD33480A540DB963A32B2268DB6C551CB352B9

Key	Value
FileSize	236716
MD5	5072A280042CD0D4C9A8CA07D6C8E561
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	B6E18024FF753A9AB9BDA08C22027A209014B237
SHA-256	783E030E18AF4CFB0D16FDF2C9D94D7C0502201EE4271EB98D2F84F780C3ECAA

Key	Value
FileSize	220328
MD5	C965331D5CEFC06565C5C25ADB4B701C
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	B704C4158B57E1FDB418B9D92553223600BD857C
SHA-256	94A518C1B88AD3530B5905D6986E7FD26E8A03BCA9D0E1D1744F6C41BD95BD75