CrackMe.apk
Download file
package com.google.common.primitives;
import com.facebook.react.uimanager.events.TouchesHelper;
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 javax.annotation.CheckForNull;
import kotlin.jvm.internal.ShortCompanionObject;
@ElementTypesAreNonnullByDefault
public final class Shorts extends ShortsMethodsForWeb {
public static final int BYTES = 2;
public static final short MAX_POWER_OF_TWO = 16384;
public static int compare(short s, short s2) {
return s - s2;
}
public static short fromBytes(byte b, byte b2) {
return (short) ((b << 8) | (b2 & 255));
}
public static int hashCode(short s) {
return s;
}
public static short saturatedCast(long j) {
return j > 32767 ? ShortCompanionObject.MAX_VALUE : j < -32768 ? ShortCompanionObject.MIN_VALUE : (short) ((int) j);
}
public static byte[] toByteArray(short s) {
return new byte[]{(byte) (s >> 8), (byte) s};
}
private Shorts() {
}
public static short checkedCast(long j) {
short s = (short) ((int) j);
Preconditions.checkArgument(((long) s) == j, "Out of range: %s", j);
return s;
}
public static boolean contains(short[] sArr, short s) {
for (short s2 : sArr) {
if (s2 == s) {
return true;
}
}
return false;
}
public static int indexOf(short[] sArr, short s) {
return indexOf(sArr, s, 0, sArr.length);
}
/* access modifiers changed from: private */
public static int indexOf(short[] sArr, short s, int i, int i2) {
while (i < i2) {
if (sArr[i] == s) {
return i;
}
i++;
}
return -1;
}
public static int indexOf(short[] sArr, short[] sArr2) {
Preconditions.checkNotNull(sArr, "array");
Preconditions.checkNotNull(sArr2, TouchesHelper.TARGET_KEY);
if (sArr2.length == 0) {
return 0;
}
int i = 0;
while (i < (sArr.length - sArr2.length) + 1) {
int i2 = 0;
while (i2 < sArr2.length) {
if (sArr[i + i2] != sArr2[i2]) {
i++;
} else {
i2++;
}
}
return i;
}
return -1;
}
public static int lastIndexOf(short[] sArr, short s) {
return lastIndexOf(sArr, s, 0, sArr.length);
}
/* access modifiers changed from: private */
public static int lastIndexOf(short[] sArr, short s, int i, int i2) {
for (int i3 = i2 - 1; i3 >= i; i3--) {
if (sArr[i3] == s) {
return i3;
}
}
return -1;
}
public static short min(short... sArr) {
Preconditions.checkArgument(sArr.length > 0);
short s = sArr[0];
for (int i = 1; i < sArr.length; i++) {
if (sArr[i] < s) {
s = sArr[i];
}
}
return s;
}
public static short max(short... sArr) {
Preconditions.checkArgument(sArr.length > 0);
short s = sArr[0];
for (int i = 1; i < sArr.length; i++) {
if (sArr[i] > s) {
s = sArr[i];
}
}
return s;
}
public static short constrainToRange(short s, short s2, short s3) {
Preconditions.checkArgument(s2 <= s3, "min (%s) must be less than or equal to max (%s)", (int) s2, (int) s3);
if (s < s2) {
return s2;
}
return s < s3 ? s : s3;
}
public static short[] concat(short[]... sArr) {
int i = 0;
for (short[] length : sArr) {
i += length.length;
}
short[] sArr2 = new short[i];
int i2 = 0;
for (short[] sArr3 : sArr) {
System.arraycopy(sArr3, 0, sArr2, i2, sArr3.length);
i2 += sArr3.length;
}
return sArr2;
}
public static short fromByteArray(byte[] bArr) {
Preconditions.checkArgument(bArr.length >= 2, "array too small: %s < %s", bArr.length, 2);
return fromBytes(bArr[0], bArr[1]);
}
private static final class ShortConverter extends Converter<String, Short> implements Serializable {
static final ShortConverter INSTANCE = new ShortConverter();
private static final long serialVersionUID = 1;
public String toString() {
return "Shorts.stringConverter()";
}
private ShortConverter() {
}
/* access modifiers changed from: protected */
public Short doForward(String str) {
return Short.decode(str);
}
/* access modifiers changed from: protected */
public String doBackward(Short sh) {
return sh.toString();
}
private Object readResolve() {
return INSTANCE;
}
}
public static Converter<String, Short> stringConverter() {
return ShortConverter.INSTANCE;
}
public static short[] ensureCapacity(short[] sArr, int i, int i2) {
boolean z = true;
Preconditions.checkArgument(i >= 0, "Invalid minLength: %s", i);
if (i2 < 0) {
z = false;
}
Preconditions.checkArgument(z, "Invalid padding: %s", i2);
return sArr.length < i ? Arrays.copyOf(sArr, i + i2) : sArr;
}
public static String join(String str, short... sArr) {
Preconditions.checkNotNull(str);
if (sArr.length == 0) {
return "";
}
StringBuilder sb = new StringBuilder(sArr.length * 6);
sb.append(sArr[0]);
for (int i = 1; i < sArr.length; i++) {
sb.append(str);
sb.append(sArr[i]);
}
return sb.toString();
}
public static Comparator<short[]> lexicographicalComparator() {
return LexicographicalComparator.INSTANCE;
}
private enum LexicographicalComparator implements Comparator<short[]> {
INSTANCE;
public String toString() {
return "Shorts.lexicographicalComparator()";
}
public int compare(short[] sArr, short[] sArr2) {
int min = Math.min(sArr.length, sArr2.length);
for (int i = 0; i < min; i++) {
int compare = Shorts.compare(sArr[i], sArr2[i]);
if (compare != 0) {
return compare;
}
}
return sArr.length - sArr2.length;
}
}
public static void sortDescending(short[] sArr) {
Preconditions.checkNotNull(sArr);
sortDescending(sArr, 0, sArr.length);
}
public static void sortDescending(short[] sArr, int i, int i2) {
Preconditions.checkNotNull(sArr);
Preconditions.checkPositionIndexes(i, i2, sArr.length);
Arrays.sort(sArr, i, i2);
reverse(sArr, i, i2);
}
public static void reverse(short[] sArr) {
Preconditions.checkNotNull(sArr);
reverse(sArr, 0, sArr.length);
}
public static void reverse(short[] sArr, int i, int i2) {
Preconditions.checkNotNull(sArr);
Preconditions.checkPositionIndexes(i, i2, sArr.length);
for (int i3 = i2 - 1; i < i3; i3--) {
short s = sArr[i];
sArr[i] = sArr[i3];
sArr[i3] = s;
i++;
}
}
public static short[] toArray(Collection<? extends Number> collection) {
if (collection instanceof ShortArrayAsList) {
return ((ShortArrayAsList) collection).toShortArray();
}
Object[] array = collection.toArray();
int length = array.length;
short[] sArr = new short[length];
for (int i = 0; i < length; i++) {
sArr[i] = ((Number) Preconditions.checkNotNull(array[i])).shortValue();
}
return sArr;
}
public static List<Short> asList(short... sArr) {
if (sArr.length == 0) {
return Collections.emptyList();
}
return new ShortArrayAsList(sArr);
}
private static class ShortArrayAsList extends AbstractList<Short> implements RandomAccess, Serializable {
private static final long serialVersionUID = 0;
final short[] array;
final int end;
final int start;
public boolean isEmpty() {
return false;
}
ShortArrayAsList(short[] sArr) {
this(sArr, 0, sArr.length);
}
ShortArrayAsList(short[] sArr, int i, int i2) {
this.array = sArr;
this.start = i;
this.end = i2;
}
public int size() {
return this.end - this.start;
}
public Short get(int i) {
Preconditions.checkElementIndex(i, size());
return Short.valueOf(this.array[this.start + i]);
}
public boolean contains(@CheckForNull Object obj) {
return (obj instanceof Short) && Shorts.indexOf(this.array, ((Short) obj).shortValue(), this.start, this.end) != -1;
}
public int indexOf(@CheckForNull Object obj) {
int access$000;
if (!(obj instanceof Short) || (access$000 = Shorts.indexOf(this.array, ((Short) obj).shortValue(), this.start, this.end)) < 0) {
return -1;
}
return access$000 - this.start;
}
public int lastIndexOf(@CheckForNull Object obj) {
int access$100;
if (!(obj instanceof Short) || (access$100 = Shorts.lastIndexOf(this.array, ((Short) obj).shortValue(), this.start, this.end)) < 0) {
return -1;
}
return access$100 - this.start;
}
public Short set(int i, Short sh) {
Preconditions.checkElementIndex(i, size());
short[] sArr = this.array;
int i2 = this.start;
short s = sArr[i2 + i];
sArr[i2 + i] = ((Short) Preconditions.checkNotNull(sh)).shortValue();
return Short.valueOf(s);
}
public List<Short> subList(int i, int i2) {
Preconditions.checkPositionIndexes(i, i2, size());
if (i == i2) {
return Collections.emptyList();
}
short[] sArr = this.array;
int i3 = this.start;
return new ShortArrayAsList(sArr, i + i3, i3 + i2);
}
public boolean equals(@CheckForNull Object obj) {
if (obj == this) {
return true;
}
if (!(obj instanceof ShortArrayAsList)) {
return super.equals(obj);
}
ShortArrayAsList shortArrayAsList = (ShortArrayAsList) obj;
int size = size();
if (shortArrayAsList.size() != size) {
return false;
}
for (int i = 0; i < size; i++) {
if (this.array[this.start + i] != shortArrayAsList.array[shortArrayAsList.start + i]) {
return false;
}
}
return true;
}
public int hashCode() {
int i = 1;
for (int i2 = this.start; i2 < this.end; i2++) {
i = (i * 31) + Shorts.hashCode(this.array[i2]);
}
return i;
}
public String toString() {
StringBuilder sb = new StringBuilder(size() * 6);
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();
}
}
}
/* access modifiers changed from: package-private */
public short[] toShortArray() {
return Arrays.copyOfRange(this.array, this.start, this.end);
}
}
}
Download file