package i;

import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;

/* JADX INFO: compiled from: SegmentedByteString.kt */
/* JADX INFO: loaded from: classes.dex */
public final class a0 extends i {

    /* JADX INFO: renamed from: i, reason: collision with root package name */
    private final transient byte[][] f1015i;

    /* JADX INFO: renamed from: j, reason: collision with root package name */
    private final transient int[] f1016j;

    /* JADX WARN: 'super' call moved to the top of the method (can break code semantics) */
    public a0(byte[][] bArr, int[] iArr) {
        super(i.f1026g.e());
        h.x.d.k.d(bArr, "segments");
        h.x.d.k.d(iArr, "directory");
        this.f1015i = bArr;
        this.f1016j = iArr;
    }

    private final i A() {
        return new i(v());
    }

    @Override // i.i
    public String a() {
        return A().a();
    }

    @Override // i.i
    public i c(String str) throws NoSuchAlgorithmException {
        h.x.d.k.d(str, "algorithm");
        MessageDigest messageDigest = MessageDigest.getInstance(str);
        int length = z().length;
        int i2 = 0;
        int i3 = 0;
        while (i2 < length) {
            int i4 = y()[length + i2];
            int i5 = y()[i2];
            messageDigest.update(z()[i2], i4, i5 - i3);
            i2++;
            i3 = i5;
        }
        byte[] bArrDigest = messageDigest.digest();
        h.x.d.k.c(bArrDigest, "digest.digest()");
        return new i(bArrDigest);
    }

    @Override // i.i
    public boolean equals(Object obj) {
        if (obj == this) {
            return true;
        }
        if (obj instanceof i) {
            i iVar = (i) obj;
            if (iVar.s() == s() && m(0, iVar, 0, s())) {
                return true;
            }
        }
        return false;
    }

    @Override // i.i
    public int g() {
        return y()[z().length - 1];
    }

    @Override // i.i
    public int hashCode() {
        int iF = f();
        if (iF != 0) {
            return iF;
        }
        int length = z().length;
        int i2 = 0;
        int i3 = 1;
        int i4 = 0;
        while (i2 < length) {
            int i5 = y()[length + i2];
            int i6 = y()[i2];
            byte[] bArr = z()[i2];
            int i7 = (i6 - i4) + i5;
            while (i5 < i7) {
                i3 = (i3 * 31) + bArr[i5];
                i5++;
            }
            i2++;
            i4 = i6;
        }
        o(i3);
        return i3;
    }

    @Override // i.i
    public String i() {
        return A().i();
    }

    @Override // i.i
    public byte[] j() {
        return v();
    }

    @Override // i.i
    public byte k(int i2) {
        c.b(y()[z().length - 1], i2, 1L);
        int iB = i.f0.c.b(this, i2);
        return z()[iB][(i2 - (iB == 0 ? 0 : y()[iB - 1])) + y()[z().length + iB]];
    }

    @Override // i.i
    public boolean m(int i2, i iVar, int i3, int i4) {
        h.x.d.k.d(iVar, "other");
        if (i2 < 0 || i2 > s() - i4) {
            return false;
        }
        int i5 = i4 + i2;
        int iB = i.f0.c.b(this, i2);
        while (i2 < i5) {
            int i6 = iB == 0 ? 0 : y()[iB - 1];
            int i7 = y()[iB] - i6;
            int i8 = y()[z().length + iB];
            int iMin = Math.min(i5, i7 + i6) - i2;
            if (!iVar.n(i3, z()[iB], i8 + (i2 - i6), iMin)) {
                return false;
            }
            i3 += iMin;
            i2 += iMin;
            iB++;
        }
        return true;
    }

    @Override // i.i
    public boolean n(int i2, byte[] bArr, int i3, int i4) {
        h.x.d.k.d(bArr, "other");
        if (i2 < 0 || i2 > s() - i4 || i3 < 0 || i3 > bArr.length - i4) {
            return false;
        }
        int i5 = i4 + i2;
        int iB = i.f0.c.b(this, i2);
        while (i2 < i5) {
            int i6 = iB == 0 ? 0 : y()[iB - 1];
            int i7 = y()[iB] - i6;
            int i8 = y()[z().length + iB];
            int iMin = Math.min(i5, i7 + i6) - i2;
            if (!c.a(z()[iB], i8 + (i2 - i6), bArr, i3, iMin)) {
                return false;
            }
            i3 += iMin;
            i2 += iMin;
            iB++;
        }
        return true;
    }

    @Override // i.i
    public String toString() {
        return A().toString();
    }

    @Override // i.i
    public i u() {
        return A().u();
    }

    @Override // i.i
    public byte[] v() {
        byte[] bArr = new byte[s()];
        int length = z().length;
        int i2 = 0;
        int i3 = 0;
        int i4 = 0;
        while (i2 < length) {
            int i5 = y()[length + i2];
            int i6 = y()[i2];
            int i7 = i6 - i3;
            h.s.d.c(z()[i2], bArr, i4, i5, i5 + i7);
            i4 += i7;
            i2++;
            i3 = i6;
        }
        return bArr;
    }

    @Override // i.i
    public void x(f fVar, int i2, int i3) {
        h.x.d.k.d(fVar, "buffer");
        int i4 = i3 + i2;
        int iB = i.f0.c.b(this, i2);
        while (i2 < i4) {
            int i5 = iB == 0 ? 0 : y()[iB - 1];
            int i6 = y()[iB] - i5;
            int i7 = y()[z().length + iB];
            int iMin = Math.min(i4, i6 + i5) - i2;
            int i8 = i7 + (i2 - i5);
            y yVar = new y(z()[iB], i8, i8 + iMin, true, false);
            y yVar2 = fVar.b;
            if (yVar2 == null) {
                yVar.f1057g = yVar;
                yVar.f1056f = yVar;
                fVar.b = yVar;
            } else {
                h.x.d.k.b(yVar2);
                y yVar3 = yVar2.f1057g;
                h.x.d.k.b(yVar3);
                yVar3.c(yVar);
            }
            i2 += iMin;
            iB++;
        }
        fVar.H(fVar.J() + ((long) s()));
    }

    public final int[] y() {
        return this.f1016j;
    }

    public final byte[][] z() {
        return this.f1015i;
    }
}