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.


Versions 1.0, 1.1
Dependencies base [details]
License BSD3
Author Ralf Hinze
Maintainer Scott E. Dillard <>
Category Data Structures
Uploaded Tue Oct 14 15:48:21 UTC 2008 by ScottDillard
Distributions Debian:1.1, FreeBSD:1.1, LTSHaskell:1.1, NixOS:1.1, Tumbleweed:1.1
Downloads 4723 total (138 in the last 30 days)
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees