nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

feat: add a sequential select that returns the best individual

Browse source
This commit is contained in:
Johann Dreo 2019-12-10 11:24:39 +01:00
commit be782f8cfb
1 changed files with 21 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

23
eo/src/eoSequentialSelect.h
View file

@ -51,7 +51,8 @@ always returns individuals from best to worst
@ingroup Selectors @ingroup Selectors
*/ */
template <class EOT> class eoSequentialSelect: public eoSelectOne<EOT> template <class EOT>
class eoSequentialSelect: public eoSelectOne<EOT>
{ {
public: public:
/** Ctor: sets the current pter to numeric_limits<unsigned>::max() so init will take place first time /** Ctor: sets the current pter to numeric_limits<unsigned>::max() so init will take place first time
@ -60,7 +61,7 @@ template <class EOT> class eoSequentialSelect: public eoSelectOne<EOT>
eoSequentialSelect(bool _ordered = true) eoSequentialSelect(bool _ordered = true)
: ordered(_ordered), current(std::numeric_limits<unsigned>::max()) {} : ordered(_ordered), current(std::numeric_limits<unsigned>::max()) {}
void setup(const eoPop<EOT>& _pop) virtual void setup(const eoPop<EOT>& _pop)
{ {
eoPters.resize(_pop.size()); eoPters.resize(_pop.size());
if (ordered) // probably we could have a marker to avoid re-sorting if (ordered) // probably we could have a marker to avoid re-sorting
@ -86,6 +87,24 @@ private:
}; };
/** An eoSelectOne that returns the best individual each time it's called.
@ingroup Selectors
*/
template <class EOT>
class eoEliteSelect: public eoSequentialSelect<EOT>
{
public:
eoEliteSelect() :
eoSequentialSelect<EOT>(true)
{}
virtual const EOT& operator()(const eoPop<EOT>& pop)
{
this->setup(pop);
return pop[0]; // the best one
}
};
/** All Individuals in order /** All Individuals in order