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]


Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


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.2,,,,,,,,,,
Change log CHANGELOG.md
Dependencies base (>=4.8 && <4.21), deepseq (>=1.3 && <1.6), 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>
Revised Revision 2 made by AndreasAbel at 2024-05-17T09:13:13Z
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 2023-08-07T22:17:22Z
Distributions Debian:, LTSHaskell:, NixOS:, Stackage:
Reverse Dependencies 16 direct, 49 indirect [details]
Downloads 22746 total (129 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2023-08-08 [all 1 reports]

Readme for pqueue-

[back to package description]


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

For more information, see pqueue on Hackage.