hub / github.com/andylamp/BPlusTree / insertNonFull

Method insertNonFull

src/main/java/ds/bplus/bptree/BPlusTree.java:417–535 · view source on GitHub ↗

This function is inspired from the one given in CLRS for inserting a key to a B-Tree but as splitTreeNode has been (heavily) modified in order to be used in our B+ Tree. It supports handling duplicate keys (if enabled) as well. It is able to insert the (Key, Value) pairs using only one pass through

(TreeNode n, long key, String value, boolean unique)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

insertKeyMethod · 0.95

Calls 15

binSearchBlockMethod · 0.95

getOverflowPointerAtMethod · 0.95

createOverflowPageMethod · 0.95

readNodeMethod · 0.95

getNextPagePointerMethod · 0.95

pushToValueListMethod · 0.95

writeNodeMethod · 0.95

addToValueListMethod · 0.95

addToOverflowListMethod · 0.95

writeNodeMethod · 0.95

getPointerAtMethod · 0.95

splitTreeNodeMethod · 0.95

Tested by

no test coverage detected