1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2005
*
* 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>
#include <climits>
namespace Test { namespace Int {
/// %Tests for element constraints
namespace Element {
/**
* \defgroup TaskTestIntElement Element constraints
* \ingroup TaskTestInt
*/
//@{
/// %Test for element with integer array and integer variables
class IntIntVar : public Test {
protected:
/// Array of integers
Gecode::IntArgs c;
public:
/// Create and register test
IntIntVar(const std::string& s, const Gecode::IntArgs& c0,
int min, int max)
: Test("Element::Int::Int::Var::"+s,2,min,max),
c(c0) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
return (x[0]>= 0) && (x[0]<c.size()) && c[x[0]]==x[1];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
Gecode::element(home, c, x[0], x[1]);
}
};
/// %Test for element with integer array and integer variables
class IntIntInt : public Test {
protected:
/// Array of integers
Gecode::IntArgs c;
/// Integer result
int r;
public:
/// Create and register test
IntIntInt(const std::string& s, const Gecode::IntArgs& c0, int r0)
: Test("Element::Int::Int::Int::"+s+"::"+str(r0),1,-4,8),
c(c0), r(r0) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
return (x[0]>= 0) && (x[0]<c.size()) && c[x[0]]==r;
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
Gecode::element(home, c, x[0], r);
}
};
/// %Test for element with integer array and single shared integer variable
class IntIntShared : public Test {
protected:
/// Array of integers
Gecode::IntArgs c;
public:
/// Create and register test
IntIntShared(const std::string& s, const Gecode::IntArgs& c0,
int minDomain=-4)
: Test("Element::Int::Int::Shared::"+s,1,minDomain,8), c(c0) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
return (x[0]>= 0) && (x[0]<c.size()) && c[x[0]]==x[0];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
Gecode::element(home, c, x[0], x[0]);
}
};
/// %Test for element with integer array and integer and Boolean variable
class IntBoolVar : public Test {
protected:
/// Array of integers
Gecode::IntArgs c;
public:
/// Create and register test
IntBoolVar(const std::string& s, const Gecode::IntArgs& c0)
: Test("Element::Int::Bool::Var::"+s,2,-4,8), c(c0) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
return (x[0]>= 0) && (x[0]<c.size()) && c[x[0]]==x[1];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
Gecode::element(home, c, x[0], Gecode::channel(home,x[1]));
}
};
/// %Test for element with integer array and integer and Boolean variable
class IntBoolInt : public Test {
protected:
/// Array of integers
Gecode::IntArgs c;
/// Integer result
int r;
public:
/// Create and register test
IntBoolInt(const std::string& s, const Gecode::IntArgs& c0, int r0)
: Test("Element::Int::Bool::Int::"+s+"::"+str(r0),1,-4,8),
c(c0), r(r0) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
return (x[0]>= 0) && (x[0]<c.size()) && c[x[0]]==r;
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
Gecode::element(home, c, x[0], r);
}
};
/// %Test for element with variable array and integer variables
class VarIntVar : public Test {
public:
/// Create and register test
VarIntVar(Gecode::IntPropLevel ipl)
: Test("Element::Var::Int::Var::"+str(ipl),6,-1,3,false,ipl) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
return (x[0]>= 0) && (x[0]<x.size()-2) && x[2+x[0]]==x[1];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
Gecode::IntVarArgs c(x.size()-2);
for (int i=0; i<x.size()-2; i++)
c[i]=x[2+i];
Gecode::element(home, c, x[0], x[1], ipl);
}
};
/// %Test for element with variable array and integer variables
class VarIntInt : public Test {
protected:
/// Integer result
int r;
public:
/// Create and register test
VarIntInt(Gecode::IntPropLevel ipl, int r0)
: Test("Element::Var::Int::Int::"+str(ipl)+"::"+str(r0),
5,-1,3,false,ipl), r(r0) {
contest = CTL_NONE;
}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
return (x[0]>= 0) && (x[0]<x.size()-1) && x[1+x[0]]==r;
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
Gecode::IntVarArgs c(x.size()-1);
for (int i=0; i<x.size()-1; i++)
c[i]=x[1+i];
Gecode::element(home, c, x[0], r, ipl);
}
};
/// %Test for element with variable array and shared integer variable
class VarIntShared : public Test {
public:
/// Create and register test
VarIntShared(Gecode::IntPropLevel ipl)
: Test("Element::Var::Int::Shared::"+str(ipl),5,-1,3,false,ipl) {
contest = CTL_NONE;
}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
return (x[0]>= 0) && (x[0]<x.size()-1) && x[1+x[0]]==x[0];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
Gecode::IntVarArgs c(x.size()-1);
for (int i=0; i<x.size()-1; i++)
c[i]=x[1+i];
Gecode::element(home, c, x[0], x[0], ipl);
}
};
/// %Test for element with Boolean variable array and integer variable
class VarBoolVar : public Test {
public:
/// Create and register test
VarBoolVar(void) : Test("Element::Var::Bool::Var",6,-1,3,false) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
for (int i=0; i<x.size()-2; i++)
if ((x[2+i] < 0) || (x[2+i]>1))
return false;
return ((x[0]>= 0) && (x[0]<x.size()-2) && x[2+x[0]]==x[1]
&& (x[1]>=0) && (x[1]<=1));
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
BoolVarArgs c(x.size()-2);
for (int i=0; i<x.size()-2; i++)
c[i]=channel(home,x[2+i]);
element(home, c, x[0], channel(home,x[1]));
}
};
/// %Test for element with Boolean variable array and integer variable
class VarBoolInt : public Test {
protected:
/// Integer result
int r;
public:
/// Create and register test
VarBoolInt(int r0)
: Test("Element::Var::Bool::Int::"+str(r0),5,-1,3,false), r(r0) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
for (int i=0; i<x.size()-1; i++)
if ((x[1+i] < 0) || (x[1+i]>1))
return false;
return ((x[0]>= 0) && (x[0]<x.size()-1) && x[1+x[0]]==r);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
using namespace Gecode;
BoolVarArgs c(x.size()-1);
for (int i=0; i<x.size()-1; i++)
c[i]=channel(home,x[1+i]);
if (r == 1) {
switch (_rand(3)) {
case 0:
element(home, c, x[0], 1);
break;
case 1:
{
BoolVar one(home,1,1);
rel(home, element(c,x[0]) == one);
}
break;
case 2:
rel(home, element(c,x[0]));
break;
default: GECODE_NEVER;
}
} else {
element(home, c, x[0], r);
}
}
};
/// %Test for matrix element with integer array and integer variable
class MatrixIntIntVarXY : public Test {
protected:
/// Array for test matrix
Gecode::IntArgs tm;
public:
/// Create and register test
MatrixIntIntVarXY(void)
: Test("Element::Matrix::Int::IntVar::XY",3,0,5,false),
tm({0,1,2,3,4,5}) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
// x-coordinate: x[0], y-coordinate: x[1], result: x[2]
using namespace Gecode;
if ((x[0] > 2) || (x[1] > 1))
return false;
Matrix<IntArgs> m(tm,3,2);
return m(x[0],x[1]) == x[2];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
// x-coordinate: x[0], y-coordinate: x[1], result: x[2]
using namespace Gecode;
Matrix<IntArgs> m(tm,3,2);
element(home, m, x[0], x[1], x[2]);
}
};
/// %Test for matrix element with integer array and integer variable
class MatrixIntIntVarXX : public Test {
protected:
/// Array for test matrix
Gecode::IntArgs tm;
public:
/// Create and register test
MatrixIntIntVarXX(void)
: Test("Element::Matrix::Int::IntVar::XX",2,0,3,false),
tm({0,1,2,3}) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
// x-coordinate: x[0], y-coordinate: x[0], result: x[1]
using namespace Gecode;
if (x[0] > 1)
return false;
Matrix<IntArgs> m(tm,2,2);
return m(x[0],x[0]) == x[1];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
// x-coordinate: x[0], y-coordinate: x[0], result: x[1]
using namespace Gecode;
Matrix<IntArgs> m(tm,2,2);
element(home, m, x[0], x[0], x[1]);
}
};
/// %Test for matrix element with integer array and Boolean variable
class MatrixIntBoolVarXY : public Test {
protected:
/// Array for test matrix
Gecode::IntArgs tm;
public:
/// Create and register test
MatrixIntBoolVarXY(void)
: Test("Element::Matrix::Int::BoolVar::XY",3,0,3,false),
tm({0,1,1,0}) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
// x-coordinate: x[0], y-coordinate: x[1], result: x[2]
using namespace Gecode;
if ((x[0] > 1) || (x[1] > 1))
return false;
Matrix<IntArgs> m(tm,2,2);
return m(x[0],x[1]) == x[2];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
// x-coordinate: x[0], y-coordinate: x[1], result: x[2]
using namespace Gecode;
Matrix<IntArgs> m(tm,2,2);
element(home, m, x[0], x[1], channel(home,x[2]));
}
};
/// %Test for matrix element with integer array and Boolean variable
class MatrixIntBoolVarXX : public Test {
protected:
/// Array for test matrix
Gecode::IntArgs tm;
public:
/// Create and register test
MatrixIntBoolVarXX(void)
: Test("Element::Matrix::Int::BoolVar::XX",2,0,3,false),
tm({0,1,1,0}) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
// x-coordinate: x[0], y-coordinate: x[0], result: x[1]
using namespace Gecode;
if (x[0] > 1)
return false;
Matrix<IntArgs> m(tm,2,2);
return m(x[0],x[0]) == x[1];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
// x-coordinate: x[0], y-coordinate: x[0], result: x[1]
using namespace Gecode;
Matrix<IntArgs> m(tm,2,2);
element(home, m, x[0], x[0], channel(home,x[1]));
}
};
/// %Test for matrix element with integer variable array and integer variable
class MatrixIntVarIntVarXY : public Test {
public:
/// Create and register test
MatrixIntVarIntVarXY(void)
: Test("Element::Matrix::IntVar::IntVar::XY",3+4,0,3,false) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
// x-coordinate: x[0], y-coordinate: x[1], result: x[2]
// remaining: matrix
using namespace Gecode;
if ((x[0] > 1) || (x[1] > 1))
return false;
IntArgs tm(4);
tm[0]=x[3]; tm[1]=x[4]; tm[2]=x[5]; tm[3]=x[6];
Matrix<IntArgs> m(tm,2,2);
return m(x[0],x[1]) == x[2];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
// x-coordinate: x[0], y-coordinate: x[1], result: x[2]
using namespace Gecode;
IntVarArgs tm(4);
tm[0]=x[3]; tm[1]=x[4]; tm[2]=x[5]; tm[3]=x[6];
Matrix<IntVarArgs> m(tm,2,2);
element(home, m, x[0], x[1], x[2]);
}
};
/// %Test for matrix element with integer variable array and integer variable
class MatrixIntVarIntVarXX : public Test {
public:
/// Create and register test
MatrixIntVarIntVarXX(void)
: Test("Element::Matrix::IntVar::IntVar::XX",2+4,0,3,false) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
// x-coordinate: x[0], y-coordinate: x[0], result: x[1]
// remaining: matrix
using namespace Gecode;
if (x[0] > 1)
return false;
IntArgs tm(4);
tm[0]=x[2]; tm[1]=x[3]; tm[2]=x[4]; tm[3]=x[5];
Matrix<IntArgs> m(tm,2,2);
return m(x[0],x[0]) == x[1];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
// x-coordinate: x[0], y-coordinate: x[1], result: x[1]
using namespace Gecode;
IntVarArgs tm(4);
tm[0]=x[2]; tm[1]=x[3]; tm[2]=x[4]; tm[3]=x[5];
Matrix<IntVarArgs> m(tm,2,2);
element(home, m, x[0], x[0], x[1]);
}
};
/// %Test for matrix element with Boolean variable array and Boolean variable
class MatrixBoolVarBoolVarXY : public Test {
public:
/// Create and register test
MatrixBoolVarBoolVarXY(void)
: Test("Element::Matrix::BoolVar::BoolVar::XY",3+4,0,1,false) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
// x-coordinate: x[0], y-coordinate: x[1], result: x[2]
// remaining: matrix
using namespace Gecode;
IntArgs tm(4);
tm[0]=x[3]; tm[1]=x[4]; tm[2]=x[5]; tm[3]=x[6];
Matrix<IntArgs> m(tm,2,2);
return m(x[0],x[1]) == x[2];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
// x-coordinate: x[0], y-coordinate: x[1], result: x[2]
using namespace Gecode;
BoolVarArgs tm(4);
tm[0]=channel(home,x[3]); tm[1]=channel(home,x[4]);
tm[2]=channel(home,x[5]); tm[3]=channel(home,x[6]);
Matrix<BoolVarArgs> m(tm,2,2);
element(home, m, x[0], x[1], channel(home,x[2]));
}
};
/// %Test for matrix element with Boolean variable array and Boolean variable
class MatrixBoolVarBoolVarXX : public Test {
public:
/// Create and register test
MatrixBoolVarBoolVarXX(void)
: Test("Element::Matrix::BoolVar::BoolVar::XX",2+4,0,1,false) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
// x-coordinate: x[0], y-coordinate: x[0], result: x[1]
// remaining: matrix
using namespace Gecode;
IntArgs tm(4);
tm[0]=x[2]; tm[1]=x[3]; tm[2]=x[4]; tm[3]=x[5];
Matrix<IntArgs> m(tm,2,2);
return m(x[0],x[0]) == x[1];
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
// x-coordinate: x[0], y-coordinate: x[1], result: x[1]
using namespace Gecode;
BoolVarArgs tm(4);
tm[0]=channel(home,x[2]); tm[1]=channel(home,x[3]);
tm[2]=channel(home,x[4]); tm[3]=channel(home,x[5]);
Matrix<BoolVarArgs> m(tm,2,2);
element(home, m, x[0], x[0], channel(home,x[1]));
}
};
/// Help class to create and register tests
class Create {
public:
/// %Test size-dependent optimizations
void optimized(int idx, int val) {
Gecode::IntArgs c(idx);
for (int i=0; i<idx; i++)
c[i]=std::max(val-i,0);
(void) new IntIntVar(Test::str(idx)+"::"+Test::str(val)+"::val",c,
val-8,val-1);
if (idx != val)
(void) new IntIntVar(Test::str(idx)+"::"+Test::str(val)+"::idx",c,
idx-8,idx-1);
}
/// Perform creation and registration
Create(void) {
using namespace Gecode;
IntArgs ic1({-1,1,-3,3,-4});
IntArgs ic2({-1,1,-1,1,-1,1,0,0});
IntArgs ic3({-1});
IntArgs ic4({0,-1,2,-2,4,-3,6});
IntArgs ic5({0,0,1,2,3,4});
IntArgs bc1({0,1,1,0,1});
IntArgs bc2({1,1,0,1,0,1,0,0});
IntArgs bc3({1});
(void) new IntIntVar("A",ic1,-8,8);
(void) new IntIntVar("B",ic2,-8,8);
(void) new IntIntVar("C",ic3,-8,8);
(void) new IntIntVar("D",ic4,-8,8);
// Test optimizations
{
int ov[] = {
SCHAR_MAX-1,SCHAR_MAX,
SHRT_MAX-1,SHRT_MAX,
0
};
for (int i=0; ov[i] != 0; i++)
for (int j=0; ov[j] != 0; j++)
optimized(ov[i],ov[j]);
}
for (int i=-4; i<=4; i++) {
(void) new IntIntInt("A",ic1,i);
(void) new IntIntInt("B",ic2,i);
(void) new IntIntInt("C",ic3,i);
(void) new IntIntInt("D",ic4,i);
}
(void) new IntIntShared("A",ic1);
(void) new IntIntShared("B",ic2);
(void) new IntIntShared("C",ic3);
(void) new IntIntShared("D",ic4);
(void) new IntIntShared("E",ic5,1);
(void) new IntBoolVar("A",bc1);
(void) new IntBoolVar("B",bc2);
(void) new IntBoolVar("C",bc3);
for (int i=0; i<=1; i++) {
(void) new IntBoolInt("A",bc1,i);
(void) new IntBoolInt("B",bc2,i);
(void) new IntBoolInt("C",bc3,i);
}
(void) new VarIntVar(IPL_BND);
(void) new VarIntVar(IPL_DOM);
for (int i=-4; i<=4; i++) {
(void) new VarIntInt(IPL_BND,i);
(void) new VarIntInt(IPL_DOM,i);
}
(void) new VarIntShared(IPL_BND);
(void) new VarIntShared(IPL_DOM);
(void) new VarBoolVar();
(void) new VarBoolInt(0);
(void) new VarBoolInt(1);
// Matrix tests
(void) new MatrixIntIntVarXY();
(void) new MatrixIntIntVarXX();
(void) new MatrixIntBoolVarXY();
(void) new MatrixIntBoolVarXX();
(void) new MatrixIntVarIntVarXY();
(void) new MatrixIntVarIntVarXX();
(void) new MatrixBoolVarBoolVarXY();
(void) new MatrixBoolVarBoolVarXX();
}
};
Create c;
//@}
}
}}
// STATISTICS: test-int
|