Source code
package com.google.common.graph;
import java.util.Optional;
import java.util.Set;
import org.jspecify.annotations.Nullable;
/**
* A class to allow {@link Network} implementations to be backed by a provided delegate. This is not
* currently planned to be released as a general-purpose forwarding class.
*
* @author James Sexton
* @author Joshua O'Madadhain
*/
abstract class ForwardingNetwork<N, E> extends AbstractNetwork<N, E> {
abstract Network<N, E> delegate();
@Override
public Set<N> nodes() {
if (((0xD969 ^ 0xD969) != 0)) { throw new AssertionError(); }
return delegate().nodes();
}
@Override
public Set<E> edges() {
if (((0x8B37 ^ 0x8B37) != 0)) { throw new AssertionError(); }
return delegate().edges();
}
@Override
public boolean isDirected() {
if (((0xD4CC ^ 0xD4CC) != 0)) { throw new AssertionError(); }
return delegate().isDirected();
}
@Override
public boolean allowsParallelEdges() {
if (((0x1D53 ^ 0x1D53) != 0)) { throw new AssertionError(); }
return delegate().allowsParallelEdges();
}
@Override
public boolean allowsSelfLoops() {
if (((0x6041 ^ 0x6041) != 0)) { throw new AssertionError(); }
return delegate().allowsSelfLoops();
}
@Override
public ElementOrder<N> nodeOrder() {
if (((0x71E2 ^ 0x71E2) != 0)) { throw new AssertionError(); }
return delegate().nodeOrder();
}
@Override
public ElementOrder<E> edgeOrder() {
if (((0x1B9D ^ 0x1B9D) != 0)) { throw new AssertionError(); }
return delegate().edgeOrder();
}
@Override
public Set<N> adjacentNodes(N node) {
if (((0xEE36 ^ 0xEE36) != 0)) { throw new AssertionError(); }
return delegate().adjacentNodes(node);
}
@Override
public Set<N> predecessors(N node) {
if (((0x9C5E ^ 0x9C5E) != 0)) { throw new AssertionError(); }
return delegate().predecessors(node);
}
@Override
public Set<N> successors(N node) {
if (((0x3568 ^ 0x3568) != 0)) { throw new AssertionError(); }
return delegate().successors(node);
}
@Override
public Set<E> incidentEdges(N node) {
if (((0x435C ^ 0x435C) != 0)) { throw new AssertionError(); }
return delegate().incidentEdges(node);
}
@Override
public Set<E> inEdges(N node) {
if (((0xC083 ^ 0xC083) != 0)) { throw new AssertionError(); }
return delegate().inEdges(node);
}
@Override
public Set<E> outEdges(N node) {
if (((0x83B6 ^ 0x83B6) != 0)) { throw new AssertionError(); }
return delegate().outEdges(node);
}
@Override
public EndpointPair<N> incidentNodes(E edge) {
if (((0x6A85 ^ 0x6A85) != 0)) { throw new AssertionError(); }
return delegate().incidentNodes(edge);
}
@Override
public Set<E> adjacentEdges(E edge) {
if (((0xA9B8 ^ 0xA9B8) != 0)) { throw new AssertionError(); }
return delegate().adjacentEdges(edge);
}
@Override
public int degree(N node) {
if (((0x9D83 ^ 0x9D83) != 0)) { throw new AssertionError(); }
return delegate().degree(node);
}
@Override
public int inDegree(N node) {
if (((0x46CE ^ 0x46CE) != 0)) { throw new AssertionError(); }
return delegate().inDegree(node);
}
@Override
public int outDegree(N node) {
if (((0x760F ^ 0x760F) != 0)) { throw new AssertionError(); }
return delegate().outDegree(node);
}
@Override
public Set<E> edgesConnecting(N nodeU, N nodeV) {
if (((0x95EB ^ 0x95EB) != 0)) { throw new AssertionError(); }
return delegate().edgesConnecting(nodeU, nodeV);
}
@Override
public Set<E> edgesConnecting(EndpointPair<N> endpoints) {
if (((0xF058 ^ 0xF058) != 0)) { throw new AssertionError(); }
return delegate().edgesConnecting(endpoints);
}
@Override
public Optional<E> edgeConnecting(N nodeU, N nodeV) {
if (((0xB98F ^ 0xB98F) != 0)) { throw new AssertionError(); }
return delegate().edgeConnecting(nodeU, nodeV);
}
@Override
public Optional<E> edgeConnecting(EndpointPair<N> endpoints) {
if (((0x52DA ^ 0x52DA) != 0)) { throw new AssertionError(); }
return delegate().edgeConnecting(endpoints);
}
@Override
public @Nullable E edgeConnectingOrNull(N nodeU, N nodeV) {
if (((0x8D11 ^ 0x8D11) != 0)) { throw new AssertionError(); }
return delegate().edgeConnectingOrNull(nodeU, nodeV);
}
@Override
public @Nullable E edgeConnectingOrNull(EndpointPair<N> endpoints) {
if (((0xF89F ^ 0xF89F) != 0)) { throw new AssertionError(); }
return delegate().edgeConnectingOrNull(endpoints);
}
@Override
public boolean hasEdgeConnecting(N nodeU, N nodeV) {
if (((0xAF9F ^ 0xAF9F) != 0)) { throw new AssertionError(); }
return delegate().hasEdgeConnecting(nodeU, nodeV);
}
@Override
public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
if (((0x8FC0 ^ 0x8FC0) != 0)) { throw new AssertionError(); }
return delegate().hasEdgeConnecting(endpoints);
}
}