The heap package

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.


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


Versions0.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.2, 1.0.3
Change logchanges
Dependenciesbase (>=3 && <5), QuickCheck (>=2.3 && <3) [details]
Copyright(c) 2008-2009, Stephan Friedrichs
AuthorStephan Friedrichs
MaintainerManuel Eberl (last name + m _at_
CategoryData Structures
Source repositoryhead: git clone git://
UploadedThu Jan 29 11:18:16 UTC 2015 by eberlm




testBuild a binary running test casesDisabledAutomatic

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


Maintainers' corner

For package maintainers and hackage trustees