/*
 * Copyright (c) 2018 Goldman Sachs and others.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * and Eclipse Distribution License v. 1.0 which accompany this distribution.
 * The Eclipse Public License is available at http://www.eclipse.org/legal/epl-v10.html
 * and the Eclipse Distribution License is available at
 * http://www.eclipse.org/org/documents/edl-v10.php.
 */

package org.eclipse.collections.impl.map.mutable.primitive;

import java.io.Externalizable;
import java.io.IOException;
import java.io.ObjectInput;
import java.io.ObjectOutput;
import java.util.Arrays;
import java.util.Iterator;
import java.util.NoSuchElementException;

import org.eclipse.collections.api.IntIterable;
import org.eclipse.collections.api.LazyIntIterable;
import org.eclipse.collections.api.RichIterable;
import org.eclipse.collections.api.block.function.primitive.IntFunction;
import org.eclipse.collections.api.block.function.primitive.IntFunction0;
import org.eclipse.collections.api.block.function.primitive.IntToIntFunction;
import org.eclipse.collections.api.block.function.primitive.ObjectIntToObjectFunction;
import org.eclipse.collections.api.block.predicate.primitive.IntIntPredicate;
import org.eclipse.collections.api.block.procedure.Procedure;
import org.eclipse.collections.api.block.procedure.Procedure2;
import org.eclipse.collections.api.block.procedure.primitive.IntProcedure;
import org.eclipse.collections.api.block.procedure.primitive.IntIntProcedure;
import org.eclipse.collections.api.block.procedure.primitive.ObjectIntProcedure;
import org.eclipse.collections.impl.SpreadFunctions;
import org.eclipse.collections.api.collection.primitive.MutableIntCollection;
import org.eclipse.collections.api.iterator.IntIterator;
import org.eclipse.collections.api.iterator.MutableIntIterator;
import org.eclipse.collections.api.map.primitive.IntIntMap;
import org.eclipse.collections.api.map.primitive.ImmutableIntIntMap;
import org.eclipse.collections.api.map.primitive.MutableIntIntMap;
import org.eclipse.collections.api.set.primitive.IntSet;
import org.eclipse.collections.api.set.primitive.MutableIntSet;
import org.eclipse.collections.api.tuple.primitive.IntIntPair;
import org.eclipse.collections.impl.bag.mutable.primitive.IntHashBag;
import org.eclipse.collections.impl.factory.primitive.IntIntMaps;
import org.eclipse.collections.impl.iterator.UnmodifiableIntIterator;
import org.eclipse.collections.impl.lazy.AbstractLazyIterable;
import org.eclipse.collections.impl.lazy.primitive.AbstractLazyIntIterable;
import org.eclipse.collections.impl.set.mutable.primitive.IntHashSet;
import org.eclipse.collections.impl.tuple.primitive.PrimitiveTuples;

