com.koloboke.collect.impl.hash.UpdatableParallelKVShortLHashGO 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.InternalShortCollectionOps;
import com.koloboke.collect.set.hash.HashShortSet;
import com.koloboke.function.ShortConsumer;
import com.koloboke.function.ShortPredicate;
import java.util.function.Consumer;
import java.util.function.Predicate;
import com.koloboke.collect.impl.NotGenerated;
import com.koloboke.collect.set.ShortSet;
import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
import javax.annotation.Nonnull;
import java.util.*;
public abstract class UpdatableParallelKVShortLHashGO
extends UpdatableParallelKVShortLHashSO {
@Nonnull
@Override
public int[] table() {
return table;
}
@Override
public int capacity() {
return table.length;
}
public void forEach(Consumer action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
action.accept(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
public void forEach(ShortConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
action.accept(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
public boolean forEachWhile(
ShortPredicate
predicate) {
if (predicate == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return true;
boolean terminated = false;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
if (!predicate.test(key)) {
terminated = true;
break;
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return !terminated;
}
public boolean allContainingIn(ShortCollection c) {
if (this.isEmpty())
return true;
boolean containsAll = true;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
if (!c.contains(key)) {
containsAll = false;
break;
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return containsAll;
}
public boolean reverseAddAllTo(ShortCollection c) {
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
changed |= c.add(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
public boolean reverseRemoveAllFrom(ShortSet s) {
if (this.isEmpty() || s.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
changed |= s.removeShort(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
public ShortIterator iterator() {
int mc = modCount();
return new NoRemovedIterator(mc);
}
public ShortCursor setCursor() {
int mc = modCount();
return new NoRemovedCursor(mc);
}
@Nonnull
public Object[] toArray() {
int size = size();
Object[] result = new Object[size];
if (size == 0)
return result;
int resultIndex = 0;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
result[resultIndex++] = key;
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return result;
}
@SuppressWarnings("unchecked")
@Nonnull
public T[] toArray(@Nonnull T[] a) {
int size = size();
if (a.length < size) {
Class elementType = a.getClass().getComponentType();
a = (T[]) java.lang.reflect.Array.newInstance(elementType, size);
}
if (size == 0) {
if (a.length > 0)
a[0] = null;
return a;
}
int resultIndex = 0;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
a[resultIndex++] = (T) Short.valueOf(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
if (a.length > resultIndex)
a[resultIndex] = null;
return a;
}
@Nonnull
public short[] toShortArray() {
int size = size();
short[] result = new short[size];
if (size == 0)
return result;
int resultIndex = 0;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
result[resultIndex++] = key;
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return result;
}
@Nonnull
public short[] toArray(short[] a) {
int size = size();
if (a.length < size)
a = new short[size];
if (size == 0) {
if (a.length > 0)
a[0] = (short) 0;
return a;
}
int resultIndex = 0;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
a[resultIndex++] = key;
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
if (a.length > resultIndex)
a[resultIndex] = (short) 0;
return a;
}
public int setHashCode() {
int hashCode = 0;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
hashCode += key;
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return hashCode;
}
public String setToString() {
if (this.isEmpty())
return "[]";
StringBuilder sb = new StringBuilder();
int elementCount = 0;
int mc = modCount();
short free = freeValue;
int[] tab = table;
long base = INT_BASE + SHORT_KEY_OFFSET;
for (long off = ((long) tab.length) << INT_SCALE_SHIFT; (off -= INT_SCALE) >= 0L;) {
short key;
if ((key = U.getShort(tab, base + off)) != free) {
sb.append(' ').append(key).append(',');
if (++elementCount == 8) {
int expectedLength = sb.length() * (size() / 8);
sb.ensureCapacity(expectedLength + (expectedLength / 2));
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
sb.setCharAt(0, '[');
sb.setCharAt(sb.length() - 1, ']');
return sb.toString();
}
abstract boolean justRemove(short key);
public boolean removeIf(Predicate filter) {
throw new java.lang.UnsupportedOperationException();
}
public boolean removeIf(ShortPredicate filter) {
throw new java.lang.UnsupportedOperationException();
}
boolean removeAll(@Nonnull HashShortSet thisC, @Nonnull Collection c) {
throw new java.lang.UnsupportedOperationException();
}
boolean removeAll(@Nonnull HashShortSet thisC, @Nonnull ShortCollection c) {
throw new java.lang.UnsupportedOperationException();
}
boolean retainAll(@Nonnull HashShortSet thisC, @Nonnull Collection c) {
if (c instanceof ShortCollection)
return retainAll(thisC, (ShortCollection) c);
throw new java.lang.UnsupportedOperationException();
}
private boolean retainAll(@Nonnull HashShortSet thisC, @Nonnull ShortCollection c) {
throw new java.lang.UnsupportedOperationException();
}
class NoRemovedIterator implements ShortIterator {
final int[] tab;
final short free;
int expectedModCount;
int nextIndex;
short next;
NoRemovedIterator(int mc) {
expectedModCount = mc;
int[] tab = this.tab = table;
short free = this.free = freeValue;
int nextI = tab.length;
int entry;
while (--nextI >= 0) {
short key;
if ((key = (short) (entry = tab[nextI])) != free) {
next = key;
break;
}
}
nextIndex = nextI;
}
@Override
public short nextShort() {
if (expectedModCount == modCount()) {
int nextI;
if ((nextI = nextIndex) >= 0) {
int[] tab = this.tab;
short free = this.free;
short prev = next;
int entry;
while (--nextI >= 0) {
short key;
if ((key = (short) (entry = tab[nextI])) != free) {
next = key;
break;
}
}
nextIndex = nextI;
return prev;
} else {
throw new java.util.NoSuchElementException();
}
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void forEachRemaining(Consumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
int entry;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
action.accept(key);
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
nextIndex = -1;
}
@Override
public void forEachRemaining(ShortConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
int entry;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
action.accept(key);
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
nextIndex = -1;
}
@Override
public boolean hasNext() {
return nextIndex >= 0;
}
@Override
public Short next() {
return nextShort();
}
@Override
public void remove() {
throw new java.lang.UnsupportedOperationException();
}
}
class NoRemovedCursor implements ShortCursor {
final int[] tab;
final short free;
int expectedModCount;
int index;
short curKey;
NoRemovedCursor(int mc) {
expectedModCount = mc;
this.tab = table;
index = tab.length;
short free = this.free = freeValue;
curKey = free;
}
@Override
public void forEachForward(ShortConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
int[] tab = this.tab;
short free = this.free;
int entry;
int index = this.index;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
action.accept(key);
}
}
if (index != this.index || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
this.index = -1;
curKey = free;
}
@Override
public short elem() {
short curKey;
if ((curKey = this.curKey) != free) {
return curKey;
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public boolean moveNext() {
if (expectedModCount == modCount()) {
int[] tab = this.tab;
short free = this.free;
int entry;
for (int i = index - 1; i >= 0; i--) {
short key;
if ((key = (short) (entry = tab[i])) != free) {
index = i;
curKey = key;
return true;
}
}
curKey = free;
index = -1;
return false;
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
throw new java.lang.UnsupportedOperationException();
}
}
}