Source Code of com.gs.collections.impl.map.mutable.primitive.ByteDoubleHashMap$ValuesCollection

/*
 * Copyright 2014 Goldman Sachs.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */


package com.gs.collections.impl.map.mutable.primitive;


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


import com.gs.collections.api.ByteIterable;
import com.gs.collections.api.LazyByteIterable;
import com.gs.collections.api.LazyDoubleIterable;
import com.gs.collections.api.DoubleIterable;
import com.gs.collections.api.LazyIterable;
import com.gs.collections.api.RichIterable;
import com.gs.collections.api.bag.primitive.MutableByteBag;
import com.gs.collections.api.bag.primitive.MutableDoubleBag;
import com.gs.collections.api.block.function.primitive.ByteToObjectFunction;
import com.gs.collections.api.block.function.primitive.ByteToDoubleFunction;
import com.gs.collections.api.block.function.primitive.DoubleFunction;
import com.gs.collections.api.block.function.primitive.DoubleFunction0;
import com.gs.collections.api.block.function.primitive.DoubleToDoubleFunction;
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.ObjectByteToObjectFunction;
import com.gs.collections.api.block.predicate.primitive.ByteDoublePredicate;
import com.gs.collections.api.block.predicate.primitive.BytePredicate;
import com.gs.collections.api.block.predicate.primitive.DoublePredicate;
import com.gs.collections.api.block.procedure.Procedure;
import com.gs.collections.api.block.procedure.Procedure2;
import com.gs.collections.api.block.procedure.primitive.ByteProcedure;
import com.gs.collections.api.block.procedure.primitive.ByteDoubleProcedure;
import com.gs.collections.api.block.procedure.primitive.DoubleProcedure;
import com.gs.collections.api.block.procedure.primitive.ObjectIntProcedure;
import com.gs.collections.api.collection.MutableCollection;
import com.gs.collections.api.collection.primitive.ImmutableDoubleCollection;
import com.gs.collections.api.collection.primitive.MutableDoubleCollection;
import com.gs.collections.api.iterator.ByteIterator;
import com.gs.collections.api.iterator.DoubleIterator;
import com.gs.collections.api.list.primitive.MutableByteList;
import com.gs.collections.api.list.primitive.MutableDoubleList;
import com.gs.collections.api.map.primitive.ByteDoubleMap;
import com.gs.collections.api.map.primitive.ImmutableByteDoubleMap;
import com.gs.collections.api.map.primitive.MutableByteDoubleMap;
import com.gs.collections.api.set.MutableSet;
import com.gs.collections.api.set.primitive.ByteSet;
import com.gs.collections.api.set.primitive.DoubleSet;
import com.gs.collections.api.set.primitive.ImmutableByteSet;
import com.gs.collections.api.set.primitive.MutableByteSet;
import com.gs.collections.api.tuple.primitive.ByteDoublePair;
import com.gs.collections.api.set.primitive.MutableDoubleSet;
import com.gs.collections.impl.bag.mutable.primitive.ByteHashBag;
import com.gs.collections.impl.bag.mutable.primitive.DoubleHashBag;
import com.gs.collections.impl.block.factory.primitive.BytePredicates;
import com.gs.collections.impl.collection.mutable.primitive.SynchronizedDoubleCollection;
import com.gs.collections.impl.collection.mutable.primitive.UnmodifiableDoubleCollection;
import com.gs.collections.impl.factory.Sets;
import com.gs.collections.impl.factory.primitive.DoubleLists;
import com.gs.collections.impl.factory.primitive.ByteDoubleMaps;
import com.gs.collections.impl.factory.primitive.ByteSets;
import com.gs.collections.impl.lazy.AbstractLazyIterable;
import com.gs.collections.impl.lazy.primitive.AbstractLazyByteIterable;
import com.gs.collections.impl.lazy.primitive.LazyDoubleIterableAdapter;
import com.gs.collections.impl.lazy.primitive.LazyByteIterableAdapter;
import com.gs.collections.impl.list.mutable.FastList;
import com.gs.collections.impl.list.mutable.primitive.ByteArrayList;
import com.gs.collections.impl.list.mutable.primitive.DoubleArrayList;
import com.gs.collections.impl.set.mutable.primitive.ByteHashSet;
import com.gs.collections.impl.set.mutable.primitive.SynchronizedByteSet;
import com.gs.collections.impl.set.mutable.primitive.UnmodifiableByteSet;
import com.gs.collections.impl.set.mutable.primitive.DoubleHashSet;
import com.gs.collections.impl.tuple.primitive.PrimitiveTuples;


/**
 * This file was automatically generated from template file primitivePrimitiveHashMap.stg.
 *
 * @since 3.0.
 */
public class ByteDoubleHashMap implements MutableByteDoubleMap, Externalizable
{
    static final double EMPTY_VALUE = 0.0;
    private static final long serialVersionUID = 1L;
    private static final byte EMPTY_KEY = (byte) 0;
    private static final byte REMOVED_KEY = (byte) 1;


    private static final int OCCUPIED_DATA_RATIO = 2;
    private static final int OCCUPIED_SENTINEL_RATIO = 4;
    private static final int DEFAULT_INITIAL_CAPACITY = 8;


    private byte[] keys;
    private double[] values;


    private int occupiedWithData;
    private int occupiedWithSentinels;


    private SentinelValues sentinelValues;


    public ByteDoubleHashMap()
    {
        this.allocateTable(DEFAULT_INITIAL_CAPACITY << 1);
    }


    public ByteDoubleHashMap(int initialCapacity)
    {
        if (initialCapacity < 0)
        {
            throw new IllegalArgumentException("initial capacity cannot be less than 0");
        }
        int capacity = this.smallestPowerOfTwoGreaterThan(this.fastCeil(initialCapacity * OCCUPIED_DATA_RATIO));
        this.allocateTable(capacity);
    }


    private int smallestPowerOfTwoGreaterThan(int n)
    {
        return n > 1 ? Integer.highestOneBit(n - 1) << 1 : 1;
    }


    public ByteDoubleHashMap(ByteDoubleMap map)
    {
        this(Math.max(map.size(), DEFAULT_INITIAL_CAPACITY));
        this.putAll(map);
    }


    private int fastCeil(float v)
    {
        int possibleResult = (int) v;
        if (v - possibleResult > 0.0F)
        {
            possibleResult++;
        }
        return possibleResult;
    }


    public static ByteDoubleHashMap newWithKeysValues(byte key1, double value1)
    {
        return new ByteDoubleHashMap(1).withKeyValue(key1, value1);
    }


    public static ByteDoubleHashMap newWithKeysValues(byte key1, double value1, byte key2, double value2)
    {
        return new ByteDoubleHashMap(2).withKeysValues(key1, value1, key2, value2);
    }


    public static ByteDoubleHashMap newWithKeysValues(byte key1, double value1, byte key2, double value2, byte key3, double value3)
    {
        return new ByteDoubleHashMap(3).withKeysValues(key1, value1, key2, value2, key3, value3);
    }


    public static ByteDoubleHashMap newWithKeysValues(byte key1, double value1, byte key2, double value2, byte key3, double value3, byte key4, double value4)
    {
        return new ByteDoubleHashMap(4).withKeysValues(key1, value1, key2, value2, key3, value3, key4, value4);
    }


