Gecode Namespace Reference
[Boolean expressions and relations, Matrix interface for arrays]

Detailed Description

Gecode toplevel namespace.

The Gecode namespace contains nested namespaces for the various submodules (for example Int for the definition of integer propagator classes). Functionality that is used for interfacing (search engines, variables, and so on) or belongs to the Gecode Kernel is contained directly in the Gecode namespace.

Classes

class ArrayTraits< CpltSetVarArray >

Traits of CpltSetVarArray. More...

class ArrayTraits< CpltSetVarArgs >

Traits of CpltSetVarArgs. More...

class BddMgrException

Exception: Error in the Buddy ROBDD manager More...

class VarImpVarTraits< CpltSet::CpltSetVarImp >

Traits class for variable implementations and variables. More...

class ViewVarImpTraits< CpltSet::CpltSetView >

Traits class for views and variable implementations. More...

class CpltSetVar

Finite set variable with complete domain representation. More...

class CpltSetVarGlbRanges

Range iterator for the greatest lower bound of a bdd variable. More...

class CpltSetVarGlbValues

Value iterator for the greatest lower bound of a bdd variable. More...

class CpltSetVarLubRanges

Range iterator for the least upper bound of a bdd variable. More...

class CpltSetVarLubValues

Value iterator for the least upper bound of a bdd variable. More...

class CpltSetVarUnknownRanges

Range iterator for the unknown set of a bdd variable. More...

class CpltSetVarArray

CpltSet variable array More...

class ArrayTraits< IntVarArray >

Traits of IntVarArray. More...

class ArrayTraits< IntVarArgs >

Traits of IntVarArgs. More...

class ArrayTraits< IntArgs >

Traits of IntArgs. More...

class ArrayTraits< BoolVarArray >

Traits of BoolVarArray. More...

class ArrayTraits< BoolVarArgs >

Traits of BoolVarArgs. More...

class TupleSet

Data stored for a Table. More...

class ViewArray< Int::Linear::NoView >

View array for no view (empty). More...

class ReUnaryPropagator

Reified unary propagator. More...

class ReBinaryPropagator

Reified binary propagator. More...

class VarImpVarTraits< Int::IntVarImp >

Traits class for variable implementations and variables. More...

class VarImpVarTraits< Int::BoolVarImp >

Traits class for variable implementations and variables. More...

class ViewVarImpTraits< Int::IntView >

Traits class for views and variable implementations. More...

class VarViewTraits< IntVar >

Traits class mapping variables to views. More...

class DomainSize< Int::IntView >

Class providing domain size info. More...

class ViewVarImpTraits< Int::MinusView >

Traits class for views and variable implementations. More...

class ViewVarImpTraits< Int::OffsetView >

Traits class for views and variable implementations. More...

class ViewVarImpTraits< Int::ScaleView< Val, UnsVal > >

Traits class for views and variable implementations. More...

class ViewVarImpTraits< Int::ConstIntView >

Traits class for views and variable implementations. More...

class ViewVarImpTraits< Int::ZeroIntView >

Traits class for views and variable implementations. More...

class ViewVarImpTraits< Int::BoolView >

Traits class for views and variable implementations. More...

class VarViewTraits< BoolVar >

Traits class mapping variables to views. More...

class DomainSize< Int::BoolView >

Class providing domain size info. More...

class ViewVarImpTraits< Int::NegBoolView >

Traits class for views and variable implementations. More...

class IntSet

Integer sets. More...

class IntSetRanges

Range iterator for integer sets. More...

class IntSetValues

Value iterator for integer sets. More...

class IntVar

Integer variables. More...

class IntVarRanges

Range iterator for integer variables More...

class IntVarValues

Value iterator for integer variables. More...

class BoolVar

Boolean integer variables. More...

class IntVarArray

Integer variable array. More...

class BoolVarArray

Boolean variable array. More...

class DFA

Deterministic finite automaton (DFA). More...

class ViewAdvisor

Advisor storing a single view. More...

class VarArray

Variable arrays More...

class ViewArray

View arrays. More...

class ArgArrayBase

Base-class for argument arrays. More...

class PrimArgArray

Argument array for primtive types. More...

class VarArgArray

Argument array for variables. More...

class ArrayTraits

Traits of arrays in Gecode. More...

class ViewValBranching

Generic branching. More...

class ViewValAssignment

Generic assignment. More...

class PosValDesc

Branching descriptions storing position and value More...

class SharedHandle

The shared handle. More...

class NoIdxVarImpConf

Configuration class for variable implementations without index structure. More...

class VarImpBase

Base-class for variable implementations. More...

class VarDisposerBase

Base class for Variable type disposer. More...

class VarDisposer

Variable type disposer More...

class Delta

Generic domain change information to be supplied to advisors. More...

class VarImp

Base-class for variable implementations. More...

class ActorLink

Double-linked list for actors. More...

class Actor

Base-class for both propagators and branchings. More...

class Propagator

Base-class for propagators. More...

class Council

Council of advisors. More...

class Advisors

Class to iterate over advisors of a council. More...

class Advisor

Base-class for advisors. More...

class BranchingDesc

Branch description for batch recomputation. More...

class Branching

Base-class for branchings. More...

class Space

Computation spaces. More...

class SpaceFailed

Exception: Operation on failed space invoked More...

class SpaceNotStable

Exception: Operation on not stable space invoked More...

class SpaceNoBranching

Exception: Commit when no branching present More...

class SpaceIllegalAlternative

Exception: Commit with illegal alternative More...

class FreeList

Base-class for freelist-managed objects. More...

class MemoryManager

Manage memory for space. More...

class UnaryPropagator

Unary propagator. More...

class BinaryPropagator

Binary propagator. More...

class TernaryPropagator

Ternary propagator. More...

class NaryPropagator

n-ary propagator More...

class NaryOnePropagator

(n+1)-ary propagator More...

class MixBinaryPropagator

Mixed binary propagator. More...

class MixTernaryPropagator

Mixed ternary propagator. More...

class MixNaryOnePropagator

Mixed (n+1)-ary propagator. More...

class SharedArray

Shared array with arbitrary number of elements. More...

class SharedArraySerialization

Serialization helper for SharedArray objects. More...

class SharedArraySerialization< int >

Serialization helper for SharedArray<int> objects. More...

class VarViewTraits

Traits class for mapping variables to views. More...

class VarImpVarTraits

Traits class for mapping variable implementations to variables. More...

class ViewVarImpTraits

Traits class for views and variable implementations. More...

class DomainSize

Traits class for variable domain size. More...

class AllVarConf

Configuration for all variable implementations. More...

class VarBase

Base-class for variables. More...

class ConstViewBase

Base-class for constant views. More...

class VarViewBase

Base-class for variable views. More...

class DerivedViewBase

Base-class for derived views. More...

class REG

Regular expressions over integer values. More...

class DFS

Depth-first search engine. More...

class LDS

Limited discrepancy search engine. More...

class BAB

Depth-first branch-and-bound search engine. More...

class Restart

Depth-first restart best solution search engine. More...

class ArrayTraits< SetVarArray >

Traits of SetVarArray. More...

class ArrayTraits< SetVarArgs >

Traits of SetVarArgs. More...

class SetExprRanges

Range iterator for set expressions. More...

class ProjectorPropagatorSpec

Specification for a C++ finite set propagator. More...

class ProjectorCompiler

Compiler from projector specifications to C++. More...

class SetExprCode

Code representing set-valued expressions for finite set projectors. More...

class SetExpr

Set-valued expressions for finite set projectors. More...

class Projector

Finite set projector specification. More...

class ProjectorSet

Group of finite set projector specifications. More...

class Formula

Formulas for specifying set constraints. More...

class IntSetPropagator

Set/Int connection propagator. More...

class VarImpVarTraits< Set::SetVarImp >

Traits class for variable implementations and variables. More...

class ViewVarImpTraits< Set::SetView >

Traits class for views and variable implementations. More...

class VarViewTraits< SetVar >

Traits class mapping variables to views. More...

class ViewVarImpTraits< Set::ConstantView >

Traits class for views and variable implementations. More...

class ViewVarImpTraits< Set::EmptyView >

Traits class for views and variable implementations. More...

class ViewVarImpTraits< Set::UniverseView >

Traits class for views and variable implementations. More...

class ViewVarImpTraits< Set::SingletonView >

Traits class for views and variable implementations. More...

class ViewVarImpTraits< Set::ComplementView< View > >

Traits class for views and variable implementations. More...

class ViewVarImpTraits< Set::OffsetSetView< View > >

Traits class for views and variable implementations. More...

class SetVar

