gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.2.0/test/int/scheduling.cc

@@ -0,0 +1,276 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Mikael Lagerkvist <lagerkvist@gecode.org>
+ *
+ *  Copyright:
+ *     Mikael Lagerkvist, 2005
+ *
+ *  Last modified:
+ *     $Date: 2008-07-11 09:40:23 +0200 (Fri, 11 Jul 2008) $ by $Author: tack $
+ *     $Revision: 7299 $
+ *
+ *  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 "test/int.hh"
+
+#include "gecode/minimodel.hh"
+#include "gecode/search.hh"
+
+#include <vector>
+#include <algorithm>
+#include <string>
+#include <sstream>
+
+namespace Test { namespace Int {
+
+   /// Tests for scheduling constraints
+   namespace Scheduling {
+   
+     /**
+      * \defgroup TaskTestIntScheduling Scheduling constraints
+      * \ingroup TaskTestInt
+      */
+     //@{
+     /**
+      * \brief Script for generating assignments.
+      *
+      * We are only interested in assignments that represent tasks (s_i,
+      * d_i, e_i, h_i) such that the following hold:
+      *   - The task starts at a positive time and has some extension.
+      *   - The equation s_i + d_i = e_i holds.
+      *   - The tasks are ordered to remove some symmetries, i.e.,
+      *     s_i <= s_{i+1}
+      */
+     class Ass : public Gecode::Space {
+     public:
+       /// Store task information
+       Gecode::IntVarArray x;
+       /// Initialize model for assignments
+       Ass(int n, const Gecode::IntSet& d) : x(this, n, d) {
+         using namespace Gecode;
+         for (int i = 0; i < n; i += 4) {
+           post(this, x[i+0] >= 0);
+           post(this, x[i+1] >= 0);
+           post(this, x[i+2] >= 0);
+           post(this, x[i] + x[i+1] == x[i+2]);
+           branch(this, x, INT_VAR_NONE, INT_VAL_MIN);
+         }
+       }
+       /// Constructor for cloning \a s
+       Ass(bool share, Ass& s) : Gecode::Space(share,s) {
+         x.update(this, share, s.x);
+       }
+       /// Create copy during cloning
+       virtual Gecode::Space* copy(bool share) {
+         return new Ass(share,*this);
+       }
+     };
+   
+     /// Class for generating reasonable assignments
+     class CumulativeAssignment : public Assignment {
+       /// Current assignment
+       Ass* cur;
+       /// Next assignment
+       Ass* nxt;
+       /// Search engine to find assignments
+       Gecode::DFS<Ass>* e;
+     public:
+       /// Initialize assignments for \a n0 variables and values \a d0
+       CumulativeAssignment(int n, const Gecode::IntSet& d) : Assignment(n,d) {
+         Ass* a = new Ass(n, d);
+         e = new Gecode::DFS<Ass>(a);
+         delete a;
+         nxt = cur = e->next();
+         if (cur != NULL) 
+           nxt = e->next();
+       }
+       /// Test whether all assignments have been iterated
+       virtual bool operator()(void) const {
+         return nxt != NULL;
+       }
+       /// Move to next assignment
+       virtual void operator++(void) {
+         delete cur;
+         cur = nxt;
+         if (cur != NULL) nxt = e->next();
+       }
+       /// Return value for variable \a i
+       virtual int  operator[](int i) const {
+         assert((i>=0) && (i<n) && (cur != NULL));
+         return cur->x[i].val();
+       }
+       /// Destructor
+       virtual ~CumulativeAssignment(void) {
+         delete cur; delete nxt; delete e;
+       }
+     };
+   
+     /// Event to be scheduled
+     class Event {
+     public:
+       int p, h; ///< Position and height of event
+       bool start; ///< Whether event has just started
+       /// Initialize event
+       Event(int pos, int height, bool s) : p(pos), h(height), start(s) {}
+       /// Test whether this event is before event \a e 
+       bool operator<(const Event& e) const { 
+         return p<e.p; 
+       }
+     };
+   
+     /// Describe that event is below a certain limit
+     class Below {
+     public:
+       int limit; ///< limit
+       /// Initialize
+       Below(int l) : limit(l) {}
+       /// Test whether \a val is below limit
+       bool operator()(int val) { 
+         return val <= limit; 
+       }
+     };
+     /// Describe that event is above a certain limit
+     class Above {
+     public:
+       int limit; ///< limit
+       /// Initialize
+       Above(int l) : limit(l) {}
+       /// Test whether \a val is above limit
+       bool operator()(int val) { 
+         return val >= limit; 
+       }
+     };
+   
+     /// Check whether event \a e is valid
+     template <class C>
+     bool valid(std::vector<Event> e, C comp) {
+       std::sort(e.begin(), e.end());
+       unsigned int i = 0;
+       int p = 0;
+       int h = 0;
+       int n = 0;
+       while (i < e.size()) {
+         p = e[i].p;
+         while (i < e.size() && e[i].p == p) {
+           h += e[i].h;
+           n += (e[i].start ? +1 : -1);
+           ++i;
+         }
+         if (n && !comp(h))
+           return false;
+       }
+       return true;
+     }
+   
+     /// Test for cumulatives constraint
+     class Cumulatives : public Test {
+     protected:
+       int ntasks;   ///< Number of tasks
+       bool at_most; ///< Whether to use atmost reasoning
+       int limit;    ///< Limit
+     public:
+       /// Create and register test
+       Cumulatives(const std::string& s, int nt, bool am, int l)
+         : Test("Cumulatives::"+s,nt*4,-1,2), ntasks(nt), at_most(am), limit(l) {
+         testsearch = false;
+       }
+       /// Create first assignment
+       virtual Assignment* assignment(void) const {
+         assert(arity == 4*ntasks);
+         return new CumulativeAssignment(arity, dom);
+       }
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         std::vector<Event> e;
+         for (int i = 0; i < ntasks; ++i) {
+           int p = i*4;
+           // Positive start, duration and end
+           if (x[p+0] < 0 || x[p+1] < 1 || x[p+2] < 1) return false;
+           // Start + Duration == End
+           if (x[p+0] + x[p+1] != x[p+2]) {
+             return false;
+           }
+         }
+         for (int i = 0; i < ntasks; ++i) {
+           int p = i*4;
+           // Up at start, down at end.
+           e.push_back(Event(x[p+0], +x[p+3],  true));
+           e.push_back(Event(x[p+2], -x[p+3], false));
+         }
+         if (at_most) {
+           return valid(e, Below(limit));
+         } else {
+           return valid(e, Above(limit));
+         }
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         IntArgs m(ntasks), l(1, limit);
+         IntVarArgs s(ntasks), d(ntasks), e(ntasks), h(ntasks);
+         for (int i = 0; i < ntasks; ++i) {
+           int p = i*4;
+           m[i] = 0;
+           s[i] = x[p+0]; rel(home, x[p+0], Gecode::IRT_GQ, 0);
+           d[i] = x[p+1]; rel(home, x[p+1], Gecode::IRT_GQ, 1);
+           e[i] = x[p+2]; rel(home, x[p+2], Gecode::IRT_GQ, 1);
+           h[i] = x[p+3];
+         }
+         cumulatives(home, m, s, d, e, h, l, at_most);
+       }
+     };
+     
+     Cumulatives c1t1("1t1", 1,  true, 1);
+     Cumulatives c1f1("1f1", 1, false, 1);
+     Cumulatives c1t2("1t2", 1,  true, 2);
+     Cumulatives c1f2("1f2", 1, false, 2);
+     Cumulatives c1t3("1t3", 1,  true, 3);
+     Cumulatives c1f3("1f3", 1, false, 3);
+     Cumulatives c2t1("2t1", 2,  true, 1);
+     Cumulatives c2f1("2f1", 2, false, 1);
+     Cumulatives c2t2("2t2", 2,  true, 2);
+     Cumulatives c2f2("2f2", 2, false, 2);
+     Cumulatives c2t3("2t3", 2,  true, 3);
+     Cumulatives c2f3("2f3", 2, false, 3);
+     Cumulatives c3t1("3t1", 3,  true, 1);
+     Cumulatives c3f1("3f1", 3, false, 1);
+     Cumulatives c3t2("3t2", 3,  true, 2);
+     Cumulatives c3f2("3f2", 3, false, 2);
+     Cumulatives c3t3("3t3", 3,  true, 3);
+     Cumulatives c3f3("3f3", 3, false, 3);
+     Cumulatives c3t_1("3t-1", 3,  true, -1);
+     Cumulatives c3f_1("3f-1", 3, false, -1);
+     Cumulatives c3t_2("3t-2", 3,  true, -2);
+     Cumulatives c3f_2("3f-2", 3, false, -2);
+     Cumulatives c3t_3("3t-3", 3,  true, -3);
+     Cumulatives c3f_3("3f-3", 3, false, -3);
+     //@}
+   
+   }
+}}
+
+// STATISTICS: test-int

