public interface FastSolverLinkedNode<D,N> extends Cloneable
| 限定符和类型 | 方法和说明 |
|---|---|
boolean |
addNeighbor(D originalAbstraction)
Links this node to a neighbor node, i.e., to an abstraction that would have
been merged with this one of paths were not being tracked.
|
D |
clone()
Clones this data flow abstraction
|
D |
getActiveCopy()
If this abstraction supports alias analysis, this returns the active copy of
the current abstraction.
|
int |
getNeighborCount()
Gets the number of neighbors already registered with this abstraction
|
int |
getPathLength()
Gets the length of the path over which this node was propagated
|
D |
getPredecessor()
Gets the predecessor of this node
|
void |
setPredecessor(D predecessor)
Explicitly sets the predecessor of this node.
|
boolean addNeighbor(D originalAbstraction)
int getNeighborCount()
void setPredecessor(D predecessor)
predecessor - The predecessor node to setD getPredecessor()
D clone()
D getActiveCopy()
int getPathLength()
Copyright © 2022 Fraunhofer SIT. All rights reserved.