The pqueue package
A fast, reliable priority queue implementation based on a binomial heap.
Properties
| Versions | 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 |
|---|---|
| Dependencies | base (>=4 && <4.4), deepseq [details] |
| License | BSD3 |
| Author | Louis Wasserman |
| Maintainer | Louis Wasserman <wasserman.louis@gmail.com> |
| Category | Data Structures |
| Source repository | head: darcs get http://code.haskell.org/containers-pqueue/ |
| Uploaded | Fri Apr 2 19:57:53 UTC 2010 by LouisWasserman |
| Updated | Thu May 28 06:22:54 UTC 2015 by AdamBergmark to revision 1 |
| Distributions | LTSHaskell:1.3.2.2, NixOS:1.3.2.2, Stackage:1.3.2.2, Tumbleweed:1.3.2.2 |
| Downloads | 4033 total (122 in the last 30 days) |
| Votes | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |
Downloads
- pqueue-1.1.0.tar.gz [browse] (Cabal source package)
- Package description (included in the package)