@Nonnull @Override public IntObjCursor<V> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Nonnull @Override public IntObjCursor<V> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Override public void replaceAll( BiFunction<? super Integer, ? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { vals[i] = function.apply(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public IntIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyIterator( mc); return new NoRemovedKeyIterator(mc); }
@Override public IntIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyIterator( mc); return new NoRemovedKeyIterator(mc); }
@Override public void forEach(BiConsumer<? super Integer, ? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public IntCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyCursor( mc); return new NoRemovedKeyCursor(mc); }
@Override public IntCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyCursor( mc); return new NoRemovedKeyCursor(mc); }
@Override public int hashCode() { int hashCode = 0; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { hashCode += key ^ nullableValueHashCode(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { hashCode += key ^ nullableValueHashCode(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
public void forEach(BiConsumer<? super Integer, ? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public int hashCode() { int hashCode = 0; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { hashCode += key ^ nullableValueHashCode(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { hashCode += key ^ nullableValueHashCode(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
@Override public void forEach(IntObjConsumer<? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void replaceAll( BiFunction<? super Integer, ? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { vals[i] = function.apply(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(IntObjFunction<? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { vals[i] = function.apply(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(IntObjFunction<? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { vals[i] = function.apply(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(IntObjConsumer<? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalIntObjMapOps<? super V> m) { if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { m.justPut(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { m.justPut(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalIntObjMapOps<? super V> m) { if (this.isEmpty()) return; int mc = modCount(); int free = freeValue; int removed = removedValue; int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free) { m.justPut(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) != free && key != removed) { m.justPut(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key;
int[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { int key;