d08a13581f
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@734 331e1502-861f-0410-8da2-ba01fb791d7f
73 lines
2.5 KiB
C++
73 lines
2.5 KiB
C++
/* <peoPSOReplacement.h>
|
|
*
|
|
* (c) OPAC Team, October 2007
|
|
*
|
|
* Clive Canape
|
|
*
|
|
* This software is governed by the CeCILL license under French law and
|
|
* abiding by the rules of distribution of free software. You can use,
|
|
* modify and/ or redistribute the software under the terms of the CeCILL
|
|
* license as circulated by CEA, CNRS and INRIA at the following URL
|
|
* "http://www.cecill.info".
|
|
*
|
|
* As a counterpart to the access to the source code and rights to copy,
|
|
* modify and redistribute granted by the license, users are provided only
|
|
* with a limited warranty and the software's author, the holder of the
|
|
* economic rights, and the successive licensors have only limited liability.
|
|
*
|
|
* In this respect, the user's attention is drawn to the risks associated
|
|
* with loading, using, modifying and/or developing or reproducing the
|
|
* software by the user in light of its specific status of free software,
|
|
* that may mean that it is complicated to manipulate, and that also
|
|
* therefore means that it is reserved for developers and experienced
|
|
* professionals having in-depth computer knowledge. Users are therefore
|
|
* encouraged to load and test the software's suitability as regards their
|
|
* requirements in conditions enabling the security of their systems and/or
|
|
* data to be ensured and, more generally, to use and operate it in the
|
|
* same conditions as regards security.
|
|
* The fact that you are presently reading this means that you have had
|
|
* knowledge of the CeCILL license and that you accept its terms.
|
|
*
|
|
* ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
|
* Contact: paradiseo-help@lists.gforge.inria.fr
|
|
* Contact: clive.canape@inria.fr
|
|
*/
|
|
|
|
#ifndef _peoPSOReplacement_h
|
|
#define _peoPSOReplacement_h
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
#include <eoPop.h>
|
|
#include <eoFunctor.h>
|
|
#include <eoMerge.h>
|
|
#include <eoReduce.h>
|
|
#include <eoReplacement.h>
|
|
#include <utils/eoHowMany.h>
|
|
|
|
template <class POT>
|
|
class peoPSOReplacement : public eoReplacement<POT>
|
|
{
|
|
public:
|
|
peoPSOReplacement(){}
|
|
|
|
void operator()(eoPop<POT>& _dest, eoPop<POT>& _source)
|
|
{
|
|
unsigned ind=0;
|
|
double best=_dest[0].best();
|
|
for(unsigned j=1;j<_dest.size();j++)
|
|
if(_dest[j].best() < best)
|
|
{
|
|
ind=j;
|
|
best=_dest[j].best();
|
|
}
|
|
if(_dest[ind].best() < _source[0].best())
|
|
{
|
|
_dest[ind].best(_source[0].best());
|
|
for(unsigned j=0;j<_dest[ind].size();j++)
|
|
_dest[ind].bestPositions[j]=_source[0].bestPositions[j];
|
|
}
|
|
}
|
|
};
|
|
#endif
|
|
|