Index (Jenetics 6.1.0)

A B C D E F G H I L M N O P R S T U V W
All Classes All Packages

A

AbstractTreeChromosome<A,G extends AbstractTreeGene<A,G>> - Class in io.jenetics.ext: Abstract base implementation of a TreeChromosome.
AbstractTreeChromosome(ISeq<? extends G>) - Constructor for class io.jenetics.ext.AbstractTreeChromosome
AbstractTreeGene<A,G extends AbstractTreeGene<A,G>> - Class in io.jenetics.ext: Abstract implementation of the TreeGene interface..
AbstractTreeGene(A, int, int) - Constructor for class io.jenetics.ext.AbstractTreeGene: Creates a new tree-gene from the given data.
add(T) - Method in class io.jenetics.ext.moea.ParetoFront: Inserts an element to this pareto front.
addAll(Collection<? extends T>) - Method in class io.jenetics.ext.moea.ParetoFront: Adds all elements of the given collection to this pareto front.
allele() - Method in class io.jenetics.ext.AbstractTreeGene
allele() - Method in class io.jenetics.ext.BigIntegerGene
alter(Seq<Phenotype<G, C>>, long) - Method in class io.jenetics.ext.WeaselMutator
append(Tree.Path) - Method in class io.jenetics.ext.util.Tree.Path: Appends the given path to this one.
apply(Engine.Builder<G, C>) - Method in class io.jenetics.ext.MLEvolutionStrategy
apply(Engine.Builder<G, C>) - Method in class io.jenetics.ext.MpLEvolutionStrategy
apply(Engine.Builder<G, C>) - Method in class io.jenetics.ext.WeaselProgram
attach(TreeNode<T>) - Method in class io.jenetics.ext.util.TreeNode: Remove the given child from its parent and makes it a child of this node by adding it to the end of this node's child array.
attach(T) - Method in class io.jenetics.ext.util.TreeNode: Attaches the given child to this node.
attach(T...) - Method in class io.jenetics.ext.util.TreeNode: Attaches the given children to this node.

B

BigIntegerChromosome - Class in io.jenetics.ext: Numeric chromosome implementation which holds arbitrary sized integer numbers.
BigIntegerChromosome(ISeq<BigIntegerGene>) - Constructor for class io.jenetics.ext.BigIntegerChromosome: Create a new chromosome from the given genes array.
BigIntegerChromosome(BigInteger, BigInteger) - Constructor for class io.jenetics.ext.BigIntegerChromosome: Create a new random DoubleChromosome of length one.
BigIntegerChromosome(BigInteger, BigInteger, int) - Constructor for class io.jenetics.ext.BigIntegerChromosome: Create a new random BigIntegerChromosome with the given length.
BigIntegerGene - Class in io.jenetics.ext: Numeric chromosome implementation which holds an arbitrary sized integer number.
bind(BaseSeq<G>) - Method in class io.jenetics.ext.AbstractTreeGene: This method is used by the AbstractTreeChromosome to attach itself to this gene.
breadthFirstIterator() - Method in class io.jenetics.ext.util.FlatTreeNode
breadthFirstIterator() - Method in interface io.jenetics.ext.util.Tree: Return an iterator that traverses the subtree rooted at this node in breadth-first order.
breadthFirstStream() - Method in class io.jenetics.ext.util.FlatTreeNode
breadthFirstStream() - Method in interface io.jenetics.ext.util.Tree: Return a stream that traverses the subtree rooted at this node in breadth-first order.

C

checkTreeState() - Method in class io.jenetics.ext.AbstractTreeGene
childAfter(Tree<?, ?>) - Method in interface io.jenetics.ext.util.Tree: Return the child which comes immediately after this node.
childAt(int) - Method in class io.jenetics.ext.AbstractTreeGene: Return the child gene with the given index.
childAt(int) - Method in class io.jenetics.ext.util.FlatTreeNode
childAt(int) - Method in interface io.jenetics.ext.util.Tree: Return the child node with the given index.
childAt(int) - Method in class io.jenetics.ext.util.TreeNode: Returns the child at the specified index in this node's child array.
childAtPath(int...) - Method in interface io.jenetics.ext.util.Tree: Return the child node at the given path.
childAtPath(Tree.Path) - Method in interface io.jenetics.ext.util.Tree: Return the child node at the given path.
childBefore(Tree<?, ?>) - Method in interface io.jenetics.ext.util.Tree: Return the child which comes immediately before this node.
childCount() - Method in class io.jenetics.ext.AbstractTreeGene
childCount() - Method in class io.jenetics.ext.util.FlatTreeNode
childCount() - Method in interface io.jenetics.ext.util.Tree: Return the number of children this tree node consists of.
childCount() - Method in class io.jenetics.ext.util.TreeNode
childIterator() - Method in interface io.jenetics.ext.util.Tree: Return an iterator of the children of this Tree node.
childIterator() - Method in class io.jenetics.ext.util.TreeNode
childOffset() - Method in class io.jenetics.ext.AbstractTreeGene
childOffset() - Method in interface io.jenetics.ext.util.FlatTree: Return the index of the first child node in the underlying node array.
childOffset() - Method in class io.jenetics.ext.util.FlatTreeNode: Return the index of the first child node in the underlying node array.
childPath() - Method in interface io.jenetics.ext.util.Tree: Return the path of this child node from the root node.
childStream() - Method in interface io.jenetics.ext.util.Tree: Return a forward-order stream of this node's children.
childStream() - Method in class io.jenetics.ext.util.TreeNode
comparator() - Method in interface io.jenetics.ext.moea.Vec: Return the comparator for comparing the elements of this MO vector.
compare(Vec<T>, int) - Method in interface io.jenetics.ext.moea.Vec: Compares the this vector with the other at the given component index.
compare(V, V, int) - Method in interface io.jenetics.ext.moea.ElementComparator: Compares the components of a and b at the given index.
compareTo(Vec<T>) - Method in interface io.jenetics.ext.moea.Vec: The default implementation uses the Vec.dominance(Vec) function for defining a partial order of two vectors.
compareTo(TreePattern.Var<V>) - Method in class io.jenetics.ext.rewriting.TreePattern.Var
compile(String) - Static method in class io.jenetics.ext.rewriting.TreePattern: Compiles the given tree pattern string.
compile(String, Function<? super String, ? extends V>) - Static method in class io.jenetics.ext.rewriting.TreePattern: Compiles the given tree pattern string.
concat(TreeRewriter<V>...) - Static method in interface io.jenetics.ext.rewriting.TreeRewriter: Concat the given rewriters to one tree-rewriter.
ConcatEngine<G extends Gene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext.engine: The ConcatEngine lets you concatenate two (or more) evolution Engine, with different configurations, and let it use as one engine EvolutionStreamable.
ConcatEngine(List<? extends EvolutionStreamable<G, C>>) - Constructor for class io.jenetics.ext.engine.ConcatEngine: Create a new concatenating evolution engine with the given list of engines.
contiguity() - Method in class io.jenetics.ext.SimulatedBinaryCrossover: Return the contiguity value of the crossover.
copy() - Method in class io.jenetics.ext.util.TreeNode
crossover(TreeNode<A>, TreeNode<A>) - Method in class io.jenetics.ext.SingleNodeCrossover
crossover(TreeNode<A>, TreeNode<A>) - Method in class io.jenetics.ext.TreeCrossover: Template method which performs the crossover.
crossover(MSeq<G>, MSeq<G>) - Method in class io.jenetics.ext.SimulatedBinaryCrossover
crowdingDistance(BaseSeq<? extends Vec<T>>) - Static method in class io.jenetics.ext.moea.Pareto: The crowding distance value of a solution provides an estimate of the density of solutions surrounding that solution.
crowdingDistance(BaseSeq<? extends T>, ElementComparator<? super T>, ElementDistance<? super T>, ToIntFunction<? super T>) - Static method in class io.jenetics.ext.moea.Pareto: The crowding distance value of a solution provides an estimate of the density of solutions surrounding that solution.
CyclicEngine<G extends Gene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext.engine: The CyclicEngine lets you concatenate two (or more) evolution Engine, with different configurations, and let it use as one engine EvolutionStreamable.
CyclicEngine(List<? extends EvolutionStreamable<G, C>>) - Constructor for class io.jenetics.ext.engine.CyclicEngine: Create a new cycling evolution engine with the given list of engines.

D

data() - Method in interface io.jenetics.ext.moea.Vec: Return the underlying data structure.
depth() - Method in interface io.jenetics.ext.util.Tree: Returns the depth of the tree rooted at this node.
depthFirstIterator() - Method in interface io.jenetics.ext.util.Tree: Return an iterator that traverses the subtree rooted at this node in depth-first order.
depthFirstStream() - Method in interface io.jenetics.ext.util.Tree: Return a stream that traverses the subtree rooted at this node in depth-first.
detach() - Method in class io.jenetics.ext.util.TreeNode: Detaches the subtree rooted at this node from the tree, giving this node a null parent.
distance() - Method in interface io.jenetics.ext.moea.Vec: Return a function which calculates the element distance of a vector at a given element index.
distance(Vec<T>, int) - Method in interface io.jenetics.ext.moea.Vec: Calculates the distance between two vector elements at the given index.
distance(V, V, int) - Method in interface io.jenetics.ext.moea.ElementDistance: Calculates the distance of two vector elements at the given index.
dominance() - Method in interface io.jenetics.ext.moea.Vec: Return the comparator which defines the (Pareto) dominance measure.
dominance(double[], double[]) - Static method in class io.jenetics.ext.moea.Pareto: Calculates the Pareto Dominance of the two vectors u and v.
dominance(double[], double[]) - Static method in interface io.jenetics.ext.moea.Vec: Calculates the Pareto Dominance of the two vectors u and v.
dominance(int[], int[]) - Static method in class io.jenetics.ext.moea.Pareto: Calculates the Pareto Dominance of the two vectors u and v.
dominance(int[], int[]) - Static method in interface io.jenetics.ext.moea.Vec: Calculates the Pareto Dominance of the two vectors u and v.
dominance(long[], long[]) - Static method in class io.jenetics.ext.moea.Pareto: Calculates the Pareto Dominance of the two vectors u and v.
dominance(long[], long[]) - Static method in interface io.jenetics.ext.moea.Vec: Calculates the Pareto Dominance of the two vectors u and v.
dominance(C[], C[]) - Static method in class io.jenetics.ext.moea.Pareto: Calculates the Pareto Dominance of the two vectors u and v.
dominance(C[], C[]) - Static method in interface io.jenetics.ext.moea.Vec: Calculates the Pareto Dominance of the two vectors u and v.
dominance(Vec<T>) - Method in interface io.jenetics.ext.moea.Vec: Calculates the Pareto Dominance of vector value() and other.
dominance(T[], T[], Comparator<? super T>) - Static method in class io.jenetics.ext.moea.Pareto: Calculates the Pareto Dominance of the two vectors u and v.
dominance(T[], T[], Comparator<? super T>) - Static method in interface io.jenetics.ext.moea.Vec: Calculates the Pareto Dominance of the two vectors u and v.
dominance(V, V, int, ElementComparator<? super V>) - Static method in class io.jenetics.ext.moea.Pareto: Calculates the Pareto Dominance of the two vectors u and v.
dot(String) - Static method in class io.jenetics.ext.util.TreeFormatter: A tree formatter for .dot string representations.
DOT - Static variable in class io.jenetics.ext.util.TreeFormatter: A tree formatter for .dot string representations.

E

ElementComparator<V> - Interface in io.jenetics.ext.moea: Defines the order of two elements of a given vector type V.
ElementDistance<V> - Interface in io.jenetics.ext.moea: Defines the distance of two elements of a given vector type V.
equals(Tree<?, ?>, Tree<?, ?>) - Static method in interface io.jenetics.ext.util.Tree: Checks if the two given trees has the same structure with the same values.
equals(Object) - Method in class io.jenetics.ext.AbstractTreeGene
equals(Object) - Method in class io.jenetics.ext.BigIntegerGene
equals(Object) - Method in class io.jenetics.ext.rewriting.TreeMatchResult
equals(Object) - Method in class io.jenetics.ext.rewriting.TreePattern
equals(Object) - Method in class io.jenetics.ext.rewriting.TreePattern.Val
equals(Object) - Method in class io.jenetics.ext.rewriting.TreePattern.Var
equals(Object) - Method in class io.jenetics.ext.rewriting.TreeRewriteRule
equals(Object) - Method in class io.jenetics.ext.rewriting.TRS
equals(Object) - Method in class io.jenetics.ext.util.FlatTreeNode
equals(Object) - Method in class io.jenetics.ext.util.Tree.Path
equals(Object) - Method in class io.jenetics.ext.util.TreeNode
expand(Map<TreePattern.Var<V>, Tree<V, ?>>) - Method in class io.jenetics.ext.rewriting.TreePattern: Expands this pattern with the given variable mapping.

F

firstChild() - Method in interface io.jenetics.ext.util.Tree: Return the first child of this node, or Optional.empty() if this node has no children.
firstLeaf() - Method in interface io.jenetics.ext.util.Tree: Return the first leaf that is a descendant of this node; either this node or its first child's first leaf.
flattenedNodes() - Method in class io.jenetics.ext.AbstractTreeGene: Return the whole flattened tree values in breadth-first order.
flattenedNodes() - Method in interface io.jenetics.ext.util.FlatTree: Return the whole flattened tree values in breadth-first order.
flattenedNodes() - Method in class io.jenetics.ext.util.FlatTreeNode
FlatTree<V,T extends FlatTree<V,T>> - Interface in io.jenetics.ext.util: Tree specification, where the nodes of the whole tree are stored in an array.
FlatTreeNode<V> - Class in io.jenetics.ext.util: Default implementation of the FlatTree interface.
format(Tree<?, ?>) - Method in class io.jenetics.ext.util.TreeFormatter: Formats the given tree to its string representation.
format(Tree<V, ?>, Function<? super V, ? extends CharSequence>) - Method in class io.jenetics.ext.util.TreeFormatter: Formats the given tree to its string representation.
front(BaseSeq<? extends Vec<T>>) - Static method in class io.jenetics.ext.moea.Pareto: Return the elements, from the given input set, which are part of the pareto front.
front(BaseSeq<? extends T>, Comparator<? super T>) - Static method in class io.jenetics.ext.moea.Pareto: Return the elements, from the given input set, which are part of the pareto front.

G

get(int) - Method in class io.jenetics.ext.util.Tree.Path: Return the child index at the given index (child level).

H

hashCode() - Method in class io.jenetics.ext.AbstractTreeGene
hashCode() - Method in class io.jenetics.ext.BigIntegerGene
hashCode() - Method in class io.jenetics.ext.rewriting.TreeMatchResult
hashCode() - Method in class io.jenetics.ext.rewriting.TreePattern
hashCode() - Method in class io.jenetics.ext.rewriting.TreePattern.Val
hashCode() - Method in class io.jenetics.ext.rewriting.TreePattern.Var
hashCode() - Method in class io.jenetics.ext.rewriting.TreeRewriteRule
hashCode() - Method in class io.jenetics.ext.rewriting.TRS
hashCode() - Method in class io.jenetics.ext.util.FlatTreeNode
hashCode() - Method in class io.jenetics.ext.util.Tree.Path
hashCode() - Method in class io.jenetics.ext.util.TreeNode
hashCode(Tree<?, ?>) - Static method in interface io.jenetics.ext.util.Tree: Calculates the hash code of the given tree.
HPRMutator<G extends Gene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: The Hybridizing PSM and RSM Operator (HPRM) constructs an offspring from a pair of parents by hybridizing two mutation operators, PSM and RSM.
HPRMutator() - Constructor for class io.jenetics.ext.HPRMutator: Default constructor, with default mutation probability (Alterer.DEFAULT_ALTER_PROBABILITY).
HPRMutator(double) - Constructor for class io.jenetics.ext.HPRMutator: Constructs an alterer with a given recombination probability.

I

identical(Tree<?, ?>) - Method in class io.jenetics.ext.util.FlatTreeNode
identical(Tree<?, ?>) - Method in interface io.jenetics.ext.util.Tree: Tests whether this node is the same as the other node.
indexOf(Tree<?, ?>) - Method in interface io.jenetics.ext.util.Tree: Returns the index of the specified child in this node's child array, or -1 if this node doesn't contain the given child.
insert(int, TreeNode<T>) - Method in class io.jenetics.ext.util.TreeNode: Removes the child from its present parent (if it has one), sets the child's parent to this node, and then adds the child to this node's child array at index index.
io.jenetics.ext - package io.jenetics.ext
io.jenetics.ext.engine - package io.jenetics.ext.engine: This package contains classes, which allows to concatenate evolution Engines with different configurations.
io.jenetics.ext.moea - package io.jenetics.ext.moea: This package contains class which allows to do multi-object optimization with Jenetics.
io.jenetics.ext.rewriting - package io.jenetics.ext.rewriting: This package contains the implementation of a Tree (Term) Rewrite System.
io.jenetics.ext.util - package io.jenetics.ext.util
isAncestor(Tree<?, ?>) - Method in interface io.jenetics.ext.util.Tree: Return true if the given node is an ancestor of this node.
isChild(Tree<?, ?>) - Method in interface io.jenetics.ext.util.Tree: Return true if the given node is a child of this node.
isDescendant(Tree<?, ?>) - Method in interface io.jenetics.ext.util.Tree: Return true if the given node is a descendant of this node.
isEmpty() - Method in class io.jenetics.ext.moea.ParetoFront
isLeaf() - Method in interface io.jenetics.ext.util.Tree: Return true if this node has no children.
isRelated(Tree<?, ?>) - Method in interface io.jenetics.ext.util.Tree: Returns true if and only if the given node is in the same tree as this node.
isRoot() - Method in class io.jenetics.ext.AbstractTreeGene
isRoot() - Method in class io.jenetics.ext.util.FlatTreeNode
isRoot() - Method in interface io.jenetics.ext.util.Tree: Returns true if this node is the root of the tree.
isSibling(Tree<?, ?>) - Method in interface io.jenetics.ext.util.Tree: Test if the given node is a sibling of this node.
isValid() - Method in class io.jenetics.ext.AbstractTreeGene
iterator() - Method in class io.jenetics.ext.moea.ParetoFront
iterator() - Method in interface io.jenetics.ext.util.Tree: Return an iterator that traverses the subtree rooted at this.

L

lastChild() - Method in interface io.jenetics.ext.util.Tree: Return the last child of this node, or Optional.empty() if this node has no children.
lastLeaf() - Method in interface io.jenetics.ext.util.Tree: Return the last leaf that is a descendant of this node; either this node or its last child's last leaf.
leafCount() - Method in interface io.jenetics.ext.util.Tree: Returns the total number of leaves that are descendants of this node.
left() - Method in class io.jenetics.ext.rewriting.TreeRewriteRule: Return the rule matching pattern.
length() - Method in interface io.jenetics.ext.moea.Vec: Return the number of vector elements.
length() - Method in class io.jenetics.ext.util.Tree.Path: Return the path length, which is the level of the child this path points to.
level() - Method in interface io.jenetics.ext.util.Tree: Returns the number of levels above this node.
LISP - Static variable in class io.jenetics.ext.util.TreeFormatter: Formats a given tree to a lisp string representation.

M

map(Function<? super FlatTreeNode<V>, ? extends B>) - Method in class io.jenetics.ext.util.FlatTreeNode: Return a sequence of all mapped nodes of the whole underlying tree.
map(Function<? super T, ? extends B>) - Method in class io.jenetics.ext.util.TreeNode: Returns a new TreeNode consisting of all nodes of this tree, but with a different value type, created by applying the given function to the node values of this tree.
map(Function<? super T, ? extends V>) - Method in interface io.jenetics.ext.moea.ElementComparator: Return an element comparator for the mapped type T.
map(Function<? super T, ? extends V>) - Method in interface io.jenetics.ext.moea.ElementDistance: Return an element distance function for the mapped type T.
map(Function<? super V, ? extends B>) - Method in class io.jenetics.ext.rewriting.TreePattern: Maps this tree-pattern from type V to type B.
map(Function<? super V, ? extends B>) - Method in class io.jenetics.ext.rewriting.TreeRewriteRule: Maps this rewrite rule from type V to type B.
map(Function<? super V, ? extends B>) - Method in class io.jenetics.ext.rewriting.TRS: Maps this TRS from type V to type B.
match(Tree<V, ?>) - Method in class io.jenetics.ext.rewriting.TreePattern: Try to match the given tree against this pattern.
matcher(Tree<V, ?>) - Method in class io.jenetics.ext.rewriting.TreePattern: Creates a matcher that will match the given input tree against this pattern.
matches() - Method in class io.jenetics.ext.rewriting.TreeMatcher: Tests if the tree matches the pattern.
matches(Tree<V, ?>) - Method in class io.jenetics.ext.rewriting.TreePattern: Tests whether the given input tree matches this pattern.
max() - Method in class io.jenetics.ext.BigIntegerChromosome
max() - Method in class io.jenetics.ext.BigIntegerGene
mean(BigIntegerGene) - Method in class io.jenetics.ext.BigIntegerGene
merge(ParetoFront<? extends T>) - Method in class io.jenetics.ext.moea.ParetoFront: Add the all elements to this pareto-set.
min() - Method in class io.jenetics.ext.BigIntegerChromosome
min() - Method in class io.jenetics.ext.BigIntegerGene
MLEvolutionStrategy<G extends Gene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: Setup for a (μ, λ)-Evolution Strategy.
MLEvolutionStrategy(int, int) - Constructor for class io.jenetics.ext.MLEvolutionStrategy: Create a new (μ, λ)-Evolution Strategy with the given parameters.
MLEvolutionStrategy(int, int, double) - Constructor for class io.jenetics.ext.MLEvolutionStrategy: Create a new (μ, λ)-Evolution Strategy with the given parameters.
MOEA - Class in io.jenetics.ext.moea: Collectors for collecting final pareto-set for multi-objective optimization.
MpLEvolutionStrategy<G extends Gene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: Setup for a (μ + λ)-Evolution Strategy.
MpLEvolutionStrategy(int, int) - Constructor for class io.jenetics.ext.MpLEvolutionStrategy: Create a new (μ + λ)-Evolution Strategy with the given parameters.
MpLEvolutionStrategy(int, int, double) - Constructor for class io.jenetics.ext.MpLEvolutionStrategy: Create a new (μ + λ)-Evolution Strategy with the given parameters.
mutate(Chromosome<G>, double, Random) - Method in class io.jenetics.ext.HPRMutator
mutate(Chromosome<G>, double, Random) - Method in class io.jenetics.ext.RSMutator
mutate(Chromosome<G>, double, Random) - Method in class io.jenetics.ext.TreeMutator: Mutates the given chromosome.
mutate(TreeNode<A>) - Method in class io.jenetics.ext.TreeMutator: This method does the actual mutating, in place.
mutate(TreeNode<A>) - Method in class io.jenetics.ext.TreeRewriteAlterer: Performs the actual tree rewriting.
mutate(Genotype<G>, double, Random) - Method in class io.jenetics.ext.WeaselMutator

N

name() - Method in class io.jenetics.ext.rewriting.TreePattern.Var: Return the name of the variable.
newInstance() - Method in class io.jenetics.ext.BigIntegerChromosome
newInstance() - Method in class io.jenetics.ext.BigIntegerGene
newInstance(A, int, int) - Method in interface io.jenetics.ext.TreeGene: Return a new tree gene with the given allele and the local tree structure.
newInstance(FlatTree<? extends A, ?>) - Method in interface io.jenetics.ext.TreeGene: Return a new tree gene from the given flat tree node.
newInstance(ISeq<BigIntegerGene>) - Method in class io.jenetics.ext.BigIntegerChromosome
newInstance(Number) - Method in class io.jenetics.ext.BigIntegerGene
newInstance(BigInteger) - Method in class io.jenetics.ext.BigIntegerGene
newVec(T) - Method in interface io.jenetics.ext.moea.VecFactory: Create a new Vec object from the given array.
nextLeaf() - Method in interface io.jenetics.ext.util.Tree: Returns the leaf after this node or Optional.empty() if this node is the last leaf in the tree.
nextNode() - Method in interface io.jenetics.ext.util.Tree: Return the node that follows this node in a pre-order traversal of this tree node.
nextSibling() - Method in interface io.jenetics.ext.util.Tree: Return the next sibling of this node in the parent's children array, or null if this node has no parent or it is the last child of the paren.
NSGA2Selector<G extends Gene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext.moea: 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
NSGA2Selector(Comparator<? super C>, ElementComparator<? super C>, ElementDistance<? super C>, ToIntFunction<? super C>) - Constructor for class io.jenetics.ext.moea.NSGA2Selector: Creates a new NSGA2Selector with the functions needed for handling the multi-objective result type C.

