66 lines
1.7 KiB
Java
66 lines
1.7 KiB
Java
package androidx.collection;
|
|
public class ContainerHelpers {
|
|
public static final int[] EMPTY_INTS = new int[0];
|
|
public static final long[] EMPTY_LONGS = new long[0];
|
|
public static final Object[] EMPTY_OBJECTS = new Object[0];
|
|
|
|
private ContainerHelpers() {
|
|
}
|
|
|
|
public static int binarySearch(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;
|
|
}
|
|
|
|
public static int binarySearch(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;
|
|
}
|
|
|
|
public static boolean equal(Object obj, Object obj2) {
|
|
return obj == obj2 || (obj != null && obj.equals(obj2));
|
|
}
|
|
|
|
public static int idealByteArraySize(int i) {
|
|
for (int i2 = 4; i2 < 32; i2++) {
|
|
int i3 = (1 << i2) - 12;
|
|
if (i <= i3) {
|
|
return i3;
|
|
}
|
|
}
|
|
return i;
|
|
}
|
|
|
|
public static int idealIntArraySize(int i) {
|
|
return idealByteArraySize(i * 4) / 4;
|
|
}
|
|
|
|
public static int idealLongArraySize(int i) {
|
|
return idealByteArraySize(i * 8) / 8;
|
|
}
|
|
}
|