fingertree-psqueue: Implementation of priority search queues as finger trees.
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.
|Versions||0.1, 0.2, 0.3|
|Dependencies||base (<=4), fingertree [details]|
|Copyright||(c) 2009 Cale Gibbard|
|Uploaded||by CaleGibbard at Mon May 24 13:12:31 UTC 2010|
|Distributions||LTSHaskell:0.3, NixOS:0.3, openSUSE:0.3|
|Downloads||1886 total (11 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
For package maintainers and hackage trustees