dep-selector-libgecode 1.0.0.alpha.0

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/set/cardinality.cpp

@@ -0,0 +1,65 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  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: 2010-03-04 03:40:32 +1100 (Thu, 04 Mar 2010) $ by $Author: schulte $
+ *     $Revision: 10365 $
+ *
+ *  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/set.hh>
+#include <gecode/set/int.hh>
+
+namespace Gecode {
+
+  void
+  cardinality(Home home, SetVar x, unsigned int i, unsigned int j) {
+    Set::Limits::check(i, "Set::cardinality");
+    Set::Limits::check(j, "Set::cardinality");
+    if (home.failed()) return;
+    Set::SetView _x(x);
+    GECODE_ME_FAIL(_x.cardMin(home, i));
+    GECODE_ME_FAIL(_x.cardMax(home, j));
+  }
+
+  void
+  cardinality(Home home, SetVar s, IntVar x) {
+    if (home.failed()) return;
+    GECODE_ES_FAIL(Set::Int::Card<Set::SetView>::post(home,s, x));
+  }
+
+}
+
+// STATISTICS: set-post

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/set/convex.cpp

@@ -0,0 +1,60 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2004
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2010-03-04 03:40:32 +1100 (Thu, 04 Mar 2010) $ by $Author: schulte $
+ *     $Revision: 10365 $
+ *
+ *  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/set/convex.hh>
+
+namespace Gecode {
+
+  void
+  convex(Home home, SetVar x) {
+    using namespace Gecode::Set;
+    if (home.failed()) return;
+    GECODE_ES_FAIL(Convex::Convex::post(home, x));
+  }
+
+  void
+  convex(Home home, SetVar x, SetVar y) {
+    using namespace Gecode::Set;
+    if (home.failed()) return;
+    GECODE_ES_FAIL(Convex::ConvexHull::post(home, x,y));
+  }
+
+}
+
+// STATISTICS: set-post

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/set/convex.hh

@@ -0,0 +1,107 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  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: 2009-10-13 02:36:53 +1100 (Tue, 13 Oct 2009) $ by $Author: schulte $
+ *     $Revision: 9878 $
+ *
+ *  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.
+ *
+ */
+
+#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(Home 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, const ModEventDelta& med);
+    /// Post propagator that propagates that \a x is convex
+    static  ExecStatus  post(Home 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(Home 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, const ModEventDelta& med);
+    /// Post propagator that propagates that \a y is the convex hull of \a x
+    static  ExecStatus  post(Home home,SetView x,SetView y);
+  };
+
+
+}}}
+
+#include <gecode/set/convex/conv.hpp>
+#include <gecode/set/convex/hull.hpp>
+
+#endif
+
+// STATISTICS: set-prop

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/set/convex/conv.cpp

@@ -0,0 +1,97 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  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: 2011-08-09 02:04:53 +1000 (Tue, 09 Aug 2011) $ by $Author: schulte $
+ *     $Revision: 12253 $
+ *
+ *  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/set/convex.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, const ModEventDelta&) {
+    //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) {
+         assert(ubRangeIt());
+         maxWidth = std::max(maxWidth, ubRangeIt.width());
+       }
+       GECODE_ME_CHECK( x0.cardMax(home,maxWidth) );
+    }
+
+
+    //I + III
+
+    Region r(home);
+    LubRanges<SetView> ubRangeIt(x0);
+    Iter::Ranges::Cache ubRangeItC(r,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 home.ES_SUBSUMED(*this);
+    return ES_FIX;
+  }
+
+}}}
+
+// STATISTICS: set-prop

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/set/convex/conv.hpp

@@ -0,0 +1,67 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  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: 2009-10-13 02:36:53 +1100 (Tue, 13 Oct 2009) $ by $Author: schulte $
+ *     $Revision: 9878 $
+ *
+ *  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.
+ *
+ */
+
+namespace Gecode { namespace Set { namespace Convex {
+
+  /*
+   * "Convex" propagator
+   *
+   */
+
+  forceinline
+  Convex::Convex(Home home, SetView x)
+    : UnaryPropagator<SetView, PC_SET_ANY>(home,x) {}
+
+  forceinline
+  Convex::Convex(Space& home, bool share, Convex& p)
+    : UnaryPropagator<SetView, PC_SET_ANY>(home,share,p) {}
+
+  forceinline ExecStatus
+  Convex::post(Home home, SetView x) {
+    (void) new (home) Convex(home,x);
+    return ES_OK;
+  }
+
+}}}
+
+// STATISTICS: set-prop

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/set/convex/hull.cpp

@@ -0,0 +1,116 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  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: 2011-08-09 02:04:53 +1000 (Tue, 09 Aug 2011) $ by $Author: schulte $
+ *     $Revision: 12253 $
+ *
+ *  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/set/convex.hh>
+
+namespace Gecode { namespace Set { namespace Convex {
+
+  Actor*
+  ConvexHull::copy(Space& home, bool share) {
+    return new (home) ConvexHull(home,share,*this);
+  }
+
+  ExecStatus
+  ConvexHull::propagate(Space& home, const ModEventDelta&) {
+    //x1 is the convex hull of x0
+
+    GECODE_ME_CHECK( x1.cardMin(home,x0.cardMin()) );
+    GECODE_ME_CHECK( x0.cardMax(home,x1.cardMax()) );
+
+    do {
+
+      //intersect x1 with (x0.lubMin(),x0.lubMax())
+      //This empties x1 if x0.ub is empty. twice.
+      GECODE_ME_CHECK( x1.exclude(home,Limits::min,
+                                  x0.lubMin()-1) );
+      GECODE_ME_CHECK( x1.exclude(home,x0.lubMax()+1,
+                                  Limits::max) );
+
+      int minElement = std::min(x1.glbMin(),x0.glbMin());
+      int maxElement = std::max(x1.glbMax(),x0.glbMax());
+
+      if (minElement<maxElement) {
+        GECODE_ME_CHECK( x1.include(home, minElement, maxElement));
+      }
+
+      unsigned int cardMin = x1.cardMin();
+
+      Region r(home);
+      LubRanges<SetView> ubRangeIt(x1);
+      Iter::Ranges::Cache ubRangeItC(r,ubRangeIt);
+      for (;ubRangeItC();++ubRangeItC){
+        if (ubRangeItC.width() < cardMin
+            || ubRangeItC.min() > minElement //No need to test for empty lb.
+            || ubRangeItC.max() < maxElement
+            ) {
+          GECODE_ME_CHECK( x1.exclude(home,
+                                      ubRangeItC.min(), ubRangeItC.max()) );
+        }
+      }
+
+      LubRanges<SetView> ubRangeIt2(x1);
+      GECODE_ME_CHECK(x0.intersectI(home,ubRangeIt2) );
+
+      if (x1.lubMin()!=BndSet::MIN_OF_EMPTY) {
+        if(x1.lubMin()==x1.glbMin()) {
+              GECODE_ME_CHECK(x0.include(home,x1.lubMin()));
+        }
+        if(x1.lubMax()==x1.glbMax()) {
+              GECODE_ME_CHECK(x0.include(home,x1.lubMax()));
+        }
+      }
+    } while(x0.assigned()&&!x1.assigned());
+
+    //If x0 is assigned, x1 should be too.
+    assert(x1.assigned() || !x0.assigned());
+
+    if (x1.assigned()) {
+      return home.ES_SUBSUMED(*this);
+    }
+
+    return ES_NOFIX;
+  }
+
+}}}
+
+// STATISTICS: set-prop