pqueue: Reliable, persistent, fast priority queues.

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

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

Downloads

Maintainer's Corner

Package maintainers

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, 1.5.0.0
Change log CHANGELOG.md
Dependencies base (>=4 && <4.10), deepseq (>=1.3 && <1.5) [details]
License BSD-3-Clause
Author Louis Wasserman
Maintainer Lennart Spitzner <lsp@informatik.uni-kiel.de> Louis Wasserman <wasserman.louis@gmail.com>
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 2017-03-12T14:23:53Z
Distributions Debian:1.4.1.3, LTSHaskell:1.5.0.0, NixOS:1.5.0.0, Stackage:1.5.0.0
Reverse Dependencies 15 direct, 49 indirect [details]
Downloads 22351 total (166 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]