All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.gs.collections.impl.map.mutable.primitive.ObjectCharHashMapWithHashingStrategy Maven / Gradle / Ivy

Go to download

GS Collections is a collections framework for Java. It has JDK-compatible List, Set and Map implementations with a rich API and set of utility classes that work with any JDK compatible Collections, Arrays, Maps or Strings. The iteration protocol was inspired by the Smalltalk collection framework.

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

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

import java.io.Externalizable;
import java.io.IOException;
import java.io.ObjectInput;
import java.io.ObjectOutput;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Collection;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.Set;

import com.gs.collections.api.CharIterable;
import com.gs.collections.api.LazyCharIterable;
import com.gs.collections.api.LazyIterable;
import com.gs.collections.api.RichIterable;
import com.gs.collections.api.bag.primitive.MutableCharBag;
import com.gs.collections.api.block.HashingStrategy;
import com.gs.collections.api.block.function.primitive.CharFunction;
import com.gs.collections.api.block.function.primitive.CharFunction0;
import com.gs.collections.api.block.function.primitive.CharToCharFunction;
import com.gs.collections.api.block.function.primitive.CharToObjectFunction;
import com.gs.collections.api.block.function.primitive.ObjectCharToObjectFunction;
import com.gs.collections.api.block.predicate.primitive.CharPredicate;
import com.gs.collections.api.block.predicate.primitive.ObjectCharPredicate;
import com.gs.collections.api.block.procedure.Procedure;
import com.gs.collections.api.block.procedure.Procedure2;
import com.gs.collections.api.block.procedure.primitive.CharProcedure;
import com.gs.collections.api.block.procedure.primitive.ObjectCharProcedure;
import com.gs.collections.api.collection.MutableCollection;
import com.gs.collections.api.collection.primitive.ImmutableCharCollection;
import com.gs.collections.api.collection.primitive.MutableCharCollection;
import com.gs.collections.api.iterator.CharIterator;
import com.gs.collections.api.iterator.MutableCharIterator;
import com.gs.collections.api.list.MutableList;
import com.gs.collections.api.list.primitive.MutableCharList;
import com.gs.collections.api.map.primitive.ImmutableObjectCharMap;
import com.gs.collections.api.map.primitive.MutableObjectCharMap;
import com.gs.collections.api.map.primitive.ObjectCharMap;
import com.gs.collections.api.set.primitive.CharSet;
import com.gs.collections.api.set.primitive.MutableCharSet;
import com.gs.collections.api.tuple.primitive.ObjectCharPair;
import com.gs.collections.impl.bag.mutable.primitive.CharHashBag;
import com.gs.collections.impl.collection.mutable.primitive.SynchronizedCharCollection;
import com.gs.collections.impl.collection.mutable.primitive.UnmodifiableCharCollection;
import com.gs.collections.impl.lazy.AbstractLazyIterable;
import com.gs.collections.impl.factory.primitive.CharLists;
import com.gs.collections.impl.factory.primitive.ObjectCharMaps;
import com.gs.collections.impl.lazy.primitive.LazyCharIterableAdapter;
import com.gs.collections.impl.list.mutable.FastList;
import com.gs.collections.impl.list.mutable.primitive.CharArrayList;
import com.gs.collections.impl.set.mutable.primitive.CharHashSet;
import com.gs.collections.api.block.procedure.primitive.ObjectIntProcedure;
import com.gs.collections.impl.tuple.primitive.PrimitiveTuples;
/**
 * This file was automatically generated from template file objectPrimitiveHashMapWithHashingStrategy.stg.
 *
 * @since 7.0.
 */
public class ObjectCharHashMapWithHashingStrategy implements MutableObjectCharMap, Externalizable
{
    public static final char EMPTY_VALUE = '\0';

    private static final long serialVersionUID = 1L;
    private static final int OCCUPIED_DATA_RATIO = 2;
    private static final int OCCUPIED_SENTINEL_RATIO = 4;
    private static final int DEFAULT_INITIAL_CAPACITY = 8;

    private static final Object NULL_KEY = new Object()
    {
        @Override
        public boolean equals(Object obj)
        {
            throw new RuntimeException("Possible corruption through unsynchronized concurrent modification.");
        }

        @Override
        public int hashCode()
        {
            throw new RuntimeException("Possible corruption through unsynchronized concurrent modification.");
        }

        @Override
        public String toString()
        {
            return "ObjectCharHashMapWithHashingStrategy.NULL_KEY";
        }
    };

    private static final Object REMOVED_KEY = new Object()
    {
        @Override
        public boolean equals(Object obj)
        {
            throw new RuntimeException("Possible corruption through unsynchronized concurrent modification.");
        }

        @Override
        public int hashCode()
        {
            throw new RuntimeException("Possible corruption through unsynchronized concurrent modification.");
        }

        @Override
        public String toString()
        {
            return "ObjectCharHashMapWithHashingStrategy.REMOVED_KEY";
        }
    };

    private Object[] keys;
    private char[] values;

    private int occupiedWithData;
    private int occupiedWithSentinels;

    private HashingStrategy hashingStrategy;

    @Deprecated
    public ObjectCharHashMapWithHashingStrategy()
    {
    }

    public ObjectCharHashMapWithHashingStrategy(HashingStrategy hashingStrategy)
    {
        this.hashingStrategy = hashingStrategy;
        this.allocateTable(DEFAULT_INITIAL_CAPACITY << 1);
    }

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

    public ObjectCharHashMapWithHashingStrategy(HashingStrategy hashingStrategy, ObjectCharMap map)
    {
        this(hashingStrategy, Math.max(map.size(), DEFAULT_INITIAL_CAPACITY));
        this.putAll(map);
    }

    public static  ObjectCharHashMapWithHashingStrategy newMap(HashingStrategy hashingStrategy)
    {
        return new ObjectCharHashMapWithHashingStrategy(hashingStrategy);
    }

    public static  ObjectCharHashMapWithHashingStrategy newMap(HashingStrategy hashingStrategy, ObjectCharMap map)
    {
        return new ObjectCharHashMapWithHashingStrategy(hashingStrategy, map);
    }

    public static  ObjectCharHashMapWithHashingStrategy newMap(ObjectCharHashMapWithHashingStrategy map)
    {
        return new ObjectCharHashMapWithHashingStrategy(map.hashingStrategy, map);
    }


    public static  ObjectCharHashMapWithHashingStrategy newWithKeysValues(HashingStrategy hashingStrategy, K key1, char value1)
    {
        return new ObjectCharHashMapWithHashingStrategy(hashingStrategy, 1).withKeyValue(key1, value1);
    }

    public static  ObjectCharHashMapWithHashingStrategy newWithKeysValues(HashingStrategy hashingStrategy, K key1, char value1, K key2, char value2)
    {
        return new ObjectCharHashMapWithHashingStrategy(hashingStrategy, 2).withKeysValues(key1, value1, key2, value2);
    }

    public static  ObjectCharHashMapWithHashingStrategy newWithKeysValues(HashingStrategy hashingStrategy, K key1, char value1, K key2, char value2, K key3, char value3)
    {
        return new ObjectCharHashMapWithHashingStrategy(hashingStrategy, 3).withKeysValues(key1, value1, key2, value2, key3, value3);
    }

    public static  ObjectCharHashMapWithHashingStrategy newWithKeysValues(HashingStrategy hashingStrategy, K key1, char value1, K key2, char value2, K key3, char value3, K key4, char value4)
    {
        return new ObjectCharHashMapWithHashingStrategy(hashingStrategy, 4).withKeysValues(key1, value1, key2, value2, key3, value3, key4, value4);
    }

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

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

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

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

        ObjectCharMap other = (ObjectCharMap) obj;

