Generated on Thu Oct 26 14:25:46 2006 for Gecode by doxygen 1.4.7

Arithmetic constraints
[Using finite domain integers]

Collaboration diagram for Arithmetic constraints:


Functions

void Gecode::min (Space *home, IntVar x0, IntVar x1, IntVar x2, IntConLevel=ICL_DEF)
 Post propagator for $ \min\{x_0,x_1\}=x_2$.
void Gecode::min (Space *home, const IntVarArgs &x, IntVar y, IntConLevel=ICL_DEF)
 Post propagator for $ \min x=y$.
void Gecode::max (Space *home, IntVar x0, IntVar x1, IntVar x2, IntConLevel=ICL_DEF)
 Post propagator for $ \max\{x_0,x_1\}=x_2$.
void Gecode::max (Space *home, const IntVarArgs &x, IntVar y, IntConLevel=ICL_DEF)
 Post propagator for $ \max x=y$.
void Gecode::abs (Space *home, IntVar x0, IntVar x1, IntConLevel=ICL_DEF)
 Post propagator for $ |x_0|=x_1$.
void Gecode::mult (Space *home, IntVar x0, IntVar x1, IntVar x2, IntConLevel=ICL_DEF)
 Post propagator for $x_0\cdot x_1=x_2$.

Function Documentation

void Gecode::min ( Space *  home,
IntVar  x0,
IntVar  x1,
IntVar  x2,
IntConLevel  = ICL_DEF 
)

Post propagator for $ \min\{x_0,x_1\}=x_2$.

Only bounds-consistency is supported.

Definition at line 59 of file arithmetic.cc.

void Gecode::min ( Space *  home,
const IntVarArgs &  x,
IntVar  y,
IntConLevel  = ICL_DEF 
)

Post propagator for $ \min x=y$.

Only bounds-consistency is supported.

Definition at line 66 of file arithmetic.cc.

void Gecode::max ( Space *  home,
IntVar  x0,
IntVar  x1,
IntVar  x2,
IntConLevel  = ICL_DEF 
)

Post propagator for $ \max\{x_0,x_1\}=x_2$.

Only bounds-consistency is supported. If x is empty, an exception of type Int::ArgumentEmpty is thrown.

Definition at line 43 of file arithmetic.cc.

void Gecode::max ( Space *  home,
const IntVarArgs &  x,
IntVar  y,
IntConLevel  = ICL_DEF 
)

Post propagator for $ \max x=y$.

Only bounds-consistency is supported. If x is empty, an exception of type Int::ArgumentEmpty is thrown.

Definition at line 49 of file arithmetic.cc.

void Gecode::abs ( Space *  home,
IntVar  x0,
IntVar  x1,
IntConLevel  = ICL_DEF 
)

Post propagator for $ |x_0|=x_1$.

Only bounds-consistency is supported.

Definition at line 29 of file arithmetic.cc.

void Gecode::mult ( Space *  home,
IntVar  x0,
IntVar  x1,
IntVar  x2,
IntConLevel  = ICL_DEF 
)

Post propagator for $x_0\cdot x_1=x_2$.

Only bounds-consistency is supported. The propagator is overflow safe.

Definition at line 79 of file arithmetic.cc.