Survival selection to find the next parent set. More...
#include <shark/Algorithms/DirectSearch/Operators/Selection/ElitistSelection.h>
Public Member Functions | |
template<typename InIterator , typename OutIterator > | |
void | operator() (InIterator it, InIterator itE, OutIterator out, OutIterator outE) |
Selects individuals from the range of individuals. More... | |
template<typename Population > | |
void | operator() (Population &population, std::size_t mu) |
Selects individuals from the range of individuals. More... | |
Survival selection to find the next parent set.
Given a set of individuals, selects the mu best performing individuals. The elements are ordered using the given Ordering Relation
Definition at line 44 of file ElitistSelection.h.
|
inline |
Selects individuals from the range of individuals.
[in] | it | Iterator pointing to the first valid parent individual. |
[in] | itE | Iterator pointing to the first invalid parent individual. |
[in] | out | Iterator pointing to the first valid element of the output range. |
[in] | outE | Iterator pointing to the first invalid element of the output range. |
Definition at line 53 of file ElitistSelection.h.
|
inline |
Selects individuals from the range of individuals.
Instead of using an output range, surviving individuals are marked as selected.
[in] | population | The population where individuals are selected from |
[in] | mu | number of individuals to select |
Definition at line 73 of file ElitistSelection.h.
References SHARK_RUNTIME_CHECK.