From 28049eae4ad08718e553382a74ca2686b18a48d8 Mon Sep 17 00:00:00 2001 From: jhumeau Date: Thu, 12 Feb 2009 12:31:44 +0000 Subject: [PATCH] retour chariot added git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1425 331e1502-861f-0410-8da2-ba01fb791d7f --- .../src/utils/moeoBestObjVecStat.h | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/trunk/paradiseo-moeo/src/utils/moeoBestObjVecStat.h b/trunk/paradiseo-moeo/src/utils/moeoBestObjVecStat.h index 608a209f8..1d8d7294d 100644 --- a/trunk/paradiseo-moeo/src/utils/moeoBestObjVecStat.h +++ b/trunk/paradiseo-moeo/src/utils/moeoBestObjVecStat.h @@ -1,7 +1,7 @@ /* * * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2009 -* +* * * Waldo Cancino, Arnaud Liefooghe * @@ -62,15 +62,15 @@ public: /** Return the best solutions for an given objective function * @param which the objective function number - */ - const MOEOT & bestindividuals(unsigned int which) { + */ + const MOEOT & bestindividuals(unsigned int which) { typedef typename moeoObjVecStat::Traits traits; if(which > traits::nObjectives() ) throw std::logic_error("which is larger than the number of objectives"); - return *(best_individuals[which]); + return *(best_individuals[which]); } private : - + /** Vector of iterators pointing to best individuals for each objective function */ std::vector::const_iterator> best_individuals; @@ -85,7 +85,7 @@ private : return a.objectiveVector()[which] < b.objectiveVector()[which]; return a.objectiveVector()[which] > b.objectiveVector()[which]; - } + } unsigned which; bool maxim; @@ -95,9 +95,9 @@ private : void doit(const eoPop& _pop) { typedef typename moeoObjVecStat::Traits traits; - + value().resize(traits::nObjectives()); - + for (unsigned o = 0; o < traits::nObjectives(); ++o) { typename eoPop::const_iterator it = std::max_element(_pop.begin(), _pop.end(), CmpObjVec(o, traits::maximizing(o))); @@ -107,4 +107,4 @@ private : } // default }; -#endif \ No newline at end of file +#endif