Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
com.gs.collections.impl.map.mutable.primitive.DoubleObjectHashMap Maven / Gradle / Ivy
GS Collections is a collections framework for Java. It has JDK-compatible List, Set and Map
implementations with a rich API and set of utility classes that work with any JDK compatible Collections,
Arrays, Maps or Strings. The iteration protocol was inspired by the Smalltalk collection framework.
/*
* 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.DoubleIterable;
import com.gs.collections.api.LazyDoubleIterable;
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.sorted.MutableSortedBag;
import com.gs.collections.impl.bag.mutable.HashBag;
import com.gs.collections.impl.bag.sorted.mutable.TreeBag;
import com.gs.collections.api.bag.primitive.MutableDoubleBag;
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.DoubleToObjectFunction;
import com.gs.collections.api.block.function.primitive.ObjectDoubleToObjectFunction;
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.DoubleObjectPredicate;
import com.gs.collections.api.block.predicate.primitive.DoublePredicate;
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.DoubleObjectProcedure;
import com.gs.collections.api.block.procedure.primitive.DoubleProcedure;
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.DoubleIterator;
import com.gs.collections.api.iterator.MutableDoubleIterator;
import com.gs.collections.api.list.MutableList;
import com.gs.collections.api.list.primitive.MutableDoubleList;
import com.gs.collections.api.map.MutableMap;
import com.gs.collections.api.map.primitive.ObjectDoubleMap;
import com.gs.collections.api.map.primitive.ObjectLongMap;
import com.gs.collections.api.map.primitive.DoubleObjectMap;
import com.gs.collections.api.map.primitive.ImmutableDoubleObjectMap;
import com.gs.collections.api.map.primitive.MutableDoubleObjectMap;
import com.gs.collections.api.map.sorted.MutableSortedMap;
import com.gs.collections.api.multimap.MutableMultimap;
import com.gs.collections.api.multimap.bag.MutableBagMultimap;
import com.gs.collections.api.partition.list.PartitionMutableList;
import com.gs.collections.api.partition.bag.PartitionMutableBag;
import com.gs.collections.impl.partition.bag.PartitionHashBag;
import com.gs.collections.api.set.MutableSet;
import com.gs.collections.api.set.primitive.ImmutableDoubleSet;
import com.gs.collections.api.set.primitive.DoubleSet;
import com.gs.collections.api.set.primitive.MutableDoubleSet;
import com.gs.collections.api.set.sorted.MutableSortedSet;
import com.gs.collections.api.tuple.Pair;
import com.gs.collections.api.tuple.primitive.DoubleObjectPair;
import com.gs.collections.impl.SpreadFunctions;
import com.gs.collections.impl.bag.mutable.primitive.DoubleHashBag;
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.factory.PrimitiveFunctions;
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.DoubleSets;
import com.gs.collections.impl.iterator.UnmodifiableDoubleIterator;
import com.gs.collections.impl.lazy.AbstractLazyIterable;
import com.gs.collections.impl.lazy.primitive.AbstractLazyDoubleIterable;
import com.gs.collections.impl.lazy.primitive.LazyDoubleIterableAdapter;
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.multimap.bag.HashBagMultimap;
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.DoubleHashSet;
import com.gs.collections.impl.set.mutable.primitive.SynchronizedDoubleSet;
import com.gs.collections.impl.set.mutable.primitive.UnmodifiableDoubleSet;
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.DoubleObjectMaps;
/**
* This file was automatically generated from template file primitiveObjectHashMap.stg.
*
* @since 3.0.
*/
public class DoubleObjectHashMap implements MutableDoubleObjectMap, Externalizable
{
private static final long serialVersionUID = 1L;
private static final int DEFAULT_INITIAL_CAPACITY = 8;
private static final double EMPTY_KEY = 0.0;
private static final double REMOVED_KEY = 1.0;
private static final int OCCUPIED_DATA_RATIO = 2;
private static final int OCCUPIED_SENTINEL_RATIO = 4;
private static final int CACHE_LINE_SIZE = 64;
private static final int KEY_SIZE = 8;
private static final int INITIAL_LINEAR_PROBE = CACHE_LINE_SIZE / KEY_SIZE / 2; /* half a cache line */
private double[] keys;
private V[] values;
private int occupiedWithData;
private int occupiedWithSentinels;
private SentinelValues sentinelValues;
private boolean copyKeysOnWrite = false;
public DoubleObjectHashMap()
{
this.allocateTable(DEFAULT_INITIAL_CAPACITY << 1);
}
public DoubleObjectHashMap(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);
}
public DoubleObjectHashMap(DoubleObjectMap map)
{
this(Math.max(map.size(), DEFAULT_INITIAL_CAPACITY));
this.putAll(map);
}
private int smallestPowerOfTwoGreaterThan(int n)
{
return n > 1 ? Integer.highestOneBit(n - 1) << 1 : 1;
}
private int fastCeil(float v)
{
int possibleResult = (int) v;
if (v - possibleResult > 0.0F)
{
possibleResult++;
}
return possibleResult;
}
public static DoubleObjectHashMap newMap()
{
return new DoubleObjectHashMap();
}
public static DoubleObjectHashMap newMap(DoubleObjectMap map)
{
return new DoubleObjectHashMap(map);
}
public static DoubleObjectHashMap newWithKeysValues(double key, V value)
{
return new DoubleObjectHashMap(1).withKeyValue(key, value);
}
public static DoubleObjectHashMap newWithKeysValues(double key1, V value1, double key2, V value2)
{
return new DoubleObjectHashMap(2).withKeysValues(key1, value1, key2, value2);
}
public static DoubleObjectHashMap newWithKeysValues(double key1, V value1, double key2, V value2, double key3, V value3)
{
return new DoubleObjectHashMap(3).withKeysValues(key1, value1, key2, value2, key3, value3);
}
@Override
public boolean equals(Object obj)
{
if (this == obj)
{
return true;
}
if (!(obj instanceof DoubleObjectMap))
{
return false;
}
DoubleObjectMap other = (DoubleObjectMap) 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++)
{
double 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) (Double.doubleToLongBits(EMPTY_KEY) ^ Double.doubleToLongBits(EMPTY_KEY) >>> 32) ^ (this.sentinelValues.zeroValue == null ? 0 : this.sentinelValues.zeroValue.hashCode());
}
if (this.sentinelValues.containsOneKey)
{
result += (int) (Double.doubleToLongBits(REMOVED_KEY) ^ Double.doubleToLongBits(REMOVED_KEY) >>> 32) ^ (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) (Double.doubleToLongBits(this.keys[i]) ^ Double.doubleToLongBits(this.keys[i]) >>> 32) ^ (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(EMPTY_KEY).append("=").append(this.sentinelValues.zeroValue);
first = false;
}
if (this.sentinelValues.containsOneKey)
{
if (!first)
{
appendable.append(", ");
}
appendable.append(REMOVED_KEY).append("=").append(this.sentinelValues.oneValue);
first = false;
}
}
for (int i = 0; i < this.keys.length; i++)
{
double key = this.keys[i];
if (isNonSentinel(key))
{
if (!first)
{
appendable.append(", ");
}
appendable.append(key).append("=").append(this.values[i]);
first = false;
}
}
appendable.append("}");
return appendable.toString();
}
public 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++)
{
double 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 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[] 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()
{
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 DoubleObjectHashMap tap(Procedure procedure)
{
this.forEachValue(procedure);
return this;
}
public void forEach(Procedure procedure)
{
this.each(procedure);
}
public void each(Procedure procedure)
{
this.forEachValue(procedure);
}
public void forEachWithIndex(ObjectIntProcedure 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 void forEachWith(Procedure2 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 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(DoubleProcedure 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(DoubleObjectProcedure 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 DoubleObjectHashMap select(DoubleObjectPredicate predicate)
{
DoubleObjectHashMap result = DoubleObjectHashMap.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 DoubleObjectHashMap reject(DoubleObjectPredicate predicate)
{
DoubleObjectHashMap result = DoubleObjectHashMap.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 select(Predicate predicate)
{
MutableList 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 select(Predicate 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 MutableCollection selectWith(Predicate2 predicate, P parameter)
{
return this.select(Predicates.bind(predicate, parameter));
}
public > R selectWith(Predicate2 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 reject(Predicate predicate)
{
MutableList 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 reject(Predicate 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 MutableCollection rejectWith(Predicate2 predicate, P parameter)
{
return this.reject(Predicates.bind(predicate, parameter));
}
public > R rejectWith(Predicate2 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 PartitionMutableBag partition(Predicate predicate)
{
PartitionMutableBag partitionMutableBag = new PartitionHashBag();
this.forEach(new PartitionProcedure(predicate, partitionMutableBag));
return partitionMutableBag;
}
public PartitionMutableBag partitionWith(Predicate2 predicate, P parameter)
{
PartitionMutableBag partitionMutableBag = new PartitionHashBag();
this.forEach(new PartitionProcedure(Predicates.bind(predicate, parameter), partitionMutableBag));
return partitionMutableBag;
}
public MutableBag selectInstancesOf(Class clazz)
{
MutableBag result = HashBag.newBag(this.size());
this.forEach(new SelectInstancesOfProcedure(clazz, result));
return result;
}
public MutableCollection collect(Function function)
{
return this.collect(function, FastList.newList(this.size()));
}
public MutableBooleanCollection collectBoolean(BooleanFunction booleanFunction)
{
return this.collectBoolean(booleanFunction, new BooleanArrayList(this.size()));
}
public R collectBoolean(BooleanFunction booleanFunction, R target)
{
this.forEach(new CollectBooleanProcedure(booleanFunction, target));
return target;
}
public MutableByteCollection collectByte(ByteFunction byteFunction)
{
return this.collectByte(byteFunction, new ByteArrayList(this.size()));
}
public R collectByte(ByteFunction byteFunction, R target)
{
this.forEach(new CollectByteProcedure(byteFunction, target));
return target;
}
public MutableCharCollection collectChar(CharFunction charFunction)
{
return this.collectChar(charFunction, new CharArrayList(this.size()));
}
public R collectChar(CharFunction charFunction, R target)
{
this.forEach(new CollectCharProcedure(charFunction, target));
return target;
}
public MutableDoubleCollection collectDouble(DoubleFunction doubleFunction)
{
return this.collectDouble(doubleFunction, new DoubleArrayList(this.size()));
}
public R collectDouble(DoubleFunction doubleFunction, R target)
{
this.forEach(new CollectDoubleProcedure(doubleFunction, target));
return target;
}
public MutableFloatCollection collectFloat(FloatFunction floatFunction)
{
return this.collectFloat(floatFunction, new FloatArrayList(this.size()));
}
public R collectFloat(FloatFunction floatFunction, R target)
{
this.forEach(new CollectFloatProcedure(floatFunction, target));
return target;
}
public MutableIntCollection collectInt(IntFunction intFunction)
{
return this.collectInt(intFunction, new IntArrayList(this.size()));
}
public R collectInt(IntFunction intFunction, R target)
{
this.forEach(new CollectIntProcedure(intFunction, target));
return target;
}
public MutableLongCollection collectLong(LongFunction longFunction)
{
return this.collectLong(longFunction, new LongArrayList(this.size()));
}
public R collectLong(LongFunction longFunction, R target)
{
this.forEach(new CollectLongProcedure(longFunction, target));
return target;
}
public MutableShortCollection collectShort(ShortFunction shortFunction)
{
return this.collectShort(shortFunction, new ShortArrayList(this.size()));
}
public R collectShort(ShortFunction shortFunction, R target)
{
this.forEach(new CollectShortProcedure(shortFunction, target));
return target;
}
public MutableCollection collectWith(Function2 function, P parameter)
{
return this.collect(Functions.bind(function, parameter));
}
public > R collectWith(Function2 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 > R collect(Function 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 MutableBag collectIf(Predicate predicate, Function function)
{
return this.collectIf(predicate, function, HashBag.newBag());
}
public > R collectIf(Predicate predicate, Function 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 MutableList flatCollect(Function> function)
{
return this.flatCollect(function, FastList.newList());
}
public > R flatCollect(Function> 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 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 V detectWith(Predicate2 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 predicate, Function0 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
V detectWithIfNone(Predicate2 predicate, P parameter, Function0 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 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
int countWith(Predicate2 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 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 anySatisfyWith(Predicate2 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 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 allSatisfyWith(Predicate2 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 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 noneSatisfyWith(Predicate2 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 injectInto(IV injectedValue, Function2 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 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 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 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 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;
}
/**
* @deprecated in 7.0. Use {@link OrderedIterable#zip(Iterable)} instead.
*/
@Deprecated
public MutableBag> zip(Iterable that)
{
return this.zip(that, HashBag.>newBag());
}
public >> R zip(Iterable that, R target)
{
return IterableIterate.zip(this, that, target);
}
/**
* @deprecated in 7.0. Use {@link OrderedIterable#zipWithIndex()} instead.
*/
@Deprecated
public MutableSet> zipWithIndex()
{
return this.zipWithIndex(UnifiedSet.>newSet());
}
public >> R zipWithIndex(R target)
{
return IterableIterate.zipWithIndex(this, target);
}
public RichIterable> chunk(int size)
{
if (size <= 0)
{
throw new IllegalArgumentException("Size for groups must be positive but was: " + size);
}
Iterator iterator = this.iterator();
MutableList> result = Lists.mutable.of();
while (iterator.hasNext())
{
MutableList batch = FastList.newList();
for (int i = 0; i < size && iterator.hasNext(); i++)
{
batch.add(iterator.next());
}
result.add(batch);
}
return result;
}
public MutableMap aggregateInPlaceBy(Function groupBy, Function0 zeroValueFactory, Procedure2 mutatingAggregator)
{
MutableMap map = UnifiedMap.newMap();
this.forEach(new MutatingAggregationProcedure(map, groupBy, zeroValueFactory, mutatingAggregator));
return map;
}
public MutableMap aggregateBy(Function groupBy, Function0 zeroValueFactory, Function2 nonMutatingAggregator)
{
MutableMap map = UnifiedMap.newMap();
this.forEach(new NonMutatingAggregationProcedure(map, groupBy, zeroValueFactory, nonMutatingAggregator));
return map;
}
public MutableBagMultimap groupBy(Function function)
{
return this.groupBy(function, HashBagMultimap.newMultimap());
}
public > R groupBy(Function 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 MutableBagMultimap groupByEach(Function> function)
{
return this.groupByEach(function, HashBagMultimap.newMultimap());
}
public > R groupByEach(
Function> function,
R target)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
Iterable iterable = function.valueOf(this.sentinelValues.zeroValue);
for (VV key : iterable)
{
target.put(key, this.sentinelValues.zeroValue);
}
}
if (this.sentinelValues.containsOneKey)
{
Iterable iterable = function.valueOf(this.sentinelValues.oneValue);
for (VV key : iterable)
{
target.put(key, this.sentinelValues.oneValue);
}
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
Iterable iterable = function.valueOf(this.values[i]);
for (VV key : iterable)
{
target.put(key, this.values[i]);
}
}
}
return target;
}
public MutableMap groupByUniqueKey(Function function)
{
return this.groupByUniqueKey(function, UnifiedMap.newMap());
}
public > R groupByUniqueKey(
Function function,
R target)
{
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
if (target.put(function.valueOf(this.sentinelValues.zeroValue), this.sentinelValues.zeroValue) != null)
{
throw new IllegalStateException("Key " + function.valueOf(this.sentinelValues.zeroValue) + " already exists in map!");
}
}
if (this.sentinelValues.containsOneKey)
{
if (target.put(function.valueOf(this.sentinelValues.oneValue), this.sentinelValues.oneValue) != null)
{
throw new IllegalStateException("Key " + function.valueOf(this.sentinelValues.oneValue) + " already exists in map!");
}
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
if (target.put(function.valueOf(this.values[i]), this.values[i]) != null)
{
throw new IllegalStateException("Key " + function.valueOf(this.values[i]) + " already exists in map!");
}
}
}
return target;
}
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 toList()
{
MutableList list = Lists.mutable.of();
this.forEachWith(Procedures2.addToCollection(), list);
return list;
}
public MutableList toSortedList()
{
return this.toList().sortThis();
}
public MutableList toSortedList(Comparator comparator)
{
return this.toList().sortThis(comparator);
}
public > MutableList toSortedListBy(Function function)
{
return this.toList().sortThis(Comparators.byFunction(function));
}
public MutableSet toSet()
{
MutableSet set = UnifiedSet.newSet();
this.forEachWith(Procedures2.addToCollection(), set);
return set;
}
public MutableSortedSet toSortedSet()
{
MutableSortedSet set = TreeSortedSet.newSet();
this.forEachWith(Procedures2.addToCollection(), set);
return set;
}
public MutableSortedSet toSortedSet(Comparator comparator)
{
MutableSortedSet set = TreeSortedSet.newSet(comparator);
this.forEachWith(Procedures2.addToCollection(), set);
return set;
}
public > MutableSortedSet toSortedSetBy(Function function)
{
MutableSortedSet set = TreeSortedSet.newSet(Comparators.byFunction(function));
this.forEachWith(Procedures2.addToCollection(), set);
return set;
}
public MutableBag toBag()
{
MutableBag bag = Bags.mutable.of();
this.forEachWith(Procedures2.addToCollection(), bag);
return bag;
}
public MutableSortedBag toSortedBag()
{
MutableSortedBag sortedBag = TreeBag.newBag();
this.forEachWith(Procedures2.addToCollection(), sortedBag);
return sortedBag;
}
public MutableSortedBag toSortedBag(Comparator comparator)
{
MutableSortedBag sortedBag = TreeBag.newBag(comparator);
this.forEachWith(Procedures2.addToCollection(), sortedBag);
return sortedBag;
}
public > MutableSortedBag toSortedBagBy(Function function)
{
return this.toSortedBag(Comparators.byFunction(function));
}
public MutableMap toMap(Function keyFunction, Function valueFunction)
{
UnifiedMap map = UnifiedMap.newMap();
this.forEach(new MapCollectProcedure(map, keyFunction, valueFunction));
return map;
}
public MutableSortedMap toSortedMap(Function keyFunction, Function valueFunction)
{
return this.toSortedMap(Comparators.naturalOrder(), keyFunction, valueFunction);
}
public MutableSortedMap toSortedMap(Comparator comparator, Function keyFunction, Function valueFunction)
{
TreeSortedMap sortedMap = TreeSortedMap.newMap(comparator);
this.forEach(new MapCollectProcedure(sortedMap, keyFunction, valueFunction));
return sortedMap;
}
public LazyIterable asLazy()
{
return LazyIterate.adapt(this);
}
public V min(Comparator 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 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 > V maxBy(Function 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 > V minBy(Function 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 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 function)
{
double sum = 0.0;
double compensation = 0.0;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
double adjustedValue = function.floatValueOf(this.sentinelValues.zeroValue) - compensation;
double nextSum = sum + adjustedValue;
compensation = nextSum - sum - adjustedValue;
sum = nextSum;
}
if (this.sentinelValues.containsOneKey)
{
double adjustedValue = function.floatValueOf(this.sentinelValues.oneValue) - compensation;
double nextSum = sum + adjustedValue;
compensation = nextSum - sum - adjustedValue;
sum = nextSum;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
double adjustedValue = function.floatValueOf(this.values[i]) - compensation;
double nextSum = sum + adjustedValue;
compensation = nextSum - sum - adjustedValue;
sum = nextSum;
}
}
return sum;
}
public long sumOfLong(LongFunction 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 function)
{
double sum = 0.0;
double compensation = 0.0;
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
double adjustedValue = function.doubleValueOf(this.sentinelValues.zeroValue) - compensation;
double nextSum = sum + adjustedValue;
compensation = nextSum - sum - adjustedValue;
sum = nextSum;
}
if (this.sentinelValues.containsOneKey)
{
double adjustedValue = function.doubleValueOf(this.sentinelValues.oneValue) - compensation;
double nextSum = sum + adjustedValue;
compensation = nextSum - sum - adjustedValue;
sum = nextSum;
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
double adjustedValue = function.doubleValueOf(this.values[i]) - compensation;
double nextSum = sum + adjustedValue;
compensation = nextSum - sum - adjustedValue;
sum = nextSum;
}
}
return sum;
}
public ObjectLongMap sumByInt(Function groupBy, IntFunction function)
{
ObjectLongHashMap result = ObjectLongHashMap.newMap();
return this.injectInto(result, PrimitiveFunctions.sumByIntFunction(groupBy, function));
}
public ObjectDoubleMap sumByFloat(Function groupBy, FloatFunction function)
{
ObjectDoubleHashMap result = ObjectDoubleHashMap.newMap();
return this.injectInto(result, PrimitiveFunctions.sumByFloatFunction(groupBy, function));
}
public ObjectLongMap sumByLong(Function groupBy, LongFunction function)
{
ObjectLongHashMap result = ObjectLongHashMap.newMap();
return this.injectInto(result, PrimitiveFunctions.sumByLongFunction(groupBy, function));
}
public ObjectDoubleMap sumByDouble(Function groupBy, DoubleFunction function)
{
ObjectDoubleHashMap result = ObjectDoubleHashMap.newMap();
return this.injectInto(result, PrimitiveFunctions.sumByDoubleFunction(groupBy, function));
}
public void clear()
{
this.sentinelValues = null;
this.occupiedWithData = 0;
this.occupiedWithSentinels = 0;
if (this.copyKeysOnWrite)
{
this.keys = new double[this.keys.length];
this.copyKeysOnWrite = false;
}
Arrays.fill(this.keys, EMPTY_KEY);
Arrays.fill(this.values, null);
}
public V put(double key, V value)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues();
}
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 oldValue = this.sentinelValues.oneValue;
this.sentinelValues.containsOneKey = true;
this.sentinelValues.oneValue = value;
return oldValue;
}
int index = this.probe(key);
if (Double.compare(this.keys[index], key) == 0)
{
// key already present in map
V oldValue = this.values[index];
this.values[index] = value;
return oldValue;
}
this.addKeyValueAtIndex(key, value, index);
return null;
}
public void putAll(DoubleObjectMap map)
{
map.forEachKeyValue(new DoubleObjectProcedure()
{
public void value(double key, V value)
{
DoubleObjectHashMap.this.put(key, value);
}
});
}
public boolean containsKey(double key)
{
if (isEmptyKey(key))
{
return this.sentinelValues != null && this.sentinelValues.containsZeroKey;
}
if (isRemovedKey(key))
{
return this.sentinelValues != null && this.sentinelValues.containsOneKey;
}
return Double.compare(this.keys[this.probe(key)], key) == 0;
}
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(double key)
{
return this.getIfAbsent(key, Functions0.nullValue());
}
public V getIfAbsent(double key, Function0 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 (Double.compare(this.keys[this.probe(key)], key) == 0)
{
return this.values[index];
}
return ifAbsent.value();
}
public V getIfAbsentPut(double key, V value)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues();
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();
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 (Double.compare(this.keys[index], key) == 0)
{
return this.values[index];
}
this.addKeyValueAtIndex(key, value, index);
return value;
}
public V getIfAbsentPut(double key, Function0 function)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
V value = function.value();
this.sentinelValues = new SentinelValues();
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();
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 (Double.compare(this.keys[index], key) == 0)
{
return this.values[index];
}
V value = function.value();
this.addKeyValueAtIndex(key, value, index);
return value;
}
public V getIfAbsentPutWith(double key, Function function, P parameter)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
V value = function.valueOf(parameter);
this.sentinelValues = new SentinelValues();
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();
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 (Double.compare(this.keys[index], key) == 0)
{
return this.values[index];
}
V value = function.valueOf(parameter);
this.addKeyValueAtIndex(key, value, index);
return value;
}
public V getIfAbsentPutWithKey(double key, DoubleToObjectFunction function)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
V value = function.valueOf(key);
this.sentinelValues = new SentinelValues();
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();
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 (Double.compare(this.keys[index], key) == 0)
{
return this.values[index];
}
V value = function.valueOf(key);
this.addKeyValueAtIndex(key, value, index);
return value;
}
public V updateValue(double key, Function0 factory, Function function)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues();
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();
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 (Double.compare(this.keys[index], key) == 0)
{
this.values[index] = function.valueOf(this.values[index]);
return this.values[index];
}
V value = function.valueOf(factory.value());
this.addKeyValueAtIndex(key, value, index);
return value;
}
public V updateValueWith(double key, Function0 factory, Function2 function, P parameter)
{
if (isEmptyKey(key))
{
if (this.sentinelValues == null)
{
this.sentinelValues = new SentinelValues();
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();
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 (Double.compare(this.keys[index], key) == 0)
{
this.values[index] = function.value(this.values[index], parameter);
return this.values[index];
}
V value = function.value(factory.value(), parameter);
this.addKeyValueAtIndex(key, value, index);
return value;
}
public V removeKey(double 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 (Double.compare(this.keys[index], key) == 0)
{
V oldValue = this.values[index];
this.removeKeyAtIndex(index);
return oldValue;
}
return null;
}
public V remove(double key)
{
return this.removeKey(key);
}
public DoubleObjectHashMap withKeyValue(double key, V value)
{
this.put(key, value);
return this;
}
public MutableDoubleObjectMap withoutKey(double key)
{
this.removeKey(key);
return this;
}
public MutableDoubleObjectMap withoutAllKeys(DoubleIterable keys)
{
DoubleIterator iterator = keys.doubleIterator();
while (iterator.hasNext())
{
double item = iterator.next();
this.removeKey(item);
}
return this;
}
public DoubleObjectHashMap withKeysValues(double key1, V value1, double key2, V value2)
{
this.put(key1, value1);
this.put(key2, value2);
return this;
}
public DoubleObjectHashMap withKeysValues(double key1, V value1, double key2, V value2, double key3, V value3)
{
this.put(key1, value1);
this.put(key2, value2);
this.put(key3, value3);
return this;
}
public DoubleObjectHashMap withKeysValues(double key1, V value1, double key2, V value2, double key3, V value3, double key4, V value4)
{
this.put(key1, value1);
this.put(key2, value2);
this.put(key3, value3);
this.put(key4, value4);
return this;
}
public MutableDoubleObjectMap asUnmodifiable()
{
return new UnmodifiableDoubleObjectMap(this);
}
public MutableDoubleObjectMap asSynchronized()
{
return new SynchronizedDoubleObjectMap(this);
}
public ImmutableDoubleObjectMap toImmutable()
{
return DoubleObjectMaps.immutable.withAll(this);
}
public void writeExternal(ObjectOutput out) throws IOException
{
out.writeInt(this.size());
if (this.sentinelValues != null)
{
if (this.sentinelValues.containsZeroKey)
{
out.writeDouble(EMPTY_KEY);
out.writeObject(this.sentinelValues.zeroValue);
}
if (this.sentinelValues.containsOneKey)
{
out.writeDouble(REMOVED_KEY);
out.writeObject(this.sentinelValues.oneValue);
}
}
for (int i = 0; i < this.keys.length; i++)
{
if (isNonSentinel(this.keys[i]))
{
out.writeDouble(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.readDouble(), (V) in.readObject());
}
}
private void addKeyValueAtIndex(double key, V value, int index)
{
if (Double.compare(this.keys[index], REMOVED_KEY) == 0)
{
this.occupiedWithSentinels--;
}
if (this.copyKeysOnWrite)
{
this.copyKeys();
}
this.keys[index] = key;
this.values[index] = value;
++this.occupiedWithData;
if (this.occupiedWithData > this.maxOccupiedWithData())
{
this.rehashAndGrow();
}
}
private void removeKeyAtIndex(int index)
{
if (this.copyKeysOnWrite)
{
this.copyKeys();
}
this.keys[index] = REMOVED_KEY;
this.values[index] = null;
this.occupiedWithData--;
this.occupiedWithSentinels++;
if (this.occupiedWithSentinels > this.maxOccupiedWithSentinels())
{
this.rehash();
}
}
private void copyKeys()
{
double[] copy = new double[this.keys.length];
System.arraycopy(this.keys, 0, copy, 0, this.keys.length);
this.keys = copy;
this.copyKeysOnWrite = false;
}
private static final class SentinelValues
{
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
{
private int count;
private int position;
private double currentKey;
private boolean isCurrentKeySet;
private boolean handledZeroKey;
private boolean handledOneKey;
public boolean hasNext()
{
return this.count != DoubleObjectHashMap.this.size();
}
public V next()
{
if (!this.hasNext())
{
throw new NoSuchElementException();
}
this.count++;
if (!this.handledZeroKey)
{
this.handledZeroKey = true;
if (DoubleObjectHashMap.this.containsKey(EMPTY_KEY))
{
this.currentKey = DoubleObjectHashMap.EMPTY_KEY;
this.isCurrentKeySet = true;
return DoubleObjectHashMap.this.sentinelValues.zeroValue;
}
}
if (!this.handledOneKey)
{
this.handledOneKey = true;
if (DoubleObjectHashMap.this.containsKey(REMOVED_KEY))
{
this.currentKey = DoubleObjectHashMap.REMOVED_KEY;
this.isCurrentKeySet = true;
return DoubleObjectHashMap.this.sentinelValues.oneValue;
}
}
double[] keys = DoubleObjectHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
this.currentKey = DoubleObjectHashMap.this.keys[this.position];
this.isCurrentKeySet = true;
V result = DoubleObjectHashMap.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;
DoubleObjectHashMap.this.removeKeyAtIndex(index);
}
else
{
DoubleObjectHashMap.this.removeKey(this.currentKey);
}
}
}
public MutableDoubleSet 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;
double[] 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]);
}
}
this.copyKeysOnWrite = false;
}
// exposed for testing
int probe(double element)
{
int index = this.mask((int) element);
double keyAtIndex = this.keys[index];
if (Double.compare(keyAtIndex, element) == 0 || Double.compare(keyAtIndex, EMPTY_KEY) == 0)
{
return index;
}
int removedIndex = Double.compare(keyAtIndex, REMOVED_KEY) == 0 ? index : -1;
for (int i = 1; i < INITIAL_LINEAR_PROBE; i++)
{
int nextIndex = (index + i) & (this.keys.length - 1);
keyAtIndex = this.keys[nextIndex];
if (Double.compare(keyAtIndex, element) == 0)
{
return nextIndex;
}
if (Double.compare(keyAtIndex, EMPTY_KEY) == 0)
{
return removedIndex == -1 ? nextIndex : removedIndex;
}
if (Double.compare(keyAtIndex, REMOVED_KEY) == 0 && removedIndex == -1)
{
removedIndex = nextIndex;
}
}
return this.probeTwo(element, removedIndex);
}
int probeTwo(double element, int removedIndex)
{
int index = this.spreadTwoAndMask(element);
for (int i = 0; i < INITIAL_LINEAR_PROBE; i++)
{
int nextIndex = (index + i) & (this.keys.length - 1);
double keyAtIndex = this.keys[nextIndex];
if (Double.compare(keyAtIndex, element) == 0)
{
return nextIndex;
}
if (Double.compare(keyAtIndex, EMPTY_KEY) == 0)
{
return removedIndex == -1 ? nextIndex : removedIndex;
}
if (Double.compare(keyAtIndex, REMOVED_KEY) == 0 && removedIndex == -1)
{
removedIndex = nextIndex;
}
}
return this.probeThree(element, removedIndex);
}
int probeThree(double element, int removedIndex)
{
int nextIndex = (int) SpreadFunctions.doubleSpreadOne(element);
int spreadTwo = (int) Long.reverse(SpreadFunctions.doubleSpreadTwo(element)) | 1;
while(true)
{
nextIndex = this.mask(nextIndex + spreadTwo);
double keyAtIndex = this.keys[nextIndex];
if (Double.compare(keyAtIndex, element) == 0)
{
return nextIndex;
}
if (Double.compare(keyAtIndex, EMPTY_KEY) == 0)
{
return removedIndex == -1 ? nextIndex : removedIndex;
}
if (Double.compare(keyAtIndex, REMOVED_KEY) == 0 && removedIndex == -1)
{
removedIndex = nextIndex;
}
}
}
// exposed for testing
int spreadAndMask(double element)
{
long code = SpreadFunctions.doubleSpreadOne(element);
return this.mask((int) code);
}
int spreadTwoAndMask(double element)
{
long code = SpreadFunctions.doubleSpreadTwo(element);
return this.mask((int) code);
}
private int mask(int spread)
{
return spread & (this.keys.length - 1);
}
private void allocateTable(int sizeToAllocate)
{
this.keys = new double[sizeToAllocate];
this.values = (V[]) new Object[sizeToAllocate];
}
private static boolean isEmptyKey(double key)
{
return Double.compare(key, EMPTY_KEY) == 0;
}
private static boolean isRemovedKey(double key)
{
return Double.compare(key, REMOVED_KEY) == 0;
}
private static boolean isNonSentinel(double 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 MutableDoubleSet
{
public MutableDoubleIterator doubleIterator()
{
return new KeysSetIterator();
}
public void forEach(DoubleProcedure procedure)
{
this.each(procedure);
}
/**
* @since 7.0.
*/
public void each(DoubleProcedure procedure)
{
DoubleObjectHashMap.this.forEachKey(procedure);
}
public int count(DoublePredicate predicate)
{
int count = 0;
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
count++;
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
count++;
}
}
for (double key : DoubleObjectHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
count++;
}
}
return count;
}
public boolean anySatisfy(DoublePredicate predicate)
{
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
return true;
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
return true;
}
}
for (double key : DoubleObjectHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
return true;
}
}
return false;
}
public T injectInto(T injectedValue, ObjectDoubleToObjectFunction function)
{
T result = injectedValue;
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey)
{
result = function.valueOf(result, EMPTY_KEY);
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey)
{
result = function.valueOf(result, REMOVED_KEY);
}
}
for (double key : DoubleObjectHashMap.this.keys)
{
if (isNonSentinel(key))
{
result = function.valueOf(result, key);
}
}
return result;
}
public boolean allSatisfy(DoublePredicate predicate)
{
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey && !predicate.accept(EMPTY_KEY))
{
return false;
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey && !predicate.accept(REMOVED_KEY))
{
return false;
}
}
for (double key : DoubleObjectHashMap.this.keys)
{
if (isNonSentinel(key) && !predicate.accept(key))
{
return false;
}
}
return true;
}
public boolean noneSatisfy(DoublePredicate predicate)
{
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
return false;
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
return false;
}
}
for (double key : DoubleObjectHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
return false;
}
}
return true;
}
public boolean add(double element)
{
throw new UnsupportedOperationException("Cannot call add() on " + this.getClass().getSimpleName());
}
public boolean addAll(double... source)
{
throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
}
public boolean addAll(DoubleIterable source)
{
throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
}
public boolean remove(double key)
{
int oldSize = DoubleObjectHashMap.this.size();
DoubleObjectHashMap.this.removeKey(key);
return oldSize != DoubleObjectHashMap.this.size();
}
public boolean removeAll(DoubleIterable source)
{
int oldSize = DoubleObjectHashMap.this.size();
DoubleIterator iterator = source.doubleIterator();
while (iterator.hasNext())
{
DoubleObjectHashMap.this.removeKey(iterator.next());
}
return oldSize != DoubleObjectHashMap.this.size();
}
public boolean removeAll(double... source)
{
int oldSize = DoubleObjectHashMap.this.size();
for (double item : source)
{
DoubleObjectHashMap.this.removeKey(item);
}
return oldSize != DoubleObjectHashMap.this.size();
}
public boolean retainAll(DoubleIterable source)
{
int oldSize = this.size();
final DoubleSet sourceSet = source instanceof DoubleSet ? (DoubleSet) source : source.toSet();
DoubleObjectHashMap retained = DoubleObjectHashMap.this.select(new DoubleObjectPredicate()
{
public boolean accept(double key, V value)
{
return sourceSet.contains(key);
}
});
if (retained.size() != oldSize)
{
DoubleObjectHashMap.this.keys = retained.keys;
DoubleObjectHashMap.this.values = retained.values;
DoubleObjectHashMap.this.sentinelValues = retained.sentinelValues;
DoubleObjectHashMap.this.occupiedWithData = retained.occupiedWithData;
DoubleObjectHashMap.this.occupiedWithSentinels = retained.occupiedWithSentinels;
return true;
}
return false;
}
public boolean retainAll(double... source)
{
return this.retainAll(DoubleHashSet.newSetWith(source));
}
public void clear()
{
DoubleObjectHashMap.this.clear();
}
public MutableDoubleSet select(DoublePredicate predicate)
{
MutableDoubleSet result = new DoubleHashSet();
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
result.add(EMPTY_KEY);
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
result.add(REMOVED_KEY);
}
}
for (double key : DoubleObjectHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
result.add(key);
}
}
return result;
}
public MutableDoubleSet reject(DoublePredicate predicate)
{
MutableDoubleSet result = new DoubleHashSet();
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey && !predicate.accept(EMPTY_KEY))
{
result.add(EMPTY_KEY);
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey && !predicate.accept(REMOVED_KEY))
{
result.add(REMOVED_KEY);
}
}
for (double key : DoubleObjectHashMap.this.keys)
{
if (isNonSentinel(key) && !predicate.accept(key))
{
result.add(key);
}
}
return result;
}
public MutableDoubleSet with(double element)
{
throw new UnsupportedOperationException("Cannot call with() on " + this.getClass().getSimpleName());
}
public MutableDoubleSet without(double element)
{
throw new UnsupportedOperationException("Cannot call without() on " + this.getClass().getSimpleName());
}
public MutableDoubleSet withAll(DoubleIterable elements)
{
throw new UnsupportedOperationException("Cannot call withAll() on " + this.getClass().getSimpleName());
}
public MutableDoubleSet withoutAll(DoubleIterable elements)
{
throw new UnsupportedOperationException("Cannot call withoutAll() on " + this.getClass().getSimpleName());
}
public double detectIfNone(DoublePredicate predicate, double ifNone)
{
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
{
return EMPTY_KEY;
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
{
return REMOVED_KEY;
}
}
for (double key : DoubleObjectHashMap.this.keys)
{
if (isNonSentinel(key) && predicate.accept(key))
{
return key;
}
}
return ifNone;
}
public MutableSet collect(DoubleToObjectFunction function)
{
MutableSet result = Sets.mutable.with();
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey)
{
result.add(function.valueOf(EMPTY_KEY));
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey)
{
result.add(function.valueOf(REMOVED_KEY));
}
}
for (double key : DoubleObjectHashMap.this.keys)
{
if (isNonSentinel(key))
{
result.add(function.valueOf(key));
}
}
return result;
}
public MutableDoubleSet asUnmodifiable()
{
return UnmodifiableDoubleSet.of(this);
}
public MutableDoubleSet asSynchronized()
{
return SynchronizedDoubleSet.of(this);
}
public double sum()
{
double result = 0.0;
double compensation = 0.0;
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey)
{
double adjustedValue = EMPTY_KEY - compensation;
double nextSum = result + adjustedValue;
compensation = nextSum - result - adjustedValue;
result = nextSum;
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey)
{
double adjustedValue = REMOVED_KEY - compensation;
double nextSum = result + adjustedValue;
compensation = nextSum - result - adjustedValue;
result = nextSum;
}
}
for (double key : DoubleObjectHashMap.this.keys)
{
if (isNonSentinel(key))
{
double adjustedValue = key - compensation;
double nextSum = result + adjustedValue;
compensation = nextSum - result - adjustedValue;
result = nextSum;
}
}
return result;
}
public double max()
{
if (DoubleObjectHashMap.this.isEmpty())
{
throw new NoSuchElementException();
}
double max = 0.0;
boolean isMaxSet = false;
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey)
{
max = EMPTY_KEY;
isMaxSet = true;
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey)
{
max = REMOVED_KEY;
isMaxSet = true;
}
}
for (int i = 0; i < DoubleObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(DoubleObjectHashMap.this.keys[i]) && (!isMaxSet || Double.compare(max, DoubleObjectHashMap.this.keys[i]) < 0))
{
max = DoubleObjectHashMap.this.keys[i];
isMaxSet = true;
}
}
return max;
}
public double maxIfEmpty(double defaultValue)
{
if (DoubleObjectHashMap.this.isEmpty())
{
return defaultValue;
}
return this.max();
}
public double min()
{
if (DoubleObjectHashMap.this.isEmpty())
{
throw new NoSuchElementException();
}
double min = 0.0;
boolean isMinSet = false;
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey)
{
min = EMPTY_KEY;
isMinSet = true;
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey && !isMinSet)
{
min = REMOVED_KEY;
isMinSet = true;
}
}
for (int i = 0; i < DoubleObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(DoubleObjectHashMap.this.keys[i]) && (!isMinSet || Double.compare(DoubleObjectHashMap.this.keys[i], min) < 0))
{
min = DoubleObjectHashMap.this.keys[i];
isMinSet = true;
}
}
return min;
}
public double minIfEmpty(double defaultValue)
{
if (DoubleObjectHashMap.this.isEmpty())
{
return defaultValue;
}
return this.min();
}
public double average()
{
if (DoubleObjectHashMap.this.isEmpty())
{
throw new ArithmeticException();
}
return (double) this.sum() / (double) this.size();
}
public double median()
{
if (DoubleObjectHashMap.this.isEmpty())
{
throw new ArithmeticException();
}
double[] sortedArray = this.toSortedArray();
int middleIndex = sortedArray.length >> 1;
if (sortedArray.length > 1 && (sortedArray.length & 1) == 0)
{
double first = sortedArray[middleIndex];
double second = sortedArray[middleIndex - 1];
return ((double) first + (double) second) / 2.0;
}
return (double) sortedArray[middleIndex];
}
public double[] toSortedArray()
{
double[] array = this.toArray();
Arrays.sort(array);
return array;
}
public MutableDoubleList toSortedList()
{
return DoubleArrayList.newList(this).sortThis();
}
public double[] toArray()
{
int size = DoubleObjectHashMap.this.size();
final double[] result = new double[size];
DoubleObjectHashMap.this.forEachKey(new DoubleProcedure()
{
private int index;
public void value(double each)
{
result[this.index] = each;
this.index++;
}
});
return result;
}
public boolean contains(double value)
{
return DoubleObjectHashMap.this.containsKey(value);
}
public boolean containsAll(double... source)
{
for (double item : source)
{
if (!DoubleObjectHashMap.this.containsKey(item))
{
return false;
}
}
return true;
}
public boolean containsAll(DoubleIterable source)
{
DoubleIterator iterator = source.doubleIterator();
while (iterator.hasNext())
{
if (!DoubleObjectHashMap.this.containsKey(iterator.next()))
{
return false;
}
}
return true;
}
public MutableDoubleList toList()
{
return DoubleArrayList.newList(this);
}
public MutableDoubleSet toSet()
{
return DoubleHashSet.newSet(this);
}
public MutableDoubleBag toBag()
{
return DoubleHashBag.newBag(this);
}
public LazyDoubleIterable asLazy()
{
return new LazyDoubleIterableAdapter(this);
}
public DoubleSet freeze()
{
DoubleObjectHashMap.this.copyKeysOnWrite = true;
boolean containsZeroKey = false;
boolean containsOneKey = false;
if (DoubleObjectHashMap.this.sentinelValues != null)
{
containsZeroKey = DoubleObjectHashMap.this.sentinelValues.containsZeroKey;
containsOneKey = DoubleObjectHashMap.this.sentinelValues.containsOneKey;
}
return new ImmutableDoubleMapKeySet(DoubleObjectHashMap.this.keys, DoubleObjectHashMap.this.occupiedWithData, containsZeroKey, containsOneKey);
}
public ImmutableDoubleSet toImmutable()
{
return DoubleSets.immutable.withAll(this);
}
public int size()
{
return DoubleObjectHashMap.this.size();
}
public boolean isEmpty()
{
return DoubleObjectHashMap.this.isEmpty();
}
public boolean notEmpty()
{
return DoubleObjectHashMap.this.notEmpty();
}
@Override
public boolean equals(Object obj)
{
if (this == obj)
{
return true;
}
if (!(obj instanceof DoubleSet))
{
return false;
}
DoubleSet other = (DoubleSet) obj;
return this.size() == other.size() && this.containsAll(other.toArray());
}
@Override
public int hashCode()
{
int result = 0;
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey)
{
result += (int) (Double.doubleToLongBits(EMPTY_KEY) ^ Double.doubleToLongBits(EMPTY_KEY) >>> 32);
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey)
{
result += (int) (Double.doubleToLongBits(REMOVED_KEY) ^ Double.doubleToLongBits(REMOVED_KEY) >>> 32);
}
}
for (int i = 0; i < DoubleObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(DoubleObjectHashMap.this.keys[i]))
{
result += (int) (Double.doubleToLongBits(DoubleObjectHashMap.this.keys[i]) ^ Double.doubleToLongBits(DoubleObjectHashMap.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 (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey)
{
appendable.append(String.valueOf(EMPTY_KEY));
first = false;
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey)
{
if (!first)
{
appendable.append(separator);
}
appendable.append(String.valueOf(REMOVED_KEY));
first = false;
}
}
for (double key : DoubleObjectHashMap.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 MutableDoubleIterator
{
private int count;
private int position;
private double lastKey;
private boolean handledZeroKey;
private boolean handledOneKey;
private boolean canRemove;
public boolean hasNext()
{
return this.count != DoubleObjectHashMap.this.size();
}
public double next()
{
if (!this.hasNext())
{
throw new NoSuchElementException();
}
this.count++;
this.canRemove = true;
if (!this.handledZeroKey)
{
this.handledZeroKey = true;
if (DoubleObjectHashMap.this.containsKey(EMPTY_KEY))
{
this.lastKey = EMPTY_KEY;
return this.lastKey;
}
}
if (!this.handledOneKey)
{
this.handledOneKey = true;
if (DoubleObjectHashMap.this.containsKey(REMOVED_KEY))
{
this.lastKey = REMOVED_KEY;
return this.lastKey;
}
}
double[] keys = DoubleObjectHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
this.lastKey = keys[this.position];
this.position++;
return this.lastKey;
}
public void remove()
{
if (!this.canRemove)
{
throw new IllegalStateException();
}
DoubleObjectHashMap.this.removeKey(this.lastKey);
this.count--;
this.canRemove = false;
}
}
public Collection values()
{
return new ValuesCollection();
}
public LazyDoubleIterable keysView()
{
return new KeysView();
}
public RichIterable> keyValuesView()
{
return new KeyValuesView();
}
protected class ValuesCollection implements Collection
{
public boolean add(V v)
{
throw new UnsupportedOperationException("Cannot call add() on " + this.getClass().getSimpleName());
}
public boolean addAll(Collection collection)
{
throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
}
public void clear()
{
DoubleObjectHashMap.this.clear();
}
public boolean contains(Object o)
{
return DoubleObjectHashMap.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 DoubleObjectHashMap.this.isEmpty();
}
public Iterator iterator()
{
return DoubleObjectHashMap.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 it = this.iterator(); it.hasNext(); )
{
if (it.next() == null)
{
it.remove();
return true;
}
}
}
else
{
for (Iterator 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 e = this.iterator();
while (e.hasNext())
{
if (!collection.contains(e.next()))
{
e.remove();
modified = true;
}
}
return modified;
}
public int size()
{
return DoubleObjectHashMap.this.size();
}
public Object[] toArray()
{
return DoubleObjectHashMap.this.toArray();
}
public T[] toArray(T[] result)
{
return DoubleObjectHashMap.this.toArray(result);
}
}
private class KeysView extends AbstractLazyDoubleIterable
{
public DoubleIterator doubleIterator()
{
return new UnmodifiableDoubleIterator(new KeysSetIterator());
}
public void forEach(DoubleProcedure procedure)
{
this.each(procedure);
}
public void each(DoubleProcedure procedure)
{
DoubleObjectHashMap.this.forEachKey(procedure);
}
}
private class KeyValuesView extends AbstractLazyIterable>
{
public void each(Procedure> procedure)
{
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey)
{
procedure.value(PrimitiveTuples.pair(EMPTY_KEY, DoubleObjectHashMap.this.sentinelValues.zeroValue));
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey)
{
procedure.value(PrimitiveTuples.pair(REMOVED_KEY, DoubleObjectHashMap.this.sentinelValues.oneValue));
}
}
for (int i = 0; i < DoubleObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(DoubleObjectHashMap.this.keys[i]))
{
procedure.value(PrimitiveTuples.pair(DoubleObjectHashMap.this.keys[i], DoubleObjectHashMap.this.values[i]));
}
}
}
public void forEachWithIndex(ObjectIntProcedure> objectIntProcedure)
{
int index = 0;
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey)
{
objectIntProcedure.value(PrimitiveTuples.pair(EMPTY_KEY, DoubleObjectHashMap.this.sentinelValues.zeroValue), index);
index++;
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey)
{
objectIntProcedure.value(PrimitiveTuples.pair(REMOVED_KEY, DoubleObjectHashMap.this.sentinelValues.oneValue), index);
index++;
}
}
for (int i = 0; i < DoubleObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(DoubleObjectHashMap.this.keys[i]))
{
objectIntProcedure.value(PrimitiveTuples.pair(DoubleObjectHashMap.this.keys[i], DoubleObjectHashMap.this.values[i]), index);
index++;
}
}
}
public void forEachWith(Procedure2, ? super P> procedure, P parameter)
{
if (DoubleObjectHashMap.this.sentinelValues != null)
{
if (DoubleObjectHashMap.this.sentinelValues.containsZeroKey)
{
procedure.value(PrimitiveTuples.pair(EMPTY_KEY, DoubleObjectHashMap.this.sentinelValues.zeroValue), parameter);
}
if (DoubleObjectHashMap.this.sentinelValues.containsOneKey)
{
procedure.value(PrimitiveTuples.pair(REMOVED_KEY, DoubleObjectHashMap.this.sentinelValues.oneValue), parameter);
}
}
for (int i = 0; i < DoubleObjectHashMap.this.keys.length; i++)
{
if (isNonSentinel(DoubleObjectHashMap.this.keys[i]))
{
procedure.value(PrimitiveTuples.pair(DoubleObjectHashMap.this.keys[i], DoubleObjectHashMap.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 DoubleObjectPair next()
{
if (!this.hasNext())
{
throw new NoSuchElementException("next() called, but the iterator is exhausted");
}
this.count++;
if (!this.handledZero)
{
this.handledZero = true;
if (DoubleObjectHashMap.this.containsKey(EMPTY_KEY))
{
return PrimitiveTuples.pair(EMPTY_KEY, DoubleObjectHashMap.this.sentinelValues.zeroValue);
}
}
if (!this.handledOne)
{
this.handledOne = true;
if (DoubleObjectHashMap.this.containsKey(REMOVED_KEY))
{
return PrimitiveTuples.pair(REMOVED_KEY, DoubleObjectHashMap.this.sentinelValues.oneValue);
}
}
double[] keys = DoubleObjectHashMap.this.keys;
while (!isNonSentinel(keys[this.position]))
{
this.position++;
}
DoubleObjectPair result = PrimitiveTuples.pair(keys[this.position], DoubleObjectHashMap.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 != DoubleObjectHashMap.this.size();
}
}
}
}
