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.


Properties

Versions1.0, 1.1, 1.1.1, 1.1.2, 2.0, 2.0.1, 2.0.2, 2.0.3
Dependenciesbase (>=3 && <5)
LicenseBSD3
AuthorJim Apple
Maintainerpriority-queue-hackage@jbapple.com
CategoryData Structures
Home pagehttp://code.google.com/p/priority-queues/
UploadedSat Apr 10 23:18:22 UTC 2010 by JimApple
Downloads721 total (54 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees