TaskModelSetConnect GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::min (Home home, SetVar s, IntVar x) min Home home SetVar s IntVar x Post propagator that propagates that x is the minimal element of s, and that s is not empty. GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::notMin (Home home, SetVar s, IntVar x) notMin Home home SetVar s IntVar x Post propagator that propagates that x is not the minimal element of s. GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::min (Home home, SetVar s, IntVar x, Reify r) min Home home SetVar s IntVar x Reify r Post reified propagator for b iff x is the minimal element of s. GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::max (Home home, SetVar s, IntVar x) max Home home SetVar s IntVar x Post propagator that propagates that x is the maximal element of s, and that s is not empty. GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::notMax (Home home, SetVar s, IntVar x) notMax Home home SetVar s IntVar x Post propagator that propagates that x is not the maximal element of s. GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::max (Home home, SetVar s, IntVar x, Reify r) max Home home SetVar s IntVar x Reify r Post reified propagator for b iff x is the maximal element of s. GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::cardinality (Home home, SetVar s, IntVar x) cardinality Home home SetVar s IntVar x Post propagator for $ |s|=x $. GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::weights (Home home, IntSharedArray elements, IntSharedArray weights, SetVar x, IntVar y) weights Home home IntSharedArray elements IntSharedArray 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.