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.

Versions 1.0, 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 Sat Mar 31 13:26:53 UTC 2018
Category Data Structures
Uploaded by ScottDillard at Mon Jul 7 14:42:30 UTC 2008
Distributions Debian:1.1, FreeBSD:1.1, LTSHaskell:1.1, NixOS:1.1, openSUSE:1.1
Downloads 5812 total (45 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

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

For package maintainers and hackage trustees