O

of() - Static method in class io.jenetics.ext.util.TreeNode: Return a new TreeNode with a null tree value.
of(double...) - Static method in interface io.jenetics.ext.moea.Vec: Wraps the given array into a Vec object.
of(int...) - Static method in interface io.jenetics.ext.moea.Vec: Wraps the given array into a Vec object.
of(int...) - Static method in class io.jenetics.ext.util.Tree.Path: Create a new path object from the given child indexes.
of(long...) - Static method in interface io.jenetics.ext.moea.Vec: Wraps the given array into a Vec object.
of(C[]) - Static method in interface io.jenetics.ext.moea.Vec: Wraps the given array into a Vec object.
of(C[], ElementDistance<C[]>) - Static method in interface io.jenetics.ext.moea.Vec: Wraps the given array into a Vec object.
of(EvolutionStreamable<G, C>...) - Static method in class io.jenetics.ext.engine.ConcatEngine: Create a new concatenating evolution engine with the given array of engines.
of(EvolutionStreamable<G, C>...) - Static method in class io.jenetics.ext.engine.CyclicEngine: Create a new cycling evolution engine with the given array of engines.
of(BigIntegerGene...) - Static method in class io.jenetics.ext.BigIntegerChromosome: Create a new DoubleChromosome with the given genes.
of(Tree<? extends V, ?>) - Static method in class io.jenetics.ext.util.FlatTreeNode: Deprecated, for removal: This API element is subject to removal in a future version.
Use FlatTreeNode.ofTree(Tree) instead
of(String) - Static method in class io.jenetics.ext.rewriting.TreePattern.Var: Return a new variable with the given name.
of(BigInteger, BigInteger) - Static method in class io.jenetics.ext.BigIntegerChromosome: Create a new random DoubleChromosome of length one.
of(BigInteger, BigInteger) - Static method in class io.jenetics.ext.BigIntegerGene: Create a new random BigIntegerGene.
of(BigInteger, BigInteger, int) - Static method in class io.jenetics.ext.BigIntegerChromosome: Create a new random DoubleChromosome.
of(BigInteger, BigInteger, BigInteger) - Static method in class io.jenetics.ext.BigIntegerGene: Create a new random BigIntegerGene with the given value and the given range.
of(T) - Static method in class io.jenetics.ext.util.TreeNode: Return a new TreeNode with the given node value.
of(T[], Comparator<? super T>, ElementDistance<T[]>) - Static method in interface io.jenetics.ext.moea.Vec: Wraps the given array into a Vec object.
of(V) - Static method in class io.jenetics.ext.rewriting.TreePattern.Val: Create a new value object.
ofDoubleVec() - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for double[] vectors, where all dimensions are maximized.
ofDoubleVec(Optimize...) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for double[] vectors.
ofDoubleVec(List<Optimize>) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for double[] vectors.
ofIndex(int) - Method in interface io.jenetics.ext.moea.ElementComparator: Return a comparator which takes the component at the give index for comparison two objects of type T.
ofIndex(int) - Method in interface io.jenetics.ext.moea.ElementDistance: Return a function which calculates the distance of two vector elements at a given index.
ofIntVec() - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for int[] vectors, where all dimensions are maximized.
ofIntVec(Optimize...) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for int[] vectors.
ofIntVec(List<Optimize>) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for int[] vectors.
ofLongVec() - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for long[] vectors, where all dimensions are maximized.
ofLongVec(Optimize...) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for long[] vectors.
ofLongVec(List<Optimize>) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for long[] vectors.
ofObjectVec() - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for T[] vectors with comparable element types.
ofObjectVec(ElementDistance<T[]>, Optimize...) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for T[] vectors with comparable element types.
ofObjectVec(ElementDistance<T[]>, List<Optimize>) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for T[] vectors with comparable element types.
ofObjectVec(Optimize...) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for T[] vectors with comparable element types.
ofObjectVec(Comparator<? super T>, ElementDistance<T[]>, Optimize...) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for T[] vectors.
ofObjectVec(Comparator<? super T>, ElementDistance<T[]>, List<Optimize>) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for T[] vectors.
ofObjectVec(List<Optimize>) - Static method in interface io.jenetics.ext.moea.VecFactory: Create a new factory for T[] vectors with comparable element types.
ofTree(Tree<? extends T, ?>) - Static method in class io.jenetics.ext.util.TreeNode: Return a new TreeNode from the given source tree.
ofTree(Tree<? extends T, ?>, Function<? super T, ? extends B>) - Static method in class io.jenetics.ext.util.TreeNode: Return a new TreeNode from the given source tree.
ofTree(Tree<? extends V, ?>) - Static method in class io.jenetics.ext.util.FlatTreeNode: Create a new, immutable FlatTreeNode from the given tree.
ofVec() - Static method in class io.jenetics.ext.moea.NSGA2Selector: Return a new selector for the given result type V.
ofVec() - Static method in class io.jenetics.ext.moea.UFTournamentSelector: Return a new selector for the given result type V.

P

