net.openhft.collect.impl.hash.ImmutableParallelKVByteLHashSO 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
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.hash.HashOverflowException;
import net.openhft.collect.impl.*;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
public abstract class ImmutableParallelKVByteLHashSO extends ImmutableLHash
implements ParallelKVByteLHash, PrimitiveConstants, UnsafeConstants {
byte freeValue;
char[] table;
void copy(ParallelKVByteLHash hash) {
super.copy(hash);
freeValue = hash.freeValue();
table = hash.table().clone();
}
void move(ParallelKVByteLHash hash) {
super.copy(hash);
freeValue = hash.freeValue();
table = hash.table();
}
final void init(HashConfigWrapper configWrapper, int size, byte freeValue
) {
this.freeValue = freeValue;
// calls allocateArrays, fill keys with this.freeValue => assign it before
super.init(configWrapper, size);
}
@Override
public byte freeValue() {
return freeValue;
}
@Override
public boolean supportRemoved() {
return false;
}
@Override
public byte removedValue() {
throw new UnsupportedOperationException();
}
public boolean contains(Object key) {
return contains(((Byte) key).byteValue());
}
public boolean contains(byte key) {
return index(key) >= 0;
}
int index(byte key) {
byte free;
if (key != (free = freeValue)) {
char[] tab = table;
int capacityMask, index;
byte cur;
int entry;
if ((cur = (byte) (entry = tab[index = ParallelKVByteKeyMixing.mix(key) & (capacityMask = tab.length - 1)])) == key) {
// key is present
return index;
} else {
if (cur == free) {
// key is absent
return -1;
} else {
while (true) {
index = (index - 1) & capacityMask;
if ((cur = (byte) (entry = tab[index])) == key) {
// key is present
return index;
} else if (cur == free) {
// key is absent
return -1;
}
}
}
}
} else {
// key is absent
return -1;
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy