package h;

import java.util.Arrays;

/* JADX INFO: loaded from: classes.dex */
public final class v extends i {

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

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

    public v(f fVar, int i2) {
        super(null);
        z.b(fVar.f6529d, 0L, i2);
        t tVar = fVar.f6528c;
        int i3 = 0;
        int i4 = 0;
        int i5 = 0;
        while (i4 < i2) {
            int i6 = tVar.f6562c;
            int i7 = tVar.f6561b;
            if (i6 == i7) {
                throw new AssertionError("s.limit == s.pos");
            }
            i4 += i6 - i7;
            i5++;
            tVar = tVar.f6565f;
        }
        this.f6569g = new byte[i5][];
        this.f6570h = new int[i5 * 2];
        t tVar2 = fVar.f6528c;
        int i8 = 0;
        while (i3 < i2) {
            byte[][] bArr = this.f6569g;
            bArr[i8] = tVar2.f6560a;
            int i9 = tVar2.f6562c;
            int i10 = tVar2.f6561b;
            int i11 = (i9 - i10) + i3;
            i3 = i11 > i2 ? i2 : i11;
            int[] iArr = this.f6570h;
            iArr[i8] = i3;
            iArr[bArr.length + i8] = i10;
            tVar2.f6563d = true;
            i8++;
            tVar2 = tVar2.f6565f;
        }
    }

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

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

    @Override // h.i
    public byte f(int i2) {
        z.b(this.f6570h[this.f6569g.length - 1], i2, 1L);
        int iQ = q(i2);
        int i3 = iQ == 0 ? 0 : this.f6570h[iQ - 1];
        int[] iArr = this.f6570h;
        byte[][] bArr = this.f6569g;
        return bArr[iQ][(i2 - i3) + iArr[bArr.length + iQ]];
    }

    @Override // h.i
    public String g() {
        return r().g();
    }

    @Override // h.i
    public int hashCode() {
        int i2 = this.f6534e;
        if (i2 != 0) {
            return i2;
        }
        int length = this.f6569g.length;
        int i3 = 0;
        int i4 = 1;
        int i5 = 0;
        while (i3 < length) {
            byte[] bArr = this.f6569g[i3];
            int[] iArr = this.f6570h;
            int i6 = iArr[length + i3];
            int i7 = iArr[i3];
            int i8 = (i7 - i5) + i6;
            while (i6 < i8) {
                i4 = (i4 * 31) + bArr[i6];
                i6++;
            }
            i3++;
            i5 = i7;
        }
        this.f6534e = i4;
        return i4;
    }

    @Override // h.i
    public boolean i(int i2, i iVar, int i3, int i4) {
        if (i2 < 0 || i2 > k() - i4) {
            return false;
        }
        int iQ = q(i2);
        while (i4 > 0) {
            int i5 = iQ == 0 ? 0 : this.f6570h[iQ - 1];
            int iMin = Math.min(i4, ((this.f6570h[iQ] - i5) + i5) - i2);
            int[] iArr = this.f6570h;
            byte[][] bArr = this.f6569g;
            if (!iVar.j(i3, bArr[iQ], (i2 - i5) + iArr[bArr.length + iQ], iMin)) {
                return false;
            }
            i2 += iMin;
            i3 += iMin;
            i4 -= iMin;
            iQ++;
        }
        return true;
    }

    @Override // h.i
    public boolean j(int i2, byte[] bArr, int i3, int i4) {
        if (i2 < 0 || i2 > k() - i4 || i3 < 0 || i3 > bArr.length - i4) {
            return false;
        }
        int iQ = q(i2);
        while (i4 > 0) {
            int i5 = iQ == 0 ? 0 : this.f6570h[iQ - 1];
            int iMin = Math.min(i4, ((this.f6570h[iQ] - i5) + i5) - i2);
            int[] iArr = this.f6570h;
            byte[][] bArr2 = this.f6569g;
            if (!z.a(bArr2[iQ], (i2 - i5) + iArr[bArr2.length + iQ], bArr, i3, iMin)) {
                return false;
            }
            i2 += iMin;
            i3 += iMin;
            i4 -= iMin;
            iQ++;
        }
        return true;
    }

    @Override // h.i
    public int k() {
        return this.f6570h[this.f6569g.length - 1];
    }

    @Override // h.i
    public i l(int i2, int i3) {
        return r().l(i2, i3);
    }

    @Override // h.i
    public i m() {
        return r().m();
    }

    @Override // h.i
    public byte[] n() {
        int[] iArr = this.f6570h;
        byte[][] bArr = this.f6569g;
        byte[] bArr2 = new byte[iArr[bArr.length - 1]];
        int length = bArr.length;
        int i2 = 0;
        int i3 = 0;
        while (i2 < length) {
            int[] iArr2 = this.f6570h;
            int i4 = iArr2[length + i2];
            int i5 = iArr2[i2];
            System.arraycopy(this.f6569g[i2], i4, bArr2, i3, i5 - i3);
            i2++;
            i3 = i5;
        }
        return bArr2;
    }

    @Override // h.i
    public String o() {
        return r().o();
    }

    @Override // h.i
    public void p(f fVar) {
        int length = this.f6569g.length;
        int i2 = 0;
        int i3 = 0;
        while (i2 < length) {
            int[] iArr = this.f6570h;
            int i4 = iArr[length + i2];
            int i5 = iArr[i2];
            t tVar = new t(this.f6569g[i2], i4, (i4 + i5) - i3, true, false);
            t tVar2 = fVar.f6528c;
            if (tVar2 == null) {
                tVar.f6566g = tVar;
                tVar.f6565f = tVar;
                fVar.f6528c = tVar;
            } else {
                tVar2.f6566g.b(tVar);
            }
            i2++;
            i3 = i5;
        }
        fVar.f6529d += (long) i3;
    }

    public final int q(int i2) {
        int iBinarySearch = Arrays.binarySearch(this.f6570h, 0, this.f6569g.length, i2 + 1);
        return iBinarySearch >= 0 ? iBinarySearch : ~iBinarySearch;
    }

    public final i r() {
        return new i(n());
    }

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