package n; import o.AbstractC2628a; import x4.AbstractC3250p; /* JADX INFO: loaded from: classes.dex */ public final class N extends X { /* JADX INFO: renamed from: f, reason: collision with root package name */ public int f21356f; public N(int i6) { this.f21381a = Y.f21386a; Object[] objArr = AbstractC2628a.f21782c; this.f21382b = objArr; this.f21383c = objArr; if (i6 >= 0) { i(Y.d(i6)); } else { AbstractC2628a.c("Capacity must be a positive value."); throw null; } } public final void f() { this.f21385e = 0; long[] jArr = this.f21381a; if (jArr != Y.f21386a) { AbstractC3250p.I(jArr, -9187201950435737472L); long[] jArr2 = this.f21381a; int i6 = this.f21384d; int i7 = i6 >> 3; long j4 = 255 << ((i6 & 7) << 3); jArr2[i7] = (jArr2[i7] & (~j4)) | j4; } AbstractC3250p.H(this.f21383c, null, 0, this.f21384d); AbstractC3250p.H(this.f21382b, null, 0, this.f21384d); this.f21356f = Y.a(this.f21384d) - this.f21385e; } public final int g(int i6) { int i7 = this.f21384d; int i8 = i6 & i7; int i9 = 0; while (true) { long[] jArr = this.f21381a; int i10 = i8 >> 3; int i11 = (i8 & 7) << 3; long j4 = ((jArr[i10 + 1] << (64 - i11)) & ((-i11) >> 63)) | (jArr[i10] >>> i11); long j6 = j4 & ((~j4) << 7) & (-9187201950435737472L); if (j6 != 0) { return (i8 + (Long.numberOfTrailingZeros(j6) >> 3)) & i7; } i9 += 8; i8 = (i8 + i9) & i7; } } public final int h(Object obj) { long j4; long j6; long j7; long[] jArr; long[] jArr2; int i6; Object[] objArr; int i7 = -862048943; int iHashCode = (obj != null ? obj.hashCode() : 0) * (-862048943); int i8 = iHashCode ^ (iHashCode << 16); int i9 = i8 >>> 7; int i10 = i8 & 127; int i11 = this.f21384d; int i12 = i9 & i11; int i13 = 0; while (true) { long[] jArr3 = this.f21381a; int i14 = i12 >> 3; int i15 = (i12 & 7) << 3; long j8 = ((jArr3[i14 + 1] << (64 - i15)) & ((-i15) >> 63)) | (jArr3[i14] >>> i15); long j9 = i10; int i16 = i10; long j10 = j8 ^ (j9 * 72340172838076673L); long j11 = (~j10) & (j10 - 72340172838076673L) & (-9187201950435737472L); while (j11 != 0) { int iNumberOfTrailingZeros = (i12 + (Long.numberOfTrailingZeros(j11) >> 3)) & i11; int i17 = i7; if (kotlin.jvm.internal.o.c(this.f21382b[iNumberOfTrailingZeros], obj)) { return iNumberOfTrailingZeros; } j11 &= j11 - 1; i7 = i17; } int i18 = i7; if ((((~j8) << 6) & j8 & (-9187201950435737472L)) != 0) { int iG = g(i9); long j12 = 255; if (this.f21356f != 0 || ((this.f21381a[iG >> 3] >> ((iG & 7) << 3)) & 255) == 254) { j4 = 255; j6 = j9; j7 = 128; } else { int i19 = this.f21384d; if (i19 > 8) { int i20 = 8; if (Long.compare((((long) this.f21385e) * 32) ^ Long.MIN_VALUE, (((long) i19) * 25) ^ Long.MIN_VALUE) <= 0) { long[] jArr4 = this.f21381a; int i21 = this.f21384d; Object[] objArr2 = this.f21382b; Object[] objArr3 = this.f21383c; j7 = 128; int i22 = (i21 + 7) >> 3; int i23 = 0; while (i23 < i22) { long j13 = j12; long j14 = jArr4[i23] & (-9187201950435737472L); jArr4[i23] = (-72340172838076674L) & ((~j14) + (j14 >>> 7)); i23++; i20 = i20; j9 = j9; j12 = j13; } j4 = j12; j6 = j9; int i24 = i20; int iN = AbstractC3250p.N(jArr4); int i25 = iN - 1; jArr4[i25] = (jArr4[i25] & 72057594037927935L) | (-72057594037927936L); jArr4[iN] = jArr4[0]; int i26 = 0; while (i26 != i21) { int i27 = i26 >> 3; int i28 = (i26 & 7) << 3; long j15 = (jArr4[i27] >> i28) & j4; if (j15 != 128 && j15 == 254) { Object obj2 = objArr2[i26]; int iHashCode2 = (obj2 != null ? obj2.hashCode() : 0) * i18; int i29 = iHashCode2 ^ (iHashCode2 << 16); int i30 = i29 >>> 7; int iG2 = g(i30); int i31 = i30 & i21; if (((iG2 - i31) & i21) / i24 == ((i26 - i31) & i21) / i24) { jArr4[i27] = (((long) (i29 & 127)) << i28) | (jArr4[i27] & (~(j4 << i28))); jArr4[jArr4.length - 1] = jArr4[0]; i26++; i24 = i24; } else { int i32 = i24; int i33 = iG2 >> 3; long j16 = jArr4[i33]; int i34 = (iG2 & 7) << 3; if (((j16 >> i34) & j4) == 128) { i6 = i21; objArr = objArr2; jArr4[i33] = ((~(j4 << i34)) & j16) | (((long) (i29 & 127)) << i34); jArr4[i27] = (jArr4[i27] & (~(j4 << i28))) | (128 << i28); objArr[iG2] = objArr[i26]; objArr[i26] = null; objArr3[iG2] = objArr3[i26]; objArr3[i26] = null; } else { i6 = i21; objArr = objArr2; jArr4[i33] = (((long) (i29 & 127)) << i34) | ((~(j4 << i34)) & j16); Object obj3 = objArr[iG2]; objArr[iG2] = objArr[i26]; objArr[i26] = obj3; Object obj4 = objArr3[iG2]; objArr3[iG2] = objArr3[i26]; objArr3[i26] = obj4; i26--; } jArr4[jArr4.length - 1] = jArr4[0]; i26++; i24 = i32; i21 = i6; objArr2 = objArr; } } else { i26++; } } this.f21356f = Y.a(this.f21384d) - this.f21385e; } iG = g(i9); } j4 = 255; j6 = j9; j7 = 128; int iB = Y.b(this.f21384d); long[] jArr5 = this.f21381a; Object[] objArr4 = this.f21382b; Object[] objArr5 = this.f21383c; int i35 = this.f21384d; i(iB); long[] jArr6 = this.f21381a; Object[] objArr6 = this.f21382b; Object[] objArr7 = this.f21383c; int i36 = this.f21384d; int i37 = 0; while (i37 < i35) { if (((jArr5[i37 >> 3] >> ((i37 & 7) << 3)) & 255) < 128) { Object obj5 = objArr4[i37]; int iHashCode3 = (obj5 != null ? obj5.hashCode() : 0) * i18; int i38 = iHashCode3 ^ (iHashCode3 << 16); int iG3 = g(i38 >>> 7); jArr = jArr6; jArr2 = jArr5; long j17 = i38 & 127; int i39 = iG3 >> 3; int i40 = (iG3 & 7) << 3; long j18 = (jArr[i39] & (~(255 << i40))) | (j17 << i40); jArr[i39] = j18; jArr[(((iG3 - 7) & i36) + (i36 & 7)) >> 3] = j18; objArr6[iG3] = obj5; objArr7[iG3] = objArr5[i37]; } else { jArr = jArr6; jArr2 = jArr5; } i37++; jArr5 = jArr2; jArr6 = jArr; } iG = g(i9); } this.f21385e++; int i41 = this.f21356f; long[] jArr7 = this.f21381a; int i42 = iG >> 3; long j19 = jArr7[i42]; int i43 = (iG & 7) << 3; this.f21356f = i41 - (((j19 >> i43) & j4) == j7 ? 1 : 0); int i44 = this.f21384d; long j20 = (j19 & (~(j4 << i43))) | (j6 << i43); jArr7[i42] = j20; jArr7[(((iG - 7) & i44) + (i44 & 7)) >> 3] = j20; return ~iG; } i13 += 8; i12 = (i12 + i13) & i11; i10 = i16; i7 = i18; } } public final void i(int i6) { long[] jArr; int iMax = i6 > 0 ? Math.max(7, Y.c(i6)) : 0; this.f21384d = iMax; if (iMax == 0) { jArr = Y.f21386a; } else { jArr = new long[((iMax + 15) & (-8)) >> 3]; AbstractC3250p.I(jArr, -9187201950435737472L); int i7 = iMax >> 3; long j4 = 255 << ((iMax & 7) << 3); jArr[i7] = (jArr[i7] & (~j4)) | j4; } this.f21381a = jArr; this.f21356f = Y.a(this.f21384d) - this.f21385e; Object[] objArr = AbstractC2628a.f21782c; this.f21382b = iMax == 0 ? objArr : new Object[iMax]; if (iMax != 0) { objArr = new Object[iMax]; } this.f21383c = objArr; } /* JADX WARN: Code restructure failed: missing block: B:15:0x0069, code lost: if (((r4 & ((~r4) << 6)) & (-9187201950435737472L)) == 0) goto L22; */ /* JADX WARN: Code restructure failed: missing block: B:16:0x006b, code lost: r10 = -1; */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final Object j(Object obj) { int iNumberOfTrailingZeros; int i6 = 0; int iHashCode = (obj != null ? obj.hashCode() : 0) * (-862048943); int i7 = iHashCode ^ (iHashCode << 16); int i8 = i7 & 127; int i9 = this.f21384d; int i10 = i7 >>> 7; loop0: while (true) { int i11 = i10 & i9; long[] jArr = this.f21381a; int i12 = i11 >> 3; int i13 = (i11 & 7) << 3; long j4 = ((jArr[i12 + 1] << (64 - i13)) & ((-i13) >> 63)) | (jArr[i12] >>> i13); long j6 = (((long) i8) * 72340172838076673L) ^ j4; long j7 = (~j6) & (j6 - 72340172838076673L) & (-9187201950435737472L); while (true) { if (j7 == 0) { break; } iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j7) >> 3) + i11) & i9; if (kotlin.jvm.internal.o.c(this.f21382b[iNumberOfTrailingZeros], obj)) { break loop0; } j7 &= j7 - 1; } i6 += 8; i10 = i11 + i6; } if (iNumberOfTrailingZeros >= 0) { return k(iNumberOfTrailingZeros); } return null; } public final Object k(int i6) { this.f21385e--; long[] jArr = this.f21381a; int i7 = this.f21384d; int i8 = i6 >> 3; int i9 = (i6 & 7) << 3; long j4 = (jArr[i8] & (~(255 << i9))) | (254 << i9); jArr[i8] = j4; jArr[(((i6 - 7) & i7) + (i7 & 7)) >> 3] = j4; this.f21382b[i6] = null; Object[] objArr = this.f21383c; Object obj = objArr[i6]; objArr[i6] = null; return obj; } public final void l(Object obj, Object obj2) { int iH = h(obj); if (iH < 0) { iH = ~iH; } this.f21382b[iH] = obj; this.f21383c[iH] = obj2; } public /* synthetic */ N() { this(6); } }