        if (this.size() != other.size())
        {
            return false;
        }

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

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

        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]))
            {
                result += this.hashingStrategy.computeHashCode(this.toNonSentinel(this.keys[i])) ^ (int) this.values[i];
            }
        }
        return result;
    }

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

        appendable.append("{");

        boolean first = true;

        for (int i = 0; i < this.keys.length; i++)
        {
            Object key = this.keys[i];
            if (isNonSentinel(key))
            {
                if (!first)
                {
                    appendable.append(", ");
                }
                appendable.append(this.toNonSentinel(key)).append("=").append(this.values[i]);
                first = false;
            }
        }
        appendable.append("}");

        return appendable.toString();
    }

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

    public boolean isEmpty()
    {
        return this.size() == 0;
    }

    public boolean notEmpty()
    {
        return this.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;

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

    public MutableCharIterator charIterator()
    {
        return new InternalCharIterator();
    }

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

        for (int i = 0; i < this.keys.length; i++)
        {
            if (isNonSentinel(this.keys[i]))
            {
                result[index] = this.values[i];
                index++;
            }
        }
        return result;
    }

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

    public boolean containsAll(char... source)
    {
        for (char item : source)
        {
            if (!this.containsValue(item))
            {
                return false;
            }
        }
        return true;
    }

    public boolean containsAll(CharIterable source)
    {
        return this.containsAll(source.toArray());
    }

    public void clear()
    {
        this.occupiedWithData = 0;
        this.occupiedWithSentinels = 0;
        Arrays.fill(this.keys, null);
        Arrays.fill(this.values, EMPTY_VALUE);
    }

    public void put(K key, char value)
    {
        int index = this.probe(key);

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

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

    public void putAll(ObjectCharMap map)
    {
        map.forEachKeyValue(new ObjectCharProcedure()
        {
            public void value(K key, char value)
            {
                ObjectCharHashMapWithHashingStrategy.this.put(key, value);
            }
        });
    }

    public void removeKey(K key)
    {
        int index = this.probe(key);
        this.removeKeyAtIndex(key, index);
    }

    public void removeKeyAtIndex(K key, int index)
    {
        if (isNonSentinel(this.keys[index]) && this.nullSafeEquals(this.toNonSentinel(this.keys[index]), key))
        {
            this.keys[index] = REMOVED_KEY;
            this.values[index] = EMPTY_VALUE;
            this.occupiedWithData--;
            this.occupiedWithSentinels++;
        }
    }

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

    public char removeKeyIfAbsent(K key, char value)
    {
        int index = this.probe(key);
        if (isNonSentinel(this.keys[index]) && this.nullSafeEquals(this.toNonSentinel(this.keys[index]), key))
        {
            this.keys[index] = REMOVED_KEY;
            char oldValue = this.values[index];
            this.values[index] = EMPTY_VALUE;
            this.occupiedWithData--;
            this.occupiedWithSentinels++;

            return oldValue;
        }
        return value;
    }

    public char getIfAbsentPut(K key, char value)
    {
        int index = this.probe(key);
        if (isNonSentinel(this.keys[index]) && this.nullSafeEquals(this.toNonSentinel(this.keys[index]), key))
        {
            return this.values[index];
        }
        this.addKeyValueAtIndex(key, value, index);
        return value;
    }

    public char getIfAbsentPut(K key, CharFunction0 function)
    {
        int index = this.probe(key);
        if (isNonSentinel(this.keys[index]) && this.nullSafeEquals(this.toNonSentinel(this.keys[index]), key))
        {
            return this.values[index];
        }
        char value = function.value();
        this.addKeyValueAtIndex(key, value, index);
        return value;
    }

    public 

char getIfAbsentPutWith(K key, CharFunction function, P parameter) { int index = this.probe(key); if (isNonSentinel(this.keys[index]) && this.nullSafeEquals(this.toNonSentinel(this.keys[index]), key)) { return this.values[index]; } char value = function.charValueOf(parameter); this.addKeyValueAtIndex(key, value, index); return value; } public char getIfAbsentPutWithKey(K key, CharFunction function) { int index = this.probe(key); if (isNonSentinel(this.keys[index]) && this.nullSafeEquals(this.toNonSentinel(this.keys[index]), key)) { return this.values[index]; } char value = function.charValueOf(key); this.addKeyValueAtIndex(key, value, index); return value; } public char updateValue(K key, char initialValueIfAbsent, CharToCharFunction function) { int index = this.probe(key); if (isNonSentinel(this.keys[index]) && this.nullSafeEquals(this.toNonSentinel(this.keys[index]), key)) { this.values[index] = function.valueOf(this.values[index]); return this.values[index]; } char value = function.valueOf(initialValueIfAbsent); this.addKeyValueAtIndex(key, value, index); return value; } private void addKeyValueAtIndex(K key, char value, int index) { if (this.keys[index] == REMOVED_KEY) { --this.occupiedWithSentinels; } this.keys[index] = toSentinelIfNull(key); this.values[index] = value; ++this.occupiedWithData; if (this.occupiedWithData + this.occupiedWithSentinels > this.maxOccupiedWithData()) { this.rehashAndGrow(); } } public char addToValue(K key, char toBeAdded) { int index = this.probe(key); if (isNonSentinel(this.keys[index]) && this.nullSafeEquals(this.toNonSentinel(this.keys[index]), key)) { this.values[index] += toBeAdded; return this.values[index]; } this.addKeyValueAtIndex(key, toBeAdded, index); return this.values[index]; } public ObjectCharHashMapWithHashingStrategy withKeyValue(K key1, char value1) { this.put(key1, value1); return this; } public ObjectCharHashMapWithHashingStrategy withKeysValues(K key1, char value1, K key2, char value2) { this.put(key1, value1); this.put(key2, value2); return this; } public ObjectCharHashMapWithHashingStrategy withKeysValues(K key1, char value1, K key2, char value2, K key3, char value3) { this.put(key1, value1); this.put(key2, value2); this.put(key3, value3); return this; } public ObjectCharHashMapWithHashingStrategy withKeysValues(K key1, char value1, K key2, char value2, K key3, char value3, K key4, char value4) { this.put(key1, value1); this.put(key2, value2); this.put(key3, value3); this.put(key4, value4); return this; } public ObjectCharHashMapWithHashingStrategy withoutKey(K key) { this.removeKey(key); return this; } public ObjectCharHashMapWithHashingStrategy withoutAllKeys(Iterable keys) { for (K key : keys) { this.removeKey(key); } return this; } public MutableObjectCharMap asUnmodifiable() { return new UnmodifiableObjectCharMap(this); } public MutableObjectCharMap asSynchronized() { return new SynchronizedObjectCharMap(this); } public ImmutableObjectCharMap toImmutable() { return ObjectCharMaps.immutable.withAll(this); } public char get(Object key) { return this.getIfAbsent(key, EMPTY_VALUE); } public char getOrThrow(Object key) { int index = this.probe(key); if (isNonSentinel(this.keys[index])) { return this.values[index]; } throw new IllegalStateException("Key " + key + " not present."); } public char getIfAbsent(Object key, char ifAbsent) { int index = this.probe(key); if (isNonSentinel(this.keys[index]) && this.nullSafeEquals(this.toNonSentinel(this.keys[index]), key)) { return this.values[index]; } return ifAbsent; } public boolean containsKey(Object key) { int index = this.probe(key); return isNonSentinel(this.keys[index]) && this.nullSafeEquals(this.toNonSentinel(this.keys[index]), key); } public boolean containsValue(char value) { for (int i = 0; i < this.values.length; i++) { if (isNonSentinel(this.keys[i]) && this.values[i] == value) { return true; } } return false; } public void forEach(CharProcedure procedure) { this.each(procedure); } public void each(CharProcedure procedure) { this.forEachValue(procedure); } public void forEachValue(CharProcedure procedure) { for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i])) { procedure.value(this.values[i]); } } } public void forEachKey(Procedure procedure) { for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i])) { procedure.value(this.toNonSentinel(this.keys[i])); } } } public void forEachKeyValue(ObjectCharProcedure procedure) { for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i])) { procedure.value(this.toNonSentinel(this.keys[i]), this.values[i]); } } } public ObjectCharHashMapWithHashingStrategy select(ObjectCharPredicate predicate) { ObjectCharHashMapWithHashingStrategy result = ObjectCharHashMapWithHashingStrategy.newMap(this.hashingStrategy); for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i]) && predicate.accept(this.toNonSentinel(this.keys[i]), this.values[i])) { result.put(this.toNonSentinel(this.keys[i]), this.values[i]); } } return result; } public ObjectCharHashMapWithHashingStrategy reject(ObjectCharPredicate predicate) { ObjectCharHashMapWithHashingStrategy result = ObjectCharHashMapWithHashingStrategy.newMap(this.hashingStrategy); for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i]) && !predicate.accept(this.toNonSentinel(this.keys[i]), this.values[i])) { result.put(this.toNonSentinel(this.keys[i]), this.values[i]); } } return result; } public MutableCharCollection select(CharPredicate predicate) { CharArrayList result = new CharArrayList(); 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 MutableCharCollection reject(CharPredicate predicate) { CharArrayList result = new CharArrayList(); 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 char detectIfNone(CharPredicate predicate, char ifNone) { for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i])) { return this.values[i]; } } return ifNone; } public MutableCollection collect(CharToObjectFunction function) { MutableList result = FastList.newList(this.size()); for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i])) { result.add(function.valueOf(this.values[i])); } } return result; } public int count(CharPredicate predicate) { int count = 0; 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(CharPredicate predicate) { 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(CharPredicate predicate) { 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(CharPredicate predicate) { for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i]) && predicate.accept(this.values[i])) { return false; } } return true; } public V injectInto(V injectedValue, ObjectCharToObjectFunction function) { V result = injectedValue; for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i])) { result = function.valueOf(result, this.values[i]); } } return result; } public long sum() { long result = 0L; for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i])) { result += this.values[i]; } } return result; } public char max() { if (this.isEmpty()) { throw new NoSuchElementException(); } char max = '\0'; boolean isMaxSet = false; for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i]) && (!isMaxSet || max < this.values[i])) { max = this.values[i]; isMaxSet = true; } } return max; } public char min() { if (this.isEmpty()) { throw new NoSuchElementException(); } char min = '\0'; boolean isMinSet = false; for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i]) && (!isMinSet || this.values[i] < min)) { min = this.values[i]; isMinSet = true; } } return min; } public char maxIfEmpty(char defaultValue) { if (this.isEmpty()) { return defaultValue; } char max = '\0'; boolean isMaxSet = false; for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i]) && (!isMaxSet || max < this.values[i])) { max = this.values[i]; isMaxSet = true; } } return max; } public char minIfEmpty(char defaultValue) { if (this.isEmpty()) { return defaultValue; } char min = '\0'; boolean isMinSet = false; for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i]) && (!isMinSet || this.values[i] < min)) { min = this.values[i]; isMinSet = true; } } return 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(); } char[] sortedArray = this.toSortedArray(); int middleIndex = sortedArray.length >> 1; if (sortedArray.length > 1 && (sortedArray.length & 1) == 0) { char first = sortedArray[middleIndex]; char second = sortedArray[middleIndex - 1]; return ((double) first + (double) second) / 2.0; } return (double) sortedArray[middleIndex]; } public MutableCharList toList() { MutableCharList result = new CharArrayList(this.size()); for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i])) { result.add(this.values[i]); } } return result; } public MutableCharSet toSet() { MutableCharSet result = new CharHashSet(this.size()); for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i])) { result.add(this.values[i]); } } return result; } public MutableCharBag toBag() { MutableCharBag result = new CharHashBag(this.size()); for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i])) { result.add(this.values[i]); } } return result; } public LazyCharIterable asLazy() { return new LazyCharIterableAdapter(this); } public char[] toSortedArray() { char[] array = this.toArray(); Arrays.sort(array); return array; } public MutableCharList toSortedList() { return this.toList().sortThis(); } public void writeExternal(ObjectOutput out) throws IOException { out.writeObject(this.hashingStrategy); out.writeInt(this.size()); for (int i = 0; i < this.keys.length; i++) { if (isNonSentinel(this.keys[i])) { out.writeObject(this.toNonSentinel(this.keys[i])); out.writeChar(this.values[i]); } } } public void readExternal(ObjectInput in) throws IOException, ClassNotFoundException { this.hashingStrategy = (HashingStrategy) in.readObject(); int size = in.readInt(); int capacity = this.smallestPowerOfTwoGreaterThan(this.fastCeil(size * OCCUPIED_DATA_RATIO)); this.allocateTable(capacity); for (int i = 0; i < size; i++) { this.put((K) in.readObject(), in.readChar()); } } public LazyIterable keysView() { return new KeysView(); } public RichIterable> keyValuesView() { return new KeyValuesView(); } /** * Rehashes every element in the set into a new backing table of the smallest possible size and eliminating removed sentinels. */ public void compact() { this.rehash(this.smallestPowerOfTwoGreaterThan(this.size())); } private void rehashAndGrow() { this.rehash(this.keys.length << 1); } private void rehash(int newCapacity) { int oldLength = this.keys.length; Object[] old = this.keys; char[] 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(this.toNonSentinel(old[i]), oldValues[i]); } } } // exposed for testing int probe(Object element) { int index = this.spread(element); int removedIndex = -1; if (isRemovedKey(this.keys[index])) { removedIndex = index; } else if (this.keys[index] == null || this.nullSafeEquals(this.toNonSentinel(this.keys[index]), element)) { return index; } int nextIndex = index; int probe = 17; // loop until an empty slot is reached while (true) { // Probe algorithm: 17*n*(n+1)/2 where n = no. of collisions nextIndex += probe; probe += 17; nextIndex &= this.keys.length - 1; if (isRemovedKey(this.keys[nextIndex])) { if (removedIndex == -1) { removedIndex = nextIndex; } } else if (this.nullSafeEquals(this.toNonSentinel(this.keys[nextIndex]), element)) { return nextIndex; } else if (this.keys[nextIndex] == null) { return removedIndex == -1 ? nextIndex : removedIndex; } } } // exposed for testing int spread(Object element) { // This function ensures that hashCodes that differ only by // constant multiples at each bit position have a bounded // number of collisions (approximately 8 at default load factor). K nonSentinelKey = this.toNonSentinel(element); int h = nonSentinelKey == null ? 0 : this.hashingStrategy.computeHashCode(nonSentinelKey); h ^= h >>> 20 ^ h >>> 12; h ^= h >>> 7 ^ h >>> 4; return h & (this.keys.length - 1); } private boolean nullSafeEquals(K value, Object other) { if (value == null && other == null) { return true; } else if (value != NULL_KEY && other != null) { if (this.hashingStrategy.equals(value, this.toNonSentinel(other))) { return true; } } return false; } private void allocateTable(int sizeToAllocate) { this.keys = new Object[sizeToAllocate]; this.values = new char[sizeToAllocate]; } private static boolean isRemovedKey(Object key) { return key == REMOVED_KEY; } private static boolean isNonSentinel(K key) { return key != null && !isRemovedKey(key); } private K toNonSentinel(Object key) { return key == NULL_KEY ? null : (K) key; } private static Object toSentinelIfNull(Object key) { return key == null ? NULL_KEY : key; } private int maxOccupiedWithData() { int capacity = this.keys.length; // need at least one free slot for open addressing return Math.min(capacity - 1, capacity / OCCUPIED_DATA_RATIO); } private int maxOccupiedWithSentinels() { return this.keys.length / OCCUPIED_SENTINEL_RATIO; } private class InternalCharIterator implements MutableCharIterator { private int count; private int position; public boolean hasNext() { return this.count != ObjectCharHashMapWithHashingStrategy.this.size(); } public char next() { if (!this.hasNext()) { throw new NoSuchElementException(); } Object[] keys = ObjectCharHashMapWithHashingStrategy.this.keys; while (!isNonSentinel(keys[this.position])) { this.position++; } char result = ObjectCharHashMapWithHashingStrategy.this.values[this.position]; this.count++; this.position++; return result; } public void remove() { if (this.position == 0 || !isNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[this.position - 1])) { throw new IllegalStateException(); } ObjectCharHashMapWithHashingStrategy.this.remove(ObjectCharHashMapWithHashingStrategy.this.keys[this.position - 1]); this.count--; } } public Set keySet() { return new KeySet(); } public MutableCharCollection values() { return new ValuesCollection(); } private class KeySet implements Set { @Override public boolean equals(Object obj) { if (obj instanceof Set) { Set other = (Set) obj; if (other.size() == this.size()) { return this.containsAll(other); } } return false; } @Override public int hashCode() { int hashCode = 0; Object[] table = ObjectCharHashMapWithHashingStrategy.this.keys; for (int i = 0; i < table.length; i++) { Object key = table[i]; if (ObjectCharHashMapWithHashingStrategy.isNonSentinel(key)) { K nonSentinelKey = ObjectCharHashMapWithHashingStrategy.this.toNonSentinel(key); hashCode += nonSentinelKey == null ? 0 : ObjectCharHashMapWithHashingStrategy.this.hashingStrategy.computeHashCode(nonSentinelKey); } } return hashCode; } public int size() { return ObjectCharHashMapWithHashingStrategy.this.size(); } public boolean isEmpty() { return ObjectCharHashMapWithHashingStrategy.this.isEmpty(); } public boolean contains(Object o) { return ObjectCharHashMapWithHashingStrategy.this.containsKey(o); } public Object[] toArray() { int size = ObjectCharHashMapWithHashingStrategy.this.size(); Object[] result = new Object[size]; this.copyKeys(result); return result; } public T[] toArray(T[] result) { int size = ObjectCharHashMapWithHashingStrategy.this.size(); if (result.length < size) { result = (T[]) Array.newInstance(result.getClass().getComponentType(), size); } this.copyKeys(result); if (size < result.length) { result[size] = null; } return result; } public boolean add(K key) { throw new UnsupportedOperationException("Cannot call add() on " + this.getClass().getSimpleName()); } public boolean remove(Object key) { int oldSize = ObjectCharHashMapWithHashingStrategy.this.size(); ObjectCharHashMapWithHashingStrategy.this.removeKey((K) key); return oldSize != ObjectCharHashMapWithHashingStrategy.this.size(); } public boolean containsAll(Collection collection) { for (Object aCollection : collection) { if (!ObjectCharHashMapWithHashingStrategy.this.containsKey(aCollection)) { return false; } } return true; } public boolean addAll(Collection collection) { throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName()); } public boolean retainAll(Collection collection) { int oldSize = ObjectCharHashMapWithHashingStrategy.this.size(); Iterator iterator = this.iterator(); while (iterator.hasNext()) { K next = iterator.next(); if (!collection.contains(next)) { iterator.remove(); } } return oldSize != ObjectCharHashMapWithHashingStrategy.this.size(); } public boolean removeAll(Collection collection) { int oldSize = ObjectCharHashMapWithHashingStrategy.this.size(); for (Object object : collection) { ObjectCharHashMapWithHashingStrategy.this.removeKey((K) object); } return oldSize != ObjectCharHashMapWithHashingStrategy.this.size(); } public void clear() { ObjectCharHashMapWithHashingStrategy.this.clear(); } public Iterator iterator() { return new KeySetIterator(); } private void copyKeys(Object[] result) { int count = 0; for (int i = 0; i < ObjectCharHashMapWithHashingStrategy.this.keys.length; i++) { Object key = ObjectCharHashMapWithHashingStrategy.this.keys[i]; if (ObjectCharHashMapWithHashingStrategy.isNonSentinel(key)) { result[count++] = ObjectCharHashMapWithHashingStrategy.this.keys[i]; } } } } private class KeySetIterator implements Iterator { private int count; private int position; private K currentKey; private boolean isCurrentKeySet; public boolean hasNext() { return this.count < ObjectCharHashMapWithHashingStrategy.this.size(); } public K next() { if (!this.hasNext()) { throw new NoSuchElementException(); } this.count++; Object[] keys = ObjectCharHashMapWithHashingStrategy.this.keys; while (!isNonSentinel(keys[this.position])) { this.position++; } this.currentKey = (K) ObjectCharHashMapWithHashingStrategy.this.keys[this.position]; this.isCurrentKeySet = true; this.position++; return ObjectCharHashMapWithHashingStrategy.this.toNonSentinel(this.currentKey); } public void remove() { if (!this.isCurrentKeySet) { throw new IllegalStateException(); } this.isCurrentKeySet = false; this.count--; if (isNonSentinel(this.currentKey)) { int index = this.position - 1; ObjectCharHashMapWithHashingStrategy.this.removeKeyAtIndex(this.currentKey, index); } else { ObjectCharHashMapWithHashingStrategy.this.removeKey(this.currentKey); } } } private class ValuesCollection implements MutableCharCollection { public int size() { return ObjectCharHashMapWithHashingStrategy.this.size(); } public boolean isEmpty() { return ObjectCharHashMapWithHashingStrategy.this.isEmpty(); } public boolean notEmpty() { return ObjectCharHashMapWithHashingStrategy.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; for (int i = 0; i < ObjectCharHashMapWithHashingStrategy.this.keys.length; i++) { Object key = ObjectCharHashMapWithHashingStrategy.this.keys[i]; if (isNonSentinel(key)) { if (!first) { appendable.append(separator); } appendable.append(String.valueOf(ObjectCharHashMapWithHashingStrategy.this.values[i])); first = false; } } appendable.append(end); } catch (IOException e) { throw new RuntimeException(e); } } public boolean add(char element) { throw new UnsupportedOperationException("Cannot call add() on " + this.getClass().getSimpleName()); } public boolean addAll(char... source) { throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName()); } public boolean addAll(CharIterable source) { throw new UnsupportedOperationException("Cannot call addAll() on " + this.getClass().getSimpleName()); } public boolean remove(char item) { int oldSize = ObjectCharHashMapWithHashingStrategy.this.size(); for (int i = 0; i < ObjectCharHashMapWithHashingStrategy.this.keys.length; i++) { if (isNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[i]) && item == ObjectCharHashMapWithHashingStrategy.this.values[i]) { ObjectCharHashMapWithHashingStrategy.this.removeKey((K) ObjectCharHashMapWithHashingStrategy.this.keys[i]); } } return oldSize != ObjectCharHashMapWithHashingStrategy.this.size(); } public boolean removeAll(CharIterable source) { int oldSize = ObjectCharHashMapWithHashingStrategy.this.size(); CharIterator iterator = source.charIterator(); while (iterator.hasNext()) { this.remove(iterator.next()); } return oldSize != ObjectCharHashMapWithHashingStrategy.this.size(); } public boolean removeAll(char... source) { int oldSize = ObjectCharHashMapWithHashingStrategy.this.size(); for (char item : source) { this.remove(item); } return oldSize != ObjectCharHashMapWithHashingStrategy.this.size(); } public boolean retainAll(CharIterable source) { int oldSize = ObjectCharHashMapWithHashingStrategy.this.size(); final CharSet sourceSet = source instanceof CharSet ? (CharSet) source : source.toSet(); ObjectCharHashMapWithHashingStrategy retained = ObjectCharHashMapWithHashingStrategy.this.select(new ObjectCharPredicate() { public boolean accept(K object, char value) { return sourceSet.contains(value); } }); if (retained.size() != oldSize) { ObjectCharHashMapWithHashingStrategy.this.keys = retained.keys; ObjectCharHashMapWithHashingStrategy.this.values = retained.values; ObjectCharHashMapWithHashingStrategy.this.occupiedWithData = retained.occupiedWithData; ObjectCharHashMapWithHashingStrategy.this.occupiedWithSentinels = retained.occupiedWithSentinels; return true; } return false; } public boolean retainAll(char... source) { return this.retainAll(CharHashSet.newSetWith(source)); } public void clear() { ObjectCharHashMapWithHashingStrategy.this.clear(); } public MutableCharCollection with(char element) { throw new UnsupportedOperationException("Cannot call with() on " + this.getClass().getSimpleName()); } public MutableCharCollection without(char element) { throw new UnsupportedOperationException("Cannot call without() on " + this.getClass().getSimpleName()); } public MutableCharCollection withAll(CharIterable elements) { throw new UnsupportedOperationException("Cannot call withAll() on " + this.getClass().getSimpleName()); } public MutableCharCollection withoutAll(CharIterable elements) { throw new UnsupportedOperationException("Cannot call withoutAll() on " + this.getClass().getSimpleName()); } public MutableCharCollection asUnmodifiable() { return UnmodifiableCharCollection.of(this); } public MutableCharCollection asSynchronized() { return SynchronizedCharCollection.of(this); } public ImmutableCharCollection toImmutable() { return CharLists.immutable.withAll(this); } public MutableCharIterator charIterator() { return ObjectCharHashMapWithHashingStrategy.this.charIterator(); } public char[] toArray() { return ObjectCharHashMapWithHashingStrategy.this.toArray(); } public boolean contains(char value) { return ObjectCharHashMapWithHashingStrategy.this.containsValue(value); } public boolean containsAll(char... source) { return ObjectCharHashMapWithHashingStrategy.this.containsAll(source); } public boolean containsAll(CharIterable source) { return ObjectCharHashMapWithHashingStrategy.this.containsAll(source); } public void forEach(CharProcedure procedure) { ObjectCharHashMapWithHashingStrategy.this.forEach(procedure); } public void each(CharProcedure procedure) { this.forEach(procedure); } public MutableCharCollection select(CharPredicate predicate) { return ObjectCharHashMapWithHashingStrategy.this.select(predicate); } public MutableCharCollection reject(CharPredicate predicate) { return ObjectCharHashMapWithHashingStrategy.this.reject(predicate); } public MutableCollection collect(CharToObjectFunction function) { return ObjectCharHashMapWithHashingStrategy.this.collect(function); } public T injectInto(T injectedValue, ObjectCharToObjectFunction function) { return ObjectCharHashMapWithHashingStrategy.this.injectInto(injectedValue, function); } public char detectIfNone(CharPredicate predicate, char ifNone) { return ObjectCharHashMapWithHashingStrategy.this.detectIfNone(predicate, ifNone); } public int count(CharPredicate predicate) { return ObjectCharHashMapWithHashingStrategy.this.count(predicate); } public boolean anySatisfy(CharPredicate predicate) { return ObjectCharHashMapWithHashingStrategy.this.anySatisfy(predicate); } public boolean allSatisfy(CharPredicate predicate) { return ObjectCharHashMapWithHashingStrategy.this.allSatisfy(predicate); } public boolean noneSatisfy(CharPredicate predicate) { return ObjectCharHashMapWithHashingStrategy.this.noneSatisfy(predicate); } public MutableCharList toList() { return ObjectCharHashMapWithHashingStrategy.this.toList(); } public MutableCharSet toSet() { return ObjectCharHashMapWithHashingStrategy.this.toSet(); } public MutableCharBag toBag() { return ObjectCharHashMapWithHashingStrategy.this.toBag(); } public LazyCharIterable asLazy() { return new LazyCharIterableAdapter(this); } public char[] toSortedArray() { return ObjectCharHashMapWithHashingStrategy.this.toSortedArray(); } public MutableCharList toSortedList() { return ObjectCharHashMapWithHashingStrategy.this.toSortedList(); } public long sum() { return ObjectCharHashMapWithHashingStrategy.this.sum(); } public char max() { return ObjectCharHashMapWithHashingStrategy.this.max(); } public char maxIfEmpty(char defaultValue) { return ObjectCharHashMapWithHashingStrategy.this.maxIfEmpty(defaultValue); } public char min() { return ObjectCharHashMapWithHashingStrategy.this.min(); } public char minIfEmpty(char defaultValue) { return ObjectCharHashMapWithHashingStrategy.this.minIfEmpty(defaultValue); } public double average() { return ObjectCharHashMapWithHashingStrategy.this.average(); } public double median() { return ObjectCharHashMapWithHashingStrategy.this.median(); } } private class KeysView extends AbstractLazyIterable { public void each(Procedure procedure) { ObjectCharHashMapWithHashingStrategy.this.forEachKey(procedure); } public void forEachWithIndex(ObjectIntProcedure objectCharProcedure) { int index = 0; for (int i = 0; i < ObjectCharHashMapWithHashingStrategy.this.keys.length; i++) { if (ObjectCharHashMapWithHashingStrategy.isNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[i])) { objectCharProcedure.value(ObjectCharHashMapWithHashingStrategy.this.toNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[i]), index); index++; } } } public

