gecoder-with-gecode 0.7.1

data/ext/gecode-1.3.1/gecode/set/int/card.cc

@@ -0,0 +1,61 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Contributing authors:
+ *     Gabor Szokoli <szokoli@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *     Gabor Szokoli, 2004
+ *
+ *  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/set/int.hh"
+
+#include "gecode/iter.hh"
+
+#include "gecode/set/rel.hh"
+
+namespace Gecode { namespace Set { namespace Int {
+
+  Actor*
+  Card::copy(Space* home, bool share) {
+    return new (home) Card(home,share,*this);
+  }
+
+  ExecStatus
+  Card::propagate(Space* home) {
+    int x1min, x1max;
+    do {
+      x1min = x1.min();
+      x1max = x1.max();
+      GECODE_ME_CHECK(x0.cardMin(home,x1min));
+      GECODE_ME_CHECK(x0.cardMax(home,x1max));
+      GECODE_ME_CHECK(x1.gq(home,(int)x0.cardMin()));
+      GECODE_ME_CHECK(x1.lq(home,(int)x0.cardMax()));
+    } while (x1.min() > x1min || x1.max() < x1max);
+    if (x1.assigned())
+      return ES_SUBSUMED;
+    return ES_FIX;
+  }
+
+}}}
+
+// STATISTICS: set-prop

data/ext/gecode-1.3.1/gecode/set/int/card.icc

@@ -0,0 +1,54 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *     Gabor Szokoli <szokoli@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *     Gabor Szokoli, 2004
+ *
+ *  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/set.hh"
+#include "gecode/int.hh"
+
+namespace Gecode { namespace Set { namespace Int {
+
+  forceinline
+  Card::Card(Space* home, SetView y0, Gecode::Int::IntView y1)
+    : IntSetPropagator<SetView,PC_SET_CARD,
+		       Gecode::Int::PC_INT_BND> (home, y0, y1) {}
+
+  forceinline ExecStatus
+  Card::post(Space* home, SetView x0, Gecode::Int::IntView x1) {
+    GECODE_ME_CHECK(x1.gq(home,0));
+    GECODE_ME_CHECK(x0.cardMax(home, INT_MAX));
+    (void) new (home) Card(home,x0,x1);
+    return ES_OK;
+  }
+
+  forceinline
+  Card::Card(Space* home, bool share, Card& p)
+    : IntSetPropagator<SetView,PC_SET_CARD,
+		       Gecode::Int::PC_INT_BND> (home, share, p) {}
+
+
+}}}
+
+// STATISTICS: set-prop

data/ext/gecode-1.3.1/gecode/set/int/channel.cc

@@ -0,0 +1,100 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Contributing authors:
+ *     Gabor Szokoli <szokoli@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *     Gabor Szokoli, 2004
+ *
+ *  Last modified:
+ *     $Date: 2006-05-29 09:42:21 +0200 (Mon, 29 May 2006) $ by $Author: schulte $
+ *     $Revision: 3246 $
+ *
+ *  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/set/int.hh"
+
+#include "gecode/iter.hh"
+
+#include "gecode/set/rel.hh"
+
+namespace Gecode { namespace Set { namespace Int {
+
+  PropCost
+  Channel::cost(void) const {
+    return PC_QUADRATIC_LO;
+  }
+
+  size_t
+  Channel::dispose(Space* home) {
+    assert(!home->failed());
+    xs.cancel(home,this, Gecode::Int::PC_INT_DOM);
+    ys.cancel(home,this, PC_SET_ANY);
+    (void) Propagator::dispose(home);
+    return sizeof(*this);
+  }
+
+  Actor*
+  Channel::copy(Space* home, bool share) {
+    return new (home) Channel(home,share,*this);
+  }
+
+  ExecStatus
+  Channel::propagate(Space* home) {
+    int assigned = 0;
+    for (int v=xs.size(); v--;) {
+      if (xs[v].assigned()) {
+	assigned += 1;
+        for (int i=ys.size(); i--;) {
+          if (i==xs[v].val()) {
+            GECODE_ME_CHECK(ys[i].include(home, v));
+          }
+          else {
+            GECODE_ME_CHECK(ys[i].exclude(home, v));
+          }
+        }
+      } else {
+
+        for (int i=ys.size(); i--;) {
+          if (ys[i].notContains(v)) {
+            GECODE_ME_CHECK(xs[v].nq(home, i));
+          }
+          if (ys[i].contains(v)) {
+            GECODE_ME_CHECK(xs[v].eq(home, i));
+          }
+        }
+
+        Gecode::Int::ViewRanges<Gecode::Int::IntView> xsv(xs[v]);
+        int min = 0;
+        for (; xsv(); ++xsv) {
+          for (int i=min; i<xsv.min(); i++) {
+            GECODE_ME_CHECK(ys[i].exclude(home, v));
+          }
+          min = xsv.max() + 1;
+        }
+
+      }
+    }
+
+    return (assigned==xs.size()) ? ES_SUBSUMED : ES_NOFIX;
+  }
+
+
+}}}
+
+// STATISTICS: set-prop

