mm-arithmetic.cpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2008
*
* 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 {
namespace MiniModelArithmetic {
class Mult : public Test {
public:
Mult(const std::string& s, const Gecode::IntSet& d)
: Test("MiniModel::Mult::"+s,3,d) {
testfix = false;
}
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(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
rel(home, expr(home, x[0] * x[1]), IRT_EQ, x[2], IPL_DOM);
}
};
class Div : public Test {
public:
Div(const std::string& s, const Gecode::IntSet& d)
: Test("MiniModel::Div::"+s,3,d) {
testfix = false;
}
virtual bool solution(const Assignment& x) const {
return (x[1] != 0) && (x[0] / x[1] == x[2]);
}
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
rel(home, expr(home, x[0] / x[1]), IRT_EQ, x[2], IPL_DOM);
}
};
class Mod : public Test {
public:
Mod(const std::string& s, const Gecode::IntSet& d)
: Test("MiniModel::Mod::"+s,3,d) {
testfix = false;
}
virtual bool solution(const Assignment& x) const {
return (x[1] != 0) && (x[0] % x[1] == x[2]);
}
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
rel(home, expr(home, x[0] % x[1]), IRT_EQ, x[2], IPL_DOM);
}
};
class Plus : public Test {
public:
Plus(const std::string& s, const Gecode::IntSet& d)
: Test("MiniModel::Plus::"+s,3,d) {
testfix = false;
}
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 >= Gecode::Int::Limits::min) &&
(d0+d1 <= Gecode::Int::Limits::max) &&
(d0+d1 == d2));
}
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
rel(home, expr(home, x[0] + x[1]), IRT_EQ, x[2], IPL_DOM);
}
};
class Minus : public Test {
public:
Minus(const std::string& s, const Gecode::IntSet& d)
: Test("MiniModel::Minus::"+s,3,d) {
testfix = false;
}
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 >= Gecode::Int::Limits::min) &&
(d0-d1 <= Gecode::Int::Limits::max) &&
(d0-d1 == d2));
}
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
rel(home, expr(home, x[0] - x[1]), IRT_EQ, x[2], IPL_DOM);
}
};
class Sqr : public Test {
public:
Sqr(const std::string& s, const Gecode::IntSet& d)
: Test("MiniModel::Sqr::"+s,2,d) {
testfix = false;
}
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(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
rel(home, expr(home, sqr(x[0])), IRT_EQ, x[1], IPL_DOM);
}
};
class Sqrt : public Test {
public:
Sqrt(const std::string& s, const Gecode::IntSet& d)
: Test("MiniModel::Sqrt::"+s,2,d) {
testfix = false;
}
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 >= d1*d1) && (d0 < (d1+1)*(d1+1));
}
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
rel(home, expr(home, sqrt(x[0])), IRT_EQ, x[1], IPL_DOM);
}
};
class Abs : public Test {
public:
Abs(const std::string& s, const Gecode::IntSet& d, Gecode::IntPropLevel ipl)
: Test("MiniModel::Abs::"+str(ipl)+"::"+s,
2,d,false,ipl) {
testfix = false;
}
virtual bool solution(const Assignment& x) const {
double d0 = static_cast<double>(x[0]);
double d1 = static_cast<double>(x[1]);
return (d0<0.0 ? -d0 : d0) == d1;
}
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
rel(home, expr(home, abs(x[0]), ipl), IRT_EQ, x[1], IPL_DOM);
}
};
class Min : public Test {
public:
Min(const std::string& s, const Gecode::IntSet& d)
: Test("MiniModel::Min::Bin::"+s,3,d) {
testfix = false;
}
virtual bool solution(const Assignment& x) const {
return std::min(x[0],x[1]) == x[2];
}
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
rel(home, expr(home, min(x[0], x[1])), IRT_EQ, x[2], IPL_DOM);
}
};
class Max : public Test {
public:
Max(const std::string& s, const Gecode::IntSet& d)
: Test("MiniModel::Max::Bin::"+s,3,d) {
testfix = false;
}
virtual bool solution(const Assignment& x) const {
return std::max(x[0],x[1]) == x[2];
}
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
rel(home, expr(home, max(x[0], x[1])), IRT_EQ, x[2], IPL_DOM);
}
};
class MinNary : public Test {
public:
MinNary(void) : Test("MiniModel::Min::Nary",4,-4,4) {
testfix = false;
}
virtual bool solution(const Assignment& x) const {
return std::min(std::min(x[0],x[1]), x[2]) == x[3];
}
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
IntVarArgs m(3);
m[0]=x[0]; m[1]=x[1]; m[2]=x[2];
rel(home, expr(home, min(m)), IRT_EQ, x[3], IPL_DOM);
}
};
class MaxNary : public Test {
public:
MaxNary(void) : Test("MiniModel::Max::Nary",4,-4,4) {
testfix = false;
}
virtual bool solution(const Assignment& x) const {
return std::max(std::max(x[0],x[1]), x[2]) == x[3];
}
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
IntVarArgs m(3);
m[0]=x[0]; m[1]=x[1]; m[2]=x[2];
rel(home, expr(home, max(m)), IRT_EQ, x[3], IPL_DOM);
}
};
const int v1[7] = {
Gecode::Int::Limits::min, Gecode::Int::Limits::min+1,
-1,0,1,
Gecode::Int::Limits::max-1, Gecode::Int::Limits::max
};
const int v2[9] = {
static_cast<int>(-sqrt(static_cast<double>(-Gecode::Int::Limits::min))),
-4,-2,-1,0,1,2,4,
static_cast<int>(sqrt(static_cast<double>(Gecode::Int::Limits::max)))
};
Gecode::IntSet d1(v1,7);
Gecode::IntSet d2(v2,9);
Gecode::IntSet d3(-8,8);
Mult mult_max("A",d1);
Mult mult_med("B",d2);
Mult mult_min("C",d3);
Div div_max("A",d1);
Div div_med("B",d2);
Div div_min("C",d3);
Mod mod_max("A",d1);
Mod mod_med("B",d2);
Mod mod_min("C",d3);
Plus plus_max("A",d1);
Plus plus_med("B",d2);
Plus plus_min("C",d3);
Minus minus_max("A",d1);
Minus minus_med("B",d2);
Minus minus_min("C",d3);
Sqr sqr_max("A",d1);
Sqr sqr_med("B",d2);
Sqr sqr_min("C",d3);
Sqrt sqrt_max("A",d1);
Sqrt sqrt_med("B",d2);
Sqrt sqrt_min("C",d3);
Abs abs_bnd_max("A",d1,Gecode::IPL_BND);
Abs abs_bnd_med("B",d2,Gecode::IPL_BND);
Abs abs_bnd_min("C",d3,Gecode::IPL_BND);
Abs abs_dom_max("A",d1,Gecode::IPL_DOM);
Abs abs_dom_med("B",d2,Gecode::IPL_DOM);
Abs abs_dom_min("C",d3,Gecode::IPL_DOM);
Min min_max("A",d1);
Min min_med("B",d2);
Min min_min("C",d3);
Max max_max("A",d1);
Max max_med("B",d2);
Max max_min("C",d3);
MinNary min_nary;
MaxNary max_nary;
}
}}
// STATISTICS: test-minimodel
Gecode::IntSet
Integer sets.
Definition int.hh:174
Gecode::IntVarArgs
Passing integer variables.
Definition int.hh:656
Gecode::IntVarArray
Integer variable array.
Definition int.hh:763
Gecode::Space
Computation spaces.
Definition core.hpp:1742
Test::Int::Assignment
Base class for assignments
Definition int.hh:59
Test::Int::MiniModelArithmetic::Abs
Test for absolute value constraint
Definition mm-arithmetic.cpp:199
Test::Int::MiniModelArithmetic::Abs::Abs
Abs(const std::string &s, const Gecode::IntSet &d, Gecode::IntPropLevel ipl)
Create and register test.
Definition mm-arithmetic.cpp:202
Test::Int::MiniModelArithmetic::Abs::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:214
Test::Int::MiniModelArithmetic::Abs::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:208
Test::Int::MiniModelArithmetic::Div
Test for division constraint
Definition mm-arithmetic.cpp:71
Test::Int::MiniModelArithmetic::Div::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:83
Test::Int::MiniModelArithmetic::Div::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:79
Test::Int::MiniModelArithmetic::Div::Div
Div(const std::string &s, const Gecode::IntSet &d)
Create and register test.
Definition mm-arithmetic.cpp:74
Test::Int::MiniModelArithmetic::MaxNary
Test for n-ary maximum constraint
Definition mm-arithmetic.cpp:279
Test::Int::MiniModelArithmetic::MaxNary::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:290
Test::Int::MiniModelArithmetic::MaxNary::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:286
Test::Int::MiniModelArithmetic::MaxNary::MaxNary
MaxNary(void)
Create and register test.
Definition mm-arithmetic.cpp:282
Test::Int::MiniModelArithmetic::Max
Test for binary maximum constraint
Definition mm-arithmetic.cpp:240
Test::Int::MiniModelArithmetic::Max::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:248
Test::Int::MiniModelArithmetic::Max::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:252
Test::Int::MiniModelArithmetic::Max::Max
Max(const std::string &s, const Gecode::IntSet &d)
Create and register test.
Definition mm-arithmetic.cpp:243
Test::Int::MiniModelArithmetic::MinNary
Test for n-ary minimmum constraint
Definition mm-arithmetic.cpp:259
Test::Int::MiniModelArithmetic::MinNary::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:266
Test::Int::MiniModelArithmetic::MinNary::MinNary
MinNary(void)
Create and register test.
Definition mm-arithmetic.cpp:262
Test::Int::MiniModelArithmetic::MinNary::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:270
Test::Int::MiniModelArithmetic::Min
Test for binary minimum constraint
Definition mm-arithmetic.cpp:221
Test::Int::MiniModelArithmetic::Min::Min
Min(const std::string &s, const Gecode::IntSet &d)
Create and register test.
Definition mm-arithmetic.cpp:224
Test::Int::MiniModelArithmetic::Min::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:229
Test::Int::MiniModelArithmetic::Min::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:233
Test::Int::MiniModelArithmetic::Minus
Test for subtraction constraint
Definition mm-arithmetic.cpp:133
Test::Int::MiniModelArithmetic::Minus::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:141
Test::Int::MiniModelArithmetic::Minus::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:150
Test::Int::MiniModelArithmetic::Minus::Minus
Minus(const std::string &s, const Gecode::IntSet &d)
Create and register test.
Definition mm-arithmetic.cpp:136
Test::Int::MiniModelArithmetic::Mod
Test for division constraint
Definition mm-arithmetic.cpp:90
Test::Int::MiniModelArithmetic::Mod::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:102
Test::Int::MiniModelArithmetic::Mod::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:98
Test::Int::MiniModelArithmetic::Mod::Mod
Mod(const std::string &s, const Gecode::IntSet &d)
Create and register test.
Definition mm-arithmetic.cpp:93
Test::Int::MiniModelArithmetic::Mult
Test for multiplication constraint
Definition mm-arithmetic.cpp:49
Test::Int::MiniModelArithmetic::Mult::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:64
Test::Int::MiniModelArithmetic::Mult::Mult
Mult(const std::string &s, const Gecode::IntSet &d)
Create and register test.
Definition mm-arithmetic.cpp:52
Test::Int::MiniModelArithmetic::Mult::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:57
Test::Int::MiniModelArithmetic::Plus
Test for addition constraint
Definition mm-arithmetic.cpp:109
Test::Int::MiniModelArithmetic::Plus::Plus
Plus(const std::string &s, const Gecode::IntSet &d)
Create and register test.
Definition mm-arithmetic.cpp:112
Test::Int::MiniModelArithmetic::Plus::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:117
Test::Int::MiniModelArithmetic::Plus::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:126
Test::Int::MiniModelArithmetic::Sqr
Test for sqr constraint
Definition mm-arithmetic.cpp:157
Test::Int::MiniModelArithmetic::Sqr::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:171
Test::Int::MiniModelArithmetic::Sqr::Sqr
Sqr(const std::string &s, const Gecode::IntSet &d)
Create and register test.
Definition mm-arithmetic.cpp:160
Test::Int::MiniModelArithmetic::Sqr::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:165
Test::Int::MiniModelArithmetic::Sqrt
Test for sqrt constraint
Definition mm-arithmetic.cpp:178
Test::Int::MiniModelArithmetic::Sqrt::Sqrt
Sqrt(const std::string &s, const Gecode::IntSet &d)
Create and register test.
Definition mm-arithmetic.cpp:181
Test::Int::MiniModelArithmetic::Sqrt::solution
virtual bool solution(const Assignment &x) const
Test whether x is solution
Definition mm-arithmetic.cpp:186
Test::Int::MiniModelArithmetic::Sqrt::post
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
Definition mm-arithmetic.cpp:192
Test::Int::Test::testfix
bool testfix
Whether to perform fixpoint test.
Definition int.hh:240
Test::Int::Test::ipl
Gecode::IntPropLevel ipl
Propagation level.
Definition int.hh:234
Test::Int::Test::str
static std::string str(Gecode::IntPropLevel ipl)
Map integer propagation level to string.
Definition int.hpp:209
Gecode::rel
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVar x1)
Post propagator for .
Definition rel.cpp:68
Gecode::IntPropLevel
IntPropLevel
Propagation levels for integer propagators.
Definition int.hh:974
Gecode::IRT_EQ
@ IRT_EQ
Equality ( ).
Definition int.hh:926
Gecode::IPL_DOM
@ IPL_DOM
Domain propagation Options: basic versus advanced propagation.
Definition int.hh:979
Gecode::IPL_BND
@ IPL_BND
Bounds propagation.
Definition int.hh:978
minimodel.hh
Gecode::Int::Limits::min
const int min
Smallest allowed integer value.
Definition int.hh:118
Gecode::Int::Limits::max
const int max
Largest allowed integer value.
Definition int.hh:116
Gecode
Gecode toplevel namespace
Gecode::sqr
void sqr(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
Definition arithmetic.cpp:95
Gecode::expr
IntVar expr(Home home, const LinIntExpr &e, const IntPropLevels &ipls=IntPropLevels::def)
Post linear expression and return its value.
Definition int-expr.cpp:915
Gecode::min
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:67
Gecode::abs
void abs(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
Definition arithmetic.cpp:41
Gecode::sqrt
void sqrt(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
Definition arithmetic.cpp:102
Gecode::max
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:49
Test::Int::MiniModelArithmetic
Tests for minimal modelling constraints (arithmetic)
Definition mm-arithmetic.cpp:41
Test::Int::MiniModelArithmetic::sqrt_min
Sqrt sqrt_min("C", d3)
Test::Int::MiniModelArithmetic::abs_dom_min
Abs abs_dom_min("C", d3, Gecode::IPL_DOM)
Test::Int::MiniModelArithmetic::mult_max
Mult mult_max("A", d1)
Test::Int::MiniModelArithmetic::abs_bnd_max
Abs abs_bnd_max("A", d1, Gecode::IPL_BND)
Test::Int::MiniModelArithmetic::abs_dom_med
Abs abs_dom_med("B", d2, Gecode::IPL_DOM)
Test::Int::MiniModelArithmetic::min_max
Min min_max("A", d1)
Test::Int::MiniModelArithmetic::plus_max
Plus plus_max("A", d1)
Test::Int::MiniModelArithmetic::max_min
Max max_min("C", d3)
Test::Int::MiniModelArithmetic::abs_bnd_med
Abs abs_bnd_med("B", d2, Gecode::IPL_BND)
Test::Int::MiniModelArithmetic::minus_max
Minus minus_max("A", d1)
Test::Int::MiniModelArithmetic::abs_bnd_min
Abs abs_bnd_min("C", d3, Gecode::IPL_BND)
Test::Int::MiniModelArithmetic::d2
Gecode::IntSet d2(v2, 9)
Test::Int::MiniModelArithmetic::v1
const int v1[7]
Definition mm-arithmetic.cpp:298
Test::Int::MiniModelArithmetic::max_nary
MaxNary max_nary
Definition mm-arithmetic.cpp:357
Test::Int::MiniModelArithmetic::min_nary
MinNary min_nary
Definition mm-arithmetic.cpp:356
Test::Int::MiniModelArithmetic::div_min
Div div_min("C", d3)
Test::Int::MiniModelArithmetic::min_med
Min min_med("B", d2)
Test::Int::MiniModelArithmetic::mod_med
Mod mod_med("B", d2)
Test::Int::MiniModelArithmetic::mod_min
Mod mod_min("C", d3)
Test::Int::MiniModelArithmetic::min_min
Min min_min("C", d3)
Test::Int::MiniModelArithmetic::sqrt_med
Sqrt sqrt_med("B", d2)
Test::Int::MiniModelArithmetic::div_med
Div div_med("B", d2)
Test::Int::MiniModelArithmetic::v2
const int v2[9]
Definition mm-arithmetic.cpp:303
Test::Int::MiniModelArithmetic::sqr_med
Sqr sqr_med("B", d2)
Test::Int::MiniModelArithmetic::div_max
Div div_max("A", d1)
Test::Int::MiniModelArithmetic::plus_min
Plus plus_min("C", d3)
Test::Int::MiniModelArithmetic::sqrt_max
Sqrt sqrt_max("A", d1)
Test::Int::MiniModelArithmetic::mult_med
Mult mult_med("B", d2)
Test::Int::MiniModelArithmetic::mult_min
Mult mult_min("C", d3)
Test::Int::MiniModelArithmetic::minus_med
Minus minus_med("B", d2)
Test::Int::MiniModelArithmetic::plus_med
Plus plus_med("B", d2)
Test::Int::MiniModelArithmetic::mod_max
Mod mod_max("A", d1)
Test::Int::MiniModelArithmetic::max_med
Max max_med("B", d2)
Test::Int::MiniModelArithmetic::sqr_min
Sqr sqr_min("C", d3)
Test::Int::MiniModelArithmetic::minus_min
Minus minus_min("C", d3)
Test::Int::MiniModelArithmetic::d1
Gecode::IntSet d1(v1, 7)
Test::Int::MiniModelArithmetic::sqr_max
Sqr sqr_max("A", d1)
Test::Int::MiniModelArithmetic::abs_dom_max
Abs abs_dom_max("A", d1, Gecode::IPL_DOM)
Test::Int::MiniModelArithmetic::d3
Gecode::IntSet d3(-8, 8)
Test::Int::MiniModelArithmetic::max_max
Max max_max("A", d1)
Test::Int
Testing finite domain integers.
Definition int.cpp:40
Test
General test support.
Definition afc.cpp:39
int.hh