Functions | |
void | Gecode::rel (Home home, IntVar x0, IntRelType irt, IntVar x1, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::rel (Home home, const IntVarArgs &x, IntRelType irt, IntVar y, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() ![]() | |
void | Gecode::rel (Home home, IntVar x, IntRelType irt, int c, IntPropLevel ipl=IPL_DEF) |
Propagates ![]() | |
void | Gecode::rel (Home home, const IntVarArgs &x, IntRelType irt, int c, IntPropLevel ipl=IPL_DEF) |
Propagates ![]() ![]() | |
void | Gecode::rel (Home home, IntVar x0, IntRelType irt, IntVar x1, Reify r, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::rel (Home home, IntVar x, IntRelType irt, int c, Reify r, IntPropLevel ipl=IPL_DEF) |
Post propagator for ![]() | |
void | Gecode::rel (Home home, const IntVarArgs &x, IntRelType irt, IntPropLevel ipl=IPL_DEF) |
Post propagator for relation among elements in x. | |
void | Gecode::rel (Home home, const IntVarArgs &x, IntRelType irt, const IntVarArgs &y, IntPropLevel ipl=IPL_DEF) |
Post propagator for relation between x and y. | |
void | Gecode::rel (Home home, const IntVarArgs &x, IntRelType irt, const IntArgs &y, IntPropLevel ipl=IPL_DEF) |
Post propagator for relation between x and y. | |
void | Gecode::rel (Home home, const IntArgs &x, IntRelType irt, const IntVarArgs &y, IntPropLevel ipl=IPL_DEF) |
Post propagator for relation between x and y. |
void Gecode::rel | ( | Home | home, |
IntVar | x0, | ||
IntRelType | irt, | ||
IntVar | x1, | ||
IntPropLevel | ipl = IPL_DEF ) |
void Gecode::rel | ( | Home | home, |
const IntVarArgs & | x, | ||
IntRelType | irt, | ||
IntVar | y, | ||
IntPropLevel | ipl = IPL_DEF ) |
void Gecode::rel | ( | Home | home, |
IntVar | x, | ||
IntRelType | irt, | ||
int | c, | ||
IntPropLevel | ipl = IPL_DEF ) |
void Gecode::rel | ( | Home | home, |
const IntVarArgs & | x, | ||
IntRelType | irt, | ||
int | c, | ||
IntPropLevel | ipl = IPL_DEF ) |
void Gecode::rel | ( | Home | home, |
IntVar | x0, | ||
IntRelType | irt, | ||
IntVar | x1, | ||
Reify | r, | ||
IntPropLevel | ipl = IPL_DEF ) |
void Gecode::rel | ( | Home | home, |
IntVar | x, | ||
IntRelType | irt, | ||
int | c, | ||
Reify | r, | ||
IntPropLevel | ipl = IPL_DEF ) |
void Gecode::rel | ( | Home | home, |
const IntVarArgs & | x, | ||
IntRelType | irt, | ||
IntPropLevel | ipl = IPL_DEF ) |
Post propagator for relation among elements in x.
States that the elements of x are in the following relation:
void Gecode::rel | ( | Home | home, |
const IntVarArgs & | x, | ||
IntRelType | irt, | ||
const IntVarArgs & | y, | ||
IntPropLevel | ipl = IPL_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 (ipl = IPL_BND) and domain consistency (ipl = IPL_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.
void Gecode::rel | ( | Home | home, |
const IntVarArgs & | x, | ||
IntRelType | irt, | ||
const IntArgs & | y, | ||
IntPropLevel | ipl = IPL_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 domain consistency.
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.
void Gecode::rel | ( | Home | home, |
const IntArgs & | x, | ||
IntRelType | irt, | ||
const IntVarArgs & | y, | ||
IntPropLevel | ipl = IPL_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 domain consistency.
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.