Name: meldable-heap
Version: 2.0.2
Synopsis: Asymptotically optimal, Coq-verified meldable heaps, AKA priority queues
Description: 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>
License: BSD3
License-file: LICENSE
Author: Jim Apple
Maintainer: http://code.google.com/p/priority-queues/
Build-Type: Simple
Cabal-Version: >=1.2
Homepage: http://code.google.com/p/priority-queues/
Category: Data Structures
data-files: CHANGELOG proofs/caseTactic.v proofs/Extract.v proofs/PQSig.v proofs/Bootstrap.v proofs/OrderSig.v proofs/Makefile

Library
  Exposed-modules: Data.MeldableHeap Data.MeldableHeap.Lazy Data.MeldableHeap.Strict
  Other-modules: Data.MeldableHeap.StrictBrodalOkasakiExtract Data.MeldableHeap.LazyBrodalOkasakiExtract
  Build-Depends: base >=3 && <5