@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Short, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; short[] keys = this.keys; long[] vals = this.vals; short free = this.free; short removed = this.removed; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } index = nextIndex = -1; }
@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Short, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; short[] keys = this.keys; long[] vals = this.vals; short free = this.free; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } index = nextIndex = -1; }
@Override public Map.Entry<Short, Double> elem() { short curKey; if ((curKey = this.curKey) != free) { return new MutableEntry(expectedModCount, index, curKey, curValue); } else { throw new java.lang.IllegalStateException(); } }
@Override public Map.Entry<Short, Double> next() { int mc; if ((mc = expectedModCount) == modCount()) { int nextI; if ((nextI = nextIndex) >= 0) { index = nextI; short[] keys = this.keys; short free = this.free; MutableEntry prev = next; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free) { next = new MutableEntry(mc, nextI, key, vals[nextI]); break; } } nextIndex = nextI; return prev; } else { throw new java.util.NoSuchElementException(); } } else { throw new java.util.ConcurrentModificationException(); } }
@Override public Map.Entry<Short, Double> next() { int mc; if ((mc = expectedModCount) == modCount()) { int nextI; if ((nextI = nextIndex) >= 0) { index = nextI; short[] keys = this.keys; short free = this.free; short removed = this.removed; MutableEntry prev = next; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free && key != removed) { next = new MutableEntry(mc, nextI, key, vals[nextI]); break; } } nextIndex = nextI; return prev; } else { throw new java.util.NoSuchElementException(); } } else { throw new java.util.ConcurrentModificationException(); } }
@Override public Map.Entry<Short, Double> next() { int mc; if ((mc = expectedModCount) == modCount()) { int nextI; if ((nextI = nextIndex) >= 0) { index = nextI; short[] keys = this.keys; short free = this.free; short removed = this.removed; MutableEntry prev = next; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free && key != removed) { next = new MutableEntry(mc, nextI, key, vals[nextI]); break; } } nextIndex = nextI; return prev; } else { throw new java.util.NoSuchElementException(); } } else { throw new java.util.ConcurrentModificationException(); } }
@Override public Map.Entry<Short, Double> next() { int mc; if ((mc = expectedModCount) == modCount()) { int nextI; if ((nextI = nextIndex) >= 0) { index = nextI; short[] keys = this.keys; short free = this.free; MutableEntry prev = next; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free) { next = new MutableEntry(mc, nextI, key, vals[nextI]); break; } } nextIndex = nextI; return prev; } else { throw new java.util.NoSuchElementException(); } } else { throw new java.util.ConcurrentModificationException(); } }
@Override public void forEachForward(Consumer<? super Map.Entry<Short, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; short[] keys = this.keys; long[] vals = this.vals; short free = this.free; short removed = this.removed; int index = this.index; for (int i = index - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } if (index != this.index || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } this.index = -1; curKey = free; }
@Override public void forEachForward(Consumer<? super Map.Entry<Short, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; short[] keys = this.keys; long[] vals = this.vals; short free = this.free; int index = this.index; for (int i = index - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } if (index != this.index || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } this.index = -1; curKey = free; }
@Override public void forEachForward(Consumer<? super Map.Entry<Short, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; short[] keys = this.keys; long[] vals = this.vals; short free = this.free; short removed = this.removed; int index = this.index; for (int i = index - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } if (index != this.index || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } this.index = -1; curKey = free; }
@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Short, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; short[] keys = this.keys; long[] vals = this.vals; short free = this.free; short removed = this.removed; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } index = nextIndex = -1; }
@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Short, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; short[] keys = this.keys; long[] vals = this.vals; short free = this.free; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } index = nextIndex = -1; }
@Override public void forEachForward(Consumer<? super Map.Entry<Short, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; short[] keys = this.keys; long[] vals = this.vals; short free = this.free; int index = this.index; for (int i = index - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } if (index != this.index || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } this.index = -1; curKey = free; }
SomeRemovedEntryIterator(int mc) { expectedModCount = mc; short[] keys = this.keys = set; long[] vals = this.vals = values; short free = this.free = freeValue; short removed = this.removed = removedValue; int nextI = keys.length; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free && key != removed) { next = new MutableEntry(mc, nextI, key, vals[nextI]); break; } } nextIndex = nextI; }
SomeRemovedEntryIterator(int mc) { expectedModCount = mc; short[] keys = this.keys = set; long[] vals = this.vals = values; short free = this.free = freeValue; short removed = this.removed = removedValue; int nextI = keys.length; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free && key != removed) { next = new MutableEntry(mc, nextI, key, vals[nextI]); break; } } nextIndex = nextI; }
NoRemovedEntryIterator(int mc) { expectedModCount = mc; short[] keys = this.keys = set; long[] vals = this.vals = values; short free = this.free = freeValue; this.removed = removedValue; int nextI = keys.length; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free) { next = new MutableEntry(mc, nextI, key, vals[nextI]); break; } } nextIndex = nextI; }
NoRemovedEntryIterator(int mc) { expectedModCount = mc; short[] keys = this.keys = set; long[] vals = this.vals = values; short free = this.free = freeValue; this.removed = removedValue; int nextI = keys.length; while (--nextI >= 0) { short key; if ((key = keys[nextI]) != free) { next = new MutableEntry(mc, nextI, key, vals[nextI]); break; } } nextIndex = nextI; }
@Override public Map.Entry<Short, Double> elem() { short curKey; if ((curKey = this.curKey) != free) { return new MutableEntry(expectedModCount, index, curKey, curValue); } else { throw new java.lang.IllegalStateException(); } }
@Override public Map.Entry<Short, Double> elem() { short curKey; if ((curKey = this.curKey) != free) { return new MutableEntry(expectedModCount, index, curKey, curValue); } else { throw new java.lang.IllegalStateException(); } }
@Override public Map.Entry<Short, Double> elem() { short curKey; if ((curKey = this.curKey) != free) { return new MutableEntry(expectedModCount, index, curKey, curValue); } else { throw new java.lang.IllegalStateException(); } }