Heap

Priority Queue

This module provides purely-functional priority queue based on leftist heap

Heap

class Heap<T>(ord : (T, T) -> O.Order)

put

func put(x : T)

peekMin

func peekMin() : ?T

deleteMin

func deleteMin()

fromList

func fromList(a : L.List<T>)