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 [RSS] [faq] 1.0, 1.1,
Change log
Dependencies base (>=4.3 && <4.15) [details]
License BSD-3-Clause
Author Ralf Hinze
Maintainer Hackage Trustees <>
Revised Revision 2 made by HerbertValerioRiedel at 2020-05-24T21:13:31Z
Category Data Structures
Bug tracker
Source repo head: git clone
Uploaded by HerbertValerioRiedel at 2019-01-12T19:56:02Z
Distributions Debian:1.1, FreeBSD:1.1, NixOS:
Downloads 9254 total (56 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-01-12 [all 1 reports]


[Index] [Quick Jump]


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