Modifier and Type | Method and Description |
---|---|
static EfficientTree |
TauMiner.mine() |
static EfficientTree |
FlowerMinerDfg.mine(java.lang.String[] activities) |
static EfficientTree |
FlowerMinerDfg.mine(org.deckfour.xes.classification.XEventClass[] vertices) |
static EfficientTree |
FlowerMiner.mine(org.deckfour.xes.info.XLogInfo logInfo) |
static EfficientTree |
TraceMiner.mineTraceModel(org.deckfour.xes.model.XLog log,
org.deckfour.xes.classification.XEventClassifier classifier) |
Modifier and Type | Class and Description |
---|---|
class |
EfficientTreeImpl |
Modifier and Type | Method and Description |
---|---|
static EfficientTree |
InlineTree.and(EfficientTree child1,
EfficientTree... children) |
EfficientTree |
EfficientTree.clone() |
EfficientTree |
EfficientTreeImpl.clone() |
static EfficientTree |
InlineTree.concurrent(java.util.Collection<EfficientTree> children)
Construct a new tree by putting the given children concurrent.
|
static EfficientTree |
InlineTree.concurrent(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children concurrent.
|
static EfficientTree |
ProcessTree2EfficientTree.convert(org.processmining.processtree.Node node)
Convert a process tree node to a efficient tree
|
static EfficientTree |
ProcessTree2EfficientTree.convert(org.processmining.processtree.ProcessTree processTree)
Convert a process tree into a efficient tree
|
static EfficientTree |
EfficientTreeFactory.create(int[] tree,
gnu.trove.map.TObjectIntMap<java.lang.String> activity2int,
java.lang.String[] int2activity) |
static EfficientTree |
InlineTree.inte(EfficientTree child1,
EfficientTree... children) |
static EfficientTree |
InlineTree.interleaved(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children interleaved.
|
static EfficientTree |
InlineTree.interleaved(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children interleaved.
|
static EfficientTree |
InlineTree.leaf(java.lang.String label) |
static EfficientTree |
InlineTree.loop(EfficientTree body,
EfficientTree redo,
EfficientTree exit)
Construct a new tree by putting the given children in loop.
|
static EfficientTree |
InlineTree.loop(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children in loop.
|
static EfficientTree |
InlineTree.or(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in an inclusive or.
|
static EfficientTree |
InlineTree.or(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children in an inclusive or.
|
static EfficientTree |
InlineTree.seq(EfficientTree child1,
EfficientTree... children) |
static EfficientTree |
InlineTree.sequence(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in sequence.
|
static EfficientTree |
InlineTree.sequence(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children in sequence.
|
static EfficientTree |
InlineTree.tau() |
static EfficientTree |
InlineTree.xor(java.util.Collection<EfficientTree> children)
Construct a new tree by putting the given children in xor.
|
static EfficientTree |
InlineTree.xor(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in xor.
|
Modifier and Type | Method and Description |
---|---|
static Triple<EfficientTree,java.lang.Integer,java.lang.String> |
ProcessTreeParser.parse(java.lang.String string,
int spacesPerTab) |
static Triple<EfficientTree,java.lang.Integer,java.lang.String> |
ProcessTreeParser.parseNode(ProcessTreeNodiser nodiser)
Parse the next node using nodiser.
|
Modifier and Type | Method and Description |
---|---|
static EfficientTree |
InlineTree.and(EfficientTree child1,
EfficientTree... children) |
static EfficientTree |
InlineTree.and(EfficientTree child1,
EfficientTree... children) |
boolean |
EfficientTreeReductionRule.apply(EfficientTree tree,
int node)
Apply the reduction rule on tree, on the node at position i.
|
static java.util.BitSet |
EfficientTreeMetrics.canOnlyProduceTau(EfficientTree tree) |
static boolean |
EfficientTreeMetrics.canOnlyProduceTau(EfficientTree tree,
int node) |
static boolean |
EfficientTreeMetrics.canProduceSingleActivity(EfficientTree tree,
int node,
int activity) |
static java.util.BitSet |
EfficientTreeMetrics.canProduceTau(EfficientTree tree) |
static boolean |
EfficientTreeMetrics.canProduceTau(EfficientTree tree,
int node) |
static EfficientTree |
InlineTree.concurrent(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children concurrent.
|
static EfficientTree |
InlineTree.concurrent(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children concurrent.
|
static org.processmining.acceptingpetrinet.models.AcceptingPetriNet |
EfficientTree2AcceptingPetriNet.convert(EfficientTree tree) |
static org.processmining.processtree.ProcessTree |
EfficientTree2processTree.convert(EfficientTree tree) |
static org.processmining.processtree.Node |
EfficientTree2processTree.convert(EfficientTree tree,
int node,
org.processmining.processtree.ProcessTree newTree) |
static java.lang.Iterable<java.lang.Integer> |
EfficientTreeUtils.getAllNodes(EfficientTree tree) |
static java.lang.Iterable<java.lang.Integer> |
EfficientTreeUtils.getAllNodes(EfficientTree tree,
int child) |
static int |
EfficientTreeUtils.getChildNumberWith(EfficientTree tree,
int parent,
int grandChild) |
static int |
EfficientTreeUtils.getChildWith(EfficientTree tree,
int parent,
int grandChild) |
static int |
EfficientTreeUtils.getLowestCommonParent(EfficientTree tree,
int nodeA,
int nodeB) |
static int |
EfficientTreeUtils.getParent(EfficientTree tree,
int node)
Returns the parent of node.
|
static long |
EfficientTreeMetrics.getShortestTrace(EfficientTree tree,
int node) |
static java.lang.String |
EfficientTreeHash.hash(EfficientTree tree) |
static java.lang.String |
EfficientTreeHash.hash(EfficientTree tree,
int node) |
static java.lang.String |
EfficientTreeHash.hashOnIndices(EfficientTree tree) |
static EfficientTree |
InlineTree.inte(EfficientTree child1,
EfficientTree... children) |
static EfficientTree |
InlineTree.inte(EfficientTree child1,
EfficientTree... children) |
static EfficientTree |
InlineTree.interleaved(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children interleaved.
|
static EfficientTree |
InlineTree.interleaved(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children interleaved.
|
static boolean |
EfficientTreeUtils.isConsistent(EfficientTree tree) |
static boolean |
EfficientTreeUtils.isParentOf(EfficientTree tree,
int parent,
int child) |
static Pair<java.util.BitSet,int[]> |
EfficientTreeReduce.isSuperfluousTau(EfficientTree tree,
java.util.BitSet canProduceTau) |
static EfficientTree |
InlineTree.loop(EfficientTree body,
EfficientTree redo,
EfficientTree exit)
Construct a new tree by putting the given children in loop.
|
static boolean |
EfficientTreeMetrics.onlyEmptyTrace(EfficientTree tree,
int node) |
static EfficientTree |
InlineTree.or(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in an inclusive or.
|
static EfficientTree |
InlineTree.or(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in an inclusive or.
|
static void |
EfficientTreeReduce.reduce(EfficientTree tree) |
static void |
EfficientTreeReduce.reduce(EfficientTree tree,
EfficientTreeReduceParameters reduceParameters) |
static void |
EfficientTreeUtils.removeChild(EfficientTree tree,
int parent,
int child)
Remove a child of a node.
|
static org.processmining.processtree.Node |
EfficientTree2processTree.replaceNode(org.processmining.processtree.Node node,
EfficientTree tree)
Make tree a subtree that replaces node.
|
static void |
EfficientTreeUtils.replaceNodeWithTau(EfficientTree tree,
int node)
Replace a node and all of its children by a single tau.
|
static EfficientTree |
InlineTree.seq(EfficientTree child1,
EfficientTree... children) |
static EfficientTree |
InlineTree.seq(EfficientTree child1,
EfficientTree... children) |
static EfficientTree |
InlineTree.sequence(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in sequence.
|
static EfficientTree |
InlineTree.sequence(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in sequence.
|
void |
EfficientTreeEditor.setTree(EfficientTree tree)
Set the editor to the given tree.
|
static java.lang.String |
EfficientTree2HumanReadableString.toMachineString(EfficientTree tree) |
static java.lang.String |
EfficientTree2HumanReadableString.toString(EfficientTree tree) |
static boolean |
EfficientTreeMetrics.traceLengthAtMostOne(EfficientTree tree,
int node) |
static java.lang.String |
EfficientTree2HumanReadableString.tree2string(EfficientTree tree,
int indent,
int node,
boolean machineReadable) |
static EfficientTree |
InlineTree.xor(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in xor.
|
static EfficientTree |
InlineTree.xor(EfficientTree child1,
EfficientTree... children)
Construct a new tree by putting the given children in xor.
|
Modifier and Type | Method and Description |
---|---|
static EfficientTree |
InlineTree.concurrent(java.util.Collection<EfficientTree> children)
Construct a new tree by putting the given children concurrent.
|
static EfficientTree |
InlineTree.interleaved(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children interleaved.
|
static EfficientTree |
InlineTree.loop(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children in loop.
|
static EfficientTree |
InlineTree.or(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children in an inclusive or.
|
static EfficientTree |
InlineTree.sequence(java.util.List<EfficientTree> children)
Construct a new tree by putting the given children in sequence.
|
static EfficientTree |
InlineTree.xor(java.util.Collection<EfficientTree> children)
Construct a new tree by putting the given children in xor.
|
Constructor and Description |
---|
EfficientTreeEditor(EfficientTree tree,
java.lang.String message) |
Modifier and Type | Method and Description |
---|---|
boolean |
And2Or.apply(EfficientTree tree,
int node) |
boolean |
IntShortLanguage.apply(EfficientTree tree,
int node) |
boolean |
LoopATauTau2flower.apply(EfficientTree tree,
int loop) |
boolean |
LoopLoop.apply(EfficientTree tree,
int loop) |
boolean |
LoopTau.apply(EfficientTree tree,
int node) |
boolean |
LoopTauATau2flower.apply(EfficientTree tree,
int loop)
Deprecated.
|
boolean |
OrXorTau.apply(EfficientTree tree,
int node) |
boolean |
SameOperator.apply(EfficientTree tree,
int node) |
boolean |
SingleChild.apply(EfficientTree tree,
int node) |
boolean |
TauChildOfOr.apply(EfficientTree tree,
int node) |
boolean |
TauChildOfSeqAndInt.apply(EfficientTree tree,
int node) |
boolean |
XorDoubleSingleChild.apply(EfficientTree tree,
int node) |
boolean |
XorTauTau.apply(EfficientTree tree,
int node) |
boolean |
XorTauTauLoop2flowerRevert.apply(EfficientTree tree,
int node) |
Modifier and Type | Method and Description |
---|---|
static EfficientTree |
EfficientTreeImportPlugin.importFromFile(java.io.File file) |
static EfficientTree |
EfficientTreeImportPlugin.importFromStream(java.io.InputStream stream) |
EfficientTree |
ProcessTree2EfficientTreePlugin.measure1automata(org.processmining.contexts.uitopia.UIPluginContext context,
org.processmining.processtree.ProcessTree tree) |
EfficientTree |
IMTree.mineTree(org.processmining.framework.plugin.PluginContext context,
org.deckfour.xes.model.XLog log) |
static EfficientTree |
IMTree.mineTree(org.deckfour.xes.model.XLog log,
MiningParameters parameters) |
EfficientTree |
IMTree.mineTreeParameters(org.processmining.framework.plugin.PluginContext context,
org.deckfour.xes.model.XLog log,
MiningParameters parameters) |
Modifier and Type | Method and Description |
---|---|
org.processmining.acceptingpetrinet.models.AcceptingPetriNet |
EfficientTree2AcceptingPetriNetPlugin.convert(org.processmining.framework.plugin.PluginContext context,
EfficientTree tree) |
org.processmining.processtree.ProcessTree |
ProcessTree2EfficientTreePlugin.convertBack(org.processmining.contexts.uitopia.UIPluginContext context,
EfficientTree tree) |
static void |
EfficientTreeExportPlugin.export(EfficientTree tree,
java.io.File file) |
void |
EfficientTreeExportPlugin.exportDefault(org.processmining.contexts.uitopia.UIPluginContext context,
EfficientTree tree,
java.io.File file) |
org.processmining.processtree.ProcessTree |
EfficientTree2processTreePlugin.mineGuiProcessTree(org.processmining.framework.plugin.PluginContext context,
EfficientTree tree) |