git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2221 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
0edc30e822
commit
522d4d2a25
1 changed files with 0 additions and 112 deletions
|
|
@ -1,112 +0,0 @@
|
||||||
/*
|
|
||||||
<moCudaBitVector.h>
|
|
||||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
|
||||||
|
|
||||||
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 use,
|
|
||||||
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".
|
|
||||||
|
|
||||||
As a counterpart to the access to the source code and rights to copy,
|
|
||||||
modify and redistribute granted by the license, users are provided only
|
|
||||||
with a limited warranty and the software's author, the holder of the
|
|
||||||
economic rights, and the successive licensors have only limited liability.
|
|
||||||
|
|
||||||
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 _moCudaBitVector_H_
|
|
||||||
#define _moCudaBitVector_H_
|
|
||||||
|
|
||||||
#include <cudaType/moCudaVector.h>
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Implementation of Bit vector representation on CUDA.
|
|
||||||
*/
|
|
||||||
|
|
||||||
template<class Fitness>
|
|
||||||
|
|
||||||
class moCudaBitVector: public moCudaVector<bool, Fitness> {
|
|
||||||
|
|
||||||
public:
|
|
||||||
/**
|
|
||||||
* Define vector type of vector corresponding to Solution
|
|
||||||
**/
|
|
||||||
typedef bool ElemType;
|
|
||||||
using moCudaVector<bool, Fitness>::vect;
|
|
||||||
using moCudaVector<bool, Fitness>::N;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Default constructor.
|
|
||||||
*/
|
|
||||||
|
|
||||||
moCudaBitVector() :
|
|
||||||
moCudaVector<bool, Fitness> () {
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
*Constructor.
|
|
||||||
*@param _size The neighborhood size.
|
|
||||||
*/
|
|
||||||
|
|
||||||
moCudaBitVector(unsigned _size) :
|
|
||||||
moCudaVector<bool, Fitness> (_size) {
|
|
||||||
create();
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
*Constructor.
|
|
||||||
*@param _size The neighborhood size.
|
|
||||||
*@param _b Value to assign to vector.
|
|
||||||
*/
|
|
||||||
|
|
||||||
moCudaBitVector(unsigned _size, bool _b) :
|
|
||||||
moCudaVector<bool, Fitness> (_size) {
|
|
||||||
|
|
||||||
for (unsigned i = 0; i < _size; i++)
|
|
||||||
vect[i] = _b;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
*Initializer of random bit vector.
|
|
||||||
*/
|
|
||||||
|
|
||||||
void create() {
|
|
||||||
|
|
||||||
for (unsigned i = 0; i < N; i++) {
|
|
||||||
|
|
||||||
vect[i] = (bool) round((float) rng.rand() / RAND_MAX);
|
|
||||||
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
void printOn(std::ostream& os) const {
|
|
||||||
EO<Fitness>::printOn(os);
|
|
||||||
os << ' ';
|
|
||||||
os << N << ' ';
|
|
||||||
for (unsigned int i = 0; i < N; i++)
|
|
||||||
os << (*this)[i] << ' ';
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
};
|
|
||||||
|
|
||||||
#endif
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue