#include <gecode/set.hh>
#include <gecode/set/int.hh>
#include <gecode/set/rel.hh>

Namespaces
namespace	Gecode
	Gecode toplevel namespace
namespace	Gecode::Set
	Finite integer sets.
namespace	Gecode::Set::Int
	Propagators connecting set and int variables.

Functions
void	Gecode::rel (Home home, SetVar s, IntRelType rt, IntVar x)
	Post propagator for $\|s\|\geq 1 \land \forall i\in s:\ i \sim_{rt} x$ .
void	Gecode::Set::Int::remin (Home home, SetVar s, IntVar m, Reify r)
	Reify m to be the minimum of s.
void	Gecode::Set::Int::remax (Home home, SetVar s, IntVar m, Reify r)
	Reify m to be the maximum of s.
void	Gecode::rel (Home home, SetVar s, IntRelType rt, IntVar x, Reify r)
	Post reified propagator for $\left(\|s\|\geq 1 \land \forall i\in s:\ i \sim_{rt} x\right)\equiv r$ .
void	Gecode::min (Home home, SetVar s, IntVar x)
	Post propagator that x is the minimal element of s and that s is not empty.
void	Gecode::notMin (Home home, SetVar s, IntVar x)
	Post propagator that x is not the minimal element of s.
void	Gecode::min (Home home, SetVar s, IntVar x, Reify r)
	Post reified propagator for b iff x is the minimal element of s.
void	Gecode::max (Home home, SetVar s, IntVar x)
	Post propagator that x is the maximal element of s and that s is not empty.
void	Gecode::notMax (Home home, SetVar s, IntVar x)
	Post propagator that x is not the maximal element of s.
void	Gecode::max (Home home, SetVar s, IntVar x, Reify r)
	Post reified propagator for b iff x is the maximal element of s.
void	Gecode::weights (Home home, IntSharedArray elements, IntSharedArray weights, SetVar x, IntVar y)
	Post propagator for $y = \mathrm{weight}(x)$ .

Namespaces

Functions