/** Find the next page to look at as we walk down the tree */ private final BPTreePage findHere(AccessPath path, Record rec) { int idx = findSlot(rec) ; idx = apply(idx) ; // Find index, or insertion point (immediate higher slot) as (-i-1) // A key is the highest element of the records up to this point // so we search down at slot idx (between something smaller and // something larger). BPTreePage page = get(idx) ; trackPath(path, this, idx, page) ; return page ; }
/** Find the next page to look at as we walk down the tree */ private final BPTreePage findHere(AccessPath path, Record rec) { int idx = findSlot(rec) ; idx = apply(idx) ; // Find index, or insertion point (immediate higher slot) as (-i-1) // A key is the highest element of the records up to this point // so we search down at slot idx (between something smaller and // something larger). BPTreePage page = get(idx) ; trackPath(path, this, idx, page) ; return page ; }