package d;

import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
import java.util.Arrays;

/* JADX INFO: compiled from: SegmentedByteString.kt */
/* JADX INFO: loaded from: classes.dex */
public final class x extends i {
    public static final a i = new a(null);
    private final transient byte[][] g;
    private final transient int[] h;

    /* JADX INFO: compiled from: SegmentedByteString.kt */
    public static final class a {
        private a() {
        }

        public final i a(f fVar, int i) {
            c.q.d.j.c(fVar, "buffer");
            c.b(fVar.b0(), 0L, i);
            v vVar = fVar.f1563b;
            int i2 = 0;
            int i3 = 0;
            int i4 = 0;
            while (true) {
                c.q.d.g gVar = null;
                if (i3 >= i) {
                    byte[][] bArr = new byte[i4][];
                    int[] iArr = new int[i4 * 2];
                    v vVar2 = fVar.f1563b;
                    int i5 = 0;
                    while (i2 < i) {
                        if (vVar2 == null) {
                            c.q.d.j.g();
                            throw null;
                        }
                        bArr[i5] = vVar2.f1606a;
                        i2 += vVar2.f1608c - vVar2.f1607b;
                        iArr[i5] = Math.min(i2, i);
                        iArr[i5 + i4] = vVar2.f1607b;
                        vVar2.f1609d = true;
                        i5++;
                        vVar2 = vVar2.f1611f;
                    }
                    return new x(bArr, iArr, gVar);
                }
                if (vVar == null) {
                    c.q.d.j.g();
                    throw null;
                }
                int i6 = vVar.f1608c;
                int i7 = vVar.f1607b;
                if (i6 == i7) {
                    throw new AssertionError("s.limit == s.pos");
                }
                i3 += i6 - i7;
                i4++;
                vVar = vVar.f1611f;
            }
        }

        public /* synthetic */ a(c.q.d.g gVar) {
            this();
        }
    }

    public /* synthetic */ x(byte[][] bArr, int[] iArr, c.q.d.g gVar) {
        this(bArr, iArr);
    }

    /* JADX INFO: Access modifiers changed from: private */
    public final int A(int i2) {
        int iBinarySearch = Arrays.binarySearch(this.h, 0, this.g.length, i2 + 1);
        return iBinarySearch >= 0 ? iBinarySearch : ~iBinarySearch;
    }

    private final i C() {
        return new i(B());
    }

    public byte[] B() {
        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;
            b.a(z()[i2], i5, bArr, i4, i7);
            i4 += i7;
            i2++;
            i3 = i6;
        }
        return bArr;
    }

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

    @Override // d.i
    public i c(String str) throws NoSuchAlgorithmException {
        c.q.d.j.c(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();
        c.q.d.j.b(bArrDigest, "digest.digest()");
        return new i(bArrDigest);
    }

    @Override // d.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 // d.i
    public int g() {
        return this.h[this.g.length - 1];
    }

    @Override // d.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 // d.i
    public String i() {
        return C().i();
    }

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

    @Override // d.i
    public byte k(int i2) {
        c.b(this.h[this.g.length - 1], i2, 1L);
        int iA = A(i2);
        int i3 = iA == 0 ? 0 : this.h[iA - 1];
        int[] iArr = this.h;
        byte[][] bArr = this.g;
        return bArr[iA][(i2 - i3) + iArr[bArr.length + iA]];
    }

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

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

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

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

    @Override // d.i
    public void w(f fVar) {
        c.q.d.j.c(fVar, "buffer");
        int length = z().length;
        int i2 = 0;
        int i3 = 0;
        while (i2 < length) {
            int i4 = y()[length + i2];
            int i5 = y()[i2];
            v vVar = new v(z()[i2], i4, i4 + (i5 - i3), true, false);
            v vVar2 = fVar.f1563b;
            if (vVar2 == null) {
                vVar.g = vVar;
                vVar.f1611f = vVar;
                fVar.f1563b = vVar;
            } else {
                if (vVar2 == null) {
                    c.q.d.j.g();
                    throw null;
                }
                v vVar3 = vVar2.g;
                if (vVar3 == null) {
                    c.q.d.j.g();
                    throw null;
                }
                vVar3.c(vVar);
            }
            i2++;
            i3 = i5;
        }
        fVar.a0(fVar.b0() + ((long) s()));
    }

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

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

    private x(byte[][] bArr, int[] iArr) {
        super(i.f1572e.e());
        this.g = bArr;
        this.h = iArr;
    }
}