/** * {@inheritDoc} * * <p>Note that an empty container may still contain many deleted keys (that occupy buffer * space). Adding even a single element to such a container may cause rehashing.</p> */ @Override public boolean isEmpty() { return size() == 0; }
/** * {@inheritDoc} */ @Override public ObjectIntHashMap<KType> clone() { //clone to size() to prevent some cases of exponential sizes, final ObjectIntHashMap<KType> cloned = new ObjectIntHashMap<KType>(this.size(), this.loadFactor); //We must NOT clone because of independent perturbations seeds cloned.putAll(this); return cloned; }
/** * {@inheritDoc} */ @Override public int removeAll(final ObjectPredicate<? super KType> predicate) { final int before = this.size(); if (this.allocatedDefaultKey) { if (predicate.apply((null))) { this.allocatedDefaultKey = false; } } final KType[] keys = ((KType[])(this.keys)); for (int i = 0; i < keys.length;) { KType existing; if (!((existing = keys[i]) == null) && predicate.apply(existing)) { shiftConflictingKeys(i); // Shift, do not increment slot. } else { i++; } } return before - this.size(); }
/** * {@inheritDoc} */ @Override public int removeAll(final ObjectIntPredicate<? super KType> predicate) { final int before = this.size(); if (this.allocatedDefaultKey) { if (predicate.apply((null), this.allocatedDefaultKeyValue)) { this.allocatedDefaultKey = false; } } final KType[] keys = ((KType[])(this.keys)); final int[] values = ((this.values)); for (int i = 0; i < keys.length;) { KType existing; if (!((existing = keys[i]) == null) && predicate.apply(existing, values[i])) { shiftConflictingKeys(i); // Shift, do not increment slot. } else { i++; } } return before - this.size(); }