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
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Vincent Barichard <Vincent.Barichard@univ-angers.fr>
*
* Copyright:
* Christian Schulte, 2005
* Vincent Barichard, 2012
*
* 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/float.hh"
#include <gecode/minimodel.hh>
#include <cmath>
#include <algorithm>
namespace Test { namespace Float {
/// %Tests for arithmetic constraints
namespace Arithmetic {
/**
* \defgroup TaskTestFloatArithmetic Arithmetic constraints
* \ingroup TaskTestFloat
*/
//@{
/// %Test for multiplication constraint
class MultXYZ : public Test {
public:
/// Create and register test
MultXYZ(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Mult::XYZ::"+s,3,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] * x[1], x[2]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
if (flip())
Gecode::mult(home, x[0], x[1], x[2]);
else
Gecode::rel(home, x[0] * x[1] == x[2]);
}
};
/// %Test for multiplication constraint when solution is ensured
class MultXYZSol : public Test {
public:
/// Create and register test
MultXYZSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Mult::XYZ::Sol::"+s,3,d,st,EXTEND_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] * x[1], x[2]);
}
/// Extend assignment \a x
virtual bool extendAssignment(Assignment& x) const {
Gecode::FloatVal d = x[0]*x[1];
if (Gecode::Float::subset(d, dom)) {
x.set(2, d);
return true;
} else {
return false;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::mult(home, x[0], x[1], x[2]);
}
};
/// %Test for multiplication constraint with shared variables
class MultXXY : public Test {
public:
/// Create and register test
MultXXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Mult::XXY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] * x[0], x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::mult(home, x[0], x[0], x[1]);
}
};
/// %Test for multiplication constraint with shared variables when solution is ensured
class MultXXYSol : public Test {
public:
/// Create and register test
MultXXYSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Mult::XXY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] * x[0], x[1]);
}
/// Extend assignment \a x
virtual bool extendAssignment(Assignment& x) const {
Gecode::FloatVal d = x[0]*x[0];
if (Gecode::Float::subset(d, dom)) {
x.set(1, d);
return true;
} else {
return false;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::mult(home, x[0], x[0], x[1]);
}
};
/// %Test for multiplication constraint with shared variables
class MultXYX : public Test {
public:
/// Create and register test
MultXYX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Mult::XYX::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] * x[1], x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::mult(home, x[0], x[1], x[0]);
}
};
/// %Test for multiplication constraint with shared variables
class MultXYY : public Test {
public:
/// Create and register test
MultXYY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Mult::XYY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] * x[1], x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::mult(home, x[0], x[1], x[1]);
}
};
/// %Test for multiplication constraint with shared variables
class MultXXX : public Test {
public:
/// Create and register test
MultXXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Mult::XXX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] * x[0], x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::mult(home, x[0], x[0], x[0]);
}
};
/// %Test for division constraint
class Div : public Test {
public:
/// Create and register test
Div(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Div::"+s,3,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] / x[1], x[2]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
if (flip())
Gecode::div(home, x[0], x[1], x[2]);
else
Gecode::rel(home, x[0] / x[1] == x[2]);
}
};
/// %Test for division constraint when solution is ensured
class DivSol : public Test {
public:
/// Create and register test
DivSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Div::Sol::"+s,3,d,st,EXTEND_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] / x[1], x[2]);
}
/// Extend assignment \a x
virtual bool extendAssignment(Assignment& x) const {
Gecode::FloatVal d = x[0]/x[1];
if (Gecode::Float::subset(d, dom)) {
x.set(2, d);
return true;
} else {
return false;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::div(home, x[0], x[1], x[2]);
}
};
/// %Test for squaring constraint
class SqrXY : public Test {
public:
/// Create and register test
SqrXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Sqr::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] * x[0], x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
if (flip())
Gecode::sqr(home, x[0], x[1]);
else
Gecode::rel(home, sqr(x[0]) == x[1]);
}
};
/// %Test for squaring constraint where solution is ensured
class SqrXYSol : public Test {
public:
/// Create and register test
SqrXYSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Sqr::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] * x[0], x[1]);
}
/// Extend assignment \a x
virtual bool extendAssignment(Assignment& x) const {
Gecode::FloatVal d = sqr(x[0]);
if (Gecode::Float::subset(d, dom)) {
x.set(1, d);
return true;
} else {
return false;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::sqr(home, x[0], x[1]);
}
};
/// %Test for squaring constraint with shared variables
class SqrXX : public Test {
public:
/// Create and register test
SqrXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Sqr::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(x[0] * x[0], x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::sqr(home, x[0], x[0]);
}
};
/// %Test for square root constraint
class SqrtXY : public Test {
public:
/// Create and register test
SqrtXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Sqrt::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
switch (cmp(x[0], Gecode::FRT_GQ, 0.0)) {
case MT_FALSE: return MT_FALSE;
case MT_MAYBE: return MT_MAYBE;
default:
return eq(sqrt(x[0]), x[1]);
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
if (flip())
Gecode::sqrt(home, x[0], x[1]);
else
Gecode::rel(home, sqrt(x[0]) == x[1]);
}
};
/// %Test for square root constraint where solution is ensured
class SqrtXYSol : public Test {
public:
/// Create and register test
SqrtXYSol(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Sqrt::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
switch (cmp(x[0], Gecode::FRT_GQ, 0.0)) {
case MT_FALSE: return MT_FALSE;
case MT_MAYBE: return MT_MAYBE;
default:
return eq(sqrt(x[0]), x[1]);
}
}
/// Extend assignment \a x
virtual bool extendAssignment(Assignment& x) const {
Gecode::FloatVal d = sqrt(abs(x[0]));
if (Gecode::Float::subset(d, dom)) {
x.set(1, d);
return true;
} else {
return false;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::sqrt(home, x[0], x[1]);
}
};
/// %Test for square root constraint with shared variables
class SqrtXX : public Test {
public:
/// Create and register test
SqrtXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Sqrt::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
switch (cmp(x[0], Gecode::FRT_GQ, 0.0)) {
case MT_FALSE: return MT_FALSE;
case MT_MAYBE: return MT_MAYBE;
default:
return eq(sqrt(x[0]), x[0]);
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::sqrt(home, x[0], x[0]);
}
};
/// %Test for pow constraint
class PowXY : public Test {
unsigned int n;
public:
/// Create and register test
PowXY(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st)
: Test("Arithmetic::Pow::N::"+str(_n)+"::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false), n(_n) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(pow(x[0],n), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
if (flip())
Gecode::pow(home, x[0], n, x[1]);
else
Gecode::rel(home, pow(x[0],n) == x[1]);
}
};
/// %Test for pow constraint where solution is ensured
class PowXYSol : public Test {
unsigned int n;
public:
/// Create and register test
PowXYSol(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st)
: Test("Arithmetic::Pow::N::"+str(_n)+"::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false), n(_n) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(pow(x[0],n), x[1]);
}
/// Extend assignment \a x
virtual bool extendAssignment(Assignment& x) const {
Gecode::FloatVal d = pow(x[0],n);
if (Gecode::Float::subset(d, dom)) {
x.set(1, d);
return true;
} else {
return false;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::pow(home, x[0], n, x[1]);
}
};
/// %Test for pow constraint with shared variables
class PowXX : public Test {
unsigned int n;
public:
/// Create and register test
PowXX(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st)
: Test("Arithmetic::Pow::N::"+str(_n)+"::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(pow(x[0],n), x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::pow(home, x[0], n, x[0]);
}
};
/// %Test for nroot constraint
class NRootXY : public Test {
unsigned int n;
public:
/// Create and register test
NRootXY(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st)
: Test("Arithmetic::NRoot::N::"+str(_n)+"::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false), n(_n) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if ((n == 0) || (x[0].max() < 0.0))
return MT_FALSE;
return eq(nroot(x[0],n), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
if (flip())
Gecode::nroot(home, x[0], n, x[1]);
else
Gecode::rel(home, nroot(x[0],n) == x[1]);
}
};
/// %Test for nroot constraint where solution is ensured
class NRootXYSol : public Test {
unsigned int n;
public:
/// Create and register test
NRootXYSol(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st)
: Test("Arithmetic::NRoot::N::"+str(_n)+"::XY::Sol::"+s,2,d,st,EXTEND_ASSIGNMENT,false), n(_n) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if ((n == 0) || (x[0].max() < 0.0))
return MT_FALSE;
return eq(nroot(x[0],n), x[1]);
}
/// Extend assignment \a x
virtual bool extendAssignment(Assignment& x) const {
if ((n == 0) || (x[0].max() < 0))
return false;
Gecode::FloatVal d = nroot(x[0],n);
if (Gecode::Float::subset(d, dom)) {
x.set(1, d);
return true;
} else {
return false;
}
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::nroot(home, x[0], n, x[1]);
}
};
/// %Test for nroot constraint with shared variables
class NRootXX : public Test {
unsigned int n;
public:
/// Create and register test
NRootXX(const std::string& s, const Gecode::FloatVal& d, unsigned int _n, Gecode::FloatNum st)
: Test("Arithmetic::NRoot::N::"+str(_n)+"::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
if ((n == 0) || (x[0].max() < 0))
return MT_FALSE;
return eq(nroot(x[0],n), x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::nroot(home, x[0], n, x[0]);
}
};
/// %Test for absolute value constraint
class AbsXY : public Test {
public:
/// Create and register test
AbsXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Abs::XY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(abs(x[0]), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
if (flip())
Gecode::abs(home, x[0], x[1]);
else
Gecode::rel(home, abs(x[0]) == x[1]);
}
};
/// %Test for absolute value constraint with shared variables
class AbsXX : public Test {
public:
/// Create and register test
AbsXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Abs::XX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(abs(x[0]), x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::abs(home, x[0], x[0]);
}
};
/// %Test for binary minimum constraint
class MinXYZ : public Test {
public:
/// Create and register test
MinXYZ(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Min::Bin::XYZ::"+s,3,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(min(x[0],x[1]), x[2]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
if (flip())
Gecode::min(home, x[0], x[1], x[2]);
else
Gecode::rel(home, min(x[0],x[1]) == x[2]);
}
};
/// %Test for binary minimum constraint with shared variables
class MinXXY : public Test {
public:
/// Create and register test
MinXXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Min::Bin::XXY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(min(x[0],x[0]), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::min(home, x[0], x[0], x[1]);
}
};
/// %Test for binary minimum constraint with shared variables
class MinXYX : public Test {
public:
/// Create and register test
MinXYX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Min::Bin::XYX::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(min(x[0],x[1]), x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::min(home, x[0], x[1], x[0]);
}
};
/// %Test for binary minimum constraint with shared variables
class MinXYY : public Test {
public:
/// Create and register test
MinXYY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Min::Bin::XYY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(min(x[0],x[1]), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::min(home, x[0], x[1], x[1]);
}
};
/// %Test for binary minimum constraint with shared variables
class MinXXX : public Test {
public:
/// Create and register test
MinXXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Min::Bin::XXX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(min(x[0],x[0]), x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::min(home, x[0], x[0], x[0]);
}
};
/// %Test for binary maximum constraint
class MaxXYZ : public Test {
public:
/// Create and register test
MaxXYZ(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Max::Bin::XYZ::"+s,3,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(max(x[0],x[1]), x[2]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
if (flip())
Gecode::max(home, x[0], x[1], x[2]);
else
Gecode::rel(home, max(x[0], x[1]) == x[2]);
}
};
/// %Test for binary maximum constraint with shared variables
class MaxXXY : public Test {
public:
/// Create and register test
MaxXXY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Max::Bin::XXY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(max(x[0],x[0]), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::max(home, x[0], x[0], x[1]);
}
};
/// %Test for binary maximum constraint with shared variables
class MaxXYX : public Test {
public:
/// Create and register test
MaxXYX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Max::Bin::XYX::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(max(x[0],x[1]), x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::max(home, x[0], x[1], x[0]);
}
};
/// %Test for binary maximum constraint with shared variables
class MaxXYY : public Test {
public:
/// Create and register test
MaxXYY(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Max::Bin::XYY::"+s,2,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(max(x[0],x[1]), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::max(home, x[0], x[1], x[1]);
}
};
/// %Test for binary maximum constraint with shared variables
class MaxXXX : public Test {
public:
/// Create and register test
MaxXXX(const std::string& s, const Gecode::FloatVal& d, Gecode::FloatNum st)
: Test("Arithmetic::Max::Bin::XXX::"+s,1,d,st,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(max(x[0],x[0]), x[0]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::max(home, x[0], x[0], x[0]);
}
};
/// %Test for n-ary minimmum constraint
class MinNary : public Test {
public:
/// Create and register test
MinNary(void)
: Test("Arithmetic::Min::Nary",4,-4,4,0.5,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(min(min(x[0],x[1]),x[2]), x[3]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::FloatVarArgs m(3);
m[0]=x[0]; m[1]=x[1]; m[2]=x[2];
if (flip())
Gecode::min(home, m, x[3]);
else
Gecode::rel(home, min(m) == x[3]);
}
};
/// %Test for n-ary minimmum constraint with shared variables
class MinNaryShared : public Test {
public:
/// Create and register test
MinNaryShared(void)
: Test("Arithmetic::Min::Nary::Shared",3,-4,4,0.5,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(min(min(x[0],x[1]),x[2]), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::FloatVarArgs m(3);
m[0]=x[0]; m[1]=x[1]; m[2]=x[2];
Gecode::min(home, m, x[1]);
}
};
/// %Test for n-ary maximum constraint
class MaxNary : public Test {
public:
/// Create and register test
MaxNary(void)
: Test("Arithmetic::Max::Nary",4,-4,4,0.5,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(max(max(x[0],x[1]),x[2]), x[3]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::FloatVarArgs m(3);
m[0]=x[0]; m[1]=x[1]; m[2]=x[2];
if (flip())
Gecode::max(home, m, x[3]);
else
Gecode::rel(home, max(m) == x[3]);
}
};
/// %Test for n-ary maximum constraint with shared variables
class MaxNaryShared : public Test {
public:
/// Create and register test
MaxNaryShared(void)
: Test("Arithmetic::Max::Nary::Shared",3,-4,4,0.5,CPLT_ASSIGNMENT,false) {}
/// %Test whether \a x is solution
virtual MaybeType solution(const Assignment& x) const {
return eq(max(max(x[0],x[1]),x[2]), x[1]);
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::FloatVarArray& x) {
Gecode::FloatVarArgs m(3);
m[0]=x[0]; m[1]=x[1]; m[2]=x[2];
Gecode::max(home, m, x[1]);
}
};
const Gecode::FloatNum step = 0.15;
Gecode::FloatVal a(-8,5);
Gecode::FloatVal b(9,12);
Gecode::FloatVal c(-8,8);
MultXXY mult_xxy_a("A",a,step);
MultXXY mult_xxy_b("B",b,step);
MultXXY mult_xxy_c("C",c,step);
MultXXYSol mult_xxy_sol_a("A",a,step);
MultXXYSol mult_xxy_sol_b("B",b,step);
MultXXYSol mult_xxy_sol_c("C",c,step);
MultXYX mult_xyx_a("A",a,step);
MultXYX mult_xyx_b("B",b,step);
MultXYX mult_xyx_c("C",c,step);
MultXYY mult_xyy_a("A",a,step);
MultXYY mult_xyy_b("B",b,step);
MultXYY mult_xyy_c("C",c,step);
MultXXX mult_xxx_a("A",a,step);
MultXXX mult_xxx_b("B",b,step);
MultXXX mult_xxx_c("C",c,step);
MultXYZ mult_xyz_a("A",a,step);
MultXYZ mult_xyz_b("B",b,step);
MultXYZ mult_xyz_c("C",c,step);
MultXYZSol mult_xyz_sol_a("A",a,step);
MultXYZSol mult_xyz_sol_b("B",b,step);
MultXYZSol mult_xyz_sol_c("C",c,step);
Div div_a("A",a,step);
Div div_b("B",b,step);
Div div_c("C",c,step);
DivSol div_sol_a("A",a,step);
DivSol div_sol_b("B",b,step);
DivSol div_sol_c("C",c,step);
SqrXY sqr_xy_a("A",a,step);
SqrXY sqr_xy_b("B",b,step);
SqrXY sqr_xy_c("C",c,step);
SqrXYSol sqr_xy_sol_a("A",a,step);
SqrXYSol sqr_xy_sol_b("B",b,step);
SqrXYSol sqr_xy_sol_c("C",c,step);
SqrXX sqr_xx_a("A",a,step);
SqrXX sqr_xx_b("B",b,step);
SqrXX sqr_xx_c("C",c,step);
SqrtXY sqrt_xy_a("A",a,step);
SqrtXY sqrt_xy_b("B",b,step);
SqrtXY sqrt_xy_c("C",c,step);
SqrtXYSol sqrt_xy_sol_a("A",a,step);
SqrtXYSol sqrt_xy_sol_b("B",b,step);
SqrtXYSol sqrt_xy_sol_c("C",c,step);
SqrtXX sqrt_xx_a("A",a,step);
SqrtXX sqrt_xx_b("B",b,step);
SqrtXX sqrt_xx_c("C",c,step);
PowXY pow_xy_a_1("A",a,2,step);
PowXY pow_xy_b_1("B",b,2,step);
PowXY pow_xy_c_1("C",c,2,step);
PowXYSol pow_xy_sol_a_1("A",a,2,step);
PowXYSol pow_xy_sol_b_1("B",b,2,step);
PowXYSol pow_xy_sol_c_1("C",c,2,step);
PowXX pow_xx_a_1("A",a,2,step);
PowXX pow_xx_b_1("B",b,2,step);
PowXX pow_xx_c_1("C",c,2,step);
PowXY pow_xy_a_2("A",a,3,step);
PowXY pow_xy_b_2("B",b,3,step);
PowXY pow_xy_c_2("C",c,3,step);
PowXYSol pow_xy_sol_a_2("A",a,3,step);
PowXYSol pow_xy_sol_b_2("B",b,3,step);
PowXYSol pow_xy_sol_c_2("C",c,3,step);
PowXX pow_xx_a_2("A",a,3,step);
PowXX pow_xx_b_2("B",b,3,step);
PowXX pow_xx_c_2("C",c,3,step);
PowXY pow_xy_a_3("A",a,0,step);
PowXY pow_xy_b_3("B",b,0,step);
PowXY pow_xy_c_3("C",c,0,step);
PowXYSol pow_xy_sol_a_3("A",a,0,step);
PowXYSol pow_xy_sol_b_3("B",b,0,step);
PowXYSol pow_xy_sol_c_3("C",c,0,step);
PowXX pow_xx_a_3("A",a,0,step);
PowXX pow_xx_b_3("B",b,0,step);
PowXX pow_xx_c_3("C",c,0,step);
NRootXY nroot_xy_a_1("A",a,2,step);
NRootXY nroot_xy_b_1("B",b,2,step);
NRootXY nroot_xy_c_1("C",c,2,step);
NRootXYSol nroot_xy_sol_a_1("A",a,2,step);
NRootXYSol nroot_xy_sol_b_1("B",b,2,step);
NRootXYSol nroot_xy_sol_c_1("C",c,2,step);
NRootXX nroot_xx_a_1("A",a,2,step);
NRootXX nroot_xx_b_1("B",b,2,step);
NRootXX nroot_xx_c_1("C",c,2,step);
NRootXY nroot_xy_a_2("A",a,3,step);
NRootXY nroot_xy_b_2("B",b,3,step);
NRootXY nroot_xy_c_2("C",c,3,step);
NRootXYSol nroot_xy_sol_a_2("A",a,3,step);
NRootXYSol nroot_xy_sol_b_2("B",b,3,step);
NRootXYSol nroot_xy_sol_c_2("C",c,3,step);
NRootXX nroot_xx_a_2("A",a,3,step);
NRootXX nroot_xx_b_2("B",b,3,step);
NRootXX nroot_xx_c_2("C",c,3,step);
NRootXY nroot_xy_a_3("A",a,0,step);
NRootXY nroot_xy_b_3("B",b,0,step);
NRootXY nroot_xy_c_3("C",c,0,step);
NRootXYSol nroot_xy_sol_a_3("A",a,0,step);
NRootXYSol nroot_xy_sol_b_3("B",b,0,step);
NRootXYSol nroot_xy_sol_c_3("C",c,0,step);
NRootXX nroot_xx_a_3("A",a,0,step);
NRootXX nroot_xx_b_3("B",b,0,step);
NRootXX nroot_xx_c_3("C",c,0,step);
AbsXY abs_xy_a("A",a,step);
AbsXY abs_xy_b("B",b,step);
AbsXY abs_xy_c("C",c,step);
AbsXX abs_xx_a("A",a,step);
AbsXX abs_xx_b("B",b,step);
AbsXX abs_xx_c("C",c,step);
MinXYZ min_xyz_a("A",a,step);
MinXYZ min_xyz_b("B",b,step);
MinXYZ min_xyz_c("C",c,step);
MinXXY min_xxy_a("A",a,step);
MinXXY min_xxy_b("B",b,step);
MinXXY min_xxy_c("C",c,step);
MinXYX min_xyx_a("A",a,step);
MinXYX min_xyx_b("B",b,step);
MinXYX min_xyx_c("C",c,step);
MinXYY min_xyy_a("A",a,step);
MinXYY min_xyy_b("B",b,step);
MinXYY min_xyy_c("C",c,step);
MinXXX min_xxx_a("A",a,step);
MinXXX min_xxx_b("B",b,step);
MinXXX min_xxx_c("C",c,step);
MaxXYZ max_xyz_a("A",a,step);
MaxXYZ max_xyz_b("B",b,step);
MaxXYZ max_xyz_c("C",c,step);
MaxXXY max_xxy_a("A",a,step);
MaxXXY max_xxy_b("B",b,step);
MaxXXY max_xxy_c("C",c,step);
MaxXYX max_xyx_a("A",a,step);
MaxXYX max_xyx_b("B",b,step);
MaxXYX max_xyx_c("C",c,step);
MaxXYY max_xyy_a("A",a,step);
MaxXYY max_xyy_b("B",b,step);
MaxXYY max_xyy_c("C",c,step);
MaxXXX max_xxx_a("A",a,step);
MaxXXX max_xxx_b("B",b,step);
MaxXXX max_xxx_c("C",c,step);
MinNary min_nary;
MinNaryShared min_s_nary;
MaxNary max_nary;
MaxNaryShared max_s_nary;
//@}
}
}}
// STATISTICS: test-float
|