BTree.Node

A node in the BTree.

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.

class BTree(ValueT, size_t NodeSizeV = 256, alias ValueLessF = "a < b")

static

class Node {

void splitChild(size_t i);

void insertNonFull(ValueT v);

size_t findFirstGEIndex(ValueT v);

size_t findFirstGTIndex(ValueT v);

bool isRoot();

bool isLeaf();

Node getChild(size_t i);

size_t numChildren();

ValueT[] getValues();

bool remove(ValueT v);

string toString();

size_t numValues();

inout(ValueT) getValue(size_t i);

Iterator findFirstGE(ValueT v);

Iterator findFirstGT(ValueT v);

}

Members

Functions

findFirstGE Iterator findFirstGE(ValueT v): Recursively search for a given value and produce a result indicating whether a match was found and what it's value is.
findFirstGEIndex size_t findFirstGEIndex(ValueT v): Undocumented in source. Be warned that the author may not have intended to support it.
findFirstGT Iterator findFirstGT(ValueT v): Recursively search for a given value and produce a result indicating whether a match was found and what it's value is.
findFirstGTIndex size_t findFirstGTIndex(ValueT v): Undocumented in source. Be warned that the author may not have intended to support it.
getChild Node getChild(size_t i): Undocumented in source.
getValue inout(ValueT) getValue(size_t i): Retrieves a values stored in this node.
getValues ValueT[] getValues(): Undocumented in source. Be warned that the author may not have intended to support it.
insertNonFull void insertNonFull(ValueT v): Inserts a new value into the BTree, provided that this node is not already full.
isFull bool isFull(): Indicates if the node has reached the size limit specified in NodeSizeV.
isLeaf bool isLeaf(): Undocumented in source. Be warned that the author may not have intended to support it.
isRoot bool isRoot(): Undocumented in source. Be warned that the author may not have intended to support it.
leftmost Node leftmost(): Undocumented in source. Be warned that the author may not have intended to support it.
numChildren size_t numChildren(): Undocumented in source. Be warned that the author may not have intended to support it.
numValues size_t numValues(): Indicates how many values are in this node.
remove bool remove(ValueT v): Undocumented in source. Be warned that the author may not have intended to support it.
rightmost Node rightmost(): Undocumented in source. Be warned that the author may not have intended to support it.
setChild void setChild(size_t i, Node child): Undocumented in source.
splitChild void splitChild(size_t 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.
toString string toString(): Undocumented in source. Be warned that the author may not have intended to support it.

Variables

_children Node[MAX_DEGREE] _children;: Only non-leaf (internal) nodes have children.
_isLeaf bool _isLeaf;: A flag indicating whether the node is a leaf node or not.
_numValues size_t _numValues;: A count of the number of values in the node.
_parent Node _parent;: A reference to the node's parent.
_position size_t _position;: The position of the node in the node's parent.
_values ValueT[MAX_DEGREE - 1] _values;: Undocumented in source.

BTree.Node

Members

Functions

Variables

Meta

Source