net.openhft.collect.impl.hash.MutableLHashSeparateKVObjByteMapSO Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of hftc-impl-jdk8 Show documentation
Trove of primitive collections with Apache 2.0 license, built for Java Java 8
The newest version!
/*
 * Copyright 2014 the original author or authors.
 *
 * 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 net.openhft.collect.impl.hash;

import net.openhft.collect.impl.*;
import net.openhft.collect.map.hash.HashObjByteMap;
import javax.annotation.Nonnull;


public abstract class MutableLHashSeparateKVObjByteMapSO
        extends MutableLHashSeparateKVObjKeyMap
        implements HashObjByteMap, InternalObjByteMapOps, SeparateKVObjByteLHash {

    byte[] values;

    void copy(SeparateKVObjByteLHash hash) {
        super.copy(hash);
        values = hash.valueArray().clone();
    }

    void move(SeparateKVObjByteLHash hash) {
        super.move(hash);
        values = hash.valueArray();
    }

    @Override
    @Nonnull
    public byte[] valueArray() {
        return values;
    }

    
    int valueIndex(byte value) {
        if (isEmpty())
            return -1;
        int index = -1;
        int mc = modCount();
        Object[] keys = set;
        byte[] vals = values;
        for (int i = keys.length - 1; i >= 0; i--) {
            if (keys[i] != FREE) {
                if (value == vals[i]) {
                    index = i;
                    break;
                }
            }
        }
        if (mc != modCount())
            throw new java.util.ConcurrentModificationException();
        return index;
    }

    @Override public
    boolean containsValue(byte value) {
        return valueIndex(value) >= 0;
    }

    boolean removeValue(byte value) {
        int index = valueIndex(value);
        if (index >= 0) {
            removeAt(index);
            return true;
        } else {
            return false;
        }
    }

    @Override
    public boolean containsValue(Object value) {
        return containsValue(((Byte) value).byteValue());
    }

    int insert(K key, byte value) {
        if (key != null) {
            // noinspection unchecked
            K[] keys = (K[]) set;
            int capacityMask, index;
            K cur;
            if ((cur = keys[index = SeparateKVObjKeyMixing.mix(keyHashCode(key)) & (capacityMask = keys.length - 1)]) == key) {
                // key is present
                return index;
            } else {
                keyAbsent:
                if (cur != FREE) {
                    while (true) {
                        index = (index - 1) & capacityMask;
                        if ((cur = keys[index]) == key) {
                            // key is present
                            return index;
                        } else if (cur == FREE) {
                            break keyAbsent;
                        }
                        else if (keyEquals(key, cur)) {
                            // key is present
                            return index;
                        }
                    }
                }
                // key is absent
                incrementModCount();
                keys[index] = key;
                values[index] = value;
                postInsertHook();
                return -1;
            }
        } else {
            return insertNullKey(value);
        }
    }

    int insertNullKey(byte value) {
        // noinspection unchecked
        K[] keys = (K[]) set;
        int capacityMask, index;
        K cur;
        if ((cur = keys[index = 0]) == null) {
            // key is present
            return index;
        } else {
            keyAbsent:
            if (cur != FREE) {
                capacityMask = keys.length - 1;
                while (true) {
                    index = (index - 1) & capacityMask;
                    if ((cur = keys[index]) == null) {
                        // key is present
                        return index;
                    } else if (cur == FREE) {
                        break keyAbsent;
                    }
                }
            }
            // key is absent
            incrementModCount();
            keys[index] = null;
            values[index] = value;
            postInsertHook();
            return -1;
        }
    }

    @Override
    void allocateArrays(int capacity) {
        super.allocateArrays(capacity);
        values = new byte[capacity];
    }
}