jimu-decompiled/sources/gnu/trove/TDoubleFloatHashMap.java
2025-05-13 19:24:51 +02:00

409 lines
11 KiB
Java

package gnu.trove;
import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
/* loaded from: classes2.dex */
public class TDoubleFloatHashMap extends TDoubleHash {
protected transient float[] _values;
private static final class EqProcedure implements TDoubleFloatProcedure {
private final TDoubleFloatHashMap a;
EqProcedure(TDoubleFloatHashMap tDoubleFloatHashMap) {
this.a = tDoubleFloatHashMap;
}
private static boolean a(float f, float f2) {
return f == f2;
}
@Override // gnu.trove.TDoubleFloatProcedure
public final boolean a(double d, float f) {
return this.a.index(d) >= 0 && a(f, this.a.get(d));
}
}
private final class HashProcedure implements TDoubleFloatProcedure {
private int a;
HashProcedure() {
}
public int a() {
return this.a;
}
@Override // gnu.trove.TDoubleFloatProcedure
public final boolean a(double d, float f) {
this.a += TDoubleFloatHashMap.this._hashingStrategy.computeHashCode(d) ^ HashFunctions.a(f);
return true;
}
}
public TDoubleFloatHashMap() {
}
private void readObject(ObjectInputStream objectInputStream) throws IOException, ClassNotFoundException {
objectInputStream.defaultReadObject();
int readInt = objectInputStream.readInt();
setUp(readInt);
while (true) {
int i = readInt - 1;
if (readInt <= 0) {
return;
}
put(objectInputStream.readDouble(), objectInputStream.readFloat());
readInt = i;
}
}
private void writeObject(ObjectOutputStream objectOutputStream) throws IOException {
objectOutputStream.defaultWriteObject();
objectOutputStream.writeInt(this._size);
SerializationProcedure serializationProcedure = new SerializationProcedure(objectOutputStream);
if (!forEachEntry(serializationProcedure)) {
throw serializationProcedure.b;
}
}
public boolean adjustValue(double d, float f) {
int index = index(d);
if (index < 0) {
return false;
}
float[] fArr = this._values;
fArr[index] = fArr[index] + f;
return true;
}
@Override // gnu.trove.THash
public void clear() {
super.clear();
double[] dArr = this._set;
float[] fArr = this._values;
if (fArr == null) {
return;
}
byte[] bArr = this._states;
int length = dArr.length;
while (true) {
int i = length - 1;
if (length <= 0) {
return;
}
dArr[i] = 0.0d;
fArr[i] = 0.0f;
bArr[i] = 0;
length = i;
}
}
@Override // gnu.trove.TDoubleHash, gnu.trove.TPrimitiveHash, gnu.trove.THash
public Object clone() {
TDoubleFloatHashMap tDoubleFloatHashMap = (TDoubleFloatHashMap) super.clone();
float[] fArr = this._values;
tDoubleFloatHashMap._values = fArr == null ? null : (float[]) fArr.clone();
return tDoubleFloatHashMap;
}
public boolean containsKey(double d) {
return contains(d);
}
public boolean containsValue(float f) {
byte[] bArr = this._states;
float[] fArr = this._values;
if (bArr == null) {
return false;
}
int length = bArr.length;
while (true) {
int i = length - 1;
if (length <= 0) {
return false;
}
if (bArr[i] == 1 && f == fArr[i]) {
return true;
}
length = i;
}
}
public boolean equals(Object obj) {
if (!(obj instanceof TDoubleFloatHashMap)) {
return false;
}
TDoubleFloatHashMap tDoubleFloatHashMap = (TDoubleFloatHashMap) obj;
if (tDoubleFloatHashMap.size() != size()) {
return false;
}
return forEachEntry(new EqProcedure(tDoubleFloatHashMap));
}
public boolean forEachEntry(TDoubleFloatProcedure tDoubleFloatProcedure) {
byte[] bArr = this._states;
double[] dArr = this._set;
float[] fArr = this._values;
if (bArr != null) {
int length = bArr.length;
while (true) {
int i = length - 1;
if (length <= 0) {
break;
}
if (bArr[i] == 1 && !tDoubleFloatProcedure.a(dArr[i], fArr[i])) {
return false;
}
length = i;
}
}
return true;
}
public boolean forEachKey(TDoubleProcedure tDoubleProcedure) {
return forEach(tDoubleProcedure);
}
public boolean forEachValue(TFloatProcedure tFloatProcedure) {
byte[] bArr = this._states;
float[] fArr = this._values;
if (bArr != null) {
int length = bArr.length;
while (true) {
int i = length - 1;
if (length <= 0) {
break;
}
if (bArr[i] == 1 && !tFloatProcedure.a(fArr[i])) {
return false;
}
length = i;
}
}
return true;
}
public float get(double d) {
int index = index(d);
if (index < 0) {
return 0.0f;
}
return this._values[index];
}
public float[] getValues() {
float[] fArr = new float[size()];
float[] fArr2 = this._values;
byte[] bArr = this._states;
if (bArr != null) {
int length = bArr.length;
int i = 0;
while (true) {
int i2 = length - 1;
if (length <= 0) {
break;
}
if (bArr[i2] == 1) {
fArr[i] = fArr2[i2];
i++;
}
length = i2;
}
}
return fArr;
}
public int hashCode() {
HashProcedure hashProcedure = new HashProcedure();
forEachEntry(hashProcedure);
return hashProcedure.a();
}
public boolean increment(double d) {
return adjustValue(d, 1.0f);
}
public TDoubleFloatIterator iterator() {
return new TDoubleFloatIterator(this);
}
public double[] keys() {
double[] dArr = new double[size()];
double[] dArr2 = this._set;
byte[] bArr = this._states;
if (bArr != null) {
int length = bArr.length;
int i = 0;
while (true) {
int i2 = length - 1;
if (length <= 0) {
break;
}
if (bArr[i2] == 1) {
dArr[i] = dArr2[i2];
i++;
}
length = i2;
}
}
return dArr;
}
public float put(double d, float f) {
boolean z;
float f2;
int insertionIndex = insertionIndex(d);
if (insertionIndex < 0) {
insertionIndex = (-insertionIndex) - 1;
f2 = this._values[insertionIndex];
z = false;
} else {
z = true;
f2 = 0.0f;
}
byte[] bArr = this._states;
byte b = bArr[insertionIndex];
this._set[insertionIndex] = d;
bArr[insertionIndex] = 1;
this._values[insertionIndex] = f;
if (z) {
postInsertHook(b == 0);
}
return f2;
}
@Override // gnu.trove.THash
protected void rehash(int i) {
int capacity = capacity();
double[] dArr = this._set;
float[] fArr = this._values;
byte[] bArr = this._states;
this._set = new double[i];
this._values = new float[i];
this._states = new byte[i];
while (true) {
int i2 = capacity - 1;
if (capacity <= 0) {
return;
}
if (bArr[i2] == 1) {
double d = dArr[i2];
int insertionIndex = insertionIndex(d);
this._set[insertionIndex] = d;
this._values[insertionIndex] = fArr[i2];
this._states[insertionIndex] = 1;
}
capacity = i2;
}
}
public float remove(double d) {
int index = index(d);
if (index < 0) {
return 0.0f;
}
float f = this._values[index];
removeAt(index);
return f;
}
@Override // gnu.trove.TDoubleHash, gnu.trove.TPrimitiveHash, gnu.trove.THash
protected void removeAt(int i) {
this._values[i] = 0.0f;
super.removeAt(i);
}
public boolean retainEntries(TDoubleFloatProcedure tDoubleFloatProcedure) {
byte[] bArr = this._states;
double[] dArr = this._set;
float[] fArr = this._values;
boolean z = false;
if (bArr != null) {
int length = bArr.length;
while (true) {
int i = length - 1;
if (length <= 0) {
break;
}
if (bArr[i] != 1 || tDoubleFloatProcedure.a(dArr[i], fArr[i])) {
length = i;
} else {
removeAt(i);
length = i;
z = true;
}
}
}
return z;
}
@Override // gnu.trove.TDoubleHash, gnu.trove.TPrimitiveHash, gnu.trove.THash
protected int setUp(int i) {
int up = super.setUp(i);
this._values = i == -1 ? null : new float[up];
return up;
}
public String toString() {
final StringBuilder sb = new StringBuilder();
forEachEntry(new TDoubleFloatProcedure(this) { // from class: gnu.trove.TDoubleFloatHashMap.1
@Override // gnu.trove.TDoubleFloatProcedure
public boolean a(double d, float f) {
if (sb.length() != 0) {
StringBuilder sb2 = sb;
sb2.append(',');
sb2.append(' ');
}
sb.append(d);
sb.append('=');
sb.append(f);
return true;
}
});
sb.append('}');
sb.insert(0, '{');
return sb.toString();
}
public void transformValues(TFloatFunction tFloatFunction) {
byte[] bArr = this._states;
float[] fArr = this._values;
if (bArr == null) {
return;
}
int length = bArr.length;
while (true) {
int i = length - 1;
if (length <= 0) {
return;
}
if (bArr[i] == 1) {
fArr[i] = tFloatFunction.a(fArr[i]);
}
length = i;
}
}
public TDoubleFloatHashMap(int i) {
super(i);
}
public TDoubleFloatHashMap(int i, float f) {
super(i, f);
}
public TDoubleFloatHashMap(TDoubleHashingStrategy tDoubleHashingStrategy) {
super(tDoubleHashingStrategy);
}
public TDoubleFloatHashMap(int i, TDoubleHashingStrategy tDoubleHashingStrategy) {
super(i, tDoubleHashingStrategy);
}
public TDoubleFloatHashMap(int i, float f, TDoubleHashingStrategy tDoubleHashingStrategy) {
super(i, f, tDoubleHashingStrategy);
}
}