|
void | Gecode::rel (Home home, IntVar x0, IntRelType irt, IntVar x1, IntConLevel icl=ICL_DEF) |
| Post propagator for . More...
|
|
void | Gecode::rel (Home home, const IntVarArgs &x, IntRelType irt, IntVar y, IntConLevel icl=ICL_DEF) |
| Post propagator for for all . More...
|
|
void | Gecode::rel (Home home, IntVar x, IntRelType irt, int c, IntConLevel icl=ICL_DEF) |
| Propagates . More...
|
|
void | Gecode::rel (Home home, const IntVarArgs &x, IntRelType irt, int c, IntConLevel icl=ICL_DEF) |
| Propagates for all . More...
|
|
void | Gecode::rel (Home home, IntVar x0, IntRelType irt, IntVar x1, Reify r, IntConLevel icl=ICL_DEF) |
| Post propagator for . More...
|
|
void | Gecode::rel (Home home, IntVar x, IntRelType irt, int c, Reify r, IntConLevel icl=ICL_DEF) |
| Post propagator for . More...
|
|
void | Gecode::rel (Home home, const IntVarArgs &x, IntRelType irt, IntConLevel icl=ICL_DEF) |
| Post propagator for relation among elements in x. More...
|
|
void | Gecode::rel (Home home, const IntVarArgs &x, IntRelType irt, const IntVarArgs &y, IntConLevel icl=ICL_DEF) |
| Post propagator for relation between x and y. More...
|
|
void Gecode::rel |
( |
Home |
home, |
|
|
const IntVarArgs & |
x, |
|
|
IntRelType |
irt, |
|
|
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).
Note that the constraint is also defined if x and y are of different size. That means that if x and y are of different size, then if r = IRT_EQ the constraint is false and if r = IRT_NQ the constraint is subsumed.
Definition at line 485 of file rel.cpp.