pqueue: Reliable, persistent, fast priority queues.
A fast, reliable priority queue implementation based on a binomial heap.
| Versions [RSS] [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, 1.4.1.3 |
|---|---|
| Dependencies | base (>=4 && <4.4), 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:22:54Z |
| Category | Data Structures |
| Source repo | head: darcs get http://code.haskell.org/containers-pqueue/ |
| Uploaded | by LouisWasserman at 2010-04-02T19:57:53Z |
| Distributions | Debian:1.4.1.1, LTSHaskell:1.4.1.3, NixOS:1.4.1.3 |
| Downloads | 17233 total (247 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] |
Downloads
- pqueue-1.1.0.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'.