gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.2.0/test/int/mm-rel.cc

@@ -0,0 +1,136 @@
+/* -*- 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-29 01:09:17 +0100 (Fri, 29 Feb 2008) $ by $Author: schulte $
+ *     $Revision: 6355 $
+ *
+ *  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 minimal modelling constraints (simple relations)
+   namespace MiniModel {
+   
+     /**
+      * \defgroup TaskTestIntMiniModelRel Minimal modelling constraints (relation)
+      * \ingroup TaskTestInt
+      */
+     //@{
+     /// Test for relation between arrays of integer variables
+     class IntLex : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       IntLex(Gecode::IntRelType irt0)
+         : Test("MiniModel::Lex::Int::"+str(irt0),6,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int n=x.size() >> 1;
+         for (int i=0; i<n; i++)
+           if (x[i] != x[n+i])
+             return cmp(x[i],irt,x[n+i]);
+         return ((irt == Gecode::IRT_LQ) || (irt == Gecode::IRT_GQ) || 
+                 (irt == Gecode::IRT_EQ));
+         GECODE_NEVER;
+         return false;
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         int n=x.size() >> 1;
+         IntVarArgs y(n); IntVarArgs z(n);
+         for (int i=0; i<n; i++) {
+           y[i]=x[i]; z[i]=x[n+i];
+         }
+         lex(home, y, irt, z);
+       }
+     };
+   
+     /// Test for relation between arrays of Boolean variables
+     class BoolLex : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       BoolLex(Gecode::IntRelType irt0)
+         : Test("MiniModel::Lex::Bool::"+str(irt0),10,0,1), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int n=x.size() >> 1;
+         for (int i=0; i<n; i++)
+           if (x[i] != x[n+i])
+             return cmp(x[i],irt,x[n+i]);
+         return ((irt == Gecode::IRT_LQ) || (irt == Gecode::IRT_GQ) || 
+                 (irt == Gecode::IRT_EQ));
+         GECODE_NEVER;
+         return false;
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         int n=x.size() >> 1;
+         BoolVarArgs y(n); BoolVarArgs z(n);
+         for (int i=0; i<n; i++) {
+           y[i]=channel(home,x[i]); z[i]=channel(home,x[n+i]);
+         }
+         lex(home, y, irt, z);
+       }
+     };
+
+     /// Help class to create and register tests
+     class Create {
+     public:
+       /// Perform creation and registration
+       Create(void) {
+         using namespace Gecode;
+         for (IntRelTypes irts; irts(); ++irts) {
+           (void) new IntLex(irts.irt());
+           (void) new BoolLex(irts.irt());
+         }      
+       }
+     };
+     
+     Create c;
+     //@}
+
+   }
+
+}}
+
+// STATISTICS: test-minimodel

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

