gecoder-with-gecode 0.7.1

data/ext/gecode-1.3.1/gecode/set/branch/select-val.icc

@@ -0,0 +1,72 @@
+/*
+ *  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-07-18 15:39:20 +0200 (Tue, 18 Jul 2006) $ by $Author: schulte $
+ *     $Revision: 3390 $
+ *
+ *  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 Set { namespace Branch {
+
+  forceinline int
+  ValMin::val(const Space*, SetView x) const {
+    UnknownRanges<SetView> unknown(x);
+    return unknown.min();
+  }
+  forceinline ModEvent
+  ValMin::tell(Space* home, unsigned int a, SetView x, int v) {
+    return (a == 0) ? x.include(home,v) : x.exclude(home,v);
+  }
+
+  forceinline int
+  ValMax::val(const Space*, SetView x) const {
+    int maxElem = 0;
+    UnknownRanges<SetView> unknown(x);
+    while (unknown()) {
+      maxElem = unknown.max();
+      ++unknown;
+    }
+    return maxElem;
+  }
+  forceinline ModEvent
+  ValMax::tell(Space* home, unsigned int a, SetView x, int v) {
+    return (a == 0) ? x.include(home,v) : x.exclude(home,v);
+  }
+
+  template <class SelView>
+  static void
+  create(Space* home, ViewArray<SetView>& x, SetBvalSel vals) {
+    switch (vals) {
+    case SETBVAL_MIN:
+      (void) new (home) ViewValBranching<SetView,int,SelView,ValMin>(home,x);
+      break;
+    case SETBVAL_MAX:
+      (void) new (home) ViewValBranching<SetView,int,SelView,ValMax>(home,x);
+      break;
+    default:
+      throw UnknownBranching("Set::branch");
+    }
+  }
+
+}}}
+
+// STATISTICS: set-branch

data/ext/gecode-1.3.1/gecode/set/branch/select-view.icc

@@ -0,0 +1,112 @@
+/*
+ *  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-07-19 14:57:38 +0200 (Wed, 19 Jul 2006) $ by $Author: schulte $
+ *     $Revision: 3413 $
+ *
+ *  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 Set { namespace Branch {
+
+  forceinline ViewSelStatus
+  ByNone::init(const Space*, SetView) {
+    return VSS_COMMIT;
+  }
+  forceinline ViewSelStatus
+  ByNone::select(const Space*, SetView) {
+    GECODE_NEVER;
+    return VSS_NONE;
+  }
+
+  forceinline ViewSelStatus
+  ByMinCard::init(const Space*, SetView x) { 
+    minCard = x.unknownSize();
+    return (minCard == 1) ? VSS_COMMIT : VSS_SELECT;
+  }
+  forceinline ViewSelStatus
+  ByMinCard::select(const Space*, SetView x) {
+    unsigned int us = x.unknownSize();
+    if (us < minCard) {
+      minCard = us;
+      return (minCard == 1) ? VSS_COMMIT : VSS_SELECT;
+    }
+    return VSS_NONE;
+  }
+
+  forceinline ViewSelStatus
+  ByMaxCard::init(const Space*, SetView x) { 
+    maxCard = x.unknownSize();
+    return VSS_SELECT;
+  }
+  forceinline ViewSelStatus
+  ByMaxCard::select(const Space*, SetView x) {
+    unsigned int us = x.unknownSize();
+    if (us > maxCard) {
+      maxCard = us; return VSS_SELECT;
+    }
+    return VSS_NONE;
+  }
+
+  forceinline ViewSelStatus
+  ByMinUnknown::init(const Space*, SetView x) {
+    UnknownRanges<SetView> unknown(x);
+    minUnknown = unknown.min();
+    return VSS_SELECT;
+  }
+  forceinline ViewSelStatus
+  ByMinUnknown::select(const Space*, SetView x) {
+    UnknownRanges<SetView> unknown(x);
+    int um = unknown.min();
+    if (um < minUnknown) {
+      minUnknown = um; return VSS_SELECT;
+    }
+    return VSS_NONE;
+  }
+
+  forceinline ViewSelStatus
+  ByMaxUnknown::init(const Space*, SetView x) {
+    UnknownRanges<SetView> unknown(x);
+    do {
+      maxUnknown = unknown.max();
+      ++unknown;
+    } while(unknown());
+    return VSS_SELECT;
+  }
+  forceinline ViewSelStatus
+  ByMaxUnknown::select(const Space*, SetView x) {
+    UnknownRanges<SetView> unknown(x);
+    int um = 0;
+    assert(unknown());
+    do {
+      um = unknown.max();
+      ++unknown;
+    } while(unknown());
+    if (um > maxUnknown) {
+      maxUnknown = um; return VSS_SELECT;
+    }
+    return VSS_NONE;
+  }
+
+}}}
+
+// STATISTICS: set-branch
+

data/ext/gecode-1.3.1/gecode/set/cardinality.cc

@@ -0,0 +1,49 @@
+/*
+ *  Main authors:
+ *     Gabor Szokoli <szokoli@gecode.org>
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Gabor Szokoli, 2004
+ *     Guido Tack, 2004
+ *     Christian Schulte, 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/set/int.hh"
+
+namespace Gecode {
+
+  void
+  cardinality(Space* home, SetVar x, unsigned int i, unsigned int j) {
+    if (home->failed()) return;
+    Set::SetView _x(x);
+    GECODE_ME_FAIL(home,_x.cardMin(home, i));
+    GECODE_ME_FAIL(home,_x.cardMax(home, j));
+  }
+
+  void
+  cardinality(Space* home, SetVar s, IntVar x) {
+    if (home->failed()) return;
+    GECODE_ES_FAIL(home,Set::Int::Card::post(home,s, x));
+  }
+
+}
+
+// STATISTICS: set-post

data/ext/gecode-1.3.1/gecode/set/convex.cc

@@ -0,0 +1,43 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 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/convex.hh"
+
+using namespace Gecode::Set;
+
+namespace Gecode {
+  void
+  convex(Space* home, SetVar x) {
+    if (home->failed()) return;
+    GECODE_ES_FAIL(home,Convex::Convex::post(home, x));
+  }
+
+  void
+  convexHull(Space* home, SetVar x, SetVar y) {
+    if (home->failed()) return;
+    GECODE_ES_FAIL(home,Convex::ConvexHull::post(home, x,y));
+  }
+
+}
+
+// STATISTICS: set-post

data/ext/gecode-1.3.1/gecode/set/convex.hh

@@ -0,0 +1,92 @@
+/*
+ *  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-23 15:09:53 +0200 (Tue, 23 May 2006) $ by $Author: tack $
+ *     $Revision: 3232 $
+ *
+ *  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.
+ *
+ */
+
+#ifndef __GECODE_SET_CONVEX_HH__
+#define __GECODE_SET_CONVEX_HH__
+
+#include "gecode/set.hh"
+
+namespace Gecode { namespace Set { namespace Convex {
+
+  /**
+   * \namespace Gecode::Set::Convex
+   * \brief Propagators for convexity
+   */
+
+  /**
+   * \brief %Propagator for the convex constraint
+   *
+   * Requires \code #include "gecode/set/convex.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+
+  class Convex : public UnaryPropagator<SetView,PC_SET_ANY> {
+  protected:
+    /// Constructor for cloning \a p
+    Convex(Space* home, bool share, Convex& p);
+    /// Constructor for posting
+    Convex(Space* home, SetView);
+  public:
+    /// Copy propagator during cloning
+    GECODE_SET_EXPORT virtual Actor*      copy(Space* home,bool);
+    /// Perform propagation
+    GECODE_SET_EXPORT virtual ExecStatus  propagate(Space* home);
+    /// Post propagator that propagates that \a x is convex 
+    static  ExecStatus  post(Space* home,SetView x);
+  };
+
+  /**
+   * \brief %Propagator for the convex hull constraint
+   *
+   * Requires \code #include "gecode/set/convex.hh" \endcode
+   * \ingroup FuncSetProp
+   */
+
+  class ConvexHull : public BinaryPropagator<SetView,PC_SET_ANY> {
+  protected:
+    /// Constructor for cloning \a p
+    ConvexHull(Space* home, bool share, ConvexHull&);
+    /// Constructor for posting
+    ConvexHull(Space* home, SetView, SetView);
+  public:
+    /// Copy propagator during cloning
+    GECODE_SET_EXPORT virtual Actor*  copy(Space* home,bool);
+    /// Perform propagation
+    GECODE_SET_EXPORT virtual ExecStatus  propagate(Space* home);
+    /// Post propagator that propagates that \a y is the convex hull of \a x
+    static  ExecStatus  post(Space* home,SetView x,SetView y);
+  };
+
+
+}}}
+
+#include "gecode/set/convex/conv.icc"
+#include "gecode/set/convex/hull.icc"
+
+#endif
+
+// STATISTICS: set-prop

