heap: Heaps in Haskell
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.
Properties
| Versions | 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.1, 1.0.2, 1.0.3, 1.0.4 |
|---|---|
| Change log | changes |
| Dependencies | base (>=3 && <5), QuickCheck (>=2.3 && <3) [details] |
| License | BSD-3-Clause |
| Copyright | (c) 2008-2009, Stephan Friedrichs |
| Author | Stephan Friedrichs |
| Maintainer | Manuel Eberl (last name + m _at_ in.tum.de) |
| Category | Data Structures |
| Uploaded | by eberlm at 2014-11-27T14:23:55Z |
Modules
[Index]
- Data
Flags
Automatic Flags
| Name | Description | Default |
|---|---|---|
| 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
- heap-1.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees