package I1;

import kotlin.jvm.internal.l;
import okio.B;

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

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