- 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
533 lines
22 KiB
Java
533 lines
22 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 java.util.Iterator;
|
|
import kotlin.collections.ArraysKt___ArraysJvmKt;
|
|
import kotlin.collections.LongIterator;
|
|
import kotlin.jvm.functions.Function0;
|
|
import kotlin.jvm.functions.Function2;
|
|
import kotlin.jvm.internal.Intrinsics;
|
|
import kotlin.jvm.internal.SourceDebugExtension;
|
|
|
|
@SourceDebugExtension({"SMAP\nLongSparseArray.kt\nKotlin\n*S Kotlin\n*F\n+ 1 LongSparseArray.kt\nandroidx/collection/LongSparseArrayKt\n*L\n1#1,606:1\n256#1,6:607\n256#1,6:613\n328#1,18:619\n328#1,18:637\n328#1,18:655\n328#1,18:673\n328#1,18:691\n328#1,18:709\n328#1,18:727\n328#1,18:745\n*S KotlinDebug\n*F\n+ 1 LongSparseArray.kt\nandroidx/collection/LongSparseArrayKt\n*L\n243#1:607,6\n248#1:613,6\n360#1:619,18\n410#1:637,18\n425#1:655,18\n437#1:673,18\n451#1:691,18\n459#1:709,18\n467#1:727,18\n505#1:745,18\n*E\n"})
|
|
/* loaded from: classes.dex */
|
|
public final class LongSparseArrayKt {
|
|
private static final Object DELETED = new Object();
|
|
|
|
public static /* synthetic */ void getSize$annotations(LongSparseArray longSparseArray) {
|
|
}
|
|
|
|
public static final <E> E commonGet(LongSparseArray<E> longSparseArray, long j) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
int binarySearch = ContainerHelpersKt.binarySearch(longSparseArray.keys, longSparseArray.size, j);
|
|
if (binarySearch < 0 || longSparseArray.values[binarySearch] == DELETED) {
|
|
return null;
|
|
}
|
|
return (E) longSparseArray.values[binarySearch];
|
|
}
|
|
|
|
public static final <E> E commonGet(LongSparseArray<E> longSparseArray, long j, E e) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
int binarySearch = ContainerHelpersKt.binarySearch(longSparseArray.keys, longSparseArray.size, j);
|
|
return (binarySearch < 0 || longSparseArray.values[binarySearch] == DELETED) ? e : (E) longSparseArray.values[binarySearch];
|
|
}
|
|
|
|
public static final <T extends E, E> T commonGetInternal(LongSparseArray<E> longSparseArray, long j, T t) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
int binarySearch = ContainerHelpersKt.binarySearch(longSparseArray.keys, longSparseArray.size, j);
|
|
return (binarySearch < 0 || longSparseArray.values[binarySearch] == DELETED) ? t : (T) longSparseArray.values[binarySearch];
|
|
}
|
|
|
|
public static final <E> void commonRemove(LongSparseArray<E> longSparseArray, long j) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
int binarySearch = ContainerHelpersKt.binarySearch(longSparseArray.keys, longSparseArray.size, j);
|
|
if (binarySearch < 0 || longSparseArray.values[binarySearch] == DELETED) {
|
|
return;
|
|
}
|
|
longSparseArray.values[binarySearch] = DELETED;
|
|
longSparseArray.garbage = true;
|
|
}
|
|
|
|
public static final <E> boolean commonRemove(LongSparseArray<E> longSparseArray, long j, E e) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
int indexOfKey = longSparseArray.indexOfKey(j);
|
|
if (indexOfKey < 0 || !Intrinsics.areEqual(e, longSparseArray.valueAt(indexOfKey))) {
|
|
return false;
|
|
}
|
|
longSparseArray.removeAt(indexOfKey);
|
|
return true;
|
|
}
|
|
|
|
public static final <E> void commonRemoveAt(LongSparseArray<E> longSparseArray, int i) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
if (longSparseArray.values[i] != DELETED) {
|
|
longSparseArray.values[i] = DELETED;
|
|
longSparseArray.garbage = true;
|
|
}
|
|
}
|
|
|
|
public static final <E> E commonReplace(LongSparseArray<E> longSparseArray, long j, E e) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
int indexOfKey = longSparseArray.indexOfKey(j);
|
|
if (indexOfKey < 0) {
|
|
return null;
|
|
}
|
|
Object[] objArr = longSparseArray.values;
|
|
E e2 = (E) objArr[indexOfKey];
|
|
objArr[indexOfKey] = e;
|
|
return e2;
|
|
}
|
|
|
|
public static final <E> boolean commonReplace(LongSparseArray<E> longSparseArray, long j, E e, E e2) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
int indexOfKey = longSparseArray.indexOfKey(j);
|
|
if (indexOfKey < 0 || !Intrinsics.areEqual(longSparseArray.values[indexOfKey], e)) {
|
|
return false;
|
|
}
|
|
longSparseArray.values[indexOfKey] = e2;
|
|
return true;
|
|
}
|
|
|
|
public static final <E> void commonGc(LongSparseArray<E> longSparseArray) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
int i = longSparseArray.size;
|
|
long[] jArr = longSparseArray.keys;
|
|
Object[] objArr = longSparseArray.values;
|
|
int i2 = 0;
|
|
for (int i3 = 0; i3 < i; i3++) {
|
|
Object obj = objArr[i3];
|
|
if (obj != DELETED) {
|
|
if (i3 != i2) {
|
|
jArr[i2] = jArr[i3];
|
|
objArr[i2] = obj;
|
|
objArr[i3] = null;
|
|
}
|
|
i2++;
|
|
}
|
|
}
|
|
longSparseArray.garbage = false;
|
|
longSparseArray.size = i2;
|
|
}
|
|
|
|
public static final <E> void commonPut(LongSparseArray<E> longSparseArray, long j, E e) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
int binarySearch = ContainerHelpersKt.binarySearch(longSparseArray.keys, longSparseArray.size, j);
|
|
if (binarySearch >= 0) {
|
|
longSparseArray.values[binarySearch] = e;
|
|
return;
|
|
}
|
|
int i = ~binarySearch;
|
|
if (i < longSparseArray.size && longSparseArray.values[i] == DELETED) {
|
|
longSparseArray.keys[i] = j;
|
|
longSparseArray.values[i] = e;
|
|
return;
|
|
}
|
|
if (longSparseArray.garbage) {
|
|
int i2 = longSparseArray.size;
|
|
long[] jArr = longSparseArray.keys;
|
|
if (i2 >= jArr.length) {
|
|
Object[] objArr = longSparseArray.values;
|
|
int i3 = 0;
|
|
for (int i4 = 0; i4 < i2; i4++) {
|
|
Object obj = objArr[i4];
|
|
if (obj != DELETED) {
|
|
if (i4 != i3) {
|
|
jArr[i3] = jArr[i4];
|
|
objArr[i3] = obj;
|
|
objArr[i4] = null;
|
|
}
|
|
i3++;
|
|
}
|
|
}
|
|
longSparseArray.garbage = false;
|
|
longSparseArray.size = i3;
|
|
i = ~ContainerHelpersKt.binarySearch(longSparseArray.keys, i3, j);
|
|
}
|
|
}
|
|
int i5 = longSparseArray.size;
|
|
if (i5 >= longSparseArray.keys.length) {
|
|
int idealLongArraySize = ContainerHelpersKt.idealLongArraySize(i5 + 1);
|
|
long[] copyOf = Arrays.copyOf(longSparseArray.keys, idealLongArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf, "copyOf(this, newSize)");
|
|
longSparseArray.keys = copyOf;
|
|
Object[] copyOf2 = Arrays.copyOf(longSparseArray.values, idealLongArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf2, "copyOf(this, newSize)");
|
|
longSparseArray.values = copyOf2;
|
|
}
|
|
int i6 = longSparseArray.size;
|
|
if (i6 - i != 0) {
|
|
long[] jArr2 = longSparseArray.keys;
|
|
int i7 = i + 1;
|
|
ArraysKt___ArraysJvmKt.copyInto(jArr2, jArr2, i7, i, i6);
|
|
Object[] objArr2 = longSparseArray.values;
|
|
ArraysKt___ArraysJvmKt.copyInto(objArr2, objArr2, i7, i, longSparseArray.size);
|
|
}
|
|
longSparseArray.keys[i] = j;
|
|
longSparseArray.values[i] = e;
|
|
longSparseArray.size++;
|
|
}
|
|
|
|
public static final <E> void commonPutAll(LongSparseArray<E> longSparseArray, LongSparseArray<? extends E> other) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
Intrinsics.checkNotNullParameter(other, "other");
|
|
int size = other.size();
|
|
for (int i = 0; i < size; i++) {
|
|
longSparseArray.put(other.keyAt(i), other.valueAt(i));
|
|
}
|
|
}
|
|
|
|
public static final <E> E commonPutIfAbsent(LongSparseArray<E> longSparseArray, long j, E e) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
E e2 = longSparseArray.get(j);
|
|
if (e2 == null) {
|
|
longSparseArray.put(j, e);
|
|
}
|
|
return e2;
|
|
}
|
|
|
|
public static final <E> int commonSize(LongSparseArray<E> longSparseArray) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
if (longSparseArray.garbage) {
|
|
int i = longSparseArray.size;
|
|
long[] jArr = longSparseArray.keys;
|
|
Object[] objArr = longSparseArray.values;
|
|
int i2 = 0;
|
|
for (int i3 = 0; i3 < i; i3++) {
|
|
Object obj = objArr[i3];
|
|
if (obj != DELETED) {
|
|
if (i3 != i2) {
|
|
jArr[i2] = jArr[i3];
|
|
objArr[i2] = obj;
|
|
objArr[i3] = null;
|
|
}
|
|
i2++;
|
|
}
|
|
}
|
|
longSparseArray.garbage = false;
|
|
longSparseArray.size = i2;
|
|
}
|
|
return longSparseArray.size;
|
|
}
|
|
|
|
public static final <E> boolean commonIsEmpty(LongSparseArray<E> longSparseArray) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
return longSparseArray.size() == 0;
|
|
}
|
|
|
|
public static final <E> long commonKeyAt(LongSparseArray<E> longSparseArray, int i) {
|
|
int i2;
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
if (i < 0 || i >= (i2 = longSparseArray.size)) {
|
|
throw new IllegalArgumentException(("Expected index to be within 0..size()-1, but was " + i).toString());
|
|
}
|
|
if (longSparseArray.garbage) {
|
|
long[] jArr = longSparseArray.keys;
|
|
Object[] objArr = longSparseArray.values;
|
|
int i3 = 0;
|
|
for (int i4 = 0; i4 < i2; i4++) {
|
|
Object obj = objArr[i4];
|
|
if (obj != DELETED) {
|
|
if (i4 != i3) {
|
|
jArr[i3] = jArr[i4];
|
|
objArr[i3] = obj;
|
|
objArr[i4] = null;
|
|
}
|
|
i3++;
|
|
}
|
|
}
|
|
longSparseArray.garbage = false;
|
|
longSparseArray.size = i3;
|
|
}
|
|
return longSparseArray.keys[i];
|
|
}
|
|
|
|
public static final <E> E commonValueAt(LongSparseArray<E> longSparseArray, int i) {
|
|
int i2;
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
if (i < 0 || i >= (i2 = longSparseArray.size)) {
|
|
throw new IllegalArgumentException(("Expected index to be within 0..size()-1, but was " + i).toString());
|
|
}
|
|
if (longSparseArray.garbage) {
|
|
long[] jArr = longSparseArray.keys;
|
|
Object[] objArr = longSparseArray.values;
|
|
int i3 = 0;
|
|
for (int i4 = 0; i4 < i2; i4++) {
|
|
Object obj = objArr[i4];
|
|
if (obj != DELETED) {
|
|
if (i4 != i3) {
|
|
jArr[i3] = jArr[i4];
|
|
objArr[i3] = obj;
|
|
objArr[i4] = null;
|
|
}
|
|
i3++;
|
|
}
|
|
}
|
|
longSparseArray.garbage = false;
|
|
longSparseArray.size = i3;
|
|
}
|
|
return (E) longSparseArray.values[i];
|
|
}
|
|
|
|
public static final <E> void commonSetValueAt(LongSparseArray<E> longSparseArray, int i, E e) {
|
|
int i2;
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
if (i < 0 || i >= (i2 = longSparseArray.size)) {
|
|
throw new IllegalArgumentException(("Expected index to be within 0..size()-1, but was " + i).toString());
|
|
}
|
|
if (longSparseArray.garbage) {
|
|
long[] jArr = longSparseArray.keys;
|
|
Object[] objArr = longSparseArray.values;
|
|
int i3 = 0;
|
|
for (int i4 = 0; i4 < i2; i4++) {
|
|
Object obj = objArr[i4];
|
|
if (obj != DELETED) {
|
|
if (i4 != i3) {
|
|
jArr[i3] = jArr[i4];
|
|
objArr[i3] = obj;
|
|
objArr[i4] = null;
|
|
}
|
|
i3++;
|
|
}
|
|
}
|
|
longSparseArray.garbage = false;
|
|
longSparseArray.size = i3;
|
|
}
|
|
longSparseArray.values[i] = e;
|
|
}
|
|
|
|
public static final <E> int commonIndexOfKey(LongSparseArray<E> longSparseArray, long j) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
if (longSparseArray.garbage) {
|
|
int i = longSparseArray.size;
|
|
long[] jArr = longSparseArray.keys;
|
|
Object[] objArr = longSparseArray.values;
|
|
int i2 = 0;
|
|
for (int i3 = 0; i3 < i; i3++) {
|
|
Object obj = objArr[i3];
|
|
if (obj != DELETED) {
|
|
if (i3 != i2) {
|
|
jArr[i2] = jArr[i3];
|
|
objArr[i2] = obj;
|
|
objArr[i3] = null;
|
|
}
|
|
i2++;
|
|
}
|
|
}
|
|
longSparseArray.garbage = false;
|
|
longSparseArray.size = i2;
|
|
}
|
|
return ContainerHelpersKt.binarySearch(longSparseArray.keys, longSparseArray.size, j);
|
|
}
|
|
|
|
public static final <E> int commonIndexOfValue(LongSparseArray<E> longSparseArray, E e) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
if (longSparseArray.garbage) {
|
|
int i = longSparseArray.size;
|
|
long[] jArr = longSparseArray.keys;
|
|
Object[] objArr = longSparseArray.values;
|
|
int i2 = 0;
|
|
for (int i3 = 0; i3 < i; i3++) {
|
|
Object obj = objArr[i3];
|
|
if (obj != DELETED) {
|
|
if (i3 != i2) {
|
|
jArr[i2] = jArr[i3];
|
|
objArr[i2] = obj;
|
|
objArr[i3] = null;
|
|
}
|
|
i2++;
|
|
}
|
|
}
|
|
longSparseArray.garbage = false;
|
|
longSparseArray.size = i2;
|
|
}
|
|
int i4 = longSparseArray.size;
|
|
for (int i5 = 0; i5 < i4; i5++) {
|
|
if (longSparseArray.values[i5] == e) {
|
|
return i5;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
public static final <E> boolean commonContainsKey(LongSparseArray<E> longSparseArray, long j) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
return longSparseArray.indexOfKey(j) >= 0;
|
|
}
|
|
|
|
public static final <E> boolean commonContainsValue(LongSparseArray<E> longSparseArray, E e) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
return longSparseArray.indexOfValue(e) >= 0;
|
|
}
|
|
|
|
public static final <E> void commonClear(LongSparseArray<E> longSparseArray) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
int i = longSparseArray.size;
|
|
Object[] objArr = longSparseArray.values;
|
|
for (int i2 = 0; i2 < i; i2++) {
|
|
objArr[i2] = null;
|
|
}
|
|
longSparseArray.size = 0;
|
|
longSparseArray.garbage = false;
|
|
}
|
|
|
|
public static final <E> void commonAppend(LongSparseArray<E> longSparseArray, long j, E e) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
int i = longSparseArray.size;
|
|
if (i != 0 && j <= longSparseArray.keys[i - 1]) {
|
|
longSparseArray.put(j, e);
|
|
return;
|
|
}
|
|
if (longSparseArray.garbage) {
|
|
long[] jArr = longSparseArray.keys;
|
|
if (i >= jArr.length) {
|
|
Object[] objArr = longSparseArray.values;
|
|
int i2 = 0;
|
|
for (int i3 = 0; i3 < i; i3++) {
|
|
Object obj = objArr[i3];
|
|
if (obj != DELETED) {
|
|
if (i3 != i2) {
|
|
jArr[i2] = jArr[i3];
|
|
objArr[i2] = obj;
|
|
objArr[i3] = null;
|
|
}
|
|
i2++;
|
|
}
|
|
}
|
|
longSparseArray.garbage = false;
|
|
longSparseArray.size = i2;
|
|
}
|
|
}
|
|
int i4 = longSparseArray.size;
|
|
if (i4 >= longSparseArray.keys.length) {
|
|
int idealLongArraySize = ContainerHelpersKt.idealLongArraySize(i4 + 1);
|
|
long[] copyOf = Arrays.copyOf(longSparseArray.keys, idealLongArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf, "copyOf(this, newSize)");
|
|
longSparseArray.keys = copyOf;
|
|
Object[] copyOf2 = Arrays.copyOf(longSparseArray.values, idealLongArraySize);
|
|
Intrinsics.checkNotNullExpressionValue(copyOf2, "copyOf(this, newSize)");
|
|
longSparseArray.values = copyOf2;
|
|
}
|
|
longSparseArray.keys[i4] = j;
|
|
longSparseArray.values[i4] = e;
|
|
longSparseArray.size = i4 + 1;
|
|
}
|
|
|
|
public static final <E> String commonToString(LongSparseArray<E> longSparseArray) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
if (longSparseArray.size() <= 0) {
|
|
return JsonUtils.EMPTY_JSON;
|
|
}
|
|
StringBuilder sb = new StringBuilder(longSparseArray.size * 28);
|
|
sb.append('{');
|
|
int i = longSparseArray.size;
|
|
for (int i2 = 0; i2 < i; i2++) {
|
|
if (i2 > 0) {
|
|
sb.append(", ");
|
|
}
|
|
sb.append(longSparseArray.keyAt(i2));
|
|
sb.append(nb.T);
|
|
E valueAt = longSparseArray.valueAt(i2);
|
|
if (valueAt != sb) {
|
|
sb.append(valueAt);
|
|
} else {
|
|
sb.append("(this Map)");
|
|
}
|
|
}
|
|
sb.append('}');
|
|
String sb2 = sb.toString();
|
|
Intrinsics.checkNotNullExpressionValue(sb2, "StringBuilder(capacity).…builderAction).toString()");
|
|
return sb2;
|
|
}
|
|
|
|
public static final <T> int getSize(LongSparseArray<T> longSparseArray) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
return longSparseArray.size();
|
|
}
|
|
|
|
public static final <T> boolean contains(LongSparseArray<T> longSparseArray, long j) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
return longSparseArray.containsKey(j);
|
|
}
|
|
|
|
public static final <T> void set(LongSparseArray<T> longSparseArray, long j, T t) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
longSparseArray.put(j, t);
|
|
}
|
|
|
|
public static final <T> LongSparseArray<T> plus(LongSparseArray<T> longSparseArray, LongSparseArray<T> other) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
Intrinsics.checkNotNullParameter(other, "other");
|
|
LongSparseArray<T> longSparseArray2 = new LongSparseArray<>(longSparseArray.size() + other.size());
|
|
longSparseArray2.putAll(longSparseArray);
|
|
longSparseArray2.putAll(other);
|
|
return longSparseArray2;
|
|
}
|
|
|
|
public static final <T> T getOrDefault(LongSparseArray<T> longSparseArray, long j, T t) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
return longSparseArray.get(j, t);
|
|
}
|
|
|
|
public static final <T> T getOrElse(LongSparseArray<T> longSparseArray, long j, Function0 defaultValue) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
Intrinsics.checkNotNullParameter(defaultValue, "defaultValue");
|
|
T t = longSparseArray.get(j);
|
|
return t == null ? (T) defaultValue.invoke() : t;
|
|
}
|
|
|
|
public static final <T> boolean isNotEmpty(LongSparseArray<T> longSparseArray) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
return !longSparseArray.isEmpty();
|
|
}
|
|
|
|
public static final /* synthetic */ boolean remove(LongSparseArray longSparseArray, long j, Object obj) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
return longSparseArray.remove(j, obj);
|
|
}
|
|
|
|
public static final <T> void forEach(LongSparseArray<T> longSparseArray, Function2 action) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
Intrinsics.checkNotNullParameter(action, "action");
|
|
int size = longSparseArray.size();
|
|
for (int i = 0; i < size; i++) {
|
|
action.invoke(Long.valueOf(longSparseArray.keyAt(i)), longSparseArray.valueAt(i));
|
|
}
|
|
}
|
|
|
|
public static final <T> LongIterator keyIterator(final LongSparseArray<T> longSparseArray) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
return new LongIterator() { // from class: androidx.collection.LongSparseArrayKt$keyIterator$1
|
|
private int index;
|
|
|
|
public final int getIndex() {
|
|
return this.index;
|
|
}
|
|
|
|
public final void setIndex(int i) {
|
|
this.index = i;
|
|
}
|
|
|
|
@Override // java.util.Iterator
|
|
public boolean hasNext() {
|
|
return this.index < longSparseArray.size();
|
|
}
|
|
|
|
@Override // kotlin.collections.LongIterator
|
|
public long nextLong() {
|
|
LongSparseArray<T> longSparseArray2 = longSparseArray;
|
|
int i = this.index;
|
|
this.index = i + 1;
|
|
return longSparseArray2.keyAt(i);
|
|
}
|
|
};
|
|
}
|
|
|
|
public static final <T> Iterator<T> valueIterator(LongSparseArray<T> longSparseArray) {
|
|
Intrinsics.checkNotNullParameter(longSparseArray, "<this>");
|
|
return new LongSparseArrayKt$valueIterator$1(longSparseArray);
|
|
}
|
|
}
|