haskell-psqueues 0.2.0.3-1 source package in Ubuntu
Changelog
haskell-psqueues (0.2.0.3-1) unstable; urgency=medium * New upstream release -- Clint Adams <email address hidden> Fri, 04 Dec 2015 00:23:48 -0500
Upload details
- Uploaded by:
- Debian Haskell Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-psqueues_0.2.0.3-1.dsc | 2.4 KiB | ba41cb5ecf25211f4d89fb0082d016cd072d7d8f79a89599857b22e00a904cfa |
| haskell-psqueues_0.2.0.3-1.debian.tar.xz | 2.7 KiB | 572e44f4c334ad0c3d7ed7ecfcaaae9d6e5971f6a0aa55085c745c8f73f0a289 |
| haskell-psqueues_0.2.0.3.orig.tar.gz | 23.2 KiB | ac8a60de9979f80948d0becfb35cdafe7e1fdfce062c0468e4e2abced9a85c69 |
No changes file available.
Binary packages built by this source
- libghc-psqueues-dev: 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.
- libghc-psqueues-doc: Pure priority search queues; documentation
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 the documentation for a library for the Haskell
programming language.
See http://www.haskell. org/ for more information on Haskell.
- libghc-psqueues-prof: 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.
