package ῲ.㴹;

/* renamed from: ῲ.㴹.㸾  reason: contains not printable characters */
/* compiled from: ContainerHelpers */
public class C2287 {

    /* renamed from: ʬ  reason: contains not printable characters */
    public static final Object[] f7900 = new Object[0];

    /* renamed from: ῲ  reason: contains not printable characters */
    public static final long[] f7901 = new long[0];

    /* renamed from: K  reason: contains not printable characters */
    public static final int[] f7902 = new int[0];

    /* renamed from: ʬ  reason: contains not printable characters */
    public static int m5965(int i) {
        return m5967(i * 8) / 8;
    }

    /* renamed from: ῲ  reason: contains not printable characters */
    public static int m5966(int i) {
        return m5967(i * 4) / 4;
    }

    /* renamed from: K  reason: contains not printable characters */
    public static int m5967(int i) {
        for (int i2 = 4; i2 < 32; i2++) {
            int i3 = (1 << i2) - 12;
            if (i <= i3) {
                return i3;
            }
        }
        return i;
    }

    /* renamed from: K  reason: contains not printable characters */
    public static boolean m5970(Object obj, Object obj2) {
        return obj == obj2 || (obj != null && obj.equals(obj2));
    }

    /* renamed from: K  reason: contains not printable characters */
    public static int m5968(int[] iArr, int i, int i2) {
        int i3 = i - 1;
        int i4 = 0;
        while (i4 <= i3) {
            int i5 = (i4 + i3) >>> 1;
            int i6 = iArr[i5];
            if (i6 < i2) {
                i4 = i5 + 1;
            } else if (i6 <= i2) {
                return i5;
            } else {
                i3 = i5 - 1;
            }
        }
        return ~i4;
    }

    /* renamed from: K  reason: contains not printable characters */
    public static int m5969(long[] jArr, int i, long j) {
        int i2 = i - 1;
        int i3 = 0;
        while (i3 <= i2) {
            int i4 = (i3 + i2) >>> 1;
            int i5 = (jArr[i4] > j ? 1 : (jArr[i4] == j ? 0 : -1));
            if (i5 < 0) {
                i3 = i4 + 1;
            } else if (i5 <= 0) {
                return i4;
            } else {
                i2 = i4 - 1;
            }
        }
        return ~i3;
    }
}
