150 lines
4.2 KiB
Java
150 lines
4.2 KiB
Java
package gnu.trove;
|
|
|
|
/* loaded from: classes2.dex */
|
|
public abstract class TDoubleHash extends TPrimitiveHash implements TDoubleHashingStrategy {
|
|
protected final TDoubleHashingStrategy _hashingStrategy;
|
|
protected transient double[] _set;
|
|
|
|
public TDoubleHash() {
|
|
this._hashingStrategy = this;
|
|
}
|
|
|
|
@Override // gnu.trove.TPrimitiveHash, gnu.trove.THash
|
|
public Object clone() {
|
|
TDoubleHash tDoubleHash = (TDoubleHash) super.clone();
|
|
double[] dArr = this._set;
|
|
tDoubleHash._set = dArr == null ? null : (double[]) dArr.clone();
|
|
return tDoubleHash;
|
|
}
|
|
|
|
@Override // gnu.trove.TDoubleHashingStrategy
|
|
public final int computeHashCode(double d) {
|
|
return HashFunctions.a(d);
|
|
}
|
|
|
|
public boolean contains(double d) {
|
|
return index(d) >= 0;
|
|
}
|
|
|
|
public boolean forEach(TDoubleProcedure tDoubleProcedure) {
|
|
byte[] bArr = this._states;
|
|
double[] dArr = this._set;
|
|
if (bArr != null) {
|
|
int length = bArr.length;
|
|
while (true) {
|
|
int i = length - 1;
|
|
if (length <= 0) {
|
|
break;
|
|
}
|
|
if (bArr[i] == 1 && !tDoubleProcedure.a(dArr[i])) {
|
|
return false;
|
|
}
|
|
length = i;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
protected int index(double d) {
|
|
byte[] bArr = this._states;
|
|
if (bArr == null) {
|
|
return -1;
|
|
}
|
|
double[] dArr = this._set;
|
|
int length = bArr.length;
|
|
int computeHashCode = this._hashingStrategy.computeHashCode(d) & Integer.MAX_VALUE;
|
|
int i = computeHashCode % length;
|
|
if (bArr[i] != 0 && (bArr[i] == 2 || dArr[i] != d)) {
|
|
int i2 = (computeHashCode % (length - 2)) + 1;
|
|
while (true) {
|
|
i -= i2;
|
|
if (i < 0) {
|
|
i += length;
|
|
}
|
|
if (bArr[i] == 0 || (bArr[i] != 2 && dArr[i] == d)) {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if (bArr[i] == 0) {
|
|
return -1;
|
|
}
|
|
return i;
|
|
}
|
|
|
|
protected int insertionIndex(double d) {
|
|
if (this._set == null) {
|
|
setUp(6);
|
|
}
|
|
byte[] bArr = this._states;
|
|
double[] dArr = this._set;
|
|
int length = bArr.length;
|
|
int computeHashCode = this._hashingStrategy.computeHashCode(d) & Integer.MAX_VALUE;
|
|
int i = computeHashCode % length;
|
|
if (bArr[i] == 0) {
|
|
return i;
|
|
}
|
|
if (bArr[i] == 1 && dArr[i] == d) {
|
|
return (-i) - 1;
|
|
}
|
|
int i2 = (computeHashCode % (length - 2)) + 1;
|
|
do {
|
|
i -= i2;
|
|
if (i < 0) {
|
|
i += length;
|
|
}
|
|
if (bArr[i] != 1) {
|
|
break;
|
|
}
|
|
} while (dArr[i] != d);
|
|
if (bArr[i] != 2) {
|
|
return bArr[i] == 1 ? (-i) - 1 : i;
|
|
}
|
|
int i3 = i;
|
|
while (bArr[i3] != 0 && (bArr[i3] == 2 || dArr[i3] != d)) {
|
|
i3 -= i2;
|
|
if (i3 < 0) {
|
|
i3 += length;
|
|
}
|
|
}
|
|
return bArr[i3] == 1 ? (-i3) - 1 : i;
|
|
}
|
|
|
|
@Override // gnu.trove.TPrimitiveHash, gnu.trove.THash
|
|
protected void removeAt(int i) {
|
|
this._set[i] = 0.0d;
|
|
super.removeAt(i);
|
|
}
|
|
|
|
@Override // gnu.trove.TPrimitiveHash, gnu.trove.THash
|
|
protected int setUp(int i) {
|
|
int up = super.setUp(i);
|
|
this._set = i == -1 ? null : new double[up];
|
|
return up;
|
|
}
|
|
|
|
public TDoubleHash(int i) {
|
|
super(i);
|
|
this._hashingStrategy = this;
|
|
}
|
|
|
|
public TDoubleHash(int i, float f) {
|
|
super(i, f);
|
|
this._hashingStrategy = this;
|
|
}
|
|
|
|
public TDoubleHash(TDoubleHashingStrategy tDoubleHashingStrategy) {
|
|
this._hashingStrategy = tDoubleHashingStrategy;
|
|
}
|
|
|
|
public TDoubleHash(int i, TDoubleHashingStrategy tDoubleHashingStrategy) {
|
|
super(i);
|
|
this._hashingStrategy = tDoubleHashingStrategy;
|
|
}
|
|
|
|
public TDoubleHash(int i, float f, TDoubleHashingStrategy tDoubleHashingStrategy) {
|
|
super(i, f);
|
|
this._hashingStrategy = tDoubleHashingStrategy;
|
|
}
|
|
}
|