PSQueue

Priority Search Queue

Version on this page:1.1@rev:1
LTS Haskell 22.34:1.2.0@rev:2
Stackage Nightly 2024-09-14: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 Scott E. Dillard
This version can be pinned in stack with:PSQueue-1.1@sha256:188b45e7cca61d59df13a0a24eaa259b54eaedbafc639bef519e5f38d718fd3e,1036

Module documentation for 1.1

Depends on 1 package(full list with versions):
base
Used by 1 package in lts-2.22(full list with versions):
wreq

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.