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