package f;

import java.util.Arrays;

/* JADX INFO: compiled from: SegmentedByteString.java */
/* JADX INFO: loaded from: classes.dex */
final class r extends f {
    final transient byte[][] h;
    final transient int[] i;

    r(c cVar, int i) {
        super(null);
        v.b(cVar.f3076e, 0L, i);
        p pVar = cVar.f3075d;
        int i2 = 0;
        int i3 = 0;
        int i4 = 0;
        while (i3 < i) {
            int i5 = pVar.f3110c;
            int i6 = pVar.f3109b;
            if (i5 == i6) {
                throw new AssertionError("s.limit == s.pos");
            }
            i3 += i5 - i6;
            i4++;
            pVar = pVar.f3113f;
        }
        this.h = new byte[i4][];
        this.i = new int[i4 * 2];
        p pVar2 = cVar.f3075d;
        int i7 = 0;
        while (i2 < i) {
            byte[][] bArr = this.h;
            bArr[i7] = pVar2.f3108a;
            int i8 = pVar2.f3110c;
            int i9 = pVar2.f3109b;
            i2 += i8 - i9;
            if (i2 > i) {
                i2 = i;
            }
            int[] iArr = this.i;
            iArr[i7] = i2;
            iArr[bArr.length + i7] = i9;
            pVar2.f3111d = true;
            i7++;
            pVar2 = pVar2.f3113f;
        }
    }

    private int x(int i) {
        int iBinarySearch = Arrays.binarySearch(this.i, 0, this.h.length, i + 1);
        return iBinarySearch >= 0 ? iBinarySearch : ~iBinarySearch;
    }

    private f y() {
        return new f(u());
    }

    @Override // f.f
    public String a() {
        return y().a();
    }

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

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

    @Override // f.f
    public byte i(int i) {
        v.b(this.i[this.h.length - 1], i, 1L);
        int iX = x(i);
        int i2 = iX == 0 ? 0 : this.i[iX - 1];
        int[] iArr = this.i;
        byte[][] bArr = this.h;
        return bArr[iX][(i - i2) + iArr[bArr.length + iX]];
    }

    @Override // f.f
    public String j() {
        return y().j();
    }

    @Override // f.f
    public f k() {
        return y().k();
    }

    @Override // f.f
    public boolean m(int i, f fVar, int i2, int i3) {
        if (i < 0 || i > q() - i3) {
            return false;
        }
        int iX = x(i);
        while (i3 > 0) {
            int i4 = iX == 0 ? 0 : this.i[iX - 1];
            int iMin = Math.min(i3, ((this.i[iX] - i4) + i4) - i);
            int[] iArr = this.i;
            byte[][] bArr = this.h;
            if (!fVar.n(i2, bArr[iX], (i - i4) + iArr[bArr.length + iX], iMin)) {
                return false;
            }
            i += iMin;
            i2 += iMin;
            i3 -= iMin;
            iX++;
        }
        return true;
    }

    @Override // f.f
    public boolean n(int i, byte[] bArr, int i2, int i3) {
        if (i < 0 || i > q() - i3 || i2 < 0 || i2 > bArr.length - i3) {
            return false;
        }
        int iX = x(i);
        while (i3 > 0) {
            int i4 = iX == 0 ? 0 : this.i[iX - 1];
            int iMin = Math.min(i3, ((this.i[iX] - i4) + i4) - i);
            int[] iArr = this.i;
            byte[][] bArr2 = this.h;
            if (!v.a(bArr2[iX], (i - i4) + iArr[bArr2.length + iX], bArr, i2, iMin)) {
                return false;
            }
            i += iMin;
            i2 += iMin;
            i3 -= iMin;
            iX++;
        }
        return true;
    }

    @Override // f.f
    public f o() {
        return y().o();
    }

    @Override // f.f
    public f p() {
        return y().p();
    }

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

    @Override // f.f
    public f s(int i, int i2) {
        return y().s(i, i2);
    }

    @Override // f.f
    public f t() {
        return y().t();
    }

    @Override // f.f
    public String toString() {
        return y().toString();
    }

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

    @Override // f.f
    public String v() {
        return y().v();
    }

    @Override // f.f
    void w(c cVar) {
        int length = this.h.length;
        int i = 0;
        int i2 = 0;
        while (i < length) {
            int[] iArr = this.i;
            int i3 = iArr[length + i];
            int i4 = iArr[i];
            p pVar = new p(this.h[i], i3, (i3 + i4) - i2);
            p pVar2 = cVar.f3075d;
            if (pVar2 == null) {
                pVar.f3114g = pVar;
                pVar.f3113f = pVar;
                cVar.f3075d = pVar;
            } else {
                pVar2.f3114g.c(pVar);
            }
            i++;
            i2 = i4;
        }
        cVar.f3076e += (long) i2;
    }
}