gecoder-with-gecode 0.9.0 → 0.9.1

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

@@ -1,279 +0,0 @@
-/* -*- 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-02-06 18:48:22 +0100 (Wed, 06 Feb 2008) $ by $Author: schulte $
- *     $Revision: 6102 $
- *
- *  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_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)) {
-        (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_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)) {
-        (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_bnd<View,Rel::EqDom>(home, this, x0, x1)));
-      return ES_NOFIX_PARTIAL(this,View::med(ME_INT_DOM));
-    }
-
-    Iter::Ranges::Singleton positive(0, Limits::max);
-    Iter::Ranges::Singleton negative(Limits::min, 0);
-
-    IntVarRanges xr1(x0);
-    IntVarRanges xr2(x0);
-
-    Iter::Ranges::Inter<Iter::Ranges::Singleton,
-      IntVarRanges> posInter(positive, xr1);
-    Iter::Ranges::Inter<Iter::Ranges::Singleton,
-      IntVarRanges> negInter(negative, xr2);
-    Iter::Ranges::Minus<Iter::Ranges::Inter<Iter::Ranges::Singleton,
-      IntVarRanges> > mneg(negInter);
-    Iter::Ranges::Union<Iter::Ranges::Inter<Iter::Ranges::Singleton,
-      IntVarRanges>,
-      Iter::Ranges::Minus<Iter::Ranges::Inter<
-      Iter::Ranges::Singleton,
-      IntVarRanges> > >
-      u(posInter, mneg);
-
-    GECODE_ME_CHECK(x1.inter_r(home, u));
-
-    IntVarRanges x1r1(x1);
-    IntVarRanges x1r2(x1);
-
-    Iter::Ranges::Minus<IntVarRanges> x1m(x1r2);
-    Iter::Ranges::Union<IntVarRanges,
-      Iter::Ranges::Minus<IntVarRanges> > u2(x1r1,x1m);
-    GECODE_ME_CHECK(x0.inter_r(home, u2));
-
-    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.1.1/gecode/int/arithmetic/max.icc

@@ -1,253 +0,0 @@
-/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2004
- *
- *  Last modified:
- *     $Date: 2008-01-31 18:29:16 +0100 (Thu, 31 Jan 2008) $ by $Author: tack $
- *     $Revision: 6017 $
- *
- *  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/rel.hh"
-
-namespace Gecode { namespace Int { namespace Arithmetic {
-
-  /*
-   * Ternary bounds-consistent maximum
-   *
-   */
-
-  template <class View>
-  forceinline
-  Max<View>::Max(Space* home, View x0, View x1, View x2)
-    : TernaryPropagator<View,PC_INT_BND>(home,x0,x1,x2) {}
-
-  template <class View>
-  ExecStatus
-  Max<View>::post(Space* home, View x0, View x1, View x2) {
-    if (same(x0,x1))
-      return Rel::EqBnd<View,View>::post(home,x0,x2);
-    if (same(x0,x2))
-      return Rel::Lq<View>::post(home,x1,x2);
-    if (same(x1,x2))
-      return Rel::Lq<View>::post(home,x0,x2);
-    (void) new (home) Max<View>(home,x0,x1,x2);
-    return ES_OK;
-  }
-
-  template <class View>
-  forceinline void
-  Max<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) Max<View>(home,x0,x1,x2);
-  }
-
-  template <class View>
-  forceinline
-  Max<View>::Max(Space* home, bool share, Max<View>& p)
-    : TernaryPropagator<View,PC_INT_BND>(home,share,p) {}
-
-  template <class View>
-  forceinline
-  Max<View>::Max(Space* home, bool share, Propagator& p,
-                 View x0, View x1, View x2)
-    : TernaryPropagator<View,PC_INT_BND>(home,share,p,x0,x1,x2) {}
-
-  template <class View>
-  Actor*
-  Max<View>::copy(Space* home, bool share) {
-    return new (home) Max<View>(home,share,*this);
-  }
-
-  template <class View>
-  ExecStatus
-  Max<View>::propagate(Space* home, ModEventDelta) {
-    bool mod = false;
-    do {
-      mod = false;
-      {
-        ModEvent me = x2.lq(home,std::max(x0.max(),x1.max()));
-        if (me_failed(me)) return ES_FAILED;
-        mod |= me_modified(me);
-      }
-      {
-        ModEvent me = x2.gq(home,std::max(x0.min(),x1.min()));
-        if (me_failed(me)) return ES_FAILED;
-        mod |= me_modified(me);
-      }
-      {
-        ModEvent me = x0.lq(home,x2.max());
-        if (me_failed(me)) return ES_FAILED;
-        mod |= me_modified(me);
-      }
-      {
-        ModEvent me = x1.lq(home,x2.max());
-        if (me_failed(me)) return ES_FAILED;
-        mod |= me_modified(me);
-      }
-    } while (mod);
-    if (x0.max() <= x1.min())
-      GECODE_REWRITE(this,(Rel::EqBnd<View,View>::post(home,x1,x2)));
-    if (x1.max() <= x0.min())
-      GECODE_REWRITE(this,(Rel::EqBnd<View,View>::post(home,x0,x2)));
-    return x0.assigned() && x1.assigned() && x2.assigned() ?
-      ES_SUBSUMED(this,sizeof(*this)) : ES_FIX;
-  }
-
-  template <class View>
-  Support::Symbol
-  Max<View>::ati(void) {
-    return Reflection::mangle<View>("Gecode::Int::Arithmetic::Max");
-  }
-
-  template <class View>
-  Reflection::ActorSpec
-  Max<View>::spec(const Space* home, Reflection::VarMap& m) const {
-    return TernaryPropagator<View,PC_INT_BND>::spec(home, m, ati());
-  }
-
-  /*
-   * Nary bounds-consistent maximum
-   *
-   */
-
-  template <class View>
-  forceinline
-  NaryMax<View>::NaryMax(Space* home, ViewArray<View>& x, View y)
-    : NaryOnePropagator<View,PC_INT_BND>(home,x,y) {}
-
-  template <class View>
-  ExecStatus
-  NaryMax<View>::post(Space* home, ViewArray<View>& x, View y) {
-    assert(x.size() > 0);
-    x.unique();
-    if (x.size() == 1)
-      return Rel::EqBnd<View,View>::post(home,x[0],y);
-    if (x.size() == 2)
-      return Max<View>::post(home,x[0],x[1],y);
-    if (x.same(y)) {
-      // Check whether y occurs in x
-      for (int i=x.size(); i--; )
-        GECODE_ES_CHECK(Rel::Lq<View>::post(home,x[i],y));
-    } else {
-      (void) new (home) NaryMax<View>(home,x,y);
-    }
-    return ES_OK;
-  }
-
-  template <class View>
-  forceinline void
-  NaryMax<View>::post(Space* home, Reflection::VarMap& vars,
-                      const Reflection::ActorSpec& spec) {
-    spec.checkArity(2);
-    ViewArray<View> x(home, vars, spec[0]);
-    View y(home, vars, spec[1]);
-    (void) new (home) NaryMax<View>(home,x,y);
-  }
-
-  template <class View>
-  forceinline
-  NaryMax<View>::NaryMax(Space* home, bool share, NaryMax<View>& p)
-    : NaryOnePropagator<View,PC_INT_BND>(home,share,p) {}
-
-  template <class View>
-  Actor*
-  NaryMax<View>::copy(Space* home, bool share) {
-    if (x.size() == 1)
-      return new (home) Rel::EqBnd<View,View>(home,share,*this,x[0],y);
-    if (x.size() == 2)
-      return new (home) Max<View>(home,share,*this,x[0],x[1],y);
-    return new (home) NaryMax<View>(home,share,*this);
-  }
-
-  /// Status of propagation for nary max
-  enum MaxPropStatus {
-    MPS_ASSIGNED  = 1<<0, ///< All views are assigned
-    MPS_REMOVED   = 1<<1, ///< A view is removed
-    MPS_NEW_BOUND = 1<<2  ///< Telling has found a new upper bound
-  };
-
-  template <class View>
-  ExecStatus
-  NaryMax<View>::propagate(Space* home, ModEventDelta) {
-  rerun:
-    assert(x.size() > 0);
-    int maxmax = x[x.size()-1].max();
-    int maxmin = x[x.size()-1].min();
-    for (int i = x.size()-1; i--; ) {
-      maxmax = std::max(x[i].max(),maxmax);
-      maxmin = std::max(x[i].min(),maxmin);
-    }
-    GECODE_ME_CHECK(y.lq(home,maxmax));
-    GECODE_ME_CHECK(y.gq(home,maxmin));
-    maxmin = y.min();
-    maxmax = y.max();
-    int status = MPS_ASSIGNED;
-    for (int i = x.size(); i--; ) {
-      ModEvent me = x[i].lq(home,maxmax);
-      if (me == ME_INT_FAILED)
-        return ES_FAILED;
-      if (me_modified(me) && (x[i].max() != maxmax))
-        status |= MPS_NEW_BOUND;
-      if (x[i].max() < maxmin) {
-        x.move_lst(i,home,this,PC_INT_BND);
-        status |= MPS_REMOVED;
-      } else if (!x[i].assigned())
-        status &= ~MPS_ASSIGNED;
-    }
-    if (x.size() == 0)
-      return ES_FAILED;
-    if ((status & MPS_REMOVED) != 0)
-      goto rerun;
-    if (((status & MPS_ASSIGNED) != 0) && y.assigned())
-      return ES_SUBSUMED(this,sizeof(*this));
-    return ((status & MPS_NEW_BOUND) != 0) ? ES_NOFIX : ES_FIX;
-  }
-
-  template <class View>
-  Support::Symbol
-  NaryMax<View>::ati(void) {
-    return Reflection::mangle<View>("Gecode::Int::Arithmetic::NaryMax");
-  }
-
-  template <class View>
-  Reflection::ActorSpec
-  NaryMax<View>::spec(const Space* home, Reflection::VarMap& m) const {
-    return NaryOnePropagator<View,PC_INT_BND>::spec(home, m, ati());
-  }
-
-}}}
-
-// STATISTICS: int-prop
-