Heaps in Haskell

Latest on Hackage:1.0.4

See all snapshots heap appears in

BSD-3-Clause licensed by Stephan Friedrichs
Maintained by Manuel Eberl (last name + m _at_ in.tum.de)

Module documentation for 1.0.3

This version can be pinned in stack with:[email protected]:3f27bd7f3cfc7445993bf003e6e46f4cffcc756921146f4052de97deae285686,1551

A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.

Depends on 1 package(full list with versions):
Used by 2 packages in lts-7.24(full list with versions):