heap: Heaps in Haskell
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 |
|---|---|
| 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 Wed Jul 5 12:12:27 UTC 2017 |
| Category | Data Structures |
| Source repo | head: git clone git://github.com/3of8/heap.git |
| Uploaded | by eberlm at Mon Feb 29 15:10:13 UTC 2016 |
| Distributions | LTSHaskell:1.0.4, NixOS:1.0.4, Stackage:1.0.4 |
| Downloads | 12572 total (264 in the last 30 days) |
| Rating | (no votes yet) [estimated by rule of succession] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |
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'.