/*
* 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.lang.reflect.Array;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
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.LazyIterable;
import com.gs.collections.api.RichIterable;
import com.gs.collections.api.bag.MutableBag;
import com.gs.collections.api.bag.primitive.MutableByteBag;
import com.gs.collections.api.block.function.Function;
import com.gs.collections.api.block.function.Function0;
import com.gs.collections.api.block.function.Function2;
import com.gs.collections.api.block.function.primitive.BooleanFunction;
import com.gs.collections.api.block.function.primitive.ByteFunction;
import com.gs.collections.api.block.function.primitive.CharFunction;
import com.gs.collections.api.block.function.primitive.DoubleFunction;
import com.gs.collections.api.block.function.primitive.DoubleObjectToDoubleFunction;
import com.gs.collections.api.block.function.primitive.FloatFunction;
import com.gs.collections.api.block.function.primitive.FloatObjectToFloatFunction;
import com.gs.collections.api.block.function.primitive.IntFunction;
import com.gs.collections.api.block.function.primitive.IntObjectToIntFunction;
import com.gs.collections.api.block.function.primitive.ByteToObjectFunction;
import com.gs.collections.api.block.function.primitive.ObjectByteToObjectFunction;
import com.gs.collections.api.block.function.primitive.LongFunction;
import com.gs.collections.api.block.function.primitive.LongObjectToLongFunction;
import com.gs.collections.api.block.function.primitive.ShortFunction;
import com.gs.collections.api.block.predicate.Predicate;
import com.gs.collections.api.block.predicate.Predicate2;
import com.gs.collections.api.block.predicate.primitive.ByteObjectPredicate;
import com.gs.collections.api.block.predicate.primitive.BytePredicate;
import com.gs.collections.api.block.procedure.primitive.ObjectIntProcedure;
import com.gs.collections.api.block.procedure.Procedure;
import com.gs.collections.api.block.procedure.Procedure2;
import com.gs.collections.api.block.procedure.primitive.ByteObjectProcedure;
import com.gs.collections.api.block.procedure.primitive.ByteProcedure;
import com.gs.collections.api.collection.MutableCollection;
import com.gs.collections.api.collection.primitive.MutableBooleanCollection;
import com.gs.collections.api.collection.primitive.MutableByteCollection;
import com.gs.collections.api.collection.primitive.MutableCharCollection;
import com.gs.collections.api.collection.primitive.MutableDoubleCollection;
import com.gs.collections.api.collection.primitive.MutableFloatCollection;
import com.gs.collections.api.collection.primitive.MutableIntCollection;
import com.gs.collections.api.collection.primitive.MutableLongCollection;
import com.gs.collections.api.collection.primitive.MutableShortCollection;
import com.gs.collections.api.iterator.ByteIterator;
import com.gs.collections.api.list.MutableList;
import com.gs.collections.api.list.primitive.MutableByteList;
import com.gs.collections.api.map.MutableMap;
import com.gs.collections.api.map.primitive.ByteObjectMap;
import com.gs.collections.api.map.primitive.ImmutableByteObjectMap;
import com.gs.collections.api.map.primitive.MutableByteObjectMap;
import com.gs.collections.api.map.sorted.MutableSortedMap;
import com.gs.collections.api.multimap.MutableMultimap;
import com.gs.collections.api.partition.PartitionIterable;
import com.gs.collections.api.partition.list.PartitionMutableList;
import com.gs.collections.api.set.MutableSet;
import com.gs.collections.api.set.primitive.ImmutableByteSet;
import com.gs.collections.api.set.primitive.ByteSet;
import com.gs.collections.api.set.primitive.MutableByteSet;
import com.gs.collections.api.set.sorted.MutableSortedSet;
import com.gs.collections.api.tuple.Pair;
import com.gs.collections.api.tuple.primitive.ByteObjectPair;
import com.gs.collections.impl.bag.mutable.primitive.ByteHashBag;
import com.gs.collections.impl.block.factory.Comparators;
import com.gs.collections.impl.block.factory.Functions0;
import com.gs.collections.impl.block.factory.Functions;
import com.gs.collections.impl.block.factory.Predicates;
import com.gs.collections.impl.block.factory.Procedures2;
import com.gs.collections.impl.block.procedure.MapCollectProcedure;
import com.gs.collections.impl.block.procedure.MutatingAggregationProcedure;
import com.gs.collections.impl.block.procedure.NonMutatingAggregationProcedure;
import com.gs.collections.impl.block.procedure.PartitionProcedure;
import com.gs.collections.impl.block.procedure.SelectInstancesOfProcedure;
import com.gs.collections.impl.block.procedure.primitive.CollectBooleanProcedure;
import com.gs.collections.impl.block.procedure.primitive.CollectByteProcedure;
import com.gs.collections.impl.block.procedure.primitive.CollectCharProcedure;
import com.gs.collections.impl.block.procedure.primitive.CollectDoubleProcedure;
import com.gs.collections.impl.block.procedure.primitive.CollectFloatProcedure;
import com.gs.collections.impl.block.procedure.primitive.CollectIntProcedure;
import com.gs.collections.impl.block.procedure.primitive.CollectLongProcedure;
import com.gs.collections.impl.block.procedure.primitive.CollectShortProcedure;
import com.gs.collections.impl.factory.Bags;
import com.gs.collections.impl.factory.Lists;
import com.gs.collections.impl.factory.Sets;
import com.gs.collections.impl.factory.primitive.ByteSets;
import com.gs.collections.impl.lazy.AbstractLazyIterable;
import com.gs.collections.impl.lazy.primitive.AbstractLazyByteIterable;
import com.gs.collections.impl.lazy.primitive.LazyByteIterableAdapter;
import com.gs.collections.impl.list.mutable.FastList;
import com.gs.collections.impl.list.mutable.primitive.BooleanArrayList;
import com.gs.collections.impl.list.mutable.primitive.ByteArrayList;
import com.gs.collections.impl.list.mutable.primitive.CharArrayList;
import com.gs.collections.impl.list.mutable.primitive.DoubleArrayList;
import com.gs.collections.impl.list.mutable.primitive.FloatArrayList;
import com.gs.collections.impl.list.mutable.primitive.IntArrayList;
import com.gs.collections.impl.list.mutable.primitive.LongArrayList;
import com.gs.collections.impl.list.mutable.primitive.ShortArrayList;
import com.gs.collections.impl.map.mutable.UnifiedMap;
import com.gs.collections.impl.map.sorted.mutable.TreeSortedMap;
import com.gs.collections.impl.multimap.list.FastListMultimap;
import com.gs.collections.impl.partition.list.PartitionFastList;
import com.gs.collections.impl.set.mutable.UnifiedSet;
import com.gs.collections.impl.set.mutable.primitive.ByteHashSet;
import com.gs.collections.impl.set.mutable.primitive.SynchronizedByteSet;
import com.gs.collections.impl.set.mutable.primitive.UnmodifiableByteSet;
import com.gs.collections.impl.set.sorted.mutable.TreeSortedSet;
import com.gs.collections.impl.tuple.primitive.PrimitiveTuples;
import com.gs.collections.impl.utility.Iterate;
import com.gs.collections.impl.utility.LazyIterate;
import com.gs.collections.impl.utility.internal.IterableIterate;
import com.gs.collections.impl.factory.primitive.ByteObjectMaps;
/**
* This file was automatically generated from template file primitiveObjectHashMap.stg.
*
* @since 3.0.
*/
public class ByteObjectHashMap<V> implements MutableByteObjectMap<V>, Externalizable
{
private static final long serialVersionUID = 1L;
private static final int DEFAULT_INITIAL_CAPACITY = 8;
private static final byte EMPTY_KEY = (byte) 0;
private static final byte REMOVED_KEY = (byte) 1;
private static final int OCCUPIED_DATA_RATIO = 2;
private static final int OCCUPIED_SENTINEL_RATIO = 4;
private byte[] keys;
private V[] values;
private SentinelValues<V> sentinelValues;
private int occupiedWithData;
private int occupiedWithSentinels;
public ByteObjectHashMap()
{
this.allocateTable(DEFAULT_INITIAL_CAPACITY << 1);
}
public ByteObjectHashMap(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 ByteObjectHashMap(ByteObjectMap<? extends V> 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 <V> ByteObjectHashMap<V> newMap()
{
return new ByteObjectHashMap<V>();
}
public static <V> ByteObjectHashMap<V> newWithKeysValues(byte key, V value)
{
return new ByteObjectHashMap<V>(1).withKeyValue(key, value);
}
public static <V> ByteObjectHashMap<V> newWithKeysValues(byte key1, V value1, byte key2, V value2)
{
return new ByteObjectHashMap<V>(2).withKeysValues(key1, value1, key2, value2);
}
public static <V> ByteObjectHashMap<V> newWithKeysValues(byte key1, V value1, byte key2, V value2, byte key3, V value3)
{
return new ByteObjectHashMap<V>(3).withKeysValues(key1, value1, key2, value2, key3, value3);
}
@Override
public boolean equals(Object obj)
{
if (this == obj)
{
return true;
}
if (!(obj instanceof ByteObjectMap))
{
return false;
}
ByteObjectMap<V> other = (ByteObjectMap<V>) 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) || !nullSafeEquals(this.sentinelValues.zeroValue, other.get(EMPTY_KEY))))
{
return false;
}
if (this.sentinelValues.containsOneKey && (!other.containsKey(REMOVED_KEY) || !nullSafeEquals(this.sentinelValues.oneValue, other.get(REMOVED_KEY))))
{
return false;
}
}
for (int i = 0; i < this.keys.length; i++)
{
byte key = this.keys[i];
if (isNonSentinel(key) && (!other.containsKey(key) || !nullSafeEquals(this.values[i], other.get(key))))
{
return false;
}
}
return true;
}
@Override
public int hashCode()
{
int result = 0;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
result += (int) EMPTY_KEY ^ (this.sentinelValues.zeroValue == null ? 0 : this.sentinelValues.zeroValue.hashCode());
}
if (this.sentinelValues.containsOneKey)
{
result += (int) REMOVED_KEY ^ (this.sentinelValues.oneValue == null ? 0 : this.sentinelValues.oneValue.hashCode());
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
result += (int) this.keys[i] ^ (this.values[i] == null ? 0 : this.values[i].hashCode());
}
}
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++)
{
byte 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++)
{
byte 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 Iterator<V> iterator()
{
return new InternalIterator();
}
public Object[] toArray()
{
Object[] result = new Object[this.size()];
int index = 0;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
result[index++] = this.sentinelValues.zeroValue;
}
if (this.sentinelValues.containsOneKey)
{
result[index++] = this.sentinelValues.oneValue;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
result[index++] = this.values[i];
}
}
return result;
}
public <T> T[] toArray(T[] a)
{
int size = this.size();
final T[] result = a.length < size
? (T[]) Array.newInstance(a.getClass().getComponentType(), size)
: a;
this.forEachWithIndex(new ObjectIntProcedure<Object>()
{
public void value(Object each, int index)
{
result[index] = (T) each;
}
});
if (result.length > size)
{
result[size] = null;
}
return result;
}
public boolean contains(Object object)
{
return this.containsValue(object);
}
public boolean containsAllIterable(Iterable<?> source)
{
for (Object item : source)
{
if (!this.contains(item))
{
return false;
}
}
return true;
}
public boolean containsAll(Collection<?> source)
{
return this.containsAllIterable(source);
}
public boolean containsAllArguments(Object... elements)
{
for (Object item : elements)
{
if (!this.contains(item))
{
return false;
}
}
return true;
}
public void forEach(Procedure<? super V> procedure)
{
this.forEachValue(procedure);
}
public void forEachWithIndex(ObjectIntProcedure<? super V> objectIntProcedure)
{
int index = 0;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
objectIntProcedure.value(this.sentinelValues.zeroValue, index++);
}
if (this.sentinelValues.containsOneKey)
{
objectIntProcedure.value(this.sentinelValues.oneValue, index++);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
objectIntProcedure.value(this.values[i], index++);
}
}
}
public <P> void forEachWith(Procedure2<? super V, ? super P> procedure, P parameter)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
procedure.value(this.sentinelValues.zeroValue, parameter);
}
if (this.sentinelValues.containsOneKey)
{
procedure.value(this.sentinelValues.oneValue, parameter);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
procedure.value(this.values[i], parameter);
}
}
}
public void forEachValue(Procedure<? super V> 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(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(ByteObjectProcedure<? super V> 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 ByteObjectHashMap<V> select(ByteObjectPredicate<? super V> predicate)
{
ByteObjectHashMap<V> result = ByteObjectHashMap.newMap();
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 ByteObjectHashMap<V> reject(ByteObjectPredicate<? super V> predicate)
{
ByteObjectHashMap<V> result = ByteObjectHashMap.newMap();
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 MutableCollection<V> select(Predicate<? super V> predicate)
{
MutableList<V> result = FastList.newList();
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 <R extends Collection<V>> R select(Predicate<? super V> predicate, R target)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue))
{
target.add(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue))
{
target.add(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i]))
{
target.add(this.values[i]);
}
}
return target;
}
public <P> MutableCollection<V> selectWith(Predicate2<? super V, ? super P> predicate, P parameter)
{
return this.select(Predicates.bind(predicate, parameter));
}
public <P, R extends Collection<V>> R selectWith(Predicate2<? super V, ? super P> predicate, P parameter, R targetCollection)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue, parameter))
{
targetCollection.add(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue, parameter))
{
targetCollection.add(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i], parameter))
{
targetCollection.add(this.values[i]);
}
}
return targetCollection;
}
public MutableCollection<V> reject(Predicate<? super V> predicate)
{
MutableList<V> result = FastList.newList();
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 <R extends Collection<V>> R reject(Predicate<? super V> predicate, R target)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && !predicate.accept(this.sentinelValues.zeroValue))
{
target.add(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey && !predicate.accept(this.sentinelValues.oneValue))
{
target.add(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && !predicate.accept(this.values[i]))
{
target.add(this.values[i]);
}
}
return target;
}
public <P> MutableCollection<V> rejectWith(Predicate2<? super V, ? super P> predicate, P parameter)
{
return this.reject(Predicates.bind(predicate, parameter));
}
public <P, R extends Collection<V>> R rejectWith(Predicate2<? super V, ? super P> predicate, P parameter, R targetCollection)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && !predicate.accept(this.sentinelValues.zeroValue, parameter))
{
targetCollection.add(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey && !predicate.accept(this.sentinelValues.oneValue, parameter))
{
targetCollection.add(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && !predicate.accept(this.values[i], parameter))
{
targetCollection.add(this.values[i]);
}
}
return targetCollection;
}
public PartitionMutableList<V> partition(Predicate<? super V> predicate)
{
PartitionMutableList<V> partitionMutableList = new PartitionFastList<V>();
this.forEach(new PartitionProcedure<V>(predicate, partitionMutableList));
return partitionMutableList;
}
public <P> PartitionMutableList<V> partitionWith(Predicate2<? super V, ? super P> predicate, P parameter)
{
PartitionMutableList<V> partitionMutableList = new PartitionFastList<V>();
this.forEach(new PartitionProcedure<V>(Predicates.bind(predicate, parameter), partitionMutableList));
return partitionMutableList;
}
public <S> MutableList<S> selectInstancesOf(Class<S> clazz)
{
FastList<S> result = FastList.newList(this.size());
this.forEach(new SelectInstancesOfProcedure<S>(clazz, result));
result.trimToSize();
return result;
}
public <VV> MutableCollection<VV> collect(Function<? super V, ? extends VV> function)
{
return this.collect(function, FastList.<VV>newList(this.size()));
}
public MutableBooleanCollection collectBoolean(BooleanFunction<? super V> booleanFunction)
{
return this.collectBoolean(booleanFunction, new BooleanArrayList(this.size()));
}
public <R extends MutableBooleanCollection> R collectBoolean(BooleanFunction<? super V> booleanFunction, R target)
{
this.forEach(new CollectBooleanProcedure<V>(booleanFunction, target));
return target;
}
public MutableByteCollection collectByte(ByteFunction<? super V> byteFunction)
{
return this.collectByte(byteFunction, new ByteArrayList(this.size()));
}
public <R extends MutableByteCollection> R collectByte(ByteFunction<? super V> byteFunction, R target)
{
this.forEach(new CollectByteProcedure<V>(byteFunction, target));
return target;
}
public MutableCharCollection collectChar(CharFunction<? super V> charFunction)
{
return this.collectChar(charFunction, new CharArrayList(this.size()));
}
public <R extends MutableCharCollection> R collectChar(CharFunction<? super V> charFunction, R target)
{
this.forEach(new CollectCharProcedure<V>(charFunction, target));
return target;
}
public MutableDoubleCollection collectDouble(DoubleFunction<? super V> doubleFunction)
{
return this.collectDouble(doubleFunction, new DoubleArrayList(this.size()));
}
public <R extends MutableDoubleCollection> R collectDouble(DoubleFunction<? super V> doubleFunction, R target)
{
this.forEach(new CollectDoubleProcedure<V>(doubleFunction, target));
return target;
}
public MutableFloatCollection collectFloat(FloatFunction<? super V> floatFunction)
{
return this.collectFloat(floatFunction, new FloatArrayList(this.size()));
}
public <R extends MutableFloatCollection> R collectFloat(FloatFunction<? super V> floatFunction, R target)
{
this.forEach(new CollectFloatProcedure<V>(floatFunction, target));
return target;
}
public MutableIntCollection collectInt(IntFunction<? super V> intFunction)
{
return this.collectInt(intFunction, new IntArrayList(this.size()));
}
public <R extends MutableIntCollection> R collectInt(IntFunction<? super V> intFunction, R target)
{
this.forEach(new CollectIntProcedure<V>(intFunction, target));
return target;
}
public MutableLongCollection collectLong(LongFunction<? super V> longFunction)
{
return this.collectLong(longFunction, new LongArrayList(this.size()));
}
public <R extends MutableLongCollection> R collectLong(LongFunction<? super V> longFunction, R target)
{
this.forEach(new CollectLongProcedure<V>(longFunction, target));
return target;
}
public MutableShortCollection collectShort(ShortFunction<? super V> shortFunction)
{
return this.collectShort(shortFunction, new ShortArrayList(this.size()));
}
public <R extends MutableShortCollection> R collectShort(ShortFunction<? super V> shortFunction, R target)
{
this.forEach(new CollectShortProcedure<V>(shortFunction, target));
return target;
}
public <P, VV> MutableCollection<VV> collectWith(Function2<? super V, ? super P, ? extends VV> function, P parameter)
{
return this.collect(Functions.bind(function, parameter));
}
public <P, VV, R extends Collection<VV>> R collectWith(Function2<? super V, ? super P, ? extends VV> function, P parameter, R targetCollection)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
targetCollection.add(function.value(this.sentinelValues.zeroValue, parameter));
}
if (this.sentinelValues.containsOneKey)
{
targetCollection.add(function.value(this.sentinelValues.oneValue, parameter));
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
targetCollection.add(function.value(this.values[i], parameter));
}
}
return targetCollection;
}
public <VV, R extends Collection<VV>> R collect(Function<? super V, ? extends VV> function, R target)
{
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 <VV> MutableList<VV> collectIf(Predicate<? super V> predicate, Function<? super V, ? extends VV> function)
{
return this.collectIf(predicate, function, FastList.<VV>newList());
}
public <VV, R extends Collection<VV>> R collectIf(Predicate<? super V> predicate, Function<? super V, ? extends VV> function, R target)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue))
{
target.add(function.valueOf(this.sentinelValues.zeroValue));
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue))
{
target.add(function.valueOf(this.sentinelValues.oneValue));
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i]))
{
target.add(function.valueOf(this.values[i]));
}
}
return target;
}
public <VV> MutableList<VV> flatCollect(Function<? super V, ? extends Iterable<VV>> function)
{
return this.flatCollect(function, FastList.<VV>newList());
}
public <VV, R extends Collection<VV>> R flatCollect(Function<? super V, ? extends Iterable<VV>> function, R target)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
Iterate.addAllTo(function.valueOf(this.sentinelValues.zeroValue), target);
}
if (this.sentinelValues.containsOneKey)
{
Iterate.addAllTo(function.valueOf(this.sentinelValues.oneValue), target);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
Iterate.addAllTo(function.valueOf(this.values[i]), target);
}
}
return target;
}
public V detect(Predicate<? super V> predicate)
{
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 null;
}
public <P> V detectWith(Predicate2<? super V, ? super P> predicate, P parameter)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue, parameter))
{
return this.sentinelValues.zeroValue;
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue, parameter))
{
return this.sentinelValues.oneValue;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i], parameter))
{
return this.values[i];
}
}
return null;
}
public V detectIfNone(Predicate<? super V> predicate, Function0<? extends V> function)
{
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 function.value();
}
public <P> V detectWithIfNone(Predicate2<? super V, ? super P> predicate, P parameter, Function0<? extends V> function)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue, parameter))
{
return this.sentinelValues.zeroValue;
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue, parameter))
{
return this.sentinelValues.oneValue;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i], parameter))
{
return this.values[i];
}
}
return function.value();
}
public int count(Predicate<? super V> 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 <P> int countWith(Predicate2<? super V, ? super P> predicate, P parameter)
{
int count = 0;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue, parameter))
{
count++;
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue, parameter))
{
count++;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i], parameter))
{
count++;
}
}
return count;
}
public boolean anySatisfy(Predicate<? super V> 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 <P> boolean anySatisfyWith(Predicate2<? super V, ? super P> predicate, P parameter)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue, parameter))
{
return true;
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue, parameter))
{
return true;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i], parameter))
{
return true;
}
}
return false;
}
public boolean allSatisfy(Predicate<? super V> 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 <P> boolean allSatisfyWith(Predicate2<? super V, ? super P> predicate, P parameter)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && !predicate.accept(this.sentinelValues.zeroValue, parameter))
{
return false;
}
if (this.sentinelValues.containsOneKey && !predicate.accept(this.sentinelValues.oneValue, parameter))
{
return false;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && !predicate.accept(this.values[i], parameter))
{
return false;
}
}
return true;
}
public boolean noneSatisfy(Predicate<? super V> 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 <P> boolean noneSatisfyWith(Predicate2<? super V, ? super P> predicate, P parameter)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue, parameter))
{
return false;
}
if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue, parameter))
{
return false;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i], parameter))
{
return false;
}
}
return true;
}
public <IV> IV injectInto(IV injectedValue, Function2<? super IV, ? super V, ? extends IV> function)
{
IV result = injectedValue;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
result = function.value(result, this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
result = function.value(result, this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
result = function.value(result, this.values[i]);
}
}
return result;
}
public int injectInto(int injectedValue, IntObjectToIntFunction<? super V> function)
{
int result = injectedValue;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
result = function.intValueOf(result, this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
result = function.intValueOf(result, this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
result = function.intValueOf(result, this.values[i]);
}
}
return result;
}
public long injectInto(long injectedValue, LongObjectToLongFunction<? super V> function)
{
long result = injectedValue;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
result = function.longValueOf(result, this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
result = function.longValueOf(result, this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
result = function.longValueOf(result, this.values[i]);
}
}
return result;
}
public float injectInto(float injectedValue, FloatObjectToFloatFunction<? super V> function)
{
float result = injectedValue;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
result = function.floatValueOf(result, this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
result = function.floatValueOf(result, this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
result = function.floatValueOf(result, this.values[i]);
}
}
return result;
}
public double injectInto(double injectedValue, DoubleObjectToDoubleFunction<? super V> function)
{
double result = injectedValue;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
result = function.doubleValueOf(result, this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
result = function.doubleValueOf(result, this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
result = function.doubleValueOf(result, this.values[i]);
}
}
return result;
}
public <S> MutableList<Pair<V, S>> zip(Iterable<S> that)
{
return this.zip(that, FastList.<Pair<V, S>>newList());
}
public <S, R extends Collection<Pair<V, S>>> R zip(Iterable<S> that, R target)
{
return IterableIterate.zip(this, that, target);
}
public MutableList<Pair<V, Integer>> zipWithIndex()
{
return this.zipWithIndex(FastList.<Pair<V, Integer>>newList());
}
public <R extends Collection<Pair<V, Integer>>> R zipWithIndex(R target)
{
return IterableIterate.zipWithIndex(this, target);
}
public RichIterable<RichIterable<V>> chunk(int size)
{
if (size <= 0)
{
throw new IllegalArgumentException("Size for groups must be positive but was: " + size);
}
Iterator<V> iterator = this.iterator();
MutableList<RichIterable<V>> result = Lists.mutable.of();
while (iterator.hasNext())
{
MutableList<V> batch = FastList.newList();
for (int i = 0; i < size && iterator.hasNext(); i++)
{
batch.add(iterator.next());
}
result.add(batch);
}
return result;
}
public <K, VV> MutableMap<K, VV> aggregateInPlaceBy(Function<? super V, ? extends K> groupBy, Function0<? extends VV> zeroValueFactory, Procedure2<? super VV, ? super V> mutatingAggregator)
{
MutableMap<K, VV> map = UnifiedMap.newMap();
this.forEach(new MutatingAggregationProcedure<V, K, VV>(map, groupBy, zeroValueFactory, mutatingAggregator));
return map;
}
public <K, VV> MutableMap<K, VV> aggregateBy(Function<? super V, ? extends K> groupBy, Function0<? extends VV> zeroValueFactory, Function2<? super VV, ? super V, ? extends VV> nonMutatingAggregator)
{
MutableMap<K, VV> map = UnifiedMap.newMap();
this.forEach(new NonMutatingAggregationProcedure<V, K, VV>(map, groupBy, zeroValueFactory, nonMutatingAggregator));
return map;
}
public <VV> MutableMultimap<VV, V> groupBy(Function<? super V, ? extends VV> function)
{
return this.groupBy(function, FastListMultimap.<VV, V>newMultimap());
}
public <VV, R extends MutableMultimap<VV, V>> R groupBy(Function<? super V, ? extends VV> function, R target)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
target.put(function.valueOf(this.sentinelValues.zeroValue), this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
target.put(function.valueOf(this.sentinelValues.oneValue), this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
target.put(function.valueOf(this.values[i]), this.values[i]);
}
}
return target;
}
public <VV> MutableMultimap<VV, V> groupByEach(Function<? super V, ? extends Iterable<VV>> function)
{
return this.groupByEach(function, FastListMultimap.<VV, V>newMultimap());
}
public <VV, R extends MutableMultimap<VV, V>> R groupByEach(
Function<? super V, ? extends Iterable<VV>> function,
R target)
{
return IterableIterate.groupByEach(this, function, target);
}
public <VV> MutableMap<VV, V> groupByUniqueKey(Function<? super V, ? extends VV> function)
{
throw new UnsupportedOperationException(this.getClass().getSimpleName() + ".groupByUniqueKey() not implemented yet");
}
public V getFirst()
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
return this.values[i];
}
}
return null;
}
public V getLast()
{
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
return this.values[i];
}
}
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
}
return null;
}
public MutableList<V> toList()
{
MutableList<V> list = Lists.mutable.of();
this.forEachWith(Procedures2.<V>addToCollection(), list);
return list;
}
public MutableList<V> toSortedList()
{
return this.toList().sortThis();
}
public MutableList<V> toSortedList(Comparator<? super V> comparator)
{
return this.toList().sortThis(comparator);
}
public <VV extends Comparable<? super VV>> MutableList<V> toSortedListBy(Function<? super V, ? extends VV> function)
{
return this.toList().sortThis(Comparators.byFunction(function));
}
public MutableSet<V> toSet()
{
MutableSet<V> set = UnifiedSet.newSet();
this.forEachWith(Procedures2.<V>addToCollection(), set);
return set;
}
public MutableSortedSet<V> toSortedSet()
{
MutableSortedSet<V> set = TreeSortedSet.newSet();
this.forEachWith(Procedures2.<V>addToCollection(), set);
return set;
}
public MutableSortedSet<V> toSortedSet(Comparator<? super V> comparator)
{
MutableSortedSet<V> set = TreeSortedSet.newSet(comparator);
this.forEachWith(Procedures2.<V>addToCollection(), set);
return set;
}
public <VV extends Comparable<? super VV>> MutableSortedSet<V> toSortedSetBy(Function<? super V, ? extends VV> function)
{
MutableSortedSet<V> set = TreeSortedSet.newSet(Comparators.byFunction(function));
this.forEachWith(Procedures2.<V>addToCollection(), set);
return set;
}
public MutableBag<V> toBag()
{
MutableBag<V> bag = Bags.mutable.of();
this.forEachWith(Procedures2.<V>addToCollection(), bag);
return bag;
}
public <NK, NV> MutableMap<NK, NV> toMap(Function<? super V, ? extends NK> keyFunction, Function<? super V, ? extends NV> valueFunction)
{
UnifiedMap<NK, NV> map = UnifiedMap.newMap();
this.forEach(new MapCollectProcedure<V, NK, NV>(map, keyFunction, valueFunction));
return map;
}
public <NK, NV> MutableSortedMap<NK, NV> toSortedMap(Function<? super V, ? extends NK> keyFunction, Function<? super V, ? extends NV> valueFunction)
{
return this.toSortedMap(Comparators.naturalOrder(), keyFunction, valueFunction);
}
public <NK, NV> MutableSortedMap<NK, NV> toSortedMap(Comparator<? super NK> comparator, Function<? super V, ? extends NK> keyFunction, Function<? super V, ? extends NV> valueFunction)
{
TreeSortedMap<NK, NV> sortedMap = TreeSortedMap.newMap(comparator);
this.forEach(new MapCollectProcedure<V, NK, NV>(sortedMap, keyFunction, valueFunction));
return sortedMap;
}
public LazyIterable<V> asLazy()
{
return LazyIterate.adapt(this);
}
public V min(Comparator<? super V> comparator)
{
if (this.isEmpty())
{
throw new NoSuchElementException();
}
V min = null;
boolean isMinSet = false;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
min = this.sentinelValues.zeroValue;
isMinSet = true;
}
if (this.sentinelValues.containsOneKey && (!isMinSet || comparator.compare(min, this.sentinelValues.oneValue) > 0))
{
min = this.sentinelValues.oneValue;
isMinSet = true;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && (!isMinSet || comparator.compare(min, this.values[i]) > 0))
{
min = this.values[i];
isMinSet = true;
}
}
return min;
}
public V max(Comparator<? super V> comparator)
{
if (this.isEmpty())
{
throw new NoSuchElementException();
}
V max = null;
boolean isMaxSet = false;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
max = this.sentinelValues.zeroValue;
isMaxSet = true;
}
if (this.sentinelValues.containsOneKey && (!isMaxSet || comparator.compare(max, this.sentinelValues.oneValue) < 0))
{
max = this.sentinelValues.oneValue;
isMaxSet = true;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && (!isMaxSet || comparator.compare(max, this.values[i]) < 0))
{
max = this.values[i];
isMaxSet = true;
}
}
return max;
}
public V min()
{
return this.min(Comparators.naturalOrder());
}
public V max()
{
return this.max(Comparators.naturalOrder());
}
public <VV extends Comparable<? super VV>> V maxBy(Function<? super V, ? extends VV> function)
{
if (this.isEmpty())
{
throw new NoSuchElementException();
}
V max = null;
boolean isMaxSet = false;
VV maxValue = null;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
max = this.sentinelValues.zeroValue;
isMaxSet = true;
maxValue = function.valueOf(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
VV nextValue = function.valueOf(this.sentinelValues.oneValue);
if (!isMaxSet || nextValue.compareTo(maxValue) > 0)
{
max = this.sentinelValues.oneValue;
isMaxSet = true;
maxValue = nextValue;
}
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
V next = this.values[i];
VV nextValue = function.valueOf(next);
if (!isMaxSet || nextValue.compareTo(maxValue) > 0)
{
max = next;
isMaxSet = true;
maxValue = nextValue;
}
}
}
return max;
}
public <VV extends Comparable<? super VV>> V minBy(Function<? super V, ? extends VV> function)
{
if (this.isEmpty())
{
throw new NoSuchElementException();
}
V min = null;
boolean isMinSet = false;
VV minValue = null;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
min = this.sentinelValues.zeroValue;
isMinSet = true;
minValue = function.valueOf(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
VV nextValue = function.valueOf(this.sentinelValues.oneValue);
if (!isMinSet || nextValue.compareTo(minValue) < 0)
{
min = this.sentinelValues.oneValue;
isMinSet = true;
minValue = nextValue;
}
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
V next = this.values[i];
VV nextValue = function.valueOf(next);
if (!isMinSet || nextValue.compareTo(minValue) < 0)
{
min = next;
isMinSet = true;
minValue = nextValue;
}
}
}
return min;
}
public long sumOfInt(IntFunction<? super V> function)
{
long sum = 0L;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
sum += function.intValueOf(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
sum += function.intValueOf(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
sum += function.intValueOf(this.values[i]);
}
}
return sum;
}
public double sumOfFloat(FloatFunction<? super V> function)
{
double sum = 0.0;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
sum += function.floatValueOf(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
sum += function.floatValueOf(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
sum += function.floatValueOf(this.values[i]);
}
}
return sum;
}
public long sumOfLong(LongFunction<? super V> function)
{
long sum = 0L;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
sum += function.longValueOf(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
sum += function.longValueOf(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
sum += function.longValueOf(this.values[i]);
}
}
return sum;
}
public double sumOfDouble(DoubleFunction<? super V> function)
{
double sum = 0.0;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
sum += function.doubleValueOf(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
sum += function.doubleValueOf(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
sum += function.doubleValueOf(this.values[i]);
}
}
return sum;
}
public void clear()
{
this.sentinelValues = null;
this.occupiedWithData = 0;
this.occupiedWithSentinels = 0;
Arrays.fill(this.keys, EMPTY_KEY);
Arrays.fill(this.values, null);
}
public V put(byte key, V value)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues<V>();
}
V oldValue = this.sentinelValues.zeroValue;
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = value;
return oldValue;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues<V>();
}
V oldValue = this.sentinelValues.oneValue;
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = value;
return oldValue;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
// key already present in map
V oldValue = this.values[index];
this.values[index] = value;
return oldValue;
}
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();
}
return null;
}
public void putAll(ByteObjectMap<? extends V> map)
{
map.forEachKeyValue(new ByteObjectProcedure<V>()
{
public void value(byte key, V value)
{
ByteObjectHashMap.this.put(key, value);
}
});
}
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 boolean containsValue(Object value)
{
if (this.sentinelValues != null && this.sentinelValues.containsValue((V) value))
{
return true;
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]) && nullSafeEquals(this.values[i], value))
{
return true;
}
}
return false;
}
public V get(byte key)
{
return this.getIfAbsent(key, Functions0.<V>nullValue());
}
public V getIfAbsent(byte key, Function0<? extends V> ifAbsent)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey)
{
return ifAbsent.value();
}
return this.sentinelValues.zeroValue;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null || !this.sentinelValues.containsOneKey)
{
return ifAbsent.value();
}
return this.sentinelValues.oneValue;
}
int index = this.probe(key);
if (this.keys[this.probe(key)] == key)
{
return this.values[index];
}
return ifAbsent.value();
}
public V getIfAbsentPut(byte key, V value)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = value;
return value;
}
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = value;
return value;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = value;
return value;
}
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = value;
return value;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[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();
}
return value;
}
public V getIfAbsentPut(byte key, Function0<? extends V> function)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
V value = function.value();
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = value;
return value;
}
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
V value = function.value();
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = value;
return value;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
V value = function.value();
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = value;
return value;
}
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
V value = function.value();
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = value;
return value;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[index];
}
if (this.keys[index] == REMOVED_KEY)
{
this.occupiedWithSentinels--;
}
this.keys[index] = key;
V value = function.value();
this.values[index] = value;
++this.occupiedWithData;
if (this.occupiedWithData > this.maxOccupiedWithData())
{
this.rehashAndGrow();
}
return value;
}
public <P> V getIfAbsentPutWith(byte key, Function<? super P, ? extends V> function, P parameter)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
V value = function.valueOf(parameter);
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = value;
return value;
}
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
V value = function.valueOf(parameter);
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = value;
return value;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
V value = function.valueOf(parameter);
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = value;
return value;
}
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
V value = function.valueOf(parameter);
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = value;
return value;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[index];
}
if (this.keys[index] == REMOVED_KEY)
{
this.occupiedWithSentinels--;
}
this.keys[index] = key;
V value = function.valueOf(parameter);
this.values[index] = value;
++this.occupiedWithData;
if (this.occupiedWithData > this.maxOccupiedWithData())
{
this.rehashAndGrow();
}
return value;
}
public V getIfAbsentPutWithKey(byte key, ByteToObjectFunction<? extends V> function)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
V value = function.valueOf(key);
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = value;
return value;
}
if (this.sentinelValues.containsZeroKey)
{
return this.sentinelValues.zeroValue;
}
V value = function.valueOf(key);
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = value;
return value;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
V value = function.valueOf(key);
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = value;
return value;
}
if (this.sentinelValues.containsOneKey)
{
return this.sentinelValues.oneValue;
}
V value = function.valueOf(key);
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = value;
return value;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
return this.values[index];
}
if (this.keys[index] == REMOVED_KEY)
{
this.occupiedWithSentinels--;
}
this.keys[index] = key;
V value = function.valueOf(key);
this.values[index] = value;
++this.occupiedWithData;
if (this.occupiedWithData > this.maxOccupiedWithData())
{
this.rehashAndGrow();
}
return value;
}
public V updateValue(byte key, Function0<? extends V> factory, Function<? super V, ? extends V> function)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = function.valueOf(factory.value());
}
else if (this.sentinelValues.containsZeroKey)
{
this.sentinelValues.zeroValue = function.valueOf(this.sentinelValues.zeroValue);
}
else
{
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = function.valueOf(factory.value());
}
return this.sentinelValues.zeroValue;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = function.valueOf(factory.value());
}
else if (this.sentinelValues.containsOneKey)
{
this.sentinelValues.oneValue = function.valueOf(this.sentinelValues.oneValue);
}
else
{
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = function.valueOf(factory.value());
}
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];
}
if (this.keys[index] == REMOVED_KEY)
{
this.occupiedWithSentinels--;
}
this.keys[index] = key;
V value = function.valueOf(factory.value());
this.values[index] = value;
++this.occupiedWithData;
if (this.occupiedWithData > this.maxOccupiedWithData())
{
this.rehashAndGrow();
}
return value;
}
public <P> V updateValueWith(byte key, Function0<? extends V> factory, Function2<? super V, ? super P, ? extends V> function, P parameter)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = function.value(factory.value(), parameter);
}
else if (this.sentinelValues.containsZeroKey)
{
this.sentinelValues.zeroValue = function.value(this.sentinelValues.zeroValue, parameter);
}
else
{
this.sentinelValues.containsZeroKey = true;
this.sentinelValues.zeroValue = function.value(factory.value(), parameter);
}
return this.sentinelValues.zeroValue;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues<V>();
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = function.value(factory.value(), parameter);
}
else if (this.sentinelValues.containsOneKey)
{
this.sentinelValues.oneValue = function.value(this.sentinelValues.oneValue, parameter);
}
else
{
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = function.value(factory.value(), parameter);
}
return this.sentinelValues.oneValue;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
this.values[index] = function.value(this.values[index], parameter);
return this.values[index];
}
if (this.keys[index] == REMOVED_KEY)
{
this.occupiedWithSentinels--;
}
this.keys[index] = key;
V value = function.value(factory.value(), parameter);
this.values[index] = value;
++this.occupiedWithData;
if (this.occupiedWithData > this.maxOccupiedWithData())
{
this.rehashAndGrow();
}
return value;
}
public V removeKey(byte key)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey)
{
return null;
}
V oldValue = this.sentinelValues.zeroValue;
if (this.sentinelValues.containsOneKey)
{
this.sentinelValues.containsZeroKey = false;
this.sentinelValues.zeroValue = null;
}
else
{
this.sentinelValues = null;
}
return oldValue;
}
if (isRemovedKey(key))
{
if (this.sentinelValues == null || !this.sentinelValues.containsOneKey)
{
return null;
}
V oldValue = this.sentinelValues.oneValue;
if (this.sentinelValues.containsZeroKey)
{
this.sentinelValues.containsOneKey = false;
this.sentinelValues.oneValue = null;
}
else
{
this.sentinelValues = null;
}
return oldValue;
}
int index = this.probe(key);
if (this.keys[index] == key)
{
this.keys[index] = REMOVED_KEY;
V oldValue = this.values[index];
this.values[index] = null;
this.occupiedWithData--;
this.occupiedWithSentinels++;
if (this.occupiedWithSentinels > this.maxOccupiedWithSentinels())
{
this.rehash();
}
return oldValue;
}
return null;
}
public V remove(byte key)
{
return this.removeKey(key);
}
public ByteObjectHashMap<V> withKeyValue(byte key, V value)
{
this.put(key, value);
return this;
}
public MutableByteObjectMap<V> withoutKey(byte key)
{
this.removeKey(key);
return this;
}
public MutableByteObjectMap<V> withoutAllKeys(ByteIterable keys)
{
ByteIterator iterator = keys.byteIterator();
while (iterator.hasNext())
{
byte item = iterator.next();
this.removeKey(item);
}
return this;
}
public ByteObjectHashMap<V> withKeysValues(byte key1, V value1, byte key2, V value2)
{
this.put(key1, value1);
this.put(key2, value2);
return this;
}
public ByteObjectHashMap<V> withKeysValues(byte key1, V value1, byte key2, V value2, byte key3, V value3)
{
this.put(key1, value1);
this.put(key2, value2);
this.put(key3, value3);
return this;
}
public ByteObjectHashMap<V> withKeysValues(byte key1, V value1, byte key2, V value2, byte key3, V value3, byte key4, V value4)
{
this.put(key1, value1);
this.put(key2, value2);
this.put(key3, value3);
this.put(key4, value4);
return this;
}
public MutableByteObjectMap<V> asUnmodifiable()
{
return new UnmodifiableByteObjectMap<V>(this);
}
public MutableByteObjectMap<V> asSynchronized()
{
return new SynchronizedByteObjectMap<V>(this);
}
public ImmutableByteObjectMap<V> toImmutable()
{
return ByteObjectMaps.immutable.withAll(this);
}
public void writeExternal(ObjectOutput out) throws IOException
{
out.writeInt(this.size());
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
out.writeByte(EMPTY_KEY);
out.writeObject(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
out.writeByte(REMOVED_KEY);
out.writeObject(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
out.writeByte(this.keys[i]);
out.writeObject(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(), (V) in.readObject());
}
}
private class SentinelValues<V>
{
private boolean containsZeroKey;
private boolean containsOneKey;
private V zeroValue;
private V oneValue;
public int size()
{
return (this.containsZeroKey ? 1 : 0) + (this.containsOneKey ? 1 : 0);
}
public boolean containsValue(V value)
{
boolean valueEqualsZeroValue = this.containsZeroKey && nullSafeEquals(this.zeroValue, value);
boolean valueEqualsOneValue = this.containsOneKey && nullSafeEquals(this.oneValue, value);
return valueEqualsZeroValue || valueEqualsOneValue;
}
}
private static boolean nullSafeEquals(Object value, Object other)
{
if (value == null)
{
if (other == null)
{
return true;
}
}
else if (other == value || value.equals(other))
{
return true;
}
return false;
}
private class InternalIterator implements Iterator<V>
{
private int count;
private int position;
private byte currentKey;
private boolean isCurrentKeySet;
private boolean handledZeroKey;
private boolean handledOneKey;
public boolean hasNext()
{
return this.count != ByteObjectHashMap.this.size();
}
public V next()
{
if (!this.hasNext())
{
throw new NoSuchElementException();
}
this.count++;
if (!this.handledZeroKey)
{
this.handledZeroKey = true;
if (ByteObjectHashMap.this.containsKey(EMPTY_KEY))
{
this.currentKey = ByteObjectHashMap.EMPTY_KEY;
this.isCurrentKeySet = true;
return ByteObjectHashMap.this.sentinelValues.zeroValue;
}
}
if (!this.handledOneKey)
{
this.handledOneKey = true;
if (ByteObjectHashMap.this.containsKey(REMOVED_KEY))
{
this.currentKey = ByteObjectHashMap.REMOVED_KEY;
this.isCurrentKeySet = true;
return ByteObjectHashMap.this.sentinelValues.oneValue;
}
}
byte[] keys = ByteObjectHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
this.currentKey = ByteObjectHashMap.this.keys[this.position];
this.isCurrentKeySet = true;
V result = ByteObjectHashMap.this.values[this.position];
this.position++;
return result;
}
public void remove()
{
if (!this.isCurrentKeySet)
{
throw new IllegalStateException();
}
this.isCurrentKeySet = false;
this.count--;
if (isNonSentinel(this.currentKey))
{
int index = this.position - 1;
ByteObjectHashMap.this.keys[index] = REMOVED_KEY;
ByteObjectHashMap.this.values[index] = null;
ByteObjectHashMap.this.occupiedWithData--;
ByteObjectHashMap.this.occupiedWithSentinels++;
if (ByteObjectHashMap.this.occupiedWithSentinels > ByteObjectHashMap.this.maxOccupiedWithSentinels())
{
ByteObjectHashMap.this.rehash();
}
}
else
{
ByteObjectHashMap.this.removeKey(this.currentKey);
}
}
}
public MutableByteSet keySet()
{
return new KeySet();
}
/**
* 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;
byte[] old = this.keys;
V[] 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.spread(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 spread(byte element)
{
// No spreading necessary for 8-bit types
return element & (this.keys.length - 1);
}
private void allocateTable(int sizeToAllocate)
{
this.keys = new byte[sizeToAllocate];
this.values = (V[]) new Object[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);
}
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 class KeySet implements MutableByteSet
{
public ByteIterator byteIterator()
{
return new KeysSetIterator();
}
public void forEach(ByteProcedure procedure)
{
ByteObjectHashMap.this.forEachKey(procedure);
}
public int count(BytePredicate predicate)
{
int count = 0;
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
count++;
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
count++;
}
}
for (byte key : ByteObjectHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
count++;
}
}
return count;
}
public boolean anySatisfy(BytePredicate predicate)
{
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
return true;
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
return true;
}
}
for (byte key : ByteObjectHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
return true;
}
}
return false;
}
public <T> T injectInto(T injectedValue, ObjectByteToObjectFunction<? super T, ? extends T> function)
{
T result = injectedValue;
for (byte key : ByteObjectHashMap.this.keys)
{
if (isNonSentinel(key))
{
result = function.valueOf(result, key);
}
}
return result;
}
public boolean allSatisfy(BytePredicate predicate)
{
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey && !predicate.accept(EMPTY_KEY))
{
return false;
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey && !predicate.accept(REMOVED_KEY))
{
return false;
}
}
for (byte key : ByteObjectHashMap.this.keys)
{
if (isNonSentinel(key) && !predicate.accept(key))
{
return false;
}
}
return true;
}
public boolean noneSatisfy(BytePredicate predicate)
{
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
return false;
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
return false;
}
}
for (byte key : ByteObjectHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
return false;
}
}
return true;
}
public boolean add(byte element)
{
throw new UnsupportedOperationException("Cannot call add() on " + this.getClass().getSimpleName());
}
public boolean addAll(byte... source)
{
throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
}
public boolean addAll(ByteIterable source)
{
throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
}
public boolean remove(byte key)
{
int oldSize = ByteObjectHashMap.this.size();
ByteObjectHashMap.this.removeKey(key);
return oldSize != ByteObjectHashMap.this.size();
}
public boolean removeAll(ByteIterable source)
{
int oldSize = ByteObjectHashMap.this.size();
ByteIterator iterator = source.byteIterator();
while (iterator.hasNext())
{
ByteObjectHashMap.this.removeKey(iterator.next());
}
return oldSize != ByteObjectHashMap.this.size();
}
public boolean removeAll(byte... source)
{
int oldSize = ByteObjectHashMap.this.size();
for (byte item : source)
{
ByteObjectHashMap.this.removeKey(item);
}
return oldSize != ByteObjectHashMap.this.size();
}
public boolean retainAll(ByteIterable source)
{
int oldSize = this.size();
final ByteSet sourceSet = source instanceof ByteSet ? (ByteSet) source : source.toSet();
ByteObjectHashMap<V> retained = ByteObjectHashMap.this.select(new ByteObjectPredicate<V>()
{
public boolean accept(byte key, V value)
{
return sourceSet.contains(key);
}
});
if (retained.size() != oldSize)
{
ByteObjectHashMap.this.keys = retained.keys;
ByteObjectHashMap.this.values = retained.values;
ByteObjectHashMap.this.sentinelValues = retained.sentinelValues;
ByteObjectHashMap.this.occupiedWithData = retained.occupiedWithData;
ByteObjectHashMap.this.occupiedWithSentinels = retained.occupiedWithSentinels;
return true;
}
return false;
}
public boolean retainAll(byte... source)
{
return this.retainAll(ByteHashSet.newSetWith(source));
}
public void clear()
{
ByteObjectHashMap.this.clear();
}
public MutableByteSet select(BytePredicate predicate)
{
MutableByteSet result = new ByteHashSet();
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
result.add(EMPTY_KEY);
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
result.add(REMOVED_KEY);
}
}
for (byte key : ByteObjectHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
result.add(key);
}
}
return result;
}
public MutableByteSet reject(BytePredicate predicate)
{
MutableByteSet result = new ByteHashSet();
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey && !predicate.accept(EMPTY_KEY))
{
result.add(EMPTY_KEY);
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey && !predicate.accept(REMOVED_KEY))
{
result.add(REMOVED_KEY);
}
}
for (byte key : ByteObjectHashMap.this.keys)
{
if (isNonSentinel(key) && !predicate.accept(key))
{
result.add(key);
}
}
return result;
}
public MutableByteSet with(byte element)
{
throw new UnsupportedOperationException("Cannot call with() on " + this.getClass().getSimpleName());
}
public MutableByteSet without(byte element)
{
throw new UnsupportedOperationException("Cannot call without() on " + this.getClass().getSimpleName());
}
public MutableByteSet withAll(ByteIterable elements)
{
throw new UnsupportedOperationException("Cannot call withAll() on " + this.getClass().getSimpleName());
}
public MutableByteSet withoutAll(ByteIterable elements)
{
throw new UnsupportedOperationException("Cannot call withoutAll() on " + this.getClass().getSimpleName());
}
public byte detectIfNone(BytePredicate predicate, byte ifNone)
{
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
return EMPTY_KEY;
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
return REMOVED_KEY;
}
}
for (byte key : ByteObjectHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
return key;
}
}
return ifNone;
}
public <V> MutableSet<V> collect(ByteToObjectFunction<? extends V> function)
{
MutableSet<V> result = Sets.mutable.with();
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey)
{
result.add(function.valueOf(EMPTY_KEY));
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey)
{
result.add(function.valueOf(REMOVED_KEY));
}
}
for (byte key : ByteObjectHashMap.this.keys)
{
if (isNonSentinel(key))
{
result.add(function.valueOf(key));
}
}
return result;
}
public MutableByteSet asUnmodifiable()
{
return UnmodifiableByteSet.of(this);
}
public MutableByteSet asSynchronized()
{
return SynchronizedByteSet.of(this);
}
public long sum()
{
long sum = 0L;
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey)
{
sum += EMPTY_KEY;
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey)
{
sum += REMOVED_KEY;
}
}
for (byte key : ByteObjectHashMap.this.keys)
{
if (isNonSentinel(key))
{
sum += key;
}
}
return sum;
}
public byte max()
{
if (ByteObjectHashMap.this.isEmpty())
{
throw new NoSuchElementException();
}
byte max = (byte) 0;
boolean isMaxSet = false;
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey)
{
max = EMPTY_KEY;
isMaxSet = true;
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey && (!isMaxSet || max < REMOVED_KEY))
{
max = REMOVED_KEY;
isMaxSet = true;
}
}
for (int i = 0; i < ByteObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(ByteObjectHashMap.this.keys[i]) && (!isMaxSet || max < ByteObjectHashMap.this.keys[i]))
{
max = ByteObjectHashMap.this.keys[i];
isMaxSet = true;
}
}
return max;
}
public byte maxIfEmpty(byte defaultValue)
{
if (ByteObjectHashMap.this.isEmpty())
{
return defaultValue;
}
return this.max();
}
public byte min()
{
if (ByteObjectHashMap.this.isEmpty())
{
throw new NoSuchElementException();
}
byte min = (byte) 0;
boolean isMinSet = false;
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey)
{
min = EMPTY_KEY;
isMinSet = true;
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey && (!isMinSet || REMOVED_KEY < min))
{
min = REMOVED_KEY;
isMinSet = true;
}
}
for (int i = 0; i < ByteObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(ByteObjectHashMap.this.keys[i]) && (!isMinSet || ByteObjectHashMap.this.keys[i] < min))
{
min = ByteObjectHashMap.this.keys[i];
isMinSet = true;
}
}
return min;
}
public byte minIfEmpty(byte defaultValue)
{
if (ByteObjectHashMap.this.isEmpty())
{
return defaultValue;
}
return this.min();
}
public double average()
{
if (ByteObjectHashMap.this.isEmpty())
{
throw new ArithmeticException();
}
return (double) this.sum() / (double) this.size();
}
public double median()
{
if (ByteObjectHashMap.this.isEmpty())
{
throw new ArithmeticException();
}
byte[] sortedArray = this.toSortedArray();
int middleIndex = sortedArray.length >> 1;
if (sortedArray.length > 1 && (sortedArray.length & 1) == 0)
{
byte first = sortedArray[middleIndex];
byte second = sortedArray[middleIndex - 1];
return ((double) first + (double) second) / 2.0;
}
return (double) sortedArray[middleIndex];
}
public byte[] toSortedArray()
{
byte[] array = this.toArray();
Arrays.sort(array);
return array;
}
public MutableByteList toSortedList()
{
return ByteArrayList.newList(this).sortThis();
}
public byte[] toArray()
{
int size = ByteObjectHashMap.this.size();
final byte[] result = new byte[size];
ByteObjectHashMap.this.forEachKey(new ByteProcedure()
{
private int index;
public void value(byte each)
{
result[this.index] = each;
this.index++;
}
});
return result;
}
public boolean contains(byte value)
{
return ByteObjectHashMap.this.containsKey(value);
}
public boolean containsAll(byte... source)
{
for (byte item : source)
{
if (!ByteObjectHashMap.this.containsKey(item))
{
return false;
}
}
return true;
}
public boolean containsAll(ByteIterable source)
{
ByteIterator iterator = source.byteIterator();
while (iterator.hasNext())
{
if (!ByteObjectHashMap.this.containsKey(iterator.next()))
{
return false;
}
}
return true;
}
public MutableByteList toList()
{
return ByteArrayList.newList(this);
}
public MutableByteSet toSet()
{
return ByteHashSet.newSet(this);
}
public MutableByteBag toBag()
{
return ByteHashBag.newBag(this);
}
public LazyByteIterable asLazy()
{
return new LazyByteIterableAdapter(this);
}
public ByteSet freeze()
{
throw new UnsupportedOperationException(this.getClass().getSimpleName() + ".freeze() not implemented yet");
}
public ImmutableByteSet toImmutable()
{
return ByteSets.immutable.withAll(this);
}
public int size()
{
return ByteObjectHashMap.this.size();
}
public boolean isEmpty()
{
return ByteObjectHashMap.this.isEmpty();
}
public boolean notEmpty()
{
return ByteObjectHashMap.this.notEmpty();
}
@Override
public boolean equals(Object obj)
{
if (this == obj)
{
return true;
}
if (!(obj instanceof ByteSet))
{
return false;
}
ByteSet other = (ByteSet) obj;
return this.size() == other.size() && this.containsAll(other.toArray());
}
@Override
public int hashCode()
{
int result = 0;
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey)
{
result += (int) EMPTY_KEY;
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey)
{
result += (int) REMOVED_KEY;
}
}
for (int i = 0; i < ByteObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(ByteObjectHashMap.this.keys[i]))
{
result += (int) ByteObjectHashMap.this.keys[i];
}
}
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 (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey)
{
appendable.append(String.valueOf(EMPTY_KEY));
first = false;
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey)
{
if (!first)
{
appendable.append(separator);
}
appendable.append(String.valueOf(REMOVED_KEY));
first = false;
}
}
for (byte key : ByteObjectHashMap.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);
}
}
}
private class KeysSetIterator implements ByteIterator
{
private int count;
private int position;
private boolean handledZeroKey;
private boolean handledOneKey;
public boolean hasNext()
{
return this.count != ByteObjectHashMap.this.size();
}
public byte next()
{
if (!this.hasNext())
{
throw new NoSuchElementException();
}
this.count++;
if (!this.handledZeroKey)
{
this.handledZeroKey = true;
if (ByteObjectHashMap.this.containsKey(EMPTY_KEY))
{
return ByteObjectHashMap.EMPTY_KEY;
}
}
if (!this.handledOneKey)
{
this.handledOneKey = true;
if (ByteObjectHashMap.this.containsKey(REMOVED_KEY))
{
return ByteObjectHashMap.REMOVED_KEY;
}
}
byte[] keys = ByteObjectHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
byte result = ByteObjectHashMap.this.keys[this.position];
this.position++;
return result;
}
}
public Collection<V> values()
{
return new ValuesCollection();
}
public LazyByteIterable keysView()
{
return new KeysView();
}
public RichIterable<ByteObjectPair<V>> keyValuesView()
{
return new KeyValuesView();
}
protected class ValuesCollection implements Collection<V>
{
public boolean add(V v)
{
throw new UnsupportedOperationException("Cannot call add() on " + this.getClass().getSimpleName());
}
public boolean addAll(Collection<? extends V> collection)
{
throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
}
public void clear()
{
ByteObjectHashMap.this.clear();
}
public boolean contains(Object o)
{
return ByteObjectHashMap.this.containsValue(o);
}
public boolean containsAll(Collection<?> collection)
{
// todo: this is N^2. if c is large, we should copy the values to a set.
return Iterate.allSatisfy(collection, Predicates.in(this));
}
public boolean isEmpty()
{
return ByteObjectHashMap.this.isEmpty();
}
public Iterator<V> iterator()
{
return ByteObjectHashMap.this.iterator();
}
public boolean remove(Object o)
{
// this is so slow that the extra overhead of the iterator won't be noticeable
if (o == null)
{
for (Iterator<V> it = this.iterator(); it.hasNext(); )
{
if (it.next() == null)
{
it.remove();
return true;
}
}
}
else
{
for (Iterator<V> it = this.iterator(); it.hasNext(); )
{
V o2 = it.next();
if (o == o2 || o2.equals(o))
{
it.remove();
return true;
}
}
}
return false;
}
public boolean removeAll(Collection<?> collection)
{
// todo: this is N^2. if c is large, we should copy the values to a set.
boolean changed = false;
for (Object obj : collection)
{
if (this.remove(obj))
{
changed = true;
}
}
return changed;
}
public boolean retainAll(Collection<?> collection)
{
boolean modified = false;
Iterator<V> e = this.iterator();
while (e.hasNext())
{
if (!collection.contains(e.next()))
{
e.remove();
modified = true;
}
}
return modified;
}
public int size()
{
return ByteObjectHashMap.this.size();
}
public Object[] toArray()
{
return ByteObjectHashMap.this.toArray();
}
public <T> T[] toArray(T[] result)
{
return ByteObjectHashMap.this.toArray(result);
}
}
private class KeysView extends AbstractLazyByteIterable
{
public ByteIterator byteIterator()
{
return new KeysSetIterator();
}
public void forEach(ByteProcedure procedure)
{
ByteObjectHashMap.this.forEachKey(procedure);
}
}
private class KeyValuesView extends AbstractLazyIterable<ByteObjectPair<V>>
{
public void forEach(Procedure<? super ByteObjectPair<V>> procedure)
{
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey)
{
procedure.value(PrimitiveTuples.pair(EMPTY_KEY, ByteObjectHashMap.this.sentinelValues.zeroValue));
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey)
{
procedure.value(PrimitiveTuples.pair(REMOVED_KEY, ByteObjectHashMap.this.sentinelValues.oneValue));
}
}
for (int i = 0; i < ByteObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(ByteObjectHashMap.this.keys[i]))
{
procedure.value(PrimitiveTuples.pair(ByteObjectHashMap.this.keys[i], ByteObjectHashMap.this.values[i]));
}
}
}
public void forEachWithIndex(ObjectIntProcedure<? super ByteObjectPair<V>> objectIntProcedure)
{
int index = 0;
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey)
{
objectIntProcedure.value(PrimitiveTuples.pair(EMPTY_KEY, ByteObjectHashMap.this.sentinelValues.zeroValue), index);
index++;
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey)
{
objectIntProcedure.value(PrimitiveTuples.pair(REMOVED_KEY, ByteObjectHashMap.this.sentinelValues.oneValue), index);
index++;
}
}
for (int i = 0; i < ByteObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(ByteObjectHashMap.this.keys[i]))
{
objectIntProcedure.value(PrimitiveTuples.pair(ByteObjectHashMap.this.keys[i], ByteObjectHashMap.this.values[i]), index);
index++;
}
}
}
public <P> void forEachWith(Procedure2<? super ByteObjectPair<V>, ? super P> procedure, P parameter)
{
if (ByteObjectHashMap.this.sentinelValues != null)
{
if (ByteObjectHashMap.this.sentinelValues.containsZeroKey)
{
procedure.value(PrimitiveTuples.pair(EMPTY_KEY, ByteObjectHashMap.this.sentinelValues.zeroValue), parameter);
}
if (ByteObjectHashMap.this.sentinelValues.containsOneKey)
{
procedure.value(PrimitiveTuples.pair(REMOVED_KEY, ByteObjectHashMap.this.sentinelValues.oneValue), parameter);
}
}
for (int i = 0; i < ByteObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(ByteObjectHashMap.this.keys[i]))
{
procedure.value(PrimitiveTuples.pair(ByteObjectHashMap.this.keys[i], ByteObjectHashMap.this.values[i]), parameter);
}
}
}
public Iterator<ByteObjectPair<V>> iterator()
{
return new InternalKeyValuesIterator();
}
public class InternalKeyValuesIterator implements Iterator<ByteObjectPair<V>>
{
private int count;
private int position;
private boolean handledZero;
private boolean handledOne;
public ByteObjectPair<V> next()
{
if (!this.hasNext())
{
throw new NoSuchElementException("next() called, but the iterator is exhausted");
}
this.count++;
if (!this.handledZero)
{
this.handledZero = true;
if (ByteObjectHashMap.this.containsKey(EMPTY_KEY))
{
return PrimitiveTuples.pair(EMPTY_KEY, ByteObjectHashMap.this.sentinelValues.zeroValue);
}
}
if (!this.handledOne)
{
this.handledOne = true;
if (ByteObjectHashMap.this.containsKey(REMOVED_KEY))
{
return PrimitiveTuples.pair(REMOVED_KEY, ByteObjectHashMap.this.sentinelValues.oneValue);
}
}
byte[] keys = ByteObjectHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
ByteObjectPair<V> result = PrimitiveTuples.pair(keys[this.position], ByteObjectHashMap.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 != ByteObjectHashMap.this.size();
}
}
}
}