    @Override
    public boolean equals(Object obj)
    {
        if (this == obj)
        {
            return true;
        }


        if (!(obj instanceof ByteDoubleMap))
        {
            return false;
        }


        ByteDoubleMap other = (ByteDoubleMap) 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) || Double.compare(this.sentinelValues.zeroValue, other.getOrThrow(EMPTY_KEY)) != 0))
            {
                return false;
            }


            if (this.sentinelValues.containsOneKey && (!other.containsKey(REMOVED_KEY) || Double.compare(this.sentinelValues.oneValue, other.getOrThrow(REMOVED_KEY)) != 0))
            {
                return false;
            }
        }


        for (int i = 0; i < this.keys.length; i++)
        {
            byte key = this.keys[i];
            if (isNonSentinel(key) && (!other.containsKey(key) || Double.compare(this.values[i], other.getOrThrow(key)) != 0))
            {
                return false;
            }
        }
        return true;
    }


    @Override
    public int hashCode()
    {
        int result = 0;


        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey)
            {
                result += (int) EMPTY_KEY ^ (int) (Double.doubleToLongBits(this.sentinelValues.zeroValue) ^ Double.doubleToLongBits(this.sentinelValues.zeroValue) >>> 32);
            }
            if (this.sentinelValues.containsOneKey)
            {
                result += (int) REMOVED_KEY ^ (int) (Double.doubleToLongBits(this.sentinelValues.oneValue) ^ Double.doubleToLongBits(this.sentinelValues.oneValue) >>> 32);
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]))
            {
                result += (int) this.keys[i] ^ (int) (Double.doubleToLongBits(this.values[i]) ^ Double.doubleToLongBits(this.values[i]) >>> 32);
            }
        }


        return result;
    }


    @Override
    public String toString()
    {
        StringBuilder appendable = new StringBuilder();


        appendable.append("{");


        boolean first = true;


        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey)
            {
                appendable.append(String.valueOf(EMPTY_KEY)).append("=").append(String.valueOf(this.sentinelValues.zeroValue));
                first = false;
            }
            if (this.sentinelValues.containsOneKey)
            {
                if (!first)
                {
                    appendable.append(", ");
                }
                appendable.append(String.valueOf(REMOVED_KEY)).append("=").append(String.valueOf(this.sentinelValues.oneValue));
                first = false;
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            byte key = this.keys[i];
            if (isNonSentinel(key))
            {
                if (!first)
                {
                    appendable.append(", ");
                }
                appendable.append(String.valueOf(key)).append("=").append(String.valueOf(this.values[i]));
                first = false;
            }
        }
        appendable.append("}");


        return appendable.toString();
    }


    public int size()
    {
        return this.occupiedWithData + (this.sentinelValues == null ? 0 : this.sentinelValues.size());
    }


    public boolean isEmpty()
    {
        return this.occupiedWithData == 0 && (this.sentinelValues == null || this.sentinelValues.size() == 0);
    }


    public boolean notEmpty()
    {
        return this.occupiedWithData != 0 || (this.sentinelValues != null && this.sentinelValues.size() != 0);
    }


    public String makeString()
    {
        return this.makeString(", ");
    }


    public String makeString(String separator)
    {
        return this.makeString("", separator, "");
    }


    public String makeString(String start, String separator, String end)
    {
        Appendable stringBuilder = new StringBuilder();
        this.appendString(stringBuilder, start, separator, end);
        return stringBuilder.toString();
    }


    public void appendString(Appendable appendable)
    {
        this.appendString(appendable, ", ");
    }


    public void appendString(Appendable appendable, String separator)
    {
        this.appendString(appendable, "", separator, "");
    }


    public void appendString(Appendable appendable, String start, String separator, String end)
    {
        try
        {
            appendable.append(start);


            boolean first = true;


            if (this.sentinelValues != null)
            {
                if (this.sentinelValues.containsZeroKey)
                {
                    appendable.append(String.valueOf(this.sentinelValues.zeroValue));
                    first = false;
                }
                if (this.sentinelValues.containsOneKey)
                {
                    if (!first)
                    {
                        appendable.append(separator);
                    }
                    appendable.append(String.valueOf(this.sentinelValues.oneValue));
                    first = false;
                }
            }
            for (int i = 0; i < this.keys.length; i++)
            {
                byte key = this.keys[i];
                if (isNonSentinel(key))
                {
                    if (!first)
                    {
                        appendable.append(separator);
                    }
                    appendable.append(String.valueOf(this.values[i]));
                    first = false;
                }
            }
            appendable.append(end);
        }
        catch (IOException e)
        {
            throw new RuntimeException(e);
        }
    }


    public DoubleIterator doubleIterator()
    {
        return new InternalDoubleIterator();
    }


    public double[] toArray()
    {
        double[] array = new double[this.size()];
        int index = 0;


        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey)
            {
                array[index] = this.sentinelValues.zeroValue;
                index++;
            }
            if (this.sentinelValues.containsOneKey)
            {
                array[index] = this.sentinelValues.oneValue;
                index++;
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]))
            {
                array[index] = this.values[i];
                index++;
            }
        }


        return array;
    }


    public boolean contains(double value)
    {
        return this.containsValue(value);
    }


    public boolean containsAll(double... source)
    {
        for (double each : source)
        {
            if (!this.contains(each))
            {
                return false;
            }
        }
        return true;
    }


    public boolean containsAll(DoubleIterable source)
    {
        return source.allSatisfy(new DoublePredicate()
        {
            public boolean accept(double value)
            {
                return ByteDoubleHashMap.this.contains(value);
            }
        });
    }


    public void forEach(DoubleProcedure procedure)
    {
        this.forEachValue(procedure);
    }


    public MutableDoubleCollection select(DoublePredicate predicate)
    {
        DoubleArrayList result = new DoubleArrayList();


        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 MutableDoubleCollection reject(DoublePredicate predicate)
    {
        DoubleArrayList result = new DoubleArrayList();
        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 <V> MutableCollection<V> collect(DoubleToObjectFunction<? extends V> function)
    {
        FastList<V> target = FastList.newList(this.size());
        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey)
            {
                target.add(function.valueOf(this.sentinelValues.zeroValue));
            }
            if (this.sentinelValues.containsOneKey)
            {
                target.add(function.valueOf(this.sentinelValues.oneValue));
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]))
            {
                target.add(function.valueOf(this.values[i]));
            }
        }
        return target;
    }


    public double detectIfNone(DoublePredicate predicate, double value)
    {
        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue))
            {
                return this.sentinelValues.zeroValue;
            }
            if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue))
            {
                return this.sentinelValues.oneValue;
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i]))
            {
                return this.values[i];
            }
        }
        return value;
    }


    public int count(DoublePredicate predicate)
    {
        int count = 0;
        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue))
            {
                count++;
            }
            if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue))
            {
                count++;
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i]))
            {
                count++;
            }
        }
        return count;
    }


    public boolean anySatisfy(DoublePredicate predicate)
    {
        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue))
            {
                return true;
            }
            if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue))
            {
                return true;
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i]))
            {
                return true;
            }
        }
        return false;
    }


    public boolean allSatisfy(DoublePredicate predicate)
    {
        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey && !predicate.accept(this.sentinelValues.zeroValue))
            {
                return false;
            }
            if (this.sentinelValues.containsOneKey && !predicate.accept(this.sentinelValues.oneValue))
            {
                return false;
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]) && !predicate.accept(this.values[i]))
            {
                return false;
            }
        }
        return true;
    }


    public boolean noneSatisfy(DoublePredicate predicate)
    {
        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey && predicate.accept(this.sentinelValues.zeroValue))
            {
                return false;
            }
            if (this.sentinelValues.containsOneKey && predicate.accept(this.sentinelValues.oneValue))
            {
                return false;
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i]))
            {
                return false;
            }
        }
        return true;
    }


    public <V> V injectInto(V injectedValue, ObjectDoubleToObjectFunction<? super V, ? extends V> function)
    {
        V result = injectedValue;


        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey)
            {
                result = function.valueOf(result, this.sentinelValues.zeroValue);
            }
            if (this.sentinelValues.containsOneKey)
            {
                result = function.valueOf(result, this.sentinelValues.oneValue);
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]))
            {
                result = function.valueOf(result, this.values[i]);
            }
        }


        return result;
    }


    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 void clear()
    {
        this.sentinelValues = null;
        this.occupiedWithData = 0;
        this.occupiedWithSentinels = 0;
        Arrays.fill(this.keys, EMPTY_KEY);
        Arrays.fill(this.values, EMPTY_VALUE);
    }


    public void put(byte key, double value)
    {
        if (isEmptyKey(key))
        {
            if (this.sentinelValues == null)
            {
                this.sentinelValues = new SentinelValues();
            }
            this.addEmptyKeyValue(value);
            return;
        }


        if (isRemovedKey(key))
        {
            if (this.sentinelValues == null)
            {
                this.sentinelValues = new SentinelValues();
            }
            this.addRemovedKeyValue(value);
            return;
        }


        int index = this.probe(key);


        if (this.keys[index] == key)
        {
            // key already present in map
            this.values[index] = value;
            return;
        }


        this.addKeyValueAtIndex(key, value, index);
    }


    public void putAll(ByteDoubleMap map)
    {
        map.forEachKeyValue(new ByteDoubleProcedure()
        {
            public void value(byte key, double value)
            {
                ByteDoubleHashMap.this.put(key, value);
            }
        });
    }


    public void removeKey(byte key)
    {
        if (isEmptyKey(key))
        {
            if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey)
            {
                return;
            }
            this.removeEmptyKey();
            return;
        }
        if (isRemovedKey(key))
        {
            if (this.sentinelValues == null || !this.sentinelValues.containsOneKey)
            {
                return;
            }
            this.removeRemovedKey();
            return;
        }
        int index = this.probe(key);
        if (this.keys[index] == key)
        {
            this.keys[index] = REMOVED_KEY;
            this.values[index] = EMPTY_VALUE;
            this.occupiedWithData--;
            this.occupiedWithSentinels++;
            if (this.occupiedWithSentinels > this.maxOccupiedWithSentinels())
            {
                this.rehash();
            }
        }
    }


    public void remove(byte key)
    {
        this.removeKey(key);
    }


    public double removeKeyIfAbsent(byte key, double value)
    {
        if (isEmptyKey(key))
        {
            if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey)
            {
                return value;
            }
            double oldValue = this.sentinelValues.zeroValue;
            this.removeEmptyKey();
            return oldValue;
        }
        if (isRemovedKey(key))
        {
            if (this.sentinelValues == null || !this.sentinelValues.containsOneKey)
            {
                return value;
            }
            double oldValue = this.sentinelValues.oneValue;
            this.removeRemovedKey();
            return oldValue;
        }
        int index = this.probe(key);
        if (this.keys[index] == key)
        {
            this.keys[index] = REMOVED_KEY;
            double oldValue = this.values[index];
            this.values[index] = EMPTY_VALUE;
            this.occupiedWithData--;
            this.occupiedWithSentinels++;
            if (this.occupiedWithSentinels > this.maxOccupiedWithSentinels())
            {
                this.rehash();
            }


            return oldValue;
        }
        return value;
    }


    public double getIfAbsentPut(byte key, double value)
    {
        if (isEmptyKey(key))
        {
            if (this.sentinelValues == null)
            {
                this.sentinelValues = new SentinelValues();
                this.addEmptyKeyValue(value);
                return value;
            }
            if (this.sentinelValues.containsZeroKey)
            {
                return this.sentinelValues.zeroValue;
            }
            this.addEmptyKeyValue(value);
            return value;
        }
        if (isRemovedKey(key))
        {
            if (this.sentinelValues == null)
            {
                this.sentinelValues = new SentinelValues();
                this.addRemovedKeyValue(value);
                return value;
            }
            if (this.sentinelValues.containsOneKey)
            {
                return this.sentinelValues.oneValue;
            }
            this.addRemovedKeyValue(value);
            return value;
        }
        int index = this.probe(key);
        if (this.keys[index] == key)
        {
            return this.values[index];
        }
        this.addKeyValueAtIndex(key, value, index);
        return value;
    }


    public double getIfAbsentPut(byte key, DoubleFunction0 function)
    {
        if (isEmptyKey(key))
        {
            if (this.sentinelValues == null)
            {
                double value = function.value();
                this.sentinelValues = new SentinelValues();
                this.addEmptyKeyValue(value);
                return value;
            }
            if (this.sentinelValues.containsZeroKey)
            {
                return this.sentinelValues.zeroValue;
            }
            double value = function.value();
            this.addEmptyKeyValue(value);
            return value;
        }
        if (isRemovedKey(key))
        {
            if (this.sentinelValues == null)
            {
                double value = function.value();
                this.sentinelValues = new SentinelValues();
                this.addRemovedKeyValue(value);
                return value;
            }
            if (this.sentinelValues.containsOneKey)
            {
                return this.sentinelValues.oneValue;
            }
            double value = function.value();
            this.addRemovedKeyValue(value);
            return value;
        }
        int index = this.probe(key);
        if (this.keys[index] == key)
        {
            return this.values[index];
        }
        double value = function.value();
        this.addKeyValueAtIndex(key, value, index);
        return value;
    }


    public <P> double getIfAbsentPutWith(byte key, DoubleFunction<? super P> function, P parameter)
    {
        if (isEmptyKey(key))
        {
            if (this.sentinelValues == null)
            {
                double value = function.doubleValueOf(parameter);
                this.sentinelValues = new SentinelValues();
                this.addEmptyKeyValue(value);
                return value;
            }
            if (this.sentinelValues.containsZeroKey)
            {
                return this.sentinelValues.zeroValue;
            }
            double value = function.doubleValueOf(parameter);
            this.addEmptyKeyValue(value);
            return value;
        }
        if (isRemovedKey(key))
        {
            if (this.sentinelValues == null)
            {
                double value = function.doubleValueOf(parameter);
                this.sentinelValues = new SentinelValues();
                this.addRemovedKeyValue(value);
                return value;
            }
            if (this.sentinelValues.containsOneKey)
            {
                return this.sentinelValues.oneValue;
            }
            double value = function.doubleValueOf(parameter);
            this.addRemovedKeyValue(value);
            return value;
        }
        int index = this.probe(key);
        if (this.keys[index] == key)
        {
            return this.values[index];
        }
        double value = function.doubleValueOf(parameter);
        this.addKeyValueAtIndex(key, value, index);
        return value;
    }


    public double getIfAbsentPutWithKey(byte key, ByteToDoubleFunction function)
    {
        if (isEmptyKey(key))
        {
            if (this.sentinelValues == null)
            {
                double value = function.valueOf(key);
                this.sentinelValues = new SentinelValues();
                this.addEmptyKeyValue(value);
                return value;
            }
            if (this.sentinelValues.containsZeroKey)
            {
                return this.sentinelValues.zeroValue;
            }
            double value = function.valueOf(key);
            this.addEmptyKeyValue(value);
            return value;
        }
        if (isRemovedKey(key))
        {
            if (this.sentinelValues == null)
            {
                double value = function.valueOf(key);
                this.sentinelValues = new SentinelValues();
                this.addRemovedKeyValue(value);
                return value;
            }
            if (this.sentinelValues.containsOneKey)
            {
                return this.sentinelValues.oneValue;
            }
            double value = function.valueOf(key);
            this.addRemovedKeyValue(value);
            return value;
        }
        int index = this.probe(key);
        if (this.keys[index] == key)
        {
            return this.values[index];
        }
        double value = function.valueOf(key);
        this.addKeyValueAtIndex(key, value, index);
        return value;
    }


    public double addToValue(byte key, double toBeAdded)
    {
        if (isEmptyKey(key))
        {
            if (this.sentinelValues == null)
            {
                this.sentinelValues = new SentinelValues();
                this.addEmptyKeyValue(toBeAdded);
            }
            else if (this.sentinelValues.containsZeroKey)
            {
                this.sentinelValues.zeroValue += toBeAdded;
            }
            else
            {
                this.addEmptyKeyValue(toBeAdded);
            }
            return this.sentinelValues.zeroValue;
        }
        if (isRemovedKey(key))
        {
            if (this.sentinelValues == null)
            {
                this.sentinelValues = new SentinelValues();
                this.addRemovedKeyValue(toBeAdded);
            }
            else if (this.sentinelValues.containsOneKey)
            {
                this.sentinelValues.oneValue += toBeAdded;
            }
            else
            {
                this.addRemovedKeyValue(toBeAdded);
            }
            return this.sentinelValues.oneValue;
        }
        int index = this.probe(key);
        if (this.keys[index] == key)
        {
            this.values[index] += toBeAdded;
            return this.values[index];
        }
        this.addKeyValueAtIndex(key, toBeAdded, index);
        return this.values[index];
    }


    private void addKeyValueAtIndex(byte key, double value, int index)
    {
        if (this.keys[index] == REMOVED_KEY)
        {
            this.occupiedWithSentinels--;
        }
        this.keys[index] = key;
        this.values[index] = value;
        this.occupiedWithData++;
        if (this.occupiedWithData > this.maxOccupiedWithData())
        {
            this.rehashAndGrow();
        }
    }


    private void addEmptyKeyValue(double value)
    {
        this.sentinelValues.containsZeroKey = true;
        this.sentinelValues.zeroValue = value;
    }


    private void removeEmptyKey()
    {
        if (this.sentinelValues.containsOneKey)
        {
            this.sentinelValues.containsZeroKey = false;
            this.sentinelValues.zeroValue = EMPTY_VALUE;
        }
        else
        {
            this.sentinelValues = null;
        }
    }


    private void addRemovedKeyValue(double value)
    {
        this.sentinelValues.containsOneKey = true;
        this.sentinelValues.oneValue = value;
    }


    private void removeRemovedKey()
    {
        if (this.sentinelValues.containsZeroKey)
        {
            this.sentinelValues.containsOneKey = false;
            this.sentinelValues.oneValue = EMPTY_VALUE;
        }
        else
        {
            this.sentinelValues = null;
        }
    }


    public double updateValue(byte key, double initialValueIfAbsent, DoubleToDoubleFunction function)
    {
        if (isEmptyKey(key))
        {
            if (this.sentinelValues == null)
            {
                this.sentinelValues = new SentinelValues();
                this.addEmptyKeyValue(function.valueOf(initialValueIfAbsent));
            }
            else if (this.sentinelValues.containsZeroKey)
            {
                this.sentinelValues.zeroValue = function.valueOf(this.sentinelValues.zeroValue);
            }
            else
            {
                this.addEmptyKeyValue(function.valueOf(initialValueIfAbsent));
            }
            return this.sentinelValues.zeroValue;
        }
        if (isRemovedKey(key))
        {
            if (this.sentinelValues == null)
            {
                this.sentinelValues = new SentinelValues();
                this.addRemovedKeyValue(function.valueOf(initialValueIfAbsent));
            }
            else if (this.sentinelValues.containsOneKey)
            {
                this.sentinelValues.oneValue = function.valueOf(this.sentinelValues.oneValue);
            }
            else
            {
                this.addRemovedKeyValue(function.valueOf(initialValueIfAbsent));
            }
            return this.sentinelValues.oneValue;
        }
        int index = this.probe(key);
        if (this.keys[index] == key)
        {
            this.values[index] = function.valueOf(this.values[index]);
            return this.values[index];
        }
        double value = function.valueOf(initialValueIfAbsent);
        this.addKeyValueAtIndex(key, value, index);
        return value;
    }


    public ByteDoubleHashMap withKeyValue(byte key1, double value1)
    {
        this.put(key1, value1);
        return this;
    }


    public ByteDoubleHashMap withKeysValues(byte key1, double value1, byte key2, double value2)
    {
        this.put(key1, value1);
        this.put(key2, value2);
        return this;
    }


    public ByteDoubleHashMap withKeysValues(byte key1, double value1, byte key2, double value2, byte key3, double value3)
    {
        this.put(key1, value1);
        this.put(key2, value2);
        this.put(key3, value3);
        return this;
    }


    public ByteDoubleHashMap withKeysValues(byte key1, double value1, byte key2, double value2, byte key3, double value3, byte key4, double value4)
    {
        this.put(key1, value1);
        this.put(key2, value2);
        this.put(key3, value3);
        this.put(key4, value4);
        return this;
    }


    public ByteDoubleHashMap withoutKey(byte key)
    {
        this.removeKey(key);
        return this;
    }


    public ByteDoubleHashMap withoutAllKeys(ByteIterable keys)
    {
        keys.forEach(new ByteProcedure()
        {
            public void value(byte key)
            {
                ByteDoubleHashMap.this.removeKey(key);
            }
        });
        return this;
    }


    public MutableByteDoubleMap asUnmodifiable()
    {
        return new UnmodifiableByteDoubleMap(this);
    }


    public MutableByteDoubleMap asSynchronized()
    {
        return new SynchronizedByteDoubleMap(this);
    }


    public ImmutableByteDoubleMap toImmutable()
    {
        return ByteDoubleMaps.immutable.ofAll(this);
    }


    public double get(byte key)
    {
        return this.getIfAbsent(key, EMPTY_VALUE);
    }


    public double getIfAbsent(byte key, double ifAbsent)
    {
        if (isEmptyKey(key))
        {
            if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey)
            {
                return ifAbsent;
            }
            return this.sentinelValues.zeroValue;
        }
        if (isRemovedKey(key))
        {
            if (this.sentinelValues == null || !this.sentinelValues.containsOneKey)
            {
                return ifAbsent;
            }
            return this.sentinelValues.oneValue;
        }
        int index = this.probe(key);
        if (this.keys[index] == key)
        {
            return this.values[index];
        }
        return ifAbsent;
    }


    public double getOrThrow(byte key)
    {
        if (isEmptyKey(key))
        {
            if (this.sentinelValues == null || !this.sentinelValues.containsZeroKey)
            {
                throw new IllegalStateException("Key " + key + " not present.");
            }
            return this.sentinelValues.zeroValue;
        }
        if (isRemovedKey(key))
        {
            if (this.sentinelValues == null || !this.sentinelValues.containsOneKey)
            {
                throw new IllegalStateException("Key " + key + " not present.");
            }
            return this.sentinelValues.oneValue;
        }
        int index = this.probe(key);
        if (isNonSentinel(this.keys[index]))
        {
            return this.values[index];
        }
        throw new IllegalStateException("Key " + key + " not present.");
    }


    public boolean containsKey(byte key)
    {
        if (isEmptyKey(key))
        {
            return this.sentinelValues != null && this.sentinelValues.containsZeroKey;
        }
        if (isRemovedKey(key))
        {
            return this.sentinelValues != null && this.sentinelValues.containsOneKey;
        }
        return this.keys[this.probe(key)] == key;
    }


    public boolean containsValue(double value)
    {
        if (this.sentinelValues != null && this.sentinelValues.containsValue(value))
        {
            return true;
        }
        for (int i = 0; i < this.values.length; i++)
        {
            if (isNonSentinel(this.keys[i]) && Double.compare(this.values[i], value) == 0)
            {
                return true;
            }
        }
        return false;
    }


    public void forEachValue(DoubleProcedure procedure)
    {
        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey)
            {
                procedure.value(this.sentinelValues.zeroValue);
            }
            if (this.sentinelValues.containsOneKey)
            {
                procedure.value(this.sentinelValues.oneValue);
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]))
            {
                procedure.value(this.values[i]);
            }
        }
    }


    public void forEachKey(ByteProcedure procedure)
    {
        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey)
            {
                procedure.value(EMPTY_KEY);
            }
            if (this.sentinelValues.containsOneKey)
            {
                procedure.value(REMOVED_KEY);
            }
        }
        for (byte key : this.keys)
        {
            if (isNonSentinel(key))
            {
                procedure.value(key);
            }
        }
    }


    public void forEachKeyValue(ByteDoubleProcedure procedure)
    {
        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey)
            {
                procedure.value(EMPTY_KEY, this.sentinelValues.zeroValue);
            }
            if (this.sentinelValues.containsOneKey)
            {
                procedure.value(REMOVED_KEY, this.sentinelValues.oneValue);
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]))
            {
                procedure.value(this.keys[i], this.values[i]);
            }
        }
    }


    public LazyByteIterable keysView()
    {
        return new KeysView();
    }


    public RichIterable<ByteDoublePair> keyValuesView()
    {
        return new KeyValuesView();
    }


    public ByteDoubleHashMap select(ByteDoublePredicate predicate)
    {
        ByteDoubleHashMap result = new ByteDoubleHashMap();


        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 ByteDoubleHashMap reject(ByteDoublePredicate predicate)
    {
        ByteDoubleHashMap result = new ByteDoubleHashMap();


        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 double sum()
    {
        double result = 0.0;


        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey)
            {
                result += this.sentinelValues.zeroValue;
            }
            if (this.sentinelValues.containsOneKey)
            {
                result += this.sentinelValues.oneValue;
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]))
            {
                result += this.values[i];
            }
        }


        return result;
    }


    public double max()
    {
        if (this.isEmpty())
        {
            throw new NoSuchElementException();
        }
        DoubleIterator iterator = this.doubleIterator();
        double max = iterator.next();
        while (iterator.hasNext())
        {
            double value = iterator.next();
            if (Double.compare(max, value) < 0)
            {
                max = value;
            }
        }
        return max;
    }


    public double maxIfEmpty(double defaultValue)
    {
        if (this.isEmpty())
        {
            return defaultValue;
        }
        return this.max();
    }


    public double min()
    {
        if (this.isEmpty())
        {
            throw new NoSuchElementException();
        }
        DoubleIterator iterator = this.doubleIterator();
        double min = iterator.next();
        while (iterator.hasNext())
        {
            double value = iterator.next();
            if (Double.compare(value, min) < 0)
            {
                min = value;
            }
        }
        return min;
    }


    public double minIfEmpty(double defaultValue)
    {
        if (this.isEmpty())
        {
            return defaultValue;
        }
        return this.min();
    }


    public double average()
    {
        if (this.isEmpty())
        {
            throw new ArithmeticException();
        }
        return this.sum() / (double) this.size();
    }


    public double median()
    {
        if (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 (first + second) / 2.0;
        }
        return sortedArray[middleIndex];
    }


    public double[] toSortedArray()
    {
        double[] array = this.toArray();
        Arrays.sort(array);
        return array;
    }


    public MutableDoubleList toSortedList()
    {
        return DoubleArrayList.newList(this).sortThis();
    }


    public void writeExternal(ObjectOutput out) throws IOException
    {
        out.writeInt(this.size());
        if (this.sentinelValues != null)
        {
            if (this.sentinelValues.containsZeroKey)
            {
                out.writeByte(EMPTY_KEY);
                out.writeDouble(this.sentinelValues.zeroValue);
            }
            if (this.sentinelValues.containsOneKey)
            {
                out.writeByte(REMOVED_KEY);
                out.writeDouble(this.sentinelValues.oneValue);
            }
        }
        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]))
            {
                out.writeByte(this.keys[i]);
                out.writeDouble(this.values[i]);
            }
        }
    }


    public void readExternal(ObjectInput in) throws IOException, ClassNotFoundException
    {
        int size = in.readInt();
        for (int i = 0; i < size; i++)
        {
            this.put(in.readByte(), in.readDouble());
        }
    }


    /**
     * Rehashes every element in the set into a new backing table of the smallest possible size and eliminating removed sentinels.
     */
    public void compact()
    {
        this.rehash(this.smallestPowerOfTwoGreaterThan(this.size()));
    }


    private void rehash()
    {
        this.rehash(this.keys.length);
    }


    private void rehashAndGrow()
    {
        this.rehash(this.keys.length << 1);
    }


    private void rehash(int newCapacity)
    {
        int oldLength = this.keys.length;
        byte[] old = this.keys;
        double[] oldValues = this.values;
        this.allocateTable(newCapacity);
        this.occupiedWithData = 0;
        this.occupiedWithSentinels = 0;


        for (int i = 0; i < oldLength; i++)
        {
            if (isNonSentinel(old[i]))
            {
                this.put(old[i], oldValues[i]);
            }
        }
    }


    // exposed for testing
    int probe(byte element)
    {
        int index = this.spread(element);
        byte keyAtIndex = this.keys[index];


        if (keyAtIndex == element || keyAtIndex == EMPTY_KEY)
        {
            return index;
        }


        int removedIndex = keyAtIndex == REMOVED_KEY ? index : -1;
        int nextIndex = index;
        int probe = 17;


        // loop until an empty slot is reached
        while (true)
        {
            // Probe algorithm: 17*n*(n+1)/2 where n = number of collisions
            nextIndex += probe;
            probe += 17;
            nextIndex &= this.keys.length - 1;


            if (this.keys[nextIndex] == element)
            {
                return nextIndex;
            }
            if (this.keys[nextIndex] == REMOVED_KEY)
            {
                if (removedIndex == -1)
                {
                    removedIndex = nextIndex;
                }
            }
            else if (this.keys[nextIndex] == EMPTY_KEY)
            {
                return removedIndex == -1 ? nextIndex : removedIndex;
            }
        }
    }


    // exposed for testing
    int spread(byte element)
    {
        // No spreading necessary for 8-bit types
        return element & (this.keys.length - 1);
    }


    private void allocateTable(int sizeToAllocate)
    {
        this.keys = new byte[sizeToAllocate];
        this.values = new double[sizeToAllocate];
    }


    private static boolean isEmptyKey(byte key)
    {
        return key == EMPTY_KEY;
    }


    private static boolean isRemovedKey(byte key)
    {
        return key == REMOVED_KEY;
    }


    private static boolean isNonSentinel(byte key)
    {
        return !isEmptyKey(key) && !isRemovedKey(key);
    }


    private int maxOccupiedWithData()
    {
        int capacity = this.keys.length;
        // need at least one free slot for open addressing
        return Math.min(capacity - 1, capacity / OCCUPIED_DATA_RATIO);
    }


    private int maxOccupiedWithSentinels()
    {
        return this.keys.length / OCCUPIED_SENTINEL_RATIO;
    }


    private static final class SentinelValues
    {
        private boolean containsZeroKey;
        private boolean containsOneKey;
        private double zeroValue;
        private double oneValue;


        public int size()
        {
            return (this.containsZeroKey ? 1 : 0) + (this.containsOneKey ? 1 : 0);
        }


        public boolean containsValue(double value)
        {
            boolean valueEqualsZeroValue = this.containsZeroKey && Double.compare(this.zeroValue, value) == 0;
            boolean valueEqualsOneValue = this.containsOneKey && Double.compare(this.oneValue, value) == 0;
            return valueEqualsZeroValue || valueEqualsOneValue;
        }
    }


    private class InternalDoubleIterator implements DoubleIterator
    {
        private int count;
        private int position;
        private boolean handledZero;
        private boolean handledOne;


        public boolean hasNext()
        {
            return this.count < ByteDoubleHashMap.this.size();
        }


        public double next()
        {
            if (!this.hasNext())
            {
                throw new NoSuchElementException("next() called, but the iterator is exhausted");
            }
            this.count++;


            if (!this.handledZero)
            {
                this.handledZero = true;
                if (ByteDoubleHashMap.this.containsKey(EMPTY_KEY))
                {
                    return ByteDoubleHashMap.this.get(EMPTY_KEY);
                }
            }
            if (!this.handledOne)
            {
                this.handledOne = true;
                if (ByteDoubleHashMap.this.containsKey(REMOVED_KEY))
                {
                    return ByteDoubleHashMap.this.get(REMOVED_KEY);
                }
            }


            byte[] keys = ByteDoubleHashMap.this.keys;
            while (!isNonSentinel(keys[this.position]))
            {
                this.position++;
            }
            double result = ByteDoubleHashMap.this.values[this.position];
            this.position++;
            return result;
        }
    }


    private class KeysView extends AbstractLazyByteIterable
    {
        public ByteIterator byteIterator()
        {
            return new KeySetIterator();
        }


        public void forEach(ByteProcedure procedure)
        {
            ByteDoubleHashMap.this.forEachKey(procedure);
        }
    }


    private class KeySetIterator implements ByteIterator
    {
        private int count;
        private int position;
        private boolean handledZero;
        private boolean handledOne;


        public boolean hasNext()
        {
            return this.count < ByteDoubleHashMap.this.size();
        }


        public byte next()
        {
            if (!this.hasNext())
            {
                throw new NoSuchElementException("next() called, but the iterator is exhausted");
            }
            this.count++;


            if (!this.handledZero)
            {
                this.handledZero = true;
                if (ByteDoubleHashMap.this.containsKey(EMPTY_KEY))
                {
                    return EMPTY_KEY;
                }
            }
            if (!this.handledOne)
            {
                this.handledOne = true;
                if (ByteDoubleHashMap.this.containsKey(REMOVED_KEY))
                {
                    return REMOVED_KEY;
                }
            }


            byte[] keys = ByteDoubleHashMap.this.keys;
            while (!isNonSentinel(keys[this.position]))
            {
                this.position++;
            }
            byte result = keys[this.position];
            this.position++;
            return result;
        }
    }


    public MutableByteSet keySet()
    {
        return new KeySet();
    }


    private class KeySet implements MutableByteSet
    {
        public ByteIterator byteIterator()
        {
            return new KeySetIterator();
        }


        public void forEach(ByteProcedure procedure)
        {
            ByteDoubleHashMap.this.forEachKey(procedure);
        }


        public int count(BytePredicate predicate)
        {
            int count = 0;
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
                {
                    count++;
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
                {
                    count++;
                }
            }
            for (byte key : ByteDoubleHashMap.this.keys)
            {
                if (isNonSentinel(key) && predicate.accept(key))
                {
                    count++;
                }
            }
            return count;
        }


        public boolean anySatisfy(BytePredicate predicate)
        {
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
                {
                    return true;
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
                {
                    return true;
                }
            }
            for (byte key : ByteDoubleHashMap.this.keys)
            {
                if (isNonSentinel(key) && predicate.accept(key))
                {
                    return true;
                }
            }
            return false;
        }


        public boolean allSatisfy(BytePredicate predicate)
        {
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey && !predicate.accept(EMPTY_KEY))
                {
                    return false;
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey && !predicate.accept(REMOVED_KEY))
                {
                    return false;
                }
            }
            for (byte key : ByteDoubleHashMap.this.keys)
            {
                if (isNonSentinel(key) && !predicate.accept(key))
                {
                    return false;
                }
            }
            return true;
        }


        public boolean noneSatisfy(BytePredicate predicate)
        {
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
                {
                    return false;
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
                {
                    return false;
                }
            }
            for (byte key : ByteDoubleHashMap.this.keys)
            {
                if (isNonSentinel(key) && predicate.accept(key))
                {
                    return false;
                }
            }
            return true;
        }


        public boolean add(byte element)
        {
            throw new UnsupportedOperationException("Cannot call add() on " + this.getClass().getSimpleName());
        }


        public boolean addAll(byte... source)
        {
            throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
        }


        public boolean addAll(ByteIterable source)
        {
            throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName());
        }


        public boolean remove(byte key)
        {
            int oldSize = ByteDoubleHashMap.this.size();
            ByteDoubleHashMap.this.removeKey(key);
            return oldSize != ByteDoubleHashMap.this.size();
        }


        public boolean removeAll(ByteIterable source)
        {
            int oldSize = ByteDoubleHashMap.this.size();
            ByteIterator iterator = source.byteIterator();
            while (iterator.hasNext())
            {
                ByteDoubleHashMap.this.removeKey(iterator.next());
            }
            return oldSize != ByteDoubleHashMap.this.size();
        }


        public boolean removeAll(byte... source)
        {
            int oldSize = ByteDoubleHashMap.this.size();
            for (byte item : source)
            {
                ByteDoubleHashMap.this.removeKey(item);
            }
            return oldSize != ByteDoubleHashMap.this.size();
        }


        public boolean retainAll(ByteIterable source)
        {
            int oldSize = this.size();
            final ByteSet sourceSet = source instanceof ByteSet ? (ByteSet) source : source.toSet();
            ByteDoubleHashMap retained = ByteDoubleHashMap.this.select(new ByteDoublePredicate()
            {
                public boolean accept(byte key, double value)
                {
                    return sourceSet.contains(key);
                }
            });
            if (retained.size() != oldSize)
            {
                ByteDoubleHashMap.this.keys = retained.keys;
                ByteDoubleHashMap.this.values = retained.values;
                ByteDoubleHashMap.this.sentinelValues = retained.sentinelValues;
                ByteDoubleHashMap.this.occupiedWithData = retained.occupiedWithData;
                ByteDoubleHashMap.this.occupiedWithSentinels = retained.occupiedWithSentinels;
                return true;
            }
            return false;
        }


        public boolean retainAll(byte... source)
        {
            return this.retainAll(ByteHashSet.newSetWith(source));
        }


        public void clear()
        {
            ByteDoubleHashMap.this.clear();
        }


        public MutableByteSet select(BytePredicate predicate)
        {
            MutableByteSet result = new ByteHashSet();
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
                {
                    result.add(EMPTY_KEY);
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
                {
                    result.add(REMOVED_KEY);
                }
            }
            for (byte key : ByteDoubleHashMap.this.keys)
            {
                if (isNonSentinel(key) && predicate.accept(key))
                {
                    result.add(key);
                }
            }
            return result;
        }


        public MutableByteSet reject(BytePredicate predicate)
        {
            MutableByteSet result = new ByteHashSet();
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey && !predicate.accept(EMPTY_KEY))
                {
                    result.add(EMPTY_KEY);
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey && !predicate.accept(REMOVED_KEY))
                {
                    result.add(REMOVED_KEY);
                }
            }
            for (byte key : ByteDoubleHashMap.this.keys)
            {
                if (isNonSentinel(key) && !predicate.accept(key))
                {
                    result.add(key);
                }
            }
            return result;
        }


        public MutableByteSet with(byte element)
        {
            throw new UnsupportedOperationException("Cannot call with() on " + this.getClass().getSimpleName());
        }


        public MutableByteSet without(byte element)
        {
            throw new UnsupportedOperationException("Cannot call without() on " + this.getClass().getSimpleName());
        }


        public MutableByteSet withAll(ByteIterable elements)
        {
            throw new UnsupportedOperationException("Cannot call withAll() on " + this.getClass().getSimpleName());
        }


        public MutableByteSet withoutAll(ByteIterable elements)
        {
            throw new UnsupportedOperationException("Cannot call withoutAll() on " + this.getClass().getSimpleName());
        }


        public byte detectIfNone(BytePredicate predicate, byte ifNone)
        {
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey && predicate.accept(EMPTY_KEY))
                {
                    return EMPTY_KEY;
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey && predicate.accept(REMOVED_KEY))
                {
                    return REMOVED_KEY;
                }
            }
            for (byte key : ByteDoubleHashMap.this.keys)
            {
                if (isNonSentinel(key) && predicate.accept(key))
                {
                    return key;
                }
            }
            return ifNone;
        }


        public <V> MutableSet<V> collect(ByteToObjectFunction<? extends V> function)
        {
            MutableSet<V> result = Sets.mutable.with();
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey)
                {
                    result.add(function.valueOf(EMPTY_KEY));
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey)
                {
                    result.add(function.valueOf(REMOVED_KEY));
                }
            }
            for (byte key : ByteDoubleHashMap.this.keys)
            {
                if (isNonSentinel(key))
                {
                    result.add(function.valueOf(key));
                }
            }
            return result;
        }


        public MutableByteSet asUnmodifiable()
        {
            return UnmodifiableByteSet.of(this);
        }


        public MutableByteSet asSynchronized()
        {
            return SynchronizedByteSet.of(this);
        }


        public long sum()
        {
            long sum = 0L;
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey)
                {
                    sum += EMPTY_KEY;
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey)
                {
                    sum += REMOVED_KEY;
                }
            }
            for (byte key : ByteDoubleHashMap.this.keys)
            {
                if (isNonSentinel(key))
                {
                    sum += key;
                }
            }
            return sum;
        }


        public byte max()
        {
            if (ByteDoubleHashMap.this.isEmpty())
            {
                throw new NoSuchElementException();
            }


            byte max = 0;
            boolean isMaxSet = false;


            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey)
                {
                    max = EMPTY_KEY;
                    isMaxSet = true;
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey && (!isMaxSet || max < REMOVED_KEY))
                {
                    max = REMOVED_KEY;
                    isMaxSet = true;
                }
            }
            for (int i = 0; i < ByteDoubleHashMap.this.keys.length; i++)
            {
                if (isNonSentinel(ByteDoubleHashMap.this.keys[i]) && (!isMaxSet || max < ByteDoubleHashMap.this.keys[i]))
                {
                    max = ByteDoubleHashMap.this.keys[i];
                    isMaxSet = true;
                }
            }
            return max;
        }


        public byte maxIfEmpty(byte defaultValue)
        {
            if (ByteDoubleHashMap.this.isEmpty())
            {
                return defaultValue;
            }


            return this.max();
        }


        public byte min()
        {
            if (ByteDoubleHashMap.this.isEmpty())
            {
                throw new NoSuchElementException();
            }


            byte min = 0;
            boolean isMinSet = false;


            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey)
                {
                    min = EMPTY_KEY;
                    isMinSet = true;
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey && (!isMinSet || REMOVED_KEY < min))
                {
                    min = REMOVED_KEY;
                    isMinSet = true;
                }
            }
            for (int i = 0; i < ByteDoubleHashMap.this.keys.length; i++)
            {
                if (isNonSentinel(ByteDoubleHashMap.this.keys[i]) && (!isMinSet || ByteDoubleHashMap.this.keys[i] < min))
                {
                    min = ByteDoubleHashMap.this.keys[i];
                    isMinSet = true;
                }
            }
            return min;
        }


        public byte minIfEmpty(byte defaultValue)
        {
            if (ByteDoubleHashMap.this.isEmpty())
            {
                return defaultValue;
            }


            return this.min();
        }


        public double average()
        {
            if (this.isEmpty())
            {
                throw new ArithmeticException();
            }
            return (double) this.sum() / (double) this.size();
        }


        public double median()
        {
            if (this.isEmpty())
            {
                throw new ArithmeticException();
            }
            byte[] sortedArray = this.toSortedArray();
            int middleIndex = sortedArray.length >> 1;
            if (sortedArray.length > 1 && (sortedArray.length & 1) == 0)
            {
                byte first = sortedArray[middleIndex];
                byte second = sortedArray[middleIndex - 1];
                return ((double) first + (double) second) / 2.0;
            }
            return (double) sortedArray[middleIndex];
        }


        public byte[] toSortedArray()
        {
            byte[] array = this.toArray();
            Arrays.sort(array);
            return array;
        }


        public MutableByteList toSortedList()
        {
            return ByteArrayList.newList(this).sortThis();
        }


        public byte[] toArray()
        {
            int size = ByteDoubleHashMap.this.size();
            final byte[] result = new byte[size];
            ByteDoubleHashMap.this.forEachKey(new ByteProcedure()
            {
                private int index;


                public void value(byte each)
                {
                    result[this.index] = each;
                    this.index++;
                }
            });
            return result;
        }


        public boolean contains(byte value)
        {
            return ByteDoubleHashMap.this.containsKey(value);
        }


        public boolean containsAll(byte... source)
        {
            for (byte item : source)
            {
                if (!ByteDoubleHashMap.this.containsKey(item))
                {
                    return false;
                }
            }
            return true;
        }


        public boolean containsAll(ByteIterable source)
        {
            ByteIterator iterator = source.byteIterator();
            while (iterator.hasNext())
            {
                if (!ByteDoubleHashMap.this.containsKey(iterator.next()))
                {
                    return false;
                }
            }
            return true;
        }


        public MutableByteList toList()
        {
            return ByteArrayList.newList(this);
        }


        public MutableByteSet toSet()
        {
            return ByteHashSet.newSet(this);
        }


        public MutableByteBag toBag()
        {
            return ByteHashBag.newBag(this);
        }


        public LazyByteIterable asLazy()
        {
            return new LazyByteIterableAdapter(this);
        }


        public <T> T injectInto(T injectedValue, ObjectByteToObjectFunction<? super T, ? extends T> function)
        {
            T result = injectedValue;
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey)
                {
                    result = function.valueOf(result, EMPTY_KEY);
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey)
                {
                    result = function.valueOf(result, REMOVED_KEY);
                }
            }
            for (int i = 0; i < ByteDoubleHashMap.this.keys.length; i++)
            {
                if (isNonSentinel(ByteDoubleHashMap.this.keys[i]))
                {
                    result = function.valueOf(result, ByteDoubleHashMap.this.keys[i]);
                }
            }
            return result;
        }


        public ByteSet freeze()
        {
            throw new UnsupportedOperationException(this.getClass().getSimpleName() + ".freeze() not implemented yet");
        }


        public ImmutableByteSet toImmutable()
        {
            return ByteSets.immutable.withAll(this);
        }


        public int size()
        {
            return ByteDoubleHashMap.this.size();
        }


        public boolean isEmpty()
        {
            return ByteDoubleHashMap.this.isEmpty();
        }


        public boolean notEmpty()
        {
            return ByteDoubleHashMap.this.notEmpty();
        }


        @Override
        public boolean equals(Object obj)
        {
            if (this == obj)
            {
                return true;
            }


            if (!(obj instanceof ByteSet))
            {
                return false;
            }


            ByteSet other = (ByteSet) obj;
            return this.size() == other.size() && this.containsAll(other.toArray());
        }


        @Override
        public int hashCode()
        {
            int result = 0;


            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey)
                {
                    result += (int) EMPTY_KEY;
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey)
                {
                    result += (int) REMOVED_KEY;
                }
            }
            for (int i = 0; i < ByteDoubleHashMap.this.keys.length; i++)
            {
                if (isNonSentinel(ByteDoubleHashMap.this.keys[i]))
                {
                    result += (int) ByteDoubleHashMap.this.keys[i];
                }
            }


            return result;
        }


        @Override
        public String toString()
        {
            return this.makeString("[", ", ", "]");
        }


        public String makeString()
        {
            return this.makeString(", ");
        }


        public String makeString(String separator)
        {
            return this.makeString("", separator, "");
        }


        public String makeString(String start, String separator, String end)
        {
            Appendable stringBuilder = new StringBuilder();
            this.appendString(stringBuilder, start, separator, end);
            return stringBuilder.toString();
        }


        public void appendString(Appendable appendable)
        {
            this.appendString(appendable, ", ");
        }


        public void appendString(Appendable appendable, String separator)
        {
            this.appendString(appendable, "", separator, "");
        }


        public void appendString(Appendable appendable, String start, String separator, String end)
        {
            try
            {
                appendable.append(start);
                boolean first = true;
                if (ByteDoubleHashMap.this.sentinelValues != null)
                {
                    if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey)
                    {
                        appendable.append(String.valueOf(EMPTY_KEY));
                        first = false;
                    }
                    if (ByteDoubleHashMap.this.sentinelValues.containsOneKey)
                    {
                        if (!first)
                        {
                            appendable.append(separator);
                        }
                        appendable.append(String.valueOf(REMOVED_KEY));
                        first = false;
                    }
                }
                for (byte key : ByteDoubleHashMap.this.keys)
                {
                    if (isNonSentinel(key))
                    {
                        if (!first)
                        {
                            appendable.append(separator);
                        }
                        appendable.append(String.valueOf(key));
                        first = false;
                    }
                }
                appendable.append(end);
            }
            catch (IOException e)
            {
                throw new RuntimeException(e);
            }
        }
    }


    public MutableDoubleCollection values()
    {
        return new ValuesCollection();
    }


    private class ValuesCollection implements MutableDoubleCollection
    {
        public void clear()
        {
            ByteDoubleHashMap.this.clear();
        }


        public MutableDoubleCollection select(DoublePredicate predicate)
        {
            return ByteDoubleHashMap.this.select(predicate);
        }


        public MutableDoubleCollection reject(DoublePredicate predicate)
        {
            return ByteDoubleHashMap.this.reject(predicate);
        }


        public double detectIfNone(DoublePredicate predicate, double ifNone)
        {
            return ByteDoubleHashMap.this.detectIfNone(predicate, ifNone);
        }


        public <V> MutableCollection<V> collect(DoubleToObjectFunction<? extends V> function)
        {
            return ByteDoubleHashMap.this.collect(function);
        }


        public <T> T injectInto(T injectedValue, ObjectDoubleToObjectFunction<? super T, ? extends T> function)
        {
            return ByteDoubleHashMap.this.injectInto(injectedValue, function);
        }


        public double sum()
        {
            return ByteDoubleHashMap.this.sum();
        }


        public double max()
        {
            return ByteDoubleHashMap.this.max();
        }


        public double maxIfEmpty(double defaultValue)
        {
            return ByteDoubleHashMap.this.maxIfEmpty(defaultValue);
        }


        public double min()
        {
            return ByteDoubleHashMap.this.min();
        }


        public double minIfEmpty(double defaultValue)
        {
            return ByteDoubleHashMap.this.minIfEmpty(defaultValue);
        }


        public double average()
        {
            return ByteDoubleHashMap.this.average();
        }


        public double median()
        {
            return ByteDoubleHashMap.this.median();
        }


        public double[] toSortedArray()
        {
            return ByteDoubleHashMap.this.toSortedArray();
        }


        public MutableDoubleList toSortedList()
        {
            return ByteDoubleHashMap.this.toSortedList();
        }


        public MutableDoubleCollection with(double element)
        {
            throw new UnsupportedOperationException("Cannot call with() on " + this.getClass().getSimpleName());
        }


        public MutableDoubleCollection without(double element)
        {
            throw new UnsupportedOperationException("Cannot call without() on " + this.getClass().getSimpleName());
        }


        public MutableDoubleCollection withAll(DoubleIterable elements)
        {
            throw new UnsupportedOperationException("Cannot call withAll() on " + this.getClass().getSimpleName());
        }


        public MutableDoubleCollection withoutAll(DoubleIterable elements)
        {
            throw new UnsupportedOperationException("Cannot call withoutAll() on " + this.getClass().getSimpleName());
        }


        public MutableDoubleCollection asUnmodifiable()
        {
            return UnmodifiableDoubleCollection.of(this);
        }


        public MutableDoubleCollection asSynchronized()
        {
            return SynchronizedDoubleCollection.of(this);
        }


        public ImmutableDoubleCollection toImmutable()
        {
            return DoubleLists.immutable.withAll(this);
        }


        public boolean contains(double value)
        {
            return ByteDoubleHashMap.this.containsValue(value);
        }


        public boolean containsAll(double... source)
        {
            return ByteDoubleHashMap.this.containsAll(source);
        }


        public boolean containsAll(DoubleIterable source)
        {
            return ByteDoubleHashMap.this.containsAll(source);
        }


        public MutableDoubleList toList()
        {
            return ByteDoubleHashMap.this.toList();
        }


        public MutableDoubleSet toSet()
        {
            return ByteDoubleHashMap.this.toSet();
        }


        public MutableDoubleBag toBag()
        {
            return ByteDoubleHashMap.this.toBag();
        }


        public LazyDoubleIterable asLazy()
        {
            return new LazyDoubleIterableAdapter(this);
        }


        public boolean isEmpty()
        {
            return ByteDoubleHashMap.this.isEmpty();
        }


        public boolean notEmpty()
        {
            return ByteDoubleHashMap.this.notEmpty();
        }


        public String makeString()
        {
            return this.makeString(", ");
        }


        public String makeString(String separator)
        {
            return this.makeString("", separator, "");
        }


        public String makeString(String start, String separator, String end)
        {
            Appendable stringBuilder = new StringBuilder();
            this.appendString(stringBuilder, start, separator, end);
            return stringBuilder.toString();
        }


        public void appendString(Appendable appendable)
        {
            this.appendString(appendable, ", ");
        }


        public void appendString(Appendable appendable, String separator)
        {
            this.appendString(appendable, "", separator, "");
        }


        public void appendString(Appendable appendable, String start, String separator, String end)
        {
            try
            {
                appendable.append(start);


                boolean first = true;


                if (ByteDoubleHashMap.this.sentinelValues != null)
                {
                    if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey)
                    {
                        appendable.append(String.valueOf(ByteDoubleHashMap.this.sentinelValues.zeroValue));
                        first = false;
                    }
                    if (ByteDoubleHashMap.this.sentinelValues.containsOneKey)
                    {
                        if (!first)
                        {
                            appendable.append(separator);
                        }
                        appendable.append(String.valueOf(ByteDoubleHashMap.this.sentinelValues.oneValue));
                        first = false;
                    }
                }
                for (int i = 0; i < ByteDoubleHashMap.this.keys.length; i++)
                {
                    byte key = ByteDoubleHashMap.this.keys[i];
                    if (isNonSentinel(key))
                    {
                        if (!first)
                        {
                            appendable.append(separator);
                        }
                        appendable.append(String.valueOf(ByteDoubleHashMap.this.values[i]));
                        first = false;
                    }
                }
                appendable.append(end);
            }
            catch (IOException e)
            {
                throw new RuntimeException(e);
            }
        }


        public DoubleIterator doubleIterator()
        {
            return ByteDoubleHashMap.this.doubleIterator();
        }


        public void forEach(DoubleProcedure procedure)
        {
            ByteDoubleHashMap.this.forEach(procedure);
        }


        public int count(DoublePredicate predicate)
        {
            return ByteDoubleHashMap.this.count(predicate);
        }


        public boolean anySatisfy(DoublePredicate predicate)
        {
            return ByteDoubleHashMap.this.anySatisfy(predicate);
        }


        public boolean allSatisfy(DoublePredicate predicate)
        {
            return ByteDoubleHashMap.this.allSatisfy(predicate);
        }


        public boolean noneSatisfy(DoublePredicate predicate)
        {
            return ByteDoubleHashMap.this.noneSatisfy(predicate);
        }


        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 item)
        {
            int oldSize = ByteDoubleHashMap.this.size();


            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey && Double.compare(item, ByteDoubleHashMap.this.sentinelValues.zeroValue) == 0)
                {
                    ByteDoubleHashMap.this.removeKey(EMPTY_KEY);
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey && Double.compare(item, ByteDoubleHashMap.this.sentinelValues.oneValue) == 0)
                {
                    ByteDoubleHashMap.this.removeKey(REMOVED_KEY);
                }
            }
            for (int i = 0; i < ByteDoubleHashMap.this.keys.length; i++)
            {
                if (isNonSentinel(ByteDoubleHashMap.this.keys[i]) && Double.compare(item, ByteDoubleHashMap.this.values[i]) == 0)
                {
                    ByteDoubleHashMap.this.removeKey(ByteDoubleHashMap.this.keys[i]);
                }
            }
            return oldSize != ByteDoubleHashMap.this.size();
        }


        public boolean removeAll(DoubleIterable source)
        {
            int oldSize = ByteDoubleHashMap.this.size();


            DoubleIterator iterator = source.doubleIterator();
            while (iterator.hasNext())
            {
                this.remove(iterator.next());
            }
            return oldSize != ByteDoubleHashMap.this.size();
        }


        public boolean removeAll(double... source)
        {
            int oldSize = ByteDoubleHashMap.this.size();


            for (double item : source)
            {
                this.remove(item);
            }
            return oldSize != ByteDoubleHashMap.this.size();
        }


        public boolean retainAll(DoubleIterable source)
        {
            int oldSize = this.size();
            final DoubleSet sourceSet = source instanceof DoubleSet ? (DoubleSet) source : source.toSet();
            ByteDoubleHashMap retained = ByteDoubleHashMap.this.select(new ByteDoublePredicate()
            {
                public boolean accept(byte key, double value)
                {
                    return sourceSet.contains(value);
                }
            });
            if (retained.size() != oldSize)
            {
                ByteDoubleHashMap.this.keys = retained.keys;
                ByteDoubleHashMap.this.values = retained.values;
                ByteDoubleHashMap.this.sentinelValues = retained.sentinelValues;
                ByteDoubleHashMap.this.occupiedWithData = retained.occupiedWithData;
                ByteDoubleHashMap.this.occupiedWithSentinels = retained.occupiedWithSentinels;
                return true;
            }
            return false;
        }


        public boolean retainAll(double... source)
        {
            return this.retainAll(DoubleHashSet.newSetWith(source));
        }


        public int size()
        {
            return ByteDoubleHashMap.this.size();
        }


        public double[] toArray()
        {
            return ByteDoubleHashMap.this.toArray();
        }
    }


    private class KeyValuesView extends AbstractLazyIterable<ByteDoublePair>
    {
        public void forEach(Procedure<? super ByteDoublePair> procedure)
        {
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey)
                {
                    procedure.value(PrimitiveTuples.pair(EMPTY_KEY, ByteDoubleHashMap.this.sentinelValues.zeroValue));
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey)
                {
                    procedure.value(PrimitiveTuples.pair(REMOVED_KEY, ByteDoubleHashMap.this.sentinelValues.oneValue));
                }
            }
            for (int i = 0; i < ByteDoubleHashMap.this.keys.length; i++)
            {
                if (isNonSentinel(ByteDoubleHashMap.this.keys[i]))
                {
                    procedure.value(PrimitiveTuples.pair(ByteDoubleHashMap.this.keys[i], ByteDoubleHashMap.this.values[i]));
                }
            }
        }


        public void forEachWithIndex(ObjectIntProcedure<? super ByteDoublePair> objectIntProcedure)
        {
            int index = 0;
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey)
                {
                    objectIntProcedure.value(PrimitiveTuples.pair(EMPTY_KEY, ByteDoubleHashMap.this.sentinelValues.zeroValue), index);
                    index++;
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey)
                {
                    objectIntProcedure.value(PrimitiveTuples.pair(REMOVED_KEY, ByteDoubleHashMap.this.sentinelValues.oneValue), index);
                    index++;
                }
            }
            for (int i = 0; i < ByteDoubleHashMap.this.keys.length; i++)
            {
                if (isNonSentinel(ByteDoubleHashMap.this.keys[i]))
                {
                    objectIntProcedure.value(PrimitiveTuples.pair(ByteDoubleHashMap.this.keys[i], ByteDoubleHashMap.this.values[i]), index);
                    index++;
                }
            }
        }


        public <P> void forEachWith(Procedure2<? super ByteDoublePair, ? super P> procedure, P parameter)
        {
            if (ByteDoubleHashMap.this.sentinelValues != null)
            {
                if (ByteDoubleHashMap.this.sentinelValues.containsZeroKey)
                {
                    procedure.value(PrimitiveTuples.pair(EMPTY_KEY, ByteDoubleHashMap.this.sentinelValues.zeroValue), parameter);
                }
                if (ByteDoubleHashMap.this.sentinelValues.containsOneKey)
                {
                    procedure.value(PrimitiveTuples.pair(REMOVED_KEY, ByteDoubleHashMap.this.sentinelValues.oneValue), parameter);
                }
            }
            for (int i = 0; i < ByteDoubleHashMap.this.keys.length; i++)
            {
                if (isNonSentinel(ByteDoubleHashMap.this.keys[i]))
                {
                    procedure.value(PrimitiveTuples.pair(ByteDoubleHashMap.this.keys[i], ByteDoubleHashMap.this.values[i]), parameter);
                }
            }
        }


        public Iterator<ByteDoublePair> iterator()
        {
            return new InternalKeyValuesIterator();
        }


        public class InternalKeyValuesIterator implements Iterator<ByteDoublePair>
        {
            private int count;
            private int position;
            private boolean handledZero;
            private boolean handledOne;


            public ByteDoublePair next()
            {
                if (!this.hasNext())
                {
                    throw new NoSuchElementException("next() called, but the iterator is exhausted");
                }
                this.count++;


                if (!this.handledZero)
                {
                    this.handledZero = true;
                    if (ByteDoubleHashMap.this.containsKey(EMPTY_KEY))
                    {
                        return PrimitiveTuples.pair(EMPTY_KEY, ByteDoubleHashMap.this.sentinelValues.zeroValue);
                    }
                }
                if (!this.handledOne)
                {
                    this.handledOne = true;
                    if (ByteDoubleHashMap.this.containsKey(REMOVED_KEY))
                    {
                        return PrimitiveTuples.pair(REMOVED_KEY, ByteDoubleHashMap.this.sentinelValues.oneValue);
                    }
                }


                byte[] keys = ByteDoubleHashMap.this.keys;
                while (!isNonSentinel(keys[this.position]))
                {
                    this.position++;
                }
                ByteDoublePair result = PrimitiveTuples.pair(keys[this.position], ByteDoubleHashMap.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 != ByteDoubleHashMap.this.size();
            }
        }
    }
}
Source Code of com.gs.collections.impl.map.mutable.primitive.ByteDoubleHashMap$ValuesCollection

Related Classes of com.gs.collections.impl.map.mutable.primitive.ByteDoubleHashMap$ValuesCollection