data/ext/gecode-1.3.1/gecode/set/convex/conv.cc

@@ -0,0 +1,81 @@
+/*
+ *  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/set/convex.hh"
+
+#include "gecode/iter.hh"
+
+namespace Gecode { namespace Set { namespace Convex {
+
+  Actor*
+  Convex::copy(Space* home, bool share) {
+    return new (home) Convex(home,share,*this);
+  }
+
+  ExecStatus
+  Convex::propagate(Space* home) {
+    //I, drop ranges from UB that are shorter than cardMin
+    //II, add range LB.smallest to LB.largest to LB
+    //III, Drop ranges from UB that do not contain all elements of LB
+    //that is: range.min()>LB.smallest or range.max()<LB.largest
+    //This leaves only one range.
+
+    //II
+    if (x0.glbSize()>0) {
+      GECODE_ME_CHECK( x0.include(home,x0.glbMin(),x0.glbMax()) );
+    } else {
+      //If lower bound is empty, we can still constrain the cardinality
+      //maximum with the width of the longest range in UB.
+      //No need to do this if there is anything in LB because UB
+      //becomes a single range then.
+       LubRanges<SetView> ubRangeIt(x0);
+       unsigned int maxWidth = 0;
+       for (;ubRangeIt();++ubRangeIt){
+         maxWidth = std::max(maxWidth, ubRangeIt.width());
+       }
+        GECODE_ME_CHECK( x0.cardMax(home,maxWidth) );
+    }
+
+
+    //I + III
+
+    LubRanges<SetView> ubRangeIt(x0);
+    Iter::Ranges::Cache< LubRanges<SetView> > ubRangeItC(ubRangeIt);
+    for (;ubRangeItC();++ubRangeItC){
+      if (ubRangeItC.width() < (unsigned int) x0.cardMin()
+          || ubRangeItC.min() > x0.glbMin() //No need to test for empty lb.
+          || ubRangeItC.max() < x0.glbMax()
+          ) {
+        GECODE_ME_CHECK( x0.exclude(home,ubRangeItC.min(), ubRangeItC.max()) );
+      }
+    }
+    if (x0.assigned()) {return ES_SUBSUMED;}
+    return ES_FIX;
+  }
+
+}}}
+
+// STATISTICS: set-prop