class

Heap(K, V)

Inherits Reference < Object

Constructors

new(comparator : K, K -> Bool = ->(x : K, y : K) do (x <=> y) == -1 end)
Source

Instance methods

<<(key : K)
Source
change_key(key : K, new_key : K)
Source
clear
Source
delete(key)
Source
delete_key(key)
Source
empty?
Source
has_key?(key)
Source
merge!(other_heap : Heap(K, V))
Source
next
Source
next_key
Source
push(key : K, value = key)
Source
size
Source

Nested types