package l.c0;

import j.p0.d.r;
import l.x;

/* JADX INFO: compiled from: SegmentedByteString.kt */
/* JADX INFO: loaded from: classes.dex */
public final class c {
    public static final int a(int[] iArr, int i2, int i3, int i4) {
        r.g(iArr, "$this$binarySearch");
        int i5 = i4 - 1;
        while (i3 <= i5) {
            int i6 = (i3 + i5) >>> 1;
            int i7 = iArr[i6];
            if (i7 < i2) {
                i3 = i6 + 1;
            } else {
                if (i7 <= i2) {
                    return i6;
                }
                i5 = i6 - 1;
            }
        }
        return (-i3) - 1;
    }

    public static final int b(x xVar, int i2) {
        r.g(xVar, "$this$segment");
        int iA = a(xVar.y(), i2 + 1, 0, xVar.z().length);
        return iA >= 0 ? iA : ~iA;
    }
}