The pqueue package

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

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, 1.3.2.3
Dependencies base (>=4 && <4.4) [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 Tue Mar 30 18:53:13 UTC 2010 by LouisWasserman
Updated Thu May 28 06:23:00 UTC 2015 by AdamBergmark to revision 1   [What is this?]
Distributions LTSHaskell:1.3.2.3, NixOS:1.3.2.3, Stackage:1.3.2.3, Tumbleweed:1.3.2.2
Downloads 4487 total (75 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