Parents (Total: 2)

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

Key	Value
FileSize	229860
MD5	96244045FEDCFDF0AC788ECAC7A53F33
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+b3
SHA-1	C54C53DD15B30A56987310782E600346E599F3D1
SHA-256	0EB779138A22C57BA8FB71EEE239E5DB393520A53D6BBBB38D7C6550E0D7F1E3

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