mirror of
https://github.com/Pinball3D/Rabbit-R1.git
synced 2025-01-09 13:43:22 +00:00
181 lines
10 KiB
Java
181 lines
10 KiB
Java
package kotlin.collections;
|
|
|
|
import kotlin.Metadata;
|
|
import kotlin.UByteArray;
|
|
import kotlin.UIntArray;
|
|
import kotlin.ULongArray;
|
|
import kotlin.UShort;
|
|
import kotlin.UShortArray;
|
|
import kotlin.jvm.internal.Intrinsics;
|
|
|
|
/* compiled from: UArraySorting.kt */
|
|
@Metadata(d1 = {"\u00000\n\u0000\n\u0002\u0010\b\n\u0000\n\u0002\u0018\u0002\n\u0002\b\u0004\n\u0002\u0018\u0002\n\u0002\b\u0002\n\u0002\u0018\u0002\n\u0002\b\u0002\n\u0002\u0018\u0002\n\u0002\b\u0003\n\u0002\u0010\u0002\n\u0002\b\u0010\u001a'\u0010\u0000\u001a\u00020\u00012\u0006\u0010\u0002\u001a\u00020\u00032\u0006\u0010\u0004\u001a\u00020\u00012\u0006\u0010\u0005\u001a\u00020\u0001H\u0003¢\u0006\u0004\b\u0006\u0010\u0007\u001a'\u0010\u0000\u001a\u00020\u00012\u0006\u0010\u0002\u001a\u00020\b2\u0006\u0010\u0004\u001a\u00020\u00012\u0006\u0010\u0005\u001a\u00020\u0001H\u0003¢\u0006\u0004\b\t\u0010\n\u001a'\u0010\u0000\u001a\u00020\u00012\u0006\u0010\u0002\u001a\u00020\u000b2\u0006\u0010\u0004\u001a\u00020\u00012\u0006\u0010\u0005\u001a\u00020\u0001H\u0003¢\u0006\u0004\b\f\u0010\r\u001a'\u0010\u0000\u001a\u00020\u00012\u0006\u0010\u0002\u001a\u00020\u000e2\u0006\u0010\u0004\u001a\u00020\u00012\u0006\u0010\u0005\u001a\u00020\u0001H\u0003¢\u0006\u0004\b\u000f\u0010\u0010\u001a'\u0010\u0011\u001a\u00020\u00122\u0006\u0010\u0002\u001a\u00020\u00032\u0006\u0010\u0004\u001a\u00020\u00012\u0006\u0010\u0005\u001a\u00020\u0001H\u0003¢\u0006\u0004\b\u0013\u0010\u0014\u001a'\u0010\u0011\u001a\u00020\u00122\u0006\u0010\u0002\u001a\u00020\b2\u0006\u0010\u0004\u001a\u00020\u00012\u0006\u0010\u0005\u001a\u00020\u0001H\u0003¢\u0006\u0004\b\u0015\u0010\u0016\u001a'\u0010\u0011\u001a\u00020\u00122\u0006\u0010\u0002\u001a\u00020\u000b2\u0006\u0010\u0004\u001a\u00020\u00012\u0006\u0010\u0005\u001a\u00020\u0001H\u0003¢\u0006\u0004\b\u0017\u0010\u0018\u001a'\u0010\u0011\u001a\u00020\u00122\u0006\u0010\u0002\u001a\u00020\u000e2\u0006\u0010\u0004\u001a\u00020\u00012\u0006\u0010\u0005\u001a\u00020\u0001H\u0003¢\u0006\u0004\b\u0019\u0010\u001a\u001a'\u0010\u001b\u001a\u00020\u00122\u0006\u0010\u0002\u001a\u00020\u00032\u0006\u0010\u001c\u001a\u00020\u00012\u0006\u0010\u001d\u001a\u00020\u0001H\u0001¢\u0006\u0004\b\u001e\u0010\u0014\u001a'\u0010\u001b\u001a\u00020\u00122\u0006\u0010\u0002\u001a\u00020\b2\u0006\u0010\u001c\u001a\u00020\u00012\u0006\u0010\u001d\u001a\u00020\u0001H\u0001¢\u0006\u0004\b\u001f\u0010\u0016\u001a'\u0010\u001b\u001a\u00020\u00122\u0006\u0010\u0002\u001a\u00020\u000b2\u0006\u0010\u001c\u001a\u00020\u00012\u0006\u0010\u001d\u001a\u00020\u0001H\u0001¢\u0006\u0004\b \u0010\u0018\u001a'\u0010\u001b\u001a\u00020\u00122\u0006\u0010\u0002\u001a\u00020\u000e2\u0006\u0010\u001c\u001a\u00020\u00012\u0006\u0010\u001d\u001a\u00020\u0001H\u0001¢\u0006\u0004\b!\u0010\u001a¨\u0006\""}, d2 = {"partition", "", "array", "Lkotlin/UByteArray;", "left", "right", "partition-4UcCI2c", "([BII)I", "Lkotlin/UIntArray;", "partition-oBK06Vg", "([III)I", "Lkotlin/ULongArray;", "partition--nroSd4", "([JII)I", "Lkotlin/UShortArray;", "partition-Aa5vz7o", "([SII)I", "quickSort", "", "quickSort-4UcCI2c", "([BII)V", "quickSort-oBK06Vg", "([III)V", "quickSort--nroSd4", "([JII)V", "quickSort-Aa5vz7o", "([SII)V", "sortArray", "fromIndex", "toIndex", "sortArray-4UcCI2c", "sortArray-oBK06Vg", "sortArray--nroSd4", "sortArray-Aa5vz7o", "kotlin-stdlib"}, k = 2, mv = {1, 9, 0}, xi = 48)
|
|
/* loaded from: classes3.dex */
|
|
public final class UArraySortingKt {
|
|
/* renamed from: partition-4UcCI2c, reason: not valid java name */
|
|
private static final int m6154partition4UcCI2c(byte[] bArr, int i, int i2) {
|
|
int i3;
|
|
byte m5774getw2LRezQ = UByteArray.m5774getw2LRezQ(bArr, (i + i2) / 2);
|
|
while (i <= i2) {
|
|
while (true) {
|
|
i3 = m5774getw2LRezQ & 255;
|
|
if (Intrinsics.compare(UByteArray.m5774getw2LRezQ(bArr, i) & 255, i3) >= 0) {
|
|
break;
|
|
}
|
|
i++;
|
|
}
|
|
while (Intrinsics.compare(UByteArray.m5774getw2LRezQ(bArr, i2) & 255, i3) > 0) {
|
|
i2--;
|
|
}
|
|
if (i <= i2) {
|
|
byte m5774getw2LRezQ2 = UByteArray.m5774getw2LRezQ(bArr, i);
|
|
UByteArray.m5779setVurrAj0(bArr, i, UByteArray.m5774getw2LRezQ(bArr, i2));
|
|
UByteArray.m5779setVurrAj0(bArr, i2, m5774getw2LRezQ2);
|
|
i++;
|
|
i2--;
|
|
}
|
|
}
|
|
return i;
|
|
}
|
|
|
|
/* renamed from: quickSort-4UcCI2c, reason: not valid java name */
|
|
private static final void m6158quickSort4UcCI2c(byte[] bArr, int i, int i2) {
|
|
int m6154partition4UcCI2c = m6154partition4UcCI2c(bArr, i, i2);
|
|
int i3 = m6154partition4UcCI2c - 1;
|
|
if (i < i3) {
|
|
m6158quickSort4UcCI2c(bArr, i, i3);
|
|
}
|
|
if (m6154partition4UcCI2c < i2) {
|
|
m6158quickSort4UcCI2c(bArr, m6154partition4UcCI2c, i2);
|
|
}
|
|
}
|
|
|
|
/* renamed from: partition-Aa5vz7o, reason: not valid java name */
|
|
private static final int m6155partitionAa5vz7o(short[] sArr, int i, int i2) {
|
|
int i3;
|
|
short m6037getMh2AYeg = UShortArray.m6037getMh2AYeg(sArr, (i + i2) / 2);
|
|
while (i <= i2) {
|
|
while (true) {
|
|
int m6037getMh2AYeg2 = UShortArray.m6037getMh2AYeg(sArr, i) & UShort.MAX_VALUE;
|
|
i3 = m6037getMh2AYeg & UShort.MAX_VALUE;
|
|
if (Intrinsics.compare(m6037getMh2AYeg2, i3) >= 0) {
|
|
break;
|
|
}
|
|
i++;
|
|
}
|
|
while (Intrinsics.compare(UShortArray.m6037getMh2AYeg(sArr, i2) & UShort.MAX_VALUE, i3) > 0) {
|
|
i2--;
|
|
}
|
|
if (i <= i2) {
|
|
short m6037getMh2AYeg3 = UShortArray.m6037getMh2AYeg(sArr, i);
|
|
UShortArray.m6042set01HTLdE(sArr, i, UShortArray.m6037getMh2AYeg(sArr, i2));
|
|
UShortArray.m6042set01HTLdE(sArr, i2, m6037getMh2AYeg3);
|
|
i++;
|
|
i2--;
|
|
}
|
|
}
|
|
return i;
|
|
}
|
|
|
|
/* renamed from: quickSort-Aa5vz7o, reason: not valid java name */
|
|
private static final void m6159quickSortAa5vz7o(short[] sArr, int i, int i2) {
|
|
int m6155partitionAa5vz7o = m6155partitionAa5vz7o(sArr, i, i2);
|
|
int i3 = m6155partitionAa5vz7o - 1;
|
|
if (i < i3) {
|
|
m6159quickSortAa5vz7o(sArr, i, i3);
|
|
}
|
|
if (m6155partitionAa5vz7o < i2) {
|
|
m6159quickSortAa5vz7o(sArr, m6155partitionAa5vz7o, i2);
|
|
}
|
|
}
|
|
|
|
/* renamed from: partition-oBK06Vg, reason: not valid java name */
|
|
private static final int m6156partitionoBK06Vg(int[] iArr, int i, int i2) {
|
|
int m5853getpVg5ArA = UIntArray.m5853getpVg5ArA(iArr, (i + i2) / 2);
|
|
while (i <= i2) {
|
|
while (Integer.compareUnsigned(UIntArray.m5853getpVg5ArA(iArr, i), m5853getpVg5ArA) < 0) {
|
|
i++;
|
|
}
|
|
while (Integer.compareUnsigned(UIntArray.m5853getpVg5ArA(iArr, i2), m5853getpVg5ArA) > 0) {
|
|
i2--;
|
|
}
|
|
if (i <= i2) {
|
|
int m5853getpVg5ArA2 = UIntArray.m5853getpVg5ArA(iArr, i);
|
|
UIntArray.m5858setVXSXFK8(iArr, i, UIntArray.m5853getpVg5ArA(iArr, i2));
|
|
UIntArray.m5858setVXSXFK8(iArr, i2, m5853getpVg5ArA2);
|
|
i++;
|
|
i2--;
|
|
}
|
|
}
|
|
return i;
|
|
}
|
|
|
|
/* renamed from: quickSort-oBK06Vg, reason: not valid java name */
|
|
private static final void m6160quickSortoBK06Vg(int[] iArr, int i, int i2) {
|
|
int m6156partitionoBK06Vg = m6156partitionoBK06Vg(iArr, i, i2);
|
|
int i3 = m6156partitionoBK06Vg - 1;
|
|
if (i < i3) {
|
|
m6160quickSortoBK06Vg(iArr, i, i3);
|
|
}
|
|
if (m6156partitionoBK06Vg < i2) {
|
|
m6160quickSortoBK06Vg(iArr, m6156partitionoBK06Vg, i2);
|
|
}
|
|
}
|
|
|
|
/* renamed from: partition--nroSd4, reason: not valid java name */
|
|
private static final int m6153partitionnroSd4(long[] jArr, int i, int i2) {
|
|
long m5932getsVKNKU = ULongArray.m5932getsVKNKU(jArr, (i + i2) / 2);
|
|
while (i <= i2) {
|
|
while (Long.compareUnsigned(ULongArray.m5932getsVKNKU(jArr, i), m5932getsVKNKU) < 0) {
|
|
i++;
|
|
}
|
|
while (Long.compareUnsigned(ULongArray.m5932getsVKNKU(jArr, i2), m5932getsVKNKU) > 0) {
|
|
i2--;
|
|
}
|
|
if (i <= i2) {
|
|
long m5932getsVKNKU2 = ULongArray.m5932getsVKNKU(jArr, i);
|
|
ULongArray.m5937setk8EXiF4(jArr, i, ULongArray.m5932getsVKNKU(jArr, i2));
|
|
ULongArray.m5937setk8EXiF4(jArr, i2, m5932getsVKNKU2);
|
|
i++;
|
|
i2--;
|
|
}
|
|
}
|
|
return i;
|
|
}
|
|
|
|
/* renamed from: quickSort--nroSd4, reason: not valid java name */
|
|
private static final void m6157quickSortnroSd4(long[] jArr, int i, int i2) {
|
|
int m6153partitionnroSd4 = m6153partitionnroSd4(jArr, i, i2);
|
|
int i3 = m6153partitionnroSd4 - 1;
|
|
if (i < i3) {
|
|
m6157quickSortnroSd4(jArr, i, i3);
|
|
}
|
|
if (m6153partitionnroSd4 < i2) {
|
|
m6157quickSortnroSd4(jArr, m6153partitionnroSd4, i2);
|
|
}
|
|
}
|
|
|
|
/* renamed from: sortArray-4UcCI2c, reason: not valid java name */
|
|
public static final void m6162sortArray4UcCI2c(byte[] array, int i, int i2) {
|
|
Intrinsics.checkNotNullParameter(array, "array");
|
|
m6158quickSort4UcCI2c(array, i, i2 - 1);
|
|
}
|
|
|
|
/* renamed from: sortArray-Aa5vz7o, reason: not valid java name */
|
|
public static final void m6163sortArrayAa5vz7o(short[] array, int i, int i2) {
|
|
Intrinsics.checkNotNullParameter(array, "array");
|
|
m6159quickSortAa5vz7o(array, i, i2 - 1);
|
|
}
|
|
|
|
/* renamed from: sortArray-oBK06Vg, reason: not valid java name */
|
|
public static final void m6164sortArrayoBK06Vg(int[] array, int i, int i2) {
|
|
Intrinsics.checkNotNullParameter(array, "array");
|
|
m6160quickSortoBK06Vg(array, i, i2 - 1);
|
|
}
|
|
|
|
/* renamed from: sortArray--nroSd4, reason: not valid java name */
|
|
public static final void m6161sortArraynroSd4(long[] array, int i, int i2) {
|
|
Intrinsics.checkNotNullParameter(array, "array");
|
|
m6157quickSortnroSd4(array, i, i2 - 1);
|
|
}
|
|
}
|