moILSexplorer accept template with two arguments

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2314 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras 2011-07-11 08:30:27 +00:00
commit eabc158fba

View file

@ -1,31 +1,31 @@
/* /*
<t-moILSexplorer.cpp> <t-moILSexplorer.cpp>
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
Sébastien Verel, Arnaud Liefooghe, Jérémie Humeau Sébastien Verel, Arnaud Liefooghe, Jérémie Humeau
This software is governed by the CeCILL license under French law and This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can ue, abiding by the rules of distribution of free software. You can ue,
modify and/ or redistribute the software under the terms of the CeCILL modify and/ or redistribute the software under the terms of the CeCILL
license as circulated by CEA, CNRS and INRIA at the following URL license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info". "http://www.cecill.info".
In this respect, the user's attention is drawn to the risks associated In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software, 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 that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or 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 data to be ensured and, more generally, to use and operate it in the
same conditions as regards security. same conditions as regards security.
The fact that you are presently reading this means that you have had The fact that you are presently reading this means that you have had
knowledge of the CeCILL license and that you accept its terms. knowledge of the CeCILL license and that you accept its terms.
ParadisEO WebSite : http://paradiseo.gforge.inria.fr ParadisEO WebSite : http://paradiseo.gforge.inria.fr
Contact: paradiseo-help@lists.gforge.inria.fr Contact: paradiseo-help@lists.gforge.inria.fr
*/ */
#include <iostream> #include <iostream>
#include <cstdlib> #include <cstdlib>
@ -41,11 +41,10 @@ Contact: paradiseo-help@lists.gforge.inria.fr
#include <perturb/moMonOpPerturb.h> #include <perturb/moMonOpPerturb.h>
#include <acceptCrit/moAlwaysAcceptCrit.h> #include <acceptCrit/moAlwaysAcceptCrit.h>
class dummyMonOp: public eoMonOp<bitVector> { class dummyMonOp: public eoMonOp<bitVector> {
bool operator()(bitVector& _sol) { bool operator()(bitVector& _sol) {
_sol[0]=!_sol[0]; _sol[0] = !_sol[0];
return true; return true;
} }
@ -69,9 +68,9 @@ int main() {
moAlwaysAcceptCrit<bitNeighbor> accept; moAlwaysAcceptCrit<bitNeighbor> accept;
moILSexplorer<bitNeighbor> test(ls, perturb, accept); moILSexplorer<bitNeighbor, bitNeighbor> test(ls, perturb, accept);
assert(test.className()=="moILSexplorer"); assert(test.className() == "moILSexplorer");
assert(test.isContinue(sol)); assert(test.isContinue(sol));
assert(test.accept(sol)); assert(test.accept(sol));
@ -86,13 +85,12 @@ int main() {
test(sol); test(sol);
test.move(sol); test.move(sol);
for (unsigned int i=0; i<sol.size(); i++) for (unsigned int i = 0; i < sol.size(); i++)
assert(!sol[i]); assert(!sol[i]);
assert(sol.fitness()==0); assert(sol.fitness() == 0);
test(sol); test(sol);
std::cout << "[t-moILSexplorer] => OK" << std::endl; std::cout << "[t-moILSexplorer] => OK" << std::endl;
return EXIT_SUCCESS; return EXIT_SUCCESS;