Module tree Copy item path Source pub use crate::argument ::*;visit BPlusTree B plus tree implementation, with following considerations: Cursor Cursor points to a key value pair in the tree. Not like Iterator, it can move to next or prev.InnerNode Tree’s inner node, it contains a list of keys and a list of child node id
N is the maximum number of keys in a node
C is the maximum child node id in a node InnerNodeId IntoIter Iter A borrowed iterator for BPlusTree
Borrowed, means the underlying tree won’t change, so this is faster
compare to Cursor. LeafNode LeafNodeId NodeStoreVec Statistic Statistic data used to guide the perf tuning InnerMergeResult Merge result, returns the nodeid needs to drop LeafDeleteResult LeafUpsertResult NodeId Key Key trait
Clone is required since Inner Node may dup the key. NodeStore NodeStore is the node storage for tree, responsible for
define node types, manage node memory, and provide node access