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

Index

empty 
1 (Function)Data.MeldableHeap.Strict
2 (Function)Data.MeldableHeap.Lazy
3 (Function)Data.MeldableHeap
extractMin 
1 (Function)Data.MeldableHeap.Strict
2 (Function)Data.MeldableHeap.Lazy
3 (Function)Data.MeldableHeap
findMin 
1 (Function)Data.MeldableHeap.Strict
2 (Function)Data.MeldableHeap.Lazy
3 (Function)Data.MeldableHeap
insert 
1 (Function)Data.MeldableHeap.Strict
2 (Function)Data.MeldableHeap.Lazy
3 (Function)Data.MeldableHeap
meld 
1 (Function)Data.MeldableHeap.Strict
2 (Function)Data.MeldableHeap.Lazy
3 (Function)Data.MeldableHeap
PQ 
1 (Type/Class)Data.MeldableHeap.Strict
2 (Type/Class)Data.MeldableHeap.Lazy
3 (Type/Class)Data.MeldableHeap
toList 
1 (Function)Data.MeldableHeap.Strict
2 (Function)Data.MeldableHeap.Lazy
3 (Function)Data.MeldableHeap