PSQueue

Priority Search Queue

Version on this page:1.1.1@rev:1
LTS Haskell 24.28:1.2.2@rev:1
Stackage Nightly 2026-01-16:1.2.2@rev:1
Latest on Hackage:1.2.2@rev:1

See all snapshots PSQueue appears in

BSD-3-Clause licensed by Ralf Hinze
Maintained by Teo Camarasu
This version can be pinned in stack with:PSQueue-1.1.1@sha256:6a047401f39a437c6cf4f866fb9b8f4b53b465bc12ae78c91e5026a653794509,1500

Module documentation for 1.1.1

Depends on 1 package(full list with versions):
base

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.

Changes

1.1.1

  • Teo Camarasu takes over as maintainer #1
  • Relax base bound to allow compatiblity with GHC-9.0 and GHC-9.2 #2
  • Add test suite and basic Github Actions CI #3

1.1.0.1

  • Maintenance release
  • Add support for base-4.11.0.0
  • Fix link to ICFP paper
  • Modernise packaging