CrackMe.apk
Download file
package com.google.common.graph;
import com.google.common.base.Function;
import com.google.common.base.Preconditions;
import com.google.common.collect.ImmutableMap;
import com.google.common.collect.Iterators;
import java.util.Collections;
import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Set;
import javax.annotation.CheckForNull;
@ElementTypesAreNonnullByDefault
final class UndirectedGraphConnections<N, V> implements GraphConnections<N, V> {
private final Map<N, V> adjacentNodeValues;
private UndirectedGraphConnections(Map<N, V> map) {
this.adjacentNodeValues = (Map) Preconditions.checkNotNull(map);
}
/* renamed from: com.google.common.graph.UndirectedGraphConnections$2 reason: invalid class name */
static /* synthetic */ class AnonymousClass2 {
static final /* synthetic */ int[] $SwitchMap$com$google$common$graph$ElementOrder$Type;
/* 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.graph.ElementOrder$Type[] r0 = com.google.common.graph.ElementOrder.Type.values()
int r0 = r0.length
int[] r0 = new int[r0]
$SwitchMap$com$google$common$graph$ElementOrder$Type = r0
com.google.common.graph.ElementOrder$Type r1 = com.google.common.graph.ElementOrder.Type.UNORDERED // 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$graph$ElementOrder$Type // Catch:{ NoSuchFieldError -> 0x001d }
com.google.common.graph.ElementOrder$Type r1 = com.google.common.graph.ElementOrder.Type.STABLE // 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.graph.UndirectedGraphConnections.AnonymousClass2.<clinit>():void");
}
}
static <N, V> UndirectedGraphConnections<N, V> of(ElementOrder<N> elementOrder) {
int i = AnonymousClass2.$SwitchMap$com$google$common$graph$ElementOrder$Type[elementOrder.type().ordinal()];
if (i == 1) {
return new UndirectedGraphConnections<>(new HashMap(2, 1.0f));
}
if (i == 2) {
return new UndirectedGraphConnections<>(new LinkedHashMap(2, 1.0f));
}
throw new AssertionError(elementOrder.type());
}
static <N, V> UndirectedGraphConnections<N, V> ofImmutable(Map<N, V> map) {
return new UndirectedGraphConnections<>(ImmutableMap.copyOf(map));
}
public Set<N> adjacentNodes() {
return Collections.unmodifiableSet(this.adjacentNodeValues.keySet());
}
public Set<N> predecessors() {
return adjacentNodes();
}
public Set<N> successors() {
return adjacentNodes();
}
public Iterator<EndpointPair<N>> incidentEdgeIterator(final N n) {
return Iterators.transform(this.adjacentNodeValues.keySet().iterator(), new Function<N, EndpointPair<N>>(this) {
public EndpointPair<N> apply(N n) {
return EndpointPair.unordered(n, n);
}
});
}
@CheckForNull
public V value(N n) {
return this.adjacentNodeValues.get(n);
}
public void removePredecessor(N n) {
removeSuccessor(n);
}
@CheckForNull
public V removeSuccessor(N n) {
return this.adjacentNodeValues.remove(n);
}
public void addPredecessor(N n, V v) {
addSuccessor(n, v);
}
@CheckForNull
public V addSuccessor(N n, V v) {
return this.adjacentNodeValues.put(n, v);
}
}
Download file