@@ -0,0 +1,416 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2005
+ *
+ *  Last modified:
+ *     $Date: 2008-07-11 09:18:29 +0200 (Fri, 11 Jul 2008) $ by $Author: tack $
+ *     $Revision: 7280 $
+ *
+ *  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 relation constraints
+   namespace Rel {
+   
+     /**
+      * \defgroup TaskTestIntRel Relation constraints
+      * \ingroup TaskTestInt
+      */
+     //@{
+     /// Test for simple relation involving integer variables
+     class IntVarXY : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       IntVarXY(Gecode::IntRelType irt0, int n, Gecode::IntConLevel icl)
+         : Test("Rel::Int::Var::XY::"+str(irt0)+"::"+str(icl)+"::"+str(n),
+                n+1,-3,3,n==1,icl), 
+           irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         if (x.size() == 2) {
+           return cmp(x[0],irt,x[1]);
+         } else {
+           return cmp(x[0],irt,x[2]) && cmp(x[1],irt,x[2]);
+         }
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         if (x.size() == 2) {
+           rel(home, x[0], irt, x[1], icl);
+         } else {
+           IntVarArgs y(2);
+           y[0]=x[0]; y[1]=x[1];
+           rel(home, y, irt, x[2], icl);
+         }
+       }
+       /// Post reified constraint on \a x for \a b
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x, 
+                         Gecode::BoolVar b) {
+         assert(x.size() == 2);
+         Gecode::rel(home, x[0], irt, x[1], b, icl);
+       }
+     };
+   
+     /// Test for simple relation involving shared integer variables
+     class IntVarXX : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       IntVarXX(Gecode::IntRelType irt0, Gecode::IntConLevel icl)
+         : Test("Rel::Int::Var::XX::"+str(irt0)+"::"+str(icl),
+                1,-3,3,true,icl), 
+           irt(irt0) {
+         testdomcon = ((irt != Gecode::IRT_LE) && 
+                       (irt != Gecode::IRT_GR) &&
+                       (irt != Gecode::IRT_NQ));
+       }
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         return cmp(x[0],irt,x[0]);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::rel(home, x[0], irt, x[0], icl);
+       }
+       /// Post reified constraint on \a x for \a b
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x, 
+                         Gecode::BoolVar b) {
+         Gecode::rel(home, x[0], irt, x[0], b, icl);
+       }
+     };
+   
+     /// Test for simple relation involving Boolean variables
+     class BoolVarXY : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       BoolVarXY(Gecode::IntRelType irt0, int n) 
+         : Test("Rel::Bool::Var::XY::"+str(irt0)+"::"+str(n),n+1,0,1,
+                n==1), 
+           irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         if (x.size() == 2) {
+           return cmp(x[0],irt,x[1]);
+         } else {
+           return cmp(x[0],irt,x[2]) && cmp(x[1],irt,x[2]);
+         }
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         if (x.size() == 2) {
+           rel(home, channel(home,x[0]), irt, channel(home,x[1]));
+         } else {
+           BoolVarArgs y(2);
+           y[0]=channel(home,x[0]); y[1]=channel(home,x[1]);
+           rel(home, y, irt, channel(home,x[2]));
+         }
+       }
+       /// Post reified constraint on \a x for \a b
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x, 
+                         Gecode::BoolVar b) {
+         assert(x.size() == 2);
+         using namespace Gecode;
+         rel(home, 
+             channel(home,x[0]), irt, channel(home,x[1]), 
+             b);
+       }
+     };
+   
+     /// Test for simple relation involving shared Boolean variables
+     class BoolVarXX : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       BoolVarXX(Gecode::IntRelType irt0) 
+         : Test("Rel::Bool::Var::XX::"+str(irt0),1,0,1), 
+           irt(irt0) {
+         testdomcon = ((irt != Gecode::IRT_LE) && 
+                       (irt != Gecode::IRT_GR) &&
+                       (irt != Gecode::IRT_NQ));
+       }
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         return cmp(x[0],irt,x[0]);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::BoolVar b = Gecode::channel(home,x[0]);
+         Gecode::rel(home, b, irt, b);
+       }
+     };
+   
+     /// Test for simple relation involving integer variable and integer constant
+     class IntInt : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+       /// Integer constant
+       int c;
+     public:
+       /// Create and register test
+       IntInt(Gecode::IntRelType irt0, int n, int c0) 
+         : Test("Rel::Int::Int::"+str(irt0)+"::"+str(n)+"::"+str(c0),
+                n,-3,3,n==1), 
+           irt(irt0), c(c0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         if (x.size() == 1)
+           return cmp(x[0],irt,c);
+         else
+           return cmp(x[0],irt,c) && cmp(x[1],irt,c);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         if (x.size() == 1)
+           rel(home, x[0], irt, c);
+         else
+           rel(home, x, irt, c);
+       }
+       /// Post reified constraint on \a x for \a b
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x, 
+                         Gecode::BoolVar b) {
+         assert(x.size() == 1);
+         Gecode::rel(home, x[0], irt, c, b);
+       }
+     };
+   
+     /// Test for simple relation involving Boolean variable and integer constant
+     class BoolInt : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+       /// Integer constant
+       int c;
+     public:
+       /// Create and register test
+       BoolInt(Gecode::IntRelType irt0, int n, int c0) 
+         : Test("Rel::Bool::Int::"+str(irt0)+"::"+str(n)+"::"+str(c0),n,0,1,
+                n==1), 
+           irt(irt0), c(c0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         if (x.size() == 1)
+           return cmp(x[0],irt,c);
+         else
+           return cmp(x[0],irt,c) && cmp(x[1],irt,c);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         if (x.size() == 1) {
+           rel(home, channel(home,x[0]), irt, c);
+         } else {
+           BoolVarArgs y(2);
+           y[0]=channel(home,x[0]); y[1]=channel(home,x[1]);
+           rel(home, y, irt, c);
+         }
+       }
+       /// Post reified constraint on \a x for \a b
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x, 
+                         Gecode::BoolVar b) {
+         assert(x.size() == 1);
+         using namespace Gecode;
+         rel(home, channel(home,x[0]), irt, c, b);
+       }
+     };
+   
+     /// Test for pairwise relation between integer variables
+     class IntPairwise : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       IntPairwise(Gecode::IntRelType irt0, Gecode::IntConLevel icl)
+         : Test("Rel::Int::Pairwise::"+str(irt0)+"::"+str(icl),
+                   4,-3,3,false,icl), 
+           irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         for (int i=0; i<x.size(); i++)
+           for (int j=i+1; j<x.size(); j++)
+             if (!cmp(x[i],irt,x[j]))
+               return false;
+         return true;
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::rel(home, x, irt, icl);
+       }
+     };
+   
+     /// Test for pairwise relation between Boolean variables
+     class BoolPairwise : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       BoolPairwise(Gecode::IntRelType irt0)
+         : Test("Rel::Bool::Pairwise::"+str(irt0),8,0,1), 
+           irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         for (int i=0; i<x.size(); i++)
+           for (int j=i+1; j<x.size(); j++)
+             if (!cmp(x[i],irt,x[j]))
+               return false;
+         return true;
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         BoolVarArgs b(x.size());
+         for (int i=x.size(); i--; )
+           b[i]=channel(home,x[i]);
+         rel(home, b, irt);
+       }
+     };
+   
+     /// Test for relation between arrays of integer variables
+     class IntArray : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       IntArray(Gecode::IntRelType irt0)
+         : Test("Rel::Int::Array::"+str(irt0),6,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int n=x.size() >> 1;
+         for (int i=0; i<n; i++)
+           if (x[i] != x[n+i])
+             return cmp(x[i],irt,x[n+i]);
+         return ((irt == Gecode::IRT_LQ) || (irt == Gecode::IRT_GQ) || 
+                 (irt == Gecode::IRT_EQ));
+         GECODE_NEVER;
+         return false;
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         int n=x.size() >> 1;
+         IntVarArgs y(n); IntVarArgs z(n);
+         for (int i=0; i<n; i++) {
+           y[i]=x[i]; z[i]=x[n+i];
+         }
+         rel(home, y, irt, z);
+       }
+     };
+   
+     /// Test for relation between arrays of Boolean variables
+     class BoolArray : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       BoolArray(Gecode::IntRelType irt0)
+         : Test("Rel::Bool::Array::"+str(irt0),10,0,1), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int n=x.size() >> 1;
+         for (int i=0; i<n; i++)
+           if (x[i] != x[n+i])
+             return cmp(x[i],irt,x[n+i]);
+         return ((irt == Gecode::IRT_LQ) || (irt == Gecode::IRT_GQ) || 
+                 (irt == Gecode::IRT_EQ));
+         GECODE_NEVER;
+         return false;
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         using namespace Gecode;
+         int n=x.size() >> 1;
+         BoolVarArgs y(n); BoolVarArgs z(n);
+         for (int i=0; i<n; i++) {
+           y[i]=channel(home,x[i]); z[i]=channel(home,x[n+i]);
+         }
+         rel(home, y, irt, z);
+       }
+     };
+   
+     /// Help class to create and register tests
+     class Create {
+     public:
+       /// Perform creation and registration
+       Create(void) {
+         using namespace Gecode;
+         for (IntRelTypes irts; irts(); ++irts) {
+           for (IntConLevels icls; icls(); ++icls) {
+             (void) new IntVarXY(irts.irt(),1,icls.icl());
+             (void) new IntVarXY(irts.irt(),2,icls.icl());
+             (void) new IntVarXX(irts.irt(),icls.icl());
+             (void) new IntPairwise(irts.irt(),icls.icl());
+           }
+           (void) new BoolVarXY(irts.irt(),1);
+           (void) new BoolVarXY(irts.irt(),2);
+           (void) new BoolVarXX(irts.irt());
+           (void) new BoolPairwise(irts.irt());
+           for (int c=-4; c<=4; c++) {
+             (void) new IntInt(irts.irt(),1,c);
+             (void) new IntInt(irts.irt(),2,c);
+           }
+           for (int c=0; c<=1; c++) {
+             (void) new BoolInt(irts.irt(),1,c);
+             (void) new BoolInt(irts.irt(),2,c);
+           }
+           (void) new IntArray(irts.irt());
+           (void) new BoolArray(irts.irt());
+         }      
+       }
+     };
+   
+     Create c;
+     //@}
+   
+   }
+}}
+
+// STATISTICS: test-int