gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.2.0/gecode/int/arithmetic/abs.icc

@@ -0,0 +1,278 @@
+/* -*- 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: 2008-07-11 10:49:55 +0200 (Fri, 11 Jul 2008) $ by $Author: tack $
+ *     $Revision: 7348 $
+ *
+ *  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 ES_SUBSUMED(p,sizeof(*p));
+    }
+
+    if (x1.assigned()) {
+      if (x0.min() >= 0) {
+        GECODE_ME_CHECK(x0.eq(home,x1.val()));
+        return ES_SUBSUMED(p,sizeof(*p));
+      } else if (x0.max() <= 0) {
+        GECODE_ME_CHECK(x0.eq(home,-x1.val()));
+        return ES_SUBSUMED(p,sizeof(*p));
+      } else if (x1.val() == 0) {
+        GECODE_ME_CHECK(x0.eq(home,0));
+        return ES_SUBSUMED(p,sizeof(*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 ES_SUBSUMED(p,home);
+      }
+    }
+
+    if (x0.min() >= 0)
+      GECODE_REWRITE(p,(Eq<View,View>::post(home,x0,x1)));
+
+    if (x0.max() <= 0)
+      GECODE_REWRITE(p,(Eq<MinusView,View>::post(home,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(Space* home, View x0, View x1)
+    : BinaryPropagator<View,PC_INT_BND>(home,x0,x1) {}
+
+  template <class View>
+  ExecStatus
+  AbsBnd<View>::post(Space* 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,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 void
+  AbsBnd<View>::post(Space* home, Reflection::VarMap& vars,
+                     const Reflection::ActorSpec& spec) {
+     spec.checkArity(2);
+     View x0(home, vars, spec[0]);
+     View x1(home, vars, spec[1]);
+     (void) new (home) AbsBnd<View>(home,x0,x1);
+  }
+
+  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(ModEventDelta med) const {
+    if (View::me(med) == ME_INT_VAL)
+      return PC_UNARY_LO;
+    return PC_BINARY_LO;
+  }
+
+  template <class View>
+  ExecStatus
+  AbsBnd<View>::propagate(Space* home, ModEventDelta) {
+    return prop_abs_bnd<View,Rel::EqBnd>(home, this, x0, x1);
+  }
+
+  template <class View>
+  Support::Symbol
+  AbsBnd<View>::ati(void) {
+    return Reflection::mangle<View>("Gecode::Int::Arithmetic::AbsBnd");
+  }
+
+  template <class View>
+  Reflection::ActorSpec
+  AbsBnd<View>::spec(const Space* home, Reflection::VarMap& m) const {
+    return BinaryPropagator<View,PC_INT_BND>::spec(home, m, ati());
+  }
+
+  template <class View>
+  forceinline
+  AbsDom<View>::AbsDom(Space* home, View x0, View x1)
+    : BinaryPropagator<View,PC_INT_DOM>(home,x0,x1) {}
+
+  template <class View>
+  ExecStatus
+  AbsDom<View>::post(Space* 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,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 void
+  AbsDom<View>::post(Space* home, Reflection::VarMap& vars,
+                     const Reflection::ActorSpec& spec) {
+     spec.checkArity(2);
+     View x0(home, vars, spec[0]);
+     View x1(home, vars, spec[1]);
+     (void) new (home) AbsDom<View>(home,x0,x1);
+  }
+
+  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(ModEventDelta med) const {
+    if (View::me(med) == ME_INT_VAL)
+      return PC_UNARY_LO;
+    if (View::me(med) == ME_INT_DOM)
+      return PC_BINARY_HI;
+    return PC_BINARY_LO;
+  }
+
+  template <class View>
+  ExecStatus
+  AbsDom<View>::propagate(Space* home, ModEventDelta med) {
+    if (View::me(med) != ME_INT_DOM) {
+      GECODE_ES_CHECK((prop_abs_bnd<View,Rel::EqDom>(home, this, x0, x1)));
+      return ES_NOFIX_PARTIAL(this,View::med(ME_INT_DOM));
+    }
+
+    {
+      ViewRanges<View> i(x0), j(x0);
+
+      using namespace Iter::Ranges;
+      Positive<ViewRanges<View> > p(i);
+      Negative<ViewRanges<View> > n(j);
+
+      Minus<Negative<ViewRanges<View> > > m(n);
+
+      Union<Positive<ViewRanges<View> >,
+        Minus<Negative<ViewRanges<View> > > > u(p,m);
+      
+      GECODE_ME_CHECK(x1.inter_r(home,u,false));
+
+    }
+
+    {
+      ViewRanges<View> i(x1), j(x1);
+
+      using namespace Iter::Ranges;
+      Minus<ViewRanges<View> > m(j);
+
+      Union<ViewRanges<View>,Minus<ViewRanges<View> > > u(i,m);
+      
+      GECODE_ME_CHECK(x0.inter_r(home,u,false));
+    }
+
+    if (x1.assigned())
+      return ES_SUBSUMED(this,home);
+
+    if (x0.min() >= 0)
+      GECODE_REWRITE(this,(Rel::EqDom<View,View>::post(home,x0,x1)));
+
+    if (x0.max() <= 0) {
+      MinusView mx0(x0);
+      GECODE_REWRITE(this,(Rel::EqDom<MinusView,View>::post(home,mx0,x1)));
+    }
+
+    return ES_FIX;
+  }
+
+  template <class View>
+  Support::Symbol
+  AbsDom<View>::ati(void) {
+    return Reflection::mangle<View>("Gecode::Int::Arithmetic::AbsDom");
+  }
+
+  template <class View>
+  Reflection::ActorSpec
+  AbsDom<View>::spec(const Space* home, Reflection::VarMap& m) const {
+    return BinaryPropagator<View,PC_INT_DOM>::spec(home, m, ati());
+  }
+
+}}}
+
+// STATISTICS: int-prop
+

data/ext/gecode-2.2.0/gecode/int/arithmetic/divmod.icc

@@ -0,0 +1,496 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2008
+ *
+ *  Last modified:
+ *     $Date: 2008-07-11 16:57:02 +0200 (Fri, 11 Jul 2008) $ by $Author: tack $
+ *     $Revision: 7368 $
+ *
+ *  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, bool towardsMinInf>
+  forceinline ExecStatus
+  prop_div_plus_bnd(Space* home, Propagator* p, VA x0, VB x1, VC x2) {
+    assert(pos(x0) && pos(x1) && !neg(x2));
+    bool mod;
+    do {
+      mod = false;
+      {
+        ModEvent me;
+        if (towardsMinInf)
+          me = x2.lq(home,f_d_p<Val>(x0.max(),x1.min()));
+        else
+          me = x2.lq(home,c_d_p<Val>(x0.max(),x1.min()));
+        if (me_failed(me)) return ES_FAILED;
+        mod |= me_modified(me);
+      }
+      {
+        ModEvent me;
+        if (towardsMinInf)
+          me = x2.gq(home,f_d_p<Val>(x0.min(),x1.max()));
+        else
+          me = x2.gq(home,c_d_p<Val>(x0.min(),x1.max()));
+        if (me_failed(me)) return ES_FAILED;
+        mod |= me_modified(me);
+      }
+      {
+        ModEvent me;
+        if (towardsMinInf)
+          me = x0.le(home,m<Val>(x1.max(),
+                                 static_cast<Val>(x2.max())+
+                                 static_cast<Val>(1)));
+        else
+          me = x0.lq(home,m<Val>(x1.max(),x2.max()));
+        if (me_failed(me)) return ES_FAILED;
+        mod |= me_modified(me);
+      }
+      {
+        ModEvent me;
+        if (towardsMinInf)
+          me = x0.gq(home,m<Val>(x1.min(),x2.min()));
+        else
+          me = x0.gr(home,m<Val>(x1.min(),
+                                 static_cast<Val>(x2.min())-
+                                 static_cast<Val>(1)));
+        if (me_failed(me)) return ES_FAILED;
+        mod |= me_modified(me);
+      }
+      {
+        if (x2.min() > 0) {
+          ModEvent me;
+          if (towardsMinInf)
+            me = x1.lq(home,f_d_p<Val>(x0.max(),x2.min()));
+          else if (x2.min() != 1) {
+            me = x1.lq(home,c_d_p<Val>(x0.max(),
+                                       static_cast<Val>(x2.min())-
+                                       static_cast<Val>(1)));
+          } else
+            me = ME_INT_NONE;
+          if (me_failed(me)) return ES_FAILED;
+          mod |= me_modified(me);
+        }
+      }
+      {
+        ModEvent me;
+        if (towardsMinInf)
+          me = x1.gq(home,c_d_p<Val>(x0.min(),
+            static_cast<Val>(x2.max())+static_cast<Val>(1)));
+        else
+          me = x1.gq(home,f_d_p<Val>(x0.min(),
+            static_cast<Val>(x2.max())+static_cast<Val>(1)));
+        if (me_failed(me)) return ES_FAILED;
+        mod |= me_modified(me);
+      }
+    } while (mod);
+    return x0.assigned() && x1.assigned() ?
+      ES_SUBSUMED(p,sizeof(*p)) : ES_FIX;
+  }
+
+  template <class Val, class VA, class VB, class VC, bool towardsMinInf>
+  forceinline
+  DivPlusBnd<Val,VA,VB,VC,towardsMinInf>
+  ::DivPlusBnd(Space* 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, bool towardsMinInf>
+  forceinline
+  DivPlusBnd<Val,VA,VB,VC,towardsMinInf>
+  ::DivPlusBnd(Space* home, bool share, 
+               DivPlusBnd<Val,VA,VB,VC,towardsMinInf>& 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, bool towardsMinInf>
+  Actor*
+  DivPlusBnd<Val,VA,VB,VC,towardsMinInf>::copy(Space* home, bool share) {
+    return new (home) DivPlusBnd<Val,VA,VB,VC,towardsMinInf>(home,
+                                                             share,*this);
+  }
+
+  template <class Val, class VA, class VB, class VC, bool towardsMinInf>
+  ExecStatus
+  DivPlusBnd<Val,VA,VB,VC,towardsMinInf>
+  ::propagate(Space* home, ModEventDelta) {
+    return prop_div_plus_bnd<Val,VA,VB,VC,towardsMinInf>(home,this,x0,x1,x2);
+  }
+
+  template <class Val, class VA, class VB, class VC, bool towardsMinInf>
+  forceinline ExecStatus
+  DivPlusBnd<Val,VA,VB,VC,towardsMinInf>
+  ::post(Space* home, VA x0, VB x1, VC x2) {
+    GECODE_ME_CHECK(x0.gr(home,0));
+    GECODE_ME_CHECK(x1.gr(home,0));
+    if (towardsMinInf) {
+      GECODE_ME_CHECK(x2.gq(home,floor(static_cast<double>(x0.min()) / 
+                                       static_cast<double>(x1.max()))));
+    } else {
+      GECODE_ME_CHECK(x2.gq(home,ceil(static_cast<double>(x0.min()) / 
+                                      static_cast<double>(x1.max()))));      
+    }
+    (void)
+      new (home) DivPlusBnd<double,VA,VB,VC,towardsMinInf>(home,x0,x1,x2);
+    return ES_OK;
+  }
+
+  template <class Val, class VA, class VB, class VC, bool towardsMinInf>
+  forceinline void
+  DivPlusBnd<Val,VA,VB,VC,towardsMinInf>
+  ::post(Space* home, Reflection::VarMap& vars,
+         const Reflection::ActorSpec& spec) {
+     spec.checkArity(3);
+     VA x0(home, vars, spec[0]);
+     VB x1(home, vars, spec[1]);
+     VC x2(home, vars, spec[2]);
+     (void) new (home) DivPlusBnd<Val,VA,VB,VC,towardsMinInf>(home,x0,x1,x2);
+  }
+
+  template <class Val, class VA, class VB, class VC, bool towardsMinInf>
+  Support::Symbol
+  DivPlusBnd<Val,VA,VB,VC,towardsMinInf>::ati(void) {
+    return Reflection::mangle<VA,VB,VC,Val>
+      ("Gecode::Int::Arithmetic::DivPlusBnd",towardsMinInf);
+  }
+
+  template <class Val, class VA, class VB, class VC, bool towardsMinInf>
+  Reflection::ActorSpec
+  DivPlusBnd<Val,VA,VB,VC,towardsMinInf>
+  ::spec(const Space* home, Reflection::VarMap& m) const {
+    return MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND>
+      ::spec(home, m, ati());
+  }
+
+
+  /*
+   * Bounds consistent multiplication
+   *
+   */
+  template <class View>
+  forceinline
+  DivBnd<View>::DivBnd(Space* 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, 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.le(home,std::max(m<double>(x1.max(),x2.max()+1),
+                                        m<double>(x1.min(),x2.min()-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()) {
+      GECODE_ME_CHECK(x2.eq(home,f_d(x0.val(),x1.val())));
+      return ES_SUBSUMED(this,sizeof(*this));
+    }
+
+    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()) {
+      GECODE_ME_CHECK(x2.eq(home,f_d(x0.val(),x1.val())));
+      return ES_SUBSUMED(this,sizeof(*this));
+    }
+
+    return ES_NOFIX;
+
+  prop_xxn:
+    assert(any(x0) && any(x1) && neg(x2));
+
+    GECODE_ME_CHECK(x0.le(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()) {
+      GECODE_ME_CHECK(x2.eq(home,f_d(x0.val(),x1.val())));
+      return ES_SUBSUMED(this,sizeof(*this));
+    }
+    return ES_NOFIX;
+
+  prop_xnx:
+    assert(any(x0) && neg(x1) && any(x2));
+
+    GECODE_ME_CHECK(x0.le(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()) {
+      GECODE_ME_CHECK(x2.eq(home,f_d(x0.val(),x1.val())));
+      return ES_SUBSUMED(this,sizeof(*this));
+    }
+    return ES_NOFIX;
+
+  rewrite_ppp:
+    GECODE_REWRITE(this,(DivPlusBnd<double,IntView,IntView,IntView>
+                         ::post(home,x0,x1,x2)));
+  rewrite_nnp:
+    GECODE_REWRITE(this,(DivPlusBnd<double,MinusView,MinusView,IntView>
+                         ::post(home,x0,x1,x2)));
+  rewrite_pnn:
+    GECODE_REWRITE(this,(DivPlusBnd<double,IntView,MinusView,MinusView,false>
+                         ::post(home,x0,x1,x2)));
+  rewrite_npn:
+    GECODE_REWRITE(this,(DivPlusBnd<double,MinusView,IntView,MinusView,false>
+                         ::post(home,x0,x1,x2)));
+  }
+
+  template <class View>
+  ExecStatus
+  DivBnd<View>::post(Space* 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,x0,x1,x2);
+  post_pnn:
+    return DivPlusBnd<double,IntView,MinusView,MinusView,false>::post(home,x0,x1,x2);
+  post_npn:
+    return DivPlusBnd<double,MinusView,IntView,MinusView,false>::post(home,x0,x1,x2);
+  }
+
+  template <class View>
+  forceinline void
+  DivBnd<View>::post(Space* home, Reflection::VarMap& vars,
+                   const Reflection::ActorSpec& spec) {
+     spec.checkArity(3);
+     View x0(home, vars, spec[0]);
+     View x1(home, vars, spec[1]);
+     View x2(home, vars, spec[2]);
+     (void) new (home) DivBnd<View>(home,x0,x1,x2);
+  }
+
+  template <class View>
+  Support::Symbol
+  DivBnd<View>::ati(void) {
+    return Reflection::mangle<View>("Gecode::Int::Arithmetic::DivBnd");
+  }
+
+  template <class View>
+  Reflection::ActorSpec
+  DivBnd<View>::spec(const Space* home, Reflection::VarMap& m) const {
+    return TernaryPropagator<View,PC_INT_BND>::spec(home, m, ati());
+  }
+
+  /*
+   * Propagator for x0 != 0 /\ (x1 != 0 => x0*x1>0) /\ abs(x1)<abs(x0)
+   *
+   */
+
+  template <class View>
+  forceinline
+  DivMod<View>::DivMod(Space* home, View x0, View x1)
+    : BinaryPropagator<View,PC_INT_BND>(home,x0,x1) {}
+
+  template <class View>
+  forceinline ExecStatus
+  DivMod<View>::post(Space* home, View x0, View x1) {
+    GECODE_ME_CHECK(x0.nq(home,0));
+    (void) new (home) DivMod<View>(home,x0,x1);
+    return ES_OK;
+  }
+
+  template <class View>
+  forceinline void
+  DivMod<View>::post(Space* home, Reflection::VarMap& vars,
+                        const Reflection::ActorSpec& spec) {
+     spec.checkArity(2);
+     View x0(home, vars, spec[0]);
+     View x1(home, vars, spec[1]);
+     (void) new (home) DivMod<View>(home,x0,x1);
+  }
+
+  template <class View>
+  forceinline
+  DivMod<View>::DivMod(Space* home, bool share, 
+                             DivMod<View>& p)
+  : BinaryPropagator<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, ModEventDelta) {
+    bool signIsSame;
+    do {
+      signIsSame = true;
+      // The sign of x1 and x3 is the same
+      if (x0.min() > 0) {
+        GECODE_ME_CHECK(x1.gq(home, 0));
+      } else if (x0.max() < 0) {
+        GECODE_ME_CHECK(x1.lq(home, 0));
+      } else if (x1.min() > 0) {
+        GECODE_ME_CHECK(x0.gr(home, 0));
+      } else if (x1.max() < 0) {
+        GECODE_ME_CHECK(x0.le(home, 0));
+      } else {
+        signIsSame = false;
+      }
+      
+      // abs(x1) is less than abs(x0)
+      int x0max = std::max(x0.max(),std::max(-x0.max(),
+                           std::max(x0.min(),-x0.min())));
+      GECODE_ME_CHECK(x1.le(home, x0max));
+      GECODE_ME_CHECK(x1.gr(home, -x0max));
+
+      if (x0.min() > 0) {
+        int min = std::min(x1.min() < 0 ? -x1.min():x1.min(),
+                           x1.max() < 0 ? -x1.max():x1.max());
+        GECODE_ME_CHECK(x0.gr(home,min));  
+      } else if (x0.max() < 0) {
+        int min = std::min(x1.min() < 0 ? -x1.min():x1.min(),
+                           x1.max() < 0 ? -x1.max():x1.max());
+        GECODE_ME_CHECK(x0.le(home,-min));
+      }
+    } while (!signIsSame &&
+             (x0.min() > 0 || x0.max() < 0 || x1.min() > 0 || x1.max() < 0));
+
+    if (signIsSame) {
+      int maxx1 = std::max(x1.min() < 0 ? -x1.min():x1.min(),
+                           x1.max() < 0 ? -x1.max():x1.max());
+      int minx0 = std::min(x0.min() < 0 ? -x0.min():x0.min(),
+                           x0.max() < 0 ? -x0.max():x0.max());
+      if (maxx1 < minx0) {
+        return ES_SUBSUMED(this,home);
+      }
+    }
+    return ES_FIX;
+  }
+
+  template <class View>
+  Support::Symbol
+  DivMod<View>::ati(void) {
+    return Reflection::mangle<View>("Gecode::Int::Arithmetic::DivMod");
+  }
+
+  template <class View>
+  Reflection::ActorSpec
+  DivMod<View>::spec(const Space* home, Reflection::VarMap& m) const {
+    return BinaryPropagator<View,PC_INT_BND>::spec(home, m, ati());
+  }
+
+}}}
+
+// STATISTICS: int-prop