package gnu.trove; import java.io.IOException; import java.io.ObjectInputStream; import java.io.ObjectOutputStream; /* loaded from: classes2.dex */ public class TFloatFloatHashMap extends TFloatHash { protected transient float[] _values; private static final class EqProcedure implements TFloatFloatProcedure { private final TFloatFloatHashMap a; EqProcedure(TFloatFloatHashMap tFloatFloatHashMap) { this.a = tFloatFloatHashMap; } private static boolean b(float f, float f2) { return f == f2; } @Override // gnu.trove.TFloatFloatProcedure public final boolean a(float f, float f2) { return this.a.index(f) >= 0 && b(f2, this.a.get(f)); } } private final class HashProcedure implements TFloatFloatProcedure { private int a; HashProcedure() { } public int a() { return this.a; } @Override // gnu.trove.TFloatFloatProcedure public final boolean a(float f, float f2) { this.a += TFloatFloatHashMap.this._hashingStrategy.computeHashCode(f) ^ HashFunctions.a(f2); return true; } } public TFloatFloatHashMap() { } 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.readFloat(), 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(float f, float f2) { int index = index(f); if (index < 0) { return false; } float[] fArr = this._values; fArr[index] = fArr[index] + f2; return true; } @Override // gnu.trove.THash public void clear() { super.clear(); float[] fArr = this._set; float[] fArr2 = this._values; if (fArr2 == null) { return; } byte[] bArr = this._states; int length = fArr.length; while (true) { int i = length - 1; if (length <= 0) { return; } fArr[i] = 0.0f; fArr2[i] = 0.0f; bArr[i] = 0; length = i; } } @Override // gnu.trove.TFloatHash, gnu.trove.TPrimitiveHash, gnu.trove.THash public Object clone() { TFloatFloatHashMap tFloatFloatHashMap = (TFloatFloatHashMap) super.clone(); float[] fArr = this._values; tFloatFloatHashMap._values = fArr == null ? null : (float[]) fArr.clone(); return tFloatFloatHashMap; } public boolean containsKey(float f) { return contains(f); } 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 TFloatFloatHashMap)) { return false; } TFloatFloatHashMap tFloatFloatHashMap = (TFloatFloatHashMap) obj; if (tFloatFloatHashMap.size() != size()) { return false; } return forEachEntry(new EqProcedure(tFloatFloatHashMap)); } public boolean forEachEntry(TFloatFloatProcedure tFloatFloatProcedure) { byte[] bArr = this._states; float[] fArr = this._set; float[] fArr2 = this._values; if (bArr != null) { int length = bArr.length; while (true) { int i = length - 1; if (length <= 0) { break; } if (bArr[i] == 1 && !tFloatFloatProcedure.a(fArr[i], fArr2[i])) { return false; } length = i; } } return true; } public boolean forEachKey(TFloatProcedure tFloatProcedure) { return forEach(tFloatProcedure); } 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(float f) { int index = index(f); 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(float f) { return adjustValue(f, 1.0f); } public TFloatFloatIterator iterator() { return new TFloatFloatIterator(this); } public float[] keys() { float[] fArr = new float[size()]; float[] fArr2 = 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) { fArr[i] = fArr2[i2]; i++; } length = i2; } } return fArr; } public float put(float f, float f2) { boolean z; float f3; int insertionIndex = insertionIndex(f); if (insertionIndex < 0) { insertionIndex = (-insertionIndex) - 1; f3 = this._values[insertionIndex]; z = false; } else { z = true; f3 = 0.0f; } byte[] bArr = this._states; byte b = bArr[insertionIndex]; this._set[insertionIndex] = f; bArr[insertionIndex] = 1; this._values[insertionIndex] = f2; if (z) { postInsertHook(b == 0); } return f3; } @Override // gnu.trove.THash protected void rehash(int i) { int capacity = capacity(); float[] fArr = this._set; float[] fArr2 = this._values; byte[] bArr = this._states; this._set = new float[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) { float f = fArr[i2]; int insertionIndex = insertionIndex(f); this._set[insertionIndex] = f; this._values[insertionIndex] = fArr2[i2]; this._states[insertionIndex] = 1; } capacity = i2; } } public float remove(float f) { int index = index(f); if (index < 0) { return 0.0f; } float f2 = this._values[index]; removeAt(index); return f2; } @Override // gnu.trove.TFloatHash, gnu.trove.TPrimitiveHash, gnu.trove.THash protected void removeAt(int i) { this._values[i] = 0.0f; super.removeAt(i); } public boolean retainEntries(TFloatFloatProcedure tFloatFloatProcedure) { byte[] bArr = this._states; float[] fArr = this._set; float[] fArr2 = 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 || tFloatFloatProcedure.a(fArr[i], fArr2[i])) { length = i; } else { removeAt(i); length = i; z = true; } } } return z; } @Override // gnu.trove.TFloatHash, 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 TFloatFloatProcedure(this) { // from class: gnu.trove.TFloatFloatHashMap.1 @Override // gnu.trove.TFloatFloatProcedure public boolean a(float f, float f2) { if (sb.length() != 0) { StringBuilder sb2 = sb; sb2.append(','); sb2.append(' '); } sb.append(f); sb.append('='); sb.append(f2); 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 TFloatFloatHashMap(int i) { super(i); } public TFloatFloatHashMap(int i, float f) { super(i, f); } public TFloatFloatHashMap(TFloatHashingStrategy tFloatHashingStrategy) { super(tFloatHashingStrategy); } public TFloatFloatHashMap(int i, TFloatHashingStrategy tFloatHashingStrategy) { super(i, tFloatHashingStrategy); } public TFloatFloatHashMap(int i, float f, TFloatHashingStrategy tFloatHashingStrategy) { super(i, f, tFloatHashingStrategy); } }