fix(mo): comment out unused parameters

Removes -Wunused-parameters warnings.

mo/src/neighborhood/moBackwardVectorVNSelection.h

@@ -69,7 +69,7 @@ public:
    * @param _solution the current solution
    * @return true if there is some heuristics
    */
-  virtual bool cont(EOT& _solution){
+  virtual bool cont(EOT& /*_solution*/){
     return (cycle || (current > 0));
   }
 
@@ -78,7 +78,7 @@ public:
    *
    * @param _solution the current solution
    */
-  virtual void init(EOT& _solution){
+  virtual void init(EOT& /*_solution*/){
     current = LSvector.size() - 1;
   }
 
@@ -87,7 +87,7 @@ public:
    *
    * @param _solution the current solution
    */
-  virtual void next(EOT& _solution){
+  virtual void next(EOT& /*_solution*/){
     current = (current + LSvector.size() -1) % LSvector.size();
   }
 

mo/src/neighborhood/moDummyNeighbor.h

@@ -43,6 +43,6 @@ public:
      * NOTHING TO DO
      * @param _solution the related solution
      */
-    virtual void move(EOT& _solution) {}
+    virtual void move(EOT& /*_solution*/) {}
 };
 #endif

mo/src/neighborhood/moDummyNeighborhood.h

@@ -46,7 +46,7 @@ public:
      * @param _solution unused solution
      * @return always false
      */
-    virtual bool hasNeighbor(EOT & _solution) {
+    virtual bool hasNeighbor(EOT & /*_solution*/) {
         return false;
     }
 
@@ -55,21 +55,21 @@ public:
      * @param _solution unused solution
      * @param _current unused neighbor
      */
-    virtual void init(EOT & _solution, Neighbor & _current) {}
+    virtual void init(EOT & /*_solution*/, Neighbor & /*_current*/) {}
 
     /**
      * NOTHING TO DO
      * @param _solution unused solution
      * @param _current unused neighbor
      */
-    virtual void next(EOT & _solution, Neighbor & _current) {}
+    virtual void next(EOT & /*_solution*/, Neighbor & /*_current*/) {}
 
     /**
      * NOTHING TO DO
      * @param _solution unused solution
      * @return always false
      */
-    virtual bool cont(EOT & _solution) {
+    virtual bool cont(EOT & /*_solution*/) {
         return false;
     }
 

mo/src/neighborhood/moForwardVectorVNSelection.h

@@ -69,7 +69,7 @@ public:
    * @param _solution the current solution
    * @return true if there is some heuristics
    */
-  virtual bool cont(EOT& _solution){
+  virtual bool cont(EOT& /*_solution*/){
     return (cycle || (current <= (LSvector.size() - 2)));
   }
 
@@ -78,7 +78,7 @@ public:
    *
    * @param _solution the current solution
    */
-  virtual void init(EOT& _solution){
+  virtual void init(EOT& /*_solution*/){
     current = 0;
   }
 
@@ -87,7 +87,7 @@ public:
    *
    * @param _solution the current solution
    */
-  virtual void next(EOT& _solution){
+  virtual void next(EOT& /*_solution*/){
     current = (current + 1) % LSvector.size();
   }
 

mo/src/neighborhood/moIndexNeighbor.h

@@ -109,7 +109,7 @@ public:
 	 * @param _solution solution from which the neighborhood is visited
 	 * @param _key index of the IndexNeighbor
 	 */
-         virtual void index(EOT & _solution, unsigned int _key) {
+         virtual void index(EOT & /*_solution*/, unsigned int _key) {
            key = _key;
          }
 

mo/src/neighborhood/moNeighbor.h

@@ -93,7 +93,7 @@ public:
 	 * @param _neighbor a neighbor
 	 * @return if _neighbor and this one are equals
 	 */
-	virtual bool equals(moNeighbor<EOT, Fitness> & _neighbor) {
+	virtual bool equals(moNeighbor<EOT, Fitness> & /*_neighbor*/) {
 		return false;
 	}
 

mo/src/neighborhood/moOrderNeighborhood.h

@@ -71,7 +71,7 @@ public:
 	 * @param _solution the solution to explore
 	 * @return true if the neighborhood was not empty
 	 */
-	virtual bool hasNeighbor(EOT& _solution) {
+	virtual bool hasNeighbor(EOT& /*_solution*/) {
 	  return getNeighborhoodSize() > 0;
 	}
 
@@ -102,7 +102,7 @@ public:
 	 * @param _solution the solution to explore
 	 * @return true if there is again a neighbor to explore
 	 */
-	virtual bool cont(EOT & _solution) {
+	virtual bool cont(EOT & /*_solution*/) {
 	  return (currentIndex < getNeighborhoodSize() - 1);
 	}
 

mo/src/neighborhood/moRndVectorVNSelection.h

@@ -72,7 +72,7 @@ public:
    * @param _solution the current solution
    * @return true if there is some heuristics
    */
-  virtual bool cont(EOT& _solution){
+  virtual bool cont(EOT& /*_solution*/){
     return ( cycle || (currentOrder <= (order.size() - 2)) );
   }
 
@@ -81,7 +81,7 @@ public:
    *
    * @param _solution the current solution
    */
-  virtual void init(EOT& _solution) {
+  virtual void init(EOT& /*_solution*/) {
     if(order.size() == 0)
       for(unsigned int i = 0; i < LSvector.size(); i++)
 	order.push_back(i);
@@ -98,7 +98,7 @@ public:
    *
    * @param _solution the current solution
    */
-  virtual void next(EOT& _solution){
+  virtual void next(EOT& /*_solution*/){
     currentOrder = (currentOrder + 1) % order.size();
 
     current = order[currentOrder];

mo/src/neighborhood/moRndWithReplNeighborhood.h

@@ -68,7 +68,7 @@ public:
      * @param _solution the solution to explore
      * @return true if the neighborhood was not empty
      */
-    virtual bool hasNeighbor(EOT& _solution) {
+    virtual bool hasNeighbor(EOT& /*_solution*/) {
         return neighborhoodSize > 0;
     }
 
@@ -97,7 +97,7 @@ public:
      * @param _solution the solution to explore
      * @return true if there is again a neighbor to explore
      */
-    virtual bool cont(EOT & _solution) {
+    virtual bool cont(EOT & /*_solution*/) {
       if (maxNeighbors == 0)
         return neighborhoodSize > 0;
       else

mo/src/neighborhood/moRndWithoutReplNeighborhood.h

@@ -69,7 +69,7 @@ public:
      * @param _solution the solution to explore
      * @return true if the neighborhood was not empty
      */
-    virtual bool hasNeighbor(EOT& _solution) {
+    virtual bool hasNeighbor(EOT& /*_solution*/) {
         return neighborhoodSize > 0;
     }
 
@@ -110,7 +110,7 @@ public:
      * @param _solution the solution to explore
      * @return true if there is again a neighbor to explore
      */
-    virtual bool cont(EOT & _solution) {
+    virtual bool cont(EOT & /*_solution*/) {
         return (maxIndex > 0) ;
     }