| Package | Description |
|---|---|
| de.learnlib.algorithms.discriminationtree.hypothesis.vpda | |
| de.learnlib.algorithms.discriminationtree.vpda |
| Modifier and Type | Class and Description |
|---|---|
class |
HypIntTrans<I> |
class |
HypRetTrans<I> |
| Modifier and Type | Field and Description |
|---|---|
protected IntrusiveListElemImpl<AbstractHypTrans<I>> |
AbstractHypTrans.prev |
| Modifier and Type | Method and Description |
|---|---|
AbstractHypTrans<I> |
TransList.chooseMinimal() |
AbstractHypTrans<I> |
OneSEVPAHypothesis.getInternalTransition(HypLoc<I> loc,
I intSym) |
AbstractHypTrans<I> |
OneSEVPAHypothesis.getInternalTransition(State<HypLoc<I>> state,
I sym) |
AbstractHypTrans<I> |
OneSEVPAHypothesis.getReturnTransition(HypLoc<I> loc,
I retSym,
HypLoc<I> stackLoc,
I callSym) |
AbstractHypTrans<I> |
OneSEVPAHypothesis.getReturnTransition(HypLoc<I> loc,
I retSym,
int stackSym) |
AbstractHypTrans<I> |
TransList.poll() |
| Modifier and Type | Method and Description |
|---|---|
void |
TransList.add(AbstractHypTrans<I> trans) |
void |
DTNode.addIncoming(AbstractHypTrans<I> trans) |
HypLoc<I> |
OneSEVPAHypothesis.createLocation(boolean accepting,
AbstractHypTrans<I> treeIncoming) |
| Constructor and Description |
|---|
HypLoc(VPDAlphabet<I> alphabet,
int index,
boolean accepting,
AbstractHypTrans<I> treeIncoming) |
| Modifier and Type | Method and Description |
|---|---|
protected HypLoc<I> |
AbstractVPDALearner.createLocation(AbstractHypTrans<I> trans) |
protected HypLoc<I> |
AbstractVPDALearner.makeTree(AbstractHypTrans<I> trans) |
| Modifier and Type | Method and Description |
|---|---|
protected List<DTNode<I>> |
AbstractVPDALearner.updateDTTargets(List<AbstractHypTrans<I>> trans,
boolean hard) |
Copyright © 2020. All rights reserved.