|
EvolvingObjects
|
|
EvolvingObjects
|
A std::vector of EO object, to be used in all algorithms (selectors, operators, replacements, ...). More...
#include <eoPop.h>
Classes | |
| struct | Cmp |
| helper struct for comparing on pointers More... | |
| struct | Cmp2 |
| helper struct for comparing (EA or PSO) More... | |
| struct | GetFitness |
| struct | Ref |
| helper struct for getting a pointer More... | |
Public Types | |
| typedef EOT::Fitness | Fitness |
Public Member Functions | |
| eoPop () | |
| Default ctor. | |
| eoPop (unsigned _popSize, eoInit< EOT > &_chromInit) | |
| Ctor for the initialization of chromosomes. | |
| void | append (unsigned _newPopSize, eoInit< EOT > &_chromInit) |
| appends random guys at end of pop. | |
| eoPop (std::istream &_is) | |
| Ctor from an std::istream; reads the population from a stream, each element should be in different lines. | |
| virtual | ~eoPop () |
| Empty Dtor. | |
| void | sort (void) |
| sort the population. | |
| void | sort (std::vector< const EOT * > &result) const |
| creates a std::vector<EOT*> pointing to the individuals in descending order | |
| void | shuffle (void) |
| shuffle the population. | |
| void | shuffle (std::vector< const EOT * > &result) const |
| creates a std::vector<EOT*> pointing to the individuals in random order | |
| eoPop< EOT >::iterator | it_best_element () |
| returns an iterator to the best individual DOES NOT MOVE ANYBODY | |
| const EOT & | best_element () const |
| returns an iterator to the best individual DOES NOT MOVE ANYBODY | |
| const EOT & | worse_element () const |
| returns a const reference to the worse individual DOES NOT MOVE ANYBODY | |
| eoPop< EOT >::iterator | it_worse_element () |
| returns an iterator to the worse individual DOES NOT MOVE ANYBODY | |
| eoPop< EOT >::iterator | nth_element (int nth) |
| slightly faster algorithm than sort to find all individuals that are better than the nth individual. | |
| Fitness | nth_element_fitness (int which) const |
| returns the fitness of the nth element | |
| void | nth_element (int which, std::vector< const EOT * > &result) const |
| const nth_element function, returns pointers to sorted individuals up the the nth | |
| void | swap (eoPop< EOT > &other) |
| does STL swap with other pop | |
| virtual void | sortedPrintOn (std::ostream &_os) const |
| Prints sorted pop but does NOT modify it! | |
| virtual void | printOn (std::ostream &_os) const |
| Write object. | |
| virtual void | invalidate () |
| Invalidate the whole population. | |
Methods from eoObject | |
| virtual void | readFrom (std::istream &_is) |
| Read object. | |
| virtual std::string | className () const |
| Inherited from eoObject. | |
A std::vector of EO object, to be used in all algorithms (selectors, operators, replacements, ...).
We have no idea if a population can be some other thing that a std::vector, but if somebody thinks of it, this concrete implementation can be moved to "generic" and an abstract Population interface be provided.
The template can be instantiated with anything that accepts a "size" and eoInit derived object. in the ctor. EOT must also have a copy ctor, since temporaries are created and then passed to the eoInit object
| void eoPop< EOT >::append | ( | unsigned | _newPopSize, |
| eoInit< EOT > & | _chromInit | ||
| ) | [inline] |
appends random guys at end of pop.
Can be used to initialize it pop is empty
| _newPopSize | total population size |
| _chromInit | Initialization routine, produces EO's, needs to be an eoInit |
Definition at line 106 of file eoPop.h.
Referenced by do_make_pop().
sort the population.
Use this member to sort in order of descending Fitness, so the first individual is the best!
Definition at line 161 of file eoPop.h.
Referenced by eoCMABreed< FitT >::operator()(), eoRankMuSelect< EOT >::operator()(), eoTruncate< EOT >::operator()(), eoReduceMergeReduce< EOT >::operator()(), eoRanking< EOT >::operator()(), eoCheckPoint< EOT >::operator()(), eoPBILAdditive< EOT >::operator()(), eoTruncatedSelectMany< EOT >::operator()(), eoSequentialSelect< EOT >::setup(), eoPop< POT >::sort(), and eoPop< POT >::sortedPrintOn().
shuffle the population.
Use this member to put the population in random order
Definition at line 182 of file eoPop.h.
Referenced by eoRandomReduce< EOT >::operator()(), eoTruncatedSelectMany< EOT >::operator()(), eoRandomSplit< EOT >::operator()(), eoSequentialSelect< EOT >::setup(), and eoEliteSequentialSelect< EOT >::setup().
| eoPop<EOT>::iterator eoPop< EOT >::nth_element | ( | int | nth | ) | [inline] |
slightly faster algorithm than sort to find all individuals that are better than the nth individual.
INDIVIDUALS ARE MOVED AROUND in the pop.
Definition at line 265 of file eoPop.h.
Referenced by eoPop< POT >::nth_element(), eoPop< POT >::nth_element_fitness(), eoTruncateSplit< EOT >::operator()(), eoReduceMergeReduce< EOT >::operator()(), eoElitism< EOT >::operator()(), eoDeterministicSurviveAndDie< EOT >::operator()(), and eoTruncatedSelectOne< EOT >::setup().
| virtual void eoPop< EOT >::sortedPrintOn | ( | std::ostream & | _os | ) | const [inline, virtual] |
| virtual void eoPop< EOT >::printOn | ( | std::ostream & | _os | ) | const [inline, virtual] |
Write object.
It's called printOn since it prints the object _on_ a stream.
| _os | A std::ostream. |
Implements eoPrintable.
Read object.
The EOT class must have a ctor from a stream;
| _is | A std::istream. |
Implements eoPersistent.
Definition at line 348 of file eoPop.h.
Referenced by eoPop< POT >::eoPop().
1.7.6.1 
