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.

Versions [faq] 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.*) [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 Wed Jul 5 12:11:43 UTC 2017
Category Data Structures
Uploaded by StephanFriedrichs at Wed Jun 3 13:09:39 UTC 2009
Distributions LTSHaskell:1.0.4, NixOS:1.0.4, Stackage:1.0.4
Executables heap-tests
Downloads 13213 total (334 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Flags

NameDescriptionDefaultType
test

Build a binary running test cases

DisabledAutomatic

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