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.

Versions 1.0, 1.1, 1.1.0.1
Change log ChangeLog.md
Dependencies base (>=4.3 && <4.13) [details]
License BSD-3-Clause
Author Ralf Hinze
Maintainer Hackage Trustees <trustees@hackage.haskell.org>
Category Data Structures
Bug tracker https://github.com/hackage-trustees/PSQueue/issues
Source repo head: git clone https://github.com/hackage-trustees/PSQueue.git
Uploaded by HerbertValerioRiedel at Sat Jan 12 19:56:02 UTC 2019
Distributions Debian:1.1, FreeBSD:1.1, NixOS:1.1.0.1
Downloads 6195 total (89 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-01-12 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees