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	217728
MD5	8C4EE0611D18A8C15C73D51A0975E014
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	F5AB710472A8260FEB12C0F307A6D71BCE78A317
SHA-256	2F31CCF7B66EE2159B2300AB8EB663FF4D66356E5DBA41C3EEF84AC3CF95E437

Key	Value
FileSize	281296
MD5	B0A8A6331FFDFC72B00120DFA0343376
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	4359566EAB1630F435F18221C27C126CD8B750DC
SHA-256	58B0ACDDA84377610FD189901EB4002AA8286B5FAEA036EFC8EFF2BE1AC15E99