public class BasicHeapGraph extends HeapGraphImpl
HeapGraph| Constructor and Description |
|---|
BasicHeapGraph(PointerAnalysis<InstanceKey> P,
CallGraph callGraph) |
| Modifier and Type | Method and Description |
|---|---|
void |
addEdge(Object from,
Object to) |
void |
addNode(Object n)
add a node to this graph
|
boolean |
containsNode(Object N) |
int |
getMaxNumber() |
Object |
getNode(int number) |
int |
getNumber(Object N) |
int |
getNumberOfNodes() |
int |
getPredNodeCount(Object N)
Return the number of
immediate predecessor nodes of n |
IntSet |
getPredNodeNumbers(Object node) |
Iterator<Object> |
getPredNodes(Object N)
Return an
Iterator over the immediate predecessor nodes of n
This method never returns null. |
int |
getSuccNodeCount(Object N)
Return the number of
immediate successor nodes of this Node in the Graph |
IntSet |
getSuccNodeNumbers(Object node) |
Iterator<Object> |
getSuccNodes(Object N)
Return an Iterator over the immediate successor nodes of n
|
boolean |
hasEdge(Object from,
Object to) |
Iterator<Object> |
iterator() |
void |
removeAllIncidentEdges(Object node) |
void |
removeEdge(Object from,
Object to) |
void |
removeIncomingEdges(Object node) |
void |
removeNode(Object n)
remove a node from this graph
|
void |
removeOutgoingEdges(Object node) |
String |
toString() |
getHeapModel, getPointerAnalysis, getReachableInstances, iterateNodes, removeNodeAndEdgesclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitforEach, spliteratorpublic BasicHeapGraph(PointerAnalysis<InstanceKey> P, CallGraph callGraph) throws NullPointerException
P - governing pointer analysisNullPointerException - if P is nullpublic int getNumber(Object N)
public Object getNode(int number)
public int getMaxNumber()
public int getNumberOfNodes()
public Iterator<Object> getPredNodes(Object N)
EdgeManagerIterator over the immediate predecessor nodes of n
This method never returns null.Iterator over the immediate predecessor nodes of this Node.public int getPredNodeCount(Object N)
EdgeManagerimmediate predecessor nodes of npublic Iterator<Object> getSuccNodes(Object N)
EdgeManager
This method never returns null.
public int getSuccNodeCount(Object N)
EdgeManagerimmediate successor nodes of this Node in the Graphpublic void addNode(Object n) throws UnimplementedError
NodeManagerUnimplementedErrorpublic void removeNode(Object n) throws UnimplementedError
NodeManagerUnimplementedErrorpublic void addEdge(Object from, Object to) throws UnimplementedError
UnimplementedErrorpublic void removeEdge(Object from, Object to) throws UnimplementedError
UnimplementedErrorpublic boolean hasEdge(Object from, Object to) throws UnimplementedError
UnimplementedErrorpublic void removeAllIncidentEdges(Object node) throws UnsupportedOperationException
UnsupportedOperationExceptionpublic boolean containsNode(Object N)
public void removeIncomingEdges(Object node) throws UnimplementedError
UnimplementedErrorpublic void removeOutgoingEdges(Object node) throws UnimplementedError
UnimplementedErrorpublic IntSet getSuccNodeNumbers(Object node) throws UnimplementedError
UnimplementedErrorpublic IntSet getPredNodeNumbers(Object node) throws UnimplementedError
UnimplementedError