void forEachWith(Procedure2 procedure, P parameter) { for (int i = 0; i < ObjectCharHashMapWithHashingStrategy.this.keys.length; i++) { if (ObjectCharHashMapWithHashingStrategy.isNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[i])) { procedure.value(ObjectCharHashMapWithHashingStrategy.this.toNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[i]), parameter); } } } public Iterator iterator() { return new InternalKeysViewIterator(); } public class InternalKeysViewIterator implements Iterator { private int count; private int position; public K next() { if (!this.hasNext()) { throw new NoSuchElementException(); } Object[] keys = ObjectCharHashMapWithHashingStrategy.this.keys; while (!isNonSentinel(keys[this.position])) { this.position++; } K result = ObjectCharHashMapWithHashingStrategy.this.toNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[this.position]); this.count++; this.position++; return result; } public void remove() { throw new UnsupportedOperationException("Cannot call remove() on " + this.getClass().getSimpleName()); } public boolean hasNext() { return this.count != ObjectCharHashMapWithHashingStrategy.this.size(); } } } private class KeyValuesView extends AbstractLazyIterable> { public void each(Procedure> procedure) { for (int i = 0; i < ObjectCharHashMapWithHashingStrategy.this.keys.length; i++) { if (ObjectCharHashMapWithHashingStrategy.isNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[i])) { procedure.value(PrimitiveTuples.pair(ObjectCharHashMapWithHashingStrategy.this.toNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[i]), ObjectCharHashMapWithHashingStrategy.this.values[i])); } } } public void forEachWithIndex(ObjectIntProcedure> objectIntProcedure) { int index = 0; for (int i = 0; i < ObjectCharHashMapWithHashingStrategy.this.keys.length; i++) { if (ObjectCharHashMapWithHashingStrategy.isNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[i])) { objectIntProcedure.value(PrimitiveTuples.pair(ObjectCharHashMapWithHashingStrategy.this.toNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[i]), ObjectCharHashMapWithHashingStrategy.this.values[i]), index); index++; } } } public

