com.koloboke.collect.impl.hash.MutableLHashObjSetGO 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.*;
import com.koloboke.collect.impl.*;
import com.koloboke.collect.set.ObjSet;
import com.koloboke.collect.set.hash.HashObjSet;
import java.util.function.Consumer;
import java.util.function.Predicate;
import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
import javax.annotation.Nonnull;
import java.util.*;
public class MutableLHashObjSetGO extends MutableObjLHashSetSO
implements HashObjSet, InternalObjCollectionOps {
@Override
final void copy(SeparateKVObjLHash hash) {
int myMC = modCount(),
hashMC = hash.modCount();
super.copy(hash);
if (myMC != modCount() ||
hashMC != hash.modCount())
throw new ConcurrentModificationException();
}
@Override
final void move(SeparateKVObjLHash hash) {
int myMC = modCount(),
hashMC = hash.modCount();
super.move(hash);
if (myMC != modCount() ||
hashMC != hash.modCount())
throw new ConcurrentModificationException();
}
public int hashCode() {
return setHashCode();
}
@Override
public String toString() {
return setToString();
}
@Override
public boolean equals(Object obj) {
return CommonSetOps.equals(this, obj);
}
@SuppressWarnings("unchecked")
@Override
public boolean containsAll(@Nonnull Collection> c) {
return CommonObjCollectionOps.containsAll(this, c);
}
@Nonnull
@Override
public ObjCursor cursor() {
return setCursor();
}
@Override
public boolean add(E key) {
if (key != null) {
Object[] keys = set;
int capacityMask, index;
Object cur;
keyAbsent:
if ((cur = keys[index = SeparateKVObjKeyMixing.mix(keyHashCode(key)) & (capacityMask = keys.length - 1)]) != FREE) {
if (cur == key || keyEquals(key, (E) cur)) {
// key is present
return false;
} else {
while (true) {
if ((cur = keys[(index = (index - 1) & capacityMask)]) == FREE) {
break keyAbsent;
} else if (cur == key || (keyEquals(key, (E) cur))) {
// key is present
return false;
}
}
}
}
// key is absent
incrementModCount();
keys[index] = key;
postInsertHook();
return true;
} else {
return addNullKey();
}
}
private boolean addNullKey() {
Object[] keys = set;
int capacityMask, index;
Object cur;
keyAbsent:
if ((cur = keys[index = 0]) != FREE) {
if (cur == null) {
// key is present
return false;
} else {
capacityMask = keys.length - 1;
while (true) {
if ((cur = keys[(index = (index - 1) & capacityMask)]) == FREE) {
break keyAbsent;
} else if (cur == null) {
// key is present
return false;
}
}
}
}
// key is absent
incrementModCount();
keys[index] = null;
postInsertHook();
return true;
}
@Override
public boolean addAll(@Nonnull Collection extends E> c) {
return CommonObjCollectionOps.addAll(this, c);
}
@Override
public boolean remove(Object key) {
if (key != null) {
// noinspection unchecked
E k = (E) key;
Object[] keys = set;
int capacityMask = keys.length - 1;
int index;
Object cur;
keyPresent:
if ((cur = keys[index = SeparateKVObjKeyMixing.mix(keyHashCode(k)) & capacityMask]) != k) {
if (cur == FREE) {
// key is absent
return false;
} else {
if (keyEquals(k, (E) cur)) {
break keyPresent;
} else {
while (true) {
if ((cur = keys[(index = (index - 1) & capacityMask)]) == k) {
break keyPresent;
} else if (cur == FREE) {
// key is absent
return false;
}
else if (keyEquals(k, (E) cur)) {
break keyPresent;
}
}
}
}
}
// key is present
incrementModCount();
int indexToRemove = index;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
Object keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE) {
break;
}
E castedKeyToShift = (E) keyToShift;
if (((SeparateKVObjKeyMixing.mix(nullableKeyHashCode(castedKeyToShift)) - indexToShift) & capacityMask) >= shiftDistance) {
keys[indexToRemove] = castedKeyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
}
}
keys[indexToRemove] = FREE;
postRemoveHook();
return true;
} else {
return removeNullKey();
}
}
private boolean removeNullKey() {
Object[] keys = set;
int capacityMask = keys.length - 1;
int index;
Object cur;
keyPresent:
if ((cur = keys[index = 0]) != null) {
if (cur == FREE) {
// key is absent
return false;
} else {
while (true) {
if ((cur = keys[(index = (index - 1) & capacityMask)]) == null) {
break keyPresent;
} else if (cur == FREE) {
// key is absent
return false;
}
}
}
}
// key is present
incrementModCount();
int indexToRemove = index;
int indexToShift = indexToRemove;
int shiftDistance = 1;
while (true) {
indexToShift = (indexToShift - 1) & capacityMask;
Object keyToShift;
if ((keyToShift = keys[indexToShift]) == FREE) {
break;
}
E castedKeyToShift = (E) keyToShift;
if (((SeparateKVObjKeyMixing.mix(nullableKeyHashCode(castedKeyToShift)) - indexToShift) & capacityMask) >= shiftDistance) {
keys[indexToRemove] = castedKeyToShift;
indexToRemove = indexToShift;
shiftDistance = 1;
} else {
shiftDistance++;
}
}
keys[indexToRemove] = FREE;
postRemoveHook();
return true;
}
@Override
boolean justRemove(E key) {
return remove(key);
}
@SuppressWarnings("unchecked")
@Override
public boolean removeAll(@Nonnull Collection> c) {
if (
c instanceof InternalObjCollectionOps) {
InternalObjCollectionOps c2 = (InternalObjCollectionOps) c;
if (c2.size() < this.size()
&& equivalence().equals(c2.equivalence())
) {
return c2.reverseRemoveAllFrom(
this
);
}
}
return removeAll(this, c);
}
@Override
public boolean retainAll(@Nonnull Collection> c) {
return retainAll(this, c);
}
}