gecoder-with-gecode 0.9.0 → 0.9.1

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

@@ -0,0 +1,100 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2007
+ *
+ *  Last modified:
+ *     $Date: 2007-09-13 13:10:46 +0200 (Thu, 13 Sep 2007) $ by $Author: schulte $
+ *     $Revision: 5022 $
+ *
+ *  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 circuit constraints
+   namespace Circuit {
+   
+     /**
+      * \defgroup TaskTestIntCircuit Circuit constraints
+      * \ingroup TaskTestInt
+      */
+     //@{
+     /// Simple test for circuit constraint
+     class Circuit : public Test {
+     public:
+       /// Create and register test
+       Circuit(int n, int min, int max, Gecode::IntConLevel icl)
+         : Test("Circuit::" + str(icl) + "::" + str(n),
+                   n,min,max,false,icl) {
+         testdomcon = false;
+       }
+       /// Check whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         for (int i=x.size(); i--; )
+           if ((x[i] < 0) || (x[i] > x.size()-1))
+             return false;
+         int reachable = 0;
+         {
+           int j=0;
+           for (int i=x.size(); i--; ) {
+             j=x[j]; reachable |= (1 << j);
+           }
+         }
+         for (int i=x.size(); i--; )
+           if (!(reachable & (1 << i)))
+             return false;
+         return true;
+       }
+       /// Post circuit constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         circuit(home, x, icl);
+       }
+     };
+   
+     /// Help class to create and register tests
+     class Create {
+     public:
+       /// Perform creation and registration
+       Create(void) {
+         for (int i=1; i<=6; i++) {
+           (void) new Circuit(i,0,i-1,Gecode::ICL_VAL);
+           (void) new Circuit(i,0,i-1,Gecode::ICL_DOM);
+         }
+       }
+     };
+   
+     Create c;
+     //@}
+   
+   }
+}}
+
+// STATISTICS: test-int

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

