The meldable-heap package

[Tags: bsd3, library]

A heap is a container supporting the insertion of elements and the extraction of the minimum element. This library additionally supports melding two heaps. This library models the implementation of asymptotically optimal purely functional heaps given by Brodal and Okasaki in their paper "Optimal Purely Functional Priority Queues". It has been proved correct using the Coq proof assistant.


Versions1.0, 1.1, 1.1.1, 1.1.2, 2.0, 2.0.1, 2.0.2, 2.0.3
Change logNone available
Dependenciesbase (>=3 && <5)
AuthorJim Apple
CategoryData Structures
Home page
UploadedSat May 1 20:41:18 UTC 2010 by JimApple
Downloads1040 total (54 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees