com.koloboke.collect.impl.hash.MutableQHashSeparateKVObjDoubleMapSO 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.HashObjDoubleMap;
import javax.annotation.Nonnull;
public abstract class MutableQHashSeparateKVObjDoubleMapSO
extends MutableQHashSeparateKVObjKeyMap
implements HashObjDoubleMap, InternalObjDoubleMapOps, SeparateKVObjDoubleQHash {
long[] values;
void copy(SeparateKVObjDoubleQHash hash) {
super.copy(hash);
values = hash.valueArray().clone();
}
void move(SeparateKVObjDoubleQHash hash) {
super.move(hash);
values = hash.valueArray();
}
@Override
@Nonnull
public long[] valueArray() {
return values;
}
int valueIndex(long value) {
if (this.isEmpty())
return -1;
int index = -1;
int mc = modCount();
Object[] keys = set;
long[] vals = values;
if (noRemoved()) {
for (int i = keys.length - 1; i >= 0; i--) {
if (keys[i] != FREE) {
if (value == vals[i]) {
index = i;
break;
}
}
}
} else {
for (int i = keys.length - 1; i >= 0; i--) {
Object key;
if ((key = keys[i]) != FREE && key != REMOVED) {
if (value == vals[i]) {
index = i;
break;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return index;
}
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;
}
}
int valueIndex(double value) {
if (this.isEmpty())
return -1;
long val = Double.doubleToLongBits(value);
int index = -1;
int mc = modCount();
Object[] keys = set;
long[] vals = values;
if (noRemoved()) {
for (int i = keys.length - 1; i >= 0; i--) {
if (keys[i] != FREE) {
if (val == vals[i]) {
index = i;
break;
}
}
}
} else {
for (int i = keys.length - 1; i >= 0; i--) {
Object key;
if ((key = keys[i]) != FREE && key != REMOVED) {
if (val == vals[i]) {
index = i;
break;
}
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return index;
}
@Override public
boolean containsValue(double value) {
return valueIndex(value) >= 0;
}
boolean removeValue(double value) {
int index = valueIndex(value);
if (index >= 0) {
removeAt(index);
return true;
} else {
return false;
}
}
@Override
public boolean containsValue(Object value) {
return containsValue(((Double) value).doubleValue());
}
int insert(K key, long value) {
if (key != null) {
Object[] keys = set;
int capacity, index;
Object cur;
keyAbsentFreeSlot:
if ((cur = keys[index = SeparateKVObjKeyMixing.mix(keyHashCode(key)) % (capacity = keys.length)]) != FREE) {
if (cur == key) {
// key is present
return index;
} else {
int firstRemoved;
if (cur != REMOVED) {
if (!keyEquals(key, (K) cur)) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = keys[bIndex]) == FREE) {
index = bIndex;
break keyAbsentFreeSlot;
} else if (cur == key || (keyEquals(key, (K) cur))) {
// key is present
return bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = keys[fIndex]) == FREE) {
index = fIndex;
break keyAbsentFreeSlot;
} else if (cur == key || (keyEquals(key, (K) cur))) {
// key is present
return fIndex;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
// key is present
return index;
}
} else {
firstRemoved = index;
}
keyAbsentRemovedSlot: {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = keys[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) {
if (keyEquals(key, (K) cur)) {
// key is present
return bIndex;
}
} else if (firstRemoved < 0) {
firstRemoved = bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = keys[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) {
if (keyEquals(key, (K) cur)) {
// key is present
return fIndex;
}
} else if (firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is absent, removed slot
incrementModCount();
keys[firstRemoved] = key;
values[firstRemoved] = value;
postRemovedSlotInsertHook();
return -1;
}
}
// key is absent, free slot
incrementModCount();
keys[index] = key;
values[index] = value;
postFreeSlotInsertHook();
return -1;
} else {
return insertNullKey(value);
}
}
int insertNullKey(long value) {
Object[] keys = set;
int capacity = keys.length;
int index;
Object cur;
keyAbsentFreeSlot:
if ((cur = keys[index = 0]) != FREE) {
if (cur == null) {
// key is present
return index;
} else {
int firstRemoved;
if (cur != REMOVED) {
if (noRemoved()) {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = keys[bIndex]) == FREE) {
index = bIndex;
break keyAbsentFreeSlot;
} else if (cur == null) {
// key is present
return bIndex;
}
int t;
if ((t = (fIndex += step) - capacity) >= 0) fIndex = t;
if ((cur = keys[fIndex]) == FREE) {
index = fIndex;
break keyAbsentFreeSlot;
} else if (cur == null) {
// key is present
return fIndex;
}
step += 2;
}
} else {
firstRemoved = -1;
}
} else {
firstRemoved = index;
}
keyAbsentRemovedSlot: {
int bIndex = index, fIndex = index, step = 1;
while (true) {
if ((bIndex -= step) < 0) bIndex += capacity;
if ((cur = keys[bIndex]) == FREE) {
if (firstRemoved < 0) {
index = bIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == null) {
// 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 = keys[fIndex]) == FREE) {
if (firstRemoved < 0) {
index = fIndex;
break keyAbsentFreeSlot;
} else {
break keyAbsentRemovedSlot;
}
} else if (cur == null) {
// key is present
return fIndex;
} else if (cur == REMOVED && firstRemoved < 0) {
firstRemoved = fIndex;
}
step += 2;
}
}
// key is absent, removed slot
incrementModCount();
keys[firstRemoved] = null;
values[firstRemoved] = value;
postRemovedSlotInsertHook();
return -1;
}
}
// key is absent, free slot
incrementModCount();
keys[index] = null;
values[index] = value;
postFreeSlotInsertHook();
return -1;
}
@Override
void allocateArrays(int capacity) {
super.allocateArrays(capacity);
values = new long[capacity];
}
}