log(log, "rebalance/shiftRight") ; promote1(left, this, idx-1) ; log(log, "rebalance/shiftLeft") ; promote1(right, this, idx+1) ; promote1(left, this, idx-1 ) ; if ( logging(log) ) log(log, "rebalance/merge/left: left=%d n=%d [%d]", left.getId(), node.getId(), idx - 1) ; promote1(right, this, idx+1 ) ;
log(log, "rebalance/shiftRight") ; promote1(left, this, idx-1) ; log(log, "rebalance/shiftLeft") ; promote1(right, this, idx+1) ; promote1(left, this, idx-1 ) ; if ( logging(log) ) log(log, "rebalance/merge/left: left=%d n=%d [%d]", left.getId(), node.getId(), idx - 1) ; promote1(right, this, idx+1 ) ;
promote1(sub, root, 0) ; BPTreeNode n = cast(sub) ;
promote1(sub, root, 0) ; BPTreeNode n = cast(sub) ;
y = apply(x) ; page = get(y) ; promote1(page, this, y) ; resetTrackPath(path, this, y, page) ; if ( BPT.CheckingNode ) {
y = apply(x) ; page = get(y) ; promote1(page, this, y) ; resetTrackPath(path, this, y, page) ; if ( BPT.CheckingNode ) {