This file was automatically generated from template file primitivePrimitiveHashMap.stg.
Since:3.0.
/** * This file was automatically generated from template file primitivePrimitiveHashMap.stg. * * @since 3.0. */
public class IntIntHashMap extends AbstractMutableIntValuesMap implements MutableIntIntMap, Externalizable, MutableIntKeysMap { private static final int EMPTY_VALUE = 0; private static final long serialVersionUID = 1L; private static final int EMPTY_KEY = 0; private static final int REMOVED_KEY = 1; private static final int CACHE_LINE_SIZE = 64; private static final int KEY_SIZE = 4; private static final int INITIAL_LINEAR_PROBE = CACHE_LINE_SIZE / KEY_SIZE / 2; /* half a cache line */ private static final int DEFAULT_INITIAL_CAPACITY = 8; private int[] keysValues; private int occupiedWithData; private int occupiedWithSentinels; private SentinelValues sentinelValues; private boolean copyKeysOnWrite; public IntIntHashMap() { this.allocateTable(DEFAULT_INITIAL_CAPACITY << 1); } public IntIntHashMap(int initialCapacity) { if (initialCapacity < 0) { throw new IllegalArgumentException("initial capacity cannot be less than 0"); } int capacity = this.smallestPowerOfTwoGreaterThan(initialCapacity << 1); this.allocateTable(capacity); } public IntIntHashMap(IntIntMap map) { if (map instanceof IntIntHashMap && ((IntIntHashMap) map).occupiedWithSentinels == 0) { IntIntHashMap hashMap = (IntIntHashMap) map; this.occupiedWithData = hashMap.occupiedWithData; if (hashMap.sentinelValues != null) { this.sentinelValues = hashMap.sentinelValues.copy(); } this.keysValues = Arrays.copyOf(hashMap.keysValues, hashMap.keysValues.length); } else { int capacity = this.smallestPowerOfTwoGreaterThan(Math.max(map.size(), DEFAULT_INITIAL_CAPACITY) << 1); this.allocateTable(capacity); this.putAll(map); } } public static IntIntHashMap newWithKeysValues(int key1, int value1) { return new IntIntHashMap(1).withKeyValue(key1, value1); } public static IntIntHashMap newWithKeysValues(int key1, int value1, int key2, int value2) { return new IntIntHashMap(2).withKeysValues(key1, value1, key2, value2); } public static IntIntHashMap newWithKeysValues(int key1, int value1, int key2, int value2, int key3, int value3) { return new IntIntHashMap(3).withKeysValues(key1, value1, key2, value2, key3, value3); } public static IntIntHashMap newWithKeysValues(int key1, int value1, int key2, int value2, int key3, int value3, int key4, int value4) { return new IntIntHashMap(4).withKeysValues(key1, value1, key2, value2, key3, value3, key4, value4); } private int smallestPowerOfTwoGreaterThan(int n) { return n > 1 ? Integer.highestOneBit(n - 1) << 1 : 1; } @Override protected int getOccupiedWithData() { return this.occupiedWithData; } @Override protected SentinelValues getSentinelValues() { return this.sentinelValues; } @Override protected void setSentinelValuesNull() { this.sentinelValues = null; } @Override protected int getEmptyValue() { return EMPTY_VALUE; } @Override protected int getTableSize() { return this.keysValues.length / 2; } @Override protected int getValueAtIndex(int index) { return this.keysValues[index * 2 + 1]; } @Override public boolean equals(Object obj) { if (this == obj) { return true; } if (!(obj instanceof IntIntMap)) { return false; } IntIntMap other = (IntIntMap) obj; if (this.size() != other.size()) { return false; } if (this.sentinelValues == null) { if (other.containsKey(EMPTY_KEY) || other.containsKey(REMOVED_KEY)) { return false; } } else { if (this.sentinelValues.containsZeroKey && (!other.containsKey(EMPTY_KEY) || this.sentinelValues.zeroValue != other.getOrThrow(EMPTY_KEY))) { return false; } if (this.sentinelValues.containsOneKey && (!other.containsKey(REMOVED_KEY) || this.sentinelValues.oneValue != other.getOrThrow(REMOVED_KEY))) { return false; } } for (int i = 0; i < this.keysValues.length; i += 2) { int key = this.keysValues[i]; if (isNonSentinel(key) && (!other.containsKey(key) || this.keysValues[i + 1] != other.getOrThrow(key))) { return false; } } return true; } @Override public int hashCode() { int result = 0; if (this.sentinelValues != null) { if (this.sentinelValues.containsZeroKey) { result += EMPTY_KEY ^ this.sentinelValues.zeroValue; } if (this.sentinelValues.containsOneKey) { result += REMOVED_KEY ^ this.sentinelValues.oneValue; } } for (int i = 0; i < this.keysValues.length; i += 2) { if (isNonSentinel(this.keysValues[i])) { result += this.keysValues[i] ^ this.keysValues[i + 1]; } } return result; } @Override public String toString() { StringBuilder appendable = new StringBuilder(); appendable.append("{"); boolean first = true; if (this.sentinelValues != null) { if (this.sentinelValues.containsZeroKey) { appendable.append(EMPTY_KEY).append("=").append(this.sentinelValues.zeroValue); first = false; } if (this.sentinelValues.containsOneKey) { if (!first) { appendable.append(", "); } appendable.append(REMOVED_KEY).append("=").append(this.sentinelValues.oneValue); first = false; } } for (int i = 0; i < this.keysValues.length; i += 2) { int key = this.keysValues[i]; if (isNonSentinel(key)) { if (!first) { appendable.append(", "); } appendable.append(key).append("=").append(this.keysValues[i + 1]); first = false; } } appendable.append("}"); return appendable.toString(); } @Override public MutableIntIterator intIterator() { return new InternalIntIterator(); } @Override public <V> V injectInto(V injectedValue, ObjectIntToObjectFunction<? super V, ? extends V> function) { V result = injectedValue; if (this.sentinelValues != null) { if (this.sentinelValues.containsZeroKey) { result = function.valueOf(result, this.sentinelValues.zeroValue); } if (this.sentinelValues.containsOneKey) { result = function.valueOf(result, this.sentinelValues.oneValue); } } for (int i = 0; i < this.keysValues.length; i += 2) { if (isNonSentinel(this.keysValues[i])) { result = function.valueOf(result, this.keysValues[i + 1]); } } return result; } @Override public void clear() { this.sentinelValues = null; this.occupiedWithData = 0; this.occupiedWithSentinels = 0; if (this.copyKeysOnWrite) { this.copyKeys(); } Arrays.fill(this.keysValues, 0); } @Override public void put(int key, int value) { if (isEmptyKey(key)) { this.putForEmptySentinel(value); return; } if (isRemovedKey(key)) { this.putForRemovedSentinel(value); return; } int index = this.probe(key); int keyAtIndex = this.keysValues[index]; if (keyAtIndex == key) { this.keysValues[index + 1] = value; } else { this.addKeyValueAtIndex(key, value, index); } } private void putForRemovedSentinel(int value) { if (this.sentinelValues == null) { this.sentinelValues = new SentinelValues(); } this.addRemovedKeyValue(value); } private void putForEmptySentinel(int value) { if (this.sentinelValues == null) { this.sentinelValues = new SentinelValues(); } this.addEmptyKeyValue(value); } @Override public void putAll(IntIntMap map) { map.forEachKeyValue(this::put); } @Override public void removeKey(int key) { if (isEmptyKey(key)) { if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey) { return; } this.removeEmptyKey(); return; } if (isRemovedKey(key)) { if (this.sentinelValues == null || !this.sentinelValues.containsOneKey) { return; } this.removeRemovedKey(); return; } int index = this.probe(key); if (this.keysValues[index] == key) { this.removeKeyAtIndex(index); } } @Override public void remove(int key) { this.removeKey(key); } @Override public int removeKeyIfAbsent(int key, int value) { if (isEmptyKey(key)) { if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey) { return value; } int oldValue = this.sentinelValues.zeroValue; this.removeEmptyKey(); return oldValue; } if (isRemovedKey(key)) { if (this.sentinelValues == null || !this.sentinelValues.containsOneKey) { return value; } int oldValue = this.sentinelValues.oneValue; this.removeRemovedKey(); return oldValue; } int index = this.probe(key); if (this.keysValues[index] == key) { int oldValue = this.keysValues[index + 1]; this.removeKeyAtIndex(index); return oldValue; } return value; } @Override public int getIfAbsentPut(int key, int value) { if (isEmptyKey(key)) { if (this.sentinelValues == null) { this.sentinelValues = new SentinelValues(); this.addEmptyKeyValue(value); return value; } if (this.sentinelValues.containsZeroKey) { return this.sentinelValues.zeroValue; } this.addEmptyKeyValue(value); return value; } if (isRemovedKey(key)) { if (this.sentinelValues == null) { this.sentinelValues = new SentinelValues(); this.addRemovedKeyValue(value); return value; } if (this.sentinelValues.containsOneKey) { return this.sentinelValues.oneValue; } this.addRemovedKeyValue(value); return value; } int index = this.probe(key); if (this.keysValues[index] == key) { return this.keysValues[index + 1]; } this.addKeyValueAtIndex(key, value, index); return value; } @Override public int getIfAbsentPut(int key, IntFunction0 function) { if (isEmptyKey(key)) { if (this.sentinelValues == null) { int value = function.value(); this.sentinelValues = new SentinelValues(); this.addEmptyKeyValue(value); return value; } if (this.sentinelValues.containsZeroKey) { return this.sentinelValues.zeroValue; } int value = function.value(); this.addEmptyKeyValue(value); return value; } if (isRemovedKey(key)) { if (this.sentinelValues == null) { int value = function.value(); this.sentinelValues = new SentinelValues(); this.addRemovedKeyValue(value); return value; } if (this.sentinelValues.containsOneKey) { return this.sentinelValues.oneValue; } int value = function.value(); this.addRemovedKeyValue(value); return value; } int index = this.probe(key); if (this.keysValues[index] == key) { return this.keysValues[index + 1]; } int value = function.value(); this.addKeyValueAtIndex(key, value, index); return value; } @Override public <P> int getIfAbsentPutWith(int key, IntFunction<? super P> function, P parameter) { if (isEmptyKey(key)) { if (this.sentinelValues == null) { int value = function.intValueOf(parameter); this.sentinelValues = new SentinelValues(); this.addEmptyKeyValue(value); return value; } if (this.sentinelValues.containsZeroKey) { return this.sentinelValues.zeroValue; } int value = function.intValueOf(parameter); this.addEmptyKeyValue(value); return value; } if (isRemovedKey(key)) { if (this.sentinelValues == null) { int value = function.intValueOf(parameter); this.sentinelValues = new SentinelValues(); this.addRemovedKeyValue(value); return value; } if (this.sentinelValues.containsOneKey) { return this.sentinelValues.oneValue; } int value = function.intValueOf(parameter); this.addRemovedKeyValue(value); return value; } int index = this.probe(key); if (this.keysValues[index] == key) { return this.keysValues[index + 1]; } int value = function.intValueOf(parameter); this.addKeyValueAtIndex(key, value, index); return value; } @Override public int getIfAbsentPutWithKey(int key, IntToIntFunction function) { if (isEmptyKey(key)) { if (this.sentinelValues == null) { int value = function.valueOf(key); this.sentinelValues = new SentinelValues(); this.addEmptyKeyValue(value); return value; } if (this.sentinelValues.containsZeroKey) { return this.sentinelValues.zeroValue; } int value = function.valueOf(key); this.addEmptyKeyValue(value); return value; } if (isRemovedKey(key)) { if (this.sentinelValues == null) { int value = function.valueOf(key); this.sentinelValues = new SentinelValues(); this.addRemovedKeyValue(value); return value; } if (this.sentinelValues.containsOneKey) { return this.sentinelValues.oneValue; } int value = function.valueOf(key); this.addRemovedKeyValue(value); return value; } int index = this.probe(key); if (this.keysValues[index] == key) { return this.keysValues[index + 1]; } int value = function.valueOf(key); this.addKeyValueAtIndex(key, value, index); return value; } @Override public int addToValue(int key, int toBeAdded) { if (isEmptyKey(key)) { if (this.sentinelValues == null) { this.sentinelValues = new SentinelValues(); this.addEmptyKeyValue(toBeAdded); } else if (this.sentinelValues.containsZeroKey) { this.sentinelValues.zeroValue += toBeAdded; } else { this.addEmptyKeyValue(toBeAdded); } return this.sentinelValues.zeroValue; } if (isRemovedKey(key)) { if (this.sentinelValues == null) { this.sentinelValues = new SentinelValues(); this.addRemovedKeyValue(toBeAdded); } else if (this.sentinelValues.containsOneKey) { this.sentinelValues.oneValue += toBeAdded; } else { this.addRemovedKeyValue(toBeAdded); } return this.sentinelValues.oneValue; } int index = this.probe(key); if (this.keysValues[index] == key) { this.keysValues[index + 1] += toBeAdded; return this.keysValues[index + 1]; } this.addKeyValueAtIndex(key, toBeAdded, index); return toBeAdded; } private void addKeyValueAtIndex(int key, int value, int index) { if (this.keysValues[index] == REMOVED_KEY) { this.occupiedWithSentinels--; } if (this.copyKeysOnWrite) { this.copyKeys(); } this.keysValues[index] = key; this.keysValues[index + 1] = value; this.occupiedWithData++; if (this.occupiedWithData + this.occupiedWithSentinels > this.maxOccupiedWithData()) { this.rehashAndGrow(); } } private void removeKeyAtIndex(int index) { if (this.copyKeysOnWrite) { this.copyKeys(); } this.keysValues[index] = REMOVED_KEY; this.keysValues[index + 1] = EMPTY_VALUE; this.occupiedWithData--; this.occupiedWithSentinels++; } private void copyKeys() { int[] copy = new int[this.keysValues.length]; System.arraycopy(this.keysValues, 0, copy, 0, this.keysValues.length); this.keysValues = copy; this.copyKeysOnWrite = false; } @Override public int updateValue(int key, int initialValueIfAbsent, IntToIntFunction function) { if (isEmptyKey(key)) { if (this.sentinelValues == null) { this.sentinelValues = new SentinelValues(); this.addEmptyKeyValue(function.valueOf(initialValueIfAbsent)); } else if (this.sentinelValues.containsZeroKey) { this.sentinelValues.zeroValue = function.valueOf(this.sentinelValues.zeroValue); } else { this.addEmptyKeyValue(function.valueOf(initialValueIfAbsent)); } return this.sentinelValues.zeroValue; } if (isRemovedKey(key)) { if (this.sentinelValues == null) { this.sentinelValues = new SentinelValues(); this.addRemovedKeyValue(function.valueOf(initialValueIfAbsent)); } else if (this.sentinelValues.containsOneKey) { this.sentinelValues.oneValue = function.valueOf(this.sentinelValues.oneValue); } else { this.addRemovedKeyValue(function.valueOf(initialValueIfAbsent)); } return this.sentinelValues.oneValue; } int index = this.probe(key); if (this.keysValues[index] == key) { this.keysValues[index + 1] = function.valueOf(this.keysValues[index + 1]); return this.keysValues[index + 1]; } int value = function.valueOf(initialValueIfAbsent); this.addKeyValueAtIndex(key, value, index); return value; } @Override public IntIntHashMap withKeyValue(int key1, int value1) { this.put(key1, value1); return this; } public IntIntHashMap withKeysValues(int key1, int value1, int key2, int value2) { this.put(key1, value1); this.put(key2, value2); return this; } public IntIntHashMap withKeysValues(int key1, int value1, int key2, int value2, int key3, int value3) { this.put(key1, value1); this.put(key2, value2); this.put(key3, value3); return this; } public IntIntHashMap withKeysValues(int key1, int value1, int key2, int value2, int key3, int value3, int key4, int value4) { this.put(key1, value1); this.put(key2, value2); this.put(key3, value3); this.put(key4, value4); return this; } @Override public IntIntHashMap withoutKey(int key) { this.removeKey(key); return this; } @Override public IntIntHashMap withoutAllKeys(IntIterable keys) { keys.forEach(this::removeKey); return this; } @Override public MutableIntIntMap asUnmodifiable() { return new UnmodifiableIntIntMap(this); } @Override public MutableIntIntMap asSynchronized() { return new SynchronizedIntIntMap(this); } @Override public ImmutableIntIntMap toImmutable() { return IntIntMaps.immutable.ofAll(this); } @Override public int get(int key) { return this.getIfAbsent(key, EMPTY_VALUE); } @Override public int getIfAbsent(int key, int ifAbsent) { if (isEmptyKey(key) || isRemovedKey(key)) { return this.getForSentinel(key, ifAbsent); } if (this.occupiedWithSentinels == 0) { return this.fastGetIfAbsent(key, ifAbsent); } return this.slowGetIfAbsent(key, ifAbsent); } private int getForSentinel(int key, int ifAbsent) { if (isEmptyKey(key)) { if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey) { return ifAbsent; } return this.sentinelValues.zeroValue; } if (this.sentinelValues == null || !this.sentinelValues.containsOneKey) { return ifAbsent; } return this.sentinelValues.oneValue; } private int slowGetIfAbsent(int key, int ifAbsent) { int index = this.probe(key); if (this.keysValues[index] == key) { return this.keysValues[index + 1]; } return ifAbsent; } private int fastGetIfAbsent(int key, int ifAbsent) { int index = this.mask((int) key) << 1; for (int i = 0; i < INITIAL_LINEAR_PROBE; i += 2) { int keyAtIndex = this.keysValues[index]; if (keyAtIndex == key) { return this.keysValues[index + 1]; } if (keyAtIndex == EMPTY_KEY) { return ifAbsent; } index = (index + 2) & (this.keysValues.length - 1); } return this.slowGetIfAbsentTwo(key, ifAbsent); } private int slowGetIfAbsentTwo(int key, int ifAbsent) { int index = this.probeTwo(key, -1); if (this.keysValues[index] == key) { return this.keysValues[index + 1]; } return ifAbsent; } @Override public int getOrThrow(int key) { if (isEmptyKey(key)) { if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey) { throw new IllegalStateException("Key " + key + " not present."); } return this.sentinelValues.zeroValue; } if (isRemovedKey(key)) { if (this.sentinelValues == null || !this.sentinelValues.containsOneKey) { throw new IllegalStateException("Key " + key + " not present."); } return this.sentinelValues.oneValue; } int index = this.probe(key); if (isNonSentinel(this.keysValues[index])) { return this.keysValues[index + 1]; } throw new IllegalStateException("Key " + key + " not present."); } @Override public boolean containsKey(int key) { if (isEmptyKey(key)) { return this.sentinelValues != null && this.sentinelValues.containsZeroKey; } if (isRemovedKey(key)) { return this.sentinelValues != null && this.sentinelValues.containsOneKey; } return this.keysValues[this.probe(key)] == key; } @Override public void forEachKey(IntProcedure procedure) { if (this.sentinelValues != null) { if (this.sentinelValues.containsZeroKey) { procedure.value(EMPTY_KEY); } if (this.sentinelValues.containsOneKey) { procedure.value(REMOVED_KEY); } } for (int i = 0; i < this.keysValues.length; i += 2) { if (isNonSentinel(this.keysValues[i])) { procedure.value(this.keysValues[i]); } } } @Override public void forEachKeyValue(IntIntProcedure procedure) { if (this.sentinelValues != null) { if (this.sentinelValues.containsZeroKey) { procedure.value(EMPTY_KEY, this.sentinelValues.zeroValue); } if (this.sentinelValues.containsOneKey) { procedure.value(REMOVED_KEY, this.sentinelValues.oneValue); } } for (int i = 0; i < this.keysValues.length; i += 2) { if (isNonSentinel(this.keysValues[i])) { procedure.value(this.keysValues[i], this.keysValues[i + 1]); } } } @Override public LazyIntIterable keysView() { return new KeysView(); } @Override public RichIterable<IntIntPair> keyValuesView() { return new KeyValuesView(); } @Override public MutableIntIntMap flipUniqueValues() { MutableIntIntMap result = IntIntMaps.mutable.empty(); this.forEachKeyValue((key, value) -> { if (result.containsKey(value)) { throw new IllegalStateException("Duplicate value: " + value + " found at key: " + result.get(value) + " and key: " + key); } result.put(value, key); }); return result; } @Override public IntIntHashMap select(IntIntPredicate predicate) { IntIntHashMap result = new IntIntHashMap(); if (this.sentinelValues != null) { if (this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY, this.sentinelValues.zeroValue)) { result.put(EMPTY_KEY, this.sentinelValues.zeroValue); } if (this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY, this.sentinelValues.oneValue)) { result.put(REMOVED_KEY, this.sentinelValues.oneValue); } } for (int i = 0; i < this.keysValues.length; i += 2) { if (isNonSentinel(this.keysValues[i]) && predicate.accept(this.keysValues[i], this.keysValues[i + 1])) { result.put(this.keysValues[i], this.keysValues[i + 1]); } } return result; } @Override public IntIntHashMap reject(IntIntPredicate predicate) { IntIntHashMap result = new IntIntHashMap(); if (this.sentinelValues != null) { if (this.sentinelValues.containsZeroKey && !predicate.accept(EMPTY_KEY, this.sentinelValues.zeroValue)) { result.put(EMPTY_KEY, this.sentinelValues.zeroValue); } if (this.sentinelValues.containsOneKey && !predicate.accept(REMOVED_KEY, this.sentinelValues.oneValue)) { result.put(REMOVED_KEY, this.sentinelValues.oneValue); } } for (int i = 0; i < this.keysValues.length; i += 2) { if (isNonSentinel(this.keysValues[i]) && !predicate.accept(this.keysValues[i], this.keysValues[i + 1])) { result.put(this.keysValues[i], this.keysValues[i + 1]); } } return result; } @Override public void writeExternal(ObjectOutput out) throws IOException { out.writeInt(this.size()); if (this.sentinelValues != null) { if (this.sentinelValues.containsZeroKey) { out.writeInt(EMPTY_KEY); out.writeInt(this.sentinelValues.zeroValue); } if (this.sentinelValues.containsOneKey) { out.writeInt(REMOVED_KEY); out.writeInt(this.sentinelValues.oneValue); } } for (int i = 0; i < this.keysValues.length; i += 2) { if (isNonSentinel(this.keysValues[i])) { out.writeInt(this.keysValues[i]); out.writeInt(this.keysValues[i + 1]); } } } @Override public void readExternal(ObjectInput in) throws IOException, ClassNotFoundException { int size = in.readInt(); for (int i = 0; i < size; i++) { this.put(in.readInt(), in.readInt()); } }
Rehashes every element in the set into a new backing table of the smallest possible size and eliminating removed sentinels.
/** * Rehashes every element in the set into a new backing table of the smallest possible size and eliminating removed sentinels. */
public void compact() { this.rehash(this.smallestPowerOfTwoGreaterThan(this.size())); } private void rehashAndGrow() { this.rehash(this.keysValues.length); } private void rehash(int newCapacity) { int oldLength = this.keysValues.length; int[] old = this.keysValues; this.allocateTable(newCapacity); this.occupiedWithData = 0; this.occupiedWithSentinels = 0; for (int i = 0; i < oldLength; i += 2) { if (isNonSentinel(old[i])) { this.put(old[i], old[i + 1]); } } } // exposed for testing int probe(int element) { int index = this.mask((int) element) << 1; int keyAtIndex = this.keysValues[index]; if (keyAtIndex == element || keyAtIndex == EMPTY_KEY) { return index; } int removedIndex = keyAtIndex == REMOVED_KEY ? index : -1; for (int i = 2; i < INITIAL_LINEAR_PROBE; i += 2) { int nextIndex = (index + i) & (this.keysValues.length - 1); keyAtIndex = this.keysValues[nextIndex]; if (keyAtIndex == element) { return nextIndex; } if (keyAtIndex == EMPTY_KEY) { return removedIndex == -1 ? nextIndex : removedIndex; } if (keyAtIndex == REMOVED_KEY && removedIndex == -1) { removedIndex = nextIndex; } } return this.probeTwo(element, removedIndex); } int probeTwo(int element, int removedIndex) { int index = this.spreadTwoAndMask(element) << 1; for (int i = 0; i < INITIAL_LINEAR_PROBE; i += 2) { int nextIndex = (index + i) & (this.keysValues.length - 1); int keyAtIndex = this.keysValues[nextIndex]; if (keyAtIndex == element) { return nextIndex; } if (keyAtIndex == EMPTY_KEY) { return removedIndex == -1 ? nextIndex : removedIndex; } if (keyAtIndex == REMOVED_KEY && removedIndex == -1) { removedIndex = nextIndex; } } return this.probeThree(element, removedIndex); } int probeThree(int element, int removedIndex) { int nextIndex = (int) SpreadFunctions.intSpreadOne(element) << 1; int spreadTwo = Integer.reverse(SpreadFunctions.intSpreadTwo(element)) | 1; while (true) { nextIndex = this.mask((nextIndex >> 1) + spreadTwo) << 1; int keyAtIndex = this.keysValues[nextIndex]; if (keyAtIndex == element) { return nextIndex; } if (keyAtIndex == EMPTY_KEY) { return removedIndex == -1 ? nextIndex : removedIndex; } if (keyAtIndex == REMOVED_KEY && removedIndex == -1) { removedIndex = nextIndex; } } } // exposed for testing int spreadAndMask(int element) { int code = SpreadFunctions.intSpreadOne(element); return this.mask(code); } int spreadTwoAndMask(int element) { int code = SpreadFunctions.intSpreadTwo(element); return this.mask(code); } private int mask(int spread) { return spread & ((this.keysValues.length >> 1) - 1); } private void allocateTable(int sizeToAllocate) { this.keysValues = new int[sizeToAllocate << 1]; } private static boolean isEmptyKey(int key) { return key == EMPTY_KEY; } private static boolean isRemovedKey(int key) { return key == REMOVED_KEY; } private static boolean isNonSentinel(int key) { return !isEmptyKey(key) && !isRemovedKey(key); } @Override protected boolean isNonSentinelAtIndex(int index) { return !isEmptyKey(this.keysValues[index * 2]) && !isRemovedKey(this.keysValues[index * 2]); } private int maxOccupiedWithData() { return this.keysValues.length >> 2; } private int maxOccupiedWithSentinels() { return this.keysValues.length >> 3; } private class InternalIntIterator implements MutableIntIterator { private int count; private int position; private int lastKey; private boolean handledZero; private boolean handledOne; private boolean canRemove; @Override public boolean hasNext() { return this.count < IntIntHashMap.this.size(); } @Override public int next() { if (!this.hasNext()) { throw new NoSuchElementException("next() called, but the iterator is exhausted"); } this.count++; this.canRemove = true; if (!this.handledZero) { this.handledZero = true; if (IntIntHashMap.this.containsKey(EMPTY_KEY)) { this.lastKey = EMPTY_KEY; return IntIntHashMap.this.get(EMPTY_KEY); } } if (!this.handledOne) { this.handledOne = true; if (IntIntHashMap.this.containsKey(REMOVED_KEY)) { this.lastKey = REMOVED_KEY; return IntIntHashMap.this.get(REMOVED_KEY); } } int[] keys = IntIntHashMap.this.keysValues; while (!isNonSentinel(keys[this.position])) { this.position += 2; } this.lastKey = keys[this.position]; int result = IntIntHashMap.this.keysValues[this.position + 1]; this.position += 2; return result; } @Override public void remove() { if (!this.canRemove) { throw new IllegalStateException(); } IntIntHashMap.this.removeKey(this.lastKey); this.count--; this.canRemove = false; } } private class KeysView extends AbstractLazyIntIterable { @Override public IntIterator intIterator() { return new UnmodifiableIntIterator(new KeySetIterator()); }
Since:7.0.
/** * @since 7.0. */
@Override public void each(IntProcedure procedure) { IntIntHashMap.this.forEachKey(procedure); } } private class KeySetIterator implements MutableIntIterator { private int count; private int position; private int lastKey; private boolean handledZero; private boolean handledOne; private boolean canRemove; @Override public boolean hasNext() { return this.count < IntIntHashMap.this.size(); } @Override public int next() { if (!this.hasNext()) { throw new NoSuchElementException("next() called, but the iterator is exhausted"); } this.count++; this.canRemove = true; if (!this.handledZero) { this.handledZero = true; if (IntIntHashMap.this.containsKey(EMPTY_KEY)) { this.lastKey = EMPTY_KEY; return this.lastKey; } } if (!this.handledOne) { this.handledOne = true; if (IntIntHashMap.this.containsKey(REMOVED_KEY)) { this.lastKey = REMOVED_KEY; return this.lastKey; } } int[] keys = IntIntHashMap.this.keysValues; while (!isNonSentinel(keys[this.position])) { this.position += 2; } this.lastKey = keys[this.position]; this.position += 2; return this.lastKey; } @Override public void remove() { if (!this.canRemove) { throw new IllegalStateException(); } IntIntHashMap.this.removeKey(this.lastKey); this.count--; this.canRemove = false; } } @Override public MutableIntSet keySet() { return new KeySet(); } private class KeySet extends AbstractMutableIntKeySet { @Override protected MutableIntKeysMap getOuter() { return IntIntHashMap.this; } @Override protected SentinelValues getSentinelValues() { return IntIntHashMap.this.sentinelValues; } @Override protected int getKeyAtIndex(int index) { return IntIntHashMap.this.keysValues[index * 2]; } @Override protected int getTableSize() { return IntIntHashMap.this.keysValues.length / 2; } @Override public MutableIntIterator intIterator() { return new KeySetIterator(); } @Override public boolean retainAll(IntIterable source) { int oldSize = IntIntHashMap.this.size(); final IntSet sourceSet = source instanceof IntSet ? (IntSet) source : source.toSet(); IntIntHashMap retained = IntIntHashMap.this.select((int key, int value) -> sourceSet.contains(key)); if (retained.size() != oldSize) { IntIntHashMap.this.keysValues = retained.keysValues; IntIntHashMap.this.sentinelValues = retained.sentinelValues; IntIntHashMap.this.occupiedWithData = retained.occupiedWithData; IntIntHashMap.this.occupiedWithSentinels = retained.occupiedWithSentinels; return true; } return false; } @Override public boolean retainAll(int... source) { return this.retainAll(IntHashSet.newSetWith(source)); } @Override public IntSet freeze() { IntIntHashMap.this.copyKeysOnWrite = true; boolean containsZeroKey = false; boolean containsOneKey = false; if (IntIntHashMap.this.sentinelValues != null) { containsZeroKey = IntIntHashMap.this.sentinelValues.containsZeroKey; containsOneKey = IntIntHashMap.this.sentinelValues.containsOneKey; } return new ImmutableIntIntMapKeySet(IntIntHashMap.this.keysValues, IntIntHashMap.this.occupiedWithData, containsZeroKey, containsOneKey); }
Since:9.2.
/** * @since 9.2. */
@Override public MutableIntSet newEmpty() { return new IntHashSet(); } } @Override public MutableIntCollection values() { return new ValuesCollection(); } private class ValuesCollection extends AbstractIntValuesCollection { @Override public MutableIntIterator intIterator() { return IntIntHashMap.this.intIterator(); } @Override public boolean remove(int item) { int oldSize = IntIntHashMap.this.size(); if (IntIntHashMap.this.sentinelValues != null) { if (IntIntHashMap.this.sentinelValues.containsZeroKey && item == IntIntHashMap.this.sentinelValues.zeroValue) { IntIntHashMap.this.removeKey(EMPTY_KEY); } if (IntIntHashMap.this.sentinelValues.containsOneKey && item == IntIntHashMap.this.sentinelValues.oneValue) { IntIntHashMap.this.removeKey(REMOVED_KEY); } } for (int i = 0; i < IntIntHashMap.this.keysValues.length; i += 2) { if (isNonSentinel(IntIntHashMap.this.keysValues[i]) && item == IntIntHashMap.this.keysValues[i + 1]) { IntIntHashMap.this.removeKey(IntIntHashMap.this.keysValues[i]); } } return oldSize != IntIntHashMap.this.size(); } @Override public boolean retainAll(IntIterable source) { int oldSize = IntIntHashMap.this.size(); final IntSet sourceSet = source instanceof IntSet ? (IntSet) source : source.toSet(); IntIntHashMap retained = IntIntHashMap.this.select((int key, int value) -> sourceSet.contains(value)); if (retained.size() != oldSize) { IntIntHashMap.this.keysValues = retained.keysValues; IntIntHashMap.this.sentinelValues = retained.sentinelValues; IntIntHashMap.this.occupiedWithData = retained.occupiedWithData; IntIntHashMap.this.occupiedWithSentinels = retained.occupiedWithSentinels; return true; } return false; }
Since:9.2.
/** * @since 9.2. */
@Override public MutableIntCollection newEmpty() { return new IntHashBag(); } } private class KeyValuesView extends AbstractLazyIterable<IntIntPair> { @Override public void each(Procedure<? super IntIntPair> procedure) { if (IntIntHashMap.this.sentinelValues != null) { if (IntIntHashMap.this.sentinelValues.containsZeroKey) { procedure.value(PrimitiveTuples.pair(EMPTY_KEY, IntIntHashMap.this.sentinelValues.zeroValue)); } if (IntIntHashMap.this.sentinelValues.containsOneKey) { procedure.value(PrimitiveTuples.pair(REMOVED_KEY, IntIntHashMap.this.sentinelValues.oneValue)); } } for (int i = 0; i < IntIntHashMap.this.keysValues.length; i += 2) { if (isNonSentinel(IntIntHashMap.this.keysValues[i])) { procedure.value(PrimitiveTuples.pair(IntIntHashMap.this.keysValues[i], IntIntHashMap.this.keysValues[i + 1])); } } } @Override public void forEachWithIndex(ObjectIntProcedure<? super IntIntPair> objectIntProcedure) { int index = 0; if (IntIntHashMap.this.sentinelValues != null) { if (IntIntHashMap.this.sentinelValues.containsZeroKey) { objectIntProcedure.value(PrimitiveTuples.pair(EMPTY_KEY, IntIntHashMap.this.sentinelValues.zeroValue), index); index++; } if (IntIntHashMap.this.sentinelValues.containsOneKey) { objectIntProcedure.value(PrimitiveTuples.pair(REMOVED_KEY, IntIntHashMap.this.sentinelValues.oneValue), index); index++; } } for (int i = 0; i < IntIntHashMap.this.keysValues.length; i += 2) { if (isNonSentinel(IntIntHashMap.this.keysValues[i])) { objectIntProcedure.value(PrimitiveTuples.pair(IntIntHashMap.this.keysValues[i], IntIntHashMap.this.keysValues[i + 1]), index); index++; } } } @Override public <P> void forEachWith(Procedure2<? super IntIntPair, ? super P> procedure, P parameter) { if (IntIntHashMap.this.sentinelValues != null) { if (IntIntHashMap.this.sentinelValues.containsZeroKey) { procedure.value(PrimitiveTuples.pair(EMPTY_KEY, IntIntHashMap.this.sentinelValues.zeroValue), parameter); } if (IntIntHashMap.this.sentinelValues.containsOneKey) { procedure.value(PrimitiveTuples.pair(REMOVED_KEY, IntIntHashMap.this.sentinelValues.oneValue), parameter); } } for (int i = 0; i < IntIntHashMap.this.keysValues.length; i += 2) { if (isNonSentinel(IntIntHashMap.this.keysValues[i])) { procedure.value(PrimitiveTuples.pair(IntIntHashMap.this.keysValues[i], IntIntHashMap.this.keysValues[i + 1]), parameter); } } } @Override public Iterator<IntIntPair> iterator() { return new InternalKeyValuesIterator(); } public class InternalKeyValuesIterator implements Iterator<IntIntPair> { private int count; private int position; private boolean handledZero; private boolean handledOne; @Override public IntIntPair next() { if (!this.hasNext()) { throw new NoSuchElementException("next() called, but the iterator is exhausted"); } this.count++; if (!this.handledZero) { this.handledZero = true; if (IntIntHashMap.this.containsKey(EMPTY_KEY)) { return PrimitiveTuples.pair(EMPTY_KEY, IntIntHashMap.this.sentinelValues.zeroValue); } } if (!this.handledOne) { this.handledOne = true; if (IntIntHashMap.this.containsKey(REMOVED_KEY)) { return PrimitiveTuples.pair(REMOVED_KEY, IntIntHashMap.this.sentinelValues.oneValue); } } int[] keys = IntIntHashMap.this.keysValues; while (!isNonSentinel(keys[this.position])) { this.position += 2; } IntIntPair result = PrimitiveTuples.pair(keys[this.position], IntIntHashMap.this.keysValues[this.position + 1]); this.position += 2; return result; } @Override public void remove() { throw new UnsupportedOperationException("Cannot call remove() on " + this.getClass().getSimpleName()); } @Override public boolean hasNext() { return this.count != IntIntHashMap.this.size(); } } } }