diff --git a/packages/gecode/CMakeLists.txt b/packages/gecode/CMakeLists.txt index a35a1a0f5..d2514331b 100644 --- a/packages/gecode/CMakeLists.txt +++ b/packages/gecode/CMakeLists.txt @@ -40,7 +40,8 @@ if (GECODE_FOUND) target_link_libraries(gecode_yap libYap ${GECODE_LIBRARIES}) - set_target_properties (gecode_yap PROPERTIES PREFIX "") + set_target_properties (gecode_yap PROPERTIES PREFIX "" CXX_STANDARD 11) + include_directories (${GECODE_INCLUDE_DIR} ${CMAKE_CURRENT_SOURCE_DIR} ${CMAKE_CURRENT_SOURCE_DIR}/${GECODE_VERSION}) diff --git a/packages/gecode/dev/code-generator.py b/packages/gecode/dev/code-generator.py index 2f67ba7d3..7b9de151b 100755 --- a/packages/gecode/dev/code-generator.py +++ b/packages/gecode/dev/code-generator.py @@ -196,6 +196,7 @@ class PredGenerator(DeclsLoader): "TieBreak", "TieBreak", "TieBreak", + "TieBreak", "TieBreakVarBranchOptions", "TieBreakVarBranch") diff --git a/packages/gecode/dev/extractor/Makefile b/packages/gecode/dev/extractor/Makefile index 7d3be9f0d..7f97fcd6c 100644 --- a/packages/gecode/dev/extractor/Makefile +++ b/packages/gecode/dev/extractor/Makefile @@ -2,7 +2,7 @@ GECODEDIR := $(shell g++ $(CPPFLAGS) $(CXXFLAGS) -H -E gecodedir.hh 2>&1 >/dev/n GECODEDIR=/usr/local/opt/gecode GECODECONFIG := $(GECODEDIR)/support/config.hpp GECODEVERSION := $(shell cat $(GECODECONFIG) | egrep '\' | awk '{print $$3}' | sed 's/"//g') -GECODEVERSION="5.0.0" +GECODEVERSION="5.1.0" PROTOTYPES = ../gecode-prototypes-$(GECODEVERSION).hh ENUMS = ../gecode-enums-$(GECODEVERSION).py @@ -22,6 +22,7 @@ $(PROTOTYPES): % : xml/namespaceGecode.xml extract-prototypes.xsl | sed 's/GECODE_INT_EXPORT //g' \ | sed 's/GECODE_FLOAT_EXPORT //g' \ | sed 's/GECODE_SET_EXPORT //g' \ + | sed 's/GECODE_BOOL_EXPORT //g' \ | grep -v '*' | sort >> $@ || { rm -f $@; exit 1; } $(ENUMS): % : xml/namespaceGecode.xml extract-enums.xsl diff --git a/packages/gecode/dev/extractor/xml/namespaceGecode.xml b/packages/gecode/dev/extractor/xml/namespaceGecode.xml index b779ce9be..cf6080c73 100644 --- a/packages/gecode/dev/extractor/xml/namespaceGecode.xml +++ b/packages/gecode/dev/extractor/xml/namespaceGecode.xml @@ -1,15 +1,13 @@ - + Gecode - Gecode::Activity - Gecode::ActivityWrongArity + Gecode::Action Gecode::Actor Gecode::ActorLink Gecode::Advisor Gecode::Advisors Gecode::AFC - Gecode::AFCWrongArity Gecode::AllVarConf Gecode::Archive Gecode::ArgArray @@ -45,24 +43,36 @@ Gecode::BAB Gecode::BaseOptions Gecode::BinaryPropagator + Gecode::BoolAction + Gecode::BoolAFC + Gecode::BoolAssign + Gecode::BoolCHB Gecode::BoolExpr Gecode::BoolTraceDelta + Gecode::BoolValBranch Gecode::BoolVar Gecode::BoolVarArgs Gecode::BoolVarArray + Gecode::BoolVarBranch Gecode::Brancher + Gecode::BrancherFilter Gecode::BrancherGroup + Gecode::BrancherNoFilter + Gecode::BrancherNoPrint + Gecode::BrancherPrint Gecode::Branchers Gecode::BranchTraits Gecode::BranchTraits< BoolVar > Gecode::BranchTraits< FloatVar > Gecode::BranchTraits< IntVar > Gecode::BranchTraits< SetVar > + Gecode::CHB Gecode::Choice Gecode::ChooseMax Gecode::ChooseMin Gecode::CloneStatistics Gecode::CommitStatistics + Gecode::CommitTraceInfo Gecode::ConstView Gecode::Council Gecode::Delta @@ -71,10 +81,10 @@ Gecode::DFS Gecode::DynamicCastFailed Gecode::Exception - Gecode::ExecInfo - Gecode::FloatActivity + Gecode::FloatAction Gecode::FloatAFC Gecode::FloatAssign + Gecode::FloatCHB Gecode::FloatNumBranch Gecode::FloatTraceDelta Gecode::FloatVal @@ -93,10 +103,11 @@ Gecode::Home Gecode::IllegalDecay Gecode::InstanceOptions - Gecode::IntActivity + Gecode::IntAction Gecode::IntAFC Gecode::IntArgs Gecode::IntAssign + Gecode::IntCHB Gecode::IntMaximizeSpace Gecode::IntMinimizeSpace Gecode::IntSet @@ -113,6 +124,7 @@ Gecode::IntVarBranch Gecode::IntVarRanges Gecode::IntVarValues + Gecode::InvalidFunction Gecode::LDS Gecode::LinIntExpr Gecode::LinIntRel @@ -122,15 +134,17 @@ Gecode::MemoryChunk Gecode::MemoryExhausted Gecode::MemoryManager - Gecode::MeritActivity + Gecode::MeritAction Gecode::MeritAFC Gecode::MeritBase + Gecode::MeritCHB Gecode::MeritDegree Gecode::MeritFunction Gecode::MetaInfo Gecode::MixBinaryPropagator Gecode::MixNaryOnePropagator Gecode::MixTernaryPropagator + Gecode::MoreThanOneTracer Gecode::NaryOnePropagator Gecode::NaryPropagator Gecode::NGL @@ -145,6 +159,7 @@ Gecode::PostInfo Gecode::PosValChoice Gecode::PrimArgArray + Gecode::PropagateTraceInfo Gecode::Propagator Gecode::PropagatorGroup Gecode::Propagators @@ -158,9 +173,10 @@ Gecode::Reify Gecode::Rnd Gecode::SEBs - Gecode::SetActivity + Gecode::SetAction Gecode::SetAFC Gecode::SetAssign + Gecode::SetCHB Gecode::SetTraceDelta Gecode::SetValBranch Gecode::SetVar @@ -174,6 +190,7 @@ Gecode::SetVarUnknownRanges Gecode::SetVarUnknownValues Gecode::SharedArray + Gecode::SharedData Gecode::SharedHandle Gecode::SharedMemory Gecode::SizeOptions @@ -191,6 +208,7 @@ Gecode::StdFloatTracer Gecode::StdIntTracer Gecode::StdSetTracer + Gecode::StdTracer Gecode::SubscribedPropagators Gecode::Symmetries Gecode::SymmetryHandle @@ -210,8 +228,9 @@ Gecode::TraceTraits< Set::SetView > Gecode::TupleSet Gecode::UnaryPropagator - Gecode::UninitializedActivity + Gecode::UninitializedAction Gecode::UninitializedAFC + Gecode::UninitializedCHB Gecode::UninitializedRnd Gecode::UnknownBrancher Gecode::UnknownPropagator @@ -245,6 +264,9 @@ Gecode::ViewSelMinTbl Gecode::ViewSelNone Gecode::ViewSelRnd + Gecode::ViewTraceInfo + Gecode::ViewTracer + Gecode::ViewTraceRecorder Gecode::ViewValBrancher Gecode::ViewValNGL Gecode::Driver @@ -259,6 +281,12 @@ Gecode::Search Gecode::Set Gecode::Support + +
Events for view tracers
+ + +
Events for tracers
+ ScriptMode @@ -296,7 +324,7 @@ - + RestartMode @@ -341,49 +369,49 @@ - + FloatRelType FRT_EQ -Equality ( $=$) +Equality ( $=$) FRT_NQ -Disequality ( $\neq$) +Disequality ( $\neq$) FRT_LQ -Less or equal ( $\leq$) +Less or equal ( $\leq$) FRT_LE -Less ( $<$) +Less ( $<$) FRT_GQ -Greater or equal ( $\geq$) +Greater or equal ( $\geq$) FRT_GR -Greater ( $>$) +Greater ( $>$) @@ -393,7 +421,7 @@ - + ReifyMode @@ -402,21 +430,21 @@ Equivalence for reification (default) -For a constraint $c$ and a Boolean control variable $b$ defines that $b=1\Leftrightarrow c$ is propagated. +For a constraint $c$ and a Boolean control variable $b$ defines that $b=1\Leftrightarrow c$ is propagated. RM_IMP Implication for reification. -For a constraint $c$ and a Boolean control variable $b$ defines that $b=1\Leftarrow c$ is propagated. +For a constraint $c$ and a Boolean control variable $b$ defines that $b=1\Leftarrow c$ is propagated. RM_PMI Inverse implication for reification. -For a constraint $c$ and a Boolean control variable $b$ defines that $b=1\Rightarrow c$ is propagated. +For a constraint $c$ and a Boolean control variable $b$ defines that $b=1\Rightarrow c$ is propagated. Mode for reification. @@ -424,49 +452,49 @@ - + IntRelType IRT_EQ -Equality ( $=$) +Equality ( $=$) IRT_NQ -Disequality ( $\neq$) +Disequality ( $\neq$) IRT_LQ -Less or equal ( $\leq$) +Less or equal ( $\leq$) IRT_LE -Less ( $<$) +Less ( $<$) IRT_GQ -Greater or equal ( $\geq$) +Greater or equal ( $\geq$) IRT_GR -Greater ( $>$) +Greater ( $>$) @@ -476,7 +504,7 @@ - + BoolOpType @@ -521,7 +549,7 @@ - + IntPropLevel @@ -603,7 +631,7 @@ The descriptions are meant to be approximate. 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 to the level of propagation the propagator implements.If in the description of a constraint below no propagation level is mentioned, the propagation level for the constraint is domain propagation and the implementation in fact enforces domain consistency. - + TaskType @@ -634,7 +662,7 @@ - + ExecStatus @@ -700,7 +728,7 @@ - + ActorProperty @@ -719,6 +747,22 @@ Propagator is only weakly monotonic, that is, the propagator is only monotonic on assignments. + + + AP_VIEW_TRACE + = (1 << 2) + + + +A propagator is in fact implementing a view trace recorder. + + + AP_TRACE + = (1 << 3) + + + +A propagator is in fact implementing a trace recorder. Actor properties. @@ -726,7 +770,7 @@ - + SpaceStatus @@ -757,7 +801,7 @@ - + TraceEvent @@ -785,56 +829,80 @@ - - TE_DONE + + TE_FAIL = 1 << 3 +Trace fail events. + + + + + TE_DONE + = 1 << 4 + Trace done events. + + TE_PROPAGATE + = 1 << 5 + +Trace propagator executions. + + + + + TE_COMMIT + = 1 << 6 + +Trace commit operations by branchers. + + + Which events to trace. - + SetRelType SRT_EQ -Equality ( $=$) +Equality ( $=$) SRT_NQ -Disequality ( $\neq$) +Disequality ( $\neq$) SRT_SUB -Subset ( $\subseteq$) +Subset ( $\subseteq$) SRT_SUP -Superset ( $\supseteq$) +Superset ( $\supseteq$) SRT_DISJ -Disjoint ( $\parallel$) +Disjoint ( $\parallel$) @@ -848,38 +916,38 @@ SRT_LQ -Less or equal ( $\leq$) +Less or equal ( $\leq$) SRT_LE -Less ( $<$) +Less ( $<$) SRT_GQ -Greater or equal ( $\geq$) +Greater or equal ( $\geq$) SRT_GR -Greater ( $>$) +Greater ( $>$) 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$. +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$. - + SetOpType @@ -917,12 +985,12 @@ - + - Driver::ScriptBase< Driver::IgnoreStepOption< Space > > + Driver::ScriptBase< Driver::IgnoreStepOption< Space > > typedef Driver::ScriptBase<Driver::IgnoreStepOption<Space> > Gecode::Script Script @@ -932,10 +1000,10 @@ - + - Driver::ScriptBase< Driver::IgnoreStepOption< MinimizeSpace > > + Driver::ScriptBase< Driver::IgnoreStepOption< MinimizeSpace > > typedef Driver::ScriptBase<Driver::IgnoreStepOption<MinimizeSpace> > Gecode::MinimizeScript MinimizeScript @@ -945,10 +1013,10 @@ - + - Driver::ScriptBase< Driver::IgnoreStepOption< MaximizeSpace > > + Driver::ScriptBase< Driver::IgnoreStepOption< MaximizeSpace > > typedef Driver::ScriptBase<Driver::IgnoreStepOption<MaximizeSpace> > Gecode::MaximizeScript MaximizeScript @@ -958,10 +1026,10 @@ - + - Driver::ScriptBase< Driver::IgnoreStepOption< IntMinimizeSpace > > + Driver::ScriptBase< Driver::IgnoreStepOption< IntMinimizeSpace > > typedef Driver::ScriptBase<Driver::IgnoreStepOption<IntMinimizeSpace> > Gecode::IntMinimizeScript IntMinimizeScript @@ -971,10 +1039,10 @@ - + - Driver::ScriptBase< Driver::IgnoreStepOption< IntMaximizeSpace > > + Driver::ScriptBase< Driver::IgnoreStepOption< IntMaximizeSpace > > typedef Driver::ScriptBase<Driver::IgnoreStepOption<IntMaximizeSpace> > Gecode::IntMaximizeScript IntMaximizeScript @@ -984,7 +1052,7 @@ - + double @@ -997,12 +1065,12 @@ This type defines the interval bounds used for representing floating point values. - + - - bool(* - typedef bool(* Gecode::FloatBranchFilter) (const Space &home, FloatVar x, int i) - )(const Space &home, FloatVar x, int i) + + std::function< bool(const Space &home, FloatVar x, int i)> + typedef std::function<bool(const Space& home, FloatVar x, int i)> Gecode::FloatBranchFilter + FloatBranchFilter Branch filter function type for float variables. @@ -1010,12 +1078,12 @@ The variable x is considered for selection and i refers to the variable's position in the original array passed to the brancher. - + - - double(* - typedef double(* Gecode::FloatBranchMerit) (const Space &home, FloatVar x, int i) - )(const Space &home, FloatVar x, int i) + + std::function< double(const Space &home, FloatVar x, int i)> + typedef std::function<double(const Space& home, FloatVar x, int i)> Gecode::FloatBranchMerit + FloatBranchMerit Branch merit function type for float variables. @@ -1023,12 +1091,12 @@ The function must return a merit value for the variable x. The value i refers to the variable's position in the original array passed to the brancher. - + - - FloatNumBranch(* - typedef FloatNumBranch(* Gecode::FloatBranchVal) (const Space &home, FloatVar x, int i) - )(const Space &home, FloatVar x, int i) + + std::function< FloatNumBranch(const Space &home, FloatVar x, int i)> + typedef std::function<FloatNumBranch(const Space& home, FloatVar x, int i)> Gecode::FloatBranchVal + FloatBranchVal Branch value function type for float variables. @@ -1036,12 +1104,12 @@ Returns a value for the variable x that is to be used in the corresponding branch commit function. The integer i refers to the variable's position in the original array passed to the brancher. - + - - void(* - typedef void(* Gecode::FloatBranchCommit) (Space &home, unsigned int a, FloatVar x, int i, FloatNumBranch nl) - )(Space &home, unsigned int a, FloatVar x, int i, FloatNumBranch nl) + + std::function< void(Space &home, unsigned int a, FloatVar x, int i, FloatNumBranch nl)> + typedef std::function<void(Space& home, unsigned int a, FloatVar x, int i, FloatNumBranch nl)> Gecode::FloatBranchCommit + FloatBranchCommit Branch commit function type for float variables. @@ -1049,24 +1117,24 @@ The function must post a constraint on the variable x which corresponds to the alternative a. The integer i refers to the variable's position in the original array passed to the brancher. The value nl is the value description computed by the corresponding branch value function. - + - - void(* - typedef void(* Gecode::FloatVarValPrint) (const Space &home, const Brancher &b, unsigned int a, FloatVar x, int i, const FloatNumBranch &n, std::ostream &o) - )(const Space &home, const Brancher &b, unsigned int a, FloatVar x, int i, const FloatNumBranch &n, std::ostream &o) + + std::function< void(const Space &home, const Brancher &b, unsigned int a, FloatVar x, int i, const FloatNumBranch &n, std::ostream &o)> + typedef std::function<void(const Space &home, const Brancher& b, unsigned int a, FloatVar x, int i, const FloatNumBranch& n, std::ostream& o)> Gecode::FloatVarValPrint + FloatVarValPrint -Function type for explaining branching alternatives for set variables. +Function type for explaining branching alternatives for float variables. - + - - Tracer< Float::FloatView > - typedef Tracer<Float::FloatView> Gecode::FloatTracer + + ViewTracer< Float::FloatView > + typedef ViewTracer<Float::FloatView> Gecode::FloatTracer FloatTracer @@ -1075,23 +1143,23 @@ - + - - TraceRecorder< Float::FloatView > - typedef TraceRecorder<Float::FloatView> Gecode::FloatTraceRecorder + + ViewTraceRecorder< Float::FloatView > + typedef ViewTraceRecorder<Float::FloatView> Gecode::FloatTraceRecorder FloatTraceRecorder -TraceRecorder for float variables. +Trace recorder for float variables. - + - ArgArray< Int::LDSB::Literal > + ArgArray< Int::LDSB::Literal > typedef ArgArray<Int::LDSB::Literal> Gecode::LiteralArgs LiteralArgs @@ -1101,10 +1169,10 @@ - + - ArgArray< IntSet > + ArgArray< IntSet > typedef ArgArray<IntSet> Gecode::IntSetArgs IntSetArgs @@ -1114,10 +1182,10 @@ - + - PrimArgArray< TaskType > + PrimArgArray< TaskType > typedef PrimArgArray<TaskType> Gecode::TaskTypeArgs TaskTypeArgs @@ -1127,10 +1195,10 @@ - + - SharedArray< int > + SharedArray< int > typedef SharedArray<int> Gecode::IntSharedArray IntSharedArray @@ -1140,12 +1208,12 @@ - + - - bool(* - typedef bool(* Gecode::IntBranchFilter) (const Space &home, IntVar x, int i) - )(const Space &home, IntVar x, int i) + + std::function< bool(const Space &home, IntVar x, int i)> + typedef std::function<bool(const Space& home, IntVar x, int i)> Gecode::IntBranchFilter + IntBranchFilter Branch filter function type for integer variables. @@ -1153,12 +1221,12 @@ The variable x is considered for selection and i refers to the variable's position in the original array passed to the brancher. - + - - bool(* - typedef bool(* Gecode::BoolBranchFilter) (const Space &home, BoolVar x, int i) - )(const Space &home, BoolVar x, int i) + + std::function< bool(const Space &home, BoolVar x, int i)> + typedef std::function<bool(const Space& home, BoolVar x, int i)> Gecode::BoolBranchFilter + BoolBranchFilter Branch filter function type for Boolean variables. @@ -1166,12 +1234,12 @@ The variable x is considered for selection and i refers to the variable's position in the original array passed to the brancher. - + - - double(* - typedef double(* Gecode::IntBranchMerit) (const Space &home, IntVar x, int i) - )(const Space &home, IntVar x, int i) + + std::function< double(const Space &home, IntVar x, int i)> + typedef std::function<double(const Space& home, IntVar x, int i)> Gecode::IntBranchMerit + IntBranchMerit Branch merit function type for integer variables. @@ -1179,12 +1247,12 @@ The function must return a merit value for the variable x. The integer i refers to the variable's position in the original array passed to the brancher. - + - - double(* - typedef double(* Gecode::BoolBranchMerit) (const Space &home, BoolVar x, int i) - )(const Space &home, BoolVar x, int i) + + std::function< double(const Space &home, BoolVar x, int i)> + typedef std::function<double(const Space& home, BoolVar x, int i)> Gecode::BoolBranchMerit + BoolBranchMerit Branch merit function type for Boolean variables. @@ -1192,12 +1260,12 @@ The function must return a merit value for the variable x. The integer i refers to the variable's position in the original array passed to the brancher. - + - - int(* - typedef int(* Gecode::IntBranchVal) (const Space &home, IntVar x, int i) - )(const Space &home, IntVar x, int i) + + std::function< int(const Space &home, IntVar x, int i)> + typedef std::function<int(const Space& home, IntVar x, int i)> Gecode::IntBranchVal + IntBranchVal Branch value function type for integer variables. @@ -1205,12 +1273,12 @@ Returns a value for the variable x that is to be used in the corresponding branch commit function. The integer i refers to the variable's position in the original array passed to the brancher. - + - - int(* - typedef int(* Gecode::BoolBranchVal) (const Space &home, BoolVar x, int i) - )(const Space &home, BoolVar x, int i) + + std::function< int(const Space &home, BoolVar x, int i)> + typedef std::function<int(const Space& home, BoolVar x, int i)> Gecode::BoolBranchVal + BoolBranchVal Branch value function type for Boolean variables. @@ -1218,12 +1286,12 @@ Returns a value for the variable x that is to be used in the corresponding branch commit function. The integer i refers to the variable's position in the original array passed to the brancher. - + - - void(* - typedef void(* Gecode::IntBranchCommit) (Space &home, unsigned int a, IntVar x, int i, int n) - )(Space &home, unsigned int a, IntVar x, int i, int n) + + std::function< void(Space &home, unsigned int a, IntVar x, int i, int n)> + typedef std::function<void(Space& home, unsigned int a, IntVar x, int i, int n)> Gecode::IntBranchCommit + IntBranchCommit Branch commit function type for integer variables. @@ -1231,12 +1299,12 @@ The function must post a constraint on the variable x which corresponds to the alternative a. The integer i refers to the variable's position in the original array passed to the brancher. The value n is the value computed by the corresponding branch value function. - + - - void(* - typedef void(* Gecode::BoolBranchCommit) (Space &home, unsigned int a, BoolVar x, int i, int n) - )(Space &home, unsigned int a, BoolVar x, int i, int n) + + std::function< void(Space &home, unsigned int a, BoolVar x, int i, int n)> + typedef std::function<void(Space& home, unsigned int a, BoolVar x, int i, int n)> Gecode::BoolBranchCommit + BoolBranchCommit Branch commit function type for Boolean variables. @@ -1244,12 +1312,12 @@ The function must post a constraint on the variable x which corresponds to the alternative a. The integer i refers to the variable's position in the original array passed to the brancher. The value n is the value computed by the corresponding branch value function. - + - - void(* - typedef void(* Gecode::IntVarValPrint) (const Space &home, const Brancher &b, unsigned int a, IntVar x, int i, const int &n, std::ostream &o) - )(const Space &home, const Brancher &b, unsigned int a, IntVar x, int i, const int &n, std::ostream &o) + + std::function< void(const Space &home, const Brancher &b, unsigned int a, IntVar x, int i, const int &n, std::ostream &o)> + typedef std::function<void(const Space &home, const Brancher& b, unsigned int a, IntVar x, int i, const int& n, std::ostream& o)> Gecode::IntVarValPrint + IntVarValPrint Function type for printing branching alternatives for integer variables. @@ -1257,12 +1325,12 @@ - + - - void(* - typedef void(* Gecode::BoolVarValPrint) (const Space &home, const Brancher &b, unsigned int a, BoolVar x, int i, const int &n, std::ostream &o) - )(const Space &home, const Brancher &b, unsigned int a, BoolVar x, int i, const int &n, std::ostream &o) + + std::function< void(const Space &home, const Brancher &b, unsigned int a, BoolVar x, int i, const int &n, std::ostream &o)> + typedef std::function<void(const Space &home, const Brancher& b, unsigned int a, BoolVar x, int i, const int& n, std::ostream& o)> Gecode::BoolVarValPrint + BoolVarValPrint Function type for printing branching alternatives for Boolean variables. @@ -1270,11 +1338,11 @@ - + - - Tracer< Int::IntView > - typedef Tracer<Int::IntView> Gecode::IntTracer + + ViewTracer< Int::IntView > + typedef ViewTracer<Int::IntView> Gecode::IntTracer IntTracer @@ -1283,24 +1351,24 @@ - + - - TraceRecorder< Int::IntView > - typedef TraceRecorder<Int::IntView> Gecode::IntTraceRecorder + + ViewTraceRecorder< Int::IntView > + typedef ViewTraceRecorder<Int::IntView> Gecode::IntTraceRecorder IntTraceRecorder -TraceRecorder for integer variables. +Trace recorder for integer variables. - + - - Tracer< Int::BoolView > - typedef Tracer<Int::BoolView> Gecode::BoolTracer + + ViewTracer< Int::BoolView > + typedef ViewTracer<Int::BoolView> Gecode::BoolTracer BoolTracer @@ -1309,25 +1377,25 @@ - + - - TraceRecorder< Int::BoolView > - typedef TraceRecorder<Int::BoolView> Gecode::BoolTraceRecorder + + ViewTraceRecorder< Int::BoolView > + typedef ViewTraceRecorder<Int::BoolView> Gecode::BoolTraceRecorder BoolTraceRecorder -TraceRecorder for Boolean variables. +Trace recorder for Boolean variables. - + - - double(* - typedef double(* Gecode::BranchTbl) (const Space &home, double w, double b) - )(const Space &home, double w, double b) + + std::function< double(const Space &home, double w, double b)> + typedef std::function<double(const Space& home, double w, double b)> Gecode::BranchTbl + BranchTbl Tie-break limit function. @@ -1335,7 +1403,33 @@ Here the value w is the worst and is the best merit value found. The function must return the merit value that is considered the limit for breaking ties. - + + + + std::function< bool(const Space &home, Var x, int i)> + using Gecode::BranchFilter = typedef std::function<bool(const Space& home, Var x, int i)> + + BranchFilter + +Function type for branch filter functions. + + + + + + + + std::function< void(const Space &home, const Brancher &b, unsigned int a, Var x, int i, const Val &m, std::ostream &o)> + using Gecode::VarValPrint = typedef std::function<void(const Space& home, const Brancher& b, unsigned int a, Var x, int i, const Val& m, std::ostream& o)> + + VarValPrint + +Function type for printing variable and value selection. + + + + + int @@ -1348,7 +1442,7 @@ - + int @@ -1361,7 +1455,7 @@ - + int @@ -1374,10 +1468,10 @@ Modification event deltas are used by propagators. A propagator stores a modification event for each variable type. They can be accessed through a variable or a view from a given propagator. They can be constructed from a given modevent by a variable or view. - + - IntMinimizeSpace + IntMinimizeSpace typedef IntMinimizeSpace Gecode::MinimizeSpace MinimizeSpace @@ -1387,10 +1481,10 @@ DeprecatedUse IntMinimizeSpace instead. - + - IntMaximizeSpace + IntMaximizeSpace typedef IntMaximizeSpace Gecode::MaximizeSpace MaximizeSpace @@ -1400,10 +1494,10 @@ DeprecatedUse IntMaximizeSpace instead. - + - Search::Builder * + Search::Builder * typedef Search::Builder* Gecode::SEB SEB @@ -1413,12 +1507,12 @@ - + - - bool(* - typedef bool(* Gecode::SetBranchFilter) (const Space &home, SetVar x, int i) - )(const Space &home, SetVar x, int i) + + std::function< bool(const Space &home, SetVar x, int i)> + typedef std::function<bool(const Space& home, SetVar x, int i)> Gecode::SetBranchFilter + SetBranchFilter Branch filter function type for set variables. @@ -1426,12 +1520,12 @@ The variable x is considered for selection and i refers to the variable's position in the original array passed to the brancher. - + - - double(* - typedef double(* Gecode::SetBranchMerit) (const Space &home, SetVar x, int i) - )(const Space &home, SetVar x, int i) + + std::function< double(const Space &home, SetVar x, int i)> + typedef std::function<double(const Space& home, SetVar x, int i)> Gecode::SetBranchMerit + SetBranchMerit Branch merit function type for set variables. @@ -1439,12 +1533,12 @@ The function must return a merit value for the variable x. The value i refers to the variable's position in the original array passed to the brancher. - + - - int(* - typedef int(* Gecode::SetBranchVal) (const Space &home, SetVar x, int i) - )(const Space &home, SetVar x, int i) + + std::function< int(const Space &home, SetVar x, int i)> + typedef std::function<int(const Space& home, SetVar x, int i)> Gecode::SetBranchVal + SetBranchVal Branch value function type for set variables. @@ -1452,12 +1546,12 @@ Returns a value for the variable x that is to be used in the corresponding branch commit function. The integer i refers to the variable's position in the original array passed to the brancher. - + - - void(* - typedef void(* Gecode::SetBranchCommit) (Space &home, unsigned int a, SetVar x, int i, int n) - )(Space &home, unsigned int a, SetVar x, int i, int n) + + std::function< void(Space &home, unsigned int a, SetVar x, int i, int n)> + typedef std::function<void(Space& home, unsigned int a, SetVar x, int i, int n)> Gecode::SetBranchCommit + SetBranchCommit Branch commit function type for set variables. @@ -1465,24 +1559,11 @@ The function must post a constraint on the variable x which corresponds to the alternative a. The integer i refers to the variable's position in the original array passed to the brancher. The value n is the value computed by the corresponding branch value function. - + - - void(* - typedef void(* Gecode::SetVarValPrint) (const Space &home, const Brancher &b, unsigned int a, SetVar x, int i, const int &n, std::ostream &o) - )(const Space &home, const Brancher &b, unsigned int a, SetVar x, int i, const int &n, std::ostream &o) - SetVarValPrint - -Function type for printing branching alternatives for set variables. - - - - - - - - Tracer< Set::SetView > - typedef Tracer<Set::SetView> Gecode::SetTracer + + ViewTracer< Set::SetView > + typedef ViewTracer<Set::SetView> Gecode::SetTracer SetTracer @@ -1491,38 +1572,38 @@ - + - - TraceRecorder< Set::SetView > - typedef TraceRecorder<Set::SetView> Gecode::SetTraceRecorder + + ViewTraceRecorder< Set::SetView > + typedef ViewTraceRecorder<Set::SetView> Gecode::SetTraceRecorder SetTraceRecorder -TraceRecorder for set variables. +Trace recorder for set variables. - - - - void(* - typedef void(* Gecode::VoidFunction) (void) - )(void) - VoidFunction - -Base type for any function pointer. - - - - - + + + Function type for printing branching alternatives for set variables typedef std::function< void(const Space &home, const Brancher &b, unsigned int a, SetVar x, int i, const int &n, std::ostream &o)> + Function type for printing branching alternatives for set variables typedef std::function<void(const Space &home, const Brancher& b, unsigned int a, SetVar x, int i, const int& n, std::ostream& o)> Gecode::SetVarValPrint + + SetVarValPrint + + + + + + + + - const ModEvent + const ModEvent const ModEvent Gecode::ME_GEN_FAILED ME_GEN_FAILED @@ -1533,10 +1614,10 @@ - + - const ModEvent + const ModEvent const ModEvent Gecode::ME_GEN_NONE ME_GEN_NONE @@ -1547,10 +1628,10 @@ - + - const ModEvent + const ModEvent const ModEvent Gecode::ME_GEN_ASSIGNED ME_GEN_ASSIGNED @@ -1561,10 +1642,10 @@ - + - const PropCond + const PropCond const PropCond Gecode::PC_GEN_NONE PC_GEN_NONE @@ -1575,10 +1656,10 @@ - + - const PropCond + const PropCond const PropCond Gecode::PC_GEN_ASSIGNED PC_GEN_ASSIGNED @@ -1589,10 +1670,78 @@ - + + + + Post propagator for SetVar + Post propagator for SetVar Gecode::x + + x + + + + + + + + + + Post propagator for SetVar SetOpType + Post propagator for SetVar SetOpType Gecode::op + + op + + + + + + + + + + Post propagator for SetVar SetOpType SetVar + Post propagator for SetVar SetOpType const IntSet & Gecode::y + + y + = \diamond_{\mathit{op}} x\f$ + GECODE_SET_EXPORT void + rel(Home home, SetOpType op, const SetVarArgs& x, SetVar y) + + + + + + + + + + Post propagator for SetVar SetOpType SetVar SetRelType + Post propagator for SetVar SetOpType const IntSet SetRelType Gecode::r + + r + + + + + + + + + + Post propagator for SetVar SetOpType SetVar SetRelType SetVar + Post propagator for SetVar SetOpType const IntSet SetRelType const IntSet & Gecode::z + + z + + + + + + + - GECODE_SUPPORT_EXPORT Heap + GECODE_SUPPORT_EXPORT Heap GECODE_SUPPORT_EXPORT Heap Gecode::heap heap @@ -1602,12 +1751,12 @@ - + - FloatAssign + FloatAssign FloatAssign Gecode::FLOAT_ASSIGN_MIN (void) FLOAT_ASSIGN_MIN @@ -1620,10 +1769,10 @@ - + - FloatAssign + FloatAssign FloatAssign Gecode::FLOAT_ASSIGN_MAX (void) FLOAT_ASSIGN_MAX @@ -1636,15 +1785,15 @@ - + - FloatAssign + FloatAssign FloatAssign Gecode::FLOAT_ASSIGN_RND (Rnd r) FLOAT_ASSIGN_RND - Rnd + Rnd r @@ -1653,21 +1802,21 @@ - + - FloatAssign + FloatAssign FloatAssign Gecode::FLOAT_ASSIGN (FloatBranchVal v, FloatBranchCommit c) FLOAT_ASSIGN - FloatBranchVal + FloatBranchVal v - FloatBranchCommit + FloatBranchCommit c - NULL + nullptr @@ -1675,19 +1824,19 @@ Select value as defined by the value function v and commit function c The default commit function posts the constraint that the float variable x must be less or equal than the value n. - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator<< (Archive &e, FloatNumBranch nl) operator<< - Archive & + Archive & e - FloatNumBranch + FloatNumBranch nl @@ -1696,19 +1845,19 @@ - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator>> (Archive &e, FloatNumBranch &nl) operator>> - Archive & + Archive & e - FloatNumBranch & + FloatNumBranch & nl @@ -1717,10 +1866,10 @@ - + - FloatValBranch + FloatValBranch FloatValBranch Gecode::FLOAT_VAL_SPLIT_MIN (void) FLOAT_VAL_SPLIT_MIN @@ -1733,10 +1882,10 @@ - + - FloatValBranch + FloatValBranch FloatValBranch Gecode::FLOAT_VAL_SPLIT_MAX (void) FLOAT_VAL_SPLIT_MAX @@ -1749,15 +1898,15 @@ - + - FloatValBranch + FloatValBranch FloatValBranch Gecode::FLOAT_VAL_SPLIT_RND (Rnd r) FLOAT_VAL_SPLIT_RND - Rnd + Rnd r @@ -1766,21 +1915,21 @@ - + - FloatValBranch + FloatValBranch FloatValBranch Gecode::FLOAT_VAL (FloatBranchVal v, FloatBranchCommit c) FLOAT_VAL - FloatBranchVal + FloatBranchVal v - FloatBranchCommit + FloatBranchCommit c - NULL + nullptr @@ -1788,10 +1937,10 @@ Select value as defined by the value function v and commit function c The default commit function posts the constraint that the float variable x must be less or equal than the value n for the first alternative and that x must be greater or equal than n otherwise. - + - FloatVarBranch + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_NONE (void) FLOAT_VAR_NONE @@ -1804,19 +1953,19 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_MERIT_MIN - (FloatBranchMerit bm, BranchTbl tbl=NULL) + (FloatBranchMerit bm, BranchTbl tbl=nullptr) FLOAT_VAR_MERIT_MIN - FloatBranchMerit + FloatBranchMerit bm - BranchTbl + BranchTbl tbl @@ -1825,19 +1974,19 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_MERIT_MAX - (FloatBranchMerit bm, BranchTbl tbl=NULL) + (FloatBranchMerit bm, BranchTbl tbl=nullptr) FLOAT_VAR_MERIT_MAX - FloatBranchMerit + FloatBranchMerit bm - BranchTbl + BranchTbl tbl @@ -1846,15 +1995,15 @@ - + - FloatVarBranch + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_RND (Rnd r) FLOAT_VAR_RND - Rnd + Rnd r @@ -1863,15 +2012,15 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_DEGREE_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) FLOAT_VAR_DEGREE_MIN - BranchTbl + BranchTbl tbl @@ -1880,15 +2029,15 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_DEGREE_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) FLOAT_VAR_DEGREE_MAX - BranchTbl + BranchTbl tbl @@ -1897,19 +2046,19 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_AFC_MIN - (double d=1.0, BranchTbl tbl=NULL) + (double d=1.0, BranchTbl tbl=nullptr) FLOAT_VAR_AFC_MIN double d - BranchTbl + BranchTbl tbl @@ -1918,19 +2067,19 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_AFC_MIN - (FloatAFC a, BranchTbl tbl=NULL) + (FloatAFC a, BranchTbl tbl=nullptr) FLOAT_VAR_AFC_MIN - FloatAFC + FloatAFC a - BranchTbl + BranchTbl tbl @@ -1939,19 +2088,19 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_AFC_MAX - (double d=1.0, BranchTbl tbl=NULL) + (double d=1.0, BranchTbl tbl=nullptr) FLOAT_VAR_AFC_MAX double d - BranchTbl + BranchTbl tbl @@ -1960,19 +2109,19 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_AFC_MAX - (FloatAFC a, BranchTbl tbl=NULL) + (FloatAFC a, BranchTbl tbl=nullptr) FLOAT_VAR_AFC_MAX - FloatAFC + FloatAFC a - BranchTbl + BranchTbl tbl @@ -1981,99 +2130,175 @@ - + - - FloatVarBranch - FloatVarBranch Gecode::FLOAT_VAR_ACTIVITY_MIN - (double d=1.0, BranchTbl tbl=NULL) - FLOAT_VAR_ACTIVITY_MIN + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_ACTION_MIN + (double d=1.0, BranchTbl tbl=nullptr) + FLOAT_VAR_ACTION_MIN double d - BranchTbl + BranchTbl tbl -Select variable with lowest activity with decay factor d. +Select variable with lowest action with decay factor d. - + - - FloatVarBranch - FloatVarBranch Gecode::FLOAT_VAR_ACTIVITY_MIN - (FloatActivity a, BranchTbl tbl=NULL) - FLOAT_VAR_ACTIVITY_MIN + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_ACTION_MIN + (FloatAction a, BranchTbl tbl=nullptr) + FLOAT_VAR_ACTION_MIN - FloatActivity + FloatAction a - BranchTbl + BranchTbl tbl -Select variable with lowest activity. +Select variable with lowest action. - + - - FloatVarBranch - FloatVarBranch Gecode::FLOAT_VAR_ACTIVITY_MAX - (double d=1.0, BranchTbl tbl=NULL) - FLOAT_VAR_ACTIVITY_MAX + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_ACTION_MAX + (double d=1.0, BranchTbl tbl=nullptr) + FLOAT_VAR_ACTION_MAX double d - BranchTbl + BranchTbl tbl -Select variable with highest activity with decay factor d. +Select variable with highest action with decay factor d. - + - - FloatVarBranch - FloatVarBranch Gecode::FLOAT_VAR_ACTIVITY_MAX - (FloatActivity a, BranchTbl tbl=NULL) - FLOAT_VAR_ACTIVITY_MAX + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_ACTION_MAX + (FloatAction a, BranchTbl tbl=nullptr) + FLOAT_VAR_ACTION_MAX - FloatActivity + FloatAction a - BranchTbl + BranchTbl tbl -Select variable with highest activity. +Select variable with highest action. - + - - FloatVarBranch + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_CHB_MIN + (BranchTbl tbl=nullptr) + FLOAT_VAR_CHB_MIN + + BranchTbl + tbl + + +Select variable with lowest CHB Q-score. + + + + + + + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_CHB_MIN + (FloatCHB a, BranchTbl tbl=nullptr) + FLOAT_VAR_CHB_MIN + + FloatCHB + c + + + BranchTbl + tbl + + +Select variable with lowest CHB Q-score. + + + + + + + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_CHB_MAX + (BranchTbl tbl=nullptr) + FLOAT_VAR_CHB_MAX + + BranchTbl + tbl + + +Select variable with highest CHB Q-score. + + + + + + + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_CHB_MAX + (FloatCHB a, BranchTbl tbl=nullptr) + FLOAT_VAR_CHB_MAX + + FloatCHB + c + + + BranchTbl + tbl + + +Select variable with highest CHB Q-score. + + + + + + + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_MIN_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) FLOAT_VAR_MIN_MIN - BranchTbl + BranchTbl tbl @@ -2082,15 +2307,15 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_MIN_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) FLOAT_VAR_MIN_MAX - BranchTbl + BranchTbl tbl @@ -2099,15 +2324,15 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_MAX_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) FLOAT_VAR_MAX_MIN - BranchTbl + BranchTbl tbl @@ -2116,15 +2341,15 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_MAX_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) FLOAT_VAR_MAX_MAX - BranchTbl + BranchTbl tbl @@ -2133,15 +2358,15 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_SIZE_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) FLOAT_VAR_SIZE_MIN - BranchTbl + BranchTbl tbl @@ -2150,15 +2375,15 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_SIZE_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) FLOAT_VAR_SIZE_MAX - BranchTbl + BranchTbl tbl @@ -2167,15 +2392,15 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_DEGREE_SIZE_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) FLOAT_VAR_DEGREE_SIZE_MIN - BranchTbl + BranchTbl tbl @@ -2184,15 +2409,15 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_DEGREE_SIZE_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) FLOAT_VAR_DEGREE_SIZE_MAX - BranchTbl + BranchTbl tbl @@ -2201,19 +2426,19 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_AFC_SIZE_MIN - (double d=1.0, BranchTbl tbl=NULL) + (double d=1.0, BranchTbl tbl=nullptr) FLOAT_VAR_AFC_SIZE_MIN double d - BranchTbl + BranchTbl tbl @@ -2222,19 +2447,19 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_AFC_SIZE_MIN - (FloatAFC a, BranchTbl tbl=NULL) + (FloatAFC a, BranchTbl tbl=nullptr) FLOAT_VAR_AFC_SIZE_MIN - FloatAFC + FloatAFC a - BranchTbl + BranchTbl tbl @@ -2243,19 +2468,19 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_AFC_SIZE_MAX - (double d=1.0, BranchTbl tbl=NULL) + (double d=1.0, BranchTbl tbl=nullptr) FLOAT_VAR_AFC_SIZE_MAX double d - BranchTbl + BranchTbl tbl @@ -2264,19 +2489,19 @@ - + - - FloatVarBranch + + FloatVarBranch FloatVarBranch Gecode::FLOAT_VAR_AFC_SIZE_MAX - (FloatAFC a, BranchTbl tbl=NULL) + (FloatAFC a, BranchTbl tbl=nullptr) FLOAT_VAR_AFC_SIZE_MAX - FloatAFC + FloatAFC a - BranchTbl + BranchTbl tbl @@ -2285,94 +2510,220 @@ - + - - FloatVarBranch - FloatVarBranch Gecode::FLOAT_VAR_ACTIVITY_SIZE_MIN - (double d=1.0, BranchTbl tbl=NULL) - FLOAT_VAR_ACTIVITY_SIZE_MIN + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_ACTION_SIZE_MIN + (double d=1.0, BranchTbl tbl=nullptr) + FLOAT_VAR_ACTION_SIZE_MIN double d - BranchTbl + BranchTbl tbl -Select variable with smallest activity divided by domain size with decay factor d. +Select variable with smallest action divided by domain size with decay factor d. - + - - FloatVarBranch - FloatVarBranch Gecode::FLOAT_VAR_ACTIVITY_SIZE_MIN - (FloatActivity a, BranchTbl tbl=NULL) - FLOAT_VAR_ACTIVITY_SIZE_MIN + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_ACTION_SIZE_MIN + (FloatAction a, BranchTbl tbl=nullptr) + FLOAT_VAR_ACTION_SIZE_MIN - FloatActivity + FloatAction a - BranchTbl + BranchTbl tbl -Select variable with smallest activity divided by domain size. +Select variable with smallest action divided by domain size. - + - - FloatVarBranch - FloatVarBranch Gecode::FLOAT_VAR_ACTIVITY_SIZE_MAX - (double d=1.0, BranchTbl tbl=NULL) - FLOAT_VAR_ACTIVITY_SIZE_MAX + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_ACTION_SIZE_MAX + (double d=1.0, BranchTbl tbl=nullptr) + FLOAT_VAR_ACTION_SIZE_MAX double d - BranchTbl + BranchTbl tbl -Select variable with largest activity divided by domain size with decay factor d. +Select variable with largest action divided by domain size with decay factor d. - + - - FloatVarBranch - FloatVarBranch Gecode::FLOAT_VAR_ACTIVITY_SIZE_MAX - (FloatActivity a, BranchTbl tbl=NULL) - FLOAT_VAR_ACTIVITY_SIZE_MAX + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_ACTION_SIZE_MAX + (FloatAction a, BranchTbl tbl=nullptr) + FLOAT_VAR_ACTION_SIZE_MAX - FloatActivity + FloatAction a - BranchTbl + BranchTbl tbl -Select variable with largest activity divided by domain size. +Select variable with largest action divided by domain size. - + + + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_CHB_SIZE_MIN + (BranchTbl tbl=nullptr) + FLOAT_VAR_CHB_SIZE_MIN + + BranchTbl + tbl + + +Select variable with smallest CHB Q-score divided by domain size. + + + + + + + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_CHB_SIZE_MIN + (FloatCHB c, BranchTbl tbl=nullptr) + FLOAT_VAR_CHB_SIZE_MIN + + FloatCHB + c + + + BranchTbl + tbl + + +Select variable with smallest CHB Q-score divided by domain size. + + + + + + + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_CHB_SIZE_MAX + (BranchTbl tbl=nullptr) + FLOAT_VAR_CHB_SIZE_MAX + + BranchTbl + tbl + + +Select variable with largest CHB Q-score divided by domain size. + + + + + + + + FloatVarBranch + FloatVarBranch Gecode::FLOAT_VAR_CHB_SIZE_MAX + (FloatCHB a, BranchTbl tbl=nullptr) + FLOAT_VAR_CHB_SIZE_MAX + + FloatCHB + c + + + BranchTbl + tbl + + +Select variable with largest CHB Q-score divided by domain size. + + + + + + + + void + void Gecode::channel + (Home home, IntVar x0, FloatVar x1) + channel + + Home + home + + + IntVar + x0 + + + FloatVar + x1 + + +Post propagator for channeling a float and an integer variable $ x_0 = x_1$. + + + + + + + + void + void Gecode::channel + (Home home, BoolVar x0, FloatVar x1) + channel + + Home + home + + + BoolVar + x0 + + + FloatVar + x1 + + +Post propagator for channeling a float and a Boolean variable $ x_0 = x_1$. + + + + + - forceinline FloatNum + forceinline FloatNum FloatNum Gecode::pi_half_lower (void) pi_half_lower @@ -2380,15 +2731,15 @@ void -Return lower bound of $\pi/2$. +Return lower bound of $\pi/2$. - + - forceinline FloatNum + forceinline FloatNum FloatNum Gecode::pi_half_upper (void) pi_half_upper @@ -2396,15 +2747,15 @@ void -Return upper bound of $\pi/2$. +Return upper bound of $\pi/2$. - + - forceinline FloatNum + forceinline FloatNum FloatNum Gecode::pi_lower (void) pi_lower @@ -2412,15 +2763,15 @@ void -Return lower bound of $\pi$. +Return lower bound of $\pi$. - + - forceinline FloatNum + forceinline FloatNum FloatNum Gecode::pi_upper (void) pi_upper @@ -2428,15 +2779,15 @@ void -Return upper bound of $\pi$. +Return upper bound of $\pi$. - + - forceinline FloatNum + forceinline FloatNum FloatNum Gecode::pi_twice_lower (void) pi_twice_lower @@ -2444,15 +2795,15 @@ void -Return lower bound of $2\pi$. +Return lower bound of $2\pi$. - + - forceinline FloatNum + forceinline FloatNum FloatNum Gecode::pi_twice_upper (void) pi_twice_upper @@ -2460,24 +2811,24 @@ void -Return upper bound of $2\pi$. +Return upper bound of $2\pi$. - + - + void void Gecode::trace - (Home home, const FloatVarArgs &x, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_DONE), FloatTracer &t=StdFloatTracer::def) + (Home home, const FloatVarArgs &x, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE), FloatTracer &t=StdFloatTracer::def) trace - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x @@ -2485,7 +2836,7 @@ te - FloatTracer & + FloatTracer & t @@ -2494,15 +2845,15 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator+ (const FloatVal &x) operator+ - const FloatVal & + const FloatVal & x @@ -2511,15 +2862,15 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator- (const FloatVal &x) operator- - const FloatVal & + const FloatVal & x @@ -2528,19 +2879,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator+ (const FloatVal &x, const FloatVal &y) operator+ - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -2549,19 +2900,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator+ (const FloatVal &x, const FloatNum &y) operator+ - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -2570,19 +2921,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator+ (const FloatNum &x, const FloatVal &y) operator+ - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -2591,19 +2942,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator- (const FloatVal &x, const FloatVal &y) operator- - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -2612,19 +2963,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator- (const FloatVal &x, const FloatNum &y) operator- - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -2633,19 +2984,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator- (const FloatNum &x, const FloatVal &y) operator- - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -2654,19 +3005,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator* (const FloatVal &x, const FloatVal &y) operator* - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -2675,19 +3026,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator* (const FloatVal &x, const FloatNum &y) operator* - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -2696,19 +3047,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator* (const FloatNum &x, const FloatVal &y) operator* - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -2717,19 +3068,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator/ (const FloatVal &x, const FloatVal &y) operator/ - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -2738,19 +3089,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator/ (const FloatVal &x, const FloatNum &y) operator/ - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -2759,19 +3110,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::operator/ (const FloatNum &x, const FloatVal &y) operator/ - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -2780,7 +3131,7 @@ - + bool @@ -2788,11 +3139,11 @@ (const FloatVal &x, const FloatVal &y) operator< - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -2801,7 +3152,7 @@ - + bool @@ -2809,11 +3160,11 @@ (const FloatVal &x, const FloatNum &y) operator< - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -2822,7 +3173,7 @@ - + bool @@ -2830,11 +3181,11 @@ (const FloatVal &x, const FloatVal &y) operator<= - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -2843,7 +3194,7 @@ - + bool @@ -2851,11 +3202,11 @@ (const FloatVal &x, const FloatNum &y) operator<= - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -2864,7 +3215,7 @@ - + bool @@ -2872,11 +3223,11 @@ (const FloatVal &x, const FloatVal &y) operator> - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -2885,7 +3236,7 @@ - + bool @@ -2893,11 +3244,11 @@ (const FloatVal &x, const FloatNum &y) operator> - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -2906,7 +3257,7 @@ - + bool @@ -2914,11 +3265,11 @@ (const FloatVal &x, const FloatVal &y) operator>= - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -2927,7 +3278,7 @@ - + bool @@ -2935,11 +3286,11 @@ (const FloatVal &x, const FloatNum &y) operator>= - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -2948,7 +3299,7 @@ - + bool @@ -2956,11 +3307,11 @@ (const FloatVal &x, const FloatVal &y) operator== - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -2969,7 +3320,7 @@ - + bool @@ -2977,11 +3328,11 @@ (const FloatVal &x, const FloatNum &y) operator== - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -2990,7 +3341,7 @@ - + bool @@ -2998,11 +3349,11 @@ (const FloatVal &x, const FloatVal &y) operator!= - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -3011,7 +3362,7 @@ - + bool @@ -3019,11 +3370,11 @@ (const FloatVal &x, const FloatNum &y) operator!= - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -3032,7 +3383,7 @@ - + forceinline bool @@ -3040,11 +3391,11 @@ (const FloatNum &x, const FloatVal &y) operator< - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -3053,7 +3404,7 @@ - + forceinline bool @@ -3061,11 +3412,11 @@ (const FloatNum &x, const FloatVal &y) operator<= - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -3074,7 +3425,7 @@ - + forceinline bool @@ -3082,11 +3433,11 @@ (const FloatNum &x, const FloatVal &y) operator> - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -3095,7 +3446,7 @@ - + forceinline bool @@ -3103,11 +3454,11 @@ (const FloatNum &x, const FloatVal &y) operator>= - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -3116,7 +3467,7 @@ - + forceinline bool @@ -3124,11 +3475,11 @@ (const FloatNum &x, const FloatVal &y) operator== - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -3137,7 +3488,7 @@ - + forceinline bool @@ -3145,11 +3496,11 @@ (const FloatNum &x, const FloatVal &y) operator!= - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -3158,7 +3509,7 @@ - + @@ -3178,7 +3529,7 @@ os - const FloatVal & + const FloatVal & x @@ -3187,15 +3538,15 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::abs (const FloatVal &x) abs - const FloatVal & + const FloatVal & x @@ -3204,15 +3555,15 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::sqrt (const FloatVal &x) sqrt - const FloatVal & + const FloatVal & x @@ -3221,15 +3572,15 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::sqr (const FloatVal &x) sqr - const FloatVal & + const FloatVal & x @@ -3238,15 +3589,15 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::pow (const FloatVal &x, int n) pow - const FloatVal & + const FloatVal & x @@ -3259,15 +3610,15 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::nroot (const FloatVal &x, int n) nroot - const FloatVal & + const FloatVal & x @@ -3280,19 +3631,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::max (const FloatVal &x, const FloatVal &y) max - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -3301,19 +3652,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::max (const FloatVal &x, const FloatNum &y) max - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -3322,19 +3673,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::max (const FloatNum &x, const FloatVal &y) max - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -3343,19 +3694,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::min (const FloatVal &x, const FloatVal &y) min - const FloatVal & + const FloatVal & x - const FloatVal & + const FloatVal & y @@ -3364,19 +3715,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::min (const FloatVal &x, const FloatNum &y) min - const FloatVal & + const FloatVal & x - const FloatNum & + const FloatNum & y @@ -3385,19 +3736,19 @@ - + - forceinline FloatVal + forceinline FloatVal forceinline FloatVal Gecode::min (const FloatNum &x, const FloatVal &y) min - const FloatNum & + const FloatNum & x - const FloatVal & + const FloatVal & y @@ -3406,7 +3757,7 @@ - + @@ -3426,7 +3777,7 @@ os - const FloatVar & + const FloatVar & x @@ -3435,7 +3786,7 @@ - + GECODE_FLOAT_EXPORT void @@ -3443,24 +3794,24 @@ (Home home, FloatVar x, FloatVal n) dom - Home + Home home - FloatVar + FloatVar x - FloatVal + FloatVal n -Propagates $x=n$. +Propagates $x=n$. - + GECODE_FLOAT_EXPORT void @@ -3468,24 +3819,24 @@ (Home home, const FloatVarArgs &x, FloatVal n) dom - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatVal + FloatVal n -Propagates $ x_i=n$ for all $0\leq i<|x|$. +Propagates $ x_i=n$ for all $0\leq i<|x|$. - + GECODE_FLOAT_EXPORT void @@ -3493,28 +3844,28 @@ (Home home, FloatVar x, FloatNum l, FloatNum m) dom - Home + Home home - FloatVar + FloatVar x - FloatNum + FloatNum l - FloatNum + FloatNum m -Propagates $ l\leq x\leq u$. +Propagates $ l\leq x\leq u$. - + GECODE_FLOAT_EXPORT void @@ -3522,28 +3873,28 @@ (Home home, const FloatVarArgs &x, FloatNum l, FloatNum u) dom - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatNum + FloatNum l - FloatNum + FloatNum u -Propagates $ l\leq x_i\leq u$ for all $0\leq i<|x|$. +Propagates $ l\leq x_i\leq u$ for all $0\leq i<|x|$. - + GECODE_FLOAT_EXPORT void @@ -3551,28 +3902,28 @@ (Home home, FloatVar x, FloatVal n, Reify r) dom - Home + Home home - FloatVar + FloatVar x - FloatVal + FloatVal n - Reify + Reify r -Post domain consistent propagator for $ (x=n) \equiv r$. +Post domain consistent propagator for $ (x=n) \equiv r$. - + GECODE_FLOAT_EXPORT void @@ -3580,32 +3931,32 @@ (Home home, FloatVar x, FloatNum l, FloatNum u, Reify r) dom - Home + Home home - FloatVar + FloatVar x - FloatNum + FloatNum l - FloatNum + FloatNum u - Reify + Reify r -Post domain consistent propagator for $ (l\leq x \leq u) \equiv r$. +Post domain consistent propagator for $ (l\leq x \leq u) \equiv r$. - + GECODE_FLOAT_EXPORT void @@ -3613,15 +3964,15 @@ (Home home, FloatVar x, FloatVar d) dom - Home + Home home - FloatVar + FloatVar x - FloatVar + FloatVar d @@ -3630,7 +3981,7 @@ - + GECODE_FLOAT_EXPORT void @@ -3638,24 +3989,24 @@ (Home home, const FloatVarArgs &x, const FloatVarArgs &d) dom - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - const FloatVarArgs & + const FloatVarArgs & d -Constrain domain of $ x_i $ according to domain of $ d_i $ for all $0\leq i<|x|$. +Constrain domain of $ x_i $ according to domain of $ d_i $ for all $0\leq i<|x|$. - + GECODE_FLOAT_EXPORT void @@ -3663,28 +4014,28 @@ (Home home, FloatVar x0, FloatRelType frt, FloatVar x1) rel - Home + Home home - FloatVar + FloatVar x0 - FloatRelType + FloatRelType frt - FloatVar + FloatVar x1 -Post propagator for $ x_0 \sim_{frt} x_1$. +Post propagator for $ x_0 \sim_{frt} x_1$. - + GECODE_FLOAT_EXPORT void @@ -3692,28 +4043,28 @@ (Home home, FloatVar x, FloatRelType frt, FloatVal c) rel - Home + Home home - FloatVar + FloatVar x - FloatRelType + FloatRelType frt - FloatVal + FloatVal c -Propagates $ x \sim_{frt} c$. +Propagates $ x \sim_{frt} c$. - + GECODE_FLOAT_EXPORT void @@ -3721,32 +4072,32 @@ (Home home, FloatVar x, FloatRelType frt, FloatVal c, Reify r) rel - Home + Home home - FloatVar + FloatVar x - FloatRelType + FloatRelType frt - FloatVal + FloatVal c - Reify + Reify r -Post propagator for $(x \sim_{frt} c)\equiv r$. +Post propagator for $(x \sim_{frt} c)\equiv r$. - + GECODE_FLOAT_EXPORT void @@ -3754,32 +4105,32 @@ (Home home, FloatVar x0, FloatRelType frt, FloatVar x1, Reify r) rel - Home + Home home - FloatVar + FloatVar x0 - FloatRelType + FloatRelType frt - FloatVar + FloatVar x1 - Reify + Reify r -Post propagator for $(x_0 \sim_{frt} x_1)\equiv r$. +Post propagator for $(x_0 \sim_{frt} x_1)\equiv r$. - + GECODE_FLOAT_EXPORT void @@ -3787,28 +4138,28 @@ (Home home, const FloatVarArgs &x, FloatRelType frt, FloatVal c) rel - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatRelType + FloatRelType frt - FloatVal + FloatVal c -Propagates $ x_i \sim_{frt} c $ for all $0\leq i<|x|$. +Propagates $ x_i \sim_{frt} c $ for all $0\leq i<|x|$. - + GECODE_FLOAT_EXPORT void @@ -3816,28 +4167,61 @@ (Home home, const FloatVarArgs &x, FloatRelType frt, FloatVar y) rel - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatRelType + FloatRelType frt - FloatVar + FloatVar y -Propagates $ x_i \sim_{frt} y $ for all $0\leq i<|x|$. +Propagates $ x_i \sim_{frt} y $ for all $0\leq i<|x|$. - + + + + GECODE_FLOAT_EXPORT void + GECODE_FLOAT_EXPORT void Gecode::ite + (Home home, BoolVar b, FloatVar x, FloatVar y, FloatVar z) + ite + + Home + home + + + BoolVar + b + + + FloatVar + x + + + FloatVar + y + + + FloatVar + z + + +Post propagator for if-then-else constraint. + +Posts propagator for $ z = b ? x : y $ + + + GECODE_FLOAT_EXPORT void @@ -3845,28 +4229,28 @@ (Home home, FloatVar x0, FloatVar x1, FloatVar x2) min - Home + Home home - FloatVar + FloatVar x0 - FloatVar + FloatVar x1 - FloatVar + FloatVar x2 -Post propagator for $ \min\{x_0,x_1\}=x_2$. +Post propagator for $ \min\{x_0,x_1\}=x_2$. - + GECODE_FLOAT_EXPORT void @@ -3874,24 +4258,24 @@ (Home home, const FloatVarArgs &x, FloatVar y) min - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatVar + FloatVar y -Post propagator for $ \min x=y$ If x is empty, an exception of type Float::TooFewArguments is thrown. +Post propagator for $ \min x=y$ If x is empty, an exception of type Float::TooFewArguments is thrown. - + GECODE_FLOAT_EXPORT void @@ -3899,28 +4283,28 @@ (Home home, FloatVar x0, FloatVar x1, FloatVar x2) max - Home + Home home - FloatVar + FloatVar x0 - FloatVar + FloatVar x1 - FloatVar + FloatVar x2 -Post propagator for $ \max\{x_0,x_1\}=x_2$. +Post propagator for $ \max\{x_0,x_1\}=x_2$. - + GECODE_FLOAT_EXPORT void @@ -3928,15 +4312,15 @@ (Home home, const FloatVarArgs &x, FloatVar y) max - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatVar + FloatVar y @@ -3945,7 +4329,7 @@ - + GECODE_FLOAT_EXPORT void @@ -3953,24 +4337,24 @@ (Home home, FloatVar x0, FloatVar x1) abs - Home + Home home - FloatVar + FloatVar x0 - FloatVar + FloatVar x1 -Post propagator for $ |x_0|=x_1$. +Post propagator for $ |x_0|=x_1$. - + GECODE_FLOAT_EXPORT void @@ -3978,19 +4362,19 @@ (Home home, FloatVar x0, FloatVar x1, FloatVar x2) mult - Home + Home home - FloatVar + FloatVar x0 - FloatVar + FloatVar x1 - FloatVar + FloatVar x2 @@ -3999,7 +4383,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4007,15 +4391,15 @@ (Home home, FloatVar x0, FloatVar x1) sqr - Home + Home home - FloatVar + FloatVar x0 - FloatVar + FloatVar x1 @@ -4024,7 +4408,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4032,24 +4416,24 @@ (Home home, FloatVar x0, FloatVar x1) sqrt - Home + Home home - FloatVar + FloatVar x0 - FloatVar + FloatVar x1 -Post propagator for $\sqrt{x_0}=x_1$. +Post propagator for $\sqrt{x_0}=x_1$. - + GECODE_FLOAT_EXPORT void @@ -4057,11 +4441,11 @@ (Home home, FloatVar x0, int n, FloatVar x1) pow - Home + Home home - FloatVar + FloatVar x0 @@ -4069,16 +4453,16 @@ n - FloatVar + FloatVar x1 -Post propagator for ${x_0}^{n}=x_1$ for $n 0$. +Post propagator for ${x_0}^{n}=x_1$ for $n 0$. - + GECODE_FLOAT_EXPORT void @@ -4086,11 +4470,11 @@ (Home home, FloatVar x0, int n, FloatVar x1) nroot - Home + Home home - FloatVar + FloatVar x0 @@ -4098,16 +4482,16 @@ n - FloatVar + FloatVar x1 -Post propagator for ${x_0}^{1/n}=x_1$ for $n 0$. +Post propagator for ${x_0}^{1/n}=x_1$ for $n 0$. - + GECODE_FLOAT_EXPORT void @@ -4115,57 +4499,57 @@ (Home home, FloatVar x0, FloatVar x1, FloatVar x2) div - Home + Home home - FloatVar + FloatVar x0 - FloatVar + FloatVar x1 - FloatVar + FloatVar x2 -Post propagator for $x_0\ \mathrm{div}\ x_1=x_2$. +Post propagator for $x_0\ \mathrm{div}\ x_1=x_2$. - + - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::linear - (Home home, const FloatVarArgs &x, FloatRelType frt, FloatNum c) + (Home home, const FloatVarArgs &x, FloatRelType frt, FloatVal c) linear - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatRelType + FloatRelType frt - FloatNum + FloatVal c -Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{frt} c$. +Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{frt} c$. - + GECODE_FLOAT_EXPORT void @@ -4173,61 +4557,61 @@ (Home home, const FloatVarArgs &x, FloatRelType frt, FloatVar y) linear - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatRelType + FloatRelType frt - FloatVar + FloatVar y -Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{frt} y$. +Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{frt} y$. - + - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::linear - (Home home, const FloatVarArgs &x, FloatRelType frt, FloatNum c, Reify r) + (Home home, const FloatVarArgs &x, FloatRelType frt, FloatVal c, Reify r) linear - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatRelType + FloatRelType frt - FloatNum + FloatVal c - Reify + Reify r -Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{frt} c\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{frt} c\right)\equiv r$. - + GECODE_FLOAT_EXPORT void @@ -4235,65 +4619,65 @@ (Home home, const FloatVarArgs &x, FloatRelType frt, FloatVar y, Reify r) linear - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatRelType + FloatRelType frt - FloatVar + FloatVar y - Reify + Reify r -Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{frt} y\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{frt} y\right)\equiv r$. - + - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::linear - (Home home, const FloatValArgs &a, const FloatVarArgs &x, FloatRelType frt, FloatNum c) + (Home home, const FloatValArgs &a, const FloatVarArgs &x, FloatRelType frt, FloatVal c) linear - Home + Home home - const FloatValArgs & + const FloatValArgs & a - const FloatVarArgs & + const FloatVarArgs & x - FloatRelType + FloatRelType frt - FloatNum + FloatVal c -Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{frt} c$. +Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{frt} c$. Throws an exception of type Float::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_FLOAT_EXPORT void @@ -4301,69 +4685,69 @@ (Home home, const FloatValArgs &a, const FloatVarArgs &x, FloatRelType frt, FloatVar y) linear - Home + Home home - const FloatValArgs & + const FloatValArgs & a - const FloatVarArgs & + const FloatVarArgs & x - FloatRelType + FloatRelType frt - FloatVar + FloatVar y -Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{frt} y$. +Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{frt} y$. Throws an exception of type Float::ArgumentSizeMismatch, if a and x are of different size. - + - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::linear - (Home home, const FloatValArgs &a, const FloatVarArgs &x, FloatRelType frt, FloatNum c, Reify r) + (Home home, const FloatValArgs &a, const FloatVarArgs &x, FloatRelType frt, FloatVal c, Reify r) linear - Home + Home home - const FloatValArgs & + const FloatValArgs & a - const FloatVarArgs & + const FloatVarArgs & x - FloatRelType + FloatRelType frt - FloatNum + FloatVal c - Reify + Reify r -Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{frt} c\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{frt} c\right)\equiv r$. Throws an exception of type Float::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_FLOAT_EXPORT void @@ -4371,36 +4755,36 @@ (Home home, const FloatValArgs &a, const FloatVarArgs &x, FloatRelType frt, FloatVar y, Reify r) linear - Home + Home home - const FloatValArgs & + const FloatValArgs & a - const FloatVarArgs & + const FloatVarArgs & x - FloatRelType + FloatRelType frt - FloatVar + FloatVar y - Reify + Reify r -Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{frt} y\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{frt} y\right)\equiv r$. Throws an exception of type Float::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_FLOAT_EXPORT void @@ -4408,15 +4792,15 @@ (Home home, FloatVar x0, IntVar x1) channel - Home + Home home - FloatVar + FloatVar x0 - IntVar + IntVar x1 @@ -4425,32 +4809,7 @@ - - - - GECODE_FLOAT_EXPORT void - GECODE_FLOAT_EXPORT void Gecode::channel - (Home home, IntVar x0, FloatVar x1) - channel - - Home - home - - - IntVar - x0 - - - FloatVar - x1 - - -Post propagator for channeling a float and an integer variable $ x_0 = x_1$. - - - - - + GECODE_FLOAT_EXPORT void @@ -4458,15 +4817,15 @@ (Home home, FloatVar x0, BoolVar x1) channel - Home + Home home - FloatVar + FloatVar x0 - BoolVar + BoolVar x1 @@ -4475,48 +4834,23 @@ - + - - GECODE_FLOAT_EXPORT void - GECODE_FLOAT_EXPORT void Gecode::channel - (Home home, BoolVar x0, FloatVar x1) - channel - - Home - home - - - BoolVar - x0 - - - FloatVar - x1 - - -Post propagator for channeling a float and a Boolean variable $ x_0 = x_1$. - - - - - - - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::wait - (Home home, FloatVar x, void(*c)(Space &home)) + (Home home, FloatVar x, std::function< void(Space &home)> c) wait - Home + Home home - FloatVar + FloatVar x - void(*)(Space &home) + std::function< void(Space &home)> c @@ -4525,23 +4859,23 @@ - + - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::wait - (Home home, const FloatVarArgs &x, void(*c)(Space &home)) + (Home home, const FloatVarArgs &x, std::function< void(Space &home)> c) wait - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - void(*)(Space &home) + std::function< void(Space &home)> c @@ -4550,38 +4884,38 @@ - + - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::branch - (Home home, const FloatVarArgs &x, FloatVarBranch vars, FloatValBranch vals, FloatBranchFilter bf=NULL, FloatVarValPrint vvp=NULL) + (Home home, const FloatVarArgs &x, FloatVarBranch vars, FloatValBranch vals, FloatBranchFilter bf=nullptr, FloatVarValPrint vvp=nullptr) branch - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatVarBranch + FloatVarBranch vars - FloatValBranch + FloatValBranch vals - FloatBranchFilter + FloatBranchFilter bf - NULL + nullptr - FloatVarValPrint + FloatVarValPrint vvp - NULL + nullptr Branch over x with variable selection vars and value selection vals. @@ -4589,38 +4923,38 @@ - + - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::branch - (Home home, const FloatVarArgs &x, TieBreak< FloatVarBranch > vars, FloatValBranch vals, FloatBranchFilter bf=NULL, FloatVarValPrint vvp=NULL) + (Home home, const FloatVarArgs &x, TieBreak< FloatVarBranch > vars, FloatValBranch vals, FloatBranchFilter bf=nullptr, FloatVarValPrint vvp=nullptr) branch - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - TieBreak< FloatVarBranch > + TieBreak< FloatVarBranch > vars - FloatValBranch + FloatValBranch vals - FloatBranchFilter + FloatBranchFilter bf - NULL + nullptr - FloatVarValPrint + FloatVarValPrint vvp - NULL + nullptr Branch over x with tie-breaking variable selection vars and value selection vals. @@ -4628,29 +4962,29 @@ - + - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::branch - (Home home, FloatVar x, FloatValBranch vals, FloatVarValPrint vvp=NULL) + (Home home, FloatVar x, FloatValBranch vals, FloatVarValPrint vvp=nullptr) branch - Home + Home home - FloatVar + FloatVar x - FloatValBranch + FloatValBranch vals - FloatVarValPrint + FloatVarValPrint vvp - NULL + nullptr Branch over x with value selection vals. @@ -4658,34 +4992,34 @@ - + - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::assign - (Home home, const FloatVarArgs &x, FloatAssign vals, FloatBranchFilter fbf=NULL, FloatVarValPrint vvp=NULL) + (Home home, const FloatVarArgs &x, FloatAssign vals, FloatBranchFilter bf=nullptr, FloatVarValPrint vvp=nullptr) assign - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - FloatAssign + FloatAssign vals - FloatBranchFilter - fbf - NULL + FloatBranchFilter + bf + nullptr - FloatVarValPrint + FloatVarValPrint vvp - NULL + nullptr Assign all x with value selection vals. @@ -4693,29 +5027,29 @@ - + - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::assign - (Home home, FloatVar x, FloatAssign vals, FloatVarValPrint vvp=NULL) + (Home home, FloatVar x, FloatAssign vals, FloatVarValPrint vvp=nullptr) assign - Home + Home home - FloatVar + FloatVar x - FloatAssign + FloatAssign vals - FloatVarValPrint + FloatVarValPrint vvp - NULL + nullptr Assign x with value selection vals. @@ -4723,7 +5057,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4731,19 +5065,19 @@ (Home home, const FloatVarArgs &x, const FloatVarArgs &sx, Rnd r, double p) relax - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - const FloatVarArgs & + const FloatVarArgs & sx - Rnd + Rnd r @@ -4756,32 +5090,32 @@ - + - + GECODE_FLOAT_EXPORT void GECODE_FLOAT_EXPORT void Gecode::trace - (Home home, const FloatVarArgs &x, TraceFilter tf, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_DONE), FloatTracer &t=StdFloatTracer::def) + (Home home, const FloatVarArgs &x, TraceFilter tf, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE), FloatTracer &t=StdFloatTracer::def) trace - Home + Home home - const FloatVarArgs & + const FloatVarArgs & x - TraceFilter + TraceFilter tf int te - (TE_INIT|TE_PRUNE|TE_FIX|TE_DONE) + (TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE) - FloatTracer & + FloatTracer & t StdFloatTracer::def @@ -4791,10 +5125,10 @@ - + - IntAssign + IntAssign IntAssign Gecode::INT_ASSIGN_MIN (void) INT_ASSIGN_MIN @@ -4807,10 +5141,10 @@ - + - IntAssign + IntAssign IntAssign Gecode::INT_ASSIGN_MED (void) INT_ASSIGN_MED @@ -4823,10 +5157,10 @@ - + - IntAssign + IntAssign IntAssign Gecode::INT_ASSIGN_MAX (void) INT_ASSIGN_MAX @@ -4839,15 +5173,15 @@ - + - IntAssign + IntAssign IntAssign Gecode::INT_ASSIGN_RND (Rnd r) INT_ASSIGN_RND - Rnd + Rnd r @@ -4856,21 +5190,21 @@ - + - - IntAssign + + IntAssign IntAssign Gecode::INT_ASSIGN - (IntBranchVal v, IntBranchCommit c=NULL) + (IntBranchVal v, IntBranchCommit c=nullptr) INT_ASSIGN - IntBranchVal + IntBranchVal v - IntBranchCommit + IntBranchCommit c - NULL + nullptr Select value as defined by the value function v and commit function c. @@ -4878,21 +5212,70 @@ Uses a commit function as default that posts the constraint that a variable x must be equal to the value n. - + - - IntAssign - IntAssign Gecode::INT_ASSIGN - (BoolBranchVal v, BoolBranchCommit c=NULL) - INT_ASSIGN + + BoolAssign + BoolAssign Gecode::BOOL_ASSIGN_MIN + (void) + BOOL_ASSIGN_MIN - BoolBranchVal + void + + +Select smallest value. + + + + + + + + BoolAssign + BoolAssign Gecode::BOOL_ASSIGN_MAX + (void) + BOOL_ASSIGN_MAX + + void + + +Select largest value. + + + + + + + + BoolAssign + BoolAssign Gecode::BOOL_ASSIGN_RND + (Rnd r) + BOOL_ASSIGN_RND + + Rnd + r + + +Select random value. + + + + + + + + BoolAssign + BoolAssign Gecode::BOOL_ASSIGN + (BoolBranchVal v, BoolBranchCommit c=nullptr) + BOOL_ASSIGN + + BoolBranchVal v - BoolBranchCommit + BoolBranchCommit c - NULL + nullptr Select value as defined by the value function v and commit function c. @@ -4900,10 +5283,10 @@ Uses a commit function as default that posts the constraint that a variable x must be equal to the value n. - + - IntValBranch + IntValBranch IntValBranch Gecode::INT_VAL_MIN (void) INT_VAL_MIN @@ -4916,10 +5299,10 @@ - + - IntValBranch + IntValBranch IntValBranch Gecode::INT_VAL_MED (void) INT_VAL_MED @@ -4932,10 +5315,10 @@ - + - IntValBranch + IntValBranch IntValBranch Gecode::INT_VAL_MAX (void) INT_VAL_MAX @@ -4948,15 +5331,15 @@ - + - IntValBranch + IntValBranch IntValBranch Gecode::INT_VAL_RND (Rnd r) INT_VAL_RND - Rnd + Rnd r @@ -4965,10 +5348,10 @@ - + - IntValBranch + IntValBranch IntValBranch Gecode::INT_VAL_SPLIT_MIN (void) INT_VAL_SPLIT_MIN @@ -4981,10 +5364,10 @@ - + - IntValBranch + IntValBranch IntValBranch Gecode::INT_VAL_SPLIT_MAX (void) INT_VAL_SPLIT_MAX @@ -4997,10 +5380,10 @@ - + - IntValBranch + IntValBranch IntValBranch Gecode::INT_VAL_RANGE_MIN (void) INT_VAL_RANGE_MIN @@ -5013,10 +5396,10 @@ - + - IntValBranch + IntValBranch IntValBranch Gecode::INT_VAL_RANGE_MAX (void) INT_VAL_RANGE_MAX @@ -5029,19 +5412,19 @@ - + - - IntValBranch + + IntValBranch IntValBranch Gecode::INT_VAL - (IntBranchVal v, IntBranchCommit c=NULL) + (IntBranchVal v, IntBranchCommit c=nullptr) INT_VAL - IntBranchVal + IntBranchVal v - IntBranchCommit + IntBranchCommit c @@ -5050,31 +5433,10 @@ - - - - IntValBranch - IntValBranch Gecode::INT_VAL - (BoolBranchVal v, BoolBranchCommit c=NULL) - INT_VAL - - BoolBranchVal - v - - - BoolBranchCommit - c - - -Select value as defined by the value function v and commit function c Uses a commit function as default that posts the constraints that a variable x must be equal to a value n for the first alternative and that x must be different from n for the second alternative. - - - - - + - IntValBranch + IntValBranch IntValBranch Gecode::INT_VALUES_MIN (void) INT_VALUES_MIN @@ -5087,10 +5449,10 @@ - + - IntValBranch + IntValBranch IntValBranch Gecode::INT_VALUES_MAX (void) INT_VALUES_MAX @@ -5103,78 +5465,80 @@ - + - - IntValBranch - IntValBranch Gecode::INT_VAL_NEAR_MIN - (IntSharedArray n) - INT_VAL_NEAR_MIN + + BoolValBranch + BoolValBranch Gecode::BOOL_VAL_MIN + (void) + BOOL_VAL_MIN - IntSharedArray - n + void -Try value nearest to a given value for a variable, in case of ties use the smaller value. +Select smallest value. - + - - IntValBranch - IntValBranch Gecode::INT_VAL_NEAR_MAX - (IntSharedArray n) - INT_VAL_NEAR_MAX + + BoolValBranch + BoolValBranch Gecode::BOOL_VAL_MAX + (void) + BOOL_VAL_MAX - IntSharedArray - n + void -Try value nearest to a given value for a variable, in case of ties use the larger value. +Select largest value. - + - - IntValBranch - IntValBranch Gecode::INT_VAL_NEAR_INC - (IntSharedArray n) - INT_VAL_NEAR_INC + + BoolValBranch + BoolValBranch Gecode::BOOL_VAL_RND + (Rnd r) + BOOL_VAL_RND - IntSharedArray - n + Rnd + r -Try value larger than a given value for a variable first. +Select random value. - + - - IntValBranch - IntValBranch Gecode::INT_VAL_NEAR_DEC - (IntSharedArray n) - INT_VAL_NEAR_DEC + + BoolValBranch + BoolValBranch Gecode::BOOL_VAL + (BoolBranchVal v, BoolBranchCommit c=nullptr) + BOOL_VAL - IntSharedArray - n + BoolBranchVal + v + + + BoolBranchCommit + c -Try value smaller than a given value for a variable first. +Select value as defined by the value function v and commit function c Uses a commit function as default that posts the constraints that a variable x must be equal to a value n for the first alternative and that x must be different from n for the second alternative. - + - IntVarBranch + IntVarBranch IntVarBranch Gecode::INT_VAR_NONE (void) INT_VAR_NONE @@ -5187,15 +5551,15 @@ - + - IntVarBranch + IntVarBranch IntVarBranch Gecode::INT_VAR_RND (Rnd r) INT_VAR_RND - Rnd + Rnd r @@ -5204,19 +5568,19 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_MERIT_MIN - (IntBranchMerit bm, BranchTbl tbl=NULL) + (IntBranchMerit bm, BranchTbl tbl=nullptr) INT_VAR_MERIT_MIN - IntBranchMerit + IntBranchMerit bm - BranchTbl + BranchTbl tbl @@ -5225,40 +5589,19 @@ - + - - IntVarBranch - IntVarBranch Gecode::INT_VAR_MERIT_MIN - (BoolBranchMerit bm, BranchTbl tbl=NULL) - INT_VAR_MERIT_MIN - - BoolBranchMerit - bm - - - BranchTbl - tbl - - -Select variable with least merit according to branch merit function bm. - - - - - - - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_MERIT_MAX - (IntBranchMerit bm, BranchTbl tbl=NULL) + (IntBranchMerit bm, BranchTbl tbl=nullptr) INT_VAR_MERIT_MAX - IntBranchMerit + IntBranchMerit bm - BranchTbl + BranchTbl tbl @@ -5267,36 +5610,15 @@ - + - - IntVarBranch - IntVarBranch Gecode::INT_VAR_MERIT_MAX - (BoolBranchMerit bm, BranchTbl tbl=NULL) - INT_VAR_MERIT_MAX - - BoolBranchMerit - bm - - - BranchTbl - tbl - - -Select variable with highest merit according to branch merit function bm. - - - - - - - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_DEGREE_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_DEGREE_MIN - BranchTbl + BranchTbl tbl @@ -5305,15 +5627,15 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_DEGREE_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_DEGREE_MAX - BranchTbl + BranchTbl tbl @@ -5322,19 +5644,19 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_AFC_MIN - (double d=1.0, BranchTbl tbl=NULL) + (double d=1.0, BranchTbl tbl=nullptr) INT_VAR_AFC_MIN double d - BranchTbl + BranchTbl tbl @@ -5343,19 +5665,19 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_AFC_MIN - (IntAFC a, BranchTbl tbl=NULL) + (IntAFC a, BranchTbl tbl=nullptr) INT_VAR_AFC_MIN - IntAFC + IntAFC a - BranchTbl + BranchTbl tbl @@ -5364,19 +5686,19 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_AFC_MAX - (double d=1.0, BranchTbl tbl=NULL) + (double d=1.0, BranchTbl tbl=nullptr) INT_VAR_AFC_MAX double d - BranchTbl + BranchTbl tbl @@ -5385,19 +5707,19 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_AFC_MAX - (IntAFC a, BranchTbl tbl=NULL) + (IntAFC a, BranchTbl tbl=nullptr) INT_VAR_AFC_MAX - IntAFC + IntAFC a - BranchTbl + BranchTbl tbl @@ -5406,99 +5728,175 @@ - + - - IntVarBranch - IntVarBranch Gecode::INT_VAR_ACTIVITY_MIN - (double d=1.0, BranchTbl tbl=NULL) - INT_VAR_ACTIVITY_MIN + + IntVarBranch + IntVarBranch Gecode::INT_VAR_ACTION_MIN + (double d=1.0, BranchTbl tbl=nullptr) + INT_VAR_ACTION_MIN double d - BranchTbl + BranchTbl tbl -Select variable with lowest activity with decay factor d. +Select variable with lowest action with decay factor d. - + - - IntVarBranch - IntVarBranch Gecode::INT_VAR_ACTIVITY_MIN - (IntActivity a, BranchTbl tbl=NULL) - INT_VAR_ACTIVITY_MIN + + IntVarBranch + IntVarBranch Gecode::INT_VAR_ACTION_MIN + (IntAction a, BranchTbl tbl=nullptr) + INT_VAR_ACTION_MIN - IntActivity + IntAction a - BranchTbl + BranchTbl tbl -Select variable with lowest activity. +Select variable with lowest action. - + - - IntVarBranch - IntVarBranch Gecode::INT_VAR_ACTIVITY_MAX - (double d=1.0, BranchTbl tbl=NULL) - INT_VAR_ACTIVITY_MAX + + IntVarBranch + IntVarBranch Gecode::INT_VAR_ACTION_MAX + (double d=1.0, BranchTbl tbl=nullptr) + INT_VAR_ACTION_MAX double d - BranchTbl + BranchTbl tbl -Select variable with highest activity with decay factor d. +Select variable with highest action with decay factor d. - + - - IntVarBranch - IntVarBranch Gecode::INT_VAR_ACTIVITY_MAX - (IntActivity a, BranchTbl tbl=NULL) - INT_VAR_ACTIVITY_MAX + + IntVarBranch + IntVarBranch Gecode::INT_VAR_ACTION_MAX + (IntAction a, BranchTbl tbl=nullptr) + INT_VAR_ACTION_MAX - IntActivity + IntAction a - BranchTbl + BranchTbl tbl -Select variable with highest activity. +Select variable with highest action. - + - - IntVarBranch + + IntVarBranch + IntVarBranch Gecode::INT_VAR_CHB_MIN + (IntCHB c, BranchTbl tbl=nullptr) + INT_VAR_CHB_MIN + + IntCHB + c + + + BranchTbl + tbl + + +Select variable with lowest CHB Q-score. + + + + + + + + IntVarBranch + IntVarBranch Gecode::INT_VAR_CHB_MIN + (BranchTbl tbl=nullptr) + INT_VAR_CHB_MIN + + BranchTbl + tbl + + +Select variable with lowest CHB Q-score. + + + + + + + + IntVarBranch + IntVarBranch Gecode::INT_VAR_CHB_MAX + (IntCHB c, BranchTbl tbl=nullptr) + INT_VAR_CHB_MAX + + IntCHB + c + + + BranchTbl + tbl + + +Select variable with largest CHB Q-score. + + + + + + + + IntVarBranch + IntVarBranch Gecode::INT_VAR_CHB_MAX + (BranchTbl tbl=nullptr) + INT_VAR_CHB_MAX + + BranchTbl + tbl + + +Select variable with largest CHB Q-score. + + + + + + + + IntVarBranch IntVarBranch Gecode::INT_VAR_MIN_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_MIN_MIN - BranchTbl + BranchTbl tbl @@ -5507,15 +5905,15 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_MIN_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_MIN_MAX - BranchTbl + BranchTbl tbl @@ -5524,15 +5922,15 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_MAX_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_MAX_MIN - BranchTbl + BranchTbl tbl @@ -5541,15 +5939,15 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_MAX_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_MAX_MAX - BranchTbl + BranchTbl tbl @@ -5558,15 +5956,15 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_SIZE_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_SIZE_MIN - BranchTbl + BranchTbl tbl @@ -5575,15 +5973,15 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_SIZE_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_SIZE_MAX - BranchTbl + BranchTbl tbl @@ -5592,15 +5990,15 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_DEGREE_SIZE_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_DEGREE_SIZE_MIN - BranchTbl + BranchTbl tbl @@ -5609,15 +6007,15 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_DEGREE_SIZE_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_DEGREE_SIZE_MAX - BranchTbl + BranchTbl tbl @@ -5626,19 +6024,19 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_AFC_SIZE_MIN - (double d=1.0, BranchTbl tbl=NULL) + (double d=1.0, BranchTbl tbl=nullptr) INT_VAR_AFC_SIZE_MIN double d - BranchTbl + BranchTbl tbl @@ -5647,19 +6045,19 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_AFC_SIZE_MIN - (IntAFC a, BranchTbl tbl=NULL) + (IntAFC a, BranchTbl tbl=nullptr) INT_VAR_AFC_SIZE_MIN - IntAFC + IntAFC a - BranchTbl + BranchTbl tbl @@ -5668,19 +6066,19 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_AFC_SIZE_MAX - (double d=1.0, BranchTbl tbl=NULL) + (double d=1.0, BranchTbl tbl=nullptr) INT_VAR_AFC_SIZE_MAX double d - BranchTbl + BranchTbl tbl @@ -5689,19 +6087,19 @@ - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_AFC_SIZE_MAX - (IntAFC a, BranchTbl tbl=NULL) + (IntAFC a, BranchTbl tbl=nullptr) INT_VAR_AFC_SIZE_MAX - IntAFC + IntAFC a - BranchTbl + BranchTbl tbl @@ -5710,101 +6108,177 @@ - + - - IntVarBranch - IntVarBranch Gecode::INT_VAR_ACTIVITY_SIZE_MIN - (double d=1.0, BranchTbl tbl=NULL) - INT_VAR_ACTIVITY_SIZE_MIN + + IntVarBranch + IntVarBranch Gecode::INT_VAR_ACTION_SIZE_MIN + (double d=1.0, BranchTbl tbl=nullptr) + INT_VAR_ACTION_SIZE_MIN double d - BranchTbl + BranchTbl tbl -Select variable with smallest activity divided by domain size with decay factor d. +Select variable with smallest action divided by domain size with decay factor d. - + - - IntVarBranch - IntVarBranch Gecode::INT_VAR_ACTIVITY_SIZE_MIN - (IntActivity a, BranchTbl tbl=NULL) - INT_VAR_ACTIVITY_SIZE_MIN + + IntVarBranch + IntVarBranch Gecode::INT_VAR_ACTION_SIZE_MIN + (IntAction a, BranchTbl tbl=nullptr) + INT_VAR_ACTION_SIZE_MIN - IntActivity + IntAction a - BranchTbl + BranchTbl tbl -Select variable with smallest activity divided by domain size. +Select variable with smallest action divided by domain size. - + - - IntVarBranch - IntVarBranch Gecode::INT_VAR_ACTIVITY_SIZE_MAX - (double d=1.0, BranchTbl tbl=NULL) - INT_VAR_ACTIVITY_SIZE_MAX + + IntVarBranch + IntVarBranch Gecode::INT_VAR_ACTION_SIZE_MAX + (double d=1.0, BranchTbl tbl=nullptr) + INT_VAR_ACTION_SIZE_MAX double d - BranchTbl + BranchTbl tbl -Select variable with largest activity divided by domain size with decay factor d. +Select variable with largest action divided by domain size with decay factor d. - + - - IntVarBranch - IntVarBranch Gecode::INT_VAR_ACTIVITY_SIZE_MAX - (IntActivity a, BranchTbl tbl=NULL) - INT_VAR_ACTIVITY_SIZE_MAX + + IntVarBranch + IntVarBranch Gecode::INT_VAR_ACTION_SIZE_MAX + (IntAction a, BranchTbl tbl=nullptr) + INT_VAR_ACTION_SIZE_MAX - IntActivity + IntAction a - BranchTbl + BranchTbl tbl -Select variable with largest activity divided by domain size. +Select variable with largest action divided by domain size. - + - - IntVarBranch + + IntVarBranch + IntVarBranch Gecode::INT_VAR_CHB_SIZE_MIN + (IntCHB c, BranchTbl tbl=nullptr) + INT_VAR_CHB_SIZE_MIN + + IntCHB + c + + + BranchTbl + tbl + + +Select variable with smallest CHB Q-score divided by domain size. + + + + + + + + IntVarBranch + IntVarBranch Gecode::INT_VAR_CHB_SIZE_MIN + (BranchTbl tbl=nullptr) + INT_VAR_CHB_SIZE_MIN + + BranchTbl + tbl + + +Select variable with smallest CHB Q-score divided by domain size. + + + + + + + + IntVarBranch + IntVarBranch Gecode::INT_VAR_CHB_SIZE_MAX + (IntCHB c, BranchTbl tbl=nullptr) + INT_VAR_CHB_SIZE_MAX + + IntCHB + c + + + BranchTbl + tbl + + +Select variable with largest CHB Q-score divided by domain size. + + + + + + + + IntVarBranch + IntVarBranch Gecode::INT_VAR_CHB_SIZE_MAX + (BranchTbl tbl=nullptr) + INT_VAR_CHB_SIZE_MAX + + BranchTbl + tbl + + +Select variable with largest CHB Q-score divided by domain size. + + + + + + + + IntVarBranch IntVarBranch Gecode::INT_VAR_REGRET_MIN_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_REGRET_MIN_MIN - BranchTbl + BranchTbl tbl - NULL + nullptr Select variable with smallest min-regret. @@ -5812,17 +6286,17 @@ The min-regret of a variable is the difference between the smallest and second-smallest value still in the domain. - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_REGRET_MIN_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_REGRET_MIN_MAX - BranchTbl + BranchTbl tbl - NULL + nullptr Select variable with largest min-regret. @@ -5830,17 +6304,17 @@ The min-regret of a variable is the difference between the smallest and second-smallest value still in the domain. - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_REGRET_MAX_MIN - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_REGRET_MAX_MIN - BranchTbl + BranchTbl tbl - NULL + nullptr Select variable with smallest max-regret. @@ -5848,17 +6322,17 @@ The max-regret of a variable is the difference between the largest and second-largest value still in the domain. - + - - IntVarBranch + + IntVarBranch IntVarBranch Gecode::INT_VAR_REGRET_MAX_MAX - (BranchTbl tbl=NULL) + (BranchTbl tbl=nullptr) INT_VAR_REGRET_MAX_MAX - BranchTbl + BranchTbl tbl - NULL + nullptr Select variable with largest max-regret. @@ -5866,7 +6340,389 @@ The max-regret of a variable is the difference between the largest and second-largest value still in the domain. - + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_NONE + (void) + BOOL_VAR_NONE + + void + + +Select first unassigned variable. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_RND + (Rnd r) + BOOL_VAR_RND + + Rnd + r + + +Select random variable (uniform distribution, for tie breaking) + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_MERIT_MIN + (BoolBranchMerit bm, BranchTbl tbl=nullptr) + BOOL_VAR_MERIT_MIN + + BoolBranchMerit + bm + + + BranchTbl + tbl + + +Select variable with least merit according to branch merit function bm. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_MERIT_MAX + (BoolBranchMerit bm, BranchTbl tbl=nullptr) + BOOL_VAR_MERIT_MAX + + BoolBranchMerit + bm + + + BranchTbl + tbl + + +Select variable with highest merit according to branch merit function bm. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_DEGREE_MIN + (BranchTbl tbl=nullptr) + BOOL_VAR_DEGREE_MIN + + BranchTbl + tbl + + +Select variable with smallest degree. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_DEGREE_MAX + (BranchTbl tbl=nullptr) + BOOL_VAR_DEGREE_MAX + + BranchTbl + tbl + + +Select variable with largest degree. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_AFC_MIN + (double d=1.0, BranchTbl tbl=nullptr) + BOOL_VAR_AFC_MIN + + double + d + + + BranchTbl + tbl + + +Select variable with smallest accumulated failure count with decay factor d. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_AFC_MIN + (BoolAFC a, BranchTbl tbl=nullptr) + BOOL_VAR_AFC_MIN + + BoolAFC + a + + + BranchTbl + tbl + + +Select variable with smallest accumulated failure count. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_AFC_MAX + (double d=1.0, BranchTbl tbl=nullptr) + BOOL_VAR_AFC_MAX + + double + d + + + BranchTbl + tbl + + +Select variable with largest accumulated failure count with decay factor d. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_AFC_MAX + (BoolAFC a, BranchTbl tbl=nullptr) + BOOL_VAR_AFC_MAX + + BoolAFC + a + + + BranchTbl + tbl + + +Select variable with largest accumulated failure count. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_ACTION_MIN + (double d=1.0, BranchTbl tbl=nullptr) + BOOL_VAR_ACTION_MIN + + double + d + + + BranchTbl + tbl + + +Select variable with lowest action with decay factor d. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_ACTION_MIN + (BoolAction a, BranchTbl tbl=nullptr) + BOOL_VAR_ACTION_MIN + + BoolAction + a + + + BranchTbl + tbl + + +Select variable with lowest action. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_ACTION_MAX + (double d=1.0, BranchTbl tbl=nullptr) + BOOL_VAR_ACTION_MAX + + double + d + + + BranchTbl + tbl + + +Select variable with highest action with decay factor d. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_ACTION_MAX + (BoolAction a, BranchTbl tbl=nullptr) + BOOL_VAR_ACTION_MAX + + BoolAction + a + + + BranchTbl + tbl + + +Select variable with highest action. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_CHB_MIN + (BoolCHB c, BranchTbl tbl=nullptr) + BOOL_VAR_CHB_MIN + + BoolCHB + c + + + BranchTbl + tbl + + +Select variable with lowest CHB Q-score. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_CHB_MIN + (BranchTbl tbl=nullptr) + BOOL_VAR_CHB_MIN + + BranchTbl + tbl + + +Select variable with lowest CHB Q-score. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_CHB_MAX + (BoolCHB c, BranchTbl tbl=nullptr) + BOOL_VAR_CHB_MAX + + BoolCHB + c + + + BranchTbl + tbl + + +Select variable with largest CHB Q-score. + + + + + + + + BoolVarBranch + BoolVarBranch Gecode::BOOL_VAR_CHB_MAX + (BranchTbl tbl=nullptr) + BOOL_VAR_CHB_MAX + + BranchTbl + tbl + + +Select variable with largest CHB Q-score. + + + + + + + + forceinline void + void Gecode::channel + (Home home, IntVar x0, BoolVar x1, IntPropLevel ipl=IPL_DEF) + channel + + Home + home + + + IntVar + x0 + + + BoolVar + x1 + + + IntPropLevel + ipl + + +Post domain consistent propagator for channeling an integer and a Boolean variable $ x_0 = x_1$. + + + + + @@ -5886,7 +6742,7 @@ os - const DFA & + const DFA & d @@ -5895,7 +6751,7 @@ - + @@ -5918,7 +6774,7 @@ os - const TupleSet & + const TupleSet & ts @@ -5927,7 +6783,7 @@ - + @@ -5947,7 +6803,7 @@ os - const IntSet & + const IntSet & is @@ -5956,15 +6812,15 @@ - + - forceinline IntPropLevel + forceinline IntPropLevel IntPropLevel Gecode::vbd (IntPropLevel ipl) vbd - IntPropLevel + IntPropLevel ipl @@ -5973,15 +6829,15 @@ - + - forceinline IntPropLevel + forceinline IntPropLevel IntPropLevel Gecode::sm (IntPropLevel ipl) sm - IntPropLevel + IntPropLevel ipl @@ -5990,15 +6846,15 @@ - + - forceinline IntPropLevel + forceinline IntPropLevel IntPropLevel Gecode::ba (IntPropLevel ipl) ba - IntPropLevel + IntPropLevel ipl @@ -6007,15 +6863,49 @@ - + + + + forceinline IntRelType + IntRelType Gecode::swap + (IntRelType irt) + swap + + IntRelType + irt + + +Return swapped relation type of irt. + + + + + + + + forceinline IntRelType + IntRelType Gecode::neg + (IntRelType irt) + neg + + IntRelType + irt + + +Return negated relation type of irt. + + + + + - forceinline Reify + forceinline Reify Reify Gecode::eqv (BoolVar x) eqv - BoolVar + BoolVar x @@ -6024,15 +6914,15 @@ - + - forceinline Reify + forceinline Reify Reify Gecode::imp (BoolVar x) imp - BoolVar + BoolVar x @@ -6041,15 +6931,15 @@ - + - forceinline Reify + forceinline Reify Reify Gecode::pmi (BoolVar x) pmi - BoolVar + BoolVar x @@ -6058,19 +6948,19 @@ - + - + void void Gecode::trace - (Home home, const IntVarArgs &x, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_DONE), IntTracer &t=StdIntTracer::def) + (Home home, const IntVarArgs &x, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE), IntTracer &t=StdIntTracer::def) trace - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -6078,7 +6968,7 @@ te - IntTracer & + IntTracer & t @@ -6087,19 +6977,19 @@ - + - + void void Gecode::trace - (Home home, const BoolVarArgs &x, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_DONE), BoolTracer &t=StdBoolTracer::def) + (Home home, const BoolVarArgs &x, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE), BoolTracer &t=StdBoolTracer::def) trace - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x @@ -6107,7 +6997,7 @@ te - BoolTracer & + BoolTracer & t @@ -6116,7 +7006,7 @@ - + @@ -6136,7 +7026,7 @@ os - const IntVar & + const IntVar & x @@ -6145,7 +7035,7 @@ - + @@ -6165,7 +7055,7 @@ os - const BoolVar & + const BoolVar & x @@ -6174,7 +7064,7 @@ - + GECODE_INT_EXPORT void @@ -6182,11 +7072,11 @@ (Home home, IntVar x, int n, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - IntVar + IntVar x @@ -6194,17 +7084,17 @@ n - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Propagates $x=n$. +Propagates $x=n$. - + GECODE_INT_EXPORT void @@ -6212,11 +7102,11 @@ (Home home, const IntVarArgs &x, int n, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -6224,17 +7114,17 @@ n - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Propagates $ x_i=n$ for all $0\leq i<|x|$. +Propagates $ x_i=n$ for all $0\leq i<|x|$. - + GECODE_INT_EXPORT void @@ -6242,11 +7132,11 @@ (Home home, IntVar x, int l, int m, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - IntVar + IntVar x @@ -6258,17 +7148,17 @@ m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Propagates $ l\leq x\leq m$. +Propagates $ l\leq x\leq m$. - + GECODE_INT_EXPORT void @@ -6276,11 +7166,11 @@ (Home home, const IntVarArgs &x, int l, int m, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -6292,17 +7182,17 @@ m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Propagates $ l\leq x_i\leq m$ for all $0\leq i<|x|$. +Propagates $ l\leq x_i\leq m$ for all $0\leq i<|x|$. - + GECODE_INT_EXPORT void @@ -6310,29 +7200,29 @@ (Home home, IntVar x, const IntSet &s, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - IntVar + IntVar x - const IntSet & + const IntSet & s - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Propagates $ x\in s $. +Propagates $ x\in s $. - + GECODE_INT_EXPORT void @@ -6340,29 +7230,29 @@ (Home home, const IntVarArgs &x, const IntSet &s, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntSet & + const IntSet & s - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Propagates $ x_i\in s$ for all $0\leq i<|x|$. +Propagates $ x_i\in s$ for all $0\leq i<|x|$. - + GECODE_INT_EXPORT void @@ -6370,11 +7260,11 @@ (Home home, IntVar x, int n, Reify r, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - IntVar + IntVar x @@ -6382,21 +7272,21 @@ n - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ (x=n) \equiv r$. +Post domain consistent propagator for $ (x=n) \equiv r$. - + GECODE_INT_EXPORT void @@ -6404,11 +7294,11 @@ (Home home, IntVar x, int l, int m, Reify r, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - IntVar + IntVar x @@ -6420,21 +7310,21 @@ m - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ (l\leq x \leq m) \equiv r$. +Post domain consistent propagator for $ (l\leq x \leq m) \equiv r$. - + GECODE_INT_EXPORT void @@ -6442,33 +7332,33 @@ (Home home, IntVar x, const IntSet &s, Reify r, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - IntVar + IntVar x - const IntSet & + const IntSet & s - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ (x \in s) \equiv r$. +Post domain consistent propagator for $ (x \in s) \equiv r$. - + GECODE_INT_EXPORT void @@ -6476,21 +7366,21 @@ (Home home, IntVar x, IntVar d, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - IntVar + IntVar x - IntVar + IntVar d - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Constrain domain of x according to domain of d. @@ -6498,7 +7388,7 @@ - + GECODE_INT_EXPORT void @@ -6506,21 +7396,21 @@ (Home home, BoolVar x, BoolVar d, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - BoolVar + BoolVar x - BoolVar + BoolVar d - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Constrain domain of x according to domain of d. @@ -6528,7 +7418,7 @@ - + GECODE_INT_EXPORT void @@ -6536,29 +7426,29 @@ (Home home, const IntVarArgs &x, const IntVarArgs &d, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntVarArgs & + const IntVarArgs & d - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Constrain domain of $ x_i $ according to domain of $ d_i $ for all $0\leq i<|x|$. +Constrain domain of $ x_i $ according to domain of $ d_i $ for all $0\leq i<|x|$. - + GECODE_INT_EXPORT void @@ -6566,29 +7456,29 @@ (Home home, const BoolVarArgs &x, const BoolVarArgs &d, IntPropLevel ipl=IPL_DEF) dom - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - const BoolVarArgs & + const BoolVarArgs & d - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Constrain domain of $ x_i $ according to domain of $ d_i $ for all $0\leq i<|x|$. +Constrain domain of $ x_i $ according to domain of $ d_i $ for all $0\leq i<|x|$. - + GECODE_INT_EXPORT void @@ -6596,33 +7486,33 @@ (Home home, IntVar x0, IntRelType irt, IntVar x1, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - IntVar + IntVar x0 - IntRelType + IntRelType irt - IntVar + IntVar x1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ x_0 \sim_{irt} x_1$. +Post propagator for $ x_0 \sim_{irt} x_1$. Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -6630,33 +7520,33 @@ (Home home, const IntVarArgs &x, IntRelType irt, IntVar y, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt - IntVar + IntVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ x_i \sim_{irt} y $ for all $0\leq i<|x|$. +Post propagator for $ x_i \sim_{irt} y $ for all $0\leq i<|x|$. Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -6664,15 +7554,15 @@ (Home home, IntVar x, IntRelType irt, int c, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - IntVar + IntVar x - IntRelType + IntRelType irt @@ -6680,17 +7570,17 @@ c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Propagates $ x \sim_{irt} c$. +Propagates $ x \sim_{irt} c$. - + GECODE_INT_EXPORT void @@ -6698,15 +7588,15 @@ (Home home, const IntVarArgs &x, IntRelType irt, int c, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt @@ -6714,17 +7604,17 @@ c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Propagates $ x_i \sim_{irt} c $ for all $0\leq i<|x|$. +Propagates $ x_i \sim_{irt} c $ for all $0\leq i<|x|$. - + GECODE_INT_EXPORT void @@ -6732,37 +7622,37 @@ (Home home, IntVar x0, IntRelType irt, IntVar x1, Reify r, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - IntVar + IntVar x0 - IntRelType + IntRelType irt - IntVar + IntVar x1 - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ (x_0 \sim_{irt} x_1)\equiv r$. +Post propagator for $ (x_0 \sim_{irt} x_1)\equiv r$. Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -6770,15 +7660,15 @@ (Home home, IntVar x, IntRelType irt, int c, Reify r, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - IntVar + IntVar x - IntRelType + IntRelType irt @@ -6786,21 +7676,21 @@ c - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $(x \sim_{irt} c)\equiv r$. +Post propagator for $(x \sim_{irt} c)\equiv r$. Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -6808,21 +7698,21 @@ (Home home, const IntVarArgs &x, IntRelType irt, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator for relation among elements in x. @@ -6832,7 +7722,7 @@ - + GECODE_INT_EXPORT void @@ -6840,25 +7730,25 @@ (Home home, const IntVarArgs &x, IntRelType irt, const IntVarArgs &y, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt - const IntVarArgs & + const IntVarArgs & y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator for relation between x and y. @@ -6866,7 +7756,75 @@ Note that for the inequality relations this corresponds to the lexical order between x and y.Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default).Note that the constraint is also defined if x and y are of different size. That means that if x and y are of different size, then if r = IRT_EQ the constraint is false and if r = IRT_NQ the constraint is subsumed. - + + + + GECODE_INT_EXPORT void + GECODE_INT_EXPORT void Gecode::rel + (Home home, const IntVarArgs &x, IntRelType irt, const IntArgs &y, IntPropLevel ipl=IPL_DEF) + rel + + Home + home + + + const IntVarArgs & + x + + + IntRelType + irt + + + const IntArgs & + y + + + IntPropLevel + ipl + IPL_DEF + + +Post propagator for relation between x and y. + +Note that for the inequality relations this corresponds to the lexical order between x and y.Supports domain consistency.Note that the constraint is also defined if x and y are of different size. That means that if x and y are of different size, then if r = IRT_EQ the constraint is false and if r = IRT_NQ the constraint is subsumed. + + + + + + GECODE_INT_EXPORT void + GECODE_INT_EXPORT void Gecode::rel + (Home home, const IntArgs &x, IntRelType irt, const IntVarArgs &y, IntPropLevel ipl=IPL_DEF) + rel + + Home + home + + + const IntArgs & + x + + + IntRelType + irt + + + const IntVarArgs & + y + + + IntPropLevel + ipl + IPL_DEF + + +Post propagator for relation between x and y. + +Note that for the inequality relations this corresponds to the lexical order between x and y.Supports domain consistency.Note that the constraint is also defined if x and y are of different size. That means that if x and y are of different size, then if r = IRT_EQ the constraint is false and if r = IRT_NQ the constraint is subsumed. + + + GECODE_INT_EXPORT void @@ -6874,33 +7832,33 @@ (Home home, BoolVar x0, IntRelType irt, BoolVar x1, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - BoolVar + BoolVar x0 - IntRelType + IntRelType irt - BoolVar + BoolVar x1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ x_0 \sim_{irt} x_1$. +Post domain consistent propagator for $ x_0 \sim_{irt} x_1$. - + GECODE_INT_EXPORT void @@ -6908,37 +7866,37 @@ (Home home, BoolVar x0, IntRelType irt, BoolVar x1, Reify r, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - BoolVar + BoolVar x0 - IntRelType + IntRelType irt - BoolVar + BoolVar x1 - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $(x_0 \sim_{irt} x_1)\equiv r$. +Post domain consistent propagator for $(x_0 \sim_{irt} x_1)\equiv r$. - + GECODE_INT_EXPORT void @@ -6946,33 +7904,33 @@ (Home home, const BoolVarArgs &x, IntRelType irt, BoolVar y, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt - BoolVar + BoolVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ x_i \sim_{irt} y $ for all $0\leq i<|x|$. +Post domain consistent propagator for $ x_i \sim_{irt} y $ for all $0\leq i<|x|$. - + GECODE_INT_EXPORT void @@ -6980,15 +7938,15 @@ (Home home, BoolVar x, IntRelType irt, int n, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - BoolVar + BoolVar x - IntRelType + IntRelType irt @@ -6996,17 +7954,17 @@ n - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Propagates $ x \sim_{irt} n$. +Propagates $ x \sim_{irt} n$. Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1. - + GECODE_INT_EXPORT void @@ -7014,15 +7972,15 @@ (Home home, BoolVar x, IntRelType irt, int n, Reify r, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - BoolVar + BoolVar x - IntRelType + IntRelType irt @@ -7030,21 +7988,21 @@ n - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $(x \sim_{irt} n)\equiv r$. +Post domain consistent propagator for $(x \sim_{irt} n)\equiv r$. Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1. - + GECODE_INT_EXPORT void @@ -7052,15 +8010,15 @@ (Home home, const BoolVarArgs &x, IntRelType irt, int n, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt @@ -7068,17 +8026,17 @@ n - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Propagates $ x_i \sim_{irt} n $ for all $0\leq i<|x|$. +Propagates $ x_i \sim_{irt} n $ for all $0\leq i<|x|$. Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1. - + GECODE_INT_EXPORT void @@ -7086,25 +8044,25 @@ (Home home, const BoolVarArgs &x, IntRelType irt, const BoolVarArgs &y, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt - const BoolVarArgs & + const BoolVarArgs & y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post domain consistent propagator for relation between x and y. @@ -7112,7 +8070,75 @@ Note that for the inequality relations this corresponds to the lexical order between x and y.Note that the constraint is also defined if x and y are of different size. That means that if x and y are of different size, then if r = IRT_EQ the constraint is false and if r = IRT_NQ the constraint is subsumed. - + + + + GECODE_INT_EXPORT void + GECODE_INT_EXPORT void Gecode::rel + (Home home, const BoolVarArgs &x, IntRelType irt, const IntArgs &y, IntPropLevel ipl=IPL_DEF) + rel + + Home + home + + + const BoolVarArgs & + x + + + IntRelType + irt + + + const IntArgs & + y + + + IntPropLevel + ipl + IPL_DEF + + +Post domain consistent propagator for relation between x and y. + +Note that for the inequality relations this corresponds to the lexical order between x and y.Note that the constraint is also defined if x and y are of different size. That means that if x and y are of different size, then if r = IRT_EQ the constraint is false and if r = IRT_NQ the constraint is subsumed. + + + + + + GECODE_INT_EXPORT void + GECODE_INT_EXPORT void Gecode::rel + (Home home, const IntArgs &x, IntRelType irt, const BoolVarArgs &y, IntPropLevel ipl=IPL_DEF) + rel + + Home + home + + + const IntArgs & + x + + + IntRelType + irt + + + const BoolVarArgs & + y + + + IntPropLevel + ipl + IPL_DEF + + +Post domain consistent propagator for relation between x and y. + +Note that for the inequality relations this corresponds to the lexical order between x and y.Note that the constraint is also defined if x and y are of different size. That means that if x and y are of different size, then if r = IRT_EQ the constraint is false and if r = IRT_NQ the constraint is subsumed. + + + GECODE_INT_EXPORT void @@ -7120,21 +8146,21 @@ (Home home, const BoolVarArgs &x, IntRelType irt, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post domain consistent propagator for relation between elements in x. @@ -7144,7 +8170,7 @@ - + GECODE_INT_EXPORT void @@ -7152,37 +8178,37 @@ (Home home, BoolVar x0, BoolOpType o, BoolVar x1, BoolVar x2, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - BoolVar + BoolVar x0 - BoolOpType + BoolOpType o - BoolVar + BoolVar x1 - BoolVar + BoolVar x2 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post domain consistent propagator for Boolean operation on x0 and x1. -Posts propagator for $ x_0 \diamond_{\mathit{o}} x_1 = x_2$ +Posts propagator for $ x_0 \diamond_{\mathit{o}} x_1 = x_2$ - + GECODE_INT_EXPORT void @@ -7190,19 +8216,19 @@ (Home home, BoolVar x0, BoolOpType o, BoolVar x1, int n, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - BoolVar + BoolVar x0 - BoolOpType + BoolOpType o - BoolVar + BoolVar x1 @@ -7210,17 +8236,17 @@ n - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post domain consistent propagator for Boolean operation on x0 and x1. -Posts propagator for $ x_0 \diamond_{\mathit{o}} x_1 = n$Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1. +Posts propagator for $ x_0 \diamond_{\mathit{o}} x_1 = n$Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1. - + GECODE_INT_EXPORT void @@ -7228,33 +8254,33 @@ (Home home, BoolOpType o, const BoolVarArgs &x, BoolVar y, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - BoolOpType + BoolOpType o - const BoolVarArgs & + const BoolVarArgs & x - BoolVar + BoolVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post domain consistent propagator for Boolean operation on x. -Posts propagator for $ x_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} x_{|x|-1}= y$Throws an exception of type Int::TooFewArguments, if $|x|<2$ and o is BOT_IMP, BOT_EQV, or BOT_XOR. +Posts propagator for $ x_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} x_{|x|-1}= y$Throws an exception of type Int::TooFewArguments, if $|x|<2$ and o is BOT_IMP, BOT_EQV, or BOT_XOR. - + GECODE_INT_EXPORT void @@ -7262,15 +8288,15 @@ (Home home, BoolOpType o, const BoolVarArgs &x, int n, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - BoolOpType + BoolOpType o - const BoolVarArgs & + const BoolVarArgs & x @@ -7278,17 +8304,17 @@ n - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post domain consistent propagator for Boolean operation on x. -Posts propagator for $ x_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} x_{|x|-1}= n$Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1.Throws an exception of type Int::TooFewArguments, if $|x|<2$ and o is BOT_IMP, BOT_EQV, or BOT_XOR. +Posts propagator for $ x_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} x_{|x|-1}= n$Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1.Throws an exception of type Int::TooFewArguments, if $|x|<2$ and o is BOT_IMP, BOT_EQV, or BOT_XOR. - + GECODE_INT_EXPORT void @@ -7296,37 +8322,37 @@ (Home home, BoolOpType o, const BoolVarArgs &x, const BoolVarArgs &y, BoolVar z, IntPropLevel ipl=IPL_DEF) clause - Home + Home home - BoolOpType + BoolOpType o - const BoolVarArgs & + const BoolVarArgs & x - const BoolVarArgs & + const BoolVarArgs & y - BoolVar + BoolVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post domain consistent propagator for Boolean clause with positive variables x and negative variables y. -Posts propagator for $ x_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} x_{|x|-1} \diamond_{\mathit{o}} \neg y_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} \neg y_{|y|-1}= z$Throws an exception of type Int::IllegalOperation, if o is different from BOT_AND or BOT_OR. +Posts propagator for $ x_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} x_{|x|-1} \diamond_{\mathit{o}} \neg y_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} \neg y_{|y|-1}= z$Throws an exception of type Int::IllegalOperation, if o is different from BOT_AND or BOT_OR. - + GECODE_INT_EXPORT void @@ -7334,19 +8360,19 @@ (Home home, BoolOpType o, const BoolVarArgs &x, const BoolVarArgs &y, int n, IntPropLevel ipl=IPL_DEF) clause - Home + Home home - BoolOpType + BoolOpType o - const BoolVarArgs & + const BoolVarArgs & x - const BoolVarArgs & + const BoolVarArgs & y @@ -7354,17 +8380,17 @@ n - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post domain consistent propagator for Boolean clause with positive variables x and negative variables y. -Posts propagator for $ x_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} x_{|x|-1} \diamond_{\mathit{o}} \neg y_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} \neg y_{|y|-1}= n$Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1.Throws an exception of type Int::IllegalOperation, if o is different from BOT_AND or BOT_OR. +Posts propagator for $ x_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} x_{|x|-1} \diamond_{\mathit{o}} \neg y_0 \diamond_{\mathit{o}} \cdots \diamond_{\mathit{o}} \neg y_{|y|-1}= n$Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1.Throws an exception of type Int::IllegalOperation, if o is different from BOT_AND or BOT_OR. - + GECODE_INT_EXPORT void @@ -7372,37 +8398,75 @@ (Home home, BoolVar b, IntVar x, IntVar y, IntVar z, IntPropLevel ipl=IPL_DEF) ite - Home + Home home - BoolVar + BoolVar b - IntVar + IntVar x - IntVar + IntVar y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator for if-then-else constraint. -Posts propagator for $ z = b ? x : y $ +Posts propagator for $ z = b ? x : y $Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + + + + GECODE_INT_EXPORT void + GECODE_INT_EXPORT void Gecode::ite + (Home home, BoolVar b, BoolVar x, BoolVar y, BoolVar z, IntPropLevel ipl=IPL_DEF) + ite + + Home + home + + + BoolVar + b + + + BoolVar + x + + + BoolVar + y + + + BoolVar + z + + + IntPropLevel + ipl + IPL_DEF + + +Post propagator for if-then-else constraint. + +Posts propagator for $ z = b ? x : y $ + + + GECODE_INT_EXPORT void @@ -7410,11 +8474,11 @@ (Home home, const IntVarArgs &x, int s, int t, IntPropLevel=IPL_DEF) precede - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -7426,16 +8490,16 @@ t - IntPropLevel - IPL_DEF + IntPropLevel + IPL_DEF Post propagator that s precedes t in x. -This constraint enforces that $x_0\neq t$ and $x_j=t \to \bigvee_{0\leq i<j} x_i=s$ for $0\leq j<|x|$. The propagator is domain consistent. +This constraint enforces that $x_0\neq t$ and $x_j=t \to \bigvee_{0\leq i<j} x_i=s$ for $0\leq j<|x|$. The propagator is domain consistent. - + GECODE_INT_EXPORT void @@ -7443,28 +8507,28 @@ (Home home, const IntVarArgs &x, const IntArgs &c, IntPropLevel=IPL_DEF) precede - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & c - IntPropLevel - IPL_DEF + IntPropLevel + IPL_DEF Post propagator that successive values in c precede each other in x. -This constraint enforces that $x_0\neq c_k$ for $0<k<|c|$ and $x_j=c_{k} \to \bigvee_{0\leq i<j} x_i=c_{k-1}$ for $0\leq j<|x|$ and $0< k<|c|$. +This constraint enforces that $x_0\neq c_k$ for $0<k<|c|$ and $x_j=c_{k} \to \bigvee_{0\leq i<j} x_i=c_{k-1}$ for $0\leq j<|x|$ and $0< k<|c|$. - + GECODE_INT_EXPORT void @@ -7472,29 +8536,29 @@ (Home home, const IntVarArgs &x, IntVar y, IntPropLevel ipl=IPL_DEF) member - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $y\in \{x_0,\ldots,x_{|x|-1}\}$. +Post domain consistent propagator for $y\in \{x_0,\ldots,x_{|x|-1}\}$. - + GECODE_INT_EXPORT void @@ -7502,29 +8566,29 @@ (Home home, const BoolVarArgs &x, BoolVar y, IntPropLevel ipl=IPL_DEF) member - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - BoolVar + BoolVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $y\in \{x_0,\ldots,x_{|x|-1}\}$. +Post domain consistent propagator for $y\in \{x_0,\ldots,x_{|x|-1}\}$. - + GECODE_INT_EXPORT void @@ -7532,33 +8596,33 @@ (Home home, const IntVarArgs &x, IntVar y, Reify r, IntPropLevel ipl=IPL_DEF) member - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $\left(y\in \{x_0,\ldots,x_{|x|-1}\}\right)\equiv r$. +Post domain consistent propagator for $\left(y\in \{x_0,\ldots,x_{|x|-1}\}\right)\equiv r$. - + GECODE_INT_EXPORT void @@ -7566,33 +8630,33 @@ (Home home, const BoolVarArgs &x, BoolVar y, Reify r, IntPropLevel ipl=IPL_DEF) member - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - BoolVar + BoolVar y - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $\left(y\in \{x_0,\ldots,x_{|x|-1}\}\right)\equiv r$. +Post domain consistent propagator for $\left(y\in \{x_0,\ldots,x_{|x|-1}\}\right)\equiv r$. - + GECODE_INT_EXPORT void @@ -7600,33 +8664,33 @@ (Home home, IntSharedArray n, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF) element - Home + Home home - IntSharedArray + IntSharedArray n - IntVar + IntVar x0 - IntVar + IntVar x1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ n_{x_0}=x_1$. +Post domain consistent propagator for $ n_{x_0}=x_1$. Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits. - + GECODE_INT_EXPORT void @@ -7634,33 +8698,33 @@ (Home home, IntSharedArray n, IntVar x0, BoolVar x1, IntPropLevel ipl=IPL_DEF) element - Home + Home home - IntSharedArray + IntSharedArray n - IntVar + IntVar x0 - BoolVar + BoolVar x1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ n_{x_0}=x_1$. +Post domain consistent propagator for $ n_{x_0}=x_1$. Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits. - + GECODE_INT_EXPORT void @@ -7668,15 +8732,15 @@ (Home home, IntSharedArray n, IntVar x0, int x1, IntPropLevel ipl=IPL_DEF) element - Home + Home home - IntSharedArray + IntSharedArray n - IntVar + IntVar x0 @@ -7684,17 +8748,17 @@ x1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ n_{x_0}=x_1$. +Post domain consistent propagator for $ n_{x_0}=x_1$. Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits. - + GECODE_INT_EXPORT void @@ -7702,33 +8766,33 @@ (Home home, const IntVarArgs &x, IntVar y0, IntVar y1, IntPropLevel ipl=IPL_DEF) element - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y0 - IntVar + IntVar y1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ x_{y_0}=y_1$. +Post propagator for $ x_{y_0}=y_1$. Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -7736,15 +8800,15 @@ (Home home, const IntVarArgs &x, IntVar y0, int y1, IntPropLevel ipl=IPL_DEF) element - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y0 @@ -7752,17 +8816,17 @@ y1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ x_{y_0}=y_1$. +Post propagator for $ x_{y_0}=y_1$. Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -7770,33 +8834,33 @@ (Home home, const BoolVarArgs &x, IntVar y0, BoolVar y1, IntPropLevel ipl=IPL_DEF) element - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntVar + IntVar y0 - BoolVar + BoolVar y1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ x_{y_0}=y_1$. +Post domain consistent propagator for $ x_{y_0}=y_1$. - + GECODE_INT_EXPORT void @@ -7804,15 +8868,15 @@ (Home home, const BoolVarArgs &x, IntVar y0, int y1, IntPropLevel ipl=IPL_DEF) element - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntVar + IntVar y0 @@ -7820,17 +8884,17 @@ y1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ x_{y_0}=y_1$. +Post domain consistent propagator for $ x_{y_0}=y_1$. - + GECODE_INT_EXPORT void @@ -7838,15 +8902,15 @@ (Home home, IntSharedArray a, IntVar x, int w, IntVar y, int h, IntVar z, IntPropLevel ipl=IPL_DEF) element - Home + Home home - IntSharedArray + IntSharedArray a - IntVar + IntVar x @@ -7854,7 +8918,7 @@ w - IntVar + IntVar y @@ -7862,21 +8926,21 @@ h - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ a_{x+w\cdot y}=z$. +Post domain consistent propagator for $ a_{x+w\cdot y}=z$. -If a is regarded as a two-dimensional array in row-major order of width w and height h, then z is constrained to be the element in column x and row y.Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits.Throws an exception of type Int::ArgumentSizeMismatch, if $ w\cdot h\neq|a|$. +If a is regarded as a two-dimensional array in row-major order of width w and height h, then z is constrained to be the element in column x and row y.Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits.Throws an exception of type Int::ArgumentSizeMismatch, if $ w\cdot h\neq|a|$. - + GECODE_INT_EXPORT void @@ -7884,15 +8948,15 @@ (Home home, IntSharedArray a, IntVar x, int w, IntVar y, int h, BoolVar z, IntPropLevel ipl=IPL_DEF) element - Home + Home home - IntSharedArray + IntSharedArray a - IntVar + IntVar x @@ -7900,7 +8964,7 @@ w - IntVar + IntVar y @@ -7908,21 +8972,21 @@ h - BoolVar + BoolVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ a_{x+w\cdot y}=z$. +Post domain consistent propagator for $ a_{x+w\cdot y}=z$. -If a is regarded as a two-dimensional array in row-major order of width w and height h, then z is constrained to be the element in column x and row y.Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits.Throws an exception of type Int::ArgumentSizeMismatch, if $ w\cdot h\neq|a|$. +If a is regarded as a two-dimensional array in row-major order of width w and height h, then z is constrained to be the element in column x and row y.Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits.Throws an exception of type Int::ArgumentSizeMismatch, if $ w\cdot h\neq|a|$. - + GECODE_INT_EXPORT void @@ -7930,15 +8994,15 @@ (Home home, const IntVarArgs &a, IntVar x, int w, IntVar y, int h, IntVar z, IntPropLevel ipl=IPL_DEF) element - Home + Home home - const IntVarArgs & + const IntVarArgs & a - IntVar + IntVar x @@ -7946,7 +9010,7 @@ w - IntVar + IntVar y @@ -7954,21 +9018,21 @@ h - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ a_{x+w\cdot y}=z$. +Post propagator for $ a_{x+w\cdot y}=z$. -If a is regarded as a two-dimensional array in row-major order of width w and height h, then z is constrained to be the element in column x and row y.Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default).Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits.Throws an exception of type Int::ArgumentSizeMismatch, if $ w\cdot h\neq|a|$. +If a is regarded as a two-dimensional array in row-major order of width w and height h, then z is constrained to be the element in column x and row y.Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default).Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits.Throws an exception of type Int::ArgumentSizeMismatch, if $ w\cdot h\neq|a|$. - + GECODE_INT_EXPORT void @@ -7976,15 +9040,15 @@ (Home home, const BoolVarArgs &a, IntVar x, int w, IntVar y, int h, BoolVar z, IntPropLevel ipl=IPL_DEF) element - Home + Home home - const BoolVarArgs & + const BoolVarArgs & a - IntVar + IntVar x @@ -7992,7 +9056,7 @@ w - IntVar + IntVar y @@ -8000,21 +9064,21 @@ h - BoolVar + BoolVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for $ a_{x+w\cdot y}=z$. +Post domain consistent propagator for $ a_{x+w\cdot y}=z$. -If a is regarded as a two-dimensional array in row-major order of width w and height h, then z is constrained to be the element in column x and row y.Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits.Throws an exception of type Int::ArgumentSizeMismatch, if $ w\cdot h\neq|a|$. +If a is regarded as a two-dimensional array in row-major order of width w and height h, then z is constrained to be the element in column x and row y.Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits.Throws an exception of type Int::ArgumentSizeMismatch, if $ w\cdot h\neq|a|$. - + GECODE_INT_EXPORT void @@ -8022,25 +9086,25 @@ (Home home, const IntVarArgs &x, IntPropLevel ipl=IPL_DEF) distinct - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ x_i\neq x_j$ for all $0\leq i\neq j<|x|$. +Post propagator for $ x_i\neq x_j$ for all $0\leq i\neq j<|x|$. Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply. - + GECODE_INT_EXPORT void @@ -8048,24 +9112,24 @@ (Home home, const IntArgs &n, const IntVarArgs &x, IntPropLevel ipl=IPL_DEF) distinct - Home + Home home - const IntArgs & + const IntArgs & n - const IntVarArgs & + const IntVarArgs & x - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ x_i+n_i\neq x_j+n_j$ for all $0\leq i\neq j<|x|$. +Post propagator for $ x_i+n_i\neq x_j+n_j$ for all $0\leq i\neq j<|x|$. Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM). @@ -8076,7 +9140,7 @@ - + GECODE_INT_EXPORT void @@ -8084,35 +9148,35 @@ (Home home, const BoolVarArgs &b, const IntVarArgs &x, IntPropLevel ipl=IPL_DEF) distinct - Home + Home home - const BoolVarArgs & + const BoolVarArgs & b - const IntVarArgs & + const IntVarArgs & x - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ b_i=1\wedge b_j=1\to x_i\neq x_j$ for all $0\leq i\neq j<|x|$. +Post propagator for $ b_i=1\wedge b_j=1\to x_i\neq x_j$ for all $0\leq i\neq j<|x|$. Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM). -Throws an exception of type Int::OutOfLimits, if the variable domains in x are too large (it must hold that one of the values $(\max_{i=0,\ldots,|x|-1} \max(x_i))+|x|$ and $(\min_{i=0,\ldots,|x|-1} \min(x_i))-|x|$ does not exceed the limits in Int::Limits. +Throws an exception of type Int::OutOfLimits, if the variable domains in x are too large (it must hold that one of the values $(\max_{i=0,\ldots,|x|-1} \max(x_i))+|x|$ and $(\min_{i=0,\ldots,|x|-1} \min(x_i))-|x|$ does not exceed the limits in Int::Limits. Throws an exception of type Int::ArgumentSizeMismatch, if b and x are of different size. Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply. - + GECODE_INT_EXPORT void @@ -8120,11 +9184,11 @@ (Home home, const IntVarArgs &x, int c, IntPropLevel ipl=IPL_DEF) distinct - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -8132,22 +9196,22 @@ c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ x_i=c\vee x_j=c\vee x_i\neq x_j$ for all $0\leq i\neq j<|x|$. +Post propagator for $ x_i=c\vee x_j=c\vee x_i\neq x_j$ for all $0\leq i\neq j<|x|$. Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM). -Throws an exception of type Int::OutOfLimits, if the variable domains in x are too large (it must hold that one of the values $(\max_{i=0,\ldots,|x|-1} \max(x_i))+|x|$ and $(\min_{i=0,\ldots,|x|-1} \min(x_i))-|x|$ does not exceed the limits in Int::Limits. +Throws an exception of type Int::OutOfLimits, if the variable domains in x are too large (it must hold that one of the values $(\max_{i=0,\ldots,|x|-1} \max(x_i))+|x|$ and $(\min_{i=0,\ldots,|x|-1} \min(x_i))-|x|$ does not exceed the limits in Int::Limits. Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply. - + GECODE_INT_EXPORT void @@ -8155,24 +9219,24 @@ (Home home, const IntVarArgs &x, const IntVarArgs &y, IntPropLevel ipl=IPL_DEF) channel - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntVarArgs & + const IntVarArgs & y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ x_i = j\leftrightarrow y_j=i$ for all $0\leq i<|x|$. +Post propagator for $ x_i = j\leftrightarrow y_j=i$ for all $0\leq i<|x|$. Supports domain consistency (ipl = IPL_DOM) and value propagation (all other values for ipl, default). @@ -8182,7 +9246,7 @@ - + GECODE_INT_EXPORT void @@ -8190,11 +9254,11 @@ (Home home, const IntVarArgs &x, int xoff, const IntVarArgs &y, int yoff, IntPropLevel ipl=IPL_DEF) channel - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -8202,7 +9266,7 @@ xoff - const IntVarArgs & + const IntVarArgs & y @@ -8210,12 +9274,12 @@ yoff - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ x_i - \mathit{xoff} = j\leftrightarrow y_j - \mathit{yoff} = i$ for all $0\leq i<|x|$. +Post propagator for $ x_i - \mathit{xoff} = j\leftrightarrow y_j - \mathit{yoff} = i$ for all $0\leq i<|x|$. Supports domain consistency (ipl = IPL_DOM) and value propagation (all other values for ipl, default). @@ -8226,7 +9290,7 @@ - + GECODE_INT_EXPORT void @@ -8234,21 +9298,21 @@ (Home home, BoolVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF) channel - Home + Home home - BoolVar + BoolVar x0 - IntVar + IntVar x1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post domain consistent propagator for channeling a Boolean and an integer variable $ x_0 = x_1$. @@ -8256,37 +9320,7 @@ - - - - forceinline void - forceinline void Gecode::channel - (Home home, IntVar x0, BoolVar x1, IntPropLevel ipl=IPL_DEF) - channel - - Home - home - - - IntVar - x0 - - - BoolVar - x1 - - - IntPropLevel - ipl - IPL_DEF - - -Post domain consistent propagator for channeling an integer and a Boolean variable $ x_0 = x_1$. - - - - - + GECODE_INT_EXPORT void @@ -8294,15 +9328,15 @@ (Home home, const BoolVarArgs &x, IntVar y, int o=0, IntPropLevel ipl=IPL_DEF) channel - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntVar + IntVar y @@ -8311,17 +9345,17 @@ 0 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post domain consistent propagator for channeling Boolean and integer variables $ x_i = 1\leftrightarrow y=i+o$. +Post domain consistent propagator for channeling Boolean and integer variables $ x_i = 1\leftrightarrow y=i+o$. Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply. - + GECODE_INT_EXPORT void @@ -8329,21 +9363,21 @@ (Home home, const IntVarArgs &x, const IntVarArgs &y, IntPropLevel ipl=IPL_DEF) sorted - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntVarArgs & + const IntVarArgs & y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator that y is x sorted in increasing order. @@ -8353,7 +9387,7 @@ - + GECODE_INT_EXPORT void @@ -8361,35 +9395,35 @@ (Home home, const IntVarArgs &x, const IntVarArgs &y, const IntVarArgs &z, IntPropLevel ipl=IPL_DEF) sorted - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntVarArgs & + const IntVarArgs & y - const IntVarArgs & + const IntVarArgs & z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator that y is x sorted in increasing order. -The values in z describe the sorting permutation, that is $\forall i\in\{0,\dots,|x|-1\}: x_i=y_{z_i} $.Might throw the following exceptions: +The values in z describe the sorting permutation, that is $\forall i\in\{0,\dots,|x|-1\}: x_i=y_{z_i} $.Might throw the following exceptions: Int::ArgumentSizeMismatch, if x and y differ in size.Int::ArgumentSame, if x or y contain shared unassigned variables. - + GECODE_INT_EXPORT void @@ -8397,11 +9431,11 @@ (Home home, const IntVarArgs &x, int n, IntRelType irt, int m, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -8409,7 +9443,7 @@ n - IntRelType + IntRelType irt @@ -8417,17 +9451,17 @@ m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\sim_{irt} m$. +Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\sim_{irt} m$. Performs domain propagation but is not domain consistent. - + GECODE_INT_EXPORT void @@ -8435,19 +9469,19 @@ (Home home, const IntVarArgs &x, const IntSet &y, IntRelType irt, int m, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntSet & + const IntSet & y - IntRelType + IntRelType irt @@ -8455,17 +9489,17 @@ m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i\in y\}\sim_{irt} m$. +Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i\in y\}\sim_{irt} m$. Performs domain propagation but is not domain consistent. - + GECODE_INT_EXPORT void @@ -8473,19 +9507,19 @@ (Home home, const IntVarArgs &x, IntVar y, IntRelType irt, int m, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y - IntRelType + IntRelType irt @@ -8493,17 +9527,17 @@ m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\sim_{irt} m$. +Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\sim_{irt} m$. Performs domain propagation (ipl = IPL_DOM, default) and slightly less domain propagation (all other values for ipl), where y is not pruned. Note that in both cases propagation is not domain consistent. - + GECODE_INT_EXPORT void @@ -8511,19 +9545,19 @@ (Home home, const IntVarArgs &x, const IntArgs &y, IntRelType irt, int m, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & y - IntRelType + IntRelType irt @@ -8531,17 +9565,17 @@ m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\sim_{irt} m$. +Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\sim_{irt} m$. Performs domain propagation but is not domain consistent.Throws an exception of type Int::ArgumentSizeMismatch, if x and y are of different size. - + GECODE_INT_EXPORT void @@ -8549,11 +9583,11 @@ (Home home, const IntVarArgs &x, int n, IntRelType irt, IntVar z, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -8561,25 +9595,25 @@ n - IntRelType + IntRelType irt - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\sim_{irt} z$. +Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\sim_{irt} z$. Performs domain propagation but is not domain consistent. - + GECODE_INT_EXPORT void @@ -8587,37 +9621,37 @@ (Home home, const IntVarArgs &x, const IntSet &y, IntRelType irt, IntVar z, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntSet & + const IntSet & y - IntRelType + IntRelType irt - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i\in y\}\sim_{irt} z$. +Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i\in y\}\sim_{irt} z$. Performs domain propagation but is not domain consistent. - + GECODE_INT_EXPORT void @@ -8625,37 +9659,37 @@ (Home home, const IntVarArgs &x, IntVar y, IntRelType irt, IntVar z, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y - IntRelType + IntRelType irt - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\sim_{irt} z$. +Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\sim_{irt} z$. Performs domain propagation (ipl = IPL_DOM, default) and slightly less domain propagation (all other values for ipl), where y is not pruned. Note that in both cases propagation is not domain consistent. - + GECODE_INT_EXPORT void @@ -8663,37 +9697,37 @@ (Home home, const IntVarArgs &x, const IntArgs &y, IntRelType irt, IntVar z, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & y - IntRelType + IntRelType irt - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\sim_{irt} z$. +Post propagator for $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\sim_{irt} z$. Performs domain propagation but is not domain consistent.Throws an exception of type Int::ArgumentSizeMismatch, if x and y are of different size. - + GECODE_INT_EXPORT void @@ -8701,29 +9735,29 @@ (Home home, const IntVarArgs &x, const IntVarArgs &c, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntVarArgs & + const IntVarArgs & c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Posts a global count (cardinality) constraint. -Posts the constraint that $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=j\}=c_j$ and $ \bigcup_i \{x_i\} \subseteq \{0,\ldots,|c|-1\}$ (no other value occurs).Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply. +Posts the constraint that $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=j\}=c_j$ and $ \bigcup_i \{x_i\} \subseteq \{0,\ldots,|c|-1\}$ (no other value occurs).Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply. - + GECODE_INT_EXPORT void @@ -8731,29 +9765,29 @@ (Home home, const IntVarArgs &x, const IntSetArgs &c, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntSetArgs & + const IntSetArgs & c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Posts a global count (cardinality) constraint. -Posts the constraint that $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=j\}\in c_j$ and $ \bigcup_i \{x_i\} \subseteq \{0,\ldots,|c|-1\}$ (no other value occurs).Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply. +Posts the constraint that $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=j\}\in c_j$ and $ \bigcup_i \{x_i\} \subseteq \{0,\ldots,|c|-1\}$ (no other value occurs).Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply. - + GECODE_INT_EXPORT void @@ -8761,33 +9795,33 @@ (Home home, const IntVarArgs &x, const IntVarArgs &c, const IntArgs &v, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntVarArgs & + const IntVarArgs & c - const IntArgs & + const IntArgs & v - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Posts a global count (cardinality) constraint. -Posts the constraint that $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=v_j\}=c_j$ and $ \bigcup_i \{x_i\} \subseteq \bigcup_j \{v_j\}$ (no other value occurs).Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply.Throws an exception of type Int::ArgumentSizeMismatch, if c and v are of different size. +Posts the constraint that $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=v_j\}=c_j$ and $ \bigcup_i \{x_i\} \subseteq \bigcup_j \{v_j\}$ (no other value occurs).Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply.Throws an exception of type Int::ArgumentSizeMismatch, if c and v are of different size. - + GECODE_INT_EXPORT void @@ -8795,33 +9829,33 @@ (Home home, const IntVarArgs &x, const IntSetArgs &c, const IntArgs &v, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntSetArgs & + const IntSetArgs & c - const IntArgs & + const IntArgs & v - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Posts a global count (cardinality) constraint. -Posts the constraint that $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=v_j\}\in c_j$ and $ \bigcup_i \{x_i\} \subseteq \bigcup_j \{v_j\}$ (no other value occurs).Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply.Throws an exception of type Int::ArgumentSizeMismatch, if c and v are of different size. +Posts the constraint that $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=v_j\}\in c_j$ and $ \bigcup_i \{x_i\} \subseteq \bigcup_j \{v_j\}$ (no other value occurs).Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply.Throws an exception of type Int::ArgumentSizeMismatch, if c and v are of different size. - + GECODE_INT_EXPORT void @@ -8829,33 +9863,33 @@ (Home home, const IntVarArgs &x, const IntSet &c, const IntArgs &v, IntPropLevel ipl=IPL_DEF) count - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntSet & + const IntSet & c - const IntArgs & + const IntArgs & v - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Posts a global count (cardinality) constraint. -Posts the constraint that $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=v_j\}\in c$ and $ \bigcup_i \{x_i\} \subseteq \bigcup_j \{v_j\}$ (no other value occurs).Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply.Throws an exception of type Int::ArgumentSizeMismatch, if c and v are of different size. +Posts the constraint that $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=v_j\}\in c$ and $ \bigcup_i \{x_i\} \subseteq \bigcup_j \{v_j\}$ (no other value occurs).Supports value (ipl = IPL_VAL, default), bounds (ipl = IPL_BND), and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply.Throws an exception of type Int::ArgumentSizeMismatch, if c and v are of different size. - + GECODE_INT_EXPORT void @@ -8863,15 +9897,15 @@ (Home home, const IntVarArgs &x, IntRelType irt, int y, IntPropLevel ipl=IPL_DEF) nvalues - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt @@ -8879,17 +9913,17 @@ y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y$. +Post propagator for $\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y$. - + GECODE_INT_EXPORT void @@ -8897,33 +9931,33 @@ (Home home, const IntVarArgs &x, IntRelType irt, IntVar y, IntPropLevel ipl=IPL_DEF) nvalues - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt - IntVar + IntVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y$. +Post propagator for $\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y$. - + GECODE_INT_EXPORT void @@ -8931,15 +9965,15 @@ (Home home, const BoolVarArgs &x, IntRelType irt, int y, IntPropLevel ipl=IPL_DEF) nvalues - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt @@ -8947,17 +9981,17 @@ y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y$. +Post propagator for $\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y$. - + GECODE_INT_EXPORT void @@ -8965,33 +9999,33 @@ (Home home, const BoolVarArgs &x, IntRelType irt, IntVar y, IntPropLevel ipl=IPL_DEF) nvalues - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt - IntVar + IntVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y$. +Post propagator for $\#\{x_0,\ldots,x_{|x|-1}\}\sim_{irt} y$. - + GECODE_INT_EXPORT void @@ -8999,15 +10033,15 @@ (Home home, const IntVarArgs &x, const IntSet &s, int q, int l, int u, IntPropLevel ipl=IPL_DEF) sequence - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntSet & + const IntSet & s @@ -9023,19 +10057,19 @@ u - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\operatorname{sequence}(x,s,q,l,u)$. +Post propagator for $\operatorname{sequence}(x,s,q,l,u)$. -Posts a domain consistent propagator for the constraint $\bigwedge_{i=0}^{|x|-q} \operatorname{among}(\langle x_i,\ldots,x_{i+q-1}\rangle,s,l,u)$ where the among constraint is defined as $l\leq\#\{j\in\{i,\ldots,i+q-1\}\;|\;x_j\in s\} \leq u$.Throws the following exceptions: -Of type Int::TooFewArguments, if $|x|=0$.Of type Int::ArgumentSame, if x contains the same unassigned variable multiply.Of type Int::OutOfRange, if $q < 1 \vee q > |x|$. +Posts a domain consistent propagator for the constraint $\bigwedge_{i=0}^{|x|-q} \operatorname{among}(\langle x_i,\ldots,x_{i+q-1}\rangle,s,l,u)$ where the among constraint is defined as $l\leq\#\{j\in\{i,\ldots,i+q-1\}\;|\;x_j\in s\} \leq u$.Throws the following exceptions: +Of type Int::TooFewArguments, if $|x|=0$.Of type Int::ArgumentSame, if x contains the same unassigned variable multiply.Of type Int::OutOfRange, if $q < 1 \vee q > |x|$. - + GECODE_INT_EXPORT void @@ -9043,15 +10077,15 @@ (Home home, const BoolVarArgs &x, const IntSet &s, int q, int l, int u, IntPropLevel ipl=IPL_DEF) sequence - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - const IntSet & + const IntSet & s @@ -9067,19 +10101,19 @@ u - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\operatorname{sequence}(x,s,q,l,u)$. +Post propagator for $\operatorname{sequence}(x,s,q,l,u)$. -Posts a domain consistent propagator for the constraint $\bigwedge_{i=0}^{|x|-q} \operatorname{among}(\langle x_i,\ldots,x_{i+q-1}\rangle,s,l,u)$ where the among constraint is defined as $l\leq\#\{j\in\{i,\ldots,i+q-1\}\;|\;x_j\in s\} \leq u$.Throws the following exceptions: -Of type Int::TooFewArguments, if $|x|=0$.Of type Int::ArgumentSame, if x contains the same unassigned variable multiply.Of type Int::OutOfRange, if $q < 1 \vee q > |x|$. +Posts a domain consistent propagator for the constraint $\bigwedge_{i=0}^{|x|-q} \operatorname{among}(\langle x_i,\ldots,x_{i+q-1}\rangle,s,l,u)$ where the among constraint is defined as $l\leq\#\{j\in\{i,\ldots,i+q-1\}\;|\;x_j\in s\} \leq u$.Throws the following exceptions: +Of type Int::TooFewArguments, if $|x|=0$.Of type Int::ArgumentSame, if x contains the same unassigned variable multiply.Of type Int::OutOfRange, if $q < 1 \vee q > |x|$. - + GECODE_INT_EXPORT void @@ -9087,21 +10121,21 @@ (Home home, const IntVarArgs &x, DFA d, IntPropLevel ipl=IPL_DEF) extensional - Home + Home home - const IntVarArgs & + const IntVarArgs & x - DFA + DFA d - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post domain consistent propagator for extensional constraint described by a DFA. @@ -9109,7 +10143,7 @@ The elements of x must be a word of the language described by the DFA d.Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply. If shared occurences of variables are required, unshare should be used. - + GECODE_INT_EXPORT void @@ -9117,21 +10151,21 @@ (Home home, const BoolVarArgs &x, DFA d, IntPropLevel ipl=IPL_DEF) extensional - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - DFA + DFA d - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post domain consistent propagator for extensional constraint described by a DFA. @@ -9139,7 +10173,7 @@ The elements of x must be a word of the language described by the DFA d.Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply. If shared occurences of variables are required, unshare should be used. - + GECODE_INT_EXPORT void @@ -9147,24 +10181,24 @@ (Home home, const IntVarArgs &x, const TupleSet &t, IntPropLevel ipl=IPL_DEF) extensional - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const TupleSet & + const TupleSet & t - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $x\in t$. +Post propagator for $x\in t$. Supports implementations optimized for speed (with propagation level ipl or-ed with IPL_SPEED, default) and memory consumption (with propagation level ipl or-ed with IPL_MEMORY). @@ -9172,11 +10206,11 @@ Throws an exception of type Int::ArgumentSizeMismatch, if x and t are of different size. Throws an exception of type Int::NotYetFinalized, if the tuple set t has not been finalized. -If the domains for the $x_i$ are not dense and have similar bounds, lots of memory will be wasted (memory consumption is in $ O\left(|x|\cdot\min_i(\underline{x_i})\cdot\max_i(\overline{x_i})\right)$ for the basic algorithm (epk = EPK_MEMORY) and additionally $ O\left(|x|^2\cdot\min_i(\underline{x_i})\cdot\max_i(\overline{x_i})\right)$ for the incremental algorithm (epk = EPK_SPEED). +If the domains for the $x_i$ are not dense and have similar bounds, lots of memory will be wasted (memory consumption is in $ O\left(|x|\cdot\min_i(\underline{x_i})\cdot\max_i(\overline{x_i})\right)$ for the basic algorithm (epk = EPK_MEMORY) and additionally $ O\left(|x|^2\cdot\min_i(\underline{x_i})\cdot\max_i(\overline{x_i})\right)$ for the incremental algorithm (epk = EPK_SPEED). - + GECODE_INT_EXPORT void @@ -9184,24 +10218,24 @@ (Home home, const BoolVarArgs &x, const TupleSet &t, IntPropLevel ipl=IPL_DEF) extensional - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - const TupleSet & + const TupleSet & t - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $x\in t$. +Post propagator for $x\in t$. Supports implementations optimized for speed (with propagation level ipl or-ed with IPL_SPEED, default) and memory consumption (with propagation level ipl or-ed with IPL_MEMORY). @@ -9212,7 +10246,7 @@ - + GECODE_INT_EXPORT void @@ -9220,33 +10254,33 @@ (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) min - Home + Home home - IntVar + IntVar x0 - IntVar + IntVar x1 - IntVar + IntVar x2 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ \min\{x_0,x_1\}=x_2$. +Post propagator for $ \min\{x_0,x_1\}=x_2$. Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM). - + GECODE_INT_EXPORT void @@ -9254,29 +10288,29 @@ (Home home, const IntVarArgs &x, IntVar y, IntPropLevel ipl=IPL_DEF) min - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ \min x=y$. +Post propagator for $ \min x=y$. Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).If x is empty, an exception of type Int::TooFewArguments is thrown. - + GECODE_INT_EXPORT void @@ -9284,33 +10318,33 @@ (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) max - Home + Home home - IntVar + IntVar x0 - IntVar + IntVar x1 - IntVar + IntVar x2 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ \max\{x_0,x_1\}=x_2$. +Post propagator for $ \max\{x_0,x_1\}=x_2$. Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM). - + GECODE_INT_EXPORT void @@ -9318,21 +10352,21 @@ (Home home, const IntVarArgs &x, IntVar y, IntPropLevel ipl=IPL_DEF) max - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator for $ \max x=y$. @@ -9340,7 +10374,7 @@ Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).If x is empty, an exception of type Int::TooFewArguments is thrown. - + GECODE_INT_EXPORT void @@ -9348,15 +10382,15 @@ (Home home, const IntVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) argmin - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y @@ -9365,17 +10399,17 @@ true - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ \operatorname{argmin}(x)=y$. +Post propagator for $ \operatorname{argmin}(x)=y$. In case of ties, the smallest value for y is chosen (provided tiebreak is true).If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown. - + GECODE_INT_EXPORT void @@ -9383,11 +10417,11 @@ (Home home, const IntVarArgs &x, int o, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) argmin - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -9395,7 +10429,7 @@ o - IntVar + IntVar y @@ -9404,17 +10438,17 @@ true - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ \operatorname{argmin}(x)-o=y$. +Post propagator for $ \operatorname{argmin}(x)-o=y$. In case of ties, the smallest value for y is chosen (provided tiebreak is true).If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown. - + GECODE_INT_EXPORT void @@ -9422,15 +10456,15 @@ (Home home, const IntVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) argmax - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y @@ -9439,17 +10473,17 @@ true - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ \operatorname{argmax}(x)=y$. +Post propagator for $ \operatorname{argmax}(x)=y$. In case of ties, the smallest value for y is chosen (provided tiebreak is true).If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown. - + GECODE_INT_EXPORT void @@ -9457,11 +10491,11 @@ (Home home, const IntVarArgs &x, int o, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF) argmax - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -9469,7 +10503,7 @@ o - IntVar + IntVar y @@ -9478,17 +10512,17 @@ true - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ \operatorname{argmax}(x)-o=y$. +Post propagator for $ \operatorname{argmax}(x)-o=y$. In case of ties, the smallest value for y is chosen (provided tiebreak is true).If x is empty, an exception of type Int::TooFewArguments is thrown. If y occurs in x, an exception of type Int::ArgumentSame is thrown. - + GECODE_INT_EXPORT void @@ -9496,29 +10530,29 @@ (Home home, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF) abs - Home + Home home - IntVar + IntVar x0 - IntVar + IntVar x1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $ |x_0|=x_1$. +Post propagator for $ |x_0|=x_1$. -Supports value propagation (ipl = IPL_VAL), bounds consistency (ipl = IPL_BND, default), and domain consistency (ipl = IPL_DOM). +Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM). - + GECODE_INT_EXPORT void @@ -9526,25 +10560,25 @@ (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) mult - Home + Home home - IntVar + IntVar x0 - IntVar + IntVar x1 - IntVar + IntVar x2 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator for $x_0\cdot x_1=x_2$. @@ -9552,7 +10586,7 @@ Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM). - + GECODE_INT_EXPORT void @@ -9560,37 +10594,37 @@ (Home home, IntVar x0, IntVar x1, IntVar x2, IntVar x3, IntPropLevel ipl=IPL_DEF) divmod - Home + Home home - IntVar + IntVar x0 - IntVar + IntVar x1 - IntVar + IntVar x2 - IntVar + IntVar x3 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $x_0\ \mathrm{div}\ x_1=x_2 \land x_0\ \mathrm{mod}\ x_1 = x_3$. +Post propagator for $x_0\ \mathrm{div}\ x_1=x_2 \land x_0\ \mathrm{mod}\ x_1 = x_3$. Supports bounds consistency (ipl = IPL_BND, default). - + GECODE_INT_EXPORT void @@ -9598,33 +10632,33 @@ (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) div - Home + Home home - IntVar + IntVar x0 - IntVar + IntVar x1 - IntVar + IntVar x2 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $x_0\ \mathrm{div}\ x_1=x_2$. +Post propagator for $x_0\ \mathrm{div}\ x_1=x_2$. Supports bounds consistency (ipl = IPL_BND, default). - + GECODE_INT_EXPORT void @@ -9632,33 +10666,33 @@ (Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF) mod - Home + Home home - IntVar + IntVar x0 - IntVar + IntVar x1 - IntVar + IntVar x2 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $x_0\ \mathrm{mod}\ x_1=x_2$. +Post propagator for $x_0\ \mathrm{mod}\ x_1=x_2$. Supports bounds consistency (ipl = IPL_BND, default). - + GECODE_INT_EXPORT void @@ -9666,29 +10700,29 @@ (Home home, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF) sqr - Home + Home home - IntVar + IntVar x0 - IntVar + IntVar x1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $x_0^2=x_1$. +Post propagator for $x_0^2=x_1$. Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM). - + GECODE_INT_EXPORT void @@ -9696,29 +10730,29 @@ (Home home, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF) sqrt - Home + Home home - IntVar + IntVar x0 - IntVar + IntVar x1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\lfloor\sqrt{x_0}\rfloor=x_1$. +Post propagator for $\lfloor\sqrt{x_0}\rfloor=x_1$. Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM). - + GECODE_INT_EXPORT void @@ -9726,11 +10760,11 @@ (Home home, IntVar x0, int n, IntVar x1, IntPropLevel ipl=IPL_DEF) pow - Home + Home home - IntVar + IntVar x0 @@ -9738,21 +10772,21 @@ n - IntVar + IntVar x1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $x_0^n=x_1$. +Post propagator for $x_0^n=x_1$. Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::OutOfLimits, if n is negative. - + GECODE_INT_EXPORT void @@ -9760,11 +10794,11 @@ (Home home, IntVar x0, int n, IntVar x1, IntPropLevel ipl=IPL_DEF) nroot - Home + Home home - IntVar + IntVar x0 @@ -9772,21 +10806,21 @@ n - IntVar + IntVar x1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\lfloor\sqrt[n]{x_0}\rfloor=x_1$. +Post propagator for $\lfloor\sqrt[n]{x_0}\rfloor=x_1$. Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM).Throws an exception of type Int::OutOfLimits, if n is not strictly positive. - + GECODE_INT_EXPORT void @@ -9794,15 +10828,15 @@ (Home home, const IntVarArgs &x, IntRelType irt, int c, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt @@ -9810,17 +10844,17 @@ c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{irt} c$. +Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{irt} c$. - + GECODE_INT_EXPORT void @@ -9828,33 +10862,33 @@ (Home home, const IntVarArgs &x, IntRelType irt, IntVar y, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt - IntVar + IntVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{irt} y$. +Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{irt} y$. - + GECODE_INT_EXPORT void @@ -9862,15 +10896,15 @@ (Home home, const IntVarArgs &x, IntRelType irt, int c, Reify r, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt @@ -9878,21 +10912,21 @@ c - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} c\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} c\right)\equiv r$. - + GECODE_INT_EXPORT void @@ -9900,37 +10934,37 @@ (Home home, const IntVarArgs &x, IntRelType irt, IntVar y, Reify r, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt - IntVar + IntVar y - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} y\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} y\right)\equiv r$. - + GECODE_INT_EXPORT void @@ -9938,19 +10972,19 @@ (Home home, const IntArgs &a, const IntVarArgs &x, IntRelType irt, int c, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntArgs & + const IntArgs & a - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt @@ -9958,17 +10992,17 @@ c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c$. +Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_INT_EXPORT void @@ -9976,37 +11010,37 @@ (Home home, const IntArgs &a, const IntVarArgs &x, IntRelType irt, IntVar y, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntArgs & + const IntArgs & a - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt - IntVar + IntVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y$. +Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_INT_EXPORT void @@ -10014,19 +11048,19 @@ (Home home, const IntArgs &a, const IntVarArgs &x, IntRelType irt, int c, Reify r, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntArgs & + const IntArgs & a - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt @@ -10034,21 +11068,21 @@ c - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c\right)\equiv r$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_INT_EXPORT void @@ -10056,41 +11090,41 @@ (Home home, const IntArgs &a, const IntVarArgs &x, IntRelType irt, IntVar y, Reify r, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntArgs & + const IntArgs & a - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType irt - IntVar + IntVar y - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y\right)\equiv r$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_INT_EXPORT void @@ -10098,15 +11132,15 @@ (Home home, const BoolVarArgs &x, IntRelType irt, int c, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt @@ -10114,17 +11148,17 @@ c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{irt} c$. +Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{irt} c$. - + GECODE_INT_EXPORT void @@ -10132,15 +11166,15 @@ (Home home, const BoolVarArgs &x, IntRelType irt, int c, Reify r, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt @@ -10148,21 +11182,21 @@ c - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} c\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} c\right)\equiv r$. - + GECODE_INT_EXPORT void @@ -10170,33 +11204,33 @@ (Home home, const BoolVarArgs &x, IntRelType irt, IntVar y, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt - IntVar + IntVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{irt} y$. +Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{irt} y$. - + GECODE_INT_EXPORT void @@ -10204,37 +11238,37 @@ (Home home, const BoolVarArgs &x, IntRelType irt, IntVar y, Reify r, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt - IntVar + IntVar y - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} y\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{irt} y\right)\equiv r$. - + GECODE_INT_EXPORT void @@ -10242,19 +11276,19 @@ (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType irt, int c, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntArgs & + const IntArgs & a - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt @@ -10262,17 +11296,17 @@ c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c$. +Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_INT_EXPORT void @@ -10280,19 +11314,19 @@ (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType irt, int c, Reify r, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntArgs & + const IntArgs & a - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt @@ -10300,21 +11334,21 @@ c - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} c\right)\equiv r$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_INT_EXPORT void @@ -10322,37 +11356,37 @@ (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType irt, IntVar y, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntArgs & + const IntArgs & a - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt - IntVar + IntVar y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y$. +Post propagator for $\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_INT_EXPORT void @@ -10360,41 +11394,41 @@ (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType irt, IntVar y, Reify r, IntPropLevel ipl=IPL_DEF) linear - Home + Home home - const IntArgs & + const IntArgs & a - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType irt - IntVar + IntVar y - Reify + Reify r - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y\right)\equiv r$. +Post propagator for $\left(\sum_{i=0}^{|x|-1}a_i\cdot x_i\sim_{irt} y\right)\equiv r$. Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_INT_EXPORT void @@ -10402,43 +11436,43 @@ (Home home, const IntVarArgs &l, const IntVarArgs &b, const IntArgs &s, IntPropLevel ipl=IPL_DEF) binpacking - Home + Home home - const IntVarArgs & + const IntVarArgs & l - const IntVarArgs & + const IntVarArgs & b - const IntArgs & + const IntArgs & s - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator for bin packing. -The variables in l are the loads for each bin, whereas the variables in b define for each item into which bin it is packed. The integer values s define the size of the items.It is propagated that for each $j$ with $0\leq j<|l|$ the constraint $l_j=\sum_{0\leq i<|b|\wedge b_i=j}s_i$ holds and that for each $i$ with $0\leq i<|b|$ the constraint $0\leq b_i<|l|$ holds.The propagation follows: Paul Shaw. A Constraint for Bin Packing. CP 2004.Throws the following exceptions: +The variables in l are the loads for each bin, whereas the variables in b define for each item into which bin it is packed. The integer values s define the size of the items.It is propagated that for each $j$ with $0\leq j<|l|$ the constraint $l_j=\sum_{0\leq i<|b|\wedge b_i=j}s_i$ holds and that for each $i$ with $0\leq i<|b|$ the constraint $0\leq b_i<|l|$ holds.The propagation follows: Paul Shaw. A Constraint for Bin Packing. CP 2004.Throws the following exceptions: Of type Int::ArgumentSizeMismatch if b and s are not of the same size.Of type Int::ArgumentSame if l and b share unassigned variables.Of type Int::OutOfLimits if s contains a negative number. - + - GECODE_INT_EXPORT IntSet + GECODE_INT_EXPORT IntSet GECODE_INT_EXPORT IntSet Gecode::binpacking (Home home, int d, const IntVarArgs &l, const IntVarArgs &b, const IntArgs &s, const IntArgs &c, IntPropLevel ipl=IPL_DEF) binpacking - Home + Home home @@ -10446,25 +11480,25 @@ d - const IntVarArgs & + const IntVarArgs & l - const IntVarArgs & + const IntVarArgs & b - const IntArgs & + const IntArgs & s - const IntArgs & + const IntArgs & c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF @@ -10472,7 +11506,7 @@ - + GECODE_INT_EXPORT void @@ -10480,29 +11514,29 @@ (Home home, const IntVarArgs &x, const IntArgs &w, const IntVarArgs &y, const IntArgs &h, IntPropLevel ipl=IPL_DEF) nooverlap - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & w - const IntVarArgs & + const IntVarArgs & y - const IntArgs & + const IntArgs & h - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator for rectangle packing. @@ -10512,7 +11546,7 @@ - + GECODE_INT_EXPORT void @@ -10520,33 +11554,33 @@ (Home home, const IntVarArgs &x, const IntArgs &w, const IntVarArgs &y, const IntArgs &h, const BoolVarArgs &o, IntPropLevel ipl=IPL_DEF) nooverlap - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & w - const IntVarArgs & + const IntVarArgs & y - const IntArgs & + const IntArgs & h - const BoolVarArgs & + const BoolVarArgs & o - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator for rectangle packing. @@ -10556,7 +11590,7 @@ - + GECODE_INT_EXPORT void @@ -10564,47 +11598,47 @@ (Home home, const IntVarArgs &x0, const IntVarArgs &w, const IntVarArgs &x1, const IntVarArgs &y0, const IntVarArgs &h, const IntVarArgs &y1, IntPropLevel ipl=IPL_DEF) nooverlap - Home + Home home - const IntVarArgs & + const IntVarArgs & x0 - const IntVarArgs & + const IntVarArgs & w - const IntVarArgs & + const IntVarArgs & x1 - const IntVarArgs & + const IntVarArgs & y0 - const IntVarArgs & + const IntVarArgs & h - const IntVarArgs & + const IntVarArgs & y1 - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator for rectangle packing. -Propagate that no two rectangles as described by the start coordinates x0 and y0, widths w and heights h, and end coordinates x1 and y1 overlap.Note that the relations $x0_i+w_i=x1_i$ and $y0_i+h_i=y1_i$ are not propagated (for $0\leq i<|x0|$). That is, additional constraints must be posted to enforce that relation.Throws the following exceptions: +Propagate that no two rectangles as described by the start coordinates x0 and y0, widths w and heights h, and end coordinates x1 and y1 overlap.Note that the relations $x0_i+w_i=x1_i$ and $y0_i+h_i=y1_i$ are not propagated (for $0\leq i<|x0|$). That is, additional constraints must be posted to enforce that relation.Throws the following exceptions: Of type Int::ArgumentSizeMismatch if x0, x1, w, y0, y1, or h are not of the same size. - + GECODE_INT_EXPORT void @@ -10612,51 +11646,51 @@ (Home home, const IntVarArgs &x0, const IntVarArgs &w, const IntVarArgs &x1, const IntVarArgs &y0, const IntVarArgs &h, const IntVarArgs &y1, const BoolVarArgs &o, IntPropLevel ipl=IPL_DEF) nooverlap - Home + Home home - const IntVarArgs & + const IntVarArgs & x0 - const IntVarArgs & + const IntVarArgs & w - const IntVarArgs & + const IntVarArgs & x1 - const IntVarArgs & + const IntVarArgs & y0 - const IntVarArgs & + const IntVarArgs & h - const IntVarArgs & + const IntVarArgs & y1 - const BoolVarArgs & + const BoolVarArgs & o - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator for rectangle packing. -Propagate that no two rectangles as described by the start coordinates x0 and y0, widths w and heights h, and end coordinates x1 and y1 overlap. The rectangles can be optional, as described by the Boolean variables o.Note that the relations $x0_i+w_i=x1_i$ and $y0_i+h_i=y1_i$ are not propagated (for $0\leq i<|x0|$). That is, additional constraints must be posted to enforce that relation.Throws the following exceptions: +Propagate that no two rectangles as described by the start coordinates x0 and y0, widths w and heights h, and end coordinates x1 and y1 overlap. The rectangles can be optional, as described by the Boolean variables o.Note that the relations $x0_i+w_i=x1_i$ and $y0_i+h_i=y1_i$ are not propagated (for $0\leq i<|x0|$). That is, additional constraints must be posted to enforce that relation.Throws the following exceptions: Of type Int::ArgumentSizeMismatch if x0, x1, w, y0, y1, or h are not of the same size. - + GECODE_INT_EXPORT void @@ -10664,31 +11698,31 @@ (Home home, const IntVarArgs &m, const IntVarArgs &s, const IntVarArgs &p, const IntVarArgs &e, const IntVarArgs &u, const IntArgs &c, bool at_most, IntPropLevel ipl=IPL_DEF) cumulatives - Home + Home home - const IntVarArgs & + const IntVarArgs & m - const IntVarArgs & + const IntVarArgs & s - const IntVarArgs & + const IntVarArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntVarArgs & + const IntVarArgs & u - const IntArgs & + const IntArgs & c @@ -10696,15 +11730,15 @@ at_most - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for the cumulatives constraint. This function creates propagators for the cumulatives constraint presented in "A new multi-resource cumulatives constraint -with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). +with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). home @@ -10716,42 +11750,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m -$ m_i $ is the machine assigned to task $ i $ +$ m_i $ is the machine assigned to task $ i $ s -$ s_i $ is the start time assigned to task $ i $ +$ s_i $ is the start time assigned to task $ i $ p -$ p_i $ is the processing time of task $ i $ +$ p_i $ is the processing time of task $ i $ e -$ e_i $ is the end time assigned to task $ i $ +$ e_i $ is the end time assigned to task $ i $ u -$ u_i $ is the amount of resources consumed by task $ i $ +$ u_i $ is the amount of resources consumed by task $ i $ c -$ c_r $ is the capacity, the amount of resource available for machine $ r $ +$ c_r $ is the capacity, the amount of resource available for machine $ r $ @@ -10786,7 +11820,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -10794,31 +11828,31 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &m, const IntVarArgs &s, const IntVarArgs &p, const IntVarArgs &e, const IntVarArgs &u, const IntArgs &c, bool at_most, IntPropLevel ipl=IPL_DEF) cumulatives - Home + Home home - const IntArgs & + const IntArgs & m - const IntVarArgs & + const IntVarArgs & s - const IntVarArgs & + const IntVarArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntVarArgs & + const IntVarArgs & u - const IntArgs & + const IntArgs & c @@ -10826,15 +11860,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr at_most - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for the cumulatives constraint. Post propagators for the cumulatives constraint. This function creates propagators for the cumulatives constraint presented in "A new multi-resource cumulatives constraint -with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). +with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). home @@ -10846,42 +11880,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m -$ m_i $ is the machine assigned to task $ i $ +$ m_i $ is the machine assigned to task $ i $ s -$ s_i $ is the start time assigned to task $ i $ +$ s_i $ is the start time assigned to task $ i $ p -$ p_i $ is the processing time of task $ i $ +$ p_i $ is the processing time of task $ i $ e -$ e_i $ is the end time assigned to task $ i $ +$ e_i $ is the end time assigned to task $ i $ u -$ u_i $ is the amount of resources consumed by task $ i $ +$ u_i $ is the amount of resources consumed by task $ i $ c -$ c_r $ is the capacity, the amount of resource available for machine $ r $ +$ c_r $ is the capacity, the amount of resource available for machine $ r $ @@ -10916,7 +11950,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -10924,31 +11958,31 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &m, const IntVarArgs &s, const IntArgs &p, const IntVarArgs &e, const IntVarArgs &u, const IntArgs &c, bool at_most, IntPropLevel ipl=IPL_DEF) cumulatives - Home + Home home - const IntVarArgs & + const IntVarArgs & m - const IntVarArgs & + const IntVarArgs & s - const IntArgs & + const IntArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntVarArgs & + const IntVarArgs & u - const IntArgs & + const IntArgs & c @@ -10956,15 +11990,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr at_most - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for the cumulatives constraint. Post propagators for the cumulatives constraint. This function creates propagators for the cumulatives constraint presented in "A new multi-resource cumulatives constraint -with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). +with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). home @@ -10976,42 +12010,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m -$ m_i $ is the machine assigned to task $ i $ +$ m_i $ is the machine assigned to task $ i $ s -$ s_i $ is the start time assigned to task $ i $ +$ s_i $ is the start time assigned to task $ i $ p -$ p_i $ is the processing time of task $ i $ +$ p_i $ is the processing time of task $ i $ e -$ e_i $ is the end time assigned to task $ i $ +$ e_i $ is the end time assigned to task $ i $ u -$ u_i $ is the amount of resources consumed by task $ i $ +$ u_i $ is the amount of resources consumed by task $ i $ c -$ c_r $ is the capacity, the amount of resource available for machine $ r $ +$ c_r $ is the capacity, the amount of resource available for machine $ r $ @@ -11046,7 +12080,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11054,31 +12088,31 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &m, const IntVarArgs &s, const IntArgs &p, const IntVarArgs &e, const IntVarArgs &u, const IntArgs &c, bool at_most, IntPropLevel ipl=IPL_DEF) cumulatives - Home + Home home - const IntArgs & + const IntArgs & m - const IntVarArgs & + const IntVarArgs & s - const IntArgs & + const IntArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntVarArgs & + const IntVarArgs & u - const IntArgs & + const IntArgs & c @@ -11086,15 +12120,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr at_most - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for the cumulatives constraint. Post propagators for the cumulatives constraint. This function creates propagators for the cumulatives constraint presented in "A new multi-resource cumulatives constraint -with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). +with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). home @@ -11106,42 +12140,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m -$ m_i $ is the machine assigned to task $ i $ +$ m_i $ is the machine assigned to task $ i $ s -$ s_i $ is the start time assigned to task $ i $ +$ s_i $ is the start time assigned to task $ i $ p -$ p_i $ is the processing time of task $ i $ +$ p_i $ is the processing time of task $ i $ e -$ e_i $ is the end time assigned to task $ i $ +$ e_i $ is the end time assigned to task $ i $ u -$ u_i $ is the amount of resources consumed by task $ i $ +$ u_i $ is the amount of resources consumed by task $ i $ c -$ c_r $ is the capacity, the amount of resource available for machine $ r $ +$ c_r $ is the capacity, the amount of resource available for machine $ r $ @@ -11176,7 +12210,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11184,31 +12218,31 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &m, const IntVarArgs &s, const IntVarArgs &p, const IntVarArgs &e, const IntArgs &u, const IntArgs &c, bool at_most, IntPropLevel ipl=IPL_DEF) cumulatives - Home + Home home - const IntVarArgs & + const IntVarArgs & m - const IntVarArgs & + const IntVarArgs & s - const IntVarArgs & + const IntVarArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntArgs & + const IntArgs & u - const IntArgs & + const IntArgs & c @@ -11216,15 +12250,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr at_most - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for the cumulatives constraint. Post propagators for the cumulatives constraint. This function creates propagators for the cumulatives constraint presented in "A new multi-resource cumulatives constraint -with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). +with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). home @@ -11236,42 +12270,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m -$ m_i $ is the machine assigned to task $ i $ +$ m_i $ is the machine assigned to task $ i $ s -$ s_i $ is the start time assigned to task $ i $ +$ s_i $ is the start time assigned to task $ i $ p -$ p_i $ is the processing time of task $ i $ +$ p_i $ is the processing time of task $ i $ e -$ e_i $ is the end time assigned to task $ i $ +$ e_i $ is the end time assigned to task $ i $ u -$ u_i $ is the amount of resources consumed by task $ i $ +$ u_i $ is the amount of resources consumed by task $ i $ c -$ c_r $ is the capacity, the amount of resource available for machine $ r $ +$ c_r $ is the capacity, the amount of resource available for machine $ r $ @@ -11306,7 +12340,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11314,31 +12348,31 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &m, const IntVarArgs &s, const IntVarArgs &p, const IntVarArgs &e, const IntArgs &u, const IntArgs &c, bool at_most, IntPropLevel ipl=IPL_DEF) cumulatives - Home + Home home - const IntArgs & + const IntArgs & m - const IntVarArgs & + const IntVarArgs & s - const IntVarArgs & + const IntVarArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntArgs & + const IntArgs & u - const IntArgs & + const IntArgs & c @@ -11346,15 +12380,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr at_most - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for the cumulatives constraint. Post propagators for the cumulatives constraint. This function creates propagators for the cumulatives constraint presented in "A new multi-resource cumulatives constraint -with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). +with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). home @@ -11366,42 +12400,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m -$ m_i $ is the machine assigned to task $ i $ +$ m_i $ is the machine assigned to task $ i $ s -$ s_i $ is the start time assigned to task $ i $ +$ s_i $ is the start time assigned to task $ i $ p -$ p_i $ is the processing time of task $ i $ +$ p_i $ is the processing time of task $ i $ e -$ e_i $ is the end time assigned to task $ i $ +$ e_i $ is the end time assigned to task $ i $ u -$ u_i $ is the amount of resources consumed by task $ i $ +$ u_i $ is the amount of resources consumed by task $ i $ c -$ c_r $ is the capacity, the amount of resource available for machine $ r $ +$ c_r $ is the capacity, the amount of resource available for machine $ r $ @@ -11436,7 +12470,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11444,31 +12478,31 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &m, const IntVarArgs &s, const IntArgs &p, const IntVarArgs &e, const IntArgs &u, const IntArgs &c, bool at_most, IntPropLevel ipl=IPL_DEF) cumulatives - Home + Home home - const IntVarArgs & + const IntVarArgs & m - const IntVarArgs & + const IntVarArgs & s - const IntArgs & + const IntArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntArgs & + const IntArgs & u - const IntArgs & + const IntArgs & c @@ -11476,15 +12510,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr at_most - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for the cumulatives constraint. Post propagators for the cumulatives constraint. This function creates propagators for the cumulatives constraint presented in "A new multi-resource cumulatives constraint -with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). +with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). home @@ -11496,42 +12530,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m -$ m_i $ is the machine assigned to task $ i $ +$ m_i $ is the machine assigned to task $ i $ s -$ s_i $ is the start time assigned to task $ i $ +$ s_i $ is the start time assigned to task $ i $ p -$ p_i $ is the processing time of task $ i $ +$ p_i $ is the processing time of task $ i $ e -$ e_i $ is the end time assigned to task $ i $ +$ e_i $ is the end time assigned to task $ i $ u -$ u_i $ is the amount of resources consumed by task $ i $ +$ u_i $ is the amount of resources consumed by task $ i $ c -$ c_r $ is the capacity, the amount of resource available for machine $ r $ +$ c_r $ is the capacity, the amount of resource available for machine $ r $ @@ -11566,7 +12600,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11574,31 +12608,31 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &m, const IntVarArgs &s, const IntArgs &p, const IntVarArgs &e, const IntArgs &u, const IntArgs &c, bool at_most, IntPropLevel ipl=IPL_DEF) cumulatives - Home + Home home - const IntArgs & + const IntArgs & m - const IntVarArgs & + const IntVarArgs & s - const IntArgs & + const IntArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntArgs & + const IntArgs & u - const IntArgs & + const IntArgs & c @@ -11606,15 +12640,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr at_most - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for the cumulatives constraint. Post propagators for the cumulatives constraint. This function creates propagators for the cumulatives constraint presented in "A new multi-resource cumulatives constraint -with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). +with negative heights", Nicolas Beldiceanu and Mats Carlsson, Principles and Practice of Constraint Programming 2002.The constraint models a set of machines and a set of tasks that should be assigned to the machines. The machines have a positive resource limit and the tasks each have a resource usage that can be either positive, negative, or zero. The constraint is enforced over each point in time for a machine where there is at least one task assigned.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The limit for a machine is either the maximum amount available at any given time (at_most = true), or else the least amount to be used (at_most = false). home @@ -11626,42 +12660,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m -$ m_i $ is the machine assigned to task $ i $ +$ m_i $ is the machine assigned to task $ i $ s -$ s_i $ is the start time assigned to task $ i $ +$ s_i $ is the start time assigned to task $ i $ p -$ p_i $ is the processing time of task $ i $ +$ p_i $ is the processing time of task $ i $ e -$ e_i $ is the end time assigned to task $ i $ +$ e_i $ is the end time assigned to task $ i $ u -$ u_i $ is the amount of resources consumed by task $ i $ +$ u_i $ is the amount of resources consumed by task $ i $ c -$ c_r $ is the capacity, the amount of resource available for machine $ r $ +$ c_r $ is the capacity, the amount of resource available for machine $ r $ @@ -11696,7 +12730,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11704,21 +12738,21 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &s, const IntArgs &p, IntPropLevel ipl=IPL_DEF) unary - Home + Home home - const IntVarArgs & + const IntVarArgs & s - const IntArgs & + const IntArgs & p - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling tasks on unary resources. @@ -11730,7 +12764,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11738,25 +12772,25 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &s, const IntArgs &p, const BoolVarArgs &m, IntPropLevel ipl=IPL_DEF) unary - Home + Home home - const IntVarArgs & + const IntVarArgs & s - const IntArgs & + const IntArgs & p - const BoolVarArgs & + const BoolVarArgs & m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling optional tasks on unary resources. @@ -11768,7 +12802,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11776,25 +12810,25 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const TaskTypeArgs &t, const IntVarArgs &flex, const IntArgs &fix, IntPropLevel ipl=IPL_DEF) unary - Home + Home home - const TaskTypeArgs & + const TaskTypeArgs & t - const IntVarArgs & + const IntVarArgs & flex - const IntArgs & + const IntArgs & fix - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling tasks on unary resources. @@ -11808,7 +12842,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11816,29 +12850,29 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const TaskTypeArgs &t, const IntVarArgs &flex, const IntArgs &fix, const BoolVarArgs &m, IntPropLevel ipl=IPL_DEF) unary - Home + Home home - const TaskTypeArgs & + const TaskTypeArgs & t - const IntVarArgs & + const IntVarArgs & flex - const IntArgs & + const IntArgs & fix - const BoolVarArgs & + const BoolVarArgs & m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling optional tasks on unary resources. @@ -11852,7 +12886,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11860,35 +12894,35 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &s, const IntVarArgs &p, const IntVarArgs &e, IntPropLevel ipl=IPL_DEF) unary - Home + Home home - const IntVarArgs & + const IntVarArgs & s - const IntVarArgs & + const IntVarArgs & p - const IntVarArgs & + const IntVarArgs & e - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling tasks on unary resources. -Schedule tasks with start times s, processing times p, and end times e on a unary resource. The propagator uses the algorithms from: Petr Vilím, Global Constraints in Scheduling, PhD thesis, Charles University, Prague, Czech Republic, 2007.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The propagator performs propagation that depends on the integer propagation level ipl as follows: +Schedule tasks with start times s, processing times p, and end times e on a unary resource. The propagator uses the algorithms from: Petr Vilím, Global Constraints in Scheduling, PhD thesis, Charles University, Prague, Czech Republic, 2007.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The propagator performs propagation that depends on the integer propagation level ipl as follows: If IPL_BASIC is set, the propagator performs overload checking and time-tabling propagation.If IPL_ADVANCED is set, the propagator performs overload checking, detectable precendence propagation, not-first-not-last propagation, and edge finding.If both flags are combined, all the above listed propagation is performed. The processing times are constrained to be non-negative.Throws an exception of type Int::ArgumentSizeMismatch, if s and p are of different size. - + GECODE_INT_EXPORT void @@ -11896,39 +12930,39 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &s, const IntVarArgs &p, const IntVarArgs &e, const BoolVarArgs &m, IntPropLevel ipl=IPL_DEF) unary - Home + Home home - const IntVarArgs & + const IntVarArgs & s - const IntVarArgs & + const IntVarArgs & p - const IntVarArgs & + const IntVarArgs & e - const BoolVarArgs & + const BoolVarArgs & m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling optional tasks on unary resources. Schedule optional tasks with start times s, processing times p, end times e, and whether a task is mandatory m (a task is mandatory if the Boolean variable is 1) on a unary resource. The propagator uses the algorithms from: Petr Vilím, Global Constraints in Scheduling, PhD thesis, Charles University, Prague, Czech Republic, 2007.The propagator performs propagation that depends on the integer propagation level ipl as follows: If IPL_BASIC is set, the propagator performs overload checking and time-tabling propagation.If IPL_ADVANCED is set, the propagator performs overload checking, detectable precendence propagation, not-first-not-last propagation, and edge finding.If both flags are combined, all the above listed propagation is performed. -The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The processing times are constrained to be non-negative.Throws an exception of type Int::ArgumentSizeMismatch, if s, p, or m are of different size. +The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The processing times are constrained to be non-negative.Throws an exception of type Int::ArgumentSizeMismatch, if s, p, or m are of different size. - + GECODE_INT_EXPORT void @@ -11936,7 +12970,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, int c, const TaskTypeArgs &t, const IntVarArgs &flex, const IntArgs &fix, const IntArgs &u, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home @@ -11944,25 +12978,25 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr c - const TaskTypeArgs & + const TaskTypeArgs & t - const IntVarArgs & + const IntVarArgs & flex - const IntArgs & + const IntArgs & fix - const IntArgs & + const IntArgs & u - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling tasks on cumulative resources. @@ -11976,7 +13010,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11984,33 +13018,33 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, IntVar c, const TaskTypeArgs &t, const IntVarArgs &flex, const IntArgs &fix, const IntArgs &u, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home - IntVar + IntVar c - const TaskTypeArgs & + const TaskTypeArgs & t - const IntVarArgs & + const IntVarArgs & flex - const IntArgs & + const IntArgs & fix - const IntArgs & + const IntArgs & u - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling tasks on cumulative resources. @@ -12024,7 +13058,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12032,7 +13066,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, int c, const TaskTypeArgs &t, const IntVarArgs &flex, const IntArgs &fix, const IntArgs &u, const BoolVarArgs &m, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home @@ -12040,29 +13074,29 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr c - const TaskTypeArgs & + const TaskTypeArgs & t - const IntVarArgs & + const IntVarArgs & flex - const IntArgs & + const IntArgs & fix - const IntArgs & + const IntArgs & u - const BoolVarArgs & + const BoolVarArgs & m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling optional tasks on cumulative resources. @@ -12076,7 +13110,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12084,37 +13118,37 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, IntVar c, const TaskTypeArgs &t, const IntVarArgs &flex, const IntArgs &fix, const IntArgs &u, const BoolVarArgs &m, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home - IntVar + IntVar c - const TaskTypeArgs & + const TaskTypeArgs & t - const IntVarArgs & + const IntVarArgs & flex - const IntArgs & + const IntArgs & fix - const IntArgs & + const IntArgs & u - const BoolVarArgs & + const BoolVarArgs & m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling optional tasks on cumulative resources. @@ -12128,7 +13162,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12136,7 +13170,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, int c, const IntVarArgs &s, const IntArgs &p, const IntArgs &u, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home @@ -12144,21 +13178,21 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr c - const IntVarArgs & + const IntVarArgs & s - const IntArgs & + const IntArgs & p - const IntArgs & + const IntArgs & u - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling tasks on cumulative resources. @@ -12170,7 +13204,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12178,29 +13212,29 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, IntVar c, const IntVarArgs &s, const IntArgs &p, const IntArgs &u, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home - IntVar + IntVar c - const IntVarArgs & + const IntVarArgs & s - const IntArgs & + const IntArgs & p - const IntArgs & + const IntArgs & u - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling tasks on cumulative resources. @@ -12212,7 +13246,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12220,7 +13254,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, int c, const IntVarArgs &s, const IntArgs &p, const IntArgs &u, const BoolVarArgs &m, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home @@ -12228,25 +13262,25 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr c - const IntVarArgs & + const IntVarArgs & s - const IntArgs & + const IntArgs & p - const IntArgs & + const IntArgs & u - const BoolVarArgs & + const BoolVarArgs & m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling optional tasks on cumulative resources. @@ -12258,7 +13292,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12266,33 +13300,33 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, IntVar c, const IntVarArgs &s, const IntArgs &p, const IntArgs &u, const BoolVarArgs &m, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home - IntVar + IntVar c - const IntVarArgs & + const IntVarArgs & s - const IntArgs & + const IntArgs & p - const IntArgs & + const IntArgs & u - const BoolVarArgs & + const BoolVarArgs & m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling optional tasks on cumulative resources. @@ -12304,7 +13338,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12312,7 +13346,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, int c, const IntVarArgs &s, const IntVarArgs &p, const IntVarArgs &e, const IntArgs &u, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home @@ -12320,37 +13354,37 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr c - const IntVarArgs & + const IntVarArgs & s - const IntVarArgs & + const IntVarArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntArgs & + const IntArgs & u - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling tasks on cumulative resources. -Schedule tasks with start times s, processing times p, end times e, and use capacity u on a cumulative resource with capacity c.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The propagator performs propagation that depends on the integer propagation level ipl as follows: +Schedule tasks with start times s, processing times p, end times e, and use capacity u on a cumulative resource with capacity c.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The propagator performs propagation that depends on the integer propagation level ipl as follows: If IPL_BASIC is set, the propagator performs overload checking and time-tabling propagation.If IPL_ADVANCED is set, the propagator performs overload checking and edge finding.If both flags are combined, all the above listed propagation is performed. The propagator uses algorithms taken from:Petr Vilím, Max Energy Filtering Algorithm for Discrete Cumulative Resources, in W. J. van Hoeve and J. N. Hooker, editors, CPAIOR, volume 5547 of LNCS, pages 294-308. Springer, 2009.andPetr Vilím, Edge finding filtering algorithm for discrete cumulative resources in O(kn log n). In I. P. Gent, editor, CP, volume 5732 of LNCS, pages 802-816. Springer, 2009. Throws an exception of type Int::ArgumentSizeMismatch, if s p, or u are of different size.Throws an exception of type Int::OutOfLimits, if u or c contain an integer that is not nonnegative, or that could generate an overflow. - + GECODE_INT_EXPORT void @@ -12358,45 +13392,45 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, IntVar c, const IntVarArgs &s, const IntVarArgs &p, const IntVarArgs &e, const IntArgs &u, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home - IntVar + IntVar c - const IntVarArgs & + const IntVarArgs & s - const IntVarArgs & + const IntVarArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntArgs & + const IntArgs & u - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling tasks on cumulative resources. -Post propagators for scheduling tasks on cumulative resources. Schedule tasks with start times s, processing times p, end times e, and use capacity u on a cumulative resource with capacity c.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The propagator performs propagation that depends on the integer propagation level ipl as follows: +Post propagators for scheduling tasks on cumulative resources. Schedule tasks with start times s, processing times p, end times e, and use capacity u on a cumulative resource with capacity c.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The propagator performs propagation that depends on the integer propagation level ipl as follows: If IPL_BASIC is set, the propagator performs overload checking and time-tabling propagation.If IPL_ADVANCED is set, the propagator performs overload checking and edge finding.If both flags are combined, all the above listed propagation is performed. The propagator uses algorithms taken from:Petr Vilím, Max Energy Filtering Algorithm for Discrete Cumulative Resources, in W. J. van Hoeve and J. N. Hooker, editors, CPAIOR, volume 5547 of LNCS, pages 294-308. Springer, 2009.andPetr Vilím, Edge finding filtering algorithm for discrete cumulative resources in O(kn log n). In I. P. Gent, editor, CP, volume 5732 of LNCS, pages 802-816. Springer, 2009. Throws an exception of type Int::ArgumentSizeMismatch, if s p, or u are of different size.Throws an exception of type Int::OutOfLimits, if u or c contain an integer that is not nonnegative, or that could generate an overflow. - + GECODE_INT_EXPORT void @@ -12404,7 +13438,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, int c, const IntVarArgs &s, const IntVarArgs &p, const IntVarArgs &e, const IntArgs &u, const BoolVarArgs &m, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home @@ -12412,41 +13446,41 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr c - const IntVarArgs & + const IntVarArgs & s - const IntVarArgs & + const IntVarArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntArgs & + const IntArgs & u - const BoolVarArgs & + const BoolVarArgs & m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling optional tasks on cumulative resources. -Schedule optional tasks with start times s, processing times p, end times e, used capacity u, and whether a task is mandatory m (a task is mandatory if the Boolean variable is 1) on a cumulative resource with capacity c.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The propagator performs propagation that depends on the integer propagation level ipl as follows: +Schedule optional tasks with start times s, processing times p, end times e, used capacity u, and whether a task is mandatory m (a task is mandatory if the Boolean variable is 1) on a cumulative resource with capacity c.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The propagator performs propagation that depends on the integer propagation level ipl as follows: If IPL_BASIC is set, the propagator performs overload checking and time-tabling propagation.If IPL_ADVANCED is set, the propagator performs overload checking and edge finding.If both flags are combined, all the above listed propagation is performed. The propagator uses algorithms taken from:Petr Vilím, Max Energy Filtering Algorithm for Discrete Cumulative Resources, in W. J. van Hoeve and J. N. Hooker, editors, CPAIOR, volume 5547 of LNCS, pages 294-308. Springer, 2009.andPetr Vilím, Edge finding filtering algorithm for discrete cumulative resources in O(kn log n). In I. P. Gent, editor, CP, volume 5732 of LNCS, pages 802-816. Springer, 2009. Throws an exception of type Int::ArgumentSizeMismatch, if s, p, u, or m are of different size.Throws an exception of type Int::OutOfLimits, if u or c contain an integer that is not nonnegative, or that could generate an overflow. - + GECODE_INT_EXPORT void @@ -12454,49 +13488,49 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, IntVar c, const IntVarArgs &s, const IntVarArgs &p, const IntVarArgs &e, const IntArgs &u, const BoolVarArgs &m, IntPropLevel ipl=IPL_DEF) cumulative - Home + Home home - IntVar + IntVar c - const IntVarArgs & + const IntVarArgs & s - const IntVarArgs & + const IntVarArgs & p - const IntVarArgs & + const IntVarArgs & e - const IntArgs & + const IntArgs & u - const BoolVarArgs & + const BoolVarArgs & m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagators for scheduling optional tasks on cumulative resources. -Post propagators for scheduling optional tasks on cumulative resources. Schedule optional tasks with start times s, processing times p, end times e, used capacity u, and whether a task is mandatory m (a task is mandatory if the Boolean variable is 1) on a cumulative resource with capacity c.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The propagator performs propagation that depends on the integer propagation level ipl as follows: +Post propagators for scheduling optional tasks on cumulative resources. Schedule optional tasks with start times s, processing times p, end times e, used capacity u, and whether a task is mandatory m (a task is mandatory if the Boolean variable is 1) on a cumulative resource with capacity c.The propagator does not enforce $s_i+p_i=e_i$, this constraint has to be posted in addition to ensure consistency of the task bounds.The propagator performs propagation that depends on the integer propagation level ipl as follows: If IPL_BASIC is set, the propagator performs overload checking and time-tabling propagation.If IPL_ADVANCED is set, the propagator performs overload checking and edge finding.If both flags are combined, all the above listed propagation is performed. The propagator uses algorithms taken from:Petr Vilím, Max Energy Filtering Algorithm for Discrete Cumulative Resources, in W. J. van Hoeve and J. N. Hooker, editors, CPAIOR, volume 5547 of LNCS, pages 294-308. Springer, 2009.andPetr Vilím, Edge finding filtering algorithm for discrete cumulative resources in O(kn log n). In I. P. Gent, editor, CP, volume 5732 of LNCS, pages 802-816. Springer, 2009. Throws an exception of type Int::ArgumentSizeMismatch, if s, p, u, or m are of different size.Throws an exception of type Int::OutOfLimits, if u or c contain an integer that is not nonnegative, or that could generate an overflow. - + GECODE_INT_EXPORT void @@ -12504,27 +13538,27 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, IntPropLevel ipl=IPL_DEF) circuit - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a circuit. -x forms a circuit if the graph with edges $i\to j$ where $x_i=j$ has a single cycle covering all nodes.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x.Throws the following exceptions: +x forms a circuit if the graph with edges $i\to j$ where $x_i=j$ has a single cycle covering all nodes.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x.Throws the following exceptions: Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements. - + GECODE_INT_EXPORT void @@ -12532,7 +13566,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, int offset, const IntVarArgs &x, IntPropLevel ipl=IPL_DEF) circuit - Home + Home home @@ -12540,23 +13574,23 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr offset - const IntVarArgs & + const IntVarArgs & x - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a circuit. -x forms a circuit if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ has a single cycle covering all nodes.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x.Throws the following exceptions: +x forms a circuit if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ has a single cycle covering all nodes.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x.Throws the following exceptions: Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::OutOfLimits, if offset is negative. - + GECODE_INT_EXPORT void @@ -12564,39 +13598,39 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &c, const IntVarArgs &x, const IntVarArgs &y, IntVar z, IntPropLevel ipl=IPL_DEF) circuit - Home + Home home - const IntArgs & + const IntArgs & c - const IntVarArgs & + const IntVarArgs & x - const IntVarArgs & + const IntVarArgs & y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a circuit with costs y and z. -x forms a circuit if the graph with edges $i\to j$ where $x_i=j$ has a single cycle covering all nodes. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire circuit. The variables y define the cost of the edge in x: that is, if $x_i=j$ then $y_i=c_{i*n+j}$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: -Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if x and y do not have the same size or if $|x|\times|x|\neq|c|$. +x forms a circuit if the graph with edges $i\to j$ where $x_i=j$ has a single cycle covering all nodes. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire circuit. The variables y define the cost of the edge in x: that is, if $x_i=j$ then $y_i=c_{i*n+j}$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: +Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if x and y do not have the same size or if $|x|\times|x|\neq|c|$. - + GECODE_INT_EXPORT void @@ -12604,11 +13638,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &c, int offset, const IntVarArgs &x, const IntVarArgs &y, IntVar z, IntPropLevel ipl=IPL_DEF) circuit - Home + Home home - const IntArgs & + const IntArgs & c @@ -12616,31 +13650,31 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr offset - const IntVarArgs & + const IntVarArgs & x - const IntVarArgs & + const IntVarArgs & y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a circuit with costs y and z. -x forms a circuit if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ has a single cycle covering all nodes. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire circuit. The variables y define the cost of the edge in x: that is, if $x_i=j$ then $y_i=c_{i*n+j}$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: -Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if x and y do not have the same size or if $|x|\times|x|\neq|c|$.Int::OutOfLimits, if offset is negative. +x forms a circuit if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ has a single cycle covering all nodes. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire circuit. The variables y define the cost of the edge in x: that is, if $x_i=j$ then $y_i=c_{i*n+j}$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: +Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if x and y do not have the same size or if $|x|\times|x|\neq|c|$.Int::OutOfLimits, if offset is negative. - + GECODE_INT_EXPORT void @@ -12648,35 +13682,35 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &c, const IntVarArgs &x, IntVar z, IntPropLevel ipl=IPL_DEF) circuit - Home + Home home - const IntArgs & + const IntArgs & c - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a circuit with cost z. -x forms a circuit if the graph with edges $i\to j$ where $x_i=j$ has a single cycle covering all nodes. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire circuit.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: -Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if $|x|\times|x|\neq|c|$. +x forms a circuit if the graph with edges $i\to j$ where $x_i=j$ has a single cycle covering all nodes. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire circuit.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: +Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if $|x|\times|x|\neq|c|$. - + GECODE_INT_EXPORT void @@ -12684,11 +13718,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &c, int offset, const IntVarArgs &x, IntVar z, IntPropLevel ipl=IPL_DEF) circuit - Home + Home home - const IntArgs & + const IntArgs & c @@ -12696,27 +13730,27 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr offset - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a circuit with cost z. -x forms a circuit if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ has a single cycle covering all nodes. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire circuit.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: -Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if $|x|\times|x|\neq|c|$.Int::OutOfLimits, if offset is negative. +x forms a circuit if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ has a single cycle covering all nodes. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire circuit.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: +Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if $|x|\times|x|\neq|c|$.Int::OutOfLimits, if offset is negative. - + GECODE_INT_EXPORT void @@ -12724,35 +13758,35 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, IntVar s, IntVar e, IntPropLevel ipl=IPL_DEF) path - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar s - IntVar + IntVar e - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a Hamiltonian path. -x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_i=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x.Throws the following exceptions: +x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_i=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x.Throws the following exceptions: Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements. - + GECODE_INT_EXPORT void @@ -12760,7 +13794,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, int offset, const IntVarArgs &x, IntVar s, IntVar e, IntPropLevel ipl=IPL_DEF) path - Home + Home home @@ -12768,31 +13802,31 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr offset - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar s - IntVar + IntVar e - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a Hamiltonian path. -x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|+\text{offset}$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x.Throws the following exceptions: +x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|+\text{offset}$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x.Throws the following exceptions: Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::OutOfLimits, if offset is negative. - + GECODE_INT_EXPORT void @@ -12800,47 +13834,47 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &c, const IntVarArgs &x, IntVar s, IntVar e, const IntVarArgs &y, IntVar z, IntPropLevel ipl=IPL_DEF) path - Home + Home home - const IntArgs & + const IntArgs & c - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar s - IntVar + IntVar e - const IntVarArgs & + const IntVarArgs & y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a Hamiltonian path with costs y and z. -x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_i=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|$. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire path. The variables y define the cost of the edge in x: that is, if $x_i=j$ then $y_i=c_{i*n+j}$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: -Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if x and y do not have the same size or if $|x|\times|x|\neq|c|$. +x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_i=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|$. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire path. The variables y define the cost of the edge in x: that is, if $x_i=j$ then $y_i=c_{i*n+j}$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: +Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if x and y do not have the same size or if $|x|\times|x|\neq|c|$. - + GECODE_INT_EXPORT void @@ -12848,11 +13882,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &c, int offset, const IntVarArgs &x, IntVar s, IntVar e, const IntVarArgs &y, IntVar z, IntPropLevel ipl=IPL_DEF) path - Home + Home home - const IntArgs & + const IntArgs & c @@ -12860,39 +13894,39 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr offset - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar s - IntVar + IntVar e - const IntVarArgs & + const IntVarArgs & y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a Hamiltonian path with costs y and z. -x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|+\text{offset}$. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire path. The variables y define the cost of the edge in x: that is, if $x_i=j$ then $y_i=c_{i*n+j}$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: -Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if x and y do not have the same size or if $|x|\times|x|\neq|c|$.Int::OutOfLimits, if offset is negative. +x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|+\text{offset}$. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire path. The variables y define the cost of the edge in x: that is, if $x_i=j$ then $y_i=c_{i*n+j}$.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: +Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if x and y do not have the same size or if $|x|\times|x|\neq|c|$.Int::OutOfLimits, if offset is negative. - + GECODE_INT_EXPORT void @@ -12900,43 +13934,43 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &c, const IntVarArgs &x, IntVar s, IntVar e, IntVar z, IntPropLevel ipl=IPL_DEF) path - Home + Home home - const IntArgs & + const IntArgs & c - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar s - IntVar + IntVar e - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a Hamiltonian path with cost z. -x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_i=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|$. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire path.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: -Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if $|x|\times|x|\neq|c|$. +x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_i=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|$. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire path.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: +Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if $|x|\times|x|\neq|c|$. - + GECODE_INT_EXPORT void @@ -12944,11 +13978,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntArgs &c, int offset, const IntVarArgs &x, IntVar s, IntVar e, IntVar z, IntPropLevel ipl=IPL_DEF) path - Home + Home home - const IntArgs & + const IntArgs & c @@ -12956,57 +13990,57 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr offset - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar s - IntVar + IntVar e - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post propagator such that x forms a Hamiltonian path with cost z. -x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|+\text{offset}$. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire circuit.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: -Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if $|x|\times|x|\neq|c|$.Int::OutOfLimits, if offset is negative. +x forms a Hamiltonian path if the graph with edges $i\to j$ where $x_{i-\text{offset}}=j$ visits all nodes exactly once. The path starts at node s and the successor of the last node e is equal to $|x|+\text{offset}$. The integer array c gives the costs of all possible edges where $c_{i*|x|+j}$ is the cost of the edge $i\to j$. The variable z is the cost of the entire circuit.Supports domain (ipl = IPL_DOM) and value propagation (all other values for ipl), where this refers to whether value or domain consistent distinct in enforced on x for circuit.Throws the following exceptions: +Int::ArgumentSame, if x contains the same unassigned variable multiply.Int::TooFewArguments, if x has no elements.Int::ArgumentSizeMismacth, if $|x|\times|x|\neq|c|$.Int::OutOfLimits, if offset is negative. - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::wait - (Home home, IntVar x, void(*c)(Space &home), IntPropLevel ipl=IPL_DEF) + (Home home, IntVar x, std::function< void(Space &home)> c, IntPropLevel ipl=IPL_DEF) wait - Home + Home home - IntVar + IntVar x - void(*)(Space &home) + std::function< void(Space &home)> c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Execute c when x becomes assigned. @@ -13014,29 +14048,29 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::wait - (Home home, BoolVar x, void(*c)(Space &home), IntPropLevel ipl=IPL_DEF) + (Home home, BoolVar x, std::function< void(Space &home)> c, IntPropLevel ipl=IPL_DEF) wait - Home + Home home - BoolVar + BoolVar x - void(*)(Space &home) + std::function< void(Space &home)> c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Execute c when x becomes assigned. @@ -13044,29 +14078,29 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::wait - (Home home, const IntVarArgs &x, void(*c)(Space &home), IntPropLevel ipl=IPL_DEF) + (Home home, const IntVarArgs &x, std::function< void(Space &home)> c, IntPropLevel ipl=IPL_DEF) wait - Home + Home home - const IntVarArgs & + const IntVarArgs & x - void(*)(Space &home) + std::function< void(Space &home)> c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Execute c when all variables in x become assigned. @@ -13074,29 +14108,29 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::wait - (Home home, const BoolVarArgs &x, void(*c)(Space &home), IntPropLevel ipl=IPL_DEF) + (Home home, const BoolVarArgs &x, std::function< void(Space &home)> c, IntPropLevel ipl=IPL_DEF) wait - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - void(*)(Space &home) + std::function< void(Space &home)> c - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Execute c when all variables in x become assigned. @@ -13104,34 +14138,33 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::when - (Home home, BoolVar x, void(*t)(Space &home), void(*e)(Space &home)=NULL, IntPropLevel ipl=IPL_DEF) + (Home home, BoolVar x, std::function< void(Space &home)> t, std::function< void(Space &home)> e, IntPropLevel ipl=IPL_DEF) when - Home + Home home - BoolVar + BoolVar x - void(*)(Space &home) + std::function< void(Space &home)> t - void(*)(Space &home) + std::function< void(Space &home)> e - NULL - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Execute t (then) when x is assigned one, and e (else) otherwise. @@ -13139,7 +14172,37 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + + + + GECODE_INT_EXPORT void + GECODE_INT_EXPORT void Gecode::when + (Home home, BoolVar x, std::function< void(Space &home)> t, IntPropLevel ipl=IPL_DEF) + when + + Home + home + + + BoolVar + x + + + std::function< void(Space &home)> + t + + + IntPropLevel + ipl + IPL_DEF + + +Execute t (then) when x is assigned one. + + + + + GECODE_INT_EXPORT void @@ -13147,17 +14210,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, IntVarArgs &x, IntPropLevel ipl=IPL_DEF) unshare - Home + Home home - IntVarArgs & + IntVarArgs & x - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Replace multiple variable occurences in x by fresh variables. @@ -13165,7 +14228,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr Supports domain consistency (ipl = IPL_DOM, default) and bounds consistency (ipl = IPL_BND). - + GECODE_INT_EXPORT void @@ -13173,17 +14236,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, BoolVarArgs &x, IntPropLevel ipl=IPL_DEF) unshare - Home + Home home - BoolVarArgs & + BoolVarArgs & x - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Replace multiple variable occurences in x by fresh variables. @@ -13191,38 +14254,38 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::branch - (Home home, const IntVarArgs &x, IntVarBranch vars, IntValBranch vals, IntBranchFilter bf=NULL, IntVarValPrint vvp=NULL) + (Home home, const IntVarArgs &x, IntVarBranch vars, IntValBranch vals, IntBranchFilter bf=nullptr, IntVarValPrint vvp=nullptr) branch - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVarBranch + IntVarBranch vars - IntValBranch + IntValBranch vals - IntBranchFilter + IntBranchFilter bf - NULL + nullptr - IntVarValPrint + IntVarValPrint vvp - NULL + nullptr Branch over x with variable selection vars and value selection vals. @@ -13230,38 +14293,38 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::branch - (Home home, const IntVarArgs &x, TieBreak< IntVarBranch > vars, IntValBranch vals, IntBranchFilter bf=NULL, IntVarValPrint vvp=NULL) + (Home home, const IntVarArgs &x, TieBreak< IntVarBranch > vars, IntValBranch vals, IntBranchFilter bf=nullptr, IntVarValPrint vvp=nullptr) branch - Home + Home home - const IntVarArgs & + const IntVarArgs & x - TieBreak< IntVarBranch > + TieBreak< IntVarBranch > vars - IntValBranch + IntValBranch vals - IntBranchFilter + IntBranchFilter bf - NULL + nullptr - IntVarValPrint + IntVarValPrint vvp - NULL + nullptr Branch over x with tie-breaking variable selection vars and value selection vals. @@ -13269,29 +14332,29 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::branch - (Home home, IntVar x, IntValBranch vals, IntVarValPrint vvp=NULL) + (Home home, IntVar x, IntValBranch vals, IntVarValPrint vvp=nullptr) branch - Home + Home home - IntVar + IntVar x - IntValBranch + IntValBranch vals - IntVarValPrint + IntVarValPrint vvp - NULL + nullptr Branch over x with value selection vals. @@ -13299,38 +14362,38 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::branch - (Home home, const BoolVarArgs &x, IntVarBranch vars, IntValBranch vals, BoolBranchFilter bf=NULL, BoolVarValPrint vvp=NULL) + (Home home, const BoolVarArgs &x, BoolVarBranch vars, BoolValBranch vals, BoolBranchFilter bf=nullptr, BoolVarValPrint vvp=nullptr) branch - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntVarBranch + BoolVarBranch vars - IntValBranch + BoolValBranch vals - BoolBranchFilter + BoolBranchFilter bf - NULL + nullptr - BoolVarValPrint + BoolVarValPrint vvp - NULL + nullptr Branch over x with variable selection vars and value selection vals. @@ -13338,38 +14401,38 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::branch - (Home home, const BoolVarArgs &x, TieBreak< IntVarBranch > vars, IntValBranch vals, BoolBranchFilter bf=NULL, BoolVarValPrint vvp=NULL) + (Home home, const BoolVarArgs &x, TieBreak< BoolVarBranch > vars, BoolValBranch vals, BoolBranchFilter bf=nullptr, BoolVarValPrint vvp=nullptr) branch - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - TieBreak< IntVarBranch > + TieBreak< BoolVarBranch > vars - IntValBranch + BoolValBranch vals - BoolBranchFilter + BoolBranchFilter bf - NULL + nullptr - BoolVarValPrint + BoolVarValPrint vvp - NULL + nullptr Branch over x with tie-breaking variable selection vars and value selection vals. @@ -13377,29 +14440,29 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::branch - (Home home, BoolVar x, IntValBranch vals, BoolVarValPrint vvp=NULL) + (Home home, BoolVar x, BoolValBranch vals, BoolVarValPrint vvp=nullptr) branch - Home + Home home - BoolVar + BoolVar x - IntValBranch + BoolValBranch vals - BoolVarValPrint + BoolVarValPrint vvp - NULL + nullptr Branch over x with value selection vals. @@ -13407,34 +14470,34 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::assign - (Home home, const IntVarArgs &x, IntAssign vals, IntBranchFilter ibf=NULL, IntVarValPrint vvp=NULL) + (Home home, const IntVarArgs &x, IntAssign vals, IntBranchFilter bf=nullptr, IntVarValPrint vvp=nullptr) assign - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntAssign + IntAssign vals - IntBranchFilter - ibf - NULL + IntBranchFilter + bf + nullptr - IntVarValPrint + IntVarValPrint vvp - NULL + nullptr Assign all x with value selection vals. @@ -13442,29 +14505,29 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::assign - (Home home, IntVar x, IntAssign vals, IntVarValPrint vvp=NULL) + (Home home, IntVar x, IntAssign vals, IntVarValPrint vvp=nullptr) assign - Home + Home home - IntVar + IntVar x - IntAssign + IntAssign vals - IntVarValPrint + IntVarValPrint vvp - NULL + nullptr Assign x with value selection vals. @@ -13472,34 +14535,34 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::assign - (Home home, const BoolVarArgs &x, IntAssign vals, BoolBranchFilter bbf=NULL, BoolVarValPrint vvp=NULL) + (Home home, const BoolVarArgs &x, BoolAssign vals, BoolBranchFilter bf=nullptr, BoolVarValPrint vvp=nullptr) assign - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntAssign + BoolAssign vals - BoolBranchFilter - bbf - NULL + BoolBranchFilter + bf + nullptr - BoolVarValPrint + BoolVarValPrint vvp - NULL + nullptr Assign all x with value selection vals. @@ -13507,29 +14570,29 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::assign - (Home home, BoolVar x, IntAssign vals, BoolVarValPrint vvp=NULL) + (Home home, BoolVar x, BoolAssign vals, BoolVarValPrint vvp=nullptr) assign - Home + Home home - BoolVar + BoolVar x - IntAssign + BoolAssign vals - BoolVarValPrint + BoolVarValPrint vvp - NULL + nullptr Assign x with value selection vals. @@ -13537,15 +14600,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_INT_EXPORT SymmetryHandle + GECODE_INT_EXPORT SymmetryHandle GECODE_INT_EXPORT SymmetryHandle Gecode::VariableSymmetry (const IntVarArgs &x) VariableSymmetry - const IntVarArgs & + const IntVarArgs & x @@ -13554,15 +14617,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_INT_EXPORT SymmetryHandle + GECODE_INT_EXPORT SymmetryHandle GECODE_INT_EXPORT SymmetryHandle Gecode::VariableSymmetry (const BoolVarArgs &x) VariableSymmetry - const BoolVarArgs & + const BoolVarArgs & x @@ -13571,19 +14634,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_INT_EXPORT SymmetryHandle + GECODE_INT_EXPORT SymmetryHandle GECODE_INT_EXPORT SymmetryHandle Gecode::VariableSymmetry (const IntVarArgs &x, const IntArgs &indices) VariableSymmetry - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & indices @@ -13592,15 +14655,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_INT_EXPORT SymmetryHandle + GECODE_INT_EXPORT SymmetryHandle GECODE_INT_EXPORT SymmetryHandle Gecode::ValueSymmetry (const IntArgs &v) ValueSymmetry - const IntArgs & + const IntArgs & v @@ -13609,15 +14672,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_INT_EXPORT SymmetryHandle + GECODE_INT_EXPORT SymmetryHandle GECODE_INT_EXPORT SymmetryHandle Gecode::ValueSymmetry (const IntSet &v) ValueSymmetry - const IntSet & + const IntSet & v @@ -13626,15 +14689,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_INT_EXPORT SymmetryHandle + GECODE_INT_EXPORT SymmetryHandle GECODE_INT_EXPORT SymmetryHandle Gecode::ValueSymmetry (IntVar vars) ValueSymmetry - IntVar + IntVar vars @@ -13643,15 +14706,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_INT_EXPORT SymmetryHandle + GECODE_INT_EXPORT SymmetryHandle GECODE_INT_EXPORT SymmetryHandle Gecode::VariableSequenceSymmetry (const IntVarArgs &x, int ss) VariableSequenceSymmetry - const IntVarArgs & + const IntVarArgs & x @@ -13664,15 +14727,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr The size of x must be a multiple of ss. - + - GECODE_INT_EXPORT SymmetryHandle + GECODE_INT_EXPORT SymmetryHandle GECODE_INT_EXPORT SymmetryHandle Gecode::VariableSequenceSymmetry (const BoolVarArgs &x, int ss) VariableSequenceSymmetry - const BoolVarArgs & + const BoolVarArgs & x @@ -13685,15 +14748,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr The size of x must be a multiple of ss. - + - GECODE_INT_EXPORT SymmetryHandle + GECODE_INT_EXPORT SymmetryHandle GECODE_INT_EXPORT SymmetryHandle Gecode::ValueSequenceSymmetry (const IntArgs &v, int ss) ValueSequenceSymmetry - const IntArgs & + const IntArgs & v @@ -13706,10 +14769,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr The size of v must be a multiple of ss. - + - GECODE_INT_EXPORT SymmetryHandle + GECODE_INT_EXPORT SymmetryHandle GECODE_INT_EXPORT SymmetryHandle Gecode::values_reflect (int lower, int upper) values_reflect @@ -13727,15 +14790,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_INT_EXPORT SymmetryHandle + GECODE_INT_EXPORT SymmetryHandle GECODE_INT_EXPORT SymmetryHandle Gecode::values_reflect (IntVar x) values_reflect - IntVar + IntVar x @@ -13744,42 +14807,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::branch - (Home home, const IntVarArgs &x, IntVarBranch vars, IntValBranch vals, const Symmetries &syms, IntBranchFilter bf=NULL, IntVarValPrint vvp=NULL) + (Home home, const IntVarArgs &x, IntVarBranch vars, IntValBranch vals, const Symmetries &syms, IntBranchFilter bf=nullptr, IntVarValPrint vvp=nullptr) branch - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVarBranch + IntVarBranch vars - IntValBranch + IntValBranch vals - const Symmetries & + const Symmetries & syms - IntBranchFilter + IntBranchFilter bf - NULL + nullptr - IntVarValPrint + IntVarValPrint vvp - NULL + nullptr Branch over x with variable selection vars and value selection vals with symmetry breaking. @@ -13787,42 +14850,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr Throws LDSBBadValueSelection exception if vals is any of SEL_SPLIT_MIN, SEL_SPLIT_MAX, SEL_RANGE_MIN, SEL_RANGE_MAX, SEL_VALUES_MIN, and SEL_VALUES_MAX, or if vals is SEL_VAL_COMMIT with a custom commit function. - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::branch - (Home home, const IntVarArgs &x, TieBreak< IntVarBranch > vars, IntValBranch vals, const Symmetries &syms, IntBranchFilter bf=NULL, IntVarValPrint vvp=NULL) + (Home home, const IntVarArgs &x, TieBreak< IntVarBranch > vars, IntValBranch vals, const Symmetries &syms, IntBranchFilter bf=nullptr, IntVarValPrint vvp=nullptr) branch - Home + Home home - const IntVarArgs & + const IntVarArgs & x - TieBreak< IntVarBranch > + TieBreak< IntVarBranch > vars - IntValBranch + IntValBranch vals - const Symmetries & + const Symmetries & syms - IntBranchFilter + IntBranchFilter bf - NULL + nullptr - IntVarValPrint + IntVarValPrint vvp - NULL + nullptr Branch over x with tie-breaking variable selection vars and value selection vals with symmetry breaking. @@ -13830,42 +14893,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr Throws LDSBBadValueSelection exception if vals is any of SEL_SPLIT_MIN, SEL_SPLIT_MAX, SEL_RANGE_MIN, SEL_RANGE_MAX, SEL_VALUES_MIN, and SEL_VALUES_MAX, or if vals is SEL_VAL_COMMIT with a custom commit function. - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::branch - (Home home, const BoolVarArgs &x, IntVarBranch vars, IntValBranch vals, const Symmetries &syms, BoolBranchFilter bf=NULL, BoolVarValPrint vvp=NULL) + (Home home, const BoolVarArgs &x, BoolVarBranch vars, BoolValBranch vals, const Symmetries &syms, BoolBranchFilter bf=nullptr, BoolVarValPrint vvp=nullptr) branch - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntVarBranch + BoolVarBranch vars - IntValBranch + BoolValBranch vals - const Symmetries & + const Symmetries & syms - BoolBranchFilter + BoolBranchFilter bf - NULL + nullptr - BoolVarValPrint + BoolVarValPrint vvp - NULL + nullptr Branch over x with variable selection vars and value selection vals with symmetry breaking. @@ -13873,42 +14936,42 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr Throws LDSBBadValueSelection exception if vals is any of SEL_SPLIT_MIN, SEL_SPLIT_MAX, SEL_RANGE_MIN, SEL_RANGE_MAX, SEL_VALUES_MIN, and SEL_VALUES_MAX, or if vals is SEL_VAL_COMMIT with a custom commit function. - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::branch - (Home home, const BoolVarArgs &x, TieBreak< IntVarBranch > vars, IntValBranch vals, const Symmetries &syms, BoolBranchFilter bf=NULL, BoolVarValPrint vvp=NULL) + (Home home, const BoolVarArgs &x, TieBreak< BoolVarBranch > vars, BoolValBranch vals, const Symmetries &syms, BoolBranchFilter bf=nullptr, BoolVarValPrint vvp=nullptr) branch - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - TieBreak< IntVarBranch > + TieBreak< BoolVarBranch > vars - IntValBranch + BoolValBranch vals - const Symmetries & + const Symmetries & syms - BoolBranchFilter + BoolBranchFilter bf - NULL + nullptr - BoolVarValPrint + BoolVarValPrint vvp - NULL + nullptr Branch over x with tie-breaking variable selection vars and value selection vals with symmetry breaking. @@ -13916,7 +14979,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr Throws LDSBBadValueSelection exception if vals is any of SEL_SPLIT_MIN, SEL_SPLIT_MAX, SEL_RANGE_MIN, SEL_RANGE_MAX, SEL_VALUES_MIN, and SEL_VALUES_MAX, or if vals is SEL_VAL_COMMIT with a custom commit function. - + GECODE_INT_EXPORT void @@ -13924,19 +14987,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, const IntVarArgs &sx, Rnd r, double p) relax - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntVarArgs & + const IntVarArgs & sx - Rnd + Rnd r @@ -13949,7 +15012,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -13957,19 +15020,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const BoolVarArgs &x, const BoolVarArgs &sx, Rnd r, double p) relax - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - const BoolVarArgs & + const BoolVarArgs & sx - Rnd + Rnd r @@ -13982,34 +15045,34 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::trace - (Home home, const IntVarArgs &x, TraceFilter tf, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_DONE), IntTracer &t=StdIntTracer::def) + (Home home, const IntVarArgs &x, TraceFilter tf, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE), IntTracer &t=StdIntTracer::def) trace - Home + Home home - const IntVarArgs & + const IntVarArgs & x - TraceFilter + TraceFilter tf int te - (TE_INIT|TE_PRUNE|TE_FIX|TE_DONE) + (TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE) - IntTracer & + IntTracer & t - StdIntTracer::def + StdIntTracer::def Create a tracer for integer variables. @@ -14017,34 +15080,34 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_INT_EXPORT void GECODE_INT_EXPORT void Gecode::trace - (Home home, const BoolVarArgs &x, TraceFilter tf, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_DONE), BoolTracer &t=StdBoolTracer::def) + (Home home, const BoolVarArgs &x, TraceFilter tf, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE), BoolTracer &t=StdBoolTracer::def) trace - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - TraceFilter + TraceFilter tf int te - (TE_INIT|TE_PRUNE|TE_FIX|TE_DONE) + (TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE) - BoolTracer & + BoolTracer & t - StdBoolTracer::def + StdBoolTracer::def Create a tracer for Boolean Variables. @@ -14052,9 +15115,9 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + class Char @@ -14065,14 +15128,14 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr std::basic_ostream< Char, Traits > & std::basic_ostream<Char,Traits>& Gecode::operator<< - (std::basic_ostream< Char, Traits > &os, const Activity &a) + (std::basic_ostream< Char, Traits > &os, const Action &a) operator<< std::basic_ostream< Char, Traits > & os - const Activity & + const Action & a @@ -14081,7 +15144,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14101,7 +15164,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr os - const AFC & + const AFC & a @@ -14110,7 +15173,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14126,11 +15189,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (space_allocator< T1 > const &al1, space_allocator< T2 > const &al2) operator== - space_allocator< T1 > const & + space_allocator< T1 > const & al1 - space_allocator< T2 > const & + space_allocator< T2 > const & al2 throw () @@ -14140,7 +15203,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr Two allocators are equal when each can release storage allocated from the other. - + @@ -14156,11 +15219,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (space_allocator< T1 > const &al1, space_allocator< T2 > const &al2) operator!= - space_allocator< T1 > const & + space_allocator< T1 > const & al1 - space_allocator< T2 > const & + space_allocator< T2 > const & al2 throw () @@ -14170,7 +15233,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr Two allocators are equal when each can release storage allocated from the other. - + @@ -14186,11 +15249,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (region_allocator< T1 > const &al1, region_allocator< T2 > const &al2) operator== - region_allocator< T1 > const & + region_allocator< T1 > const & al1 - region_allocator< T2 > const & + region_allocator< T2 > const & al2 throw () @@ -14200,7 +15263,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14216,11 +15279,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (region_allocator< T1 > const &al1, region_allocator< T2 > const &al2) operator!= - region_allocator< T1 > const & + region_allocator< T1 > const & al1 - region_allocator< T2 > const & + region_allocator< T2 > const & al2 throw () @@ -14230,15 +15293,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator<< (Archive &e, unsigned int i) operator<< - Archive & + Archive & e @@ -14251,15 +15314,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator<< (Archive &e, int i) operator<< - Archive & + Archive & e @@ -14272,15 +15335,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator<< (Archive &e, unsigned short i) operator<< - Archive & + Archive & e @@ -14293,15 +15356,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator<< (Archive &e, short i) operator<< - Archive & + Archive & e @@ -14314,15 +15377,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator<< (Archive &e, unsigned char i) operator<< - Archive & + Archive & e @@ -14335,15 +15398,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator<< (Archive &e, char i) operator<< - Archive & + Archive & e @@ -14356,15 +15419,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator<< (Archive &e, bool i) operator<< - Archive & + Archive & e @@ -14377,15 +15440,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator<< (Archive &e, float d) operator<< - Archive & + Archive & e @@ -14398,15 +15461,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator<< (Archive &e, double d) operator<< - Archive & + Archive & e @@ -14419,15 +15482,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator>> (Archive &e, unsigned int &i) operator>> - Archive & + Archive & e @@ -14440,15 +15503,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator>> (Archive &e, int &i) operator>> - Archive & + Archive & e @@ -14461,15 +15524,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator>> (Archive &e, unsigned short &i) operator>> - Archive & + Archive & e @@ -14482,15 +15545,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator>> (Archive &e, short &i) operator>> - Archive & + Archive & e @@ -14503,15 +15566,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator>> (Archive &e, unsigned char &i) operator>> - Archive & + Archive & e @@ -14524,15 +15587,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator>> (Archive &e, char &i) operator>> - Archive & + Archive & e @@ -14545,15 +15608,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator>> (Archive &e, bool &i) operator>> - Archive & + Archive & e @@ -14566,15 +15629,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator>> (Archive &e, float &d) operator>> - Archive & + Archive & e @@ -14587,15 +15650,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - forceinline Archive & + forceinline Archive & forceinline Archive& Gecode::operator>> (Archive &e, double &d) operator>> - Archive & + Archive & e @@ -14608,7 +15671,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14616,16 +15679,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class Var - ArrayTraits< VarArray< Var > >::ArgsType + ArrayTraits< VarArray< Var > >::ArgsType ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ (const VarArray< Var > &x, const VarArray< Var > &y) operator+ - const VarArray< Var > & + const VarArray< Var > & x - const VarArray< Var > & + const VarArray< Var > & y @@ -14634,7 +15697,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14642,16 +15705,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class Var - ArrayTraits< VarArray< Var > >::ArgsType + ArrayTraits< VarArray< Var > >::ArgsType ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ (const VarArray< Var > &x, const VarArgArray< Var > &y) operator+ - const VarArray< Var > & + const VarArray< Var > & x - const VarArgArray< Var > & + const VarArgArray< Var > & y @@ -14660,7 +15723,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14668,16 +15731,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class Var - ArrayTraits< VarArray< Var > >::ArgsType + ArrayTraits< VarArray< Var > >::ArgsType ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ (const VarArgArray< Var > &x, const VarArray< Var > &y) operator+ - const VarArgArray< Var > & + const VarArgArray< Var > & x - const VarArray< Var > & + const VarArray< Var > & y @@ -14686,7 +15749,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14694,16 +15757,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class Var - ArrayTraits< VarArray< Var > >::ArgsType + ArrayTraits< VarArray< Var > >::ArgsType ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ (const VarArray< Var > &x, const Var &y) operator+ - const VarArray< Var > & + const VarArray< Var > & x - const Var & + const Var & y @@ -14712,7 +15775,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14720,16 +15783,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class Var - ArrayTraits< VarArray< Var > >::ArgsType + ArrayTraits< VarArray< Var > >::ArgsType ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ (const Var &x, const VarArray< Var > &y) operator+ - const Var & + const Var & x - const VarArray< Var > & + const VarArray< Var > & y @@ -14738,7 +15801,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14764,7 +15827,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14793,7 +15856,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14822,7 +15885,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14830,16 +15893,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class T - ArrayTraits< PrimArgArray< T > >::ArgsType + ArrayTraits< PrimArgArray< T > >::ArgsType ArrayTraits<PrimArgArray<T> >::ArgsType Gecode::operator+ (const PrimArgArray< T > &x, const PrimArgArray< T > &y) operator+ - const PrimArgArray< T > & + const PrimArgArray< T > & x - const PrimArgArray< T > & + const PrimArgArray< T > & y @@ -14848,7 +15911,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14856,12 +15919,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class T - ArrayTraits< PrimArgArray< T > >::ArgsType + ArrayTraits< PrimArgArray< T > >::ArgsType ArrayTraits<PrimArgArray<T> >::ArgsType Gecode::operator+ (const PrimArgArray< T > &x, const T &y) operator+ - const PrimArgArray< T > & + const PrimArgArray< T > & x @@ -14874,7 +15937,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14882,7 +15945,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class T - ArrayTraits< PrimArgArray< T > >::ArgsType + ArrayTraits< PrimArgArray< T > >::ArgsType ArrayTraits<PrimArgArray<T> >::ArgsType Gecode::operator+ (const T &x, const PrimArgArray< T > &y) operator+ @@ -14891,7 +15954,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr x - const PrimArgArray< T > & + const PrimArgArray< T > & y @@ -14900,7 +15963,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14908,16 +15971,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class T - ArrayTraits< ArgArray< T > >::ArgsType + ArrayTraits< ArgArray< T > >::ArgsType ArrayTraits<ArgArray<T> >::ArgsType Gecode::operator+ (const ArgArray< T > &x, const ArgArray< T > &y) operator+ - const ArgArray< T > & + const ArgArray< T > & x - const ArgArray< T > & + const ArgArray< T > & y @@ -14926,7 +15989,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14934,12 +15997,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class T - ArrayTraits< ArgArray< T > >::ArgsType + ArrayTraits< ArgArray< T > >::ArgsType ArrayTraits<ArgArray<T> >::ArgsType Gecode::operator+ (const ArgArray< T > &x, const T &y) operator+ - const ArgArray< T > & + const ArgArray< T > & x @@ -14952,7 +16015,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14960,7 +16023,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class T - ArrayTraits< ArgArray< T > >::ArgsType + ArrayTraits< ArgArray< T > >::ArgsType ArrayTraits<ArgArray<T> >::ArgsType Gecode::operator+ (const T &x, const ArgArray< T > &y) operator+ @@ -14969,7 +16032,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr x - const ArgArray< T > & + const ArgArray< T > & y @@ -14978,7 +16041,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -14986,16 +16049,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class Var - ArrayTraits< VarArgArray< Var > >::ArgsType + ArrayTraits< VarArgArray< Var > >::ArgsType ArrayTraits<VarArgArray<Var> >::ArgsType Gecode::operator+ (const VarArgArray< Var > &x, const VarArgArray< Var > &y) operator+ - const VarArgArray< Var > & + const VarArgArray< Var > & x - const VarArgArray< Var > & + const VarArgArray< Var > & y @@ -15004,7 +16067,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15012,16 +16075,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class Var - ArrayTraits< VarArgArray< Var > >::ArgsType + ArrayTraits< VarArgArray< Var > >::ArgsType ArrayTraits<VarArgArray<Var> >::ArgsType Gecode::operator+ (const VarArgArray< Var > &x, const Var &y) operator+ - const VarArgArray< Var > & + const VarArgArray< Var > & x - const Var & + const Var & y @@ -15030,7 +16093,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15038,16 +16101,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class Var - ArrayTraits< VarArgArray< Var > >::ArgsType + ArrayTraits< VarArgArray< Var > >::ArgsType ArrayTraits<VarArgArray<Var> >::ArgsType Gecode::operator+ (const Var &x, const VarArgArray< Var > &y) operator+ - const Var & + const Var & x - const VarArgArray< Var > & + const VarArgArray< Var > & y @@ -15056,7 +16119,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15079,7 +16142,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr os - const VarArray< Var > & + const VarArray< Var > & x @@ -15088,7 +16151,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15111,7 +16174,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr os - const ViewArray< View > & + const ViewArray< View > & x @@ -15120,7 +16183,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15143,7 +16206,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr os - const ArgArrayBase< T > & + const ArgArrayBase< T > & x @@ -15152,7 +16215,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15160,16 +16223,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class VarBranch - TieBreak< VarBranch > + TieBreak< VarBranch > TieBreak< VarBranch > Gecode::tiebreak (VarBranch a, VarBranch b) tiebreak - VarBranch + VarBranch a - VarBranch + VarBranch b @@ -15178,7 +16241,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15186,20 +16249,20 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class VarBranch - TieBreak< VarBranch > + TieBreak< VarBranch > TieBreak< VarBranch > Gecode::tiebreak (VarBranch a, VarBranch b, VarBranch c) tiebreak - VarBranch + VarBranch a - VarBranch + VarBranch b - VarBranch + VarBranch c @@ -15208,7 +16271,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15216,24 +16279,24 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class VarBranch - TieBreak< VarBranch > + TieBreak< VarBranch > TieBreak< VarBranch > Gecode::tiebreak (VarBranch a, VarBranch b, VarBranch c, VarBranch d) tiebreak - VarBranch + VarBranch a - VarBranch + VarBranch b - VarBranch + VarBranch c - VarBranch + VarBranch d @@ -15242,7 +16305,148 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + + + + + + class View + + + int + n + n + + + class Val + + + unsigned int + a + a + + + void + void Gecode::postviewvalbrancher + (Home home, ViewArray< View > &x, ViewSel< View > *vs[n], ValSelCommitBase< View, Val > *vsc, BranchFilter< typename View::VarType > bf, VarValPrint< typename View::VarType, Val > vvp) + postviewvalbrancher + + Home + home + + + ViewArray< View > & + x + + + ViewSel< View > * + vs + [n] + + + ValSelCommitBase< View, Val > * + vsc + + + BranchFilter< typename View::VarType > + bf + + + VarValPrint< typename View::VarType, Val > + vvp + + +Post view value brancher. + + + + + + + + + + class View + + + int + n + n + + + class Val + + + unsigned int + a + a + + + forceinline void + forceinline void Gecode::postviewvalbrancher + (Home home, ViewArray< View > &x, ViewSel< View > *vs[n], ValSelCommitBase< View, Val > *vsc, BranchFilter< typename View::VarType > bf, VarValPrint< typename View::VarType, Val > vvp) + postviewvalbrancher + + Home + home + + + ViewArray< View > & + x + + + ViewSel< View > * + vs + [n] + + + ValSelCommitBase< View, Val > * + vsc + + + BranchFilter< typename View::VarType > + bf + + + VarValPrint< typename View::VarType, Val > + vvp + + +Post view value brancher. + + + + + + + + + + class Char + + + class Traits + + + std::basic_ostream< Char, Traits > & + std::basic_ostream<Char,Traits>& Gecode::operator<< + (std::basic_ostream< Char, Traits > &os, const CHB &chb) + operator<< + + std::basic_ostream< Char, Traits > & + os + + + const CHB & + chb + + + + + + + + bool @@ -15250,7 +16454,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (ModEvent me) me_failed - ModEvent + ModEvent me @@ -15259,7 +16463,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + bool @@ -15267,7 +16471,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (ModEvent me) me_modified - ModEvent + ModEvent me @@ -15276,7 +16480,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15299,7 +16503,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr os - const SharedArray< T > & + const SharedArray< T > & x @@ -15308,19 +16512,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - TFE + TFE forceinline TFE Gecode::operator+ (TFE l, const TFE &r) operator+ - TFE + TFE l - const TFE & + const TFE & r @@ -15329,15 +16533,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - TFE + TFE forceinline TFE Gecode::operator+ (const TFE &e) operator+ - const TFE & + const TFE & e @@ -15346,19 +16550,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - TFE + TFE forceinline TFE Gecode::operator- (TFE l, const TFE &r) operator- - TFE + TFE l - const TFE & + const TFE & r @@ -15367,15 +16571,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_KERNEL_EXPORT TFE + GECODE_KERNEL_EXPORT TFE GECODE_KERNEL_EXPORT TFE Gecode::operator- (const TFE &e) operator- - const TFE & + const TFE & e @@ -15384,15 +16588,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_KERNEL_EXPORT TFE + GECODE_KERNEL_EXPORT TFE GECODE_KERNEL_EXPORT TFE Gecode::propagator (PropagatorGroup g) propagator - PropagatorGroup + PropagatorGroup g @@ -15401,15 +16605,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_KERNEL_EXPORT TFE + GECODE_KERNEL_EXPORT TFE GECODE_KERNEL_EXPORT TFE Gecode::post (PropagatorGroup g) post - PropagatorGroup + PropagatorGroup g @@ -15418,7 +16622,32 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + + + + void + void Gecode::trace + (Home home, int te=(TE_PROPAGATE|TE_COMMIT), Tracer &t=StdTracer::def) + trace + + Home + home + + + int + te + + + Tracer & + t + + +Create tracer. + + + + + @@ -15434,10 +16663,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const ConstView< ViewA > &, const ConstView< ViewB > &) shared - const ConstView< ViewA > & + const ConstView< ViewA > & - const ConstView< ViewB > & + const ConstView< ViewB > & Test whether views share same variable. @@ -15445,7 +16674,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15461,10 +16690,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const VarImpView< Var > &, const ConstView< View > &) shared - const VarImpView< Var > & + const VarImpView< Var > & - const ConstView< View > & + const ConstView< View > & Test whether views share same variable. @@ -15472,7 +16701,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15488,10 +16717,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const DerivedView< ViewA > &, const ConstView< ViewB > &) shared - const DerivedView< ViewA > & + const DerivedView< ViewA > & - const ConstView< ViewB > & + const ConstView< ViewB > & Test whether views share same variable. @@ -15499,7 +16728,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15515,10 +16744,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const ConstView< View > &, const VarImpView< Var > &) shared - const ConstView< View > & + const ConstView< View > & - const VarImpView< Var > & + const VarImpView< Var > & Test whether views share same variable. @@ -15526,7 +16755,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15542,10 +16771,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const ConstView< ViewA > &, const DerivedView< ViewB > &) shared - const ConstView< ViewA > & + const ConstView< ViewA > & - const DerivedView< ViewB > & + const DerivedView< ViewB > & Test whether views share same variable. @@ -15553,7 +16782,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15569,10 +16798,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const VarImpView< VarA > &, const VarImpView< VarB > &) shared - const VarImpView< VarA > & + const VarImpView< VarA > & - const VarImpView< VarB > & + const VarImpView< VarB > & Test whether views share same variable. @@ -15580,7 +16809,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15596,10 +16825,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const VarImpView< Var > &, const DerivedView< View > &) shared - const VarImpView< Var > & + const VarImpView< Var > & - const DerivedView< View > & + const DerivedView< View > & Test whether views share same variable. @@ -15607,7 +16836,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15623,10 +16852,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const DerivedView< View > &, const VarImpView< Var > &) shared - const DerivedView< View > & + const DerivedView< View > & - const VarImpView< Var > & + const VarImpView< Var > & Test whether views share same variable. @@ -15634,7 +16863,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15650,10 +16879,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const DerivedView< ViewA > &, const DerivedView< ViewB > &) shared - const DerivedView< ViewA > & + const DerivedView< ViewA > & - const DerivedView< ViewB > & + const DerivedView< ViewB > & Test whether views share same variable. @@ -15661,7 +16890,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15677,10 +16906,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const ConstView< ViewA > &, const ConstView< ViewB > &) same - const ConstView< ViewA > & + const ConstView< ViewA > & - const ConstView< ViewB > & + const ConstView< ViewB > & Test whether two views are the same. @@ -15688,7 +16917,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15704,10 +16933,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const VarImpView< Var > &, const ConstView< View > &) same - const VarImpView< Var > & + const VarImpView< Var > & - const ConstView< View > & + const ConstView< View > & Test whether two views are the same. @@ -15715,7 +16944,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15731,10 +16960,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const ConstView< ViewA > &, const DerivedView< ViewB > &) same - const ConstView< ViewA > & + const ConstView< ViewA > & - const DerivedView< ViewB > & + const DerivedView< ViewB > & Test whether two views are the same. @@ -15742,7 +16971,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15758,10 +16987,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const VarImpView< Var > &, const DerivedView< View > &) same - const VarImpView< Var > & + const VarImpView< Var > & - const DerivedView< View > & + const DerivedView< View > & Test whether two views are the same. @@ -15769,7 +16998,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15785,10 +17014,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const DerivedView< View > &, const VarImpView< Var > &) same - const DerivedView< View > & + const DerivedView< View > & - const VarImpView< Var > & + const VarImpView< Var > & Test whether two views are the same. @@ -15796,7 +17025,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15809,11 +17038,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const VarImpView< Var > &x, const VarImpView< Var > &y) same - const VarImpView< Var > & + const VarImpView< Var > & x - const VarImpView< Var > & + const VarImpView< Var > & y @@ -15822,7 +17051,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15838,11 +17067,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const DerivedView< ViewA > &x, const DerivedView< ViewB > &y) same - const DerivedView< ViewA > & + const DerivedView< ViewA > & x - const DerivedView< ViewB > & + const DerivedView< ViewB > & y @@ -15851,7 +17080,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15880,7 +17109,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15896,10 +17125,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const ConstView< ViewA > &, const ConstView< ViewB > &) shared - const ConstView< ViewA > & + const ConstView< ViewA > & - const ConstView< ViewB > & + const ConstView< ViewB > & Test whether views share same variable. @@ -15907,7 +17136,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15923,10 +17152,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const VarImpView< Var > &, const ConstView< View > &) shared - const VarImpView< Var > & + const VarImpView< Var > & - const ConstView< View > & + const ConstView< View > & Test whether views share same variable. @@ -15934,7 +17163,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15950,10 +17179,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const DerivedView< ViewA > &, const ConstView< ViewB > &) shared - const DerivedView< ViewA > & + const DerivedView< ViewA > & - const ConstView< ViewB > & + const ConstView< ViewB > & Test whether views share same variable. @@ -15961,7 +17190,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15977,10 +17206,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const ConstView< View > &, const VarImpView< Var > &) shared - const ConstView< View > & + const ConstView< View > & - const VarImpView< Var > & + const VarImpView< Var > & Test whether views share same variable. @@ -15988,7 +17217,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16004,10 +17233,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const ConstView< ViewA > &, const DerivedView< ViewB > &) shared - const ConstView< ViewA > & + const ConstView< ViewA > & - const DerivedView< ViewB > & + const DerivedView< ViewB > & Test whether views share same variable. @@ -16015,7 +17244,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16031,11 +17260,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const VarImpView< VarA > &x, const VarImpView< VarB > &y) shared - const VarImpView< VarA > & + const VarImpView< VarA > & x - const VarImpView< VarB > & + const VarImpView< VarB > & y @@ -16044,7 +17273,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16060,11 +17289,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const VarImpView< Var > &x, const DerivedView< View > &y) shared - const VarImpView< Var > & + const VarImpView< Var > & x - const DerivedView< View > & + const DerivedView< View > & y @@ -16073,7 +17302,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16089,11 +17318,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const DerivedView< View > &x, const VarImpView< Var > &y) shared - const DerivedView< View > & + const DerivedView< View > & x - const VarImpView< Var > & + const VarImpView< Var > & y @@ -16102,7 +17331,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16118,11 +17347,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (const DerivedView< ViewA > &x, const DerivedView< ViewB > &y) shared - const DerivedView< ViewA > & + const DerivedView< ViewA > & x - const DerivedView< ViewB > & + const DerivedView< ViewB > & y @@ -16131,19 +17360,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + GECODE_KERNEL_EXPORT void GECODE_KERNEL_EXPORT void Gecode::branch - (Home home, void(*f)(Space &home)) + (Home home, std::function< void(Space &home)> f) branch - Home + Home home - void(*)(Space &home) + std::function< void(Space &home)> f @@ -16152,7 +17381,38 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + + + + GECODE_KERNEL_EXPORT void + GECODE_KERNEL_EXPORT void Gecode::trace + (Home home, TraceFilter tf, int te=(TE_PROPAGATE|TE_COMMIT), Tracer &t=StdTracer::def) + trace + + Home + home + + + TraceFilter + tf + + + int + te + (TE_PROPAGATE|TE_COMMIT) + + + Tracer & + t + StdTracer::def + + +Create tracer. + + + + + @@ -16160,12 +17420,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class A - SymmetryHandle + SymmetryHandle SymmetryHandle Gecode::rows_interchange (const Matrix< A > &m) rows_interchange - const Matrix< A > & + const Matrix< A > & m @@ -16174,7 +17434,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16182,12 +17442,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class A - SymmetryHandle + SymmetryHandle SymmetryHandle Gecode::columns_interchange (const Matrix< A > &m) columns_interchange - const Matrix< A > & + const Matrix< A > & m @@ -16196,7 +17456,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16204,12 +17464,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class A - SymmetryHandle + SymmetryHandle SymmetryHandle Gecode::rows_reflect (const Matrix< A > &m) rows_reflect - const Matrix< A > & + const Matrix< A > & m @@ -16218,7 +17478,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16226,12 +17486,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class A - SymmetryHandle + SymmetryHandle SymmetryHandle Gecode::columns_reflect (const Matrix< A > &m) columns_reflect - const Matrix< A > & + const Matrix< A > & m @@ -16240,7 +17500,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16248,12 +17508,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class A - SymmetryHandle + SymmetryHandle SymmetryHandle Gecode::diagonal_reflect (const Matrix< A > &m) diagonal_reflect - const Matrix< A > & + const Matrix< A > & m @@ -16262,7 +17522,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16270,16 +17530,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class A - Slice< A >::ArgsType + Slice< A >::ArgsType Slice< A >::ArgsType Gecode::operator+ (const Slice< A > &x, const Slice< A > &y) operator+ - const Slice< A > & + const Slice< A > & x - const Slice< A > & + const Slice< A > & y @@ -16288,7 +17548,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16296,16 +17556,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class A - Slice< A >::ArgsType + Slice< A >::ArgsType Slice< A >::ArgsType Gecode::operator+ (const Slice< A > &x, const typename ArrayTraits< A >::ArgsType &y) operator+ - const Slice< A > & + const Slice< A > & x - const typename ArrayTraits< A >::ArgsType & + const typename ArrayTraits< A >::ArgsType & y @@ -16314,7 +17574,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16322,16 +17582,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class A - Slice< A >::ArgsType + Slice< A >::ArgsType Slice< A >::ArgsType Gecode::operator+ (const typename ArrayTraits< A >::ArgsType &x, const Slice< A > &y) operator+ - const typename ArrayTraits< A >::ArgsType & + const typename ArrayTraits< A >::ArgsType & x - const Slice< A > & + const Slice< A > & y @@ -16340,7 +17600,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16348,16 +17608,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class A - Slice< A >::ArgsType + Slice< A >::ArgsType Slice< A >::ArgsType Gecode::operator+ (const Slice< A > &x, const typename ArrayTraits< A >::ValueType &y) operator+ - const Slice< A > & + const Slice< A > & x - const typename ArrayTraits< A >::ValueType & + const typename ArrayTraits< A >::ValueType & y @@ -16366,7 +17626,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16374,16 +17634,16 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class A - Slice< A >::ArgsType + Slice< A >::ArgsType Slice< A >::ArgsType Gecode::operator+ (const typename ArrayTraits< A >::ValueType &x, const Slice< A > &y) operator+ - const typename ArrayTraits< A >::ValueType & + const typename ArrayTraits< A >::ValueType & x - const Slice< A > & + const Slice< A > & y @@ -16392,7 +17652,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16415,7 +17675,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr os - const Matrix< A > & + const Matrix< A > & m @@ -16424,7 +17684,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16447,7 +17707,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr os - const Slice< A > & + const Slice< A > & s @@ -16456,7 +17716,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + forceinline void @@ -16464,27 +17724,27 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const Matrix< IntArgs > &m, IntVar x, IntVar y, IntVar z, IntPropLevel ipl) element - Home + Home home - const Matrix< IntArgs > & + const Matrix< IntArgs > & m - IntVar + IntVar x - IntVar + IntVar y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl @@ -16493,7 +17753,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + forceinline void @@ -16501,27 +17761,27 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const Matrix< IntArgs > &m, IntVar x, IntVar y, BoolVar z, IntPropLevel ipl) element - Home + Home home - const Matrix< IntArgs > & + const Matrix< IntArgs > & m - IntVar + IntVar x - IntVar + IntVar y - BoolVar + BoolVar z - IntPropLevel + IntPropLevel ipl @@ -16530,7 +17790,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + forceinline void @@ -16538,27 +17798,27 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const Matrix< IntVarArgs > &m, IntVar x, IntVar y, IntVar z, IntPropLevel ipl) element - Home + Home home - const Matrix< IntVarArgs > & + const Matrix< IntVarArgs > & m - IntVar + IntVar x - IntVar + IntVar y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl @@ -16567,7 +17827,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + forceinline void @@ -16575,27 +17835,27 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const Matrix< BoolVarArgs > &m, IntVar x, IntVar y, BoolVar z, IntPropLevel ipl) element - Home + Home home - const Matrix< BoolVarArgs > & + const Matrix< BoolVarArgs > & m - IntVar + IntVar x - IntVar + IntVar y - BoolVar + BoolVar z - IntPropLevel + IntPropLevel ipl @@ -16604,7 +17864,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16624,7 +17884,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr os - const REG & + const REG & r @@ -16633,10 +17893,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (int, const IntVar &) operator+ @@ -16644,7 +17904,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr int - const IntVar & + const IntVar & Construct linear expression as sum of integer variable and integer. @@ -16652,10 +17912,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (int, const BoolVar &) operator+ @@ -16663,7 +17923,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr int - const BoolVar & + const BoolVar & Construct linear expression as sum of Boolean variable and integer. @@ -16671,10 +17931,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (int, const LinIntExpr &) operator+ @@ -16682,7 +17942,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr int - const LinIntExpr & + const LinIntExpr & Construct linear expression as sum of linear expression and integer. @@ -16690,15 +17950,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const IntVar &, int) operator+ - const IntVar & + const IntVar & int @@ -16709,15 +17969,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const BoolVar &, int) operator+ - const BoolVar & + const BoolVar & int @@ -16728,15 +17988,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const LinIntExpr &, int) operator+ - const LinIntExpr & + const LinIntExpr & int @@ -16747,18 +18007,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const IntVar &, const IntVar &) operator+ - const IntVar & + const IntVar & - const IntVar & + const IntVar & Construct linear expression as sum of integer variables. @@ -16766,18 +18026,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const IntVar &, const BoolVar &) operator+ - const IntVar & + const IntVar & - const BoolVar & + const BoolVar & Construct linear expression as sum of integer and Boolean variable. @@ -16785,18 +18045,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const BoolVar &, const IntVar &) operator+ - const BoolVar & + const BoolVar & - const IntVar & + const IntVar & Construct linear expression as sum of Boolean and integer variable. @@ -16804,18 +18064,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const BoolVar &, const BoolVar &) operator+ - const BoolVar & + const BoolVar & - const BoolVar & + const BoolVar & Construct linear expression as sum of Boolean variables. @@ -16823,18 +18083,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const IntVar &, const LinIntExpr &) operator+ - const IntVar & + const IntVar & - const LinIntExpr & + const LinIntExpr & Construct linear expression as sum of integer variable and linear expression. @@ -16842,18 +18102,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const BoolVar &, const LinIntExpr &) operator+ - const BoolVar & + const BoolVar & - const LinIntExpr & + const LinIntExpr & Construct linear expression as sum of Boolean variable and linear expression. @@ -16861,18 +18121,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const LinIntExpr &, const IntVar &) operator+ - const LinIntExpr & + const LinIntExpr & - const IntVar & + const IntVar & Construct linear expression as sum of linear expression and integer variable. @@ -16880,18 +18140,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const LinIntExpr &, const BoolVar &) operator+ - const LinIntExpr & + const LinIntExpr & - const BoolVar & + const BoolVar & Construct linear expression as sum of linear expression and Boolean variable. @@ -16899,18 +18159,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator+ (const LinIntExpr &, const LinIntExpr &) operator+ - const LinIntExpr & + const LinIntExpr & - const LinIntExpr & + const LinIntExpr & Construct linear expression as sum of linear expressions. @@ -16918,10 +18178,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (int, const IntVar &) operator- @@ -16929,7 +18189,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr int - const IntVar & + const IntVar & Construct linear expression as sum of integer variable and integer. @@ -16937,10 +18197,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (int, const BoolVar &) operator- @@ -16948,7 +18208,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr int - const BoolVar & + const BoolVar & Construct linear expression as sum of Boolean variable and integer. @@ -16956,10 +18216,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (int, const LinIntExpr &) operator- @@ -16967,7 +18227,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr int - const LinIntExpr & + const LinIntExpr & Construct linear expression as sum of integer and linear expression. @@ -16975,15 +18235,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const IntVar &, int) operator- - const IntVar & + const IntVar & int @@ -16994,15 +18254,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const BoolVar &, int) operator- - const BoolVar & + const BoolVar & int @@ -17013,15 +18273,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const LinIntExpr &, int) operator- - const LinIntExpr & + const LinIntExpr & int @@ -17032,18 +18292,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const IntVar &, const IntVar &) operator- - const IntVar & + const IntVar & - const IntVar & + const IntVar & Construct linear expression as sum of integer variables. @@ -17051,18 +18311,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const IntVar &, const BoolVar &) operator- - const IntVar & + const IntVar & - const BoolVar & + const BoolVar & Construct linear expression as sum of integer and Boolean variable. @@ -17070,18 +18330,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const BoolVar &, const IntVar &) operator- - const BoolVar & + const BoolVar & - const IntVar & + const IntVar & Construct linear expression as sum of Boolean and integer variable. @@ -17089,18 +18349,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const BoolVar &, const BoolVar &) operator- - const BoolVar & + const BoolVar & - const BoolVar & + const BoolVar & Construct linear expression as sum of Boolean variables. @@ -17108,18 +18368,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const IntVar &, const LinIntExpr &) operator- - const IntVar & + const IntVar & - const LinIntExpr & + const LinIntExpr & Construct linear expression as sum of integer variable and linear expression. @@ -17127,18 +18387,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const BoolVar &, const LinIntExpr &) operator- - const BoolVar & + const BoolVar & - const LinIntExpr & + const LinIntExpr & Construct linear expression as sum of Boolean variable and linear expression. @@ -17146,18 +18406,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const LinIntExpr &, const IntVar &) operator- - const LinIntExpr & + const LinIntExpr & - const IntVar & + const IntVar & Construct linear expression as sum of linear expression and integer variable. @@ -17165,18 +18425,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const LinIntExpr &, const BoolVar &) operator- - const LinIntExpr & + const LinIntExpr & - const BoolVar & + const BoolVar & Construct linear expression as sum of linear expression and Boolean variable. @@ -17184,18 +18444,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const LinIntExpr &, const LinIntExpr &) operator- - const LinIntExpr & + const LinIntExpr & - const LinIntExpr & + const LinIntExpr & Construct linear expression as sum of linear expressions. @@ -17203,15 +18463,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const IntVar &) operator- - const IntVar & + const IntVar & Construct linear expression as negative of integer variable. @@ -17219,15 +18479,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const BoolVar &) operator- - const BoolVar & + const BoolVar & Construct linear expression as negative of Boolean variable. @@ -17235,15 +18495,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator- (const LinIntExpr &) operator- - const LinIntExpr & + const LinIntExpr & Construct linear expression as negative of linear expression. @@ -17251,10 +18511,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator* (int, const IntVar &) operator* @@ -17262,7 +18522,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr int - const IntVar & + const IntVar & Construct linear expression as product of integer coefficient and integer variable. @@ -17270,10 +18530,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator* (int, const BoolVar &) operator* @@ -17281,7 +18541,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr int - const BoolVar & + const BoolVar & Construct linear expression as product of integer coefficient and Boolean variable. @@ -17289,15 +18549,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator* (const IntVar &, int) operator* - const IntVar & + const IntVar & int @@ -17308,15 +18568,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator* (const BoolVar &, int) operator* - const BoolVar & + const BoolVar & int @@ -17327,15 +18587,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator* (const LinIntExpr &, int) operator* - const LinIntExpr & + const LinIntExpr & int @@ -17346,10 +18606,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator* (int, const LinIntExpr &) operator* @@ -17357,7 +18617,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr int - const LinIntExpr & + const LinIntExpr & Construct linear expression as product of integer coefficient and linear expression. @@ -17365,15 +18625,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::sum (const IntVarArgs &x) sum - const IntVarArgs & + const IntVarArgs & x @@ -17382,19 +18642,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::sum (const IntArgs &a, const IntVarArgs &x) sum - const IntArgs & + const IntArgs & a - const IntVarArgs & + const IntVarArgs & x @@ -17403,15 +18663,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::sum (const BoolVarArgs &x) sum - const BoolVarArgs & + const BoolVarArgs & x @@ -17420,19 +18680,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::sum (const IntArgs &a, const BoolVarArgs &x) sum - const IntArgs & + const IntArgs & a - const BoolVarArgs & + const BoolVarArgs & x @@ -17441,15 +18701,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::sum (const IntArgs &args) sum - const IntArgs & + const IntArgs & args @@ -17458,10 +18718,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (int l, const IntVar &r) operator== @@ -17470,7 +18730,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const IntVar & + const IntVar & r @@ -17479,10 +18739,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (int l, const BoolVar &r) operator== @@ -17491,7 +18751,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const BoolVar & + const BoolVar & r @@ -17500,10 +18760,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (int l, const LinIntExpr &r) operator== @@ -17512,7 +18772,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const LinIntExpr & + const LinIntExpr & r @@ -17521,15 +18781,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const IntVar &l, int r) operator== - const IntVar & + const IntVar & l @@ -17542,15 +18802,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const BoolVar &l, int r) operator== - const BoolVar & + const BoolVar & l @@ -17563,15 +18823,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const LinIntExpr &l, int r) operator== - const LinIntExpr & + const LinIntExpr & l @@ -17584,19 +18844,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const IntVar &l, const IntVar &r) operator== - const IntVar & + const IntVar & l - const IntVar & + const IntVar & r @@ -17605,19 +18865,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const IntVar &l, const BoolVar &r) operator== - const IntVar & + const IntVar & l - const BoolVar & + const BoolVar & r @@ -17626,19 +18886,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const BoolVar &l, const IntVar &r) operator== - const BoolVar & + const BoolVar & l - const IntVar & + const IntVar & r @@ -17647,19 +18907,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const BoolVar &l, const BoolVar &r) operator== - const BoolVar & + const BoolVar & l - const BoolVar & + const BoolVar & r @@ -17668,19 +18928,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const IntVar &l, const LinIntExpr &r) operator== - const IntVar & + const IntVar & l - const LinIntExpr & + const LinIntExpr & r @@ -17689,19 +18949,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const BoolVar &l, const LinIntExpr &r) operator== - const BoolVar & + const BoolVar & l - const LinIntExpr & + const LinIntExpr & r @@ -17710,19 +18970,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const LinIntExpr &l, const IntVar &r) operator== - const LinIntExpr & + const LinIntExpr & l - const IntVar & + const IntVar & r @@ -17731,19 +18991,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const LinIntExpr &l, const BoolVar &r) operator== - const LinIntExpr & + const LinIntExpr & l - const BoolVar & + const BoolVar & r @@ -17752,19 +19012,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator== (const LinIntExpr &l, const LinIntExpr &r) operator== - const LinIntExpr & + const LinIntExpr & l - const LinIntExpr & + const LinIntExpr & r @@ -17773,10 +19033,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (int l, const IntVar &r) operator!= @@ -17785,7 +19045,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const IntVar & + const IntVar & r @@ -17794,10 +19054,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (int l, const BoolVar &r) operator!= @@ -17806,7 +19066,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const BoolVar & + const BoolVar & r @@ -17815,10 +19075,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (int l, const LinIntExpr &r) operator!= @@ -17827,7 +19087,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const LinIntExpr & + const LinIntExpr & r @@ -17836,15 +19096,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const IntVar &l, int r) operator!= - const IntVar & + const IntVar & l @@ -17857,15 +19117,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const BoolVar &l, int r) operator!= - const BoolVar & + const BoolVar & l @@ -17878,15 +19138,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const LinIntExpr &l, int r) operator!= - const LinIntExpr & + const LinIntExpr & l @@ -17899,19 +19159,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const IntVar &l, const IntVar &r) operator!= - const IntVar & + const IntVar & l - const IntVar & + const IntVar & r @@ -17920,19 +19180,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const IntVar &l, const BoolVar &r) operator!= - const IntVar & + const IntVar & l - const BoolVar & + const BoolVar & r @@ -17941,19 +19201,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const BoolVar &l, const IntVar &r) operator!= - const BoolVar & + const BoolVar & l - const IntVar & + const IntVar & r @@ -17962,19 +19222,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const BoolVar &l, const BoolVar &r) operator!= - const BoolVar & + const BoolVar & l - const BoolVar & + const BoolVar & r @@ -17983,19 +19243,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const IntVar &l, const LinIntExpr &r) operator!= - const IntVar & + const IntVar & l - const LinIntExpr & + const LinIntExpr & r @@ -18004,19 +19264,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const BoolVar &l, const LinIntExpr &r) operator!= - const BoolVar & + const BoolVar & l - const LinIntExpr & + const LinIntExpr & r @@ -18025,19 +19285,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const LinIntExpr &l, const IntVar &r) operator!= - const LinIntExpr & + const LinIntExpr & l - const IntVar & + const IntVar & r @@ -18046,19 +19306,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const LinIntExpr &l, const BoolVar &r) operator!= - const LinIntExpr & + const LinIntExpr & l - const BoolVar & + const BoolVar & r @@ -18067,19 +19327,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator!= (const LinIntExpr &l, const LinIntExpr &r) operator!= - const LinIntExpr & + const LinIntExpr & l - const LinIntExpr & + const LinIntExpr & r @@ -18088,10 +19348,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (int l, const IntVar &r) operator< @@ -18100,7 +19360,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const IntVar & + const IntVar & r @@ -18109,10 +19369,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (int l, const BoolVar &r) operator< @@ -18121,7 +19381,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const BoolVar & + const BoolVar & r @@ -18130,10 +19390,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (int l, const LinIntExpr &r) operator< @@ -18142,7 +19402,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const LinIntExpr & + const LinIntExpr & r @@ -18151,15 +19411,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const IntVar &l, int r) operator< - const IntVar & + const IntVar & l @@ -18172,15 +19432,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const BoolVar &l, int r) operator< - const BoolVar & + const BoolVar & l @@ -18193,15 +19453,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const LinIntExpr &l, int r) operator< - const LinIntExpr & + const LinIntExpr & l @@ -18214,19 +19474,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const IntVar &l, const IntVar &r) operator< - const IntVar & + const IntVar & l - const IntVar & + const IntVar & r @@ -18235,19 +19495,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const IntVar &l, const BoolVar &r) operator< - const IntVar & + const IntVar & l - const BoolVar & + const BoolVar & r @@ -18256,19 +19516,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const BoolVar &l, const IntVar &r) operator< - const BoolVar & + const BoolVar & l - const IntVar & + const IntVar & r @@ -18277,19 +19537,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const BoolVar &l, const BoolVar &r) operator< - const BoolVar & + const BoolVar & l - const BoolVar & + const BoolVar & r @@ -18298,19 +19558,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const IntVar &l, const LinIntExpr &r) operator< - const IntVar & + const IntVar & l - const LinIntExpr & + const LinIntExpr & r @@ -18319,19 +19579,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const BoolVar &l, const LinIntExpr &r) operator< - const BoolVar & + const BoolVar & l - const LinIntExpr & + const LinIntExpr & r @@ -18340,19 +19600,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const LinIntExpr &l, const IntVar &r) operator< - const LinIntExpr & + const LinIntExpr & l - const IntVar & + const IntVar & r @@ -18361,19 +19621,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const LinIntExpr &l, const BoolVar &r) operator< - const LinIntExpr & + const LinIntExpr & l - const BoolVar & + const BoolVar & r @@ -18382,19 +19642,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator< (const LinIntExpr &l, const LinIntExpr &r) operator< - const LinIntExpr & + const LinIntExpr & l - const LinIntExpr & + const LinIntExpr & r @@ -18403,10 +19663,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (int l, const IntVar &r) operator<= @@ -18415,7 +19675,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const IntVar & + const IntVar & r @@ -18424,10 +19684,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (int l, const BoolVar &r) operator<= @@ -18436,7 +19696,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const BoolVar & + const BoolVar & r @@ -18445,10 +19705,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (int l, const LinIntExpr &r) operator<= @@ -18457,7 +19717,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const LinIntExpr & + const LinIntExpr & r @@ -18466,15 +19726,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const IntVar &l, int r) operator<= - const IntVar & + const IntVar & l @@ -18487,15 +19747,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const BoolVar &l, int r) operator<= - const BoolVar & + const BoolVar & l @@ -18508,15 +19768,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const LinIntExpr &l, int r) operator<= - const LinIntExpr & + const LinIntExpr & l @@ -18529,19 +19789,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const IntVar &l, const IntVar &r) operator<= - const IntVar & + const IntVar & l - const IntVar & + const IntVar & r @@ -18550,19 +19810,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const IntVar &l, const BoolVar &r) operator<= - const IntVar & + const IntVar & l - const BoolVar & + const BoolVar & r @@ -18571,19 +19831,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const BoolVar &l, const IntVar &r) operator<= - const BoolVar & + const BoolVar & l - const IntVar & + const IntVar & r @@ -18592,19 +19852,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const BoolVar &l, const BoolVar &r) operator<= - const BoolVar & + const BoolVar & l - const BoolVar & + const BoolVar & r @@ -18613,19 +19873,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const IntVar &l, const LinIntExpr &r) operator<= - const IntVar & + const IntVar & l - const LinIntExpr & + const LinIntExpr & r @@ -18634,19 +19894,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const BoolVar &l, const LinIntExpr &r) operator<= - const BoolVar & + const BoolVar & l - const LinIntExpr & + const LinIntExpr & r @@ -18655,19 +19915,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const LinIntExpr &l, const IntVar &r) operator<= - const LinIntExpr & + const LinIntExpr & l - const IntVar & + const IntVar & r @@ -18676,19 +19936,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const LinIntExpr &l, const BoolVar &r) operator<= - const LinIntExpr & + const LinIntExpr & l - const BoolVar & + const BoolVar & r @@ -18697,19 +19957,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator<= (const LinIntExpr &l, const LinIntExpr &r) operator<= - const LinIntExpr & + const LinIntExpr & l - const LinIntExpr & + const LinIntExpr & r @@ -18718,10 +19978,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (int l, const IntVar &r) operator> @@ -18730,7 +19990,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const IntVar & + const IntVar & r @@ -18739,10 +19999,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (int l, const BoolVar &r) operator> @@ -18751,7 +20011,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const BoolVar & + const BoolVar & r @@ -18760,10 +20020,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (int l, const LinIntExpr &r) operator> @@ -18772,7 +20032,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const LinIntExpr & + const LinIntExpr & r @@ -18781,15 +20041,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const IntVar &l, int r) operator> - const IntVar & + const IntVar & l @@ -18802,15 +20062,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const BoolVar &l, int r) operator> - const BoolVar & + const BoolVar & l @@ -18823,15 +20083,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const LinIntExpr &l, int r) operator> - const LinIntExpr & + const LinIntExpr & l @@ -18844,19 +20104,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const IntVar &l, const IntVar &r) operator> - const IntVar & + const IntVar & l - const IntVar & + const IntVar & r @@ -18865,19 +20125,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const IntVar &l, const BoolVar &r) operator> - const IntVar & + const IntVar & l - const BoolVar & + const BoolVar & r @@ -18886,19 +20146,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const BoolVar &l, const IntVar &r) operator> - const BoolVar & + const BoolVar & l - const IntVar & + const IntVar & r @@ -18907,19 +20167,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const BoolVar &l, const BoolVar &r) operator> - const BoolVar & + const BoolVar & l - const BoolVar & + const BoolVar & r @@ -18928,19 +20188,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const IntVar &l, const LinIntExpr &r) operator> - const IntVar & + const IntVar & l - const LinIntExpr & + const LinIntExpr & r @@ -18949,19 +20209,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const BoolVar &l, const LinIntExpr &r) operator> - const BoolVar & + const BoolVar & l - const LinIntExpr & + const LinIntExpr & r @@ -18970,19 +20230,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const LinIntExpr &l, const IntVar &r) operator> - const LinIntExpr & + const LinIntExpr & l - const IntVar & + const IntVar & r @@ -18991,19 +20251,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const LinIntExpr &l, const BoolVar &r) operator> - const LinIntExpr & + const LinIntExpr & l - const BoolVar & + const BoolVar & r @@ -19012,19 +20272,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator> (const LinIntExpr &l, const LinIntExpr &r) operator> - const LinIntExpr & + const LinIntExpr & l - const LinIntExpr & + const LinIntExpr & r @@ -19033,10 +20293,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (int l, const IntVar &r) operator>= @@ -19045,7 +20305,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const IntVar & + const IntVar & r @@ -19054,10 +20314,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (int l, const BoolVar &r) operator>= @@ -19066,7 +20326,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const BoolVar & + const BoolVar & r @@ -19075,10 +20335,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (int l, const LinIntExpr &r) operator>= @@ -19087,7 +20347,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr l - const LinIntExpr & + const LinIntExpr & r @@ -19096,15 +20356,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const IntVar &l, int r) operator>= - const IntVar & + const IntVar & l @@ -19117,15 +20377,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const BoolVar &l, int r) operator>= - const BoolVar & + const BoolVar & l @@ -19138,15 +20398,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const LinIntExpr &l, int r) operator>= - const LinIntExpr & + const LinIntExpr & l @@ -19159,19 +20419,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const IntVar &l, const IntVar &r) operator>= - const IntVar & + const IntVar & l - const IntVar & + const IntVar & r @@ -19180,19 +20440,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const IntVar &l, const BoolVar &r) operator>= - const IntVar & + const IntVar & l - const BoolVar & + const BoolVar & r @@ -19201,19 +20461,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const BoolVar &l, const IntVar &r) operator>= - const BoolVar & + const BoolVar & l - const IntVar & + const IntVar & r @@ -19222,19 +20482,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const BoolVar &l, const BoolVar &r) operator>= - const BoolVar & + const BoolVar & l - const BoolVar & + const BoolVar & r @@ -19243,19 +20503,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const IntVar &l, const LinIntExpr &r) operator>= - const IntVar & + const IntVar & l - const LinIntExpr & + const LinIntExpr & r @@ -19264,19 +20524,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const BoolVar &l, const LinIntExpr &r) operator>= - const BoolVar & + const BoolVar & l - const LinIntExpr & + const LinIntExpr & r @@ -19285,19 +20545,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const LinIntExpr &l, const IntVar &r) operator>= - const LinIntExpr & + const LinIntExpr & l - const IntVar & + const IntVar & r @@ -19306,19 +20566,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const LinIntExpr &l, const BoolVar &r) operator>= - const LinIntExpr & + const LinIntExpr & l - const BoolVar & + const BoolVar & r @@ -19327,19 +20587,19 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntRel + GECODE_MINIMODEL_EXPORT LinIntRel GECODE_MINIMODEL_EXPORT LinIntRel Gecode::operator>= (const LinIntExpr &l, const LinIntExpr &r) operator>= - const LinIntExpr & + const LinIntExpr & l - const LinIntExpr & + const LinIntExpr & r @@ -19348,15 +20608,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr GECODE_MINIMODEL_EXPORT BoolExpr Gecode::operator! (const BoolExpr &) operator! - const BoolExpr & + const BoolExpr & Negated Boolean expression. @@ -19364,18 +20624,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr GECODE_MINIMODEL_EXPORT BoolExpr Gecode::operator && (const BoolExpr &, const BoolExpr &) operator&& - const BoolExpr & + const BoolExpr & - const BoolExpr & + const BoolExpr & Conjunction of Boolean expressions. @@ -19383,18 +20643,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr GECODE_MINIMODEL_EXPORT BoolExpr Gecode::operator|| (const BoolExpr &, const BoolExpr &) operator|| - const BoolExpr & + const BoolExpr & - const BoolExpr & + const BoolExpr & Disjunction of Boolean expressions. @@ -19402,18 +20662,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr GECODE_MINIMODEL_EXPORT BoolExpr Gecode::operator^ (const BoolExpr &, const BoolExpr &) operator^ - const BoolExpr & + const BoolExpr & - const BoolExpr & + const BoolExpr & Exclusive-or of Boolean expressions. @@ -19421,18 +20681,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr GECODE_MINIMODEL_EXPORT BoolExpr Gecode::operator!= (const BoolExpr &, const BoolExpr &) operator!= - const BoolExpr & + const BoolExpr & - const BoolExpr & + const BoolExpr & Non-equivalence of Boolean expressions. @@ -19440,18 +20700,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr GECODE_MINIMODEL_EXPORT BoolExpr Gecode::operator== (const BoolExpr &, const BoolExpr &) operator== - const BoolExpr & + const BoolExpr & - const BoolExpr & + const BoolExpr & Equivalence of Boolean expressions. @@ -19459,18 +20719,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr GECODE_MINIMODEL_EXPORT BoolExpr Gecode::operator>> (const BoolExpr &, const BoolExpr &) operator>> - const BoolExpr & + const BoolExpr & - const BoolExpr & + const BoolExpr & Implication of Boolean expressions. @@ -19478,18 +20738,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr GECODE_MINIMODEL_EXPORT BoolExpr Gecode::operator<< (const BoolExpr &, const BoolExpr &) operator<< - const BoolExpr & + const BoolExpr & - const BoolExpr & + const BoolExpr & Reverse implication of Boolean expressions. @@ -19497,25 +20757,25 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT IntVar + GECODE_MINIMODEL_EXPORT IntVar GECODE_MINIMODEL_EXPORT IntVar Gecode::expr (Home home, const LinIntExpr &e, IntPropLevel ipl=IPL_DEF) expr - Home + Home home - const LinIntExpr & + const LinIntExpr & e - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post linear expression and return its value. @@ -19523,25 +20783,25 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT BoolVar + GECODE_MINIMODEL_EXPORT BoolVar GECODE_MINIMODEL_EXPORT BoolVar Gecode::expr (Home home, const BoolExpr &e, IntPropLevel ipl=IPL_DEF) expr - Home + Home home - const BoolExpr & + const BoolExpr & e - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post Boolean expression and return its value. @@ -19549,7 +20809,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT void @@ -19557,17 +20817,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const BoolExpr &e, IntPropLevel ipl=IPL_DEF) rel - Home + Home home - const BoolExpr & + const BoolExpr & e - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post Boolean relation. @@ -19575,205 +20835,205 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::abs (const LinIntExpr &e) abs - const LinIntExpr & + const LinIntExpr & e -Return expression for $|e|$. +Return expression for $|e|$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::min (const LinIntExpr &x, const LinIntExpr &y) min - const LinIntExpr & + const LinIntExpr & x - const LinIntExpr & + const LinIntExpr & y -Return expression for $\min(x,y)$. +Return expression for $\min(x,y)$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::min (const IntVarArgs &x) min - const IntVarArgs & + const IntVarArgs & x -Return expression for $\min(x)$. +Return expression for $\min(x)$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::max (const LinIntExpr &x, const LinIntExpr &y) max - const LinIntExpr & + const LinIntExpr & x - const LinIntExpr & + const LinIntExpr & y -Return expression for $\max(x,y)$. +Return expression for $\max(x,y)$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::max (const IntVarArgs &x) max - const IntVarArgs & + const IntVarArgs & x -Return expression for $\max(x)$. +Return expression for $\max(x)$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator* (const LinIntExpr &x, const LinIntExpr &y) operator* - const LinIntExpr & + const LinIntExpr & x - const LinIntExpr & + const LinIntExpr & y -Return expression for $x\cdot y$. +Return expression for $x\cdot y$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator/ (const LinIntExpr &x, const LinIntExpr &y) operator/ - const LinIntExpr & + const LinIntExpr & x - const LinIntExpr & + const LinIntExpr & y -Return expression for $x\ \mathrm{div}\ y$. +Return expression for $x\ \mathrm{div}\ y$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::operator% (const LinIntExpr &x, const LinIntExpr &y) operator% - const LinIntExpr & + const LinIntExpr & x - const LinIntExpr & + const LinIntExpr & y -Return expression for $x\ \mathrm{mod}\ y$. +Return expression for $x\ \mathrm{mod}\ y$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::sqr (const LinIntExpr &x) sqr - const LinIntExpr & + const LinIntExpr & x -Return expression for $x^2$. +Return expression for $x^2$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::sqrt (const LinIntExpr &x) sqrt - const LinIntExpr & + const LinIntExpr & x -Return expression for $\lfloor\sqrt{x}\rfloor$. +Return expression for $\lfloor\sqrt{x}\rfloor$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::pow (const LinIntExpr &x, int n) pow - const LinIntExpr & + const LinIntExpr & x @@ -19781,20 +21041,20 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr n -Return expression for $x^n$. +Return expression for $x^n$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::nroot (const LinIntExpr &x, int n) nroot - const LinIntExpr & + const LinIntExpr & x @@ -19802,152 +21062,152 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr n -Return expression for $\lfloor\sqrt[n]{x}\rfloor$. +Return expression for $\lfloor\sqrt[n]{x}\rfloor$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::element (const IntVarArgs &x, const LinIntExpr &y) element - const IntVarArgs & + const IntVarArgs & x - const LinIntExpr & + const LinIntExpr & y -Return expression for $x[y]$. +Return expression for $x[y]$. - + - GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr GECODE_MINIMODEL_EXPORT BoolExpr Gecode::element (const BoolVarArgs &x, const LinIntExpr &y) element - const BoolVarArgs & + const BoolVarArgs & x - const LinIntExpr & + const LinIntExpr & y -Return expression for $x[y]$. +Return expression for $x[y]$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::element (const IntArgs &x, const LinIntExpr &y) element - const IntArgs & + const IntArgs & x - const LinIntExpr & + const LinIntExpr & y -Return expression for $x[y]$. +Return expression for $x[y]$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::ite (const BoolExpr &b, const LinIntExpr &x, const LinIntExpr &y) ite - const BoolExpr & + const BoolExpr & b - const LinIntExpr & + const LinIntExpr & x - const LinIntExpr & + const LinIntExpr & y -Return expression for if-then-else $b?x:y$. +Return expression for if-then-else $b?x:y$. - + - BoolVar + BoolVar BoolVar Gecode::channel (Home home, IntVar x, IntPropLevel ipl=IPL_DEF) channel - Home + Home home - IntVar + IntVar x - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Return Boolean variable equal to $x$. +Return Boolean variable equal to $x$. - + - IntVar + IntVar IntVar Gecode::channel (Home home, BoolVar b, IntPropLevel ipl=IPL_DEF) channel - Home + Home home - BoolVar + BoolVar b - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Return integer variable equal to $b$. +Return integer variable equal to $b$. - + void @@ -19955,11 +21215,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, int n, int m, IntPropLevel ipl=IPL_DEF) atmost - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -19971,17 +21231,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\leq m$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\leq m$. Supports domain consistent propagation only. - + void @@ -19989,15 +21249,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, IntVar y, int m, IntPropLevel ipl=IPL_DEF) atmost - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y @@ -20005,17 +21265,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\leq m$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\leq m$. Supports domain consistent propagation only. - + void @@ -20023,15 +21283,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntPropLevel ipl=IPL_DEF) atmost - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & y @@ -20039,17 +21299,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\leq m$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\leq m$. Supports domain consistent propagation only.Throws an exception of type Int::ArgumentSizeMismatch, if x and y are of different size. - + void @@ -20057,11 +21317,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, int n, IntVar z, IntPropLevel ipl=IPL_DEF) atmost - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -20069,21 +21329,21 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr n - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\leq z$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\leq z$. Supports domain consistent propagation only. - + void @@ -20091,33 +21351,33 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntPropLevel ipl=IPL_DEF) atmost - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\leq z$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\leq z$. Supports domain consistent propagation only. - + void @@ -20125,33 +21385,33 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntPropLevel ipl=IPL_DEF) atmost - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\leq z$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\leq z$. Supports domain consistent propagation only.Throws an exception of type Int::ArgumentSizeMismatch, if x and y are of different size. - + void @@ -20159,11 +21419,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, int n, int m, IntPropLevel ipl=IPL_DEF) atleast - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -20175,17 +21435,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\geq m$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\geq m$. Supports domain consistent propagation only. - + void @@ -20193,15 +21453,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, IntVar y, int m, IntPropLevel ipl=IPL_DEF) atleast - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y @@ -20209,17 +21469,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\geq m$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\geq m$. Supports domain consistent propagation only. - + void @@ -20227,15 +21487,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntPropLevel ipl=IPL_DEF) atleast - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & y @@ -20243,17 +21503,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\geq m$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\geq m$. Supports domain consistent propagation only.Throws an exception of type Int::ArgumentSizeMismatch, if x and y are of different size. - + void @@ -20261,11 +21521,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, int n, IntVar z, IntPropLevel ipl=IPL_DEF) atleast - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -20273,21 +21533,21 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr n - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\geq z$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}\geq z$. Supports domain consistent propagation only. - + void @@ -20295,33 +21555,33 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntPropLevel ipl=IPL_DEF) atleast - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\geq z$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}\geq z$. Supports domain consistent propagation only. - + void @@ -20329,33 +21589,33 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntPropLevel ipl=IPL_DEF) atleast - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\geq z$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}\geq z$. Supports domain consistent propagation only.Throws an exception of type Int::ArgumentSizeMismatch, if x and y are of different size. - + void @@ -20363,11 +21623,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, int n, int m, IntPropLevel ipl=IPL_DEF) exactly - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -20379,17 +21639,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}=m$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}=m$. Supports domain consistent propagation only. - + void @@ -20397,15 +21657,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, IntVar y, int m, IntPropLevel ipl=IPL_DEF) exactly - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y @@ -20413,17 +21673,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}=m$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}=m$. Supports domain consistent propagation only. - + void @@ -20431,15 +21691,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntPropLevel ipl=IPL_DEF) exactly - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & y @@ -20447,17 +21707,17 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr m - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}=m$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}=m$. Supports domain consistent propagation only.Throws an exception of type Int::ArgumentSizeMismatch, if x and y are of different size. - + void @@ -20465,11 +21725,11 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, int n, IntVar z, IntPropLevel ipl=IPL_DEF) exactly - Home + Home home - const IntVarArgs & + const IntVarArgs & x @@ -20477,21 +21737,21 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr n - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}=z$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=n\}=z$. Supports domain consistent propagation only. - + void @@ -20499,33 +21759,33 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntPropLevel ipl=IPL_DEF) exactly - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntVar + IntVar y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}=z$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y\}=z$. Supports domain consistent propagation only. - + void @@ -20533,33 +21793,33 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntPropLevel ipl=IPL_DEF) exactly - Home + Home home - const IntVarArgs & + const IntVarArgs & x - const IntArgs & + const IntArgs & y - IntVar + IntVar z - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}=z$. +Post constraint $\#\{i\in\{0,\ldots,|x|-1\}\;|\;x_i=y_i\}=z$. Supports domain consistent propagation only.Throws an exception of type Int::ArgumentSizeMismatch, if x and y are of different size. - + void @@ -20567,25 +21827,25 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, IntRelType r, const IntVarArgs &y, IntPropLevel ipl=IPL_DEF) lex - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntRelType + IntRelType r - const IntVarArgs & + const IntVarArgs & y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post lexical order between x and y. @@ -20593,7 +21853,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + void @@ -20601,25 +21861,25 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const BoolVarArgs &x, IntRelType r, const BoolVarArgs &y, IntPropLevel ipl=IPL_DEF) lex - Home + Home home - const BoolVarArgs & + const BoolVarArgs & x - IntRelType + IntRelType r - const BoolVarArgs & + const BoolVarArgs & y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF Post lexical order between x and y. @@ -20627,7 +21887,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + void @@ -20635,37 +21895,37 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr (Home home, const IntVarArgs &x, IntSet y, IntPropLevel ipl=IPL_DEF) values - Home + Home home - const IntVarArgs & + const IntVarArgs & x - IntSet + IntSet y - IntPropLevel + IntPropLevel ipl - IPL_DEF + IPL_DEF -Post constraint $\{x_0,\dots,x_{n-1}\}=y$. +Post constraint $\{x_0,\dots,x_{n-1}\}=y$. - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::sum (const Slice< IntArgs > &slice) sum - const Slice< IntArgs > & + const Slice< IntArgs > & slice @@ -20674,15 +21934,15 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - GECODE_MINIMODEL_EXPORT LinIntExpr + GECODE_MINIMODEL_EXPORT LinIntExpr GECODE_MINIMODEL_EXPORT LinIntExpr Gecode::sum (const Matrix< IntArgs > &matrix) sum - const Matrix< IntArgs > & + const Matrix< IntArgs > & matrix @@ -20691,7 +21951,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -20708,9 +21968,9 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr s - const Search::Options & + const Search::Options & o - Search::Options::def + Search::Options::def Perform depth-first branch-and-bound search for subclass T of space s and options o. @@ -20719,7 +21979,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr Whenever exploration requires to add a constraint to the space c currently being explored, the engine executes c.constrain(t) where t is the so-far best solution. - + @@ -20727,12 +21987,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class T - SEB + SEB SEB Gecode::bab (const Search::Options &o=Search::Options::def) bab - const Search::Options & + const Search::Options & o @@ -20741,7 +22001,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -20758,7 +22018,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr s - const Search::Options & + const Search::Options & o @@ -20767,7 +22027,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -20775,12 +22035,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class T - SEB + SEB SEB Gecode::dfs (const Search::Options &o=Search::Options::def) dfs - const Search::Options & + const Search::Options & o @@ -20789,7 +22049,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -20806,7 +22066,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr s - const Search::Options & + const Search::Options & o @@ -20815,7 +22075,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -20823,12 +22083,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class T - SEB + SEB SEB Gecode::lds (const Search::Options &o=Search::Options::def) lds - const Search::Options & + const Search::Options & o @@ -20837,7 +22097,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -20859,9 +22119,9 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr s - const Search::Options & + const Search::Options & o - Search::Options::def + Search::Options::def Run a portfolio of search engines. @@ -20871,7 +22131,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr When the assets are created, these functions are executed. For more details, consult "Modeling and Programming with Gecode". - + @@ -20884,12 +22144,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr E - SEB + SEB SEB Gecode::pbs (const Search::Options &o) pbs - const Search::Options & + const Search::Options & o @@ -20898,7 +22158,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -20920,7 +22180,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr s - const Search::Options & + const Search::Options & o @@ -20932,7 +22192,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr with Gecode". - + @@ -20945,12 +22205,12 @@ with Gecode". E - SEB + SEB SEB Gecode::rbs (const Search::Options &o) rbs - const Search::Options & + const Search::Options & o @@ -20959,7 +22219,7 @@ with Gecode". - + @@ -20967,14 +22227,14 @@ with Gecode". class T - SEB + SEB SEB Gecode::pbs (const Search::Options &o=Search::Options::def) pbs - const Search::Options & + const Search::Options & o - Search::Options::def + Search::Options::def Return a portfolio search engine builder. @@ -20982,42 +22242,42 @@ with Gecode". - + - - SetAssign - SetAssign Gecode::SET_ASSIGN_MIN_INC + + SetAssign + Include smallest element SetAssign Gecode::SET_ASSIGN_MIN_INC (void) SET_ASSIGN_MIN_INC void -Include smallest element. + - + - - SetAssign - SetAssign Gecode::SET_ASSIGN_MIN_EXC + + SetAssign + Exclude smallest element SetAssign Gecode::SET_ASSIGN_MIN_EXC (void) SET_ASSIGN_MIN_EXC void -Exclude smallest element. + - + - - SetAssign + + SetAssign SetAssign Gecode::SET_ASSIGN_MED_INC (void) SET_ASSIGN_MED_INC @@ -21025,15 +22285,15 @@ with Gecode". void -Include median element (rounding downwards) + - + - - SetAssign + + SetAssign SetAssign Gecode::SET_ASSIGN_MED_EXC (void) SET_ASSIGN_MED_EXC @@ -21041,92 +22301,92 @@ with Gecode". void -Exclude median element (rounding downwards) + - + - - SetAssign - SetAssign Gecode::SET_ASSIGN_MAX_INC + + SetAssign + Include largest element SetAssign Gecode::SET_ASSIGN_MAX_INC (void) SET_ASSIGN_MAX_INC void -Include largest element. + - + - - SetAssign - SetAssign Gecode::SET_ASSIGN_MAX_EXC + + SetAssign + Exclude largest element SetAssign Gecode::SET_ASSIGN_MAX_EXC (void) SET_ASSIGN_MAX_EXC void -Exclude largest element. + - + - - SetAssign - SetAssign Gecode::SET_ASSIGN_RND_INC + + SetAssign + Include random element SetAssign Gecode::SET_ASSIGN_RND_INC (Rnd r) SET_ASSIGN_RND_INC - Rnd + Rnd r -Include random element. + - + - - SetAssign - SetAssign Gecode::SET_ASSIGN_RND_EXC + + SetAssign + Exclude random element SetAssign Gecode::SET_ASSIGN_RND_EXC (Rnd r) SET_ASSIGN_RND_EXC - Rnd + Rnd r -Exclude random element. + - + - - SetAssign + + SetAssign SetAssign Gecode::SET_ASSIGN - (SetBranchVal v, SetBranchCommit c=NULL) + (SetBranchVal v, SetBranchCommit c=nullptr) SET_ASSIGN - SetBranchVal + SetBranchVal v - SetBranchCommit + SetBranchCommit c - NULL + nullptr Select value as defined by the value function v and commit function c. @@ -21134,42 +22394,42 @@ with Gecode". The default commit function posts the constraint that the value n must be included in the set variable x. - + - - SetValBranch - SetValBranch Gecode::SET_VAL_MIN_INC + + SetValBranch + Include smallest element SetValBranch Gecode::SET_VAL_MIN_INC (void) SET_VAL_MIN_INC void -Include smallest element. + - + - - SetValBranch - SetValBranch Gecode::SET_VAL_MIN_EXC + + SetValBranch + Exclude smallest element SetValBranch Gecode::SET_VAL_MIN_EXC (void) SET_VAL_MIN_EXC void -Exclude smallest element. + - + - - SetValBranch + + SetValBranch SetValBranch Gecode::SET_VAL_MED_INC (void) SET_VAL_MED_INC @@ -21177,15 +22437,15 @@ with Gecode". void -Include median element (rounding downwards) + - + - - SetValBranch + + SetValBranch SetValBranch Gecode::SET_VAL_MED_EXC (void) SET_VAL_MED_EXC @@ -21193,92 +22453,92 @@ with Gecode". void -Exclude median element (rounding downwards) + - + - - SetValBranch - SetValBranch Gecode::SET_VAL_MAX_INC + + SetValBranch + Include largest element SetValBranch Gecode::SET_VAL_MAX_INC (void) SET_VAL_MAX_INC void -Include largest element. + - + - - SetValBranch - SetValBranch Gecode::SET_VAL_MAX_EXC + + SetValBranch + Exclude largest element SetValBranch Gecode::SET_VAL_MAX_EXC (void) SET_VAL_MAX_EXC void -Exclude largest element. + - + - - SetValBranch - SetValBranch Gecode::SET_VAL_RND_INC + + SetValBranch + Include random element SetValBranch Gecode::SET_VAL_RND_INC (Rnd r) SET_VAL_RND_INC - Rnd + Rnd r -Include random element. + - + - - SetValBranch - SetValBranch Gecode::SET_VAL_RND_EXC + + SetValBranch + Exclude random element SetValBranch Gecode::SET_VAL_RND_EXC (Rnd r) SET_VAL_RND_EXC - Rnd + Rnd r -Exclude random element. + - + - - SetValBranch + + SetValBranch SetValBranch Gecode::SET_VAL - (SetBranchVal v, SetBranchCommit c=NULL) + (SetBranchVal v, SetBranchCommit c=nullptr) SET_VAL - SetBranchVal + SetBranchVal v - SetBranchCommit + SetBranchCommit c - NULL + nullptr Select value as defined by the value function v and commit function c. @@ -21286,588 +22546,802 @@ with Gecode". The default commit function posts the constraint that the value n must be included in the set variable x for the first alternative, and that n must be excluded from x otherwise. - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_NONE + + SetVarBranch + Select first unassigned variable SetVarBranch Gecode::SET_VAR_NONE (void) SET_VAR_NONE void -Select first unassigned variable. + - + - - SetVarBranch + + SetVarBranch SetVarBranch Gecode::SET_VAR_RND (Rnd r) SET_VAR_RND - Rnd + Rnd r -Select random variable (uniform distribution, for tie breaking) + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_MERIT_MIN - (SetBranchMerit bm, BranchTbl tbl=NULL) + + SetVarBranch + Select variable with least merit according to branch merit function a bm SetVarBranch Gecode::SET_VAR_MERIT_MIN + (SetBranchMerit bm, BranchTbl tbl) SET_VAR_MERIT_MIN - SetBranchMerit + SetBranchMerit bm - BranchTbl + BranchTbl tbl -Select variable with least merit according to branch merit function bm. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_MERIT_MAX - (SetBranchMerit bm, BranchTbl tbl=NULL) + + SetVarBranch + Select variable with highest merit according to branch merit function a bm SetVarBranch Gecode::SET_VAR_MERIT_MAX + (SetBranchMerit bm, BranchTbl tbl) SET_VAR_MERIT_MAX - SetBranchMerit + SetBranchMerit bm - BranchTbl + BranchTbl tbl -Select variable with highest merit according to branch merit function bm. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_DEGREE_MIN - (BranchTbl tbl=NULL) + + SetVarBranch + Select variable with smallest degree SetVarBranch Gecode::SET_VAR_DEGREE_MIN + (BranchTbl tbl) SET_VAR_DEGREE_MIN - BranchTbl + BranchTbl tbl -Select variable with smallest degree. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_DEGREE_MAX - (BranchTbl tbl=NULL) + + SetVarBranch + Select variable with largest degree SetVarBranch Gecode::SET_VAR_DEGREE_MAX + (BranchTbl tbl) SET_VAR_DEGREE_MAX - BranchTbl + BranchTbl tbl -Select variable with largest degree. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_AFC_MIN - (double d=1.0, BranchTbl tbl=NULL) + + SetVarBranch + Select variable with smallest accumulated failure count with decay factor a d SetVarBranch Gecode::SET_VAR_AFC_MIN + (double d, BranchTbl tbl) SET_VAR_AFC_MIN double d - BranchTbl + BranchTbl tbl -Select variable with smallest accumulated failure count with decay factor d. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_AFC_MIN - (SetAFC a, BranchTbl tbl=NULL) + + SetVarBranch + Select variable with smallest accumulated failure count SetVarBranch Gecode::SET_VAR_AFC_MIN + (SetAFC a, BranchTbl tbl) SET_VAR_AFC_MIN - SetAFC + SetAFC a - BranchTbl + BranchTbl tbl -Select variable with smallest accumulated failure count. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_AFC_MAX - (double d=1.0, BranchTbl tbl=NULL) + + SetVarBranch + Select variable with largest accumulated failure count with decay factor a d SetVarBranch Gecode::SET_VAR_AFC_MAX + (double d, BranchTbl tbl) SET_VAR_AFC_MAX double d - BranchTbl + BranchTbl tbl -Select variable with largest accumulated failure count with decay factor d. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_AFC_MAX - (SetAFC a, BranchTbl tbl=NULL) + + SetVarBranch + Select variable with largest accumulated failure count SetVarBranch Gecode::SET_VAR_AFC_MAX + (SetAFC a, BranchTbl tbl) SET_VAR_AFC_MAX - SetAFC + SetAFC a - BranchTbl + BranchTbl tbl -Select variable with largest accumulated failure count. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_ACTIVITY_MIN - (double d=1.0, BranchTbl tbl=NULL) - SET_VAR_ACTIVITY_MIN + + SetVarBranch + Select variable with lowest action with decay factor a d SetVarBranch Gecode::SET_VAR_ACTION_MIN + (double d, BranchTbl tbl) + SET_VAR_ACTION_MIN double d - BranchTbl + BranchTbl tbl -Select variable with lowest activity with decay factor d. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_ACTIVITY_MIN - (SetActivity a, BranchTbl tbl=NULL) - SET_VAR_ACTIVITY_MIN + + SetVarBranch + Select variable with lowest action SetVarBranch Gecode::SET_VAR_ACTION_MIN + (SetAction a, BranchTbl tbl) + SET_VAR_ACTION_MIN - SetActivity + SetAction a - BranchTbl + BranchTbl tbl -Select variable with lowest activity. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_ACTIVITY_MAX - (double d=1.0, BranchTbl tbl=NULL) - SET_VAR_ACTIVITY_MAX + + SetVarBranch + Select variable with highest action with decay factor a d SetVarBranch Gecode::SET_VAR_ACTION_MAX + (double d, BranchTbl tbl) + SET_VAR_ACTION_MAX double d - BranchTbl + BranchTbl tbl -Select variable with highest activity with decay factor d. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_ACTIVITY_MAX - (SetActivity a, BranchTbl tbl=NULL) - SET_VAR_ACTIVITY_MAX + + SetVarBranch + Select variable with highest action SetVarBranch Gecode::SET_VAR_ACTION_MAX + (SetAction a, BranchTbl tbl) + SET_VAR_ACTION_MAX - SetActivity + SetAction a - BranchTbl + BranchTbl tbl -Select variable with highest activity. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_MIN_MIN - (BranchTbl tbl=NULL) + + SetVarBranch + Select variable with lowest CHB Q score SetVarBranch Gecode::SET_VAR_CHB_MIN + (BranchTbl tbl) + SET_VAR_CHB_MIN + + BranchTbl + tbl + + + + + + + + + + + SetVarBranch + Select variable with lowest CHB Q score SetVarBranch Gecode::SET_VAR_CHB_MIN + (SetCHB c, BranchTbl tbl) + SET_VAR_CHB_MIN + + SetCHB + c + + + BranchTbl + tbl + + + + + + + + + + + SetVarBranch + Select variable with highest CHB Q score SetVarBranch Gecode::SET_VAR_CHB_MAX + (BranchTbl tbl) + SET_VAR_CHB_MAX + + BranchTbl + tbl + + + + + + + + + + + SetVarBranch + Select variable with highest CHB Q score SetVarBranch Gecode::SET_VAR_CHB_MAX + (SetCHB c, BranchTbl tbl) + SET_VAR_CHB_MAX + + SetCHB + c + + + BranchTbl + tbl + + + + + + + + + + + SetVarBranch + Select variable with smallest minimum unknown element SetVarBranch Gecode::SET_VAR_MIN_MIN + (BranchTbl tbl) SET_VAR_MIN_MIN - BranchTbl + BranchTbl tbl -Select variable with smallest minimum unknown element. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_MIN_MAX - (BranchTbl tbl=NULL) + + SetVarBranch + Select variable with largest minimum unknown element SetVarBranch Gecode::SET_VAR_MIN_MAX + (BranchTbl tbl) SET_VAR_MIN_MAX - BranchTbl + BranchTbl tbl -Select variable with largest minimum unknown element. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_MAX_MIN - (BranchTbl tbl=NULL) + + SetVarBranch + Select variable with smallest maximum unknown element SetVarBranch Gecode::SET_VAR_MAX_MIN + (BranchTbl tbl) SET_VAR_MAX_MIN - BranchTbl + BranchTbl tbl -Select variable with smallest maximum unknown element. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_MAX_MAX - (BranchTbl tbl=NULL) + + SetVarBranch + Select variable with largest maximum unknown element SetVarBranch Gecode::SET_VAR_MAX_MAX + (BranchTbl tbl) SET_VAR_MAX_MAX - BranchTbl + BranchTbl tbl -Select variable with largest maximum unknown element. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_SIZE_MIN - (BranchTbl tbl=NULL) + + SetVarBranch + Select variable with smallest unknown set SetVarBranch Gecode::SET_VAR_SIZE_MIN + (BranchTbl tbl) SET_VAR_SIZE_MIN - BranchTbl + BranchTbl tbl -Select variable with smallest unknown set. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_SIZE_MAX - (BranchTbl tbl=NULL) + + SetVarBranch + Select variable with largest unknown set SetVarBranch Gecode::SET_VAR_SIZE_MAX + (BranchTbl tbl) SET_VAR_SIZE_MAX - BranchTbl + BranchTbl tbl -Select variable with largest unknown set. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_DEGREE_SIZE_MIN - (BranchTbl tbl=NULL) + + SetVarBranch + Select variable with smallest degree divided by domain size SetVarBranch Gecode::SET_VAR_DEGREE_SIZE_MIN + (BranchTbl tbl) SET_VAR_DEGREE_SIZE_MIN - BranchTbl + BranchTbl tbl -Select variable with smallest degree divided by domain size. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_DEGREE_SIZE_MAX - (BranchTbl tbl=NULL) + + SetVarBranch + Select variable with largest degree divided by domain size SetVarBranch Gecode::SET_VAR_DEGREE_SIZE_MAX + (BranchTbl tbl) SET_VAR_DEGREE_SIZE_MAX - BranchTbl + BranchTbl tbl -Select variable with largest degree divided by domain size. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_AFC_SIZE_MIN - (double d=1.0, BranchTbl tbl=NULL) + + SetVarBranch + Select variable with smallest accumulated failure count divided by domain size with decay factor a d SetVarBranch Gecode::SET_VAR_AFC_SIZE_MIN + (double d, BranchTbl tbl) SET_VAR_AFC_SIZE_MIN double d - BranchTbl + BranchTbl tbl -Select variable with smallest accumulated failure count divided by domain size with decay factor d. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_AFC_SIZE_MIN - (SetAFC a, BranchTbl tbl=NULL) + + SetVarBranch + Select variable with smallest accumulated failure count divided by domain size SetVarBranch Gecode::SET_VAR_AFC_SIZE_MIN + (SetAFC a, BranchTbl tbl) SET_VAR_AFC_SIZE_MIN - SetAFC + SetAFC a - BranchTbl + BranchTbl tbl -Select variable with smallest accumulated failure count divided by domain size. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_AFC_SIZE_MAX - (double d=1.0, BranchTbl tbl=NULL) + + SetVarBranch + Select variable with largest accumulated failure count divided by domain size with decay factor a d SetVarBranch Gecode::SET_VAR_AFC_SIZE_MAX + (double d, BranchTbl tbl) SET_VAR_AFC_SIZE_MAX double d - BranchTbl + BranchTbl tbl -Select variable with largest accumulated failure count divided by domain size with decay factor d. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_AFC_SIZE_MAX - (SetAFC a, BranchTbl tbl=NULL) + + SetVarBranch + Select variable with largest accumulated failure count divided by domain size SetVarBranch Gecode::SET_VAR_AFC_SIZE_MAX + (SetAFC a, BranchTbl tbl) SET_VAR_AFC_SIZE_MAX - SetAFC + SetAFC a - BranchTbl + BranchTbl tbl -Select variable with largest accumulated failure count divided by domain size. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_ACTIVITY_SIZE_MIN - (double d=1.0, BranchTbl tbl=NULL) - SET_VAR_ACTIVITY_SIZE_MIN + + SetVarBranch + Select variable with smallest action divided by domain size with decay factor a d SetVarBranch Gecode::SET_VAR_ACTION_SIZE_MIN + (double d, BranchTbl tbl) + SET_VAR_ACTION_SIZE_MIN double d - BranchTbl + BranchTbl tbl -Select variable with smallest activity divided by domain size with decay factor d. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_ACTIVITY_SIZE_MIN - (SetActivity a, BranchTbl tbl=NULL) - SET_VAR_ACTIVITY_SIZE_MIN + + SetVarBranch + Select variable with smallest action divided by domain size SetVarBranch Gecode::SET_VAR_ACTION_SIZE_MIN + (SetAction a, BranchTbl tbl) + SET_VAR_ACTION_SIZE_MIN - SetActivity + SetAction a - BranchTbl + BranchTbl tbl -Select variable with smallest activity divided by domain size. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_ACTIVITY_SIZE_MAX - (double d=1.0, BranchTbl tbl=NULL) - SET_VAR_ACTIVITY_SIZE_MAX + + SetVarBranch + Select variable with largest action divided by domain size with decay factor a d SetVarBranch Gecode::SET_VAR_ACTION_SIZE_MAX + (double d, BranchTbl tbl) + SET_VAR_ACTION_SIZE_MAX double d - BranchTbl + BranchTbl tbl -Select variable with largest activity divided by domain size with decay factor d. + - + - - SetVarBranch - SetVarBranch Gecode::SET_VAR_ACTIVITY_SIZE_MAX - (SetActivity a, BranchTbl tbl=NULL) - SET_VAR_ACTIVITY_SIZE_MAX + + SetVarBranch + Select variable with largest action divided by domain size SetVarBranch Gecode::SET_VAR_ACTION_SIZE_MAX + (SetAction a, BranchTbl tbl) + SET_VAR_ACTION_SIZE_MAX - SetActivity + SetAction a - BranchTbl + BranchTbl tbl -Select variable with largest activity divided by domain size. + - + + + + SetVarBranch + Select variable with smallest CHB Q score divided by domain size SetVarBranch Gecode::SET_VAR_CHB_SIZE_MIN + (BranchTbl tbl) + SET_VAR_CHB_SIZE_MIN + + BranchTbl + tbl + + + + + + + + + + + SetVarBranch + Select variable with smallest CHB Q score divided by domain size SetVarBranch Gecode::SET_VAR_CHB_SIZE_MIN + (SetCHB c, BranchTbl tbl) + SET_VAR_CHB_SIZE_MIN + + SetCHB + c + + + BranchTbl + tbl + + + + + + + + + + + SetVarBranch + Select variable with largest CHB Q score divided by domain size SetVarBranch Gecode::SET_VAR_CHB_SIZE_MAX + (BranchTbl tbl) + SET_VAR_CHB_SIZE_MAX + + BranchTbl + tbl + + + + + + + + + + + SetVarBranch + Select variable with largest CHB Q score divided by domain size SetVarBranch Gecode::SET_VAR_CHB_SIZE_MAX + (SetCHB c, BranchTbl tbl) + SET_VAR_CHB_SIZE_MAX + + SetCHB + c + + + BranchTbl + tbl + + + + + + + + + + + forceinline void + void Gecode::rel + (Home home, IntVar x, IntRelType rt, SetVar s) + rel + + Home + home + + + IntVar + x + + + IntRelType + rt + + + SetVar + s + + +Post propagator for $|s|\geq 1 \land \forall i\in s:\ x \sim_{rt} i$. + + + + + + + + forceinline void + void Gecode::rel + (Home home, IntVar x, IntRelType rt, SetVar s, Reify r) + rel + + Home + home + + + IntVar + x + + + IntRelType + rt + + + SetVar + s + + + Reify + r + + +Post reified propagator for. + + + + + @@ -21883,11 +23357,11 @@ with Gecode". (const Space &home, const ViewArray< View0 > &va, const View1 &y) viewarrayshared - const Space & + const Space & home - const ViewArray< View0 > & + const ViewArray< View0 > & va @@ -21900,7 +23374,7 @@ with Gecode". - + @@ -21910,13 +23384,13 @@ with Gecode". (const Space &, const ViewArray< Set::SingletonView > &, const Set::SetView &) viewarrayshared< Set::SingletonView, Set::SetView > - const Space & + const Space & - const ViewArray< Set::SingletonView > & + const ViewArray< Set::SingletonView > & - const Set::SetView & + const Set::SetView & @@ -21924,19 +23398,19 @@ with Gecode". - + - + void void Gecode::trace - (Home home, const SetVarArgs &x, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_DONE), SetTracer &t=StdSetTracer::def) + (Home home, const SetVarArgs &x, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE), SetTracer &t=StdSetTracer::def) trace - Home + Home home - const SetVarArgs & + const SetVarArgs & x @@ -21944,7 +23418,7 @@ with Gecode". te - SetTracer & + SetTracer & t @@ -21953,7 +23427,7 @@ with Gecode". - + @@ -21973,7 +23447,7 @@ with Gecode". os - const SetVar & + const SetVar & x @@ -21982,7 +23456,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -21990,15 +23464,15 @@ with Gecode". (Home home, SetVar x, SetRelType r, int i) dom - Home + Home home - SetVar + SetVar x - SetRelType + SetRelType r @@ -22006,12 +23480,12 @@ with Gecode". i -Propagates $ x \sim_r \{i\}$. +Propagates $ x \sim_r \{i\}$. - + GECODE_SET_EXPORT void @@ -22019,15 +23493,15 @@ with Gecode". (Home home, const SetVarArgs &x, SetRelType r, int i) dom - Home + Home home - const SetVarArgs & + const SetVarArgs & x - SetRelType + SetRelType r @@ -22035,12 +23509,12 @@ with Gecode". i -Propagates $ x_i \sim_r \{i\}$ for all $0\leq i<|x|$. +Propagates $ x_i \sim_r \{i\}$ for all $0\leq i<|x|$. - + GECODE_SET_EXPORT void @@ -22048,15 +23522,15 @@ with Gecode". (Home home, SetVar x, SetRelType r, int i, int j) dom - Home + Home home - SetVar + SetVar x - SetRelType + SetRelType r @@ -22068,12 +23542,12 @@ with Gecode". j -Propagates $ x \sim_r \{i,\dots,j\}$. +Propagates $ x \sim_r \{i,\dots,j\}$. - + GECODE_SET_EXPORT void @@ -22081,15 +23555,15 @@ with Gecode". (Home home, const SetVarArgs &x, SetRelType r, int i, int j) dom - Home + Home home - const SetVarArgs & + const SetVarArgs & x - SetRelType + SetRelType r @@ -22101,12 +23575,12 @@ with Gecode". j -Propagates $ x \sim_r \{i,\dots,j\}$ for all $0\leq i<|x|$. +Propagates $ x \sim_r \{i,\dots,j\}$ for all $0\leq i<|x|$. - + GECODE_SET_EXPORT void @@ -22114,28 +23588,28 @@ with Gecode". (Home home, SetVar x, SetRelType r, const IntSet &s) dom - Home + Home home - SetVar + SetVar x - SetRelType + SetRelType r - const IntSet & + const IntSet & s -Propagates $ x \sim_r s$. +Propagates $ x \sim_r s$. - + GECODE_SET_EXPORT void @@ -22143,28 +23617,28 @@ with Gecode". (Home home, const SetVarArgs &x, SetRelType r, const IntSet &s) dom - Home + Home home - const SetVarArgs & + const SetVarArgs & x - SetRelType + SetRelType r - const IntSet & + const IntSet & s -Propagates $ x \sim_r s$ for all $0\leq i<|x|$. +Propagates $ x \sim_r s$ for all $0\leq i<|x|$. - + GECODE_SET_EXPORT void @@ -22172,11 +23646,11 @@ with Gecode". (Home home, SetVar x, unsigned int i, unsigned int j) cardinality - Home + Home home - SetVar + SetVar x @@ -22188,12 +23662,12 @@ with Gecode". j -Propagates $ i \leq |s| \leq j $. +Propagates $ i \leq |s| \leq j $. - + GECODE_SET_EXPORT void @@ -22201,11 +23675,11 @@ with Gecode". (Home home, const SetVarArgs &x, unsigned int i, unsigned int j) cardinality - Home + Home home - const SetVarArgs & + const SetVarArgs & x @@ -22217,12 +23691,12 @@ with Gecode". j -Propagates $ i \leq |s| \leq j $ for all $0\leq i<|x|$. +Propagates $ i \leq |s| \leq j $ for all $0\leq i<|x|$. - + GECODE_SET_EXPORT void @@ -22230,15 +23704,15 @@ with Gecode". (Home home, SetVar x, SetRelType rt, int i, Reify r) dom - Home + Home home - SetVar + SetVar x - SetRelType + SetRelType rt @@ -22246,16 +23720,16 @@ with Gecode". i - Reify + Reify r -Post propagator for $ (x \sim_{rt} \{i\}) \equiv r $. +Post propagator for $ (x \sim_{rt} \{i\}) \equiv r $. - + GECODE_SET_EXPORT void @@ -22263,15 +23737,15 @@ with Gecode". (Home home, SetVar x, SetRelType rt, int i, int j, Reify r) dom - Home + Home home - SetVar + SetVar x - SetRelType + SetRelType rt @@ -22283,16 +23757,16 @@ with Gecode". j - Reify + Reify r -Post propagator for $ (x \sim_{rt} \{i,\dots,j\}) \equiv r $. +Post propagator for $ (x \sim_{rt} \{i,\dots,j\}) \equiv r $. - + GECODE_SET_EXPORT void @@ -22300,32 +23774,32 @@ with Gecode". (Home home, SetVar x, SetRelType rt, const IntSet &s, Reify r) dom - Home + Home home - SetVar + SetVar x - SetRelType + SetRelType rt - const IntSet & + const IntSet & s - Reify + Reify r -Post propagator for $ (x \sim_{rt} s) \equiv r $. +Post propagator for $ (x \sim_{rt} s) \equiv r $. - + GECODE_SET_EXPORT void @@ -22333,15 +23807,15 @@ with Gecode". (Home home, SetVar x, SetVar d) dom - Home + Home home - SetVar + SetVar x - SetVar + SetVar d @@ -22350,7 +23824,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -22358,24 +23832,24 @@ with Gecode". (Home home, const SetVarArgs &x, const SetVarArgs &d) dom - Home + Home home - const SetVarArgs & + const SetVarArgs & x - const SetVarArgs & + const SetVarArgs & d -Constrain domain of $ x_i $ according to domain of $ d_i $ for all $0\leq i<|x|$. +Constrain domain of $ x_i $ according to domain of $ d_i $ for all $0\leq i<|x|$. - + GECODE_SET_EXPORT void @@ -22383,28 +23857,28 @@ with Gecode". (Home home, SetVar x, SetRelType r, SetVar y) rel - Home + Home home - SetVar + SetVar x - SetRelType + SetRelType r - SetVar + SetVar y -Post propagator for $ x \sim_r y$. +Post propagator for $ x \sim_r y$. - + GECODE_SET_EXPORT void @@ -22412,32 +23886,32 @@ with Gecode". (Home home, SetVar x, SetRelType rt, SetVar y, Reify r) rel - Home + Home home - SetVar + SetVar x - SetRelType + SetRelType rt - SetVar + SetVar y - Reify + Reify r -Post propagator for $ (x \sim_{rt} y) \equiv r$. +Post propagator for $ (x \sim_{rt} y) \equiv r$. - + GECODE_SET_EXPORT void @@ -22445,28 +23919,28 @@ with Gecode". (Home home, SetVar s, SetRelType r, IntVar x) rel - Home + Home home - SetVar + SetVar s - SetRelType + SetRelType r - IntVar + IntVar x -Post propagator for $ s \sim_r \{x\}$. +Post propagator for $ s \sim_r \{x\}$. - + GECODE_SET_EXPORT void @@ -22474,28 +23948,28 @@ with Gecode". (Home home, IntVar x, SetRelType r, SetVar s) rel - Home + Home home - IntVar + IntVar x - SetRelType + SetRelType r - SetVar + SetVar s -Post propagator for $ \{x\} \sim_r s$. +Post propagator for $ \{x\} \sim_r s$. - + GECODE_SET_EXPORT void @@ -22503,32 +23977,32 @@ with Gecode". (Home home, SetVar s, SetRelType rt, IntVar x, Reify r) rel - Home + Home home - SetVar + SetVar s - SetRelType + SetRelType rt - IntVar + IntVar x - Reify + Reify r -Post propagator for $ (s \sim_{rt} \{x\}) \equiv r$. +Post propagator for $ (s \sim_{rt} \{x\}) \equiv r$. - + GECODE_SET_EXPORT void @@ -22536,1296 +24010,259 @@ with Gecode". (Home home, IntVar x, SetRelType rt, SetVar s, Reify r) rel - Home + Home home - IntVar + IntVar x - SetRelType + SetRelType rt - SetVar + SetVar s - Reify + Reify r -Post propagator for $ (\{x\} \sim_{rt} s) \equiv r $. +Post propagator for $ (\{x\} \sim_{rt} s) \equiv r $. - + - + GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::rel - (Home home, SetVar s, IntRelType r, IntVar x) + (Home home, SetVar s, IntRelType rt, IntVar x) rel - Home + Home home - SetVar + SetVar s - IntRelType - r + IntRelType + rt - IntVar + IntVar x -Post propagator for $|s|\geq 1 \land \forall i\in s:\ i \sim_r x$. +Post propagator for $|s|\geq 1 \land \forall i\in s:\ i \sim_{rt} x$. - + - + GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::rel - (Home home, IntVar x, IntRelType r, SetVar s) + (Home home, SetVar s, IntRelType rt, IntVar x, Reify r) rel - Home + Home home - IntVar - x - - - IntRelType - r - - - SetVar + SetVar s - -Post propagator for $|s|\geq 1 \land \forall i\in s:\ x \sim_r i$. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::rel - (Home home, SetVar x, SetOpType op, SetVar y, SetRelType r, SetVar z) - rel - Home - home + IntRelType + rt - SetVar + IntVar x - SetOpType - op - - - SetVar - y - - - SetRelType + Reify r + +Post reified propagator for $\left(|s|\geq 1 \land \forall i\in s:\ i \sim_{rt} x\right)\equiv r$. + + + + + + + + Post propagator for + Post propagator for Gecode::f + (x \diamond_{\mathit{op}} y) \sim_r z \f$ GECODE_SET_EXPORT void rel(Home home + f - SetVar + x \diamond_{\mathit{op}} + y + + + + + + + + + + + GECODE_SET_EXPORT void + GECODE_SET_EXPORT void Gecode::ite + (Home home, BoolVar b, SetVar x, SetVar y, SetVar z) + ite + + Home + home + + + BoolVar + b + + + SetVar + x + + + SetVar + y + + + SetVar z -Post propagator for $ (x \diamond_{\mathit{op}} y) \sim_r z $. +Post propagator for if-then-else constraint. - +Posts propagator for $ z = b ? x : y $ - + - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::rel - (Home home, SetOpType op, const SetVarArgs &x, SetVar y) - rel - - Home - home - - - SetOpType - op - - - const SetVarArgs & - x - - - SetVar - y - - -Post propagator for $ y = \diamond_{\mathit{op}} x$. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::rel - (Home home, SetOpType op, const SetVarArgs &x, const IntSet &z, SetVar y) - rel - - Home - home - - - SetOpType - op - - - const SetVarArgs & - x - - - const IntSet & - z - - - SetVar - y - - -Post propagator for $ y = \diamond_{\mathit{op}} x \diamond_{\mathit{op}} z$. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::rel - (Home home, SetOpType op, const IntVarArgs &x, const IntSet &z, SetVar y) - rel - - Home - home - - - SetOpType - op - - - const IntVarArgs & - x - - - const IntSet & - z - - - SetVar - y - - -Post propagator for $ y = \diamond_{\mathit{op}} x \diamond_{\mathit{op}} z$. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::rel - (Home home, SetOpType op, const IntVarArgs &x, SetVar y) - rel - - Home - home - - - SetOpType - op - - - const IntVarArgs & - x - - - SetVar - y - - -Post propagator for $ y = \diamond_{\mathit{op}} x$. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::rel - (Home home, const IntSet &x, SetOpType op, SetVar y, SetRelType r, SetVar z) - rel - - Home - home - - - const IntSet & - x - - - SetOpType - op - - - SetVar - y - - - SetRelType - r - - - SetVar - z - - -Post propagator for $ (x \diamond_{\mathit{op}} y) \sim_r z $. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::rel - (Home home, SetVar x, SetOpType op, const IntSet &y, SetRelType r, SetVar z) - rel - - Home - home - - - SetVar - x - - - SetOpType - op - - - const IntSet & - y - - - SetRelType - r - - - SetVar - z - - -Post propagator for $ (x \diamond_{\mathit{op}} y) \sim_r z $. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::rel - (Home home, SetVar x, SetOpType op, SetVar y, SetRelType r, const IntSet &z) - rel - - Home - home - - - SetVar - x - - - SetOpType - op - - - SetVar - y - - - SetRelType - r - - - const IntSet & - z - - -Post propagator for $ (x \diamond_{\mathit{op}} y) \sim_r z $. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::rel - (Home home, const IntSet &x, SetOpType op, SetVar y, SetRelType r, const IntSet &z) - rel - - Home - home - - - const IntSet & - x - - - SetOpType - op - - - SetVar - y - - - SetRelType - r - - - const IntSet & - z - - -Post propagator for $ (x \diamond_{\mathit{op}} y) \sim_r z $. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::rel - (Home home, SetVar x, SetOpType op, const IntSet &y, SetRelType r, const IntSet &z) - rel - - Home - home - - - SetVar - x - - - SetOpType - op - - - const IntSet & - y - - - SetRelType - r - - - const IntSet & - z - - -Post propagator for $ (x \diamond_{\mathit{op}} y) \sim_r z $. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::convex + + Post propagator that propagates that a x is convex GECODE_SET_EXPORT void + Post propagator that propagates that a x is convex GECODE_SET_EXPORT void Gecode::convex (Home home, SetVar x) convex - Home + Home home - SetVar + SetVar x -Post propagator that propagates that x is convex. + - + - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::convex + + Post propagator that propagates that a y is the convex hull of a x GECODE_SET_EXPORT void + Post propagator that propagates that a y is the convex hull of a x GECODE_SET_EXPORT void Gecode::convex (Home home, SetVar x, SetVar y) convex - Home + Home home - SetVar + SetVar x - SetVar + SetVar y -Post propagator that propagates that y is the convex hull of x. + - + - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::sequence - (Home home, const SetVarArgs &x) - sequence + + Select random + Select random Gecode::variable + (uniform distribution, for tie breaking) SetVarBranch SET_VAR_RND(Rnd r) + variable - Home - home + uniform + distribution - const SetVarArgs & - x + for tie + breaking -Post propagator for $\forall 0\leq i< |x|-1 : \max(x_i)<\min(x_{i+1})$. + - + - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::sequence - (Home home, const SetVarArgs &y, SetVar x) - sequence - - Home - 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 $. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::atmostOne - (Home home, const SetVarArgs &x, unsigned int c) - atmostOne - - Home - 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$. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::min - (Home home, SetVar s, IntVar x) - min - - Home - home - - - SetVar - s - - - IntVar - x - - -Post propagator that propagates that x is the minimal element of s, and that s is not empty. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::notMin - (Home home, SetVar s, IntVar x) - notMin - - Home - home - - - SetVar - s - - - IntVar - x - - -Post propagator that propagates that x is not the minimal element of s. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::min - (Home home, SetVar s, IntVar x, Reify r) - min - - Home - home - - - SetVar - s - - - IntVar - x - - - Reify - r - - -Post reified propagator for b iff x is the minimal element of s. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::max - (Home home, SetVar s, IntVar x) - max - - Home - home - - - SetVar - s - - - IntVar - x - - -Post propagator that propagates that x is the maximal element of s, and that s is not empty. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::notMax - (Home home, SetVar s, IntVar x) - notMax - - Home - home - - - SetVar - s - - - IntVar - x - - -Post propagator that propagates that x is not the maximal element of s. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::max - (Home home, SetVar s, IntVar x, Reify r) - max - - Home - home - - - SetVar - s - - - IntVar - x - - - Reify - r - - -Post reified propagator for b iff x is the maximal element of s. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::cardinality - (Home home, SetVar s, IntVar x) - cardinality - - Home - home - - - SetVar - s - - - IntVar - x - - -Post propagator for $ |s|=x $. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::weights - (Home home, IntSharedArray elements, IntSharedArray weights, SetVar x, IntVar y) - weights - - Home - home - - - IntSharedArray - elements - - - IntSharedArray - weights - - - SetVar - x - - - IntVar - y - - -Post propagator for $y = \mathrm{weight}(x)$. - -The weights are given as pairs of elements and their weight: $\mathrm{weight}(\mathrm{elements}_i) = \mathrm{weights}_i$The upper bound of x is constrained to contain only elements from elements. The weight of a set is the sum of the weights of its elements. - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::channel - (Home home, const IntVarArgs &x, const SetVarArgs &y) - channel - - Home - home - - - const IntVarArgs & - x - - - const SetVarArgs & - y - - -Post propagator for $x_i=j \Leftrightarrow i\in y_j$. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::channelSorted - (Home home, const IntVarArgs &x, SetVar y) - channelSorted - - Home - home - - - const IntVarArgs & - x - - - SetVar - y - - -Post propagator for $\{x_0,\dots,x_{n-1}\}=y$ and $x_i<x_{i+1}$. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::channel - (Home home, const BoolVarArgs &x, SetVar y) - channel - - Home - home - - - const BoolVarArgs & - x - - - SetVar - y - - -Post propagator for $x_i=1 \Leftrightarrow i\in y$. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::channel - (Home home, const SetVarArgs &x, const SetVarArgs &y) - channel - - Home - home - - - const SetVarArgs & - x - - - const SetVarArgs & - y - - -Post propagator for $j\in x_i \Leftrightarrow i\in y_j$. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::precede - (Home home, const SetVarArgs &x, int s, int t) - precede - - Home - home - - - const SetVarArgs & - x - - - int - s - - - int - t - - -Post propagator that s precedes t in x. - -This constraint enforces that if there exists $j$ such that $s\notin x_j\land t\in x_j$, then there exists $i<j$ such that $s\in x_i\land t\notin x_i$. - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::precede - (Home home, const SetVarArgs &x, const IntArgs &c) - precede - - Home - home - - - const SetVarArgs & - x - - - const IntArgs & - c - - -Post propagator that successive values in c precede each other in x. - - - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::element - (Home home, SetOpType op, const SetVarArgs &x, SetVar y, SetVar z, const IntSet &u=IntSet(Set::Limits::min, Set::Limits::max)) + + Include median + Exclude median Gecode::element + (rounding downwards) SetValBranch SET_VAL_MED_INC(void) element - Home - home - - - SetOpType - op - - - const SetVarArgs & - x - - - SetVar - y - - - SetVar - z - - - const IntSet & - u - IntSet(Set::Limits::min, Set::Limits::max) + rounding + downwards -Post propagator for $ z=\diamond_{\mathit{op}}\langle x_0,\dots,x_{n-1}\rangle[y] $. - -If y is the empty set, the usual conventions for set operations apply: an empty union is empty, while an empty intersection is the universe, which can be given as the optional parameter u.The indices for y start at 0. - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::element - (Home home, SetOpType op, const IntVarArgs &x, SetVar y, SetVar z, const IntSet &u=IntSet(Set::Limits::min, Set::Limits::max)) - element - - Home - home - - - SetOpType - op - - - const IntVarArgs & - x - - - SetVar - y - - - SetVar - z - - - const IntSet & - u - IntSet(Set::Limits::min, Set::Limits::max) - - -Post propagator for $ z=\diamond_{\mathit{op}}\langle \{x_0\},\dots,\{x_{n-1}\}\rangle[y] $. - -If y is the empty set, the usual conventions for set operations apply: an empty union is empty, while an empty intersection is the universe, which can be given as the optional parameter u.The indices for y start at 0. - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::element - (Home home, SetOpType op, const IntSetArgs &x, SetVar y, SetVar z, const IntSet &u=IntSet(Set::Limits::min, Set::Limits::max)) - element - - Home - home - - - SetOpType - op - - - const IntSetArgs & - x - - - SetVar - y - - - SetVar - z - - - const IntSet & - u - IntSet(Set::Limits::min, Set::Limits::max) - - -Post propagator for $ z=\diamond_{\mathit{op}}\langle x_0,\dots,x_{n-1}\rangle[y] $. - -If y is the empty set, the usual conventions for set operations apply: an empty union is empty, while an empty intersection is the universe, which can be given as the optional parameter u.The indices for y start at 0. - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::element - (Home home, SetOpType op, const IntArgs &x, SetVar y, SetVar z, const IntSet &u=IntSet(Set::Limits::min, Set::Limits::max)) - element - - Home - home - - - SetOpType - op - - - const IntArgs & - x - - - SetVar - y - - - SetVar - z - - - const IntSet & - u - IntSet(Set::Limits::min, Set::Limits::max) - - -Post propagator for $ z=\diamond_{\mathit{op}}\langle \{x_0\},\dots,\{x_{n-1}\}\rangle[y] $. - -If y is the empty set, the usual conventions for set operations apply: an empty union is empty, while an empty intersection is the universe, which can be given as the optional parameter u.The indices for y start at 0. - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::element - (Home home, const SetVarArgs &x, IntVar y, SetVar z) - element - - Home - home - - - const SetVarArgs & - x - - - IntVar - y - - - SetVar - z - - -Post propagator for $ z=\langle x_0,\dots,x_{n-1}\rangle[y] $. - -The indices for y start at 0. - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::element - (Home home, const IntSetArgs &s, IntVar y, SetVar z) - element - - Home - home - - - const IntSetArgs & - s - - - IntVar - y - - - SetVar - z - - -Post propagator for $ z=\langle s_0,\dots,s_{n-1}\rangle[y] $. - -The indices for y start at 0. - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::element - (Home home, const IntSetArgs &a, IntVar x, int w, IntVar y, int h, SetVar z) - element - - Home - home - - - const IntSetArgs & - a - - - IntVar - x - - - int - w - - - IntVar - y - - - int - h - - - SetVar - z - - -Post propagator for $ a_{x+w\cdot y}=z$. - -Throws an exception of type Set::ArgumentSizeMismatch, if $ w\cdot h\neq|a|$. - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::element - (Home home, const SetVarArgs &a, IntVar x, int w, IntVar y, int h, SetVar z) - element - - Home - home - - - const SetVarArgs & - a - - - IntVar - x - - - int - w - - - IntVar - y - - - int - h - - - SetVar - z - - -Post propagator for $ a_{x+w\cdot y}=z$. - -Throws an exception of type Set::ArgumentSizeMismatch, if $ w\cdot h\neq|a|$. - - - - - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::wait - (Home home, SetVar x, void(*c)(Space &home)) - wait - - Home - home - - - SetVar - x - - - void(*)(Space &home) - c - - -Execute c when x becomes assigned. + - + - - GECODE_SET_EXPORT void - GECODE_SET_EXPORT void Gecode::wait - (Home home, const SetVarArgs &x, void(*c)(Space &home)) - wait - - Home - home - - - const SetVarArgs & - x - - - void(*)(Space &home) - c - - -Execute c when all variables in x become assigned. - - - - - - - + GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::branch - (Home home, const SetVarArgs &x, SetVarBranch vars, SetValBranch vals, SetBranchFilter bf=NULL, SetVarValPrint vvp=NULL) + (Home home, const SetVarArgs &x, SetVarBranch vars, SetValBranch vals, SetBranchFilter bf=nullptr, SetVarValPrint vvp=nullptr) branch - Home + Home home - const SetVarArgs & + const SetVarArgs & x - SetVarBranch + SetVarBranch vars - SetValBranch + SetValBranch vals - SetBranchFilter + SetBranchFilter bf - NULL + nullptr - SetVarValPrint + SetVarValPrint vvp - NULL + nullptr Branch over x with variable selection vars and value selection vals. @@ -23833,38 +24270,38 @@ with Gecode". - + - + GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::branch - (Home home, const SetVarArgs &x, TieBreak< SetVarBranch > vars, SetValBranch vals, SetBranchFilter bf=NULL, SetVarValPrint vvp=NULL) + (Home home, const SetVarArgs &x, TieBreak< SetVarBranch > vars, SetValBranch vals, SetBranchFilter bf=nullptr, SetVarValPrint vvp=nullptr) branch - Home + Home home - const SetVarArgs & + const SetVarArgs & x - TieBreak< SetVarBranch > + TieBreak< SetVarBranch > vars - SetValBranch + SetValBranch vals - SetBranchFilter + SetBranchFilter bf - NULL + nullptr - SetVarValPrint + SetVarValPrint vvp - NULL + nullptr Branch over x with tie-breaking variable selection vars and value selection vals. @@ -23872,29 +24309,29 @@ with Gecode". - + - + GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::branch - (Home home, SetVar x, SetValBranch vals, SetVarValPrint vvp=NULL) + (Home home, SetVar x, SetValBranch vals, SetVarValPrint vvp=nullptr) branch - Home + Home home - SetVar + SetVar x - SetValBranch + SetValBranch vals - SetVarValPrint + SetVarValPrint vvp - NULL + nullptr Branch over x with value selection vals. @@ -23902,34 +24339,34 @@ with Gecode". - + - + GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::assign - (Home home, const SetVarArgs &x, SetAssign vals, SetBranchFilter bf=NULL, SetVarValPrint vvp=NULL) + (Home home, const SetVarArgs &x, SetAssign vals, SetBranchFilter bf=nullptr, SetVarValPrint vvp=nullptr) assign - Home + Home home - const SetVarArgs & + const SetVarArgs & x - SetAssign + SetAssign vals - SetBranchFilter + SetBranchFilter bf - NULL + nullptr - SetVarValPrint + SetVarValPrint vvp - NULL + nullptr Assign all x with value selection vals. @@ -23937,29 +24374,29 @@ with Gecode". - + - + GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::assign - (Home home, SetVar x, SetAssign vals, SetVarValPrint vvp=NULL) + (Home home, SetVar x, SetAssign vals, SetVarValPrint vvp=nullptr) assign - Home + Home home - SetVar + SetVar x - SetAssign + SetAssign vals - SetVarValPrint + SetVarValPrint vvp - NULL + nullptr Assign x with value selection vals. @@ -23967,32 +24404,32 @@ with Gecode". - + - - GECODE_SET_EXPORT SymmetryHandle - GECODE_SET_EXPORT SymmetryHandle Gecode::VariableSymmetry + + Variables in a x are interchangeable GECODE_SET_EXPORT SymmetryHandle + Variables in a x are interchangeable GECODE_SET_EXPORT SymmetryHandle Gecode::VariableSymmetry (const SetVarArgs &x) VariableSymmetry - const SetVarArgs & + const SetVarArgs & x -Variables in x are interchangeable. + - + - - GECODE_SET_EXPORT SymmetryHandle + + GECODE_SET_EXPORT SymmetryHandle GECODE_SET_EXPORT SymmetryHandle Gecode::VariableSequenceSymmetry (const SetVarArgs &x, int ss) VariableSequenceSymmetry - const SetVarArgs & + const SetVarArgs & x @@ -24005,42 +24442,42 @@ with Gecode". The size of x must be a multiple of ss. - + - + GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::branch - (Home home, const SetVarArgs &x, SetVarBranch vars, SetValBranch vals, const Symmetries &syms, SetBranchFilter bf=NULL, SetVarValPrint vvp=NULL) + (Home home, const SetVarArgs &x, SetVarBranch vars, SetValBranch vals, const Symmetries &syms, SetBranchFilter bf=nullptr, SetVarValPrint vvp=nullptr) branch - Home + Home home - const SetVarArgs & + const SetVarArgs & x - SetVarBranch + SetVarBranch vars - SetValBranch + SetValBranch vals - const Symmetries & + const Symmetries & syms - SetBranchFilter + SetBranchFilter bf - NULL + nullptr - SetVarValPrint + SetVarValPrint vvp - NULL + nullptr Branch over x with variable selection vars and value selection vals with symmetry breaking. @@ -24048,42 +24485,42 @@ with Gecode". - + - + GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::branch - (Home home, const SetVarArgs &x, TieBreak< SetVarBranch > vars, SetValBranch vals, const Symmetries &syms, SetBranchFilter bf=NULL, SetVarValPrint vvp=NULL) + (Home home, const SetVarArgs &x, TieBreak< SetVarBranch > vars, SetValBranch vals, const Symmetries &syms, SetBranchFilter bf=nullptr, SetVarValPrint vvp=nullptr) branch - Home + Home home - const SetVarArgs & + const SetVarArgs & x - TieBreak< SetVarBranch > + TieBreak< SetVarBranch > vars - SetValBranch + SetValBranch vals - const Symmetries & + const Symmetries & syms - SetBranchFilter + SetBranchFilter bf - NULL + nullptr - SetVarValPrint + SetVarValPrint vvp - NULL + nullptr Branch over x with tie-breaking variable selection vars and value selection vals with symmetry breaking. @@ -24091,27 +24528,27 @@ with Gecode". - + - + GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::relax (Home home, const SetVarArgs &x, const SetVarArgs &sx, Rnd r, double p) relax - Home + Home home - const SetVarArgs & + const SetVarArgs & x - const SetVarArgs & + const SetVarArgs & sx - Rnd + Rnd r @@ -24124,32 +24561,32 @@ with Gecode". - + - + GECODE_SET_EXPORT void GECODE_SET_EXPORT void Gecode::trace - (Home home, const SetVarArgs &x, TraceFilter tf, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_DONE), SetTracer &t=StdSetTracer::def) + (Home home, const SetVarArgs &x, TraceFilter tf, int te=(TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE), SetTracer &t=StdSetTracer::def) trace - Home + Home home - const SetVarArgs & + const SetVarArgs & x - TraceFilter + TraceFilter tf int te - (TE_INIT|TE_PRUNE|TE_FIX|TE_DONE) + (TE_INIT|TE_PRUNE|TE_FIX|TE_FAIL|TE_DONE) - SetTracer & + SetTracer & t StdSetTracer::def @@ -24159,7 +24596,7 @@ with Gecode". - + @@ -24181,32 +24618,7 @@ with Gecode". - - - - - - class F1 - - - class F2 - - - F1 - F1 Gecode::function_cast - (F2 f) - function_cast - - F2 - f - - -Cast function pointer. - - - - - + @@ -24228,38 +24640,13 @@ with Gecode". - - - - - - class F1 - - - class F2 - - - forceinline F1 - forceinline F1 Gecode::function_cast - (F2 f) - function_cast - - F2 - f - - -Cast function pointer. - - - - - + 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. - + diff --git a/packages/gecode/gecode5_yap.cc b/packages/gecode/gecode5_yap.cc index ee7582f49..8238b8f82 100644 --- a/packages/gecode/gecode5_yap.cc +++ b/packages/gecode/gecode5_yap.cc @@ -156,6 +156,12 @@ extern "C" return * (FloatAssign*) YAP_OpaqueObjectFromTerm(t); } +static inline BoolAssign& + gecode_BoolAssign_from_term(YAP_Term t) + { + return * (BoolAssign*) YAP_OpaqueObjectFromTerm(t); + } + static inline IntAssign& gecode_IntAssign_from_term(YAP_Term t) { @@ -316,6 +322,53 @@ extern "C" cerr << "unsupported INT VAR" << endl; exit(1); } +static YAP_Term gecode_BOOL_VAR_NONE; +static YAP_Term gecode_BOOL_VAR_RND; + // static YAP_Term gecode_BOOL_VAR_MERIT_MIN; + // static YAP_Term gecode_BOOL_VAR_MERIT_MAX; + static YAP_Term gecode_BOOL_VAR_DEGREE_MIN; + static YAP_Term gecode_BOOL_VAR_DEGREE_MAX; + static YAP_Term gecode_BOOL_VAR_MAX_MIN; + static YAP_Term gecode_BOOL_VAR_MAX_MAX; + static YAP_Term gecode_BOOL_VAR_AFC_MIN; + static YAP_Term gecode_BOOL_VAR_AFC_MAX; + static YAP_Term gecode_BOOL_VAR_ACTION_MIN; + static YAP_Term gecode_BOOL_VAR_ACTION_MAX; + static YAP_Term gecode_BOOL_VAR_CHB_MIN; + static YAP_Term gecode_BOOL_VAR_CHB_MAX; + + static inline BoolVarBranch + gecode_BoolVarBranch_from_term(YAP_Term t) + { + if (YAP_IsAtomTerm(t)) { + if ( t == gecode_BOOL_VAR_NONE) + return BOOL_VAR_NONE(); + if ( t == gecode_BOOL_VAR_RND) + return BOOL_VAR_RND(Rnd()); + // if ( t == gecode_BOOL_VAR_MERIT_MIN) + // return BOOL_VAR_MERIT_MIN(); + // if ( t == gecode_BOOL_VAR_MERIT_MAX) + // return BOOL_VAR_MERIT_MAX(); + if ( t == gecode_BOOL_VAR_DEGREE_MIN) + return BOOL_VAR_DEGREE_MIN(); + if ( t == gecode_BOOL_VAR_DEGREE_MAX) + return BOOL_VAR_DEGREE_MAX(); + if ( t == gecode_BOOL_VAR_AFC_MIN) + return BOOL_VAR_AFC_MIN(); + if ( t == gecode_BOOL_VAR_AFC_MAX) + return BOOL_VAR_AFC_MAX(); + if ( t == gecode_BOOL_VAR_ACTION_MIN) + return BOOL_VAR_ACTION_MIN(); + if ( t == gecode_BOOL_VAR_ACTION_MAX) + return BOOL_VAR_ACTION_MAX(); + if ( t == gecode_BOOL_VAR_CHB_MIN) + return BOOL_VAR_CHB_MIN(); + if ( t == gecode_BOOL_VAR_CHB_MAX) + return BOOL_VAR_CHB_MAX(); + } + cerr << "unsupported INT VAR" << endl; exit(1); + } + static YAP_Term gecode_FLOAT_VAR_NONE; static YAP_Term gecode_FLOAT_VAR_DEGREE_MIN; static YAP_Term gecode_FLOAT_VAR_DEGREE_MAX; @@ -325,7 +378,6 @@ extern "C" static YAP_Term gecode_FLOAT_VAR_MAX_MAX; static YAP_Term gecode_FLOAT_VAR_SIZE_MIN; static YAP_Term gecode_FLOAT_VAR_SIZE_MAX; - static YAP_Term gecode_FLOAT_VAR_DEGREE_SIZE_MIN; static YAP_Term gecode_FLOAT_VAR_DEGREE_SIZE_MAX; static inline FloatVarBranch @@ -334,6 +386,7 @@ extern "C" if (YAP_IsAtomTerm(t)) { if ( t == gecode_FLOAT_VAR_SIZE_MIN) return FLOAT_VAR_SIZE_MIN(); + static YAP_Term gecode_FLOAT_VAR_DEGREE_SIZE_MIN; if ( t == gecode_FLOAT_VAR_SIZE_MAX) return FLOAT_VAR_SIZE_MAX(); if ( t == gecode_FLOAT_VAR_NONE) @@ -394,6 +447,31 @@ extern "C" cerr << "unsupported INT VAL" << endl; exit(1); } + static YAP_Term gecode_BOOL_VAL_MIN; + static YAP_Term gecode_BOOL_VAL_MAX; + static YAP_Term gecode_BOOL_VAL_RND; + + static inline BoolValBranch + gecode_BoolValBranch_from_term(YAP_Term t) + { + if (YAP_IsAtomTerm(t)) { + if ( t == gecode_BOOL_VAL_MIN) + return BOOL_VAL_MIN(); + if ( t == gecode_BOOL_VAL_MAX) + return BOOL_VAL_MAX(); + if ( t == gecode_BOOL_VAL_RND) +return BOOL_VAL_RND(Rnd()); + } + cerr << "unsupported BOOL VAL" << endl; exit(1); + } + // + // static inline BoolVal& + // gecode_BoolVal_from_term(YAP_Term t) + // { + // return * (BoolVal*) YAP_OpaqueObjectFromTerm(t); + // } + // + static YAP_Term gecode_FLOAT_VAL_SPLIT_MIN; static YAP_Term gecode_FLOAT_VAL_SPLIT_MAX; @@ -1540,7 +1618,9 @@ extern "C" return * (Reify*) YAP_OpaqueObjectFromTerm(t); } -#define gecode_int_from_term YAP_IntOfTerm + #define gecode_int_from_term YAP_IntOfTerm + + #define gecode_double_from_term YAP_FloatOfTerm #include "gecode_yap_cc_forward_auto_generated.icc" #include "gecode_yap_cc_impl_auto_generated.icc" @@ -1764,7 +1844,13 @@ extern "C" { YAP_Atom X= YAP_LookupAtom("INT_VALUES_MAX"); gecode_INT_VALUES_MAX = YAP_MkAtomTerm(X); YAP_AtomGetHold(X); } - { YAP_Atom X= YAP_LookupAtom("SET_VAR_NONE"); + { YAP_Atom X= YAP_LookupAtom("BOOL_VAL_MIN"); + gecode_BOOL_VAL_MIN = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("BOOL_VAL_RND"); + gecode_BOOL_VAL_RND = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("SET_VAR_NONE"); gecode_SET_VAR_NONE = YAP_MkAtomTerm(X); YAP_AtomGetHold(X); } { YAP_Atom X= YAP_LookupAtom("SET_VAR_DEGREE_MIN"); @@ -1815,6 +1901,44 @@ extern "C" { YAP_Atom X= YAP_LookupAtom("SET_VAL_MAX_EXC"); gecode_SET_VAL_MAX_EXC = YAP_MkAtomTerm(X); YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_NONE"); + gecode_BOOL_VAR_NONE = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_RND"); + gecode_BOOL_VAR_RND = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + // { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_MERIT_MIN"); + // gecode_BOOL_VAR_MERIT_MIN = YAP_MkAtomTerm(X); + // YAP_AtomGetHold(X); } + // { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_MERIT_MAX"); + // gecode_BOOL_VAR_MERIT_MAX = YAP_MkAtomTerm(X); + // YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_DEGREE_MIN"); + gecode_BOOL_VAR_DEGREE_MIN = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_DEGREE_MAX"); + gecode_BOOL_VAR_DEGREE_MAX = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_AFC_MIN"); + gecode_BOOL_VAR_AFC_MIN = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_AFC_MAX"); + gecode_BOOL_VAR_AFC_MAX = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_ACTION_MIN"); + gecode_BOOL_VAR_ACTION_MIN = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_ACTION_MAX"); + gecode_BOOL_VAR_MAX_MAX = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_CHB_MIN"); + gecode_BOOL_VAR_CHB_MIN = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + { YAP_Atom X= YAP_LookupAtom("BOOL_VAR_CHB_MAX"); + gecode_BOOL_VAR_CHB_MAX = YAP_MkAtomTerm(X); + YAP_AtomGetHold(X); } + + { YAP_Atom X= YAP_LookupAtom("FLOAT_VAR_NONE"); gecode_FLOAT_VAR_NONE = YAP_MkAtomTerm(X); YAP_AtomGetHold(X); }