Generated on Thu Mar 13 2014 04:39:39 for Gecode by doxygen 1.8.1.2
Using finite integer sets

Modules

 Set 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
 Value precedence constraints over set variables
 Element constraints
 Synchronized execution
 Branching
 Assigning

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...

Detailed Description

Enumeration Type Documentation

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 ( $>$)

Definition at line 638 of file set.hh.

Common operations for sets.

Enumerator:
SOT_UNION 

Union.

SOT_DUNION 

Disjoint union.

SOT_INTER 

Intersection

SOT_MINUS 

Difference.

Definition at line 655 of file set.hh.