gecoder-with-gecode 0.7.1 → 0.8.0

data/ext/gecode-1.3.1/test/int.hh

@@ -1,119 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *     Mikael Lagerkvist <lagerkvist@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2005
- *     Mikael Lagerkvist, 2006
- *
- *  Last modified:
- *     $Date: 2006-08-04 16:07:12 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
- *     $Revision: 3518 $
- *
- *  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_TEST_INT_HH__
-#define __GECODE_TEST_INT_HH__
-
-#include "gecode/int.hh"
-#include "test.hh"
-
-using namespace Gecode;
-using namespace Int;
-
-class Assignment {
-protected:
-  int n;
-  IntSetValues* dsv;
-  IntSet d;
-  bool done;
-public:
-  Assignment(int, const IntSet&);
-  virtual void reset(void);
-  virtual bool operator()(void) const {
-    return !done;
-  }
-  virtual void operator++(void);
-  virtual int  operator[](int i) const {
-    assert((i>=0) && (i<n));
-    return dsv[i].val();
-  }
-  int size(void) const {
-    return n;
-  }
-  virtual ~Assignment(void) {
-    delete [] dsv;
-  }
-};
-
-class RandomAssignment : public Assignment {
-protected:
-  int *vals;
-  int count;
-  int left;
-  virtual int randval(void);
-public:
-  RandomAssignment(int, const IntSet&, int);
-  virtual void reset(void);
-  virtual bool operator()(void) const {
-    return left > 0;
-  }
-  virtual int  operator[](int i) const {
-    assert((i>=0) && (i<n));
-    return vals[i];
-  }
-  virtual void operator++(void);
-  virtual ~RandomAssignment(void) {
-    delete [] vals;
-  }
-};
-
-std::ostream&
-operator<<(std::ostream&, const Assignment&);
-
-/**
- * \brief Base class for tests with integer constraints
- *
- */
-class IntTest : public Test {
-protected:
-  /// Number of variables
-  int arity;
-  /// Domain of variables
-  IntSet dom;
-  /// Does the constraint also exist as reified constraint
-  bool reified;
-  /// Consistency level of the propagator
-  IntConLevel icl;
-
-  virtual Assignment* make_assignment(void);
-  virtual bool do_search_test(void) { return true; }
-public:
-  /// Constructor
-  IntTest(const char* t, int a, const IntSet& d,
-	  bool r=false, IntConLevel i=ICL_DEF)
-    : Test("Int",t), arity(a), dom(d), reified(r), icl(i)  {
-  }
-  /// Check for solution
-  virtual bool solution(const Assignment&) const = 0;
-  /// Post propagator
-  virtual void post(Space* home, IntVarArray& x) = 0;
-  /// Post reified propagator
-  virtual void post(Space* home, IntVarArray& x, BoolVar b) {}
-  /// Perform test
-  virtual bool run(const Options& opt);
-};
-
-#endif
-
-// STATISTICS: test-int
-

data/ext/gecode-1.3.1/test/int/arithmetic.cc

