@Nonnull @Override public LongObjCursor<V> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Nonnull @Override public LongObjCursor<V> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor( mc); return new NoRemovedMapCursor(mc); }
@Override public void forEach(BiConsumer<? super Long, ? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public LongCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyCursor( mc); return new NoRemovedKeyCursor(mc); }
@Override public void replaceAll( BiFunction<? super Long, ? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long 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 LongCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyCursor( mc); return new NoRemovedKeyCursor(mc); }
@Override public LongIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyIterator( mc); return new NoRemovedKeyIterator(mc); }
@Override public LongIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyIterator( mc); return new NoRemovedKeyIterator(mc); }
@Override public int hashCode() { int hashCode = 0; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { hashCode += ((int) (key ^ (key >>> 32))) ^ nullableValueHashCode(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { hashCode += ((int) (key ^ (key >>> 32))) ^ nullableValueHashCode(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
@Override public int hashCode() { int hashCode = 0; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { hashCode += ((int) (key ^ (key >>> 32))) ^ nullableValueHashCode(vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { hashCode += ((int) (key ^ (key >>> 32))) ^ nullableValueHashCode(vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
public void forEach(BiConsumer<? super Long, ? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void forEach(LongObjConsumer<? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long 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 Long, ? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long 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(LongObjConsumer<? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { action.accept(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { action.accept(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(LongObjFunction<? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long 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(LongObjFunction<? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { vals[i] = function.apply(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long 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 reversePutAllTo(InternalLongObjMapOps<? super V> m) { if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { m.justPut(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long 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(InternalLongObjMapOps<? super V> m) { if (this.isEmpty()) return; int mc = modCount(); long free = freeValue; long removed = removedValue; long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free) { m.justPut(key, vals[i]); } } } else { for (int i = keys.length - 1; i >= 0; i--) { long key; if ((key = keys[i]) != free && key != removed) { m.justPut(key, vals[i]); } } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key;
long[] keys = set; V[] vals = values; if (noRemoved()) { for (int i = keys.length - 1; i >= 0; i--) { long key;