com.google.common.graph.ForwardingNetwork Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of guava Show documentation
Builds the guava lib. Requires the jsr305 be built first.
There is a newer version: 33.3.0-jre-r3
/*
 * Copyright (C) 2016 The Guava 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 com.google.common.graph;

import java.util.Optional;
import java.util.Set;
import javax.annotation.CheckForNull;

/**
 * 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
 */
@ElementTypesAreNonnullByDefault
abstract class ForwardingNetwork extends AbstractNetwork {

  abstract Network delegate();

  @Override
  public Set nodes() {
    return delegate().nodes();
  }

  @Override
  public Set edges() {
    return delegate().edges();
  }

  @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 EndpointPair incidentNodes(E edge) {
    return delegate().incidentNodes(edge);
  }

  @Override
  public Set adjacentEdges(E edge) {
    return delegate().adjacentEdges(edge);
  }

  @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 Set edgesConnecting(N nodeU, N nodeV) {
    return delegate().edgesConnecting(nodeU, nodeV);
  }

  @Override
  public Set edgesConnecting(EndpointPair endpoints) {
    return delegate().edgesConnecting(endpoints);
  }

  @Override
  public Optional edgeConnecting(N nodeU, N nodeV) {
    return delegate().edgeConnecting(nodeU, nodeV);
  }

  @Override
  public Optional edgeConnecting(EndpointPair endpoints) {
    return delegate().edgeConnecting(endpoints);
  }

  @Override
  @CheckForNull
  public E edgeConnectingOrNull(N nodeU, N nodeV) {
    return delegate().edgeConnectingOrNull(nodeU, nodeV);
  }

  @Override
  @CheckForNull
  public E edgeConnectingOrNull(EndpointPair endpoints) {
    return delegate().edgeConnectingOrNull(endpoints);
  }

  @Override
  public boolean hasEdgeConnecting(N nodeU, N nodeV) {
    return delegate().hasEdgeConnecting(nodeU, nodeV);
  }

  @Override
  public boolean hasEdgeConnecting(EndpointPair endpoints) {
    return delegate().hasEdgeConnecting(endpoints);
  }
}