tutorial/Wrapper modified

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@901 331e1502-861f-0410-8da2-ba01fb791d7f

trunk/paradiseo-peo/tutorial/Wrapper/CMakeLists.txt

@@ -60,7 +60,6 @@ ADD_EXECUTABLE(example2 main2.cpp)
 ADD_DEPENDENCIES(example2 peo rmc_mpi)
 ADD_EXECUTABLE(example3 main3.cpp)
 ADD_DEPENDENCIES(example3 peo rmc_mpi)
-
 ADD_EXECUTABLE(example4 main4.cpp)
 ADD_DEPENDENCIES(example4 peo rmc_mpi)
 ADD_EXECUTABLE(example5 main5.cpp)

trunk/paradiseo-peo/tutorial/Wrapper/main1.cpp

@@ -56,5 +56,8 @@ int main( int __argc, char** __argv )
   peo :: run();
   peo :: finalize();
   if (getNodeRank()==1)
+  {
+  	pop.sort();
    	std::cout << "Final population :\n" << pop << std::endl;
+  }
 }

trunk/paradiseo-peo/tutorial/Wrapper/main2.cpp

@@ -92,5 +92,8 @@ int main( int __argc, char** __argv )
 
   
  if (getNodeRank()==1)
+ {
+ 	pop.sort();
     std::cout << "Final population :\n" << pop << std::endl;
+ }
 }

trunk/paradiseo-peo/tutorial/Wrapper/main3.cpp

@@ -57,5 +57,8 @@ int main( int __argc, char** __argv )
   peo :: run();
   peo :: finalize();
   if (getNodeRank()==1)
+  {
+  	pop.sort();
     std::cout << "Final population :\n" << pop << std::endl;
+  }
 }

trunk/paradiseo-peo/tutorial/Wrapper/main4.cpp

@@ -124,6 +124,8 @@ int main( int __argc, char** __argv )
   peo :: finalize();
   if (getNodeRank()==1)
   {
+  	pop.sort();
+  	pop2.sort();
     std::cout << "Final population :\n" << pop << std::endl;
     std::cout << "Final population :\n" << pop2	 << std::endl;
   }

trunk/paradiseo-peo/tutorial/Wrapper/main5.cpp

@@ -54,6 +54,7 @@ int main (int __argc, char * * __argv)
 
   if (getNodeRank()==1)
   {
+  	pop.sort();
     std :: cout << "\nResult before the local search\n";
     for(unsigned i=0;i<pop.size();i++)
     	std::cout<<"\n"<<pop[i].fitness();
@@ -70,6 +71,7 @@ int main (int __argc, char * * __argv)
   if (getNodeRank()==1)
   {
     std :: cout << "\nResult after the local search\n";
+    pop.sort();
     for(unsigned i=0;i<pop.size();i++)
     	std::cout<<"\n"<<pop[i].fitness();
   }

trunk/paradiseo-peo/tutorial/Wrapper/main6.cpp

@@ -47,6 +47,7 @@ int main (int __argc, char * * __argv)
   if (getNodeRank()==1)
   {
     std :: cout << "\nResult before the EA\n";
+    pop.sort();
     for(unsigned i=0;i<pop.size();i++)
     	std::cout<<"\n"<<pop[i].fitness();
     std :: cout << "\n\n";
@@ -69,6 +70,7 @@ int main (int __argc, char * * __argv)
   if (getNodeRank()==1)
   {
     std :: cout << "\nResult after the EA\n";
+    pop.sort();
     for(unsigned i=0;i<pop.size();i++)
     	std::cout<<"\n"<<pop[i].fitness();
     std :: cout << "\n\n";

trunk/paradiseo-peo/tutorial/Wrapper/main7.cpp

@@ -83,5 +83,8 @@ int main( int __argc, char** __argv )
   peo :: run();
   peo :: finalize();
   if (getNodeRank()==1)
+  {
+  	pop.sort();
     std::cout << "Final population :\n" << pop << std::endl;
+  }
 }