The meldable-heap package

[ Tags: bsd3, data-structures, library ] [ Propose Tags ]

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

Versions 1.0, 1.1, 1.1.1, 1.1.2, 2.0, 2.0.1, 2.0.2, 2.0.3
Change log CHANGELOG
Dependencies base (>=3 && <5) [details]
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/
Uploaded Sun May 23 01:16:26 UTC 2010 by JimApple
Distributions NixOS:2.0.3
Downloads 2171 total (190 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees