Simple relation constraints
[Using finite domain integers]
Collaboration diagram for Simple relation constraints:
![]() |
Functions | |
void | Gecode::rel (Space *home, IntVar x0, IntRelType r, IntVar x1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::rel (Space *home, IntVar x, IntRelType r, int c, IntConLevel icl=ICL_DEF) |
Propagates ![]() | |
void | Gecode::rel (Space *home, IntVar x0, IntRelType r, IntVar x1, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::rel (Space *home, IntVar x, IntRelType r, int c, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | Gecode::rel (Space *home, const IntVarArgs &x, IntRelType r, const IntVarArgs &y, IntConLevel icl=ICL_DEF) |
Post propagator for relation between x and y. |
Function Documentation
void Gecode::rel | ( | Space * | home, | |
IntVar | x0, | |||
IntRelType | r, | |||
IntVar | x1, | |||
IntConLevel | icl = ICL_DEF | |||
) |
void Gecode::rel | ( | Space * | home, | |
IntVar | x0, | |||
IntRelType | r, | |||
int | n, | |||
IntConLevel | icl = ICL_DEF | |||
) |
void Gecode::rel | ( | Space * | home, | |
IntVar | x0, | |||
IntRelType | r, | |||
IntVar | x1, | |||
BoolVar | b, | |||
IntConLevel | icl = ICL_DEF | |||
) |
void Gecode::rel | ( | Space * | home, | |
IntVar | x, | |||
IntRelType | r, | |||
int | c, | |||
BoolVar | b, | |||
IntConLevel | icl = ICL_DEF | |||
) |
void Gecode::rel | ( | Space * | home, | |
const IntVarArgs & | x, | |||
IntRelType | r, | |||
const IntVarArgs & | y, | |||
IntConLevel | icl = ICL_DEF | |||
) |
Post propagator for relation between x and y.
Note that for the inequality relations this corresponds to the lexical order between x and y.
Supports both bounds (icl = ICL_BND) and domain-consistency (icl = ICL_DOM, default).
Throws an exception of type Int::ArgumentSizeMismatch, if x and y are of different size.