Class BasicHeapGraph<T extends InstanceKey>
java.lang.Object
com.ibm.wala.analysis.pointers.HeapGraphImpl<T>
com.ibm.wala.analysis.pointers.BasicHeapGraph<T>
- All Implemented Interfaces:
HeapGraph<T>
,EdgeManager<Object>
,Graph<Object>
,NodeManager<Object>
,NumberedEdgeManager<Object>
,NumberedGraph<Object>
,NumberedNodeManager<Object>
,Iterable<Object>
Basic implementation of
HeapGraph
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionvoid
void
add a node to this graphboolean
int
getNode
(int number) int
int
int
Return the number ofimmediate predecessor
nodes of ngetPredNodeNumbers
(Object node) Return anIterator
over the immediate predecessor nodes of nint
Return the number ofimmediate successor
nodes of this Node in the GraphgetSuccNodeNumbers
(Object node) Return an Iterator over the immediate successor nodes of nboolean
iterator()
void
removeAllIncidentEdges
(Object node) void
removeEdge
(Object from, Object to) void
removeIncomingEdges
(Object node) void
removeNode
(Object n) remove a node from this graphvoid
removeOutgoingEdges
(Object node) stream()
toString()
Methods inherited from class com.ibm.wala.analysis.pointers.HeapGraphImpl
getHeapModel, getPointerAnalysis, getReachableInstances, iterateNodes, removeNodeAndEdges
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
-
BasicHeapGraph
- Parameters:
P
- governing pointer analysis- Throws:
NullPointerException
- if P is null
-
-
Method Details
-
getNumber
- See Also:
-
getNode
- See Also:
-
getMaxNumber
public int getMaxNumber()- See Also:
-
iterator
-
stream
-
getNumberOfNodes
public int getNumberOfNodes()- Returns:
- the number of nodes in this graph
- See Also:
-
getPredNodes
-
getPredNodeCount
Description copied from interface:EdgeManager
Return the number ofimmediate predecessor
nodes of n- Returns:
- the number of immediate predecessors of n.
- See Also:
-
getSuccNodes
Description copied from interface:EdgeManager
Return an Iterator over the immediate successor nodes of nThis method never returns
null
.- Returns:
- an Iterator over the immediate successor nodes of n
- See Also:
-
getSuccNodeCount
Description copied from interface:EdgeManager
Return the number ofimmediate successor
nodes of this Node in the Graph- Returns:
- the number of immediate successor Nodes of this Node in the Graph.
- See Also:
-
addNode
Description copied from interface:NodeManager
add a node to this graph- Throws:
UnimplementedError
- See Also:
-
removeNode
Description copied from interface:NodeManager
remove a node from this graph- Throws:
UnimplementedError
- See Also:
-
addEdge
- Throws:
UnimplementedError
-
removeEdge
- Throws:
UnimplementedError
-
hasEdge
- Throws:
UnimplementedError
-
removeAllIncidentEdges
- Throws:
UnsupportedOperationException
-
containsNode
- Returns:
- true iff the graph contains the specified node
- See Also:
-
toString
-
removeIncomingEdges
- Throws:
UnimplementedError
-
removeOutgoingEdges
- Throws:
UnimplementedError
-
getSuccNodeNumbers
- Returns:
- the numbers identifying the immediate successors of node
- Throws:
UnimplementedError
-
getPredNodeNumbers
- Returns:
- the numbers identifying the immediate predecessors of node
- Throws:
UnimplementedError
-