data/ext/gecode-2.2.0/test/int/sorted.cc

@@ -0,0 +1,165 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Patrick Pekczynski <pekczynski@ps.uni-sb.de>
+ *
+ *  Contributing authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Patrick Pekczynski, 2005
+ *     Christian Schulte, 2007
+ *
+ *  Last modified:
+ *     $Date: 2007-11-12 12:45:49 +0100 (Mon, 12 Nov 2007) $ by $Author: tack $
+ *     $Revision: 5268 $
+ *
+ *  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 "test/int.hh"
+
+namespace Test { namespace Int {
+
+   /// Tests for sorted constraints
+   namespace Sorted {
+   
+     /**
+      * \defgroup TaskTestIntSorted Sorted constraints
+      * \ingroup TaskTestInt
+      */
+     //@{
+   
+     /// Relation for sorting integers in increasing order
+     class SortIntMin {
+     public:
+       /// Test whether \a x is less than \a y
+       bool operator()(const int x, const int y) {
+         return x<y;
+       }
+     };
+   
+     /// Test sorted without permutation variables
+     class NoVar : public Test {
+     protected:
+       /// Number of variables to be sorted
+       static const int n = 3;
+     public:
+       /// Create and register test
+       NoVar(void) : Test("Sorted::NoVar",2*n,0,3) {}
+       /// Test whether \a xy is solution
+       virtual bool solution(const Assignment& xy) const {
+         int x[n], y[n];
+         for (int i=0;i<3; i++) {
+           x[i]=xy[i]; y[i]=xy[n+i];
+         }
+           
+         for (int i=0; i<n-1; i++)
+           if (y[i]>y[i+1])
+             return false;
+   
+         SortIntMin sim;
+         Gecode::Support::quicksort<int,SortIntMin>(x,n,sim);
+   
+         for (int i=0; i<n; i++)
+           if (x[i] != y[i])
+             return false;
+         return true;
+       }
+       /// Post constraint on \a xy
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& xy) {
+         Gecode::IntVarArgs x(n), y(n);
+         for (int i=0; i<n; i++) {
+           x[i]=xy[i]; y[i]=xy[n+i];
+         }
+         Gecode::sorted(home,x,y);
+       }
+     };
+   
+   
+     /// Test sorted with permutation variables
+     class PermVar : public Test {
+     protected:
+       /// Number of variables to be sorted
+       static const int n = 3;
+     public:    
+       /// Create and register test
+       PermVar(void) : Test("Sorted::PermVar",3*n,0,2) {}
+       /// Test whether \a xyz is solution
+       virtual bool solution(const Assignment& xyz) const {
+         int x[n], y[n], z[n];
+         for (int i=0; i<n; i++) {
+           x[i]=xyz[i]; y[i]=xyz[n+i]; z[i]=xyz[2*n+i];
+         }
+         // check for permutation
+         for (int i=0; i<n; i++)
+           for (int j=i+1; j<n; j++)
+             if (z[i]==z[j])
+               return false;
+   
+         // y must to be sorted
+         for (int i=0; i<n-1; i++)
+           if (y[i]>y[i+1])
+             return false;
+   
+         // check whether permutation is in range
+         for (int i=0; i<n; i++)
+           if ((z[i] < 0) || (z[i] >= n))
+             return false;
+   
+         // check whether permutation info is correct
+         for (int i=0; i<n; i++)
+           if (x[i] != y[z[i]])
+             return false;
+   
+         // check for sorting
+         SortIntMin sim;
+         Gecode::Support::quicksort<int,SortIntMin>(x,n,sim);
+         for (int i=0; i<n; i++)
+           if (x[i] != y[i])
+             return false;
+   
+         return true;
+       }
+       /// Post constraint on \a xyz
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& xyz) {
+         Gecode::IntVarArgs x(n), y(n), z(n);
+         for (int i=0; i<n; i++) {
+           x[i]=xyz[i]; y[i]=xyz[n+i]; z[i]=xyz[2*n+i];
+         }
+         Gecode::sorted(home,x,y,z);
+       }
+     };
+     
+   
+     NoVar novar;
+     PermVar permvar;
+     //@}
+   
+   }
+}}
+
+// STATISTICS: test-int
+

