PSQueue: Priority Search Queue

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

A priority search queue efficiently supports the operations 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.


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


  • No Candidates
Versions [RSS] 1.0, 1.1,, 1.1.1, 1.2.0
Change log
Dependencies base (>=4.3 && <4.21) [details]
License BSD-3-Clause
Author Ralf Hinze
Maintainer Teo Camarasu <>
Revised Revision 2 made by teo at 2024-05-25T15:00:27Z
Category Data Structures
Bug tracker
Source repo head: git clone
Uploaded by teo at 2023-05-17T09:16:26Z
Distributions Debian:, FreeBSD:1.1, LTSHaskell:1.2.0, NixOS:1.2.0, Stackage:1.2.0
Reverse Dependencies 15 direct, 3623 indirect [details]
Downloads 10379 total (31 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]