PSQueue: Priority Search Queue

[ bsd3, data-structures, library ] [ Propose Tags ]

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.

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

Versions [RSS] 1.0, 1.1, 1.1.0.1, 1.1.1
Change log ChangeLog.md
Dependencies base (>=4.3 && <4.17) [details]
License BSD-3-Clause
Author Ralf Hinze
Maintainer Teo Camarasu <teofilcamarasu@gmail.com>
Category Data Structures
Bug tracker https://github.com/TeofilC/PSQueue/issues
Source repo head: git clone https://github.com/TeofilC/PSQueue.git
Uploaded by teo at 2022-04-13T08:48:11Z
Distributions Debian:1.1.0.1, FreeBSD:1.1, NixOS:1.1.1
Downloads 9522 total (37 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]