Functions | |
| void | Gecode::rel (Home home, IntVar x0, IntRelType irt, IntVar x1, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( x_0 \sim_{irt} x_1\). | |
| void | Gecode::rel (Home home, const IntVarArgs &x, IntRelType irt, IntVar y, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( x_i \sim_{irt} y \) for all \(0\leq i<|x|\). | |
| void | Gecode::rel (Home home, IntVar x, IntRelType irt, int c, IntPropLevel ipl=IPL_DEF) |
| Propagates \( x \sim_{irt} c\). | |
| void | Gecode::rel (Home home, const IntVarArgs &x, IntRelType irt, int c, IntPropLevel ipl=IPL_DEF) |
| Propagates \( x_i \sim_{irt} c \) for all \(0\leq i<|x|\). | |
| void | Gecode::rel (Home home, IntVar x0, IntRelType irt, IntVar x1, Reify r, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \( (x_0 \sim_{irt} x_1)\equiv r\). | |
| void | Gecode::rel (Home home, IntVar x, IntRelType irt, int c, Reify r, IntPropLevel ipl=IPL_DEF) |
| Post propagator for \((x \sim_{irt} c)\equiv r\). | |
| 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, OpenIntVarList x, IntRelType irt, IntPropLevel ipl=IPL_DEF) |
| Constrain consecutive materialized variables in x by irt. | |
| 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. | |
Detailed Description
Function Documentation
◆ rel() [1/11]
| void Gecode::rel | ( | Home | home, |
| IntVar | x0, | ||
| IntRelType | irt, | ||
| IntVar | x1, | ||
| IntPropLevel | ipl = IPL_DEF ) |
◆ rel() [2/11]
| void Gecode::rel | ( | Home | home, |
| const IntVarArgs & | x, | ||
| IntRelType | irt, | ||
| IntVar | y, | ||
| IntPropLevel | ipl = IPL_DEF ) |
◆ rel() [3/11]
| void Gecode::rel | ( | Home | home, |
| IntVar | x, | ||
| IntRelType | irt, | ||
| int | c, | ||
| IntPropLevel | ipl = IPL_DEF ) |
◆ rel() [4/11]
| void Gecode::rel | ( | Home | home, |
| const IntVarArgs & | x, | ||
| IntRelType | irt, | ||
| int | c, | ||
| IntPropLevel | ipl = IPL_DEF ) |
◆ rel() [5/11]
| void Gecode::rel | ( | Home | home, |
| IntVar | x0, | ||
| IntRelType | irt, | ||
| IntVar | x1, | ||
| Reify | r, | ||
| IntPropLevel | ipl = IPL_DEF ) |
◆ rel() [6/11]
| void Gecode::rel | ( | Home | home, |
| IntVar | x, | ||
| IntRelType | irt, | ||
| int | c, | ||
| Reify | r, | ||
| IntPropLevel | ipl = IPL_DEF ) |
◆ rel() [7/11]
| 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:
- if r = IRT_LE, r = IRT_LQ, r = IRT_GR, or r = IRT_GQ, then the elements of x are ordered with respect to r. Supports domain consistency (ipl = IPL_DOM, default).
- if r = IRT_EQ, then all elements of x must be equal. Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default).
- if r = IRT_NQ, then not all elements of x must be equal. Supports domain consistency (ipl = IPL_DOM, default).
◆ rel() [8/11]
| void Gecode::rel | ( | Home | home, |
| OpenIntVarList | x, | ||
| IntRelType | irt, | ||
| IntPropLevel | ipl = IPL_DEF ) |
◆ rel() [9/11]
| 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.
◆ rel() [10/11]
| 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.
◆ rel() [11/11]
| 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.
