class Priority::Heap::Node(K, V)

Overview

Node class used internally

Defined in:

priority-queue/heap.cr

Constructors

Instance Method Summary

Constructor Detail

def self.new(key : K, value : V) #

[View source]

Instance Method Detail

def child #

[View source]
def child=(child : Nil | Priority::Heap::Node(K, V)) #

[View source]
def degree #

[View source]
def degree=(degree : Int32) #

[View source]
def key #

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

[View source]
def left : Node(K, V) #

[View source]
def left=(left : Nil | Priority::Heap::Node(K, V)) #

[View source]
def marked #

[View source]
def marked=(marked : Bool) #

[View source]
def marked? #

[View source]
def parent #

[View source]
def parent=(parent : Nil | Priority::Heap::Node(K, V)) #

[View source]
def right : Node(K, V) #

[View source]
def right=(right : Nil | Priority::Heap::Node(K, V)) #

[View source]
def value #

[View source]
def value=(value : V) #

[View source]