HState (LearnLib :: Algorithms :: Discrimination Tree 0.10.0 API)

public class HState<I,O,SP,TP>
extends Object

Constructors
Constructor and Description
`HState(int alphabetSize)`
`HState(int alphabetSize, int id, HTransition<I,O,SP,TP> treeIncoming)`

Methods
Modifier and Type	Method and Description
`void`	`addNonTreeIncoming(HTransition<I,O,SP,TP> trans)`
`void`	`appendAccessSequence(List<? super I> symList)`
`void`	`fetchNonTreeIncoming(Collection<? super HTransition<I,O,SP,TP>> target)`
`net.automatalib.words.Word<I>`	`getAccessSequence()`
`int`	`getDepth()`
`DTNode<I,O,HState<I,O,SP,TP>>`	`getDTLeaf()`
`int`	`getId()`
`Collection<HTransition<I,O,SP,TP>>`	`getOutgoingTransitions()`
`SP`	`getProperty()`
`HTransition<I,O,SP,TP>`	`getTransition(int transIdx)`
`HTransition<I,O,SP,TP>`	`getTreeIncoming()`
`void`	`setDTLeaf(DTNode<I,O,HState<I,O,SP,TP>> dtLeaf)`
`void`	`setProperty(SP property)`
`void`	`setTransition(int transIdx, HTransition<I,O,SP,TP> transition)`
`String`	`toString()`

public HState(int alphabetSize,
      int id,
      HTransition<I,O,SP,TP> treeIncoming)

public DTNode<I,O,HState<I,O,SP,TP>> getDTLeaf()

public void setDTLeaf(DTNode<I,O,HState<I,O,SP,TP>> dtLeaf)

public HTransition<I,O,SP,TP> getTreeIncoming()

public void appendAccessSequence(List<? super I> symList)

public net.automatalib.words.Word<I> getAccessSequence()

public HTransition<I,O,SP,TP> getTransition(int transIdx)

public void setTransition(int transIdx,
                 HTransition<I,O,SP,TP> transition)

public Collection<HTransition<I,O,SP,TP>> getOutgoingTransitions()

public void addNonTreeIncoming(HTransition<I,O,SP,TP> trans)

public void fetchNonTreeIncoming(Collection<? super HTransition<I,O,SP,TP>> target)

Class HState<I,O,SP,TP>