fingertree-psqueue: Implementation of priority search queues as finger trees.
[ bsd3, data-structures, library ] [ Propose Tags ]
An implementation of priority search queues: a datastructure holding key/priority bindings having fast operations both for extracting the element with minimum priority and for modifying and looking up elements by key.
- fingertree-psqueue-0.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
For package maintainers and hackage trustees
- No Candidates
|Versions [RSS]||0.1, 0.2, 0.3|
|Dependencies||base (<6), fingertree [details]|
|Copyright||(c) 2009 Cale Gibbard|
|Uploaded||by CaleGibbard at 2011-09-28T06:06:07Z|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||3573 total (12 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]