com.ibm.wala.util.graph.labeled

Class SparseNumberedLabeledEdgeManager<T,U>

java.lang.Object

com.ibm.wala.util.graph.labeled.SparseNumberedLabeledEdgeManager<T,U>

All Implemented Interfaces:

EdgeManager<T>, LabeledEdgeManager<T,U>, NumberedLabeledEdgeManager<T,U>, NumberedEdgeManager<T>, Serializable

public class SparseNumberedLabeledEdgeManager<T,U>
extends Object
implements Serializable, NumberedLabeledEdgeManager<T,U>

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
SparseNumberedLabeledEdgeManager(NumberedNodeManager<T> nodeManager)
SparseNumberedLabeledEdgeManager(NumberedNodeManager<T> nodeManager, U defaultLabel)

Method Summary

Modifier and Type	Method and Description
void	addEdge(T src, T dst)
void	addEdge(T src, T dst, U label) adds an edge with some label
U	getDefaultLabel() Sets the default object used as label for operations where no specific edge label is provided.
Set<? extends U>	getEdgeLabels(T src, T dst) Returns a set of all labeled edges between node src and node dst
Iterator<? extends U>	getPredLabels(T N)
int	getPredNodeCount(T N) Return the number of immediate predecessor nodes of n
int	getPredNodeCount(T N, U label) Return the number of immediate predecessor nodes of this Node in the Graph on edges with some label.
IntSet	getPredNodeNumbers(T node)
IntSet	getPredNodeNumbers(T node, U label)
Iterator<T>	getPredNodes(T N) Return an Iterator over the immediate predecessor nodes of n
Iterator<T>	getPredNodes(T N, U label) Return an Iterator over the immediate predecessor nodes of this Node in the Graph on edges with some label.
Iterator<? extends U>	getSuccLabels(T N)
int	getSuccNodeCount(T N) Return the number of immediate successor nodes of this Node in the Graph
int	getSuccNodeCount(T N, U label) Return the number of immediate successor nodes of this Node in the Graph
IntSet	getSuccNodeNumbers(T node)
IntSet	getSuccNodeNumbers(T node, U label)
Iterator<T>	getSuccNodes(T N) Return an Iterator over the immediate successor nodes of n
Iterator<? extends T>	getSuccNodes(T N, U label) Return an Iterator over the immediate successor nodes of this Node in the Graph on edges with some label.
boolean	hasEdge(T src, T dst)
boolean	hasEdge(T src, T dst, U label)
void	removeAllIncidentEdges(T node)
void	removeEdge(T src, T dst)
void	removeEdge(T src, T dst, U label)
void	removeIncomingEdges(T node)
void	removeOutgoingEdges(T node)

Methods inherited from class java.lang.Object

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

Methods inherited from interface com.ibm.wala.util.graph.labeled.LabeledEdgeManager

getPredNodes

Constructor Detail

SparseNumberedLabeledEdgeManager

public SparseNumberedLabeledEdgeManager(NumberedNodeManager<T> nodeManager,
                                        U defaultLabel)

SparseNumberedLabeledEdgeManager

public SparseNumberedLabeledEdgeManager(NumberedNodeManager<T> nodeManager)

Method Detail

addEdge

public void addEdge(T src,
                    T dst,
                    U label)

Description copied from interface: LabeledEdgeManager

adds an edge with some label

Specified by:

addEdge in interface LabeledEdgeManager<T,U>

See Also:

LabeledEdgeManager.addEdge(java.lang.Object, java.lang.Object, java.lang.Object)

getPredNodeCount

public int getPredNodeCount(T N,
                            U label)

Description copied from interface: LabeledEdgeManager

Return the number of immediate predecessor nodes of this Node in the Graph on edges with some label.

Specified by:

getPredNodeCount in interface LabeledEdgeManager<T,U>

Returns:

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

See Also:

LabeledEdgeManager.getPredNodeCount(java.lang.Object, java.lang.Object)

getPredNodes

public Iterator<T> getPredNodes(T N,
                                U label)

Description copied from interface: LabeledEdgeManager

Return an Iterator over the immediate predecessor nodes of this Node in the Graph on edges with some label.

This method never returns null.

Specified by:

getPredNodes in interface LabeledEdgeManager<T,U>

Returns:

an Iterator over the immediate predecessor nodes of this Node.

See Also:

LabeledEdgeManager.getPredNodes(java.lang.Object, java.lang.Object)

getSuccNodeCount

public int getSuccNodeCount(T N,
                            U label)

Description copied from interface: LabeledEdgeManager

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

Specified by:

getSuccNodeCount in interface LabeledEdgeManager<T,U>

