📄 insteadoftheworst.h
字号:
/* cpplibga, free library of genetic algorithms. Copyright (C) 2003 Burger Y.A. (aka Jo Kruger) This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USAContacts: address: planet Terra e-mail: jo_kruger@mail.ru kruger@selena.net.ua*/#ifndef __CPPLIBGA_PLACING_INSTEADOFTHEWORST_H__#define __CPPLIBGA_PLACING_INSTEADOFTHEWORST_H__#include <cpplibga/Predicates.h>#include <cpplibga/Types.h>namespace cpplibga{ namespace placing { class InsteadOfTheWorst { public: InsteadOfTheWorst() : count(0) { } counter_type getNumberOfReplacedSolutions() const {return count;} template<typename S, typename P, typename A> void place(S* solution, P* population, A* allocator) { typedef typename P::iterator Iter; Iter popbegin=population->begin(); Iter popend=population->end(); Iter worst=std::min_element(popbegin, popend, XLessThanY()); if((*worst)->calcFitness() < solution->calcFitness()) { allocator->Delete(*worst); *worst=solution; ++count; } else { allocator->Delete(solution); } } private: counter_type count; }; }}#endif
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -