gecoder-with-gecode 0.7.1 → 0.8.0

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

@@ -1,274 +0,0 @@
-/*
- *  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
-    OffsetView::OffsetView(void) {}
-    forceinline
-    OffsetView::OffsetView(const IntView& x, int d)
-      : DerivedViewBase<IntView>(x), c(d) {}
-    forceinline void
-    OffsetView::init(const IntView& x, int d) {
-      view=x; c=d;
-    }
-    forceinline int
-    OffsetView::offset(void) const {
-      return c;
-    }
-
-
-    /*
-     * Value access
-     *
-     */
-    forceinline int
-    OffsetView::min(void) const {
-      return view.min()+c;
-    }
-    forceinline int
-    OffsetView::max(void) const {
-      return view.max()+c;
-    }
-    forceinline int
-    OffsetView::med(void) const {
-      return view.med()+c;
-    }
-    forceinline int
-    OffsetView::val(void) const {
-      return view.val()+c;
-    }
-
-    forceinline unsigned int
-    OffsetView::width(void) const {
-      return view.width();
-    }
-    forceinline unsigned int
-    OffsetView::size(void) const {
-      return view.size();
-    }
-    forceinline unsigned int
-    OffsetView::regret_min(void) const {
-      return view.regret_min();
-    }
-    forceinline unsigned int
-    OffsetView::regret_max(void) const {
-      return view.regret_max();
-    }
-
-    /*
-     * Domain tests
-     *
-     */
-    forceinline bool
-    OffsetView::range(void) const {
-      return view.range();
-    }
-    forceinline bool
-    OffsetView::assigned(void) const {
-      return view.assigned();
-    }
-
-    forceinline bool
-    OffsetView::in(int n) const {
-      return view.in(n-c);
-    }
-    forceinline bool
-    OffsetView::in(double n) const {
-      return view.in(n-c);
-    }
-
-
-    /*
-     * Domain update by value
-     *
-     */
-    forceinline ModEvent
-    OffsetView::lq(Space* home, int n) {
-      return view.lq(home,n-c);
-    }
-    forceinline ModEvent
-    OffsetView::lq(Space* home, double n) {
-      return view.lq(home,n-c);
-    }
-    forceinline ModEvent
-    OffsetView::le(Space* home, int n) {
-      return view.le(home,n-c);
-    }
-    forceinline ModEvent
-    OffsetView::le(Space* home, double n) {
-      return view.le(home,n-c);
-    }
-    forceinline ModEvent
-    OffsetView::gq(Space* home, int n) {
-      return view.gq(home,n-c);
-    }
-    forceinline ModEvent
-    OffsetView::gq(Space* home, double n) {
-      return view.gq(home,n-c);
-    }
-    forceinline ModEvent
-    OffsetView::gr(Space* home, int n) {
-      return view.gr(home,n-c);
-    }
-    forceinline ModEvent
-    OffsetView::gr(Space* home, double n) {
-      return view.gr(home,n-c);
-    }
-    forceinline ModEvent
-    OffsetView::nq(Space* home, int n) {
-      return view.nq(home,n-c);
-    }
-    forceinline ModEvent
-    OffsetView::nq(Space* home, double n) {
-      return view.nq(home,n-c);
-    }
-    forceinline ModEvent
-    OffsetView::eq(Space* home, int n) {
-      return view.eq(home,n-c);
-    }
-    forceinline ModEvent
-    OffsetView::eq(Space* home, double n) {
-      return view.eq(home,n-c);
-    }
-
-
-
-    /*
-     * Domain update by range iterator
-     *
-     */
-    template <class I>
-    ModEvent
-    OffsetView::narrow(Space* home, I& i) {
-      Iter::Ranges::Offset<I> oi(i,-c); return view.narrow(home,oi);
-    }
-    template <class I>
-    ModEvent
-    OffsetView::inter(Space* home, I& i) {
-      Iter::Ranges::Offset<I> oi(i,-c); return view.inter(home,oi);
-    }
-    template <class I>
-    ModEvent
-    OffsetView::minus(Space* home, I& i) {
-      Iter::Ranges::Offset<I> oi(i,-c); return view.minus(home,oi);
-    }
-
-
-
-    /*
-     * Propagator modification events
-     *
-     */
-    forceinline ModEvent
-    OffsetView::pme(const Propagator* p) {
-      return IntView::pme(p);
-    }
-    forceinline PropModEvent
-    OffsetView::pme(ModEvent me) {
-      return IntView::pme(me);
-    }
-
-
-    /*
-     * Dependencies
-     *
-     */
-    forceinline void
-    OffsetView::subscribe(Space* home, Propagator* p, PropCond pc, 
-			  bool process) {
-      view.subscribe(home,p,pc,process);
-    }
-    forceinline void
-    OffsetView::cancel(Space* home, Propagator* p, PropCond pc) {
-      view.cancel(home,p,pc);
-    }
-
-
-    /*
-     * Cloning
-     *
-     */
-    forceinline void
-    OffsetView::update(Space* home, bool share, OffsetView& x) {
-      c=x.c; view.update(home,share,x.view);
-    }
-
-
-    /**
-     * \brief %Range iterator for offset integer views
-     * \ingroup TaskActorIntView
-     */
-    template <>
-    class ViewRanges<OffsetView>
-      : public Iter::Ranges::Offset<ViewRanges<IntView> > {
-    public:
-      /// \name Constructors and initialization
-      //@{
-      /// Default constructor
-      ViewRanges(void);
-      /// Initialize with ranges for view \a x
-      ViewRanges(const OffsetView& x);
-      /// Initialize with ranges for view \a x
-      void init(const OffsetView& x);
-      //@}
-    };
-
-    forceinline
-    ViewRanges<OffsetView>::ViewRanges(void) {}
-
-    forceinline
-    ViewRanges<OffsetView>::ViewRanges(const OffsetView& x) {
-      ViewRanges<IntView> xi(x.base());
-      Iter::Ranges::Offset<ViewRanges<IntView> >::init(xi,x.offset());
-    }
-
-    forceinline void
-    ViewRanges<OffsetView>::init(const OffsetView& x) {
-      ViewRanges<IntView> xi(x.base());
-      Iter::Ranges::Offset<ViewRanges<IntView> >::init(xi,x.offset());
-    }
-  }
-
-  /*
-   * View comparison
-   *
-   */
-  forceinline bool
-  same(const Int::OffsetView& x, const Int::OffsetView& y) {
-    return same(x.base(),y.base()) && (x.offset() == y.offset());
-  }
-  forceinline bool
-  before(const Int::OffsetView& x, const Int::OffsetView& y) {
-    return before(x.base(),y.base())
-      || (same(x.base(),y.base()) && (x.offset() < y.offset()));
-  }
-
-}
-
-// STATISTICS: int-var
-

