Uses of Class de.learnlib.algorithm.observationpack.hypothesis.HState (LearnLib :: Algorithms :: Observation Pack 0.17.0 API)

Packages that use HState
Package	Description
de.learnlib.algorithm.observationpack	This package (and sub-packages) provides the implementation of the Observation-Pack learning algorithm as described in the PhD thesis Active learning of interface programs by Falk Howar.
de.learnlib.algorithm.observationpack.dfa
de.learnlib.algorithm.observationpack.hypothesis
de.learnlib.algorithm.observationpack.mealy
de.learnlib.algorithm.observationpack.moore

Uses of HState in de.learnlib.algorithm.observationpack

Methods in de.learnlib.algorithm.observationpack that return HState
Modifier and Type	Method	Description
`protected HState<I,D,SP,TP>`	AbstractOPLearner.`createState(HTransition<I,D,SP,TP> trans)`

Methods in de.learnlib.algorithm.observationpack that return types with arguments of type HState
Modifier and Type	Method	Description
`AbstractWordBasedDiscriminationTree<I,D,HState<I,D,SP,TP>>`	AbstractOPLearner.`getDiscriminationTree()`

Methods in de.learnlib.algorithm.observationpack with parameters of type HState
Modifier and Type	Method	Description
`protected void`	AbstractOPLearner.`initializeState(HState<I,D,SP,TP> newState)`
`protected abstract @Nullable Query<I,D>`	AbstractOPLearner.`spQuery(HState<I,D,SP,TP> state)`

Constructor parameters in de.learnlib.algorithm.observationpack with type arguments of type HState
Constructor	Description
`AbstractOPLearner(Alphabet<I> alphabet, MembershipOracle<I,D> oracle, LocalSuffixFinder<? super I,? super D> suffixFinder, boolean repeatedCounterexampleEvaluation, AbstractWordBasedDiscriminationTree<I,D,HState<I,D,SP,TP>> dtree)`

Uses of HState in de.learnlib.algorithm.observationpack.dfa

Methods in de.learnlib.algorithm.observationpack.dfa with parameters of type HState
Modifier and Type	Method	Description
`protected Query<I,Boolean>`	OPLearnerDFA.`spQuery(HState<I,Boolean,Boolean,Void> state)`

Uses of HState in de.learnlib.algorithm.observationpack.hypothesis

Methods in de.learnlib.algorithm.observationpack.hypothesis that return HState
Modifier and Type	Method	Description
`HState<I,O,SP,TP>`	OPLearnerHypothesis.`createInitialState()`
`HState<I,O,SP,TP>`	OPLearnerHypothesis.`createState(HTransition<I,O,SP,TP> treeIncoming)`
`HState<I,O,SP,TP>`	HTransition.`currentTarget()`
`HState<I,O,SP,TP>`	OPLearnerHypothesis.`getInitialState()`
`HState<I,O,SP,TP>`	OPLearnerHypothesis.GraphView.`getNode(int id)`
`HState<I,O,SP,TP>`	HTransition.`getSource()`
`HState<I,O,SP,TP>`	OPLearnerHypothesis.`getState(int id)`
`HState<I,O,SP,TP>`	OPLearnerHypothesis.`getSuccessor(HTransition<I,O,SP,TP> trans)`
`HState<I,O,SP,TP>`	OPLearnerHypothesis.GraphView.`getTarget(HTransition<I,O,SP,TP> edge)`
`HState<I,O,SP,TP>`	HTransition.`getTreeTarget()`
`HState<I,O,SP,TP>`	HTransition.`nonTreeTarget()`

Methods in de.learnlib.algorithm.observationpack.hypothesis that return types with arguments of type HState
Modifier and Type	Method	Description
`AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>>`	HTransition.`getDT()`
`AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>>`	HState.`getDTLeaf()`
`Collection<HState<I,O,SP,TP>>`	OPLearnerHypothesis.GraphView.`getNodes()`
`Collection<HState<I,O,SP,TP>>`	OPLearnerHypothesis.`getStates()`
`VisualizationHelper<HState<I,O,SP,TP>,HTransition<I,O,SP,TP>>`	OPLearnerHypothesis.GraphView.`getVisualizationHelper()`
`NodeIDs<HState<I,O,SP,TP>>`	OPLearnerHypothesis.GraphView.`nodeIDs()`
`StateIDs<HState<I,O,SP,TP>>`	OPLearnerHypothesis.`stateIDs()`

Methods in de.learnlib.algorithm.observationpack.hypothesis with parameters of type HState
Modifier and Type	Method	Description
`int`	OPLearnerHypothesis.GraphView.`getNodeId(HState<I,O,SP,TP> node)`
`Collection<HTransition<I,O,SP,TP>>`	OPLearnerHypothesis.GraphView.`getOutgoingEdges(HState<I,O,SP,TP> node)`
`int`	OPLearnerHypothesis.`getStateId(HState<I,O,SP,TP> state)`
`SP`	OPLearnerHypothesis.`getStateProperty(HState<I,O,SP,TP> state)`
`HTransition<I,O,SP,TP>`	OPLearnerHypothesis.`getTransition(HState<I,O,SP,TP> state, I symbol)`
`void`	HTransition.`makeTree(HState<I,O,SP,TP> treeTgt)`

Method parameters in de.learnlib.algorithm.observationpack.hypothesis with type arguments of type HState
Modifier and Type	Method	Description
`void`	HTransition.`setDT(AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>> dtNode)`
`void`	HState.`setDTLeaf(AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>> dtLeaf)`

Constructors in de.learnlib.algorithm.observationpack.hypothesis with parameters of type HState
Constructor	Description
`HTransition(HState<I,O,SP,TP> source, I symbol, AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>> dtTgt)`

Constructor parameters in de.learnlib.algorithm.observationpack.hypothesis with type arguments of type HState
Constructor	Description
`HTransition(HState<I,O,SP,TP> source, I symbol, AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>> dtTgt)`

Uses of HState in de.learnlib.algorithm.observationpack.mealy

Methods in de.learnlib.algorithm.observationpack.mealy with parameters of type HState
Modifier and Type	Method	Description
`protected @Nullable Query<I,Word<O>>`	OPLearnerMealy.`spQuery(HState<I,Word<O>,Void,O> state)`

Uses of HState in de.learnlib.algorithm.observationpack.moore

Methods in de.learnlib.algorithm.observationpack.moore with parameters of type HState
Modifier and Type	Method	Description
`protected @Nullable Query<I,Word<O>>`	OPLearnerMoore.`spQuery(HState<I,Word<O>,O,Void> state)`