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.

Properties

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)
License	BSD3
Author	Jim Apple
Maintainer	http://code.google.com/p/priority-queues/
Category	Data Structures
Home page	http://code.google.com/p/priority-queues/
Upload date	Sun May 23 00:37:07 UTC 2010
Uploaded by	JimApple
Built on	ghc-6.12

Modules

Data
- Data.MeldableHeap
  - Data.MeldableHeap.Lazy
  - Data.MeldableHeap.Strict

Downloads

meldable-heap-2.0.1.tar.gz (Cabal source package)
package description (included in the package)