package n;

import o.AbstractC2628a;
import x4.AbstractC3250p;

/* JADX INFO: renamed from: n.E, reason: case insensitive filesystem */
/* JADX INFO: loaded from: classes.dex */
public final class C2570E {

    /* JADX INFO: renamed from: a, reason: collision with root package name */
    public long[] f21325a = Y.f21386a;

    /* JADX INFO: renamed from: b, reason: collision with root package name */
    public long[] f21326b = AbstractC2591s.f21473a;

    /* JADX INFO: renamed from: c, reason: collision with root package name */
    public int f21327c;

    /* JADX INFO: renamed from: d, reason: collision with root package name */
    public int f21328d;

    /* JADX INFO: renamed from: e, reason: collision with root package name */
    public int f21329e;

    public C2570E(int i6) {
        if (i6 >= 0) {
            c(Y.d(i6));
        } else {
            AbstractC2628a.c("Capacity must be a positive value.");
            throw null;
        }
    }

    /* JADX WARN: Code restructure failed: missing block: B:11:0x0066, code lost:
    
        if (((r6 & ((~r6) << 6)) & (-9187201950435737472L)) == 0) goto L16;
     */
    /* JADX WARN: Code restructure failed: missing block: B:12:0x0068, code lost:
    
        r10 = -1;
     */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean a(long j4) {
        int iNumberOfTrailingZeros;
        int iHashCode = Long.hashCode(j4) * (-862048943);
        int i6 = iHashCode ^ (iHashCode << 16);
        int i7 = i6 & 127;
        int i8 = this.f21327c;
        int i9 = (i6 >>> 7) & i8;
        int i10 = 0;
        loop0: while (true) {
            long[] jArr = this.f21325a;
            int i11 = i9 >> 3;
            int i12 = (i9 & 7) << 3;
            long j6 = ((jArr[i11 + 1] << (64 - i12)) & ((-i12) >> 63)) | (jArr[i11] >>> i12);
            long j7 = (((long) i7) * 72340172838076673L) ^ j6;
            long j8 = (~j7) & (j7 - 72340172838076673L) & (-9187201950435737472L);
            while (true) {
                if (j8 == 0) {
                    break;
                }
                iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j8) >> 3) + i9) & i8;
                if (this.f21326b[iNumberOfTrailingZeros] == j4) {
                    break loop0;
                }
                j8 &= j8 - 1;
            }
            i10 += 8;
            i9 = (i9 + i10) & i8;
        }
        return iNumberOfTrailingZeros >= 0;
    }

    public final int b(int i6) {
        int i7 = this.f21327c;
        int i8 = i6 & i7;
        int i9 = 0;
        while (true) {
            long[] jArr = this.f21325a;
            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 c(int i6) {
        long[] jArr;
        int iMax = i6 > 0 ? Math.max(7, Y.c(i6)) : 0;
        this.f21327c = iMax;
        if (iMax == 0) {
            jArr = Y.f21386a;
        } else {
            jArr = new long[((iMax + 15) & (-8)) >> 3];
            AbstractC3250p.I(jArr, -9187201950435737472L);
        }
        this.f21325a = jArr;
        int i7 = iMax >> 3;
        long j4 = 255 << ((iMax & 7) << 3);
        jArr[i7] = (jArr[i7] & (~j4)) | j4;
        this.f21329e = Y.a(this.f21327c) - this.f21328d;
        this.f21326b = new long[iMax];
    }

    /* JADX WARN: Removed duplicated region for block: B:25:0x0058  */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean equals(Object obj) {
        if (obj == this) {
            return true;
        }
        if (!(obj instanceof C2570E)) {
            return false;
        }
        C2570E c2570e = (C2570E) obj;
        if (c2570e.f21328d != this.f21328d) {
            return false;
        }
        long[] jArr = this.f21326b;
        long[] jArr2 = this.f21325a;
        int length = jArr2.length - 2;
        if (length >= 0) {
            int i6 = 0;
            while (true) {
                long j4 = jArr2[i6];
                if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) {
                    int i7 = 8 - ((~(i6 - length)) >>> 31);
                    for (int i8 = 0; i8 < i7; i8++) {
                        if ((255 & j4) < 128 && !c2570e.a(jArr[(i6 << 3) + i8])) {
                            return false;
                        }
                        j4 >>= 8;
                    }
                    if (i7 != 8) {
                        break;
                    }
                    if (i6 == length) {
                        break;
                    }
                    i6++;
                }
            }
        }
        return true;
    }

    public final int hashCode() {
        long[] jArr = this.f21326b;
        long[] jArr2 = this.f21325a;
        int length = jArr2.length - 2;
        if (length < 0) {
            return 0;
        }
        int i6 = 0;
        int iHashCode = 0;
        while (true) {
            long j4 = jArr2[i6];
            if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) {
                int i7 = 8 - ((~(i6 - length)) >>> 31);
                for (int i8 = 0; i8 < i7; i8++) {
                    if ((255 & j4) < 128) {
                        iHashCode = Long.hashCode(jArr[(i6 << 3) + i8]) + iHashCode;
                    }
                    j4 >>= 8;
                }
                if (i7 != 8) {
                    return iHashCode;
                }
            }
            if (i6 == length) {
                return iHashCode;
            }
            i6++;
        }
    }

    /* JADX WARN: Removed duplicated region for block: B:19:0x005d A[PHI: r7
      0x005d: PHI (r7v2 int) = (r7v1 int), (r7v3 int) binds: [B:6:0x0026, B:18:0x005b] A[DONT_GENERATE, DONT_INLINE]] */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final String toString() {
        StringBuilder sb = new StringBuilder();
        sb.append((CharSequence) "[");
        long[] jArr = this.f21326b;
        long[] jArr2 = this.f21325a;
        int length = jArr2.length - 2;
        if (length >= 0) {
            int i6 = 0;
            int i7 = 0;
            loop0: while (true) {
                long j4 = jArr2[i6];
                if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) {
                    int i8 = 8 - ((~(i6 - length)) >>> 31);
                    for (int i9 = 0; i9 < i8; i9++) {
                        if ((255 & j4) < 128) {
                            long j6 = jArr[(i6 << 3) + i9];
                            if (i7 == -1) {
                                sb.append((CharSequence) "...");
                                break loop0;
                            }
                            if (i7 != 0) {
                                sb.append((CharSequence) ", ");
                            }
                            sb.append(j6);
                            i7++;
                        }
                        j4 >>= 8;
                    }
                    if (i8 != 8) {
                        break;
                    }
                    if (i6 == length) {
                        break;
                    }
                    i6++;
                }
            }
            sb.append((CharSequence) "]");
        } else {
            sb.append((CharSequence) "]");
        }
        String string = sb.toString();
        kotlin.jvm.internal.o.g(string, "toString(...)");
        return string;
    }
}