Package | Description |
---|---|
de.learnlib.algorithms.discriminationtree.hypothesis | |
de.learnlib.discriminationtree |
Modifier and Type | Method and Description |
---|---|
DTNode<I,O,HState<I,O,SP,TP>> |
HTransition.getDT() |
DTNode<I,O,HState<I,O,SP,TP>> |
HState.getDTLeaf() |
Modifier and Type | Method and Description |
---|---|
void |
HTransition.setDT(DTNode<I,O,HState<I,O,SP,TP>> dtNode) |
void |
HState.setDTLeaf(DTNode<I,O,HState<I,O,SP,TP>> dtLeaf) |
Constructor and Description |
---|
HTransition(HState<I,O,SP,TP> source,
I symbol,
DTNode<I,O,HState<I,O,SP,TP>> dtTgt) |
Modifier and Type | Class and Description |
---|---|
class |
BinaryDTNode<I,D> |
class |
MultiDTNode<I,O,D> |
Modifier and Type | Field and Description |
---|---|
DTNode<I,O,D> |
DiscriminationTree.LCAInfo.leastCommonAncestor |
DTNode<I,O,D> |
DTNode.SplitResult.nodeNew |
DTNode<I,O,D> |
DTNode.SplitResult.nodeOld |
protected DTNode<I,O,D> |
DTNode.parent |
Modifier and Type | Field and Description |
---|---|
protected Map<O,DTNode<I,O,D>> |
DTNode.children |
Modifier and Type | Method and Description |
---|---|
protected DTNode<I,O,D> |
DTNode.addChild(O outcome,
D data) |
DTNode<I,O,D> |
DTNode.child(O out) |
DTNode<I,O,D> |
DTNode.child(O out,
D defaultData) |
protected DTNode<I,Boolean,D> |
BinaryDTNode.createChild(Boolean outcome,
D data) |
protected DTNode<I,O,D> |
MultiDTNode.createChild(O outcome,
D data) |
protected abstract DTNode<I,O,D> |
DTNode.createChild(O outcome,
D data) |
DTNode<I,O,D> |
DTNode.getChild(O out) |
DTNode<I,O,D> |
DTNode.getParent() |
DTNode<I,O,D> |
DiscriminationTree.getRoot() |
DTNode<I,O,D> |
DiscriminationTree.GraphView.getTarget(Map.Entry<O,DTNode<I,O,D>> edge) |
DTNode<I,O,D> |
DiscriminationTree.leastCommonAncestor(DTNode<I,O,D> node1,
DTNode<I,O,D> node2) |
DTNode<I,O,D> |
DiscriminationTree.sift(DTNode<I,O,D> start,
Word<I> prefix) |
DTNode<I,O,D> |
DiscriminationTree.sift(Word<I> prefix) |
Modifier and Type | Method and Description |
---|---|
protected Map<O,DTNode<I,O,D>> |
MultiDTNode.createChildMap() |
protected abstract Map<O,DTNode<I,O,D>> |
DTNode.createChildMap() |
protected Map<Boolean,DTNode<I,Boolean,D>> |
BinaryDTNode.createChildMap() |
Collection<Map.Entry<O,DTNode<I,O,D>>> |
DTNode.getChildEntries() |
GraphDOTHelper<DTNode<I,O,D>,Map.Entry<O,DTNode<I,O,D>>> |
DiscriminationTree.GraphView.getGraphDOTHelper() |
GraphDOTHelper<DTNode<I,O,D>,Map.Entry<O,DTNode<I,O,D>>> |
DiscriminationTree.GraphView.getGraphDOTHelper() |
Collection<DTNode<I,O,D>> |
DiscriminationTree.GraphView.getNodes() |
Collection<Map.Entry<O,DTNode<I,O,D>>> |
DiscriminationTree.GraphView.getOutgoingEdges(DTNode<I,O,D> node) |
Modifier and Type | Method and Description |
---|---|
Collection<Map.Entry<O,DTNode<I,O,D>>> |
DiscriminationTree.GraphView.getOutgoingEdges(DTNode<I,O,D> node) |
DiscriminationTree.LCAInfo<I,O,D> |
DiscriminationTree.lcaInfo(DTNode<I,O,D> node1,
DTNode<I,O,D> node2) |
DiscriminationTree.LCAInfo<I,O,D> |
DiscriminationTree.lcaInfo(DTNode<I,O,D> node1,
DTNode<I,O,D> node2) |
DTNode<I,O,D> |
DiscriminationTree.leastCommonAncestor(DTNode<I,O,D> node1,
DTNode<I,O,D> node2) |
DTNode<I,O,D> |
DiscriminationTree.leastCommonAncestor(DTNode<I,O,D> node1,
DTNode<I,O,D> node2) |
DTNode<I,O,D> |
DiscriminationTree.sift(DTNode<I,O,D> start,
Word<I> prefix) |
Modifier and Type | Method and Description |
---|---|
DTNode<I,O,D> |
DiscriminationTree.GraphView.getTarget(Map.Entry<O,DTNode<I,O,D>> edge) |
Constructor and Description |
---|
BinaryDTNode(DTNode<I,Boolean,D> parent,
Boolean parentOutcome,
D data) |
DiscriminationTree(DTNode<I,O,D> root,
MembershipOracle<I,O> oracle) |
DTNode(DTNode<I,O,D> parent,
O parentOutcome,
D data) |
LCAInfo(DTNode<I,O,D> leastCommonAncestor,
O subtree1Label,
O subtree2Label) |
MultiDTNode(DTNode<I,O,D> parent,
O parentOutcome,
D data) |
SplitResult(DTNode<I,O,D> nodeOld,
DTNode<I,O,D> nodeNew) |
SplitResult(DTNode<I,O,D> nodeOld,
DTNode<I,O,D> nodeNew) |
Copyright © 2015. All rights reserved.