int.cpp File Reference

(Revision: 12314)

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

Namespaces
namespace	Gecode
	Gecode toplevel namespace
Functions
void	Gecode::rel (Home home, SetVar s, IntRelType r, IntVar x)
	Post propagator for $\|s\|\geq 1 \land \forall i\in s:\ i \sim_r x$ .
void	Gecode::rel (Home home, IntVar x, IntRelType r, SetVar s)
	Post propagator for $\|s\|\geq 1 \land \forall i\in s:\ x \sim_r i$ .
void	Gecode::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.
void	Gecode::notMin (Home home, SetVar s, IntVar x)
	Post propagator that propagates that x is not the minimal element of s.
void	Gecode::min (Home home, SetVar s, IntVar x, BoolVar b)
	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 propagates 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 propagates that x is not the maximal element of s.
void	Gecode::max (Home home, SetVar s, IntVar x, BoolVar b)
	Post reified propagator for b iff x is the maximal element of s.
void	Gecode::channelSorted (Home home, const IntVarArgs &x, SetVar y)
	Post propagator for $\{x_0,\dots,x_{n-1}\}=y$ and $x_i<x_{i+1}$ .
void	Gecode::channel (Home home, const IntVarArgs &x, const SetVarArgs &y)
	Post propagator for $x_i=j \Leftrightarrow i\in y_j$ .
void	Gecode::channel (Home home, const BoolVarArgs &x, SetVar y)
	Post propagator for $x_i=1 \Leftrightarrow i\in y$ .
void	Gecode::weights (Home home, IntSharedArray elements, IntSharedArray weights, SetVar x, IntVar y)
	Post propagator for $y = \mathrm{weight}(x)$ .

int.cpp File Reference

(Revision: 12314)

Namespaces

Functions