The meldable-heap package
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.
|Versions||1.0, 1.1, 1.1.1, 1.1.2, 2.0, 2.0.1, 2.0.2, 2.0.3|
|Dependencies||base (>=3 && <5) [details]|
|Uploaded||Sun May 23 22:38:44 UTC 2010 by JimApple|
|Downloads||1402 total (43 in last 30 days)|
|Status||Docs uploaded by user|
Build status unknown [no reports yet]
- meldable-heap-2.0.3.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees