conv.cpp
Go to the documentation of this file.00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Guido Tack <tack@gecode.org> 00005 * Christian Schulte <schulte@gecode.org> 00006 * Gabor Szokoli <szokoli@gecode.org> 00007 * 00008 * Copyright: 00009 * Guido Tack, 2004 00010 * Christian Schulte, 2004 00011 * Gabor Szokoli, 2004 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 #include <gecode/set/convex.hh> 00039 00040 namespace Gecode { namespace Set { namespace Convex { 00041 00042 Actor* 00043 Convex::copy(Space& home) { 00044 return new (home) Convex(home,*this); 00045 } 00046 00047 ExecStatus 00048 Convex::propagate(Space& home, const ModEventDelta&) { 00049 //I, drop ranges from UB that are shorter than cardMin 00050 //II, add range LB.smallest to LB.largest to LB 00051 //III, Drop ranges from UB that do not contain all elements of LB 00052 //that is: range.min()>LB.smallest or range.max()<LB.largest 00053 //This leaves only one range. 00054 //II 00055 if (x0.glbSize()>0) { 00056 GECODE_ME_CHECK( x0.include(home,x0.glbMin(),x0.glbMax()) ); 00057 } else { 00058 //If lower bound is empty, we can still constrain the cardinality 00059 //maximum with the width of the longest range in UB. 00060 //No need to do this if there is anything in LB because UB 00061 //becomes a single range then. 00062 LubRanges<SetView> ubRangeIt(x0); 00063 unsigned int maxWidth = 0; 00064 for (;ubRangeIt();++ubRangeIt) { 00065 assert(ubRangeIt()); 00066 maxWidth = std::max(maxWidth, ubRangeIt.width()); 00067 } 00068 GECODE_ME_CHECK( x0.cardMax(home,maxWidth) ); 00069 } 00070 00071 00072 //I + III 00073 00074 Region r; 00075 LubRanges<SetView> ubRangeIt(x0); 00076 Iter::Ranges::Cache ubRangeItC(r,ubRangeIt); 00077 00078 for (; ubRangeItC(); ++ubRangeItC) { 00079 if (ubRangeItC.width() < (unsigned int) x0.cardMin() 00080 || ubRangeItC.min() > x0.glbMin() //No need to test for empty lb. 00081 || ubRangeItC.max() < x0.glbMax() 00082 ) { 00083 GECODE_ME_CHECK( x0.exclude(home,ubRangeItC.min(), ubRangeItC.max()) ); 00084 } 00085 } 00086 if (x0.assigned()) 00087 return home.ES_SUBSUMED(*this); 00088 return ES_FIX; 00089 } 00090 00091 }}} 00092 00093 // STATISTICS: set-prop