Modifier and Type | Method and Description |
---|---|
default Word<O> |
TransitionOutputAutomaton.computeStateOutput(S state,
Iterable<? extends I> input) |
Modifier and Type | Method and Description |
---|---|
Word<I> |
IncrementalConstruction.findSeparatingWord(A target,
Collection<? extends I> inputs,
boolean omitUndefined)
Checks the current state of the construction against a given target model, and returns a word exposing a
difference if there is one.
|
Modifier and Type | Method and Description |
---|---|
boolean |
IncrementalConstruction.hasDefinitiveInformation(Word<? extends I> word)
Checks whether this class has definitive information about a given word.
|
Modifier and Type | Method and Description |
---|---|
boolean |
AbstractIncrementalDFABuilder.hasDefinitiveInformation(Word<? extends I> word) |
void |
IncrementalDFABuilder.insert(Word<? extends I> word)
Inserts a new word into the automaton.
|
void |
AbstractIncrementalDFABuilder.insert(Word<? extends I> word) |
void |
IncrementalDFABuilder.insert(Word<? extends I> word,
boolean accepting)
Inserts a new word into the automaton, with a given acceptance value.
|
Acceptance |
IncrementalDFABuilder.lookup(Word<? extends I> inputWord)
Looks up the tri-state acceptance value for a given word.
|
Modifier and Type | Method and Description |
---|---|
Word<I> |
AbstractIncrementalDFADAGBuilder.findSeparatingWord(DFA<?,I> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
Modifier and Type | Method and Description |
---|---|
protected abstract net.automatalib.incremental.dfa.dag.State |
AbstractIncrementalDFADAGBuilder.getState(Word<? extends I> word) |
protected net.automatalib.incremental.dfa.dag.State |
IncrementalDFADAGBuilder.getState(Word<? extends I> word)
Retrieves the state reached by a given word.
|
protected net.automatalib.incremental.dfa.dag.State |
IncrementalPCDFADAGBuilder.getState(Word<? extends I> word) |
void |
IncrementalDFADAGBuilder.insert(Word<? extends I> word,
boolean accepting)
Inserts a word into either the set of accepted or rejected words.
|
void |
IncrementalPCDFADAGBuilder.insert(Word<? extends I> word,
boolean accepting) |
Acceptance |
IncrementalDFADAGBuilder.lookup(Word<? extends I> word)
Checks the ternary acceptance status for a given word.
|
Acceptance |
IncrementalPCDFADAGBuilder.lookup(Word<? extends I> word) |
Modifier and Type | Method and Description |
---|---|
protected <S> Word<I> |
IncrementalDFATreeBuilder.doFindSeparatingWord(DFA<S,I> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
protected <S> Word<I> |
IncrementalPCDFATreeBuilder.doFindSeparatingWord(DFA<S,I> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
Word<I> |
IncrementalDFATreeBuilder.findSeparatingWord(DFA<?,I> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
Modifier and Type | Method and Description |
---|---|
void |
IncrementalDFATreeBuilder.insert(Word<? extends I> word,
boolean acceptance) |
void |
IncrementalPCDFATreeBuilder.insert(Word<? extends I> word,
boolean acceptance) |
Acceptance |
IncrementalDFATreeBuilder.lookup(Word<? extends I> inputWord) |
Acceptance |
IncrementalPCDFATreeBuilder.lookup(Word<? extends I> inputWord) |
Modifier and Type | Method and Description |
---|---|
Word<O> |
IncrementalMealyBuilder.lookup(Word<? extends I> inputWord) |
Word<O> |
AbstractIncrementalMealyBuilder.lookup(Word<? extends I> inputWord) |
Modifier and Type | Method and Description |
---|---|
boolean |
AbstractIncrementalMealyBuilder.hasDefinitiveInformation(Word<? extends I> word) |
void |
IncrementalMealyBuilder.insert(Word<? extends I> inputWord,
Word<? extends O> outputWord)
Incorporates a pair of input/output words into the stored information.
|
void |
IncrementalMealyBuilder.insert(Word<? extends I> inputWord,
Word<? extends O> outputWord)
Incorporates a pair of input/output words into the stored information.
|
Word<O> |
IncrementalMealyBuilder.lookup(Word<? extends I> inputWord) |
Word<O> |
AbstractIncrementalMealyBuilder.lookup(Word<? extends I> inputWord) |
boolean |
IncrementalMealyBuilder.lookup(Word<? extends I> inputWord,
List<? super O> output)
Retrieves the output word for the given input word.
|
Modifier and Type | Method and Description |
---|---|
Word<I> |
IncrementalMealyDAGBuilder.findSeparatingWord(MealyMachine<?,I,?,O> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
Modifier and Type | Method and Description |
---|---|
boolean |
IncrementalMealyDAGBuilder.hasDefinitiveInformation(Word<? extends I> word) |
void |
IncrementalMealyDAGBuilder.insert(Word<? extends I> word,
Word<? extends O> outputWord) |
void |
IncrementalMealyDAGBuilder.insert(Word<? extends I> word,
Word<? extends O> outputWord) |
boolean |
IncrementalMealyDAGBuilder.isComplete(Word<? extends I> word)
Deprecated.
since 2014-01-22. Use
IncrementalMealyDAGBuilder.hasDefinitiveInformation(Word) |
boolean |
IncrementalMealyDAGBuilder.lookup(Word<? extends I> word,
List<? super O> output) |
Modifier and Type | Method and Description |
---|---|
Word<I> |
IncrementalMealyTreeBuilder.findSeparatingWord(MealyMachine<?,I,?,O> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
Modifier and Type | Method and Description |
---|---|
boolean |
IncrementalMealyTreeBuilder.hasDefinitiveInformation(Word<? extends I> word) |
void |
IncrementalMealyTreeBuilder.insert(Word<? extends I> input,
Word<? extends O> outputWord) |
void |
IncrementalMealyTreeBuilder.insert(Word<? extends I> input,
Word<? extends O> outputWord) |
boolean |
IncrementalMealyTreeBuilder.lookup(Word<? extends I> word,
List<? super O> output) |
Modifier and Type | Method and Description |
---|---|
static <I> Word<I> |
Automata.findSeparatingWord(OneSEVPA<?,I> sevpa1,
OneSEVPA<?,I> sevpa2,
VPDAlphabet<I> inputs) |
static <I> Word<I> |
Automata.findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> reference,
UniversalDeterministicAutomaton<?,I,?,?,?> other,
Collection<? extends I> inputs)
Finds a separating word for two automata.
|
static <S,I> Word<I> |
Automata.findSeparatingWord(UniversalDeterministicAutomaton<S,I,?,?,?> automaton,
S state1,
S state2,
Collection<? extends I> inputs)
Finds a separating word for two states in an automaton.
|
static <I> Word<I> |
Automata.findShortestSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> reference,
UniversalDeterministicAutomaton<?,I,?,?,?> other,
Collection<? extends I> inputs) |
Modifier and Type | Method and Description |
---|---|
static <I> List<Word<I>> |
Automata.characterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton,
Collection<? extends I> inputs)
Computes a characterizing set, and returns it as a
List . |
static <S,I> List<Word<I>> |
Automata.stateCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton,
Collection<? extends I> inputs,
S state)
Computes a characterizing set for a single state, and returns it as a
List . |
static <I> List<Word<I>> |
Automata.stateCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs)
Convenient method for computing a state cover.
|
static <I> List<Word<I>> |
Automata.structuralCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs)
Convenient method for computing a structural cover.
|
static <I> List<Word<I>> |
Automata.transitionCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs)
Convenient method for computing a state cover.
|
Modifier and Type | Method and Description |
---|---|
static <I> void |
Automata.characterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> result)
Computes a characterizing set for the given automaton.
|
static <I> boolean |
Automata.incrementalCharacterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldSuffixes,
Collection<? super Word<I>> newSuffixes) |
static <I> boolean |
Automata.incrementalCharacterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldSuffixes,
Collection<? super Word<I>> newSuffixes) |
static <S,I> void |
Automata.stateCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton,
Collection<? extends I> inputs,
S state,
Collection<? super Word<I>> result)
Computes a characterizing set for a single state.
|
Modifier and Type | Method and Description |
---|---|
static <S,I,O> Pair<Word<I>,Word<O>> |
ADSUtil.buildTraceForNode(ADSNode<S,I,O> node) |
static <S,I,O> Pair<Word<I>,Word<O>> |
ADSUtil.buildTraceForNode(ADSNode<S,I,O> node) |
Modifier and Type | Method and Description |
---|---|
static <S,I,O> Pair<ADSNode<S,I,O>,ADSNode<S,I,O>> |
ADSUtil.buildFromTrace(MealyMachine<S,I,?,O> automaton,
Word<I> trace,
S state) |
Modifier and Type | Method and Description |
---|---|
protected Word<I> |
WMethodTestsIterator.combine(List<I> middle,
Word<I> prefix,
Word<I> suffix) |
Word<I> |
IncrementalWMethodTestsIterator.next() |
Modifier and Type | Method and Description |
---|---|
protected Iterator<Word<I>> |
WMethodTestsIterator.l2Iterator(List<I> l1Object) |
protected Iterator<Word<I>> |
WMethodTestsIterator.l3Iterator(List<I> l1Object,
Word<I> l2Object) |
Modifier and Type | Method and Description |
---|---|
protected Word<I> |
WMethodTestsIterator.combine(List<I> middle,
Word<I> prefix,
Word<I> suffix) |
protected Word<I> |
WMethodTestsIterator.combine(List<I> middle,
Word<I> prefix,
Word<I> suffix) |
protected Iterator<Word<I>> |
WMethodTestsIterator.l3Iterator(List<I> l1Object,
Word<I> l2Object) |
Modifier and Type | Method and Description |
---|---|
static <I> Iterator<Word<I>> |
Covers.incrementalStateCoverIterator(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> stateCover)
Returns an iterator for the remaining sequences of a state cover.
|
static <I> Iterator<Word<I>> |
Covers.incrementalTransitionCoverIterator(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> transitionCover)
Returns an iterator for the remaining sequences of a transition cover.
|
static <I> Iterator<Word<I>> |
Covers.stateCoverIterator(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs)
Returns an iterator for the sequences of a state cover.
|
static <I> Iterator<Word<I>> |
Covers.transitionCoverIterator(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs)
Returns an iterator for the sequences of a transition cover.
|
Modifier and Type | Method and Description |
---|---|
static <I> void |
Covers.cover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> states,
Collection<? super Word<I>> transitions)
Utility method that allows to compute a state and transition cover simultaneously.
|
static <I> void |
Covers.cover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> states,
Collection<? super Word<I>> transitions)
Utility method that allows to compute a state and transition cover simultaneously.
|
static <I> boolean |
Covers.incrementalCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldStateCover,
Collection<? extends Word<I>> oldTransCover,
Collection<? super Word<I>> newStateCover,
Collection<? super Word<I>> newTransCover)
Utility method that allows to compute an incremental state and transition cover simultaneously.
|
static <I> boolean |
Covers.incrementalCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldStateCover,
Collection<? extends Word<I>> oldTransCover,
Collection<? super Word<I>> newStateCover,
Collection<? super Word<I>> newTransCover)
Utility method that allows to compute an incremental state and transition cover simultaneously.
|
static <I> boolean |
Covers.incrementalCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldStateCover,
Collection<? extends Word<I>> oldTransCover,
Collection<? super Word<I>> newStateCover,
Collection<? super Word<I>> newTransCover)
Utility method that allows to compute an incremental state and transition cover simultaneously.
|
static <I> boolean |
Covers.incrementalCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldStateCover,
Collection<? extends Word<I>> oldTransCover,
Collection<? super Word<I>> newStateCover,
Collection<? super Word<I>> newTransCover)
Utility method that allows to compute an incremental state and transition cover simultaneously.
|
static <S,I> boolean |
Covers.incrementalStateCover(DeterministicAutomaton<S,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldStates,
Collection<? super Word<I>> newStates)
Computes an incremental state cover for a given automaton, i.e. a cover that only contains the missing sequences
for obtaining a complete state cover.
|
static <S,I> boolean |
Covers.incrementalStateCover(DeterministicAutomaton<S,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldStates,
Collection<? super Word<I>> newStates)
Computes an incremental state cover for a given automaton, i.e. a cover that only contains the missing sequences
for obtaining a complete state cover.
|
static <I> Iterator<Word<I>> |
Covers.incrementalStateCoverIterator(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> stateCover)
Returns an iterator for the remaining sequences of a state cover.
|
static <I> boolean |
Covers.incrementalStructuralCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldCover,
Collection<? super Word<I>> newCover)
Computes an incremental structural cover for a given automaton, i.e. a cover that only contains the missing
sequences for obtaining a complete structural cover.
|
static <I> boolean |
Covers.incrementalStructuralCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldCover,
Collection<? super Word<I>> newCover)
Computes an incremental structural cover for a given automaton, i.e. a cover that only contains the missing
sequences for obtaining a complete structural cover.
|
static <I> boolean |
Covers.incrementalTransitionCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldTransCover,
Collection<? super Word<I>> newTransCover)
Computes an incremental transition cover for a given automaton, i.e. a cover that only contains the missing
sequences for obtaining a complete transition cover.
|
static <I> boolean |
Covers.incrementalTransitionCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldTransCover,
Collection<? super Word<I>> newTransCover)
Computes an incremental transition cover for a given automaton, i.e. a cover that only contains the missing
sequences for obtaining a complete transition cover.
|
static <I> Iterator<Word<I>> |
Covers.incrementalTransitionCoverIterator(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> transitionCover)
Returns an iterator for the remaining sequences of a transition cover.
|
static <I> void |
Covers.stateCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> states)
Computes a state cover for a given automaton.
|
static <I> void |
Covers.structuralCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> cover)
Computes a structural cover for a given automaton.
|
static <I> void |
Covers.transitionCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> transitions)
Computes a transition cover for a given automaton.
|
Modifier and Type | Method and Description |
---|---|
Word<I> |
DeterministicEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> other,
Collection<? extends I> inputs) |
Word<I> |
NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> other,
Collection<? extends I> inputs) |
static <S,I,T> Word<I> |
NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
S init1,
S init2,
Collection<? extends I> inputs) |
static <S,I,T> Word<I> |
NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
S init1,
S init2,
Collection<? extends I> inputs,
boolean ignoreUndefinedTransitions)
Find a separating word for two states in a given automaton.
|
static <S,S2,I,T,T2> |
NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Alphabet<I> inputs) |
static <I,S,T,S2,T2> |
DeterministicEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> reference,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Collection<? extends I> inputs) |
static <S,S2,I,T,T2> |
NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Collection<? extends I> inputs) |
static <I,S,T,S2,T2> |
DeterministicEquivalenceTest.findSeparatingWordLarge(UniversalDeterministicAutomaton<S,I,T,?,?> reference,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Collection<? extends I> inputs) |
Modifier and Type | Method and Description |
---|---|
static <S,I,T> Iterator<Word<I>> |
CharacterizingSets.characterizingSetIterator(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs) |
static <S,I,T> Iterator<Word<I>> |
CharacterizingSets.incrementalCharacterizingSetIterator(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldSuffixes) |
Modifier and Type | Method and Description |
---|---|
static <S,I,T> void |
CharacterizingSets.findCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> result)
Computes a characterizing set for the given automaton.
|
static <S,I,T> void |
CharacterizingSets.findCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
S state,
Collection<? super Word<I>> result)
Computes a characterizing set for a specified state in the given automaton.
|
static <S,I,T> boolean |
CharacterizingSets.findIncrementalCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldSuffixes,
Collection<? super Word<I>> newSuffixes) |
static <S,I,T> boolean |
CharacterizingSets.findIncrementalCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldSuffixes,
Collection<? super Word<I>> newSuffixes) |
static <S,I,T> Iterator<Word<I>> |
CharacterizingSets.incrementalCharacterizingSetIterator(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldSuffixes) |
Modifier and Type | Field and Description |
---|---|
RichArray<Word<I>> |
OneSEVPAUtil.ReachResult.accessSequences |
Modifier and Type | Method and Description |
---|---|
static <L,I> Word<I> |
OneSEVPAUtil.computeAccessSequence(OneSEVPA<L,I> sevpa,
VPDAlphabet<I> alphabet,
Predicate<? super L> predicate) |
static <L,I> Word<I> |
OneSEVPAUtil.findAcceptedWord(OneSEVPA<L,I> sevpa,
VPDAlphabet<I> alphabet) |
static <L,I> Word<I> |
OneSEVPAUtil.findRejectedWord(OneSEVPA<L,I> sevpa,
VPDAlphabet<I> alphabet) |
static <I> Word<I> |
OneSEVPAUtil.findSeparatingWord(OneSEVPA<?,I> sevpa1,
OneSEVPA<?,I> sevpa2,
VPDAlphabet<I> alphabet) |
Modifier and Type | Method and Description |
---|---|
static <L,I> RichArray<Word<I>> |
OneSEVPAUtil.computeAccessSequences(OneSEVPA<L,I> sevpa,
VPDAlphabet<I> alphabet) |
Constructor and Description |
---|
ReachResult(L terminateLoc,
List<L> reachableLocs,
RichArray<Word<I>> accessSequences) |
Modifier and Type | Class and Description |
---|---|
class |
SuffixTrieNode<I>
A node in a
SuffixTrie . |
Modifier and Type | Method and Description |
---|---|
Word<I> |
SuffixTrieNode.getSuffix() |
static <I> Word<I> |
SuffixTrieNode.toExplicitWord(SuffixTrieNode<I> node) |
Modifier and Type | Method and Description |
---|---|
Word<I> |
Word.append(I symbol)
Appends a symbol to this word and returns the result as a new word.
|
Word<I> |
Word.canonicalNext(Alphabet<I> sigma)
Retrieves the next word after this in canonical order.
|
Word<I> |
Word.concat(Word<? extends I>... words)
Concatenates this word with several other words and returns the result as a new word.
|
protected Word<I> |
Word.concatInternal(Word<? extends I>... words)
Realizes the concatenation of this word with several other words.
|
static <I> Word<I> |
Word.epsilon()
Retrieves the empty word.
|
Word<I> |
Word.flatten()
Retrieves a "flattened" version of this word, i.e., without any hierarchical structure attached.
|
static <I> Word<I> |
Word.fromArray(I[] symbols,
int offset,
int length)
Creates a word from a subrange of an array of symbols.
|
static Word<Character> |
Word.fromCharSequence(CharSequence cs) |
static <I> Word<I> |
Word.fromLetter(I letter)
Constructs a word from a single letter.
|
static <I> Word<I> |
Word.fromList(List<? extends I> symbolList)
Creates a word from a list of symbols.
|
static Word<Character> |
Word.fromString(String str) |
static <I> Word<I> |
Word.fromSymbols(I... symbols)
Creates a word from an array of symbols.
|
static <I> Word<I> |
Word.fromWords(Collection<? extends Word<? extends I>> words) |
static <I> Word<I> |
Word.fromWords(Word<? extends I>... words) |
Word<I> |
Word.longestCommonPrefix(Word<?> other)
Determines the longest common prefix of this word and another word.
|
Word<I> |
Word.longestCommonSuffix(Word<?> other)
Determines the longest common suffix of this word and another word.
|
default Word<I> |
VPDAlphabet.longestWellMatchedPrefix(Word<I> word) |
default Word<I> |
VPDAlphabet.longestWellMatchedSuffix(Word<I> word) |
Word<I> |
Word.prefix(int prefixLen)
Retrieves a prefix of the given length.
|
Word<I> |
Word.prepend(I symbol)
Prepends a symbol to this word and returns the result as a new word.
|
Word<I> |
Word.subWord(int fromIndex)
Retrieves the subword of this word starting at the given index and extending until the end of this word.
|
Word<I> |
Word.subWord(int fromIndex,
int toIndex)
Retrieves a word representing the specified subrange of this word.
|
protected Word<I> |
Word.subWordInternal(int fromIndex,
int toIndex)
Internal subword operation implementation.
|
Word<I> |
Word.suffix(int suffixLen)
Retrieves a suffix of the given length.
|
Word<I> |
WordBuilder.toWord()
Creates a word from the contents of the internal storage.
|
Word<I> |
WordBuilder.toWord(int fromIndex,
int toIndex)
Creates a word from the given range of the contents of the internal storage.
|
<T> Word<T> |
Word.transform(Function<? super I,? extends T> transformer)
Transforms a word symbol-by-symbol, using the specified transformation function.
|
Word<I> |
Word.trimmed() |
static <I> Word<I> |
Word.upcast(Word<? extends I> word)
Performs an upcast of the generic type parameter of the word.
|
Modifier and Type | Method and Description |
---|---|
static <I> Comparator<Word<? extends I>> |
Word.canonicalComparator(Comparator<? super I> symComparator) |
List<Word<I>> |
Word.prefixes(boolean longestFirst)
Retrieves the list of all prefixes of this word.
|
List<Word<I>> |
Word.suffixes(boolean longestFirst)
Retrieves the list of all suffixes of this word.
|
Modifier and Type | Method and Description |
---|---|
WordBuilder<I> |
WordBuilder.append(Word<? extends I>... words)
Appends several words to the contents of the internal storage.
|
WordBuilder<I> |
WordBuilder.append(Word<? extends I> word)
Appends a word to the contents of the internal storage.
|
default int |
VPDAlphabet.callReturnBalance(Word<I> word) |
Word<I> |
Word.concat(Word<? extends I>... words)
Concatenates this word with several other words and returns the result as a new word.
|
protected Word<I> |
Word.concatInternal(Word<? extends I>... words)
Realizes the concatenation of this word with several other words.
|
static <I> Word<I> |
Word.fromWords(Word<? extends I>... words) |
default boolean |
VPDAlphabet.isCallMatched(Word<I> word) |
boolean |
Word.isPrefixOf(Word<?> other)
Checks if this word is a prefix of another word.
|
default boolean |
VPDAlphabet.isReturnMatched(Word<I> word) |
boolean |
Word.isSuffixOf(Word<?> other)
Checks if this word is a suffix of another word.
|
default boolean |
VPDAlphabet.isWellMatched(Word<I> word) |
Word<I> |
Word.longestCommonPrefix(Word<?> other)
Determines the longest common prefix of this word and another word.
|
Word<I> |
Word.longestCommonSuffix(Word<?> other)
Determines the longest common suffix of this word and another word.
|
default Word<I> |
VPDAlphabet.longestWellMatchedPrefix(Word<I> word) |
default Word<I> |
VPDAlphabet.longestWellMatchedSuffix(Word<I> word) |
WordBuilder<I> |
WordBuilder.repeatAppend(int num,
Word<I> word)
Appends num copies of the given word to the contents of the initial storage.
|
static <I> Word<I> |
Word.upcast(Word<? extends I> word)
Performs an upcast of the generic type parameter of the word.
|
Modifier and Type | Method and Description |
---|---|
static <I> Word<I> |
Word.fromWords(Collection<? extends Word<? extends I>> words) |
Constructor and Description |
---|
WordBuilder(int capacity,
Word<I> init)
Constructor.
|
WordBuilder(Word<I> init)
Constructor.
|
Modifier and Type | Class and Description |
---|---|
class |
ExtensionWord<I> |
Modifier and Type | Method and Description |
---|---|
Word<I> |
ExtensionWord.prepend(I symbol) |
protected Word<I> |
ExtensionWord.subWordInternal(int fromIndex,
int toIndex) |
Modifier and Type | Method and Description |
---|---|
boolean |
ExtensionWord.isPrefixOf(Word<?> other) |
Constructor and Description |
---|
ExtensionWord(Word<I> word,
I letter) |
Copyright © 2018. All rights reserved.