Rabbit-R1/android (non root)/java/sources/com/google/common/graph/ForwardingValueGraph.java
2024-05-21 17:08:36 -04:00

104 lines
4.1 KiB
Java

package com.google.common.graph;
import java.util.Set;
import javax.annotation.CheckForNull;
@ElementTypesAreNonnullByDefault
/* loaded from: classes3.dex */
abstract class ForwardingValueGraph<N, V> extends AbstractValueGraph<N, V> {
abstract ValueGraph<N, V> delegate();
/* JADX WARN: Multi-variable type inference failed */
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.PredecessorsFunction, com.google.common.graph.Graph
public /* bridge */ /* synthetic */ Iterable predecessors(Object obj) {
return predecessors((ForwardingValueGraph<N, V>) obj);
}
/* JADX WARN: Multi-variable type inference failed */
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.SuccessorsFunction, com.google.common.graph.Graph
public /* bridge */ /* synthetic */ Iterable successors(Object obj) {
return successors((ForwardingValueGraph<N, V>) obj);
}
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.Graph
public Set<N> nodes() {
return delegate().nodes();
}
@Override // com.google.common.graph.AbstractBaseGraph
protected long edgeCount() {
return delegate().edges().size();
}
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.Graph
public boolean isDirected() {
return delegate().isDirected();
}
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.Graph
public boolean allowsSelfLoops() {
return delegate().allowsSelfLoops();
}
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.Graph
public ElementOrder<N> nodeOrder() {
return delegate().nodeOrder();
}
@Override // com.google.common.graph.AbstractValueGraph, com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
public ElementOrder<N> incidentEdgeOrder() {
return delegate().incidentEdgeOrder();
}
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.Graph
public Set<N> adjacentNodes(N n) {
return delegate().adjacentNodes(n);
}
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.PredecessorsFunction, com.google.common.graph.Graph
public Set<N> predecessors(N n) {
return delegate().predecessors((ValueGraph<N, V>) n);
}
@Override // com.google.common.graph.BaseGraph, com.google.common.graph.SuccessorsFunction, com.google.common.graph.Graph
public Set<N> successors(N n) {
return delegate().successors((ValueGraph<N, V>) n);
}
@Override // com.google.common.graph.AbstractValueGraph, com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
public int degree(N n) {
return delegate().degree(n);
}
@Override // com.google.common.graph.AbstractValueGraph, com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
public int inDegree(N n) {
return delegate().inDegree(n);
}
@Override // com.google.common.graph.AbstractValueGraph, com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
public int outDegree(N n) {
return delegate().outDegree(n);
}
@Override // com.google.common.graph.AbstractValueGraph, com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
public boolean hasEdgeConnecting(N n, N n2) {
return delegate().hasEdgeConnecting(n, n2);
}
@Override // com.google.common.graph.AbstractValueGraph, com.google.common.graph.AbstractBaseGraph, com.google.common.graph.BaseGraph
public boolean hasEdgeConnecting(EndpointPair<N> endpointPair) {
return delegate().hasEdgeConnecting(endpointPair);
}
@Override // com.google.common.graph.ValueGraph
@CheckForNull
public V edgeValueOrDefault(N n, N n2, @CheckForNull V v) {
return delegate().edgeValueOrDefault(n, n2, v);
}
@Override // com.google.common.graph.ValueGraph
@CheckForNull
public V edgeValueOrDefault(EndpointPair<N> endpointPair, @CheckForNull V v) {
return delegate().edgeValueOrDefault(endpointPair, v);
}
}