Generated on Mon Nov 30 23:53:41 2009 for Gecode by doxygen 1.6.1

Using finite integer sets
[Programming models]

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

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

Common relation types for sets.

Enumerator:
SRT_EQ 

Equality ($=$).

SRT_NQ 

Disequality ($\neq$).

SRT_SUB 

Subset ($\subseteq$).

SRT_SUP 

Superset ($\supseteq$).

SRT_DISJ 

Disjoint ($\parallel$).

SRT_CMPL 

Complement.

Definition at line 626 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 639 of file set.hh.