package defpackage;

import java.util.Arrays;

/* JADX INFO: renamed from: ʾˀᵙ, reason: contains not printable characters */
/* JADX INFO: loaded from: classes3.dex */
public final class C0226 {

    /* JADX INFO: renamed from: ʽˈˋ, reason: contains not printable characters */
    public long[] f1729;

    /* JADX INFO: renamed from: ːˏᵟᵯ, reason: contains not printable characters */
    public Object[] f1730;

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

    /* JADX INFO: renamed from: ᵲᵶᵳˈ, reason: contains not printable characters */
    public long[] f1732;

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

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

    public /* synthetic */ C0226() {
        this(6);
    }

    public C0226(int i) {
        this.f1732 = AbstractC4334.f16501;
        this.f1729 = AbstractC4852.f18511;
        this.f1730 = ᵣˉ.ʽˈˋ;
        if (i >= 0) {
            m1399(AbstractC4334.m9325(i));
        } else {
            AbstractC3481.m7945("Capacity must be a positive value.");
            throw null;
        }
    }

    /* JADX WARN: Code restructure failed: missing block: B:33:0x00db, code lost:
    
        if (((r4 & ((~r4) << 6)) & r22) == 0) goto L37;
     */
    /* JADX WARN: Code restructure failed: missing block: B:34:0x00dd, code lost:
    
        r0 = -1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:38:0x00ec, code lost:
    
        return r19;
     */
    /* 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;
        long[] jArr2;
        boolean z2;
        Object[] objArr;
        long[] jArr3;
        boolean z3;
        long[] jArr4;
        boolean z4;
        long j;
        int i;
        char c;
        long j2;
        Object[] objArr2;
        int i2;
        boolean z5 = true;
        if (obj == this) {
            return true;
        }
        boolean z6 = false;
        if (!(obj instanceof C0226)) {
            return false;
        }
        C0226 c0226 = (C0226) obj;
        if (c0226.f1731 != this.f1731) {
            return false;
        }
        long[] jArr5 = this.f1729;
        Object[] objArr3 = this.f1730;
        long[] jArr6 = this.f1732;
        int length = jArr6.length - 2;
        if (length < 0) {
            return true;
        }
        int i3 = 0;
        loop0: while (true) {
            long j3 = jArr6[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;
                        jArr4 = jArr5;
                        long j5 = jArr4[i6];
                        z4 = z6;
                        Object obj2 = objArr3[i6];
                        if (obj2 == null) {
                            if (c0226.m1398(j5) != null) {
                                break loop0;
                            }
                            c = c2;
                            j2 = j4;
                            int i7 = ((int) (j5 ^ (j5 >>> 32))) * (-862048943);
                            int i8 = i7 ^ (i7 << 16);
                            int i9 = i8 & 127;
                            int i10 = c0226.f1733;
                            int i11 = (i8 >>> 7) & i10;
                            i = i4;
                            ?? r14 = z4;
                            while (true) {
                                long[] jArr7 = c0226.f1732;
                                int i12 = i11 >> 3;
                                jArr3 = jArr6;
                                int i13 = (i11 & 7) << 3;
                                long j6 = jArr7[i12] >>> i13;
                                long j7 = jArr7[i12 + 1] << (64 - i13);
                                int i14 = i11;
                                objArr2 = objArr3;
                                long j8 = j6 | (j7 & ((-i13) >> 63));
                                j = j3;
                                long j9 = (((long) i9) * 72340172838076673L) ^ j8;
                                long j10 = (j9 - 72340172838076673L) & (~j9) & j2;
                                while (true) {
                                    if (j10 == 0) {
                                        break;
                                    }
                                    int iNumberOfTrailingZeros = (i14 + (Long.numberOfTrailingZeros(j10) >> 3)) & i10;
                                    if (c0226.f1729[iNumberOfTrailingZeros] == j5) {
                                        i2 = iNumberOfTrailingZeros;
                                        break;
                                    }
                                    j10 &= j10 - 1;
                                }
                                int i15 = r14 + 8;
                                i11 = (i14 + i15) & i10;
                                objArr3 = objArr2;
                                jArr6 = jArr3;
                                j3 = j;
                                r14 = i15;
                            }
                            if (i2 < 0) {
                                break loop0;
                            }
                        } else {
                            jArr3 = jArr6;
                            j = j3;
                            i = i4;
                            c = c2;
                            j2 = j4;
                            objArr2 = objArr3;
                            if (!obj2.equals(c0226.m1398(j5))) {
                                return z4;
                            }
                        }
                    } else {
                        jArr3 = jArr6;
                        z3 = z5;
                        jArr4 = jArr5;
                        z4 = z6;
                        j = j3;
                        i = i4;
                        c = c2;
                        j2 = j4;
                        objArr2 = objArr3;
                    }
                    j3 = j >> i;
                    c2 = c;
                    objArr3 = objArr2;
                    z5 = z3;
                    jArr5 = jArr4;
                    z6 = z4;
                    jArr6 = jArr3;
                    j4 = j2;
                    i4 = i;
                }
                jArr = jArr6;
                z = z5;
                jArr2 = jArr5;
                z2 = z6;
                int i16 = i4;
                objArr = objArr3;
                if (i5 != i16) {
                    return z;
                }
            } else {
                jArr = jArr6;
                z = z5;
                jArr2 = jArr5;
                z2 = z6;
                objArr = objArr3;
            }
            if (i3 == length) {
                return z;
            }
            i3++;
            objArr3 = objArr;
            z5 = z;
            jArr5 = jArr2;
            z6 = z2;
            jArr6 = jArr;
        }
    }

    public final int hashCode() {
        long[] jArr = this.f1729;
        Object[] objArr = this.f1730;
        long[] jArr2 = this.f1732;
        int length = jArr2.length - 2;
        if (length < 0) {
            return 0;
        }
        int i = 0;
        int iHashCode = 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) {
                        int i4 = (i << 3) + i3;
                        long j2 = jArr[i4];
                        Object obj = objArr[i4];
                        iHashCode += (obj != null ? obj.hashCode() : 0) ^ ((int) (j2 ^ (j2 >>> 32)));
                    }
                    j >>= 8;
                }
                if (i2 != 8) {
                    return iHashCode;
                }
            }
            if (i == length) {
                return iHashCode;
            }
            i++;
        }
    }

    public final String toString() {
        int i;
        int i2;
        if (this.f1731 == 0) {
            return "{}";
        }
        StringBuilder sb = new StringBuilder("{");
        long[] jArr = this.f1729;
        Object[] objArr = this.f1730;
        long[] jArr2 = this.f1732;
        int length = jArr2.length - 2;
        if (length >= 0) {
            int i3 = 0;
            int i4 = 0;
            while (true) {
                long j = jArr2[i3];
                if ((((~j) << 7) & j & (-9187201950435737472L)) != -9187201950435737472L) {
                    int i5 = 8 - ((~(i3 - length)) >>> 31);
                    int i6 = 0;
                    while (i6 < i5) {
                        if ((255 & j) < 128) {
                            int i7 = (i3 << 3) + i6;
                            i2 = i3;
                            long j2 = jArr[i7];
                            Object obj = objArr[i7];
                            sb.append(j2);
                            sb.append("=");
                            if (obj == this) {
                                obj = "(this)";
                            }
                            sb.append(obj);
                            i4++;
                            if (i4 < this.f1731) {
                                sb.append(", ");
                            }
                        } else {
                            i2 = i3;
                        }
                        j >>= 8;
                        i6++;
                        i3 = i2;
                    }
                    int i8 = i3;
                    if (i5 != 8) {
                        break;
                    }
                    i = i8;
                } else {
                    i = i3;
                }
                if (i == length) {
                    break;
                }
                i3 = i + 1;
            }
        }
        sb.append('}');
        return sb.toString();
    }

    /* JADX WARN: Code restructure failed: missing block: B:11:0x0065, code lost:
    
        if (((r4 & ((~r4) << 6)) & (-9187201950435737472L)) == 0) goto L18;
     */
    /* 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 Object m1398(long j) {
        int iNumberOfTrailingZeros;
        int i = ((int) ((j >>> 32) ^ j)) * (-862048943);
        int i2 = i ^ (i << 16);
        int i3 = i2 & 127;
        int i4 = this.f1733;
        int i5 = (i2 >>> 7) & i4;
        int i6 = 0;
        loop0: while (true) {
            long[] jArr = this.f1732;
            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.f1729[iNumberOfTrailingZeros] == j) {
                    break loop0;
                }
                j4 &= j4 - 1;
            }
            i6 += 8;
            i5 = (i5 + i6) & i4;
        }
        if (iNumberOfTrailingZeros >= 0) {
            return this.f1730[iNumberOfTrailingZeros];
        }
        return null;
    }

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

    /* JADX WARN: Code restructure failed: missing block: B:10:0x0072, code lost:
    
        r20 = r3;
     */
    /* JADX WARN: Code restructure failed: missing block: B:11:0x007d, code lost:
    
        if (((((~r7) << 6) & r7) & (-9187201950435737472L)) == 0) goto L52;
     */
    /* JADX WARN: Code restructure failed: missing block: B:12:0x007f, code lost:
    
        r1 = m1401(r4);
     */
    /* JADX WARN: Code restructure failed: missing block: B:13:0x0089, code lost:
    
        if (r39.f1734 != 0) goto L16;
     */
    /* JADX WARN: Code restructure failed: missing block: B:15:0x009d, code lost:
    
        if (((r39.f1732[r1 >> 3] >> ((r1 & 7) << 3)) & 255) != 254) goto L17;
     */
    /* JADX WARN: Code restructure failed: missing block: B:16:0x009f, code lost:
    
        r29 = 255;
        r33 = 1;
        r25 = 128;
     */
    /* JADX WARN: Code restructure failed: missing block: B:17:0x00a7, code lost:
    
        r1 = r39.f1733;
     */
    /* JADX WARN: Code restructure failed: missing block: B:18:0x00a9, code lost:
    
        if (r1 <= 8) goto L42;
     */
    /* JADX WARN: Code restructure failed: missing block: B:19:0x00ab, code lost:
    
        r25 = 128;
     */
    /* JADX WARN: Code restructure failed: missing block: B:20:0x00c5, code lost:
    
        if (java.lang.Long.compare((((long) r39.f1731) * 32) ^ Long.MIN_VALUE, (((long) r1) * 25) ^ Long.MIN_VALUE) > 0) goto L41;
     */
    /* JADX WARN: Code restructure failed: missing block: B:21:0x00c7, code lost:
    
        r1 = r39.f1732;
        r2 = r39.f1733;
        r3 = r39.f1729;
        r5 = r39.f1730;
        r6 = (r2 + 7) >> 3;
        r29 = 255;
        r7 = 0;
     */
    /* JADX WARN: Code restructure failed: missing block: B:22:0x00d6, code lost:
    
        if (r7 >= r6) goto L56;
     */
    /* JADX WARN: Code restructure failed: missing block: B:23:0x00d8, code lost:
    
        r33 = r11;
        r11 = r1[r7] & r33;
        r1[r7] = (-72340172838076674L) & ((~r11) + (r11 >>> 7));
        r7 = r7 + 1;
        r14 = r14;
        r13 = r13;
        r11 = r33;
     */
    /* JADX WARN: Code restructure failed: missing block: B:24:0x00f5, code lost:
    
        r22 = r13;
        r8 = r14;
        r6 = r1.length;
        r7 = r6 - 1;
        r6 = r6 - 2;
        r13 = 72057594037927935L;
        r1[r6] = (r1[r6] & 72057594037927935L) | (-72057594037927936L);
        r1[r7] = r1[0];
        r6 = 0;
     */
    /* JADX WARN: Code restructure failed: missing block: B:25:0x0110, code lost:
    
        if (r6 == r2) goto L57;
     */
    /* JADX WARN: Code restructure failed: missing block: B:26:0x0112, code lost:
    
        r7 = r6 >> 3;
        r19 = (r6 & 7) << 3;
        r11 = (r1[r7] >> r19) & 255;
     */
    /* JADX WARN: Code restructure failed: missing block: B:27:0x0120, code lost:
    
        if (r11 != 128) goto L29;
     */
    /* JADX WARN: Code restructure failed: missing block: B:28:0x0122, code lost:
    
        r6 = r6 + 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:30:0x0127, code lost:
    
        if (r11 == 254) goto L58;
     */
    /* JADX WARN: Code restructure failed: missing block: B:32:0x012a, code lost:
    
        r11 = r3[r6];
        r11 = ((int) (r11 ^ (r11 >>> r22))) * r20;
        r11 = r11 ^ (r11 << 16);
        r12 = r11 >>> 7;
        r31 = m1401(r12);
        r12 = r12 & r2;
        r33 = r8;
     */
    /* JADX WARN: Code restructure failed: missing block: B:33:0x014a, code lost:
    
        if ((((r31 - r12) & r2) / 8) != (((r6 - r12) & r2) / 8)) goto L59;
     */
    /* JADX WARN: Code restructure failed: missing block: B:34:0x014c, code lost:
    
        r34 = r13;
        r1[r7] = (((long) (r11 & 127)) << r19) | (r1[r7] & (~(255 << r19)));
        r1[r1.length - 1] = (r1[0] & r34) | Long.MIN_VALUE;
        r6 = r6 + 1;
        r8 = r33;
        r13 = r34;
     */
    /* JADX WARN: Code restructure failed: missing block: B:35:0x016f, code lost:
    
        r34 = r13;
        r8 = r31 >> 3;
        r12 = r1[r8];
        r14 = (r31 & 7) << 3;
     */
    /* JADX WARN: Code restructure failed: missing block: B:36:0x017f, code lost:
    
        if (((r12 >> r14) & 255) != 128) goto L38;
     */
    /* JADX WARN: Code restructure failed: missing block: B:37:0x0181, code lost:
    
        r32 = r2;
        r36 = r3;
        r1[r8] = ((~(255 << r14)) & r12) | (((long) (r11 & 127)) << r14);
        r1[r7] = (r1[r7] & (~(255 << r19))) | (128 << r19);
        r36[r31] = r36[r6];
        r36[r6] = 0;
        r5[r31] = r5[r6];
        r5[r6] = null;
     */
    /* JADX WARN: Code restructure failed: missing block: B:38:0x01ac, code lost:
    
        r32 = r2;
        r36 = r3;
        r1[r8] = ((~(255 << r14)) & r12) | (((long) (r11 & 127)) << r14);
        r2 = r36[r31];
        r36[r31] = r36[r6];
        r36[r6] = r2;
        r2 = r5[r31];
        r5[r31] = r5[r6];
        r5[r6] = r2;
        r6 = r6 - 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:39:0x01d0, code lost:
    
        r1[r1.length - 1] = (r1[0] & r34) | Long.MIN_VALUE;
        r6 = r6 + 1;
        r2 = r32;
        r8 = r33;
        r13 = r34;
        r3 = r36;
     */
    /* JADX WARN: Code restructure failed: missing block: B:40:0x01e7, code lost:
    
        r33 = r8;
        r39.f1734 = defpackage.AbstractC4334.m9324(r39.f1733) - r39.f1731;
     */
    /* JADX WARN: Code restructure failed: missing block: B:41:0x01f5, code lost:
    
        r29 = 255;
        r33 = 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:42:0x01fa, code lost:
    
        r25 = 128;
     */
    /* JADX WARN: Code restructure failed: missing block: B:43:0x01fd, code lost:
    
        m1402(defpackage.AbstractC4334.m9322(r39.f1733));
     */
    /* JADX WARN: Code restructure failed: missing block: B:44:0x0206, code lost:
    
        r1 = m1401(r4);
     */
    /* JADX WARN: Code restructure failed: missing block: B:45:0x020a, code lost:
    
        r17 = r1;
        r39.f1731++;
        r1 = r39.f1734;
        r2 = r39.f1732;
        r3 = r17 >> 3;
        r4 = r2[r3];
        r6 = (r17 & 7) << 3;
     */
    /* JADX WARN: Code restructure failed: missing block: B:46:0x0224, code lost:
    
        if (((r4 >> r6) & r29) != r25) goto L48;
     */
    /* JADX WARN: Code restructure failed: missing block: B:47:0x0226, code lost:
    
        r7 = r33;
     */
    /* JADX WARN: Code restructure failed: missing block: B:48:0x0229, code lost:
    
        r7 = 0;
     */
    /* JADX WARN: Code restructure failed: missing block: B:49:0x022a, code lost:
    
        r39.f1734 = r1 - r7;
        r1 = r39.f1733;
        r4 = (r4 & (~(r29 << r6))) | (r9 << r6);
        r2[r3] = r4;
        r2[(((r17 - 7) & r1) + (r1 & 7)) >> 3] = r4;
     */
    /* JADX INFO: renamed from: ᵨᵣ, reason: contains not printable characters */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final void m1400(long j, Object obj) {
        int i;
        int iNumberOfTrailingZeros;
        char c = ' ';
        int i2 = -862048943;
        int i3 = ((int) (j ^ (j >>> 32))) * (-862048943);
        int i4 = i3 ^ (i3 << 16);
        int i5 = i4 >>> 7;
        int i6 = i4 & 127;
        int i7 = this.f1733;
        int i8 = i5 & i7;
        int i9 = 0;
        loop0: while (true) {
            long[] jArr = this.f1732;
            int i10 = i8 >> 3;
            int i11 = (i8 & 7) << 3;
            int i12 = 1;
            int i13 = i9;
            long j2 = (((-i11) >> 63) & (jArr[i10 + 1] << (64 - i11))) | (jArr[i10] >>> i11);
            long j3 = i6;
            char c2 = c;
            int i14 = i6;
            long j4 = j2 ^ (j3 * 72340172838076673L);
            long j5 = -9187201950435737472L;
            long j6 = (~j4) & (j4 - 72340172838076673L) & (-9187201950435737472L);
            while (true) {
                if (j6 == 0) {
                    break;
                }
                iNumberOfTrailingZeros = (i8 + (Long.numberOfTrailingZeros(j6) >> 3)) & i7;
                int i15 = i2;
                if (this.f1729[iNumberOfTrailingZeros] == j) {
                    break loop0;
                }
                j6 &= j6 - 1;
                i2 = i15;
            }
            i9 = i13 + 8;
            i8 = (i8 + i9) & i7;
            i6 = i14;
            i2 = i;
            c = c2;
        }
        this.f1729[iNumberOfTrailingZeros] = j;
        this.f1730[iNumberOfTrailingZeros] = obj;
    }

