Using integer set variables and constraints
[Programming models]

Modules
	Set variables
	Float variables
	Range and value iterators for set variables
	Argument arrays
	Variable arrays
	Domain constraints
	Relation constraints
	Set operation/relation constraints
	Convexity constraints
	Sequence constraints
	Distinctness constraints
	Connection constraints to integer variables
	Channel constraints
	Value precedence constraints over set variables
	Element constraints
	Synchronized execution
	Branching
Enumerations
enum	Gecode::SetRelType { Gecode::SRT_EQ, Gecode::SRT_NQ, Gecode::SRT_SUB, Gecode::SRT_SUP, Gecode::SRT_DISJ, Gecode::SRT_CMPL, Gecode::SRT_LQ, Gecode::SRT_LE, Gecode::SRT_GQ, Gecode::SRT_GR }
	Common relation types for sets. More...
enum	Gecode::SetOpType { Gecode::SOT_UNION, Gecode::SOT_DUNION, Gecode::SOT_INTER, Gecode::SOT_MINUS }
	Common operations for sets. More...

Enumeration Type Documentation

enum Gecode::SetRelType

Common relation types for sets.

The total order on sets is defined as the lexicographic order on their characteristic functions, e.g., $x\leq y$ means that either $x$ is empty or the minimal element of the symmetric difference $x\ominus y$ is in $y$ .

Enumerator:

SRT_EQ	Equality ().
SRT_NQ	Disequality ( $\neq$ ).
SRT_SUB	Subset ( $\subseteq$ ).
SRT_SUP	Superset ( $\supseteq$ ).
SRT_DISJ	Disjoint ( $\parallel$ ).
SRT_CMPL	Complement.
SRT_LQ	Less or equal ( $\leq$ ).
SRT_LE	Less ().
SRT_GQ	Greater or equal ( $\geq$ ).
SRT_GR	Greater ().