From 4d86c453e9c668722f532ca453fa9a51f760b93c Mon Sep 17 00:00:00 2001
From: boufaras <boufaras@331e1502-861f-0410-8da2-ba01fb791d7f>
Date: Tue, 15 Mar 2011 14:25:55 +0000
Subject: [PATCH] add unit test

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2198 331e1502-861f-0410-8da2-ba01fb791d7f
---
 branches/ParadisEO-GPU/test/t-moCudaBitVector.cu | 16 +++++++++-------
 1 file changed, 9 insertions(+), 7 deletions(-)

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