de.learnlib.algorithms.ttt.base

Class BaseTTTDiscriminationTree<I,D>

java.lang.Object

de.learnlib.datastructure.discriminationtree.model.AbstractDiscriminationTree<net.automatalib.words.Word<I>,I,D,TTTState<I,D>,AbstractBaseDTNode<I,D>>

de.learnlib.algorithms.ttt.base.BaseTTTDiscriminationTree<I,D>

Type Parameters:

I - input symbol type

All Implemented Interfaces:

Serializable, Iterable<AbstractBaseDTNode<I,D>>, net.automatalib.graphs.Graph<AbstractBaseDTNode<I,D>,Map.Entry<D,AbstractBaseDTNode<I,D>>>, net.automatalib.graphs.IndefiniteGraph<AbstractBaseDTNode<I,D>,Map.Entry<D,AbstractBaseDTNode<I,D>>>, net.automatalib.graphs.IndefiniteSimpleGraph<AbstractBaseDTNode<I,D>>, net.automatalib.graphs.SimpleGraph<AbstractBaseDTNode<I,D>>

public class BaseTTTDiscriminationTree<I,D>
extends AbstractDiscriminationTree<net.automatalib.words.Word<I>,I,D,TTTState<I,D>,AbstractBaseDTNode<I,D>>

The discrimination tree data structure.

Author:

Malte Isberner

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from interface net.automatalib.graphs.SimpleGraph

net.automatalib.graphs.SimpleGraph.NormalGraphView<N,G extends net.automatalib.graphs.SimpleGraph<N>>

Field Summary

Fields inherited from class de.learnlib.datastructure.discriminationtree.model.AbstractDiscriminationTree

oracle, root

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method and Description
net.automatalib.visualization.VisualizationHelper<AbstractBaseDTNode<I,D>,Map.Entry<D,AbstractBaseDTNode<I,D>>>	getVisualizationHelper()
AbstractBaseDTNode<I,D>	sift(AbstractBaseDTNode<I,D> start, AccessSequenceProvider<I> asp, boolean hard)
AbstractBaseDTNode<I,D>	sift(AbstractBaseDTNode<I,D> start, net.automatalib.words.Word<I> prefix)
AbstractBaseDTNode<I,D>	sift(AbstractBaseDTNode<I,D> start, net.automatalib.words.Word<I> word, boolean hard)
AbstractBaseDTNode<I,D>	sift(AccessSequenceProvider<I> asp) Sifts an access sequence provided by an object into the tree, starting at the root.
AbstractBaseDTNode<I,D>	sift(AccessSequenceProvider<I> asp, boolean hard) Sifts an access sequence provided by an object into the tree, starting at the root.
AbstractBaseDTNode<I,D>	sift(net.automatalib.words.Word<I> word, boolean hard)

Methods inherited from class de.learnlib.datastructure.discriminationtree.model.AbstractDiscriminationTree

getNodes, getOutgoingEdges, getRoot, getTarget, lcaInfo, leastCommonAncestor, setOracle, sift

Methods inherited from class java.lang.Object

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

Methods inherited from interface net.automatalib.graphs.Graph

asNormalGraph

Methods inherited from interface net.automatalib.graphs.IndefiniteGraph

adjacentTargetsIterator, adjacentTargetsStream, getAdjacentTargets, getEdgesBetween, outgoingEdges, outgoingEdgesIterator, outgoingEdgesStream

Methods inherited from interface net.automatalib.graphs.SimpleGraph

iterator, nodeIDs, nodesStream, size

Methods inherited from interface net.automatalib.graphs.IndefiniteSimpleGraph

adjacentTargets, createDynamicNodeMapping, createStaticNodeMapping, isConnected

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

BaseTTTDiscriminationTree

public BaseTTTDiscriminationTree(MembershipOracle<I,D> oracle,
                                 Supplier<? extends AbstractBaseDTNode<I,D>> supplier)

BaseTTTDiscriminationTree

public BaseTTTDiscriminationTree(MembershipOracle<I,D> oracle,
                                 AbstractBaseDTNode<I,D> root)

Method Detail

sift

public AbstractBaseDTNode<I,D> sift(AccessSequenceProvider<I> asp)

Sifts an access sequence provided by an object into the tree, starting at the root. This operation performs a "hard" sift, i.e., it will not stop at temporary nodes.

Parameters:

asp - the object providing the access sequence

Returns:

the leaf resulting from the sift operation

sift

public AbstractBaseDTNode<I,D> sift(AccessSequenceProvider<I> asp,
                                    boolean hard)

Sifts an access sequence provided by an object into the tree, starting at the root. This can either be a "soft" sift, which stops either at the leaf or at the first temporary node, or a "hard" sift, stopping only at a leaf.

Parameters:

asp - the object providing the access sequence

sift

public AbstractBaseDTNode<I,D> sift(net.automatalib.words.Word<I> word,
                                    boolean hard)

sift

public AbstractBaseDTNode<I,D> sift(AbstractBaseDTNode<I,D> start,
                                    net.automatalib.words.Word<I> word,
                                    boolean hard)

sift

public AbstractBaseDTNode<I,D> sift(AbstractBaseDTNode<I,D> start,
                                    AccessSequenceProvider<I> asp,
                                    boolean hard)

sift

public AbstractBaseDTNode<I,D> sift(AbstractBaseDTNode<I,D> start,
                                    net.automatalib.words.Word<I> prefix)

Specified by:

sift in class AbstractDiscriminationTree<net.automatalib.words.Word<I>,I,D,TTTState<I,D>,AbstractBaseDTNode<I,D>>

getVisualizationHelper

public net.automatalib.visualization.VisualizationHelper<AbstractBaseDTNode<I,D>,Map.Entry<D,AbstractBaseDTNode<I,D>>> getVisualizationHelper()

Specified by:

getVisualizationHelper in interface net.automatalib.graphs.Graph<AbstractBaseDTNode<I,D>,Map.Entry<D,AbstractBaseDTNode<I,D>>>

Specified by:

getVisualizationHelper in interface net.automatalib.graphs.SimpleGraph<AbstractBaseDTNode<I,D>>

Overrides:

getVisualizationHelper in class AbstractDiscriminationTree<net.automatalib.words.Word<I>,I,D,TTTState<I,D>,AbstractBaseDTNode<I,D>>