- Main Page
- Namespaces
- Classes
- Files

- Search for |

# moSimpleSolutionTabuList.h

    00001 /*
    00002 * <moSimpleSolutionTabuList.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 __moSimpleSolutionTabuList_h
    00038 #define __moSimpleSolutionTabuList_h
    00039
    00040 #include <list>
    00041 #include <iterator>
    00042
    00043 #include "moTabuList.h"
    00044
    00046 template <class M>
    00047 class moSimpleSolutionTabuList: public moTabuList < M >
    00048 {
    00049
    00050 public:
    00051
    00053   typedef typename M::EOType EOT;
    00054
    00056
    00059   moSimpleSolutionTabuList(unsigned int __size): maxSize(__size)
    00060   {
    00061     currentSize=0;
    00062   }
    00063
    00065
    00070   bool operator () (const M & __move, const EOT & __sol)
    00071   {
    00072     typename std::list<EOT>::iterator it;
    00073
    00074     M _move=(M)__move;
    00075     EOT _sol=(EOT) __sol;
    00076
    00077     _move(_sol);
    00078
    00079     it=tabuList.begin();
    00080     while(it!=tabuList.end()&&(!((*it)==_sol)))
    00081       {
    00082         it++;
    00083       }
    00084
    00085     return it!=tabuList.end();
    00086   }
    00087
    00088   void
    00089   add (const M & __move, const EOT & __sol)
    00090   {
    00091     M _move=(M)__move;
    00092     EOT _sol=(EOT) _sol;
    00093
    00094     _move(_sol);
    00095
    00096     if(currentSize!=0)
    00097       {
    00098         // Useful in the case of a solution has been kept thanks to the moAspirCrit.
    00099         // In this case, the solution can already be in the tabuList.
    00100         removeSolution(_sol);
    00101       }
    00102
    00103     tabuList.push_back(_sol);
    00104
    00105     if(currentSize==maxSize)
    00106       {
    00107         tabuList.erase(tabuList.begin());
    00108       }
    00109     else
    00110       {
    00111         currentSize++;
    00112       }
    00113   }
    00114
    00115   void
    00116   update ()
    00117   {
    00118     //nothing to do
    00119   }
    00120
    00121   void
    00122   init ()
    00123   {
    00124     //nothing to do
    00125   }
    00126
    00127 private:
    00128
    00130
    00133   void
    00134   removeSolution(const EOT & __sol)
    00135   {
    00136     typename std::list<EOT>::iterator it;
    00137
    00138     it=tabuList.begin();
    00139     while(it!=tabuList.end()&&(!((*it)==__sol)))
    00140       {
    00141         it++;
    00142       }
    00143
    00144     if(it!=tabuList.end())
    00145       {
    00146         tabuList.erase(it);
    00147       }
    00148   }
    00149
    00151   unsigned int maxSize;
    00152
    00154   unsigned int currentSize;
    00155
    00157   std::list<EOT> tabuList;
    00158 };
    00159
    00160 #endif