Daniel Elliott
c080f0d97f
- Added realracing3-community.apk (71.57 MB) - Removed 32-bit support (armeabi-v7a) - Only includes arm64-v8a libraries - Decompiled source code included - Added README-community.md with analysis
396 lines
18 KiB
Java
396 lines
18 KiB
Java
package androidx.collection;
|
|
|
|
import androidx.collection.internal.ContainerHelpersKt;
|
|
import com.applovin.impl.sdk.utils.JsonUtils;
|
|
import com.ironsource.nb;
|
|
import java.util.Arrays;
|
|
import kotlin.collections.ArraysKt___ArraysJvmKt;
|
|
import kotlin.jvm.internal.Intrinsics;
|
|
import kotlin.jvm.internal.SourceDebugExtension;
|
|
|
|
@SourceDebugExtension({"SMAP\nSparseArrayCompat.kt\nKotlin\n*S Kotlin\n*F\n+ 1 SparseArrayCompat.kt\nandroidx/collection/SparseArrayCompatKt\n*L\n1#1,535:1\n244#1,6:536\n244#1,6:542\n353#1,40:548\n353#1,40:588\n459#1,9:628\n*S KotlinDebug\n*F\n+ 1 SparseArrayCompat.kt\nandroidx/collection/SparseArrayCompatKt\n*L\n255#1:536,6\n260#1:542,6\n397#1:548,40\n405#1:588,40\n477#1:628,9\n*E\n"})
|
|
/* loaded from: classes.dex */
|
|
public final class SparseArrayCompatKt {
|
|
private static final Object DELETED = new Object();
|
|
|
|
public static final <E> E commonGet(SparseArrayCompat<E> sparseArrayCompat, int i) {
|
|
E e;
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
int binarySearch = ContainerHelpersKt.binarySearch(sparseArrayCompat.keys, sparseArrayCompat.size, i);
|
|
if (binarySearch < 0 || (e = (E) sparseArrayCompat.values[binarySearch]) == DELETED) {
|
|
return null;
|
|
}
|
|
return e;
|
|
}
|
|
|
|
public static final <E> E commonGet(SparseArrayCompat<E> sparseArrayCompat, int i, E e) {
|
|
E e2;
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
int binarySearch = ContainerHelpersKt.binarySearch(sparseArrayCompat.keys, sparseArrayCompat.size, i);
|
|
return (binarySearch < 0 || (e2 = (E) sparseArrayCompat.values[binarySearch]) == DELETED) ? e : e2;
|
|
}
|
|
|
|
private static final <E, T extends E> T internalGet(SparseArrayCompat<E> sparseArrayCompat, int i, T t) {
|
|
T t2;
|
|
int binarySearch = ContainerHelpersKt.binarySearch(sparseArrayCompat.keys, sparseArrayCompat.size, i);
|
|
return (binarySearch < 0 || (t2 = (T) sparseArrayCompat.values[binarySearch]) == DELETED) ? t : t2;
|
|
}
|
|
|
|
public static final <E> void commonRemove(SparseArrayCompat<E> sparseArrayCompat, int i) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
int binarySearch = ContainerHelpersKt.binarySearch(sparseArrayCompat.keys, sparseArrayCompat.size, i);
|
|
if (binarySearch >= 0) {
|
|
Object[] objArr = sparseArrayCompat.values;
|
|
Object obj = objArr[binarySearch];
|
|
Object obj2 = DELETED;
|
|
if (obj != obj2) {
|
|
objArr[binarySearch] = obj2;
|
|
sparseArrayCompat.garbage = true;
|
|
}
|
|
}
|
|
}
|
|
|
|
public static final <E> boolean commonRemove(SparseArrayCompat<E> sparseArrayCompat, int i, Object obj) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
int indexOfKey = sparseArrayCompat.indexOfKey(i);
|
|
if (indexOfKey < 0 || !Intrinsics.areEqual(obj, sparseArrayCompat.valueAt(indexOfKey))) {
|
|
return false;
|
|
}
|
|
sparseArrayCompat.removeAt(indexOfKey);
|
|
return true;
|
|
}
|
|
|
|
public static final <E> void commonRemoveAt(SparseArrayCompat<E> sparseArrayCompat, int i) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
if (sparseArrayCompat.values[i] != DELETED) {
|
|
sparseArrayCompat.values[i] = DELETED;
|
|
sparseArrayCompat.garbage = true;
|
|
}
|
|
}
|
|
|
|
public static final <E> void commonRemoveAtRange(SparseArrayCompat<E> sparseArrayCompat, int i, int i2) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
int min = Math.min(i2, i + i2);
|
|
while (i < min) {
|
|
sparseArrayCompat.removeAt(i);
|
|
i++;
|
|
}
|
|
}
|
|
|
|
public static final <E> E commonReplace(SparseArrayCompat<E> sparseArrayCompat, int i, E e) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
int indexOfKey = sparseArrayCompat.indexOfKey(i);
|
|
if (indexOfKey < 0) {
|
|
return null;
|
|
}
|
|
Object[] objArr = sparseArrayCompat.values;
|
|
E e2 = (E) objArr[indexOfKey];
|
|
objArr[indexOfKey] = e;
|
|
return e2;
|
|
}
|
|
|
|
public static final <E> boolean commonReplace(SparseArrayCompat<E> sparseArrayCompat, int i, E e, E e2) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
int indexOfKey = sparseArrayCompat.indexOfKey(i);
|
|
if (indexOfKey < 0 || !Intrinsics.areEqual(sparseArrayCompat.values[indexOfKey], e)) {
|
|
return false;
|
|
}
|
|
sparseArrayCompat.values[indexOfKey] = e2;
|
|
return true;
|
|
}
|
|
|
|
/* JADX INFO: Access modifiers changed from: private */
|
|
public static final <E> void gc(SparseArrayCompat<E> sparseArrayCompat) {
|
|
int i = sparseArrayCompat.size;
|
|
int[] iArr = sparseArrayCompat.keys;
|
|
Object[] objArr = sparseArrayCompat.values;
|
|
int i2 = 0;
|
|
for (int i3 = 0; i3 < i; i3++) {
|
|
Object obj = objArr[i3];
|
|
if (obj != DELETED) {
|
|
if (i3 != i2) {
|
|
iArr[i2] = iArr[i3];
|
|
objArr[i2] = obj;
|
|
objArr[i3] = null;
|
|
}
|
|
i2++;
|
|
}
|
|
}
|
|
sparseArrayCompat.garbage = false;
|
|
sparseArrayCompat.size = i2;
|
|
}
|
|
|
|
public static final <E> void commonPut(SparseArrayCompat<E> sparseArrayCompat, int i, E e) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
int binarySearch = ContainerHelpersKt.binarySearch(sparseArrayCompat.keys, sparseArrayCompat.size, i);
|
|
if (binarySearch >= 0) {
|
|
sparseArrayCompat.values[binarySearch] = e;
|
|
return;
|
|
}
|
|
int i2 = ~binarySearch;
|
|
if (i2 < sparseArrayCompat.size && sparseArrayCompat.values[i2] == DELETED) {
|
|
sparseArrayCompat.keys[i2] = i;
|
|
sparseArrayCompat.values[i2] = e;
|
|
return;
|
|
}
|
|
if (sparseArrayCompat.garbage && sparseArrayCompat.size >= sparseArrayCompat.keys.length) {
|
|
gc(sparseArrayCompat);
|
|
i2 = ~ContainerHelpersKt.binarySearch(sparseArrayCompat.keys, sparseArrayCompat.size, i);
|
|
}
|
|
int i3 = sparseArrayCompat.size;
|
|
if (i3 >= sparseArrayCompat.keys.length) {
|
|
int idealIntArraySize = ContainerHelpersKt.idealIntArraySize(i3 + 1);
|
|
int[] copyOf = Arrays.copyOf(sparseArrayCompat.keys, idealIntArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf, "copyOf(this, newSize)");
|
|
sparseArrayCompat.keys = copyOf;
|
|
Object[] copyOf2 = Arrays.copyOf(sparseArrayCompat.values, idealIntArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf2, "copyOf(this, newSize)");
|
|
sparseArrayCompat.values = copyOf2;
|
|
}
|
|
int i4 = sparseArrayCompat.size;
|
|
if (i4 - i2 != 0) {
|
|
int[] iArr = sparseArrayCompat.keys;
|
|
int i5 = i2 + 1;
|
|
ArraysKt___ArraysJvmKt.copyInto(iArr, iArr, i5, i2, i4);
|
|
Object[] objArr = sparseArrayCompat.values;
|
|
ArraysKt___ArraysJvmKt.copyInto(objArr, objArr, i5, i2, sparseArrayCompat.size);
|
|
}
|
|
sparseArrayCompat.keys[i2] = i;
|
|
sparseArrayCompat.values[i2] = e;
|
|
sparseArrayCompat.size++;
|
|
}
|
|
|
|
public static final <E> void commonPutAll(SparseArrayCompat<E> sparseArrayCompat, SparseArrayCompat<? extends E> other) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
Intrinsics.checkNotNullParameter(other, "other");
|
|
int size = other.size();
|
|
for (int i = 0; i < size; i++) {
|
|
int keyAt = other.keyAt(i);
|
|
E valueAt = other.valueAt(i);
|
|
int binarySearch = ContainerHelpersKt.binarySearch(sparseArrayCompat.keys, sparseArrayCompat.size, keyAt);
|
|
if (binarySearch >= 0) {
|
|
sparseArrayCompat.values[binarySearch] = valueAt;
|
|
} else {
|
|
int i2 = ~binarySearch;
|
|
if (i2 < sparseArrayCompat.size && sparseArrayCompat.values[i2] == DELETED) {
|
|
sparseArrayCompat.keys[i2] = keyAt;
|
|
sparseArrayCompat.values[i2] = valueAt;
|
|
} else {
|
|
if (sparseArrayCompat.garbage && sparseArrayCompat.size >= sparseArrayCompat.keys.length) {
|
|
gc(sparseArrayCompat);
|
|
i2 = ~ContainerHelpersKt.binarySearch(sparseArrayCompat.keys, sparseArrayCompat.size, keyAt);
|
|
}
|
|
int i3 = sparseArrayCompat.size;
|
|
if (i3 >= sparseArrayCompat.keys.length) {
|
|
int idealIntArraySize = ContainerHelpersKt.idealIntArraySize(i3 + 1);
|
|
int[] copyOf = Arrays.copyOf(sparseArrayCompat.keys, idealIntArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf, "copyOf(this, newSize)");
|
|
sparseArrayCompat.keys = copyOf;
|
|
Object[] copyOf2 = Arrays.copyOf(sparseArrayCompat.values, idealIntArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf2, "copyOf(this, newSize)");
|
|
sparseArrayCompat.values = copyOf2;
|
|
}
|
|
int i4 = sparseArrayCompat.size;
|
|
if (i4 - i2 != 0) {
|
|
int[] iArr = sparseArrayCompat.keys;
|
|
int i5 = i2 + 1;
|
|
ArraysKt___ArraysJvmKt.copyInto(iArr, iArr, i5, i2, i4);
|
|
Object[] objArr = sparseArrayCompat.values;
|
|
ArraysKt___ArraysJvmKt.copyInto(objArr, objArr, i5, i2, sparseArrayCompat.size);
|
|
}
|
|
sparseArrayCompat.keys[i2] = keyAt;
|
|
sparseArrayCompat.values[i2] = valueAt;
|
|
sparseArrayCompat.size++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
public static final <E> E commonPutIfAbsent(SparseArrayCompat<E> sparseArrayCompat, int i, E e) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
E e2 = (E) commonGet(sparseArrayCompat, i);
|
|
if (e2 == null) {
|
|
int binarySearch = ContainerHelpersKt.binarySearch(sparseArrayCompat.keys, sparseArrayCompat.size, i);
|
|
if (binarySearch >= 0) {
|
|
sparseArrayCompat.values[binarySearch] = e;
|
|
} else {
|
|
int i2 = ~binarySearch;
|
|
if (i2 < sparseArrayCompat.size && sparseArrayCompat.values[i2] == DELETED) {
|
|
sparseArrayCompat.keys[i2] = i;
|
|
sparseArrayCompat.values[i2] = e;
|
|
} else {
|
|
if (sparseArrayCompat.garbage && sparseArrayCompat.size >= sparseArrayCompat.keys.length) {
|
|
gc(sparseArrayCompat);
|
|
i2 = ~ContainerHelpersKt.binarySearch(sparseArrayCompat.keys, sparseArrayCompat.size, i);
|
|
}
|
|
int i3 = sparseArrayCompat.size;
|
|
if (i3 >= sparseArrayCompat.keys.length) {
|
|
int idealIntArraySize = ContainerHelpersKt.idealIntArraySize(i3 + 1);
|
|
int[] copyOf = Arrays.copyOf(sparseArrayCompat.keys, idealIntArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf, "copyOf(this, newSize)");
|
|
sparseArrayCompat.keys = copyOf;
|
|
Object[] copyOf2 = Arrays.copyOf(sparseArrayCompat.values, idealIntArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf2, "copyOf(this, newSize)");
|
|
sparseArrayCompat.values = copyOf2;
|
|
}
|
|
int i4 = sparseArrayCompat.size;
|
|
if (i4 - i2 != 0) {
|
|
int[] iArr = sparseArrayCompat.keys;
|
|
int i5 = i2 + 1;
|
|
ArraysKt___ArraysJvmKt.copyInto(iArr, iArr, i5, i2, i4);
|
|
Object[] objArr = sparseArrayCompat.values;
|
|
ArraysKt___ArraysJvmKt.copyInto(objArr, objArr, i5, i2, sparseArrayCompat.size);
|
|
}
|
|
sparseArrayCompat.keys[i2] = i;
|
|
sparseArrayCompat.values[i2] = e;
|
|
sparseArrayCompat.size++;
|
|
}
|
|
}
|
|
}
|
|
return e2;
|
|
}
|
|
|
|
public static final <E> int commonSize(SparseArrayCompat<E> sparseArrayCompat) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
if (sparseArrayCompat.garbage) {
|
|
gc(sparseArrayCompat);
|
|
}
|
|
return sparseArrayCompat.size;
|
|
}
|
|
|
|
public static final <E> boolean commonIsEmpty(SparseArrayCompat<E> sparseArrayCompat) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
return sparseArrayCompat.size() == 0;
|
|
}
|
|
|
|
public static final <E> int commonKeyAt(SparseArrayCompat<E> sparseArrayCompat, int i) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
if (sparseArrayCompat.garbage) {
|
|
gc(sparseArrayCompat);
|
|
}
|
|
return sparseArrayCompat.keys[i];
|
|
}
|
|
|
|
public static final <E> E commonValueAt(SparseArrayCompat<E> sparseArrayCompat, int i) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
if (sparseArrayCompat.garbage) {
|
|
gc(sparseArrayCompat);
|
|
}
|
|
return (E) sparseArrayCompat.values[i];
|
|
}
|
|
|
|
public static final <E> void commonSetValueAt(SparseArrayCompat<E> sparseArrayCompat, int i, E e) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
if (sparseArrayCompat.garbage) {
|
|
gc(sparseArrayCompat);
|
|
}
|
|
sparseArrayCompat.values[i] = e;
|
|
}
|
|
|
|
public static final <E> int commonIndexOfKey(SparseArrayCompat<E> sparseArrayCompat, int i) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
if (sparseArrayCompat.garbage) {
|
|
gc(sparseArrayCompat);
|
|
}
|
|
return ContainerHelpersKt.binarySearch(sparseArrayCompat.keys, sparseArrayCompat.size, i);
|
|
}
|
|
|
|
public static final <E> boolean commonContainsValue(SparseArrayCompat<E> sparseArrayCompat, E e) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
if (sparseArrayCompat.garbage) {
|
|
gc(sparseArrayCompat);
|
|
}
|
|
int i = sparseArrayCompat.size;
|
|
int i2 = 0;
|
|
while (i2 < i) {
|
|
if (sparseArrayCompat.values[i2] == e) {
|
|
return i2 >= 0;
|
|
}
|
|
i2++;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
public static final <E> int commonIndexOfValue(SparseArrayCompat<E> sparseArrayCompat, E e) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
if (sparseArrayCompat.garbage) {
|
|
gc(sparseArrayCompat);
|
|
}
|
|
int i = sparseArrayCompat.size;
|
|
for (int i2 = 0; i2 < i; i2++) {
|
|
if (sparseArrayCompat.values[i2] == e) {
|
|
return i2;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
public static final <E> boolean commonContainsKey(SparseArrayCompat<E> sparseArrayCompat, int i) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
return sparseArrayCompat.indexOfKey(i) >= 0;
|
|
}
|
|
|
|
public static final <E> void commonClear(SparseArrayCompat<E> sparseArrayCompat) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
int i = sparseArrayCompat.size;
|
|
Object[] objArr = sparseArrayCompat.values;
|
|
for (int i2 = 0; i2 < i; i2++) {
|
|
objArr[i2] = null;
|
|
}
|
|
sparseArrayCompat.size = 0;
|
|
sparseArrayCompat.garbage = false;
|
|
}
|
|
|
|
public static final <E> void commonAppend(SparseArrayCompat<E> sparseArrayCompat, int i, E e) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
int i2 = sparseArrayCompat.size;
|
|
if (i2 != 0 && i <= sparseArrayCompat.keys[i2 - 1]) {
|
|
sparseArrayCompat.put(i, e);
|
|
return;
|
|
}
|
|
if (sparseArrayCompat.garbage && i2 >= sparseArrayCompat.keys.length) {
|
|
gc(sparseArrayCompat);
|
|
}
|
|
int i3 = sparseArrayCompat.size;
|
|
if (i3 >= sparseArrayCompat.keys.length) {
|
|
int idealIntArraySize = ContainerHelpersKt.idealIntArraySize(i3 + 1);
|
|
int[] copyOf = Arrays.copyOf(sparseArrayCompat.keys, idealIntArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf, "copyOf(this, newSize)");
|
|
sparseArrayCompat.keys = copyOf;
|
|
Object[] copyOf2 = Arrays.copyOf(sparseArrayCompat.values, idealIntArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf2, "copyOf(this, newSize)");
|
|
sparseArrayCompat.values = copyOf2;
|
|
}
|
|
sparseArrayCompat.keys[i3] = i;
|
|
sparseArrayCompat.values[i3] = e;
|
|
sparseArrayCompat.size = i3 + 1;
|
|
}
|
|
|
|
public static final <E> String commonToString(SparseArrayCompat<E> sparseArrayCompat) {
|
|
Intrinsics.checkNotNullParameter(sparseArrayCompat, "<this>");
|
|
if (sparseArrayCompat.size() <= 0) {
|
|
return JsonUtils.EMPTY_JSON;
|
|
}
|
|
StringBuilder sb = new StringBuilder(sparseArrayCompat.size * 28);
|
|
sb.append('{');
|
|
int i = sparseArrayCompat.size;
|
|
for (int i2 = 0; i2 < i; i2++) {
|
|
if (i2 > 0) {
|
|
sb.append(", ");
|
|
}
|
|
sb.append(sparseArrayCompat.keyAt(i2));
|
|
sb.append(nb.T);
|
|
E valueAt = sparseArrayCompat.valueAt(i2);
|
|
if (valueAt != sparseArrayCompat) {
|
|
sb.append(valueAt);
|
|
} else {
|
|
sb.append("(this Map)");
|
|
}
|
|
}
|
|
sb.append('}');
|
|
String sb2 = sb.toString();
|
|
Intrinsics.checkNotNullExpressionValue(sb2, "buffer.toString()");
|
|
return sb2;
|
|
}
|
|
}
|