@Nonnull @Override public ObjIntCursor<K> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Nonnull @Override public ObjIntCursor<K> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Override public void forEach(BiConsumer<? super K, ? super Integer> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll( BiFunction<? super K, ? super Integer, ? extends Integer> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { vals[i] = function.apply(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key;
@Override public int hashCode() { int hashCode = 0; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { hashCode += nullableKeyHashCode(key) ^ vals[i]; } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { hashCode += nullableKeyHashCode(key) ^ vals[i]; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
@Override public void replaceAll(ObjIntToIntFunction<? super K> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { vals[i] = function.applyAsInt(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { vals[i] = function.applyAsInt(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(ObjIntConsumer<? super K> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(ObjIntConsumer<? super K> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(ObjIntToIntFunction<? super K> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { vals[i] = function.applyAsInt(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { vals[i] = function.applyAsInt(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void replaceAll( BiFunction<? super K, ? super Integer, ? extends Integer> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { vals[i] = function.apply(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public int hashCode() { int hashCode = 0; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { hashCode += nullableKeyHashCode(key) ^ vals[i]; } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { hashCode += nullableKeyHashCode(key) ^ vals[i]; } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
public void forEach(BiConsumer<? super K, ? super Integer> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key;
Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key;
@Override public void reversePutAllTo(InternalObjIntMapOps<? super K> m) { if (this.isEmpty()) return; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { m.justPut(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { m.justPut(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalObjIntMapOps<? super K> m) { if (this.isEmpty()) return; int mc = modCount(); Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE) { m.justPut(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { K key; // noinspection unchecked if ((key = (K) keys[i]) != FREE && key != REMOVED) { m.justPut(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key;
Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key;
Object[] keys = set; int[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { K key;