restart.icc
Go to the documentation of this file.00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Christian Schulte <schulte@gecode.org> 00005 * 00006 * Copyright: 00007 * Christian Schulte, 2004 00008 * 00009 * Last modified: 00010 * $Date: 2008-02-22 02:44:55 +0100 (Fri, 22 Feb 2008) $ by $Author: schulte $ 00011 * $Revision: 6273 $ 00012 * 00013 * This file is part of Gecode, the generic constraint 00014 * development environment: 00015 * http://www.gecode.org 00016 * 00017 * Permission is hereby granted, free of charge, to any person obtaining 00018 * a copy of this software and associated documentation files (the 00019 * "Software"), to deal in the Software without restriction, including 00020 * without limitation the rights to use, copy, modify, merge, publish, 00021 * distribute, sublicense, and/or sell copies of the Software, and to 00022 * permit persons to whom the Software is furnished to do so, subject to 00023 * the following conditions: 00024 * 00025 * The above copyright notice and this permission notice shall be 00026 * included in all copies or substantial portions of the Software. 00027 * 00028 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00029 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00030 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00031 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00032 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00033 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00034 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00035 * 00036 */ 00037 00038 namespace Gecode { 00039 00040 /* 00041 * Control for restart best solution search engine 00042 * 00043 */ 00044 00045 template <class T> 00046 Restart<T>::Restart(T* s, const Search::Options& o) : 00047 Gecode::DFS<T>(s,o), 00048 root(s->status() == SS_FAILED ? NULL : s->clone()), best(NULL) { 00049 // Failure and propagation must not be counted, has happened already 00050 // in the DFS constructor 00051 } 00052 00053 template <class T> 00054 forceinline 00055 Restart<T>::~Restart(void) { 00056 delete best; 00057 delete root; 00058 } 00059 00060 template <class T> 00061 forceinline T* 00062 Restart<T>::next(void) { 00063 if (best != NULL) { 00064 dynamic_cast<T*>(root)->constrain(dynamic_cast<T*>(best)); 00065 this->e.clone++; 00066 if (root->status(this->e.propagate) == SS_FAILED) { 00067 this->e.reset(); 00068 } else { 00069 this->e.reset(root->clone()); 00070 } 00071 } 00072 Space* b = this->e.explore(); 00073 delete best; 00074 best = (b != NULL) ? b->clone() : NULL; 00075 return dynamic_cast<T*>(b); 00076 } 00077 00078 00079 00080 00081 /* 00082 * Restart convenience 00083 * 00084 */ 00085 00086 template <class T> 00087 T* 00088 restart(T* s, const Search::Options& o) { 00089 Restart<T> b(s,o); 00090 T* l = NULL; 00091 while (T* n = b.next()) { 00092 delete l; l = n; 00093 } 00094 return l; 00095 } 00096 00097 } 00098 00099 // STATISTICS: search-any