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

[ bsd3, data-structures, library ] [ Propose Tags ] [ Report a vulnerability ]

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.

Modules

[Index]

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

Downloads

meldable-heap-2.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

JimApple

For package maintainers and hackage trustees

edit package information

Candidates

No Candidates

Versions [RSS]	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	http://code.google.com/p/priority-queues/
Uploaded	by JimApple at 2010-05-13T03:05:08Z
Category	Data Structures
Home page	http://code.google.com/p/priority-queues/
Reverse Dependencies	1 direct, 0 indirect [details]
Downloads	7462 total (19 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs uploaded by user Build status unknown [no reports yet]