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

add unit test

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2198 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras 2011-03-15 14:25:55 +00:00
commit 4d86c453e9
1 changed files with 9 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

16
branches/ParadisEO-GPU/test/t-moCudaBitVector.cu
View file

@ -48,14 +48,16 @@ int main() {
std::cout << "[t-moCudaBitVector] => START" << std::endl; std::cout << "[t-moCudaBitVector] => START" << std::endl;
EvalOneMax<Solution> eval; EvalOneMax<Solution> eval;
//verif default constructor
//test default constructor
Solution sol; Solution sol;
assert(sol.size()==1); assert(sol.size()==0);
//verif constructor of random vector
//test constructor of random vector
Solution sol1(5); Solution sol1(5);
assert(sol1.size()==5); assert(sol1.size()==5);
//verif bool //test random vector of bool
for(int i=0;i<5;i++) for(int i=0;i<5;i++)
assert((sol1[i]==0)||(sol1[i]==1)); assert((sol1[i]==0)||(sol1[i]==1));
@ -63,7 +65,7 @@ int main() {
eval(sol1); eval(sol1);
eoMaximizingFitness sum=0; eoMaximizingFitness sum=0;
for(int i=0;i<5;i++) for(int i=0;i<5;i++)
sum=sol1[i]+sum; sum=sum+sol1[i];
assert(sol1.fitness()==sum); assert(sol1.fitness()==sum);
//verif constructor of constant vector //verif constructor of constant vector
@ -74,13 +76,13 @@ int main() {
eval(sol2); eval(sol2);
assert(sol2.fitness()==4); assert(sol2.fitness()==4);
//verif accessor //test accessor
sol2[3]=0; sol2[3]=0;
assert(sol2[3]==0); assert(sol2[3]==0);
eval(sol2); eval(sol2);
assert(sol2.fitness()==3); assert(sol2.fitness()==3);
//verif operator = //test assignement operator
sol2=sol1; sol2=sol1;
assert(sol1.size()==sol2.size()); assert(sol1.size()==sol2.size());
assert(sol1.fitness()==sol2.fitness()); assert(sol1.fitness()==sol2.fitness());