PSQueue: Priority Search Queue

[ bsd3, data-structures, library ] [ Propose Tags ] [ Report a vulnerability ]

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.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 1.0, 1.1, 1.1.0.1, 1.1.1, 1.2.0, 1.2.1
Change log ChangeLog.md
Dependencies base (>=4.3 && <4.22) [details]
Tested with ghc ==8.8.4 || ==8.10.7 || ==9.0.2 || ==9.2.4 || ==9.4.1 || ==9.6.1 || ==9.8.1 || ==9.10.1 || ==9.12.1
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 2025-01-27T14:00:36Z
Distributions Debian:1.1.0.1, FreeBSD:1.1, LTSHaskell:1.2.1, NixOS:1.2.0, Stackage:1.2.1
Reverse Dependencies 15 direct, 3676 indirect [details]
Downloads 10637 total (53 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]