pqueue: Reliable, persistent, fast priority queues.
A fast, reliable priority queue implementation based on a binomial heap.
Downloads
- pqueue-1.2.1.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
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
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.8), deepseq [details] |
License | BSD-3-Clause |
Author | Louis Wasserman |
Maintainer | Louis Wasserman <wasserman.louis@gmail.com> |
Revised | Revision 1 made by AdamBergmark at 2015-05-28T06:21:55Z |
Category | Data Structures |
Source repo | head: darcs get http://code.haskell.org/containers-pqueue/ |
Uploaded | by LouisWasserman at 2012-12-08T18:46:44Z |
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 | 23374 total (233 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] |