00001 /* 00002 * <moSimpleMoveTabuList.h> 00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007 00004 * (C) OPAC Team, LIFL, 2002-2007 00005 * 00006 * Sébastien Cahon, Jean-Charles Boisson (Jean-Charles.Boisson@lifl.fr) 00007 * 00008 * This software is governed by the CeCILL license under French law and 00009 * abiding by the rules of distribution of free software. You can use, 00010 * modify and/ or redistribute the software under the terms of the CeCILL 00011 * license as circulated by CEA, CNRS and INRIA at the following URL 00012 * "http://www.cecill.info". 00013 * 00014 * As a counterpart to the access to the source code and rights to copy, 00015 * modify and redistribute granted by the license, users are provided only 00016 * with a limited warranty and the software's author, the holder of the 00017 * economic rights, and the successive licensors have only limited liability. 00018 * 00019 * In this respect, the user's attention is drawn to the risks associated 00020 * with loading, using, modifying and/or developing or reproducing the 00021 * software by the user in light of its specific status of free software, 00022 * that may mean that it is complicated to manipulate, and that also 00023 * therefore means that it is reserved for developers and experienced 00024 * professionals having in-depth computer knowledge. Users are therefore 00025 * encouraged to load and test the software's suitability as regards their 00026 * requirements in conditions enabling the security of their systems and/or 00027 * data to be ensured and, more generally, to use and operate it in the 00028 * same conditions as regards security. 00029 * The fact that you are presently reading this means that you have had 00030 * knowledge of the CeCILL license and that you accept its terms. 00031 * 00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr 00033 * Contact: paradiseo-help@lists.gforge.inria.fr 00034 * 00035 */ 00036 00037 #ifndef __moSimpleMoveTabuList_h 00038 #define __moSimpleMoveTabuList_h 00039 00040 #include <list> 00041 #include <iterator> 00042 00043 #include "moTabuList.h" 00044 00046 template <class M> 00047 class moSimpleMoveTabuList: public moTabuList < M > 00048 { 00049 00050 public: 00051 00053 typedef typename M::EOType EOT; 00054 00056 /* 00057 \param __size The maximum size of the move tabu list. 00058 */ 00059 moSimpleMoveTabuList(unsigned int __size): maxSize(__size) 00060 { 00061 currentSize=0; 00062 } 00063 00065 00070 bool 00071 operator () (const M & __move, const EOT & __sol) 00072 { 00073 typename std::list<M>::iterator it; 00074 00075 it=tabuList.begin(); 00076 while(it!=tabuList.end()&&(!((*it)==__move))) 00077 { 00078 it++; 00079 } 00080 00081 return it!=tabuList.end(); 00082 } 00083 00084 void 00085 add (const M & __move, const EOT & __sol) 00086 { 00087 if(currentSize!=0) 00088 { 00089 // Useful in the case of a move has been kept thanks to the moAspirCrit. 00090 // In this case, the move can already be in the tabuList. 00091 removeMove(__move); 00092 } 00093 00094 tabuList.push_back(__move); 00095 00096 if(currentSize==maxSize) 00097 { 00098 tabuList.erase(tabuList.begin()); 00099 } 00100 else 00101 { 00102 currentSize++; 00103 } 00104 } 00105 00106 void 00107 update () 00108 { 00109 //nothing to do 00110 } 00111 00112 void 00113 init () 00114 { 00115 //nothing to do 00116 } 00117 00118 private: 00119 00121 00124 void 00125 removeMove(const M & __move) 00126 { 00127 typename std::list<M>::iterator it; 00128 00129 it=tabuList.begin(); 00130 while(it!=tabuList.end()&&(!((*it)==__move))) 00131 { 00132 it++; 00133 } 00134 00135 if(it!=tabuList.end()) 00136 { 00137 tabuList.erase(it); 00138 } 00139 } 00140 00142 unsigned int maxSize; 00143 00145 unsigned int currentSize; 00146 00148 std::list<M> tabuList; 00149 }; 00150 00151 #endif
1.4.7