gecoder-with-gecode 0.7.1

data/ext/gecode-1.3.1/gecode/int/view/bool.icc

@@ -0,0 +1,270 @@
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2002
+ *
+ *  Last modified:
+ *     $Date: 2006-08-24 11:25:05 +0200 (Thu, 24 Aug 2006) $ by $Author: schulte $
+ *     $Revision: 3559 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  See the file "LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+namespace Gecode {
+
+  namespace Int {
+
+    /*
+     * Constructors and initialization
+     *
+     */
+    forceinline
+    BoolView::BoolView(void) {}
+    forceinline
+    BoolView::BoolView(const BoolVar& b) : IntView(b) {}
+    forceinline
+    BoolView::BoolView(const IntVar& x) : IntView(x) {
+      assert((variable()->min() >= 0) && (variable()->max() <= 1));
+    }
+    forceinline
+    BoolView::BoolView(const IntView& x) : IntView(x) {
+      assert((variable()->min() >= 0) && (variable()->max() <= 1));
+    }
+
+
+    /*
+     * Boolean domain tests
+     *
+     */
+    forceinline bool
+    BoolView::zero(void) const {
+      return var->max() == 0;
+    }
+    forceinline bool
+    BoolView::one(void) const {
+      return var->min() != 0;
+    }
+    forceinline bool
+    BoolView::none(void) const {
+      return ((var->min()+var->max()) == 1);
+    }
+
+
+    /*
+     * Boolean assignment operations
+     *
+     */
+    forceinline void
+    BoolView::t_zero_none(Space* home) {
+      var->t_zero_none(home);
+    }
+    forceinline void
+    BoolView::t_one_none(Space* home) {
+      var->t_one_none(home);
+    }
+
+    forceinline ModEvent
+    BoolView::t_zero(Space* home) {
+      if (one())  return ME_INT_FAILED;
+      if (zero()) return ME_INT_NONE;
+      t_zero_none(home);
+      return ME_INT_VAL;
+    }
+    forceinline ModEvent
+    BoolView::t_one(Space* home) {
+      if (zero()) return ME_INT_FAILED;
+      if (one())  return ME_INT_NONE;
+      t_one_none(home);
+      return ME_INT_VAL;
+    }
+
+
+    /*
+     * Cloning
+     *
+     */
+    forceinline void
+    BoolView::update(Space* home, bool share, BoolView& x) {
+      var = x.var->copy(home,share);
+    }
+
+    /*
+     * Negated Boolean views
+     *
+     */
+
+    /*
+     * Constructors and initialization
+     *
+     */
+    forceinline
+    NegBoolView::NegBoolView(void) {}
+    forceinline
+    NegBoolView::NegBoolView(const BoolView& b)
+      : DerivedViewBase<BoolView>(b) {}
+    forceinline void
+    NegBoolView::init(const BoolView& b) {
+      view = b;
+    }
+
+
+    /*
+     * Boolean domain tests
+     *
+     */
+    forceinline bool
+    NegBoolView::zero(void) const {
+      return view.one();
+    }
+    forceinline bool
+    NegBoolView::one(void) const {
+      return view.zero();
+    }
+    forceinline bool
+    NegBoolView::none(void) const {
+      return view.none();
+    }
+
+
+    /*
+     * Boolean assignment operations
+     *
+     */
+    forceinline void
+    NegBoolView::t_zero_none(Space* home) {
+      view.t_one_none(home);
+    }
+    forceinline void
+    NegBoolView::t_one_none(Space* home) {
+      view.t_zero_none(home);
+    }
+
+    forceinline ModEvent
+    NegBoolView::t_zero(Space* home) {
+      return view.t_one(home);
+    }
+    forceinline ModEvent
+    NegBoolView::t_one(Space* home) {
+      return view.t_zero(home);
+    }
+
+
+    /*
+     * Value access
+     *
+     */
+    forceinline int
+    NegBoolView::min(void) const {
+      return view.max();
+    }
+    forceinline int
+    NegBoolView::max(void) const {
+      return view.min();
+    }
+    forceinline int
+    NegBoolView::val(void) const {
+      return 1-view.val();
+    }
+
+
+    /*
+     * Domain tests
+     *
+     */
+    forceinline bool
+    NegBoolView::assigned(void) const {
+      return view.assigned();
+    }
+
+    /*
+     * Propagator modification events
+     *
+     */
+    forceinline ModEvent
+    NegBoolView::pme(const Propagator* p) {
+      return BoolView::pme(p);
+    }
+    forceinline PropModEvent
+    NegBoolView::pme(ModEvent me) {
+      return BoolView::pme(me);
+    }
+
+
+    /*
+     * Dependencies
+     *
+     */
+    forceinline void
+    NegBoolView::subscribe(Space* home, Propagator* p, PropCond pc,
+			   bool process) {
+      view.subscribe(home,p,pc,process);
+    }
+    forceinline void
+    NegBoolView::cancel(Space* home, Propagator* p, PropCond pc) {
+      view.cancel(home,p,pc);
+    }
+
+
+    /*
+     * Cloning
+     *
+     */
+    forceinline void
+    NegBoolView::update(Space* home, bool share, NegBoolView& b) {
+      view.update(home,share,b.view);
+    }
+
+  }
+
+
+  /*
+   * View comparison
+   *
+   */
+  forceinline bool
+  same(const Int::NegBoolView& x, const Int::NegBoolView& y) {
+    return same(x.base(),y.base());
+  }
+  forceinline bool
+  before(const Int::NegBoolView& x, const Int::NegBoolView& y) {
+    return before(x.base(),y.base());
+  }
+
+  namespace Int {
+
+    /*
+     * Test sharing between Boolean and negated Boolean views
+     *
+     */
+    forceinline BoolTest
+    bool_test(const BoolView& b0, const BoolView& b1) {
+      return same(b0,b1) ? BT_SAME : BT_NONE;
+    }
+    forceinline BoolTest
+    bool_test(const BoolView& b0, const NegBoolView& b1) {
+      return same(b0,b1.base()) ? BT_COMP : BT_NONE;
+    }
+    forceinline BoolTest
+    bool_test(const NegBoolView& b0, const BoolView& b1) {
+      return same(b0.base(),b1) ? BT_COMP : BT_NONE;
+    }
+    /// Test whether views \a b0 and \a b1 are the same
+    forceinline BoolTest
+    bool_test(const NegBoolView& b0, const NegBoolView& b1) {
+      return same(b0,b1) ? BT_SAME : BT_NONE;
+    }
+
+  }
+
+}
+
+// STATISTICS: int-var

data/ext/gecode-1.3.1/gecode/int/view/constint.icc

@@ -0,0 +1,306 @@
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2003
+ *
+ *  Last modified:
+ *     $Date: 2006-08-24 11:25:05 +0200 (Thu, 24 Aug 2006) $ by $Author: schulte $
+ *     $Revision: 3559 $
+ *
+ *  This file is part of Gecode, the generic constraint
+ *  development environment:
+ *     http://www.gecode.org
+ *
+ *  See the file "LICENSE" for information on usage and
+ *  redistribution of this file, and for a
+ *     DISCLAIMER OF ALL WARRANTIES.
+ *
+ */
+
+namespace Gecode {
+
+  namespace Int {
+
+    /*
+     * Constructors and initialization
+     *
+     */
+    forceinline
+    ConstIntView::ConstIntView(void) {}
+    forceinline
+    ConstIntView::ConstIntView(int n) : x(n) {}
+    forceinline void
+    ConstIntView::init(int n) {
+      x=n;
+    }
+
+
+    /*
+     * Value access
+     *
+     */
+    forceinline int
+    ConstIntView::min(void) const {
+      return x;
+    }
+    forceinline int
+    ConstIntView::max(void) const {
+      return x;
+    }
+    forceinline int
+    ConstIntView::med(void) const {
+      return x;
+    }
+    forceinline int
+    ConstIntView::val(void) const {
+      return x;
+    }
+
+    forceinline unsigned int
+    ConstIntView::size(void) const {
+      return 1;
+    }
+    forceinline unsigned int
+    ConstIntView::width(void) const {
+      return 1;
+    }
+    forceinline unsigned int
+    ConstIntView::regret_min(void) const {
+      return 0;
+    }
+    forceinline unsigned int
+    ConstIntView::regret_max(void) const {
+      return 0;
+    }
+
+
+    /*
+     * Domain tests
+     *
+     */
+    forceinline bool
+    ConstIntView::range(void) const {
+      return true;
+    }
+    forceinline bool
+    ConstIntView::assigned(void) const {
+      return true;
+    }
+
+    forceinline bool
+    ConstIntView::in(int n) const {
+      return n == x;
+    }
+    forceinline bool
+    ConstIntView::in(double n) const {
+      return n == x;
+    }
+
+
+    /*
+     * Domain update by value
+     *
+     */
+    forceinline ModEvent
+    ConstIntView::lq(Space*, int n) {
+      return (x <= n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+    forceinline ModEvent
+    ConstIntView::lq(Space*, double n) {
+      return (x <= n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+
+    forceinline ModEvent
+    ConstIntView::le(Space*, int n) {
+      return (x < n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+    forceinline ModEvent
+    ConstIntView::le(Space*, double n) {
+      return (x < n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+
+    forceinline ModEvent
+    ConstIntView::gq(Space*, int n) {
+      return (x >= n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+    forceinline ModEvent
+    ConstIntView::gq(Space*, double n) {
+      return (x >= n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+
+    forceinline ModEvent
+    ConstIntView::gr(Space*, int n) {
+      return (x > n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+    forceinline ModEvent
+    ConstIntView::gr(Space*, double n) {
+      return (x > n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+
+    forceinline ModEvent
+    ConstIntView::nq(Space*, int n) {
+      return (x != n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+    forceinline ModEvent
+    ConstIntView::nq(Space*, double n) {
+      return (x != n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+
+    forceinline ModEvent
+    ConstIntView::eq(Space*, int n) {
+      return (x == n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+    forceinline ModEvent
+    ConstIntView::eq(Space*, double n) {
+      return (x == n) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+
+
+
+    /*
+     * Domain update by range iterator
+     *
+     */
+    template <class I>
+    forceinline ModEvent
+    ConstIntView::narrow(Space*, I& i) {
+      return i() ? ME_INT_NONE : ME_INT_FAILED;
+    }
+    template <class I>
+    ModEvent
+    ConstIntView::inter(Space*, I& i) {
+      while (i() && (i.max() < x)) ++i;
+      return (i() && (i.min() <= x)) ? ME_INT_NONE : ME_INT_FAILED;
+    }
+    template <class I>
+    ModEvent
+    ConstIntView::minus(Space*, I& i) {
+      while (i() && (i.max() < x)) ++i;
+      return (i() && (i.min() <= x)) ? ME_INT_FAILED : ME_INT_NONE;
+    }
+
+
+
+    /*
+     * Propagator modification events
+     *
+     */
+    forceinline ModEvent
+    ConstIntView::pme(const Propagator*) {
+      return ME_INT_NONE;
+    }
+    forceinline PropModEvent
+    ConstIntView::pme(ModEvent me) {
+      return static_cast<PropModEvent>(me);
+    }
+
+
+    /*
+     * Dependencies
+     *
+     */
+    forceinline void
+    ConstIntView::subscribe(Space*,Propagator*,PropCond,bool) {}
+    forceinline void
+    ConstIntView::cancel(Space* home, Propagator*,PropCond) {}
+
+
+
+    /*
+     * Cloning
+     *
+     */
+    forceinline void
+    ConstIntView::update(Space*, bool, ConstIntView& y) {
+      x = y.x;
+    }
+
+    /**
+     * \brief %Range iterator for constant integer views
+     * \ingroup TaskActorIntView
+     */
+    template <>
+    class ViewRanges<ConstIntView> {
+    private:
+      /// The single integer to iterate
+      int n;
+    public:
+      /// \name Constructors and initialization
+      //@{
+      /// Default constructor
+      ViewRanges(void);
+      /// Initialize with ranges for view \a x
+      ViewRanges(const ConstIntView& x);
+      /// Initialize with ranges for view \a x
+      void init(const ConstIntView& x);
+      //@}
+
+      /// \name Iteration control
+      //@{
+      /// Test whether iterator is still at a range or done
+      bool operator()(void) const;
+      /// Move iterator to next range (if possible)
+      void operator++(void);
+      //@}
+
+      /// \name Range access
+      //@{
+      /// Return smallest value of range
+      int min(void) const;
+      /// Return largest value of range
+      int max(void) const;
+      /// Return width of ranges (distance between minimum and maximum)
+      unsigned int width(void) const;
+      //@}
+    };
+
+    forceinline
+    ViewRanges<ConstIntView>::ViewRanges(void) {}
+
+    forceinline
+    ViewRanges<ConstIntView>::ViewRanges(const ConstIntView& x)
+      : n(x.val()) {}
+
+    forceinline bool
+    ViewRanges<ConstIntView>::operator()(void) const {
+      return n < Limits::Int::int_max;
+    }
+    forceinline void
+    ViewRanges<ConstIntView>::operator++(void) {
+      n = Limits::Int::int_max;
+    }
+
+    forceinline int
+    ViewRanges<ConstIntView>::min(void) const {
+      return n;
+    }
+    forceinline int
+    ViewRanges<ConstIntView>::max(void) const {
+      return n;
+    }
+    forceinline unsigned int
+    ViewRanges<ConstIntView>::width(void) const {
+      return 1;
+    }
+
+  }
+
+  /*
+   * View comparison
+   *
+   */
+  forceinline bool
+  same(const Int::ConstIntView& x, const Int::ConstIntView& y) {
+    return x.min() == y.min();
+  }
+  forceinline bool
+  before(const Int::ConstIntView& x, const Int::ConstIntView& y) {
+    return x.min() < y.min();
+  }
+
+}
+
+// STATISTICS: int-var
+