package defpackage; import java.util.Arrays; /* JADX INFO: renamed from: ᵯˉˑ, reason: contains not printable characters */ /* JADX INFO: loaded from: classes3.dex */ public final class C4289 { /* JADX INFO: renamed from: ʽˈˋ, reason: contains not printable characters */ public int[] f16349; /* JADX INFO: renamed from: ːˏᵟᵯ, reason: contains not printable characters */ public int[] f16350; /* JADX INFO: renamed from: ᵨᵣ, reason: contains not printable characters */ public int f16351; /* JADX INFO: renamed from: ᵲᵶᵳˈ, reason: contains not printable characters */ public long[] f16352 = AbstractC4334.f16501; /* JADX INFO: renamed from: ᵷᵺʾᵖ, reason: contains not printable characters */ public int f16353; /* JADX INFO: renamed from: ᵻˈᵦʼ, reason: contains not printable characters */ public int f16354; public C4289(int i) { int[] iArr = AbstractC2282.f8981; this.f16349 = iArr; this.f16350 = iArr; if (i >= 0) { m9265(AbstractC4334.m9325(i)); } else { AbstractC3481.m7945("Capacity must be a positive value."); throw null; } } /* JADX WARN: Code restructure failed: missing block: B:24:0x005b, code lost: return false; */ /* JADX WARN: Removed duplicated region for block: B:27:0x0062 */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final boolean equals(Object obj) { if (obj == this) { return true; } if (!(obj instanceof C4289)) { return false; } C4289 c4289 = (C4289) obj; if (c4289.f16351 != this.f16351) { return false; } int[] iArr = this.f16349; int[] iArr2 = this.f16350; long[] jArr = this.f16352; int length = jArr.length - 2; if (length >= 0) { int i = 0; loop0: while (true) { long j = jArr[i]; if ((((~j) << 7) & j & (-9187201950435737472L)) != -9187201950435737472L) { int i2 = 8 - ((~(i - length)) >>> 31); for (int i3 = 0; i3 < i2; i3++) { if ((255 & j) < 128) { int i4 = (i << 3) + i3; int i5 = iArr[i4]; int i6 = iArr2[i4]; int iM9264 = c4289.m9264(i5); if (iM9264 < 0 || i6 != c4289.f16350[iM9264]) { break loop0; } } j >>= 8; } if (i2 != 8) { break; } if (i == length) { break; } i++; } } } return true; } public final int hashCode() { int[] iArr = this.f16349; int[] iArr2 = this.f16350; long[] jArr = this.f16352; int length = jArr.length - 2; if (length < 0) { return 0; } int i = 0; int i2 = 0; while (true) { long j = jArr[i]; if ((((~j) << 7) & j & (-9187201950435737472L)) != -9187201950435737472L) { int i3 = 8 - ((~(i - length)) >>> 31); for (int i4 = 0; i4 < i3; i4++) { if ((255 & j) < 128) { int i5 = (i << 3) + i4; i2 += iArr2[i5] ^ iArr[i5]; } j >>= 8; } if (i3 != 8) { return i2; } } if (i == length) { return i2; } i++; } } /* 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.f16351 == 0) { return "{}"; } StringBuilder sb = new StringBuilder("{"); int[] iArr = this.f16349; int[] iArr2 = this.f16350; long[] jArr = this.f16352; int length = jArr.length - 2; if (length >= 0) { int i = 0; int i2 = 0; while (true) { long j = jArr[i]; if ((((~j) << 7) & j & (-9187201950435737472L)) != -9187201950435737472L) { int i3 = 8 - ((~(i - length)) >>> 31); for (int i4 = 0; i4 < i3; i4++) { if ((255 & j) < 128) { int i5 = (i << 3) + i4; int i6 = iArr[i5]; int i7 = iArr2[i5]; sb.append(i6); sb.append("="); sb.append(i7); i2++; if (i2 < this.f16351) { sb.append(", "); } } j >>= 8; } if (i3 != 8) { break; } if (i == length) { break; } i++; } } } sb.append('}'); return sb.toString(); } /* JADX INFO: renamed from: ʽˈˋ, reason: contains not printable characters */ public final int m9264(int i) { int i2 = (-862048943) * i; int i3 = i2 ^ (i2 << 16); int i4 = i3 & 127; int i5 = this.f16353; int i6 = (i3 >>> 7) & i5; int i7 = 0; while (true) { long[] jArr = this.f16352; int i8 = i6 >> 3; int i9 = (i6 & 7) << 3; long j = ((jArr[i8 + 1] << (64 - i9)) & ((-i9) >> 63)) | (jArr[i8] >>> i9); long j2 = (((long) i4) * 72340172838076673L) ^ j; for (long j3 = (~j2) & (j2 - 72340172838076673L) & (-9187201950435737472L); j3 != 0; j3 &= j3 - 1) { int iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j3) >> 3) + i6) & i5; if (this.f16349[iNumberOfTrailingZeros] == i) { return iNumberOfTrailingZeros; } } if ((j & ((~j) << 6) & (-9187201950435737472L)) != 0) { return -1; } i7 += 8; i6 = (i6 + i7) & i5; } } /* JADX INFO: renamed from: ːˏᵟᵯ, reason: contains not printable characters */ public final void m9265(int i) { long[] jArr; int iMax = i > 0 ? Math.max(7, AbstractC4334.m9323(i)) : 0; this.f16353 = iMax; if (iMax == 0) { jArr = AbstractC4334.f16501; } else { int i2 = ((iMax + 15) & (-8)) >> 3; long[] jArr2 = new long[i2]; Arrays.fill(jArr2, 0, i2, -9187201950435737472L); jArr = jArr2; } this.f16352 = jArr; int i3 = iMax >> 3; long j = 255 << ((iMax & 7) << 3); jArr[i3] = (jArr[i3] & (~j)) | j; this.f16354 = AbstractC4334.m9324(this.f16353) - this.f16351; this.f16349 = new int[iMax]; this.f16350 = new int[iMax]; } /* JADX INFO: renamed from: ᵲᵶᵳˈ, reason: contains not printable characters */ public final int m9266(int i) { int i2 = this.f16353; int i3 = i & i2; int i4 = 0; while (true) { long[] jArr = this.f16352; int i5 = i3 >> 3; int i6 = (i3 & 7) << 3; long j = ((jArr[i5 + 1] << (64 - i6)) & ((-i6) >> 63)) | (jArr[i5] >>> i6); long j2 = j & ((~j) << 7) & (-9187201950435737472L); if (j2 != 0) { return (i3 + (Long.numberOfTrailingZeros(j2) >> 3)) & i2; } i4 += 8; i3 = (i3 + i4) & i2; } } /* JADX WARN: Code restructure failed: missing block: B:10:0x006d, code lost: r20 = r11; r3 = '\b'; */ /* JADX WARN: Code restructure failed: missing block: B:11:0x0079, code lost: if (((((~r7) << 6) & r7) & r20) == 0) goto L61; */ /* JADX WARN: Code restructure failed: missing block: B:12:0x007b, code lost: r2 = m9266(r4); r11 = 255; */ /* JADX WARN: Code restructure failed: missing block: B:13:0x0083, code lost: if (r36.f16354 != 0) goto L16; */ /* JADX WARN: Code restructure failed: missing block: B:15:0x0097, code lost: if (((r36.f16352[r2 >> 3] >> ((r2 & 7) << 3)) & 255) != 254) goto L17; */ /* JADX WARN: Code restructure failed: missing block: B:16:0x0099, code lost: r22 = r9; r28 = 255; r26 = 1; r16 = 128; */ /* JADX WARN: Code restructure failed: missing block: B:17:0x00a5, code lost: r2 = r36.f16353; */ /* JADX WARN: Code restructure failed: missing block: B:18:0x00a7, code lost: if (r2 <= 8) goto L44; */ /* JADX WARN: Code restructure failed: missing block: B:19:0x00a9, code lost: r16 = 128; r22 = r9; r5 = 7; */ /* JADX WARN: Code restructure failed: missing block: B:20:0x00c4, code lost: if (java.lang.Long.compare((((long) r36.f16351) * 32) ^ Long.MIN_VALUE, (((long) r2) * 25) ^ Long.MIN_VALUE) > 0) goto L42; */ /* JADX WARN: Code restructure failed: missing block: B:21:0x00c6, code lost: r2 = r36.f16352; r6 = r36.f16353; r7 = r36.f16349; r8 = r36.f16350; r9 = (r6 + 7) >> 3; r10 = 0; */ /* JADX WARN: Code restructure failed: missing block: B:22:0x00d3, code lost: if (r10 >= r9) goto L65; */ /* JADX WARN: Code restructure failed: missing block: B:23:0x00d5, code lost: r28 = r11; r11 = r2[r10] & r20; r2[r10] = (-72340172838076674L) & ((~r11) + (r11 >>> 7)); r10 = r10 + 1; r14 = r14; r13 = r13; r11 = r28; */ /* JADX WARN: Code restructure failed: missing block: B:24:0x00f3, code lost: r28 = r11; r27 = r13; r26 = r14; r9 = r2.length; r10 = r9 - 1; r9 = r9 - 2; r13 = 72057594037927935L; r2[r9] = (r2[r9] & 72057594037927935L) | (-72057594037927936L); r2[r10] = r2[0]; r9 = 0; */ /* JADX WARN: Code restructure failed: missing block: B:25:0x0111, code lost: if (r9 == r6) goto L66; */ /* JADX WARN: Code restructure failed: missing block: B:26:0x0113, code lost: r10 = r9 >> 3; r20 = (r9 & 7) << 3; r11 = (r2[r10] >> r20) & r28; */ /* JADX WARN: Code restructure failed: missing block: B:27:0x0121, code lost: if (r11 != 128) goto L29; */ /* JADX WARN: Code restructure failed: missing block: B:28:0x0123, code lost: r9 = r9 + 1; */ /* JADX WARN: Code restructure failed: missing block: B:30:0x0128, code lost: if (r11 == 254) goto L67; */ /* JADX WARN: Code restructure failed: missing block: B:32:0x012b, code lost: r11 = r7[r9] * r27; r11 = r11 ^ (r11 << 16); r12 = r11 >>> 7; r21 = m9266(r12); r12 = r12 & r6; r31 = r3; */ /* JADX WARN: Code restructure failed: missing block: B:33:0x0146, code lost: if ((((r21 - r12) & r6) / 8) != (((r9 - r12) & r6) / 8)) goto L68; */ /* JADX WARN: Code restructure failed: missing block: B:34:0x0148, code lost: r2[r10] = (r2[r10] & (~(r28 << r20))) | (((long) (r11 & 127)) << r20); r2[r2.length - 1] = (r2[0] & r13) | Long.MIN_VALUE; r9 = r9 + 1; r5 = r5; r6 = r6; r3 = r31; */ /* JADX WARN: Code restructure failed: missing block: B:35:0x016c, code lost: r3 = r5; r30 = r6; r5 = r21 >> 3; r32 = r2[r5]; r6 = (r21 & 7) << 3; */ /* JADX WARN: Code restructure failed: missing block: B:36:0x017d, code lost: if (((r32 >> r6) & r28) != 128) goto L38; */ /* JADX WARN: Code restructure failed: missing block: B:37:0x017f, code lost: r34 = r13; r2[r5] = (((long) (r11 & 127)) << r6) | (r32 & (~(r28 << r6))); r2[r10] = (r2[r10] & (~(r28 << r20))) | (128 << r20); r7[r21] = r7[r9]; r7[r9] = 0; r8[r21] = r8[r9]; r8[r9] = 0; */ /* JADX WARN: Code restructure failed: missing block: B:38:0x01a5, code lost: r34 = r13; r2[r5] = (((long) (r11 & 127)) << r6) | (r32 & (~(r28 << r6))); r5 = r7[r21]; r7[r21] = r7[r9]; r7[r9] = r5; r5 = r8[r21]; r8[r21] = r8[r9]; r8[r9] = r5; r9 = r9 - 1; */ /* JADX WARN: Code restructure failed: missing block: B:39:0x01c5, code lost: r2[r2.length - 1] = (r2[0] & r34) | Long.MIN_VALUE; r9 = r9 + 1; r5 = r3; r6 = r30; r3 = r31; r13 = r34; */ /* JADX WARN: Code restructure failed: missing block: B:40:0x01db, code lost: r3 = r5; r36.f16354 = defpackage.AbstractC4334.m9324(r36.f16353) - r36.f16351; */ /* JADX WARN: Code restructure failed: missing block: B:42:0x01eb, code lost: r3 = 7; */ /* JADX WARN: Code restructure failed: missing block: B:43:0x01ec, code lost: r28 = 255; r26 = 1; */ /* JADX WARN: Code restructure failed: missing block: B:44:0x01f3, code lost: r22 = r9; r3 = 7; r16 = 128; */ /* JADX WARN: Code restructure failed: missing block: B:45:0x01f9, code lost: r2 = defpackage.AbstractC4334.m9322(r36.f16353); r5 = r36.f16352; r6 = r36.f16349; r7 = r36.f16350; r8 = r36.f16353; m9265(r2); r2 = r36.f16352; r9 = r36.f16349; r10 = r36.f16350; r11 = r36.f16353; r12 = 0; */ /* JADX WARN: Code restructure failed: missing block: B:46:0x0213, code lost: if (r12 >= r8) goto L76; */ /* JADX WARN: Code restructure failed: missing block: B:48:0x0223, code lost: if (((r5[r12 >> 3] >> ((r12 & 7) << 3)) & 255) >= r16) goto L50; */ /* JADX WARN: Code restructure failed: missing block: B:49:0x0225, code lost: r13 = r6[r12]; r14 = r13 * r13; r14 = r14 ^ (r14 << 16); r18 = r3; r3 = m9266(r14 >>> 7); r19 = r2; r1 = r14 & 127; r14 = r3 >> 3; r20 = (r3 & 7) << 3; r1 = (r19[r14] & (~(255 << r20))) | (r1 << r20); r19[r14] = r1; r19[(((r3 - 7) & r11) + (r11 & 7)) >> 3] = r1; r9[r3] = r13; r10[r3] = r7[r12]; */ /* JADX WARN: Code restructure failed: missing block: B:50:0x0261, code lost: r19 = r2; r18 = r3; */ /* JADX WARN: Code restructure failed: missing block: B:51:0x0265, code lost: r12 = r12 + 1; r3 = r18; r2 = r19; */ /* JADX WARN: Code restructure failed: missing block: B:52:0x026e, code lost: r2 = m9266(r4); */ /* JADX WARN: Code restructure failed: missing block: B:53:0x0272, code lost: r36.f16351++; r1 = r36.f16354; r3 = r36.f16352; r4 = r2 >> 3; r5 = r3[r4]; r7 = (r2 & 7) << 3; */ /* JADX WARN: Code restructure failed: missing block: B:54:0x028a, code lost: if (((r5 >> r7) & r28) != r16) goto L56; */ /* JADX WARN: Code restructure failed: missing block: B:55:0x028c, code lost: r15 = r26; */ /* JADX WARN: Code restructure failed: missing block: B:56:0x028e, code lost: r36.f16354 = r1 - r15; r1 = r36.f16353; r5 = (r5 & (~(r28 << r7))) | (r22 << r7); r3[r4] = r5; r3[(((r2 - 7) & r1) + (r1 & 7)) >> 3] = r5; r1 = ~r2; */ /* JADX INFO: renamed from: ᵷᵺʾᵖ, reason: contains not printable characters */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final void m9267(int i, int i2) { int i3; int i4 = i; int i5 = -862048943; int i6 = i4 * (-862048943); int i7 = i6 ^ (i6 << 16); int i8 = i7 >>> 7; int i9 = i7 & 127; int i10 = this.f16353; int i11 = i8 & i10; int i12 = 0; loop0: while (true) { long[] jArr = this.f16352; int i13 = i11 >> 3; int i14 = (i11 & 7) << 3; int i15 = 1; int i16 = i12; int i17 = 0; long j = (((-i14) >> 63) & (jArr[i13 + 1] << (64 - i14))) | (jArr[i13] >>> i14); long j2 = i9; int i18 = i5; int i19 = i9; long j3 = j ^ (j2 * 72340172838076673L); long j4 = -9187201950435737472L; long j5 = (~j3) & (j3 - 72340172838076673L) & (-9187201950435737472L); while (true) { if (j5 == 0) { break; } int iNumberOfTrailingZeros = (i11 + (Long.numberOfTrailingZeros(j5) >> 3)) & i10; long j6 = j4; if (this.f16349[iNumberOfTrailingZeros] == i4) { i3 = iNumberOfTrailingZeros; break loop0; } else { j5 &= j5 - 1; j4 = j6; } } i12 = i16 + 8; i11 = (i11 + i12) & i10; i4 = i; i9 = i19; i5 = i18; } if (i3 < 0) { i3 = ~i3; } this.f16349[i3] = i; this.f16350[i3] = i2; } }