package gnu.trove; import java.io.IOException; import java.io.ObjectInputStream; import java.io.ObjectOutputStream; /* loaded from: classes2.dex */ public class TFloatIntHashMap extends TFloatHash { protected transient int[] _values; private static final class EqProcedure implements TFloatIntProcedure { private final TFloatIntHashMap a; EqProcedure(TFloatIntHashMap tFloatIntHashMap) { this.a = tFloatIntHashMap; } private static boolean a(int i, int i2) { return i == i2; } @Override // gnu.trove.TFloatIntProcedure public final boolean a(float f, int i) { return this.a.index(f) >= 0 && a(i, this.a.get(f)); } } private final class HashProcedure implements TFloatIntProcedure { private int a; HashProcedure() { } public int a() { return this.a; } @Override // gnu.trove.TFloatIntProcedure public final boolean a(float f, int i) { int i2 = this.a; int computeHashCode = TFloatIntHashMap.this._hashingStrategy.computeHashCode(f); HashFunctions.a(i); this.a = i2 + (computeHashCode ^ i); return true; } } public TFloatIntHashMap() { } 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.readInt()); 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, int i) { int index = index(f); if (index < 0) { return false; } int[] iArr = this._values; iArr[index] = iArr[index] + i; return true; } @Override // gnu.trove.THash public void clear() { super.clear(); float[] fArr = this._set; int[] iArr = this._values; if (iArr == null) { return; } byte[] bArr = this._states; int length = fArr.length; while (true) { int i = length - 1; if (length <= 0) { return; } fArr[i] = 0.0f; iArr[i] = 0; bArr[i] = 0; length = i; } } @Override // gnu.trove.TFloatHash, gnu.trove.TPrimitiveHash, gnu.trove.THash public Object clone() { TFloatIntHashMap tFloatIntHashMap = (TFloatIntHashMap) super.clone(); int[] iArr = this._values; tFloatIntHashMap._values = iArr == null ? null : (int[]) iArr.clone(); return tFloatIntHashMap; } public boolean containsKey(float f) { return contains(f); } public boolean containsValue(int i) { byte[] bArr = this._states; int[] iArr = this._values; if (bArr == null) { return false; } int length = bArr.length; while (true) { int i2 = length - 1; if (length <= 0) { return false; } if (bArr[i2] == 1 && i == iArr[i2]) { return true; } length = i2; } } public boolean equals(Object obj) { if (!(obj instanceof TFloatIntHashMap)) { return false; } TFloatIntHashMap tFloatIntHashMap = (TFloatIntHashMap) obj; if (tFloatIntHashMap.size() != size()) { return false; } return forEachEntry(new EqProcedure(tFloatIntHashMap)); } public boolean forEachEntry(TFloatIntProcedure tFloatIntProcedure) { byte[] bArr = this._states; float[] fArr = this._set; int[] iArr = this._values; if (bArr != null) { int length = bArr.length; while (true) { int i = length - 1; if (length <= 0) { break; } if (bArr[i] == 1 && !tFloatIntProcedure.a(fArr[i], iArr[i])) { return false; } length = i; } } return true; } public boolean forEachKey(TFloatProcedure tFloatProcedure) { return forEach(tFloatProcedure); } public boolean forEachValue(TIntProcedure tIntProcedure) { byte[] bArr = this._states; int[] iArr = this._values; if (bArr != null) { int length = bArr.length; while (true) { int i = length - 1; if (length <= 0) { break; } if (bArr[i] == 1 && !tIntProcedure.a(iArr[i])) { return false; } length = i; } } return true; } public int get(float f) { int index = index(f); if (index < 0) { return 0; } return this._values[index]; } public int[] getValues() { int[] iArr = new int[size()]; int[] iArr2 = 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) { iArr[i] = iArr2[i2]; i++; } length = i2; } } return iArr; } public int hashCode() { HashProcedure hashProcedure = new HashProcedure(); forEachEntry(hashProcedure); return hashProcedure.a(); } public boolean increment(float f) { return adjustValue(f, 1); } public TFloatIntIterator iterator() { return new TFloatIntIterator(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 int put(float f, int i) { boolean z; int i2; int insertionIndex = insertionIndex(f); if (insertionIndex < 0) { insertionIndex = (-insertionIndex) - 1; i2 = this._values[insertionIndex]; z = false; } else { z = true; i2 = 0; } byte[] bArr = this._states; byte b = bArr[insertionIndex]; this._set[insertionIndex] = f; bArr[insertionIndex] = 1; this._values[insertionIndex] = i; if (z) { postInsertHook(b == 0); } return i2; } @Override // gnu.trove.THash protected void rehash(int i) { int capacity = capacity(); float[] fArr = this._set; int[] iArr = this._values; byte[] bArr = this._states; this._set = new float[i]; this._values = new int[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] = iArr[i2]; this._states[insertionIndex] = 1; } capacity = i2; } } public int remove(float f) { int index = index(f); if (index < 0) { return 0; } int i = this._values[index]; removeAt(index); return i; } @Override // gnu.trove.TFloatHash, gnu.trove.TPrimitiveHash, gnu.trove.THash protected void removeAt(int i) { this._values[i] = 0; super.removeAt(i); } public boolean retainEntries(TFloatIntProcedure tFloatIntProcedure) { byte[] bArr = this._states; float[] fArr = this._set; int[] iArr = 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 || tFloatIntProcedure.a(fArr[i], iArr[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 int[up]; return up; } public String toString() { final StringBuilder sb = new StringBuilder(); forEachEntry(new TFloatIntProcedure(this) { // from class: gnu.trove.TFloatIntHashMap.1 @Override // gnu.trove.TFloatIntProcedure public boolean a(float f, int i) { if (sb.length() != 0) { StringBuilder sb2 = sb; sb2.append(','); sb2.append(' '); } sb.append(f); sb.append('='); sb.append(i); return true; } }); sb.append('}'); sb.insert(0, '{'); return sb.toString(); } public void transformValues(TIntFunction tIntFunction) { byte[] bArr = this._states; int[] iArr = this._values; if (bArr == null) { return; } int length = bArr.length; while (true) { int i = length - 1; if (length <= 0) { return; } if (bArr[i] == 1) { iArr[i] = tIntFunction.a(iArr[i]); } length = i; } } public TFloatIntHashMap(int i) { super(i); } public TFloatIntHashMap(int i, float f) { super(i, f); } public TFloatIntHashMap(TFloatHashingStrategy tFloatHashingStrategy) { super(tFloatHashingStrategy); } public TFloatIntHashMap(int i, TFloatHashingStrategy tFloatHashingStrategy) { super(i, tFloatHashingStrategy); } public TFloatIntHashMap(int i, float f, TFloatHashingStrategy tFloatHashingStrategy) { super(i, f, tFloatHashingStrategy); } }