Refine search
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] keys = this.keys; int[] vals = this.vals; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; long entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { action.accept((int) (entry >>> 32)); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; long entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { action.accept((int) (entry >>> 32)); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; long entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { action.accept((int) (entry >>> 32)); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] keys = this.keys; int[] vals = this.vals; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; long entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { action.accept((int) (entry >>> 32)); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] keys = this.keys; int[] vals = this.vals; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] keys = this.keys; int[] vals = this.vals; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); byte[] keys = this.keys; int[] vals = this.vals; byte free = this.free; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if (keys[i] != free) { action.accept(vals[i]); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachForward(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] keys = this.keys; int[] vals = this.vals; int index = this.index; for (int i = index - 1; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (index != this.index) { throw new java.util.ConcurrentModificationException(); } this.index = -1; curKey = FREE_BITS; }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; long[] tab = this.tab; long entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { action.accept((int) (entry >>> 32)); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } index = nextIndex = -1; }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; long[] keys = this.keys; int[] vals = this.vals; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } index = nextIndex = -1; }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); int mc = expectedModCount; long[] keys = this.keys; int[] vals = this.vals; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (nextI != nextIndex || mc != modCount()) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
public void forEach(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { action.accept(key); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; long[] tab = table; long base = LONG_BASE + INT_KEY_OFFSET; for (long off = ((long) tab.length) << LONG_SCALE_SHIFT; (off -= LONG_SCALE) >= 0L;) { int key; if ((key = U.getInt(tab, base + off)) != free) { action.accept(key); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { action.accept(key); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long[] keys = set; int[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long[] tab = table; long entry; for (int i = tab.length - 1; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { action.accept((int) (entry >>> 32)); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { action.accept(key); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); int free = freeValue; int[] keys = set; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { action.accept(key); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }