@Override public long remove(final long k) { if (((k) == (0))) { if (containsNullKey) return removeNullEntry(); return defRetValue; } long curr; final long[] key = this.key; int pos; // The starting point. if (((curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix((k)) & mask]) == (0))) return defRetValue; if (((k) == (curr))) return removeEntry(pos); while (true) { if (((curr = key[pos = (pos + 1) & mask]) == (0))) return defRetValue; if (((k) == (curr))) return removeEntry(pos); } } @Override
/** {@inheritDoc} */ @Override public long computeIfPresent(final long k, final java.util.function.BiFunction<? super Long, ? super Long, ? extends Long> remappingFunction) { java.util.Objects.requireNonNull(remappingFunction); final int pos = find(k); if (pos < 0) return defRetValue; final Long newValue = remappingFunction.apply(Long.valueOf(k), Long.valueOf(value[pos])); if (newValue == null) { if (((k) == (0))) removeNullEntry(); else removeEntry(pos); return defRetValue; } return value[pos] = (newValue).longValue(); } /** {@inheritDoc} */
/** {@inheritDoc} */ @Override public boolean remove(final long k, final long v) { if (((k) == (0))) { if (containsNullKey && ((v) == (value[n]))) { removeNullEntry(); return true; } return false; } long curr; final long[] key = this.key; int pos; // The starting point. if (((curr = key[pos = (int) it.unimi.dsi.fastutil.HashCommon.mix((k)) & mask]) == (0))) return false; if (((k) == (curr)) && ((v) == (value[pos]))) { removeEntry(pos); return true; } while (true) { if (((curr = key[pos = (pos + 1) & mask]) == (0))) return false; if (((k) == (curr)) && ((v) == (value[pos]))) { removeEntry(pos); return true; } } } /** {@inheritDoc} */
/** {@inheritDoc} */ @Override public long merge(final long k, final long v, final java.util.function.BiFunction<? super Long, ? super Long, ? extends Long> remappingFunction) { java.util.Objects.requireNonNull(remappingFunction); final int pos = find(k); if (pos < 0) { insert(-pos - 1, k, v); return v; } final Long newValue = remappingFunction.apply(Long.valueOf(value[pos]), Long.valueOf(v)); if (newValue == null) { if (((k) == (0))) removeNullEntry(); else removeEntry(pos); return defRetValue; } return value[pos] = (newValue).longValue(); } /*
/** {@inheritDoc} */ @Override public long compute(final long k, final java.util.function.BiFunction<? super Long, ? super Long, ? extends Long> remappingFunction) { java.util.Objects.requireNonNull(remappingFunction); final int pos = find(k); final Long newValue = remappingFunction.apply(Long.valueOf(k), pos >= 0 ? Long.valueOf(value[pos]) : null); if (newValue == null) { if (pos >= 0) { if (((k) == (0))) removeNullEntry(); else removeEntry(pos); } return defRetValue; } long newVal = (newValue).longValue(); if (pos < 0) { insert(-pos - 1, k, newVal); return newVal; } return value[pos] = newVal; } /** {@inheritDoc} */