LinkedHashSet<E> splitters
CompactMealy<I,O> hypothesis
Map<K,V> accessSequences
AbstractWordBasedDiscriminationTree<I,O,D> dtree
DTLearnerHypothesis<I,O,SP,TP> hypothesis
HTransition<I,O,SP,TP> treeIncoming
int id
int depth
ResizingArrayStorage<T> transitions
List<E> nonTreeIncoming
AbstractWordBasedDTNode<I,O,D> dtLeaf
Object property
CompactDFA<I> hypothesis
BinaryDTree<I,D> discriminationTree
List<E> stateInfos
CompactMealy<I,O> hypothesis
MultiDTree<I,O,D> discriminationTree
List<E> stateInfos
GenericObservationTable<I,D> observationTable
IncomingList<I,D> incoming
AbstractTTTHypothesis<I,D,T> hypothesis
BaseTTTDiscriminationTree<I,D> discriminationTree
int id
ResizingArrayStorage<T> 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
IncrementalDFABuilder<I> builder
IncrementalMealyBuilder<I,O> builder
CompactMealy<I,O> cache
BoundedDeque.EvictPolicy evictPolicy
BoundedDeque.AccessPolicy accessPolicy
int capacity
Deque<E> deque
Copyright © 2020. All rights reserved.