@@ -1,262 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2005
- *
- *  Last modified:
- *     $Date: 2006-08-04 16:07:12 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
- *     $Revision: 3518 $
- *
- *  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 "test/int.hh"
-#include "test/log.hh"
-
-#include <cmath>
-#include <algorithm>
-
-namespace {
-  const int s1r[7] = {
-    Limits::Int::int_min, Limits::Int::int_min+1,
-    -1,0,1,
-    Limits::Int::int_max-1, Limits::Int::int_max
-  };
-  const int s2r[9] = {
-    static_cast<int>(-sqrt(static_cast<double>(-Limits::Int::int_min))),
-    -4,-2,-1,0,1,2,4,
-    static_cast<int>(sqrt(static_cast<double>(Limits::Int::int_max)))
-  };
-  IntSet s1(s1r,7);
-  IntSet s2(s2r,9);
-  IntSet s3(-8,8);
-  IntSet s4(-3,3);
-}
-
-class Mult : public IntTest {
-public:
-  Mult(const char* t, const IntSet& is)
-    : IntTest(t,3,is) {}
-  virtual bool solution(const Assignment& x) const {
-    double d0 = static_cast<double>(x[0]);
-    double d1 = static_cast<double>(x[1]);
-    double d2 = static_cast<double>(x[2]);
-    return d0*d1 == d2;
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    Log::log("x[0]*x[1]==x[2]",
-	     "\tmult(this, x[0], x[1], x[2]);");
-    mult(home, x[0], x[1], x[2]);
-  }
-};
-namespace {
-  Mult _multmax("Arithmetic::Mult::A",s1);
-  Mult _multmed("Arithmetic::Mult::B",s2);
-  Mult _multmin("Arithmetic::Mult::C",s3);
-}
-
-class Square : public IntTest {
-public:
-  Square(const char* t, const IntSet& is)
-    : IntTest(t,2,is) {}
-  virtual bool solution(const Assignment& x) const {
-    double d0 = static_cast<double>(x[0]);
-    double d1 = static_cast<double>(x[1]);
-    return d0*d0 == d1;
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    mult(home, x[0], x[0], x[1]);
-  }
-};
-namespace {
-  Square _squaremax("Arithmetic::Square::A",s1);
-  Square _squaremed("Arithmetic::Square::B",s2);
-  Square _squaremin("Arithmetic::Square::C",s3);
-}
-
-class Abs : public IntTest {
-public:
-  Abs(const char* t, IntConLevel icl, const IntSet& is)
-    : IntTest(t,2,is,false,icl) {}
-  virtual bool solution(const Assignment& x) const {
-    double d0 = static_cast<double>(x[0]);
-    double d1 = static_cast<double>(x[1]);
-    return (d0<0 ? -d0 : d0) == d1;
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    Log::log("post abs(x0, x1)",
-	     "\tabs(this, x[0], x[1], icl);");
-    abs(home, x[0], x[1], icl);
-  }
-};
-namespace {
-  Abs _absbndmax("Arithmetic::Abs::Bnd::A",ICL_BND,s1);
-  Abs _absbndmed("Arithmetic::Abs::Bnd::B",ICL_BND,s2);
-  Abs _absbndmin("Arithmetic::Abs::Bnd::C",ICL_BND,s3);
-  Abs _absdommax("Arithmetic::Abs::Dom::A",ICL_DOM,s1);
-  Abs _absdommed("Arithmetic::Abs::Dom::B",ICL_DOM,s2);
-  Abs _absdommin("Arithmetic::Abs::Dom::C",ICL_DOM,s3);
-}
-
-class Min : public IntTest {
-public:
-  Min(const char* t, const IntSet& is)
-    : IntTest(t,3,is) {}
-  virtual bool solution(const Assignment& x) const {
-    return std::min(x[0],x[1]) == x[2];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    min(home, x[0], x[1], x[2]);
-  }
-};
-namespace {
-  Min _minmax("Arithmetic::Min::Bin::A",s1);
-  Min _minmed("Arithmetic::Min::Bin::B",s2);
-  Min _minmin("Arithmetic::Min::Bin::C",s3);
-}
-
-class MinShared : public IntTest {
-public:
-  MinShared(const char* t, const IntSet& is)
-    : IntTest(t,2,is) {}
-  virtual bool solution(const Assignment& x) const {
-    return std::min(x[0],x[1]) == x[0];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    min(home, x[0], x[1], x[0]);
-  }
-};
-namespace {
-  MinShared _minsmax("Arithmetic::Min::Bin::Shared::A",s1);
-  MinShared _minsmed("Arithmetic::Min::Bin::Shared::B",s2);
-  MinShared _minsmin("Arithmetic::Min::Bin::Shared::C",s3);
-}
-
-class Max : public IntTest {
-public:
-  Max(const char* t, const IntSet& is)
-    : IntTest(t,3,is) {}
-  virtual bool solution(const Assignment& x) const {
-    return std::max(x[0],x[1]) == x[2];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    max(home, x[0], x[1], x[2]);
-  }
-};
-namespace {
-  Max _maxmax("Arithmetic::Max::Bin::A",s1);
-  Max _maxmed("Arithmetic::Max::Bin::B",s2);
-  Max _maxmin("Arithmetic::Max::Bin::C",s3);
-}
-
-class MaxShared : public IntTest {
-public:
-  MaxShared(const char* t, const IntSet& is)
-    : IntTest(t,2,is) {}
-  virtual bool solution(const Assignment& x) const {
-    return std::max(x[0],x[1]) == x[0];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    max(home, x[0], x[1], x[0]);
-  }
-};
-namespace {
-  MaxShared _maxsmax("Arithmetic::Max::Bin::Shared::A",s1);
-  MaxShared _maxsmed("Arithmetic::Max::Bin::Shared::B",s2);
-  MaxShared _maxsmin("Arithmetic::Max::Bin::Shared::C",s3);
-}
-
-class MinNary : public IntTest {
-public:
-  MinNary(const char* t, const IntSet& is)
-    : IntTest(t,4,is) {}
-  virtual bool solution(const Assignment& x) const {
-    return std::min(std::min(x[0],x[1]),
-		    x[2]) == x[3];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    Log::log("min(home, x[0:2], x[3])",
-	     "\tIntVarArgs m(3); m[0]=x[0]; m[1]=x[1]; m[2]=x[2];\n"
-	     "\tmin(this, m, x[3]);");
-    IntVarArgs m(3);
-    m[0]=x[0]; m[1]=x[1]; m[2]=x[2];
-    min(home, m, x[3]);
-  }
-};
-namespace {
-  MinNary _minnary("Arithmetic::Min::Nary",s4);
-}
-
-class MinNaryShared : public IntTest {
-public:
-  MinNaryShared(const char* t, const IntSet& is)
-    : IntTest(t,3,is) {}
-  virtual bool solution(const Assignment& x) const {
-    return std::min(std::min(x[0],x[1]),
-		    x[2]) == x[1];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    Log::log("min(home, x[0:2], x[1])",
-	     "\tIntVarArgs m(3); m[0]=x[0]; m[1]=x[1]; m[2]=x[2];\n"
-	     "\tmin(this, m, x[1]);");
-    IntVarArgs m(3);
-    m[0]=x[0]; m[1]=x[1]; m[2]=x[2];
-    min(home, m, x[1]);
-  }
-};
-namespace {
-  MinNaryShared _minsnary("Arithmetic::Min::Nary::Shared",s4);
-}
-
-class MaxNary : public IntTest {
-public:
-  MaxNary(const char* t, const IntSet& is)
-    : IntTest(t,4,is) {}
-  virtual bool solution(const Assignment& x) const {
-    return std::max(std::max(x[0],x[1]),
-		    x[2]) == x[3];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    Log::log("max(home, x[0:2], x[3])",
-	     "\tIntVarArgs m(3); m[0]=x[0]; m[1]=x[1]; m[2]=x[2];\n"
-	     "\tmax(this, m, x[3]);");
-    IntVarArgs m(3);
-    m[0]=x[0]; m[1]=x[1]; m[2]=x[2];
-    max(home, m, x[3]);
-  }
-};
-namespace {
-  MaxNary _maxnary("Arithmetic::Max::Nary",s4);
-}
-
-class MaxNaryShared : public IntTest {
-public:
-  MaxNaryShared(const char* t, const IntSet& is)
-    : IntTest(t,3,is) {}
-  virtual bool solution(const Assignment& x) const {
-    return std::max(std::max(x[0],x[1]),
-		    x[2]) == x[1];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    Log::log("max(home, x[0:2], x[1])",
-	     "\tIntVarArgs m(3); m[0]=x[0]; m[1]=x[1]; m[2]=x[2];\n"
-	     "\tmax(this, m, x[1]);");
-    IntVarArgs m(3);
-    m[0]=x[0]; m[1]=x[1]; m[2]=x[2];
-    max(home, m, x[1]);
-  }
-};
-namespace {
-  MaxNaryShared _maxsnary("Arithmetic::Max::Nary::Shared",s4);
-}
-
-// STATISTICS: test-int

data/ext/gecode-1.3.1/test/int/basic.cc

@@ -1,42 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2005
- *
- *  Last modified:
- *     $Date: 2006-08-04 16:07:12 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
- *     $Revision: 3518 $
- *
- *  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 "test/int.hh"
-#include "test/log.hh"
-
-#include <cmath>
-#include <algorithm>
-
-static IntSet s(-3,3);
-
-class Basic : public IntTest {
-public:
-  Basic(void)
-    : IntTest("Basic",3,s) {}
-  virtual bool solution(const Assignment& x) const {
-    return true;
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-  }
-};
-static Basic _basic;
-
-// STATISTICS: test-int

data/ext/gecode-1.3.1/test/int/bool.cc

@@ -1,189 +0,0 @@
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2005
- *
- *  Last modified:
- *     $Date: 2006-08-04 16:07:12 +0200 (Fri, 04 Aug 2006) $ by $Author: schulte $
- *     $Revision: 3518 $
- *
- *  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 "test/int.hh"
-
-static IntSet ds(0,1);
-
-class BoolEq : public IntTest {
-public:
-  BoolEq(const char* t)
-    : IntTest(t,2,ds) {}
-  virtual bool solution(const Assignment& x) const {
-    return x[0]==x[1];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    for (int i=x.size(); i--; )
-      Gecode::dom(home, x[i], 0, 1);
-    BoolVar b0(x[0]); BoolVar b1(x[1]);
-    bool_eq(home, b0, b1);
-  }
-};
-BoolEq _booleq("Bool::Eq");
-
-class BoolNot : public IntTest {
-public:
-  BoolNot(const char* t)
-    : IntTest(t,2,ds) {}
-  virtual bool solution(const Assignment& x) const {
-    return x[0]!=x[1];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    for (int i=x.size(); i--; )
-      Gecode::dom(home, x[i], 0, 1);
-    BoolVar b0(x[0]); BoolVar b1(x[1]);
-    bool_not(home, b0, b1);
-  }
-};
-BoolNot _boolnot("Bool::Not");
-
-class BoolAnd : public IntTest {
-public:
-  BoolAnd(const char* t)
-    : IntTest(t,3,ds) {}
-  virtual bool solution(const Assignment& x) const {
-    return (x[0]&x[1])==x[2];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    for (int i=x.size(); i--; )
-      Gecode::dom(home, x[i], 0, 1);
-    BoolVar b0(x[0]); BoolVar b1(x[1]); BoolVar b2(x[2]);
-    bool_and(home, b0, b1, b2);
-  }
-};
-BoolAnd _booland("Bool::And::Binary");
-
-class BoolOr : public IntTest {
-public:
-  BoolOr(const char* t)
-    : IntTest(t,3,ds) {}
-  virtual bool solution(const Assignment& x) const {
-    return (x[0]|x[1])==x[2];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    for (int i=x.size(); i--; )
-      Gecode::dom(home, x[i], 0, 1);
-    BoolVar b0(x[0]); BoolVar b1(x[1]); BoolVar b2(x[2]);
-    bool_or(home, b0, b1, b2);
-  }
-};
-BoolOr _boolor("Bool::Or::Binary");
-
-class BoolImp : public IntTest {
-public:
-  BoolImp(const char* t)
-    : IntTest(t,3,ds) {}
-  virtual bool solution(const Assignment& x) const {
-    return ((x[0] == 0 ? 1 : 0)|x[1])==x[2];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    for (int i=x.size(); i--; )
-      Gecode::dom(home, x[i], 0, 1);
-    BoolVar b0(x[0]); BoolVar b1(x[1]); BoolVar b2(x[2]);
-    bool_imp(home, b0, b1, b2);
-  }
-};
-BoolImp _boolimp("Bool::Imp");
-
-class BoolEqv : public IntTest {
-public:
-  BoolEqv(const char* t)
-    : IntTest(t,3,ds) {}
-  virtual bool solution(const Assignment& x) const {
-    return (x[0] == x[1])==x[2];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    for (int i=x.size(); i--; )
-      Gecode::dom(home, x[i], 0, 1);
-    BoolVar b0(x[0]); BoolVar b1(x[1]); BoolVar b2(x[2]);
-    bool_eqv(home, b0, b1, b2);
-  }
-};
-BoolEqv _booleqv("Bool::Eqv");
-
-class BoolXor : public IntTest {
-public:
-  BoolXor(const char* t)
-    : IntTest(t,3,ds) {}
-  virtual bool solution(const Assignment& x) const {
-    return (x[0] != x[1])==x[2];
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    for (int i=x.size(); i--; )
-      Gecode::dom(home, x[i], 0, 1);
-    BoolVar b0(x[0]); BoolVar b1(x[1]); BoolVar b2(x[2]);
-    bool_xor(home, b0, b1, b2);
-  }
-};
-BoolXor _boolxor("Bool::Xor");
-
-
-class BoolAndNary : public IntTest {
-public:
-  BoolAndNary(const char* t)
-    : IntTest(t,14,ds) {}
-  virtual bool solution(const Assignment& x) const {
-    for (int i = x.size()-1; i--; )
-      if (x[i] == 0)
-	return x[x.size()-1] == 0;
-    return x[x.size()-1] == 1;
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    for (int i=x.size(); i--; )
-      Gecode::dom(home, x[i], 0, 1);
-    BoolVarArgs b(2*(x.size()-1));
-    for (int i=x.size()-1; i--; ) {
-      BoolVar bx(x[i]);
-      b[2*i+0] = bx; b[2*i+1] = bx;
-    }
-    BoolVar bx(x[x.size()-1]);
-    bool_and(home, b, bx);
-  }
-};
-BoolAndNary _boolandnary("Bool::And::Nary");
-
-class BoolOrNary : public IntTest {
-public:
-  BoolOrNary(const char* t)
-    : IntTest(t,14,ds) {}
-  virtual bool solution(const Assignment& x) const {
-    for (int i = x.size()-1; i--; )
-      if (x[i] == 1)
-	return x[x.size()-1] == 1;
-    return x[x.size()-1] == 0;
-  }
-  virtual void post(Space* home, IntVarArray& x) {
-    for (int i=x.size(); i--; )
-      Gecode::dom(home, x[i], 0, 1);
-    BoolVarArgs b(2*(x.size()-1));
-    for (int i=x.size()-1; i--; ) {
-      BoolVar bx(x[i]);
-      b[2*i+0] = bx; b[2*i+1] = bx;
-    }
-    BoolVar bx(x[x.size()-1]);
-    bool_or(home, b, bx);
-  }
-};
-BoolOrNary _boolornary("Bool::Or::Nary");
-
-
-// STATISTICS: test-int
-