PSQueue: Priority Search Queue

[ bsd3, data-structures, library ] [ Propose Tags ]

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

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

For package maintainers and hackage trustees

Candidates

Versions [RSS] 1.0, 1.1, 1.1.0.1, 1.1.1
Dependencies base (>=4 && <4.11) [details]
License BSD-3-Clause
Author Ralf Hinze
Maintainer Scott E. Dillard <sedillard@gmail.com>
Revised Revision 1 made by GeorgeWilson at 2018-03-31T13:26:53Z
Category Data Structures
Uploaded by ScottDillard at 2008-07-07T14:42:30Z
Distributions Debian:1.1.0.1, FreeBSD:1.1, NixOS:1.1.1, Stackage:1.1.1
Reverse Dependencies 15 direct, 3276 indirect [details]
Downloads 9712 total (35 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]