what-the-bank/sources/com/google/common/primitives/Ints.java

463 lines
14 KiB
Java

package com.google.common.primitives;
import com.google.common.base.Ascii;
import com.google.common.base.Converter;
import com.google.common.base.Preconditions;
import java.io.Serializable;
import java.util.AbstractList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.RandomAccess;
import org.bouncycastle.asn1.cmp.PKIFailureInfo;
/* loaded from: classes2.dex */
public final class Ints extends IntsMethodsForWeb {
public static final int BYTES = 4;
public static final int MAX_POWER_OF_TWO = 1073741824;
public static int compare(int i, int i2) {
if (i < i2) {
return -1;
}
return i > i2 ? 1 : 0;
}
public static int fromBytes(byte b, byte b2, byte b3, byte b4) {
return (b << Ascii.CAN) | ((b2 & UnsignedBytes.MAX_VALUE) << 16) | ((b3 & UnsignedBytes.MAX_VALUE) << 8) | (b4 & UnsignedBytes.MAX_VALUE);
}
public static int hashCode(int i) {
return i;
}
public static int saturatedCast(long j) {
if (j > 2147483647L) {
return Integer.MAX_VALUE;
}
return j < -2147483648L ? PKIFailureInfo.systemUnavail : (int) j;
}
private Ints() {
}
public static int checkedCast(long j) {
int i = (int) j;
Preconditions.checkArgument(((long) i) == j, "Out of range: %s", j);
return i;
}
public static boolean contains(int[] iArr, int i) {
for (int i2 : iArr) {
if (i2 == i) {
return true;
}
}
return false;
}
public static int indexOf(int[] iArr, int i) {
return indexOf(iArr, i, 0, iArr.length);
}
/* JADX INFO: Access modifiers changed from: private */
public static int indexOf(int[] iArr, int i, int i2, int i3) {
while (i2 < i3) {
if (iArr[i2] == i) {
return i2;
}
i2++;
}
return -1;
}
/* JADX WARN: Code restructure failed: missing block: B:15:0x0023, code lost:
r0 = r0 + 1;
*/
/*
Code decompiled incorrectly, please refer to instructions dump.
To view partially-correct add '--show-bad-code' argument
*/
public static int indexOf(int[] r5, int[] r6) {
/*
java.lang.String r0 = "array"
com.google.common.base.Preconditions.checkNotNull(r5, r0)
java.lang.String r0 = "target"
com.google.common.base.Preconditions.checkNotNull(r6, r0)
int r0 = r6.length
r1 = 0
if (r0 != 0) goto Lf
return r1
Lf:
r0 = r1
L10:
int r2 = r5.length
int r3 = r6.length
int r2 = r2 - r3
int r2 = r2 + 1
if (r0 >= r2) goto L2a
r2 = r1
L18:
int r3 = r6.length
if (r2 >= r3) goto L29
int r3 = r0 + r2
r3 = r5[r3]
r4 = r6[r2]
if (r3 == r4) goto L26
int r0 = r0 + 1
goto L10
L26:
int r2 = r2 + 1
goto L18
L29:
return r0
L2a:
r5 = -1
return r5
*/
throw new UnsupportedOperationException("Method not decompiled: com.google.common.primitives.Ints.indexOf(int[], int[]):int");
}
public static int lastIndexOf(int[] iArr, int i) {
return lastIndexOf(iArr, i, 0, iArr.length);
}
/* JADX INFO: Access modifiers changed from: private */
public static int lastIndexOf(int[] iArr, int i, int i2, int i3) {
for (int i4 = i3 - 1; i4 >= i2; i4--) {
if (iArr[i4] == i) {
return i4;
}
}
return -1;
}
public static int min(int... iArr) {
Preconditions.checkArgument(iArr.length > 0);
int i = iArr[0];
for (int i2 = 1; i2 < iArr.length; i2++) {
int i3 = iArr[i2];
if (i3 < i) {
i = i3;
}
}
return i;
}
public static int max(int... iArr) {
Preconditions.checkArgument(iArr.length > 0);
int i = iArr[0];
for (int i2 = 1; i2 < iArr.length; i2++) {
int i3 = iArr[i2];
if (i3 > i) {
i = i3;
}
}
return i;
}
public static int constrainToRange(int i, int i2, int i3) {
Preconditions.checkArgument(i2 <= i3, "min (%s) must be less than or equal to max (%s)", i2, i3);
return Math.min(Math.max(i, i2), i3);
}
public static int[] concat(int[]... iArr) {
int i = 0;
for (int[] iArr2 : iArr) {
i += iArr2.length;
}
int[] iArr3 = new int[i];
int i2 = 0;
for (int[] iArr4 : iArr) {
System.arraycopy(iArr4, 0, iArr3, i2, iArr4.length);
i2 += iArr4.length;
}
return iArr3;
}
public static int fromByteArray(byte[] bArr) {
Preconditions.checkArgument(bArr.length >= 4, "array too small: %s < %s", bArr.length, 4);
return fromBytes(bArr[0], bArr[1], bArr[2], bArr[3]);
}
/* loaded from: classes2.dex */
static final class IntConverter extends Converter<String, Integer> implements Serializable {
static final IntConverter INSTANCE = new IntConverter();
private static final long serialVersionUID = 1;
private IntConverter() {
}
/* JADX INFO: Access modifiers changed from: protected */
@Override // com.google.common.base.Converter
public final Integer doForward(String str) {
return Integer.decode(str);
}
/* JADX INFO: Access modifiers changed from: protected */
@Override // com.google.common.base.Converter
public final String doBackward(Integer num) {
return num.toString();
}
public final String toString() {
return "Ints.stringConverter()";
}
private Object readResolve() {
return INSTANCE;
}
}
public static Converter<String, Integer> stringConverter() {
return IntConverter.INSTANCE;
}
public static int[] ensureCapacity(int[] iArr, int i, int i2) {
Preconditions.checkArgument(i >= 0, "Invalid minLength: %s", i);
Preconditions.checkArgument(i2 >= 0, "Invalid padding: %s", i2);
return iArr.length < i ? Arrays.copyOf(iArr, i + i2) : iArr;
}
public static String join(String str, int... iArr) {
Preconditions.checkNotNull(str);
if (iArr.length == 0) {
return "";
}
StringBuilder sb = new StringBuilder(iArr.length * 5);
sb.append(iArr[0]);
for (int i = 1; i < iArr.length; i++) {
sb.append(str);
sb.append(iArr[i]);
}
return sb.toString();
}
public static Comparator<int[]> lexicographicalComparator() {
return LexicographicalComparator.INSTANCE;
}
/* loaded from: classes2.dex */
enum LexicographicalComparator implements Comparator<int[]> {
INSTANCE;
@Override // java.util.Comparator
public final int compare(int[] iArr, int[] iArr2) {
int min = Math.min(iArr.length, iArr2.length);
for (int i = 0; i < min; i++) {
int compare = Ints.compare(iArr[i], iArr2[i]);
if (compare != 0) {
return compare;
}
}
return iArr.length - iArr2.length;
}
@Override // java.lang.Enum
public final String toString() {
return "Ints.lexicographicalComparator()";
}
}
public static void sortDescending(int[] iArr) {
Preconditions.checkNotNull(iArr);
sortDescending(iArr, 0, iArr.length);
}
public static void sortDescending(int[] iArr, int i, int i2) {
Preconditions.checkNotNull(iArr);
Preconditions.checkPositionIndexes(i, i2, iArr.length);
Arrays.sort(iArr, i, i2);
reverse(iArr, i, i2);
}
public static void reverse(int[] iArr) {
Preconditions.checkNotNull(iArr);
reverse(iArr, 0, iArr.length);
}
public static void reverse(int[] iArr, int i, int i2) {
Preconditions.checkNotNull(iArr);
Preconditions.checkPositionIndexes(i, i2, iArr.length);
while (true) {
i2--;
if (i >= i2) {
return;
}
int i3 = iArr[i];
iArr[i] = iArr[i2];
iArr[i2] = i3;
i++;
}
}
public static int[] toArray(Collection<? extends Number> collection) {
if (collection instanceof IntArrayAsList) {
return ((IntArrayAsList) collection).toIntArray();
}
Object[] array = collection.toArray();
int length = array.length;
int[] iArr = new int[length];
for (int i = 0; i < length; i++) {
iArr[i] = ((Number) Preconditions.checkNotNull(array[i])).intValue();
}
return iArr;
}
public static List<Integer> asList(int... iArr) {
if (iArr.length == 0) {
return Collections.emptyList();
}
return new IntArrayAsList(iArr);
}
/* loaded from: classes2.dex */
static class IntArrayAsList extends AbstractList<Integer> implements RandomAccess, Serializable {
private static final long serialVersionUID = 0;
final int[] array;
final int end;
final int start;
@Override // java.util.AbstractCollection, java.util.Collection, java.util.List
public boolean isEmpty() {
return false;
}
IntArrayAsList(int[] iArr) {
this(iArr, 0, iArr.length);
}
IntArrayAsList(int[] iArr, int i, int i2) {
this.array = iArr;
this.start = i;
this.end = i2;
}
@Override // java.util.AbstractList, java.util.List
public Integer get(int i) {
Preconditions.checkElementIndex(i, size());
return Integer.valueOf(this.array[this.start + i]);
}
@Override // java.util.AbstractCollection, java.util.Collection, java.util.List
public boolean contains(Object obj) {
return (obj instanceof Integer) && Ints.indexOf(this.array, ((Integer) obj).intValue(), this.start, this.end) != -1;
}
@Override // java.util.AbstractList, java.util.List
public int indexOf(Object obj) {
int indexOf;
if (!(obj instanceof Integer) || (indexOf = Ints.indexOf(this.array, ((Integer) obj).intValue(), this.start, this.end)) < 0) {
return -1;
}
return indexOf - this.start;
}
@Override // java.util.AbstractList, java.util.List
public int lastIndexOf(Object obj) {
int lastIndexOf;
if (!(obj instanceof Integer) || (lastIndexOf = Ints.lastIndexOf(this.array, ((Integer) obj).intValue(), this.start, this.end)) < 0) {
return -1;
}
return lastIndexOf - this.start;
}
@Override // java.util.AbstractList, java.util.List
public Integer set(int i, Integer num) {
Preconditions.checkElementIndex(i, size());
int[] iArr = this.array;
int i2 = this.start + i;
int i3 = iArr[i2];
iArr[i2] = ((Integer) Preconditions.checkNotNull(num)).intValue();
return Integer.valueOf(i3);
}
@Override // java.util.AbstractList, java.util.List
public List<Integer> subList(int i, int i2) {
Preconditions.checkPositionIndexes(i, i2, size());
if (i == i2) {
return Collections.emptyList();
}
int[] iArr = this.array;
int i3 = this.start;
return new IntArrayAsList(iArr, i + i3, i3 + i2);
}
@Override // java.util.AbstractList, java.util.Collection, java.util.List
public boolean equals(Object obj) {
if (obj == this) {
return true;
}
if (obj instanceof IntArrayAsList) {
IntArrayAsList intArrayAsList = (IntArrayAsList) obj;
int size = size();
if (intArrayAsList.size() != size) {
return false;
}
for (int i = 0; i < size; i++) {
if (this.array[this.start + i] != intArrayAsList.array[intArrayAsList.start + i]) {
return false;
}
}
return true;
}
return super.equals(obj);
}
@Override // java.util.AbstractList, java.util.Collection, java.util.List
public int hashCode() {
int i = 1;
for (int i2 = this.start; i2 < this.end; i2++) {
i = (i * 31) + Ints.hashCode(this.array[i2]);
}
return i;
}
@Override // java.util.AbstractCollection
public String toString() {
StringBuilder sb = new StringBuilder(size() * 5);
sb.append('[');
sb.append(this.array[this.start]);
int i = this.start;
while (true) {
i++;
if (i < this.end) {
sb.append(", ");
sb.append(this.array[i]);
} else {
sb.append(']');
return sb.toString();
}
}
}
int[] toIntArray() {
return Arrays.copyOfRange(this.array, this.start, this.end);
}
@Override // java.util.AbstractCollection, java.util.Collection, java.util.List
public int size() {
return this.end - this.start;
}
}
public static Integer tryParse(String str) {
return tryParse(str, 10);
}
public static Integer tryParse(String str, int i) {
Long tryParse = Longs.tryParse(str, i);
if (tryParse == null || tryParse.longValue() != tryParse.intValue()) {
return null;
}
return Integer.valueOf(tryParse.intValue());
}
public static byte[] toByteArray(int i) {
return new byte[]{(byte) (i >> 24), (byte) (i >> 16), (byte) (i >> 8), (byte) i};
}
}