pqueue: Reliable, persistent, fast priority queues.

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

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

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, 1.3.2.3, 1.4.1.1
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 Thu May 28 06:22:54 UTC 2015
Category Data Structures
Source repo head: darcs get http://code.haskell.org/containers-pqueue/
Uploaded by LouisWasserman at Fri Apr 2 19:57:53 UTC 2010
Distributions LTSHaskell:1.4.1.1, NixOS:1.4.1.1, Stackage:1.4.1.1, openSUSE:1.4.1.1
Downloads 6677 total (54 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

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

For package maintainers and hackage trustees