|
SandMark version 3.0 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--sandmark.obfuscate.loop.dfa.DFANode
A DFANode represents a node in a deterministic finite automata which models the dependency relationships between program transformations and how they affect the order in which the transformations can be applied to different application objects.
Field Summary | |
(package private) static int |
allLabels
|
(package private) int |
tempLabel
|
Constructor Summary | |
DFANode(java.lang.String label,
boolean accept)
Constructs a DFA Node with a given label (used for the DOT graph representation) |
Method Summary | |
void |
addIncomingEdge(DFAEdge edge)
|
void |
addOutgoingEdge(DFAEdge edge)
|
DFAEdge[] |
getIncomingEdges()
Returns the list of outgoing edges from this node. |
java.lang.String |
getLabel()
|
DFAEdge[] |
getOutgoingEdges()
Returns the list of outgoing edges from this node. |
boolean |
isAccept()
|
void |
removeIncomingEdge(DFAEdge edge)
|
void |
removeOutgoingEdge(DFAEdge edge)
|
void |
setAccept(boolean a)
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
int tempLabel
static int allLabels
Constructor Detail |
public DFANode(java.lang.String label, boolean accept)
Method Detail |
public boolean isAccept()
public void setAccept(boolean a)
public java.lang.String getLabel()
public void addOutgoingEdge(DFAEdge edge)
public void removeOutgoingEdge(DFAEdge edge)
public DFAEdge[] getOutgoingEdges()
public void addIncomingEdge(DFAEdge edge)
public void removeIncomingEdge(DFAEdge edge)
public DFAEdge[] getIncomingEdges()
|
SandMark version 3.0 Wed Jan 29 10:30:05 MST 2003 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |