Generated on Wed Mar 19 07:30:05 2008 for Gecode by doxygen 1.5.5

Arithmetic constraints
[Using finite domain integers]


Functions

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


Function Documentation

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

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

Only bounds-consistency is supported.

Definition at line 75 of file arithmetic.cc.

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

Post propagator for $ \min x=y$.

Only bounds-consistency is supported.

Definition at line 82 of file arithmetic.cc.

void Gecode::max ( Space *  home,
IntVar  x0,
IntVar  x1,
IntVar  x2,
IntConLevel  icl = ICL_DEF,
PropKind  pk = PK_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::TooFewArguments is thrown.

Definition at line 59 of file arithmetic.cc.

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

Post propagator for $ \max x=y$.

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

Definition at line 65 of file arithmetic.cc.

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

Post propagator for $ |x_0|=x_1$.

Only bounds-consistency is supported.

Definition at line 45 of file arithmetic.cc.

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

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

Only bounds-consistency is supported.

Definition at line 95 of file arithmetic.cc.

void Gecode::sqr ( Space *  home,
IntVar  x0,
IntVar  x1,
IntConLevel  icl = ICL_DEF,
PropKind  pk = PK_DEF 
)

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

Only bounds-consistency is supported.

Definition at line 102 of file arithmetic.cc.

void Gecode::sqrt ( Space *  home,
IntVar  x0,
IntVar  x1,
IntConLevel  icl = ICL_DEF,
PropKind  pk = PK_DEF 
)

Post propagator for $\lfloor\sqrt{x_0}\rfloor=x_1$.

Only bounds-consistency is supported.

Definition at line 108 of file arithmetic.cc.