struct PF2d::ThreadedBinaryTree::Node(T)

• PF2d::ThreadedBinaryTree::Node(T)
• Struct
• Value
• Object

Overview

Using a struct avoids costly allocation and garbage collection

Defined in:

pf2d/threaded_binary_tree.cr

Constructors

• .new(value : T, left_index : UInt16 | Nil = nil, right_index : UInt16 | Nil = nil, thread_index : UInt16 | Nil = nil)

Instance Method Summary

• #insert(values : Enumerable(Node(T)), new_value : T, compare : T, T -> Int32, on_collision : T, T -> T | Nil = nil, at : UInt16 = 0, pred_index : UInt16 | Nil = nil)
• #left_index : UInt16 | Nil
• #left_index=(left_index : UInt16 | Nil)
• #leftmost(values : Enumerable(Node(T))) : Node(T)
• #next(values : Enumerable(Node(T))) : Node(T) | Nil
• #right_index : UInt16 | Nil
• #right_index=(right_index : UInt16 | Nil)
• #thread_index : UInt16 | Nil
• #thread_index=(thread_index : UInt16 | Nil)
• #value : T
• #value=(value : T)

Constructor Detail

Instance Method Detail