Returns:

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

See Also:

LabeledEdgeManager.getSuccNodeCount(java.lang.Object, java.lang.Object)

getSuccNodes

public Iterator<? extends T> getSuccNodes(T N,
                                          U label)

Description copied from interface: LabeledEdgeManager

Return an Iterator over the immediate successor nodes of this Node in the Graph on edges with some label.

This method never returns null.

Specified by:

getSuccNodes in interface LabeledEdgeManager<T,U>

Returns:

an Iterator over the immediate successor Nodes of this Node.

See Also:

LabeledEdgeManager.getSuccNodes(java.lang.Object, java.lang.Object)

hasEdge

public boolean hasEdge(T src,
                       T dst,
                       U label)

Specified by:

hasEdge in interface LabeledEdgeManager<T,U>

See Also:

LabeledEdgeManager.hasEdge(java.lang.Object, java.lang.Object, java.lang.Object)

removeAllIncidentEdges

public void removeAllIncidentEdges(T node)

Specified by:

removeAllIncidentEdges in interface EdgeManager<T>

removeEdge

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

Specified by:

removeEdge in interface LabeledEdgeManager<T,U>

Throws:

IllegalArgumentException

See Also:

LabeledEdgeManager.removeEdge(java.lang.Object, java.lang.Object, java.lang.Object)

removeIncomingEdges

public void removeIncomingEdges(T node)
                         throws IllegalArgumentException

Specified by:

removeIncomingEdges in interface EdgeManager<T>

Throws:

IllegalArgumentException

See Also:

EdgeManager.removeIncomingEdges(java.lang.Object)

removeOutgoingEdges

public void removeOutgoingEdges(T node)
                         throws IllegalArgumentException

Specified by:

removeOutgoingEdges in interface EdgeManager<T>

Throws:

IllegalArgumentException

See Also:

EdgeManager.removeOutgoingEdges(java.lang.Object)

getPredLabels

public Iterator<? extends U> getPredLabels(T N)

Specified by:

getPredLabels in interface LabeledEdgeManager<T,U>

Returns:

the labels on edges whose destination is N

getSuccLabels

public Iterator<? extends U> getSuccLabels(T N)

Specified by:

getSuccLabels in interface LabeledEdgeManager<T,U>

Returns:

the labels on edges whose source is N

getEdgeLabels

public Set<? extends U> getEdgeLabels(T src,
                                      T dst)

Description copied from interface: LabeledEdgeManager

Returns a set of all labeled edges between node src and node dst

Specified by:

getEdgeLabels in interface LabeledEdgeManager<T,U>

Parameters:

src - source node of the edge

dst - target node of the edge

Returns:

Set of edge labels

addEdge

public void addEdge(T src,
                    T dst)

Specified by:

addEdge in interface EdgeManager<T>

getPredNodeCount

public int getPredNodeCount(T N)

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.

getPredNodes

public Iterator<T> getPredNodes(T N)

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.

getSuccNodeCount

public int getSuccNodeCount(T N)

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.

getSuccNodes

public Iterator<T> getSuccNodes(T N)

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

hasEdge

public boolean hasEdge(T src,
                       T dst)

Specified by:

hasEdge in interface EdgeManager<T>

removeEdge

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

Specified by:

removeEdge in interface EdgeManager<T>

Throws:

UnsupportedOperationException

getDefaultLabel

public U getDefaultLabel()

Description copied from interface: LabeledEdgeManager

Sets the default object used as label for operations where no specific edge label is provided. This is due to compatibility with the EdgeManager interface

Specified by:

getDefaultLabel in interface LabeledEdgeManager<T,U>

getPredNodeNumbers

public IntSet getPredNodeNumbers(T node,
                                 U label)
                          throws IllegalArgumentException

Specified by:

getPredNodeNumbers in interface NumberedLabeledEdgeManager<T,U>

Throws:

IllegalArgumentException

getSuccNodeNumbers

public IntSet getSuccNodeNumbers(T node,
                                 U label)
                          throws IllegalArgumentException

Specified by:

getSuccNodeNumbers in interface NumberedLabeledEdgeManager<T,U>

Throws:

IllegalArgumentException

getPredNodeNumbers

public IntSet getPredNodeNumbers(T node)

Specified by:

getPredNodeNumbers in interface NumberedEdgeManager<T>

Returns:

the numbers identifying the immediate predecessors of node

getSuccNodeNumbers

public IntSet getSuccNodeNumbers(T node)

Specified by:

getSuccNodeNumbers in interface NumberedEdgeManager<T>

Returns:

the numbers identifying the immediate successors of node