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

28
trunk/paradiseo-mo/test/t-moRandomWalk.cpp
View file

@ -38,26 +38,26 @@ Contact: paradiseo-help@lists.gforge.inria.fr
#include <comparator/moSolNeighborComparator.h>
#include <comparator/moNeighborComparator.h>
int main(){
int main() {
std::cout << "[t-moRandomWalk] => START" << std::endl;
std::cout << "[t-moRandomWalk] => START" << std::endl;
bitNeighborhood nh(4);
oneMaxEval<bitVector> fullEval;
evalOneMax eval(4);
moTrueContinuator<bitNeighbor> cont;
moSolNeighborComparator<bitNeighbor> sncomp;
moNeighborComparator<bitNeighbor> ncomp;
bitNeighborhood nh(4);
oneMaxEval<bitVector> fullEval;
evalOneMax eval(4);
moTrueContinuator<bitNeighbor> cont;
moSolNeighborComparator<bitNeighbor> sncomp;
moNeighborComparator<bitNeighbor> ncomp;
//test du 1er constructeur
moRandomWalk<bitNeighbor> test1(nh, fullEval, eval, 3);
//test du 1er constructeur
moRandomWalk<bitNeighbor> test1(nh, fullEval, eval, 3);
//test du 2eme constructeur
moRandomWalk<bitNeighbor> test2(nh, fullEval, eval, 3, cont);
//test du 2eme constructeur
moRandomWalk<bitNeighbor> test2(nh, fullEval, eval, 3, cont);
std::cout << "[t-moRandomWalk] => OK" << std::endl;
std::cout << "[t-moRandomWalk] => OK" << std::endl;
return EXIT_SUCCESS;
return EXIT_SUCCESS;
}