heap: Heaps in Haskell

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

A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.

Modules

[Index]

Flags

Automatic Flags
NameDescriptionDefault
test

Build a binary running test cases

Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

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

Candidates

Versions [RSS] 0.1, 0.1.1, 0.2, 0.2.1, 0.2.2, 0.2.3, 0.3, 0.3.1, 0.4.0, 0.5.0, 0.6.0, 1.0.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4
Dependencies base (>=3 && <4.8), QuickCheck (>=2 && <3) [details]
License BSD-3-Clause
Copyright (c) 2008-2009, Stephan Friedrichs
Author Stephan Friedrichs
Maintainer Stephan Friedrichs (deduktionstheorem at web dot de)
Revised Revision 1 made by HerbertValerioRiedel at 2017-07-05T12:11:43Z
Category Data Structures
Uploaded by StephanFriedrichs at 2009-06-03T13:09:39Z
Distributions LTSHaskell:1.0.4, NixOS:1.0.4, Stackage:1.0.4
Executables heap-tests
Downloads 20666 total (59 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]