fix(mo): comment out unused parameters
Removes -Wunused-parameters warnings.
This commit is contained in:
parent
1a980c442d
commit
843aa6fc37
69 changed files with 159 additions and 159 deletions
|
|
@ -54,20 +54,20 @@ public:
|
|||
* NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
void initParam (EOT& _solution) { } ;
|
||||
void initParam (EOT& /*_solution*/) { } ;
|
||||
|
||||
/**
|
||||
* NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
void updateParam (EOT& _solution) { } ;
|
||||
void updateParam (EOT& /*_solution*/) { } ;
|
||||
|
||||
/**
|
||||
* NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
* @return always false
|
||||
*/
|
||||
bool isContinue(EOT& _solution) {
|
||||
bool isContinue(EOT& /*_solution*/) {
|
||||
return false;
|
||||
} ;
|
||||
|
||||
|
|
@ -75,14 +75,14 @@ public:
|
|||
* NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
void move(EOT& _solution) { } ;
|
||||
void move(EOT& /*_solution*/) { } ;
|
||||
|
||||
/**
|
||||
* NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
* @return always false
|
||||
*/
|
||||
virtual bool accept(EOT& _solution) {
|
||||
virtual bool accept(EOT& /*_solution*/) {
|
||||
return false;
|
||||
} ;
|
||||
|
||||
|
|
@ -90,13 +90,13 @@ public:
|
|||
* NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void terminate(EOT& _solution) { } ;
|
||||
virtual void terminate(EOT& /*_solution*/) { } ;
|
||||
|
||||
/**
|
||||
* NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
void operator()(EOT & _solution) { }
|
||||
void operator()(EOT & /*_solution*/) { }
|
||||
|
||||
/**
|
||||
* Return the class name
|
||||
|
|
|
|||
|
|
@ -85,19 +85,19 @@ public:
|
|||
* initParam: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void initParam(EOT & _solution) {};
|
||||
virtual void initParam(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* updateParam: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void updateParam(EOT & _solution) {};
|
||||
virtual void updateParam(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* terminate: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void terminate(EOT & _solution) {};
|
||||
virtual void terminate(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* Explore the neighborhood of a solution until an ameliorated neighbor is found
|
||||
|
|
@ -135,7 +135,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true if an ameliorated neighbor was found
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
if (stop)
|
||||
return isAccept ;
|
||||
else
|
||||
|
|
|
|||
|
|
@ -106,7 +106,7 @@ public:
|
|||
* terminate: NOTHING TO DO
|
||||
* @param _solution a solution (unused)
|
||||
*/
|
||||
virtual void terminate(EOT & _solution) {};
|
||||
virtual void terminate(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* Perturb and apply local search on a solution
|
||||
|
|
@ -135,7 +135,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return always true
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
return true;
|
||||
};
|
||||
|
||||
|
|
|
|||
|
|
@ -85,7 +85,7 @@ public:
|
|||
* initialization of the number of step to be done
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void initParam(EOT & _solution) {
|
||||
virtual void initParam(EOT & /*_solution*/) {
|
||||
step = 0;
|
||||
isAccept = true;
|
||||
};
|
||||
|
|
@ -94,7 +94,7 @@ public:
|
|||
* increase the number of step
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void updateParam(EOT & _solution) {
|
||||
virtual void updateParam(EOT & /*_solution*/) {
|
||||
step++;
|
||||
};
|
||||
|
||||
|
|
@ -102,7 +102,7 @@ public:
|
|||
* terminate: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void terminate(EOT & _solution) {};
|
||||
virtual void terminate(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* Explore the neighborhood of a solution
|
||||
|
|
@ -128,7 +128,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true there is some steps to do
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
return (step < nbStep) ;
|
||||
};
|
||||
|
||||
|
|
|
|||
|
|
@ -105,7 +105,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true there is some steps to do
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
return (step < nbStep) && isAccept ;
|
||||
};
|
||||
|
||||
|
|
|
|||
|
|
@ -85,7 +85,7 @@ public:
|
|||
* empty the vector of best solutions
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void initParam(EOT & _solution) {
|
||||
virtual void initParam(EOT & /*_solution*/) {
|
||||
// delete all the best solutions
|
||||
bestVector.clear();
|
||||
};
|
||||
|
|
@ -94,7 +94,7 @@ public:
|
|||
* empty the vector of best solutions
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void updateParam(EOT & _solution) {
|
||||
virtual void updateParam(EOT & /*_solution*/) {
|
||||
// delete all the best solutions
|
||||
bestVector.clear();
|
||||
};
|
||||
|
|
@ -103,7 +103,7 @@ public:
|
|||
* terminate: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void terminate(EOT & _solution) {};
|
||||
virtual void terminate(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* Explore the neighborhood of a solution
|
||||
|
|
@ -156,7 +156,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true if an ameliorated neighbor was be found
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
return isAccept ;
|
||||
};
|
||||
|
||||
|
|
|
|||
|
|
@ -87,7 +87,7 @@ public:
|
|||
* initialization of the number of step to be done
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void initParam(EOT & _solution) {
|
||||
virtual void initParam(EOT & /*_solution*/) {
|
||||
step = 0;
|
||||
isAccept = true;
|
||||
};
|
||||
|
|
@ -96,7 +96,7 @@ public:
|
|||
* increase the number of step
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void updateParam(EOT & _solution) {
|
||||
virtual void updateParam(EOT & /*_solution*/) {
|
||||
step++;
|
||||
};
|
||||
|
||||
|
|
@ -104,7 +104,7 @@ public:
|
|||
* terminate: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void terminate(EOT & _solution) {};
|
||||
virtual void terminate(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* Explore the neighborhood of a solution
|
||||
|
|
@ -142,7 +142,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true there is some steps to do
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
return (step < nbStep) && isAccept ;
|
||||
};
|
||||
|
||||
|
|
|
|||
|
|
@ -74,7 +74,7 @@ public:
|
|||
* initialization of the number of step to be done
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void initParam(EOT & _solution) {
|
||||
virtual void initParam(EOT & /*_solution*/) {
|
||||
step = 0;
|
||||
};
|
||||
|
||||
|
|
@ -82,7 +82,7 @@ public:
|
|||
* increase the number of step
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void updateParam(EOT & _solution) {
|
||||
virtual void updateParam(EOT & /*_solution*/) {
|
||||
step++;
|
||||
};
|
||||
|
||||
|
|
@ -90,7 +90,7 @@ public:
|
|||
* terminate: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void terminate(EOT & _solution) {};
|
||||
virtual void terminate(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* Explore the neighborhood with only one random solution
|
||||
|
|
@ -111,7 +111,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true there is some steps to do
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
return (step < nbStep) ;
|
||||
};
|
||||
|
||||
|
|
@ -119,7 +119,7 @@ public:
|
|||
* move the solution with the best neighbor
|
||||
* @param _solution the solution to move
|
||||
*/
|
||||
virtual void move(EOT & _solution) {
|
||||
virtual void move(EOT & /*_solution*/) {
|
||||
// the solution is already move. So nothing to do !
|
||||
};
|
||||
|
||||
|
|
@ -128,7 +128,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true if the best neighbor ameliorate the fitness
|
||||
*/
|
||||
virtual bool accept(EOT & _solution) {
|
||||
virtual bool accept(EOT & /*_solution*/) {
|
||||
return true;
|
||||
};
|
||||
|
||||
|
|
|
|||
|
|
@ -82,7 +82,7 @@ public:
|
|||
* initialization of the number of step to be done
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void initParam(EOT & _solution) {
|
||||
virtual void initParam(EOT & /*_solution*/) {
|
||||
isAccept = true;
|
||||
};
|
||||
|
||||
|
|
@ -90,14 +90,14 @@ public:
|
|||
* increase the number of step
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void updateParam(EOT & _solution) {
|
||||
virtual void updateParam(EOT & /*_solution*/) {
|
||||
};
|
||||
|
||||
/**
|
||||
* terminate: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void terminate(EOT & _solution) {};
|
||||
virtual void terminate(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* Explore the neighborhood with only one random solution
|
||||
|
|
@ -127,7 +127,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true there is some steps to do
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
return isAccept ;
|
||||
};
|
||||
|
||||
|
|
|
|||
|
|
@ -95,7 +95,7 @@ public:
|
|||
* decrease the temperature if necessary
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void updateParam(EOT & _solution) {
|
||||
virtual void updateParam(EOT & /*_solution*/) {
|
||||
coolingSchedule.update(temperature, this->moveApplied());
|
||||
};
|
||||
|
||||
|
|
@ -103,7 +103,7 @@ public:
|
|||
* terminate: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void terminate(EOT & _solution) {};
|
||||
virtual void terminate(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* Explore one random solution in the neighborhood
|
||||
|
|
@ -129,7 +129,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true if the criteria from the cooling schedule is true
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
return coolingSchedule(temperature);
|
||||
};
|
||||
|
||||
|
|
|
|||
|
|
@ -76,19 +76,19 @@ public:
|
|||
* initParam: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void initParam(EOT & _solution) {};
|
||||
virtual void initParam(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* updateParam: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void updateParam(EOT & _solution) {};
|
||||
virtual void updateParam(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* terminate: NOTHING TO DO
|
||||
* @param _solution unused solution
|
||||
*/
|
||||
virtual void terminate(EOT & _solution) {};
|
||||
virtual void terminate(EOT & /*_solution*/) {};
|
||||
|
||||
/**
|
||||
* Explore the neighborhood of a solution
|
||||
|
|
@ -130,7 +130,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true if an ameliorated neighbor was be found
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
return isAccept ;
|
||||
};
|
||||
|
||||
|
|
|
|||
|
|
@ -195,7 +195,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
return true;
|
||||
};
|
||||
|
||||
|
|
@ -204,7 +204,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true if the best neighbor ameliorate the fitness
|
||||
*/
|
||||
virtual bool accept(EOT & _solution) {
|
||||
virtual bool accept(EOT & /*_solution*/) {
|
||||
return isAccept;
|
||||
};
|
||||
|
||||
|
|
|
|||
|
|
@ -124,7 +124,7 @@ public:
|
|||
* @param _solution the solution
|
||||
* @return true if an ameliorated neighbor was be found
|
||||
*/
|
||||
virtual bool isContinue(EOT & _solution) {
|
||||
virtual bool isContinue(EOT & /*_solution*/) {
|
||||
return !stop;
|
||||
};
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue