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 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2002
*
* 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 <gecode/int/bool.hh>
#include <gecode/int/rel.hh>
namespace Gecode {
void
rel(Home home, BoolVar x0, IntRelType irt, BoolVar x1, IntPropLevel) {
using namespace Int;
GECODE_POST;
switch (irt) {
case IRT_EQ:
GECODE_ES_FAIL((Bool::Eq<BoolView,BoolView>
::post(home,x0,x1)));
break;
case IRT_NQ:
{
NegBoolView n1(x1);
GECODE_ES_FAIL((Bool::Eq<BoolView,NegBoolView>
::post(home,x0,n1)));
}
break;
case IRT_GQ:
GECODE_ES_FAIL(Bool::Lq<BoolView>::post(home,x1,x0));
break;
case IRT_LQ:
GECODE_ES_FAIL(Bool::Lq<BoolView>::post(home,x0,x1));
break;
case IRT_GR:
GECODE_ES_FAIL(Bool::Le<BoolView>::post(home,x1,x0));
break;
case IRT_LE:
GECODE_ES_FAIL(Bool::Le<BoolView>::post(home,x0,x1));
break;
default:
throw UnknownRelation("Int::rel");
}
}
void
rel(Home home, BoolVar x0, IntRelType irt, int n, IntPropLevel) {
using namespace Int;
GECODE_POST;
BoolView x(x0);
if (n == 0) {
switch (irt) {
case IRT_LQ:
case IRT_EQ:
GECODE_ME_FAIL(x.zero(home)); break;
case IRT_NQ:
case IRT_GR:
GECODE_ME_FAIL(x.one(home)); break;
case IRT_LE:
home.fail(); break;
case IRT_GQ:
break;
default:
throw UnknownRelation("Int::rel");
}
} else if (n == 1) {
switch (irt) {
case IRT_GQ:
case IRT_EQ:
GECODE_ME_FAIL(x.one(home)); break;
case IRT_NQ:
case IRT_LE:
GECODE_ME_FAIL(x.zero(home)); break;
case IRT_GR:
home.fail(); break;
case IRT_LQ:
break;
default:
throw UnknownRelation("Int::rel");
}
} else {
throw NotZeroOne("Int::rel");
}
}
void
rel(Home home, BoolVar x0, IntRelType irt, BoolVar x1, Reify r,
IntPropLevel) {
using namespace Int;
GECODE_POST;
switch (irt) {
case IRT_EQ:
switch (r.mode()) {
case RM_EQV:
GECODE_ES_FAIL((Bool::Eqv<BoolView,BoolView,BoolView>
::post(home,x0,x1,r.var())));
break;
case RM_IMP:
GECODE_ES_FAIL((Rel::ReEqBnd<BoolView,BoolView,RM_IMP>
::post(home,x0,x1,r.var())));
break;
case RM_PMI:
GECODE_ES_FAIL((Rel::ReEqBnd<BoolView,BoolView,RM_PMI>
::post(home,x0,x1,r.var())));
break;
default: throw UnknownReifyMode("Int::rel");
}
break;
case IRT_NQ:
{
NegBoolView nr(r.var());
switch (r.mode()) {
case RM_EQV:
GECODE_ES_FAIL((Bool::Eqv<BoolView,BoolView,NegBoolView>
::post(home,x0,x1,nr)));
break;
case RM_IMP:
GECODE_ES_FAIL((Rel::ReEqBnd<BoolView,NegBoolView,RM_PMI>
::post(home,x0,x1,nr)));
break;
case RM_PMI:
GECODE_ES_FAIL((Rel::ReEqBnd<BoolView,NegBoolView,RM_IMP>
::post(home,x0,x1,nr)));
break;
default: throw UnknownReifyMode("Int::rel");
}
}
break;
case IRT_GQ:
std::swap(x0,x1); // Fall through
case IRT_LQ:
switch (r.mode()) {
case RM_EQV:
{
NegBoolView n0(x0);
GECODE_ES_FAIL((Bool::Or<NegBoolView,BoolView,BoolView>
::post(home,n0,x1,r.var())));
}
break;
case RM_IMP:
GECODE_ES_FAIL((Rel::ReLq<BoolView,BoolView,RM_IMP>
::post(home,x0,x1,r.var())));
break;
case RM_PMI:
GECODE_ES_FAIL((Rel::ReLq<BoolView,BoolView,RM_PMI>
::post(home,x0,x1,r.var())));
break;
default: throw UnknownReifyMode("Int::rel");
}
break;
case IRT_LE:
std::swap(x0,x1); // Fall through
case IRT_GR:
{
NegBoolView nr(r.var());
switch (r.mode()) {
case RM_EQV:
{
NegBoolView n0(x0);
GECODE_ES_FAIL((Bool::Or<NegBoolView,BoolView,NegBoolView>
::post(home,n0,x1,nr)));
}
break;
case RM_IMP:
GECODE_ES_FAIL((Rel::ReLq<BoolView,NegBoolView,RM_PMI>
::post(home,x0,x1,nr)));
break;
case RM_PMI:
GECODE_ES_FAIL((Rel::ReLq<BoolView,NegBoolView,RM_IMP>
::post(home,x0,x1,nr)));
break;
default: throw UnknownReifyMode("Int::rel");
}
}
break;
default:
throw UnknownRelation("Int::rel");
}
}
void
rel(Home home, BoolVar x0, IntRelType irt, int n, Reify r,
IntPropLevel) {
using namespace Int;
GECODE_POST;
BoolView x(x0);
BoolView y(r.var());
if (n == 0) {
switch (irt) {
case IRT_LQ:
case IRT_EQ:
switch (r.mode()) {
case RM_EQV:
{
NegBoolView ny(y);
GECODE_ES_FAIL((Bool::Eq<BoolView,NegBoolView>
::post(home,x,ny)));
}
break;
case RM_IMP:
{
NegBoolView nx(x); NegBoolView ny(y);
GECODE_ES_FAIL((Bool::BinOrTrue<NegBoolView,NegBoolView>
::post(home,nx,ny)));
}
break;
case RM_PMI:
GECODE_ES_FAIL((Bool::BinOrTrue<BoolView,BoolView>
::post(home,x,y)));
break;
default: throw UnknownReifyMode("Int::rel");
}
break;
case IRT_NQ:
case IRT_GR:
switch (r.mode()) {
case RM_EQV:
GECODE_ES_FAIL((Bool::Eq<BoolView,BoolView>
::post(home,x,y)));
break;
case RM_IMP:
{
NegBoolView ny(y);
GECODE_ES_FAIL((Bool::BinOrTrue<BoolView,NegBoolView>
::post(home,x,ny)));
}
break;
case RM_PMI:
{
NegBoolView nx(x);
GECODE_ES_FAIL((Bool::BinOrTrue<NegBoolView,BoolView>
::post(home,nx,y)));
}
break;
default: throw UnknownReifyMode("Int::rel");
}
break;
case IRT_LE:
switch (r.mode()) {
case RM_EQV:
case RM_IMP:
GECODE_ME_FAIL(y.zero(home));
break;
case RM_PMI:
break;
default: throw UnknownReifyMode("Int::rel");
}
break;
case IRT_GQ:
switch (r.mode()) {
case RM_EQV:
case RM_PMI:
GECODE_ME_FAIL(y.one(home));
break;
case RM_IMP:
break;
default: throw UnknownReifyMode("Int::rel");
}
break;
default:
throw UnknownRelation("Int::rel");
}
} else if (n == 1) {
switch (irt) {
case IRT_NQ:
case IRT_LE:
switch (r.mode()) {
case RM_EQV:
{
NegBoolView ny(y);
GECODE_ES_FAIL((Bool::Eq<BoolView,NegBoolView>
::post(home,x,ny)));
}
break;
case RM_IMP:
{
NegBoolView nx(x); NegBoolView ny(y);
GECODE_ES_FAIL((Bool::BinOrTrue<NegBoolView,NegBoolView>
::post(home,nx,ny)));
}
break;
case RM_PMI:
GECODE_ES_FAIL((Bool::BinOrTrue<BoolView,BoolView>
::post(home,x,y)));
break;
default: throw UnknownReifyMode("Int::rel");
}
break;
case IRT_EQ:
case IRT_GQ:
switch (r.mode()) {
case RM_EQV:
GECODE_ES_FAIL((Bool::Eq<BoolView,BoolView>
::post(home,x,y)));
break;
case RM_IMP:
{
NegBoolView ny(y);
GECODE_ES_FAIL((Bool::BinOrTrue<BoolView,NegBoolView>
::post(home,x,ny)));
}
break;
case RM_PMI:
{
NegBoolView nx(x);
GECODE_ES_FAIL((Bool::BinOrTrue<NegBoolView,BoolView>
::post(home,nx,y)));
}
break;
default: throw UnknownReifyMode("Int::rel");
}
break;
case IRT_GR:
switch (r.mode()) {
case RM_EQV:
case RM_IMP:
GECODE_ME_FAIL(y.zero(home));
break;
case RM_PMI:
break;
default: throw UnknownReifyMode("Int::rel");
}
break;
case IRT_LQ:
switch (r.mode()) {
case RM_EQV:
case RM_PMI:
GECODE_ME_FAIL(y.one(home));
break;
case RM_IMP:
break;
default: throw UnknownReifyMode("Int::rel");
}
break;
default:
throw UnknownRelation("Int::rel");
}
} else {
throw NotZeroOne("Int::rel");
}
}
void
rel(Home home, const BoolVarArgs& x, IntRelType irt, BoolVar y,
IntPropLevel) {
using namespace Int;
GECODE_POST;
switch (irt) {
case IRT_EQ:
for (int i=0; i<x.size(); i++) {
GECODE_ES_FAIL((Bool::Eq<BoolView,BoolView>
::post(home,x[i],y)));
}
break;
case IRT_NQ:
{
NegBoolView n(y);
for (int i=0; i<x.size(); i++) {
GECODE_ES_FAIL((Bool::Eq<BoolView,NegBoolView>
::post(home,x[i],n)));
}
}
break;
case IRT_GQ:
for (int i=0; i<x.size(); i++) {
GECODE_ES_FAIL(Bool::Lq<BoolView>::post(home,y,x[i]));
}
break;
case IRT_LQ:
for (int i=0; i<x.size(); i++) {
GECODE_ES_FAIL(Bool::Lq<BoolView>::post(home,x[i],y));
}
break;
case IRT_GR:
for (int i=0; i<x.size(); i++) {
GECODE_ES_FAIL(Bool::Le<BoolView>::post(home,y,x[i]));
}
break;
case IRT_LE:
for (int i=0; i<x.size(); i++) {
GECODE_ES_FAIL(Bool::Le<BoolView>::post(home,x[i],y));
}
break;
default:
throw UnknownRelation("Int::rel");
}
}
void
rel(Home home, const BoolVarArgs& x, IntRelType irt, int n,
IntPropLevel) {
using namespace Int;
GECODE_POST;
if (n == 0) {
switch (irt) {
case IRT_LQ:
case IRT_EQ:
for (int i=0; i<x.size(); i++) {
BoolView xi(x[i]); GECODE_ME_FAIL(xi.zero(home));
}
break;
case IRT_NQ:
case IRT_GR:
for (int i=0; i<x.size(); i++) {
BoolView xi(x[i]); GECODE_ME_FAIL(xi.one(home));
}
break;
case IRT_LE:
home.fail(); break;
case IRT_GQ:
break;
default:
throw UnknownRelation("Int::rel");
}
} else if (n == 1) {
switch (irt) {
case IRT_GQ:
case IRT_EQ:
for (int i=0; i<x.size(); i++) {
BoolView xi(x[i]); GECODE_ME_FAIL(xi.one(home));
}
break;
case IRT_NQ:
case IRT_LE:
for (int i=0; i<x.size(); i++) {
BoolView xi(x[i]); GECODE_ME_FAIL(xi.zero(home));
}
break;
case IRT_GR:
home.fail(); break;
case IRT_LQ:
break;
default:
throw UnknownRelation("Int::rel");
}
} else {
throw NotZeroOne("Int::rel");
}
}
void
rel(Home home, const BoolVarArgs& x, IntRelType irt, IntPropLevel) {
using namespace Int;
GECODE_POST;
if ((irt != IRT_NQ) && (x.size() < 2))
return;
switch (irt) {
case IRT_EQ:
{
ViewArray<BoolView> y(home,x);
GECODE_ES_FAIL(Bool::NaryEq<BoolView>::post(home,y));
}
break;
case IRT_NQ:
{
ViewArray<BoolView> y(home,x);
GECODE_ES_FAIL((Rel::NaryNq<BoolView>::post(home,y)));
}
break;
case IRT_LE:
if (x.size() == 2) {
GECODE_ES_FAIL(Bool::Le<BoolView>::post(home,x[0],x[1]));
} else {
home.fail();
}
break;
case IRT_LQ:
{
ViewArray<BoolView> y(home,x);
GECODE_ES_FAIL(Bool::NaryLq<BoolView>::post(home,y));
}
break;
case IRT_GR:
if (x.size() == 2) {
GECODE_ES_FAIL(Bool::Le<BoolView>::post(home,x[1],x[0]));
} else {
home.fail();
}
break;
case IRT_GQ:
{
ViewArray<BoolView> y(home,x.size());
for (int i=0; i<x.size(); i++)
y[i] = x[x.size()-1-i];
GECODE_ES_FAIL(Bool::NaryLq<BoolView>::post(home,y));
}
break;
default:
throw UnknownRelation("Int::rel");
}
}
void
rel(Home home, const BoolVarArgs& x, IntRelType irt, const BoolVarArgs& y,
IntPropLevel) {
using namespace Int;
GECODE_POST;
switch (irt) {
case IRT_GR:
{
ViewArray<BoolView> xv(home,x), yv(home,y);
GECODE_ES_FAIL((Rel::LexLqLe<BoolView,BoolView>
::post(home,yv,xv,true)));
}
break;
case IRT_LE:
{
ViewArray<BoolView> xv(home,x), yv(home,y);
GECODE_ES_FAIL((Rel::LexLqLe<BoolView,BoolView>
::post(home,xv,yv,true)));
}
break;
case IRT_GQ:
{
ViewArray<BoolView> xv(home,x), yv(home,y);
GECODE_ES_FAIL((Rel::LexLqLe<BoolView,BoolView>
::post(home,yv,xv,false)));
}
break;
case IRT_LQ:
{
ViewArray<BoolView> xv(home,x), yv(home,y);
GECODE_ES_FAIL((Rel::LexLqLe<BoolView,BoolView>
::post(home,xv,yv,false)));
}
break;
case IRT_EQ:
for (int i=0; i<x.size(); i++) {
GECODE_ES_FAIL((Bool::Eq<BoolView,BoolView>
::post(home,x[i],y[i])));
}
break;
case IRT_NQ:
{
ViewArray<BoolView> xv(home,x), yv(home,y);
GECODE_ES_FAIL((Rel::LexNq<BoolView,BoolView>
::post(home,xv,yv)));
}
break;
default:
throw UnknownRelation("Int::rel");
}
}
namespace {
/// Return view array
ViewArray<Int::ConstIntView>
viewarray(Space& home, const IntArgs& x) {
ViewArray<Int::ConstIntView> xv(home, x.size());
for (int i=0; i<x.size(); i++) {
if ((x[i] != 0) && (x[i] != 1))
throw Int::NotZeroOne("Int::rel");
xv[i] = Int::ConstIntView(x[i]);
}
return xv;
}
}
void
rel(Home home, const BoolVarArgs& x, IntRelType irt, const IntArgs& y,
IntPropLevel) {
using namespace Int;
GECODE_POST;
switch (irt) {
case IRT_GR:
{
ViewArray<BoolView> xv(home,x);
ViewArray<ConstIntView> yv(viewarray(home,y));
GECODE_ES_FAIL((Rel::LexLqLe<ConstIntView,BoolView>
::post(home,yv,xv,true)));
}
break;
case IRT_LE:
{
ViewArray<BoolView> xv(home,x);
ViewArray<ConstIntView> yv(viewarray(home,y));
GECODE_ES_FAIL((Rel::LexLqLe<BoolView,ConstIntView>
::post(home,xv,yv,true)));
}
break;
case IRT_GQ:
{
ViewArray<BoolView> xv(home,x);
ViewArray<ConstIntView> yv(viewarray(home,y));
GECODE_ES_FAIL((Rel::LexLqLe<ConstIntView,BoolView>
::post(home,yv,xv,false)));
}
break;
case IRT_LQ:
{
ViewArray<BoolView> xv(home,x);
ViewArray<ConstIntView> yv(viewarray(home,y));
GECODE_ES_FAIL((Rel::LexLqLe<BoolView,ConstIntView>
::post(home,xv,yv,false)));
}
break;
case IRT_EQ:
if (x.size() != y.size()) {
home.fail();
} else {
for (int i=0; i<x.size(); i++)
GECODE_ME_FAIL(BoolView(x[i]).eq(home,y[i]));
}
break;
case IRT_NQ:
{
ViewArray<BoolView> xv(home,x);
ViewArray<ConstIntView> yv(viewarray(home,y));
GECODE_ES_FAIL((Rel::LexNq<BoolView,ConstIntView>
::post(home,xv,yv)));
}
break;
default:
throw UnknownRelation("Int::rel");
}
}
void
rel(Home home, const IntArgs& x, IntRelType irt, const BoolVarArgs& y,
IntPropLevel ipl) {
rel(home,y,irt,x,ipl);
}
void
rel(Home home, BoolVar x0, BoolOpType o, BoolVar x1, BoolVar x2,
IntPropLevel) {
using namespace Int;
GECODE_POST;
switch (o) {
case BOT_AND:
{
NegBoolView n0(x0); NegBoolView n1(x1); NegBoolView n2(x2);
GECODE_ES_FAIL((Bool::Or<NegBoolView,NegBoolView,NegBoolView>
::post(home,n0,n1,n2)));
}
break;
case BOT_OR:
GECODE_ES_FAIL((Bool::Or<BoolView,BoolView,BoolView>
::post(home,x0,x1,x2)));
break;
case BOT_IMP:
{
NegBoolView n0(x0);
GECODE_ES_FAIL((Bool::Or<NegBoolView,BoolView,BoolView>
::post(home,n0,x1,x2)));
}
break;
case BOT_EQV:
GECODE_ES_FAIL((Bool::Eqv<BoolView,BoolView,BoolView>
::post(home,x0,x1,x2)));
break;
case BOT_XOR:
{
NegBoolView n2(x2);
GECODE_ES_FAIL((Bool::Eqv<BoolView,BoolView,NegBoolView>
::post(home,x0,x1,n2)));
}
break;
default:
throw UnknownOperation("Int::rel");
}
}
void
rel(Home home, BoolVar x0, BoolOpType o, BoolVar x1, int n,
IntPropLevel) {
using namespace Int;
GECODE_POST;
if (n == 0) {
switch (o) {
case BOT_AND:
{
NegBoolView n0(x0); NegBoolView n1(x1);
GECODE_ES_FAIL((Bool::BinOrTrue<NegBoolView,NegBoolView>
::post(home,n0,n1)));
}
break;
case BOT_OR:
{
BoolView b0(x0); BoolView b1(x1);
GECODE_ME_FAIL(b0.zero(home));
GECODE_ME_FAIL(b1.zero(home));
}
break;
case BOT_IMP:
{
BoolView b0(x0); BoolView b1(x1);
GECODE_ME_FAIL(b0.one(home));
GECODE_ME_FAIL(b1.zero(home));
}
break;
case BOT_EQV:
{
NegBoolView n0(x0);
GECODE_ES_FAIL((Bool::Eq<NegBoolView,BoolView>::post(home,n0,x1)));
}
break;
case BOT_XOR:
GECODE_ES_FAIL((Bool::Eq<BoolView,BoolView>::post(home,x0,x1)));
break;
default:
throw UnknownOperation("Int::rel");
}
} else if (n == 1) {
switch (o) {
case BOT_AND:
{
BoolView b0(x0); BoolView b1(x1);
GECODE_ME_FAIL(b0.one(home));
GECODE_ME_FAIL(b1.one(home));
}
break;
case BOT_OR:
GECODE_ES_FAIL((Bool::BinOrTrue<BoolView,BoolView>::post(home,x0,x1)));
break;
case BOT_IMP:
{
NegBoolView n0(x0);
GECODE_ES_FAIL((Bool::BinOrTrue<NegBoolView,BoolView>
::post(home,n0,x1)));
}
break;
case BOT_EQV:
GECODE_ES_FAIL((Bool::Eq<BoolView,BoolView>::post(home,x0,x1)));
break;
case BOT_XOR:
{
NegBoolView n0(x0);
GECODE_ES_FAIL((Bool::Eq<NegBoolView,BoolView>::post(home,n0,x1)));
}
break;
default:
throw UnknownOperation("Int::rel");
}
} else {
throw NotZeroOne("Int::rel");
}
}
void
rel(Home home, BoolOpType o, const BoolVarArgs& x, BoolVar y,
IntPropLevel) {
using namespace Int;
GECODE_POST;
int m = x.size();
Region r;
switch (o) {
case BOT_AND:
{
ViewArray<NegBoolView> b(home,m);
for (int i=0; i<m; i++) {
NegBoolView nb(x[i]); b[i]=nb;
}
NegBoolView ny(y);
b.unique();
GECODE_ES_FAIL((Bool::NaryOr<NegBoolView,NegBoolView>
::post(home,b,ny)));
}
break;
case BOT_OR:
{
ViewArray<BoolView> b(home,x);
b.unique();
GECODE_ES_FAIL((Bool::NaryOr<BoolView,BoolView>::post(home,b,y)));
}
break;
case BOT_IMP:
if (m < 2) {
throw TooFewArguments("Int::rel");
} else {
ViewArray<NegBoolView> a(home,x.size()-1);
for (int i=x.size()-1; i--; )
a[i]=NegBoolView(x[i]);
ViewArray<BoolView> b(home,1);
b[0]=x[x.size()-1];
GECODE_ES_FAIL((Bool::Clause<BoolView,NegBoolView>
::post(home,b,a,y)));
}
break;
case BOT_EQV:
{
ViewArray<BoolView> xy(home, x.size() + 1);
for (int i=0; i<x.size(); i++)
xy[i] = x[i];
xy[x.size()] = y;
GECODE_ES_FAIL(Bool::NaryEqv::post(home,xy,0));
}
break;
case BOT_XOR:
{
ViewArray<BoolView> xy(home, x.size() + 1);
for (int i=0; i<x.size(); i++)
xy[i] = x[i];
xy[x.size()] = y;
GECODE_ES_FAIL(Bool::NaryEqv::post(home,xy,1));
}
break;
default:
throw UnknownOperation("Int::rel");
}
}
void
rel(Home home, BoolOpType o, const BoolVarArgs& x, int n,
IntPropLevel) {
using namespace Int;
if ((n < 0) || (n > 1))
throw NotZeroOne("Int::rel");
GECODE_POST;
int m = x.size();
Region r;
switch (o) {
case BOT_AND:
if (n == 0) {
ViewArray<NegBoolView> b(home,m);
for (int i=0; i<m; i++) {
NegBoolView nb(x[i]); b[i]=nb;
}
b.unique();
GECODE_ES_FAIL(Bool::NaryOrTrue<NegBoolView>::post(home,b));
} else {
for (int i=0; i<m; i++) {
BoolView b(x[i]); GECODE_ME_FAIL(b.one(home));
}
}
break;
case BOT_OR:
if (n == 0) {
for (int i=0; i<m; i++) {
BoolView b(x[i]); GECODE_ME_FAIL(b.zero(home));
}
} else {
ViewArray<BoolView> b(home,x);
b.unique();
GECODE_ES_FAIL(Bool::NaryOrTrue<BoolView>::post(home,b));
}
break;
case BOT_IMP:
if (m < 2) {
throw TooFewArguments("Int::rel");
} else if (n == 0) {
for (int i=m-1; i--; )
GECODE_ME_FAIL(BoolView(x[i]).one(home));
GECODE_ME_FAIL(BoolView(x[m-1]).zero(home));
} else {
ViewArray<NegBoolView> a(home,x.size()-1);
for (int i=x.size()-1; i--; )
a[i]=NegBoolView(x[i]);
ViewArray<BoolView> b(home,1);
b[0]=x[x.size()-1];
GECODE_ES_FAIL((Bool::ClauseTrue<BoolView,NegBoolView>
::post(home,b,a)));
}
break;
case BOT_EQV:
{
ViewArray<BoolView> b(home,x);
GECODE_ES_FAIL(Bool::NaryEqv::post(home,b,n));
}
break;
case BOT_XOR:
{
ViewArray<BoolView> b(home,x);
GECODE_ES_FAIL(Bool::NaryEqv::post(home,b,1^n));
}
break;
default:
throw UnknownOperation("Int::rel");
}
}
void
clause(Home home, BoolOpType o, const BoolVarArgs& x, const BoolVarArgs& y,
int n, IntPropLevel) {
using namespace Int;
if ((n < 0) || (n > 1))
throw NotZeroOne("Int::rel");
GECODE_POST;
switch (o) {
case BOT_AND:
if (n == 0) {
ViewArray<NegBoolView> xv(home,x.size());
for (int i=0; i<x.size(); i++) {
NegBoolView nxi(x[i]); xv[i]=nxi;
}
ViewArray<BoolView> yv(home,y);
xv.unique(); yv.unique();
GECODE_ES_FAIL((Bool::ClauseTrue<NegBoolView,BoolView>
::post(home,xv,yv)));
} else {
for (int i=0; i<x.size(); i++) {
BoolView b(x[i]); GECODE_ME_FAIL(b.one(home));
}
for (int i=0; i<y.size(); i++) {
BoolView b(y[i]); GECODE_ME_FAIL(b.zero(home));
}
}
break;
case BOT_OR:
if (n == 0) {
for (int i=0; i<x.size(); i++) {
BoolView b(x[i]); GECODE_ME_FAIL(b.zero(home));
}
for (int i=0; i<y.size(); i++) {
BoolView b(y[i]); GECODE_ME_FAIL(b.one(home));
}
} else {
ViewArray<BoolView> xv(home,x);
ViewArray<NegBoolView> yv(home,y.size());
for (int i=0; i<y.size(); i++) {
NegBoolView nyi(y[i]); yv[i]=nyi;
}
xv.unique(); yv.unique();
GECODE_ES_FAIL((Bool::ClauseTrue<BoolView,NegBoolView>
::post(home,xv,yv)));
}
break;
default:
throw IllegalOperation("Int::clause");
}
}
void
clause(Home home, BoolOpType o, const BoolVarArgs& x, const BoolVarArgs& y,
BoolVar z, IntPropLevel) {
using namespace Int;
GECODE_POST;
switch (o) {
case BOT_AND:
{
ViewArray<NegBoolView> xv(home,x.size());
for (int i=0; i<x.size(); i++) {
NegBoolView n(x[i]); xv[i]=n;
}
ViewArray<BoolView> yv(home,y);
xv.unique(); yv.unique();
NegBoolView nz(z);
GECODE_ES_FAIL((Bool::Clause<NegBoolView,BoolView>
::post(home,xv,yv,nz)));
}
break;
case BOT_OR:
{
ViewArray<BoolView> xv(home,x);
ViewArray<NegBoolView> yv(home,y.size());
for (int i=0; i<y.size(); i++) {
NegBoolView n(y[i]); yv[i]=n;
}
xv.unique(); yv.unique();
GECODE_ES_FAIL((Bool::Clause<BoolView,NegBoolView>
::post(home,xv,yv,z)));
}
break;
default:
throw IllegalOperation("Int::clause");
}
}
void
ite(Home home, BoolVar b, IntVar x, IntVar y, IntVar z,
IntPropLevel ipl) {
using namespace Int;
GECODE_POST;
if (vbd(ipl) == IPL_BND) {
GECODE_ES_FAIL((Bool::IteBnd<IntView,IntView,IntView>
::post(home,b,x,y,z)));
} else {
GECODE_ES_FAIL((Bool::IteDom<IntView,IntView,IntView>
::post(home,b,x,y,z)));
}
}
void
ite(Home home, BoolVar b, BoolVar x, BoolVar y, BoolVar z,
IntPropLevel) {
using namespace Int;
GECODE_POST;
GECODE_ES_FAIL((Bool::IteBnd<BoolView,BoolView,BoolView>
::post(home,b,x,y,z)));
}
}
// STATISTICS: int-post
|