com.ibm.wala.util.graph.impl.InvertingNumberedEdgeManager 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) 2002 - 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.NumberedEdgeManager;
import com.ibm.wala.util.intset.IntSet;
import java.util.Iterator;
import org.jspecify.annotations.Nullable;

/** An edge manager that reverses the edges in a graph */
public class InvertingNumberedEdgeManager implements NumberedEdgeManager {

  private final NumberedEdgeManager original;

  public InvertingNumberedEdgeManager(NumberedEdgeManager original) {
    if (original == null) {
      throw new IllegalArgumentException("null original");
    }
    this.original = original;
  }

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

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

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

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

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

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

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

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

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

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

  @Override
  public IntSet getSuccNodeNumbers(@Nullable T node) throws IllegalArgumentException {
    return original.getPredNodeNumbers(node);
  }

  @Override
  public IntSet getPredNodeNumbers(@Nullable T node) throws IllegalArgumentException {
    return original.getSuccNodeNumbers(node);
  }
}