PSQueue: Priority Search Queue
A priority search queue efficiently supports the
operations 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.2.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 1.0, 1.1, 1.1.0.1, 1.1.1, 1.2.0 |
---|---|
Change log | ChangeLog.md |
Dependencies | base (>=4.3 && <4.19) [details] |
License | BSD-3-Clause |
Author | Ralf Hinze |
Maintainer | Teo Camarasu <teofilcamarasu@gmail.com> |
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 2023-05-17T09:16:26Z |
Distributions | Debian:1.1.0.1, FreeBSD:1.1, LTSHaskell:1.2.0, NixOS:1.2.0, Stackage:1.2.0 |
Reverse Dependencies | 15 direct, 3558 indirect [details] |
Downloads | 10008 total (32 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] |