package defpackage;

import java.util.Arrays;

/* JADX INFO: renamed from: ᵶᵥ, reason: contains not printable characters */
/* JADX INFO: loaded from: classes3.dex */
public final class C4835 {

    /* JADX INFO: renamed from: ᵨᵣ, reason: contains not printable characters */
    public int f18432;

    /* JADX INFO: renamed from: ᵷᵺʾᵖ, reason: contains not printable characters */
    public int f18434;

    /* JADX INFO: renamed from: ᵻˈᵦʼ, reason: contains not printable characters */
    public int f18435;

    /* JADX INFO: renamed from: ᵲᵶᵳˈ, reason: contains not printable characters */
    public long[] f18433 = AbstractC4334.f16501;

    /* JADX INFO: renamed from: ʽˈˋ, reason: contains not printable characters */
    public int[] f18430 = AbstractC2282.f8981;

    /* JADX INFO: renamed from: ːˏᵟᵯ, reason: contains not printable characters */
    public Object[] f18431 = ᵣˉ.ʽˈˋ;

    public C4835(int i) {
        if (i >= 0) {
            m10080(AbstractC4334.m9325(i));
        } else {
            AbstractC3481.m7945("Capacity must be a positive value.");
            throw null;
        }
    }

    /* JADX WARN: Code restructure failed: missing block: B:33:0x00d1, code lost:
    
        if (((r3 & ((~r3) << 6)) & r19) == 0) goto L37;
     */
    /* JADX WARN: Code restructure failed: missing block: B:34:0x00d3, code lost:
    
        r0 = -1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:38:0x00e2, code lost:
    
        return r18;
     */
    /* JADX WARN: Multi-variable type inference failed */
    /* JADX WARN: Type inference failed for: r14v0 */
    /* JADX WARN: Type inference failed for: r14v1, types: [int] */
    /* JADX WARN: Type inference failed for: r14v3 */
    /* JADX WARN: Type inference failed for: r15v0 */
    /* JADX WARN: Type inference failed for: r15v1, types: [int] */
    /* JADX WARN: Type inference failed for: r15v3 */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean equals(Object obj) {
        long[] jArr;
        boolean z;
        int[] iArr;
        boolean z2;
        long[] jArr2;
        boolean z3;
        boolean z4;
        long j;
        int i;
        char c;
        long j2;
        int[] iArr2;
        int i2;
        boolean z5 = true;
        if (obj == this) {
            return true;
        }
        boolean z6 = false;
        if (!(obj instanceof C4835)) {
            return false;
        }
        C4835 c4835 = (C4835) obj;
        if (c4835.f18432 != this.f18432) {
            return false;
        }
        int[] iArr3 = this.f18430;
        Object[] objArr = this.f18431;
        long[] jArr3 = this.f18433;
        int length = jArr3.length - 2;
        if (length < 0) {
            return true;
        }
        int i3 = 0;
        loop0: while (true) {
            long j3 = jArr3[i3];
            char c2 = 7;
            long j4 = -9187201950435737472L;
            if ((((~j3) << 7) & j3 & (-9187201950435737472L)) != -9187201950435737472L) {
                int i4 = 8;
                int i5 = 8 - ((~(i3 - length)) >>> 31);
                for (?? r15 = z6; r15 < i5; r15++) {
                    if ((j3 & 255) < 128) {
                        int i6 = (i3 << 3) + r15;
                        z3 = z5;
                        int i7 = iArr3[i6];
                        z4 = z6;
                        Object obj2 = objArr[i6];
                        if (obj2 == null) {
                            if (c4835.m10079(i7) != null) {
                                break loop0;
                            }
                            int i8 = (-862048943) * i7;
                            int i9 = i8 ^ (i8 << 16);
                            c = c2;
                            int i10 = i9 & 127;
                            j2 = j4;
                            int i11 = c4835.f18434;
                            int i12 = (i9 >>> 7) & i11;
                            i = i4;
                            ?? r14 = z4;
                            while (true) {
                                long[] jArr4 = c4835.f18433;
                                int i13 = i12 >> 3;
                                jArr2 = jArr3;
                                int i14 = (i12 & 7) << 3;
                                long j5 = jArr4[i13] >>> i14;
                                long j6 = jArr4[i13 + 1] << (64 - i14);
                                iArr2 = iArr3;
                                int i15 = i12;
                                long j7 = j5 | (j6 & ((-i14) >> 63));
                                j = j3;
                                long j8 = (((long) i10) * 72340172838076673L) ^ j7;
                                long j9 = (j8 - 72340172838076673L) & (~j8) & j2;
                                while (true) {
                                    if (j9 == 0) {
                                        break;
                                    }
                                    int iNumberOfTrailingZeros = (i15 + (Long.numberOfTrailingZeros(j9) >> 3)) & i11;
                                    if (c4835.f18430[iNumberOfTrailingZeros] == i7) {
                                        i2 = iNumberOfTrailingZeros;
                                        break;
                                    }
                                    j9 &= j9 - 1;
                                }
                                int i16 = r14 + 8;
                                i12 = (i15 + i16) & i11;
                                iArr3 = iArr2;
                                jArr3 = jArr2;
                                j3 = j;
                                r14 = i16;
                            }
                            if (i2 < 0) {
                                break loop0;
                            }
                        } else {
                            jArr2 = jArr3;
                            j = j3;
                            i = i4;
                            c = c2;
                            j2 = j4;
                            iArr2 = iArr3;
                            if (!obj2.equals(c4835.m10079(i7))) {
                                return z4;
                            }
                        }
                    } else {
                        jArr2 = jArr3;
                        z3 = z5;
                        z4 = z6;
                        j = j3;
                        i = i4;
                        c = c2;
                        j2 = j4;
                        iArr2 = iArr3;
                    }
                    j3 = j >> i;
                    c2 = c;
                    iArr3 = iArr2;
                    z5 = z3;
                    z6 = z4;
                    j4 = j2;
                    jArr3 = jArr2;
                    i4 = i;
                }
                jArr = jArr3;
                z = z5;
                z2 = z6;
                int i17 = i4;
                iArr = iArr3;
                if (i5 != i17) {
                    return z;
                }
            } else {
                jArr = jArr3;
                z = z5;
                iArr = iArr3;
                z2 = z6;
            }
            if (i3 == length) {
                return z;
            }
            i3++;
            iArr3 = iArr;
            z5 = z;
            z6 = z2;
            jArr3 = jArr;
        }
    }

