dep-selector-libgecode 1.0.0.alpha.0

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/arithmetic/abs.hpp

@@ -0,0 +1,236 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2004
+ *     Guido Tack, 2006
+ *
+ *  Last modified:
+ *     $Date: 2011-08-09 02:04:53 +1000 (Tue, 09 Aug 2011) $ by $Author: schulte $
+ *     $Revision: 12253 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining
+ *  a copy of this software and associated documentation files (the
+ *  "Software"), to deal in the Software without restriction, including
+ *  without limitation the rights to use, copy, modify, merge, publish,
+ *  distribute, sublicense, and/or sell copies of the Software, and to
+ *  permit persons to whom the Software is furnished to do so, subject to
+ *  the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be
+ *  included in all copies or substantial portions of the Software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+ *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ */
+
+#include <algorithm>
+
+namespace Gecode { namespace Int { namespace Arithmetic {
+
+  template<class View, template<class View0,class View1> class Eq>
+  ExecStatus
+  prop_abs_bnd(Space& home, Propagator& p, View x0, View x1) {
+    if (x0.assigned()) {
+      GECODE_ME_CHECK(x1.eq(home,(x0.val() < 0) ? -x0.val() : x0.val()));
+      return home.ES_SUBSUMED(p);
+    }
+
+    if (x1.assigned()) {
+      if (x0.min() >= 0) {
+        GECODE_ME_CHECK(x0.eq(home,x1.val()));
+        return home.ES_SUBSUMED(p);
+      } else if (x0.max() <= 0) {
+        GECODE_ME_CHECK(x0.eq(home,-x1.val()));
+        return home.ES_SUBSUMED(p);
+      } else if (x1.val() == 0) {
+        GECODE_ME_CHECK(x0.eq(home,0));
+        return home.ES_SUBSUMED(p);
+      } else {
+        int mp[2] = {-x1.val(),x1.val()};
+        Iter::Values::Array i(mp,2);
+        GECODE_ME_CHECK(x0.inter_v(home,i,false));
+        return home.ES_SUBSUMED(p);
+      }
+    }
+
+    if (x0.min() >= 0)
+      GECODE_REWRITE(p,(Eq<View,View>::post(home(p),x0,x1)));
+
+    if (x0.max() <= 0)
+      GECODE_REWRITE(p,(Eq<MinusView,View>::post(home(p),MinusView(x0),x1)));
+
+    GECODE_ME_CHECK(x1.lq(home,std::max(x0.max(),-x0.min())));
+    GECODE_ME_CHECK(x0.lq(home,x1.max()));
+    GECODE_ME_CHECK(x0.gq(home,-x1.max()));
+    return ES_NOFIX;
+  }
+
+  template<class View>
+  forceinline
+  AbsBnd<View>::AbsBnd(Home home, View x0, View x1)
+    : BinaryPropagator<View,PC_INT_BND>(home,x0,x1) {}
+
+  template<class View>
+  ExecStatus
+  AbsBnd<View>::post(Home home, View x0, View x1) {
+    if (x0.min() >= 0) {
+      return Rel::EqBnd<View,View>::post(home,x0,x1);
+    } else if (x0.max() <= 0) {
+      return Rel::EqBnd<MinusView,View>::post(home,MinusView(x0),x1);
+    } else {
+      assert(!x0.assigned());
+      GECODE_ME_CHECK(x1.gq(home,0));
+      if (x1.assigned()) {
+        int mp[2] = {-x1.val(),x1.val()};
+        Iter::Values::Array i(mp,2);
+        GECODE_ME_CHECK(x0.inter_v(home,i,false));
+      } else if (!same(x0,x1)) {
+        GECODE_ME_CHECK(x1.lq(home,std::max(-x0.min(),x0.max())));
+        (void) new (home) AbsBnd<View>(home,x0,x1);
+      }
+    }
+    return ES_OK;
+  }
+
+  template<class View>
+  forceinline
+  AbsBnd<View>::AbsBnd(Space& home, bool share, AbsBnd<View>& p)
+    : BinaryPropagator<View,PC_INT_BND>(home,share,p) {}
+
+  template<class View>
+  Actor*
+  AbsBnd<View>::copy(Space& home,bool share) {
+    return new (home) AbsBnd<View>(home,share,*this);
+  }
+
+  template<class View>
+  PropCost
+  AbsBnd<View>::cost(const Space&, const ModEventDelta& med) const {
+    if (View::me(med) == ME_INT_VAL)
+      return PropCost::unary(PropCost::LO);
+    else
+      return PropCost::binary(PropCost::LO);
+  }
+
+  template<class View>
+  ExecStatus
+  AbsBnd<View>::propagate(Space& home, const ModEventDelta&) {
+    return prop_abs_bnd<View,Rel::EqBnd>(home, *this, x0, x1);
+  }
+
+  template<class View>
+  forceinline
+  AbsDom<View>::AbsDom(Home home, View x0, View x1)
+    : BinaryPropagator<View,PC_INT_DOM>(home,x0,x1) {}
+
+  template<class View>
+  ExecStatus
+  AbsDom<View>::post(Home home, View x0, View x1) {
+    if (x0.min() >= 0) {
+      return Rel::EqDom<View,View>::post(home,x0,x1);
+    } else if (x0.max() <= 0) {
+      return Rel::EqDom<MinusView,View>::post(home,MinusView(x0),x1);
+    } else {
+      assert(!x0.assigned());
+      GECODE_ME_CHECK(x1.gq(home,0));
+      if (x1.assigned()) {
+        int mp[2] = {-x1.val(),x1.val()};
+        Iter::Values::Array i(mp,2);
+        GECODE_ME_CHECK(x0.inter_v(home,i,false));
+      } else if (!same(x0,x1)) {
+        GECODE_ME_CHECK(x1.lq(home,std::max(-x0.min(),x0.max())));
+        (void) new (home) AbsDom<View>(home,x0,x1);
+      }
+    }
+    return ES_OK;
+  }
+
+  template<class View>
+  forceinline
+  AbsDom<View>::AbsDom(Space& home, bool share, AbsDom<View>& p)
+    : BinaryPropagator<View,PC_INT_DOM>(home,share,p) {}
+
+  template<class View>
+  Actor*
+  AbsDom<View>::copy(Space& home,bool share) {
+    return new (home) AbsDom<View>(home,share,*this);
+  }
+
+  template<class View>
+  PropCost
+  AbsDom<View>::cost(const Space&, const ModEventDelta& med) const {
+    if (View::me(med) == ME_INT_VAL)
+      return PropCost::unary(PropCost::LO);
+    else
+      return PropCost::binary((View::me(med) == ME_INT_DOM) ?
+                              PropCost::HI : PropCost::LO);
+  }
+
+  template<class View>
+  ExecStatus
+  AbsDom<View>::propagate(Space& home, const ModEventDelta& med) {
+    if (View::me(med) != ME_INT_DOM) {
+      GECODE_ES_CHECK((prop_abs_bnd<View,Rel::EqDom>(home, *this, x0, x1)));
+      return home.ES_NOFIX_PARTIAL(*this,View::med(ME_INT_DOM));
+    }
+
+    Region r(home);
+
+    {
+      ViewRanges<View> i(x0), j(x0);
+
+      using namespace Iter::Ranges;
+      Positive<ViewRanges<View> > p(i);
+      Negative<ViewRanges<View> > n(j);
+
+      Minus m(r,n);
+
+      Union<Positive<ViewRanges<View> >,Minus> u(p,m);
+
+      GECODE_ME_CHECK(x1.inter_r(home,u,false));
+
+    }
+
+    {
+      ViewRanges<View> i(x1), j(x1);
+
+      using namespace Iter::Ranges;
+      Minus m(r,j);
+
+      Union<ViewRanges<View>,Minus> u(i,m);
+
+      GECODE_ME_CHECK(x0.inter_r(home,u,false));
+    }
+
+    if (x1.assigned())
+      return home.ES_SUBSUMED(*this);
+
+    if (x0.min() >= 0)
+      GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x0,x1)));
+
+    if (x0.max() <= 0) {
+      MinusView mx0(x0);
+      GECODE_REWRITE(*this,(Rel::EqDom<MinusView,View>::post(home(*this),mx0,x1)));
+    }
+
+    return ES_FIX;
+  }
+
+}}}
+
+// STATISTICS: int-prop
+

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/arithmetic/divmod.hpp