data/ext/gecode-1.3.1/gecode/set/int/channel.icc

@@ -0,0 +1,75 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *     Gabor Szokoli <szokoli@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *     Gabor Szokoli, 2004
+ *
+ *  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/set.hh"
+#include "gecode/int.hh"
+
+namespace Gecode { namespace Set { namespace Int {
+
+  forceinline
+  Channel::Channel(Space* home,
+		   ViewArray< Gecode::Int::IntView >& xs0,
+		   ViewArray< SetView >& ys0)
+    : Propagator(home), xs(xs0), ys(ys0) {
+    xs.subscribe(home,this, Gecode::Int::PC_INT_DOM);
+    ys.subscribe(home,this, PC_SET_ANY);
+  }
+
+  forceinline
+  Channel::Channel(Space* home, bool share,
+		   Channel& p)
+    : Propagator(home,share,p) {
+    xs.update(home,share,p.xs);
+    ys.update(home,share,p.ys);
+  }
+
+  forceinline ExecStatus
+  Channel::post(Space* home, ViewArray<Gecode::Int::IntView>& xs,
+		ViewArray<SetView>& ys) {
+    // Sharing of ys is taken care of in the propagator:
+    // The ys are propagated to be disjoint, so shared variables
+    // result in failure.
+    unsigned int xssize = xs.size();
+    for (int i=ys.size(); i--;) {
+      GECODE_ME_CHECK(ys[i].exclude(home, xssize, Limits::Set::int_max));
+      GECODE_ME_CHECK(ys[i].exclude(home, Limits::Set::int_min, -1));
+    }
+    unsigned int yssize = ys.size();
+    if (yssize > static_cast<unsigned int>(Limits::Int::int_max))
+      return ES_FAILED;
+    for (int i=xs.size(); i--;) {
+      GECODE_ME_CHECK(xs[i].gq(home, 0));
+      GECODE_ME_CHECK(xs[i].le(home, static_cast<int>(yssize)));
+    }
+
+    (void) new (home) Channel(home,xs,ys);
+    return ES_OK;
+  }
+
+}}}
+
+// STATISTICS: set-prop

data/ext/gecode-1.3.1/gecode/set/int/match.cc

