public interface EfficientTree
extends java.lang.Cloneable
Modifier and Type | Interface and Description |
---|---|
static class |
EfficientTree.NodeType |
Modifier and Type | Method and Description |
---|---|
EfficientTree |
clone() |
void |
copy(int srcPos,
int destPos,
int length)
Please refer to EfficientTreeUtils for higher-level editing functions.
|
int |
getActivity(int node) |
gnu.trove.map.TObjectIntMap<java.lang.String> |
getActivity2int() |
java.lang.String |
getActivityName(int node) |
int |
getChild(int parent,
int numberOfChild) |
java.lang.Iterable<java.lang.Integer> |
getChildren(int node) |
java.lang.String[] |
getInt2activity() |
int |
getMaxNumberOfNodes() |
EfficientTree.NodeType |
getNodeType(int node) |
int |
getNumberOfChildren(int node) |
int |
getRoot() |
int[] |
getTree()
Deprecated.
|
boolean |
isActivity(int node) |
boolean |
isConcurrent(int node) |
boolean |
isInterleaved(int node) |
boolean |
isLoop(int node) |
boolean |
isOperator(int node) |
boolean |
isOr(int node) |
boolean |
isSequence(int node) |
boolean |
isSkip(int node) |
boolean |
isTau(int node) |
boolean |
isXor(int node) |
void |
reorderNodes(java.lang.Integer[] nodes,
int end)
Please refer to EfficientTreeUtils for higher-level editing functions.
|
void |
setNodeActivity(int node,
int activity)
Please refer to EfficientTreeUtils for higher-level editing functions.
|
void |
setNodeType(int node,
EfficientTree.NodeType nodeType)
Please refer to EfficientTreeUtils for higher-level editing functions.
|
void |
setNumberOfChildren(int node,
int numberOfChildren)
Please refer to EfficientTreeUtils for higher-level editing functions.
|
void |
setSize(int size)
Please refer to EfficientTreeUtils for higher-level editing functions.
|
void |
swap(int startA,
int startB,
int lengthB)
Please refer to EfficientTreeUtils for higher-level editing functions.
|
int |
traverse(int node) |
@Deprecated int[] getTree()
gnu.trove.map.TObjectIntMap<java.lang.String> getActivity2int()
java.lang.String[] getInt2activity()
int traverse(int node)
node
- int getActivity(int node)
node
- EfficientTree.NodeType getNodeType(int node)
node
- boolean isOperator(int node)
node
- int getNumberOfChildren(int node)
node
- boolean isTau(int node)
node
- boolean isActivity(int node)
node
- boolean isSequence(int node)
node
- boolean isXor(int node)
node
- boolean isConcurrent(int node)
node
- boolean isInterleaved(int node)
node
- boolean isLoop(int node)
node
- boolean isOr(int node)
node
- boolean isSkip(int node)
node
- java.lang.Iterable<java.lang.Integer> getChildren(int node)
node
- java.lang.String getActivityName(int node)
node
- int getChild(int parent, int numberOfChild)
parent
- numberOfChild
- (the first child has number 0)int getRoot()
int getMaxNumberOfNodes()
void copy(int srcPos, int destPos, int length)
srcPos
- start of the block - sourcedestPos
- start of the block - destinationlength
- number of nodes to be movedvoid setNodeType(int node, EfficientTree.NodeType nodeType)
node
- nodeType
- void setNumberOfChildren(int node, int numberOfChildren)
node
- numberOfChildren
- void setNodeActivity(int node, int activity)
node
- activity
- void setSize(int size)
size
- void swap(int startA, int startB, int lengthB)
startA
- startB
- lengthB
- void reorderNodes(java.lang.Integer[] nodes, int end)
nodes
- A consecutive but possibly shuffled list of indices, in which
to reorder nodes.end
- The index after the end of the last node.EfficientTree clone()