@Override public int hashCode() { int hashCode = 0; int mc = modCount(); int[] keys = set; V[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { hashCode += key ^ nullableValueHashCode(vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
@Override public int hashCode() { int hashCode = 0; int mc = modCount(); int[] keys = set; V[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { hashCode += key ^ nullableValueHashCode(vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); return hashCode; }
@Override public void forEach(BiConsumer<? super Float, ? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); int[] keys = set; V[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { action.accept(Float.intBitsToFloat(key), vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
public void forEach(BiConsumer<? super Float, ? super V> action) { if (action == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); int[] keys = set; V[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { action.accept(Float.intBitsToFloat(key), vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalFloatObjMapOps<? super V> m) { if (isEmpty()) return; int mc = modCount(); int[] keys = set; V[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(FloatObjFunction<? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); int[] keys = set; V[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { vals[i] = function.apply(Float.intBitsToFloat(key), vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void replaceAll(FloatObjFunction<? super V, ? extends V> function) { if (function == null) throw new java.lang.NullPointerException(); if (isEmpty()) return; int mc = modCount(); int[] keys = set; V[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { vals[i] = function.apply(Float.intBitsToFloat(key), vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Override public void reversePutAllTo(InternalFloatObjMapOps<? super V> m) { if (isEmpty()) return; int mc = modCount(); int[] keys = set; V[] vals = values; for (int i = keys.length - 1; i >= 0; i--) { int key; if ((key = keys[i]) < FREE_BITS) { m.justPut(key, vals[i]); } } if (mc != modCount()) throw new java.util.ConcurrentModificationException(); }
@Nonnull @Override public FloatObjCursor<V> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor(mc); return new NoRemovedMapCursor(mc); }
@Nonnull @Override public FloatObjCursor<V> cursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedMapCursor(mc); return new NoRemovedMapCursor(mc); }
@Override public FloatIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyIterator(mc); return new NoRemovedKeyIterator(mc); }
@Override public FloatCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyCursor(mc); return new NoRemovedKeyCursor(mc); }
@Override public FloatIterator iterator() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyIterator(mc); return new NoRemovedKeyIterator(mc); }
@Override public FloatCursor setCursor() { int mc = modCount(); if (!noRemoved()) return new SomeRemovedKeyCursor(mc); return new NoRemovedKeyCursor(mc); }