package n; import o.AbstractC2628a; import x4.AbstractC3250p; /* JADX INFO: renamed from: n.A, reason: case insensitive filesystem */ /* JADX INFO: loaded from: classes.dex */ public final class C2566A extends AbstractC2587n { /* JADX INFO: renamed from: f, reason: collision with root package name */ public int f21311f; public C2566A(int i6) { this.f21456a = Y.f21386a; this.f21457b = AbstractC2589p.f21462a; this.f21458c = AbstractC2628a.f21782c; if (i6 >= 0) { f(Y.d(i6)); } else { AbstractC2628a.c("Capacity must be a positive value."); throw null; } } public final void c() { this.f21460e = 0; long[] jArr = this.f21456a; if (jArr != Y.f21386a) { AbstractC3250p.I(jArr, -9187201950435737472L); long[] jArr2 = this.f21456a; int i6 = this.f21459d; int i7 = i6 >> 3; long j4 = 255 << ((i6 & 7) << 3); jArr2[i7] = (jArr2[i7] & (~j4)) | j4; } AbstractC3250p.H(this.f21458c, null, 0, this.f21459d); this.f21311f = Y.a(this.f21459d) - this.f21460e; } public final int d(int i6) { int i7; long j4; long[] jArr; long[] jArr2; long j6; int[] iArr; Object[] objArr; int i8 = -862048943; int iHashCode = Integer.hashCode(i6) * (-862048943); int i9 = iHashCode ^ (iHashCode << 16); int i10 = i9 >>> 7; int i11 = i9 & 127; int i12 = this.f21459d; int i13 = i10 & i12; int i14 = 0; while (true) { long[] jArr3 = this.f21456a; int i15 = i13 >> 3; int i16 = (i13 & 7) << 3; int i17 = 1; long j7 = ((jArr3[i15 + 1] << (64 - i16)) & ((-i16) >> 63)) | (jArr3[i15] >>> i16); long j8 = i11; int i18 = i14; int i19 = 0; long j9 = j7 ^ (j8 * 72340172838076673L); long j10 = -9187201950435737472L; long j11 = (~j9) & (j9 - 72340172838076673L) & (-9187201950435737472L); while (j11 != 0) { int iNumberOfTrailingZeros = (i13 + (Long.numberOfTrailingZeros(j11) >> 3)) & i12; int i20 = i8; int i21 = i19; if (this.f21457b[iNumberOfTrailingZeros] == i6) { return iNumberOfTrailingZeros; } j11 &= j11 - 1; i8 = i20; i19 = i21; } int i22 = i8; int i23 = i19; char c6 = '\b'; if ((((~j7) << 6) & j7 & (-9187201950435737472L)) != 0) { int iE = e(i10); if (this.f21311f != 0 || ((this.f21456a[iE >> 3] >> ((iE & 7) << 3)) & 255) == 254) { i7 = 1; j4 = 128; } else { int i24 = this.f21459d; if (i24 <= 8 || Long.compare((((long) this.f21460e) * 32) ^ Long.MIN_VALUE, (((long) i24) * 25) ^ Long.MIN_VALUE) > 0) { i7 = 1; j4 = 128; int iB = Y.b(this.f21459d); long[] jArr4 = this.f21456a; int[] iArr2 = this.f21457b; Object[] objArr2 = this.f21458c; int i25 = this.f21459d; f(iB); long[] jArr5 = this.f21456a; int[] iArr3 = this.f21457b; Object[] objArr3 = this.f21458c; int i26 = this.f21459d; int i27 = i23; while (i27 < i25) { if (((jArr4[i27 >> 3] >> ((i27 & 7) << 3)) & 255) < 128) { int i28 = iArr2[i27]; int iHashCode2 = Integer.hashCode(i28) * i22; int i29 = iHashCode2 ^ (iHashCode2 << 16); int iE2 = e(i29 >>> 7); jArr = jArr5; jArr2 = jArr4; long j12 = i29 & 127; int i30 = iE2 >> 3; int i31 = (iE2 & 7) << 3; long j13 = (jArr[i30] & (~(255 << i31))) | (j12 << i31); jArr[i30] = j13; jArr[(((iE2 - 7) & i26) + (i26 & 7)) >> 3] = j13; iArr3[iE2] = i28; objArr3[iE2] = objArr2[i27]; } else { jArr = jArr5; jArr2 = jArr4; } i27++; jArr4 = jArr2; jArr5 = jArr; } } else { long[] jArr6 = this.f21456a; int i32 = this.f21459d; int[] iArr4 = this.f21457b; Object[] objArr4 = this.f21458c; int i33 = (i32 + 7) >> 3; int i34 = i23; while (i34 < i33) { char c7 = c6; long j14 = jArr6[i34] & j10; jArr6[i34] = (-72340172838076674L) & ((~j14) + (j14 >>> 7)); i34++; i17 = i17; c6 = c7; j10 = -9187201950435737472L; } int i35 = i17; j4 = 128; int iN = AbstractC3250p.N(jArr6); int i36 = iN - 1; long j15 = 72057594037927935L; jArr6[i36] = (jArr6[i36] & 72057594037927935L) | (-72057594037927936L); jArr6[iN] = jArr6[i23]; int i37 = i23; while (i37 != i32) { int i38 = i37 >> 3; int i39 = (i37 & 7) << 3; long j16 = (jArr6[i38] >> i39) & 255; if (j16 != 128 && j16 == 254) { int iHashCode3 = Integer.hashCode(iArr4[i37]) * i22; int i40 = iHashCode3 ^ (iHashCode3 << 16); int i41 = i40 >>> 7; int iE3 = e(i41); int i42 = i41 & i32; int i43 = i35; if (((iE3 - i42) & i32) / 8 == ((i37 - i42) & i32) / 8) { j6 = j15; jArr6[i38] = (((long) (i40 & 127)) << i39) | (jArr6[i38] & (~(255 << i39))); jArr6[jArr6.length - 1] = (jArr6[i23] & j6) | Long.MIN_VALUE; i37++; i35 = i43; } else { j6 = j15; int i44 = iE3 >> 3; long j17 = jArr6[i44]; int i45 = (iE3 & 7) << 3; if (((j17 >> i45) & 255) == 128) { iArr = iArr4; objArr = objArr4; jArr6[i44] = ((~(255 << i45)) & j17) | (((long) (i40 & 127)) << i45); jArr6[i38] = (jArr6[i38] & (~(255 << i39))) | (128 << i39); iArr[iE3] = iArr[i37]; iArr[i37] = i23; objArr[iE3] = objArr[i37]; objArr[i37] = null; } else { iArr = iArr4; objArr = objArr4; jArr6[i44] = ((~(255 << i45)) & j17) | (((long) (i40 & 127)) << i45); int i46 = iArr[iE3]; iArr[iE3] = iArr[i37]; iArr[i37] = i46; Object obj = objArr[iE3]; objArr[iE3] = objArr[i37]; objArr[i37] = obj; i37--; } jArr6[jArr6.length - 1] = (jArr6[i23] & j6) | Long.MIN_VALUE; i37++; iArr4 = iArr; i35 = i43; objArr4 = objArr; } j15 = j6; } else { i37++; } } i7 = i35; this.f21311f = Y.a(this.f21459d) - this.f21460e; } iE = e(i10); } this.f21460e++; int i47 = this.f21311f; long[] jArr7 = this.f21456a; int i48 = iE >> 3; long j18 = jArr7[i48]; int i49 = (iE & 7) << 3; if (((j18 >> i49) & 255) == j4) { i23 = i7; } this.f21311f = i47 - i23; int i50 = this.f21459d; long j19 = (j18 & (~(255 << i49))) | (j8 << i49); jArr7[i48] = j19; jArr7[(((iE - 7) & i50) + (i50 & 7)) >> 3] = j19; return iE; } i14 = i18 + 8; i13 = (i13 + i14) & i12; i8 = i22; } } public final int e(int i6) { int i7 = this.f21459d; int i8 = i6 & i7; int i9 = 0; while (true) { long[] jArr = this.f21456a; 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 f(int i6) { long[] jArr; int iMax = i6 > 0 ? Math.max(7, Y.c(i6)) : 0; this.f21459d = iMax; if (iMax == 0) { jArr = Y.f21386a; } else { jArr = new long[((iMax + 15) & (-8)) >> 3]; AbstractC3250p.I(jArr, -9187201950435737472L); } this.f21456a = jArr; int i7 = iMax >> 3; long j4 = 255 << ((iMax & 7) << 3); jArr[i7] = (jArr[i7] & (~j4)) | j4; this.f21311f = Y.a(this.f21459d) - this.f21460e; this.f21457b = new int[iMax]; this.f21458c = new Object[iMax]; } /* JADX WARN: Code restructure failed: missing block: B:11:0x0061, code lost: if (((r4 & ((~r4) << 6)) & (-9187201950435737472L)) == 0) goto L18; */ /* JADX WARN: Code restructure failed: missing block: B:12:0x0063, code lost: r10 = -1; */ /* Code decompiled incorrectly, please refer to instructions dump. */ public final Object g(int i6) { int iNumberOfTrailingZeros; int iHashCode = Integer.hashCode(i6) * (-862048943); int i7 = iHashCode ^ (iHashCode << 16); int i8 = i7 & 127; int i9 = this.f21459d; int i10 = (i7 >>> 7) & i9; int i11 = 0; loop0: while (true) { long[] jArr = this.f21456a; 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.f21457b[iNumberOfTrailingZeros] == i6) { break loop0; } j7 &= j7 - 1; } i11 += 8; i10 = (i10 + i11) & i9; } if (iNumberOfTrailingZeros >= 0) { return h(iNumberOfTrailingZeros); } return null; } public final Object h(int i6) { this.f21460e--; long[] jArr = this.f21456a; int i7 = this.f21459d; 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; Object[] objArr = this.f21458c; Object obj = objArr[i6]; objArr[i6] = null; return obj; } public final void i(int i6, Object obj) { int iD = d(i6); this.f21457b[iD] = i6; this.f21458c[iD] = obj; } public /* synthetic */ C2566A() { this(6); } }