@Override public boolean moveNext() { if (expectedModCount == modCount()) { int[] tab = this.tab; char free = this.free; int entry; for (int i = index - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { index = i; curKey = key; return true; } } curKey = free; index = -1; return false; } else { throw new java.util.ConcurrentModificationException(); } }
@Override public boolean moveNext() { if (expectedModCount == modCount()) { int[] tab = this.tab; char free = this.free; char removed = this.removed; int entry; for (int i = index - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free && key != removed) { index = i; curKey = key; return true; } } curKey = free; index = -1; return false; } else { throw new java.util.ConcurrentModificationException(); } }
@Override public void forEachRemaining(Consumer<? super Character> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; int[] tab = this.tab; char free = this.free; int entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { action.accept(key); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } index = nextIndex = -1; }
public void forEachRemaining(Consumer<? super Character> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; int[] tab = this.tab; char free = this.free; int entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { action.accept(key); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } index = nextIndex = -1; }
@Override public void forEachRemaining(CharConsumer action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; int[] tab = this.tab; char free = this.free; int entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { action.accept(key); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } index = nextIndex = -1; }
@Override public void forEachForward(CharConsumer action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; int[] tab = this.tab; char free = this.free; char removed = this.removed; int entry; int index = this.index; for (int i = index - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free && key != removed) { action.accept(key); } } if (index != this.index || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } this.index = -1; curKey = free; }
@Override public void forEachRemaining(CharConsumer action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; int[] tab = this.tab; char free = this.free; int entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { action.accept(key); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } index = nextIndex = -1; }
public void forEachRemaining(Consumer<? super Character> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; int[] tab = this.tab; char free = this.free; char removed = this.removed; int entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free && key != removed) { action.accept(key); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } index = nextIndex = -1; }
@Override public void remove() { char free; if (curKey != (free = this.free)) { if (expectedModCount++ == modCount()) { this.curKey = free; incrementModCount(); U.putChar(tab, INT_BASE + CHAR_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { int index; if ((index = this.index) >= 0) { if (expectedModCount++ == modCount()) { this.index = -1; incrementModCount(); U.putChar(tab, INT_BASE + CHAR_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { char free; if (curKey != (free = this.free)) { if (expectedModCount++ == modCount()) { this.curKey = free; incrementModCount(); U.putChar(tab, INT_BASE + CHAR_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { char free; if (curKey != (free = this.free)) { if (expectedModCount++ == modCount()) { this.curKey = free; incrementModCount(); U.putChar(tab, INT_BASE + CHAR_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { int index; if ((index = this.index) >= 0) { if (expectedModCount++ == modCount()) { this.index = -1; incrementModCount(); U.putChar(tab, INT_BASE + CHAR_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { int index; if ((index = this.index) >= 0) { if (expectedModCount++ == modCount()) { this.index = -1; incrementModCount(); U.putChar(tab, INT_BASE + CHAR_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { int index; if ((index = this.index) >= 0) { if (expectedModCount++ == modCount()) { this.index = -1; incrementModCount(); U.putChar(tab, INT_BASE + CHAR_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
@Override public void remove() { char free; if (curKey != (free = this.free)) { if (expectedModCount++ == modCount()) { this.curKey = free; incrementModCount(); U.putChar(tab, INT_BASE + CHAR_KEY_OFFSET + (((long) (index)) << INT_SCALE_SHIFT), removed); postRemoveHook(); } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.lang.IllegalStateException(); } } }
public CharIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator( mc); return new NoRemovedIterator(mc); }
public CharCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }
public CharIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedIterator( mc); return new NoRemovedIterator(mc); }
public CharCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedCursor(mc); return new NoRemovedCursor(mc); }