parent() - Method in class io.jenetics.ext.AbstractTreeGene: Return the parent node of this tree node.
parent() - Method in class io.jenetics.ext.util.FlatTreeNode
parent() - Method in interface io.jenetics.ext.util.Tree: Return the parent node of this tree node.
parent() - Method in class io.jenetics.ext.util.TreeNode: Returns this node's parent if available.
PARENTHESES - Static variable in class io.jenetics.ext.util.TreeFormatter: Formats a given tree to a parentheses string representation.
Pareto - Class in io.jenetics.ext.moea: Low-level utility methods for doing pareto-optimal calculations.
ParetoFront<T> - Class in io.jenetics.ext.moea: This class only contains non-dominate (Pareto-optimal) elements according to a given dominance measure.
ParetoFront(Comparator<? super T>) - Constructor for class io.jenetics.ext.moea.ParetoFront: Create a new ParetoSet with the given dominance measure.
ParetoFront(Comparator<? super T>, BiPredicate<? super T, ? super T>) - Constructor for class io.jenetics.ext.moea.ParetoFront: Create a new ParetoSet with the given dominance measure.
parse(String) - Static method in class io.jenetics.ext.rewriting.TreeRewriteRule: Compiles the string representation of a rewrite rule:
parse(String) - Static method in class io.jenetics.ext.util.FlatTreeNode: Parses a (parentheses) tree string, created with Tree.toParenthesesString().
parse(String) - Static method in class io.jenetics.ext.util.TreeNode: Parses a (parentheses) tree string, created with Tree.toParenthesesString().
parse(String...) - Static method in class io.jenetics.ext.rewriting.TRS: Create a new TRS from the given rewrite rules.
parse(String, Function<? super String, ? extends B>) - Static method in class io.jenetics.ext.util.FlatTreeNode: Parses a (parentheses) tree string, created with Tree.toParenthesesString().
parse(String, Function<? super String, ? extends B>) - Static method in class io.jenetics.ext.util.TreeNode: Parses a (parentheses) tree string, created with Tree.toParenthesesString().
parse(String, Function<? super String, ? extends V>) - Static method in class io.jenetics.ext.rewriting.TreeRewriteRule: Compiles the string representation of a rewrite rule:
parse(Function<? super String, ? extends V>, String...) - Static method in class io.jenetics.ext.rewriting.TRS: Create a new TRS from the given rewrite rules and type mapper.
path() - Method in interface io.jenetics.ext.util.Tree: Return the Tree.Path of this tree, such that
pathElements() - Method in interface io.jenetics.ext.util.Tree: Returns the path from the root, to get to this node.
pathFromAncestorIterator(Tree<?, ?>) - Method in interface io.jenetics.ext.util.Tree: Return an iterator that follows the path from ancestor to this node.
pattern() - Method in class io.jenetics.ext.rewriting.TreeMatcher: Return the underlying pattern of this matcher.
postorderIterator() - Method in interface io.jenetics.ext.util.Tree: Return an iterator that traverses the subtree rooted at this node in post-order.
postorderStream() - Method in interface io.jenetics.ext.util.Tree: Return a stream that traverses the subtree rooted at this node in post-order.
preorderIterator() - Method in interface io.jenetics.ext.util.Tree: Return an iterator that traverses the subtree rooted at this node in pre-order.
preorderStream() - Method in interface io.jenetics.ext.util.Tree: Return a stream that traverses the subtree rooted at this node in pre-order.
previousLeaf() - Method in interface io.jenetics.ext.util.Tree: Return the leaf before this node or null if this node is the first leaf in the tree.
previousNode() - Method in interface io.jenetics.ext.util.Tree: Return the node that precedes this node in a pre-order traversal of this tree node.
previousSibling() - Method in interface io.jenetics.ext.util.Tree: Return the previous sibling of this node in the parent's children list, or Optional.empty() if this node has no parent or is the parent's first child.

R

rank(BaseSeq<? extends Vec<T>>) - Static method in class io.jenetics.ext.moea.Pareto: Calculates the non-domination rank of the given input set, using the natural order of the elements as dominance measure.
rank(BaseSeq<? extends T>, Comparator<? super T>) - Static method in class io.jenetics.ext.moea.Pareto: Calculates the non-domination rank of the given input set, using the given dominance comparator.
recombine(MSeq<Phenotype<G, C>>, int[], long) - Method in class io.jenetics.ext.TreeCrossover
remove(int) - Method in class io.jenetics.ext.util.TreeNode: Removes the child at the specified index from this node's children and sets that node's parent to null.
remove(Tree<?, ?>) - Method in class io.jenetics.ext.util.TreeNode: Remove the child from this node's child array, giving it a null parent.
removeAllChildren() - Method in class io.jenetics.ext.util.TreeNode: Removes all children fo this node and setting their parents to null.
removeAtPath(Tree.Path) - Method in class io.jenetics.ext.util.TreeNode: Removes the child at the given path.
replace(int, TreeNode<T>) - Method in class io.jenetics.ext.util.TreeNode: Replaces the child at the give index with the given child
replaceAtPath(Tree.Path, TreeNode<T>) - Method in class io.jenetics.ext.util.TreeNode: Replaces the child at the given path with the given new child.
results() - Method in class io.jenetics.ext.rewriting.TreeMatcher: Return all matching sub-trees.
reversed() - Method in interface io.jenetics.ext.moea.ElementComparator: Returns a comparator that imposes the reverse ordering of this comparator.
rewrite(TreeNode<V>) - Method in interface io.jenetics.ext.rewriting.TreeRewriter: Applies the rewriting to the given (mutable) tree.
rewrite(TreeNode<V>, int) - Method in interface io.jenetics.ext.rewriting.TreeRewriter: Applies the rewriting to the given (mutable) tree.
rewrite(TreeNode<V>, int) - Method in class io.jenetics.ext.rewriting.TreeRewriteRule
rewrite(TreeNode<V>, int) - Method in class io.jenetics.ext.rewriting.TRS
rewrite(TreeNode<V>, int, Iterable<? extends TreeRewriter<V>>) - Static method in interface io.jenetics.ext.rewriting.TreeRewriter: Rewrites the given tree by applying the given rewriters.
rewrite(TreeNode<V>, Iterable<? extends TreeRewriter<V>>) - Static method in interface io.jenetics.ext.rewriting.TreeRewriter: Rewrites the given tree by applying the given rewriters.
right() - Method in class io.jenetics.ext.rewriting.TreeRewriteRule: Return the replacement pattern of the rule.
root() - Method in class io.jenetics.ext.AbstractTreeGene
root() - Method in interface io.jenetics.ext.TreeChromosome: Return the root gene of this chromosome.
root() - Method in class io.jenetics.ext.util.FlatTreeNode: Returns the root of the tree that contains this node.
root() - Method in interface io.jenetics.ext.util.Tree: Returns the root of the tree that contains this node.
RSMutator<G extends Gene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: 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.
RSMutator() - Constructor for class io.jenetics.ext.RSMutator: Default constructor, with default mutation probability (Alterer.DEFAULT_ALTER_PROBABILITY).
RSMutator(double) - Constructor for class io.jenetics.ext.RSMutator: Constructs an alterer with a given recombination probability.

