Generated on Tue Feb 11 2025 17:33:26 for Gecode by doxygen 1.12.0

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, 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/10]

void Gecode::rel ( Home home,
IntVar x0,
IntRelType irt,
IntVar x1,
IntPropLevel ipl = IPL_DEF )

Post propagator for $ x_0 \sim_{irt} x_1$.

Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default).

Definition at line 100 of file rel.cpp.

◆ rel() [2/10]

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|$.

Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default).

Definition at line 127 of file rel.cpp.

◆ rel() [3/10]

void Gecode::rel ( Home home,
IntVar x,
IntRelType irt,
int c,
IntPropLevel ipl = IPL_DEF )

Propagates $ x \sim_{irt} c$.

Definition at line 42 of file rel.cpp.

◆ rel() [4/10]

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|$.

Definition at line 59 of file rel.cpp.

◆ rel() [5/10]

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$.

Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default).

Definition at line 177 of file rel.cpp.

◆ rel() [6/10]

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$.

Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default).

Definition at line 302 of file rel.cpp.

◆ rel() [7/10]

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).

Definition at line 428 of file rel.cpp.

◆ rel() [8/10]

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.

Definition at line 485 of file rel.cpp.

◆ rel() [9/10]

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.

Definition at line 561 of file rel.cpp.

◆ rel() [10/10]

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.

Definition at line 621 of file rel.cpp.