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	220044
MD5	33080C5F6026ED018AA5CCC71E02A4AF
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	C163A6BE23B47A8847279881F49F71306F755D2A
SHA-256	9E7B5837A968417DC0D08FDFB400C3DBAA827B2EB308397384AE03EB3C2356E7

Key	Value
FileSize	86532
MD5	C01173E60B1DA97AFFB58E8684B0131E
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	237C2D53652B333C926FA982A73FF4315674D74E
SHA-256	86BDA56EAF341F885C437E0B3DEFF84FAF4875FAC4FF86E451F4831D8FCD95DB

Key	Value
FileSize	248408
MD5	039B624D0F59EA9C58D4A5D834CF1214
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	55C7669F43FD0A8E1642DD11D017F08C8CC2321B
SHA-256	C8F5372EF3648A69638B51EC9E73C4185EF640A1DCF340A44331AC519AE32E86

Key	Value
FileSize	98516
MD5	A4A9E5389F11BB76DB8064CBF9DF68AA
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	9EC973FAFAFB91F07640013E6A7E6261CC999C20
SHA-256	38034CB5BC5834B0EA7707549A643A0FCBD6B39C4EC170F3E79D1145AB2177DB