a2f5bba3cd
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2668 331e1502-861f-0410-8da2-ba01fb791d7f
107 lines
2.9 KiB
C++
Executable file
107 lines
2.9 KiB
C++
Executable file
/*
|
|
<moGPUXSwapN.h>
|
|
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2012
|
|
|
|
Karima Boufaras, Thé Van Luong
|
|
|
|
This software is governed by the CeCILL license under French law and
|
|
abiding by the rules of distribution of free software. You can ue,
|
|
modify and/ or redistribute the software under the terms of the CeCILL
|
|
license as circulated by CEA, CNRS and INRIA at the following URL
|
|
"http://www.cecill.info".
|
|
|
|
In this respect, the user's attention is drawn to the risks associated
|
|
with loading, using, modifying and/or developing or reproducing the
|
|
software by the user in light of its specific status of free software,
|
|
that may mean that it is complicated to manipulate, and that also
|
|
therefore means that it is reserved for developers and experienced
|
|
professionals having in-depth computer knowledge. Users are therefore
|
|
encouraged to load and test the software's suitability as regards their
|
|
requirements in conditions enabling the security of their systems and/or
|
|
data to be ensured and, more generally, to use and operate it in the
|
|
same conditions as regards security.
|
|
The fact that you are presently reading this means that you have had
|
|
knowledge of the CeCILL license and that you accept its terms.
|
|
|
|
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
|
Contact: paradiseo-help@lists.gforge.inria.fr
|
|
*/
|
|
|
|
#ifndef _moGPUXSwapN_h
|
|
#define _moGPUXSwapN_h
|
|
|
|
#include <neighborhood/moBackableNeighbor.h>
|
|
#include <neighborhood/moGPUXChangeNeighbor.h>
|
|
|
|
/**
|
|
* A X-Swap Neighbor
|
|
*/
|
|
|
|
template<class EOT, class Fitness = typename EOT::Fitness>
|
|
class moGPUXSwapN: public moBackableNeighbor<EOT> ,
|
|
public moGPUXChangeNeighbor<EOT> {
|
|
|
|
public:
|
|
|
|
using moGPUXChangeNeighbor<EOT>::indices;
|
|
using moGPUXChangeNeighbor<EOT>::xChange;
|
|
using moGPUXChangeNeighbor<EOT>::key;
|
|
|
|
/**
|
|
*Default Constructor
|
|
*/
|
|
|
|
moGPUXSwapN() :
|
|
moGPUXChangeNeighbor<EOT> () {
|
|
}
|
|
|
|
/**
|
|
* Constructor
|
|
* @param _xSwap the number of swap to do
|
|
*/
|
|
|
|
moGPUXSwapN(unsigned int _xSwap) :
|
|
moGPUXChangeNeighbor<EOT> (_xSwap) {
|
|
}
|
|
|
|
/**
|
|
* Apply the K-swap
|
|
* @param _solution the solution to move
|
|
*/
|
|
virtual void move(EOT& _solution) {
|
|
EOT tmp(1);
|
|
for (unsigned int i = 0; i < xChange-1; i++) {
|
|
tmp[0] = _solution[indices[i]];
|
|
_solution[indices[i]] = _solution[indices[i + 1]];
|
|
_solution[indices[i + 1]] = tmp[0];
|
|
}
|
|
_solution.invalidate();
|
|
|
|
}
|
|
|
|
/**
|
|
* apply the K-swap to restore the solution (use by moFullEvalByModif)
|
|
* @param _solution the solution to move back
|
|
*/
|
|
virtual void moveBack(EOT& _solution) {
|
|
EOT tmp(1);
|
|
for (int i = xChange-1; i > 0; i--) {
|
|
tmp[0] = _solution[indices[i]];
|
|
_solution[indices[i]] = _solution[indices[i - 1]];
|
|
_solution[indices[i - 1]] = tmp[0];
|
|
}
|
|
_solution.invalidate();
|
|
}
|
|
|
|
/**
|
|
* Return the class name.
|
|
* @return the class name as a std::string
|
|
*/
|
|
virtual std::string className() const {
|
|
return "moGPUXSwapN";
|
|
}
|
|
|
|
};
|
|
|
|
#endif
|
|
|