heap: Heaps in Haskell

[ bsd3, data-structures, library ] [ Propose Tags ]

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, 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)
Category Data Structures
Source repo head: git clone git://github.com/3of8/heap.git
Uploaded by eberlm at Wed Apr 11 15:14:59 UTC 2018
Distributions LTSHaskell:1.0.4, NixOS:1.0.4, Stackage:1.0.4
Downloads 10462 total (80 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-04-13 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees