class Heap(K, V)

Direct Known Subclasses

Defined in:

heap.cr

Constructors

Instance Method Summary

Constructor Detail

def self.new(comparator : K, K -> Bool = ->(x : K, y : K) do (x <=> y) == -1 end) #

[View source]

Instance Method Detail

def <<(key : K) #

[View source]
def change_key(key : K, new_key : K) #

[View source]
def clear #

[View source]
def delete(key) #

[View source]
def delete_key(key) #

[View source]
def empty? #

[View source]
def has_key?(key) #

[View source]
def merge!(other_heap : Heap(K, V)) #

[View source]
def next #

[View source]
def next_key #

[View source]
def pop #

[View source]
def push(key : K, value = key) #

[View source]
def size #

[View source]