40 namespace Test {
namespace Int {
60 dsv(new Gecode::IntSetValues[static_cast<unsigned int>(n)]) {
70 assert((i>=0) && (i<
n));
83 if (it.width() > skip)
84 return it.min() +
static_cast<int>(skip);
104 assert((i>=0) && (i<
n));
116 if (it.width() > skip)
117 return it.min() +
static_cast<int>(skip);
128 :
Assignment(n0+n1,d0),vals(new int[n0+n1]),
a(a0),_n1(n1),_d1(d1) {
129 for (
int i=n0;
i--; )
131 for (
int i=n1;
i--; )
142 assert((i>=0) && (i<
n));
172 reified(r), rms((1 << Gecode::
RM_EQV) ||
176 testsearch(true), testfix(true) {}
182 :
Base(
"Int::"+s), arity(a),
dom(d),
183 reified(r), rms((1 << Gecode::
RM_EQV) ||
187 testsearch(true), testfix(true) {}
193 :
Base(p+s), arity(a),
dom(min,max),
194 reified(r), rms((1 << Gecode::
RM_EQV) ||
198 testsearch(true), testfix(true) {}
203 :
Base(
"Int::"+s), arity(a),
dom(min,max),
204 reified(r), rms((1 << Gecode::
RM_EQV) ||
208 testsearch(true), testfix(true) {}
213 using namespace Gecode;
217 default:
return "Def";
224 using namespace Gecode;
229 default:
return "Def";
236 using namespace Gecode;
252 using namespace Gecode;
277 for (
int i=0;
i<x.
size()-1;
i++)
278 s +=
str(x[
i]) +
",";
279 return "[" + s +
str(x[x.
size()-1]) +
"]";
285 using namespace Gecode;
287 case IRT_EQ:
return x == y;
288 case IRT_NQ:
return x != y;
289 case IRT_LQ:
return x <= y;
290 case IRT_LE:
return x < y;
291 case IRT_GR:
return x > y;
292 case IRT_GQ:
return x >= y;