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

44
trunk/paradiseo-mo/test/t-moEvalCounter.cpp
View file

@ -34,33 +34,33 @@ Contact: paradiseo-help@lists.gforge.inria.fr
#include <eval/moEvalCounter.h>
#include "moTestClass.h"
int main(){
int main() {
std::cout << "[t-moEvalCounter] => START" << std::endl;
std::cout << "[t-moEvalCounter] => START" << std::endl;
evalOneMax eval(4);
bitVector sol;
sol.resize(4);
sol[0]=true;
sol[1]=false;
sol[2]=true;
sol[3]=true;
sol.fitness(3);
bitNeighbor n;
n.index(2);
evalOneMax eval(4);
bitVector sol;
sol.resize(4);
sol[0]=true;
sol[1]=false;
sol[2]=true;
sol[3]=true;
sol.fitness(3);
bitNeighbor n;
n.index(2);
moEvalCounter<bitNeighbor> test(eval);
moEvalCounter<bitNeighbor> test(eval);
test(sol,n);
assert(test.value()==1);
assert(n.fitness()==2);
n.index(1);
test(sol,n);
assert(test.value()==2);
assert(n.fitness()==4);
test(sol,n);
assert(test.value()==1);
assert(n.fitness()==2);
n.index(1);
test(sol,n);
assert(test.value()==2);
assert(n.fitness()==4);
std::cout << "[t-moEvalCounter] => OK" << std::endl;
std::cout << "[t-moEvalCounter] => OK" << std::endl;
return EXIT_SUCCESS;
return EXIT_SUCCESS;
}