overload.hpp
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: 2010-07-15 12:52:54 +0200 (Thu, 15 Jul 2010) $ by $Author: tack $ 00011 * $Revision: 11200 $ 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 { namespace Scheduling { namespace Unary { 00039 00040 // Overload checking for mandatory tasks 00041 template<class ManTask> 00042 ExecStatus 00043 overload(Space& home, TaskArray<ManTask>& t) { 00044 TaskViewArray<typename TaskTraits<ManTask>::TaskViewFwd> f(t); 00045 sort<typename TaskTraits<ManTask>::TaskViewFwd,STO_LCT,true>(f); 00046 00047 Region r(home); 00048 OmegaTree<typename TaskTraits<ManTask>::TaskViewFwd> o(r,f); 00049 00050 for (int i=0; i<f.size(); i++) { 00051 o.insert(i); 00052 if (o.ect() > f[i].lct()) 00053 return ES_FAILED; 00054 } 00055 return ES_OK; 00056 } 00057 00058 // Overload checking for optional tasks 00059 template<class OptTask> 00060 ExecStatus 00061 overload(Space& home, Propagator& p, TaskArray<OptTask>& t) { 00062 TaskViewArray<typename TaskTraits<OptTask>::TaskViewFwd> f(t); 00063 sort<typename TaskTraits<OptTask>::TaskViewFwd,STO_LCT,true>(f); 00064 00065 Region r(home); 00066 OmegaLambdaTree<typename TaskTraits<OptTask>::TaskViewFwd> ol(r,f,false); 00067 00068 bool to_purge = false; 00069 00070 for (int i=0; i<f.size(); i++) { 00071 if (f[i].optional()) { 00072 ol.linsert(i); 00073 } else if (f[i].mandatory()) { 00074 ol.oinsert(i); 00075 if (ol.ect() > f[i].lct()) 00076 return ES_FAILED; 00077 } 00078 while (!ol.lempty() && (ol.lect() > f[i].lct())) { 00079 int j = ol.responsible(); 00080 GECODE_ME_CHECK(f[j].excluded(home)); 00081 ol.lremove(j); 00082 to_purge = true; 00083 } 00084 } 00085 00086 if (to_purge) 00087 GECODE_ES_CHECK((purge<OptTask,Int::PC_INT_BND>(home,p,t))); 00088 return ES_OK; 00089 } 00090 00091 }}} 00092 00093 // STATISTICS: scheduling-prop