data/ext/gecode-1.3.1/gecode/int/view/print.cc

@@ -1,109 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2003
- *
- *  Last modified:
- *     $Date: 2006-04-11 15:58:37 +0200 (Tue, 11 Apr 2006) $ by $Author: tack $
- *     $Revision: 3188 $
- *
- *  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.
- *
- */
-
-#include "gecode/int.hh"
-
-namespace Gecode { namespace Int {
-
-  template <class View>
-  inline static std::ostream&
-  print_view(std::ostream& os, const View& x) {
-    if (x.assigned()) {
-      return os << x.val();
-    } else if (x.range()) {
-      return os << '[' << x.min() << ".." << x.max() << ']';
-    } else {
-      os << '{';
-      ViewRanges<View> r(x);
-      while (true) {
-	if (r.min() == r.max()) {
-	  os << r.min();
-	} else {
-	  os << r.min() << ".." << r.max();
-	}
-	++r;
-	if (!r()) break;
-	os << ',';
-      }
-      return os << '}';
-    }
-  }
-
-  template <class Val, class UnsVal>
-  std::ostream&
-  print_scale(std::ostream& os, const ScaleView<Val,UnsVal>& x) {
-    if (x.assigned()) {
-      return os << x.val();
-    } else {
-      os << '{';
-      ViewRanges<ScaleView<Val,UnsVal> > r(x);
-      while (true) {
-	if (r.min() == r.max()) {
-	  os << r.min();
-	} else {
-	  os << r.min() << ".." << r.max();
-	}
-	++r;
-	if (!r()) break;
-	os << ',';
-      }
-      return os << '}';
-    }
-  }
-
-}}
-
-std::ostream&
-operator<<(std::ostream& os, const Gecode::Int::IntView& x) {
-  return Gecode::Int::print_view(os,x);
-}
-std::ostream&
-operator<<(std::ostream& os, const Gecode::Int::MinusView& x) {
-  return Gecode::Int::print_view(os,x);
-}
-std::ostream&
-operator<<(std::ostream& os, const Gecode::Int::OffsetView& x) {
-  return Gecode::Int::print_view(os,x);
-}
-std::ostream&
-operator<<(std::ostream& os, const Gecode::Int::IntScaleView& x) {
-  return Gecode::Int::print_scale<int,unsigned int>(os,x);
-}
-std::ostream&
-operator<<(std::ostream& os, const Gecode::Int::DoubleScaleView& x) {
-  return Gecode::Int::print_scale<double,double>(os,x);
-}
-std::ostream&
-operator<<(std::ostream& os, const Gecode::Int::ConstIntView& x) {
-  return os << x.val();
-}
-std::ostream&
-operator<<(std::ostream& os, const Gecode::Int::NegBoolView& x) {
-  if (x.one())
-    return os << 1;
-  if (x.zero())
-    return os << 0;
-  return os << "[0..1]";
-}
-
-
-// STATISTICS: int-var
-

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

