Generated on Mon Aug 25 11:35:47 2008 for Gecode by doxygen 1.5.6

Connection constraints to finite domain variables
[Using finite integer sets]


Functions

void Gecode::min (Space *home, SetVar s, IntVar x)
 Post propagator that propagates that x is the minimal element of s, and that s is not empty.
void Gecode::max (Space *home, SetVar s, IntVar x)
 Post propagator that propagates that x is the maximal element of s, and that s is not empty.
void Gecode::match (Space *home, SetVar s, const IntVarArgs &x)
 Post propagator that propagates that s contains the $x_i$, which are sorted in non-descending order.
void Gecode::channel (Space *home, const IntVarArgs &x, const SetVarArgs &y)
 Post propagator for $x_i=j \Leftrightarrow i\in y_j$.
void Gecode::channel (Space *home, const BoolVarArgs &x, SetVar y)
 Post propagator for $x_i=1 \Leftrightarrow i\in y$.
void Gecode::cardinality (Space *home, SetVar s, IntVar x)
 Post propagator for $ |s|=x $.
void Gecode::weights (Space *home, const IntArgs &elements, const IntArgs &weights, SetVar x, IntVar y)
 Post propagator for $y = \mathrm{weight}(x)$.

Function Documentation

void Gecode::min ( Space *  home,
SetVar  s,
IntVar  x 
)

Post propagator that propagates that x is the minimal element of s, and that s is not empty.

Definition at line 121 of file int.cc.

void Gecode::max ( Space *  home,
SetVar  s,
IntVar  x 
)

Post propagator that propagates that x is the maximal element of s, and that s is not empty.

Definition at line 126 of file int.cc.

void Gecode::match ( Space *  home,
SetVar  s,
const IntVarArgs &  x 
)

Post propagator that propagates that s contains the $x_i$, which are sorted in non-descending order.

Definition at line 132 of file int.cc.

void Gecode::channel ( Space *  home,
const IntVarArgs &  x,
const SetVarArgs &  y 
)

Post propagator for $x_i=j \Leftrightarrow i\in y_j$.

Definition at line 139 of file int.cc.

void Gecode::channel ( Space *  home,
const BoolVarArgs &  x,
SetVar  y 
)

Post propagator for $x_i=1 \Leftrightarrow i\in y$.

Definition at line 148 of file int.cc.

void Gecode::cardinality ( Space *  home,
SetVar  s,
IntVar  x 
)

Post propagator for $ |s|=x $.

Definition at line 58 of file cardinality.cc.

void Gecode::weights ( Space *  home,
const IntArgs &  elements,
const IntArgs &  weights,
SetVar  x,
IntVar  y 
)

Post propagator for $y = \mathrm{weight}(x)$.

The weights are given as pairs of elements and their weight: $\mathrm{weight}(\mathrm{elements}_i) = \mathrm{weights}_i$

The upper bound of x is constrained to contain only elements from elements. The weight of a set is the sum of the weights of its elements.

Definition at line 156 of file int.cc.