Class BTree.Node
A node in the BTree.
class Node
;
A notable feature is that the values that are inserted are stored inside the BTree itself in the case of value data types, such as integers, floats, static arrays, or structs. In other cases, such as dynamic arrays and classes, on the reference is stored.
Fields
| Name | Type | Description |
|---|---|---|
_children
|
BTree | Only non-leaf (internal) nodes have children. |
_isLeaf
|
bool | A flag indicating whether the node is a leaf node or not. |
_numValues
|
size_t | A count of the number of values in the node. |
_parent
|
BTree | A reference to the node's parent. |
_position
|
size_t | The position of the node in the node's parent. |
Methods
| Name | Description |
|---|---|
findFirstGE
(v)
|
Recursively search for a given value and produce a result indicating whether a match was found and what it's value is. |
findFirstGT
(v)
|
Recursively search for a given value and produce a result indicating whether a match was found and what it's value is. |
getValue
(i)
|
Retrieves a values stored in this node. |
insertNonFull
(v)
|
Inserts a new value into the BTree, provided that this node is not already full. |
isFull
()
|
Indicates if the node has reached the size limit specified in NodeSizeV.
|
numValues
()
|
Indicates how many values are in this node. |
splitChild
(i)
|
Given that this node is non-full, but a child node that is, split the child node into two separate nodes that are half full, and insert a value into this node between them. |