@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Character, Short>> 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(new MutableEntry(mc, i, key, (short) (entry >>> 16))); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public Map.Entry<Character, Short> elem() { char curKey; if ((curKey = this.curKey) != free) { return new MutableEntry(expectedModCount, index, curKey, curValue); } else { throw new java.lang.IllegalStateException(); } }
@Override public Map.Entry<Character, Short> elem() { char curKey; if ((curKey = this.curKey) != free) { return new MutableEntry(expectedModCount, index, curKey, curValue); } else { throw new java.lang.IllegalStateException(); } }
char key; if ((key = (char) (entry = tab[i])) != free) { a[resultIndex++] = (T) new MutableEntry(mc, i, key, (short) (entry >>> 16));
char key; if ((key = (char) (entry = tab[i])) != free) { a[resultIndex++] = (T) new MutableEntry(mc, i, key, (short) (entry >>> 16));
@Override public Map.Entry<Character, Short> next() { int nextI; if ((nextI = nextIndex) >= 0) { int mc; if ((mc = expectedModCount) == modCount()) { int[] tab = this.tab; char free = this.free; MutableEntry prev = next; int entry; while (--nextI >= 0) { char key; if ((key = (char) (entry = tab[nextI])) != free) { next = new MutableEntry(mc, nextI, key, (short) (entry >>> 16)); break; } } nextIndex = nextI; return prev; } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.util.NoSuchElementException(); } }
@Override public Map.Entry<Character, Short> next() { int nextI; if ((nextI = nextIndex) >= 0) { int mc; if ((mc = expectedModCount) == modCount()) { int[] tab = this.tab; char free = this.free; MutableEntry prev = next; int entry; while (--nextI >= 0) { char key; if ((key = (char) (entry = tab[nextI])) != free) { next = new MutableEntry(mc, nextI, key, (short) (entry >>> 16)); break; } } nextIndex = nextI; return prev; } else { throw new java.util.ConcurrentModificationException(); } } else { throw new java.util.NoSuchElementException(); } }
@Override public boolean forEachWhile(@Nonnull Predicate<? super Map.Entry<Character, Short>> predicate) { if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false; int mc = modCount(); char free = freeValue; int[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { if (!predicate.test(new MutableEntry(mc, i, key, (short) (entry >>> 16)))) { terminated = true; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return !terminated; }
@Override public boolean forEachWhile(@Nonnull Predicate<? super Map.Entry<Character, Short>> predicate) { if (predicate == null) throw new java.lang.NullPointerException(); if (isEmpty()) return true; boolean terminated = false; int mc = modCount(); char free = freeValue; int[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { if (!predicate.test(new MutableEntry(mc, i, key, (short) (entry >>> 16)))) { terminated = true; break; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return !terminated; }
@Override @Nonnull public final Object[] toArray() { int size = size(); Object[] result = new Object[size]; if (size == 0) return result; int resultIndex = 0; int mc = modCount(); char free = freeValue; int[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { result[resultIndex++] = new MutableEntry(mc, i, key, (short) (entry >>> 16)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
@Override public void forEachForward(Consumer<? super Map.Entry<Character, Short>> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; int[] tab = this.tab; char free = this.free; int entry; int index = this.index; for (int i = index - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { action.accept(new MutableEntry(mc, i, key, (short) (entry >>> 16))); } } if (index != this.index || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } this.index = -1; curKey = free; }
@Override public void forEachForward(Consumer<? super Map.Entry<Character, Short>> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; int[] tab = this.tab; char free = this.free; int entry; int index = this.index; for (int i = index - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { action.accept(new MutableEntry(mc, i, key, (short) (entry >>> 16))); } } if (index != this.index || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } this.index = -1; curKey = free; }
@Override @Nonnull public final Object[] toArray() { int size = size(); Object[] result = new Object[size]; if (size == 0) return result; int resultIndex = 0; int mc = modCount(); char free = freeValue; int[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { result[resultIndex++] = new MutableEntry(mc, i, key, (short) (entry >>> 16)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return result; }
@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Character, Short>> 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(new MutableEntry(mc, i, key, (short) (entry >>> 16))); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Character, Short>> c) { if (isEmpty()) return false; boolean changed = false; int mc = modCount(); char free = freeValue; int[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { changed |= c.add(new MutableEntry(mc, i, key, (short) (entry >>> 16))); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public final void forEach(@Nonnull Consumer<? super Map.Entry<Character, Short>> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); char free = freeValue; int[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { action.accept(new MutableEntry(mc, i, key, (short) (entry >>> 16))); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Character, Short>> c) { if (isEmpty()) return false; boolean changed = false; int mc = modCount(); char free = freeValue; int[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { changed |= c.add(new MutableEntry(mc, i, key, (short) (entry >>> 16))); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public final void forEach(@Nonnull Consumer<? super Map.Entry<Character, Short>> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); char free = freeValue; int[] tab = table; int entry; for (int i = tab.length - 1; i >= 0; i--) { char key; if ((key = (char) (entry = tab[i])) != free) { action.accept(new MutableEntry(mc, i, key, (short) (entry >>> 16))); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
NoRemovedEntryIterator(int mc) { expectedModCount = mc; int[] tab = this.tab = table; char free = this.free = freeValue; int nextI = tab.length; int entry; while (--nextI >= 0) { char key; if ((key = (char) (entry = tab[nextI])) != free) { next = new MutableEntry(mc, nextI, key, (short) (entry >>> 16)); break; } } nextIndex = nextI; }
NoRemovedEntryIterator(int mc) { expectedModCount = mc; int[] tab = this.tab = table; char free = this.free = freeValue; int nextI = tab.length; int entry; while (--nextI >= 0) { char key; if ((key = (char) (entry = tab[nextI])) != free) { next = new MutableEntry(mc, nextI, key, (short) (entry >>> 16)); break; } } nextIndex = nextI; }