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

Encore du nettoyage

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1814 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
jhumeau 2010-05-17 15:11:48 +00:00
commit 02e5cfb6c0
66 changed files with 987 additions and 1785 deletions
Download patch file Download diff file Expand all files Collapse all files

38
trunk/paradiseo-mo/test/t-moMonOpDiversification.cpp
View file

@ -38,37 +38,37 @@ Contact: paradiseo-help@lists.gforge.inria.fr
#include <eval/oneMaxEval.h>
class dummyMonOp: public eoMonOp<bitVector>{
class dummyMonOp: public eoMonOp<bitVector> {
bool operator()(bitVector& _sol){
_sol[0]=!_sol[0];
return true;
}
bool operator()(bitVector& _sol) {
_sol[0]=!_sol[0];
return true;
}
};
int main(){
int main() {
std::cout << "[t-moMonOpDiversification] => START" << std::endl;
std::cout << "[t-moMonOpDiversification] => START" << std::endl;
dummyMonOp op;
oneMaxEval<bitVector> eval;
dummyMonOp op;
oneMaxEval<bitVector> eval;
bitVector sol;
sol.push_back(1);
sol.push_back(0);
sol.push_back(1);
bitVector sol;
sol.push_back(1);
sol.push_back(0);
sol.push_back(1);
sol.fitness(5);
sol.fitness(5);
moMonOpDiversification<bitNeighbor> test(op, eval);
moMonOpDiversification<bitNeighbor> test(op, eval);
test(sol);
test(sol);
assert(sol.fitness()==1);
assert(sol.fitness()==1);
std::cout << "[t-moMonOpDiversification] => OK" << std::endl;
std::cout << "[t-moMonOpDiversification] => OK" << std::endl;
return EXIT_SUCCESS;
return EXIT_SUCCESS;
}