com.ibm.wala.util.graph.impl.DelegatingGraph Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of com.ibm.wala.util Show documentation
T. J. Watson Libraries for Analysis
The newest version!
/*
 * Copyright (c) 2006 IBM Corporation.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 *
 * Contributors:
 *     IBM Corporation - initial API and implementation
 */
package com.ibm.wala.util.graph.impl;

import com.ibm.wala.util.graph.Graph;
import java.util.Iterator;
import java.util.stream.Stream;
import org.jspecify.annotations.Nullable;

/** A utility class. */
public class DelegatingGraph implements Graph {

  private final Graph delegate;

  public DelegatingGraph(Graph delegate) {
    if (delegate == null) {
      throw new IllegalArgumentException("delegate is null");
    }
    this.delegate = delegate;
  }

  @Override
  public void addEdge(T src, T dst) throws IllegalArgumentException {
    delegate.addEdge(src, dst);
  }

  @Override
  public void addNode(T n) {
    delegate.addNode(n);
  }

  @Override
  public boolean containsNode(@Nullable T N) {
    return delegate.containsNode(N);
  }

  @Override
  public int getNumberOfNodes() {
    return delegate.getNumberOfNodes();
  }

  @Override
  public String toString() {
    return delegate.toString();
  }

  @Override
  public int getPredNodeCount(T N) throws IllegalArgumentException {
    return delegate.getPredNodeCount(N);
  }

  @Override
  public Iterator getPredNodes(@Nullable T N) throws IllegalArgumentException {
    return delegate.getPredNodes(N);
  }

  @Override
  public int getSuccNodeCount(T N) throws IllegalArgumentException {
    return delegate.getSuccNodeCount(N);
  }

  @Override
  public Iterator getSuccNodes(@Nullable T N) throws IllegalArgumentException {
    return delegate.getSuccNodes(N);
  }

  @Override
  public boolean hasEdge(@Nullable T src, @Nullable T dst) {
    return delegate.hasEdge(src, dst);
  }

  @Override
  public Iterator iterator() {
    return delegate.iterator();
  }

  @Override
  public Stream stream() {
    return delegate.stream();
  }

  @Override
  public void removeAllIncidentEdges(T node) throws IllegalArgumentException {
    delegate.removeAllIncidentEdges(node);
  }

  @Override
  public void removeEdge(T src, T dst) throws IllegalArgumentException {
    delegate.removeEdge(src, dst);
  }

  @Override
  public void removeIncomingEdges(T node) throws IllegalArgumentException {
    delegate.removeIncomingEdges(node);
  }

  @Override
  public void removeNode(T n) {
    delegate.removeNode(n);
  }

  @Override
  public void removeNodeAndEdges(T N) throws IllegalArgumentException {
    delegate.removeNodeAndEdges(N);
  }

  @Override
  public void removeOutgoingEdges(T node) throws IllegalArgumentException {
    delegate.removeOutgoingEdges(node);
  }
}