PSQueue: Priority Search Queue

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.

Modules

[Index]

Downloads

• PSQueue-1.0.tar.gz [browse] (Cabal source package)
• Package description (revised from the package)

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

• HerbertValerioRiedel, ScottDillard, teo

For package maintainers and hackage trustees

• edit package information

Candidates

• No Candidates