Set variables More...

class SetVarGlbRanges

Iterator for the greatest lower bound ranges of a set variable. More...

class SetVarLubRanges

Iterator for the least upper bound ranges of a set variable. More...

class SetVarUnknownRanges

Iterator for the unknown ranges of a set variable. More...

class SetVarGlbValues

Iterator for the values in the greatest lower bound of a set variable. More...

class SetVarLubValues

Iterator for the values in the least upper bound of a set variable. More...

class SetVarUnknownValues

Iterator for the values in the unknown set of a set variable. More...

class SetVarArray

Set variable array More...

class Exception

Exception: Base-class for exceptions More...

class MemoryExhausted

Exception: Memory exhausted More...

Namespaces

namespace Support

Support algorithms and datastructures

namespace CpltSet

Complete representation of finite integer sets using ROBDD's.

namespace Set

Finite integer sets.

namespace Int

Finite domain integers.

namespace Iter

Range and value iterators.

namespace Reflection

Reflection support

namespace Memory

Heap and automatic memory management.

namespace MiniModel

Minimal modelling support.

namespace Search

Search engines

namespace Serialization

Serialization and deserialization support.

Posting projection propagators

void projector (Space *home, const SetVar &xa, const SetVar &ya, ProjectorSet &ps, bool negated=false)

Post projection propagators for binary constraint.

void projector (Space *home, const SetVarArgs &xa, ProjectorSet &ps, bool negated=false)

Post projection propagators for nary constraint.

void projector (Space *home, const SetVar &xa, const SetVar &ya, const BoolVar &bv, ProjectorSet &ps)

Post reified projection propagators for binary constraint.

void projector (Space *home, const SetVar &xa, const SetVar &ya, const SetVar &za, ProjectorSet &ps, bool negated=false)

Post projection propagators for ternary constraint.

void projector (Space *home, const SetVar &xa, const SetVar &ya, const SetVar &za, const BoolVar &bv, ProjectorSet &ps)

Post reified projection propagators for ternary constraint.

void projector (Space *home, const SetVar &xa, const SetVar &ya, const IntVar &i, Projector &p)

Post projection propagator for cardinality constraint.

void projector (Space *home, const SetVar &xa, const SetVar &ya, const SetVar &za, const IntVar &i, Projector &p)

Post projection propagator for cardinality constraint.

Typedefs

typedef VarArgArray< CpltSetVar > CpltSetVarArgs

Passing set variables.

typedef PrimArgArray< int > IntArgs

Passing integer arguments.

typedef VarArgArray< IntVar > IntVarArgs

Passing integer variables.

typedef VarArgArray< BoolVar > BoolVarArgs

Passing Boolean variables.

typedef PrimArgArray< IntSet > IntSetArgs

Passing set arguments.

typedef int ModEvent

Type for modification events.

typedef int PropCond

Type for propagation conditions.

typedef int ModEventDelta

Modification event deltas.

typedef VarArgArray< SetVar > SetVarArgs

Passing set variables.

Enumerations

enum CpltSetRelType {
  SRT_LE, SRT_GR, SRT_LQ, SRT_GQ,
  SRT_LE_REV, SRT_GR_REV, SRT_LQ_REV, SRT_GQ_REV
}

Common relation types for sets. More...

enum CpltSetOpType { SOT_SYMDIFF }

Common operations for sets. More...

enum CpltSetVarBranch {
  CPLTSET_VAR_NONE, CPLTSET_VAR_MIN_CARD, CPLTSET_VAR_MAX_CARD, CPLTSET_VAR_MIN_UNKNOWN_ELEM,
  CPLTSET_VAR_MAX_UNKNOWN_ELEM
}

Which variable to select for branching. More...

enum CpltSetValBranch { CPLTSET_VAL_MIN_UNKNOWN, CPLTSET_VAL_MAX_UNKNOWN, CPLTSET_VAL_MIN_UNKNOWN_EX_FIRST, CPLTSET_VAL_MAX_UNKNOWN_EX_FIRST }

Which values to select first for branching. More...

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

Relation types for integers. More...

enum BoolOpType {
  BOT_AND, BOT_OR, BOT_IMP, BOT_EQV,
  BOT_XOR
}

Operation types for Booleans. More...

enum IntConLevel { ICL_VAL, ICL_BND, ICL_DOM, ICL_DEF }

Consistency levels for integer propagators. More...

enum IntVarBranch {
  INT_VAR_NONE, INT_VAR_MIN_MIN, INT_VAR_MIN_MAX, INT_VAR_MAX_MIN,
  INT_VAR_MAX_MAX, INT_VAR_SIZE_MIN, INT_VAR_SIZE_MAX, INT_VAR_DEGREE_MIN,
  INT_VAR_DEGREE_MAX, INT_VAR_SIZE_DEGREE_MIN, INT_VAR_SIZE_DEGREE_MAX, INT_VAR_REGRET_MIN_MIN,
  INT_VAR_REGRET_MIN_MAX, INT_VAR_REGRET_MAX_MIN, INT_VAR_REGRET_MAX_MAX
}

Which variable to select for branching. More...

enum IntValBranch {
  INT_VAL_MIN, INT_VAL_MED, INT_VAL_MAX, INT_VAL_SPLIT_MIN,
  INT_VAL_SPLIT_MAX
}

Which values to select first for branching. More...

enum IntAssign { INT_ASSIGN_MIN, INT_ASSIGN_MED, INT_ASSIGN_MAX }

Which value to select for assignment. More...

enum ViewSelStatus { VSS_NONE, VSS_SELECT, VSS_COMMIT }

Status returned by member functions of view selection class. More...

enum ExecStatus {
  __ES_SUBSUMED = -2, ES_FAILED = -1, ES_NOFIX = 0, ES_OK = 0,
  ES_FIX = 1, __ES_PARTIAL = 2
}

enum PropCost {
  PC_CRAZY_LO = 0, PC_CRAZY_HI = 0, PC_CUBIC_LO = 1, PC_CUBIC_HI = 1,
  PC_QUADRATIC_LO = 2, PC_QUADRATIC_HI = 2, PC_LINEAR_HI = 3, PC_LINEAR_LO = 4,
  PC_TERNARY_HI = 5, PC_BINARY_HI = 6, PC_TERNARY_LO = 6, PC_BINARY_LO = 7,
  PC_UNARY_LO = 7, PC_UNARY_HI = 7, PC_MAX = 7
}

Classification of propagation cost. More...

enum SpaceStatus { SS_FAILED, SS_SOLVED, SS_BRANCH }

Space status More...

enum PropKind { PK_DEF, PK_SPEED, PK_MEMORY }

Propagation kind. More...

enum SetRelType {
  SRT_EQ, SRT_NQ, SRT_SUB, SRT_SUP,
  SRT_DISJ, SRT_CMPL
}

Common relation types for sets. More...

enum SetOpType { SOT_UNION, SOT_DUNION, SOT_INTER, SOT_MINUS }

Common operations for sets. More...

enum SetVarBranch {
  SET_VAR_NONE, SET_VAR_MIN_CARD, SET_VAR_MAX_CARD, SET_VAR_MIN_UNKNOWN_ELEM,
  SET_VAR_MAX_UNKNOWN_ELEM
}

Which variable to select for branching. More...

enum SetValBranch { SET_VAL_MIN, SET_VAL_MAX }

Which values to select first for branching. More...

Functions

void branch (Space *home, const CpltSetVarArgs &x, CpltSetVarBranch vars, CpltSetValBranch vals)

Branch on x with variable selection vars and value selection vals.

void exactly (Space *home, CpltSetVar x, IntSet &is, unsigned int c)

Post propagator for $|x \cap is| = c$ .

void atmost (Space *home, CpltSetVar x, IntSet &is, unsigned int c)

Post propagator for $0 \leq |x \cap is| \leq c$ .

void atmost (Space *home, CpltSetVar x, CpltSetVar y, unsigned int c)

Post propagator for $0 \leq |x \cap y| \leq c$ .

void atmostLex (Space *home, CpltSetVar x, CpltSetVar y, unsigned int c, CpltSetRelType lex)

Post propagator for $0 \leq |x \cap y| \leq c \wedge x \sim_{lex} y$ .

void atmostLexCard (Space *home, CpltSetVar x, CpltSetVar y, unsigned int c, CpltSetRelType lex, unsigned int d)

void atmostCard (Space *home, CpltSetVar x, CpltSetVar y, unsigned int c, unsigned int d)

void atmost (Space *home, CpltSetVar x, CpltSetVar y, CpltSetVar z, unsigned int c)

void atmostOne (Space *home, const SetVarArgs &x, unsigned int c)

