All Classes and Interfaces

Class	Description
AbstractTreeChromosome<A,G>	Abstract base implementation of a TreeChromosome.
AbstractTreeGene<A,G>	Abstract implementation of the TreeGene interface..
BigIntegerChromosome	Numeric chromosome implementation which holds arbitrary sized integer numbers.
BigIntegerGene	Numeric chromosome implementation which holds an arbitrary sized integer number.
Bnf	This class contains methods for parsing and formatting context-free grammars in BNF format.
Cfg<T>	Represents a context-free grammar (CFG).
Cfg.Expression<T>	Represents one expression (list of alternative symbols) a production rule consists of.
Cfg.NonTerminal<T>	Represents the non-terminal symbols of the grammar (NT).
Cfg.Rule<T>	Represents a production rule of the grammar (R).
Cfg.Symbol<T>	Represents the symbols the BNF grammar consists.
Cfg.Terminal<T>	Represents a terminal symbols of the grammar (T).
CharSequenceTokenizer	Base class for all tokenizers.
Codons	Represents a mapping of a finite set of integers to symbol indexes.
ConcatEngine<G,C>	The ConcatEngine lets you concatenate two (or more) evolution Engine, with different configurations, and let it use as one engine EvolutionStreamable.
ConcatSpliterator<T>	This Spliterator takes a list of other spliterators which are concatenated and a limiting predicate.
CyclicEngine<G,C>	The CyclicEngine lets you concatenate two (or more) evolution Engine, with different configurations, and let it use as one engine EvolutionStreamable.
CyclicSpliterator<T>
DerivationTreeGenerator<T>	Standard implementation of a derivation-tree generator.
ElementComparator<V>	Defines the order of two elements of a given vector type V.
ElementDistance<V>	Defines the distance of two elements of a given vector type V.
Escaper
FlatTree<V,T>	Tree specification, where the nodes of the whole tree are stored in an array.
FlatTreeNode<V>	Default implementation of the FlatTree interface.
FormulaParser<T>	This class allows you to convert a sequence of tokens, which represents some kind of (mathematical) formula, into a tree structure.
FormulaParser.Builder<T>	Builder for building new FormulaParser instances.
FormulaParser.Builder.Bops<T>	Builder class for building binary operators with its precedence.
FormulaParser.TokenConverter<T,V>	Conversion function which is used for converting tokens into another type.
FormulaParser.TokenType	The token types the parser recognizes during the parsing process.
Generator<T,R>	Generator interface for generating sentences/derivation trees from a given grammar.
GeneratorSpliterator<T>
HPRMutator<G,C>	The Hybridizing PSM and RSM Operator (HPRM) constructs an offspring from a pair of parents by hybridizing two mutation operators, PSM and RSM.
IntList	Resizable-int array implementation
Mappers	This class defines factories for different CFG ↔ Chromosome mappings (encodings).
MLEvolutionStrategy<G,C>	Setup for a (μ, λ)-Evolution Strategy.
MOEA	Collectors for collecting final pareto-set for multi-objective optimization.
MpLEvolutionStrategy<G,C>	Setup for a (μ + λ)-Evolution Strategy.
Names
NSGA2Selector<G,C>	This selector selects the first count elements of the population, which has been sorted by the Crowded-Comparison Operator, as described in A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II
Pareto	Low-level utility methods for doing pareto-optimal calculations.
ParetoFront<T>	This class only contains non-dominate (Pareto-optimal) elements according to a given dominance measure.
Parser<T>	Parser implementation for parsing a given token sequences.
ParsingException	Exception thrown in the case of a parse error.
Randoms
RSMutator<G,C>	The reverse sequence mutation, two positions i and j are randomly chosen The gene order in a chromosome will then be reversed between this two points.
SentenceGenerator<T>	Standard implementation of a sentence generator.
SentenceGenerator.Expansion	Defines the expansion strategy used when generating the sentences.
SimulatedBinaryCrossover<G,C>	Performs the simulated binary crossover (SBX) on a Chromosome of NumericGenes such that each position is either crossed contracted or expanded with a certain probability.
SingleNodeCrossover<G,C>	Swaps two, randomly chosen, nodes (subtrees) from two given trees.
SymbolIndex	Functional interface for selecting a Cfg.Symbol by its index within a rule.
Token<V>	This interface represents a parsed token.
Token.Type	Represents the type of the token, with a given type code and type name.
Tokenizer<T>	Interface for all tokenizers.
TokenParser<V>	Parser implementation for parsing explicit Token sequences.
Tree<V,T>	General purpose tree structure.
Tree.Path	This class represents the path to child within a given tree.
TreeChromosome<A,G>	Chromosome for tree shaped genes.
TreeCrossover<G,C>	Abstract implementation of tree base crossover recombinator.
TreeFormatter	Definition of different tree formatter strategies.
TreeGene<A,G>	Representation of tree shaped gene.
TreeMatcher<V>	Implementation of a pattern-based tree matcher.
TreeMatchResult<V>	The result of a tree match operation.
TreeMutator<A,G,C>	Abstract class for mutating tree chromosomes.
TreeNode<T>	A general purpose node in a tree data-structure.
TreePattern<V>	This class serves two purposes.
TreePattern.Decl<V>	A sealed interface, which constitutes the nodes of a pattern tree.
TreePattern.Val<V>	This class represents a constant pattern value, which can be part of a whole subtree.
TreePattern.Var<V>	Represents a placeholder (variable) for an arbitrary subtree.
TreeRewriteAlterer<A,G,C>	This alterer uses a TreeRewriter for altering the TreeChromosome.
TreeRewriter<V>	Interface for rewriting a given tree.
TreeRewriteRule<V>	Represents a tree rewrite rule.
TRS<V>	This class represents a Tree Rewrite System, which consists of a set of Tree Rewrite Rules.
UFTournamentSelector<G,C>	Unique fitness based tournament selection.
Vec<T>	The Vec interface represents the fitness result of a multi-objective fitness function.
VecFactory<T>	This interface allows creating a vector object from a given array type T.
WeaselMutator<G,C>	Mutator implementation which is part of the Weasel program algorithm.
WeaselProgram<G,C>	Configures the evolution engine to execute the Weasel program algorithm.
WeaselSelector<G,C>	Selector implementation which is part of the Weasel program algorithm.