Priority Search Queue

LTS Haskell 8.12:1.1
Stackage Nightly 2017-02-11:1.1
Latest on Hackage:1.1
BSD3 licensed by Ralf Hinze
Maintained by Scott E. Dillard

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.

comments powered byDisqus