com.koloboke.collect.impl.hash.ImmutableSeparateKVIntLHashSO Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of koloboke-impl-jdk8 Show documentation
Show all versions of koloboke-impl-jdk8 Show documentation
Carefully designed and efficient extension of the Java Collections Framework with primitive specializations and more, built for Java 8 (Implementation)
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 com.koloboke.collect.impl.hash;
import com.koloboke.collect.hash.HashOverflowException;
import com.koloboke.collect.impl.*;
import java.util.*;
import java.util.concurrent
.ThreadLocalRandom;
public abstract class ImmutableSeparateKVIntLHashSO extends ImmutableLHash
implements SeparateKVIntLHash, PrimitiveConstants, UnsafeConstants {
int freeValue;
int[] set;
void copy(SeparateKVIntLHash hash) {
super.copy(hash);
freeValue = hash.freeValue();
set = hash.keys().clone();
}
void move(SeparateKVIntLHash hash) {
super.copy(hash);
freeValue = hash.freeValue();
set = hash.keys();
}
final void init(HashConfigWrapper configWrapper, int size, int freeValue
) {
this.freeValue = freeValue;
// calls allocateArrays, fill keys with this.freeValue => assign it before
super.init(configWrapper, size);
}
@Override
public int freeValue() {
return freeValue;
}
@Override
public boolean supportRemoved() {
return false;
}
@Override
public int removedValue() {
throw new UnsupportedOperationException();
}
public boolean contains(Object key) {
return contains(((Integer) key).intValue());
}
public boolean contains(int key) {
return index(key) >= 0;
}
int index(int key) {
int free;
if (key != (free = freeValue)) {
int[] keys = set;
int capacityMask, index;
int cur;
if ((cur = keys[index = SeparateKVIntKeyMixing.mix(key) & (capacityMask = keys.length - 1)]) == key) {
// key is present
return index;
} else {
if (cur == free) {
// key is absent
return -1;
} else {
while (true) {
if ((cur = keys[(index = (index - 1) & capacityMask)]) == key) {
// key is present
return index;
} else if (cur == free) {
// key is absent
return -1;
}
}
}
}
} else {
// key is absent
return -1;
}
}
}