Lines Matching defs:nextIndex
42 * nextIndex is always greater or equal to zero. If the next record is not
43 * available, then nextIndex is equal to keys.length or keys[nextIndex] is
47 * key range is empty. Either way, nextIndex will be the array length and
54 private int nextIndex;
84 nextIndex = blockSize;
101 nextIndex = o.nextIndex;
121 * Returns whether the element at nextIndex is available.
125 return (nextIndex < keys.length) &&
126 (keys[nextIndex] != null);
130 * Returns whether the element at nextIndex-1 is available.
134 return (nextIndex > 0) &&
135 (keys[nextIndex - 1] != null);
208 * accordingly. Also adjusts nextIndex and sets dataIndex to -1.
225 nextIndex += 1;
254 * Deletes the given slot, adjusts nextIndex and sets dataIndex to -1.
268 if (nextIndex > i) {
269 nextIndex -= 1;
308 int prev = nextIndex - 1;
316 nextIndex = 0;
330 nextIndex = 1;
346 nextIndex = 0;
406 int next = nextIndex;
421 nextIndex = last;
474 dataIndex = nextIndex;
475 nextIndex += 1;
486 nextIndex -= 1;
487 dataIndex = nextIndex;
495 public int nextIndex() {
502 return hasNext() ? (getRecordNumber(nextIndex) -
514 return hasPrevious() ? (getRecordNumber(nextIndex - 1) -
564 * moving forward, i.e, when nextIndex is greater than
567 if (nextIndex == 0 && keys[0] == null) {
583 * cursor position, leave nextIndex set to keys.length,
588 nextIndex = keys.length;
589 for (int i = nextIndex - 1; i >= 0; i -= 1) {
665 dataIndex = nextIndex - 1;
671 * the element at (nextIndex - 1) is available; otherwise
672 * the element at nextIndex is available.
675 int insertIndex = hasPrev ? (nextIndex - 1) : nextIndex;
690 insertSlot(nextIndex, cursor);
726 nextIndex = 1;
772 nextIndex = 0;