com.koloboke.collect.impl.hash.UpdatableSeparateKVDoubleLHashGO 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.InternalDoubleCollectionOps;
import com.koloboke.collect.set.hash.HashDoubleSet;
import java.util.function.DoubleConsumer;
import java.util.function.DoublePredicate;
import java.util.function.Consumer;
import java.util.function.Predicate;
import com.koloboke.collect.impl.NotGenerated;
import com.koloboke.collect.set.DoubleSet;
import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
import javax.annotation.Nonnull;
import java.util.*;
public abstract class UpdatableSeparateKVDoubleLHashGO
extends UpdatableSeparateKVDoubleLHashSO {
@Nonnull
@Override
public long[] keys() {
return set;
}
@Override
public int capacity() {
return set.length;
}
public void forEach(Consumer action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
action.accept(Double.longBitsToDouble(key));
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
public void forEach(DoubleConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
action.accept(Double.longBitsToDouble(key));
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
}
public boolean forEachWhile(
DoublePredicate
predicate) {
if (predicate == null)
throw new java.lang.NullPointerException();
if (this.isEmpty())
return true;
boolean terminated = false;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
if (!predicate.test(Double.longBitsToDouble(key))) {
terminated = true;
break;
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return !terminated;
}
public boolean allContainingIn(DoubleCollection c) {
if (c instanceof InternalDoubleCollectionOps)
return allContainingIn((InternalDoubleCollectionOps) c);
if (this.isEmpty())
return true;
boolean containsAll = true;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
if (!c.contains(Double.longBitsToDouble(key))) {
containsAll = false;
break;
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return containsAll;
}
boolean allContainingIn(InternalDoubleCollectionOps c) {
if (this.isEmpty())
return true;
boolean containsAll = true;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
if (!c.contains(key)) {
containsAll = false;
break;
}
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return containsAll;
}
public boolean reverseAddAllTo(DoubleCollection c) {
if (c instanceof InternalDoubleCollectionOps)
return reverseAddAllTo((InternalDoubleCollectionOps) c);
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
changed |= c.add(Double.longBitsToDouble(key));
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
boolean reverseAddAllTo(InternalDoubleCollectionOps c) {
if (this.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
changed |= c.add(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
public boolean reverseRemoveAllFrom(DoubleSet s) {
if (s instanceof InternalDoubleCollectionOps)
return reverseRemoveAllFrom((InternalDoubleCollectionOps) s);
if (this.isEmpty() || s.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
changed |= s.removeDouble(Double.longBitsToDouble(key));
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
boolean reverseRemoveAllFrom(InternalDoubleCollectionOps s) {
if (this.isEmpty() || s.isEmpty())
return false;
boolean changed = false;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
changed |= s.removeDouble(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return changed;
}
public DoubleIterator iterator() {
int mc = modCount();
return new NoRemovedIterator(mc);
}
public DoubleCursor 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();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
result[resultIndex++] = Double.longBitsToDouble(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();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
a[resultIndex++] = (T) Double.valueOf(Double.longBitsToDouble(key));
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
if (a.length > resultIndex)
a[resultIndex] = null;
return a;
}
@Nonnull
public double[] toDoubleArray() {
int size = size();
double[] result = new double[size];
if (size == 0)
return result;
int resultIndex = 0;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
result[resultIndex++] = Double.longBitsToDouble(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
return result;
}
@Nonnull
public double[] toArray(double[] a) {
int size = size();
if (a.length < size)
a = new double[size];
if (size == 0) {
if (a.length > 0)
a[0] = 0.0;
return a;
}
int resultIndex = 0;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
a[resultIndex++] = Double.longBitsToDouble(key);
}
}
if (mc != modCount())
throw new java.util.ConcurrentModificationException();
if (a.length > resultIndex)
a[resultIndex] = 0.0;
return a;
}
public int setHashCode() {
int hashCode = 0;
int mc = modCount();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
hashCode += ((int) (key ^ (key >>> 32)));
}
}
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();
long[] keys = set;
for (int i = keys.length - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
sb.append(' ').append(Double.longBitsToDouble(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(long key);
public boolean removeIf(Predicate filter) {
throw new java.lang.UnsupportedOperationException();
}
public boolean removeIf(DoublePredicate filter) {
throw new java.lang.UnsupportedOperationException();
}
boolean removeAll(@Nonnull HashDoubleSet thisC, @Nonnull Collection c) {
throw new java.lang.UnsupportedOperationException();
}
boolean removeAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) {
throw new java.lang.UnsupportedOperationException();
}
boolean removeAll(@Nonnull HashDoubleSet thisC, @Nonnull InternalDoubleCollectionOps c) {
throw new java.lang.UnsupportedOperationException();
}
boolean retainAll(@Nonnull HashDoubleSet thisC, @Nonnull Collection c) {
if (c instanceof DoubleCollection)
return retainAll(thisC, (DoubleCollection) c);
throw new java.lang.UnsupportedOperationException();
}
private boolean retainAll(@Nonnull HashDoubleSet thisC, @Nonnull DoubleCollection c) {
throw new java.lang.UnsupportedOperationException();
}
private boolean retainAll(@Nonnull HashDoubleSet thisC,
@Nonnull InternalDoubleCollectionOps c) {
throw new java.lang.UnsupportedOperationException();
}
class NoRemovedIterator implements DoubleIterator {
final long[] keys;
int expectedModCount;
int nextIndex;
double next;
NoRemovedIterator(int mc) {
expectedModCount = mc;
long[] keys = this.keys = set;
int nextI = keys.length;
while (--nextI >= 0) {
long key;
if ((key = keys[nextI]) < FREE_BITS) {
next = Double.longBitsToDouble(key);
break;
}
}
nextIndex = nextI;
}
@Override
public double nextDouble() {
if (expectedModCount == modCount()) {
int nextI;
if ((nextI = nextIndex) >= 0) {
long[] keys = this.keys;
double prev = next;
while (--nextI >= 0) {
long key;
if ((key = keys[nextI]) < FREE_BITS) {
next = Double.longBitsToDouble(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;
long[] keys = this.keys;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
action.accept(Double.longBitsToDouble(key));
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
nextIndex = -1;
}
@Override
public void forEachRemaining(DoubleConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
long[] keys = this.keys;
int nextI = nextIndex;
for (int i = nextI; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
action.accept(Double.longBitsToDouble(key));
}
}
if (nextI != nextIndex || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
nextIndex = -1;
}
@Override
public boolean hasNext() {
return nextIndex >= 0;
}
@Override
public Double next() {
return nextDouble();
}
@Override
public void remove() {
throw new java.lang.UnsupportedOperationException();
}
}
class NoRemovedCursor implements DoubleCursor {
final long[] keys;
int expectedModCount;
int index;
long curKey;
NoRemovedCursor(int mc) {
expectedModCount = mc;
this.keys = set;
index = keys.length;
curKey = FREE_BITS;
}
@Override
public void forEachForward(DoubleConsumer action) {
if (action == null)
throw new java.lang.NullPointerException();
int mc = expectedModCount;
long[] keys = this.keys;
int index = this.index;
for (int i = index - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
action.accept(Double.longBitsToDouble(key));
}
}
if (index != this.index || mc != modCount()) {
throw new java.util.ConcurrentModificationException();
}
this.index = -1;
curKey = FREE_BITS;
}
@Override
public double elem() {
long curKey;
if ((curKey = this.curKey) != FREE_BITS) {
return Double.longBitsToDouble(curKey);
} else {
throw new java.lang.IllegalStateException();
}
}
@Override
public boolean moveNext() {
if (expectedModCount == modCount()) {
long[] keys = this.keys;
for (int i = index - 1; i >= 0; i--) {
long key;
if ((key = keys[i]) < FREE_BITS) {
index = i;
curKey = key;
return true;
}
}
curKey = FREE_BITS;
index = -1;
return false;
} else {
throw new java.util.ConcurrentModificationException();
}
}
@Override
public void remove() {
throw new java.lang.UnsupportedOperationException();
}
}
}