Post propagator for $\forall 0\leq i\leq |x| : |x_i|=c$ and $\forall 0\leq i<j\leq |x| : |x_i\cap x_j|\leq 1$ .

void cardinality (Space *home, CpltSetVar x, unsigned int l, unsigned int u)

Post propagator for $l \leq |x| \leq u$ .

void cardinality (Space *home, CpltSetVar x, unsigned int c)

Post propagator for $ l |x| = c $ .

void distinct (Space *home, const CpltSetVarArgs &x)

void dom (Space *home, CpltSetVar x, SetRelType r, const IntSet &s)

Propagates $x \sim_r s$ .

void dom (Space *home, CpltSetVar x, SetRelType r, int i)

Propagates $x \sim_r \{i\}$ .

void dom (Space *home, CpltSetVar x, SetRelType r, int i, int j)

Propagates $x \sim_r \{i,\dots,j\}$ .

void partition (Space *home, const CpltSetVarArgs &x)

Post propagator for $|\bigcup_{i=0}^{n-1} x_i = U$ .

void partition (Space *home, const CpltSetVarArgs &x, const CpltSetVar &y)

Post propagator for $|\bigcup_{i=0}^{n-1} x_i = U$ .

void partitionLex (Space *home, const CpltSetVarArgs &x, CpltSetRelType lex)

Post propagator for $|\bigcup_{i=0}^{n-1} x_i = U \wedge \forall i,j\in \{0, \dots, n-1\}, i\neq j: x_i \sim_{lex} x_j$ .

void partitionLexCard (Space *home, const CpltSetVarArgs &x, CpltSetRelType lex, unsigned int c)

Post propagator for $|\bigcup_{i=0}^{n-1} x_i = U \wedge \forall i,j\in \{0, \dots, n-1\}, i\neq j: x_i \sim_{lex} x_j \wedge \forall i \in \{0, \dots, n-1\}: |x_i| = c$ .

void partitionCard (Space *home, const CpltSetVarArgs &x, unsigned int c)

Post propagator for $|\bigcup_{i=0}^{n-1} x_i = U \wedge \forall i \in \{0, \dots, n-1\}: |x_i| = c$ .

void range (Space *home, const CpltSetVarArgs &x, CpltSetVar s, CpltSetVar t)

Post propagator for $t = \bigcup_{i\subseteq s} x_i$ .

void roots (Space *home, const CpltSetVarArgs &x, CpltSetVar s, CpltSetVar t, const CpltSetVarArgs &allvars)

Post propagator for $s = \bigcup_{x_i \subseteq t} i$ .

void alldifferent (Space *home, const CpltSetVarArgs &x, CpltSetVar s, CpltSetVar t, const CpltSetVarArgs &allvars)

Post propagator for $x_i\neq x_j$ for all $0\leq i\neq j<|x| \wedge t = \bigcup_{i\subseteq s} x_i$ .

void nvalue (Space *home, const CpltSetVarArgs &x, CpltSetVar s, CpltSetVar t, unsigned int n, const CpltSetVarArgs &allvars)

Post propagator for $|\displaystyle\bigcup_{i = 0}^{|x| - 1} x_i| = n \wedge t = \bigcup_{i\subseteq s} x_i$ .

void uses (Space *home, const IntVarArgs &x, CpltSetVar s, CpltSetVar t, const CpltSetVarArgs &y, CpltSetVar u, CpltSetVar v)

Post propagator for $t = \bigcup_{i\in s} x_i \wedge v = \bigcup_{i\in u} y_i \wedge v \subseteq t$ .

void selectUnion (Space *home, const CpltSetVarArgs &x, CpltSetVar s, CpltSetVar t)

Post propagator for $t = \bigcup_{i\in s} x_i$ .

void rel (Space *home, CpltSetVar x, CpltSetRelType r, CpltSetVar y)

Post propagator for $x \sim_r y$ .

void rel (Space *home, CpltSetVar x, CpltSetOpType o, CpltSetVar y, CpltSetRelType r, CpltSetVar z)

Post propagator for $(x \diamond_{\mathit{o}} y) \sim_r z$ .

void rel (Space *home, CpltSetVar x, CpltSetOpType o, CpltSetVar y, SetRelType r, CpltSetVar z)

Post propagator for $(x \diamond_{\mathit{o}} y) \sim_r z$ .

void rel (Space *home, CpltSetVar x, SetOpType o, CpltSetVar y, CpltSetRelType r, CpltSetVar z)

Post propagator for $(x \diamond_{\mathit{o}} y) \sim_r z$ .

void rel (Space *home, CpltSetVar x, SetOpType o, CpltSetVar y, SetRelType r, CpltSetVar z)

Post propagator for $(x \diamond_{\mathit{o}} y) \sim_r z$ .

void rel (Space *home, CpltSetVar x, SetRelType r, CpltSetVar y)

Post propagator for $x \sim_r y$ .

void selectNonEmptySub (Space *home, const CpltSetVarArgs &x, CpltSetVar s, CpltSetVar t)

Post propagator for $s = \bigcup_{(x_i \subseteq t) \wedge x_i \neq \emptyset } i$ .

void singleton (Space *home, IntVar x, CpltSetVar s)

Post propagator for $s = \{x\}$ .

GECODE_CPLTSET_EXPORT void atmostLexCard (Space *home, CpltSetVar x, CpltSetVar y, int c, CpltSetRelType lex, int d)

Post propagator for $0 \leq |x \cap y| \leq c \wedge x \sim_{lex} y \wedge |x| = |y| = d$ .

GECODE_CPLTSET_EXPORT void atmostCard (Space *home, CpltSetVar x, CpltSetVar y, int c, int d)

Post propagator for $0 \leq |x \cap y| \leq c \wedge |x| = |y| = d$ .

GECODE_CPLTSET_EXPORT void atmost (Space *home, CpltSetVar x, CpltSetVar y, CpltSetVar z, int c)

Post propagator for $x \cap y = z \wedge 0 \leq |z| \leq c$ .

GECODE_CPLTSET_EXPORT void atmostOne (Space *home, const CpltSetVarArgs &x, int c)

Post propagator for $|x_i \cap x_j| \leq 1$ for all $0\leq i\neq j<|x| \wedge \forall i \in \{0, \dots, |x|-1\}: |x_i| = c$ .

void abs (Space *home, IntVar x0, IntVar x1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $ |x_0|=x_1$ .

void max (Space *home, IntVar x0, IntVar x1, IntVar x2, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\max\{x_0,x_1\}=x_2$ .

void max (Space *home, const IntVarArgs &x, IntVar y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\max x=y$ .

void min (Space *home, IntVar x0, IntVar x1, IntVar x2, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\min\{x_0,x_1\}=x_2$ .

void min (Space *home, const IntVarArgs &x, IntVar y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\min x=y$ .

void mult (Space *home, IntVar x0, IntVar x1, IntVar x2, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_0\cdot x_1=x_2$ .

void sqr (Space *home, IntVar x0, IntVar x1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_0\cdot x_0=x_1$ .

void sqrt (Space *home, IntVar x0, IntVar x1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\lfloor\sqrt{x_0}\rfloor=x_1$ .

void divmod (Space *home, IntVar x0, IntVar x1, IntVar x2, IntVar x3, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_0\mathrm{div} x_1=x_2 \land x_0\mathrm{mod} x_1 = x_3$ .

void div (Space *home, IntVar x0, IntVar x1, IntVar x2, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_0\mathrm{div} x_1=x_2$ .

void mod (Space *home, IntVar x0, IntVar x1, IntVar x2, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_0\mathrm{mod} x_1=x_2$ .

void rel (Space *home, BoolVar x0, IntRelType r, BoolVar x1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_0 \sim_r x_1$ .

void rel (Space *home, BoolVar x, IntRelType r, int n, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Propagates $x \sim_r n$ .

void rel (Space *home, BoolVar x0, IntRelType r, BoolVar x1, BoolVar b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $(x_0 \sim_r x_1)\Leftrightarrow b$ .

void rel (Space *home, BoolVar x, IntRelType r, int n, BoolVar b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Propagates $(x \sim_r n)\Leftrightarrow b$ .

void rel (Space *home, const BoolVarArgs &x, IntRelType r, BoolVar y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_i \sim_r y$ for all $0\leq i<|x|$ .

void rel (Space *home, const IntVarArgs &x, IntRelType r, int c, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Propagates $x_i \sim_r c$ for all $0\leq i<|x|$ .

void rel (Space *home, const IntVarArgs &x, IntRelType r, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for pairwise relation on x.

void rel (Space *home, const IntVarArgs &x, IntRelType r, const IntVarArgs &y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for relation between x and y.

void rel (Space *home, BoolVar x0, BoolOpType o, BoolVar x1, BoolVar x2, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for Boolean operation on x0 and x1.

void rel (Space *home, BoolVar x0, BoolOpType o, BoolVar x1, int n, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for Boolean operation on x0 and x1.

void rel (Space *home, BoolOpType o, const BoolVarArgs &x, BoolVar y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for Boolean operation on x.

void rel (Space *home, BoolOpType o, const BoolVarArgs &x, int n, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for Boolean operation on x.

void branch (Space *home, const IntVarArgs &x, IntVarBranch vars, IntValBranch vals)

Branch over x with variable selection vars and value selection vals.

void assign (Space *home, const IntVarArgs &x, IntAssign vals)

Assign all x with value selection vals.

void channel (Space *home, const IntVarArgs &x, unsigned int xoff, const IntVarArgs &y, unsigned int yoff, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_i - \mathit{xoff} = j\leftrightarrow y_j - \mathit{yoff} = i$ for all $0\leq i<|x|$ .

void channel (Space *home, const IntVarArgs &x, const IntVarArgs &y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_i = j\leftrightarrow y_j=i$ for all $0\leq i<|x|$ .

void channel (Space *home, BoolVar x0, IntVar x1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for channeling a Boolean and an integer variable $ x_0 = x_1$ .

void channel (Space *home, const BoolVarArgs &x, IntVar y, int o=0, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for channeling Boolean and integer variables $x_i = 1\leftrightarrow y=i+o$ .

void circuit (Space *home, const IntVarArgs &x, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator such that x forms a circuit.

GECODE_REGISTER1 (Int::Circuit::Dom< Int::IntView >)

GECODE_REGISTER1 (Int::Circuit::Val< Int::IntView >)

void count (Space *home, const IntVarArgs &x, int n, IntRelType r, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\sim_r m$ .

void count (Space *home, const IntVarArgs &x, IntVar y, IntRelType r, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\sim_r m$ .

void count (Space *home, const IntVarArgs &x, const IntArgs &y, IntRelType r, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\sim_r m$ .

void count (Space *home, const IntVarArgs &x, int n, IntRelType r, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\sim_r z$ .

void count (Space *home, const IntVarArgs &x, IntVar y, IntRelType r, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\sim_r z$ .

void count (Space *home, const IntVarArgs &x, const IntArgs &y, IntRelType r, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\sim_r z$ .

void cumulatives (Space *home, const IntVarArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagators for the cumulatives constraint.

void cumulatives (Space *home, const IntArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagators for the cumulatives constraint.

void cumulatives (Space *home, const IntVarArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagators for the cumulatives constraint.

void cumulatives (Space *home, const IntArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagators for the cumulatives constraint.

void cumulatives (Space *home, const IntVarArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagators for the cumulatives constraint.

void cumulatives (Space *home, const IntArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagators for the cumulatives constraint.

void cumulatives (Space *home, const IntVarArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagators for the cumulatives constraint.

void cumulatives (Space *home, const IntArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagators for the cumulatives constraint.

GECODE_REGISTER4 (Int::Cumulatives::Val< Int::ConstIntView, Int::IntView, Int::ConstIntView, Int::IntView >)

GECODE_REGISTER4 (Int::Cumulatives::Val< Int::ConstIntView, Int::IntView, Int::IntView, Int::IntView >)

GECODE_REGISTER4 (Int::Cumulatives::Val< Int::ConstIntView, Int::ConstIntView, Int::IntView, Int::IntView >)

GECODE_REGISTER4 (Int::Cumulatives::Val< Int::ConstIntView, Int::ConstIntView, Int::ConstIntView, Int::IntView >)

GECODE_REGISTER4 (Int::Cumulatives::Val< Int::IntView, Int::ConstIntView, Int::IntView, Int::IntView >)

GECODE_REGISTER4 (Int::Cumulatives::Val< Int::IntView, Int::ConstIntView, Int::ConstIntView, Int::IntView >)

GECODE_REGISTER4 (Int::Cumulatives::Val< Int::IntView, Int::IntView, Int::ConstIntView, Int::IntView >)

GECODE_REGISTER4 (Int::Cumulatives::Val< Int::IntView, Int::IntView, Int::IntView, Int::IntView >)

void distinct (Space *home, const IntVarArgs &x, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_i\neq x_j$ for all $0\leq i\neq j<|x|$ .

void distinct (Space *home, const IntArgs &n, const IntVarArgs &x, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_i+n_i\neq x_j+n_j$ for all $0\leq i\neq j<|x|$ .

void dom (Space *home, IntVar x, int l, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Propagates $l\leq x\leq m$ .

void dom (Space *home, const IntVarArgs &x, int l, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Propagates $l\leq x_i\leq m$ for all $0\leq i<|x|$ .

void dom (Space *home, IntVar x, const IntSet &s, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Propagates $x\in s$ .

void dom (Space *home, const IntVarArgs &x, const IntSet &s, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Propagates $x_i\in s$ for all $0\leq i<|x|$ .

void dom (Space *home, IntVar x, int l, int m, BoolVar b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $(l\leq x \leq m) \Leftrightarrow b$ .

void dom (Space *home, IntVar x, const IntSet &s, BoolVar b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $(x \in s) \Leftrightarrow b$ .

void element (Space *home, const IntArgs &n, IntVar x0, IntVar x1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $n_{x_0}=x_1$ .

void element (Space *home, const IntArgs &n, IntVar x0, BoolVar x1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $n_{x_0}=x_1$ .

void element (Space *home, const IntArgs &n, IntVar x0, int x1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $n_{x_0}=x_1$ .

void element (Space *home, const IntVarArgs &x, IntVar y0, IntVar y1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_{y_0}=y_1$ .

void element (Space *home, const IntVarArgs &x, IntVar y0, int y1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_{y_0}=y_1$ .

void element (Space *home, const BoolVarArgs &x, IntVar y0, BoolVar y1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_{y_0}=y_1$ .

void extensional (Space *home, const IntVarArgs &x, DFA d, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for extensional constraint described by a DFA.

void extensional (Space *home, const IntVarArgs &x, const TupleSet &t, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x\in T$ .

GECODE_REGISTER1 (Int::Extensional::LayeredGraph< Int::IntView >)

GECODE_REGISTER1 (Int::Extensional::LayeredGraph< Int::BoolView >)

GECODE_REGISTER1 (Int::Extensional::Basic< Int::IntView >)

GECODE_REGISTER1 (Int::Extensional::Incremental< Int::IntView >)

GECODE_REGISTER1 (Int::Extensional::Basic< Int::BoolView >)

GECODE_REGISTER1 (Int::Extensional::Incremental< Int::BoolView >)

void count (Space *home, const IntVarArgs &x, const IntVarArgs &c, const IntArgs &v, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Posts a global count (cardinality) constraint.

void count (Space *home, const IntVarArgs &x, const IntVarArgs &c, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Posts a global count (cardinality) constraint.

void count (Space *home, const IntVarArgs &x, const IntSetArgs &c, const IntArgs &v, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Posts a global count (cardinality) constraint.

void count (Space *home, const IntVarArgs &x, const IntSetArgs &c, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Posts a global count (cardinality) constraint.

void count (Space *home, const IntVarArgs &x, const IntSet &c, const IntArgs &v, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Posts a global count (cardinality) constraint.

GECODE_REGISTER3 (Int::GCC::Dom< Gecode::Int::IntView, Gecode::Int::GCC::OccurBndsView, false >)

GECODE_REGISTER3 (Int::GCC::Dom< Gecode::Int::IntView, Gecode::Int::GCC::CardView, true >)

GECODE_REGISTER3 (Int::GCC::Val< Gecode::Int::IntView, Gecode::Int::GCC::OccurBndsView, false >)

GECODE_REGISTER3 (Int::GCC::Val< Gecode::Int::IntView, Gecode::Int::GCC::CardView, true >)

GECODE_REGISTER4 (Int::GCC::BndImp< Gecode::Int::IntView, Gecode::Int::GCC::OccurBndsView, false, false >)

GECODE_REGISTER4 (Int::GCC::BndImp< Gecode::Int::IntView, Gecode::Int::GCC::OccurBndsView, false, true >)

GECODE_REGISTER4 (Int::GCC::BndImp< Gecode::Int::IntView, Gecode::Int::GCC::CardView, true, false >)

GECODE_REGISTER4 (Int::GCC::BndImp< Gecode::Int::IntView, Gecode::Int::GCC::CardView, true, true >)

void linear (Space *home, const IntVarArgs &x, IntRelType r, int c, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_r c$ .

void linear (Space *home, const IntVarArgs &x, IntRelType r, IntVar y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_r y$ .

void linear (Space *home, const IntArgs &a, const IntVarArgs &x, IntRelType r, int c, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_r c$ .

void linear (Space *home, const IntArgs &a, const IntVarArgs &x, IntRelType r, IntVar y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_r y$ .

void linear (Space *home, const IntVarArgs &x, IntRelType r, int c, BoolVar b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_r c\right)\Leftrightarrow b$ .

void linear (Space *home, const IntVarArgs &x, IntRelType r, IntVar y, BoolVar b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_r y\right)\Leftrightarrow b$ .

void linear (Space *home, const IntArgs &a, const IntVarArgs &x, IntRelType r, int c, BoolVar b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_r c\right)\Leftrightarrow b$ .

void linear (Space *home, const IntArgs &a, const IntVarArgs &x, IntRelType r, IntVar y, BoolVar b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_r y\right)\Leftrightarrow b$ .

void rel (Space *home, IntVar x, IntRelType r, int c, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Propagates $x \sim_r c$ .

void rel (Space *home, IntVar x0, IntRelType r, IntVar x1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $x_0 \sim_r x_1$ .

void rel (Space *home, const IntVarArgs &x, IntRelType r, IntVar y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagators for $x_i \sim_r y$ for all $0\leq i<|x|$ .

void rel (Space *home, IntVar x0, IntRelType r, IntVar x1, BoolVar b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $(x_0 \sim_r x_1)\Leftrightarrow b$ .

void rel (Space *home, IntVar x, IntRelType r, int c, BoolVar b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $(x \sim_r c)\Leftrightarrow b$ .

void sorted (Space *, const IntVarArgs &x, const IntVarArgs &y, const IntVarArgs &z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator that y is x sorted in increasing order.

void sorted (Space *home, const IntVarArgs &x, const IntVarArgs &y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator that y is x sorted in increasing order.

GECODE_REGISTER2 (Int::Sorted::Sorted< Int::IntView, true >)

GECODE_REGISTER2 (Int::Sorted::Sorted< Int::IntView, false >)

void unshare (Space *home, IntVarArgs &x, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Replace multiple variable occurences in x by fresh variables.

bool same (const Int::NegBoolView &x, const Int::NegBoolView &y)

bool before (const Int::NegBoolView &x, const Int::NegBoolView &y)

bool same (const Int::ConstIntView &x, const Int::ConstIntView &y)

bool before (const Int::ConstIntView &x, const Int::ConstIntView &y)

bool same (const Int::MinusView &x, const Int::MinusView &y)

bool before (const Int::MinusView &x, const Int::MinusView &y)

bool same (const Int::OffsetView &x, const Int::OffsetView &y)

bool before (const Int::OffsetView &x, const Int::OffsetView &y)

template<class Val, class UnsVal>

bool same (const Int::ScaleView< Val, UnsVal > &x, const Int::ScaleView< Val, UnsVal > &y)

template<class Val, class UnsVal>

bool before (const Int::ScaleView< Val, UnsVal > &x, const Int::ScaleView< Val, UnsVal > &y)

bool same (const Int::ZeroIntView &, const Int::ZeroIntView &)

bool before (const Int::ZeroIntView &, const Int::ZeroIntView &)

void channel (Space *home, IntVar x0, BoolVar x1, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for channeling an integer and a Boolean variable $ x_0 = x_1$ .

template<class View>

bool __before (const View &x, const View &y)

template<class View>

bool __same (const View &x, const View &y)

template<class View>

bool __shared (const View &x, const View &y)

ExecStatus ES_SUBSUMED (Propagator *p, size_t s)

Propagator p is subsumed

ExecStatus ES_SUBSUMED (Propagator *p, Space *home)

Propagator p is subsumed

ExecStatus ES_FIX_PARTIAL (Propagator *p, ModEventDelta med)

Propagator p has computed partial fixpoint

ExecStatus ES_NOFIX_PARTIAL (Propagator *p, ModEventDelta med)

Propagator p has not computed partial fixpoint

template<class A>

ExecStatus ES_SUBSUMED_FIX (A *a, Space *home, Council< A > &c)

Advisor a is subsumed

template<class A>

ExecStatus ES_SUBSUMED_NOFIX (A *a, Space *home, Council< A > &c)

Advisor a is subsumed

bool me_failed (ModEvent me)

Check whether modification event me is failed.

bool me_modified (ModEvent me)

Check whether modification event me describes variable modification.

PropCost cost_lo (int n, PropCost pc)

Dynamic low-propagation cost computation.

PropCost cost_hi (int n, PropCost pc)

Dynamic high-propagation cost computation.

template<class VarImp>

bool same (const VarBase< VarImp > &x, const VarBase< VarImp > &y)

template<class VarImp>

bool before (const VarBase< VarImp > &x, const VarBase< VarImp > &y)

bool shared (const ConstViewBase &, const ConstViewBase &)

Test whether views share same variable.

template<class VarImp>

bool shared (const VarViewBase< VarImp > &, const ConstViewBase &)

Test whether views share same variable.

template<class ViewA>

bool shared (const DerivedViewBase< ViewA > &, const ConstViewBase &)

Test whether views share same variable.

template<class VarImp>

bool shared (const ConstViewBase &, const VarViewBase< VarImp > &)

Test whether views share same variable.

template<class ViewA>

bool shared (const ConstViewBase &, const DerivedViewBase< ViewA > &)

Test whether views share same variable.

template<class VarImpA, class VarImpB>

bool shared (const VarViewBase< VarImpA > &, const VarViewBase< VarImpB > &)

Test whether views share same variable.

template<class VarImpA, class ViewB>

bool shared (const VarViewBase< VarImpA > &, const DerivedViewBase< ViewB > &)

Test whether views share same variable.

template<class ViewA, class VarImpB>

bool shared (const DerivedViewBase< ViewA > &, const VarViewBase< VarImpB > &)

Test whether views share same variable.

template<class ViewA, class ViewB>

bool shared (const DerivedViewBase< ViewA > &, const DerivedViewBase< ViewB > &)

Test whether views share same variable.

template<class VarImp>

bool same (const VarViewBase< VarImp > &x, const VarViewBase< VarImp > &y)

template<class VarImp>

bool before (const VarViewBase< VarImp > &x, const VarViewBase< VarImp > &y)

template<class View>

bool shared (const DerivedViewBase< View > &, const ConstViewBase &)

template<class View>

bool shared (const ConstViewBase &, const DerivedViewBase< View > &)

IntVar abs (Space *home, IntVar x, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Return variable constrained to $|x|$ .

IntVar min (Space *home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Return variable constrained to $\min(x,y)$ .

IntVar min (Space *home, const IntVarArgs &x, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Return variable constrained to $\min(x)$ .

IntVar max (Space *home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Return variable constrained to $\max(x,y)$ .

IntVar max (Space *home, const IntVarArgs &x, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Return variable constrained to $\max(x)$ .

IntVar mult (Space *home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Return variable constrained to $x\cdot y$ .

IntVar sqr (Space *home, IntVar x, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Return variable constrained to $x^2$ .

IntVar sqrt (Space *home, IntVar x, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Return variable constrained to $\lfloor\sqrt{x}\rfloor$ .

IntVar plus (Space *home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Return variable constrained to $x+y$ .

IntVar minus (Space *home, IntVar x, IntVar y, IntConLevel icl, PropKind pk)

MiniModel::BoolExpr eqv (const MiniModel::BoolExpr &, const MiniModel::BoolExpr &)

Equivalence of Boolean expressions.

MiniModel::BoolExpr imp (const MiniModel::BoolExpr &, const MiniModel::BoolExpr &)

Implication of Boolean expressions.

BoolVar post (Space *home, const MiniModel::BoolExpr &e, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post Boolean expression and return its value.

BoolVar post (Space *home, const BoolVar &b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post Boolean expression (special case for variable) and return its value.

MiniModel::BoolRel tt (const MiniModel::BoolExpr &)

State that Boolean expression must be true.

MiniModel::BoolRel ff (const MiniModel::BoolExpr &)

State that Boolean expression must be false.

void post (Space *home, const MiniModel::BoolRel &r, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post Boolean relation.

IntVar post (Space *home, const IntVar &x, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post linear expression (special case for integer variable) and return its value.

IntVar post (Space *home, int n, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post linear expression (special case for constant) and return its value.

template<class Var>

IntVar post (Space *home, const MiniModel::LinExpr< Var > &e, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post linear expression and return its value.

template<class Var>

void post (Space *home, const MiniModel::LinRel< Var > &r, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post linear relation.

void post (Space *home, bool r, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Make it work for special integer only-case.

BoolVar channel (Space *home, IntVar x, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Return Boolean variable equal to $x$ .

IntVar channel (Space *home, BoolVar b, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Return integer variable equal to $b$ .

void atmost (Space *home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\leq m$ .

void atmost (Space *home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\leq m$ .

void atmost (Space *home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\leq m$ .

void atmost (Space *home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\leq z$ .

void atmost (Space *home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\leq z$ .

void atmost (Space *home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\leq z$ .

void atleast (Space *home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\geq m$ .

void atleast (Space *home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\geq m$ .

void atleast (Space *home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\geq m$ .

void atleast (Space *home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\geq z$ .

void atleast (Space *home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\geq z$ .

void atleast (Space *home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\geq z$ .

void exactly (Space *home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}=m$ .

void exactly (Space *home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}=m$ .

void exactly (Space *home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}=m$ .

void exactly (Space *home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}=z$ .

void exactly (Space *home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}=z$ .

void exactly (Space *home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}=z$ .

void lex (Space *home, const IntVarArgs &x, IntRelType r, const IntVarArgs &y, IntConLevel icl=ICL_DEF, PropKind pk=PK_DEF)

Post propagator for lexical order between x and y.

template<class T>

T * bab (T *s, const Search::Options &o=Search::Options::def)

Perform depth-first branch-and-bound search for subclass T of space s and options o.

template<class T>

T * dfs (T *s, const Search::Options &o=Search::Options::def)

Invoke depth-first search engine for subclass T of space s with options o.

template<class T>

T * lds (T *s, unsigned int d, const Search::Options &o=Search::Options::def)

Invoke limited-discrepancy search for s as root node and maximal discrepancy d.

template<class T>

T * restart (T *s, const Search::Options &o=Search::Options::def)

Perform depth-first restart best solution search for subclass T of space s and options o.

void emitFlatzinc (Space *home, std::ostream &os)

Produce FlatZinc-like representation of home
A FlatZinc-like representation of the space home is written to os, respecting the variable names established by m.

void emitVarMap (std::ostream &os, int &varCount, Reflection::VarMapIter &vmi, Reflection::VarMap &vm)

void emitJavaScript (Space *home, std::ostream &os)

Produce JavaScript representation of home
A JavaScript representation of the space home is written to os, respecting the variable names established by m.

void branch (Space *home, const SetVarArgs &x, SetVarBranch vars, SetValBranch vals)

Branch over x with variable selection vars and value selection vals.

void cardinality (Space *home, SetVar x, unsigned int i, unsigned int j)

Propagates $i \leq |s| \leq j$ .

void cardinality (Space *home, SetVar s, IntVar x)

Post propagator for $ |s|=x $ .

void convex (Space *home, SetVar x)

Post propagator that propagates that x is convex.

void convexHull (Space *home, SetVar x, SetVar y)

Post propagator that propagates that y is the convex hull of x.

void dom (Space *home, SetVar x, SetRelType r, int i)

Propagates $x \sim_r \{i\}$ .

void dom (Space *home, SetVar x, SetRelType r, int i, int j)

Propagates $x \sim_r \{i,\dots,j\}$ .

void dom (Space *home, SetVar x, SetRelType r, const IntSet &s)

Propagates $x \sim_r s$ .

void dom (Space *home, SetVar x, SetRelType r, int i, BoolVar b)

Post propagator for $(x \sim_r \{i\}) \Leftrightarrow b$ .

void dom (Space *home, SetVar x, SetRelType r, int i, int j, BoolVar b)

Post propagator for $(x \sim_r \{i,\dots,j\}) \Leftrightarrow b$ .

void dom (Space *home, SetVar x, SetRelType r, const IntSet &s, BoolVar b)

Post propagator for $(x \sim_r s) \Leftrightarrow b$ .

void elementsUnion (Space *home, const SetVarArgs &x, SetVar y, SetVar z)

Post propagator for $z=\bigcup\langle x_0,\dots,x_{n-1}\rangle[y]$ .

void elementsUnion (Space *home, const IntSetArgs &s, SetVar y, SetVar z)

Post propagator for $z=\bigcup\langle s_0,\dots,s_{n-1}\rangle[y]$ .

void elementsInter (Space *home, const SetVarArgs &x, SetVar y, SetVar z)

Post propagator for $z=\bigcap\langle x_0,\dots,x_{n-1}\rangle[y]$ using $\mathcal{U}$ as universe.

void elementsInter (Space *home, const SetVarArgs &x, SetVar y, SetVar z, const IntSet &u)

Post propagator for $z=\bigcap\langle x_0,\dots,x_{n-1}\rangle[y]$ using u as universe.

void elementsDisjoint (Space *home, const SetVarArgs &x, SetVar y)

Post propagator for $\parallel\langle x_0,\dots,x_{n-1}\rangle[y]$ .

void element (Space *home, const SetVarArgs &x, IntVar y, SetVar z)

Post propagator for $z=\langle x_0,\dots,x_{n-1}\rangle[y]$ .

void element (Space *home, const IntSetArgs &s, IntVar y, SetVar z)

Post propagator for $z=\langle s_0,\dots,s_{n-1}\rangle[y]$ .

void rel (Space *home, SetVar s, IntRelType r, IntVar x)

Post propagator for $|s|\geq 1 \land \forall i\in s:\ i \sim_r x$ .

void rel (Space *home, IntVar x, IntRelType r, SetVar s)

Post propagator for $|s|\geq 1 \land \forall i\in s:\ x \sim_r i$ .

void min (Space *home, SetVar s, IntVar x)

Post propagator that propagates that x is the minimal element of s, and that s is not empty.

void max (Space *home, SetVar s, IntVar x)

Post propagator that propagates that x is the maximal element of s, and that s is not empty.

void match (Space *home, SetVar s, const IntVarArgs &x)

Post propagator that propagates that s contains the $x_i$ , which are sorted in non-descending order.

void channel (Space *home, const IntVarArgs &x, const SetVarArgs &y)

Post propagator for $x_i=j \Leftrightarrow i\in y_j$ .

void channel (Space *home, const BoolVarArgs &x, SetVar y)

Post propagator for $x_i=1 \Leftrightarrow i\in y$ .

void weights (Space *home, const IntArgs &elements, const IntArgs &weights, SetVar x, IntVar y)

Post propagator for $y = \mathrm{weight}(x)$ .

std::ostream & operator<< (std::ostream &os, const ProjectorCompiler::Indent &indent)

void codeScope (Support::DynamicArray< int > &s, const SetExprCode &c, bool monotone)

Iter::Ranges::Virt::Iterator * codeToIterator (const ViewArray< Set::SetView > &x, const SetExprCode &c, bool monotone)

template<class View0, class View1>

bool viewarrayshared (const ViewArray< View0 > &va, const View1 &y)

template<>

bool viewarrayshared< Set::SingletonView, Set::SetView > (const ViewArray< Set::SingletonView > &, const Set::SetView &)

void rel (Space *home, const IntSet &x, SetOpType op, SetVar y, SetRelType r, SetVar z)

Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .

void rel (Space *home, SetVar x, SetOpType op, const IntSet &y, SetRelType r, SetVar z)

Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .

void rel (Space *home, SetVar x, SetOpType op, SetVar y, SetRelType r, const IntSet &z)

Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .

void rel (Space *home, const IntSet &x, SetOpType op, SetVar y, SetRelType r, const IntSet &z)

Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .

void rel (Space *home, SetVar x, SetOpType op, const IntSet &y, SetRelType r, const IntSet &z)

Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .

void rel (Space *home, SetVar x, SetOpType op, SetVar y, SetRelType r, SetVar z)

Post propagator for $(x \diamond_{\mathit{op}} y) \sim_r z$ .

void rel (Space *home, SetOpType op, const SetVarArgs &x, SetVar y)

Post propagator for $y = \diamond_{\mathit{op}} x$ .

void rel (Space *home, SetOpType op, const SetVarArgs &x, const IntSet &z, SetVar y)

Post propagator for $y = \diamond_{\mathit{op}} x \diamond_{\mathit{op}} z$ .

template<class View0, class View1>

void rel_post (Space *home, View0 x0, SetRelType r, View1 x1)

template<class View0, class View1>

void rel_re (Space *home, View0 x, SetRelType r, View1 y, BoolVar b)

void rel (Space *home, SetVar x, SetRelType r, SetVar y)

Post propagator for $x \sim_r y$ .

void rel (Space *home, SetVar s, SetRelType r, IntVar x)

Post propagator for $s \sim_r \{x\}$ .

void rel (Space *home, IntVar x, SetRelType r, SetVar s)

Post propagator for $\{x\} \sim_r s$ .

void rel (Space *home, SetVar x, SetRelType r, SetVar y, BoolVar b)

Post propagator for $(x \sim_r y) \Leftrightarrow b$ .

void rel (Space *home, SetVar s, SetRelType r, IntVar x, BoolVar b)

Post propagator for $(s \sim_r \{x\}) \Leftrightarrow b$ .

void rel (Space *home, IntVar x, SetRelType r, SetVar s, BoolVar b)

Post propagator for $(\{x\} \sim_r s) \Leftrightarrow b$ .

void sequence (Space *home, const SetVarArgs &x)

Post propagator for $\forall 0\leq i< |x|-1 : \max(x_i)<\min(x_{i+1})$ .

void sequentialUnion (Space *home, const SetVarArgs &y, SetVar x)

Post propagator for $\forall 0\leq i< |x|-1 : \max(x_i)<\min(x_{i+1})$ and $x = \bigcup_{i\in\{0,\dots,n-1\}} y_i$ .

template<class View>

bool same (const Set::ComplementView< View > &x, const Set::ComplementView< View > &y)

template<class View>

bool before (const Set::ComplementView< View > &x, const Set::ComplementView< View > &y)

template<class View>

bool same (const Set::ComplementView< Set::ComplementView< View > > &x, const Set::ComplementView< Set::ComplementView< View > > &y)

template<class View>

bool before (const Set::ComplementView< Set::ComplementView< View > > &x, const Set::ComplementView< Set::ComplementView< View > > &y)

bool same (const Set::ConstantView &x, const Set::ConstantView &y)

bool before (const Set::ConstantView &x, const Set::ConstantView &y)

bool same (const Set::EmptyView &, const Set::EmptyView &)

bool before (const Set::EmptyView &, const Set::EmptyView &)

bool same (const Set::UniverseView &, const Set::UniverseView &)

bool before (const Set::UniverseView &, const Set::UniverseView &)

template<class View>

bool same (const Set::OffsetSetView< View > &x, const Set::OffsetSetView< View > &y)

template<class View>

bool before (const Set::OffsetSetView< View > &x, const Set::OffsetSetView< View > &y)

bool same (const Set::SingletonView &x, const Set::SingletonView &y)

bool before (const Set::SingletonView &x, const Set::SingletonView &y)

Variables

const ModEvent ME_GEN_FAILED = -1

Generic modification event: failed variable.

const ModEvent ME_GEN_NONE = 0

Generic modification event: no modification.

const ModEvent ME_GEN_ASSIGNED = 1

Generic modification event: variable is assigned a value.

const PropCond PC_GEN_NONE = -1

Propagation condition to be ignored (convenience).

const PropCond PC_GEN_ASSIGNED = 0

Propagation condition for an assigned variable.

Enumeration Type Documentation

enum Gecode::ExecStatus

Enumerator:

__ES_SUBSUMED	Internal: propagator is subsumed, do not use.
ES_FAILED	Execution has resulted in failure.
ES_NOFIX	Propagation has not computed fixpoint.
ES_OK	Execution is okay.
ES_FIX	Propagation has computed fixpoint.
__ES_PARTIAL	Internal: propagator has computed partial fixpoint, do not use.

Definition at line 476 of file core.icc.

Function Documentation

void Gecode::atmostLexCard	(	Space *	home,
		CpltSetVar	x,
		CpltSetVar	y,
		unsigned int	c,
		CpltSetRelType	lex,
		unsigned int	d
	)

Definition at line 441 of file atmost.cc.

void Gecode::atmostCard	(	Space *	home,
		CpltSetVar	x,
		CpltSetVar	y,
		unsigned int	c,
		unsigned int	d
	)

Definition at line 449 of file atmost.cc.

void Gecode::atmost	(	Space *	home,
		CpltSetVar	x,
		CpltSetVar	y,
		CpltSetVar	z,
		unsigned int	c
	)

Definition at line 457 of file atmost.cc.

void Gecode::distinct	(	Space *	home,
		const CpltSetVarArgs &	x
	)

Definition at line 75 of file distinct.cc.

Gecode::GECODE_REGISTER1 ( Int::Circuit::Dom< Int::IntView > )

Gecode::GECODE_REGISTER1 ( Int::Circuit::Val< Int::IntView > )

Gecode::GECODE_REGISTER4 ( Int::Cumulatives::Val< Int::ConstIntView, Int::IntView, Int::ConstIntView, Int::IntView > )

Gecode::GECODE_REGISTER4 ( Int::Cumulatives::Val< Int::ConstIntView, Int::IntView, Int::IntView, Int::IntView > )

Gecode::GECODE_REGISTER4 ( Int::Cumulatives::Val< Int::ConstIntView, Int::ConstIntView, Int::IntView, Int::IntView > )

Gecode::GECODE_REGISTER4 ( Int::Cumulatives::Val< Int::ConstIntView, Int::ConstIntView, Int::ConstIntView, Int::IntView > )

Gecode::GECODE_REGISTER4 ( Int::Cumulatives::Val< Int::IntView, Int::ConstIntView, Int::IntView, Int::IntView > )

Gecode::GECODE_REGISTER4 ( Int::Cumulatives::Val< Int::IntView, Int::ConstIntView, Int::ConstIntView, Int::IntView > )

Gecode::GECODE_REGISTER4 ( Int::Cumulatives::Val< Int::IntView, Int::IntView, Int::ConstIntView, Int::IntView > )

Gecode::GECODE_REGISTER4 ( Int::Cumulatives::Val< Int::IntView, Int::IntView, Int::IntView, Int::IntView > )

Gecode::GECODE_REGISTER1 ( Int::Extensional::LayeredGraph< Int::IntView > )

Gecode::GECODE_REGISTER1 ( Int::Extensional::LayeredGraph< Int::BoolView > )

Gecode::GECODE_REGISTER1 ( Int::Extensional::Basic< Int::IntView > )

Gecode::GECODE_REGISTER1 ( Int::Extensional::Incremental< Int::IntView > )

Gecode::GECODE_REGISTER1 ( Int::Extensional::Basic< Int::BoolView > )

Gecode::GECODE_REGISTER1 ( Int::Extensional::Incremental< Int::BoolView > )

Gecode::GECODE_REGISTER3 ( Int::GCC::Dom< Gecode::Int::IntView, Gecode::Int::GCC::OccurBndsView, false > )

Gecode::GECODE_REGISTER3 ( Int::GCC::Dom< Gecode::Int::IntView, Gecode::Int::GCC::CardView, true > )

Gecode::GECODE_REGISTER3 ( Int::GCC::Val< Gecode::Int::IntView, Gecode::Int::GCC::OccurBndsView, false > )

Gecode::GECODE_REGISTER3 ( Int::GCC::Val< Gecode::Int::IntView, Gecode::Int::GCC::CardView, true > )

Gecode::GECODE_REGISTER4 ( Int::GCC::BndImp< Gecode::Int::IntView, Gecode::Int::GCC::OccurBndsView, false, false > )

Gecode::GECODE_REGISTER4 ( Int::GCC::BndImp< Gecode::Int::IntView, Gecode::Int::GCC::OccurBndsView, false, true > )

Gecode::GECODE_REGISTER4 ( Int::GCC::BndImp< Gecode::Int::IntView, Gecode::Int::GCC::CardView, true, false > )

Gecode::GECODE_REGISTER4 ( Int::GCC::BndImp< Gecode::Int::IntView, Gecode::Int::GCC::CardView, true, true > )

Gecode::GECODE_REGISTER2 ( Int::Sorted::Sorted< Int::IntView, true > )

Gecode::GECODE_REGISTER2 ( Int::Sorted::Sorted< Int::IntView, false > )

bool Gecode::same	(	const Int::NegBoolView &	x,
		const Int::NegBoolView &	y
	)			`[related]`

Definition at line 562 of file bool.icc.

bool Gecode::before	(	const Int::NegBoolView &	x,
		const Int::NegBoolView &	y
	)			`[related]`

Definition at line 566 of file bool.icc.

bool Gecode::same	(	const Int::ConstIntView &	x,
		const Int::ConstIntView &	y
	)			`[related]`

Definition at line 381 of file constint.icc.

bool Gecode::before	(	const Int::ConstIntView &	x,
		const Int::ConstIntView &	y
	)			`[related]`

Definition at line 385 of file constint.icc.

bool Gecode::same	(	const Int::MinusView &	x,
		const Int::MinusView &	y
	)			`[related]`

Definition at line 361 of file minus.icc.

bool Gecode::before	(	const Int::MinusView &	x,
		const Int::MinusView &	y
	)			`[related]`

Definition at line 365 of file minus.icc.

bool Gecode::same	(	const Int::OffsetView &	x,
		const Int::OffsetView &	y
	)			`[related]`

Definition at line 350 of file offset.icc.

bool Gecode::before	(	const Int::OffsetView &	x,
		const Int::OffsetView &	y
	)			`[related]`

Definition at line 354 of file offset.icc.

template<class Val, class UnsVal>

bool Gecode::same	(	const Int::ScaleView< Val, UnsVal > &	x,
		const Int::ScaleView< Val, UnsVal > &	y
	)			`[related]`

Definition at line 441 of file scale.icc.

template<class Val, class UnsVal>

bool Gecode::before	(	const Int::ScaleView< Val, UnsVal > &	x,
		const Int::ScaleView< Val, UnsVal > &	y
	)			`[related]`

Definition at line 447 of file scale.icc.

bool Gecode::same	(	const Int::ZeroIntView &	,
		const Int::ZeroIntView &
	)			`[related]`

Definition at line 373 of file zero.icc.

bool Gecode::before	(	const Int::ZeroIntView &	,
		const Int::ZeroIntView &
	)			`[related]`

Definition at line 377 of file zero.icc.

template<class View>

bool Gecode::__before	(	const View &	x,
		const View &	y
	)			`[inline]`

Definition at line 870 of file array.icc.

template<class View>

bool Gecode::__same	(	const View &	x,
		const View &	y
	)			`[inline]`

Definition at line 889 of file array.icc.

template<class View>

bool Gecode::__shared	(	const View &	x,
		const View &	y
	)			`[inline]`

Definition at line 894 of file array.icc.

template<class VarImp>

bool Gecode::same	(	const VarBase< VarImp > &	x,
		const VarBase< VarImp > &	y
	)			`[related]`

Definition at line 103 of file var.icc.

template<class VarImp>

bool Gecode::before	(	const VarBase< VarImp > &	x,
		const VarBase< VarImp > &	y
	)			`[related]`

Definition at line 108 of file var.icc.

template<class VarImp>

bool Gecode::same	(	const VarViewBase< VarImp > &	x,
		const VarViewBase< VarImp > &	y
	)			`[related]`

Definition at line 301 of file view.icc.

template<class VarImp>

bool Gecode::before	(	const VarViewBase< VarImp > &	x,
		const VarViewBase< VarImp > &	y
	)			`[related]`

Definition at line 306 of file view.icc.

template<class View>

bool Gecode::shared	(	const DerivedViewBase< View > &	,
		const ConstViewBase &
	)			`[inline]`

Definition at line 367 of file view.icc.

template<class View>

bool Gecode::shared	(	const ConstViewBase &	,
		const DerivedViewBase< View > &
	)			`[inline]`

Definition at line 379 of file view.icc.

MiniModel::BoolExpr Gecode::eqv	(	const MiniModel::BoolExpr &	l,
		const MiniModel::BoolExpr &	r
	)			`[inline]`

Equivalence of Boolean expressions.

Definition at line 101 of file bool-expr.icc.

MiniModel::BoolExpr Gecode::imp	(	const MiniModel::BoolExpr &	l,
		const MiniModel::BoolExpr &	r
	)			`[inline]`

Implication of Boolean expressions.

Definition at line 109 of file bool-expr.icc.

MiniModel::BoolRel Gecode::tt ( const MiniModel::BoolExpr & e ) [inline]

State that Boolean expression must be true.

Definition at line 62 of file bool-rel.icc.

MiniModel::BoolRel Gecode::ff ( const MiniModel::BoolExpr & e ) [inline]

State that Boolean expression must be false.

Definition at line 66 of file bool-rel.icc.

template<class T>

T * Gecode::dfs	(	T *	s,
		const Search::Options &	o
	)			`[inline]`

Invoke depth-first search engine for subclass T of space s with options o.

Definition at line 162 of file dfs.icc.

void Gecode::emitVarMap	(	std::ostream &	os,
		int &	varCount,
		Reflection::VarMapIter &	vmi,
		Reflection::VarMap &	vm
	)

Definition at line 119 of file javascript.cc.

std::ostream& Gecode::operator<<	(	std::ostream &	os,
		const ProjectorCompiler::Indent &	indent
	)

Definition at line 54 of file compiler.cc.

void Gecode::codeScope	(	Support::DynamicArray< int > &	s,
		const SetExprCode &	c,
		bool	monotone
	)

Definition at line 47 of file projector.cc.

Iter::Ranges::Virt::Iterator* Gecode::codeToIterator	(	const ViewArray< Set::SetView > &	x,
		const SetExprCode &	c,
		bool	monotone
	)

Definition at line 237 of file set-expr.cc.

template<class View0, class View1>

bool Gecode::viewarrayshared	(	const ViewArray< View0 > &	va,
		const View1 &	y
	)			`[inline]`

Definition at line 51 of file common.icc.

template<>

bool Gecode::viewarrayshared< Set::SingletonView, Set::SetView >	(	const ViewArray< Set::SingletonView > &	,
		const Set::SetView &
	)			`[inline]`

template<class View0, class View1>

void Gecode::rel_post	(	Space *	home,
		View0	x0,
		SetRelType	r,
		View1	x1
	)			`[inline]`

Definition at line 52 of file rel.cc.

template<class View0, class View1>

void Gecode::rel_re	(	Space *	home,
		View0	x,
		SetRelType	r,
		View1	y,
		BoolVar	b
	)			`[inline]`

Definition at line 99 of file rel.cc.

template<class View>

bool Gecode::same	(	const Set::ComplementView< View > &	x,
		const Set::ComplementView< View > &	y
	)			`[related]`

Definition at line 582 of file complement.icc.

template<class View>

bool Gecode::before	(	const Set::ComplementView< View > &	x,
		const Set::ComplementView< View > &	y
	)			`[related]`

Definition at line 588 of file complement.icc.

template<class View>

bool Gecode::same	(	const Set::ComplementView< Set::ComplementView< View > > &	x,
		const Set::ComplementView< Set::ComplementView< View > > &	y
	)			`[inline]`

Definition at line 594 of file complement.icc.

template<class View>

bool Gecode::before	(	const Set::ComplementView< Set::ComplementView< View > > &	x,
		const Set::ComplementView< Set::ComplementView< View > > &	y
	)			`[inline]`

Definition at line 600 of file complement.icc.

bool Gecode::same	(	const Set::ConstantView &	x,
		const Set::ConstantView &	y
	)			`[inline]`

Definition at line 863 of file const.icc.

bool Gecode::before	(	const Set::ConstantView &	x,
		const Set::ConstantView &	y
	)			`[inline]`

Definition at line 873 of file const.icc.

bool Gecode::same	(	const Set::EmptyView &	,
		const Set::EmptyView &
	)			`[related]`

Definition at line 887 of file const.icc.

bool Gecode::before	(	const Set::EmptyView &	,
		const Set::EmptyView &
	)			`[related]`

Definition at line 891 of file const.icc.

bool Gecode::same	(	const Set::UniverseView &	,
		const Set::UniverseView &
	)			`[related]`

Definition at line 896 of file const.icc.

bool Gecode::before	(	const Set::UniverseView &	,
		const Set::UniverseView &
	)			`[related]`

Definition at line 900 of file const.icc.

template<class View>

bool Gecode::same	(	const Set::OffsetSetView< View > &	x,
		const Set::OffsetSetView< View > &	y
	)			`[related]`

Definition at line 477 of file offset.icc.

template<class View>

bool Gecode::before	(	const Set::OffsetSetView< View > &	x,
		const Set::OffsetSetView< View > &	y
	)			`[related]`

Definition at line 483 of file offset.icc.

bool Gecode::same	(	const Set::SingletonView &	x,
		const Set::SingletonView &	y
	)			`[related]`

Definition at line 426 of file singleton.icc.

bool Gecode::before	(	const Set::SingletonView &	x,
		const Set::SingletonView &	y
	)			`[related]`

Definition at line 430 of file singleton.icc.

Gecode Namespace Reference [Boolean expressions and relations, Matrix interface for arrays]

Detailed Description

Classes

Namespaces

Posting projection propagators

Typedefs

Enumerations

Functions

Variables

Enumeration Type Documentation

Function Documentation

Gecode Namespace Reference
[Boolean expressions and relations, Matrix interface for arrays]