S

select(Seq<Phenotype<G, C>>, int, Optimize) - Method in class io.jenetics.ext.moea.NSGA2Selector
select(Seq<Phenotype<G, C>>, int, Optimize) - Method in class io.jenetics.ext.moea.UFTournamentSelector
select(Seq<Phenotype<G, C>>, int, Optimize) - Method in class io.jenetics.ext.WeaselSelector
sharedAncestor(Tree<?, ?>) - Method in interface io.jenetics.ext.util.Tree: Returns the nearest common ancestor to this node and the given node.
siblingCount() - Method in interface io.jenetics.ext.util.Tree: Return the number of siblings of this node.
SimulatedBinaryCrossover<G extends NumericGene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: 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.
SimulatedBinaryCrossover(double) - Constructor for class io.jenetics.ext.SimulatedBinaryCrossover: Create a new simulated binary crossover alterer with the given parameters.
SimulatedBinaryCrossover(double, double) - Constructor for class io.jenetics.ext.SimulatedBinaryCrossover: Create a new simulated binary crossover alterer with the given parameters.
SingleNodeCrossover<G extends TreeGene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: Swaps two, randomly chosen, nodes (sub-trees) from two given trees.
SingleNodeCrossover() - Constructor for class io.jenetics.ext.SingleNodeCrossover
SingleNodeCrossover(double) - Constructor for class io.jenetics.ext.SingleNodeCrossover
size() - Method in class io.jenetics.ext.AbstractTreeGene
size() - Method in class io.jenetics.ext.moea.ParetoFront
size() - Method in class io.jenetics.ext.util.FlatTreeNode
size() - Method in interface io.jenetics.ext.util.Tree: Return the number of nodes of this node (sub-tree).
stream() - Method in interface io.jenetics.ext.util.Tree: Return a stream that traverses the subtree rooted at this node in breadth-first order.
stream(EvolutionInit<G>) - Method in class io.jenetics.ext.engine.ConcatEngine
stream(EvolutionInit<G>) - Method in class io.jenetics.ext.engine.CyclicEngine
stream(Supplier<EvolutionStart<G, C>>) - Method in class io.jenetics.ext.engine.ConcatEngine
stream(Supplier<EvolutionStart<G, C>>) - Method in class io.jenetics.ext.engine.CyclicEngine

T

