package defpackage; import java.util.Arrays; /* JADX INFO: renamed from: ᵔᵤᴵ, reason: contains not printable characters */ /* JADX INFO: loaded from: classes3.dex */ public final class C2264 { /* JADX INFO: renamed from: ʽˈˋ, reason: contains not printable characters */ public long[] f8929; /* JADX INFO: renamed from: ːˏᵟᵯ, reason: contains not printable characters */ public int f8930; /* JADX INFO: renamed from: ᵨᵣ, reason: contains not printable characters */ public int f8931; /* JADX INFO: renamed from: ᵲᵶᵳˈ, reason: contains not printable characters */ public long[] f8932; /* JADX INFO: renamed from: ᵷᵺʾᵖ, reason: contains not printable characters */ public int f8933; public /* synthetic */ C2264() { this(6); } public C2264(int i) { this.f8932 = AbstractC4334.f16501; this.f8929 = AbstractC4852.f18511; if (i >= 0) { m5883(AbstractC4334.m9325(i)); } else { AbstractC3481.m7945("Capacity must be a positive value."); throw null; } } /* JADX WARN: Removed duplicated region for block: B:25:0x0054 */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final boolean equals(Object obj) { if (obj == this) { return true; } if (!(obj instanceof C2264)) { return false; } C2264 c2264 = (C2264) obj; if (c2264.f8933 != this.f8933) { return false; } long[] jArr = this.f8929; long[] jArr2 = this.f8932; int length = jArr2.length - 2; if (length >= 0) { int i = 0; while (true) { long j = jArr2[i]; if ((((~j) << 7) & j & (-9187201950435737472L)) != -9187201950435737472L) { int i2 = 8 - ((~(i - length)) >>> 31); for (int i3 = 0; i3 < i2; i3++) { if ((255 & j) < 128 && !c2264.m5877(jArr[(i << 3) + i3])) { return false; } j >>= 8; } if (i2 != 8) { break; } if (i == length) { break; } i++; } } } return true; } public final int hashCode() { long[] jArr = this.f8929; long[] jArr2 = this.f8932; int length = jArr2.length - 2; if (length < 0) { return 0; } int i = 0; int i2 = 0; while (true) { long j = jArr2[i]; if ((((~j) << 7) & j & (-9187201950435737472L)) != -9187201950435737472L) { int i3 = 8 - ((~(i - length)) >>> 31); for (int i4 = 0; i4 < i3; i4++) { if ((255 & j) < 128) { long j2 = jArr[(i << 3) + i4]; i2 += (int) (j2 ^ (j2 >>> 32)); } j >>= 8; } if (i3 != 8) { return i2; } } if (i == length) { return i2; } i++; } } public final String toString() { StringBuilder sb = new StringBuilder(); sb.append((CharSequence) "["); long[] jArr = this.f8929; long[] jArr2 = this.f8932; int length = jArr2.length - 2; if (length >= 0) { int i = 0; int i2 = 0; loop0: while (true) { long j = jArr2[i]; if ((((~j) << 7) & j & (-9187201950435737472L)) == -9187201950435737472L) { if (i == length) { break; } i++; } else { int i3 = 8 - ((~(i - length)) >>> 31); int i4 = 0; while (true) { if (i4 >= i3) { if (i3 != 8) { break; } } else { if ((255 & j) < 128) { long j2 = jArr[(i << 3) + i4]; if (i2 != 0) { sb.append((CharSequence) ", "); } if (i2 == -1) { sb.append((CharSequence) "..."); break loop0; } sb.append(j2); i2++; } j >>= 8; i4++; } } } } } sb.append((CharSequence) "]"); return sb.toString(); } /* JADX INFO: renamed from: ʽˈˋ, reason: contains not printable characters */ public final void m5875(C2264 c2264) { long[] jArr = c2264.f8929; long[] jArr2 = c2264.f8932; int length = jArr2.length - 2; if (length < 0) { return; } int i = 0; while (true) { long j = jArr2[i]; if ((((~j) << 7) & j & (-9187201950435737472L)) != -9187201950435737472L) { int i2 = 8 - ((~(i - length)) >>> 31); for (int i3 = 0; i3 < i2; i3++) { if ((255 & j) < 128) { long j2 = jArr[(i << 3) + i3]; this.f8929[m5881(j2)] = j2; } j >>= 8; } if (i2 != 8) { return; } } if (i == length) { return; } else { i++; } } } /* JADX WARN: Code restructure failed: missing block: B:19:0x00a9, code lost: r26 = r4; */ /* JADX WARN: Code restructure failed: missing block: B:20:0x00b3, code lost: if (((r1 & ((~r1) << 6)) & r18) == 0) goto L24; */ /* JADX WARN: Code restructure failed: missing block: B:21:0x00b5, code lost: r9 = -1; */ /* JADX INFO: renamed from: ˊᵫᵗ, reason: contains not printable characters */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final void m5876(C2264 c2264) { long[] jArr; long[] jArr2; long[] jArr3; long[] jArr4; long j; int i; char c; long j2; int iNumberOfTrailingZeros; long[] jArr5 = c2264.f8929; long[] jArr6 = c2264.f8932; int length = jArr6.length - 2; if (length < 0) { return; } int i2 = 0; while (true) { long j3 = jArr6[i2]; char c2 = 7; long j4 = -9187201950435737472L; if ((((~j3) << 7) & j3 & (-9187201950435737472L)) != -9187201950435737472L) { int i3 = 8; int i4 = 8 - ((~(i2 - length)) >>> 31); int i5 = 0; while (i5 < i4) { if ((255 & j3) < 128) { long j5 = jArr5[(i2 << 3) + i5]; c = c2; j2 = j4; int i6 = ((int) (j5 ^ (j5 >>> 32))) * (-862048943); int i7 = i6 ^ (i6 << 16); int i8 = i7 & 127; int i9 = this.f8930; int i10 = (i7 >>> 7) & i9; int i11 = 0; while (true) { long[] jArr7 = this.f8932; int i12 = i10 >> 3; i = i3; int i13 = (i10 & 7) << 3; long j6 = jArr7[i12] >>> i13; long j7 = jArr7[i12 + 1] << (64 - i13); jArr3 = jArr6; long[] jArr8 = jArr5; long j8 = j6 | (j7 & ((-i13) >> 63)); j = j3; long j9 = (((long) i8) * 72340172838076673L) ^ j8; long j10 = (j9 - 72340172838076673L) & (~j9) & j2; while (true) { if (j10 == 0) { break; } iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j10) >> 3) + i10) & i9; jArr4 = jArr8; if (this.f8929[iNumberOfTrailingZeros] == j5) { break; } j10 &= j10 - 1; jArr8 = jArr4; } i11 += 8; i10 = (i10 + i11) & i9; j3 = j; i3 = i; jArr6 = jArr3; jArr5 = jArr4; } if (iNumberOfTrailingZeros >= 0) { m5882(iNumberOfTrailingZeros); } } else { jArr3 = jArr6; jArr4 = jArr5; j = j3; i = i3; c = c2; j2 = j4; } j3 = j >> i; i5++; c2 = c; j4 = j2; i3 = i; jArr6 = jArr3; jArr5 = jArr4; } jArr = jArr6; jArr2 = jArr5; if (i4 != i3) { return; } } else { jArr = jArr6; jArr2 = jArr5; } if (i2 == length) { return; } i2++; jArr6 = jArr; jArr5 = jArr2; } } /* JADX WARN: Code restructure failed: missing block: B:11:0x0069, code lost: if (((r6 & ((~r6) << 6)) & (-9187201950435737472L)) == 0) goto L16; */ /* JADX WARN: Code restructure failed: missing block: B:12:0x006b, code lost: r10 = -1; */ /* JADX INFO: renamed from: ːˏᵟᵯ, reason: contains not printable characters */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final boolean m5877(long j) { int iNumberOfTrailingZeros; int i = ((int) (j ^ (j >>> 32))) * (-862048943); int i2 = i ^ (i << 16); int i3 = i2 & 127; int i4 = this.f8930; int i5 = (i2 >>> 7) & i4; int i6 = 0; loop0: while (true) { long[] jArr = this.f8932; int i7 = i5 >> 3; int i8 = (i5 & 7) << 3; long j2 = ((jArr[i7 + 1] << (64 - i8)) & ((-i8) >> 63)) | (jArr[i7] >>> i8); long j3 = (((long) i3) * 72340172838076673L) ^ j2; long j4 = (~j3) & (j3 - 72340172838076673L) & (-9187201950435737472L); while (true) { if (j4 == 0) { break; } iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j4) >> 3) + i5) & i4; if (this.f8929[iNumberOfTrailingZeros] == j) { break loop0; } j4 &= j4 - 1; } i6 += 8; i5 = (i5 + i6) & i4; } return iNumberOfTrailingZeros >= 0; } /* JADX INFO: renamed from: ᵨᵣ, reason: contains not printable characters */ public final int m5878(int i) { int i2 = this.f8930; int i3 = i & i2; int i4 = 0; while (true) { long[] jArr = this.f8932; 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 INFO: renamed from: ᵲᵶᵳˈ, reason: contains not printable characters */ public final void m5879(long j) { this.f8929[m5881(j)] = j; } /* JADX WARN: Code restructure failed: missing block: B:11:0x0065, code lost: if (((r4 & ((~r4) << 6)) & (-9187201950435737472L)) == 0) goto L16; */ /* JADX WARN: Code restructure failed: missing block: B:12:0x0067, code lost: r10 = -1; */ /* JADX INFO: renamed from: ᵵᵽ, reason: contains not printable characters */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final void m5880(long j) { int iNumberOfTrailingZeros; int i = ((int) ((j >>> 32) ^ j)) * (-862048943); int i2 = i ^ (i << 16); int i3 = i2 & 127; int i4 = this.f8930; int i5 = (i2 >>> 7) & i4; int i6 = 0; loop0: while (true) { long[] jArr = this.f8932; int i7 = i5 >> 3; int i8 = (i5 & 7) << 3; long j2 = ((jArr[i7 + 1] << (64 - i8)) & ((-i8) >> 63)) | (jArr[i7] >>> i8); long j3 = (((long) i3) * 72340172838076673L) ^ j2; long j4 = (~j3) & (j3 - 72340172838076673L) & (-9187201950435737472L); while (true) { if (j4 == 0) { break; } iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j4) >> 3) + i5) & i4; if (this.f8929[iNumberOfTrailingZeros] == j) { break loop0; } else { j4 &= j4 - 1; } } i6 += 8; i5 = (i5 + i6) & i4; } if (iNumberOfTrailingZeros >= 0) { m5882(iNumberOfTrailingZeros); } } /* JADX INFO: renamed from: ᵷᵺʾᵖ, reason: contains not printable characters */ public final int m5881(long j) { long j2; int i; long j3; long[] jArr; long[] jArr2; int i2; long[] jArr3; char c = ' '; int i3 = -862048943; int i4 = ((int) (j ^ (j >>> 32))) * (-862048943); int i5 = i4 ^ (i4 << 16); int i6 = i5 >>> 7; int i7 = i5 & 127; int i8 = this.f8930; int i9 = i6 & i8; int i10 = 0; while (true) { long[] jArr4 = this.f8932; int i11 = i9 >> 3; int i12 = (i9 & 7) << 3; int i13 = 1; int i14 = i10; long j4 = (((-i12) >> 63) & (jArr4[i11 + 1] << (64 - i12))) | (jArr4[i11] >>> i12); long j5 = i7; char c2 = c; int i15 = i7; long j6 = j4 ^ (j5 * 72340172838076673L); long j7 = -9187201950435737472L; long j8 = (~j6) & (j6 - 72340172838076673L) & (-9187201950435737472L); while (j8 != 0) { int iNumberOfTrailingZeros = (i9 + (Long.numberOfTrailingZeros(j8) >> 3)) & i8; int i16 = i3; if (this.f8929[iNumberOfTrailingZeros] == j) { return iNumberOfTrailingZeros; } j8 &= j8 - 1; i3 = i16; } int i17 = i3; if ((((~j4) << 6) & j4 & (-9187201950435737472L)) != 0) { int iM5878 = m5878(i6); long j9 = 255; if (this.f8931 != 0 || ((this.f8932[iM5878 >> 3] >> ((iM5878 & 7) << 3)) & 255) == 254) { j2 = 255; i = 1; j3 = 128; } else { int i18 = this.f8930; if (i18 > 8) { j3 = 128; if (Long.compare((((long) this.f8933) * 32) ^ Long.MIN_VALUE, (((long) i18) * 25) ^ Long.MIN_VALUE) <= 0) { long[] jArr5 = this.f8932; int i19 = this.f8930; long[] jArr6 = this.f8929; int i20 = (i19 + 7) >> 3; int i21 = 0; while (i21 < i20) { long j10 = j9; long j11 = jArr5[i21] & j7; jArr5[i21] = (-72340172838076674L) & ((~j11) + (j11 >>> 7)); i21++; j9 = j10; j7 = -9187201950435737472L; } j2 = j9; int length = jArr5.length; int i22 = length - 1; int i23 = length - 2; long j12 = 72057594037927935L; jArr5[i23] = (jArr5[i23] & 72057594037927935L) | (-72057594037927936L); jArr5[i22] = jArr5[0]; int i24 = 0; while (i24 != i19) { int i25 = i24 >> 3; int i26 = (i24 & 7) << 3; long j13 = (jArr5[i25] >> i26) & j2; if (j13 != 128 && j13 == 254) { long j14 = jArr6[i24]; int i27 = ((int) (j14 ^ (j14 >>> c2))) * i17; int i28 = i27 ^ (i27 << 16); int i29 = i28 >>> 7; int iM58782 = m5878(i29); int i30 = i29 & i19; long j15 = j12; if (((iM58782 - i30) & i19) / 8 == ((i24 - i30) & i19) / 8) { jArr5[i25] = (((long) (i28 & 127)) << i26) | (jArr5[i25] & (~(j2 << i26))); jArr5[jArr5.length - 1] = (jArr5[0] & j15) | Long.MIN_VALUE; i24++; i13 = i13; c2 = c2; j12 = j15; } else { char c3 = c2; int i31 = i13; int i32 = iM58782 >> 3; long j16 = jArr5[i32]; int i33 = (iM58782 & 7) << 3; if (((j16 >> i33) & j2) == 128) { i2 = i19; jArr3 = jArr6; jArr5[i32] = ((~(j2 << i33)) & j16) | (((long) (i28 & 127)) << i33); jArr5[i25] = (jArr5[i25] & (~(j2 << i26))) | (128 << i26); jArr3[iM58782] = jArr3[i24]; jArr3[i24] = 0; } else { i2 = i19; jArr3 = jArr6; jArr5[i32] = (((long) (i28 & 127)) << i33) | ((~(j2 << i33)) & j16); long j17 = jArr3[iM58782]; jArr3[iM58782] = jArr3[i24]; jArr3[i24] = j17; i24--; } jArr5[jArr5.length - 1] = (jArr5[0] & j15) | Long.MIN_VALUE; i24++; i19 = i2; i13 = i31; c2 = c3; j12 = j15; jArr6 = jArr3; } } else { i24++; } } i = i13; this.f8931 = AbstractC4334.m9324(this.f8930) - this.f8933; } iM5878 = m5878(i6); } else { j3 = 128; } j2 = 255; i = 1; int iM9322 = AbstractC4334.m9322(this.f8930); long[] jArr7 = this.f8932; long[] jArr8 = this.f8929; int i34 = this.f8930; m5883(iM9322); long[] jArr9 = this.f8932; long[] jArr10 = this.f8929; int i35 = this.f8930; int i36 = 0; while (i36 < i34) { if (((jArr7[i36 >> 3] >> ((i36 & 7) << 3)) & 255) < j3) { long j18 = jArr8[i36]; int i37 = ((int) ((j18 >>> c2) ^ j18)) * i17; int i38 = i37 ^ (i37 << 16); int iM58783 = m5878(i38 >>> 7); jArr = jArr9; jArr2 = jArr7; long j19 = i38 & 127; int i39 = iM58783 >> 3; int i40 = (iM58783 & 7) << 3; long j20 = (jArr[i39] & (~(255 << i40))) | (j19 << i40); jArr[i39] = j20; jArr[(((iM58783 - 7) & i35) + (i35 & 7)) >> 3] = j20; jArr10[iM58783] = j18; } else { jArr = jArr9; jArr2 = jArr7; } i36++; jArr7 = jArr2; jArr9 = jArr; } iM5878 = m5878(i6); } this.f8933++; int i41 = this.f8931; long[] jArr11 = this.f8932; int i42 = iM5878 >> 3; long j21 = jArr11[i42]; int i43 = (iM5878 & 7) << 3; this.f8931 = i41 - (((j21 >> i43) & j2) == j3 ? i : 0); int i44 = this.f8930; long j22 = (j21 & (~(j2 << i43))) | (j5 << i43); jArr11[i42] = j22; jArr11[(((iM5878 - 7) & i44) + (i44 & 7)) >> 3] = j22; return iM5878; } i10 = i14 + 8; i9 = (i9 + i10) & i8; i7 = i15; i3 = i17; c = c2; } } /* JADX INFO: renamed from: ᵻʽᵯ, reason: contains not printable characters */ public final void m5882(int i) { this.f8933--; long[] jArr = this.f8932; int i2 = this.f8930; int i3 = i >> 3; int i4 = (i & 7) << 3; long j = (jArr[i3] & (~(255 << i4))) | (254 << i4); jArr[i3] = j; jArr[(((i - 7) & i2) + (i2 & 7)) >> 3] = j; } /* JADX INFO: renamed from: ᵻˈᵦʼ, reason: contains not printable characters */ public final void m5883(int i) { long[] jArr; int iMax = i > 0 ? Math.max(7, AbstractC4334.m9323(i)) : 0; this.f8930 = 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.f8932 = jArr; int i3 = iMax >> 3; long j = 255 << ((iMax & 7) << 3); jArr[i3] = (jArr[i3] & (~j)) | j; this.f8931 = AbstractC4334.m9324(this.f8930) - this.f8933; this.f8929 = new long[iMax]; } }