meldable-heap: Asymptotically optimal, Coq-verified meldable heaps, AKA priority queues

[ 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.

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]
License BSD-3-Clause
Author Jim Apple
Maintainer priority-queue-hackage@jbapple.com
Category Data Structures
Home page http://code.google.com/p/priority-queues/
Uploaded by JimApple at Fri Apr 9 16:56:38 UTC 2010
Distributions NixOS:2.0.3
Downloads 3047 total (76 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