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.2

This version can be pinned in stack with:[email protected]:a837ec802519f02491019c938a015177031ce0ed01724a1bfb517891eeaa1332,1744

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

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