Package com.ibm.wala.util.graph.impl

Class DelegatingGraph<T>

java.lang.Object

com.ibm.wala.util.graph.impl.DelegatingGraph<T>

All Implemented Interfaces:

EdgeManager<T>, Graph<T>, NodeManager<T>, Iterable<T>

Direct Known Subclasses:

PartialCallGraph

public class DelegatingGraph<T>
extends Object
implements Graph<T>

A utility class.

Constructor Summary

Constructors

Constructor	Description
DelegatingGraph(Graph<T> delegate)

Method Summary

Modifier and Type	Method	Description
void	addEdge(T src, T dst)
void	addNode(T n)	add a node to this graph
boolean	containsNode(@Nullable T N)
int	getNumberOfNodes()
int	getPredNodeCount(T N)	Return the number of immediate predecessor nodes of n
Iterator<T>	getPredNodes(@Nullable T N)	Return an Iterator over the immediate predecessor nodes of n
int	getSuccNodeCount(T N)	Return the number of immediate successor nodes of this Node in the Graph
Iterator<T>	getSuccNodes(@Nullable T N)	Return an Iterator over the immediate successor nodes of n
boolean	hasEdge(@Nullable T src, @Nullable T dst)
Iterator<T>	iterator()
void	removeAllIncidentEdges(T node)
void	removeEdge(T src, T dst)
void	removeIncomingEdges(T node)
void	removeNode(T n)	remove a node from this graph
void	removeNodeAndEdges(T N)	remove a node and all its incident edges
void	removeOutgoingEdges(T node)
Stream<T>	stream()
String	toString()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Details

DelegatingGraph

public DelegatingGraph(Graph<T> delegate)

Method Details

addEdge

public void addEdge(T src,
 T dst)
             throws IllegalArgumentException

Specified by:

addEdge in interface EdgeManager<T>

Throws:

IllegalArgumentException

addNode

public void addNode(T n)

Description copied from interface: NodeManager

add a node to this graph

Specified by:

addNode in interface NodeManager<T>

containsNode

public boolean containsNode(@Nullable T N)

Specified by:

containsNode in interface NodeManager<T>

Returns:

true iff the graph contains the specified node

getNumberOfNodes

public int getNumberOfNodes()

Specified by:

getNumberOfNodes in interface NodeManager<T>

Returns:

the number of nodes in this graph

toString

public String toString()

Overrides:

toString in class Object

getPredNodeCount

public int getPredNodeCount(T N)
                     throws IllegalArgumentException

Description copied from interface: EdgeManager

Return the number of immediate predecessor nodes of n

Specified by:

getPredNodeCount in interface EdgeManager<T>

Returns:

the number of immediate predecessors of n.

Throws:

IllegalArgumentException

getPredNodes

public Iterator<T> getPredNodes(@Nullable T N)
                         throws IllegalArgumentException

Description copied from interface: EdgeManager

Return an Iterator over the immediate predecessor nodes of n

This method never returns null.

Specified by:

getPredNodes in interface EdgeManager<T>

Returns:

an Iterator over the immediate predecessor nodes of this Node.

Throws:

IllegalArgumentException

getSuccNodeCount

public int getSuccNodeCount(T N)
                     throws IllegalArgumentException

Description copied from interface: EdgeManager

Return the number of immediate successor nodes of this Node in the Graph

Specified by:

getSuccNodeCount in interface EdgeManager<T>

Returns:

the number of immediate successor Nodes of this Node in the Graph.

Throws:

IllegalArgumentException

getSuccNodes

public Iterator<T> getSuccNodes(@Nullable T N)
                         throws IllegalArgumentException

Description copied from interface: EdgeManager

Return an Iterator over the immediate successor nodes of n

This method never returns null.

Specified by:

getSuccNodes in interface EdgeManager<T>

Returns:

an Iterator over the immediate successor nodes of n

Throws:

IllegalArgumentException

hasEdge

public boolean hasEdge(@Nullable T src,
 @Nullable T dst)

Specified by:

hasEdge in interface EdgeManager<T>

iterator

public Iterator<T> iterator()

Specified by:

iterator in interface Iterable<T>

Specified by:

iterator in interface NodeManager<T>

Returns:

an Iterator of the nodes in this graph

stream

public Stream<T> stream()

Specified by:

stream in interface NodeManager<T>

Returns:

a Stream of the nodes in this graph

removeAllIncidentEdges

public void removeAllIncidentEdges(T node)
                            throws IllegalArgumentException

Specified by:

removeAllIncidentEdges in interface EdgeManager<T>

Throws:

IllegalArgumentException

removeEdge

public void removeEdge(T src,
 T dst)
                throws IllegalArgumentException

Specified by:

removeEdge in interface EdgeManager<T>

Throws:

IllegalArgumentException

removeIncomingEdges

public void removeIncomingEdges(T node)
                         throws IllegalArgumentException

Specified by:

removeIncomingEdges in interface EdgeManager<T>

Throws:

IllegalArgumentException

removeNode

public void removeNode(T n)

Description copied from interface: NodeManager

remove a node from this graph

Specified by:

removeNode in interface NodeManager<T>

removeNodeAndEdges

public void removeNodeAndEdges(T N)
                        throws IllegalArgumentException

Description copied from interface: Graph

remove a node and all its incident edges

Specified by:

removeNodeAndEdges in interface Graph<T>

Throws:

IllegalArgumentException

removeOutgoingEdges

public void removeOutgoingEdges(T node)
                         throws IllegalArgumentException

Specified by:

removeOutgoingEdges in interface EdgeManager<T>

Throws:

IllegalArgumentException