package x7;

import d5.AbstractC0844a;
import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;

/* JADX INFO: loaded from: classes.dex */
public final class E extends C1734j {

    /* JADX INFO: renamed from: u, reason: collision with root package name */
    public final transient byte[][] f18737u;

    /* JADX INFO: renamed from: v, reason: collision with root package name */
    public final transient int[] f18738v;

    public E(byte[][] bArr, int[] iArr) {
        super(C1734j.f18766t.f18767q);
        this.f18737u = bArr;
        this.f18738v = iArr;
    }

    @Override // x7.C1734j
    public final C1734j b(String str) throws NoSuchAlgorithmException {
        MessageDigest messageDigest = MessageDigest.getInstance(str);
        byte[][] bArr = this.f18737u;
        int length = bArr.length;
        int i = 0;
        int i5 = 0;
        while (i < length) {
            int[] iArr = this.f18738v;
            int i8 = iArr[length + i];
            int i9 = iArr[i];
            messageDigest.update(bArr[i], i8, i9 - i5);
            i++;
            i5 = i9;
        }
        byte[] bArrDigest = messageDigest.digest();
        P6.g.b(bArrDigest);
        return new C1734j(bArrDigest);
    }

    @Override // x7.C1734j
    public final int c() {
        return this.f18738v[this.f18737u.length - 1];
    }

    @Override // x7.C1734j
    public final String d() {
        return s().d();
    }

    @Override // x7.C1734j
    public final int e(int i, byte[] bArr) {
        P6.g.e(bArr, "other");
        return s().e(i, bArr);
    }

    @Override // x7.C1734j
    public final boolean equals(Object obj) {
        if (obj == this) {
            return true;
        }
        if (obj instanceof C1734j) {
            C1734j c1734j = (C1734j) obj;
            if (c1734j.c() == c() && l(0, c1734j, c())) {
                return true;
            }
        }
        return false;
    }

    @Override // x7.C1734j
    public final byte[] g() {
        return r();
    }

    @Override // x7.C1734j
    public final byte h(int i) {
        byte[][] bArr = this.f18737u;
        int length = bArr.length - 1;
        int[] iArr = this.f18738v;
        s7.d.g(iArr[length], i, 1L);
        int iG = y7.b.g(this, i);
        return bArr[iG][(i - (iG == 0 ? 0 : iArr[iG - 1])) + iArr[bArr.length + iG]];
    }

    @Override // x7.C1734j
    public final int hashCode() {
        int i = this.f18768r;
        if (i != 0) {
            return i;
        }
        byte[][] bArr = this.f18737u;
        int length = bArr.length;
        int i5 = 0;
        int i8 = 1;
        int i9 = 0;
        while (i5 < length) {
            int[] iArr = this.f18738v;
            int i10 = iArr[length + i5];
            int i11 = iArr[i5];
            byte[] bArr2 = bArr[i5];
            int i12 = (i11 - i9) + i10;
            while (i10 < i12) {
                i8 = (i8 * 31) + bArr2[i10];
                i10++;
            }
            i5++;
            i9 = i11;
        }
        this.f18768r = i8;
        return i8;
    }

    @Override // x7.C1734j
    public final int i(byte[] bArr) {
        P6.g.e(bArr, "other");
        return s().i(bArr);
    }

    @Override // x7.C1734j
    public final boolean k(int i, int i5, int i8, byte[] bArr) {
        P6.g.e(bArr, "other");
        if (i < 0 || i > c() - i8 || i5 < 0 || i5 > bArr.length - i8) {
            return false;
        }
        int i9 = i8 + i;
        int iG = y7.b.g(this, i);
        while (i < i9) {
            int[] iArr = this.f18738v;
            int i10 = iG == 0 ? 0 : iArr[iG - 1];
            int i11 = iArr[iG] - i10;
            byte[][] bArr2 = this.f18737u;
            int i12 = iArr[bArr2.length + iG];
            int iMin = Math.min(i9, i11 + i10) - i;
            if (!s7.d.c((i - i10) + i12, i5, iMin, bArr2[iG], bArr)) {
                return false;
            }
            i5 += iMin;
            i += iMin;
            iG++;
        }
        return true;
    }

