# EO Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

eo1PtBitCrossover | Eo1PtBitXover --> classic 1-point crossover
eoAged< Object > | EoAge is a template class that adds an age to an object.\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor
eoAlgo< EOT > | This is a generic class for population-transforming algorithms
eoArithmeticCrossover | EoHypercubeCrossover --> uniform choice in hypercube == arithmetical with different values for each coordinate
eoAssembledFitnessAverageStat< EOT > | Average fitness values of a population, where the fitness is of type eoScalarAssembledFitness
eoAssembledFitnessBestStat< EOT > | Fitness values of best individuum in a population, where the fitness is of type eoScalarAssembledFitness
eoAtomExchange< Atom > | A helper class for choosing which genes to exchange
eoAverageStat< EOT > | Average fitness of a population
eoBestFitnessStat< EOT > | Best fitness of a population
eoBestSelect< EOT > | EoBestSelect: a selection method that always return the best (mainly for testing purposes)
eoBF< A1, A2, R > | Basic Binary Functor
BiasedNodeSelector | A node selector that does a specified number of rounds ignoring terminals
eoBinaryFunctorCounter< BinaryFunctor > | Generic counter class that counts the number of times a binary function is used
eoBinCloneOp< EOT > | Binary clone: two operands, only the first could be modified
eoBinGenOp< EOT > | Wrapper for binop: here we use select method of eoPopulator but we could also have an embedded selector to select the second parent
eoBinOp< EOType > | Binary genetic operator: subclasses eoOp, and defines basically the operator() with two operands, only the first one can be modified When defining your own, make sure that you return a boolean value indicating that you have changed the content
eoBit< FitT > | Implementation of bitstring chromosome
eoBitBitFlip | EoBitFlip --> changes 1 bit
eoBitGxOver< Chrom > | EoBitGxOver --> Npts crossover when bistd::string considered as a std::string of binary-encoded genes (exchanges genes) Is anybody still using it apart from historians ??? :-)
eoBitInversion< Chrom > | EoBitInversion: inverts the bits of the chromosome between an interval
eoBitMutation< Chrom > | EoBitMutation --> classical mutation
eoBitNext< Chrom > | EoBitNext --> next value when bitstring considered as binary value
eoBitOpFactory< EOT > | EO Factory
eoBitPrev< Chrom > | EoBitPrev --> previous value when bitstring treated as binary value
boolean_generator | The class boolean_generator can be used in the STL generate function to easily generate random booleans with a specified bias
eoBooleanGenerator | The class eoBooleanGenerator can be used in the STL generate function to easily generate random booleans with a specified bias
eoBooleanInit | The class eoBooleanInit can be used in the STL apply function to easily generate random booleans with a specified bias
eoBoolFlip | Simple boolean mutation - to be used in generic eoOp's
eoBranchMutation< FType, Node > | EoBranchMutation --> replace a subtree with a randomly created subtree
eoBreed< EOT > | Breeding: combination of selecting and transforming a population
eoCellularEasyEA< EOT > | The abstract cellular easy algorithm
eoCheckPoint< EOT > | EoCheckPoint is a container class
eoCMABreed< FitT > | TODO, handle bounds
eoCMAInit< FitT > | TODO, handle bounds
eoCollapseSubtreeMutation< FType, Node > | EoCollapseSubtree --> replace a subtree with a randomly chosen terminal
eoCombinedContinue< EOT > | Combined continuators - logical AND: Continues until one of the embedded continuators says halt!
eoCombinedInit< EOT > | Combined INIT: a proportional recombination of eoInit objects
eoCommaReplacement< EOT > | ES type of replacement strategy: ignore parents, truncate offspring
eoContinue< EOT > | Termination condition for the genetic algorithm Takes the population as input, returns true for continue, false for termination
eoCountedDynUpdate | An eoUpdater to update an eoUpdatable object every given tic
eoCountedStateSaver | EoUpdater that saves a state every given generations
Cov | Single covariance between two variates
eoCtrlCContinue< EOT > | Ctrl C handling: this eoContinue tells whether the user pressed Ctrl C
eoDetBitFlip< Chrom > | EoDetBitFlip --> changes exactly k bits
eoDeterministicSaDReplacement< EOT > | EoDeterministicSaDReplacement: replacement strategy that is just, in sequence saves best and kill worse from parents + saves best and kill worse from offspring + merge remaining (neither save nor killed) parents and offspring + reduce that merged population = returns reduced pop + best parents + best offspring
eoDeterministicSurviveAndDie< EOT > | An instance (theonly one as of today, Dec
eoDetSelect< EOT > | EoDetSelect selects many individuals determinisctically
eoDetTournamentSelect< EOT > | EoDetTournamentSelect: a selection method that selects ONE individual by deterministic tournament -MS- 24/10/99
eoDetTournamentTruncate< EOT > | Truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g
eoDetTournamentTruncateSplit< EOT > | ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g
eoDetTournamentWorthSelect< EOT, WorthT > | An instance of eoSelectPerf2Worth that does selection from the Worthes using a ..
eoDetUniformMutation< EOT > | EoDetUniformMutation --> changes exactly k values of the std::vector by uniform choice with range epsilon
eoDistance< EOT > | This is a generic class for distance functors: takes 2 things ane returns a double
eoDistribUpdater< EOT > | Base class for Distribution Evolution Algorithms within EO: the update rule of distribution
eoDistribution< EOT > | Abstract class for Distribution Evolution Algorithms within EO: the distribution itself
dMatrix | A helper class for Sharing - to hold distances
eoDominanceMap< EoType > | EoDominanceMap, utility class to calculate and maintain a map (std::vector<std::vector<bool> >) of pareto dominance statistics
eoDoubleExchange | Discrete crossover == exchange of values
eoDoubleIntermediate | Intermediate crossover == linear combination
eoDrawable< Object > | EoDrawable is a template class that adds a drawing interface to an object.\ Requisites for template instantiation are that the object must admit a default ctor and a copy ctor
Dummy | Test program for the general operator - millenium version! uses dummy individuals
eoDynSGATransform< EOT > | EoDynSGATransform: transforms a population using genetic operators
eoDynUpdater | A base class to actually update an eoUpdatable object
eoEasyEA< EOT > | An easy-to-use evolutionary algorithm; you can use any chromosome, and any selection transformation, merging and evaluation algorithms; you can even change in runtime parameters of those sub-algorithms
eoEDA< EOT > | EoEDA: Estimation of Distribution Algorithm within EO
eoEliteSequentialSelect< EOT > | All Individuals in order
eoElitism< EOT > | Straightforward elitism class, specify the number of individuals to copy into new geneneration or the rate w.r.t
EO< F > | EO is a base class for evolvable objects, that is, the subjects of evolution
eoEPReduce< EOT > | EP truncation method (some global stochastic tournament + sort) Softer selective pressure than pure truncate
eoEPReplacement< EOT > | EP type of replacement strategy: first add parents to population, then truncate using EP tournament
eoEsChromInit< EOT > | Random Es-chromosome initializer (therefore derived from eoInit)
eoEsFull< Fit > | The most complex evolutionary strategy representation
eoEsGlobalXover< EOT > | Gloabl crossover operator for ES genotypes
eoEsMutate< EOT > | ES-style mutation in the large
eoEsMutationInit | Initialize Mutation operator
eoEsSimple< Fit > | Simple Evolution Strategy
eoEsStandardXover< EOT > | Standard (i.e
eoEsStdev< Fit > | Evolutionary Strategy with a standard deviation per parameter
eoEvalContinue< EOT > | Continues until a number of evaluations has been made
eoEvalFunc< EOT > | Evaluate: takes one EO and sets its "fitness" property returning this fitness also
eoEvalFuncCounter< EOT > | Counts the number of evaluations actually performed, thus checks first if it has to evaluate.
eoEvalFuncPtr< EOT, FitT, FunctionArg > | EOEvalFuncPtr: This class takes an existing function pointer and converts it into a evaluation function class
eoExpansionMutation< FType, Node > | EoExpansionMutation --> replace a terminal with a randomly created subtree
eoExternalBinOp< F, External, ExternalEO > | Crossover of external struct, ctor expects a function of the following signature:
eoExternalEO< Fit, External > | Definition of an object that allows an external struct to be inserted in EO
eoExternalEvalFunc< F, External, ExternalEO > | Evaluation of external struct, ctor expects a function of the following signature:
eoExternalInit< F, External, ExternalEO > | Initialization of external struct, ctor expects a function of the following signature:
eoExternalMonOp< F, External, ExternalEO > | Mutation of external struct, ctor expects a function of the following signature:
eoExternalQuadOp< F, External, ExternalEO > | Crossover of external struct, ctor expects a function of the following signature:
eoF< R > | Basic Function
eoFactory< EOClass > | EO Factory
eoFDCFileSnapshot< EOT > | Specific class for FDCStat monitoring: As I failed to have FDC stat as an eoStat, this is the trick to put the 2 eoParam<std::vector<double> > into a monitor This class does nothing else
eoFDCStat< EOT > | The FDC computation - stores the values into eoValueParam<EOT,double> so they can be snapshot by some eoGnuplotSnapshot ..
eoFileMonitor | Prints statistics to file
eoFileSnapshot | Prints snapshots of fitnesses to a (new) file every N generations
eoFitContinue< EOT > | Fitness continuation:
eoFitnessScalingSelect< EOT > | EoFitnessScalingSelect: select an individual proportional to the linearly scaled fitness that is computed by the private eoLinearFitScaling object
eoFitnessStat< EOT, FitT > | The fitnesses of a whole population, as a vector
eoFlOr1ptBinOp< EOT > | The 1pt crossover (just in case someone wants it some day!)
eoFlOr1ptQuadOp< EOT > | The 1pt crossover (just in case someone wants it some day!)
eoFlOrAllAtomBinOp< EOT > | Bin Crossover using an Atom Crossover that is applied to a ALL components with given rate
eoFlOrAllAtomQuadOp< EOT > | Quad Crossover using an Atom Crossover
eoFlOrAllMutation< EOT > | Applies an atomic mutation to all the components with a given rate
eoFlOrKAtomBinOp< EOT > | Bin Crossover using an Atom Crossover that is applied to a FIXED NB of components
eoFlOrKAtomQuadOp< EOT > | Quad Crossover using an Atom Crossover that is applied to a FIXED NB of components
eoFlOrKMutation< EOT > | Applies an atomic mutation to a fixed number of components (1 by default)
eoFlOrUniformBinOp< EOT > | The uniform crossover - exchanges atoms uniformly !
eoFlOrUniformQuadOp< EOT > | The uniform crossover - exchanges atoms uniformly !
eoFunctorBase | Base class for functors to get a nice hierarchy diagram
eoFunctorBase::binary_function_tag | Tag to identify a binary function in compile time function selection functor_category
eoFunctorBase::procedure_tag | Tag to identify a procedure in compile time function selection functor_category
eoFunctorBase::unary_function_tag | Tag to identify a unary function in compile time function selection functor_category
eoFunctorStore | EoFunctorStore is a class that stores functors that are allocated on the heap
eoG3Replacement< EOT > | EoG3Replacement is an eoReplacement: - no strong elitism (is suppposed to be within a steady-state engine) - choose N (2) parents RANDOMLY - remove them from the parent population - merge offspring and the N removed parents - select best N of this merged population - put them back into parent population
eoGenContinue< EOT > | Generational continuator: continues until a number of generations is reached
eoGeneDelChooser< EOT > | A helper class for choosing which site to delete
eoGeneralBreeder< EOT > | Base class for breeders using generalized operators
eoGeneralIntBounds | A class that encapsulate all possible eoIntBounds
eoGeneralRealBounds | A class that encapsulate all possible eoIntBounds
eoGenerationalReplacement< EOT > | Generational replacement == swap populations
eoGenOp< EOT > | The base class for General Operators Subclass this operator is you want to define an operator that falls outside of the eoMonOp, eoBinOp, eoQuadOp classification
eoGnuplot | Base class for calls to gnuplot
eoGnuplot1DMonitor | Plot eoStat
eoGnuplot1DSnapshot | Plot stats through gnuplot
eoHammingDistance< EOT > | This is a generic class for L1 distance computation: assumes the 2 things are std::vectors of something that is double-castable For bitstrings, this is the Hamming distance
eoHoistMutation< FType, Node > | EoHoistMutation --> replace the individual with one of its subtree's
eoHowMany | A helper class, to determine a number of individuals from another one Typically, is used in selection / replacement procedures, e.g
eoIncrementor< T > | EoUpdater that simply increments a counter
eoIncrementorParam< T > | EoUpdater that is an eoValueParam (and thus OWNS its counter) Mandatory for generation counter in make_checkpoint
eoInit< EOT > | Base (name) class for Initialization of chromosomes, used in a population contructor
eoInitAdaptor< EOT > | EoInitAdaptor changes the place in the hierarchy from eoInit to eoMonOp
eoInitFixedLength< EOT > | Initializer for fixed length representations with a single type
eoInitGenerator< EOT > | Turning an eoInit into a generator probably we should only use genrators - and suppress eoInit ??? MS - July 2001
eoInitVariableLength< EOT > | Initializer for variable length representations with a single type
eoInitVirus< FitT > | Initializer for binary chromosome with MGE
eoInitVirus1bit< FitT > | Inits the virus with one bit to the left set to one
eoInnerExchangeQuadOp< EOT > | Crossover using an AtomCrossover
eoIntAboveBound | An eoIntBound bounded from above only
eoIntBelowBound | EoIntBound bounded from below only
eoIntBounds | Defines bound classes for real numbers
eoIntInterval | Fully bounded eoIntBound == interval
eoIntNoBounds | A default class for unbounded variables
eoInvalidateBinOp< EOT > | One of the invalidator operators
eoInvalidateMonOp< EOT > | One of the invalidator operators
eoInvalidateQuadOp< EOT > | One of the invalidator operators
eoLinearFitScaling< EOT > | An instance of eoPerf2Worth COmputes the linearly scaled fitnesses with given selective pressure Pselect(Best) == pressure/sizePop Pselect(average) == 1.0/sizePop truncate negative values to 0 -
eoLinearRandomSplit< EOT > | Random truncation - linear version
eoLinearTruncate< EOT > | Truncate class that does not sort, but repeatidely kills the worse
eoLinearTruncateSplit< EOT > | ReduceSplit class that does not sort, but repeatidely kills the worse
MemPool | Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000
gp_parse_tree::MemPool | Pool allocator for the subtree and parse tree classes (homebrew and not compliant to ANSI allocator requirements) (c) copyright Maarten Keijzer 1999, 2000
eoMerge< Chrom > | EoMerge: Base class for elitist replacement algorithms
eoMergeReduce< EOT > | EoMergeReduce: abstract replacement strategy that is just an application of an embedded merge, followed by an embedded reduce
eoMGGReplacement< EOT > | EoMGGReplacement is an eoReplacement: - choose N (2) parents RANDOMLY - remove them from the parent population - select best offspring, add to parents - merge (other?) offspring and the N removed parents - select best N-1 of this merged population (detTournament only at the moment) - put them back into parent population
MinimizingTraits | Test program for Pareto Fitness
eoMOFitnessStat< EOT, PartFitT > | For multi-objective fitness, we need to translate a stat<vector<double> > into a vector<stat>, so each objective gets a seperate stat
eoMonCloneOp< EOT > | Mon clone: one argument
eoMonGenOp< EOT > | Wrapper for eoMonOp
eoMonitor | The abstract monitor class is a std::vector of parameter pointers
eoMonOp< EOType > | EoMonOp is the monary operator: genetic operator that takes only one EO
eoNDPlusReplacement< EOT, WorthT > | An elitist non-dominated sorted replacement scheme
eoNDSorting< EOT > | Non dominated sorting, it *is a* std::vector of doubles, the integer part is the rank (to which front it belongs), the fractional part the niching penalty or distance penalty or whatever penalty you want to squeeze into the bits
eoNDSorting< EOT >::DummyEO | Used in fast nondominated sorting DummyEO is just a storage place for fitnesses and to store the original index
eoNDSorting_I< EOT > | The original Non Dominated Sorting algorithm from Srinivas and Deb
eoNDSorting_II< EOT > | Fast Elitist Non-Dominant Sorting Genetic Algorithm
negexp_generator< T > | The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles
eoNegExpGenerator< T > | The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles
eoNegExpInit< T > | The class negexp_generator can be used in the STL generate function to easily generate negative exponential distributed floats and doubles
NodeSelector | Base class for selecting nodes
eoNoElitism< EOT > | No elite
eoNoPerf2Worth< EOT > | A dummy perf2worth, just in case you need it
normal_generator< T > | The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles
eoNormalGenerator< T > | The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles
eoNormalInit< T > | The class normal_generator can be used in the STL generate function to easily generate gaussian distributed floats and doubles
eoNormalMutation< EOT > | Simple normal mutation of a std::vector of real values
eoNormalVecMutation< EOT > | Simple normal mutation of a std::vector of real values
eoNoSelect< EOT > | EoNoSelect: returns all individual in order WITHOUT USING FITNESS!!! looping back to the beginning when exhasuted
eoNPtsBitXover< Chrom > | EoNPtsBitXover --> n-point crossover
eoNthElementFitnessStat< EOT > | The n_th element fitness in the population (see eoBestFitnessStat)
eoObject | EoObject used to be the base class for the whole hierarchy, but this has changed
eoOneFifthMutation< EOT > | Dynamic version: just say it is updatable - and write the update() method! here the 1 fifth rule: count the proportion of successful mutations, and increase sigma if more than threshold (1/5 !)
eoOneMax< FitT > | Always write a comment in this format before class definition if you want the class to be documented by Doxygen
eoOneMaxEvalFunc< EOT > | Always write a comment in this format before class definition if you want the class to be documented by Doxygen
eoOneMaxInit< GenotypeT > | Always write a comment in this format before class definition if you want the class to be documented by Doxygen
eoOneMaxMutation< GenotypeT > | Always write a comment in this format before class definition if you want the class to be documented by Doxygen
eoOneMaxQuadCrossover< GenotypeT > | Always write a comment in this format before class definition if you want the class to be documented by Doxygen
eoOp< EOType > | Abstract data types for EO operators
eoOpContainer< EOT > | EoOpContainer is a base class for the sequential and proportional selectors It takes care of wrapping the other operators, and deleting stuff that it has allocated
eoOpSelMason< eoClass > | EO Mason, or builder, for operator selectors
eoParam | EoParam: Base class for monitoring and parsing parameters
eoParameterLoader | Parameter saving and loading
eoParamParamType | Another helper class for parsing parameters like Keyword(arg1, arg2, ...)
eoParetoFitness< FitnessTraits > | EoParetoFitness class: std::vector of doubles with overloaded comparison operators
eoParetoFitnessTraits | EoFitnessTraits: a traits class to specify the number of objectives and which one are maximizing or not See test/t-eoParetoFitness for its use
eoParetoOneConstraintFitness< FitnessTraits > | EoParetoOneConstraintFitness class: std::vector of doubles + constraint value
eoParetoRanking< EOT > | Straightforward pareto ranking
eoParser | EoParser: command line parser and configuration file reader This class is persistent, so it can be stored and reloaded to restore parameter settings
eoParseTree< FType, Node > | Implementation of parse-tree for genetic programming
eoParseTreeDepthInit< FType, Node > | EoParseTreeDepthInit : the initializer class for eoParseTree
eoPBILAdditive< EOT > | Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96)
eoPBILDistrib< EOT > | Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 96)
eoPBILOrg< EOT > | Distribution Class for PBIL algorithm (Population-Based Incremental Learning, Baluja and Caruana 95)
eoPerf2Worth< EOT, WorthT > | Base class to transform raw fitnesses into fitness for selection
eoPerf2Worth< EOT, WorthT >::compare_worth | Helper class used to sort indices into populations/worths
eoPerf2WorthCached< EOT, WorthT > | Perf2Worth with fitness cache
eoPerf2WorthCached< EOT, WorthT >::compare_worth | Helper class used to sort indices into populations/worths
eoPersistent | An persistent object that knows how to write (through functions inherited from eoPrintable#) and read itself
eoPlus< EOT > | Very elitist class, copies entire population into next gen
eoPlusReplacement< EOT > | ES type of replacement strategy: first add parents to population, then truncate
eoPointMutation< FType, Node > | EoPointMutation --> replace a Node with a Node of the same arity
eoPop< EOT > | A std::vector of EO object, to be used in all algorithms (selectors, operators, replacements, ...)
eoPop< EOT >::Cmp | Helper struct for comparing on pointers
eoPop< EOT >::Ref | Helper struct for getting a pointer
eoPopAlgo< EOT > | For all "population transforming" algos ..
eoPopEvalFunc< EOT > | EoPopEvalFunc: This abstract class is for GLOBAL evaluators of a population after variation
eoPopLoopEval< EOT > | EoPopLoopEval: an instance of eoPopEvalFunc that simply applies a private eoEvalFunc to all offspring
eoPopStat< EOT > | Thanks to MS/VC++, eoParam mechanism is unable to handle std::vectors of stats
eoPopulator< EOT > | EoPopulator is a helper class for general operators eoGenOp It is an eoPop but also behaves like an eoPop::iterator as far as operator* and operator++ are concerned
eoPrintable | Base class for objects that can print themselves (printOn#)
eoProcedureCounter< Procedure > | Generic counter class that counts the number of times a procedure is used
eoPropCombinedBinOp< EOT > | COmbined Binary genetic operator: operator() has two operands, only the first one can be modified
eoPropCombinedMonOp< EOT > | EoMonOp is the monary operator: genetic operator that takes only one EO
eoPropCombinedQuadOp< EOT > | Combined quad genetic operator: operator() has two operands, both can be modified
eoPropGAGenOp< EOT > | *************************************************************************** eoPropGAGenOp (for Simple GA, but Proportional) choice between Crossover, mutation or cloining with respect to given relatve weights
eoProportionalOp< EOT > | The proportional versions: easy!
eoProportionalSelect< EOT > | EoProportionalSelect: select an individual proportional to her stored fitness value
eoQuad2BinOp< EOT > | Turning an eoQuadOp into an eoBinOp: simply don't touch the second arg!
eoQuadCloneOp< EOT > | Quad clone: two operands, both could be modified - but are not!
eoQuadDistance< EOT > | This is a generic class for Euclidain distance (L2 norm) computation: assumes the 2 things are std::vectors of something that is double-castable
eoQuadGenOp< EOT > | Wrapper for quadop: easy as pie
eoQuadOp< EOType > | Quad genetic operator: subclasses eoOp, and defines basically the operator() with two operands, both can be modified
random_generator< T > | The class random_generator can be used in the STL generate function to easily generate random ints either between [0, _max) if only one value (_max) is given to the ctor or in [_min,_max) if 2 values are given (_min, _max)
RandomNodeSelector | Select nodes uniformly
eoRandomReduce< EOT > | Random truncation
eoRandomSelect< EOT > | EoRandomSelect: a selection method that selects ONE individual randomly
eoRandomSplit< EOT > | Random truncation - batch version
eoRanking< EOT > | An instance of eoPerfFromWorth COmputes the ranked fitness: fitnesses range in [m,M] with m=2-pressure/popSize and M=pressure/popSize
eoRankingSelect< EOT > | EoRankingSelect: select an individual by roulette wheel on its rank is an eoRouletteWorthSelect, i.e
eoReal< FitT > | EoReal: implementation of simple real-valued chromosome
eoRealAboveBound | An eoRealBound bounded from above only
eoRealBaseVectorBounds | Vector type for bounds (see eoRealBounds.h for scalar types) ------------ Class eoRealVectorBounds implements the std::vectorized version: it is basically a std::vector of eoRealBounds * and forwards all request to the elements of the std::vector
eoRealBelowBound | EoRealBound bounded from below only
eoRealBounds | Defines bound classes for real numbers
eoRealInitBounded< EOT > | Simple initialization for any EOT that derives from std::vector<double> uniformly in some bounds
eoRealInterval | Fully bounded eoRealBound == interval
eoRealNoBounds | A default class for unbounded variables
eoRealUxOver | EoRealUxOver --> Uniform crossover, also termed intermediate crossover
eoRealVectorBounds | Now a derived class, for parser reading It holds some of the bounds (and destroy them when dying)
eoRealVectorNoBounds | Dummy unbounded eoRealVectorBounds: usefull if you don't need bounds! everything is inlined
eoReduce< EOT > | EoReduce: .reduce the new generation to the specified size At the moment, limited to truncation - with 2 different methods, one that sorts the whole population, and one that repeatidely kills the worst
eoReduceMerge< EOT > | EoReduceMerge: Replacement strategies that start by reducing the parents, then merge with the offspring
eoReduceMergeReduce< EOT > | EoReduceMergeReduce is an eoReplacement: - saves possible elite parents - reduces rest of parents - reduces offspring - merges reduced populations - reduces resulting merged pop if necessary
eoReduceSplit< EOT > | EoReduceSplit: reduce the pop to the specified size AND eventually returns the eliminated guys
eoReplacement< EOT > |
eoRndGenerator< T > | By popular demand re-introducing a base class for a family of random number generators
eoRng | Random Number Generator
eoRouletteWorthSelect< EOT, WorthT > | An instance of eoSelectPerf2Worth that does selection from the Worthes using a ..
eoScalarFitness< ScalarType, Compare > | EoScalarFitness<ScalarType, Compare = less<ScalarType> >: Wraps a scalar fitness values such as a double or int, with the option of maximizing (using less<ScalarType>) or minimizing (using greater<ScalarType>)
eoScalarFitnessAssembled< ScalarType, Compare, FitnessTraits > | Implements fitness as std::vector, storing all values that might occur during fitness assembly
eoScalarFitnessAssembledTraits | Defines properties of eoScalarFitnessAssembled
eoScalarFitnessStat< EOT, FitT > | The fitnesses of a whole population, as a std::vector
eoSecondMomentStats< EOT > | Average fitness + Std
eoSegmentCrossover< EOT > | EoSegmentCrossover --> uniform choice in segment == arithmetical with same value along all coordinates
eoSelBinGenOp< EOT > | Wrapper for eoBinOp with a selector
eoSelect< EOT > | EoSelect selects a number of individuals from the first argument and puts it in the second
eoSelectFactory< EOT > | EO Factory.An instance of the factory class to create selectors, that is, eoSelect objects
eoSelectFromWorth< EOT, WorthType > | Selects one element from a population (is an eoSelectOne) but the selection is based on a std::vector of Worth that is different from the fitnesses (e.g
eoSelectivePopulator< EOT > | SelectivePopulator an eoPoplator that uses an eoSelectOne to select guys
eoSelectMany< EOT > | EoSelectMany selects many individuals using eoSelectOne as it's mechanism
eoSelectNumber< EOT > | EoSelectNumber selects many individuals using eoSelectOne as it's mechanism
eoSelectOne< EOT, WorthT > | EoSelectOne selects only one element from a whole population
eoSelectPerc< EOT > | EoSelectPerc selects many individuals using eoSelectOne as it's mechanism
eoSelectTransform< EOT > | Embedded select, followed by an embedded transform
eoSeqPopulator< EOT > | SeqPopulator: an eoPopulator that sequentially goes through the population is supposed to be used after a batch select of a whole bunch or genitors
eoSequentialOp< EOT > | Sequential selection: note the mark, rewind, unmark cycle here operators are repeatedly applied on the same individual(s) not all too elegant, but it sort of works..
eoSequentialSelect< EOT > | All Individuals in order
eoSGA< EOT > | The Simple Genetic Algorithm, following Holland and Goldberg
eoSGAGenOp< EOT > | *************************************************************************** eoSGAGenOp (for Simple GA) mimicks the usual crossover with proba pCross + mutation with proba pMut inside an eoGeneralOp It does it exactly as class eoSGATransform, i.e
eoSGATransform< EOT > | EoSGATransform: transforms a population using genetic operators
eoSharing< EOT > | Sharing is a perf2worth class that implements Goldberg and Richardson's basic sharing see eoSharingSelect for how to use it and test/t-eoSharing.cpp for a sample use of both
eoSharingSelect< EOT > | EoSharingSelect: select an individual by roulette wheel on its SHARED fitness
eoSimpleEDA< EOT > | EoSimpleEDA: a very simple Estimation of Distribution Algorithm
eoSortedPopStat< EOT > | Thanks to MS/VC++, eoParam mechanism is unable to handle std::vectors of stats
eoSortedStat< EOT, ParamType > | The actual class that will be used as base for all statistics that need to be calculated over the sorted population It's an eoSortedStatBase AND an eoValueParam so it can be used in Monitors
eoSortedStatBase< EOT > | Base class for statistics calculated over a sorted snapshot of the population
eoSSGADetTournamentReplacement< EOT > | SSGA deterministic tournament replacement
eoSSGAStochTournamentReplacement< EOT > | SSGA stochastic tournament replacement
eoSSGAWorseReplacement< EOT > | SSGA replace worst
eoStat< EOT, T > | The actual class that will be used as base for all statistics that need to be calculated over the (unsorted) population It is an eoStatBase AND an eoValueParam so it can be used in Monitors
eoStatBase< EOT > | Base class for all statistics that need to be calculated over the (unsorted) population (I guess it is not really necessary? MS
eoState | EoState can be used to register derivants of eoPersistent
eoState::loading_error | Loading error thrown when nothing seems to work
eoStBranchMutation< FType, Node > | EoStBranchMutation --> replace a strongly typed subtree with a randomly created strongly typed subtree
eoStdoutMonitor | Prints statistics to stdout
eoSteadyFitContinue< EOT > | A continuator: does a minimum number of generations, then stops whenever a given number of generations takes place without improvement
eoStHoistMutation< FType, Node > | EoStHoistMutation --> replace the individual with one of its strongly typed subtree's
eoSTLBF< A1, A2, R > | Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e
eoSTLF< R > | Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e
eoSTLUF< A1, R > | Generic set of classes that wrap an eoF, eoUF or eoBF so that they have the copy semantics the STL functions usually require (i.e
eoStochasticUniversalSelect< EOT > | EoStochasticUniversalSelect: select an individual proportional to her stored fitness value, but in contrast with eoStochasticUniversalSelect, get rid of most finite sampling effects by doing all selections in one go, using a single random number
eoStochTournamentSelect< EOT > | EoStochTournamentSelect: a selection method that selects ONE individual by binary stochastic tournament -MS- 24/10/99
eoStochTournamentTruncate< EOT > | Truncate class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g
eoStochTournamentTruncateSplit< EOT > | ReduceSplit class based on a repeated deterministic (reverse!) tournament To be used in SSGA-like replacements (e.g
eoStochTournamentWorthSelect< EOT, WorthT > | An instance of eoSelectPerf2Worth that does selection from the Worthes using a ..
eoStParseTreeDepthInit< FType, Node > | EoStParseTreeDepthInit : the initializer class for strongly typed tree-based genetic programming
eoStPointMutation< FType, Node > | EoStPointMutation --> replace a Node with a Node of the same arity and type
eoString< fitnessT > | Adaptor that turns an STL std::string into an EO
eoStSubtreeXOver< FType, Node > | EoStSubtreeXOver --> subtree xover for strongly typed tree-based genetic programming
eoSubtreeXOver< FType, Node > | EoSubtreeXOver --> subtree xover
eoSurviveAndDie< EOT > | EoSurviveAndDie A pure abstract class, to store the howmany's
eoSymInit< EoType > | Default initializer, Koza style
T_pickle_suite< T > | Implements pickle support for eoPersistent derivatives
eoTimeCounter | An eoStat that simply gives the user time since first generation It has to be tempatized by EOT because it must be an eoStat
eoTimedDynUpdate | An eoUpdater to update an eoUpdatable object every given time interval
eoTimedMonitor | Holds a collection of monitors and only fires them when a time limit has been reached
eoTimedStateSaver | EoUpdater that saves a state every given time interval
eoTimeVaryingLoopEval< EOT > | EoPopLoopEval: an instance of eoPopEvalFunc that simply applies a private eoEvalFunc to all offspring AND ALL PARENTS as the fitness is supposed here to vary
eoTransform< EOT > | EoTransform transforms a population by applying genetic operators on it
eoTruncate< EOT > | Truncation method using sort
eoTruncatedSelectMany< EOT > | EoTruncatedSelectMany selects many individuals using eoSelectOne as it's mechanism
eoTruncatedSelectOne< EOT > | EoTruncatedSelectOne selects one individual using eoSelectOne as it's mechanism
eoTruncateSplit< EOT > | Deterministic truncation method using sort
eoTruncSelect< EOT > | EoTruncSelect selects individuals after truncating the population using eoSelectOne as it's mechanism
eoUBitXover< Chrom > | EoUBitXover --> classic Uniform crossover
eoUF< A1, R > | Basic Unary Functor
UF_random_generator< T > | Another class random_generator that can be used in the STL random_shuffle function (see eoPop::shuffle): its operator() takes an unsigned argument m and must return an unsigned uniformly distributed in [0,m}
eoUnaryFunctorCounter< UnaryFunctor > | Generic counter class that counts the number of times a unary function is used
uniform_generator< T > | The class uniform_generator can be used in the STL generate function to easily generate random floats and doubles either in [0, _max) if only 1 value (_max) is given (or none, as _max defaults to 1.0) or in [_min,_max) if 2 values are given (_min, _max)
eoUniformAtomExchange< Atom > | Uniform crossover - well, not really, efficient for FixedLength
eoUniformGeneChooser< EOT > | Uniform choice of gene to delete
eoUniformGenerator< T > | The class eoUniform can be used in the STL generate function to easily generate random floats and doubles
eoUniformInit< T > | The class eoUniformInit can be used in the STL apply function to easily randomize floats and doubles
eoUniformMutation< EOT > | EoUniformMutation --> changes all values of the std::vector by uniform choice with range epsilon with probability p_change per variable
eoUpdatable | EoUpdatable is a generic class for adding updatation to an existing class Just says it has an update() method
eoUpdater | EoUpdater is a generic procudere for updating whatever you want
eoValueParam< ValueType > | EoValueParam<ValueType>: templatized derivation of eoParam
eoVariableParetoTraits | EoVariableParetoTraits : an eoParetoFitnessTraits whose characteristics can be set at run-time (nb objectives and min/max's) Why bother? For didactical purposes (and EASEA implementation :-)
eoVector< FitT, GeneType > | Base class for fixed length chromosomes, just derives from EO and std::vector and redirects the smaller than operator to EO (fitness based comparison)
VirusBitFlip< FitT > | VirusBitFlip --> changes 1 bit
VirusShiftMutation< FitT > | Works for 1-bit virus; shifts the one to the right or left
eoVlAddMutation< EOT > | Addition of a gene Is inserted at a random position - so can be applied to both order-dependent and order-independent
eoVlAtomExchangeQuadOp< EOT > | Exchange Crossover using an AtomExchange
eoVlDelMutation< EOT > | Deletion of a gene By default at a random position, but a "chooser" can be specified can of course be applied to both order-dependent and order-independent
eoVlUniformBinOp< EOT > | Direct Uniform Exchange of genes for Variable Length, BINARY version
eoVlUniformQuadOp< EOT > | Direct Uniform Exchange of genes (obsolete, already :-) stays there for historical reasons
eoWeakElitistReplacement< EOT > | EoWeakElitistReplacement: a wrapper for other replacement procedures