Modifier and Type | Method and Description |
---|---|
A |
AutomatonCreator.createAutomaton(Alphabet<I> alphabet) |
default A |
AutomatonCreator.createAutomaton(Alphabet<I> alphabet,
int numStatesHint) |
default DeterministicAutomaton.FullIntAbstraction<T> |
DeterministicAutomaton.fullIntAbstraction(Alphabet<I> alphabet) |
default UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP> |
UniversalDeterministicAutomaton.fullIntAbstraction(Alphabet<I> alphabet) |
default MutableDeterministic.FullIntAbstraction<T,SP,TP> |
MutableDeterministic.fullIntAbstraction(Alphabet<I> alphabet) |
Modifier and Type | Method and Description |
---|---|
Alphabet<I> |
AbstractCompact.getInputAlphabet() |
Modifier and Type | Method and Description |
---|---|
MutableDeterministic.FullIntAbstraction<T,SP,TP> |
AbstractCompactDeterministic.fullIntAbstraction(Alphabet<I> alphabet) |
Constructor and Description |
---|
AbstractCompact(Alphabet<I> alphabet,
AbstractCompact<?,?,?,?> other) |
AbstractCompact(Alphabet<I> alphabet,
int stateCapacity,
float resizeFactor) |
AbstractCompactDeterministic(Alphabet<I> alphabet,
AbstractCompactDeterministic<?,?,?,?> other) |
AbstractCompactDeterministic(Alphabet<I> alphabet,
int stateCapacity,
float resizeFactor) |
AbstractCompactSimpleDeterministic(Alphabet<I> alphabet,
AbstractCompactSimpleDeterministic<?,?> other) |
AbstractCompactSimpleDeterministic(Alphabet<I> alphabet,
int stateCapacity,
float resizeFactor) |
AbstractCompactSimpleNondet(Alphabet<I> alphabet,
AbstractCompactSimpleNondet<?,?> other) |
AbstractCompactSimpleNondet(Alphabet<I> alphabet,
int stateCapacity,
float resizeFactor) |
UniversalCompactSimpleDet(Alphabet<I> alphabet) |
UniversalCompactSimpleDet(Alphabet<I> alphabet,
int stateCapacity,
float resizeFactor) |
Modifier and Type | Field and Description |
---|---|
protected Alphabet<I> |
AbstractFastMutable.inputAlphabet |
Modifier and Type | Method and Description |
---|---|
Alphabet<I> |
AbstractFastMutable.getInputAlphabet() |
Constructor and Description |
---|
AbstractFastMutable(Alphabet<I> inputAlphabet) |
AbstractFastMutableDet(Alphabet<I> inputAlphabet) |
AbstractFastMutableNondet(Alphabet<I> inputAlphabet) |
Modifier and Type | Method and Description |
---|---|
Alphabet<I> |
InputAlphabetHolder.getInputAlphabet() |
Constructor and Description |
---|
FastDFA(Alphabet<I> alphabet) |
FastNFA(Alphabet<I> inputAlphabet) |
Modifier and Type | Method and Description |
---|---|
CompactNFA<I> |
CompactNFA.Creator.createAutomaton(Alphabet<I> alphabet) |
CompactDFA<I> |
CompactDFA.Creator.createAutomaton(Alphabet<I> alphabet) |
CompactNFA<I> |
CompactNFA.Creator.createAutomaton(Alphabet<I> alphabet,
int numStates) |
CompactDFA<I> |
CompactDFA.Creator.createAutomaton(Alphabet<I> alphabet,
int numStates) |
<I2> CompactNFA<I2> |
CompactNFA.translate(Alphabet<I2> newAlphabet) |
<I2> CompactDFA<I2> |
CompactDFA.translate(Alphabet<I2> newAlphabet) |
Constructor and Description |
---|
CompactDFA(Alphabet<I> alphabet) |
CompactDFA(Alphabet<I> alphabet,
CompactDFA<?> other) |
CompactDFA(Alphabet<I> alphabet,
float resizeFactor) |
CompactDFA(Alphabet<I> alphabet,
int stateCapacity) |
CompactDFA(Alphabet<I> alphabet,
int stateCapacity,
float resizeFactor) |
CompactNFA(Alphabet<I> alphabet) |
CompactNFA(Alphabet<I> alphabet,
CompactNFA<?> other) |
CompactNFA(Alphabet<I> alphabet,
int stateCapacity) |
Modifier and Type | Method and Description |
---|---|
default SimpleDeterministicAutomaton.FullIntAbstraction |
SimpleDeterministicAutomaton.fullIntAbstraction(Alphabet<I> alphabet)
Retrieves a
SimpleDeterministicAutomaton.FullIntAbstraction of this automaton, using the mapping induced by the given alphabet as the
abstraction for the input symbols. |
Constructor and Description |
---|
FastMealy(Alphabet<I> alphabet)
Constructor.
|
FastMoore(Alphabet<I> alphabet) |
FastProbMealy(Alphabet<I> inputAlphabet) |
Modifier and Type | Method and Description |
---|---|
CompactMealy<I,O> |
CompactMealy.Creator.createAutomaton(Alphabet<I> alphabet) |
CompactMealy<I,O> |
CompactMealy.Creator.createAutomaton(Alphabet<I> alphabet,
int sizeHint) |
Constructor and Description |
---|
CompactMealy(Alphabet<I> alphabet) |
CompactMealy(Alphabet<I> alphabet,
int stateCapacity) |
CompactMealy(Alphabet<I> alphabet,
int stateCapacity,
float resizeFactor) |
CompactMoore(Alphabet<I> alphabet) |
CompactMoore(Alphabet<I> alphabet,
int stateCapacity,
float resizeFactor) |
Constructor and Description |
---|
GrowingAlphabetNotSupportedException(Alphabet<I> alphabet) |
Modifier and Type | Field and Description |
---|---|
protected Alphabet<I> |
AbstractIncrementalDFABuilder.inputAlphabet |
Modifier and Type | Method and Description |
---|---|
Alphabet<I> |
AbstractIncrementalDFABuilder.getInputAlphabet() |
Constructor and Description |
---|
AbstractIncrementalDFABuilder(Alphabet<I> inputAlphabet)
Constructor.
|
Constructor and Description |
---|
AbstractIncrementalDFADAGBuilder(Alphabet<I> inputAlphabet) |
IncrementalDFADAGBuilder(Alphabet<I> inputAlphabet)
Constructor.
|
IncrementalPCDFADAGBuilder(Alphabet<I> inputAlphabet) |
Constructor and Description |
---|
IncrementalDFATreeBuilder(Alphabet<I> inputAlphabet) |
IncrementalPCDFATreeBuilder(Alphabet<I> alphabet) |
Modifier and Type | Method and Description |
---|---|
Alphabet<I> |
IncrementalMealyDAGBuilder.getInputAlphabet() |
Constructor and Description |
---|
IncrementalMealyDAGBuilder(Alphabet<I> inputAlphabet)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
Alphabet<I> |
IncrementalMealyTreeBuilder.getInputAlphabet() |
Constructor and Description |
---|
IncrementalMealyTreeBuilder(Alphabet<I> inputAlphabet) |
Modifier and Type | Method and Description |
---|---|
Alphabet<I> |
AbstractLasso.getInputAlphabet()
Gets the input alphabet of this automaton.
|
Modifier and Type | Field and Description |
---|---|
Alphabet<I> |
InputModelData.alphabet |
Modifier and Type | Method and Description |
---|---|
default void |
InputModelSerializer.writeModel(File f,
M model,
Alphabet<I> alphabet) |
void |
InputModelSerializer.writeModel(OutputStream os,
M model,
Alphabet<I> alphabet) |
Constructor and Description |
---|
InputModelData(M model,
Alphabet<I> alphabet) |
Modifier and Type | Method and Description |
---|---|
static <S,I> void |
AUTWriter.writeAutomaton(SimpleAutomaton<S,I> automaton,
Alphabet<I> alphabet,
Function<I,String> inputTransformer,
OutputStream os) |
static <S,I> void |
AUTWriter.writeAutomaton(SimpleAutomaton<S,I> automaton,
Alphabet<I> alphabet,
OutputStream os) |
<I2> void |
AUTSerializationProvider.writeModel(OutputStream os,
SimpleAutomaton<?,I2> model,
Alphabet<I2> alphabet,
Function<I2,String> inputTransformer) |
Modifier and Type | Method and Description |
---|---|
default void |
SimpleAutomatonSerializer.writeModel(OutputStream os,
SimpleAutomaton<?,I> model,
Alphabet<I> alphabet) |
<I2> void |
SimpleAutomatonSerializer.writeModel(OutputStream os,
SimpleAutomaton<?,I2> model,
Alphabet<I2> alphabet,
Function<I2,I> inputTransformer) |
Modifier and Type | Method and Description |
---|---|
protected void |
AbstractETFWriter.write(PrintWriter printWriter,
A a,
Alphabet<I> inputs)
Write the full ETF.
|
protected abstract void |
AbstractETFWriter.writeETF(PrintWriter printWriter,
A a,
Alphabet<I> inputs)
Write parts of the ETF that are dependent on A.
|
protected void |
DFA2ETFWriter.writeETF(PrintWriter pw,
DFA<?,I> dfa,
Alphabet<I> inputs)
Write DFA specific parts in the ETF
|
protected void |
Mealy2ETFWriterIO.writeETF(PrintWriter pw,
MealyMachine<?,I,?,O> mealy,
Alphabet<I> inputs)
Write ETF parts specific for Mealy machines with IO semantics.
|
protected void |
Mealy2ETFWriterAlternating.writeETF(PrintWriter pw,
MealyMachine<?,I,?,O> mealy,
Alphabet<I> inputs)
Write the specific parts of the ETF for Mealy machines with alternating edge semantics.
|
void |
DFA2ETFWriter.writeModel(OutputStream os,
DFA<?,I> model,
Alphabet<I> alphabet) |
void |
Mealy2ETFWriterIO.writeModel(OutputStream os,
MealyMachine<?,I,?,O> model,
Alphabet<I> alphabet) |
void |
Mealy2ETFWriterAlternating.writeModel(OutputStream os,
MealyMachine<?,I,?,O> model,
Alphabet<I> alphabet) |
Modifier and Type | Method and Description |
---|---|
<I> void |
LearnLibV2Serialization.writeGenericModel(OutputStream os,
DFA<?,I> model,
Alphabet<I> alphabet) |
void |
LearnLibV2Serialization.writeModel(OutputStream os,
DFA<?,Integer> model,
Alphabet<Integer> alphabet) |
Modifier and Type | Method and Description |
---|---|
<I,SP,TP> void |
SAFOutput.writeAutomaton(UniversalAutomaton<?,I,?,SP,TP> source,
Alphabet<I> alphabet,
net.automatalib.serialization.saf.AutomatonType expectedType,
BlockPropertyEncoder<? super SP> spEncoder,
SinglePropertyEncoder<? super TP> tpEncoder) |
<I> void |
SAFOutput.writeDFA(DFA<?,I> automaton,
Alphabet<I> alphabet) |
void |
SAFSerializationDFA.writeModel(OutputStream os,
DFA<?,Integer> model,
Alphabet<Integer> alphabet) |
void |
SAFSerializationNFA.writeModel(OutputStream os,
NFA<?,Integer> model,
Alphabet<Integer> alphabet) |
<I> void |
SAFOutput.writeNFA(NFA<?,I> automaton,
Alphabet<I> alphabet) |
Modifier and Type | Method and Description |
---|---|
void |
TAFSerializationDFA.writeModel(OutputStream os,
DFA<?,String> model,
Alphabet<String> alphabet) |
void |
TAFSerializationMealy.writeModel(OutputStream os,
MealyMachine<?,String,?,?> model,
Alphabet<String> alphabet) |
Modifier and Type | Method and Description |
---|---|
static <S,I,O> LYResult<S,I,O> |
LeeYannakakis.compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input)
Computes an ADS using the algorithm of Lee and Yannakakis.
|
static <S,I,O> Optional<ADSNode<S,I,O>> |
StateEquivalence.compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states)
Computes a two-state ADS by using
Automata.findSeparatingWord(UniversalDeterministicAutomaton,
UniversalDeterministicAutomaton, Collection) . |
static <S,I,O> Optional<ADSNode<S,I,O>> |
ADS.compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states)
Compute an adaptive distinguishing sequence for the given automaton and the given set of states.
|
static <S,I,O> Optional<ADSNode<S,I,O>> |
BacktrackingSearch.compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states)
Computes an ADS by constructing (growing) splitting words for the current set of states and recursively computing
sub-ADSs for the induced partitions.
|
static <S,I,O> Optional<ADSNode<S,I,O>> |
BacktrackingSearch.computeOptimal(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states,
BacktrackingSearch.CostAggregator costAggregator)
Computes an ADS by iterating over the successor tree in a breadth-first manner, yielding an optimal (dependant on
the passed optimization function) ADS.
|
Modifier and Type | Method and Description |
---|---|
static <I> DFABuilder<Integer,I,CompactDFA<I>> |
AutomatonBuilders.newDFA(Alphabet<I> alphabet) |
static <I,O> MealyBuilder<Integer,I,CompactMealyTransition<O>,O,CompactMealy<I,O>> |
AutomatonBuilders.newMealy(Alphabet<I> alphabet) |
static <I,O> MooreBuilder<Integer,I,Integer,O,CompactMoore<I,O>> |
AutomatonBuilders.newMoore(Alphabet<I> alphabet) |
Constructor and Description |
---|
IncrementalWMethodTestsIterator(Alphabet<I> alphabet) |
Modifier and Type | Method and Description |
---|---|
static <S,S2,I,T,T2> |
NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Alphabet<I> inputs) |
static <S,S2,I,T,T2> |
NearLinearEquivalenceTest.findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Alphabet<I> inputs,
boolean ignoreUndefinedTransitions) |
Modifier and Type | Method and Description |
---|---|
static <I> CompactDFA<I> |
DFAs.and(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the conjunction ("and") of two DFA, and returns the result as a new DFA.
|
static <I> CompactDFA<I> |
DFAs.combine(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet,
AcceptanceCombiner combiner)
Most general way of combining two DFAs.
|
static <I> CompactDFA<I> |
DFAs.complement(DFA<?,I> dfa,
Alphabet<I> inputAlphabet)
Calculates the complement (negation) of a DFA, and returns the result as a new DFA.
|
static <I> CompactDFA<I> |
DFAs.complete(DFA<?,I> dfa,
Alphabet<I> inputs) |
static <I> CompactDFA<I> |
NFAs.determinize(NFA<?,I> nfa,
Alphabet<I> inputAlphabet) |
static <I> CompactDFA<I> |
NFAs.determinize(NFA<?,I> nfa,
Alphabet<I> inputAlphabet,
boolean partial,
boolean minimize) |
static <I> CompactDFA<I> |
DFAs.equiv(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the equivalence ("<=>") of two DFA, and returns the result as a new DFA.
|
static <I> CompactDFA<I> |
DFAs.impl(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the implication ("=>") of two DFA, and returns the result as a new DFA.
|
static <S,I> boolean |
DFAs.isPrefixClosed(DFA<S,I> dfa,
Alphabet<I> alphabet)
Computes whether the language of the given DFA is prefix-closed.
|
static <I> CompactDFA<I> |
DFAs.minimize(DFA<?,I> dfa,
Alphabet<I> alphabet)
Minimizes the given DFA over the given alphabet.
|
static <I> CompactDFA<I> |
DFAs.or(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the disjunction ("or") of two DFA, and returns the result as a new DFA.
|
static <I> CompactDFA<I> |
DFAs.xor(DFA<?,I> dfa1,
DFA<?,I> dfa2,
Alphabet<I> inputAlphabet)
Calculates the exclusive-or ("xor") of two DFA, and returns the result as a new DFA.
|
Modifier and Type | Method and Description |
---|---|
static <I> CompactDFA<I> |
HopcroftMinimization.minimizeDFA(DFA<?,I> dfa,
Alphabet<I> alphabet)
Minimizes the given DFA.
|
static <I> CompactDFA<I> |
HopcroftMinimization.minimizeDFA(DFA<?,I> dfa,
Alphabet<I> alphabet,
HopcroftMinimization.PruningMode pruningMode)
Minimizes the given DFA.
|
static <I,O> CompactMealy<I,O> |
HopcroftMinimization.minimizeMealy(MealyMachine<?,I,?,O> mealy,
Alphabet<I> alphabet)
Minimizes the given Mealy machine.
|
static <I,O> CompactMealy<I,O> |
HopcroftMinimization.minimizeMealy(MealyMachine<?,I,?,O> mealy,
Alphabet<I> alphabet,
HopcroftMinimization.PruningMode pruningMode)
Minimizes the given Mealy machine.
|
Modifier and Type | Method and Description |
---|---|
<I,A extends MutableDeterministic<?,I,?,? super SP,? super TP>> |
RandomICAutomatonGenerator.generateICDeterministicAutomaton(int numStates,
Alphabet<I> alphabet,
AutomatonCreator<? extends A,I> creator,
Random r)
Generates an initially-connected (IC) deterministic automaton with the given parameters.
|
<I> CompactDFA<I> |
RandomAutomata.randomDFA(int numStates,
Alphabet<I> inputs) |
<I> CompactDFA<I> |
RandomAutomata.randomDFA(int numStates,
Alphabet<I> inputs,
boolean minimize) |
static <I> CompactDFA<I> |
RandomAutomata.randomDFA(Random rand,
int numStates,
Alphabet<I> inputs) |
static <I> CompactDFA<I> |
RandomAutomata.randomDFA(Random rand,
int numStates,
Alphabet<I> inputs,
boolean minimize) |
static <I> CompactDFA<I> |
RandomAutomata.randomICDFA(Random rand,
int numStates,
Alphabet<I> inputs,
boolean minimize)
Randomly generates an initially connected DFA (ICDFA), i.e., a DFA where all states are reachable from the
initial state.
|
<I,O> CompactMealy<I,O> |
RandomAutomata.randomMealy(int numStates,
Alphabet<I> inputs,
Collection<? extends O> outputs) |
<I,O> CompactMealy<I,O> |
RandomAutomata.randomMealy(int numStates,
Alphabet<I> inputs,
Collection<? extends O> outputs,
boolean minimize) |
static <I,O> CompactMealy<I,O> |
RandomAutomata.randomMealy(Random rand,
int numStates,
Alphabet<I> inputs,
Collection<? extends O> outputs) |
static <I,O> CompactMealy<I,O> |
RandomAutomata.randomMealy(Random rand,
int numStates,
Alphabet<I> inputs,
Collection<? extends O> outputs,
boolean minimize) |
Modifier and Type | Method and Description |
---|---|
static <I,O> CompactMealy<I,O> |
MealyFilter.filterByOutput(MealyMachine<?,I,?,O> in,
Alphabet<I> inputs,
Predicate<? super O> outputPred) |
static <I,O> CompactMealy<I,O> |
MealyFilter.pruneTransitionsWithOutput(MealyMachine<?,I,?,O> in,
Alphabet<I> inputs,
Collection<? super O> outputs)
Returns a Mealy machine with all transitions removed that have one of the specified output values.
|
static <I,O> CompactMealy<I,O> |
MealyFilter.pruneTransitionsWithOutput(MealyMachine<?,I,?,O> in,
Alphabet<I> inputs,
O... outputs)
Returns a Mealy machine with all transitions removed that have one of the specified output values.
|
static <I,O> CompactMealy<I,O> |
MealyFilter.retainTransitionsWithOutput(MealyMachine<?,I,?,O> in,
Alphabet<I> inputs,
Collection<? super O> outputs)
Returns a Mealy machine with all transitions removed that have an output not among the specified values.
|
static <I,O> CompactMealy<I,O> |
MealyFilter.retainTransitionsWithOutput(MealyMachine<?,I,?,O> in,
Alphabet<I> inputs,
O... outputs)
Returns a Mealy machine with all transitions removed that have an output not among the specified values.
|
Modifier and Type | Method and Description |
---|---|
static <S,I,T> StateIDs<S> |
PaigeTarjanInitializers.initDeterministic(PaigeTarjan pt,
DeterministicAutomaton<S,I,T> automaton,
Alphabet<I> inputs,
Predicate<? super S> initialClassification,
boolean sinkClassification)
Initializes the partition refinement data structure from a given deterministic automaton, initializing the
initial partition according to the given classification predicate (i.e., assuming a binary initial
partitioning).
|
static <S,I> StateIDs<S> |
PaigeTarjanInitializers.initDeterministic(PaigeTarjan pt,
SimpleDeterministicAutomaton<S,I> automaton,
Alphabet<I> inputs,
Function<? super S,?> initialClassification,
Object sinkClassification)
Initializes the partition refinement data structure from a given deterministic automaton, initializing the
initial partition according to the given classification function.
|
abstract <S,I> Function<S,Object> |
PaigeTarjanInitializers.AutomatonInitialPartitioning.initialClassifier(UniversalDeterministicAutomaton<S,I,?,?,?> automaton,
Alphabet<I> alphabet) |
static <I,T,SP,TP,A extends MutableDeterministic<?,I,?,SP,TP>> |
PaigeTarjanExtractors.toDeterministic(PaigeTarjan pt,
AutomatonCreator<A,I> creator,
Alphabet<I> inputs,
DeterministicAutomaton.FullIntAbstraction<T> absOriginal,
IntFunction<? extends SP> spExtractor,
Function<? super T,? extends TP> tpExtractor,
boolean pruneUnreachable)
Translates the results of a coarsest stable partition computation into a deterministic automaton.
|
static <S1,S2,I,T1,T2,SP,TP,A extends MutableDeterministic<S2,I,T2,SP,TP>> |
PaigeTarjanExtractors.toDeterministic(PaigeTarjan pt,
AutomatonCreator<A,I> creator,
Alphabet<I> inputs,
DeterministicAutomaton<S1,I,T1> original,
StateIDs<S1> origIds,
Function<? super S1,? extends SP> spExtractor,
Function<? super T1,? extends TP> tpExtractor,
boolean pruneUnreachable)
Translates the results of a coarsest stable partition computation into a deterministic automaton.
|
Constructor and Description |
---|
SharedSuffixTrie(Alphabet<I> alphabet) |
SharedSuffixTrie(Alphabet<I> alphabet,
boolean graphRepresentable) |
Modifier and Type | Interface and Description |
---|---|
interface |
GrowingAlphabet<I>
Alphabet class that supports adding new symbols. |
interface |
VPDAlphabet<I>
Alphabet definition for visible push-down automata.
|
Modifier and Type | Method and Description |
---|---|
Alphabet<I> |
VPDAlphabet.getCallAlphabet() |
Alphabet<I> |
VPDAlphabet.getInternalAlphabet() |
Alphabet<I> |
VPDAlphabet.getReturnAlphabet() |
Modifier and Type | Method and Description |
---|---|
Word<I> |
Word.canonicalNext(Alphabet<I> sigma)
Retrieves the next word after this in canonical order.
|
default <I2> Mapping<I2,I> |
Alphabet.translateFrom(Alphabet<I2> other) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractAlphabet<I> |
class |
AbstractVPDAlphabet<I>
Abstract utility class that implements functionality shared across different subtypes.
|
Modifier and Type | Method and Description |
---|---|
Alphabet<I> |
AbstractVPDAlphabet.getCallAlphabet() |
Alphabet<I> |
AbstractVPDAlphabet.getInternalAlphabet() |
Alphabet<I> |
AbstractVPDAlphabet.getReturnAlphabet() |
Modifier and Type | Class and Description |
---|---|
class |
ArrayAlphabet<I> |
class |
DefaultVPDAlphabet<I>
A list-based, fixed size implementation of a
VPDAlphabet . |
class |
EnumAlphabet<E extends Enum<E>> |
class |
FastAlphabet<I extends MutableNumericID>
A fast alphabet implementation, that assumes identifiers are stored directly in the input symbols.
|
class |
GrowingVPDAlphabet<I>
A
VPDAlphabet implementation that allows to add new symbols after its construction. |
class |
ListAlphabet<I> |
class |
SimpleAlphabet<I>
A simple alphabet implementation, that does not impose any restriction on the input symbol class.
|
Modifier and Type | Method and Description |
---|---|
static Alphabet<Character> |
Alphabets.characters(char startInclusive,
char endInclusive) |
static Alphabet<String> |
Alphabets.closedCharStringRange(char startInclusive,
char endInclusive) |
static <T> Alphabet<T> |
Alphabets.fromArray(T... symbols) |
static <I> Alphabet<I> |
Alphabets.fromCollection(Collection<? extends I> coll) |
static <E extends Enum<E>> |
Alphabets.fromEnum(Class<E> enumClazz) |
static <E extends Enum<E>> |
Alphabets.fromEnum(Class<E> enumClazz,
boolean withNull) |
static <T> Alphabet<T> |
Alphabets.fromList(List<? extends T> list) |
static Alphabet<Integer> |
Alphabets.integers(int startInclusive,
int endInclusive) |
static <T> Alphabet<T> |
Alphabets.singleton(T symbol) |
Modifier and Type | Method and Description |
---|---|
static <I> GrowingAlphabet<I> |
Alphabets.toGrowingAlphabetOrThrowException(Alphabet<I> alphabet)
Casts the given alphabet to a
GrowingAlphabet if possible (i.e. the given alphabet is actually an
instance of a GrowingAlphabet ). |
Copyright © 2019. All rights reserved.