public class InlineTree
extends java.lang.Object
Constructor and Description |
---|
InlineTree() |
Modifier and Type | Method and Description |
---|---|
static EfficientTree |
and(EfficientTree child1,
EfficientTree... children) |
static EfficientTree |
concurrent(java.util.Collection<EfficientTree> children)
Construct a new tree by putting the given children concurrent.
|
static EfficientTree |
concurrent(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children concurrent.
|
static EfficientTree |
inte(EfficientTree child1,
EfficientTree... children) |
static EfficientTree |
interleaved(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children interleaved.
|
static EfficientTree |
interleaved(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children interleaved.
|
static EfficientTree |
leaf(java.lang.String label) |
static EfficientTree |
loop(EfficientTree body,
EfficientTree redo,
EfficientTree exit)
Construct a new tree by putting the given children in loop.
|
static EfficientTree |
loop(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children in loop.
|
static EfficientTree |
or(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in an inclusive or.
|
static EfficientTree |
or(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children in an inclusive or.
|
static EfficientTree |
seq(EfficientTree child1,
EfficientTree... children) |
static EfficientTree |
sequence(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in sequence.
|
static EfficientTree |
sequence(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children in sequence.
|
static EfficientTree |
tau() |
static EfficientTree |
xor(java.util.Collection<EfficientTree> children)
Construct a new tree by putting the given children in xor.
|
static EfficientTree |
xor(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in xor.
|
public static EfficientTree leaf(java.lang.String label)
label
- public static EfficientTree tau()
public static EfficientTree xor(EfficientTree child1, EfficientTree... children)
child1
- children
- public static EfficientTree xor(java.util.Collection<EfficientTree> children)
children
- public static EfficientTree sequence(EfficientTree child1, EfficientTree... children)
child1
- children
- public static EfficientTree seq(EfficientTree child1, EfficientTree... children)
public static EfficientTree sequence(java.util.List<EfficientTree> children)
children
- public static EfficientTree concurrent(EfficientTree child1, EfficientTree... children)
child1
- children
- public static EfficientTree and(EfficientTree child1, EfficientTree... children)
public static EfficientTree concurrent(java.util.Collection<EfficientTree> children)
children
- public static EfficientTree loop(EfficientTree body, EfficientTree redo, EfficientTree exit)
body
- redo
- exit
- public static EfficientTree loop(java.util.List<EfficientTree> children)
children
- public static EfficientTree interleaved(EfficientTree child1, EfficientTree... children)
child1
- children
- public static EfficientTree inte(EfficientTree child1, EfficientTree... children)
public static EfficientTree interleaved(java.util.List<EfficientTree> children)
children
- public static EfficientTree or(EfficientTree child1, EfficientTree... children)
child1
- children
- public static EfficientTree or(java.util.List<EfficientTree> children)
children
-