void forEachWith(Procedure2, ? super P> procedure, P parameter) { for (int i = 0; i < ObjectCharHashMapWithHashingStrategy.this.keys.length; i++) { if (ObjectCharHashMapWithHashingStrategy.isNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[i])) { procedure.value(PrimitiveTuples.pair(ObjectCharHashMapWithHashingStrategy.this.toNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[i]), ObjectCharHashMapWithHashingStrategy.this.values[i]), parameter); } } } public Iterator> iterator() { return new InternalKeyValuesIterator(); } public class InternalKeyValuesIterator implements Iterator> { private int count; private int position; public ObjectCharPair next() { if (!this.hasNext()) { throw new NoSuchElementException(); } Object[] keys = ObjectCharHashMapWithHashingStrategy.this.keys; while (!isNonSentinel(keys[this.position])) { this.position++; } ObjectCharPair result = PrimitiveTuples.pair(ObjectCharHashMapWithHashingStrategy.this.toNonSentinel(ObjectCharHashMapWithHashingStrategy.this.keys[this.position]), ObjectCharHashMapWithHashingStrategy.this.values[this.position]); this.count++; this.position++; return result; } public void remove() { throw new UnsupportedOperationException("Cannot call remove() on " + this.getClass().getSimpleName()); } public boolean hasNext() { return this.count != ObjectCharHashMapWithHashingStrategy.this.size(); } } } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy