pqueue: Reliable, persistent, fast priority queues.

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

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

Versions [faq] 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
Change log CHANGELOG.md
Dependencies base (>=4.8 && <4.14), deepseq (>=1.3 && <1.5) [details]
License BSD-3-Clause
Author Louis Wasserman
Maintainer Lennart Spitzner <hexagoxel@hexagoxel.de> Louis Wasserman <wasserman.louis@gmail.com>
Revised Revision 1 made by lspitzner at Thu Jun 6 13:18:11 UTC 2019
Category Data Structures
Bug tracker https://github.com/lspitzner/pqueue/issues
Source repo head: git clone git@github.com:lspitzner/pqueue.git
Uploaded by lspitzner at Wed Sep 26 21:18:39 UTC 2018
Distributions Debian:1.4.1.1, LTSHaskell:1.4.1.2, NixOS:1.4.1.2, Stackage:1.4.1.2
Downloads 10116 total (281 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

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

For package maintainers and hackage trustees