Priority Search Queue

Latest on Hackage:[email protected]:2

See all snapshots PSQueue appears in

BSD-3-Clause licensed by Ralf Hinze
Maintained by Scott E. Dillard

Module documentation for 1.1

This version can be pinned in stack with:[email protected]:b1e1e9e15296602c432a12ccc036b423850c3c6749eb0956441c583502d74ab0,983

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.

Depends on 1 package(full list with versions):