toArray() - Method in class io.jenetics.ext.util.Tree.Path: Return the path as int[] array.
toISeq() - Method in class io.jenetics.ext.moea.ParetoFront: Return the elements of this pareto-front as ISeq.
toParenthesesString() - Method in interface io.jenetics.ext.util.Tree: Return a compact string representation of the given tree.
toParenthesesString(Function<? super V, String>) - Method in interface io.jenetics.ext.util.Tree: Return a compact string representation of the given tree.
toParetoFront() - Static method in class io.jenetics.ext.moea.ParetoFront: Return a pareto-front collector.
toParetoFront(Comparator<? super T>) - Static method in class io.jenetics.ext.moea.ParetoFront: Return a pareto-front collector with the given pareto dominance measure.
toParetoSet() - Static method in class io.jenetics.ext.moea.MOEA: Collector of Phenotype objects, who's (multi-objective) fitness value is part of the pareto front.
toParetoSet(IntRange) - Static method in class io.jenetics.ext.moea.MOEA: Collector of Phenotype objects, who's (multi-objective) fitness value is part of the pareto front.
toParetoSet(IntRange, Comparator<? super C>, ElementComparator<? super C>, ElementDistance<? super C>, ToIntFunction<? super C>) - Static method in class io.jenetics.ext.moea.MOEA: Collector of Phenotype objects, who's (multi-objective) fitness value is part of the pareto front.
toString() - Method in class io.jenetics.ext.AbstractTreeGene
toString() - Method in class io.jenetics.ext.BigIntegerGene
toString() - Method in class io.jenetics.ext.rewriting.TreeMatchResult
toString() - Method in class io.jenetics.ext.rewriting.TreePattern
toString() - Method in class io.jenetics.ext.rewriting.TreePattern.Val
toString() - Method in class io.jenetics.ext.rewriting.TreePattern.Var
toString() - Method in class io.jenetics.ext.rewriting.TreeRewriteRule
toString() - Method in class io.jenetics.ext.rewriting.TRS
toString() - Method in class io.jenetics.ext.SimulatedBinaryCrossover
toString() - Method in class io.jenetics.ext.SingleNodeCrossover
toString() - Method in class io.jenetics.ext.util.FlatTreeNode
toString() - Method in class io.jenetics.ext.util.Tree.Path
toString() - Method in class io.jenetics.ext.util.TreeNode
toString() - Method in class io.jenetics.ext.WeaselMutator
toString() - Method in class io.jenetics.ext.WeaselSelector
toString(Tree<?, ?>) - Static method in interface io.jenetics.ext.util.Tree: Return a string representation of the given tree, like the following example.
tree() - Method in class io.jenetics.ext.rewriting.TreeMatcher: Return the matching tree.
tree() - Method in class io.jenetics.ext.rewriting.TreeMatchResult: The node (tree), which has been matched by some pattern.
Tree<V,T extends Tree<V,T>> - Interface in io.jenetics.ext.util: General purpose tree structure.
TREE - Static variable in class io.jenetics.ext.util.TreeFormatter: Formats a given tree to a tree string representation.
Tree.Path - Class in io.jenetics.ext.util: This class represents the path to child within a given tree.
TreeChromosome<A,G extends TreeGene<A,G>> - Interface in io.jenetics.ext: Chromosome for tree shaped genes.
TreeCrossover<G extends TreeGene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: Abstract implementation of tree base crossover recombinator.
TreeCrossover(double) - Constructor for class io.jenetics.ext.TreeCrossover: Constructs an tree crossover with a given recombination probability.
TreeFormatter - Class in io.jenetics.ext.util: Definition of different tree formatter strategies.
TreeFormatter() - Constructor for class io.jenetics.ext.util.TreeFormatter
TreeGene<A,G extends TreeGene<A,G>> - Interface in io.jenetics.ext: Representation of tree shaped gene.
TreeMatcher<V> - Class in io.jenetics.ext.rewriting: Implementation of a pattern based tree matcher.
TreeMatchResult<V> - Class in io.jenetics.ext.rewriting: The result of a tree match operation.
TreeMutator<A,G extends TreeGene<A,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: Abstract class for mutating tree chromosomes.
TreeMutator() - Constructor for class io.jenetics.ext.TreeMutator
TreeMutator(double) - Constructor for class io.jenetics.ext.TreeMutator
TreeNode<T> - Class in io.jenetics.ext.util: A general purpose node in a tree data-structure.
TreePattern<V> - Class in io.jenetics.ext.rewriting: This class serves two purposes.
TreePattern(Tree<TreePattern.Decl<V>, ?>) - Constructor for class io.jenetics.ext.rewriting.TreePattern: Create a new tree-pattern object from the given pattern tree.
TreePattern.Decl<V> - Class in io.jenetics.ext.rewriting: A sealed class, which constitutes the nodes of a pattern tree.
TreePattern.Val<V> - Class in io.jenetics.ext.rewriting: This class represents a constant pattern value, which can be part of a whole sub-tree.
TreePattern.Var<V> - Class in io.jenetics.ext.rewriting: Represents a placeholder (variable) for an arbitrary sub-tree.
TreeRewriteAlterer<A,G extends TreeGene<A,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: This alterer uses a TreeRewriter for altering the TreeChromosome.
TreeRewriteAlterer(TreeRewriter<A>) - Constructor for class io.jenetics.ext.TreeRewriteAlterer: Create a new alterer with the given rewriter.
TreeRewriteAlterer(TreeRewriter<A>, double) - Constructor for class io.jenetics.ext.TreeRewriteAlterer: Create a new alterer with the given rewriter.
TreeRewriteAlterer(TreeRewriter<A>, int) - Constructor for class io.jenetics.ext.TreeRewriteAlterer: Create a new alterer with the given rewriter and given rewrite limit.
TreeRewriteAlterer(TreeRewriter<A>, int, double) - Constructor for class io.jenetics.ext.TreeRewriteAlterer: Create a new alterer with the given rewriter and given rewrite limit.
TreeRewriter<V> - Interface in io.jenetics.ext.rewriting: Interface for rewriting a given tree.
TreeRewriteRule<V> - Class in io.jenetics.ext.rewriting: Represents a tree rewrite rule.
TreeRewriteRule(TreePattern<V>, TreePattern<V>) - Constructor for class io.jenetics.ext.rewriting.TreeRewriteRule: Create a new rewrite rule from the given matching (left) and replacement (right) pattern.
trim(int, ElementComparator<? super T>, ElementDistance<? super T>, ToIntFunction<? super T>) - Method in class io.jenetics.ext.moea.ParetoFront: Trims this pareto front to the given size.
TRS<V> - Class in io.jenetics.ext.rewriting: This class represents a Tree Rewrite System, which consists of a set of Tree Rewrite Rules.
TRS(ISeq<TreeRewriteRule<V>>) - Constructor for class io.jenetics.ext.rewriting.TRS: Create a new TRS from the given rewrite rules.

U

UFTournamentSelector<G extends Gene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext.moea: Unique fitness based tournament selection.
UFTournamentSelector(Comparator<? super C>, ElementComparator<? super C>, ElementDistance<? super C>, ToIntFunction<? super C>) - Constructor for class io.jenetics.ext.moea.UFTournamentSelector: Creates a new UFTournamentSelector with the functions needed for handling the multi-objective result type C.

V

value() - Method in class io.jenetics.ext.rewriting.TreePattern.Val
value() - Method in interface io.jenetics.ext.TreeGene
value() - Method in class io.jenetics.ext.util.FlatTreeNode
value() - Method in interface io.jenetics.ext.util.Tree: Return the value of the current Tree node.
value() - Method in class io.jenetics.ext.util.TreeNode: Return the node value
value(T) - Method in class io.jenetics.ext.util.TreeNode: Sets the user object for this node.
vars() - Method in class io.jenetics.ext.rewriting.TreeMatchResult: The variables involved while matching the tree TreeMatchResult.tree().
vars() - Method in class io.jenetics.ext.rewriting.TreePattern: Return the unmodifiable set of variables, defined in this pattern.
Vec<T> - Interface in io.jenetics.ext.moea: The Vec interface represents the fitness result of a multi-objective fitness function.
VecFactory<T> - Interface in io.jenetics.ext.moea: This interface allows to create vector object from a given array type T.

W

WeaselMutator<G extends Gene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: Mutator implementation which is part of the Weasel program algorithm.
WeaselMutator() - Constructor for class io.jenetics.ext.WeaselMutator: Create a new weasel mutator with the default mutation probability of 0.05.
WeaselMutator(double) - Constructor for class io.jenetics.ext.WeaselMutator: Create a new weasel mutator with the given mutation probability.
WeaselProgram<G extends Gene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: Configures the evolution engine to execute the Weasel program algorithm.
WeaselProgram() - Constructor for class io.jenetics.ext.WeaselProgram: Create a new weasel program setup with the default mutation probability of 0.05.
WeaselProgram(double) - Constructor for class io.jenetics.ext.WeaselProgram: Create a new weasel program setup with the give mutation probability.
WeaselSelector<G extends Gene<?,G>,C extends Comparable<? super C>> - Class in io.jenetics.ext: Selector implementation which is part of the Weasel program algorithm.
WeaselSelector() - Constructor for class io.jenetics.ext.WeaselSelector

A B C D E F G H I L M N O P R S T U V W
All Classes All Packages