bplustree library

Classes

BPlusCell<K>
BPlusNode<K>
BPlusNodeAlgos
Algorithms to deal with BPlusNode
BPlusTree<K>
B Plus data structure
BPlusTreeAlgos
BPlusTreeLeafIterator<K>
LeftMostNode<K>
As leftMostChild do not have a parentCell, so this node is required for that. Extends BPlusNode,its special node for leftMostBPlusNode, it has a parentNode ref too
Node<K>
BPlusTree's node, which contains cells [...]
Splited<K>
TreeNodeCutSection<K>

Properties

id ↔ int
read / write

Enums

CASE_AFTER_OPERATION
RSB = right sibling [...]
MERGE_CASE
Node_order
ST Stands for Smaller than and GT stands for greater than
SPLIT_CASE
LMC stands for : LEFT_MOST_CHILD

Typedefs

ChangeNodeFunction<K>(BPlusNode<K> startNode, Compare<K> compare) → bool