Package com.ibm.wala.util.graph

Interface NumberedNodeManager<T>

All Superinterfaces:

Iterable<T>, NodeManager<T>

All Known Subinterfaces:

CallGraph, ControlFlowGraph<I,T>, HeapGraph<T>, ISDG, ISupergraph<T,P>, MinimalCFG<T>, NumberedGraph<T>, NumberedLabeledGraph<T,I>

All Known Implementing Classes:

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

public interface NumberedNodeManager<T>
extends NodeManager<T>

An object which tracks nodes with numbers.

Method Summary

Modifier and Type	Method	Description
int	getMaxNumber()
T	getNode(int number)
int	getNumber(@Nullable T N)
Iterator<T>	iterateNodes(IntSet s)

Methods inherited from interface java.lang.Iterable

forEach, spliterator

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

addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream

Method Details

getNumber

int getNumber(@Nullable T N)

getNode

T getNode(int number)

getMaxNumber

int getMaxNumber()

iterateNodes

Iterator<T> iterateNodes(IntSet s)

Returns:

iterator of nodes with the numbers in set s