#include <gecode/int/arithmetic.hh>
Go to the source code of this file.
Functions | |
void | Gecode::abs (Home home, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::max (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::max (Home home, const IntVarArgs &x, IntVar y, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::min (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::min (Home home, const IntVarArgs &x, IntVar y, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::argmax (Home home, const IntVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::argmax (Home home, const IntVarArgs &x, int o, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::argmin (Home home, const IntVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::argmin (Home home, const IntVarArgs &x, int o, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::argmax (Home home, const BoolVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::argmax (Home home, const BoolVarArgs &x, int o, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::argmin (Home home, const BoolVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::argmin (Home home, const BoolVarArgs &x, int o, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::mult (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::divmod (Home home, IntVar x0, IntVar x1, IntVar x2, IntVar x3, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::div (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::mod (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::sqr (Home home, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::sqrt (Home home, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::pow (Home home, IntVar x0, int n, IntVar x1, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::nroot (Home home, IntVar x0, int n, IntVar x1, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void Gecode::abs | ( | Home | home, |
IntVar | x0, | ||
IntVar | x1, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).
Definition at line 39 of file arithmetic.cpp.
void Gecode::max | ( | Home | home, |
IntVar | x0, | ||
IntVar | x1, | ||
IntVar | x2, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).
Definition at line 51 of file arithmetic.cpp.
void Gecode::max | ( | Home | home, |
const IntVarArgs & | x, | ||
IntVar | y, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).
If x is empty, an exception of type Int::TooFewArguments is thrown.
Definition at line 63 of file arithmetic.cpp.
void Gecode::min | ( | Home | home, |
IntVar | x0, | ||
IntVar | x1, | ||
IntVar | x2, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).
Definition at line 78 of file arithmetic.cpp.
void Gecode::min | ( | Home | home, |
const IntVarArgs & | x, | ||
IntVar | y, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).
If x is empty, an exception of type Int::TooFewArguments is thrown.
Definition at line 91 of file arithmetic.cpp.
void Gecode::argmax | ( | Home | home, |
const IntVarArgs & | x, | ||
IntVar | y, | ||
bool | tiebreak = true , |
||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
In case of ties, the smallest value for y is chosen (provided tiebreak is true).
If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown.
Definition at line 110 of file arithmetic.cpp.
void Gecode::argmax | ( | Home | home, |
const IntVarArgs & | x, | ||
int | o, | ||
IntVar | y, | ||
bool | tiebreak = true , |
||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
In case of ties, the smallest value for y is chosen (provided tiebreak is true).
If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown.
Definition at line 136 of file arithmetic.cpp.
void Gecode::argmin | ( | Home | home, |
const IntVarArgs & | x, | ||
IntVar | y, | ||
bool | tiebreak = true , |
||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
In case of ties, the smallest value for y is chosen (provided tiebreak is true).
If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown.
Definition at line 163 of file arithmetic.cpp.
void Gecode::argmin | ( | Home | home, |
const IntVarArgs & | x, | ||
int | o, | ||
IntVar | y, | ||
bool | tiebreak = true , |
||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
In case of ties, the smallest value for y is chosen (provided tiebreak is true).
If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown.
Definition at line 189 of file arithmetic.cpp.
void Gecode::argmax | ( | Home | home, |
const BoolVarArgs & | x, | ||
IntVar | y, | ||
bool | tiebreak = true , |
||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
In case of ties, the smallest value for y is chosen (provided tiebreak is true).
If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown.
Definition at line 216 of file arithmetic.cpp.
void Gecode::argmax | ( | Home | home, |
const BoolVarArgs & | x, | ||
int | o, | ||
IntVar | y, | ||
bool | tiebreak = true , |
||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
In case of ties, the smallest value for y is chosen (provided tiebreak is true).
If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown.
Definition at line 240 of file arithmetic.cpp.
void Gecode::argmin | ( | Home | home, |
const BoolVarArgs & | x, | ||
IntVar | y, | ||
bool | tiebreak = true , |
||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
In case of ties, the smallest value for y is chosen (provided tiebreak is true).
If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown.
Definition at line 265 of file arithmetic.cpp.
void Gecode::argmin | ( | Home | home, |
const BoolVarArgs & | x, | ||
int | o, | ||
IntVar | y, | ||
bool | tiebreak = true , |
||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
In case of ties, the smallest value for y is chosen (provided tiebreak is true).
If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown.
Definition at line 289 of file arithmetic.cpp.
void Gecode::mult | ( | Home | home, |
IntVar | x0, | ||
IntVar | x1, | ||
IntVar | x2, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).
Definition at line 314 of file arithmetic.cpp.
void Gecode::divmod | ( | Home | home, |
IntVar | x0, | ||
IntVar | x1, | ||
IntVar | x2, | ||
IntVar | x3, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports bounds consistency (ipl = IPL_BND, default).
Definition at line 327 of file arithmetic.cpp.
void Gecode::div | ( | Home | home, |
IntVar | x0, | ||
IntVar | x1, | ||
IntVar | x2, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports bounds consistency (ipl = IPL_BND, default).
Definition at line 351 of file arithmetic.cpp.
void Gecode::mod | ( | Home | home, |
IntVar | x0, | ||
IntVar | x1, | ||
IntVar | x2, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports bounds consistency (ipl = IPL_BND, default).
Definition at line 360 of file arithmetic.cpp.
void Gecode::sqr | ( | Home | home, |
IntVar | x0, | ||
IntVar | x1, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).
Definition at line 369 of file arithmetic.cpp.
void Gecode::sqrt | ( | Home | home, |
IntVar | x0, | ||
IntVar | x1, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).
Definition at line 383 of file arithmetic.cpp.
void Gecode::pow | ( | Home | home, |
IntVar | x0, | ||
int | n, | ||
IntVar | x1, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).
Throws an exception of type Int::OutOfLimits, if n is negative.
Definition at line 397 of file arithmetic.cpp.
void Gecode::nroot | ( | Home | home, |
IntVar | x0, | ||
int | n, | ||
IntVar | x1, | ||
IntPropLevel | ipl = IPL_DEF |
||
) |
Post propagator for .
Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).
Throws an exception of type Int::OutOfLimits, if n is not strictly positive.
Definition at line 416 of file arithmetic.cpp.