AbstractWordBasedDiscriminationTree<I,O,D> dtree
DTLearnerHypothesis<I,O,SP,TP> hypothesis
Object intSymbol
GenericObservationTable<I,D> observationTable
IncomingList<I,D> incoming
AbstractTTTHypothesis<I,D,T> hypothesis
BaseTTTDiscriminationTree<I,D> discriminationTree
int id
net.automatalib.commons.util.array.ResizingObjectArray transitions
TTTTransition<I,D> parentTransition
AbstractBaseDTNode<I,D> dtLeaf
PrefixTTTLearnerDFA.ExtDTNode<I> prevUnlabeled
PrefixTTTLearnerDFA.ExtDTNode<I> nextUnlabeled
int tempPrefix
boolean accepting
Object output
AbstractDTNode<DSCR,O,D,N extends AbstractDTNode<DSCR,O,D,N>> root
SplitData<O,T extends IntrusiveList<?>> splitData
IntrusiveListElem<T> prevElement
AbstractTemporaryIntrusiveDTNode<DSCR,O,D,T extends IntrusiveList<?>,N extends AbstractTemporaryIntrusiveDTNode<DSCR,O,D,T,N>> nextElement
boolean temp
Object next
List<E> shortPrefixRows
List<E> longPrefixRows
List<E> allRows
List<E> allRowContents
List<E> canonicalRows
Map<K,V> rowContentIds
Map<K,V> rowMap
List<E> suffixes
Set<E> suffixSet
int numRows
boolean initialConsistencyCheckRequired
BoundedDeque.EvictPolicy evictPolicy
BoundedDeque.AccessPolicy accessPolicy
int capacity
Deque<E> deque
Copyright © 2018. All rights reserved.