heap: Heaps in Haskell
A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
| 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 |
|---|---|
| Dependencies | base (>=3 && <5), QuickCheck (>=2 && <3) |
| License | BSD3 |
| Copyright | (c) 2008-2009, Stephan Friedrichs |
| Author | Stephan Friedrichs |
| Maintainer | Stephan Friedrichs (deduktionstheorem at web dot de) |
| Category | Data Structures |
| Executables | heap-tests |
| Upload date | Wed Jun 3 13:09:39 UTC 2009 |
| Uploaded by | StephanFriedrichs |
| Built on | ghc-6.10, ghc-6.12 |
| Distributions | Arch: 1.0.0 |
Modules
- Data
Downloads
- heap-1.0.0.tar.gz (Cabal source package)
- package description (included in the package)