/usr/include/gecode/int/arithmetic.hh is in libgecode-dev 4.2.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Christian Schulte, 2002
* Guido Tack, 2004
*
* Last modified:
* $Date: 2013-08-29 16:05:54 +0200 (Thu, 29 Aug 2013) $ by $Author: schulte $
* $Revision: 13993 $
*
* 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.
*
*/
#ifndef __GECODE_INT_ARITHMETIC_HH__
#define __GECODE_INT_ARITHMETIC_HH__
#include <gecode/int.hh>
#include <gecode/int/rel.hh>
#include <gecode/int/linear.hh>
/**
* \namespace Gecode::Int::Arithmetic
* \brief Numerical (arithmetic) propagators
*/
namespace Gecode { namespace Int { namespace Arithmetic {
/**
* \brief Bounds consistent absolute value propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class View>
class AbsBnd : public BinaryPropagator<View,PC_INT_BND> {
protected:
using BinaryPropagator<View,PC_INT_BND>::x0;
using BinaryPropagator<View,PC_INT_BND>::x1;
/// Constructor for cloning \a p
AbsBnd(Space& home, bool share, AbsBnd& p);
/// Constructor for posting
AbsBnd(Home home, View x0, View x1);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/**
* \brief Cost function
*
* If a view has been assigned, the cost is low unary.
* Otherwise it is low binary.
*/
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post bounds consistent propagator \f$ |x_0|=x_1\f$
static ExecStatus post(Home home, View x0, View x1);
};
/**
* \brief Domain consistent absolute value propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class View>
class AbsDom : public BinaryPropagator<View,PC_INT_DOM> {
protected:
using BinaryPropagator<View,PC_INT_DOM>::x0;
using BinaryPropagator<View,PC_INT_DOM>::x1;
/// Constructor for cloning \a p
AbsDom(Space& home, bool share, AbsDom& p);
/// Constructor for posting
AbsDom(Home home, View x0, View x1);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/**
* \brief Cost function
*
* If a view has been assigned, the cost is low binary.
* If in stage for bounds propagation, the cost is
* low binary. Otherwise it is high binary.
*/
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post domain consistent propagator \f$ |x_0|=x_1\f$
static ExecStatus post(Home home, View x0, View x1);
};
}}}
#include <gecode/int/arithmetic/abs.hpp>
namespace Gecode { namespace Int { namespace Arithmetic {
/**
* \brief Bounds consistent ternary maximum propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class View>
class MaxBnd : public TernaryPropagator<View,PC_INT_BND> {
protected:
using TernaryPropagator<View,PC_INT_BND>::x0;
using TernaryPropagator<View,PC_INT_BND>::x1;
using TernaryPropagator<View,PC_INT_BND>::x2;
/// Constructor for cloning \a p
MaxBnd(Space& home, bool share, MaxBnd& p);
/// Constructor for posting
MaxBnd(Home home, View x0, View x1, View x2);
public:
/// Constructor for rewriting \a p during cloning
MaxBnd(Space& home, bool share, Propagator& p, View x0, View x1, View x2);
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator \f$ \max\{x_0,x_1\}=x_2\f$
static ExecStatus post(Home home, View x0, View x1, View x2);
};
/**
* \brief Bounds consistent n-ary maximum propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class View>
class NaryMaxBnd : public NaryOnePropagator<View,PC_INT_BND> {
protected:
using NaryOnePropagator<View,PC_INT_BND>::x;
using NaryOnePropagator<View,PC_INT_BND>::y;
/// Constructor for cloning \a p
NaryMaxBnd(Space& home, bool share, NaryMaxBnd& p);
/// Constructor for posting
NaryMaxBnd(Home home, ViewArray<View>& x, View y);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator \f$ \max x=y\f$
static ExecStatus post(Home home, ViewArray<View>& x, View y);
};
/**
* \brief Domain consistent ternary maximum propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class View>
class MaxDom : public TernaryPropagator<View,PC_INT_DOM> {
protected:
using TernaryPropagator<View,PC_INT_DOM>::x0;
using TernaryPropagator<View,PC_INT_DOM>::x1;
using TernaryPropagator<View,PC_INT_DOM>::x2;
/// Constructor for cloning \a p
MaxDom(Space& home, bool share, MaxDom& p);
/// Constructor for posting
MaxDom(Home home, View x0, View x1, View x2);
public:
/// Constructor for rewriting \a p during cloning
MaxDom(Space& home, bool share, Propagator& p, View x0, View x1, View x2);
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/**
* \brief Cost function
*
* If in stage for bounds propagation, the cost is
* low ternary. Otherwise it is high ternary.
*/
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator \f$ \max\{x_0,x_1\}=x_2\f$
static ExecStatus post(Home home, View x0, View x1, View x2);
};
/**
* \brief Domain consistent n-ary maximum propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class View>
class NaryMaxDom : public NaryOnePropagator<View,PC_INT_DOM> {
protected:
using NaryOnePropagator<View,PC_INT_DOM>::x;
using NaryOnePropagator<View,PC_INT_DOM>::y;
/// Constructor for cloning \a p
NaryMaxDom(Space& home, bool share, NaryMaxDom& p);
/// Constructor for posting
NaryMaxDom(Home home, ViewArray<View>& x, View y);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/**
* \brief Cost function
*
* If in stage for bounds propagation, the cost is
* low linear. Otherwise it is high linear.
*/
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator \f$ \max x=y\f$
static ExecStatus post(Home home, ViewArray<View>& x, View y);
};
}}}
#include <gecode/int/arithmetic/max.hpp>
namespace Gecode { namespace Int { namespace Arithmetic {
/**
* \brief Operations for square and square-root propagators
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
class SqrOps {
public:
/// Return whether exponent is even
bool even(void) const;
/// Return exponent
int exp(void) const;
/// Set exponent to \a m
void exp(int m);
/// Return \f$x^2\f$
template<class IntType>
IntType pow(IntType x) const;
/// Return \f$x^2\f$ truncated to integer limits
int tpow(int x) const;
/// Return \f$\lfloor \sqrt{x}\rfloor\f$ where \a x must be non-negative and \f$n>0\f$
int fnroot(int x) const;
/// Return \f$\lceil \sqrt{x}\rceil\f$ where \a x must be non-negative and \f$n>0\f$
int cnroot(int x) const;
};
/**
* \brief Operations for power and nroot propagators
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
class PowOps {
protected:
/// The exponent and root index
int n;
/// Return whether \a m is even
static bool even(int m);
/// Test whether \f$r^n>x\f$
bool powgr(long long int r, int x) const;
/// Test whether \f$r^n<x\f$
bool powle(long long int r, int x) const;
public:
/// Initialize with exponent \a n
PowOps(int n);
/// Return whether exponent is even
bool even(void) const;
/// Return exponent
int exp(void) const;
/// Set exponent to \a m
void exp(int m);
/// Return \f$x^n\f$ where \f$n>0\f$
template<class IntType>
IntType pow(IntType x) const;
/// Return \f$x^n\f$ where \f$n>0\f$ truncated to integer limits
int tpow(int x) const;
/// Return \f$\lfloor \sqrt[n]{x}\rfloor\f$ where \a x must be non-negative and \f$n>0\f$
int fnroot(int x) const;
/// Return \f$\lceil \sqrt[n]{x}\rceil\f$ where \a x must be non-negative and \f$n>0\f$
int cnroot(int x) const;
};
}}}
#include <gecode/int/arithmetic/pow-ops.hpp>
namespace Gecode { namespace Int { namespace Arithmetic {
/**
* \brief Bounds consistent positive power propagator
*
* This propagator is for positive views only.
*/
template<class VA, class VB, class Ops>
class PowPlusBnd : public MixBinaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND> {
protected:
using MixBinaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND>::x0;
using MixBinaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND>::x1;
/// Operations
Ops ops;
/// Constructor for posting
PowPlusBnd(Home home, VA x0, VB x1, const Ops& ops);
/// Constructor for cloning \a p
PowPlusBnd(Space& home, bool share, PowPlusBnd<VA,VB,Ops>& p);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator
static ExecStatus post(Home home, VA x0, VB x1, Ops ops);
};
/**
* \brief Bounds consistent power propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class Ops>
class PowBnd : public BinaryPropagator<IntView,PC_INT_BND> {
protected:
using BinaryPropagator<IntView,PC_INT_BND>::x0;
using BinaryPropagator<IntView,PC_INT_BND>::x1;
/// Operations
Ops ops;
/// Constructor for cloning \a p
PowBnd(Space& home, bool share, PowBnd& p);
/// Constructor for posting
PowBnd(Home home, IntView x0, IntView x1, const Ops& ops);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator
static ExecStatus post(Home home, IntView x0, IntView x1, Ops ops);
};
/**
* \brief Domain consistent positive power propagator
*
* This propagator is for positive views only.
*/
template<class VA, class VB, class Ops>
class PowPlusDom : public MixBinaryPropagator<VA,PC_INT_DOM,VB,PC_INT_DOM> {
protected:
using MixBinaryPropagator<VA,PC_INT_DOM,VB,PC_INT_DOM>::x0;
using MixBinaryPropagator<VA,PC_INT_DOM,VB,PC_INT_DOM>::x1;
/// Operations
Ops ops;
/// Constructor for posting
PowPlusDom(Home home, VA x0, VB x1, const Ops& ops);
/// Constructor for cloning \a p
PowPlusDom(Space& home, bool share, PowPlusDom<VA,VB,Ops>& p);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/**
* \brief Cost function
*
* If a view has been assigned, the cost is low unary.
* If in stage for bounds propagation, the cost is
* low binary. Otherwise it is high binary.
*/
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator
static ExecStatus post(Home home, VA x0, VB x1, Ops ops);
};
/**
* \brief Domain consistent power propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class Ops>
class PowDom : public BinaryPropagator<IntView,PC_INT_DOM> {
protected:
using BinaryPropagator<IntView,PC_INT_DOM>::x0;
using BinaryPropagator<IntView,PC_INT_DOM>::x1;
/// Operations
Ops ops;
/// Constructor for cloning \a p
PowDom(Space& home, bool share, PowDom<Ops>& p);
/// Constructor for posting
PowDom(Home home, IntView x0, IntView x1, const Ops& ops);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/**
* \brief Cost function
*
* If a view has been assigned, the cost is low unary.
* If in stage for bounds propagation, the cost is
* low binary. Otherwise it is high binary.
*/
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Post propagator
static ExecStatus post(Home home, IntView x0, IntView x1, Ops ops);
};
}}}
#include <gecode/int/arithmetic/pow.hpp>
namespace Gecode { namespace Int { namespace Arithmetic {
/**
* \brief Positive bounds consistent n-th root propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class Ops, bool minus>
class NrootPlusBnd : public BinaryPropagator<IntView,PC_INT_BND> {
protected:
using BinaryPropagator<IntView,PC_INT_BND>::x0;
using BinaryPropagator<IntView,PC_INT_BND>::x1;
/// Operations
Ops ops;
/// Constructor for cloning \a p
NrootPlusBnd(Space& home, bool share, NrootPlusBnd<Ops,minus>& p);
/// Constructor for posting
NrootPlusBnd(Home home, IntView x0, IntView x1, const Ops& ops);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator
static ExecStatus post(Home home, IntView x0, IntView x1, Ops ops);
};
/**
* \brief Bounds consistent n-th root propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class Ops>
class NrootBnd : public BinaryPropagator<IntView,PC_INT_BND> {
protected:
using BinaryPropagator<IntView,PC_INT_BND>::x0;
using BinaryPropagator<IntView,PC_INT_BND>::x1;
/// Operations
Ops ops;
/// Constructor for cloning \a p
NrootBnd(Space& home, bool share, NrootBnd<Ops>& p);
/// Constructor for posting
NrootBnd(Home home, IntView x0, IntView x1, const Ops& ops);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator
static ExecStatus post(Home home, IntView x0, IntView x1, Ops ops);
};
/**
* \brief Domain consistent n-th root propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class Ops, bool minus>
class NrootPlusDom : public BinaryPropagator<IntView,PC_INT_DOM> {
protected:
using BinaryPropagator<IntView,PC_INT_DOM>::x0;
using BinaryPropagator<IntView,PC_INT_DOM>::x1;
/// Operations
Ops ops;
/// Constructor for cloning \a p
NrootPlusDom(Space& home, bool share, NrootPlusDom<Ops,minus>& p);
/// Constructor for posting
NrootPlusDom(Home home, IntView x0, IntView x1, const Ops& ops);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/**
* \brief Cost function
*
* If a view has been assigned, the cost is low unary.
* If in stage for bounds propagation, the cost is
* low binary. Otherwise it is high binary.
*/
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Post propagator
static ExecStatus post(Home home, IntView x0, IntView x1, Ops ops);
};
/**
* \brief Domain consistent n-th root propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class Ops>
class NrootDom : public BinaryPropagator<IntView,PC_INT_DOM> {
protected:
using BinaryPropagator<IntView,PC_INT_DOM>::x0;
using BinaryPropagator<IntView,PC_INT_DOM>::x1;
/// Operations
Ops ops;
/// Constructor for cloning \a p
NrootDom(Space& home, bool share, NrootDom<Ops>& p);
/// Constructor for posting
NrootDom(Home home, IntView x0, IntView x1, const Ops& ops);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/**
* \brief Cost function
*
* If a view has been assigned, the cost is low unary.
* If in stage for bounds propagation, the cost is
* low binary. Otherwise it is high binary.
*/
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Post propagator
static ExecStatus post(Home home, IntView x0, IntView x1, Ops ops);
};
}}}
#include <gecode/int/arithmetic/nroot.hpp>
namespace Gecode { namespace Int { namespace Arithmetic {
/**
* \brief Bounds or domain consistent propagator for \f$x_0\times x_1=x_0\f$
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
* \ingroup FuncIntProp
*/
template<class View, PropCond pc>
class MultZeroOne : public BinaryPropagator<View,pc> {
protected:
using BinaryPropagator<View,pc>::x0;
using BinaryPropagator<View,pc>::x1;
/// Constructor for cloning \a p
MultZeroOne(Space& home, bool share, MultZeroOne<View,pc>& p);
/// Constructor for posting
MultZeroOne(Home home, View x0, View x1);
/// Test whether \a x is equal to \a n
static RelTest equal(View x, int n);
public:
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator \f$x_0\cdot x_1=x_0\f$
static ExecStatus post(Home home, View x0, View x1);
};
/**
* \brief Bounds consistent positive multiplication propagator
*
* This propagator provides multiplication for positive views only.
*/
template<class VA, class VB, class VC>
class MultPlusBnd :
public MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND> {
protected:
using MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND>::x0;
using MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND>::x1;
using MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND>::x2;
public:
/// Constructor for posting
MultPlusBnd(Home home, VA x0, VB x1, VC x2);
/// Constructor for cloning \a p
MultPlusBnd(Space& home, bool share, MultPlusBnd<VA,VB,VC>& p);
/// Post propagator \f$x_0\cdot x_1=x_2\f$
static ExecStatus post(Home home, VA x0, VB x1, VC x2);
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
};
/**
* \brief Bounds consistent multiplication propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
*
* \ingroup FuncIntProp
*/
class MultBnd : public TernaryPropagator<IntView,PC_INT_BND> {
protected:
using TernaryPropagator<IntView,PC_INT_BND>::x0;
using TernaryPropagator<IntView,PC_INT_BND>::x1;
using TernaryPropagator<IntView,PC_INT_BND>::x2;
/// Constructor for cloning \a p
MultBnd(Space& home, bool share, MultBnd& p);
public:
/// Constructor for posting
MultBnd(Home home, IntView x0, IntView x1, IntView x2);
/// Post propagator \f$x_0\cdot x_1=x_2\f$
GECODE_INT_EXPORT
static ExecStatus post(Home home, IntView x0, IntView x1, IntView x2);
/// Copy propagator during cloning
GECODE_INT_EXPORT
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
GECODE_INT_EXPORT
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
};
/**
* \brief Domain consistent positive multiplication propagator
*
* This propagator provides multiplication for positive views only.
*/
template<class VA, class VB, class VC>
class MultPlusDom :
public MixTernaryPropagator<VA,PC_INT_DOM,VB,PC_INT_DOM,VC,PC_INT_DOM> {
protected:
using MixTernaryPropagator<VA,PC_INT_DOM,VB,PC_INT_DOM,VC,PC_INT_DOM>::x0;
using MixTernaryPropagator<VA,PC_INT_DOM,VB,PC_INT_DOM,VC,PC_INT_DOM>::x1;
using MixTernaryPropagator<VA,PC_INT_DOM,VB,PC_INT_DOM,VC,PC_INT_DOM>::x2;
public:
/// Constructor for posting
MultPlusDom(Home home, VA x0, VB x1, VC x2);
/// Constructor for cloning \a p
MultPlusDom(Space& home, bool share, MultPlusDom<VA,VB,VC>& p);
/// Post propagator \f$x_0\cdot x_1=x_2\f$
static ExecStatus post(Home home, VA x0, VB x1, VC x2);
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/**
* \brief Cost function
*
* If in stage for bounds propagation, the cost is
* low ternary. Otherwise it is high ternary.
*/
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
};
/**
* \brief Domain consistent multiplication propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
*
* \ingroup FuncIntProp
*/
class MultDom : public TernaryPropagator<IntView,PC_INT_DOM> {
protected:
using TernaryPropagator<IntView,PC_INT_DOM>::x0;
using TernaryPropagator<IntView,PC_INT_DOM>::x1;
using TernaryPropagator<IntView,PC_INT_DOM>::x2;
/// Constructor for cloning \a p
MultDom(Space& home, bool share, MultDom& p);
public:
/// Constructor for posting
MultDom(Home home, IntView x0, IntView x1, IntView x2);
/// Post propagator \f$x_0\cdot x_1=x_2\f$
GECODE_INT_EXPORT
static ExecStatus post(Home home, IntView x0, IntView x1, IntView x2);
/// Copy propagator during cloning
GECODE_INT_EXPORT
virtual Actor* copy(Space& home, bool share);
/**
* \brief Cost function
*
* If in stage for bounds propagation, the cost is
* low ternary. Otherwise it is high ternary.
*/
GECODE_INT_EXPORT
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Perform propagation
GECODE_INT_EXPORT
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
};
}}}
#include <gecode/int/arithmetic/mult.hpp>
namespace Gecode { namespace Int { namespace Arithmetic {
/**
* \brief Bounds consistent positive division propagator
*
* This propagator provides division for positive views only.
*/
template<class VA, class VB, class VC>
class DivPlusBnd :
public MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND> {
protected:
using MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND>::x0;
using MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND>::x1;
using MixTernaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND,VC,PC_INT_BND>::x2;
public:
/// Constructor for posting
DivPlusBnd(Home home, VA x0, VB x1, VC x2);
/// Constructor for cloning \a p
DivPlusBnd(Space& home, bool share, DivPlusBnd<VA,VB,VC>& p);
/// Post propagator \f$x_0\mathrm{div} x_1=x_2\f$ (rounding towards 0)
static ExecStatus post(Home home, VA x0, VB x1, VC x2);
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
};
/**
* \brief Bounds consistent division propagator
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
*
* \ingroup FuncIntProp
*/
template<class View>
class DivBnd : public TernaryPropagator<View,PC_INT_BND> {
protected:
using TernaryPropagator<View,PC_INT_BND>::x0;
using TernaryPropagator<View,PC_INT_BND>::x1;
using TernaryPropagator<View,PC_INT_BND>::x2;
/// Constructor for cloning \a p
DivBnd(Space& home, bool share, DivBnd<View>& p);
public:
/// Constructor for posting
DivBnd(Home home, View x0, View x1, View x2);
/// Post propagator \f$x_0\mathrm{div} x_1=x_2\f$ (rounding towards 0)
static ExecStatus post(Home home, View x0, View x1, View x2);
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
};
/**
* \brief Integer division/modulo propagator
*
* This propagator implements the relation between divisor and
* modulo of an integer division.
*
* Requires \code #include <gecode/int/arithmetic.hh> \endcode
*
* \ingroup FuncIntProp
*/
template<class View>
class DivMod : public TernaryPropagator<View,PC_INT_BND> {
protected:
using TernaryPropagator<View,PC_INT_BND>::x0;
using TernaryPropagator<View,PC_INT_BND>::x1;
using TernaryPropagator<View,PC_INT_BND>::x2;
/// Constructor for cloning \a p
DivMod(Space& home, bool share, DivMod<View>& p);
public:
/// Constructor for posting
DivMod(Home home, View x0, View x1, View x2);
/// Post propagator \f$x_1\neq 0 \land (x_2\neq 0\Rightarrow x_0\times x_2>0) \land \mathrm{abs}(x_2)<\mathrm{abs}(x_1)\f$
static ExecStatus post(Home home, View x0, View x1, View x2);
/// Copy propagator during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
};
}}}
#include <gecode/int/arithmetic/divmod.hpp>
#endif
// STATISTICS: int-prop
|