package h5;

import java.util.Arrays;

/* loaded from: classes2.dex */
final class x0 extends g {

    /* renamed from: f, reason: collision with root package name */
    final transient byte[][] f10320f;

    /* renamed from: g, reason: collision with root package name */
    final transient int[] f10321g;

    x0(d dVar, int i10) {
        super(null);
        y0.c(dVar.f10014b, 0L, i10);
        v0 v0Var = dVar.f10013a;
        int i11 = 0;
        int i12 = 0;
        int i13 = 0;
        while (i12 < i10) {
            int i14 = v0Var.f10311c;
            int i15 = v0Var.f10310b;
            if (i14 == i15) {
                throw new AssertionError("s.limit == s.pos");
            }
            i12 += i14 - i15;
            i13++;
            v0Var = v0Var.f10314f;
        }
        this.f10320f = new byte[i13][];
        this.f10321g = new int[i13 * 2];
        v0 v0Var2 = dVar.f10013a;
        int i16 = 0;
        while (i11 < i10) {
            byte[][] bArr = this.f10320f;
            bArr[i16] = v0Var2.f10309a;
            int i17 = v0Var2.f10311c;
            int i18 = v0Var2.f10310b;
            i11 += i17 - i18;
            if (i11 > i10) {
                i11 = i10;
            }
            int[] iArr = this.f10321g;
            iArr[i16] = i11;
            iArr[bArr.length + i16] = i18;
            v0Var2.f10312d = true;
            i16++;
            v0Var2 = v0Var2.f10314f;
        }
    }

    private int u(int i10) {
        int binarySearch = Arrays.binarySearch(this.f10321g, 0, this.f10320f.length, i10 + 1);
        return binarySearch >= 0 ? binarySearch : ~binarySearch;
    }

    private g v() {
        return new g(s());
    }

    @Override // h5.g
    void d(d dVar) {
        int length = this.f10320f.length;
        int i10 = 0;
        int i11 = 0;
        while (i10 < length) {
            int[] iArr = this.f10321g;
            int i12 = iArr[length + i10];
            int i13 = iArr[i10];
            v0 v0Var = new v0(this.f10320f[i10], i12, (i12 + i13) - i11, true, false);
            v0 v0Var2 = dVar.f10013a;
            if (v0Var2 == null) {
                v0Var.f10315g = v0Var;
                v0Var.f10314f = v0Var;
                dVar.f10013a = v0Var;
            } else {
                v0Var2.f10315g.b(v0Var);
            }
            i10++;
            i11 = i13;
        }
        dVar.f10014b += i11;
    }

    @Override // h5.g
    public String e() {
        return v().e();
    }

    @Override // h5.g
    public boolean equals(Object obj) {
        if (obj == this) {
            return true;
        }
        if (obj instanceof g) {
            g gVar = (g) obj;
            if (gVar.o() == o() && l(0, gVar, 0, o())) {
                return true;
            }
        }
        return false;
    }

    @Override // h5.g
    public int hashCode() {
        int i10 = this.f10075b;
        if (i10 != 0) {
            return i10;
        }
        int length = this.f10320f.length;
        int i11 = 0;
        int i12 = 0;
        int i13 = 1;
        while (i11 < length) {
            byte[] bArr = this.f10320f[i11];
            int[] iArr = this.f10321g;
            int i14 = iArr[length + i11];
            int i15 = iArr[i11];
            int i16 = (i15 - i12) + i14;
            while (i14 < i16) {
                i13 = (i13 * 31) + bArr[i14];
                i14++;
            }
            i11++;
            i12 = i15;
        }
        this.f10075b = i13;
        return i13;
    }

    @Override // h5.g
    public byte i(int i10) {
        y0.c(this.f10321g[this.f10320f.length - 1], i10, 1L);
        int u10 = u(i10);
        int i11 = u10 == 0 ? 0 : this.f10321g[u10 - 1];
        int[] iArr = this.f10321g;
        byte[][] bArr = this.f10320f;
        return bArr[u10][(i10 - i11) + iArr[bArr.length + u10]];
    }

    @Override // h5.g
    public String j() {
        return v().j();
    }

    @Override // h5.g
    public boolean l(int i10, g gVar, int i11, int i12) {
        if (i10 < 0 || i10 > o() - i12) {
            return false;
        }
        int u10 = u(i10);
        while (i12 > 0) {
            int i13 = u10 == 0 ? 0 : this.f10321g[u10 - 1];
            int min = Math.min(i12, ((this.f10321g[u10] - i13) + i13) - i10);
            int[] iArr = this.f10321g;
            byte[][] bArr = this.f10320f;
            if (!gVar.m(i11, bArr[u10], (i10 - i13) + iArr[bArr.length + u10], min)) {
                return false;
            }
            i10 += min;
            i11 += min;
            i12 -= min;
            u10++;
        }
        return true;
    }

    @Override // h5.g
    public boolean m(int i10, byte[] bArr, int i11, int i12) {
        if (i10 < 0 || i10 > o() - i12 || i11 < 0 || i11 > bArr.length - i12) {
            return false;
        }
        int u10 = u(i10);
        while (i12 > 0) {
            int i13 = u10 == 0 ? 0 : this.f10321g[u10 - 1];
            int min = Math.min(i12, ((this.f10321g[u10] - i13) + i13) - i10);
            int[] iArr = this.f10321g;
            byte[][] bArr2 = this.f10320f;
            if (!y0.e(bArr2[u10], (i10 - i13) + iArr[bArr2.length + u10], bArr, i11, min)) {
                return false;
            }
            i10 += min;
            i11 += min;
            i12 -= min;
            u10++;
        }
        return true;
    }

    @Override // h5.g
    public g n() {
        return v().n();
    }

    @Override // h5.g
    public int o() {
        return this.f10321g[this.f10320f.length - 1];
    }

    @Override // h5.g
    public g q(int i10, int i11) {
        return v().q(i10, i11);
    }

    @Override // h5.g
    public g r() {
        return v().r();
    }

    @Override // h5.g
    public byte[] s() {
        int[] iArr = this.f10321g;
        byte[][] bArr = this.f10320f;
        byte[] bArr2 = new byte[iArr[bArr.length - 1]];
        int length = bArr.length;
        int i10 = 0;
        int i11 = 0;
        while (i10 < length) {
            int[] iArr2 = this.f10321g;
            int i12 = iArr2[length + i10];
            int i13 = iArr2[i10];
            System.arraycopy(this.f10320f[i10], i12, bArr2, i11, i13 - i11);
            i10++;
            i11 = i13;
        }
        return bArr2;
    }

    @Override // h5.g
    public String t() {
        return v().t();
    }

    @Override // h5.g
    public String toString() {
        return v().toString();
    }
}