The PSQueue package
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.
|Maintainer||Scott E. Dillard <email@example.com>|
|Upload date||Tue Oct 14 15:48:21 UTC 2008|
|Built on||ghc-6.10, ghc-6.12, ghc-6.8, ghc-7.0, ghc-7.2, ghc-7.4|
|Distributions||NixOS: 1.1, Debian: 1.1, FreeBSD: 1.1|