arithmetic.cpp File Reference
#include <gecode/int/arithmetic.hh>Go to the source code of this file.
Namespaces | |
| namespace | Gecode |
| Gecode toplevel namespace | |
Functions | |
| void | Gecode::abs (Home home, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( |x_0|=x_1\). | |
| void | Gecode::max (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \max\{x_0,x_1\}=x_2\). | |
| void | Gecode::max (Home home, const IntVarArgs &x, IntVar y, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \max x=y\). | |
| void | Gecode::min (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \min\{x_0,x_1\}=x_2\). | |
| void | Gecode::min (Home home, const IntVarArgs &x, IntVar y, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \min x=y\). | |
| void | Gecode::argmax (Home home, const IntVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \operatorname{argmax}(x)=y\). | |
| void | Gecode::argmax (Home home, const IntVarArgs &x, int o, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \operatorname{argmax}(x)+o=y\). | |
| void | Gecode::argmin (Home home, const IntVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \operatorname{argmin}(x)=y\). | |
| void | Gecode::argmin (Home home, const IntVarArgs &x, int o, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \operatorname{argmin}(x)+o=y\). | |
| void | Gecode::argmax (Home home, const BoolVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \operatorname{argmax}(x)=y\). | |
| void | Gecode::argmax (Home home, const BoolVarArgs &x, int o, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \operatorname{argmax}(x)-o=y\). | |
| void | Gecode::argmin (Home home, const BoolVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \operatorname{argmin}(x)=y\). | |
| void | Gecode::argmin (Home home, const BoolVarArgs &x, int o, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( \operatorname{argmin}(x)-o=y\). | |
| void | Gecode::mult (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \(x_0\cdot x_1=x_2\). | |
| void | Gecode::gcd (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \(\gcd(x_0,x_1)=x_2\). | |
| void | Gecode::gcd (Home home, IntVar x0, IntVar x1, IntVar x2, Reify r, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \((\gcd(x_0,x_1)=x_2)\leftrightarrow r\). | |
| void | Gecode::divides (Home home, IntVar divisor, IntVar dividend, Reify r, IntPropLevel ipl=IPL_DEF) |
| Reify whether divisor divides dividend. | |
| void | Gecode::product (Home home, const IntVarArgs &x, IntVar y, IntPropLevel ipl=IPL_DEF) |
| Constrain y to the exact product of the variables in x. | |
| void | Gecode::product (Home home, const IntVarArgs &x, IntVar y, Reify r, IntPropLevel ipl=IPL_DEF) |
| Reify whether y is the exact product of the variables in x. | |
| void | Gecode::product_mod (Home home, const IntVarArgs &x, int m, IntVar y, IntPropLevel ipl=IPL_DEF) |
| Constrain y to the product of x modulo m. | |
| void | Gecode::product_mod (Home home, const IntVarArgs &x, int m, IntVar y, Reify r, IntPropLevel ipl=IPL_DEF) |
| Reify whether y is the product of x modulo m. | |
| void | Gecode::product_mod (Home home, const IntVarArgs &x, IntVar m, IntVar y, IntPropLevel ipl=IPL_DEF) |
| Constrain y to the product of x modulo m. | |
| void | Gecode::product_mod (Home home, const IntVarArgs &x, IntVar m, IntVar y, Reify r, IntPropLevel ipl=IPL_DEF) |
| Reify whether y is the product of x modulo m. | |
| void | Gecode::divmod (Home home, IntVar x0, IntVar x1, IntVar x2, IntVar x3, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \(x_0\ \mathrm{div}\ x_1=x_2 \land x_0\ \mathrm{mod}\ x_1 = x_3\). | |
| void | Gecode::div (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \(x_0\ \mathrm{div}\ x_1=x_2\). | |
| void | Gecode::mod (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \(x_0\ \mathrm{mod}\ x_1=x_2\). | |
| void | Gecode::sqr (Home home, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \(x_0^2=x_1\). | |
| void | Gecode::sqrt (Home home, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \(\lfloor\sqrt{x_0}\rfloor=x_1\). | |
| void | Gecode::pow (Home home, IntVar x0, int n, IntVar x1, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \(x_0^n=x_1\). | |
| void | Gecode::nroot (Home home, IntVar x0, int n, IntVar x1, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \(\lfloor\sqrt[n]{x_0}\rfloor=x_1\). | |
| void | Gecode::min (Home home, OpenIntVarList x, IntVar y, IntPropLevel ipl=IPL_DEF) |
| Constrain y to the minimum of the eventual sequence x. | |
| void | Gecode::max (Home home, OpenIntVarList x, IntVar y, IntPropLevel ipl=IPL_DEF) |
| Constrain y to the maximum of the eventual sequence x. | |
