Uses of Interface
de.learnlib.algorithm.adt.adt.ADTNode

Packages that use ADTNode

Package	Description
de.learnlib.algorithm.adt.ads
de.learnlib.algorithm.adt.adt
de.learnlib.algorithm.adt.api
de.learnlib.algorithm.adt.automaton
de.learnlib.algorithm.adt.config
de.learnlib.algorithm.adt.model
de.learnlib.algorithm.adt.util

Uses of ADTNode in de.learnlib.algorithm.adt.ads

Methods in de.learnlib.algorithm.adt.ads that return types with arguments of type ADTNode

Modifier and Type	Method	Description
static <S,I,O> Optional<ADTNode<S,I,O>>	DefensiveADS.compute(net.automatalib.automaton.transducer.MealyMachine<S,I,?,O> automaton, net.automatalib.alphabet.Alphabet<I> alphabet, Set<S> states, PartialTransitionAnalyzer<S,I> pta)	Compute an adaptive distinguishing sequence (as an ADT) for the given automaton and the given set of states.

Uses of ADTNode in de.learnlib.algorithm.adt.adt

Classes in de.learnlib.algorithm.adt.adt that implement ADTNode

Modifier and Type	Class	Description
class	ADTLeafNode<S,I,O>	Leaf node implementation.
class	ADTResetNode<S,I,O>	Reset node implementation.
class	ADTSymbolNode<S,I,O>	Symbol node implementation.

Fields in de.learnlib.algorithm.adt.adt declared as ADTNode

Modifier and Type	Field	Description
ADTNode<S,I,O>	ADT.LCAInfo.adtNode

Methods in de.learnlib.algorithm.adt.adt that return ADTNode

Modifier and Type	Method	Description
ADTNode<S,I,O>	ADT.extendLeaf(ADTNode<S,I,O> nodeToSplit, net.automatalib.word.Word<I> distinguishingSuffix, net.automatalib.word.Word<O> oldOutput, net.automatalib.word.Word<O> newOutput, LeafSplitter leafSplitter)	Splitting a leaf node by extending the trace leading into the node to split.
default ADTNode<S,I,O>	ADTNode.getChild(O output)	Convenience method for directly accessing this node's children.
ADTNode<S,I,O>	ADTResetNode.getParent()
ADTNode<S,I,O>	ADT.getRoot()	Returns the root node of this ADT.
ADTNode<S,I,O>	ADT.splitLeaf(ADTNode<S,I,O> nodeToSplit, net.automatalib.word.Word<I> distinguishingSuffix, net.automatalib.word.Word<O> oldOutput, net.automatalib.word.Word<O> newOutput, LeafSplitter leafSplitter)	Splits a leaf node using a given LeafSplitter.

Methods in de.learnlib.algorithm.adt.adt that return types with arguments of type ADTNode

Modifier and Type	Method	Description
Map<O,ADTNode<S,I,O>>	ADTResetNode.getChildren()
default Collection<ADTNode<S,I,O>>	ADTNode.getNodes()
default net.automatalib.visualization.VisualizationHelper<ADTNode<S,I,O>,ADTNode<S,I,O>>	ADTNode.getVisualizationHelper()
default net.automatalib.visualization.VisualizationHelper<ADTNode<S,I,O>,ADTNode<S,I,O>>	ADTNode.getVisualizationHelper()

Methods in de.learnlib.algorithm.adt.adt with parameters of type ADTNode

Modifier and Type	Method	Description
ADTNode<S,I,O>	ADT.extendLeaf(ADTNode<S,I,O> nodeToSplit, net.automatalib.word.Word<I> distinguishingSuffix, net.automatalib.word.Word<O> oldOutput, net.automatalib.word.Word<O> newOutput, LeafSplitter leafSplitter)	Splitting a leaf node by extending the trace leading into the node to split.
ADT.LCAInfo<S,I,O>	ADT.findLCA(ADTNode<S,I,O> s1, ADTNode<S,I,O> s2)	Return the lowest common ancestor for the given two nodes.
void	ADT.replaceNode(ADTNode<S,I,O> oldNode, ADTNode<S,I,O> newNode)	Replaces an existing node in the tree with a new one and updates the references of parent/child nodes accordingly.
void	ADTResetNode.setParent(ADTNode<S,I,O> parent)
ADTNode<S,I,O>	ADT.splitLeaf(ADTNode<S,I,O> nodeToSplit, net.automatalib.word.Word<I> distinguishingSuffix, net.automatalib.word.Word<O> oldOutput, net.automatalib.word.Word<O> newOutput, LeafSplitter leafSplitter)	Splits a leaf node using a given LeafSplitter.

Constructors in de.learnlib.algorithm.adt.adt with parameters of type ADTNode

Constructor	Description
ADTLeafNode(@Nullable ADTNode<S,I,O> parent, @Nullable S hypothesisState)
ADTResetNode(ADTNode<S,I,O> successor)
ADTSymbolNode(@Nullable ADTNode<S,I,O> parent, I symbol)

Uses of ADTNode in de.learnlib.algorithm.adt.api

Methods in de.learnlib.algorithm.adt.api that return ADTNode

Modifier and Type	Method	Description
<S,I,O> ADTNode<S,I,O>	LeafSplitter.split(ADTNode<S,I,O> nodeToSplit, net.automatalib.word.Word<I> distinguishingSuffix, net.automatalib.word.Word<O> oldOutput, net.automatalib.word.Word<O> newOutput)	Split the specified node to correctly distinguish between the old and new hypothesis state.

Methods in de.learnlib.algorithm.adt.api with parameters of type ADTNode

Modifier and Type	Method	Description
<I,O> ExtensionResult<ADTState<I,O>,I,O>	ADTExtender.computeExtension(ADTHypothesis<I,O> hypothesis, PartialTransitionAnalyzer<ADTState<I,O>,I> pta, ADTNode<ADTState<I,O>,I,O> temporarySplitter)	Compute the ADT whose root node should replace the root of the temporary splitter in the current ADT.
<S,I,O> ADTNode<S,I,O>	LeafSplitter.split(ADTNode<S,I,O> nodeToSplit, net.automatalib.word.Word<I> distinguishingSuffix, net.automatalib.word.Word<O> oldOutput, net.automatalib.word.Word<O> newOutput)	Split the specified node to correctly distinguish between the old and new hypothesis state.

Uses of ADTNode in de.learnlib.algorithm.adt.automaton

Methods in de.learnlib.algorithm.adt.automaton that return ADTNode

Modifier and Type	Method	Description
ADTNode<ADTState<I,O>,I,O>	ADTTransition.getSiftNode()

Methods in de.learnlib.algorithm.adt.automaton with parameters of type ADTNode

Modifier and Type	Method	Description
ADTTransition<I,O>	ADTHypothesis.createOpenTransition(ADTState<I,O> source, I input, ADTNode<ADTState<I,O>,I,O> siftTarget)
void	ADTTransition.setSiftNode(ADTNode<ADTState<I,O>,I,O> siftNode)

Uses of ADTNode in de.learnlib.algorithm.adt.config

Methods in de.learnlib.algorithm.adt.config that return ADTNode

Modifier and Type	Method	Description
static <S,I,O> ADTNode<S,I,O>	LeafSplitters.splitParent(ADTNode<S,I,O> nodeToSplit, net.automatalib.word.Word<I> distinguishingSuffix, net.automatalib.word.Word<O> oldOutput, net.automatalib.word.Word<O> newOutput)

Methods in de.learnlib.algorithm.adt.config with parameters of type ADTNode

Modifier and Type	Method	Description
static <S,I,O> ADTNode<S,I,O>	LeafSplitters.splitParent(ADTNode<S,I,O> nodeToSplit, net.automatalib.word.Word<I> distinguishingSuffix, net.automatalib.word.Word<O> oldOutput, net.automatalib.word.Word<O> newOutput)

Uses of ADTNode in de.learnlib.algorithm.adt.model

Methods in de.learnlib.algorithm.adt.model that return ADTNode

Modifier and Type	Method	Description
ADTNode<S,I,O>	ReplacementResult.getNodeToReplace()	The ADT subtree (root-node) that should be replaced.
@Nullable ADTNode<S,I,O>	ExtensionResult.getReplacement()	Return the proposed replacement.
ADTNode<S,I,O>	ReplacementResult.getReplacement()	The ADT subtree (root-node) that forms the replacement.

Methods in de.learnlib.algorithm.adt.model with parameters of type ADTNode

Modifier and Type	Method	Description
void	ObservationTree.addTrace(S state, ADTNode<S,I,O> adtNode)	See ObservationTree.addState(Object, Word, Object).

Constructors in de.learnlib.algorithm.adt.model with parameters of type ADTNode

Constructor	Description
ExtensionResult(ADTNode<S,I,O> ext)
ReplacementResult(ADTNode<S,I,O> nodeToReplace, ADTNode<S,I,O> replacement)
ReplacementResult(ADTNode<S,I,O> nodeToReplace, ADTNode<S,I,O> replacement, Set<S> cutoutNodes)

Uses of ADTNode in de.learnlib.algorithm.adt.util

Methods in de.learnlib.algorithm.adt.util that return ADTNode

Modifier and Type	Method	Description
static <S,I,O> ADTNode<S,I,O>	ADTUtil.buildADSFromObservation(net.automatalib.word.Word<I> input, net.automatalib.word.Word<O> output, S finalState)	Build a single trace ADS from the given information.
static <S,I,O> ADTNode<S,I,O>	ADTUtil.buildFromADS(net.automatalib.graph.ads.ADSNode<S,I,O> node)	Utility method that wraps an ADS of type ADSNode into the equivalent ADS of type ADTNode.
static <S,I,O> ADTNode<S,I,O>	ADTUtil.getStartOfADS(ADTNode<S,I,O> node)

Methods in de.learnlib.algorithm.adt.util that return types with arguments of type ADTNode

Modifier and Type	Method	Description
static <S,I,O> net.automatalib.common.util.Pair<ADTNode<S,I,O>,ADTNode<S,I,O>>	ADTUtil.buildADSFromTrace(net.automatalib.automaton.transducer.MealyMachine<S,I,?,O> automaton, net.automatalib.word.Word<I> trace, S state)
static <S,I,O> net.automatalib.common.util.Pair<ADTNode<S,I,O>,ADTNode<S,I,O>>	ADTUtil.buildADSFromTrace(net.automatalib.automaton.transducer.MealyMachine<S,I,?,O> automaton, net.automatalib.word.Word<I> trace, S state)
static <S,I,O> Set<ADTNode<S,I,O>>	ADTUtil.collectADSNodes(ADTNode<S,I,O> root, boolean includeRoot)
static <S,I,O> Set<ADTNode<S,I,O>>	ADTUtil.collectDirectSubADSs(ADTNode<S,I,O> node)
static <S,I,O> Set<ADTNode<S,I,O>>	ADTUtil.collectLeaves(ADTNode<S,I,O> root)
static <S,I,O> Set<ADTNode<S,I,O>>	ADTUtil.collectResetNodes(ADTNode<S,I,O> root)

Methods in de.learnlib.algorithm.adt.util with parameters of type ADTNode

Modifier and Type	Method	Description
static <S,I,O> net.automatalib.common.util.Pair<net.automatalib.word.Word<I>,net.automatalib.word.Word<O>>	ADTUtil.buildTraceForNode(ADTNode<S,I,O> node)
static <S,I,O> Set<ADTNode<S,I,O>>	ADTUtil.collectADSNodes(ADTNode<S,I,O> root, boolean includeRoot)
static <S,I,O> Set<ADTNode<S,I,O>>	ADTUtil.collectDirectSubADSs(ADTNode<S,I,O> node)
static <S> Set<S>	ADTUtil.collectHypothesisStates(ADTNode<S,?,?> root)
static <S,I,O> Set<ADTNode<S,I,O>>	ADTUtil.collectLeaves(ADTNode<S,I,O> root)
static <S,I,O> Set<ADTNode<S,I,O>>	ADTUtil.collectResetNodes(ADTNode<S,I,O> root)
static int	ADTUtil.computeEffectiveResets(ADTNode<?,?,?> adt)	Computes how often reset nodes are encountered when traversing from the given node to the leaves of the induced subtree of the given node.
static <S,I,O> O	ADTUtil.getOutputForSuccessor(ADTNode<S,I,O> node, ADTNode<S,I,O> successor)
static <S,I,O> ADTNode<S,I,O>	ADTUtil.getStartOfADS(ADTNode<S,I,O> node)
static boolean	ADTUtil.isLeafNode(@Nullable ADTNode<?,?,?> node)
static boolean	ADTUtil.isResetNode(@Nullable ADTNode<?,?,?> node)
static boolean	ADTUtil.isSymbolNode(@Nullable ADTNode<?,?,?> node)
static <S,I,O> boolean	ADTUtil.mergeADS(ADTNode<S,I,O> parent, ADTNode<S,I,O> child)	Tries to merge the given (single trace) ADSs (which only contains one leaf) into the given parent ADSs.