com.gs.collections.impl.map.mutable.primitive.LongShortHashMap 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.LongIterable;
import com.gs.collections.api.LazyLongIterable;
import com.gs.collections.api.LazyShortIterable;
import com.gs.collections.api.ShortIterable;
import com.gs.collections.api.LazyIterable;
import com.gs.collections.api.RichIterable;
import com.gs.collections.api.bag.primitive.MutableLongBag;
import com.gs.collections.api.bag.primitive.MutableShortBag;
import com.gs.collections.api.block.function.primitive.LongToObjectFunction;
import com.gs.collections.api.block.function.primitive.LongToShortFunction;
import com.gs.collections.api.block.function.primitive.ShortFunction;
import com.gs.collections.api.block.function.primitive.ShortFunction0;
import com.gs.collections.api.block.function.primitive.ShortToShortFunction;
import com.gs.collections.api.block.function.primitive.ShortToObjectFunction;
import com.gs.collections.api.block.function.primitive.ObjectShortToObjectFunction;
import com.gs.collections.api.block.function.primitive.ObjectLongToObjectFunction;
import com.gs.collections.api.block.predicate.primitive.LongShortPredicate;
import com.gs.collections.api.block.predicate.primitive.LongPredicate;
import com.gs.collections.api.block.predicate.primitive.ShortPredicate;
import com.gs.collections.api.block.procedure.Procedure;
import com.gs.collections.api.block.procedure.Procedure2;
import com.gs.collections.api.block.procedure.primitive.LongProcedure;
import com.gs.collections.api.block.procedure.primitive.LongShortProcedure;
import com.gs.collections.api.block.procedure.primitive.ShortProcedure;
import com.gs.collections.api.block.procedure.primitive.ObjectIntProcedure;
import com.gs.collections.api.collection.MutableCollection;
import com.gs.collections.api.collection.primitive.ImmutableShortCollection;
import com.gs.collections.api.collection.primitive.MutableShortCollection;
import com.gs.collections.api.iterator.LongIterator;
import com.gs.collections.api.iterator.ShortIterator;
import com.gs.collections.api.list.primitive.MutableLongList;
import com.gs.collections.api.list.primitive.MutableShortList;
import com.gs.collections.api.map.primitive.LongShortMap;
import com.gs.collections.api.map.primitive.ImmutableLongShortMap;
import com.gs.collections.api.map.primitive.MutableLongShortMap;
import com.gs.collections.api.set.MutableSet;
import com.gs.collections.api.set.primitive.LongSet;
import com.gs.collections.api.set.primitive.ShortSet;
import com.gs.collections.api.set.primitive.ImmutableLongSet;
import com.gs.collections.api.set.primitive.MutableLongSet;
import com.gs.collections.api.tuple.primitive.LongShortPair;
import com.gs.collections.api.set.primitive.MutableShortSet;
import com.gs.collections.impl.bag.mutable.primitive.LongHashBag;
import com.gs.collections.impl.bag.mutable.primitive.ShortHashBag;
import com.gs.collections.impl.block.factory.primitive.LongPredicates;
import com.gs.collections.impl.collection.mutable.primitive.SynchronizedShortCollection;
import com.gs.collections.impl.collection.mutable.primitive.UnmodifiableShortCollection;
import com.gs.collections.impl.factory.Sets;
import com.gs.collections.impl.factory.primitive.ShortLists;
import com.gs.collections.impl.factory.primitive.LongShortMaps;
import com.gs.collections.impl.factory.primitive.LongSets;
import com.gs.collections.impl.lazy.AbstractLazyIterable;
import com.gs.collections.impl.lazy.primitive.AbstractLazyLongIterable;
import com.gs.collections.impl.lazy.primitive.LazyShortIterableAdapter;
import com.gs.collections.impl.lazy.primitive.LazyLongIterableAdapter;
import com.gs.collections.impl.list.mutable.FastList;
import com.gs.collections.impl.list.mutable.primitive.LongArrayList;
import com.gs.collections.impl.list.mutable.primitive.ShortArrayList;
import com.gs.collections.impl.set.mutable.primitive.LongHashSet;
import com.gs.collections.impl.set.mutable.primitive.SynchronizedLongSet;
import com.gs.collections.impl.set.mutable.primitive.UnmodifiableLongSet;
import com.gs.collections.impl.set.mutable.primitive.ShortHashSet;
import com.gs.collections.impl.tuple.primitive.PrimitiveTuples;
/**
* This file was automatically generated from template file primitivePrimitiveHashMap.stg.
*
* @since 3.0.
*/
public class LongShortHashMap implements MutableLongShortMap, Externalizable
{
static final short EMPTY_VALUE = (short) 0;
private static final long serialVersionUID = 1L;
private static final long EMPTY_KEY = 0L;
private static final long REMOVED_KEY = 1L;
private static final int OCCUPIED_DATA_RATIO = 2;
private static final int OCCUPIED_SENTINEL_RATIO = 4;
private static final int DEFAULT_INITIAL_CAPACITY = 8;
private long[] keys;
private short[] values;
private int occupiedWithData;
private int occupiedWithSentinels;
private SentinelValues sentinelValues;
public LongShortHashMap()
{
this.allocateTable(DEFAULT_INITIAL_CAPACITY << 1);
}
public LongShortHashMap(int initialCapacity)
{
if (initialCapacity < 0)
{
throw new IllegalArgumentException("initial capacity cannot be less than 0");
}
int capacity = this.smallestPowerOfTwoGreaterThan(this.fastCeil(initialCapacity * OCCUPIED_DATA_RATIO));
this.allocateTable(capacity);
}
private int smallestPowerOfTwoGreaterThan(int n)
{
return n > 1 ? Integer.highestOneBit(n - 1) << 1 : 1;
}
public LongShortHashMap(LongShortMap map)
{
this(Math.max(map.size(), DEFAULT_INITIAL_CAPACITY));
this.putAll(map);
}
private int fastCeil(float v)
{
int possibleResult = (int) v;
if (v - possibleResult > 0.0F)
{
possibleResult++;
}
return possibleResult;
}
public static LongShortHashMap newWithKeysValues(long key1, short value1)
{
return new LongShortHashMap(1).withKeyValue(key1, value1);
}
public static LongShortHashMap newWithKeysValues(long key1, short value1, long key2, short value2)
{
return new LongShortHashMap(2).withKeysValues(key1, value1, key2, value2);
}
public static LongShortHashMap newWithKeysValues(long key1, short value1, long key2, short value2, long key3, short value3)
{
return new LongShortHashMap(3).withKeysValues(key1, value1, key2, value2, key3, value3);
}
public static LongShortHashMap newWithKeysValues(long key1, short value1, long key2, short value2, long key3, short value3, long key4, short value4)
{
return new LongShortHashMap(4).withKeysValues(key1, value1, key2, value2, key3, value3, key4, value4);
}
@Override
public boolean equals(Object obj)
{
if (this == obj)
{
return true;
}
if (!(obj instanceof LongShortMap))
{
return false;
}
LongShortMap other = (LongShortMap) 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++)
{
long 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 ^ EMPTY_KEY >>> 32) ^ (int) this.sentinelValues.zeroValue;
}
if (this.sentinelValues.containsOneKey)
{
result += (int) (REMOVED_KEY ^ REMOVED_KEY >>> 32) ^ (int) this.sentinelValues.oneValue;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
result += (int) (this.keys[i] ^ this.keys[i] >>> 32) ^ (int) this.values[i];
}
}
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(String.valueOf(EMPTY_KEY)).append("=").append(String.valueOf(this.sentinelValues.zeroValue));
first = false;
}
if (this.sentinelValues.containsOneKey)
{
if (!first)
{
appendable.append(", ");
}
appendable.append(String.valueOf(REMOVED_KEY)).append("=").append(String.valueOf(this.sentinelValues.oneValue));
first = false;
}
}
for (int i = 0; i < this.keys.length; i++)
{
long key = this.keys[i];
if (isNonSentinel(key))
{
if (!first)
{
appendable.append(", ");
}
appendable.append(String.valueOf(key)).append("=").append(String.valueOf(this.values[i]));
first = false;
}
}
appendable.append("}");
return appendable.toString();
}
public int size()
{
return this.occupiedWithData + (this.sentinelValues == null ? 0 : this.sentinelValues.size());
}
public boolean isEmpty()
{
return this.occupiedWithData == 0 && (this.sentinelValues == null || this.sentinelValues.size() == 0);
}
public boolean notEmpty()
{
return this.occupiedWithData != 0 || (this.sentinelValues != null && this.sentinelValues.size() != 0);
}
public String makeString()
{
return this.makeString(", ");
}
public String makeString(String separator)
{
return this.makeString("", separator, "");
}
public String makeString(String start, String separator, String end)
{
Appendable stringBuilder = new StringBuilder();
this.appendString(stringBuilder, start, separator, end);
return stringBuilder.toString();
}
public void appendString(Appendable appendable)
{
this.appendString(appendable, ", ");
}
public void appendString(Appendable appendable, String separator)
{
this.appendString(appendable, "", separator, "");
}
public void appendString(Appendable appendable, String start, String separator, String end)
{
try
{
appendable.append(start);
boolean first = true;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
appendable.append(String.valueOf(this.sentinelValues.zeroValue));
first = false;
}
if (this.sentinelValues.containsOneKey)
{
if (!first)
{
appendable.append(separator);
}
appendable.append(String.valueOf(this.sentinelValues.oneValue));
first = false;
}
}
for (int i = 0; i < this.keys.length; i++)
{
long key = this.keys[i];
if (isNonSentinel(key))
{
if (!first)
{
appendable.append(separator);
}
appendable.append(String.valueOf(this.values[i]));
first = false;
}
}
appendable.append(end);
}
catch (IOException e)
{
throw new RuntimeException(e);
}
}
public ShortIterator shortIterator()
{
return new InternalShortIterator();
}
public short[] toArray()
{
short[] array = new short[this.size()];
int index = 0;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
array[index] = this.sentinelValues.zeroValue;
index++;
}
if (this.sentinelValues.containsOneKey)
{
array[index] = this.sentinelValues.oneValue;
index++;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
array[index] = this.values[i];
index++;
}
}
return array;
}
public boolean contains(short value)
{
return this.containsValue(value);
}
public boolean containsAll(short... source)
{
for (short each : source)
{
if (!this.contains(each))
{
return false;
}
}
return true;
}
public boolean containsAll(ShortIterable source)
{
return source.allSatisfy(new ShortPredicate()
{
public boolean accept(short value)
{
return LongShortHashMap.this.contains(value);
}
});
}
public void forEach(ShortProcedure procedure)
{
this.forEachValue(procedure);
}
public MutableShortCollection select(ShortPredicate predicate)
{
ShortArrayList result = new ShortArrayList();
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue))
{
result.add(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue))
{
result.add(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i]))
{
result.add(this.values[i]);
}
}
return result;
}
public MutableShortCollection reject(ShortPredicate predicate)
{
ShortArrayList result = new ShortArrayList();
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && !predicate.accept(this.sentinelValues.zeroValue))
{
result.add(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey && !predicate.accept(this.sentinelValues.oneValue))
{
result.add(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && !predicate.accept(this.values[i]))
{
result.add(this.values[i]);
}
}
return result;
}
public MutableCollection collect(ShortToObjectFunction function)
{
FastList target = FastList.newList(this.size());
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
target.add(function.valueOf(this.sentinelValues.zeroValue));
}
if (this.sentinelValues.containsOneKey)
{
target.add(function.valueOf(this.sentinelValues.oneValue));
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
target.add(function.valueOf(this.values[i]));
}
}
return target;
}
public short detectIfNone(ShortPredicate predicate, short value)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue))
{
return this.sentinelValues.zeroValue;
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue))
{
return this.sentinelValues.oneValue;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i]))
{
return this.values[i];
}
}
return value;
}
public int count(ShortPredicate predicate)
{
int count = 0;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue))
{
count++;
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue))
{
count++;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i]))
{
count++;
}
}
return count;
}
public boolean anySatisfy(ShortPredicate predicate)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue))
{
return true;
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue))
{
return true;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i]))
{
return true;
}
}
return false;
}
public boolean allSatisfy(ShortPredicate predicate)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && !predicate.accept(this.sentinelValues.zeroValue))
{
return false;
}
if (this.sentinelValues.containsOneKey && !predicate.accept(this.sentinelValues.oneValue))
{
return false;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && !predicate.accept(this.values[i]))
{
return false;
}
}
return true;
}
public boolean noneSatisfy(ShortPredicate predicate)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue))
{
return false;
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue))
{
return false;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i]))
{
return false;
}
}
return true;
}
public V injectInto(V injectedValue, ObjectShortToObjectFunction 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 MutableShortList toList()
{
return ShortArrayList.newList(this);
}
public MutableShortSet toSet()
{
return ShortHashSet.newSet(this);
}
public MutableShortBag toBag()
{
return ShortHashBag.newBag(this);
}
public LazyShortIterable asLazy()
{
return new LazyShortIterableAdapter(this);
}
public void clear()
{
this.sentinelValues = null;
this.occupiedWithData = 0;
this.occupiedWithSentinels = 0;
Arrays.fill(this.keys, EMPTY_KEY);
Arrays.fill(this.values, EMPTY_VALUE);
}
public void put(long key, short value)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues();
}
this.addEmptyKeyValue(value);
return;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues();
}
this.addRemovedKeyValue(value);
return;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
// key already present in map
this.values[index] = value;
return;
}
this.addKeyValueAtIndex(key, value, index);
}
public void putAll(LongShortMap map)
{
map.forEachKeyValue(new LongShortProcedure()
{
public void value(long key, short value)
{
LongShortHashMap.this.put(key, value);
}
});
}
public void removeKey(long 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.keys[index] = REMOVED_KEY;
this.values[index] = EMPTY_VALUE;
this.occupiedWithData--;
this.occupiedWithSentinels++;
if (this.occupiedWithSentinels > this.maxOccupiedWithSentinels())
{
this.rehash();
}
}
}
public void remove(long key)
{
this.removeKey(key);
}
public short removeKeyIfAbsent(long key, short value)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey)
{
return value;
}
short oldValue = this.sentinelValues.zeroValue;
this.removeEmptyKey();
return oldValue;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null || !this.sentinelValues.containsOneKey)
{
return value;
}
short oldValue = this.sentinelValues.oneValue;
this.removeRemovedKey();
return oldValue;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
this.keys[index] = REMOVED_KEY;
short oldValue = this.values[index];
this.values[index] = EMPTY_VALUE;
this.occupiedWithData--;
this.occupiedWithSentinels++;
if (this.occupiedWithSentinels > this.maxOccupiedWithSentinels())
{
this.rehash();
}
return oldValue;
}
return value;
}
public short getIfAbsentPut(long key, short 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 short getIfAbsentPut(long key, ShortFunction0 function)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
short value = function.value();
this.sentinelValues = new SentinelValues();
this.addEmptyKeyValue(value);
return value;
}
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
short value = function.value();
this.addEmptyKeyValue(value);
return value;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
short value = function.value();
this.sentinelValues = new SentinelValues();
this.addRemovedKeyValue(value);
return value;
}
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
short value = function.value();
this.addRemovedKeyValue(value);
return value;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[index];
}
short value = function.value();
this.addKeyValueAtIndex(key, value, index);
return value;
}
public short getIfAbsentPutWith(long key, ShortFunction function, P parameter)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
short value = function.shortValueOf(parameter);
this.sentinelValues = new SentinelValues();
this.addEmptyKeyValue(value);
return value;
}
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
short value = function.shortValueOf(parameter);
this.addEmptyKeyValue(value);
return value;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
short value = function.shortValueOf(parameter);
this.sentinelValues = new SentinelValues();
this.addRemovedKeyValue(value);
return value;
}
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
short value = function.shortValueOf(parameter);
this.addRemovedKeyValue(value);
return value;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[index];
}
short value = function.shortValueOf(parameter);
this.addKeyValueAtIndex(key, value, index);
return value;
}
public short getIfAbsentPutWithKey(long key, LongToShortFunction function)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
short value = function.valueOf(key);
this.sentinelValues = new SentinelValues();
this.addEmptyKeyValue(value);
return value;
}
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
short value = function.valueOf(key);
this.addEmptyKeyValue(value);
return value;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
short value = function.valueOf(key);
this.sentinelValues = new SentinelValues();
this.addRemovedKeyValue(value);
return value;
}
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
short value = function.valueOf(key);
this.addRemovedKeyValue(value);
return value;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[index];
}
short value = function.valueOf(key);
this.addKeyValueAtIndex(key, value, index);
return value;
}
public short addToValue(long key, short 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(long key, short value, int index)
{
if (this.keys[index] == REMOVED_KEY)
{
this.occupiedWithSentinels--;
}
this.keys[index] = key;
this.values[index] = value;
this.occupiedWithData++;
if (this.occupiedWithData > this.maxOccupiedWithData())
{
this.rehashAndGrow();
}
}
private void addEmptyKeyValue(short value)
{
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = value;
}
private void removeEmptyKey()
{
if (this.sentinelValues.containsOneKey)
{
this.sentinelValues.containsZeroKey = false;
this.sentinelValues.zeroValue = EMPTY_VALUE;
}
else
{
this.sentinelValues = null;
}
}
private void addRemovedKeyValue(short value)
{
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = value;
}
private void removeRemovedKey()
{
if (this.sentinelValues.containsZeroKey)
{
this.sentinelValues.containsOneKey = false;
this.sentinelValues.oneValue = EMPTY_VALUE;
}
else
{
this.sentinelValues = null;
}
}
public short updateValue(long key, short initialValueIfAbsent, ShortToShortFunction 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];
}
short value = function.valueOf(initialValueIfAbsent);
this.addKeyValueAtIndex(key, value, index);
return value;
}
public LongShortHashMap withKeyValue(long key1, short value1)
{
this.put(key1, value1);
return this;
}
public LongShortHashMap withKeysValues(long key1, short value1, long key2, short value2)
{
this.put(key1, value1);
this.put(key2, value2);
return this;
}
public LongShortHashMap withKeysValues(long key1, short value1, long key2, short value2, long key3, short value3)
{
this.put(key1, value1);
this.put(key2, value2);
this.put(key3, value3);
return this;
}
public LongShortHashMap withKeysValues(long key1, short value1, long key2, short value2, long key3, short value3, long key4, short value4)
{
this.put(key1, value1);
this.put(key2, value2);
this.put(key3, value3);
this.put(key4, value4);
return this;
}
public LongShortHashMap withoutKey(long key)
{
this.removeKey(key);
return this;
}
public LongShortHashMap withoutAllKeys(LongIterable keys)
{
keys.forEach(new LongProcedure()
{
public void value(long key)
{
LongShortHashMap.this.removeKey(key);
}
});
return this;
}
public MutableLongShortMap asUnmodifiable()
{
return new UnmodifiableLongShortMap(this);
}
public MutableLongShortMap asSynchronized()
{
return new SynchronizedLongShortMap(this);
}
public ImmutableLongShortMap toImmutable()
{
return LongShortMaps.immutable.ofAll(this);
}
public short get(long key)
{
return this.getIfAbsent(key, EMPTY_VALUE);
}
public short getIfAbsent(long key, short ifAbsent)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey)
{
return ifAbsent;
}
return this.sentinelValues.zeroValue;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null || !this.sentinelValues.containsOneKey)
{
return ifAbsent;
}
return this.sentinelValues.oneValue;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[index];
}
return ifAbsent;
}
public short getOrThrow(long 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(long 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 boolean containsValue(short value)
{
if (this.sentinelValues != null && this.sentinelValues.containsValue(value))
{
return true;
}
for (int i = 0; i < this.values.length; i++)
{
if (isNonSentinel(this.keys[i]) && this.values[i] == value)
{
return true;
}
}
return false;
}
public void forEachValue(ShortProcedure procedure)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
procedure.value(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
procedure.value(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
procedure.value(this.values[i]);
}
}
}
public void forEachKey(LongProcedure procedure)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
procedure.value(EMPTY_KEY);
}
if (this.sentinelValues.containsOneKey)
{
procedure.value(REMOVED_KEY);
}
}
for (long key : this.keys)
{
if (isNonSentinel(key))
{
procedure.value(key);
}
}
}
public void forEachKeyValue(LongShortProcedure 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 LazyLongIterable keysView()
{
return new KeysView();
}
public RichIterable keyValuesView()
{
return new KeyValuesView();
}
public LongShortHashMap select(LongShortPredicate predicate)
{
LongShortHashMap result = new LongShortHashMap();
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 LongShortHashMap reject(LongShortPredicate predicate)
{
LongShortHashMap result = new LongShortHashMap();
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 long sum()
{
long result = 0L;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
result += this.sentinelValues.zeroValue;
}
if (this.sentinelValues.containsOneKey)
{
result += this.sentinelValues.oneValue;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
result += this.values[i];
}
}
return result;
}
public short max()
{
if (this.isEmpty())
{
throw new NoSuchElementException();
}
ShortIterator iterator = this.shortIterator();
short max = iterator.next();
while (iterator.hasNext())
{
short value = iterator.next();
if (max < value)
{
max = value;
}
}
return max;
}
public short maxIfEmpty(short defaultValue)
{
if (this.isEmpty())
{
return defaultValue;
}
return this.max();
}
public short min()
{
if (this.isEmpty())
{
throw new NoSuchElementException();
}
ShortIterator iterator = this.shortIterator();
short min = iterator.next();
while (iterator.hasNext())
{
short value = iterator.next();
if (value < min)
{
min = value;
}
}
return min;
}
public short minIfEmpty(short defaultValue)
{
if (this.isEmpty())
{
return defaultValue;
}
return this.min();
}
public double average()
{
if (this.isEmpty())
{
throw new ArithmeticException();
}
return (double) this.sum() / (double) this.size();
}
public double median()
{
if (this.isEmpty())
{
throw new ArithmeticException();
}
short[] sortedArray = this.toSortedArray();
int middleIndex = sortedArray.length >> 1;
if (sortedArray.length > 1 && (sortedArray.length & 1) == 0)
{
short first = sortedArray[middleIndex];
short second = sortedArray[middleIndex - 1];
return ((double) first + (double) second) / 2.0;
}
return (double) sortedArray[middleIndex];
}
public short[] toSortedArray()
{
short[] array = this.toArray();
Arrays.sort(array);
return array;
}
public MutableShortList toSortedList()
{
return ShortArrayList.newList(this).sortThis();
}
public void writeExternal(ObjectOutput out) throws IOException
{
out.writeInt(this.size());
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
out.writeLong(EMPTY_KEY);
out.writeShort(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
out.writeLong(REMOVED_KEY);
out.writeShort(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
out.writeLong(this.keys[i]);
out.writeShort(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.readLong(), in.readShort());
}
}
/**
* 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 rehash()
{
this.rehash(this.keys.length);
}
private void rehashAndGrow()
{
this.rehash(this.keys.length << 1);
}
private void rehash(int newCapacity)
{
int oldLength = this.keys.length;
long[] old = this.keys;
short[] 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(long element)
{
int index = this.spread(element);
long 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 spread(long element)
{
long code = element;
code = ~code + (code << 18);
code = (code << 18) - code - 1;
code ^= code >>> 31;
code *= 21;
code += (code << 2) + (code << 4);
code ^= code >>> 11;
code += code << 6;
code ^= code >>> 22;
return (int) code & (this.keys.length - 1);
}
private void allocateTable(int sizeToAllocate)
{
this.keys = new long[sizeToAllocate];
this.values = new short[sizeToAllocate];
}
private static boolean isEmptyKey(long key)
{
return key == EMPTY_KEY;
}
private static boolean isRemovedKey(long key)
{
return key == REMOVED_KEY;
}
private static boolean isNonSentinel(long key)
{
return !isEmptyKey(key) && !isRemovedKey(key);
}
private int maxOccupiedWithData()
{
int capacity = this.keys.length;
// need at least one free slot for open addressing
return Math.min(capacity - 1, capacity / OCCUPIED_DATA_RATIO);
}
private int maxOccupiedWithSentinels()
{
return this.keys.length / OCCUPIED_SENTINEL_RATIO;
}
private static final class SentinelValues
{
private boolean containsZeroKey;
private boolean containsOneKey;
private short zeroValue;
private short oneValue;
public int size()
{
return (this.containsZeroKey ? 1 : 0) + (this.containsOneKey ? 1 : 0);
}
public boolean containsValue(short value)
{
boolean valueEqualsZeroValue = this.containsZeroKey && this.zeroValue == value;
boolean valueEqualsOneValue = this.containsOneKey && this.oneValue == value;
return valueEqualsZeroValue || valueEqualsOneValue;
}
}
private class InternalShortIterator implements ShortIterator
{
private int count;
private int position;
private boolean handledZero;
private boolean handledOne;
public boolean hasNext()
{
return this.count < LongShortHashMap.this.size();
}
public short next()
{
if (!this.hasNext())
{
throw new NoSuchElementException("next() called, but the iterator is exhausted");
}
this.count++;
if (!this.handledZero)
{
this.handledZero = true;
if (LongShortHashMap.this.containsKey(EMPTY_KEY))
{
return LongShortHashMap.this.get(EMPTY_KEY);
}
}
if (!this.handledOne)
{
this.handledOne = true;
if (LongShortHashMap.this.containsKey(REMOVED_KEY))
{
return LongShortHashMap.this.get(REMOVED_KEY);
}
}
long[] keys = LongShortHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
short result = LongShortHashMap.this.values[this.position];
this.position++;
return result;
}
}
private class KeysView extends AbstractLazyLongIterable
{
public LongIterator longIterator()
{
return new KeySetIterator();
}
public void forEach(LongProcedure procedure)
{
LongShortHashMap.this.forEachKey(procedure);
}
}
private class KeySetIterator implements LongIterator
{
private int count;
private int position;
private boolean handledZero;
private boolean handledOne;
public boolean hasNext()
{
return this.count < LongShortHashMap.this.size();
}
public long next()
{
if (!this.hasNext())
{
throw new NoSuchElementException("next() called, but the iterator is exhausted");
}
this.count++;
if (!this.handledZero)
{
this.handledZero = true;
if (LongShortHashMap.this.containsKey(EMPTY_KEY))
{
return EMPTY_KEY;
}
}
if (!this.handledOne)
{
this.handledOne = true;
if (LongShortHashMap.this.containsKey(REMOVED_KEY))
{
return REMOVED_KEY;
}
}
long[] keys = LongShortHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
long result = keys[this.position];
this.position++;
return result;
}
}
public MutableLongSet keySet()
{
return new KeySet();
}
private class KeySet implements MutableLongSet
{
public LongIterator longIterator()
{
return new KeySetIterator();
}
public void forEach(LongProcedure procedure)
{
LongShortHashMap.this.forEachKey(procedure);
}
public int count(LongPredicate predicate)
{
int count = 0;
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
count++;
}
if (LongShortHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
count++;
}
}
for (long key : LongShortHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
count++;
}
}
return count;
}
public boolean anySatisfy(LongPredicate predicate)
{
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
return true;
}
if (LongShortHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
return true;
}
}
for (long key : LongShortHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
return true;
}
}
return false;
}
public boolean allSatisfy(LongPredicate predicate)
{
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey && !predicate.accept(EMPTY_KEY))
{
return false;
}
if (LongShortHashMap.this.sentinelValues.containsOneKey && !predicate.accept(REMOVED_KEY))
{
return false;
}
}
for (long key : LongShortHashMap.this.keys)
{
if (isNonSentinel(key) && !predicate.accept(key))
{
return false;
}
}
return true;
}
public boolean noneSatisfy(LongPredicate predicate)
{
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
return false;
}
if (LongShortHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
return false;
}
}
for (long key : LongShortHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
return false;
}
}
return true;
}
public boolean add(long element)
{
throw new UnsupportedOperationException("Cannot call add() on " + this.getClass().getSimpleName());
}
public boolean addAll(long... source)
{
throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
}
public boolean addAll(LongIterable source)
{
throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
}
public boolean remove(long key)
{
int oldSize = LongShortHashMap.this.size();
LongShortHashMap.this.removeKey(key);
return oldSize != LongShortHashMap.this.size();
}
public boolean removeAll(LongIterable source)
{
int oldSize = LongShortHashMap.this.size();
LongIterator iterator = source.longIterator();
while (iterator.hasNext())
{
LongShortHashMap.this.removeKey(iterator.next());
}
return oldSize != LongShortHashMap.this.size();
}
public boolean removeAll(long... source)
{
int oldSize = LongShortHashMap.this.size();
for (long item : source)
{
LongShortHashMap.this.removeKey(item);
}
return oldSize != LongShortHashMap.this.size();
}
public boolean retainAll(LongIterable source)
{
int oldSize = this.size();
final LongSet sourceSet = source instanceof LongSet ? (LongSet) source : source.toSet();
LongShortHashMap retained = LongShortHashMap.this.select(new LongShortPredicate()
{
public boolean accept(long key, short value)
{
return sourceSet.contains(key);
}
});
if (retained.size() != oldSize)
{
LongShortHashMap.this.keys = retained.keys;
LongShortHashMap.this.values = retained.values;
LongShortHashMap.this.sentinelValues = retained.sentinelValues;
LongShortHashMap.this.occupiedWithData = retained.occupiedWithData;
LongShortHashMap.this.occupiedWithSentinels = retained.occupiedWithSentinels;
return true;
}
return false;
}
public boolean retainAll(long... source)
{
return this.retainAll(LongHashSet.newSetWith(source));
}
public void clear()
{
LongShortHashMap.this.clear();
}
public MutableLongSet select(LongPredicate predicate)
{
MutableLongSet result = new LongHashSet();
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
result.add(EMPTY_KEY);
}
if (LongShortHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
result.add(REMOVED_KEY);
}
}
for (long key : LongShortHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
result.add(key);
}
}
return result;
}
public MutableLongSet reject(LongPredicate predicate)
{
MutableLongSet result = new LongHashSet();
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey && !predicate.accept(EMPTY_KEY))
{
result.add(EMPTY_KEY);
}
if (LongShortHashMap.this.sentinelValues.containsOneKey && !predicate.accept(REMOVED_KEY))
{
result.add(REMOVED_KEY);
}
}
for (long key : LongShortHashMap.this.keys)
{
if (isNonSentinel(key) && !predicate.accept(key))
{
result.add(key);
}
}
return result;
}
public MutableLongSet with(long element)
{
throw new UnsupportedOperationException("Cannot call with() on " + this.getClass().getSimpleName());
}
public MutableLongSet without(long element)
{
throw new UnsupportedOperationException("Cannot call without() on " + this.getClass().getSimpleName());
}
public MutableLongSet withAll(LongIterable elements)
{
throw new UnsupportedOperationException("Cannot call withAll() on " + this.getClass().getSimpleName());
}
public MutableLongSet withoutAll(LongIterable elements)
{
throw new UnsupportedOperationException("Cannot call withoutAll() on " + this.getClass().getSimpleName());
}
public long detectIfNone(LongPredicate predicate, long ifNone)
{
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
return EMPTY_KEY;
}
if (LongShortHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
return REMOVED_KEY;
}
}
for (long key : LongShortHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
return key;
}
}
return ifNone;
}
public MutableSet collect(LongToObjectFunction function)
{
MutableSet result = Sets.mutable.with();
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey)
{
result.add(function.valueOf(EMPTY_KEY));
}
if (LongShortHashMap.this.sentinelValues.containsOneKey)
{
result.add(function.valueOf(REMOVED_KEY));
}
}
for (long key : LongShortHashMap.this.keys)
{
if (isNonSentinel(key))
{
result.add(function.valueOf(key));
}
}
return result;
}
public MutableLongSet asUnmodifiable()
{
return UnmodifiableLongSet.of(this);
}
public MutableLongSet asSynchronized()
{
return SynchronizedLongSet.of(this);
}
public long sum()
{
long sum = 0L;
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey)
{
sum += EMPTY_KEY;
}
if (LongShortHashMap.this.sentinelValues.containsOneKey)
{
sum += REMOVED_KEY;
}
}
for (long key : LongShortHashMap.this.keys)
{
if (isNonSentinel(key))
{
sum += key;
}
}
return sum;
}
public long max()
{
if (LongShortHashMap.this.isEmpty())
{
throw new NoSuchElementException();
}
long max = 0;
boolean isMaxSet = false;
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey)
{
max = EMPTY_KEY;
isMaxSet = true;
}
if (LongShortHashMap.this.sentinelValues.containsOneKey && (!isMaxSet || max < REMOVED_KEY))
{
max = REMOVED_KEY;
isMaxSet = true;
}
}
for (int i = 0; i < LongShortHashMap.this.keys.length; i++)
{
if (isNonSentinel(LongShortHashMap.this.keys[i]) && (!isMaxSet || max < LongShortHashMap.this.keys[i]))
{
max = LongShortHashMap.this.keys[i];
isMaxSet = true;
}
}
return max;
}
public long maxIfEmpty(long defaultValue)
{
if (LongShortHashMap.this.isEmpty())
{
return defaultValue;
}
return this.max();
}
public long min()
{
if (LongShortHashMap.this.isEmpty())
{
throw new NoSuchElementException();
}
long min = 0;
boolean isMinSet = false;
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey)
{
min = EMPTY_KEY;
isMinSet = true;
}
if (LongShortHashMap.this.sentinelValues.containsOneKey && (!isMinSet || REMOVED_KEY < min))
{
min = REMOVED_KEY;
isMinSet = true;
}
}
for (int i = 0; i < LongShortHashMap.this.keys.length; i++)
{
if (isNonSentinel(LongShortHashMap.this.keys[i]) && (!isMinSet || LongShortHashMap.this.keys[i] < min))
{
min = LongShortHashMap.this.keys[i];
isMinSet = true;
}
}
return min;
}
public long minIfEmpty(long defaultValue)
{
if (LongShortHashMap.this.isEmpty())
{
return defaultValue;
}
return this.min();
}
public double average()
{
if (this.isEmpty())
{
throw new ArithmeticException();
}
return (double) this.sum() / (double) this.size();
}
public double median()
{
if (this.isEmpty())
{
throw new ArithmeticException();
}
long[] sortedArray = this.toSortedArray();
int middleIndex = sortedArray.length >> 1;
if (sortedArray.length > 1 && (sortedArray.length & 1) == 0)
{
long first = sortedArray[middleIndex];
long second = sortedArray[middleIndex - 1];
return ((double) first + (double) second) / 2.0;
}
return (double) sortedArray[middleIndex];
}
public long[] toSortedArray()
{
long[] array = this.toArray();
Arrays.sort(array);
return array;
}
public MutableLongList toSortedList()
{
return LongArrayList.newList(this).sortThis();
}
public long[] toArray()
{
int size = LongShortHashMap.this.size();
final long[] result = new long[size];
LongShortHashMap.this.forEachKey(new LongProcedure()
{
private int index;
public void value(long each)
{
result[this.index] = each;
this.index++;
}
});
return result;
}
public boolean contains(long value)
{
return LongShortHashMap.this.containsKey(value);
}
public boolean containsAll(long... source)
{
for (long item : source)
{
if (!LongShortHashMap.this.containsKey(item))
{
return false;
}
}
return true;
}
public boolean containsAll(LongIterable source)
{
LongIterator iterator = source.longIterator();
while (iterator.hasNext())
{
if (!LongShortHashMap.this.containsKey(iterator.next()))
{
return false;
}
}
return true;
}
public MutableLongList toList()
{
return LongArrayList.newList(this);
}
public MutableLongSet toSet()
{
return LongHashSet.newSet(this);
}
public MutableLongBag toBag()
{
return LongHashBag.newBag(this);
}
public LazyLongIterable asLazy()
{
return new LazyLongIterableAdapter(this);
}
public T injectInto(T injectedValue, ObjectLongToObjectFunction function)
{
T result = injectedValue;
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey)
{
result = function.valueOf(result, EMPTY_KEY);
}
if (LongShortHashMap.this.sentinelValues.containsOneKey)
{
result = function.valueOf(result, REMOVED_KEY);
}
}
for (int i = 0; i < LongShortHashMap.this.keys.length; i++)
{
if (isNonSentinel(LongShortHashMap.this.keys[i]))
{
result = function.valueOf(result, LongShortHashMap.this.keys[i]);
}
}
return result;
}
public LongSet freeze()
{
throw new UnsupportedOperationException(this.getClass().getSimpleName() + ".freeze() not implemented yet");
}
public ImmutableLongSet toImmutable()
{
return LongSets.immutable.withAll(this);
}
public int size()
{
return LongShortHashMap.this.size();
}
public boolean isEmpty()
{
return LongShortHashMap.this.isEmpty();
}
public boolean notEmpty()
{
return LongShortHashMap.this.notEmpty();
}
@Override
public boolean equals(Object obj)
{
if (this == obj)
{
return true;
}
if (!(obj instanceof LongSet))
{
return false;
}
LongSet other = (LongSet) obj;
return this.size() == other.size() && this.containsAll(other.toArray());
}
@Override
public int hashCode()
{
int result = 0;
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey)
{
result += (int) (EMPTY_KEY ^ EMPTY_KEY >>> 32);
}
if (LongShortHashMap.this.sentinelValues.containsOneKey)
{
result += (int) (REMOVED_KEY ^ REMOVED_KEY >>> 32);
}
}
for (int i = 0; i < LongShortHashMap.this.keys.length; i++)
{
if (isNonSentinel(LongShortHashMap.this.keys[i]))
{
result += (int) (LongShortHashMap.this.keys[i] ^ LongShortHashMap.this.keys[i] >>> 32);
}
}
return result;
}
@Override
public String toString()
{
return this.makeString("[", ", ", "]");
}
public String makeString()
{
return this.makeString(", ");
}
public String makeString(String separator)
{
return this.makeString("", separator, "");
}
public String makeString(String start, String separator, String end)
{
Appendable stringBuilder = new StringBuilder();
this.appendString(stringBuilder, start, separator, end);
return stringBuilder.toString();
}
public void appendString(Appendable appendable)
{
this.appendString(appendable, ", ");
}
public void appendString(Appendable appendable, String separator)
{
this.appendString(appendable, "", separator, "");
}
public void appendString(Appendable appendable, String start, String separator, String end)
{
try
{
appendable.append(start);
boolean first = true;
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey)
{
appendable.append(String.valueOf(EMPTY_KEY));
first = false;
}
if (LongShortHashMap.this.sentinelValues.containsOneKey)
{
if (!first)
{
appendable.append(separator);
}
appendable.append(String.valueOf(REMOVED_KEY));
first = false;
}
}
for (long key : LongShortHashMap.this.keys)
{
if (isNonSentinel(key))
{
if (!first)
{
appendable.append(separator);
}
appendable.append(String.valueOf(key));
first = false;
}
}
appendable.append(end);
}
catch (IOException e)
{
throw new RuntimeException(e);
}
}
}
public MutableShortCollection values()
{
return new ValuesCollection();
}
private class ValuesCollection implements MutableShortCollection
{
public void clear()
{
LongShortHashMap.this.clear();
}
public MutableShortCollection select(ShortPredicate predicate)
{
return LongShortHashMap.this.select(predicate);
}
public MutableShortCollection reject(ShortPredicate predicate)
{
return LongShortHashMap.this.reject(predicate);
}
public short detectIfNone(ShortPredicate predicate, short ifNone)
{
return LongShortHashMap.this.detectIfNone(predicate, ifNone);
}
public MutableCollection collect(ShortToObjectFunction function)
{
return LongShortHashMap.this.collect(function);
}
public T injectInto(T injectedValue, ObjectShortToObjectFunction function)
{
return LongShortHashMap.this.injectInto(injectedValue, function);
}
public long sum()
{
return LongShortHashMap.this.sum();
}
public short max()
{
return LongShortHashMap.this.max();
}
public short maxIfEmpty(short defaultValue)
{
return LongShortHashMap.this.maxIfEmpty(defaultValue);
}
public short min()
{
return LongShortHashMap.this.min();
}
public short minIfEmpty(short defaultValue)
{
return LongShortHashMap.this.minIfEmpty(defaultValue);
}
public double average()
{
return LongShortHashMap.this.average();
}
public double median()
{
return LongShortHashMap.this.median();
}
public short[] toSortedArray()
{
return LongShortHashMap.this.toSortedArray();
}
public MutableShortList toSortedList()
{
return LongShortHashMap.this.toSortedList();
}
public MutableShortCollection with(short element)
{
throw new UnsupportedOperationException("Cannot call with() on " + this.getClass().getSimpleName());
}
public MutableShortCollection without(short element)
{
throw new UnsupportedOperationException("Cannot call without() on " + this.getClass().getSimpleName());
}
public MutableShortCollection withAll(ShortIterable elements)
{
throw new UnsupportedOperationException("Cannot call withAll() on " + this.getClass().getSimpleName());
}
public MutableShortCollection withoutAll(ShortIterable elements)
{
throw new UnsupportedOperationException("Cannot call withoutAll() on " + this.getClass().getSimpleName());
}
public MutableShortCollection asUnmodifiable()
{
return UnmodifiableShortCollection.of(this);
}
public MutableShortCollection asSynchronized()
{
return SynchronizedShortCollection.of(this);
}
public ImmutableShortCollection toImmutable()
{
return ShortLists.immutable.withAll(this);
}
public boolean contains(short value)
{
return LongShortHashMap.this.containsValue(value);
}
public boolean containsAll(short... source)
{
return LongShortHashMap.this.containsAll(source);
}
public boolean containsAll(ShortIterable source)
{
return LongShortHashMap.this.containsAll(source);
}
public MutableShortList toList()
{
return LongShortHashMap.this.toList();
}
public MutableShortSet toSet()
{
return LongShortHashMap.this.toSet();
}
public MutableShortBag toBag()
{
return LongShortHashMap.this.toBag();
}
public LazyShortIterable asLazy()
{
return new LazyShortIterableAdapter(this);
}
public boolean isEmpty()
{
return LongShortHashMap.this.isEmpty();
}
public boolean notEmpty()
{
return LongShortHashMap.this.notEmpty();
}
public String makeString()
{
return this.makeString(", ");
}
public String makeString(String separator)
{
return this.makeString("", separator, "");
}
public String makeString(String start, String separator, String end)
{
Appendable stringBuilder = new StringBuilder();
this.appendString(stringBuilder, start, separator, end);
return stringBuilder.toString();
}
public void appendString(Appendable appendable)
{
this.appendString(appendable, ", ");
}
public void appendString(Appendable appendable, String separator)
{
this.appendString(appendable, "", separator, "");
}
public void appendString(Appendable appendable, String start, String separator, String end)
{
try
{
appendable.append(start);
boolean first = true;
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey)
{
appendable.append(String.valueOf(LongShortHashMap.this.sentinelValues.zeroValue));
first = false;
}
if (LongShortHashMap.this.sentinelValues.containsOneKey)
{
if (!first)
{
appendable.append(separator);
}
appendable.append(String.valueOf(LongShortHashMap.this.sentinelValues.oneValue));
first = false;
}
}
for (int i = 0; i < LongShortHashMap.this.keys.length; i++)
{
long key = LongShortHashMap.this.keys[i];
if (isNonSentinel(key))
{
if (!first)
{
appendable.append(separator);
}
appendable.append(String.valueOf(LongShortHashMap.this.values[i]));
first = false;
}
}
appendable.append(end);
}
catch (IOException e)
{
throw new RuntimeException(e);
}
}
public ShortIterator shortIterator()
{
return LongShortHashMap.this.shortIterator();
}
public void forEach(ShortProcedure procedure)
{
LongShortHashMap.this.forEach(procedure);
}
public int count(ShortPredicate predicate)
{
return LongShortHashMap.this.count(predicate);
}
public boolean anySatisfy(ShortPredicate predicate)
{
return LongShortHashMap.this.anySatisfy(predicate);
}
public boolean allSatisfy(ShortPredicate predicate)
{
return LongShortHashMap.this.allSatisfy(predicate);
}
public boolean noneSatisfy(ShortPredicate predicate)
{
return LongShortHashMap.this.noneSatisfy(predicate);
}
public boolean add(short element)
{
throw new UnsupportedOperationException("Cannot call add() on " + this.getClass().getSimpleName());
}
public boolean addAll(short... source)
{
throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
}
public boolean addAll(ShortIterable source)
{
throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
}
public boolean remove(short item)
{
int oldSize = LongShortHashMap.this.size();
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey && item == LongShortHashMap.this.sentinelValues.zeroValue)
{
LongShortHashMap.this.removeKey(EMPTY_KEY);
}
if (LongShortHashMap.this.sentinelValues.containsOneKey && item == LongShortHashMap.this.sentinelValues.oneValue)
{
LongShortHashMap.this.removeKey(REMOVED_KEY);
}
}
for (int i = 0; i < LongShortHashMap.this.keys.length; i++)
{
if (isNonSentinel(LongShortHashMap.this.keys[i]) && item == LongShortHashMap.this.values[i])
{
LongShortHashMap.this.removeKey(LongShortHashMap.this.keys[i]);
}
}
return oldSize != LongShortHashMap.this.size();
}
public boolean removeAll(ShortIterable source)
{
int oldSize = LongShortHashMap.this.size();
ShortIterator iterator = source.shortIterator();
while (iterator.hasNext())
{
this.remove(iterator.next());
}
return oldSize != LongShortHashMap.this.size();
}
public boolean removeAll(short... source)
{
int oldSize = LongShortHashMap.this.size();
for (short item : source)
{
this.remove(item);
}
return oldSize != LongShortHashMap.this.size();
}
public boolean retainAll(ShortIterable source)
{
int oldSize = this.size();
final ShortSet sourceSet = source instanceof ShortSet ? (ShortSet) source : source.toSet();
LongShortHashMap retained = LongShortHashMap.this.select(new LongShortPredicate()
{
public boolean accept(long key, short value)
{
return sourceSet.contains(value);
}
});
if (retained.size() != oldSize)
{
LongShortHashMap.this.keys = retained.keys;
LongShortHashMap.this.values = retained.values;
LongShortHashMap.this.sentinelValues = retained.sentinelValues;
LongShortHashMap.this.occupiedWithData = retained.occupiedWithData;
LongShortHashMap.this.occupiedWithSentinels = retained.occupiedWithSentinels;
return true;
}
return false;
}
public boolean retainAll(short... source)
{
return this.retainAll(ShortHashSet.newSetWith(source));
}
public int size()
{
return LongShortHashMap.this.size();
}
public short[] toArray()
{
return LongShortHashMap.this.toArray();
}
}
private class KeyValuesView extends AbstractLazyIterable
{
public void forEach(Procedure procedure)
{
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey)
{
procedure.value(PrimitiveTuples.pair(EMPTY_KEY, LongShortHashMap.this.sentinelValues.zeroValue));
}
if (LongShortHashMap.this.sentinelValues.containsOneKey)
{
procedure.value(PrimitiveTuples.pair(REMOVED_KEY, LongShortHashMap.this.sentinelValues.oneValue));
}
}
for (int i = 0; i < LongShortHashMap.this.keys.length; i++)
{
if (isNonSentinel(LongShortHashMap.this.keys[i]))
{
procedure.value(PrimitiveTuples.pair(LongShortHashMap.this.keys[i], LongShortHashMap.this.values[i]));
}
}
}
public void forEachWithIndex(ObjectIntProcedure objectIntProcedure)
{
int index = 0;
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey)
{
objectIntProcedure.value(PrimitiveTuples.pair(EMPTY_KEY, LongShortHashMap.this.sentinelValues.zeroValue), index);
index++;
}
if (LongShortHashMap.this.sentinelValues.containsOneKey)
{
objectIntProcedure.value(PrimitiveTuples.pair(REMOVED_KEY, LongShortHashMap.this.sentinelValues.oneValue), index);
index++;
}
}
for (int i = 0; i < LongShortHashMap.this.keys.length; i++)
{
if (isNonSentinel(LongShortHashMap.this.keys[i]))
{
objectIntProcedure.value(PrimitiveTuples.pair(LongShortHashMap.this.keys[i], LongShortHashMap.this.values[i]), index);
index++;
}
}
}
public void forEachWith(Procedure2 procedure, P parameter)
{
if (LongShortHashMap.this.sentinelValues != null)
{
if (LongShortHashMap.this.sentinelValues.containsZeroKey)
{
procedure.value(PrimitiveTuples.pair(EMPTY_KEY, LongShortHashMap.this.sentinelValues.zeroValue), parameter);
}
if (LongShortHashMap.this.sentinelValues.containsOneKey)
{
procedure.value(PrimitiveTuples.pair(REMOVED_KEY, LongShortHashMap.this.sentinelValues.oneValue), parameter);
}
}
for (int i = 0; i < LongShortHashMap.this.keys.length; i++)
{
if (isNonSentinel(LongShortHashMap.this.keys[i]))
{
procedure.value(PrimitiveTuples.pair(LongShortHashMap.this.keys[i], LongShortHashMap.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 LongShortPair next()
{
if (!this.hasNext())
{
throw new NoSuchElementException("next() called, but the iterator is exhausted");
}
this.count++;
if (!this.handledZero)
{
this.handledZero = true;
if (LongShortHashMap.this.containsKey(EMPTY_KEY))
{
return PrimitiveTuples.pair(EMPTY_KEY, LongShortHashMap.this.sentinelValues.zeroValue);
}
}
if (!this.handledOne)
{
this.handledOne = true;
if (LongShortHashMap.this.containsKey(REMOVED_KEY))
{
return PrimitiveTuples.pair(REMOVED_KEY, LongShortHashMap.this.sentinelValues.oneValue);
}
}
long[] keys = LongShortHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
LongShortPair result = PrimitiveTuples.pair(keys[this.position], LongShortHashMap.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 != LongShortHashMap.this.size();
}
}
}
}