Migration from SVN
This commit is contained in:
parent
d7d6c3a217
commit
8cd56f37db
29069 changed files with 0 additions and 4096888 deletions
74
mo/test/t-moNeighborBestStat.cpp
Normal file
74
mo/test/t-moNeighborBestStat.cpp
Normal file
|
|
@ -0,0 +1,74 @@
|
|||
/*
|
||||
<t-moNeighborBestStat.cpp>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
|
||||
Sébastien Verel, Arnaud Liefooghe, Jérémie Humeau
|
||||
|
||||
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
|
||||
*/
|
||||
|
||||
#include <iostream>
|
||||
#include <cstdlib>
|
||||
#include <cassert>
|
||||
|
||||
#include <continuator/moNeighborBestStat.h>
|
||||
#include "moTestClass.h"
|
||||
|
||||
int main() {
|
||||
|
||||
std::cout << "[t-moNeighborBestStat] => START" << std::endl;
|
||||
|
||||
bitNeighborhood nh(4);
|
||||
bitNeighborhood emptyNH(0);
|
||||
evalOneMax eval(4);
|
||||
moSolNeighborComparator<bitNeighbor> sncomp;
|
||||
moNeighborComparator<bitNeighbor> ncomp;
|
||||
|
||||
moNeighborBestStat<bitNeighbor> test1(nh, eval, ncomp, sncomp, 1);
|
||||
moNeighborBestStat<bitNeighbor> test2(nh, eval);
|
||||
moNeighborBestStat<bitNeighbor> test3(emptyNH, eval);
|
||||
|
||||
bitVector sol(4, true);
|
||||
sol.fitness(4);
|
||||
|
||||
test1.init(sol);
|
||||
assert(test1.value()==3);
|
||||
|
||||
sol[0]=false;
|
||||
sol.fitness(3);
|
||||
test1(sol);
|
||||
assert(test1.value()==4);
|
||||
|
||||
test2(sol);
|
||||
assert(test2.value()==2);
|
||||
|
||||
test3(sol);
|
||||
assert(test3.value()==int());
|
||||
|
||||
assert(test1.className()=="moNeighborBestStat");
|
||||
|
||||
std::cout << "[t-moNeighborBestStat] => OK" << std::endl;
|
||||
|
||||
return EXIT_SUCCESS;
|
||||
}
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue