pqueue: Reliable, persistent, fast priority queues.

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

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

Downloads

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

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
Dependencies base (>=4 && <4.6), 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:34Z
Category Data Structures
Source repo head: darcs get http://code.haskell.org/containers-pqueue/
Uploaded by LouisWasserman at 2012-03-08T20:39:51Z
Distributions Debian:1.4.1.3, LTSHaskell:1.4.3.0, NixOS:1.4.3.0, Stackage:1.4.3.0
Reverse Dependencies 15 direct, 49 indirect [details]
Downloads 21295 total (114 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]