The PSQueue package
A priority search queue efficiently supports the opperations of both a search tree and a priority queue. A Binding is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time.
Properties
| Versions | 1.0, 1.1 |
|---|---|
| Dependencies | base |
| License | BSD3 |
| Author | Ralf Hinze |
| Maintainer | Scott E. Dillard <sedillard@gmail.com> |
| Stability | Experimental |
| Category | Data Structures |
| Upload date | Mon Jul 7 14:42:30 UTC 2008 |
| Uploaded by | ScottDillard |
| Built on | ghc-6.10, ghc-6.12, ghc-6.8 |
| Distributions | NixOS: 1.1, Debian: 1.1, FreeBSD: 1.1 |
Modules
- Data
Downloads
- PSQueue-1.0.tar.gz (Cabal source package)
- package description (included in the package)