Priority Search Queue

Version on this page:1.1
LTS Haskell 11.22:1.1
Stackage Nightly 2018-03-12:1.1
Latest on Hackage:

See all snapshots PSQueue appears in

BSD-3-Clause licensed by Ralf Hinze
Maintained by Hackage Trustees

Module documentation for 1.1

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.


  • Maintenance release
  • Add support for base-
  • Fix link to ICFP paper
  • Modernise packaging
comments powered byDisqus