com.koloboke.collect.impl.hash.MutableQHashParallelKVLongLongMapSO 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.impl.*;
import com.koloboke.collect.map.hash.HashLongLongMap;
import javax.annotation.Nonnull;
public abstract class MutableQHashParallelKVLongLongMapSO
extends MutableQHashParallelKVLongKeyMap
implements HashLongLongMap, InternalLongLongMapOps, ParallelKVLongLongQHash {
int valueIndex(long value) {
if (this.isEmpty())
return -1;
int index = -1;
int mc = modCount();
long free = freeValue;
long removed = removedValue;
long[] tab = table;
if (noRemoved()) {
for (int i = tab.length - 2; i >= 0; i -= 2) {
if (tab[i] != free) {
if (value == tab[i + 1]) {
index = i;
break;
}
}
}
} else {
for (int i = tab.length - 2; i >= 0; i -= 2) {
long key;
if ((key = tab[i]) != free && key != removed) {
if (value == tab[i + 1]) {
index = i;
break;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return index;
}
@Override public
boolean containsValue(long value) {
return valueIndex(value) >= 0;
}
boolean removeValue(long value) {
int index = valueIndex(value);
if (index >= 0) {
removeAt(index);
return true;
} else {
return false;
}
}
@Override
public boolean containsValue(Object value) {
return containsValue(((Long) value).longValue());
}
int insert(long key, long value) {
long free;
long removed = removedValue;
if (key == (free = freeValue)) {
free = changeFree();
} else if (key == removed) {
removed = changeRemoved();
}
long[] tab = table;
int capacity, index;
long cur;
keyAbsentFreeSlot:
if ((cur = tab[index = ParallelKVLongKeyMixing.mix(key) % (capacity = tab.length)]) != free) {
if (cur == key) {
// key is present
return index;
} else {
int firstRemoved;
if (cur != removed) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 2;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = tab[bIndex]) == free) {
index = bIndex;
break keyAbsentFreeSlot;
} else if (cur == key) {
// key is present
return bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = tab[fIndex]) == free) {
index = fIndex;
break keyAbsentFreeSlot;
} else if (cur == key) {
// key is present
return fIndex;
}
step += 4;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
keyAbsentRemovedSlot: {
int bIndex = index, fIndex = index, step = 2;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = tab[bIndex]) == free) {
if (firstRemoved < 0) {
index = bIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == key) {
// key is present
return bIndex;
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = tab[fIndex]) == free) {
if (firstRemoved < 0) {
index = fIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == key) {
// key is present
return fIndex;
} else if (cur == removed && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 4;
}
}
// key is absent, removed slot
incrementModCount();
tab[firstRemoved] = key;
tab[firstRemoved + 1] = value;
postRemovedSlotInsertHook();
return -1;
}
}
// key is absent, free slot
incrementModCount();
tab[index] = key;
tab[index + 1] = value;
postFreeSlotInsertHook();
return -1;
}
}