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

24
trunk/paradiseo-mo/test/t-moRandomSearch.cpp
View file

@ -36,22 +36,22 @@ Contact: paradiseo-help@lists.gforge.inria.fr
#include <eval/oneMaxEval.h>
#include <continuator/moTrueContinuator.h>
int main(){
int main() {
std::cout << "[t-moRandomSearch] => START" << std::endl;
std::cout << "[t-moRandomSearch] => START" << std::endl;
oneMaxEval<bitVector> fullEval;
dummyInit init;
moTrueContinuator<bitNeighbor> cont;
//test du 1er constructor
moRandomSearch<bitNeighbor> test1(init, fullEval, 3);
//test du 2e constructor
moRandomSearch<bitNeighbor> test2(init, fullEval, 3, cont);
oneMaxEval<bitVector> fullEval;
dummyInit init;
moTrueContinuator<bitNeighbor> cont;
//test du 1er constructor
moRandomSearch<bitNeighbor> test1(init, fullEval, 3);
//test du 2e constructor
moRandomSearch<bitNeighbor> test2(init, fullEval, 3, cont);
assert(test1.className()=="moRandomSearch");
assert(test1.className()=="moRandomSearch");
std::cout << "[t-moRandomSearch] => OK" << std::endl;
std::cout << "[t-moRandomSearch] => OK" << std::endl;
return EXIT_SUCCESS;
return EXIT_SUCCESS;
}