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	88888
MD5	7F720BF61D4034AA650A80A55970E5B4
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	6EA0D16F31BEA4766AA2A6CF91A0CD7679A95C07
SHA-256	880ED7CE94ED0FBE235363514B2CA42B0622EADF444540B7F040005DC2831E7A

Key	Value
FileSize	77088
MD5	BDE4C4C00F10151915407C1AF1D9C5BB
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	164B7A2ECBEF393D2485D68930C708B3748710F9
SHA-256	B69D3331D1C07F0A309CD5E8CF3D80455C95EF59B27553DDF46E4E93E6396662

Key	Value
FileSize	228428
MD5	FE427E096EBB17082B2A0CDFB3C4D8DF
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	A11D2D881B02AA4048070E9E55F805D008668245
SHA-256	F60F889DC31A515CE5A1A23251B9C62A306103E83A3092A380035E66D0A3C554

Key	Value
FileSize	267252
MD5	D703E2355F341938AF9787315FCB150F
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	14F86BC4D458B6C00BE3D24EE531B5B5E87B6F5B
SHA-256	FB03C1572E34C1F73F428F8E261CFE29FCF7ABA3AB240D7DF0B5DA577D920389