* whitespace cleanup

eo/tutorial/Lesson6/BinaryPSO.cpp

@@ -28,7 +28,7 @@ double binary_value (const Particle & _particle)
 {
     double sum = 0;
     for (unsigned i = 0; i < _particle.size(); i++)
-        sum +=_particle[i];
+	sum +=_particle[i];
     return (sum);
 }
 
@@ -39,7 +39,7 @@ void main_function(int argc, char **argv)
 // PARAMETRES
  // all parameters are hard-coded!
  	const unsigned int SEED = 42;	// seed for random number generator
- 	
+
  	const unsigned int MAX_GEN=500;
     const unsigned int VEC_SIZE = 10;
     const unsigned int POP_SIZE = 20;
@@ -47,10 +47,10 @@ void main_function(int argc, char **argv)
 
     const double VELOCITY_INIT_MIN= -1;
     const double VELOCITY_INIT_MAX= 1;
-    
+
     const double VELOCITY_MIN= -1.5;
     const double VELOCITY_MAX= 1.5;
-    
+
     const double INERTIA= 1;
     const double LEARNING_FACTOR1= 1.7;
     const double LEARNING_FACTOR2= 2.3;
@@ -63,9 +63,9 @@ void main_function(int argc, char **argv)
   // you'll aways get the same result, NOT a random run
   	rng.reseed(SEED);
 
-   
+
 /// SWARM
- 	// population <=> swarm 
+ 	// population <=> swarm
     eoPop<Particle> pop;
 
 /// EVALUATION
@@ -78,8 +78,8 @@ void main_function(int argc, char **argv)
 //////////////
 	// ring topology
     eoRingTopology<Particle> topology(NEIGHBORHOOD_SIZE);
-    
-    
+
+
 /////////////////////
 // INITIALIZATION
 ////////////////////
@@ -87,7 +87,7 @@ void main_function(int argc, char **argv)
     eoUniformGenerator<bool> uGen;
     eoInitFixedLength < Particle > random (VEC_SIZE, uGen);
 	pop.append (POP_SIZE, random);
-	
+
     // velocities initialization component
     eoUniformGenerator < double >sGen (VELOCITY_INIT_MIN, VELOCITY_INIT_MAX);
     eoVelocityInitFixedLength < Particle > veloRandom (VEC_SIZE, sGen);
@@ -101,23 +101,23 @@ void main_function(int argc, char **argv)
 	//  	- the first best positions of each particle
 	// 		- setups the topology
     eoInitializer <Particle> fullInit(eval,veloRandom,localInit,topology,pop);
-    
+
    // Full initialization here to be able to print the initial population
    // Else: give the "init" component in the eoEasyPSO constructor
    fullInit();
-    
+
 /////////////
 // OUTPUT
 ////////////
 // sort pop before printing it!
   	pop.sort();
-  	
+
   	// Print (sorted) the initial population (raw printout)
     cout << "INITIAL POPULATION:" << endl;
     for (unsigned i = 0; i < pop.size(); ++i)
-         cout <<  "\t best fit=" <<  pop[i] <<  endl;
+	 cout <<  "\t best fit=" <<  pop[i] <<  endl;
+
 
- 
 ///////////////
 /// VELOCITY
 //////////////
@@ -148,7 +148,7 @@ void main_function(int argc, char **argv)
   ////////////////////////////////////////
   // standard PSO requires
   // stopping criteria, evaluation,velocity, flight
-  
+
     eoEasyPSO<Particle> pso(genCont, eval, velocity, flight);
 
     // Apply the algo to the swarm - that's it!
@@ -159,7 +159,7 @@ void main_function(int argc, char **argv)
 	 pop.sort();
 	 cout << "FINAL POPULATION:" << endl;
   	 for (unsigned i = 0; i < pop.size(); ++i)
-        cout <<  "\t best fit=" <<  pop[i] <<  endl;
+	cout <<  "\t best fit=" <<  pop[i] <<  endl;
 
 }
 
@@ -167,14 +167,14 @@ void main_function(int argc, char **argv)
 // A main that catches the exceptions
 
 int main(int argc, char **argv)
-{	
+{
     try
     {
-        main_function(argc, argv);
+	main_function(argc, argv);
     }
     catch(exception& e)
     {
-        cout << "Exception: " << e.what() << '\n';
+	cout << "Exception: " << e.what() << '\n';
     }
 
     return 1;