pqueue: Reliable, persistent, fast priority queues.
A fast, reliable priority queue implementation based on a binomial heap.
Downloads
- pqueue-1.3.1.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
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, 1.5.0.0 |
|---|---|
| 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 2016-05-21T16:04:02Z |
| Distributions | Debian:1.4.1.3, LTSHaskell:1.5.0.0, NixOS:1.5.0.0, Stackage:1.5.0.0 |
| Reverse Dependencies | 17 direct, 48 indirect [details] |
| Downloads | 23253 total (203 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] |