short key; if ((key = keys[i]) != free) { a[resultIndex++] = (T) new MutableEntry(mc, i, key, vals[i]); short key; if ((key = keys[i]) != free && key != removed) { a[resultIndex++] = (T) new MutableEntry(mc, i, key, vals[i]);
@Override public Double setValue(Double newValue) { if (modCount != modCount()) throw new IllegalStateException(); double oldValue = Double.longBitsToDouble(value); long unwrappedNewValue = Double.doubleToLongBits(newValue); value = unwrappedNewValue; updateValueInTable(unwrappedNewValue); return oldValue; }
short key; if ((key = keys[i]) != free) { if (filter.test(new MutableEntry(mc, i, key, vals[i]))) { incrementModCount(); mc++; short key; if ((key = keys[i]) != free && key != removed) { if (filter.test(new MutableEntry(mc, i, key, vals[i]))) { incrementModCount(); mc++;
short key; if ((key = keys[i]) != free) { if (filter.test(new MutableEntry(mc, i, key, vals[i]))) { incrementModCount(); mc++; short key; if ((key = keys[i]) != free && key != removed) { if (filter.test(new MutableEntry(mc, i, key, vals[i]))) { incrementModCount(); mc++;
short key; if ((key = keys[i]) != free) { a[resultIndex++] = (T) new MutableEntry(mc, i, key, vals[i]); short key; if ((key = keys[i]) != free && key != removed) { a[resultIndex++] = (T) new MutableEntry(mc, i, key, vals[i]);
short key; if ((key = keys[i]) != free) { if (!predicate.test(new MutableEntry(mc, i, key, vals[i]))) { terminated = true; break; short key; if ((key = keys[i]) != free && key != removed) { if (!predicate.test(new MutableEntry(mc, i, key, vals[i]))) { terminated = true; break;
short key; if ((key = keys[i]) != free) { if (!predicate.test(new MutableEntry(mc, i, key, vals[i]))) { terminated = true; break; short key; if ((key = keys[i]) != free && key != removed) { if (!predicate.test(new MutableEntry(mc, i, key, vals[i]))) { terminated = true; break;
short key; if ((key = keys[i]) != free) { result[resultIndex++] = new MutableEntry(mc, i, key, vals[i]); short key; if ((key = keys[i]) != free && key != removed) { result[resultIndex++] = new MutableEntry(mc, i, key, vals[i]);
short key; if ((key = keys[i]) != free) { result[resultIndex++] = new MutableEntry(mc, i, key, vals[i]); short key; if ((key = keys[i]) != free && key != removed) { result[resultIndex++] = new MutableEntry(mc, i, key, vals[i]);
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Short, Double>> c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { changed |= c.add(new MutableEntry(mc, i, key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= c.add(new MutableEntry(mc, i, key, vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public final void forEach(@Nonnull Consumer<? super Map.Entry<Short, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public final boolean reverseAddAllTo(ObjCollection<? super Map.Entry<Short, Double>> c) { if (this.isEmpty()) return false; boolean changed = false; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { changed |= c.add(new MutableEntry(mc, i, key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { changed |= c.add(new MutableEntry(mc, i, key, vals[i])); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return changed; }
@Override public final void forEach(@Nonnull Consumer<? super Map.Entry<Short, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); short free = freeValue; short removed = removedValue; short[] keys = set; long[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } } else { for (int i = keys.length - 1; i >= 0; i--) { short key; if ((key = keys[i]) != free && key != removed) { action.accept(new MutableEntry(mc, i, key, vals[i])); } } } if (mc != modCount()) 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 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 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; 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; }