package n; import o.AbstractC2628a; import x4.AbstractC3250p; /* JADX INFO: renamed from: n.y, reason: case insensitive filesystem */ /* JADX INFO: loaded from: classes.dex */ public final class C2597y { /* JADX INFO: renamed from: a, reason: collision with root package name */ public long[] f21487a; /* JADX INFO: renamed from: b, reason: collision with root package name */ public int[] f21488b; /* JADX INFO: renamed from: c, reason: collision with root package name */ public int[] f21489c; /* JADX INFO: renamed from: d, reason: collision with root package name */ public int f21490d; /* JADX INFO: renamed from: e, reason: collision with root package name */ public int f21491e; /* JADX INFO: renamed from: f, reason: collision with root package name */ public int f21492f; public C2597y(int i6) { this.f21487a = Y.f21386a; int[] iArr = AbstractC2589p.f21462a; this.f21488b = iArr; this.f21489c = iArr; if (i6 >= 0) { e(Y.d(i6)); } else { AbstractC2628a.c("Capacity must be a positive value."); throw null; } } public final void a() { this.f21491e = 0; long[] jArr = this.f21487a; if (jArr != Y.f21386a) { AbstractC3250p.I(jArr, -9187201950435737472L); long[] jArr2 = this.f21487a; int i6 = this.f21490d; int i7 = i6 >> 3; long j4 = 255 << ((i6 & 7) << 3); jArr2[i7] = (jArr2[i7] & (~j4)) | j4; } this.f21492f = Y.a(this.f21490d) - this.f21491e; } public final int b(int i6) { int i7 = this.f21490d; int i8 = i6 & i7; int i9 = 0; while (true) { long[] jArr = this.f21487a; 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 c(int i6) { int iHashCode = Integer.hashCode(i6) * (-862048943); int i7 = iHashCode ^ (iHashCode << 16); int i8 = i7 & 127; int i9 = this.f21490d; int i10 = (i7 >>> 7) & i9; int i11 = 0; while (true) { long[] jArr = this.f21487a; 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; for (long j7 = (~j6) & (j6 - 72340172838076673L) & (-9187201950435737472L); j7 != 0; j7 &= j7 - 1) { int iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j7) >> 3) + i10) & i9; if (this.f21488b[iNumberOfTrailingZeros] == i6) { return iNumberOfTrailingZeros; } } if ((j4 & ((~j4) << 6) & (-9187201950435737472L)) != 0) { return -1; } i11 += 8; i10 = (i10 + i11) & i9; } } public final int d(int i6) { int iC = c(i6); if (iC >= 0) { return this.f21489c[iC]; } return -1; } public final void e(int i6) { long[] jArr; int iMax = i6 > 0 ? Math.max(7, Y.c(i6)) : 0; this.f21490d = iMax; if (iMax == 0) { jArr = Y.f21386a; } else { jArr = new long[((iMax + 15) & (-8)) >> 3]; AbstractC3250p.I(jArr, -9187201950435737472L); } this.f21487a = jArr; int i7 = iMax >> 3; long j4 = 255 << ((iMax & 7) << 3); jArr[i7] = (jArr[i7] & (~j4)) | j4; this.f21492f = Y.a(this.f21490d) - this.f21491e; this.f21488b = new int[iMax]; this.f21489c = new int[iMax]; } /* JADX WARN: Code restructure failed: missing block: B:24:0x005d, code lost: return false; */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final boolean equals(Object obj) { boolean z6; boolean z7; boolean z8 = true; if (obj == this) { return true; } if (!(obj instanceof C2597y)) { return false; } C2597y c2597y = (C2597y) obj; if (c2597y.f21491e != this.f21491e) { return false; } int[] iArr = this.f21488b; int[] iArr2 = this.f21489c; long[] jArr = this.f21487a; int length = jArr.length - 2; if (length < 0) { return true; } int i6 = 0; loop0: while (true) { long j4 = jArr[i6]; if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) { int i7 = 8 - ((~(i6 - length)) >>> 31); int i8 = 0; while (i8 < i7) { if ((255 & j4) < 128) { int i9 = (i6 << 3) + i8; int i10 = iArr[i9]; int i11 = iArr2[i9]; int iC = c2597y.c(i10); if (iC < 0) { break loop0; } z7 = z8; if (i11 != c2597y.f21489c[iC]) { break loop0; } } else { z7 = z8; } j4 >>= 8; i8++; z8 = z7; } z6 = z8; if (i7 != 8) { return z6; } } else { z6 = z8; } if (i6 == length) { return z6; } i6++; z8 = z6; } } /* JADX WARN: Code restructure failed: missing block: B:10:0x006e, code lost: r21 = r3; */ /* JADX WARN: Code restructure failed: missing block: B:11:0x007a, code lost: if (((r7 & ((~r7) << 6)) & (-9187201950435737472L)) == 0) goto L60; */ /* JADX WARN: Code restructure failed: missing block: B:12:0x007c, code lost: r2 = b(r4); */ /* JADX WARN: Code restructure failed: missing block: B:13:0x0084, code lost: if (r37.f21492f != 0) goto L16; */ /* JADX WARN: Code restructure failed: missing block: B:15:0x0098, code lost: if (((r37.f21487a[r2 >> 3] >> ((r2 & 7) << 3)) & 255) != 254) goto L17; */ /* JADX WARN: Code restructure failed: missing block: B:16:0x009a, code lost: r29 = r9; r18 = 1; r32 = 0; r27 = 128; */ /* JADX WARN: Code restructure failed: missing block: B:17:0x00a6, code lost: r2 = r37.f21490d; */ /* JADX WARN: Code restructure failed: missing block: B:18:0x00a8, code lost: if (r2 <= 8) goto L43; */ /* JADX WARN: Code restructure failed: missing block: B:19:0x00aa, code lost: r8 = 7; */ /* JADX WARN: Code restructure failed: missing block: B:20:0x00c1, code lost: if (java.lang.Long.compare((((long) r37.f21491e) * 32) ^ Long.MIN_VALUE, (((long) r2) * 25) ^ Long.MIN_VALUE) > 0) goto L41; */ /* JADX WARN: Code restructure failed: missing block: B:21:0x00c3, code lost: r2 = r37.f21487a; r3 = r37.f21490d; r5 = r37.f21488b; r6 = r37.f21489c; r13 = (r3 + 7) >> 3; r7 = 0; */ /* JADX WARN: Code restructure failed: missing block: B:22:0x00d2, code lost: if (r7 >= r13) goto L64; */ /* JADX WARN: Code restructure failed: missing block: B:23:0x00d4, code lost: r10 = r8; r8 = r2[r7] & (-9187201950435737472L); r2[r7] = (-72340172838076674L) & ((~r8) + (r8 >>> r10)); r7 = r7 + 1; r8 = r10; r9 = r9; */ /* JADX WARN: Code restructure failed: missing block: B:24:0x00ef, code lost: r12 = r8; r29 = r9; r27 = 128; r7 = x4.AbstractC3250p.N(r2); r8 = r7 - 1; r2[r8] = (r2[r8] & 72057594037927935L) | (-72057594037927936L); r2[r7] = r2[0]; r7 = 0; */ /* JADX WARN: Code restructure failed: missing block: B:25:0x010e, code lost: if (r7 == r3) goto L65; */ /* JADX WARN: Code restructure failed: missing block: B:26:0x0110, code lost: r8 = r7 >> 3; r11 = (r7 & 7) << 3; r9 = (r2[r8] >> r11) & 255; */ /* JADX WARN: Code restructure failed: missing block: B:27:0x011d, code lost: if (r9 != 128) goto L29; */ /* JADX WARN: Code restructure failed: missing block: B:28:0x011f, code lost: r7 = r7 + 1; */ /* JADX WARN: Code restructure failed: missing block: B:30:0x0124, code lost: if (r9 == 254) goto L66; */ /* JADX WARN: Code restructure failed: missing block: B:32:0x0127, code lost: r9 = java.lang.Integer.hashCode(r5[r7]) * r21; r9 = r9 ^ (r9 << 16); r10 = r9 >>> 7; r13 = b(r10); r10 = r10 & r3; r31 = r12; */ /* JADX WARN: Code restructure failed: missing block: B:33:0x0146, code lost: if ((((r13 - r10) & r3) / 8) != (((r7 - r10) & r3) / 8)) goto L67; */ /* JADX WARN: Code restructure failed: missing block: B:34:0x0148, code lost: r32 = r15; r2[r8] = (((long) (r9 & 127)) << r11) | (r2[r8] & (~(255 << r11))); r2[r2.length - 1] = (r2[r32] & 72057594037927935L) | Long.MIN_VALUE; r7 = r7 + 1; r14 = r14; r12 = r31; r15 = r32; */ /* JADX WARN: Code restructure failed: missing block: B:35:0x016d, code lost: r18 = r14; r32 = r15; r10 = r13 >> 3; r14 = r2[r10]; r12 = (r13 & 7) << 3; */ /* JADX WARN: Code restructure failed: missing block: B:36:0x017f, code lost: if (((r14 >> r12) & 255) != 128) goto L38; */ /* JADX WARN: Code restructure failed: missing block: B:37:0x0181, code lost: r33 = r5; r34 = r6; r2[r10] = ((~(255 << r12)) & r14) | (((long) (r9 & 127)) << r12); r2[r8] = (r2[r8] & (~(255 << r11))) | (128 << r11); r33[r13] = r33[r7]; r33[r7] = r32; r34[r13] = r34[r7]; r34[r7] = r32; */ /* JADX WARN: Code restructure failed: missing block: B:38:0x01ab, code lost: r33 = r5; r34 = r6; r2[r10] = (((long) (r9 & 127)) << r12) | ((~(255 << r12)) & r14); r5 = r33[r13]; r33[r13] = r33[r7]; r33[r7] = r5; r5 = r34[r13]; r34[r13] = r34[r7]; r34[r7] = r5; r7 = r7 - 1; */ /* JADX WARN: Code restructure failed: missing block: B:39:0x01cc, code lost: r2[r2.length - 1] = (r2[r32] & 72057594037927935L) | Long.MIN_VALUE; r7 = r7 + 1; r14 = r18; r12 = r31; r15 = r32; r5 = r33; r6 = r34; */ /* JADX WARN: Code restructure failed: missing block: B:40:0x01e5, code lost: r18 = r14; r32 = r15; r37.f21492f = n.Y.a(r37.f21490d) - r37.f21491e; */ /* JADX WARN: Code restructure failed: missing block: B:42:0x01fa, code lost: r29 = r9; r18 = 1; r32 = 0; r27 = 128; */ /* JADX WARN: Code restructure failed: missing block: B:44:0x0206, code lost: r2 = n.Y.b(r37.f21490d); r3 = r37.f21487a; r5 = r37.f21488b; r6 = r37.f21489c; r7 = r37.f21490d; e(r2); r2 = r37.f21487a; r8 = r37.f21488b; r9 = r37.f21489c; r10 = r37.f21490d; r11 = 0; */ /* JADX WARN: Code restructure failed: missing block: B:45:0x0221, code lost: if (r11 >= r7) goto L75; */ /* JADX WARN: Code restructure failed: missing block: B:47:0x0230, code lost: if (((r3[r11 >> 3] >> ((r11 & 7) << 3)) & 255) >= 128) goto L49; */ /* JADX WARN: Code restructure failed: missing block: B:48:0x0232, code lost: r12 = r5[r11]; r13 = java.lang.Integer.hashCode(r12) * r21; r13 = r13 ^ (r13 << 16); r14 = b(r13 >>> 7); r15 = r2; r1 = r13 & 127; r13 = r14 >> 3; r16 = (r14 & 7) << 3; r1 = (r15[r13] & (~(255 << r16))) | (r1 << r16); r15[r13] = r1; r15[(((r14 - 7) & r10) + (r10 & 7)) >> 3] = r1; r8[r14] = r12; r9[r14] = r6[r11]; */ /* JADX WARN: Code restructure failed: missing block: B:49:0x026e, code lost: r15 = r2; */ /* JADX WARN: Code restructure failed: missing block: B:50:0x026f, code lost: r11 = r11 + 1; r2 = r15; */ /* JADX WARN: Code restructure failed: missing block: B:51:0x0275, code lost: r2 = b(r4); */ /* JADX WARN: Code restructure failed: missing block: B:52:0x0279, code lost: r37.f21491e++; r1 = r37.f21492f; r3 = r37.f21487a; r4 = r2 >> 3; r5 = r3[r4]; r7 = (r2 & 7) << 3; */ /* JADX WARN: Code restructure failed: missing block: B:53:0x0291, code lost: if (((r5 >> r7) & 255) != r27) goto L55; */ /* JADX WARN: Code restructure failed: missing block: B:54:0x0293, code lost: r32 = r18; */ /* JADX WARN: Code restructure failed: missing block: B:55:0x0295, code lost: r37.f21492f = r1 - r32; r1 = r37.f21490d; r5 = (r5 & (~(255 << r7))) | (r29 << r7); r3[r4] = r5; r3[(((r2 - 7) & r1) + (r1 & 7)) >> 3] = r5; r13 = ~r2; */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final void f(int i6, int i7) { int i8; int iNumberOfTrailingZeros; int i9 = i6; int i10 = -862048943; int iHashCode = Integer.hashCode(i9) * (-862048943); int i11 = iHashCode ^ (iHashCode << 16); int i12 = i11 >>> 7; int i13 = i11 & 127; int i14 = this.f21490d; int i15 = i12 & i14; int i16 = 0; loop0: while (true) { long[] jArr = this.f21487a; int i17 = i15 >> 3; int i18 = (i15 & 7) << 3; int i19 = 1; int i20 = i16; int i21 = 0; long j4 = (((-i18) >> 63) & (jArr[i17 + 1] << (64 - i18))) | (jArr[i17] >>> i18); long j6 = i13; long j7 = j4 ^ (j6 * 72340172838076673L); long j8 = (j7 - 72340172838076673L) & (~j7) & (-9187201950435737472L); while (true) { if (j8 == 0) { break; } iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j8) >> 3) + i15) & i14; int i22 = i10; if (this.f21488b[iNumberOfTrailingZeros] == i9) { break loop0; } j8 &= j8 - 1; i10 = i22; } i16 = i20 + 8; i15 = (i15 + i16) & i14; i9 = i6; i10 = i8; } if (iNumberOfTrailingZeros < 0) { iNumberOfTrailingZeros = ~iNumberOfTrailingZeros; } this.f21488b[iNumberOfTrailingZeros] = i6; this.f21489c[iNumberOfTrailingZeros] = i7; } public final int hashCode() { int[] iArr = this.f21488b; int[] iArr2 = this.f21489c; long[] jArr = this.f21487a; 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) { int i9 = (i6 << 3) + i8; int i10 = iArr[i9]; iHashCode += Integer.hashCode(iArr2[i9]) ^ Integer.hashCode(i10); } j4 >>= 8; } if (i7 != 8) { return iHashCode; } } if (i6 == length) { return iHashCode; } i6++; } } /* JADX WARN: Removed duplicated region for block: B:20:0x0066 A[PHI: r8 0x0066: PHI (r8v2 int) = (r8v1 int), (r8v3 int) binds: [B:10:0x002c, B:19:0x0064] A[DONT_GENERATE, DONT_INLINE]] */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final String toString() { if (this.f21491e == 0) { return "{}"; } StringBuilder sb = new StringBuilder("{"); int[] iArr = this.f21488b; int[] iArr2 = this.f21489c; long[] jArr = this.f21487a; int length = jArr.length - 2; if (length >= 0) { int i6 = 0; int i7 = 0; 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 = (i6 << 3) + i9; int i11 = iArr[i10]; int i12 = iArr2[i10]; sb.append(i11); sb.append("="); sb.append(i12); i7++; if (i7 < this.f21491e) { sb.append(", "); } } j4 >>= 8; } if (i8 != 8) { break; } if (i6 == length) { break; } i6++; } } } sb.append('}'); String string = sb.toString(); kotlin.jvm.internal.o.g(string, "toString(...)"); return string; } public /* synthetic */ C2597y() { this(6); } }