set-op.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-03-03 16:38:41 +0100 (Wed, 03 Mar 2010) $ 00011 * $Revision: 10359 $ 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 Sequence { 00039 00041 enum TakesStatus { 00042 TS_NO, 00043 TS_YES, 00044 TS_MAYBE 00045 }; 00046 00048 template<class View> 00049 forceinline TakesStatus 00050 takes(const View& x, int s) { 00051 if (x.in(s)) 00052 return x.assigned() ? TS_YES : TS_MAYBE; 00053 else 00054 return TS_NO; 00055 } 00057 template<class View> 00058 forceinline TakesStatus 00059 takes(const View& x, const IntSet& s) { 00060 if ((x.max() < s.min()) || (x.min() > s.max())) 00061 return TS_NO; 00062 ViewRanges<View> ix(x); 00063 IntSetRanges is(s); 00064 switch (Iter::Ranges::compare(ix,is)) { 00065 case Iter::Ranges::CS_SUBSET: return TS_YES; 00066 case Iter::Ranges::CS_DISJOINT: return TS_NO; 00067 case Iter::Ranges::CS_NONE: return TS_MAYBE; 00068 default: GECODE_NEVER; 00069 } 00070 return TS_MAYBE; 00071 } 00072 00074 template<class View> 00075 forceinline bool 00076 includes(const View& x, int s) { 00077 return x.assigned() && x.in(s); 00078 } 00080 template<class View> 00081 forceinline bool 00082 includes(const View& x, const IntSet& s) { 00083 if ((x.max() < s.min()) || (x.min() > s.max())) 00084 return false; 00085 ViewRanges<View> ix(x); 00086 IntSetRanges is(s); 00087 return Iter::Ranges::subset(ix,is); 00088 } 00089 00091 template<class View> 00092 forceinline bool 00093 excludes(const View& x, int s) { 00094 return !x.in(s); 00095 } 00097 template<class View> 00098 forceinline bool 00099 excludes(const View& x, const IntSet& s) { 00100 if ((x.max() < s.min()) || (x.min() > s.max())) 00101 return true; 00102 ViewRanges<View> ix(x); 00103 IntSetRanges is(s); 00104 return Iter::Ranges::disjoint(ix,is); 00105 } 00106 00108 template<class View> 00109 forceinline bool 00110 undecided(const View& x, int s) { 00111 return !x.assigned() && x.in(s); 00112 } 00114 template<class View> 00115 forceinline bool 00116 undecided(const View& x, const IntSet& s) { 00117 if ((x.max() < s.min()) || (x.min() > s.max())) 00118 return false; 00119 ViewRanges<View> ix(x); 00120 IntSetRanges is(s); 00121 return Iter::Ranges::compare(ix,is) == Iter::Ranges::CS_NONE; 00122 } 00123 00125 template<class View> 00126 forceinline ModEvent 00127 include(Space& home, View& x, int s) { 00128 return x.eq(home,s); 00129 } 00131 template<class View> 00132 forceinline ModEvent 00133 include(Space& home, View& x, const IntSet& s) { 00134 IntSetRanges is(s); 00135 return x.inter_r(home,is,false); 00136 } 00137 00139 template<class View> 00140 forceinline ModEvent 00141 exclude(Space& home, View& x, int s) { 00142 return x.nq(home,s); 00143 } 00145 template<class View> 00146 forceinline ModEvent 00147 exclude(Space& home, View& x, const IntSet& s) { 00148 IntSetRanges is(s); 00149 return x.minus_r(home,is,false); 00150 } 00151 00152 }}} 00153 00154 // STATISTICS: int-prop