PSQueue

Priority Search Queue

Version on this page:1.2.0@rev:1
LTS Haskell 22.39:1.2.0@rev:2
Stackage Nightly 2024-10-31:1.2.0@rev:2
Latest on Hackage:1.2.0@rev:2

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.2.0@sha256:460457e5591ad4ec9d3332bb03798765fd1b79d4f6bcc3e9a71969cf7349d79e,1517

Module documentation for 1.2.0

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

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.

Changes

1.2.0

  • Fix typos (Thanks to @Moiman) #8
  • Improve performance, strictness, and remove redundant constraints (Thanks to @treeowl) #9
  • Support GHC-9.4 #6
  • Support GHC-9.6 #9

1.1.1

  • Teo Camarasu takes over as maintainer #1
  • Relax base bound to allow compatibility 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