@hackage / PSQueue

Priority Search Queue

Latest1.2.2

About

Metadata

  • Last updated , by teo
  • License BSD-3-Clause
  • Categories Data Structures

  • Maintained by: Teo Camarasu <teofilcamarasu@gmail.com>

  • Lottery factor: 2

Links

Installation

Tested Compilers

  1. 9.12.1
  2. 9.10.1
  3. 9.8.1
  4. 9.6.1
  5. 9.4.1
  6. 9.2.4
  7. 9.0.2
  8. 8.10.7
  9. 8.8.4

Readme

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.