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

Test & Update for new version

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2678 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras 2012-01-24 01:35:56 +00:00
commit f2b13bc8ba
18 changed files with 71 additions and 187 deletions
Download patch file Download diff file Expand all files Collapse all files

13
branches/ParadisEO-GPU/paradiseo-gpu/test/t-moGPUPermutationVector.cu
View file

@ -1,6 +1,6 @@
/*
<t-moGPUPermutationVector.cu>
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2012
Karima Boufaras, Thé Van LUONG
@ -54,19 +54,18 @@ int main() {
Solution sol2(3);
//test copy constructor
sol1.fitness(200);
sol1.fitness(20);
Solution sol(sol1);
assert(sol.size()==5);
assert(sol.fitness()==200);
assert(sol.fitness()==20);
for(int i=0;i<5;i++)
assert(sol[i]==sol1[i]);
//test discret vector (create) & getter
//test discret vector create & getter
for(int i=0;i<5;i++)
assert((sol1[i]>=0)||(sol1[i]<5));
//test size getter
assert(_sol.size()==0);
assert(sol1.size()==5);
assert(sol2.size()==3);
@ -78,12 +77,12 @@ int main() {
//test discret vector
for(int i=0;i<3;i++)
assert((sol2[i]>=0)||(sol2[i]<3));
sol2.fitness(300);
sol2.fitness(30);
//test assignement operator
sol1=sol2;
assert(sol1.size()==3);
assert(sol1.fitness()==300);
assert(sol1.fitness()==30);
for(int i=0;i<3;i++)
assert(sol1[i]==sol2[i]);