B-Trees
B-tree implementation in C++ to index documents based on numerical id's and title strings.
|
Provides information to deal with an insertion overflow. More...
Public Attributes | |
T | middle |
The value that, after splitting nodes, shall be used as the middle value and must be inserted in the parent node. More... | |
long | rightNode |
Offset of the node that'll have to be the pointer to the right of the OverflowResult::middle value. More... | |
Provides information to deal with an insertion overflow.
T BTree< T, M, BlockSize >::OverflowResult::middle |
The value that, after splitting nodes, shall be used as the middle value and must be inserted in the parent node.
long BTree< T, M, BlockSize >::OverflowResult::rightNode |
Offset of the node that'll have to be the pointer to the right of the OverflowResult::middle value.