@Override public Cell previous() { if (previousIndex == -1) { throw new NoSuchElementException(); } checkForCoModification(); lastRet = previousIndex; movePointersBackward(); return array[lastRet]; }
private ListItr() { moveForward(true); }
@Override public ListIterator<Cell> listIterator() { return new ListItr(); }
@Override protected void moveForward(boolean init) { if (!init) { previousIndex = nextIndex; } int i = init ? 0 : nextIndex + 1; moveNextPointer(i); }
@Override public void remove() { if (lastRet == nextIndex) { moveNextPointer(nextIndex); } super.remove(); expectedModCount = modCount; }
private void movePointersBackward() { nextIndex = previousIndex; int i = previousIndex - 1; movePreviousPointer(i); }
@Override public ListIterator<Cell> listIterator() { return new ListItr(); }
private ListItr() { moveForward(true); }
@Override public Cell previous() { if (previousIndex == -1) { throw new NoSuchElementException(); } checkForCoModification(); lastRet = previousIndex; movePointersBackward(); return array[lastRet]; }
@Override protected void moveForward(boolean init) { if (!init) { previousIndex = nextIndex; } int i = init ? 0 : nextIndex + 1; moveNextPointer(i); }
@Override public void remove() { if (lastRet == nextIndex) { moveNextPointer(nextIndex); } super.remove(); expectedModCount = modCount; }
private void movePointersBackward() { nextIndex = previousIndex; int i = previousIndex - 1; movePreviousPointer(i); }
private ListItr() { moveForward(true); }
@Override public void remove() { if (lastRet == nextIndex) { moveNextPointer(nextIndex); } super.remove(); expectedModCount = modCount; }
@Override public Cell previous() { if (previousIndex == -1) { throw new NoSuchElementException(); } checkForCoModification(); lastRet = previousIndex; movePointersBackward(); return array[lastRet]; }
@Override public ListIterator<Cell> listIterator() { return new ListItr(); }
private void movePointersBackward() { nextIndex = previousIndex; int i = previousIndex - 1; movePreviousPointer(i); }
@Override protected void moveForward(boolean init) { if (!init) { previousIndex = nextIndex; } int i = init ? 0 : nextIndex + 1; moveNextPointer(i); }