test added

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1807 331e1502-861f-0410-8da2-ba01fb791d7f

trunk/paradiseo-mo/test/CMakeLists.txt

@@ -98,6 +98,7 @@ SET (TEST_LIST
 		t-moLocalSearchInit
 		t-moSolInit
 		t-moEvalCounter
+		t-moNeighborFitnessStat
 		)
 				
 FOREACH (test ${TEST_LIST})

trunk/paradiseo-mo/test/t-moNeighborFitnessStat.cpp

@@ -0,0 +1,66 @@
+/*
+<t-moNeighborFitnessStat.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/moNeighborFitnessStat.h>
+#include "moTestClass.h"
+
+int main(){
+
+	std::cout << "[t-moNeighborFitnessStat] => START" << std::endl;
+
+	bitNeighborhood nh(4);
+	bitNeighborhood nh2(0);
+	evalOneMax eval(4);
+
+	moNeighborFitnessStat<bitNeighbor> test(nh, eval);
+	moNeighborFitnessStat<bitNeighbor> test2(nh2, eval);
+
+	bitVector sol(4, true);
+	sol.fitness(4);
+	test.init(sol);
+	assert(test.value()==3);
+	test(sol);
+	assert(test.value()==3);
+
+	test2.init(sol);
+	sol.fitness(3);
+	test2(sol);
+	assert(test2.value()==int());
+
+	assert(test.className()=="moNeighborFitnessStat");
+
+	std::cout << "[t-moNeighborFitnessStat] => OK" << std::endl;
+
+	return EXIT_SUCCESS;
+}
+