PSQueue: Priority Search Queue
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.
Downloads
- PSQueue-1.1.1.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 1.0, 1.1, 1.1.0.1, 1.1.1 |
|---|---|
| Change log | ChangeLog.md |
| Dependencies | base (>=4.3 && <4.18) [details] |
| License | BSD-3-Clause |
| Author | Ralf Hinze |
| Maintainer | Teo Camarasu <teofilcamarasu@gmail.com> |
| Revised | Revision 1 made by teo at 2022-08-23T20:44:23Z |
| Category | Data Structures |
| Bug tracker | https://github.com/TeofilC/PSQueue/issues |
| Source repo | head: git clone https://github.com/TeofilC/PSQueue.git |
| Uploaded | by teo at 2022-04-13T08:48:11Z |
| Distributions | Debian:1.1.0.1, FreeBSD:1.1, NixOS:1.1.1, Stackage:1.1.1 |
| Reverse Dependencies | 15 direct, 3303 indirect [details] |
| Downloads | 9764 total (31 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |