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

• Priority::Heap::Node(K, V)
• Reference
• Object

Overview

Node class used internally

Defined in:

priority-queue/heap.cr

Constructors

• .new(key : K, value : V)

Instance Method Summary

• #child
• #child=(child : Nil | Priority::Heap::Node(K, V))
• #degree
• #degree=(degree : Int32)
• #key
• #key=(key : K)
• #left : Node(K, V)
• #left=(left : Nil | Priority::Heap::Node(K, V))
• #marked
• #marked=(marked : Bool)
• #marked?
• #parent
• #parent=(parent : Nil | Priority::Heap::Node(K, V))
• #right : Node(K, V)
• #right=(right : Nil | Priority::Heap::Node(K, V))
• #value
• #value=(value : V)

Constructor Detail

Instance Method Detail