com.gs.collections.impl.map.mutable.primitive.ByteLongHashMap Maven / Gradle / Ivy
Show all versions of gs-collections Show documentation
/*
* Copyright 2014 Goldman Sachs.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.gs.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 com.gs.collections.api.ByteIterable;
import com.gs.collections.api.LazyByteIterable;
import com.gs.collections.api.LongIterable;
import com.gs.collections.api.RichIterable;
import com.gs.collections.api.block.function.primitive.ByteToLongFunction;
import com.gs.collections.api.block.function.primitive.LongFunction;
import com.gs.collections.api.block.function.primitive.LongFunction0;
import com.gs.collections.api.block.function.primitive.LongToLongFunction;
import com.gs.collections.api.block.function.primitive.ObjectLongToObjectFunction;
import com.gs.collections.api.block.predicate.primitive.ByteLongPredicate;
import com.gs.collections.api.block.procedure.Procedure;
import com.gs.collections.api.block.procedure.Procedure2;
import com.gs.collections.api.block.procedure.primitive.ByteProcedure;
import com.gs.collections.api.block.procedure.primitive.ByteLongProcedure;
import com.gs.collections.api.block.procedure.primitive.ObjectIntProcedure;
import com.gs.collections.impl.SpreadFunctions;
import com.gs.collections.api.collection.primitive.MutableLongCollection;
import com.gs.collections.api.iterator.ByteIterator;
import com.gs.collections.api.iterator.MutableByteIterator;
import com.gs.collections.api.iterator.MutableLongIterator;
import com.gs.collections.api.map.primitive.ByteLongMap;
import com.gs.collections.api.map.primitive.ImmutableByteLongMap;
import com.gs.collections.api.map.primitive.MutableByteLongMap;
import com.gs.collections.api.set.primitive.ByteSet;
import com.gs.collections.api.set.primitive.LongSet;
import com.gs.collections.api.set.primitive.MutableByteSet;
import com.gs.collections.api.tuple.primitive.ByteLongPair;
import com.gs.collections.impl.factory.primitive.ByteLongMaps;
import com.gs.collections.impl.iterator.UnmodifiableByteIterator;
import com.gs.collections.impl.lazy.AbstractLazyIterable;
import com.gs.collections.impl.lazy.primitive.AbstractLazyByteIterable;
import com.gs.collections.impl.set.mutable.primitive.ByteHashSet;
import com.gs.collections.impl.tuple.primitive.PrimitiveTuples;
/**
* This file was automatically generated from template file primitivePrimitiveHashMap.stg.
*
* @since 3.0.
*/
public class ByteLongHashMap extends AbstractMutableLongValuesMap implements MutableByteLongMap, Externalizable, MutableByteKeysMap
{
private static final long EMPTY_VALUE = 0L;
private static final long serialVersionUID = 1L;
private static final byte EMPTY_KEY = (byte) 0;
private static final byte REMOVED_KEY = (byte) 1;
private static final int CACHE_LINE_SIZE = 64;
private static final int KEY_SIZE = 1;
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 byte[] keys;
private long[] values;
private int occupiedWithData;
private int occupiedWithSentinels;
private SentinelValues sentinelValues;
private boolean copyKeysOnWrite;
public ByteLongHashMap()
{
this.allocateTable(DEFAULT_INITIAL_CAPACITY << 1);
}
public ByteLongHashMap(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 ByteLongHashMap(ByteLongMap map)
{
if (map instanceof ByteLongHashMap && ((ByteLongHashMap) map).occupiedWithSentinels == 0)
{
ByteLongHashMap hashMap = (ByteLongHashMap) map;
this.occupiedWithData = hashMap.occupiedWithData;
if (hashMap.sentinelValues != null)
{
this.sentinelValues = hashMap.sentinelValues.copy();
}
this.keys = Arrays.copyOf(hashMap.keys, hashMap.keys.length);
this.values = Arrays.copyOf(hashMap.values, hashMap.values.length);
}
else
{
int capacity = this.smallestPowerOfTwoGreaterThan(Math.max(map.size(), DEFAULT_INITIAL_CAPACITY) << 1);
this.allocateTable(capacity);
this.putAll(map);
}
}
public static ByteLongHashMap newWithKeysValues(byte key1, long value1)
{
return new ByteLongHashMap(1).withKeyValue(key1, value1);
}
public static ByteLongHashMap newWithKeysValues(byte key1, long value1, byte key2, long value2)
{
return new ByteLongHashMap(2).withKeysValues(key1, value1, key2, value2);
}
public static ByteLongHashMap newWithKeysValues(byte key1, long value1, byte key2, long value2, byte key3, long value3)
{
return new ByteLongHashMap(3).withKeysValues(key1, value1, key2, value2, key3, value3);
}
public static ByteLongHashMap newWithKeysValues(byte key1, long value1, byte key2, long value2, byte key3, long value3, byte key4, long value4)
{
return new ByteLongHashMap(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 long getEmptyValue()
{
return EMPTY_VALUE;
}
@Override
protected int getTableSize()
{
return this.values.length;
}
@Override
protected long getValueAtIndex(int index)
{
return this.values[index];
}
@Override
public boolean equals(Object obj)
{
if (this == obj)
{
return true;
}
if (!(obj instanceof ByteLongMap))
{
return false;
}
ByteLongMap other = (ByteLongMap) 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.keys.length; i++)
{
byte key = this.keys[i];
if (isNonSentinel(key) && (!other.containsKey(key) || this.values[i] != other.getOrThrow(key)))
{
return false;
}
}
return true;
}
@Override
public int hashCode()
{
int result = 0;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
result += (int) EMPTY_KEY ^ (int) (this.sentinelValues.zeroValue ^ this.sentinelValues.zeroValue >>> 32);
}
if (this.sentinelValues.containsOneKey)
{
result += (int) REMOVED_KEY ^ (int) (this.sentinelValues.oneValue ^ this.sentinelValues.oneValue >>> 32);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
result += (int) this.keys[i] ^ (int) (this.values[i] ^ this.values[i] >>> 32);
}
}
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.keys.length; i++)
{
byte key = this.keys[i];
if (isNonSentinel(key))
{
if (!first)
{
appendable.append(", ");
}
appendable.append(key).append("=").append(this.values[i]);
first = false;
}
}
appendable.append("}");
return appendable.toString();
}
public MutableLongIterator longIterator()
{
return new InternalLongIterator();
}
public V injectInto(V injectedValue, ObjectLongToObjectFunction 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.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
result = function.valueOf(result, this.values[i]);
}
}
return result;
}
public void clear()
{
this.sentinelValues = null;
this.occupiedWithData = 0;
this.occupiedWithSentinels = 0;
if (this.copyKeysOnWrite)
{
this.copyKeys();
}
Arrays.fill(this.keys, EMPTY_KEY);
Arrays.fill(this.values, EMPTY_VALUE);
}
public void put(byte key, long value)
{
if (isEmptyKey(key))
{
this.putForEmptySentinel(value);
return;
}
if (isRemovedKey(key))
{
this.putForRemovedSentinel(value);
return;
}
int index = this.probe(key);
byte keyAtIndex = this.keys[index];
if (keyAtIndex == key)
{
this.values[index] = value;
}
else
{
this.addKeyValueAtIndex(key, value, index);
}
}
private void putForRemovedSentinel(long value)
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues();
}
this.addRemovedKeyValue(value);
}
private void putForEmptySentinel(long value)
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues();
}
this.addEmptyKeyValue(value);
}
public void putAll(ByteLongMap map)
{
map.forEachKeyValue(new ByteLongProcedure()
{
public void value(byte key, long value)
{
ByteLongHashMap.this.put(key, value);
}
});
}
public void removeKey(byte 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.keys[index] == key)
{
this.removeKeyAtIndex(index);
}
}
public void remove(byte key)
{
this.removeKey(key);
}
public long removeKeyIfAbsent(byte key, long value)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey)
{
return value;
}
long oldValue = this.sentinelValues.zeroValue;
this.removeEmptyKey();
return oldValue;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null || !this.sentinelValues.containsOneKey)
{
return value;
}
long oldValue = this.sentinelValues.oneValue;
this.removeRemovedKey();
return oldValue;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
long oldValue = this.values[index];
this.removeKeyAtIndex(index);
return oldValue;
}
return value;
}
public long getIfAbsentPut(byte key, long 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.keys[index] == key)
{
return this.values[index];
}
this.addKeyValueAtIndex(key, value, index);
return value;
}
public long getIfAbsentPut(byte key, LongFunction0 function)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
long value = function.value();
this.sentinelValues = new SentinelValues();
this.addEmptyKeyValue(value);
return value;
}
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
long value = function.value();
this.addEmptyKeyValue(value);
return value;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
long value = function.value();
this.sentinelValues = new SentinelValues();
this.addRemovedKeyValue(value);
return value;
}
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
long value = function.value();
this.addRemovedKeyValue(value);
return value;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[index];
}
long value = function.value();
this.addKeyValueAtIndex(key, value, index);
return value;
}
public long getIfAbsentPutWith(byte key, LongFunction function, P parameter)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
long value = function.longValueOf(parameter);
this.sentinelValues = new SentinelValues();
this.addEmptyKeyValue(value);
return value;
}
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
long value = function.longValueOf(parameter);
this.addEmptyKeyValue(value);
return value;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
long value = function.longValueOf(parameter);
this.sentinelValues = new SentinelValues();
this.addRemovedKeyValue(value);
return value;
}
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
long value = function.longValueOf(parameter);
this.addRemovedKeyValue(value);
return value;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[index];
}
long value = function.longValueOf(parameter);
this.addKeyValueAtIndex(key, value, index);
return value;
}
public long getIfAbsentPutWithKey(byte key, ByteToLongFunction function)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
long value = function.valueOf(key);
this.sentinelValues = new SentinelValues();
this.addEmptyKeyValue(value);
return value;
}
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
long value = function.valueOf(key);
this.addEmptyKeyValue(value);
return value;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
long value = function.valueOf(key);
this.sentinelValues = new SentinelValues();
this.addRemovedKeyValue(value);
return value;
}
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
long value = function.valueOf(key);
this.addRemovedKeyValue(value);
return value;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[index];
}
long value = function.valueOf(key);
this.addKeyValueAtIndex(key, value, index);
return value;
}
public long addToValue(byte key, long 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.keys[index] == key)
{
this.values[index] += toBeAdded;
return this.values[index];
}
this.addKeyValueAtIndex(key, toBeAdded, index);
return this.values[index];
}
private void addKeyValueAtIndex(byte key, long value, int index)
{
if (this.keys[index] == REMOVED_KEY)
{
this.occupiedWithSentinels--;
}
if (this.copyKeysOnWrite)
{
this.copyKeys();
}
this.keys[index] = key;
this.values[index] = value;
this.occupiedWithData++;
if (this.occupiedWithData + this.occupiedWithSentinels > this.maxOccupiedWithData())
{
this.rehashAndGrow();
}
}
private void removeKeyAtIndex(int index)
{
if (this.copyKeysOnWrite)
{
this.copyKeys();
}
this.keys[index] = REMOVED_KEY;
this.values[index] = EMPTY_VALUE;
this.occupiedWithData--;
this.occupiedWithSentinels++;
}
private void copyKeys()
{
byte[] copy = new byte[this.keys.length];
System.arraycopy(this.keys, 0, copy, 0, this.keys.length);
this.keys = copy;
this.copyKeysOnWrite = false;
}
public long updateValue(byte key, long initialValueIfAbsent, LongToLongFunction 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.keys[index] == key)
{
this.values[index] = function.valueOf(this.values[index]);
return this.values[index];
}
long value = function.valueOf(initialValueIfAbsent);
this.addKeyValueAtIndex(key, value, index);
return value;
}
public ByteLongHashMap withKeyValue(byte key1, long value1)
{
this.put(key1, value1);
return this;
}
public ByteLongHashMap withKeysValues(byte key1, long value1, byte key2, long value2)
{
this.put(key1, value1);
this.put(key2, value2);
return this;
}
public ByteLongHashMap withKeysValues(byte key1, long value1, byte key2, long value2, byte key3, long value3)
{
this.put(key1, value1);
this.put(key2, value2);
this.put(key3, value3);
return this;
}
public ByteLongHashMap withKeysValues(byte key1, long value1, byte key2, long value2, byte key3, long value3, byte key4, long value4)
{
this.put(key1, value1);
this.put(key2, value2);
this.put(key3, value3);
this.put(key4, value4);
return this;
}
public ByteLongHashMap withoutKey(byte key)
{
this.removeKey(key);
return this;
}
public ByteLongHashMap withoutAllKeys(ByteIterable keys)
{
keys.forEach(new ByteProcedure()
{
public void value(byte key)
{
ByteLongHashMap.this.removeKey(key);
}
});
return this;
}
public MutableByteLongMap asUnmodifiable()
{
return new UnmodifiableByteLongMap(this);
}
public MutableByteLongMap asSynchronized()
{
return new SynchronizedByteLongMap(this);
}
public ImmutableByteLongMap toImmutable()
{
return ByteLongMaps.immutable.ofAll(this);
}
public long get(byte key)
{
return this.getIfAbsent(key, EMPTY_VALUE);
}
public long getIfAbsent(byte key, long ifAbsent)
{
if (isEmptyKey(key) || isRemovedKey(key))
{
return this.getForSentinel(key, ifAbsent);
}
return this.slowGetIfAbsent(key, ifAbsent);
}
private long getForSentinel(byte key, long 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 long slowGetIfAbsent(byte key, long ifAbsent)
{
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[index];
}
return ifAbsent;
}
public long getOrThrow(byte 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.keys[index]))
{
return this.values[index];
}
throw new IllegalStateException("Key " + key + " not present.");
}
public boolean containsKey(byte key)
{
if (isEmptyKey(key))
{
return this.sentinelValues != null && this.sentinelValues.containsZeroKey;
}
if (isRemovedKey(key))
{
return this.sentinelValues != null && this.sentinelValues.containsOneKey;
}
return this.keys[this.probe(key)] == key;
}
public void forEachKey(ByteProcedure 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.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
procedure.value(this.keys[i]);
}
}
}
public void forEachKeyValue(ByteLongProcedure 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.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
procedure.value(this.keys[i], this.values[i]);
}
}
}
public LazyByteIterable keysView()
{
return new KeysView();
}
public RichIterable keyValuesView()
{
return new KeyValuesView();
}
public ByteLongHashMap select(ByteLongPredicate predicate)
{
ByteLongHashMap result = new ByteLongHashMap();
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.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.keys[i], this.values[i]))
{
result.put(this.keys[i], this.values[i]);
}
}
return result;
}
public ByteLongHashMap reject(ByteLongPredicate predicate)
{
ByteLongHashMap result = new ByteLongHashMap();
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.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && !predicate.accept(this.keys[i], this.values[i]))
{
result.put(this.keys[i], this.values[i]);
}
}
return result;
}
public void writeExternal(ObjectOutput out) throws IOException
{
out.writeInt(this.size());
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
out.writeByte(EMPTY_KEY);
out.writeLong(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
out.writeByte(REMOVED_KEY);
out.writeLong(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
out.writeByte(this.keys[i]);
out.writeLong(this.values[i]);
}
}
}
public void readExternal(ObjectInput in) throws IOException, ClassNotFoundException
{
int size = in.readInt();
for (int i = 0; i < size; i++)
{
this.put(in.readByte(), in.readLong());
}
}
/**
* 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.keys.length << 1);
}
private void rehash(int newCapacity)
{
int oldLength = this.keys.length;
byte[] old = this.keys;
long[] oldValues = this.values;
this.allocateTable(newCapacity);
this.occupiedWithData = 0;
this.occupiedWithSentinels = 0;
for (int i = 0; i < oldLength; i++)
{
if (isNonSentinel(old[i]))
{
this.put(old[i], oldValues[i]);
}
}
}
// exposed for testing
int probe(byte element)
{
int index = this.spreadAndMask(element);
byte keyAtIndex = this.keys[index];
if (keyAtIndex == element || keyAtIndex == EMPTY_KEY)
{
return index;
}
int removedIndex = keyAtIndex == REMOVED_KEY ? index : -1;
int nextIndex = index;
int probe = 17;
// loop until an empty slot is reached
while (true)
{
// Probe algorithm: 17*n*(n+1)/2 where n = number of collisions
nextIndex += probe;
probe += 17;
nextIndex &= this.keys.length - 1;
if (this.keys[nextIndex] == element)
{
return nextIndex;
}
if (this.keys[nextIndex] == REMOVED_KEY)
{
if (removedIndex == -1)
{
removedIndex = nextIndex;
}
}
else if (this.keys[nextIndex] == EMPTY_KEY)
{
return removedIndex == -1 ? nextIndex : removedIndex;
}
}
}
// exposed for testing
int spreadAndMask(byte element)
{
// No spreading necessary for 8-bit types
return this.mask(element);
}
private int mask(int spread)
{
return spread & (this.keys.length - 1);
}
private void allocateTable(int sizeToAllocate)
{
this.keys = new byte[sizeToAllocate];
this.values = new long[sizeToAllocate];
}
private static boolean isEmptyKey(byte key)
{
return key == EMPTY_KEY;
}
private static boolean isRemovedKey(byte key)
{
return key == REMOVED_KEY;
}
private static boolean isNonSentinel(byte key)
{
return !isEmptyKey(key) && !isRemovedKey(key);
}
@Override
protected boolean isNonSentinelAtIndex(int index)
{
return !isEmptyKey(this.keys[index]) && !isRemovedKey(this.keys[index]);
}
private int maxOccupiedWithData()
{
return this.keys.length >> 1;
}
private int maxOccupiedWithSentinels()
{
return this.keys.length >> 2;
}
private class InternalLongIterator implements MutableLongIterator
{
private int count;
private int position;
private byte lastKey;
private boolean handledZero;
private boolean handledOne;
private boolean canRemove;
public boolean hasNext()
{
return this.count < ByteLongHashMap.this.size();
}
public long 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 (ByteLongHashMap.this.containsKey(EMPTY_KEY))
{
this.lastKey = EMPTY_KEY;
return ByteLongHashMap.this.get(EMPTY_KEY);
}
}
if (!this.handledOne)
{
this.handledOne = true;
if (ByteLongHashMap.this.containsKey(REMOVED_KEY))
{
this.lastKey = REMOVED_KEY;
return ByteLongHashMap.this.get(REMOVED_KEY);
}
}
byte[] keys = ByteLongHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
this.lastKey = keys[this.position];
long result = ByteLongHashMap.this.values[this.position];
this.position++;
return result;
}
public void remove()
{
if (!this.canRemove)
{
throw new IllegalStateException();
}
ByteLongHashMap.this.removeKey(this.lastKey);
this.count--;
this.canRemove = false;
}
}
private class KeysView extends AbstractLazyByteIterable
{
public ByteIterator byteIterator()
{
return new UnmodifiableByteIterator(new KeySetIterator());
}
/**
* @since 7.0.
*/
public void each(ByteProcedure procedure)
{
ByteLongHashMap.this.forEachKey(procedure);
}
}
private class KeySetIterator implements MutableByteIterator
{
private int count;
private int position;
private byte lastKey;
private boolean handledZero;
private boolean handledOne;
private boolean canRemove;
public boolean hasNext()
{
return this.count < ByteLongHashMap.this.size();
}
public byte 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 (ByteLongHashMap.this.containsKey(EMPTY_KEY))
{
this.lastKey = EMPTY_KEY;
return this.lastKey;
}
}
if (!this.handledOne)
{
this.handledOne = true;
if (ByteLongHashMap.this.containsKey(REMOVED_KEY))
{
this.lastKey = REMOVED_KEY;
return this.lastKey;
}
}
byte[] keys = ByteLongHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
this.lastKey = keys[this.position];
this.position++;
return this.lastKey;
}
public void remove()
{
if (!this.canRemove)
{
throw new IllegalStateException();
}
ByteLongHashMap.this.removeKey(this.lastKey);
this.count--;
this.canRemove = false;
}
}
public MutableByteSet keySet()
{
return new KeySet();
}
private class KeySet extends AbstractMutableByteKeySet
{
@Override
protected MutableByteKeysMap getOuter()
{
return ByteLongHashMap.this;
}
@Override
protected SentinelValues getSentinelValues()
{
return ByteLongHashMap.this.sentinelValues;
}
@Override
protected byte getKeyAtIndex(int index)
{
return ByteLongHashMap.this.keys[index];
}
@Override
protected int getTableSize()
{
return ByteLongHashMap.this.keys.length;
}
public MutableByteIterator byteIterator()
{
return new KeySetIterator();
}
public boolean retainAll(ByteIterable source)
{
int oldSize = ByteLongHashMap.this.size();
final ByteSet sourceSet = source instanceof ByteSet ? (ByteSet) source : source.toSet();
ByteLongHashMap retained = ByteLongHashMap.this.select(new ByteLongPredicate()
{
public boolean accept(byte key, long value)
{
return sourceSet.contains(key);
}
});
if (retained.size() != oldSize)
{
ByteLongHashMap.this.keys = retained.keys;
ByteLongHashMap.this.values = retained.values;
ByteLongHashMap.this.sentinelValues = retained.sentinelValues;
ByteLongHashMap.this.occupiedWithData = retained.occupiedWithData;
ByteLongHashMap.this.occupiedWithSentinels = retained.occupiedWithSentinels;
return true;
}
return false;
}
public boolean retainAll(byte... source)
{
return this.retainAll(ByteHashSet.newSetWith(source));
}
public ByteSet freeze()
{
ByteLongHashMap.this.copyKeysOnWrite = true;
boolean containsZeroKey = false;
boolean containsOneKey = false;
if (ByteLongHashMap.this.sentinelValues != null)
{
containsZeroKey = ByteLongHashMap.this.sentinelValues.containsZeroKey;
containsOneKey = ByteLongHashMap.this.sentinelValues.containsOneKey;
}
return new ImmutableByteMapKeySet(ByteLongHashMap.this.keys, ByteLongHashMap.this.occupiedWithData, containsZeroKey, containsOneKey);
}
}
public MutableLongCollection values()
{
return new ValuesCollection();
}
private class ValuesCollection extends AbstractLongValuesCollection
{
public MutableLongIterator longIterator()
{
return ByteLongHashMap.this.longIterator();
}
public boolean remove(long item)
{
int oldSize = ByteLongHashMap.this.size();
if (ByteLongHashMap.this.sentinelValues != null)
{
if (ByteLongHashMap.this.sentinelValues.containsZeroKey && item == ByteLongHashMap.this.sentinelValues.zeroValue)
{
ByteLongHashMap.this.removeKey(EMPTY_KEY);
}
if (ByteLongHashMap.this.sentinelValues.containsOneKey && item == ByteLongHashMap.this.sentinelValues.oneValue)
{
ByteLongHashMap.this.removeKey(REMOVED_KEY);
}
}
for (int i = 0; i < ByteLongHashMap.this.keys.length; i++)
{
if (isNonSentinel(ByteLongHashMap.this.keys[i]) && item == ByteLongHashMap.this.values[i])
{
ByteLongHashMap.this.removeKey(ByteLongHashMap.this.keys[i]);
}
}
return oldSize != ByteLongHashMap.this.size();
}
public boolean retainAll(LongIterable source)
{
int oldSize = ByteLongHashMap.this.size();
final LongSet sourceSet = source instanceof LongSet ? (LongSet) source : source.toSet();
ByteLongHashMap retained = ByteLongHashMap.this.select(new ByteLongPredicate()
{
public boolean accept(byte key, long value)
{
return sourceSet.contains(value);
}
});
if (retained.size() != oldSize)
{
ByteLongHashMap.this.keys = retained.keys;
ByteLongHashMap.this.values = retained.values;
ByteLongHashMap.this.sentinelValues = retained.sentinelValues;
ByteLongHashMap.this.occupiedWithData = retained.occupiedWithData;
ByteLongHashMap.this.occupiedWithSentinels = retained.occupiedWithSentinels;
return true;
}
return false;
}
}
private class KeyValuesView extends AbstractLazyIterable
{
public void each(Procedure procedure)
{
if (ByteLongHashMap.this.sentinelValues != null)
{
if (ByteLongHashMap.this.sentinelValues.containsZeroKey)
{
procedure.value(PrimitiveTuples.pair(EMPTY_KEY, ByteLongHashMap.this.sentinelValues.zeroValue));
}
if (ByteLongHashMap.this.sentinelValues.containsOneKey)
{
procedure.value(PrimitiveTuples.pair(REMOVED_KEY, ByteLongHashMap.this.sentinelValues.oneValue));
}
}
for (int i = 0; i < ByteLongHashMap.this.keys.length; i++)
{
if (isNonSentinel(ByteLongHashMap.this.keys[i]))
{
procedure.value(PrimitiveTuples.pair(ByteLongHashMap.this.keys[i], ByteLongHashMap.this.values[i]));
}
}
}
public void forEachWithIndex(ObjectIntProcedure objectIntProcedure)
{
int index = 0;
if (ByteLongHashMap.this.sentinelValues != null)
{
if (ByteLongHashMap.this.sentinelValues.containsZeroKey)
{
objectIntProcedure.value(PrimitiveTuples.pair(EMPTY_KEY, ByteLongHashMap.this.sentinelValues.zeroValue), index);
index++;
}
if (ByteLongHashMap.this.sentinelValues.containsOneKey)
{
objectIntProcedure.value(PrimitiveTuples.pair(REMOVED_KEY, ByteLongHashMap.this.sentinelValues.oneValue), index);
index++;
}
}
for (int i = 0; i < ByteLongHashMap.this.keys.length; i++)
{
if (isNonSentinel(ByteLongHashMap.this.keys[i]))
{
objectIntProcedure.value(PrimitiveTuples.pair(ByteLongHashMap.this.keys[i], ByteLongHashMap.this.values[i]), index);
index++;
}
}
}
public void forEachWith(Procedure2 procedure, P parameter)
{
if (ByteLongHashMap.this.sentinelValues != null)
{
if (ByteLongHashMap.this.sentinelValues.containsZeroKey)
{
procedure.value(PrimitiveTuples.pair(EMPTY_KEY, ByteLongHashMap.this.sentinelValues.zeroValue), parameter);
}
if (ByteLongHashMap.this.sentinelValues.containsOneKey)
{
procedure.value(PrimitiveTuples.pair(REMOVED_KEY, ByteLongHashMap.this.sentinelValues.oneValue), parameter);
}
}
for (int i = 0; i < ByteLongHashMap.this.keys.length; i++)
{
if (isNonSentinel(ByteLongHashMap.this.keys[i]))
{
procedure.value(PrimitiveTuples.pair(ByteLongHashMap.this.keys[i], ByteLongHashMap.this.values[i]), parameter);
}
}
}
public Iterator iterator()
{
return new InternalKeyValuesIterator();
}
public class InternalKeyValuesIterator implements Iterator
{
private int count;
private int position;
private boolean handledZero;
private boolean handledOne;
public ByteLongPair next()
{
if (!this.hasNext())
{
throw new NoSuchElementException("next() called, but the iterator is exhausted");
}
this.count++;
if (!this.handledZero)
{
this.handledZero = true;
if (ByteLongHashMap.this.containsKey(EMPTY_KEY))
{
return PrimitiveTuples.pair(EMPTY_KEY, ByteLongHashMap.this.sentinelValues.zeroValue);
}
}
if (!this.handledOne)
{
this.handledOne = true;
if (ByteLongHashMap.this.containsKey(REMOVED_KEY))
{
return PrimitiveTuples.pair(REMOVED_KEY, ByteLongHashMap.this.sentinelValues.oneValue);
}
}
byte[] keys = ByteLongHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
ByteLongPair result = PrimitiveTuples.pair(keys[this.position], ByteLongHashMap.this.values[this.position]);
this.position++;
return result;
}
public void remove()
{
throw new UnsupportedOperationException("Cannot call remove() on " + this.getClass().getSimpleName());
}
public boolean hasNext()
{
return this.count != ByteLongHashMap.this.size();
}
}
}
}