Package de.learnlib.datastructure.discriminationtree.model

Class AbstractTemporaryIntrusiveDTNode<DSCR,O,D,T extends IntrusiveList<?>,N extends AbstractTemporaryIntrusiveDTNode<DSCR,O,D,T,N>>

java.lang.Object

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

de.learnlib.datastructure.discriminationtree.model.AbstractTemporaryIntrusiveDTNode<DSCR,O,D,T,N>

Type Parameters:

DSCR - discriminator type

O - output symbol type

D - node data type

T - link structure type

N - node type

All Implemented Interfaces:

IntrusiveListElem<N>

public abstract class AbstractTemporaryIntrusiveDTNode<DSCR,O,D,T extends IntrusiveList<?>,N extends AbstractTemporaryIntrusiveDTNode<DSCR,O,D,T,N>>
extends AbstractDTNode<DSCR,O,D,N>
implements IntrusiveListElem<N>

An extension of the AbstractDTNode that adds the concept of temporary splitters as well as linking discrimination tree nodes outside their regular tree structure. Currently used by the TTT algorithm (both regular and VPA) and the DT algorithm (VPA variant).

Nested Class Summary

Nested classes/interfaces inherited from class de.learnlib.datastructure.discriminationtree.model.AbstractDTNode

AbstractDTNode.SplitResult

Field Summary

Fields

Modifier and Type	Field	Description
protected N	nextElement
protected IntrusiveListElem<N>	prevElement
protected SplitData<O,T>	splitData

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

children, data, depth, discriminator, parent, parentOutcome

Constructor Summary

Constructors

Constructor	Description
AbstractTemporaryIntrusiveDTNode(N parent, O parentOutcome, D data)

Method Summary

Modifier and Type	Method	Description
N	anyChild()
N	getNextElement()
IntrusiveListElem<N>	getPrevElement()
SplitData<O,T>	getSplitData()
boolean	isBlockRoot()
boolean	isInner()
boolean	isTemp()
void	removeFromBlockList()
void	setChild(O label, N newChild)
void	setNextElement(N nextBlock)
void	setPrevElement(IntrusiveListElem<N> prevElement)
void	setSplitData(SplitData<O,T> splitData)
void	setTemp(boolean temp)

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

addChild, child, child, createChild, createChildMap, getChild, getChildEntries, getChildren, getData, getDepth, getDiscriminator, getParent, getParentOutcome, isLeaf, isRoot, replaceChildren, setData, setDiscriminator, split, split, split, subtreeLabel

Methods inherited from class java.lang.Object

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

Field Detail

splitData

protected SplitData<O,T extends IntrusiveList<?>> splitData

prevElement

protected IntrusiveListElem<N extends AbstractTemporaryIntrusiveDTNode<DSCR,O,D,T,N>> prevElement

nextElement

protected N extends AbstractTemporaryIntrusiveDTNode<DSCR,O,D,T,N> nextElement

Constructor Detail

AbstractTemporaryIntrusiveDTNode

public AbstractTemporaryIntrusiveDTNode(N parent,
                                        O parentOutcome,
                                        D data)

Method Detail

setChild

public void setChild(O label,
                     N newChild)

isTemp

public boolean isTemp()

setTemp

public void setTemp(boolean temp)

getSplitData

public SplitData<O,T> getSplitData()

setSplitData

public void setSplitData(SplitData<O,T> splitData)

anyChild

public N anyChild()

isInner

public boolean isInner()

isBlockRoot

public boolean isBlockRoot()

removeFromBlockList

public void removeFromBlockList()

getNextElement

public N getNextElement()

Specified by:

getNextElement in interface IntrusiveListElem<DSCR>

setNextElement

public void setNextElement(N nextBlock)

Specified by:

setNextElement in interface IntrusiveListElem<DSCR>

getPrevElement

public IntrusiveListElem<N> getPrevElement()

setPrevElement

public void setPrevElement(IntrusiveListElem<N> prevElement)