Generated on Thu Mar 22 10:39:49 2012 for Gecode by doxygen 1.6.3

Using finite domain integers
[Programming models]

Modules

 Integer variables
 Argument arrays
 Variable arrays
 Domain constraints
 Simple relation constraints over integer variables
 Simple relation constraints over Boolean variables
 Value precedence constraints over integer variables
 Membership constraints
 Element constraints
 Distinct constraints
 Channel constraints
 Sorted constraints
 Counting constraints
 Number of values constraints
 Sequence constraints
 Extensional constraints
 Arithmetic constraints
 Linear constraints over integer variables
 Linear constraints over Boolean variables
 Bin packing constraints
 Geometrical packing constraints
 Scheduling constraints
 Graph constraints
 Synchronized execution
 Unsharing variables
 Branching
 Assigning

Typedefs

typedef PrimArgArray< TaskType > Gecode::TaskTypeArgs
 Argument arrays for passing task type arguments.

Enumerations

enum  Gecode::IntRelType {
  Gecode::IRT_EQ, Gecode::IRT_NQ, Gecode::IRT_LQ, Gecode::IRT_LE,
  Gecode::IRT_GQ, Gecode::IRT_GR
}
 

Relation types for integers.

More...
enum  Gecode::BoolOpType {
  Gecode::BOT_AND, Gecode::BOT_OR, Gecode::BOT_IMP, Gecode::BOT_EQV,
  Gecode::BOT_XOR
}
 

Operation types for Booleans.

More...
enum  Gecode::IntConLevel { Gecode::ICL_VAL, Gecode::ICL_BND, Gecode::ICL_DOM, Gecode::ICL_DEF }
 

Consistency levels for integer propagators.

More...
enum  Gecode::TaskType { Gecode::TT_FIXP, Gecode::TT_FIXS, Gecode::TT_FIXE }
 

Type of task for scheduling constraints.

More...

Typedef Documentation

typedef PrimArgArray<TaskType> Gecode::TaskTypeArgs

Argument arrays for passing task type arguments.

Definition at line 853 of file int.hh.


Enumeration Type Documentation

Relation types for integers.

Enumerator:
IRT_EQ 

Equality ($=$).

IRT_NQ 

Disequality ($\neq$).

IRT_LQ 

Less or equal ($\leq$).

IRT_LE 

Less ($<$).

IRT_GQ 

Greater or equal ($\geq$).

IRT_GR 

Greater ($>$).

Definition at line 796 of file int.hh.

Operation types for Booleans.

Enumerator:
BOT_AND 

Conjunction.

BOT_OR 

Disjunction.

BOT_IMP 

Implication.

BOT_EQV 

Equivalence.

BOT_XOR 

Exclusive or.

Definition at line 809 of file int.hh.

Consistency levels for integer propagators.

The descriptions are meant to be suggestions. It is not required that a propagator achieves full domain consistency or full bounds consistency. It is more like: which level of consistency comes closest.

If in the description of a constraint below no consistency level is mentioned, the propagator for the constraint implements domain consistency.

Enumerator:
ICL_VAL 

Value propagation or consistency (naive).

ICL_BND 

Bounds propagation or consistency.

ICL_DOM 

Domain propagation or consistency.

ICL_DEF 

The default consistency for a constraint.

Definition at line 830 of file int.hh.

Type of task for scheduling constraints.

Enumerator:
TT_FIXP 
TT_FIXS 
TT_FIXE 

Definition at line 842 of file int.hh.