/** {@inheritDoc} */ @Override public int computeIntIfPresent(final K k, final java.util.function.BiFunction<? super K, ? super Integer, ? extends Integer> remappingFunction) { java.util.Objects.requireNonNull(remappingFunction); final int pos = find(k); if (pos < 0) return defRetValue; final Integer newValue = remappingFunction.apply((k), Integer.valueOf(value[pos])); if (newValue == null) { if (((k) == (null))) removeNullEntry(); else removeEntry(pos); return defRetValue; } return value[pos] = (newValue).intValue(); } /** {@inheritDoc} */
/** {@inheritDoc} */ @Override public int mergeInt(final K k, final int v, final java.util.function.BiFunction<? super Integer, ? super Integer, ? extends Integer> remappingFunction) { java.util.Objects.requireNonNull(remappingFunction); final int pos = find(k); if (pos < 0) { insert(-pos - 1, k, v); return v; } final Integer newValue = remappingFunction.apply(Integer.valueOf(value[pos]), Integer.valueOf(v)); if (newValue == null) { if (((k) == (null))) removeNullEntry(); else removeEntry(pos); return defRetValue; } return value[pos] = (newValue).intValue(); } /*
/** {@inheritDoc} */ @Override public int computeInt(final K k, final java.util.function.BiFunction<? super K, ? super Integer, ? extends Integer> remappingFunction) { java.util.Objects.requireNonNull(remappingFunction); final int pos = find(k); final Integer newValue = remappingFunction.apply((k), pos >= 0 ? Integer.valueOf(value[pos]) : null); if (newValue == null) { if (pos >= 0) { if (((k) == (null))) removeNullEntry(); else removeEntry(pos); } return defRetValue; } int newVal = (newValue).intValue(); if (pos < 0) { insert(-pos - 1, k, newVal); return newVal; } return value[pos] = newVal; } /** {@inheritDoc} */
@Override @SuppressWarnings("unchecked") public int removeInt(final Object k) { if ((((K) k) == (null))) { if (containsNullKey) return removeNullEntry(); return defRetValue; } K curr; final K[] key = this.key; int pos; // The starting point. if (((curr = key[pos = (it.unimi.dsi.fastutil.HashCommon.mix(System.identityHashCode(k))) & mask]) == (null))) return defRetValue; if (((k) == (curr))) return removeEntry(pos); while (true) { if (((curr = key[pos = (pos + 1) & mask]) == (null))) return defRetValue; if (((k) == (curr))) return removeEntry(pos); } } private int setValue(final int pos, final int v) {
if ((((K) k) == (null))) { if (containsNullKey && ((v) == (value[n]))) { removeNullEntry(); return true;