de.learnlib.datastructure.discriminationtree.model

Class AbstractDiscriminationTree<DSCR,I,O,D,N extends AbstractDTNode<DSCR,O,D,N>>

java.lang.Object

de.learnlib.datastructure.discriminationtree.model.AbstractDiscriminationTree<DSCR,I,O,D,N>

Type Parameters:

DSCR - type of discrimantor

I - input symbol type

O - output symbol type

D - data symbol type

N - node type

All Implemented Interfaces:

Serializable, Iterable<N>, Graph<N,Map.Entry<O,N>>, IndefiniteGraph<N,Map.Entry<O,N>>, IndefiniteSimpleGraph<N>, SimpleGraph<N>

Direct Known Subclasses:

AbstractWordBasedDiscriminationTree

public abstract class AbstractDiscriminationTree<DSCR,I,O,D,N extends AbstractDTNode<DSCR,O,D,N>>
extends Object
implements Graph<N,Map.Entry<O,N>>, Serializable

An abstract super class for aggregating several information/functionality for discrimination trees.

Author:

frohme

See Also:

Serialized Form

Nested Class Summary

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

SimpleGraph.NormalGraphView<N,G extends SimpleGraph<N>>

Field Summary

Fields

Modifier and Type	Field and Description
protected MembershipOracle<I,O>	oracle
protected N	root

Constructor Summary

Constructors

Constructor and Description
AbstractDiscriminationTree(N root, MembershipOracle<I,O> oracle)

Method Summary

Modifier and Type	Method and Description
protected abstract DefaultQuery<I,O>	buildQuery(N node, Word<I> prefix)
Collection<N>	getNodes()
Collection<Map.Entry<O,N>>	getOutgoingEdges(N node)
N	getRoot()
N	getTarget(Map.Entry<O,N> edge)
VisualizationHelper<N,Map.Entry<O,N>>	getVisualizationHelper()
LCAInfo<O,N>	lcaInfo(N node1, N node2) Fetches for two nodes information about their lowest common ancestor in this discrimination tree.
N	leastCommonAncestor(N a, N b)
void	setOracle(MembershipOracle<I,O> oracle)
List<N>	sift(List<N> starts, List<Word<I>> prefixes)
protected List<N>	sift(List<N> starts, List<Word<I>> prefixes, Predicate<N> continueExploring)
N	sift(N start, Word<I> prefix)
protected N	sift(N start, Word<I> prefix, Predicate<N> continueExploring)
N	sift(Word<I> prefix)

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

Field Detail

root

protected final N extends AbstractDTNode<DSCR,O,D,N> root

oracle

protected transient MembershipOracle<I,O> oracle

Constructor Detail

AbstractDiscriminationTree

public AbstractDiscriminationTree(N root,
                                  MembershipOracle<I,O> oracle)

Method Detail

sift

public N sift(Word<I> prefix)

sift

public N sift(N start,
              Word<I> prefix)

sift

protected N sift(N start,
                 Word<I> prefix,
                 Predicate<N> continueExploring)

sift

public List<N> sift(List<N> starts,
                    List<Word<I>> prefixes)

sift

protected List<N> sift(List<N> starts,
                       List<Word<I>> prefixes,
                       Predicate<N> continueExploring)

getRoot

public N getRoot()

leastCommonAncestor

public N leastCommonAncestor(N a,
                             N b)

lcaInfo

public LCAInfo<O,N> lcaInfo(N node1,
                            N node2)

Fetches for two nodes information about their lowest common ancestor in this discrimination tree. LCAInfo.subtree1Label will reference the label of the outgoing child transition for the node closer to the LCA, LCAInfo.subtree2Label the label of the outgoing child transition for the node farther away from the LCA. If both nodes have equal depth, LCAInfo.subtree1Label contains node1's label and LCAInfo.subtree2Label node2's label.

Either LCAInfo.subtree1Label or LCAInfo.subtree2Label is null, if node1 (node2 respectively) already is the LCA.

Parameters:

node1 - first node

node2 - second node

Returns:

the corresponding LCAInfo.

buildQuery

protected abstract DefaultQuery<I,O> buildQuery(N node,
                                                Word<I> prefix)

getNodes

public Collection<N> getNodes()

Specified by:

getNodes in interface SimpleGraph<N extends AbstractDTNode<DSCR,O,D,N>>

getOutgoingEdges

public Collection<Map.Entry<O,N>> getOutgoingEdges(N node)

Specified by:

getOutgoingEdges in interface IndefiniteGraph<N extends AbstractDTNode<DSCR,O,D,N>,Map.Entry<O,N extends AbstractDTNode<DSCR,O,D,N>>>

getTarget

public N getTarget(Map.Entry<O,N> edge)

Specified by:

getTarget in interface IndefiniteGraph<N extends AbstractDTNode<DSCR,O,D,N>,Map.Entry<O,N extends AbstractDTNode<DSCR,O,D,N>>>

getVisualizationHelper

public VisualizationHelper<N,Map.Entry<O,N>> getVisualizationHelper()

Specified by:

getVisualizationHelper in interface Graph<N extends AbstractDTNode<DSCR,O,D,N>,Map.Entry<O,N extends AbstractDTNode<DSCR,O,D,N>>>

Specified by:

getVisualizationHelper in interface SimpleGraph<N extends AbstractDTNode<DSCR,O,D,N>>

setOracle

public void setOracle(MembershipOracle<I,O> oracle)