package n; import o.AbstractC2628a; import x4.AbstractC3250p; /* JADX INFO: renamed from: n.B, reason: case insensitive filesystem */ /* JADX INFO: loaded from: classes.dex */ public final class C2567B { /* JADX INFO: renamed from: a, reason: collision with root package name */ public long[] f21312a; /* JADX INFO: renamed from: b, reason: collision with root package name */ public int[] f21313b; /* JADX INFO: renamed from: c, reason: collision with root package name */ public int f21314c; /* JADX INFO: renamed from: d, reason: collision with root package name */ public int f21315d; /* JADX INFO: renamed from: e, reason: collision with root package name */ public int f21316e; public C2567B(int i6) { this.f21312a = Y.f21386a; this.f21313b = AbstractC2589p.f21462a; if (i6 >= 0) { e(Y.d(i6)); } else { AbstractC2628a.c("Capacity must be a positive value."); throw null; } } public final boolean a(int i6) { int i7 = this.f21315d; this.f21313b[c(i6)] = i6; return this.f21315d != i7; } /* JADX WARN: Code restructure failed: missing block: B:11:0x0067, code lost: if (((r6 & ((~r6) << 6)) & (-9187201950435737472L)) == 0) goto L16; */ /* JADX WARN: Code restructure failed: missing block: B:12:0x0069, code lost: r10 = -1; */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final boolean b(int i6) { int iNumberOfTrailingZeros; int iHashCode = Integer.hashCode(i6) * (-862048943); int i7 = iHashCode ^ (iHashCode << 16); int i8 = i7 & 127; int i9 = this.f21314c; int i10 = (i7 >>> 7) & i9; int i11 = 0; loop0: while (true) { long[] jArr = this.f21312a; int i12 = i10 >> 3; int i13 = (i10 & 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) + i10) & i9; if (this.f21313b[iNumberOfTrailingZeros] == i6) { break loop0; } j7 &= j7 - 1; } i11 += 8; i10 = (i10 + i11) & i9; } return iNumberOfTrailingZeros >= 0; } public final int c(int i6) { int i7; long j4; long[] jArr; long[] jArr2; long j6; int[] iArr; int i8; int i9 = -862048943; int iHashCode = Integer.hashCode(i6) * (-862048943); int i10 = iHashCode ^ (iHashCode << 16); int i11 = i10 >>> 7; int i12 = i10 & 127; int i13 = this.f21314c; int i14 = i11 & i13; int i15 = 0; while (true) { long[] jArr3 = this.f21312a; int i16 = i14 >> 3; int i17 = (i14 & 7) << 3; int i18 = 1; long j7 = ((jArr3[i16 + 1] << (64 - i17)) & ((-i17) >> 63)) | (jArr3[i16] >>> i17); long j8 = i12; int i19 = i15; int i20 = 0; long j9 = j7 ^ (j8 * 72340172838076673L); long j10 = -9187201950435737472L; long j11 = (~j9) & (j9 - 72340172838076673L) & (-9187201950435737472L); while (j11 != 0) { int iNumberOfTrailingZeros = (i14 + (Long.numberOfTrailingZeros(j11) >> 3)) & i13; int i21 = i9; int i22 = i20; if (this.f21313b[iNumberOfTrailingZeros] == i6) { return iNumberOfTrailingZeros; } j11 &= j11 - 1; i9 = i21; i20 = i22; } int i23 = i9; int i24 = i20; char c6 = '\b'; if ((((~j7) << 6) & j7 & (-9187201950435737472L)) != 0) { int iD = d(i11); if (this.f21316e != 0 || ((this.f21312a[iD >> 3] >> ((iD & 7) << 3)) & 255) == 254) { i7 = 1; j4 = 128; } else { int i25 = this.f21314c; if (i25 <= 8 || Long.compare((((long) this.f21315d) * 32) ^ Long.MIN_VALUE, (((long) i25) * 25) ^ Long.MIN_VALUE) > 0) { i7 = 1; j4 = 128; int iB = Y.b(this.f21314c); long[] jArr4 = this.f21312a; int[] iArr2 = this.f21313b; int i26 = this.f21314c; e(iB); long[] jArr5 = this.f21312a; int[] iArr3 = this.f21313b; int i27 = this.f21314c; int i28 = i24; while (i28 < i26) { if (((jArr4[i28 >> 3] >> ((i28 & 7) << 3)) & 255) < 128) { int i29 = iArr2[i28]; int iHashCode2 = Integer.hashCode(i29) * i23; int i30 = iHashCode2 ^ (iHashCode2 << 16); int iD2 = d(i30 >>> 7); long j12 = i30 & 127; int i31 = iD2 >> 3; int i32 = (iD2 & 7) << 3; jArr = jArr5; jArr2 = jArr4; long j13 = (jArr5[i31] & (~(255 << i32))) | (j12 << i32); jArr[i31] = j13; jArr[(((iD2 - 7) & i27) + (i27 & 7)) >> 3] = j13; iArr3[iD2] = i29; } else { jArr = jArr5; jArr2 = jArr4; } i28++; jArr4 = jArr2; jArr5 = jArr; } } else { long[] jArr6 = this.f21312a; int i33 = this.f21314c; int[] iArr4 = this.f21313b; int i34 = (i33 + 7) >> 3; int i35 = i24; while (i35 < i34) { char c7 = c6; long j14 = jArr6[i35] & j10; jArr6[i35] = (-72340172838076674L) & ((~j14) + (j14 >>> 7)); i35++; i18 = i18; c6 = c7; j10 = -9187201950435737472L; } int i36 = i18; j4 = 128; int iN = AbstractC3250p.N(jArr6); int i37 = iN - 1; long j15 = 72057594037927935L; jArr6[i37] = (jArr6[i37] & 72057594037927935L) | (-72057594037927936L); jArr6[iN] = jArr6[i24]; int i38 = i24; while (i38 != i33) { int i39 = i38 >> 3; int i40 = (i38 & 7) << 3; long j16 = (jArr6[i39] >> i40) & 255; if (j16 != 128 && j16 == 254) { int iHashCode3 = Integer.hashCode(iArr4[i38]) * i23; int i41 = iHashCode3 ^ (iHashCode3 << 16); int i42 = i41 >>> 7; int iD3 = d(i42); int i43 = i42 & i33; int i44 = i36; if (((iD3 - i43) & i33) / 8 == ((i38 - i43) & i33) / 8) { j6 = j15; jArr6[i39] = (((long) (i41 & 127)) << i40) | (jArr6[i39] & (~(255 << i40))); jArr6[jArr6.length - 1] = (jArr6[i24] & j6) | Long.MIN_VALUE; i38++; } else { j6 = j15; int i45 = iD3 >> 3; long j17 = jArr6[i45]; int i46 = (iD3 & 7) << 3; if (((j17 >> i46) & 255) == 128) { iArr = iArr4; int i47 = i38; jArr6[i45] = ((~(255 << i46)) & j17) | (((long) (i41 & 127)) << i46); jArr6[i39] = (jArr6[i39] & (~(255 << i40))) | (128 << i40); iArr[iD3] = iArr[i47]; iArr[i47] = i24; i8 = i47; } else { iArr = iArr4; int i48 = i38; jArr6[i45] = (((long) (i41 & 127)) << i46) | ((~(255 << i46)) & j17); int i49 = iArr[iD3]; iArr[iD3] = iArr[i48]; iArr[i48] = i49; i8 = i48 - 1; } jArr6[jArr6.length - 1] = (jArr6[i24] & j6) | Long.MIN_VALUE; i38 = i8 + 1; iArr4 = iArr; } i36 = i44; j15 = j6; } else { i38++; } } i7 = i36; this.f21316e = Y.a(this.f21314c) - this.f21315d; } iD = d(i11); } this.f21315d++; int i50 = this.f21316e; long[] jArr7 = this.f21312a; int i51 = iD >> 3; long j18 = jArr7[i51]; int i52 = (iD & 7) << 3; if (((j18 >> i52) & 255) == j4) { i24 = i7; } this.f21316e = i50 - i24; int i53 = this.f21314c; long j19 = (j18 & (~(255 << i52))) | (j8 << i52); jArr7[i51] = j19; jArr7[(((iD - 7) & i53) + (i53 & 7)) >> 3] = j19; return iD; } i15 = i19 + 8; i14 = (i14 + i15) & i13; i9 = i23; } } public final int d(int i6) { int i7 = this.f21314c; int i8 = i6 & i7; int i9 = 0; while (true) { long[] jArr = this.f21312a; 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 e(int i6) { long[] jArr; int iMax = i6 > 0 ? Math.max(7, Y.c(i6)) : 0; this.f21314c = iMax; if (iMax == 0) { jArr = Y.f21386a; } else { jArr = new long[((iMax + 15) & (-8)) >> 3]; AbstractC3250p.I(jArr, -9187201950435737472L); } this.f21312a = jArr; int i7 = iMax >> 3; long j4 = 255 << ((iMax & 7) << 3); jArr[i7] = (jArr[i7] & (~j4)) | j4; this.f21316e = Y.a(this.f21314c) - this.f21315d; this.f21313b = new int[iMax]; } /* JADX WARN: Removed duplicated region for block: B:25:0x0058 */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final boolean equals(Object obj) { if (obj == this) { return true; } if (!(obj instanceof C2567B)) { return false; } C2567B c2567b = (C2567B) obj; if (c2567b.f21315d != this.f21315d) { return false; } int[] iArr = this.f21313b; long[] jArr = this.f21312a; int length = jArr.length - 2; if (length >= 0) { 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 && !c2567b.b(iArr[(i6 << 3) + i8])) { return false; } j4 >>= 8; } if (i7 != 8) { break; } if (i6 == length) { break; } i6++; } } } return true; } /* JADX WARN: Code restructure failed: missing block: B:11:0x0067, code lost: if (((r6 & ((~r6) << 6)) & (-9187201950435737472L)) == 0) goto L18; */ /* JADX WARN: Code restructure failed: missing block: B:12:0x0069, code lost: r10 = -1; */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final boolean f(int i6) { int iNumberOfTrailingZeros; int iHashCode = Integer.hashCode(i6) * (-862048943); int i7 = iHashCode ^ (iHashCode << 16); int i8 = i7 & 127; int i9 = this.f21314c; int i10 = (i7 >>> 7) & i9; int i11 = 0; loop0: while (true) { long[] jArr = this.f21312a; int i12 = i10 >> 3; int i13 = (i10 & 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) + i10) & i9; if (this.f21313b[iNumberOfTrailingZeros] == i6) { break loop0; } j7 &= j7 - 1; } i11 += 8; i10 = (i10 + i11) & i9; } boolean z6 = iNumberOfTrailingZeros >= 0; if (z6) { g(iNumberOfTrailingZeros); } return z6; } public final void g(int i6) { this.f21315d--; long[] jArr = this.f21312a; int i7 = this.f21314c; 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; } public final int hashCode() { int[] iArr = this.f21313b; long[] jArr = this.f21312a; int length = jArr.length - 2; if (length < 0) { return 0; } int i6 = 0; int iHashCode = 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) { iHashCode = Integer.hashCode(iArr[(i6 << 3) + i8]) + iHashCode; } j4 >>= 8; } if (i7 != 8) { return iHashCode; } } if (i6 == length) { return iHashCode; } i6++; } } /* JADX WARN: Removed duplicated region for block: B:19:0x005d A[PHI: r7 0x005d: PHI (r7v2 int) = (r7v1 int), (r7v3 int) binds: [B:6:0x0026, B:18:0x005b] A[DONT_GENERATE, DONT_INLINE]] */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final String toString() { StringBuilder sb = new StringBuilder(); sb.append((CharSequence) "["); int[] iArr = this.f21313b; long[] jArr = this.f21312a; int length = jArr.length - 2; if (length >= 0) { int i6 = 0; int i7 = 0; loop0: while (true) { long j4 = jArr[i6]; if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) { int i8 = 8 - ((~(i6 - length)) >>> 31); for (int i9 = 0; i9 < i8; i9++) { if ((255 & j4) < 128) { int i10 = iArr[(i6 << 3) + i9]; if (i7 == -1) { sb.append((CharSequence) "..."); break loop0; } if (i7 != 0) { sb.append((CharSequence) ", "); } sb.append(i10); i7++; } j4 >>= 8; } if (i8 != 8) { break; } if (i6 == length) { break; } i6++; } } sb.append((CharSequence) "]"); } else { sb.append((CharSequence) "]"); } String string = sb.toString(); kotlin.jvm.internal.o.g(string, "toString(...)"); return string; } public /* synthetic */ C2567B() { this(6); } }