purge.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 * This file is part of Gecode, the generic constraint 00010 * development environment: 00011 * http://www.gecode.org 00012 * 00013 * Permission is hereby granted, free of charge, to any person obtaining 00014 * a copy of this software and associated documentation files (the 00015 * "Software"), to deal in the Software without restriction, including 00016 * without limitation the rights to use, copy, modify, merge, publish, 00017 * distribute, sublicense, and/or sell copies of the Software, and to 00018 * permit persons to whom the Software is furnished to do so, subject to 00019 * the following conditions: 00020 * 00021 * The above copyright notice and this permission notice shall be 00022 * included in all copies or substantial portions of the Software. 00023 * 00024 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00025 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00026 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00027 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00028 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00029 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00030 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00031 * 00032 */ 00033 00034 namespace Gecode { namespace Int { 00035 00036 template<class OptTask, class PL> 00037 ExecStatus 00038 purge(Space& home, Propagator& p, TaskArray<OptTask>& t) { 00039 int n=t.size(); 00040 for (int i=n; i--; ) 00041 if (t[i].excluded()) { 00042 t[i].cancel(home,p,PL::pc); t[i]=t[--n]; 00043 } 00044 t.size(n); 00045 00046 return (t.size() < 2) ? home.ES_SUBSUMED(p) : ES_OK; 00047 } 00048 00049 template<class OptTask, class PL, class Cap> 00050 ExecStatus 00051 purge(Space& home, Propagator& p, TaskArray<OptTask>& t, Cap c) { 00052 int n=t.size(); 00053 for (int i=n; i--; ) 00054 if (t[i].excluded()) { 00055 t[i].cancel(home,p,PL::pc); t[i]=t[--n]; 00056 } 00057 t.size(n); 00058 if (t.size() == 1) { 00059 if (t[0].mandatory()) 00060 GECODE_ME_CHECK(c.gq(home, t[0].c())); 00061 else if (c.min() < t[0].c()) 00062 return ES_OK; 00063 } 00064 00065 return (t.size() < 2) ? home.ES_SUBSUMED(p) : ES_OK; 00066 } 00067 00068 }} 00069 00070 // STATISTICS: int-prop