heap: Heaps in Haskell
A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
Downloads
- heap-1.0.3.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
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 |
|---|---|
| Change log | changes |
| Dependencies | base (>=4.6 && <5) [details] |
| License | BSD-3-Clause |
| Copyright | (c) 2008-2009, Stephan Friedrichs |
| Author | Stephan Friedrichs |
| Maintainer | Manuel Eberl (last name + m _at_ in.tum.de) |
| Revised | Revision 1 made by HerbertValerioRiedel at 2017-07-05T12:12:27Z |
| Category | Data Structures |
| Source repo | head: git clone git://github.com/3of8/heap.git |
| Uploaded | by eberlm at 2016-02-29T15:10:13Z |
| Distributions | LTSHaskell:1.0.4, NixOS:1.0.4, Stackage:1.0.4 |
| Reverse Dependencies | 12 direct, 7 indirect [details] |
| Downloads | 22029 total (77 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] |