731 lines
20 KiB
Java
731 lines
20 KiB
Java
|
package org.bouncycastle.util;
|
||
|
|
||
|
import java.math.BigInteger;
|
||
|
import java.util.NoSuchElementException;
|
||
|
|
||
|
/* loaded from: classes6.dex */
|
||
|
public final class Arrays {
|
||
|
public static int[] reverse(int[] iArr) {
|
||
|
if (iArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
int length = iArr.length;
|
||
|
int[] iArr2 = new int[length];
|
||
|
int i = 0;
|
||
|
while (true) {
|
||
|
length--;
|
||
|
if (length < 0) {
|
||
|
return iArr2;
|
||
|
}
|
||
|
iArr2[length] = iArr[i];
|
||
|
i++;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static byte[] reverse(byte[] bArr) {
|
||
|
if (bArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
int length = bArr.length;
|
||
|
byte[] bArr2 = new byte[length];
|
||
|
int i = 0;
|
||
|
while (true) {
|
||
|
length--;
|
||
|
if (length < 0) {
|
||
|
return bArr2;
|
||
|
}
|
||
|
bArr2[length] = bArr[i];
|
||
|
i++;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static short[] prepend(short[] sArr, short s) {
|
||
|
if (sArr == null) {
|
||
|
return new short[]{s};
|
||
|
}
|
||
|
int length = sArr.length;
|
||
|
short[] sArr2 = new short[length + 1];
|
||
|
System.arraycopy(sArr, 0, sArr2, 1, length);
|
||
|
sArr2[0] = s;
|
||
|
return sArr2;
|
||
|
}
|
||
|
|
||
|
public static int[] prepend(int[] iArr, int i) {
|
||
|
if (iArr == null) {
|
||
|
return new int[]{i};
|
||
|
}
|
||
|
int length = iArr.length;
|
||
|
int[] iArr2 = new int[length + 1];
|
||
|
System.arraycopy(iArr, 0, iArr2, 1, length);
|
||
|
iArr2[0] = i;
|
||
|
return iArr2;
|
||
|
}
|
||
|
|
||
|
public static byte[] prepend(byte[] bArr, byte b) {
|
||
|
if (bArr == null) {
|
||
|
return new byte[]{b};
|
||
|
}
|
||
|
int length = bArr.length;
|
||
|
byte[] bArr2 = new byte[length + 1];
|
||
|
System.arraycopy(bArr, 0, bArr2, 1, length);
|
||
|
bArr2[0] = b;
|
||
|
return bArr2;
|
||
|
}
|
||
|
|
||
|
public static int hashCode(short[][][] sArr) {
|
||
|
int i = 0;
|
||
|
for (int i2 = 0; i2 != sArr.length; i2++) {
|
||
|
i = (i * 257) + hashCode(sArr[i2]);
|
||
|
}
|
||
|
return i;
|
||
|
}
|
||
|
|
||
|
public static int hashCode(short[][] sArr) {
|
||
|
int i = 0;
|
||
|
for (int i2 = 0; i2 != sArr.length; i2++) {
|
||
|
i = (i * 257) + hashCode(sArr[i2]);
|
||
|
}
|
||
|
return i;
|
||
|
}
|
||
|
|
||
|
public static int hashCode(int[][] iArr) {
|
||
|
int i = 0;
|
||
|
for (int i2 = 0; i2 != iArr.length; i2++) {
|
||
|
i = (i * 257) + hashCode(iArr[i2]);
|
||
|
}
|
||
|
return i;
|
||
|
}
|
||
|
|
||
|
public static int hashCode(short[] sArr) {
|
||
|
if (sArr == null) {
|
||
|
return 0;
|
||
|
}
|
||
|
int length = sArr.length;
|
||
|
int i = length + 1;
|
||
|
while (true) {
|
||
|
length--;
|
||
|
if (length < 0) {
|
||
|
return i;
|
||
|
}
|
||
|
i = (i * 257) ^ (sArr[length] & 255);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static int hashCode(Object[] objArr) {
|
||
|
if (objArr == null) {
|
||
|
return 0;
|
||
|
}
|
||
|
int length = objArr.length;
|
||
|
int i = length + 1;
|
||
|
while (true) {
|
||
|
length--;
|
||
|
if (length < 0) {
|
||
|
return i;
|
||
|
}
|
||
|
i = (i * 257) ^ objArr[length].hashCode();
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static int hashCode(long[] jArr, int i, int i2) {
|
||
|
if (jArr == null) {
|
||
|
return 0;
|
||
|
}
|
||
|
int i3 = i2 + 1;
|
||
|
while (true) {
|
||
|
i2--;
|
||
|
if (i2 < 0) {
|
||
|
return i3;
|
||
|
}
|
||
|
long j = jArr[i + i2];
|
||
|
i3 = (((i3 * 257) ^ ((int) j)) * 257) ^ ((int) (j >>> 32));
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static int hashCode(long[] jArr) {
|
||
|
if (jArr == null) {
|
||
|
return 0;
|
||
|
}
|
||
|
int length = jArr.length;
|
||
|
int i = length + 1;
|
||
|
while (true) {
|
||
|
length--;
|
||
|
if (length < 0) {
|
||
|
return i;
|
||
|
}
|
||
|
long j = jArr[length];
|
||
|
i = (((i * 257) ^ ((int) j)) * 257) ^ ((int) (j >>> 32));
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static int hashCode(int[] iArr, int i, int i2) {
|
||
|
if (iArr == null) {
|
||
|
return 0;
|
||
|
}
|
||
|
int i3 = i2 + 1;
|
||
|
while (true) {
|
||
|
i2--;
|
||
|
if (i2 < 0) {
|
||
|
return i3;
|
||
|
}
|
||
|
i3 = (i3 * 257) ^ iArr[i + i2];
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static int hashCode(int[] iArr) {
|
||
|
if (iArr == null) {
|
||
|
return 0;
|
||
|
}
|
||
|
int length = iArr.length;
|
||
|
int i = length + 1;
|
||
|
while (true) {
|
||
|
length--;
|
||
|
if (length < 0) {
|
||
|
return i;
|
||
|
}
|
||
|
i = (i * 257) ^ iArr[length];
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static int hashCode(char[] cArr) {
|
||
|
if (cArr == null) {
|
||
|
return 0;
|
||
|
}
|
||
|
int length = cArr.length;
|
||
|
int i = length + 1;
|
||
|
while (true) {
|
||
|
length--;
|
||
|
if (length < 0) {
|
||
|
return i;
|
||
|
}
|
||
|
i = (i * 257) ^ cArr[length];
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static int hashCode(byte[] bArr, int i, int i2) {
|
||
|
if (bArr == null) {
|
||
|
return 0;
|
||
|
}
|
||
|
int i3 = i2 + 1;
|
||
|
while (true) {
|
||
|
i2--;
|
||
|
if (i2 < 0) {
|
||
|
return i3;
|
||
|
}
|
||
|
i3 = (i3 * 257) ^ bArr[i + i2];
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static int hashCode(byte[] bArr) {
|
||
|
if (bArr == null) {
|
||
|
return 0;
|
||
|
}
|
||
|
int length = bArr.length;
|
||
|
int i = length + 1;
|
||
|
while (true) {
|
||
|
length--;
|
||
|
if (length < 0) {
|
||
|
return i;
|
||
|
}
|
||
|
i = (i * 257) ^ bArr[length];
|
||
|
}
|
||
|
}
|
||
|
|
||
|
private static int getLength(int i, int i2) {
|
||
|
int i3 = i2 - i;
|
||
|
if (i3 >= 0) {
|
||
|
return i3;
|
||
|
}
|
||
|
StringBuffer stringBuffer = new StringBuffer(i);
|
||
|
stringBuffer.append(" > ").append(i2);
|
||
|
throw new IllegalArgumentException(stringBuffer.toString());
|
||
|
}
|
||
|
|
||
|
public static void fill(short[] sArr, short s) {
|
||
|
for (int i = 0; i < sArr.length; i++) {
|
||
|
sArr[i] = s;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static void fill(long[] jArr, long j) {
|
||
|
for (int i = 0; i < jArr.length; i++) {
|
||
|
jArr[i] = j;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static void fill(int[] iArr, int i) {
|
||
|
for (int i2 = 0; i2 < iArr.length; i2++) {
|
||
|
iArr[i2] = i;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static void fill(char[] cArr, char c) {
|
||
|
for (int i = 0; i < cArr.length; i++) {
|
||
|
cArr[i] = c;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static void fill(byte[] bArr, byte b) {
|
||
|
for (int i = 0; i < bArr.length; i++) {
|
||
|
bArr[i] = b;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static BigInteger[] copyOfRange(BigInteger[] bigIntegerArr, int i, int i2) {
|
||
|
int length = getLength(i, i2);
|
||
|
BigInteger[] bigIntegerArr2 = new BigInteger[length];
|
||
|
if (bigIntegerArr.length - i < length) {
|
||
|
length = bigIntegerArr.length - i;
|
||
|
}
|
||
|
System.arraycopy(bigIntegerArr, i, bigIntegerArr2, 0, length);
|
||
|
return bigIntegerArr2;
|
||
|
}
|
||
|
|
||
|
public static long[] copyOfRange(long[] jArr, int i, int i2) {
|
||
|
int length = getLength(i, i2);
|
||
|
long[] jArr2 = new long[length];
|
||
|
if (jArr.length - i < length) {
|
||
|
length = jArr.length - i;
|
||
|
}
|
||
|
System.arraycopy(jArr, i, jArr2, 0, length);
|
||
|
return jArr2;
|
||
|
}
|
||
|
|
||
|
public static int[] copyOfRange(int[] iArr, int i, int i2) {
|
||
|
int length = getLength(i, i2);
|
||
|
int[] iArr2 = new int[length];
|
||
|
if (iArr.length - i < length) {
|
||
|
length = iArr.length - i;
|
||
|
}
|
||
|
System.arraycopy(iArr, i, iArr2, 0, length);
|
||
|
return iArr2;
|
||
|
}
|
||
|
|
||
|
public static byte[] copyOfRange(byte[] bArr, int i, int i2) {
|
||
|
int length = getLength(i, i2);
|
||
|
byte[] bArr2 = new byte[length];
|
||
|
if (bArr.length - i < length) {
|
||
|
length = bArr.length - i;
|
||
|
}
|
||
|
System.arraycopy(bArr, i, bArr2, 0, length);
|
||
|
return bArr2;
|
||
|
}
|
||
|
|
||
|
public static BigInteger[] copyOf(BigInteger[] bigIntegerArr, int i) {
|
||
|
BigInteger[] bigIntegerArr2 = new BigInteger[i];
|
||
|
if (i >= bigIntegerArr.length) {
|
||
|
i = bigIntegerArr.length;
|
||
|
}
|
||
|
System.arraycopy(bigIntegerArr, 0, bigIntegerArr2, 0, i);
|
||
|
return bigIntegerArr2;
|
||
|
}
|
||
|
|
||
|
public static long[] copyOf(long[] jArr, int i) {
|
||
|
long[] jArr2 = new long[i];
|
||
|
if (i >= jArr.length) {
|
||
|
i = jArr.length;
|
||
|
}
|
||
|
System.arraycopy(jArr, 0, jArr2, 0, i);
|
||
|
return jArr2;
|
||
|
}
|
||
|
|
||
|
public static int[] copyOf(int[] iArr, int i) {
|
||
|
int[] iArr2 = new int[i];
|
||
|
if (i >= iArr.length) {
|
||
|
i = iArr.length;
|
||
|
}
|
||
|
System.arraycopy(iArr, 0, iArr2, 0, i);
|
||
|
return iArr2;
|
||
|
}
|
||
|
|
||
|
public static char[] copyOf(char[] cArr, int i) {
|
||
|
char[] cArr2 = new char[i];
|
||
|
if (i >= cArr.length) {
|
||
|
i = cArr.length;
|
||
|
}
|
||
|
System.arraycopy(cArr, 0, cArr2, 0, i);
|
||
|
return cArr2;
|
||
|
}
|
||
|
|
||
|
public static byte[] copyOf(byte[] bArr, int i) {
|
||
|
byte[] bArr2 = new byte[i];
|
||
|
if (i >= bArr.length) {
|
||
|
i = bArr.length;
|
||
|
}
|
||
|
System.arraycopy(bArr, 0, bArr2, 0, i);
|
||
|
return bArr2;
|
||
|
}
|
||
|
|
||
|
public static boolean contains(short[] sArr, short s) {
|
||
|
for (short s2 : sArr) {
|
||
|
if (s2 == s) {
|
||
|
return true;
|
||
|
}
|
||
|
}
|
||
|
return false;
|
||
|
}
|
||
|
|
||
|
public static boolean contains(int[] iArr, int i) {
|
||
|
for (int i2 : iArr) {
|
||
|
if (i2 == i) {
|
||
|
return true;
|
||
|
}
|
||
|
}
|
||
|
return false;
|
||
|
}
|
||
|
|
||
|
public static boolean constantTimeAreEqual(byte[] bArr, byte[] bArr2) {
|
||
|
if (bArr == bArr2) {
|
||
|
return true;
|
||
|
}
|
||
|
if (bArr == null || bArr2 == null || bArr.length != bArr2.length) {
|
||
|
return false;
|
||
|
}
|
||
|
int i = 0;
|
||
|
for (int i2 = 0; i2 != bArr.length; i2++) {
|
||
|
i |= bArr[i2] ^ bArr2[i2];
|
||
|
}
|
||
|
return i == 0;
|
||
|
}
|
||
|
|
||
|
public static int[] concatenate(int[] iArr, int[] iArr2) {
|
||
|
if (iArr == null) {
|
||
|
return clone(iArr2);
|
||
|
}
|
||
|
if (iArr2 == null) {
|
||
|
return clone(iArr);
|
||
|
}
|
||
|
int[] iArr3 = new int[iArr.length + iArr2.length];
|
||
|
System.arraycopy(iArr, 0, iArr3, 0, iArr.length);
|
||
|
System.arraycopy(iArr2, 0, iArr3, iArr.length, iArr2.length);
|
||
|
return iArr3;
|
||
|
}
|
||
|
|
||
|
public static byte[] concatenate(byte[][] bArr) {
|
||
|
int i = 0;
|
||
|
for (int i2 = 0; i2 != bArr.length; i2++) {
|
||
|
i += bArr[i2].length;
|
||
|
}
|
||
|
byte[] bArr2 = new byte[i];
|
||
|
int i3 = 0;
|
||
|
for (int i4 = 0; i4 != bArr.length; i4++) {
|
||
|
byte[] bArr3 = bArr[i4];
|
||
|
System.arraycopy(bArr3, 0, bArr2, i3, bArr3.length);
|
||
|
i3 += bArr[i4].length;
|
||
|
}
|
||
|
return bArr2;
|
||
|
}
|
||
|
|
||
|
public static byte[] concatenate(byte[] bArr, byte[] bArr2, byte[] bArr3, byte[] bArr4) {
|
||
|
if (bArr == null || bArr2 == null || bArr3 == null || bArr4 == null) {
|
||
|
return bArr4 == null ? concatenate(bArr, bArr2, bArr3) : bArr3 == null ? concatenate(bArr, bArr2, bArr4) : bArr2 == null ? concatenate(bArr, bArr3, bArr4) : concatenate(bArr2, bArr3, bArr4);
|
||
|
}
|
||
|
byte[] bArr5 = new byte[bArr.length + bArr2.length + bArr3.length + bArr4.length];
|
||
|
System.arraycopy(bArr, 0, bArr5, 0, bArr.length);
|
||
|
System.arraycopy(bArr2, 0, bArr5, bArr.length, bArr2.length);
|
||
|
System.arraycopy(bArr3, 0, bArr5, bArr.length + bArr2.length, bArr3.length);
|
||
|
System.arraycopy(bArr4, 0, bArr5, bArr.length + bArr2.length + bArr3.length, bArr4.length);
|
||
|
return bArr5;
|
||
|
}
|
||
|
|
||
|
public static byte[] concatenate(byte[] bArr, byte[] bArr2, byte[] bArr3) {
|
||
|
if (bArr == null || bArr2 == null || bArr3 == null) {
|
||
|
return bArr == null ? concatenate(bArr2, bArr3) : bArr2 == null ? concatenate(bArr, bArr3) : concatenate(bArr, bArr2);
|
||
|
}
|
||
|
byte[] bArr4 = new byte[bArr.length + bArr2.length + bArr3.length];
|
||
|
System.arraycopy(bArr, 0, bArr4, 0, bArr.length);
|
||
|
System.arraycopy(bArr2, 0, bArr4, bArr.length, bArr2.length);
|
||
|
System.arraycopy(bArr3, 0, bArr4, bArr.length + bArr2.length, bArr3.length);
|
||
|
return bArr4;
|
||
|
}
|
||
|
|
||
|
public static byte[] concatenate(byte[] bArr, byte[] bArr2) {
|
||
|
if (bArr == null || bArr2 == null) {
|
||
|
return bArr2 != null ? clone(bArr2) : clone(bArr);
|
||
|
}
|
||
|
byte[] bArr3 = new byte[bArr.length + bArr2.length];
|
||
|
System.arraycopy(bArr, 0, bArr3, 0, bArr.length);
|
||
|
System.arraycopy(bArr2, 0, bArr3, bArr.length, bArr2.length);
|
||
|
return bArr3;
|
||
|
}
|
||
|
|
||
|
public static byte[][][] clone(byte[][][] bArr) {
|
||
|
if (bArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
int length = bArr.length;
|
||
|
byte[][][] bArr2 = new byte[length][];
|
||
|
for (int i = 0; i != length; i++) {
|
||
|
bArr2[i] = clone(bArr[i]);
|
||
|
}
|
||
|
return bArr2;
|
||
|
}
|
||
|
|
||
|
public static byte[][] clone(byte[][] bArr) {
|
||
|
if (bArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
int length = bArr.length;
|
||
|
byte[][] bArr2 = new byte[length];
|
||
|
for (int i = 0; i != length; i++) {
|
||
|
bArr2[i] = clone(bArr[i]);
|
||
|
}
|
||
|
return bArr2;
|
||
|
}
|
||
|
|
||
|
public static short[] clone(short[] sArr) {
|
||
|
if (sArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
short[] sArr2 = new short[sArr.length];
|
||
|
System.arraycopy(sArr, 0, sArr2, 0, sArr.length);
|
||
|
return sArr2;
|
||
|
}
|
||
|
|
||
|
public static BigInteger[] clone(BigInteger[] bigIntegerArr) {
|
||
|
if (bigIntegerArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
BigInteger[] bigIntegerArr2 = new BigInteger[bigIntegerArr.length];
|
||
|
System.arraycopy(bigIntegerArr, 0, bigIntegerArr2, 0, bigIntegerArr.length);
|
||
|
return bigIntegerArr2;
|
||
|
}
|
||
|
|
||
|
public static long[] clone(long[] jArr, long[] jArr2) {
|
||
|
if (jArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
if (jArr2 == null || jArr2.length != jArr.length) {
|
||
|
return clone(jArr);
|
||
|
}
|
||
|
System.arraycopy(jArr, 0, jArr2, 0, jArr2.length);
|
||
|
return jArr2;
|
||
|
}
|
||
|
|
||
|
public static long[] clone(long[] jArr) {
|
||
|
if (jArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
long[] jArr2 = new long[jArr.length];
|
||
|
System.arraycopy(jArr, 0, jArr2, 0, jArr.length);
|
||
|
return jArr2;
|
||
|
}
|
||
|
|
||
|
public static int[] clone(int[] iArr) {
|
||
|
if (iArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
int[] iArr2 = new int[iArr.length];
|
||
|
System.arraycopy(iArr, 0, iArr2, 0, iArr.length);
|
||
|
return iArr2;
|
||
|
}
|
||
|
|
||
|
public static char[] clone(char[] cArr) {
|
||
|
if (cArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
char[] cArr2 = new char[cArr.length];
|
||
|
System.arraycopy(cArr, 0, cArr2, 0, cArr.length);
|
||
|
return cArr2;
|
||
|
}
|
||
|
|
||
|
public static byte[] clone(byte[] bArr, byte[] bArr2) {
|
||
|
if (bArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
if (bArr2 == null || bArr2.length != bArr.length) {
|
||
|
return clone(bArr);
|
||
|
}
|
||
|
System.arraycopy(bArr, 0, bArr2, 0, bArr2.length);
|
||
|
return bArr2;
|
||
|
}
|
||
|
|
||
|
public static byte[] clone(byte[] bArr) {
|
||
|
if (bArr == null) {
|
||
|
return null;
|
||
|
}
|
||
|
byte[] bArr2 = new byte[bArr.length];
|
||
|
System.arraycopy(bArr, 0, bArr2, 0, bArr.length);
|
||
|
return bArr2;
|
||
|
}
|
||
|
|
||
|
public static boolean areEqual(boolean[] zArr, boolean[] zArr2) {
|
||
|
if (zArr == zArr2) {
|
||
|
return true;
|
||
|
}
|
||
|
if (zArr == null || zArr2 == null || zArr.length != zArr2.length) {
|
||
|
return false;
|
||
|
}
|
||
|
for (int i = 0; i != zArr.length; i++) {
|
||
|
if (zArr[i] != zArr2[i]) {
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
public static boolean areEqual(short[] sArr, short[] sArr2) {
|
||
|
if (sArr == sArr2) {
|
||
|
return true;
|
||
|
}
|
||
|
if (sArr == null || sArr2 == null || sArr.length != sArr2.length) {
|
||
|
return false;
|
||
|
}
|
||
|
for (int i = 0; i != sArr.length; i++) {
|
||
|
if (sArr[i] != sArr2[i]) {
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
public static boolean areEqual(Object[] objArr, Object[] objArr2) {
|
||
|
if (objArr == objArr2) {
|
||
|
return true;
|
||
|
}
|
||
|
if (objArr == null || objArr2 == null || objArr.length != objArr2.length) {
|
||
|
return false;
|
||
|
}
|
||
|
for (int i = 0; i != objArr.length; i++) {
|
||
|
Object obj = objArr[i];
|
||
|
Object obj2 = objArr2[i];
|
||
|
if (obj == null) {
|
||
|
if (obj2 != null) {
|
||
|
return false;
|
||
|
}
|
||
|
} else if (!obj.equals(obj2)) {
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
public static boolean areEqual(long[] jArr, long[] jArr2) {
|
||
|
if (jArr == jArr2) {
|
||
|
return true;
|
||
|
}
|
||
|
if (jArr == null || jArr2 == null || jArr.length != jArr2.length) {
|
||
|
return false;
|
||
|
}
|
||
|
for (int i = 0; i != jArr.length; i++) {
|
||
|
if (jArr[i] != jArr2[i]) {
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
public static boolean areEqual(int[] iArr, int[] iArr2) {
|
||
|
if (iArr == iArr2) {
|
||
|
return true;
|
||
|
}
|
||
|
if (iArr == null || iArr2 == null || iArr.length != iArr2.length) {
|
||
|
return false;
|
||
|
}
|
||
|
for (int i = 0; i != iArr.length; i++) {
|
||
|
if (iArr[i] != iArr2[i]) {
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
public static boolean areEqual(char[] cArr, char[] cArr2) {
|
||
|
if (cArr == cArr2) {
|
||
|
return true;
|
||
|
}
|
||
|
if (cArr == null || cArr2 == null || cArr.length != cArr2.length) {
|
||
|
return false;
|
||
|
}
|
||
|
for (int i = 0; i != cArr.length; i++) {
|
||
|
if (cArr[i] != cArr2[i]) {
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
/* loaded from: classes6.dex */
|
||
|
public static class Iterator<T> implements java.util.Iterator<T> {
|
||
|
private final T[] dataArray;
|
||
|
private int position = 0;
|
||
|
|
||
|
@Override // java.util.Iterator
|
||
|
public void remove() {
|
||
|
throw new UnsupportedOperationException("Cannot remove element from an Array.");
|
||
|
}
|
||
|
|
||
|
@Override // java.util.Iterator
|
||
|
public T next() {
|
||
|
int i = this.position;
|
||
|
T[] tArr = this.dataArray;
|
||
|
if (i != tArr.length) {
|
||
|
this.position = i + 1;
|
||
|
return tArr[i];
|
||
|
}
|
||
|
StringBuilder sb = new StringBuilder("Out of elements: ");
|
||
|
sb.append(this.position);
|
||
|
throw new NoSuchElementException(sb.toString());
|
||
|
}
|
||
|
|
||
|
@Override // java.util.Iterator
|
||
|
public boolean hasNext() {
|
||
|
return this.position < this.dataArray.length;
|
||
|
}
|
||
|
|
||
|
public Iterator(T[] tArr) {
|
||
|
this.dataArray = tArr;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public static boolean areEqual(byte[] bArr, byte[] bArr2) {
|
||
|
if (bArr == bArr2) {
|
||
|
return true;
|
||
|
}
|
||
|
if (bArr == null || bArr2 == null || bArr.length != bArr2.length) {
|
||
|
return false;
|
||
|
}
|
||
|
for (int i = 0; i != bArr.length; i++) {
|
||
|
if (bArr[i] != bArr2[i]) {
|
||
|
return false;
|
||
|
}
|
||
|
}
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
public static short[] append(short[] sArr, short s) {
|
||
|
if (sArr == null) {
|
||
|
return new short[]{s};
|
||
|
}
|
||
|
int length = sArr.length;
|
||
|
short[] sArr2 = new short[length + 1];
|
||
|
System.arraycopy(sArr, 0, sArr2, 0, length);
|
||
|
sArr2[length] = s;
|
||
|
return sArr2;
|
||
|
}
|
||
|
|
||
|
public static int[] append(int[] iArr, int i) {
|
||
|
if (iArr == null) {
|
||
|
return new int[]{i};
|
||
|
}
|
||
|
int length = iArr.length;
|
||
|
int[] iArr2 = new int[length + 1];
|
||
|
System.arraycopy(iArr, 0, iArr2, 0, length);
|
||
|
iArr2[length] = i;
|
||
|
return iArr2;
|
||
|
}
|
||
|
|
||
|
public static byte[] append(byte[] bArr, byte b) {
|
||
|
if (bArr == null) {
|
||
|
return new byte[]{b};
|
||
|
}
|
||
|
int length = bArr.length;
|
||
|
byte[] bArr2 = new byte[length + 1];
|
||
|
System.arraycopy(bArr, 0, bArr2, 0, length);
|
||
|
bArr2[length] = b;
|
||
|
return bArr2;
|
||
|
}
|
||
|
|
||
|
private Arrays() {
|
||
|
}
|
||
|
}
|