restart.hh
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, 2009 00008 * 00009 * Last modified: 00010 * $Date: 2009-05-12 14:21:02 +0200 (Tue, 12 May 2009) $ by $Author: schulte $ 00011 * $Revision: 9063 $ 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 #ifndef __GECODE_SEARCH_SEQUENTIAL_RESTART_HH__ 00039 #define __GECODE_SEARCH_SEQUENTIAL_RESTART_HH__ 00040 00041 #include <gecode/search/sequential/dfs.hh> 00042 00043 namespace Gecode { namespace Search { namespace Sequential { 00044 00046 class Restart : public DFS { 00047 protected: 00049 Space* root; 00051 Space* best; 00052 public: 00054 Restart(Space* s, size_t sz, const Search::Options& o); 00056 Space* next(void); 00058 ~Restart(void); 00059 }; 00060 00061 forceinline 00062 Restart::Restart(Space* s, size_t sz, const Search::Options& o) : 00063 DFS(s,sz,o), 00064 root(s->status() == SS_FAILED ? NULL : s->clone()), best(NULL) {} 00065 00066 forceinline Space* 00067 Restart::next(void) { 00068 if (best != NULL) { 00069 root->constrain(*best); 00070 root = reset(root); 00071 } 00072 if (root == NULL) 00073 return NULL; 00074 delete best; 00075 best = DFS::next(); 00076 return (best != NULL) ? best->clone() : NULL; 00077 } 00078 00079 forceinline 00080 Restart::~Restart(void) { 00081 delete best; 00082 delete root; 00083 } 00084 00085 }}} 00086 00087 #endif 00088 00089 // STATISTICS: search-sequential