Uses of Class
de.learnlib.algorithms.ttt.base.AbstractBaseDTNode

Packages that use AbstractBaseDTNode

Package	Description
de.learnlib.algorithms.ttt.base
de.learnlib.algorithms.ttt.dfa
de.learnlib.algorithms.ttt.mealy

Uses of AbstractBaseDTNode in de.learnlib.algorithms.ttt.base

Fields in de.learnlib.algorithms.ttt.base declared as AbstractBaseDTNode

Modifier and Type	Field and Description
AbstractBaseDTNode<I,D>	AbstractTTTLearner.Splitter.succSeparator

Methods in de.learnlib.algorithms.ttt.base that return AbstractBaseDTNode

Modifier and Type	Method and Description
AbstractBaseDTNode<I,D>	AbstractBaseDTNode.anyChild()
protected abstract AbstractBaseDTNode<I,D>	AbstractTTTLearner.createNewNode(AbstractBaseDTNode<I,D> parent, D parentOutput)
AbstractBaseDTNode<I,D>	TTTState.getDTLeaf() Retrieves the discrimination tree leaf associated with this state.
AbstractBaseDTNode<I,D>	TTTTransition.getDTTarget()
AbstractBaseDTNode<I,D>	TTTTransition.getNonTreeTarget()
AbstractBaseDTNode<I,D>	BaseTTTDiscriminationTree.sift(AbstractBaseDTNode<I,D> start, Word<I> prefix)
AbstractBaseDTNode<I,D>	BaseTTTDiscriminationTree.sift(AbstractBaseDTNode<I,D> start, Word<I> prefix, boolean hard)
AbstractBaseDTNode<I,D>	BaseTTTDiscriminationTree.sift(Word<I> word, boolean hard) Sifts an access sequence provided by an object into the tree, starting at the root.

Methods in de.learnlib.algorithms.ttt.base that return types with arguments of type AbstractBaseDTNode

Modifier and Type	Method and Description
VisualizationHelper<AbstractBaseDTNode<I,D>,Map.Entry<D,AbstractBaseDTNode<I,D>>>	BaseTTTDiscriminationTree.getVisualizationHelper()
VisualizationHelper<AbstractBaseDTNode<I,D>,Map.Entry<D,AbstractBaseDTNode<I,D>>>	BaseTTTDiscriminationTree.getVisualizationHelper()
List<AbstractBaseDTNode<I,D>>	BaseTTTDiscriminationTree.sift(List<AbstractBaseDTNode<I,D>> starts, List<Word<I>> prefixes)
List<AbstractBaseDTNode<I,D>>	BaseTTTDiscriminationTree.sift(List<AbstractBaseDTNode<I,D>> starts, List<Word<I>> prefixes, boolean hard)
Iterator<AbstractBaseDTNode<I,D>>	AbstractBaseDTNode.subtreeNodesIterator()

Methods in de.learnlib.algorithms.ttt.base with parameters of type AbstractBaseDTNode

Modifier and Type	Method and Description
protected DefaultQuery<I,D>	BaseTTTDiscriminationTree.buildQuery(AbstractBaseDTNode<I,D> node, Word<I> prefix)
protected abstract AbstractBaseDTNode<I,D>	AbstractTTTLearner.createNewNode(AbstractBaseDTNode<I,D> parent, D parentOutput)
protected void	AbstractTTTLearner.declareFinal(AbstractBaseDTNode<I,D> blockRoot)
void	BlockList.insertBlock(AbstractBaseDTNode<I,D> blockRoot) Inserts a block into the list.
protected static <I,D> void	AbstractTTTLearner.link(AbstractBaseDTNode<I,D> dtNode, TTTState<I,D> state) Establish the connection between a node in the discrimination tree and a state of the hypothesis.
protected abstract D	AbstractTTTLearner.predictSuccOutcome(TTTTransition<I,D> trans, AbstractBaseDTNode<I,D> succSeparator)
AbstractBaseDTNode<I,D>	BaseTTTDiscriminationTree.sift(AbstractBaseDTNode<I,D> start, Word<I> prefix)
AbstractBaseDTNode<I,D>	BaseTTTDiscriminationTree.sift(AbstractBaseDTNode<I,D> start, Word<I> prefix, boolean hard)
protected AbstractDTNode.SplitResult	AbstractTTTLearner.split(AbstractBaseDTNode<I,D> node, Word<I> discriminator, D oldOutput, D newOutput)

Method parameters in de.learnlib.algorithms.ttt.base with type arguments of type AbstractBaseDTNode

Modifier and Type	Method and Description
List<AbstractBaseDTNode<I,D>>	BaseTTTDiscriminationTree.sift(List<AbstractBaseDTNode<I,D>> starts, List<Word<I>> prefixes)
List<AbstractBaseDTNode<I,D>>	BaseTTTDiscriminationTree.sift(List<AbstractBaseDTNode<I,D>> starts, List<Word<I>> prefixes, boolean hard)

Constructors in de.learnlib.algorithms.ttt.base with parameters of type AbstractBaseDTNode

Constructor and Description
AbstractBaseDTNode(AbstractBaseDTNode<I,D> parent, D parentEdgeLabel)
BaseTTTDiscriminationTree(MembershipOracle<I,D> oracle, AbstractBaseDTNode<I,D> root)
Splitter(int symbolIdx, AbstractBaseDTNode<I,D> succSeparator)

Constructor parameters in de.learnlib.algorithms.ttt.base with type arguments of type AbstractBaseDTNode

Constructor and Description
BaseTTTDiscriminationTree(MembershipOracle<I,D> oracle, Supplier<? extends AbstractBaseDTNode<I,D>> supplier)

Uses of AbstractBaseDTNode in de.learnlib.algorithms.ttt.dfa

Subclasses of AbstractBaseDTNode in de.learnlib.algorithms.ttt.dfa

Modifier and Type	Class and Description
protected static class	PrefixTTTLearnerDFA.ExtDTNode<I>
class	TTTDTNodeDFA<I> Binary discrimination tree node specialization.

Methods in de.learnlib.algorithms.ttt.dfa that return AbstractBaseDTNode

Modifier and Type	Method and Description
protected AbstractBaseDTNode<I,Boolean>	TTTDTNodeDFA.createChild(Boolean outcome, TTTState<I,Boolean> data)
protected AbstractBaseDTNode<I,Boolean>	TTTLearnerDFA.createNewNode(AbstractBaseDTNode<I,Boolean> parent, Boolean parentOutput)

Methods in de.learnlib.algorithms.ttt.dfa that return types with arguments of type AbstractBaseDTNode

Modifier and Type	Method and Description
protected Map<Boolean,AbstractBaseDTNode<I,Boolean>>	TTTDTNodeDFA.createChildMap()

Methods in de.learnlib.algorithms.ttt.dfa with parameters of type AbstractBaseDTNode

Modifier and Type	Method and Description
protected AbstractBaseDTNode<I,Boolean>	TTTLearnerDFA.createNewNode(AbstractBaseDTNode<I,Boolean> parent, Boolean parentOutput)
protected Boolean	TTTLearnerDFA.predictSuccOutcome(TTTTransition<I,Boolean> trans, AbstractBaseDTNode<I,Boolean> succSeparator)

Constructors in de.learnlib.algorithms.ttt.dfa with parameters of type AbstractBaseDTNode

Constructor and Description
TTTDTNodeDFA(AbstractBaseDTNode<I,Boolean> parent, Boolean parentEdgeLabel)

Constructor parameters in de.learnlib.algorithms.ttt.dfa with type arguments of type AbstractBaseDTNode

Constructor and Description
TTTLearnerDFA(Alphabet<I> alphabet, MembershipOracle<I,Boolean> oracle, AcexAnalyzer analyzer, Supplier<? extends AbstractBaseDTNode<I,Boolean>> rootSupplier)

Uses of AbstractBaseDTNode in de.learnlib.algorithms.ttt.mealy

Subclasses of AbstractBaseDTNode in de.learnlib.algorithms.ttt.mealy

Modifier and Type	Class and Description
class	TTTDTNodeMealy<I,D> Generic n-ary discrimination tree node specialization.

Methods in de.learnlib.algorithms.ttt.mealy that return AbstractBaseDTNode

Modifier and Type	Method and Description
protected AbstractBaseDTNode<I,D>	TTTDTNodeMealy.createChild(D outcome, TTTState<I,D> data)
protected AbstractBaseDTNode<I,Word<O>>	TTTLearnerMealy.createNewNode(AbstractBaseDTNode<I,Word<O>> parent, Word<O> parentOutput)

Methods in de.learnlib.algorithms.ttt.mealy that return types with arguments of type AbstractBaseDTNode

Modifier and Type	Method and Description
protected Map<D,AbstractBaseDTNode<I,D>>	TTTDTNodeMealy.createChildMap()

Methods in de.learnlib.algorithms.ttt.mealy with parameters of type AbstractBaseDTNode

Modifier and Type	Method and Description
protected AbstractBaseDTNode<I,Word<O>>	TTTLearnerMealy.createNewNode(AbstractBaseDTNode<I,Word<O>> parent, Word<O> parentOutput)
protected Word<O>	TTTLearnerMealy.predictSuccOutcome(TTTTransition<I,Word<O>> trans, AbstractBaseDTNode<I,Word<O>> succSeparator)

Constructors in de.learnlib.algorithms.ttt.mealy with parameters of type AbstractBaseDTNode

Constructor and Description
TTTDTNodeMealy(AbstractBaseDTNode<I,D> parent, D parentEdgeLabel)