@@ -0,0 +1,350 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2008
+ *
+ *  Last modified:
+ *     $Date: 2010-03-04 03:32:21 +1100 (Thu, 04 Mar 2010) $ by $Author: schulte $
+ *     $Revision: 10364 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  Permission is hereby granted, free of charge, to any person obtaining
+ *  a copy of this software and associated documentation files (the
+ *  "Software"), to deal in the Software without restriction, including
+ *  without limitation the rights to use, copy, modify, merge, publish,
+ *  distribute, sublicense, and/or sell copies of the Software, and to
+ *  permit persons to whom the Software is furnished to do so, subject to
+ *  the following conditions:
+ *
+ *  The above copyright notice and this permission notice shall be
+ *  included in all copies or substantial portions of the Software.
+ *
+ *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+ *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+ *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ */
+
+#include <gecode/int/linear.hh>
+
+namespace Gecode { namespace Int { namespace Arithmetic {
+
+  /*
+   * Positive bounds consistent division
+   *
+   */
+
+  template<class Val, class VA, class VB, class VC>
+  forceinline
+  DivPlusBnd<Val,VA,VB,VC>
+  ::DivPlusBnd(Home home, VA x0, VB x1, VC x2)
+    : MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND>
+  (home,x0,x1,x2) {}
+
+  template<class Val, class VA, class VB, class VC>
+  forceinline
+  DivPlusBnd<Val,VA,VB,VC>
+  ::DivPlusBnd(Space& home, bool share,
+               DivPlusBnd<Val,VA,VB,VC>& p)
+    : MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND>
+  (home,share,p) {}
+
+  template<class Val, class VA, class VB, class VC>
+  Actor*
+  DivPlusBnd<Val,VA,VB,VC>::copy(Space& home, bool share) {
+    return new (home) DivPlusBnd<Val,VA,VB,VC>(home,share,*this);
+  }
+
+  template<class Val, class VA, class VB, class VC>
+  ExecStatus
+  DivPlusBnd<Val,VA,VB,VC>
+  ::propagate(Space& home, const ModEventDelta&) {
+    assert(pos(x0) && pos(x1) && !neg(x2));
+    bool mod;
+    do {
+      mod = false;
+      GECODE_ME_CHECK_MODIFIED(mod,x2.lq(home,f_d_p<Val>(x0.max(),x1.min())));
+      GECODE_ME_CHECK_MODIFIED(mod,x2.gq(home,f_d_p<Val>(x0.min(),x1.max())));
+      GECODE_ME_CHECK_MODIFIED(mod,x0.le(home,m<Val>(x1.max(),
+                                              static_cast<Val>(x2.max())+
+                                              static_cast<Val>(1))));
+      GECODE_ME_CHECK_MODIFIED(mod,x0.gq(home,m<Val>(x1.min(),x2.min())));
+      if (x2.min() > 0) {
+          GECODE_ME_CHECK_MODIFIED(mod,
+            x1.lq(home,f_d_p<Val>(x0.max(),x2.min())));
+      }
+      GECODE_ME_CHECK_MODIFIED(mod,x1.gq(home,c_d_p<Val>(x0.min(),
+          static_cast<Val>(x2.max())+static_cast<Val>(1))));
+    } while (mod);
+    return x0.assigned() && x1.assigned() ?
+      home.ES_SUBSUMED(*this) : ES_FIX;
+  }
+
+  template<class Val, class VA, class VB, class VC>
+  forceinline ExecStatus
+  DivPlusBnd<Val,VA,VB,VC>
+  ::post(Home home, VA x0, VB x1, VC x2) {
+    GECODE_ME_CHECK(x0.gr(home,0));
+    GECODE_ME_CHECK(x1.gr(home,0));
+    GECODE_ME_CHECK(x2.gq(home,floor(static_cast<double>(x0.min()) /
+                                     static_cast<double>(x1.max()))));
+    (void)
+      new (home) DivPlusBnd<double,VA,VB,VC>(home,x0,x1,x2);
+    return ES_OK;
+  }
+
+
+  /*
+   * Bounds consistent division
+   *
+   */
+  template<class View>
+  forceinline
+  DivBnd<View>::DivBnd(Home home, View x0, View x1, View x2)
+    : TernaryPropagator<View,PC_INT_BND>(home,x0,x1,x2) {}
+
+  template<class View>
+  forceinline
+  DivBnd<View>::DivBnd(Space& home, bool share, DivBnd<View>& p)
+    : TernaryPropagator<View,PC_INT_BND>(home,share,p) {}
+
+  template<class View>
+  Actor*
+  DivBnd<View>::copy(Space& home, bool share) {
+    return new (home) DivBnd<View>(home,share,*this);
+  }
+
+  template<class View>
+  ExecStatus
+  DivBnd<View>::propagate(Space& home, const ModEventDelta&) {
+    if (pos(x1)) {
+      if (pos(x2) || pos(x0)) goto rewrite_ppp;
+      if (neg(x2) || neg(x0)) goto rewrite_npn;
+      goto prop_xpx;
+    }
+    if (neg(x1)) {
+      if (neg(x2) || pos(x0)) goto rewrite_pnn;
+      if (pos(x2) || neg(x0)) goto rewrite_nnp;
+      goto prop_xnx;
+    }
+    if (pos(x2)) {
+      if (pos(x0)) goto rewrite_ppp;
+      if (neg(x0)) goto rewrite_nnp;
+      goto prop_xxp;
+    }
+    if (neg(x2)) {
+      if (pos(x0)) goto rewrite_pnn;
+      if (neg(x0)) goto rewrite_npn;
+      goto prop_xxn;
+    }
+    assert(any(x1) && any(x2));
+    GECODE_ME_CHECK(x0.lq(home,std::max(m<double>(x1.max(),x2.max()+1)-1,
+                                        m<double>(x1.min(),x2.min()-1)-1)));
+    GECODE_ME_CHECK(x0.gq(home,std::min(m<double>(x1.min(),x2.max()+1),
+                                        m<double>(x1.max(),x2.min()-1))));
+    return ES_NOFIX;
+
+  prop_xxp:
+    assert(any(x0) && any(x1) && pos(x2));
+
+    GECODE_ME_CHECK(x0.le(home, m<double>(x1.max(),x2.max()+1)));
+    GECODE_ME_CHECK(x0.gq(home, m<double>(x1.min(),x2.max()+1)));
+
+    if (pos(x0)) goto rewrite_ppp;
+    if (neg(x0)) goto rewrite_nnp;
+
+    GECODE_ME_CHECK(x1.lq(home,f_d_p<double>(x0.max(),x2.min())));
+    GECODE_ME_CHECK(x1.gq(home,c_d(x0.min(),x2.min())));
+
+    if (x0.assigned() && x1.assigned())
+      goto subsumed;
+    return ES_NOFIX;
+
+  prop_xpx:
+    assert(any(x0) && pos(x1) && any(x2));
+
+    GECODE_ME_CHECK(x0.le(home, m<double>(x1.max(),x2.max()+1)));
+    GECODE_ME_CHECK(x0.gq(home, m<double>(x1.max(),x2.min()-1)));
+
+    if (pos(x0)) goto rewrite_ppp;
+    if (neg(x0)) goto rewrite_npn;
+
+    GECODE_ME_CHECK(x2.lq(home,f_d(x0.max(),x1.min())));
+    GECODE_ME_CHECK(x2.gq(home,f_d(x0.min(),x1.min())));
+
+    if (x0.assigned() && x1.assigned())
+      goto subsumed;
+    return ES_NOFIX;
+
+  prop_xxn:
+    assert(any(x0) && any(x1) && neg(x2));
+
+    GECODE_ME_CHECK(x0.lq(home, m<double>(x1.min(),x2.min()-1)));
+    GECODE_ME_CHECK(x0.gq(home, m<double>(x1.max(),x2.min()-1)));
+
+    if (pos(x0)) goto rewrite_pnn;
+    if (neg(x0)) goto rewrite_npn;
+
+    if (x2.max() != -1)
+      GECODE_ME_CHECK(x1.lq(home,c_d(x0.min(),x2.max()+1)));
+    if (x2.max() != -1)
+      GECODE_ME_CHECK(x1.gq(home,c_d(x0.max(),x2.max()+1)));
+
+    if (x0.assigned() && x1.assigned())
+      goto subsumed;
+    return ES_NOFIX;
+
+  prop_xnx:
+    assert(any(x0) && neg(x1) && any(x2));
+
+    GECODE_ME_CHECK(x0.lq(home, m<double>(x1.min(),x2.min()-1)));
+    GECODE_ME_CHECK(x0.gq(home, m<double>(x1.min(),x2.max()+1)));
+
+    if (pos(x0)) goto rewrite_pnn;
+    if (neg(x0)) goto rewrite_nnp;
+
+    GECODE_ME_CHECK(x2.lq(home,f_d(x0.min(),x1.max())));
+    GECODE_ME_CHECK(x2.gq(home,f_d(x0.max(),x1.max())));
+
+    if (x0.assigned() && x1.assigned())
+      goto subsumed;
+    return ES_NOFIX;
+
+  rewrite_ppp:
+    GECODE_REWRITE(*this,(DivPlusBnd<double,IntView,IntView,IntView>
+                         ::post(home(*this),x0,x1,x2)));
+  rewrite_nnp:
+    GECODE_REWRITE(*this,(DivPlusBnd<double,MinusView,MinusView,IntView>
+                         ::post(home(*this),MinusView(x0),MinusView(x1),x2)));
+  rewrite_pnn:
+    GECODE_REWRITE(*this,(DivPlusBnd<double,IntView,MinusView,MinusView>
+                         ::post(home(*this),x0,MinusView(x1),MinusView(x2))));
+  rewrite_npn:
+    GECODE_REWRITE(*this,(DivPlusBnd<double,MinusView,IntView,MinusView>
+                         ::post(home(*this),MinusView(x0),x1,MinusView(x2))));
+  subsumed:
+    assert(x0.assigned() && x1.assigned());
+    int result = std::abs(x0.val()) / std::abs(x1.val());
+    if (x0.val()/x1.val() < 0)
+      result = -result;
+    GECODE_ME_CHECK(x2.eq(home,result));
+    return home.ES_SUBSUMED(*this);
+  }
+
+  template<class View>
+  ExecStatus
+  DivBnd<View>::post(Home home, View x0, View x1, View x2) {
+    GECODE_ME_CHECK(x1.nq(home, 0));
+    if (pos(x0)) {
+      if (pos(x1) || pos(x2)) goto post_ppp;
+      if (neg(x1) || neg(x2)) goto post_pnn;
+    } else if (neg(x0)) {
+      if (neg(x1) || pos(x2)) goto post_nnp;
+      if (pos(x1) || neg(x2)) goto post_npn;
+    } else if (pos(x1)) {
+      if (pos(x2)) goto post_ppp;
+      if (neg(x2)) goto post_npn;
+    } else if (neg(x1)) {
+      if (pos(x2)) goto post_nnp;
+      if (neg(x2)) goto post_pnn;
+    }
+    (void) new (home) DivBnd<View>(home,x0,x1,x2);
+    return ES_OK;
+
+  post_ppp:
+    return DivPlusBnd<double,IntView,IntView,IntView>::post(home,x0,x1,x2);
+  post_nnp:
+    return DivPlusBnd<double,MinusView,MinusView,IntView>::post(home,
+      MinusView(x0),MinusView(x1),x2);
+  post_pnn:
+    return DivPlusBnd<double,IntView,MinusView,MinusView>::post(home,
+      x0,MinusView(x1),MinusView(x2));
+  post_npn:
+    return DivPlusBnd<double,MinusView,IntView,MinusView>::post(home,
+      MinusView(x0),x1,MinusView(x2));
+  }
+
+
+  /*
+   * Propagator for x0 != 0 /\ (x1 != 0 => x0*x1>0) /\ abs(x1)<abs(x0)
+   *
+   */
+
+  template<class View>
+  forceinline
+  DivMod<View>::DivMod(Home home, View x0, View x1, View x2)
+    : TernaryPropagator<View,PC_INT_BND>(home,x0,x1,x2) {}
+
+  template<class View>
+  forceinline ExecStatus
+  DivMod<View>::post(Home home, View x0, View x1, View x2) {
+    GECODE_ME_CHECK(x1.nq(home,0));
+    (void) new (home) DivMod<View>(home,x0,x1,x2);
+    return ES_OK;
+  }
+
+  template<class View>
+  forceinline
+  DivMod<View>::DivMod(Space& home, bool share, DivMod<View>& p)
+  : TernaryPropagator<View,PC_INT_BND>(home,share,p) {}
+
+  template<class View>
+  Actor*
+  DivMod<View>::copy(Space& home, bool share) {
+    return new (home) DivMod<View>(home,share,*this);
+  }
+
+  template<class View>
+  ExecStatus
+  DivMod<View>::propagate(Space& home, const ModEventDelta&) {
+    bool signIsSame;
+    do {
+      signIsSame = true;
+      // The sign of x0 and x2 is the same
+      if (x0.min() >= 0) {
+        GECODE_ME_CHECK(x2.gq(home, 0));
+      } else if (x0.max() <= 0) {
+        GECODE_ME_CHECK(x2.lq(home, 0));
+      } else if (x2.min() > 0) {
+        GECODE_ME_CHECK(x0.gq(home, 0));
+      } else if (x2.max() < 0) {
+        GECODE_ME_CHECK(x0.lq(home, 0));
+      } else {
+        signIsSame = false;
+      }
+
+      // abs(x2) is less than abs(x1)
+      int x1max = std::max(x1.max(),std::max(-x1.max(),
+                           std::max(x1.min(),-x1.min())));
+      GECODE_ME_CHECK(x2.le(home, x1max));
+      GECODE_ME_CHECK(x2.gr(home, -x1max));
+
+      int x2absmin = any(x2) ? 0 : (pos(x2) ? x2.min() : -x2.max());
+      Iter::Ranges::Singleton sr(-x2absmin,x2absmin);
+      GECODE_ME_CHECK(x1.minus_r(home,sr,false));
+    } while (!signIsSame &&
+             (x0.min() > 0 || x0.max() < 0 || x2.min() > 0 || x2.max() < 0));
+
+    if (signIsSame) {
+      int x2max = std::max(x2.max(),std::max(-x2.max(),
+                           std::max(x2.min(),-x2.min())));
+      int x1absmin = any(x1) ? 0 : (pos(x1) ? x1.min() : -x1.max());
+      if (x2max < x1absmin)
+        return home.ES_SUBSUMED(*this);
+    }
+    return ES_FIX;
+  }
+
+}}}
+
+// STATISTICS: int-prop