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. The proofs are included in the Cabal package.

A description of the differences between versions of this package is available at http://priority-queues.googlecode.com/hg/brodal-okasaki/cabal/CHANGELOG.


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
Maintainerhttp://code.google.com/p/priority-queues/
CategoryData Structures
Home pagehttp://code.google.com/p/priority-queues/
UploadedSun May 23 22:38:44 UTC 2010 by JimApple
Downloads732 total (46 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