@@ -0,0 +1,357 @@
+/* -*- 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-02-19 11:41:53 +0100 (Tue, 19 Feb 2008) $ by $Author: schulte $
+ *     $Revision: 6233 $
+ *
+ *  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 count constraints
+   namespace Count {
+   
+     /**
+      * \defgroup TaskTestIntCount Count constraints
+      * \ingroup TaskTestInt
+      */
+     //@{
+     /// Test number of equal integers equal to integer
+     class IntInt : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       IntInt(Gecode::IntRelType irt0)
+         : Test("Count::Int::Int::"+str(irt0),4,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int m = 0;
+         for (int i=x.size(); i--; )
+           if (x[i] == 0)
+             m++;
+         return cmp(m,irt,2);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::count(home, x,0,irt,2);
+       }
+     };
+   
+     /// Test number of equal integers equal to integer with duplicate variables
+     class IntIntDup : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       IntIntDup(Gecode::IntRelType irt0)
+         : Test("Count::Int::Int::Dup::"+str(irt0),4,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int m = 0;
+         for (int i=x.size(); i--; )
+           if (x[i] == 0)
+             m += 2;
+         return cmp(m,irt,4);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::IntVarArgs y(8);
+         for (int i=x.size(); i--; )
+           y[i]=y[4+i]=x[i];
+         Gecode::count(home, y, 0, irt, 4);
+       }
+     };
+   
+     /// Test number of equal integers equal to integer variable
+     class IntVar : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       IntVar(Gecode::IntRelType irt0)
+         : Test("Count::Int::Var::"+str(irt0),5,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int m = 0;
+         for (int i=0; i<4; i++)
+           if (x[i] == 0)
+             m++;
+         return cmp(m,irt,x[4]);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::IntVarArgs y(4);
+         for (int i=0; i<4; i++)
+           y[i]=x[i];
+         Gecode::count(home, y, 0, irt, x[4]);
+       }
+     };
+   
+     Gecode::IntArgs ints(4, 1,0,3,2);
+   
+     /// Test number of several equal integers equal to integer
+     class IntArrayInt : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       IntArrayInt(Gecode::IntRelType irt0)
+         : Test("Count::IntArray::Int::"+str(irt0),5,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int m = 0;
+         for (int i=0; i<4; i++)
+           if (x[i] == ints[i])
+             m++;
+         return cmp(m,irt,2);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::IntVarArgs y(4);
+         for (int i=0; i<4; i++)
+           y[i]=x[i];
+         Gecode::count(home, y, ints, irt, 2);
+       }
+     };
+   
+     /// Test number of several equal integers equal to integer variable
+     class IntArrayVar : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       IntArrayVar(Gecode::IntRelType irt0)
+         : Test("Count::IntArray::Var::"+str(irt0),5,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int m = 0;
+         for (int i=0; i<4; i++)
+           if (x[i] == ints[i])
+             m++;
+         return cmp(m,irt,x[4]);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::IntVarArgs y(4);
+         for (int i=0; i<4; i++)
+           y[i]=x[i];
+         Gecode::count(home, y, ints, irt, x[4]);
+       }
+     };
+   
+     /// Test number of equal integers equal to integer variable with sharing
+     class IntVarShared : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       IntVarShared(Gecode::IntRelType irt0)
+         : Test("Count::Int::Var::Shared::"+str(irt0),4,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int m = 0;
+         for (int i=0; i<4; i++)
+           if (x[i] == 0)
+             m++;
+         return cmp(m,irt,x[2]);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::count(home, x, 0, irt, x[2]);
+       }
+     };
+   
+     /// Test number of equal variables equal to integer variable
+     class VarVar : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       VarVar(Gecode::IntRelType irt0)
+         : Test("Count::Var::Var::"+str(irt0),5,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int m = 0;
+         for (int i=0; i<3; i++)
+           if (x[i] == x[3])
+             m++;
+         return cmp(m,irt,x[4]);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::IntVarArgs y(3);
+         for (int i=0; i<3; i++)
+           y[i]=x[i];
+         Gecode::count(home, y, x[3], irt, x[4]);
+       }
+     };
+   
+     /// Test number of equal variables equal to integer
+     class VarInt : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       VarInt(Gecode::IntRelType irt0)
+         : Test("Count::Var::Int::"+str(irt0),4,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int m = 0;
+         for (int i=0; i<3; i++)
+           if (x[i] == x[3])
+             m++;
+         return cmp(m,irt,2);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::IntVarArgs y(3);
+         for (int i=0; i<3; i++)
+           y[i]=x[i];
+         Gecode::count(home, y, x[3], irt, 2);
+       }
+     };
+   
+     /// Test number of equal variables equal to integer variable with sharing
+     class VarVarSharedA : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       VarVarSharedA(Gecode::IntRelType irt0)
+         : Test("Count::Var::Var::Shared::A::"+str(irt0),5,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int m = 0;
+         for (int i=0; i<4; i++)
+           if (x[i] == x[1])
+             m++;
+         return cmp(m,irt,x[4]);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::IntVarArgs y(4);
+         for (int i=0; i<4; i++)
+           y[i]=x[i];
+         Gecode::count(home, y, x[1], irt, x[4]);
+       }
+     };
+   
+     /// Test number of equal variables equal to integer variable with sharing
+     class VarVarSharedB : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       VarVarSharedB(Gecode::IntRelType irt0)
+         : Test("Count::Var::Var::Shared::B::"+str(irt0),5,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int m = 0;
+         for (int i=0; i<4; i++)
+           if (x[i] == x[4])
+             m++;
+         return cmp(m,irt,x[3]);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::IntVarArgs y(4);
+         for (int i=0; i<4; i++)
+           y[i]=x[i];
+         Gecode::count(home, y, x[4], irt, x[3]);
+       }
+     };
+   
+     /// Test number of equal variables equal to integer variable with sharing
+     class VarVarSharedC : public Test {
+     protected:
+       /// Integer relation type to propagate
+       Gecode::IntRelType irt;
+     public:
+       /// Create and register test
+       VarVarSharedC(Gecode::IntRelType irt0)
+         : Test("Count::Var::Var::Shared::A::"+str(irt0),4,-2,2), irt(irt0) {}
+       /// Test whether \a x is solution
+       virtual bool solution(const Assignment& x) const {
+         int m = 0;
+         for (int i=0; i<4; i++)
+           if (x[i] == x[1])
+             m++;
+         return cmp(m,irt,x[3]);
+       }
+       /// Post constraint on \a x
+       virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) {
+         Gecode::count(home, x, x[1], irt, x[3]);
+       }
+     };
+   
+     /// Help class to create and register tests
+     class Create {
+     public:
+       /// Perform creation and registration
+       Create(void) {
+         for (IntRelTypes irts; irts(); ++irts) {
+           (void) new IntInt(irts.irt());
+           (void) new IntIntDup(irts.irt());
+           (void) new IntVar(irts.irt());
+           (void) new IntArrayInt(irts.irt());
+           (void) new IntArrayVar(irts.irt());
+           (void) new IntVarShared(irts.irt());
+           (void) new VarVar(irts.irt());
+           (void) new VarInt(irts.irt());
+           (void) new VarVarSharedA(irts.irt());
+           (void) new VarVarSharedB(irts.irt());
+           (void) new VarVarSharedC(irts.irt());
+         }
+       }
+     };
+   
+     Create c;
+     //@}
+   
+   }
+}}
+
+// STATISTICS: test-int
+