    public final int hashCode() {
        int[] iArr = this.f18430;
        Object[] objArr = this.f18431;
        long[] jArr = this.f18433;
        int length = jArr.length - 2;
        if (length < 0) {
            return 0;
        }
        int i = 0;
        int iHashCode = 0;
        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];
                        Object obj = objArr[i4];
                        iHashCode += (obj != null ? obj.hashCode() : 0) ^ i5;
                    }
                    j >>= 8;
                }
                if (i2 != 8) {
                    return iHashCode;
                }
            }
            if (i == length) {
                return iHashCode;
            }
            i++;
        }
    }

    /* JADX WARN: Removed duplicated region for block: B:23:0x006a A[PHI: r8
      0x006a: PHI (r8v2 int) = (r8v1 int), (r8v3 int) binds: [B:10:0x002c, B:22:0x0068] A[DONT_GENERATE, DONT_INLINE]] */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final String toString() {
        if (this.f18432 == 0) {
            return "{}";
        }
        StringBuilder sb = new StringBuilder("{");
        int[] iArr = this.f18430;
        Object[] objArr = this.f18431;
        long[] jArr = this.f18433;
        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];
                            Object obj = objArr[i5];
                            sb.append(i6);
                            sb.append("=");
                            if (obj == this) {
                                obj = "(this)";
                            }
                            sb.append(obj);
                            i2++;
                            if (i2 < this.f18432) {
                                sb.append(", ");
                            }
                        }
                        j >>= 8;
                    }
                    if (i3 != 8) {
                        break;
                    }
                    if (i == length) {
                        break;
                    }
                    i++;
                }
            }
        }
        sb.append('}');
        return sb.toString();
    }

    /* JADX WARN: Code restructure failed: missing block: B:11:0x005d, code lost:
    
        if (((r4 & ((~r4) << 6)) & (-9187201950435737472L)) == 0) goto L18;
     */
    /* JADX WARN: Code restructure failed: missing block: B:12:0x005f, code lost:
    
        r10 = -1;
     */
    /* JADX INFO: renamed from: ʽˈˋ, reason: contains not printable characters */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final Object m10079(int i) {
        int iNumberOfTrailingZeros;
        int i2 = (-862048943) * i;
        int i3 = i2 ^ (i2 << 16);
        int i4 = i3 & 127;
        int i5 = this.f18434;
        int i6 = (i3 >>> 7) & i5;
        int i7 = 0;
        loop0: while (true) {
            long[] jArr = this.f18433;
            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;
            long j3 = (~j2) & (j2 - 72340172838076673L) & (-9187201950435737472L);
            while (true) {
                if (j3 == 0) {
                    break;
                }
                iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j3) >> 3) + i6) & i5;
                if (this.f18430[iNumberOfTrailingZeros] == i) {
                    break loop0;
                }
                j3 &= j3 - 1;
            }
            i7 += 8;
            i6 = (i6 + i7) & i5;
        }
        if (iNumberOfTrailingZeros >= 0) {
            return this.f18431[iNumberOfTrailingZeros];
        }
        return null;
    }

    /* JADX INFO: renamed from: ːˏᵟᵯ, reason: contains not printable characters */
    public final void m10080(int i) {
        long[] jArr;
        int iMax = i > 0 ? Math.max(7, AbstractC4334.m9323(i)) : 0;
        this.f18434 = 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.f18433 = jArr;
        int i3 = iMax >> 3;
        long j = 255 << ((iMax & 7) << 3);
        jArr[i3] = (jArr[i3] & (~j)) | j;
        this.f18435 = AbstractC4334.m9324(this.f18434) - this.f18432;
        this.f18430 = new int[iMax];
        this.f18431 = new Object[iMax];
    }

    /* JADX WARN: Code restructure failed: missing block: B:10:0x006b, code lost:
    
        r20 = r11;
        r3 = '\b';
     */
    /* JADX WARN: Code restructure failed: missing block: B:11:0x0077, code lost:
    
        if (((((~r7) << 6) & r7) & r20) == 0) goto L60;
     */
    /* JADX WARN: Code restructure failed: missing block: B:12:0x0079, code lost:
    
        r2 = m10082(r4);
        r11 = 255;
     */
    /* JADX WARN: Code restructure failed: missing block: B:13:0x0081, code lost:
    
        if (r36.f18435 != 0) goto L16;
     */
    /* JADX WARN: Code restructure failed: missing block: B:15:0x0095, code lost:
    
        if (((r36.f18433[r2 >> 3] >> ((r2 & 7) << 3)) & 255) != 254) goto L17;
     */
    /* JADX WARN: Code restructure failed: missing block: B:16:0x0097, code lost:
    
        r22 = r9;
        r28 = 255;
        r26 = 1;
        r16 = 128;
     */
    /* JADX WARN: Code restructure failed: missing block: B:17:0x00a3, code lost:
    
        r2 = r36.f18434;
     */
    /* JADX WARN: Code restructure failed: missing block: B:18:0x00a5, code lost:
    
        if (r2 <= 8) goto L44;
     */
    /* JADX WARN: Code restructure failed: missing block: B:19:0x00a7, code lost:
    
        r16 = 128;
        r22 = r9;
        r5 = 7;
     */
    /* JADX WARN: Code restructure failed: missing block: B:20:0x00c2, code lost:
    
        if (java.lang.Long.compare((((long) r36.f18432) * 32) ^ Long.MIN_VALUE, (((long) r2) * 25) ^ Long.MIN_VALUE) > 0) goto L42;
     */
    /* JADX WARN: Code restructure failed: missing block: B:21:0x00c4, code lost:
    
        r2 = r36.f18433;
        r6 = r36.f18434;
        r7 = r36.f18430;
        r8 = r36.f18431;
        r9 = (r6 + 7) >> 3;
        r10 = 0;
     */
    /* JADX WARN: Code restructure failed: missing block: B:22:0x00d1, code lost:
    
        if (r10 >= r9) goto L64;
     */
    /* JADX WARN: Code restructure failed: missing block: B:23:0x00d3, 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:0x00f1, 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:0x010f, code lost:
    
        if (r9 == r6) goto L65;
     */
    /* JADX WARN: Code restructure failed: missing block: B:26:0x0111, code lost:
    
        r10 = r9 >> 3;
        r20 = (r9 & 7) << 3;
        r11 = (r2[r10] >> r20) & r28;
     */
    /* JADX WARN: Code restructure failed: missing block: B:27:0x011f, code lost:
    
        if (r11 != 128) goto L29;
     */
    /* JADX WARN: Code restructure failed: missing block: B:28:0x0121, code lost:
    
        r9 = r9 + 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:30:0x0126, code lost:
    
        if (r11 == 254) goto L66;
     */
    /* JADX WARN: Code restructure failed: missing block: B:32:0x0129, code lost:
    
        r11 = r7[r9] * r27;
        r11 = r11 ^ (r11 << 16);
        r12 = r11 >>> 7;
        r21 = m10082(r12);
        r12 = r12 & r6;
        r31 = r3;
     */
    /* JADX WARN: Code restructure failed: missing block: B:33:0x0144, code lost:
    
        if ((((r21 - r12) & r6) / 8) != (((r9 - r12) & r6) / 8)) goto L67;
     */
    /* JADX WARN: Code restructure failed: missing block: B:34:0x0146, 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:0x016a, 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:0x017b, code lost:
    
        if (((r32 >> r6) & r28) != 128) goto L38;
     */
    /* JADX WARN: Code restructure failed: missing block: B:37:0x017d, 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] = null;
     */
    /* JADX WARN: Code restructure failed: missing block: B:38:0x01a4, 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:0x01c4, 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:0x01da, code lost:
    
        r3 = r5;
        r36.f18435 = defpackage.AbstractC4334.m9324(r36.f18434) - r36.f18432;
     */
    /* JADX WARN: Code restructure failed: missing block: B:42:0x01ea, code lost:
    
        r3 = 7;
     */
    /* JADX WARN: Code restructure failed: missing block: B:43:0x01eb, code lost:
    
        r28 = 255;
        r26 = 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:44:0x01f2, code lost:
    
        r22 = r9;
        r3 = 7;
        r16 = 128;
     */
    /* JADX WARN: Code restructure failed: missing block: B:45:0x01f8, code lost:
    
        r2 = defpackage.AbstractC4334.m9322(r36.f18434);
        r5 = r36.f18433;
        r6 = r36.f18430;
        r7 = r36.f18431;
        r8 = r36.f18434;
        m10080(r2);
        r2 = r36.f18433;
        r9 = r36.f18430;
        r10 = r36.f18431;
        r11 = r36.f18434;
        r12 = 0;
     */
    /* JADX WARN: Code restructure failed: missing block: B:46:0x0212, code lost:
    
        if (r12 >= r8) goto L75;
     */
    /* JADX WARN: Code restructure failed: missing block: B:48:0x0222, code lost:
    
        if (((r5[r12 >> 3] >> ((r12 & 7) << 3)) & 255) >= r16) goto L50;
     */
    /* JADX WARN: Code restructure failed: missing block: B:49:0x0224, code lost:
    
        r13 = r6[r12];
        r14 = r13 * r13;
        r14 = r14 ^ (r14 << 16);
        r18 = r3;
        r3 = m10082(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:0x0260, code lost:
    
        r19 = r2;
        r18 = r3;
     */
    /* JADX WARN: Code restructure failed: missing block: B:51:0x0264, code lost:
    
        r12 = r12 + 1;
        r3 = r18;
        r2 = r19;
     */
    /* JADX WARN: Code restructure failed: missing block: B:52:0x026d, code lost:
    
        r1 = m10082(r4);
     */
    /* JADX WARN: Code restructure failed: missing block: B:53:0x0272, code lost:
    
        r1 = r2;
     */
    /* JADX WARN: Code restructure failed: missing block: B:54:0x0273, code lost:
    
        r36.f18432++;
        r2 = r36.f18435;
        r3 = r36.f18433;
        r4 = r1 >> 3;
        r5 = r3[r4];
        r7 = (r1 & 7) << 3;
     */
    /* JADX WARN: Code restructure failed: missing block: B:55:0x028b, code lost:
    
        if (((r5 >> r7) & r28) != r16) goto L57;
     */
    /* JADX WARN: Code restructure failed: missing block: B:56:0x028d, code lost:
    
        r15 = r26;
     */
    /* JADX WARN: Code restructure failed: missing block: B:57:0x028f, code lost:
    
        r36.f18435 = r2 - r15;
        r2 = r36.f18434;
        r5 = (r5 & (~(r28 << r7))) | (r22 << r7);
        r3[r4] = r5;
        r3[(((r1 - 7) & r2) + (r2 & 7)) >> 3] = r5;
        r17 = r1;
     */
    /* JADX INFO: renamed from: ᵨᵣ, reason: contains not printable characters */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final void m10081(int i, Object obj) {
        int iNumberOfTrailingZeros;
        int i2 = i;
        int i3 = -862048943;
        int i4 = i2 * (-862048943);
        int i5 = i4 ^ (i4 << 16);
        int i6 = i5 >>> 7;
        int i7 = i5 & 127;
        int i8 = this.f18434;
        int i9 = i6 & i8;
        int i10 = 0;
        loop0: while (true) {
            long[] jArr = this.f18433;
            int i11 = i9 >> 3;
            int i12 = (i9 & 7) << 3;
            int i13 = 1;
            int i14 = i10;
            int i15 = 0;
            long j = (((-i12) >> 63) & (jArr[i11 + 1] << (64 - i12))) | (jArr[i11] >>> i12);
            long j2 = i7;
            int i16 = i3;
            int i17 = i7;
            long j3 = j ^ (j2 * 72340172838076673L);
            long j4 = -9187201950435737472L;
            long j5 = (~j3) & (j3 - 72340172838076673L) & (-9187201950435737472L);
            while (true) {
                if (j5 == 0) {
                    break;
                }
                iNumberOfTrailingZeros = (i9 + (Long.numberOfTrailingZeros(j5) >> 3)) & i8;
                long j6 = j4;
                if (this.f18430[iNumberOfTrailingZeros] == i2) {
                    break loop0;
                }
                j5 &= j5 - 1;
                j4 = j6;
            }
            i10 = i14 + 8;
            i9 = (i9 + i10) & i8;
            i2 = i;
            i7 = i17;
            i3 = i16;
        }
        this.f18430[iNumberOfTrailingZeros] = i;
        this.f18431[iNumberOfTrailingZeros] = obj;
    }

    /* JADX INFO: renamed from: ᵲᵶᵳˈ, reason: contains not printable characters */
    public final int m10082(int i) {
        int i2 = this.f18434;
        int i3 = i & i2;
        int i4 = 0;
        while (true) {
            long[] jArr = this.f18433;
            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:11:0x005d, code lost:
    
        if (((r4 & ((~r4) << 6)) & (-9187201950435737472L)) == 0) goto L18;
     */
    /* JADX WARN: Code restructure failed: missing block: B:12:0x005f, code lost:
    
        r10 = -1;
     */
    /* JADX INFO: renamed from: ᵷᵺʾᵖ, reason: contains not printable characters */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final Object m10083(int i) {
        int iNumberOfTrailingZeros;
        int i2 = (-862048943) * i;
        int i3 = i2 ^ (i2 << 16);
        int i4 = i3 & 127;
        int i5 = this.f18434;
        int i6 = (i3 >>> 7) & i5;
        int i7 = 0;
        loop0: while (true) {
            long[] jArr = this.f18433;
            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;
            long j3 = (~j2) & (j2 - 72340172838076673L) & (-9187201950435737472L);
            while (true) {
                if (j3 == 0) {
                    break;
                }
                iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j3) >> 3) + i6) & i5;
                if (this.f18430[iNumberOfTrailingZeros] == i) {
                    break loop0;
                }
                j3 &= j3 - 1;
            }
            i7 += 8;
            i6 = (i6 + i7) & i5;
        }
        if (iNumberOfTrailingZeros < 0) {
            return null;
        }
        this.f18432--;
        long[] jArr2 = this.f18433;
        int i10 = this.f18434;
        int i11 = iNumberOfTrailingZeros >> 3;
        int i12 = (iNumberOfTrailingZeros & 7) << 3;
        long j4 = (jArr2[i11] & (~(255 << i12))) | (254 << i12);
        jArr2[i11] = j4;
        jArr2[(((iNumberOfTrailingZeros - 7) & i10) + (i10 & 7)) >> 3] = j4;
        Object[] objArr = this.f18431;
        Object obj = objArr[iNumberOfTrailingZeros];
        objArr[iNumberOfTrailingZeros] = null;
        return obj;
    }
}
