CrackMe.apk
Download file
package com.google.common.collect;
import com.google.common.base.Function;
import com.google.common.base.Preconditions;
import com.google.common.base.Predicate;
import java.io.Serializable;
import java.lang.Comparable;
import java.util.Comparator;
import java.util.Iterator;
import java.util.SortedSet;
import javax.annotation.CheckForNull;
@ElementTypesAreNonnullByDefault
public final class Range<C extends Comparable> extends RangeGwtSerializationDependencies implements Predicate<C>, Serializable {
private static final Range<Comparable> ALL = new Range<>(Cut.belowAll(), Cut.aboveAll());
private static final long serialVersionUID = 0;
final Cut<C> lowerBound;
final Cut<C> upperBound;
static class LowerBoundFn implements Function<Range, Cut> {
static final LowerBoundFn INSTANCE = new LowerBoundFn();
LowerBoundFn() {
}
public Cut apply(Range range) {
return range.lowerBound;
}
}
static class UpperBoundFn implements Function<Range, Cut> {
static final UpperBoundFn INSTANCE = new UpperBoundFn();
UpperBoundFn() {
}
public Cut apply(Range range) {
return range.upperBound;
}
}
static <C extends Comparable<?>> Function<Range<C>, Cut<C>> lowerBoundFn() {
return LowerBoundFn.INSTANCE;
}
static <C extends Comparable<?>> Function<Range<C>, Cut<C>> upperBoundFn() {
return UpperBoundFn.INSTANCE;
}
static <C extends Comparable<?>> Ordering<Range<C>> rangeLexOrdering() {
return RangeLexOrdering.INSTANCE;
}
static <C extends Comparable<?>> Range<C> create(Cut<C> cut, Cut<C> cut2) {
return new Range<>(cut, cut2);
}
public static <C extends Comparable<?>> Range<C> open(C c, C c2) {
return create(Cut.aboveValue(c), Cut.belowValue(c2));
}
public static <C extends Comparable<?>> Range<C> closed(C c, C c2) {
return create(Cut.belowValue(c), Cut.aboveValue(c2));
}
public static <C extends Comparable<?>> Range<C> closedOpen(C c, C c2) {
return create(Cut.belowValue(c), Cut.belowValue(c2));
}
public static <C extends Comparable<?>> Range<C> openClosed(C c, C c2) {
return create(Cut.aboveValue(c), Cut.aboveValue(c2));
}
public static <C extends Comparable<?>> Range<C> range(C c, BoundType boundType, C c2, BoundType boundType2) {
Preconditions.checkNotNull(boundType);
Preconditions.checkNotNull(boundType2);
return create(boundType == BoundType.OPEN ? Cut.aboveValue(c) : Cut.belowValue(c), boundType2 == BoundType.OPEN ? Cut.belowValue(c2) : Cut.aboveValue(c2));
}
public static <C extends Comparable<?>> Range<C> lessThan(C c) {
return create(Cut.belowAll(), Cut.belowValue(c));
}
public static <C extends Comparable<?>> Range<C> atMost(C c) {
return create(Cut.belowAll(), Cut.aboveValue(c));
}
/* renamed from: com.google.common.collect.Range$1 reason: invalid class name */
static /* synthetic */ class AnonymousClass1 {
static final /* synthetic */ int[] $SwitchMap$com$google$common$collect$BoundType;
/* JADX WARNING: Can't wrap try/catch for region: R(6:0|1|2|3|4|6) */
/* JADX WARNING: Code restructure failed: missing block: B:7:?, code lost:
return;
*/
/* JADX WARNING: Failed to process nested try/catch */
/* JADX WARNING: Missing exception handler attribute for start block: B:3:0x0012 */
static {
/*
com.google.common.collect.BoundType[] r0 = com.google.common.collect.BoundType.values()
int r0 = r0.length
int[] r0 = new int[r0]
$SwitchMap$com$google$common$collect$BoundType = r0
com.google.common.collect.BoundType r1 = com.google.common.collect.BoundType.OPEN // Catch:{ NoSuchFieldError -> 0x0012 }
int r1 = r1.ordinal() // Catch:{ NoSuchFieldError -> 0x0012 }
r2 = 1
r0[r1] = r2 // Catch:{ NoSuchFieldError -> 0x0012 }
L_0x0012:
int[] r0 = $SwitchMap$com$google$common$collect$BoundType // Catch:{ NoSuchFieldError -> 0x001d }
com.google.common.collect.BoundType r1 = com.google.common.collect.BoundType.CLOSED // Catch:{ NoSuchFieldError -> 0x001d }
int r1 = r1.ordinal() // Catch:{ NoSuchFieldError -> 0x001d }
r2 = 2
r0[r1] = r2 // Catch:{ NoSuchFieldError -> 0x001d }
L_0x001d:
return
*/
throw new UnsupportedOperationException("Method not decompiled: com.google.common.collect.Range.AnonymousClass1.<clinit>():void");
}
}
public static <C extends Comparable<?>> Range<C> upTo(C c, BoundType boundType) {
int i = AnonymousClass1.$SwitchMap$com$google$common$collect$BoundType[boundType.ordinal()];
if (i == 1) {
return lessThan(c);
}
if (i == 2) {
return atMost(c);
}
throw new AssertionError();
}
public static <C extends Comparable<?>> Range<C> greaterThan(C c) {
return create(Cut.aboveValue(c), Cut.aboveAll());
}
public static <C extends Comparable<?>> Range<C> atLeast(C c) {
return create(Cut.belowValue(c), Cut.aboveAll());
}
public static <C extends Comparable<?>> Range<C> downTo(C c, BoundType boundType) {
int i = AnonymousClass1.$SwitchMap$com$google$common$collect$BoundType[boundType.ordinal()];
if (i == 1) {
return greaterThan(c);
}
if (i == 2) {
return atLeast(c);
}
throw new AssertionError();
}
public static <C extends Comparable<?>> Range<C> all() {
return ALL;
}
public static <C extends Comparable<?>> Range<C> singleton(C c) {
return closed(c, c);
}
public static <C extends Comparable<?>> Range<C> encloseAll(Iterable<C> iterable) {
Preconditions.checkNotNull(iterable);
if (iterable instanceof SortedSet) {
SortedSet sortedSet = (SortedSet) iterable;
Comparator comparator = sortedSet.comparator();
if (Ordering.natural().equals(comparator) || comparator == null) {
return closed((Comparable) sortedSet.first(), (Comparable) sortedSet.last());
}
}
Iterator<C> it = iterable.iterator();
Comparable comparable = (Comparable) Preconditions.checkNotNull((Comparable) it.next());
Comparable comparable2 = comparable;
while (it.hasNext()) {
Comparable comparable3 = (Comparable) Preconditions.checkNotNull((Comparable) it.next());
comparable = (Comparable) Ordering.natural().min(comparable, comparable3);
comparable2 = (Comparable) Ordering.natural().max(comparable2, comparable3);
}
return closed(comparable, comparable2);
}
private Range(Cut<C> cut, Cut<C> cut2) {
this.lowerBound = (Cut) Preconditions.checkNotNull(cut);
this.upperBound = (Cut) Preconditions.checkNotNull(cut2);
if (cut.compareTo(cut2) > 0 || cut == Cut.aboveAll() || cut2 == Cut.belowAll()) {
String valueOf = String.valueOf(toString(cut, cut2));
throw new IllegalArgumentException(valueOf.length() != 0 ? "Invalid range: ".concat(valueOf) : new String("Invalid range: "));
}
}
public boolean hasLowerBound() {
return this.lowerBound != Cut.belowAll();
}
public C lowerEndpoint() {
return this.lowerBound.endpoint();
}
public BoundType lowerBoundType() {
return this.lowerBound.typeAsLowerBound();
}
public boolean hasUpperBound() {
return this.upperBound != Cut.aboveAll();
}
public C upperEndpoint() {
return this.upperBound.endpoint();
}
public BoundType upperBoundType() {
return this.upperBound.typeAsUpperBound();
}
public boolean isEmpty() {
return this.lowerBound.equals(this.upperBound);
}
public boolean contains(C c) {
Preconditions.checkNotNull(c);
return this.lowerBound.isLessThan(c) && !this.upperBound.isLessThan(c);
}
@Deprecated
public boolean apply(C c) {
return contains(c);
}
public boolean containsAll(Iterable<? extends C> iterable) {
if (Iterables.isEmpty(iterable)) {
return true;
}
if (iterable instanceof SortedSet) {
SortedSet sortedSet = (SortedSet) iterable;
Comparator comparator = sortedSet.comparator();
if (Ordering.natural().equals(comparator) || comparator == null) {
if (!contains((Comparable) sortedSet.first()) || !contains((Comparable) sortedSet.last())) {
return false;
}
return true;
}
}
Iterator<? extends C> it = iterable.iterator();
while (it.hasNext()) {
if (!contains((Comparable) it.next())) {
return false;
}
}
return true;
}
public boolean encloses(Range<C> range) {
return this.lowerBound.compareTo(range.lowerBound) <= 0 && this.upperBound.compareTo(range.upperBound) >= 0;
}
public boolean isConnected(Range<C> range) {
return this.lowerBound.compareTo(range.upperBound) <= 0 && range.lowerBound.compareTo(this.upperBound) <= 0;
}
public Range<C> intersection(Range<C> range) {
int compareTo = this.lowerBound.compareTo(range.lowerBound);
int compareTo2 = this.upperBound.compareTo(range.upperBound);
if (compareTo >= 0 && compareTo2 <= 0) {
return this;
}
if (compareTo <= 0 && compareTo2 >= 0) {
return range;
}
return create(compareTo >= 0 ? this.lowerBound : range.lowerBound, compareTo2 <= 0 ? this.upperBound : range.upperBound);
}
/* JADX WARNING: Failed to insert additional move for type inference */
/* JADX WARNING: Incorrect type for immutable var: ssa=com.google.common.collect.Range<C>, code=com.google.common.collect.Range, for r5v0, types: [com.google.common.collect.Range, com.google.common.collect.Range<C>, java.lang.Object] */
/* Code decompiled incorrectly, please refer to instructions dump. */
public com.google.common.collect.Range<C> gap(com.google.common.collect.Range r5) {
/*
r4 = this;
com.google.common.collect.Cut<C> r0 = r4.lowerBound
com.google.common.collect.Cut<C> r1 = r5.upperBound
int r0 = r0.compareTo(r1)
if (r0 >= 0) goto L_0x004f
com.google.common.collect.Cut<C> r0 = r5.lowerBound
com.google.common.collect.Cut<C> r1 = r4.upperBound
int r0 = r0.compareTo(r1)
if (r0 < 0) goto L_0x0015
goto L_0x004f
L_0x0015:
java.lang.IllegalArgumentException r0 = new java.lang.IllegalArgumentException
java.lang.String r1 = java.lang.String.valueOf(r4)
java.lang.String r5 = java.lang.String.valueOf(r5)
java.lang.String r2 = java.lang.String.valueOf(r1)
int r2 = r2.length()
int r2 = r2 + 39
java.lang.String r3 = java.lang.String.valueOf(r5)
int r3 = r3.length()
int r2 = r2 + r3
java.lang.StringBuilder r3 = new java.lang.StringBuilder
r3.<init>(r2)
java.lang.String r2 = "Ranges have a nonempty intersection: "
r3.append(r2)
r3.append(r1)
java.lang.String r1 = ", "
r3.append(r1)
r3.append(r5)
java.lang.String r5 = r3.toString()
r0.<init>(r5)
throw r0
L_0x004f:
com.google.common.collect.Cut<C> r0 = r4.lowerBound
com.google.common.collect.Cut<C> r1 = r5.lowerBound
int r0 = r0.compareTo(r1)
if (r0 >= 0) goto L_0x005b
r0 = 1
goto L_0x005c
L_0x005b:
r0 = 0
L_0x005c:
if (r0 == 0) goto L_0x0060
r1 = r4
goto L_0x0061
L_0x0060:
r1 = r5
L_0x0061:
if (r0 == 0) goto L_0x0064
goto L_0x0065
L_0x0064:
r5 = r4
L_0x0065:
com.google.common.collect.Cut<C> r0 = r1.upperBound
com.google.common.collect.Cut<C> r5 = r5.lowerBound
com.google.common.collect.Range r5 = create(r0, r5)
return r5
*/
throw new UnsupportedOperationException("Method not decompiled: com.google.common.collect.Range.gap(com.google.common.collect.Range):com.google.common.collect.Range");
}
public Range<C> span(Range<C> range) {
int compareTo = this.lowerBound.compareTo(range.lowerBound);
int compareTo2 = this.upperBound.compareTo(range.upperBound);
if (compareTo <= 0 && compareTo2 >= 0) {
return this;
}
if (compareTo >= 0 && compareTo2 <= 0) {
return range;
}
return create(compareTo <= 0 ? this.lowerBound : range.lowerBound, compareTo2 >= 0 ? this.upperBound : range.upperBound);
}
public Range<C> canonical(DiscreteDomain<C> discreteDomain) {
Preconditions.checkNotNull(discreteDomain);
Cut<C> canonical = this.lowerBound.canonical(discreteDomain);
Cut<C> canonical2 = this.upperBound.canonical(discreteDomain);
return (canonical == this.lowerBound && canonical2 == this.upperBound) ? this : create(canonical, canonical2);
}
public boolean equals(@CheckForNull Object obj) {
if (!(obj instanceof Range)) {
return false;
}
Range range = (Range) obj;
if (!this.lowerBound.equals(range.lowerBound) || !this.upperBound.equals(range.upperBound)) {
return false;
}
return true;
}
public int hashCode() {
return (this.lowerBound.hashCode() * 31) + this.upperBound.hashCode();
}
public String toString() {
return toString(this.lowerBound, this.upperBound);
}
private static String toString(Cut<?> cut, Cut<?> cut2) {
StringBuilder sb = new StringBuilder(16);
cut.describeAsLowerBound(sb);
sb.append("..");
cut2.describeAsUpperBound(sb);
return sb.toString();
}
/* access modifiers changed from: package-private */
public Object readResolve() {
return equals(ALL) ? all() : this;
}
static int compareOrThrow(Comparable comparable, Comparable comparable2) {
return comparable.compareTo(comparable2);
}
private static class RangeLexOrdering extends Ordering<Range<?>> implements Serializable {
static final Ordering<Range<?>> INSTANCE = new RangeLexOrdering();
private static final long serialVersionUID = 0;
private RangeLexOrdering() {
}
public int compare(Range<?> range, Range<?> range2) {
return ComparisonChain.start().compare((Comparable<?>) range.lowerBound, (Comparable<?>) range2.lowerBound).compare((Comparable<?>) range.upperBound, (Comparable<?>) range2.upperBound).result();
}
}
}
Download file