dagger.model.ForwardingNetwork Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of dagger-spi Show documentation
Show all versions of dagger-spi Show documentation
A fast dependency injector for Android and Java.
/*
* Copyright (C) 2016 The Dagger Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package dagger.model;
import static dagger.internal.Preconditions.checkNotNull;
import com.google.common.collect.ForwardingObject;
import com.google.common.graph.ElementOrder;
import com.google.common.graph.EndpointPair;
import com.google.common.graph.Graph;
import com.google.common.graph.Network;
import java.util.Optional;
import java.util.Set;
/** A {@link Network} that delegates all methods to another instance. */
// TODO(dpb): Move to com.google.common.graph.
public class ForwardingNetwork extends ForwardingObject implements Network {
private final Network delegate;
protected ForwardingNetwork(Network delegate) {
this.delegate = checkNotNull(delegate);
}
@Override
protected final Network delegate() {
return delegate;
}
@Override
public Set nodes() {
return delegate().nodes();
}
@Override
public Set edges() {
return delegate().edges();
}
@Override
public Graph asGraph() {
return delegate().asGraph();
}
@Override
public boolean isDirected() {
return delegate().isDirected();
}
@Override
public boolean allowsParallelEdges() {
return delegate().allowsParallelEdges();
}
@Override
public boolean allowsSelfLoops() {
return delegate().allowsSelfLoops();
}
@Override
public ElementOrder nodeOrder() {
return delegate().nodeOrder();
}
@Override
public ElementOrder edgeOrder() {
return delegate().edgeOrder();
}
@Override
public Set adjacentNodes(N node) {
return delegate().adjacentNodes(node);
}
@Override
public Set predecessors(N node) {
return delegate().predecessors(node);
}
@Override
public Set successors(N node) {
return delegate().successors(node);
}
@Override
public Set incidentEdges(N node) {
return delegate().incidentEdges(node);
}
@Override
public Set inEdges(N node) {
return delegate().inEdges(node);
}
@Override
public Set outEdges(N node) {
return delegate().outEdges(node);
}
@Override
public int degree(N node) {
return delegate().degree(node);
}
@Override
public int inDegree(N node) {
return delegate().inDegree(node);
}
@Override
public int outDegree(N node) {
return delegate().outDegree(node);
}
@Override
public EndpointPair incidentNodes(E edge) {
return delegate().incidentNodes(edge);
}
@Override
public Set adjacentEdges(E edge) {
return delegate().adjacentEdges(edge);
}
@Override
public Set edgesConnecting(N nodeU, N nodeV) {
return delegate().edgesConnecting(nodeU, nodeV);
}
@SuppressWarnings("MissingOverride") // Until Guava 23.0
public Optional edgeConnecting(N nodeU, N nodeV) {
return Optional.ofNullable(edgeConnectingOrNull(nodeU, nodeV));
}
@SuppressWarnings("MissingOverride") // Until Guava 23.0
// @Nullable // TODO(ronshapiro): replace with the checker framework?
public E edgeConnectingOrNull(N nodeU, N nodeV) {
return delegate().edgeConnectingOrNull(nodeU, nodeV);
}
@Override
public boolean hasEdgeConnecting(N nodeU, N nodeV) {
return delegate().hasEdgeConnecting(nodeU, nodeV);
}
@Override
public boolean equals(Object obj) {
return delegate().equals(obj);
}
@Override
public int hashCode() {
return delegate().hashCode();
}
@Override
public String toString() {
return delegate().toString();
}
}