The PSQueue package

[Tags: bsd3, library]

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.


Versions1.0, 1.1
Change logNone available
Dependenciesbase [details]
AuthorRalf Hinze
MaintainerScott E. Dillard <>
CategoryData Structures
UploadedTue Oct 14 15:48:21 UTC 2008 by ScottDillard
DistributionsDebian:1.1, FreeBSD:1.1, LTSHaskell:1.1, NixOS:1.1, Stackage:1.1
Downloads4492 total (3 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees