Using integer variables and constraints
[Programming models]

Classes
class	Gecode::Reify
	Reification specification. More...
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
Typedefs
typedef PrimArgArray< TaskType >	Gecode::TaskTypeArgs
	Argument arrays for passing task type arguments.
Enumerations
enum	Gecode::ReifyMode { Gecode::RM_EQV, Gecode::RM_IMP, Gecode::RM_PMI }
	Mode for reification. More...
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...
Functions
Reify	Gecode::eqv (BoolVar x)
	Use equivalence for reification.
Reify	Gecode::imp (BoolVar x)
	Use implication for reification.
Reify	Gecode::pmi (BoolVar x)
	Use reverse implication for reification.

---

Typedef Documentation

typedef PrimArgArray<TaskType> Gecode::TaskTypeArgs

Argument arrays for passing task type arguments.

Definition at line 960 of file int.hh.

---

Enumeration Type Documentation

enum Gecode::ReifyMode

Mode for reification.

Enumerator:

RM_EQV	Equivalence for reification (default). For a constraint and a Boolean control variable defines that is propagated.
RM_IMP	Implication for reification. For a constraint and a Boolean control variable defines that is propagated.
RM_PMI	Inverse implication for reification. For a constraint and a Boolean control variable defines that is propagated.

Definition at line 826 of file int.hh.

enum Gecode::IntRelType

Relation types for integers.

Enumerator:

IRT_EQ	Equality ().
IRT_NQ	Disequality ().
IRT_LQ	Less or equal ().
IRT_LE	Less ().
IRT_GQ	Greater or equal ().
IRT_GR	Greater ().

Definition at line 903 of file int.hh.

enum Gecode::BoolOpType

Operation types for Booleans.

Enumerator:

BOT_AND	Conjunction.
BOT_OR	Disjunction.
BOT_IMP	Implication.
BOT_EQV	Equivalence.
BOT_XOR	Exclusive or.

Definition at line 916 of file int.hh.

enum Gecode::IntConLevel

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 937 of file int.hh.

enum Gecode::TaskType

Type of task for scheduling constraints.

Enumerator:

TT_FIXP
TT_FIXS
TT_FIXE

Definition at line 949 of file int.hh.

---

Function Documentation

Reify Gecode::eqv

(

BoolVar

x

)

[inline]

Use equivalence for reification.

Reify Gecode::imp

(

BoolVar

x

)

[inline]

Use implication for reification.

Reify Gecode::pmi

(

BoolVar

x

)

[inline]

Use reverse implication for reification.