Fixed-capacity parallel arrays of keys/values (or child refs) for a tree node.
Declared in <llvm/ADT/IntervalMap.h>
template<
typename T1,
typename T2,
unsigned int N>
class NodeBase;
| Name | Description |
|---|---|
adjustFromLeftSib | adjustFromLeftSib - Adjust the number if elements in this node by moving elements to or from a left sibling node. |
copy | copy - Copy elements from another node. |
erase | erase overloads |
moveLeft | moveLeft - Move elements to the left. |
moveRight | moveRight - Move elements to the right. |
shift | shift - Shift elements [i;size) 1 position to the right.] |
transferToLeftSib | transferToLeftSib - Transfer elements to a left sibling node. |
transferToRightSib | transferToRightSib - Transfer elements to a right sibling node. |
| Name | Description |
|---|---|
first | Primary payload array (interval bounds or child NodeRefs). |
second | Secondary payload array (mapped values or stop keys). |
| Name | Description |
|---|---|
Capacity | Maximum number of elements stored in this node. |
| Name | Description |
|---|---|
BranchNode | Interior B+-tree node holding child NodeRefs and their stop keys. |
LeafNode | Leaf B+-tree node storing up to N coalesced key intervals and values. |