Generated on Mon Aug 25 11:35:40 2008 for Gecode by doxygen 1.5.6

bab.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  *  Contributing authors:
00007  *     Guido Tack <tack@gecode.org>
00008  *
00009  *  Copyright:
00010  *     Christian Schulte, 2004
00011  *     Guido Tack, 2004
00012  *
00013  *  Last modified:
00014  *     $Date: 2008-02-22 02:44:55 +0100 (Fri, 22 Feb 2008) $ by $Author: schulte $
00015  *     $Revision: 6273 $
00016  *
00017  *  This file is part of Gecode, the generic constraint
00018  *  development environment:
00019  *     http://www.gecode.org
00020  *
00021  *  Permission is hereby granted, free of charge, to any person obtaining
00022  *  a copy of this software and associated documentation files (the
00023  *  "Software"), to deal in the Software without restriction, including
00024  *  without limitation the rights to use, copy, modify, merge, publish,
00025  *  distribute, sublicense, and/or sell copies of the Software, and to
00026  *  permit persons to whom the Software is furnished to do so, subject to
00027  *  the following conditions:
00028  *
00029  *  The above copyright notice and this permission notice shall be
00030  *  included in all copies or substantial portions of the Software.
00031  *
00032  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00033  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00034  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00035  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00036  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00037  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00038  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00039  *
00040  */
00041 
00042 namespace Gecode {
00043 
00044   /*
00045    * BAB search engine
00046    *
00047    */
00048 
00049   namespace Search {
00050 
00051     forceinline
00052     BabEngine::BabEngine(unsigned int c_d0, unsigned int a_d,
00053                          Stop* st, size_t sz)
00054       : EngineCtrl(st,sz), rcs(a_d), cur(NULL),
00055         mark(0), es(ES_SOLUTION), best(NULL),
00056         c_d(c_d0), d(0) {}
00057 
00058 
00059     forceinline void
00060     BabEngine::init(Space* s) {
00061       cur = s;
00062     }
00063 
00064     forceinline size_t
00065     BabEngine::stacksize(void) const {
00066       return rcs.stacksize();
00067     }
00068 
00069     forceinline
00070     BabEngine::~BabEngine(void) {
00071       rcs.reset();
00072       delete best;
00073       delete cur;
00074     }
00075   }
00076 
00077   /*
00078    * Control for bab search engine
00079    *
00080    */
00081 
00082   template <class T>
00083   forceinline
00084   BAB<T>::BAB(T* s, const Search::Options& o)
00085     : Search::BAB(s,o.c_d,o.a_d,o.stop,sizeof(T)) {}
00086 
00087   template <class T>
00088   forceinline T*
00089   BAB<T>::next(void) {
00090     Space *s1, *s2;
00091     while (e.explore(s1,s2) == Search::BabEngine::ES_CONSTRAIN)
00092       dynamic_cast<T*>(s1)->constrain(dynamic_cast<T*>(s2));
00093     return dynamic_cast<T*>(s1);
00094   }
00095 
00096 
00097 
00098 
00099   /*
00100    * BAB convenience
00101    *
00102    */
00103 
00104   template <class T>
00105   T*
00106   bab(T* s, const Search::Options& o) {
00107     BAB<T> b(s,o);
00108     T* l = NULL;
00109     while (T* n = b.next()) {
00110       delete l; l = n;
00111     }
00112     return l;
00113   }
00114 
00115 }
00116 
00117 // STATISTICS: search-any