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

Update test

Browse source 
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2305 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras 2011-07-08 12:43:22 +00:00
commit 04aae43630
1 changed files with 6 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

12
trunk/paradiseo-mo/test/t-moXChangeNeighbor.cpp
View file

@ -30,12 +30,12 @@
#include <cstdlib>
#include <cassert>
#include <iostream>
#include <neighborhood/moXChangeNeighbor.h>
#include <eo>
#include <eoInt.h>
#include <moTestClass.h>
typedef eoInt<eoMaximizingFitness> Solution;
typedef moXChangeNeighbor<Solution> Neighbor;
typedef eoInt<eoMaximizingFitness> Sol;
typedef XChangeNeighborDummy<Sol> Neighbor;
int main() {
@ -63,12 +63,12 @@ int main() {
assert(neighbor1.index() == 0);
assert(neighbor1.getXChange() == 5);
for (unsigned int i = 0; i < neighbor1.getXChange(); i++)
assert(neighbor1.getIndice(i) ==i);
assert(neighbor1.getIndice(i) == i);
//test assignement operator
for (unsigned int i = 0; i <neighbor1.getXChange(); i++)
neighbor1.setIndice(i, 0);
for (unsigned int i = 0; i < neighbor1.getXChange(); i++)
neighbor1.setIndice(i, 0);
Neighbor neighbor2(2);