00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038 #include <gecode/int/rel.hh>
00039
00040 namespace Gecode { namespace Int { namespace Dom {
00041
00042 template<class View, ReifyMode rm>
00043 forceinline
00044 ReRange<View,rm>::ReRange(Home home, View x, int min0, int max0, BoolView b)
00045 : ReUnaryPropagator<View,PC_INT_DOM,BoolView>(home,x,b),
00046 min(min0), max(max0) {}
00047
00048 template<class View, ReifyMode rm>
00049 ExecStatus
00050 ReRange<View,rm>::post(Home home, View x, int min, int max, BoolView b) {
00051 if (min == max) {
00052 return Rel::ReEqDomInt<View,BoolView,rm>::post(home,x,min,b);
00053 } else if ((min > max) || (max < x.min()) || (min > x.max())) {
00054 if (rm == RM_PMI)
00055 return ES_OK;
00056 GECODE_ME_CHECK(b.zero(home));
00057 } else if ((min <= x.min()) && (x.max() <= max)) {
00058 if (rm == RM_IMP)
00059 return ES_OK;
00060 GECODE_ME_CHECK(b.one(home));
00061 } else if (b.one()) {
00062 if (rm == RM_PMI)
00063 return ES_OK;
00064 GECODE_ME_CHECK(x.gq(home,min));
00065 GECODE_ME_CHECK(x.lq(home,max));
00066 } else if (b.zero()) {
00067 if (rm == RM_IMP)
00068 return ES_OK;
00069 Iter::Ranges::Singleton r(min,max);
00070 GECODE_ME_CHECK(x.minus_r(home,r,false));
00071 } else {
00072 (void) new (home) ReRange<View,rm>(home,x,min,max,b);
00073 }
00074 return ES_OK;
00075 }
00076
00077
00078 template<class View, ReifyMode rm>
00079 forceinline
00080 ReRange<View,rm>::ReRange(Space& home, bool share, ReRange& p)
00081 : ReUnaryPropagator<View,PC_INT_DOM,BoolView>(home,share,p),
00082 min(p.min), max(p.max) {}
00083
00084 template<class View, ReifyMode rm>
00085 Actor*
00086 ReRange<View,rm>::copy(Space& home, bool share) {
00087 return new (home) ReRange<View,rm>(home,share,*this);
00088 }
00089
00090 template<class View, ReifyMode rm>
00091 ExecStatus
00092 ReRange<View,rm>::propagate(Space& home, const ModEventDelta&) {
00093 if (b.one()) {
00094 if (rm != RM_PMI) {
00095 GECODE_ME_CHECK(x0.gq(home,min));
00096 GECODE_ME_CHECK(x0.lq(home,max));
00097 }
00098 return home.ES_SUBSUMED(*this);
00099 } else if (b.zero()) {
00100 if (rm != RM_IMP) {
00101 Iter::Ranges::Singleton r(min,max);
00102 GECODE_ME_CHECK(x0.minus_r(home,r,false));
00103 }
00104 return home.ES_SUBSUMED(*this);
00105 } else if ((x0.max() <= max) && (x0.min() >= min)) {
00106 if (rm != RM_IMP)
00107 GECODE_ME_CHECK(b.one_none(home));
00108 return home.ES_SUBSUMED(*this);
00109 } else if ((x0.max() < min) || (x0.min() > max)) {
00110 if (rm != RM_PMI)
00111 GECODE_ME_CHECK(b.zero_none(home));
00112 return home.ES_SUBSUMED(*this);
00113 } else if (!x0.range()) {
00114 ViewRanges<View> i_x(x0);
00115 Iter::Ranges::Singleton i_mm(min,max);
00116
00117 switch (Iter::Ranges::compare(i_x,i_mm)) {
00118 case Iter::Ranges::CS_SUBSET:
00119 if (rm != RM_IMP)
00120 GECODE_ME_CHECK(b.one_none(home));
00121 return home.ES_SUBSUMED(*this);
00122 case Iter::Ranges::CS_DISJOINT:
00123 if (rm != RM_PMI)
00124 GECODE_ME_CHECK(b.zero_none(home));
00125 return home.ES_SUBSUMED(*this);
00126 case Iter::Ranges::CS_NONE:
00127 break;
00128 default: GECODE_NEVER;
00129 }
00130 return ES_FIX;
00131 }
00132 return ES_FIX;
00133 }
00134
00135 }}}
00136
00137
00138