@@ -0,0 +1,148 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Contributing authors:
+ *     Gabor Szokoli <szokoli@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *     Gabor Szokoli, 2004
+ *
+ *  Last modified:
+ *     $Date: 2006-08-25 17:31:32 +0200 (Fri, 25 Aug 2006) $ by $Author: tack $
+ *     $Revision: 3573 $
+ *
+ *  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/set/int.hh"
+
+#include "gecode/iter.hh"
+
+namespace Gecode { namespace Set { namespace Int {
+
+  PropCost
+  Match::cost(void) const {
+    return PC_LINEAR_LO;
+  }
+
+  size_t
+  Match::dispose(Space* home) {
+    assert(!home->failed());
+    x0.cancel(home,this, PC_SET_ANY);
+    xs.cancel(home,this, Gecode::Int::PC_INT_BND);
+    (void) Propagator::dispose(home);
+    return sizeof(*this);
+  }
+
+  Actor*
+  Match::copy(Space* home, bool share) {
+    return new (home) Match(home,share,*this);
+  }
+
+  ExecStatus
+  Match::propagate(Space* home) {
+
+    int xs_size = xs.size();
+
+    bool loopFlag;
+
+    do {
+      loopFlag = false;
+      
+      // Order int vars in xs
+      GECODE_ME_CHECK(xs[0].gq(home,x0.lubMin()));
+      for (int i=xs_size-1; i--; ) {
+	GECODE_ME_CHECK_MODIFIED(loopFlag, xs[i+1].gq(home,xs[i].min() + 1));
+      }
+      
+      GECODE_ME_CHECK_MODIFIED(loopFlag, xs[xs_size-1].lq(home,x0.lubMax()));
+      for (int i=xs_size-2; i--; ) {
+	GECODE_ME_CHECK_MODIFIED(loopFlag, xs[i].lq(home,xs[i+1].max() - 1));
+      }
+
+      // if y from xs is assigned, add to glb(x0)
+      for (int i=xs_size; i--; ) {
+        if (xs[i].assigned()) {
+	  GECODE_ME_CHECK_MODIFIED(loopFlag, x0.include(home,xs[i].val()));
+	}
+      }
+
+      // intersect every y in xs with lub(x0)
+      for (int i=xs_size; i--; ) {
+        LubRanges<SetView> ub(x0);
+        GECODE_ME_CHECK_MODIFIED(loopFlag, xs[i].inter(home,ub));
+      }
+
+      // remove gaps between vars in xs from lub(x0)
+      GECODE_ME_CHECK_MODIFIED(loopFlag,
+			x0.exclude(home,Limits::Set::int_min,xs[0].min()-1));
+      GECODE_ME_CHECK_MODIFIED(loopFlag,
+			x0.exclude(home,xs[xs_size-1].max()+1,
+				   Limits::Set::int_max));
+
+      for (int i=xs_size-1; i--; ) {
+        int start = xs[i].max() + 1;
+        int end   = xs[i+1].min() - 1;
+        if (start<=end) {
+          GECODE_ME_CHECK_MODIFIED(loopFlag, x0.exclude(home,start,end));
+        }
+      }
+
+      // try to assign vars in xs from glb(x0)
+      if (x0.glbSize()>0) {
+
+        LubRanges<SetView> ub(x0);
+        Iter::Ranges::ToValues<LubRanges<SetView> > ubv(ub);
+        GlbRanges<SetView> lb(x0);
+        Iter::Ranges::ToValues<GlbRanges<SetView> > lbv(lb);
+
+        int i=0;
+        for (; ubv() && lbv() && ubv.val()==lbv.val();
+            ++ubv, ++lbv, i++) {
+          GECODE_ME_CHECK_MODIFIED(loopFlag, xs[i].eq(home,lbv.val()));
+        }
+
+        if (i<xs_size-1 && x0.lubMax()==x0.glbMax()) {
+	  LubRanges<SetView> lbx0(x0);
+	  GlbRanges<SetView> ubx0(x0);
+	  Iter::Ranges::Inter<LubRanges<SetView>,GlbRanges<SetView> >
+	    inter(lbx0, ubx0);
+	  
+	  int to = x0.glbMax();
+	  int from = to;
+	  while (inter()) {
+	    from = inter.min();
+	    ++inter;
+	  }
+
+	  int i=xs_size-1;
+	  for (int j=to; j>=from;j--,i--) {
+            GECODE_ME_CHECK_MODIFIED(loopFlag, xs[i].eq(home,j));
+	  }
+        }
+      }
+
+    } while (loopFlag);
+
+    for (int i=xs_size; i--; )
+      if (!xs[i].assigned())	
+	return ES_FIX;
+    return ES_SUBSUMED;
+  }
+
+}}}
+
+// STATISTICS: set-prop

data/ext/gecode-1.3.1/gecode/set/int/match.icc

@@ -0,0 +1,67 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *     Gabor Szokoli <szokoli@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *     Gabor Szokoli, 2004
+ *
+ *  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/set.hh"
+#include "gecode/int.hh"
+#include "gecode/set/rel.hh"
+
+namespace Gecode { namespace Set { namespace Int {
+
+  forceinline
+  Match::Match(Space* home, SetView y0, ViewArray< Gecode::Int::IntView >& ys)
+    : Propagator(home), x0(y0), xs(ys) {
+    x0.subscribe(home,this, PC_SET_ANY);
+    xs.subscribe(home,this, Gecode::Int::PC_INT_BND);
+  }
+
+  forceinline
+  Match::Match(Space* home, bool share, Match& p)
+    : Propagator(home,share,p) {
+    x0.update(home,share,p.x0);
+    xs.update(home,share,p.xs);
+  }
+
+  forceinline ExecStatus
+  Match::post(Space* home, SetView x0, ViewArray<Gecode::Int::IntView>& xs) {
+    unsigned int xs_size = xs.size();
+    GECODE_ME_CHECK(x0.cardMin(home,xs_size));
+    GECODE_ME_CHECK(x0.cardMax(home,xs_size));
+    if (xs_size==1) {
+      SingletonView sv(xs[0]);
+      GECODE_ES_CHECK((Rel::Eq<SetView,
+		       SingletonView>::post(home,x0, sv)));
+    } else {
+      // Sharing in xs is handled correctly in the propagator:
+      // if two views in xs are shared, this leads to failure.
+      (void) new (home) Match(home,x0,xs);
+    }
+    return ES_OK;
+  }
+
+}}}
+
+// STATISTICS: set-prop