@@ -1,215 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2003
- *
- *  Last modified:
- *     $Date: 2006-06-08 14:20:28 +0200 (Thu, 08 Jun 2006) $ by $Author: schulte $
- *     $Revision: 3275 $
- *
- *  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 {
-
-  /*
-   * Testing equality
-   *
-   */
-
-  template <class View>
-  forceinline RelTest
-  rtest_eq_bnd(View x, View y) {
-    if ((x.min() > y.max()) || (x.max() < y.min())) return RT_FALSE;
-    return (x.assigned() && y.assigned()) ? RT_TRUE : RT_MAYBE;
-  }
-
-  template <class View>
-  RelTest
-  rtest_eq_dom_check(View x, View y) {
-    ViewRanges<View> rx(x), ry(y);
-    while (rx() && ry()) {
-      if (rx.max() < ry.min()) {
-	++rx;
-      } else if (ry.max() < rx.min()) {
-	++ry;
-      } else return RT_MAYBE;
-    }
-    return RT_FALSE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_eq_dom(View x, View y) {
-    RelTest rt = rtest_eq_bnd(x,y);
-    if (rt != RT_MAYBE) return rt;
-    return (x.range() && y.range()) ? RT_MAYBE : rtest_eq_dom_check(x,y);
-  }
-
-
-  template <class View>
-  forceinline RelTest
-  rtest_eq_bnd(View x, int n) {
-    if ((n > x.max()) || (n < x.min())) return RT_FALSE;
-    return x.assigned() ? RT_TRUE : RT_MAYBE;
-  }
-
-  template <class View>
-  RelTest
-  rtest_eq_dom_check(View x, int n) {
-    ViewRanges<View> rx(x);
-    while (n > rx.max()) ++rx;
-    return (n >= rx.min()) ? RT_MAYBE : RT_FALSE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_eq_dom(View x, int n) {
-    RelTest rt = rtest_eq_bnd(x,n);
-    if (rt != RT_MAYBE) return rt;
-    return x.range() ? RT_MAYBE : rtest_eq_dom_check(x,n);
-  }
-
-
-
-  /*
-   * Testing disequality
-   *
-   */
-
-  template <class View>
-  forceinline RelTest
-  rtest_nq_bnd(View x, View y) {
-    if ((x.min() > y.max()) || (x.max() < y.min())) return RT_TRUE;
-    return (x.assigned() && y.assigned()) ? RT_FALSE : RT_MAYBE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_nq_dom_check(View x, View y) {
-    ViewRanges<View> rx(x), ry(y);
-    while (rx() && ry()) {
-      if (rx.max() < ry.min()) {
-	++rx;
-      } else if (ry.max() < rx.min()) {
-	++ry;
-      } else return RT_MAYBE;
-    }
-    return RT_TRUE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_nq_dom(View x, View y) {
-    RelTest rt = rtest_nq_bnd(x,y);
-    if (rt != RT_MAYBE) return rt;
-    return (x.range() && y.range()) ? RT_MAYBE : rtest_nq_dom_check(x,y);
-  }
-
-
-  template <class View>
-  forceinline RelTest
-  rtest_nq_bnd(View x, int n) {
-    if ((n > x.max()) || (n < x.min())) return RT_TRUE;
-    return (x.assigned()) ? RT_FALSE : RT_MAYBE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_nq_dom_check(View x, int n) {
-    ViewRanges<View> rx(x);
-    while (n > rx.max()) ++rx;
-    return (n >= rx.min()) ? RT_MAYBE : RT_TRUE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_nq_dom(View x, int n) {
-    RelTest rt = rtest_nq_bnd(x,n);
-    if (rt != RT_MAYBE) return rt;
-    return x.range() ? RT_MAYBE : rtest_nq_dom_check(x,n);
-  }
-
-
-  /*
-   * Testing inequalities
-   *
-   */
-
-  template <class View>
-  forceinline RelTest
-  rtest_lq(View x, int n) {
-    if (x.max() <= n) return RT_TRUE;
-    if (x.min() > n)  return RT_FALSE;
-    return RT_MAYBE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_lq(View x, View y) {
-    if (x.max() <= y.min()) return RT_TRUE;
-    if (x.min() > y.max())  return RT_FALSE;
-    return RT_MAYBE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_le(View x, int n) {
-    if (x.max() <  n) return RT_TRUE;
-    if (x.min() >= n) return RT_FALSE;
-    return RT_MAYBE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_le(View x, View y) {
-    if (x.max() <  y.min()) return RT_TRUE;
-    if (x.min() >= y.max()) return RT_FALSE;
-    return RT_MAYBE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_gq(View x, int n) {
-    if (x.max() <  n) return RT_FALSE;
-    if (x.min() >= n) return RT_TRUE;
-    return RT_MAYBE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_gq(View x, View y) {
-    if (x.max() <  y.min()) return RT_FALSE;
-    if (x.min() >= y.max()) return RT_TRUE;
-    return RT_MAYBE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_gr(View x, int n) {
-    if (x.max() <= n) return RT_FALSE;
-    if (x.min() >  n) return RT_TRUE;
-    return RT_MAYBE;
-  }
-
-  template <class View>
-  forceinline RelTest
-  rtest_gr(View x, View y) {
-    if (x.max() <= y.min()) return RT_FALSE;
-    if (x.min() >  y.max()) return RT_TRUE;
-    return RT_MAYBE;
-  }
-
-}}
-
-// STATISTICS: int-var
-