    @Override // x7.C1734j
    public final boolean l(int i, C1734j c1734j, int i5) {
        P6.g.e(c1734j, "other");
        if (i >= 0 && i <= c() - i5) {
            int i8 = i5 + i;
            int iG = y7.b.g(this, i);
            int i9 = 0;
            while (i < i8) {
                int[] iArr = this.f18738v;
                int i10 = iG == 0 ? 0 : iArr[iG - 1];
                int i11 = iArr[iG] - i10;
                byte[][] bArr = this.f18737u;
                int i12 = iArr[bArr.length + iG];
                int iMin = Math.min(i8, i11 + i10) - i;
                if (c1734j.k(i9, (i - i10) + i12, iMin, bArr[iG])) {
                    i9 += iMin;
                    i += iMin;
                    iG++;
                }
            }
            return true;
        }
        return false;
    }

    @Override // x7.C1734j
    public final C1734j m(int i, int i5) {
        if (i5 == -1234567890) {
            i5 = c();
        }
        if (i < 0) {
            throw new IllegalArgumentException(I1.a.k(i, "beginIndex=", " < 0").toString());
        }
        if (i5 > c()) {
            StringBuilder sbO = AbstractC0844a.o(i5, "endIndex=", " > length(");
            sbO.append(c());
            sbO.append(')');
            throw new IllegalArgumentException(sbO.toString().toString());
        }
        int i8 = i5 - i;
        if (i8 < 0) {
            throw new IllegalArgumentException(I1.a.o("endIndex=", i5, i, " < beginIndex=").toString());
        }
        if (i == 0 && i5 == c()) {
            return this;
        }
        if (i == i5) {
            return C1734j.f18766t;
        }
        int iG = y7.b.g(this, i);
        int iG2 = y7.b.g(this, i5 - 1);
        byte[][] bArr = this.f18737u;
        byte[][] bArr2 = (byte[][]) B6.j.K(bArr, iG, iG2 + 1);
        int[] iArr = new int[bArr2.length * 2];
        int[] iArr2 = this.f18738v;
        if (iG <= iG2) {
            int i9 = iG;
            int i10 = 0;
            while (true) {
                iArr[i10] = Math.min(iArr2[i9] - i, i8);
                int i11 = i10 + 1;
                iArr[i10 + bArr2.length] = iArr2[bArr.length + i9];
                if (i9 == iG2) {
                    break;
                }
                i9++;
                i10 = i11;
            }
        }
        int i12 = iG != 0 ? iArr2[iG - 1] : 0;
        int length = bArr2.length;
        iArr[length] = (i - i12) + iArr[length];
        return new E(bArr2, iArr);
    }

    @Override // x7.C1734j
    public final C1734j o() {
        return s().o();
    }

    @Override // x7.C1734j
    public final void q(C1731g c1731g, int i) {
        P6.g.e(c1731g, "buffer");
        int iG = y7.b.g(this, 0);
        int i5 = 0;
        while (i5 < i) {
            int[] iArr = this.f18738v;
            int i8 = iG == 0 ? 0 : iArr[iG - 1];
            int i9 = iArr[iG] - i8;
            byte[][] bArr = this.f18737u;
            int i10 = iArr[bArr.length + iG];
            int iMin = Math.min(i, i9 + i8) - i5;
            int i11 = (i5 - i8) + i10;
            C c3 = new C(bArr[iG], i11, i11 + iMin, true);
            C c8 = c1731g.f18764q;
            if (c8 == null) {
                c3.f18733g = c3;
                c3.f18732f = c3;
                c1731g.f18764q = c3;
            } else {
                C c9 = c8.f18733g;
                P6.g.b(c9);
                c9.b(c3);
            }
            i5 += iMin;
            iG++;
        }
        c1731g.f18765r += (long) i;
    }

    public final byte[] r() {
        byte[] bArr = new byte[c()];
        byte[][] bArr2 = this.f18737u;
        int length = bArr2.length;
        int i = 0;
        int i5 = 0;
        int i8 = 0;
        while (i < length) {
            int[] iArr = this.f18738v;
            int i9 = iArr[length + i];
            int i10 = iArr[i];
            int i11 = i10 - i5;
            B6.j.F(i8, i9, i9 + i11, bArr2[i], bArr);
            i8 += i11;
            i++;
            i5 = i10;
        }
        return bArr;
    }

    public final C1734j s() {
        return new C1734j(r());
    }

    @Override // x7.C1734j
    public final String toString() {
        return s().toString();
    }
}