data/ext/gecode-2.2.0/test/int/unshare.cc

@@ -0,0 +1,109 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2008
+ *
+ *  Last modified:
+ *     $Date: 2008-02-22 02:44:55 +0100 (Fri, 22 Feb 2008) $ by $Author: schulte $
+ *     $Revision: 6273 $
+ *
+ *  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 "test/int.hh"
+
+#include "gecode/minimodel.hh"
+
+namespace Test { namespace Int {
+
+   /// Tests for unsharing variables in arrays
+   namespace Unshare {
+   
+     /**
+      * \defgroup TaskTestIntUnshare Unsharing variables in arrays
+      * \ingroup TaskTestInt
+      */
+     //@{
+     /// Test for unsharing integer variables
+     class Int : public Test {
+     public:
+       /// Create and register test
+       Int(Gecode::IntConLevel icl)
+         : Test("Unshare::Int::"+str(icl),9,-1,1,false,icl) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         return ((x[0] == x[3]) &&
+                 (x[1] == x[4]) && (x[1] == x[6]) &&
+                 (x[2] == x[5]) && (x[2] == x[7]) && (x[2] == x[8]));
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         IntVarArgs y(6);
+         y[0]=x[0]; y[1]=y[3]=x[1]; y[2]=y[4]=y[5]=x[2];
+         unshare(home, y, icl);
+         for (int i=0; i<6; i++)
+           rel(home, y[i], IRT_EQ, x[3+i], ICL_DOM);
+       }
+     };
+
+     /// Test for unsharing Boolean variables
+     class Bool : public Test {
+     public:
+       /// Create and register test
+       Bool(void)
+         : Test("Unshare::Bool",9,0,1,false) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         return ((x[0] == x[3]) &&
+                 (x[1] == x[4]) && (x[1] == x[6]) &&
+                 (x[2] == x[5]) && (x[2] == x[7]) && (x[2] == x[8]));
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         BoolVarArgs y(6);
+         y[0]=channel(home,x[0]); 
+         y[1]=y[3]=channel(home,x[1]); 
+         y[2]=y[4]=y[5]=channel(home,x[2]);
+         unshare(home, y);
+         for (int i=0; i<6; i++)
+           rel(home, y[i], IRT_EQ, channel(home,x[3+i]));
+       }
+     };
+
+     Int i_bnd(Gecode::ICL_BND);
+     Int i_dom(Gecode::ICL_DOM);
+
+     Bool b;
+     //@}
+   
+   }
+}}
+
+// STATISTICS: test-int