com.ibm.wala.util.graph
Interface NumberedNodeManager<T>

All Superinterfaces:

java.lang.Iterable<T>, NodeManager<T>

All Known Subinterfaces:

CallGraph, ControlFlowGraph<I,T>, ISDG, ISupergraph<T,P>, NumberedGraph<T>

All Known Implementing Classes:

AbstractCFG, AbstractDemandFlowGraph, AbstractFlowGraph, AbstractInterproceduralCFG, AbstractNumberedGraph, AbstractNumberedLabeledGraph, AstCallGraph, AstInducedCFG, AstTranslator.AstCFG, AstTranslator.IncipientCFG, BackwardsSupergraph, BasicCallGraph, BasicHeapGraph, CISDG, ControlDependenceGraph, CrossLanguageCallGraph, DelegatingCFG, DelegatingExplicitCallGraph, DelegatingNumberedGraph, DelegatingNumberedNodeManager, DemandPointerFlowGraph, DemandValueFlowGraph, ExplicitCallGraph, ExplodedControlFlowGraph, ExplodedInterproceduralCFG, HeapGraph, ICFGSupergraph, InducedCFG, InterproceduralCFG, InvertedNumberedGraph, JSCallGraph, JSInducedCFG, PartialCallGraph, PDG, PrunedCFG, SDG, ShrikeCFG, SimpleDemandPointerFlowGraph, SlowNumberedNodeManager, SlowSparseNumberedGraph, SlowSparseNumberedLabeledGraph, SparseNumberedGraph, SSACFG

public interface NumberedNodeManager<T>
extends NodeManager<T>

An object which tracks nodes with numbers.

Method Summary

int	getMaxNumber()
T	getNode(int number)
int	getNumber(T N)
java.util.Iterator<T>	iterateNodes(IntSet s)

Methods inherited from interface com.ibm.wala.util.graph.NodeManager

addNode, containsNode, getNumberOfNodes, iterator, removeNode

Method Detail

getNumber

int getNumber(T N)

getNode

T getNode(int number)

getMaxNumber

int getMaxNumber()

iterateNodes

java.util.Iterator<T> iterateNodes(IntSet s)

Parameters:

s -

Returns:

iterator of nodes with the numbers in set s