gecode » int » dom

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, 2004 00008 * 00009 * Last modified: 00010 * $Date: 2009-11-24 20:31:15 +0100 (Tue, 24 Nov 2009) $ by $Author: schulte $ 00011 * $Revision: 10113 $ 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 Int { namespace Dom { 00039 00040 template<class View> 00041 forceinline 00042 ReIntSet<View>::ReIntSet 00043 (Home home, View x, const IntSet& s, BoolView b) 00044 : ReUnaryPropagator<View,PC_INT_DOM,BoolView>(home,x,b), is(s) { 00045 home.notice(*this,AP_DISPOSE); 00046 } 00047 00048 template<class View> 00049 forceinline size_t 00050 ReIntSet<View>::dispose(Space& home) { 00051 home.ignore(*this,AP_DISPOSE); 00052 is.~IntSet(); 00053 (void) ReUnaryPropagator<View,PC_INT_DOM,BoolView>::dispose(home); 00054 return sizeof(*this); 00055 } 00056 00057 template<class View> 00058 ExecStatus 00059 ReIntSet<View>::post(Home home, View x, const IntSet& s, BoolView b) { 00060 if (s.ranges() == 0) { 00061 GECODE_ME_CHECK(b.zero(home)); 00062 } else if (s.ranges() == 1) { 00063 return ReRange<View>::post(home,x,s.min(),s.max(),b); 00064 } else { 00065 (void) new (home) ReIntSet<View>(home,x,s,b); 00066 } 00067 return ES_OK; 00068 } 00069 00070 00071 template<class View> 00072 forceinline 00073 ReIntSet<View>::ReIntSet(Space& home, bool share, ReIntSet& p) 00074 : ReUnaryPropagator<View,PC_INT_DOM,BoolView>(home,share,p) { 00075 is.update(home,share,p.is); 00076 } 00077 00078 template<class View> 00079 Actor* 00080 ReIntSet<View>::copy(Space& home, bool share) { 00081 return new (home) ReIntSet(home,share,*this); 00082 } 00083 00084 template<class View> 00085 ExecStatus 00086 ReIntSet<View>::propagate(Space& home, const ModEventDelta&) { 00087 IntSetRanges i_is(is); 00088 if (b.one()) { 00089 GECODE_ME_CHECK(x0.inter_r(home,i_is,false)); goto subsumed; 00090 } 00091 if (b.zero()) { 00092 GECODE_ME_CHECK(x0.minus_r(home,i_is,false)); goto subsumed; 00093 } 00094 00095 { 00096 ViewRanges<View> i_x(x0); 00097 00098 switch (Iter::Ranges::compare(i_x,i_is)) { 00099 case Iter::Ranges::CS_SUBSET: 00100 GECODE_ME_CHECK(b.one_none(home)); goto subsumed; 00101 case Iter::Ranges::CS_DISJOINT: 00102 GECODE_ME_CHECK(b.zero_none(home)); goto subsumed; 00103 case Iter::Ranges::CS_NONE: 00104 break; 00105 default: GECODE_NEVER; 00106 } 00107 } 00108 00109 return ES_FIX; 00110 subsumed: 00111 return ES_SUBSUMED(*this,home); 00112 } 00113 00114 }}} 00115 00116 // STATISTICS: int-prop 00117