Add decompiled APK source code (JADX)

- 28,932 files
- Full Java source code
- Smali files
- Resources

Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>

decompiled/sources/androidx/collection/internal/ContainerHelpersKt.java

@@ -0,0 +1,70 @@
+package androidx.collection.internal;
+
+import kotlin.jvm.internal.Intrinsics;
+
+/* loaded from: classes.dex */
+public final class ContainerHelpersKt {
+    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];
+
+    public static final 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 final int idealIntArraySize(int i) {
+        return idealByteArraySize(i * 4) / 4;
+    }
+
+    public static final int idealLongArraySize(int i) {
+        return idealByteArraySize(i * 8) / 8;
+    }
+
+    public static final boolean equal(Object obj, Object obj2) {
+        return Intrinsics.areEqual(obj, obj2);
+    }
+
+    public static final int binarySearch(int[] array, int i, int i2) {
+        Intrinsics.checkNotNullParameter(array, "array");
+        int i3 = i - 1;
+        int i4 = 0;
+        while (i4 <= i3) {
+            int i5 = (i4 + i3) >>> 1;
+            int i6 = array[i5];
+            if (i6 < i2) {
+                i4 = i5 + 1;
+            } else {
+                if (i6 <= i2) {
+                    return i5;
+                }
+                i3 = i5 - 1;
+            }
+        }
+        return ~i4;
+    }
+
+    public static final int binarySearch(long[] array, int i, long j) {
+        Intrinsics.checkNotNullParameter(array, "array");
+        int i2 = i - 1;
+        int i3 = 0;
+        while (i3 <= i2) {
+            int i4 = (i3 + i2) >>> 1;
+            long j2 = array[i4];
+            if (j2 < j) {
+                i3 = i4 + 1;
+            } else {
+                if (j2 <= j) {
+                    return i4;
+                }
+                i2 = i4 - 1;
+            }
+        }
+        return ~i3;
+    }
+}