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