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.


Properties

Versions1.0, 1.1
Dependenciesbase
LicenseBSD3
AuthorRalf Hinze
MaintainerScott E. Dillard <sedillard@gmail.com>
StabilityExperimental
CategoryData Structures
Upload dateTue Oct 14 15:48:21 UTC 2008
Uploaded byScottDillard
DistributionsDebian:1.1, FreeBSD:1.1, NixOS:1.1
Downloads967 total (151 in last 30 days)

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees