Package org.processmining.plugins.InductiveMiner.efficienttree

Class InlineTree

java.lang.Object

org.processmining.plugins.InductiveMiner.efficienttree.InlineTree

public class InlineTree
extends java.lang.Object

Constructor Summary

Constructors

Constructor	Description
InlineTree()

Method Summary

Modifier and Type	Method	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(java.util.List<EfficientTree> children)	Construct a new tree by putting the given children interleaved.
static EfficientTree	interleaved(EfficientTree child1, EfficientTree... children)	Construct a new tree by putting the given children interleaved.
static EfficientTree	leaf(java.lang.String label)
static EfficientTree	loop(java.util.List<EfficientTree> children)	Construct a new tree by putting the given children in loop.
static EfficientTree	loop(EfficientTree body, EfficientTree redo, EfficientTree exit)	Construct a new tree by putting the given children in loop.
static EfficientTree	or(java.util.List<EfficientTree> children)	Construct a new tree by putting the given children in an inclusive or.
static EfficientTree	or(EfficientTree child1, 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(java.util.List<EfficientTree> children)	Construct a new tree by putting the given children in sequence.
static EfficientTree	sequence(EfficientTree child1, 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.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

InlineTree

public InlineTree()

Method Detail

leaf

public static EfficientTree leaf(java.lang.String label)

Parameters:

label -

Returns:

a leaf with the given label

tau

public static EfficientTree tau()

xor

public static EfficientTree xor(EfficientTree child1,
                                EfficientTree... children)

Construct a new tree by putting the given children in xor. The children will be copied.

Parameters:

child1 -

children -

xor

public static EfficientTree xor(java.util.Collection<EfficientTree> children)

Construct a new tree by putting the given children in xor. The children will be copied.

Parameters:

children -

sequence

public static EfficientTree sequence(EfficientTree child1,
                                     EfficientTree... children)

Construct a new tree by putting the given children in sequence. The children will be copied.

Parameters:

child1 -

children -

seq

public static EfficientTree seq(EfficientTree child1,
                                EfficientTree... children)

sequence

public static EfficientTree sequence(java.util.List<EfficientTree> children)

Construct a new tree by putting the given children in sequence. The children will be copied.

Parameters:

children -

concurrent

public static EfficientTree concurrent(EfficientTree child1,
                                       EfficientTree... children)

Construct a new tree by putting the given children concurrent. The children will be copied.

Parameters:

child1 -

children -

and

public static EfficientTree and(EfficientTree child1,
                                EfficientTree... children)

concurrent

public static EfficientTree concurrent(java.util.Collection<EfficientTree> children)

Construct a new tree by putting the given children concurrent. The children will be copied.

Parameters:

children -

loop

public static EfficientTree loop(EfficientTree body,
                                 EfficientTree redo,
                                 EfficientTree exit)

Construct a new tree by putting the given children in loop. The children will be copied.

Parameters:

body -

redo -

exit -

Returns:

loop

public static EfficientTree loop(java.util.List<EfficientTree> children)

Construct a new tree by putting the given children in loop. The children will be copied. Three children must be given.

Parameters:

children -

interleaved

public static EfficientTree interleaved(EfficientTree child1,
                                        EfficientTree... children)

Construct a new tree by putting the given children interleaved. The children will be copied.

Parameters:

child1 -

children -

inte

public static EfficientTree inte(EfficientTree child1,
                                 EfficientTree... children)

interleaved

public static EfficientTree interleaved(java.util.List<EfficientTree> children)

Construct a new tree by putting the given children interleaved. The children will be copied.

Parameters:

children -

or

public static EfficientTree or(EfficientTree child1,
                               EfficientTree... children)

Construct a new tree by putting the given children in an inclusive or. The children will be copied.

Parameters:

child1 -

children -

or

public static EfficientTree or(java.util.List<EfficientTree> children)

Construct a new tree by putting the given children in an inclusive or. The children will be copied.

Parameters:

children -