int delta = isLeaf() & !forwards ? -1 : 0; this.position = delta -1 -find; return false;
int delta = isLeaf() & !forwards ? -1 : 0; this.position = delta -1 -find; return false;
int delta = isLeaf() & !forwards ? -1 : 0; this.position = delta -1 -find; return false;
int delta = isLeaf() & !forwards ? -1 : 0; this.position = delta -1 -find; return false;
NodeCursor<K> descendToFirstChild(boolean forwards) { if (isLeaf()) { position = forwards ? 0 : getLeafKeyEnd(node) - 1; return null; } inChild = true; position = forwards ? 0 : getChildCount(node) - 1; return descend(); }
NodeCursor<K> descendToFirstChild(boolean forwards) { if (isLeaf()) { position = forwards ? 0 : getLeafKeyEnd(node) - 1; return null; } inChild = true; position = forwards ? 0 : getChildCount(node) - 1; return descend(); }
NodeCursor<K> descendToFirstChild(boolean forwards) { if (isLeaf()) { position = forwards ? 0 : getLeafKeyEnd(node) - 1; return null; } inChild = true; position = forwards ? 0 : getChildCount(node) - 1; return descend(); }
NodeCursor<K> descendToFirstChild(boolean forwards) { if (isLeaf()) { position = forwards ? 0 : getLeafKeyEnd(node) - 1; return null; } inChild = true; position = forwards ? 0 : getChildCount(node) - 1; return descend(); }
/** * ensures a leaf node we have seeked in, is not positioned outside of its bounds, * by moving us into its parents (if any); if it is the root, we're permitted to be out-of-bounds * as this indicates exhaustion */ private NodeCursor<K> ensureValidLocation(boolean forwards, NodeCursor<K> cur) { assert cur.isLeaf(); int position = cur.position; // if we're out of bounds of the leaf, move once in direction of travel if ((position < 0) | (position >= getLeafKeyEnd(cur.node))) cur = moveOutOfLeaf(forwards, cur, root()); return cur; }
/** * ensures a leaf node we have seeked in, is not positioned outside of its bounds, * by moving us into its parents (if any); if it is the root, we're permitted to be out-of-bounds * as this indicates exhaustion */ private NodeCursor<K> ensureValidLocation(boolean forwards, NodeCursor<K> cur) { assert cur.isLeaf(); int position = cur.position; // if we're out of bounds of the leaf, move once in direction of travel if ((position < 0) | (position >= getLeafKeyEnd(cur.node))) cur = moveOutOfLeaf(forwards, cur, root()); return cur; }
/** * ensures a leaf node we have seeked in, is not positioned outside of its bounds, * by moving us into its parents (if any); if it is the root, we're permitted to be out-of-bounds * as this indicates exhaustion */ private NodeCursor<K> ensureValidLocation(boolean forwards, NodeCursor<K> cur) { assert cur.isLeaf(); int position = cur.position; // if we're out of bounds of the leaf, move once in direction of travel if ((position < 0) | (position >= getLeafKeyEnd(cur.node))) cur = moveOutOfLeaf(forwards, cur, root()); return cur; }
/** * ensures a leaf node we have seeked in, is not positioned outside of its bounds, * by moving us into its parents (if any); if it is the root, we're permitted to be out-of-bounds * as this indicates exhaustion */ private NodeCursor<K> ensureValidLocation(boolean forwards, NodeCursor<K> cur) { assert cur.isLeaf(); int position = cur.position; // if we're out of bounds of the leaf, move once in direction of travel if ((position < 0) | (position >= getLeafKeyEnd(cur.node))) cur = moveOutOfLeaf(forwards, cur, root()); return cur; }
Object[] node = cur.node; if (cur.isLeaf())
Object[] node = cur.node; if (cur.isLeaf())
Object[] node = cur.node; if (cur.isLeaf())
Object[] node = cur.node; if (cur.isLeaf())
/** * move the Cursor one item, either forwards or backwards * @param forwards direction of travel * @return false iff the cursor is exhausted in the direction of travel */ int moveOne(boolean forwards) { NodeCursor<K> cur = this.cur; if (cur.isLeaf()) { // if we're a leaf, we try to step forwards inside ourselves if (cur.advanceLeafNode(forwards)) return cur.globalLeafIndex(); // if we fail, we just find our bounding parent this.cur = cur = moveOutOfLeaf(forwards, cur, root()); return cur.globalIndex(); } // otherwise we descend directly into our next child if (forwards) ++cur.position; cur = cur.descend(); // and go to its first item NodeCursor<K> next; while ( null != (next = cur.descendToFirstChild(forwards)) ) cur = next; this.cur = cur; return cur.globalLeafIndex(); }
/** * move the Cursor one item, either forwards or backwards * @param forwards direction of travel * @return false iff the cursor is exhausted in the direction of travel */ int moveOne(boolean forwards) { NodeCursor<K> cur = this.cur; if (cur.isLeaf()) { // if we're a leaf, we try to step forwards inside ourselves if (cur.advanceLeafNode(forwards)) return cur.globalLeafIndex(); // if we fail, we just find our bounding parent this.cur = cur = moveOutOfLeaf(forwards, cur, root()); return cur.globalIndex(); } // otherwise we descend directly into our next child if (forwards) ++cur.position; cur = cur.descend(); // and go to its first item NodeCursor<K> next; while ( null != (next = cur.descendToFirstChild(forwards)) ) cur = next; this.cur = cur; return cur.globalLeafIndex(); }
/** * move the Cursor one item, either forwards or backwards * @param forwards direction of travel * @return false iff the cursor is exhausted in the direction of travel */ int moveOne(boolean forwards) { NodeCursor<K> cur = this.cur; if (cur.isLeaf()) { // if we're a leaf, we try to step forwards inside ourselves if (cur.advanceLeafNode(forwards)) return cur.globalLeafIndex(); // if we fail, we just find our bounding parent this.cur = cur = moveOutOfLeaf(forwards, cur, root()); return cur.globalIndex(); } // otherwise we descend directly into our next child if (forwards) ++cur.position; cur = cur.descend(); // and go to its first item NodeCursor<K> next; while ( null != (next = cur.descendToFirstChild(forwards)) ) cur = next; this.cur = cur; return cur.globalLeafIndex(); }
/** * move the Cursor one item, either forwards or backwards * @param forwards direction of travel * @return false iff the cursor is exhausted in the direction of travel */ int moveOne(boolean forwards) { NodeCursor<K> cur = this.cur; if (cur.isLeaf()) { // if we're a leaf, we try to step forwards inside ourselves if (cur.advanceLeafNode(forwards)) return cur.globalLeafIndex(); // if we fail, we just find our bounding parent this.cur = cur = moveOutOfLeaf(forwards, cur, root()); return cur.globalIndex(); } // otherwise we descend directly into our next child if (forwards) ++cur.position; cur = cur.descend(); // and go to its first item NodeCursor<K> next; while ( null != (next = cur.descendToFirstChild(forwards)) ) cur = next; this.cur = cur; return cur.globalLeafIndex(); }