pqueue: Reliable, persistent, fast priority queues.

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

A fast, reliable priority queue implementation based on a binomial heap.


[Skip to Readme]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

Versions [RSS] 1.0.0, 1.0.1, 1.1.0, 1.2.0, 1.2.1, 1.3.0, 1.3.1, 1.3.1.1, 1.3.2, 1.3.2.1, 1.3.2.2, 1.3.2.3, 1.4.1.1, 1.4.1.2, 1.4.1.3, 1.4.1.4, 1.4.2.0, 1.4.3.0
Change log CHANGELOG.md
Dependencies base (>=4.8 && <4.18), deepseq (>=1.3 && <1.5), indexed-traversable (>=0.1 && <0.2) [details]
License BSD-3-Clause
Author Louis Wasserman
Maintainer Lennart Spitzner <hexagoxel@hexagoxel.de>, Louis Wasserman <wasserman.louis@gmail.com>, konsumlamm <konsumlamm@gmail.com>, David Feuer <David.Feuer@gmail.com>
Category Data Structures
Home page https://github.com/lspitzner/pqueue
Bug tracker https://github.com/lspitzner/pqueue/issues
Source repo head: git clone https://github.com/lspitzner/pqueue.git
Uploaded by konsumlamm at 2022-10-30T16:10:55Z
Distributions Debian:1.4.1.3, LTSHaskell:1.4.3.0, NixOS:1.4.3.0, Stackage:1.4.3.0
Downloads 20435 total (174 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2022-10-30 [all 1 reports]

Readme for pqueue-1.4.3.0

[back to package description]

pqueue

A fast, reliable priority queue implementation based on a binomial heap.

For more information, see pqueue on Hackage.