I
- input symbol typepublic class BaseTTTDiscriminationTree<I,D> extends AbstractDiscriminationTree<net.automatalib.words.Word<I>,I,D,TTTState<I,D>,AbstractBaseDTNode<I,D>>
oracle, root
Constructor and Description |
---|
BaseTTTDiscriminationTree(MembershipOracle<I,D> oracle,
AbstractBaseDTNode<I,D> root) |
BaseTTTDiscriminationTree(MembershipOracle<I,D> oracle,
Supplier<? extends AbstractBaseDTNode<I,D>> supplier) |
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) |
getNodes, getOutgoingEdges, getRoot, getTarget, lcaInfo, leastCommonAncestor, setOracle, sift
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
adjacentTargetsIterator, adjacentTargetsStream, getAdjacentTargets, getEdgesBetween, outgoingEdges, outgoingEdgesIterator, outgoingEdgesStream
iterator, nodeIDs, nodesStream, size
adjacentTargets, createDynamicNodeMapping, createStaticNodeMapping, isConnected
forEach, spliterator
public BaseTTTDiscriminationTree(MembershipOracle<I,D> oracle, Supplier<? extends AbstractBaseDTNode<I,D>> supplier)
public BaseTTTDiscriminationTree(MembershipOracle<I,D> oracle, AbstractBaseDTNode<I,D> root)
public AbstractBaseDTNode<I,D> sift(AccessSequenceProvider<I> asp)
asp
- the object providing the access sequencepublic AbstractBaseDTNode<I,D> sift(AccessSequenceProvider<I> asp, boolean hard)
asp
- the object providing the access sequencepublic AbstractBaseDTNode<I,D> sift(net.automatalib.words.Word<I> word, boolean hard)
public AbstractBaseDTNode<I,D> sift(AbstractBaseDTNode<I,D> start, net.automatalib.words.Word<I> word, boolean hard)
public AbstractBaseDTNode<I,D> sift(AbstractBaseDTNode<I,D> start, AccessSequenceProvider<I> asp, boolean hard)
public AbstractBaseDTNode<I,D> sift(AbstractBaseDTNode<I,D> start, net.automatalib.words.Word<I> prefix)
public net.automatalib.visualization.VisualizationHelper<AbstractBaseDTNode<I,D>,Map.Entry<D,AbstractBaseDTNode<I,D>>> getVisualizationHelper()
getVisualizationHelper
in interface net.automatalib.graphs.Graph<AbstractBaseDTNode<I,D>,Map.Entry<D,AbstractBaseDTNode<I,D>>>
getVisualizationHelper
in interface net.automatalib.graphs.SimpleGraph<AbstractBaseDTNode<I,D>>
getVisualizationHelper
in class AbstractDiscriminationTree<net.automatalib.words.Word<I>,I,D,TTTState<I,D>,AbstractBaseDTNode<I,D>>
Copyright © 2018. All rights reserved.