    /* JADX INFO: renamed from: ᵲᵶᵳˈ, reason: contains not printable characters */
    public final int m1401(int i) {
        int i2 = this.f1733;
        int i3 = i & i2;
        int i4 = 0;
        while (true) {
            long[] jArr = this.f1732;
            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 m1402(int i) {
        long[] jArr;
        C0226 c0226 = this;
        long[] jArr2 = c0226.f1732;
        long[] jArr3 = c0226.f1729;
        Object[] objArr = c0226.f1730;
        int i2 = c0226.f1733;
        m1399(i);
        long[] jArr4 = c0226.f1732;
        long[] jArr5 = c0226.f1729;
        Object[] objArr2 = c0226.f1730;
        int i3 = c0226.f1733;
        int i4 = 0;
        while (i4 < i2) {
            if (((jArr2[i4 >> 3] >> ((i4 & 7) << 3)) & 255) < 128) {
                long j = jArr3[i4];
                int i5 = ((int) ((j >>> 32) ^ j)) * (-862048943);
                int i6 = i5 ^ (i5 << 16);
                int iM1401 = c0226.m1401(i6 >>> 7);
                long j2 = i6 & 127;
                int i7 = iM1401 >> 3;
                int i8 = (iM1401 & 7) << 3;
                jArr = jArr2;
                long j3 = (jArr4[i7] & (~(255 << i8))) | (j2 << i8);
                jArr4[i7] = j3;
                jArr4[(((iM1401 - 7) & i3) + (i3 & 7)) >> 3] = j3;
                jArr5[iM1401] = j;
                objArr2[iM1401] = objArr[i4];
            } else {
                jArr = jArr2;
            }
            i4++;
            c0226 = this;
            jArr2 = jArr;
        }
    }
}