bend-kit-collections

Search uses release 0.1.4.1 · 620 definitions

Releases (6)

law Deque.to_list.newLAW: a new deque reads as the empty list
law Deque.to_list.push_frontLAW: push_front puts the element at the head of the list
law Deque.pop_front.push_frontLAW: pop_front undoes push_front
law Deque.pop_back.push_backLAW: pop_back undoes push_back
law Deque.lemma.append_nil
law Deque.lemma.append_assoc
law Deque.to_list.from_listLAW: a list read into a deque reads back as itself
law Deque.lemma.reverse_goreversing onto an accumulator is reversing, then appending it
law Deque.to_list.push_backLAW: push_back puts the element at the end of the list

type Heap
def Heap.new
def Heap.size
def Heap.peek
def Heap.merge.goThe smaller root wins: its right child merges with the other heap and becomes the left, and its old left becomes the right (a skew heap's swap, which keeps merges short on average).
def Heap.merge
def Heap.push
def Heap.popthe top, and the heap without it; None on an empty heap
def Heap.from_list
def Heap.to_list.go
def Heap.to_listthe elements, smallest first
def Heap.sortheapsort
law Heap.pop.push_newLAW: popping what was pushed onto an empty heap gives it back
law Heap.size.pushLAW: a push adds one to the size