00001 /* 00002 The Evolving Distribution Objects framework (EDO) is a template-based, 00003 ANSI-C++ evolutionary computation library which helps you to write your 00004 own estimation of distribution algorithms. 00005 00006 This library is free software; you can redistribute it and/or 00007 modify it under the terms of the GNU Lesser General Public 00008 License as published by the Free Software Foundation; either 00009 version 2.1 of the License, or (at your option) any later version. 00010 00011 This library is distributed in the hope that it will be useful, 00012 but WITHOUT ANY WARRANTY; without even the implied warranty of 00013 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00014 Lesser General Public License for more details. 00015 00016 You should have received a copy of the GNU Lesser General Public 00017 License along with this library; if not, write to the Free Software 00018 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 00019 00020 Copyright (C) 2010 Thales group 00021 */ 00022 /* 00023 Authors: 00024 Johann Dréo <johann.dreo@thalesgroup.com> 00025 Caner Candan <caner.candan@thalesgroup.com> 00026 */ 00027 00028 #ifndef _edoBounderBound_h 00029 #define _edoBounderBound_h 00030 00031 #include "edoBounder.h" 00032 00037 template < typename EOT > 00038 class edoBounderBound : public edoBounder< EOT > 00039 { 00040 public: 00041 edoBounderBound( EOT min, EOT max ) 00042 : edoBounder< EOT >( min, max ) 00043 {} 00044 00045 void operator()( EOT& x ) 00046 { 00047 unsigned int size = x.size(); 00048 assert(size > 0); 00049 00050 for (unsigned int d = 0; d < size; ++d) // browse all dimensions 00051 { 00052 if (x[d] < this->min()[d]) 00053 { 00054 x[d] = this->min()[d]; 00055 continue; 00056 } 00057 00058 if (x[d] > this->max()[d]) 00059 { 00060 x[d] = this->max()[d]; 00061 } 00062 } 00063 } 00064 }; 00065 00066 #endif // !_edoBounderBound_h