diff --git a/CXX/yapi.cpp b/CXX/yapi.cpp index 6730de468..9f915707f 100644 --- a/CXX/yapi.cpp +++ b/CXX/yapi.cpp @@ -525,11 +525,10 @@ bool YAPEngine::mgoal(Term t, Term tmod, bool release) { q.CurSlot = Yap_StartSlots(); q.p = P; q.cp = CP; - try { + PredEntry *ap; if (IsStringTerm(tmod)) tmod = MkAtomTerm(Yap_LookupAtom(StringOfTerm(tmod))); YAPPredicate *p = new YAPPredicate(t, tmod, ts, "C++"); - PredEntry *ap = nullptr; if (p == nullptr || (ap = p->ap) == nullptr || ap->OpcodeOfPred == UNDEF_OPCODE) { ap = rewriteUndefEngineQuery(ap, t, tmod); @@ -555,11 +554,6 @@ bool YAPEngine::mgoal(Term t, Term tmod, bool release) { // PyEval_RestoreThread(_save); RECOVER_MACHINE_REGS(); return result; - } catch (...) { - YAPCatchError(); - - return false; - } } /** * called when a query must be terminated and its state fully recovered, @@ -722,17 +716,14 @@ PredEntry *YAPQuery::rewriteUndefQuery() { Term ts[2]; ts[0] = CurrentModule; ts[1] = goal; - ARG1 = goal = Yap_SaveTerm(Yap_MkApplTerm(FunctorModule, 2, ts)); + ARG1 = goal = Yap_SaveTerm(Yap_MkApplTerm(FunctorCall + , 1, &goal)); return ap = PredCall; } PredEntry *YAPEngine::rewriteUndefEngineQuery(PredEntry *a, Term &tgoal, Term mod) { - Term ts[2]; - ts[0] = mod; - ts[1] = tgoal; - ARG1 = tgoal = Yap_SaveTerm(Yap_MkApplTerm(FunctorModule, 2, ts)); - // goal = YAPTerm(Yap_MkApplTerm(FunctorMetaCall, 1, &ARG1)); + tgoal = Yap_MkApplTerm(FunctorCall, 1, &tgoal); return PredCall; // return YAPApplTerm(FunctorUndefinedQuery, ts); diff --git a/os/format.c b/os/format.c index e35838c50..35b15264d 100644 --- a/os/format.c +++ b/os/format.c @@ -997,7 +997,7 @@ static Int doformat(volatile Term otail, volatile Term oargs, fstr = NULL; targs = NULL; format_clean_up(sno, sno0, finfo); - return (TRUE); + return true; } static Term memStreamToTerm(int output_stream, Functor f, Term inp) { diff --git a/packages/gecode/dev/extractor/xml/namespaceGecode.xml b/packages/gecode/dev/extractor/xml/namespaceGecode.xml index 399c629d8..29886838e 100644 --- a/packages/gecode/dev/extractor/xml/namespaceGecode.xml +++ b/packages/gecode/dev/extractor/xml/namespaceGecode.xml @@ -1,5 +1,5 @@ - + Gecode Gecode::Action @@ -95,11 +95,9 @@ Gecode::FloatVarArray Gecode::FloatVarBranch Gecode::FreeList - Gecode::GPI Gecode::Group Gecode::Heap Gecode::HeapAllocated - Gecode::HeapChunk Gecode::Home Gecode::IllegalDecay Gecode::InstanceOptions @@ -108,6 +106,8 @@ Gecode::IntArgs Gecode::IntAssign Gecode::IntCHB + Gecode::IntLexMaximizeSpace + Gecode::IntLexMinimizeSpace Gecode::IntMaximizeSpace Gecode::IntMinimizeSpace Gecode::IntSet @@ -131,9 +131,7 @@ Gecode::LocalHandle Gecode::LocalObject Gecode::Matrix - Gecode::MemoryChunk Gecode::MemoryExhausted - Gecode::MemoryManager Gecode::MeritAction Gecode::MeritAFC Gecode::MeritBase @@ -147,6 +145,7 @@ Gecode::MoreThanOneTracer Gecode::NaryOnePropagator Gecode::NaryPropagator + Gecode::NaryWait Gecode::NGL Gecode::NoGoods Gecode::NoIdxVarImpConf @@ -172,6 +171,7 @@ Gecode::region_allocator< void > Gecode::Reify Gecode::Rnd + Gecode::SearchTracer Gecode::SEBs Gecode::SetAction Gecode::SetAFC @@ -192,7 +192,6 @@ Gecode::SharedArray Gecode::SharedData Gecode::SharedHandle - Gecode::SharedMemory Gecode::SizeOptions Gecode::Slice Gecode::Space @@ -207,6 +206,7 @@ Gecode::StdBoolTracer Gecode::StdFloatTracer Gecode::StdIntTracer + Gecode::StdSearchTracer Gecode::StdSetTracer Gecode::StdTracer Gecode::SubscribedPropagators @@ -228,6 +228,7 @@ Gecode::TraceTraits< Set::SetView > Gecode::TupleSet Gecode::UnaryPropagator + Gecode::UnaryWait Gecode::UninitializedAction Gecode::UninitializedAFC Gecode::UninitializedCHB @@ -269,6 +270,7 @@ Gecode::ViewTraceRecorder Gecode::ViewValBrancher Gecode::ViewValNGL + Gecode::CPProfiler Gecode::Driver Gecode::FlatZinc Gecode::Float @@ -276,7 +278,6 @@ Gecode::Int Gecode::Iter Gecode::Kernel - Gecode::MemoryConfig Gecode::MiniModel Gecode::Search Gecode::Set @@ -288,7 +289,8 @@
Events for tracers
- + + ScriptMode SM_SOLUTION @@ -318,15 +320,23 @@ + + SM_CPPROFILER + +Run script with CP-profiler. + + + Different modes for executing scripts. - + - + + RestartMode RM_NONE @@ -369,9 +379,10 @@ - + - + + FloatRelType FRT_EQ @@ -421,9 +432,10 @@ - + - + + ReifyMode RM_EQV @@ -452,9 +464,10 @@ - + - + + IntRelType IRT_EQ @@ -504,9 +517,10 @@ - + - + + BoolOpType BOT_AND @@ -549,9 +563,10 @@ - + - + + IntPropLevel IPL_DEF @@ -584,26 +599,10 @@ Domain propagation - - - IPL_SPEED - = 4 - -Preferences: prefer speed or memory. - -Prefer speed - - - IPL_MEMORY - = 8 - - - -Prefer to save memory IPL_BASIC - = 16 + = 4 Options: basic versus advanced propagation. @@ -611,7 +610,7 @@ IPL_ADVANCED - = 32 + = 8 Use advanced propagation algorithm. @@ -631,9 +630,10 @@ 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 TT_FIXP @@ -662,9 +662,10 @@ - + - + + ExecStatus __ES_SUBSUMED @@ -728,9 +729,10 @@ - + - + + ActorProperty AP_DISPOSE @@ -770,9 +772,10 @@ - + - + + SpaceStatus SS_FAILED @@ -801,9 +804,10 @@ - + - + + TraceEvent TE_INIT @@ -867,9 +871,10 @@ - + - + + SetRelType SRT_EQ @@ -888,21 +893,21 @@ SRT_SUB -Subset ( $\subseteq$) +Subset ( $\subseteq$) SRT_SUP -Superset ( $\supseteq$) +Superset ( $\supseteq$) SRT_DISJ -Disjoint ( $\parallel$) +Disjoint ( $\parallel$) @@ -944,12 +949,13 @@ 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 SOT_UNION @@ -985,7 +991,7 @@ - + @@ -1000,33 +1006,7 @@ - - - - Driver::ScriptBase< Driver::IgnoreStepOption< MinimizeSpace > > - typedef Driver::ScriptBase<Driver::IgnoreStepOption<MinimizeSpace> > Gecode::MinimizeScript - - MinimizeScript - -Base-class for scripts for finding solution of lowest integer cost. - - - - - - - - Driver::ScriptBase< Driver::IgnoreStepOption< MaximizeSpace > > - typedef Driver::ScriptBase<Driver::IgnoreStepOption<MaximizeSpace> > Gecode::MaximizeScript - - MaximizeScript - -Base-class for scripts for finding solution of highest integer cost. - - - - - + Driver::ScriptBase< Driver::IgnoreStepOption< IntMinimizeSpace > > @@ -1039,7 +1019,7 @@ - + Driver::ScriptBase< Driver::IgnoreStepOption< IntMaximizeSpace > > @@ -1052,7 +1032,33 @@ - + + + + Driver::ScriptBase< Driver::IgnoreStepOption< IntLexMinimizeSpace > > + typedef Driver::ScriptBase<Driver::IgnoreStepOption<IntLexMinimizeSpace> > Gecode::IntLexMinimizeScript + + IntLexMinimizeScript + +Base-class for scripts for finding solution of lexically lowest integer costs. + + + + + + + + Driver::ScriptBase< Driver::IgnoreStepOption< IntLexMaximizeSpace > > + typedef Driver::ScriptBase<Driver::IgnoreStepOption<IntLexMaximizeSpace> > Gecode::IntLexMaximizeScript + + IntLexMaximizeScript + +Base-class for scripts for finding solution of lexically highest integer costs. + + + + + double @@ -1065,7 +1071,7 @@ This type defines the interval bounds used for representing floating point values. - + std::function< bool(const Space &home, FloatVar x, int i)> @@ -1078,7 +1084,7 @@ The variable x is considered for selection and i refers to the variable's position in the original array passed to the brancher. - + std::function< double(const Space &home, FloatVar x, int i)> @@ -1091,7 +1097,7 @@ 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. - + std::function< FloatNumBranch(const Space &home, FloatVar x, int i)> @@ -1104,7 +1110,7 @@ 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. - + std::function< void(Space &home, unsigned int a, FloatVar x, int i, FloatNumBranch nl)> @@ -1117,7 +1123,7 @@ 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. - + std::function< void(const Space &home, const Brancher &b, unsigned int a, FloatVar x, int i, const FloatNumBranch &n, std::ostream &o)> @@ -1130,7 +1136,7 @@ - + ViewTracer< Float::FloatView > @@ -1143,7 +1149,7 @@ - + ViewTraceRecorder< Float::FloatView > @@ -1156,7 +1162,7 @@ - + ArgArray< Int::LDSB::Literal > @@ -1169,7 +1175,7 @@ - + ArgArray< IntSet > @@ -1182,7 +1188,7 @@ - + PrimArgArray< TaskType > @@ -1195,7 +1201,7 @@ - + SharedArray< int > @@ -1208,7 +1214,7 @@ - + std::function< bool(const Space &home, IntVar x, int i)> @@ -1221,7 +1227,7 @@ The variable x is considered for selection and i refers to the variable's position in the original array passed to the brancher. - + std::function< bool(const Space &home, BoolVar x, int i)> @@ -1234,7 +1240,7 @@ The variable x is considered for selection and i refers to the variable's position in the original array passed to the brancher. - + std::function< double(const Space &home, IntVar x, int i)> @@ -1247,7 +1253,7 @@ 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. - + std::function< double(const Space &home, BoolVar x, int i)> @@ -1260,7 +1266,7 @@ 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. - + std::function< int(const Space &home, IntVar x, int i)> @@ -1273,7 +1279,7 @@ 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. - + std::function< int(const Space &home, BoolVar x, int i)> @@ -1286,7 +1292,7 @@ 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. - + std::function< void(Space &home, unsigned int a, IntVar x, int i, int n)> @@ -1299,7 +1305,7 @@ 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. - + std::function< void(Space &home, unsigned int a, BoolVar x, int i, int n)> @@ -1312,7 +1318,7 @@ 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. - + std::function< void(const Space &home, const Brancher &b, unsigned int a, IntVar x, int i, const int &n, std::ostream &o)> @@ -1325,7 +1331,7 @@ - + std::function< void(const Space &home, const Brancher &b, unsigned int a, BoolVar x, int i, const int &n, std::ostream &o)> @@ -1338,7 +1344,7 @@ - + ViewTracer< Int::IntView > @@ -1351,7 +1357,7 @@ - + ViewTraceRecorder< Int::IntView > @@ -1364,7 +1370,7 @@ - + ViewTracer< Int::BoolView > @@ -1377,7 +1383,7 @@ - + ViewTraceRecorder< Int::BoolView > @@ -1390,7 +1396,46 @@ - + + + + + + class Var + + + 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. + + + + + + + + + + class Var + + + class Val + + + 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. + + + + + std::function< double(const Space &home, double w, double b)> @@ -1403,33 +1448,7 @@ 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 @@ -1442,7 +1461,7 @@ - + int @@ -1455,7 +1474,7 @@ - + int @@ -1468,33 +1487,7 @@ 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 - typedef IntMinimizeSpace Gecode::MinimizeSpace - - MinimizeSpace - -Class for minimizing integer cost. - -DeprecatedUse IntMinimizeSpace instead. - - - - - - IntMaximizeSpace - typedef IntMaximizeSpace Gecode::MaximizeSpace - - MaximizeSpace - -Class for maximizing integer cost. - -DeprecatedUse IntMaximizeSpace instead. - - - + Search::Builder * @@ -1507,7 +1500,7 @@ - + std::function< bool(const Space &home, SetVar x, int i)> @@ -1520,7 +1513,7 @@ The variable x is considered for selection and i refers to the variable's position in the original array passed to the brancher. - + std::function< double(const Space &home, SetVar x, int i)> @@ -1533,7 +1526,7 @@ 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. - + std::function< int(const Space &home, SetVar x, int i)> @@ -1546,7 +1539,7 @@ 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. - + std::function< void(Space &home, unsigned int a, SetVar x, int i, int n)> @@ -1559,7 +1552,7 @@ 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. - + ViewTracer< Set::SetView > @@ -1572,7 +1565,7 @@ - + ViewTraceRecorder< Set::SetView > @@ -1585,7 +1578,7 @@ - + @@ -1600,7 +1593,7 @@ - + const ModEvent @@ -1614,7 +1607,7 @@ - + const ModEvent @@ -1628,7 +1621,7 @@ - + const ModEvent @@ -1642,7 +1635,7 @@ - + const PropCond @@ -1656,7 +1649,7 @@ - + const PropCond @@ -1670,7 +1663,7 @@ - + Post propagator for SetVar @@ -1683,7 +1676,7 @@ - + Post propagator for SetVar SetOpType @@ -1696,7 +1689,7 @@ - + Post propagator for SetVar SetOpType SetVar @@ -1712,7 +1705,7 @@ - + Post propagator for SetVar SetOpType SetVar SetRelType @@ -1725,7 +1718,7 @@ - + Post propagator for SetVar SetOpType SetVar SetRelType SetVar @@ -1738,7 +1731,7 @@ - + GECODE_SUPPORT_EXPORT Heap @@ -1751,7 +1744,7 @@ - + @@ -1769,7 +1762,7 @@ - + FloatAssign @@ -1785,7 +1778,7 @@ - + FloatAssign @@ -1802,7 +1795,7 @@ - + FloatAssign @@ -1824,7 +1817,7 @@ 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 & @@ -1845,7 +1838,7 @@ - + forceinline Archive & @@ -1866,7 +1859,7 @@ - + FloatValBranch @@ -1882,7 +1875,7 @@ - + FloatValBranch @@ -1898,7 +1891,7 @@ - + FloatValBranch @@ -1915,7 +1908,7 @@ - + FloatValBranch @@ -1937,7 +1930,7 @@ 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 @@ -1953,7 +1946,7 @@ - + FloatVarBranch @@ -1974,7 +1967,7 @@ - + FloatVarBranch @@ -1995,7 +1988,7 @@ - + FloatVarBranch @@ -2012,7 +2005,7 @@ - + FloatVarBranch @@ -2029,7 +2022,7 @@ - + FloatVarBranch @@ -2046,7 +2039,7 @@ - + FloatVarBranch @@ -2067,7 +2060,7 @@ - + FloatVarBranch @@ -2088,7 +2081,7 @@ - + FloatVarBranch @@ -2109,7 +2102,7 @@ - + FloatVarBranch @@ -2130,7 +2123,7 @@ - + FloatVarBranch @@ -2151,7 +2144,7 @@ - + FloatVarBranch @@ -2172,7 +2165,7 @@ - + FloatVarBranch @@ -2193,7 +2186,7 @@ - + FloatVarBranch @@ -2214,7 +2207,7 @@ - + FloatVarBranch @@ -2231,7 +2224,7 @@ - + FloatVarBranch @@ -2252,7 +2245,7 @@ - + FloatVarBranch @@ -2269,7 +2262,7 @@ - + FloatVarBranch @@ -2290,7 +2283,7 @@ - + FloatVarBranch @@ -2307,7 +2300,7 @@ - + FloatVarBranch @@ -2324,7 +2317,7 @@ - + FloatVarBranch @@ -2341,7 +2334,7 @@ - + FloatVarBranch @@ -2358,7 +2351,7 @@ - + FloatVarBranch @@ -2375,7 +2368,7 @@ - + FloatVarBranch @@ -2392,7 +2385,7 @@ - + FloatVarBranch @@ -2409,7 +2402,7 @@ - + FloatVarBranch @@ -2426,7 +2419,7 @@ - + FloatVarBranch @@ -2447,7 +2440,7 @@ - + FloatVarBranch @@ -2468,7 +2461,7 @@ - + FloatVarBranch @@ -2489,7 +2482,7 @@ - + FloatVarBranch @@ -2510,7 +2503,7 @@ - + FloatVarBranch @@ -2531,7 +2524,7 @@ - + FloatVarBranch @@ -2552,7 +2545,7 @@ - + FloatVarBranch @@ -2573,7 +2566,7 @@ - + FloatVarBranch @@ -2594,7 +2587,7 @@ - + FloatVarBranch @@ -2611,7 +2604,7 @@ - + FloatVarBranch @@ -2632,7 +2625,7 @@ - + FloatVarBranch @@ -2649,7 +2642,7 @@ - + FloatVarBranch @@ -2670,7 +2663,7 @@ - + void @@ -2695,7 +2688,7 @@ - + void @@ -2720,7 +2713,7 @@ - + forceinline FloatNum @@ -2736,7 +2729,7 @@ - + forceinline FloatNum @@ -2752,7 +2745,7 @@ - + forceinline FloatNum @@ -2768,7 +2761,7 @@ - + forceinline FloatNum @@ -2784,7 +2777,7 @@ - + forceinline FloatNum @@ -2800,7 +2793,7 @@ - + forceinline FloatNum @@ -2816,7 +2809,7 @@ - + void @@ -2845,7 +2838,7 @@ - + forceinline FloatVal @@ -2862,7 +2855,7 @@ - + forceinline FloatVal @@ -2879,7 +2872,7 @@ - + forceinline FloatVal @@ -2900,7 +2893,7 @@ - + forceinline FloatVal @@ -2921,7 +2914,7 @@ - + forceinline FloatVal @@ -2942,7 +2935,7 @@ - + forceinline FloatVal @@ -2963,7 +2956,7 @@ - + forceinline FloatVal @@ -2984,7 +2977,7 @@ - + forceinline FloatVal @@ -3005,7 +2998,7 @@ - + forceinline FloatVal @@ -3026,7 +3019,7 @@ - + forceinline FloatVal @@ -3047,7 +3040,7 @@ - + forceinline FloatVal @@ -3068,7 +3061,7 @@ - + forceinline FloatVal @@ -3089,7 +3082,7 @@ - + forceinline FloatVal @@ -3110,7 +3103,7 @@ - + forceinline FloatVal @@ -3131,7 +3124,7 @@ - + bool @@ -3152,7 +3145,7 @@ - + bool @@ -3173,7 +3166,7 @@ - + bool @@ -3194,7 +3187,7 @@ - + bool @@ -3215,7 +3208,7 @@ - + bool @@ -3236,7 +3229,7 @@ - + bool @@ -3257,7 +3250,7 @@ - + bool @@ -3278,7 +3271,7 @@ - + bool @@ -3299,7 +3292,7 @@ - + bool @@ -3320,7 +3313,7 @@ - + bool @@ -3341,7 +3334,7 @@ - + bool @@ -3362,7 +3355,7 @@ - + bool @@ -3383,7 +3376,7 @@ - + forceinline bool @@ -3404,7 +3397,7 @@ - + forceinline bool @@ -3425,7 +3418,7 @@ - + forceinline bool @@ -3446,7 +3439,7 @@ - + forceinline bool @@ -3467,7 +3460,7 @@ - + forceinline bool @@ -3488,7 +3481,7 @@ - + forceinline bool @@ -3509,7 +3502,7 @@ - + @@ -3538,7 +3531,7 @@ - + forceinline FloatVal @@ -3555,7 +3548,7 @@ - + forceinline FloatVal @@ -3572,7 +3565,7 @@ - + forceinline FloatVal @@ -3589,7 +3582,7 @@ - + forceinline FloatVal @@ -3610,7 +3603,7 @@ - + forceinline FloatVal @@ -3631,7 +3624,7 @@ - + forceinline FloatVal @@ -3652,7 +3645,7 @@ - + forceinline FloatVal @@ -3673,7 +3666,7 @@ - + forceinline FloatVal @@ -3694,7 +3687,7 @@ - + forceinline FloatVal @@ -3715,7 +3708,7 @@ - + forceinline FloatVal @@ -3736,7 +3729,7 @@ - + forceinline FloatVal @@ -3757,7 +3750,7 @@ - + @@ -3786,7 +3779,7 @@ - + GECODE_FLOAT_EXPORT void @@ -3811,7 +3804,7 @@ - + GECODE_FLOAT_EXPORT void @@ -3836,7 +3829,7 @@ - + GECODE_FLOAT_EXPORT void @@ -3865,7 +3858,7 @@ - + GECODE_FLOAT_EXPORT void @@ -3894,7 +3887,7 @@ - + GECODE_FLOAT_EXPORT void @@ -3923,7 +3916,7 @@ - + GECODE_FLOAT_EXPORT void @@ -3956,7 +3949,7 @@ - + GECODE_FLOAT_EXPORT void @@ -3981,7 +3974,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4006,7 +3999,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4035,7 +4028,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4064,7 +4057,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4097,7 +4090,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4130,7 +4123,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4159,7 +4152,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4188,7 +4181,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4221,7 +4214,7 @@ Posts propagator for $ z = b ? x : y $ - + GECODE_FLOAT_EXPORT void @@ -4250,7 +4243,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4275,7 +4268,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4304,7 +4297,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4329,7 +4322,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4354,7 +4347,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4383,7 +4376,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4408,7 +4401,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4433,7 +4426,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4462,7 +4455,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4491,7 +4484,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4520,7 +4513,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4546,10 +4539,14 @@ Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{frt} c$. - + +Throws an exception of type Float::OutOfLimits, if the variables, coefficients, or c exceed the limits as defined in Float::Limits. +Throws an exception of type Float::ValueMixedSign, if a coefficient has mixed signs (that is, the lower bound is strictly negative and the upper bound is strictly positive). + + - + GECODE_FLOAT_EXPORT void @@ -4575,10 +4572,14 @@ Post propagator for $\sum_{i=0}^{|x|-1}x_i\sim_{frt} y$. - + +Throws an exception of type Float::OutOfLimits, if the variables, coefficients, or c exceed the limits as defined in Float::Limits. +Throws an exception of type Float::ValueMixedSign, if a coefficient has mixed signs (that is, the lower bound is strictly negative and the upper bound is strictly positive). + + - + GECODE_FLOAT_EXPORT void @@ -4608,10 +4609,14 @@ Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{frt} c\right)\equiv r$. - + +Throws an exception of type Float::OutOfLimits, if the variables, coefficients, or c exceed the limits as defined in Float::Limits. +Throws an exception of type Float::ValueMixedSign, if a coefficient has mixed signs (that is, the lower bound is strictly negative and the upper bound is strictly positive). + + - + GECODE_FLOAT_EXPORT void @@ -4641,10 +4646,14 @@ Post propagator for $\left(\sum_{i=0}^{|x|-1}x_i\sim_{frt} y\right)\equiv r$. - + +Throws an exception of type Float::OutOfLimits, if the variables, coefficients, or c exceed the limits as defined in Float::Limits. +Throws an exception of type Float::ValueMixedSign, if a coefficient has mixed signs (that is, the lower bound is strictly negative and the upper bound is strictly positive). + + - + GECODE_FLOAT_EXPORT void @@ -4674,10 +4683,15 @@ 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. + +Throws an exception of type Float::ArgumentSizeMismatch, if a and x are of different size. +Throws an exception of type Float::OutOfLimits, if the variables, coefficients, or c exceed the limits as defined in Float::Limits. +Throws an exception of type Float::ValueMixedSign, if a coefficient has mixed signs (that is, the lower bound is strictly negative and the upper bound is strictly positive). + + - + GECODE_FLOAT_EXPORT void @@ -4707,10 +4721,15 @@ 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. + +Throws an exception of type Float::ArgumentSizeMismatch, if a and x are of different size. +Throws an exception of type Float::OutOfLimits, if the variables, coefficients, or c exceed the limits as defined in Float::Limits. +Throws an exception of type Float::ValueMixedSign, if a coefficient has mixed signs (that is, the lower bound is strictly negative and the upper bound is strictly positive). + + - + GECODE_FLOAT_EXPORT void @@ -4744,10 +4763,15 @@ 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. + +Throws an exception of type Float::ArgumentSizeMismatch, if a and x are of different size. +Throws an exception of type Float::OutOfLimits, if the variables, coefficients, or c exceed the limits as defined in Float::Limits. +Throws an exception of type Float::ValueMixedSign, if a coefficient has mixed signs (that is, the lower bound is strictly negative and the upper bound is strictly positive). + + - + GECODE_FLOAT_EXPORT void @@ -4781,10 +4805,15 @@ 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. + +Throws an exception of type Float::ArgumentSizeMismatch, if a and x are of different size. +Throws an exception of type Float::OutOfLimits, if the variables, coefficients, or c exceed the limits as defined in Float::Limits. +Throws an exception of type Float::ValueMixedSign, if a coefficient has mixed signs (that is, the lower bound is strictly negative and the upper bound is strictly positive). + + - + GECODE_FLOAT_EXPORT void @@ -4809,7 +4838,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4834,7 +4863,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4859,7 +4888,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4884,7 +4913,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4923,7 +4952,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4962,7 +4991,7 @@ - + GECODE_FLOAT_EXPORT void @@ -4992,7 +5021,7 @@ - + GECODE_FLOAT_EXPORT void @@ -5027,7 +5056,7 @@ - + GECODE_FLOAT_EXPORT void @@ -5057,7 +5086,7 @@ - + GECODE_FLOAT_EXPORT void @@ -5090,7 +5119,7 @@ - + GECODE_FLOAT_EXPORT void @@ -5125,7 +5154,7 @@ - + IntAssign @@ -5141,7 +5170,7 @@ - + IntAssign @@ -5157,7 +5186,7 @@ - + IntAssign @@ -5173,7 +5202,7 @@ - + IntAssign @@ -5190,7 +5219,7 @@ - + IntAssign @@ -5212,7 +5241,7 @@ Uses a commit function as default that posts the constraint that a variable x must be equal to the value n. - + BoolAssign @@ -5228,7 +5257,7 @@ - + BoolAssign @@ -5244,7 +5273,7 @@ - + BoolAssign @@ -5261,7 +5290,7 @@ - + BoolAssign @@ -5283,7 +5312,7 @@ Uses a commit function as default that posts the constraint that a variable x must be equal to the value n. - + IntValBranch @@ -5299,7 +5328,7 @@ - + IntValBranch @@ -5315,7 +5344,7 @@ - + IntValBranch @@ -5331,7 +5360,7 @@ - + IntValBranch @@ -5348,7 +5377,7 @@ - + IntValBranch @@ -5364,7 +5393,7 @@ - + IntValBranch @@ -5380,7 +5409,7 @@ - + IntValBranch @@ -5396,7 +5425,7 @@ - + IntValBranch @@ -5412,7 +5441,7 @@ - + IntValBranch @@ -5433,7 +5462,7 @@ - + IntValBranch @@ -5449,7 +5478,7 @@ - + IntValBranch @@ -5465,7 +5494,7 @@ - + BoolValBranch @@ -5481,7 +5510,7 @@ - + BoolValBranch @@ -5497,7 +5526,7 @@ - + BoolValBranch @@ -5514,7 +5543,7 @@ - + BoolValBranch @@ -5535,7 +5564,7 @@ - + IntVarBranch @@ -5551,7 +5580,7 @@ - + IntVarBranch @@ -5568,7 +5597,7 @@ - + IntVarBranch @@ -5589,7 +5618,7 @@ - + IntVarBranch @@ -5610,7 +5639,7 @@ - + IntVarBranch @@ -5627,7 +5656,7 @@ - + IntVarBranch @@ -5644,7 +5673,7 @@ - + IntVarBranch @@ -5665,7 +5694,7 @@ - + IntVarBranch @@ -5686,7 +5715,7 @@ - + IntVarBranch @@ -5707,7 +5736,7 @@ - + IntVarBranch @@ -5728,7 +5757,7 @@ - + IntVarBranch @@ -5749,7 +5778,7 @@ - + IntVarBranch @@ -5770,7 +5799,7 @@ - + IntVarBranch @@ -5791,7 +5820,7 @@ - + IntVarBranch @@ -5812,7 +5841,7 @@ - + IntVarBranch @@ -5833,7 +5862,7 @@ - + IntVarBranch @@ -5850,7 +5879,7 @@ - + IntVarBranch @@ -5871,7 +5900,7 @@ - + IntVarBranch @@ -5888,7 +5917,7 @@ - + IntVarBranch @@ -5905,7 +5934,7 @@ - + IntVarBranch @@ -5922,7 +5951,7 @@ - + IntVarBranch @@ -5939,7 +5968,7 @@ - + IntVarBranch @@ -5956,7 +5985,7 @@ - + IntVarBranch @@ -5973,7 +6002,7 @@ - + IntVarBranch @@ -5990,7 +6019,7 @@ - + IntVarBranch @@ -6007,7 +6036,7 @@ - + IntVarBranch @@ -6024,7 +6053,7 @@ - + IntVarBranch @@ -6045,7 +6074,7 @@ - + IntVarBranch @@ -6066,7 +6095,7 @@ - + IntVarBranch @@ -6087,7 +6116,7 @@ - + IntVarBranch @@ -6108,7 +6137,7 @@ - + IntVarBranch @@ -6129,7 +6158,7 @@ - + IntVarBranch @@ -6150,7 +6179,7 @@ - + IntVarBranch @@ -6171,7 +6200,7 @@ - + IntVarBranch @@ -6192,7 +6221,7 @@ - + IntVarBranch @@ -6213,7 +6242,7 @@ - + IntVarBranch @@ -6230,7 +6259,7 @@ - + IntVarBranch @@ -6251,7 +6280,7 @@ - + IntVarBranch @@ -6268,7 +6297,7 @@ - + IntVarBranch @@ -6286,7 +6315,7 @@ The min-regret of a variable is the difference between the smallest and second-smallest value still in the domain. - + IntVarBranch @@ -6304,7 +6333,7 @@ The min-regret of a variable is the difference between the smallest and second-smallest value still in the domain. - + IntVarBranch @@ -6322,7 +6351,7 @@ The max-regret of a variable is the difference between the largest and second-largest value still in the domain. - + IntVarBranch @@ -6340,7 +6369,7 @@ The max-regret of a variable is the difference between the largest and second-largest value still in the domain. - + BoolVarBranch @@ -6356,7 +6385,7 @@ - + BoolVarBranch @@ -6373,7 +6402,7 @@ - + BoolVarBranch @@ -6394,7 +6423,7 @@ - + BoolVarBranch @@ -6415,7 +6444,7 @@ - + BoolVarBranch @@ -6432,7 +6461,7 @@ - + BoolVarBranch @@ -6449,7 +6478,7 @@ - + BoolVarBranch @@ -6470,7 +6499,7 @@ - + BoolVarBranch @@ -6491,7 +6520,7 @@ - + BoolVarBranch @@ -6512,7 +6541,7 @@ - + BoolVarBranch @@ -6533,7 +6562,7 @@ - + BoolVarBranch @@ -6554,7 +6583,7 @@ - + BoolVarBranch @@ -6575,7 +6604,7 @@ - + BoolVarBranch @@ -6596,7 +6625,7 @@ - + BoolVarBranch @@ -6617,7 +6646,7 @@ - + BoolVarBranch @@ -6638,7 +6667,7 @@ - + BoolVarBranch @@ -6655,7 +6684,7 @@ - + BoolVarBranch @@ -6676,7 +6705,7 @@ - + BoolVarBranch @@ -6693,7 +6722,7 @@ - + forceinline void @@ -6722,7 +6751,7 @@ - + @@ -6751,9 +6780,9 @@ - + - + class Char @@ -6761,9 +6790,6 @@ class Traits - - class T - std::basic_ostream< Char, Traits > & std::basic_ostream<Char,Traits>& Gecode::operator<< @@ -6783,7 +6809,7 @@ - + @@ -6812,7 +6838,7 @@ - + forceinline IntPropLevel @@ -6829,24 +6855,7 @@ - - - - forceinline IntPropLevel - IntPropLevel Gecode::sm - (IntPropLevel ipl) - sm - - IntPropLevel - ipl - - -Extract speed or memory from propagation level. - - - - - + forceinline IntPropLevel @@ -6863,7 +6872,7 @@ - + forceinline IntRelType @@ -6880,7 +6889,7 @@ - + forceinline IntRelType @@ -6897,7 +6906,7 @@ - + forceinline Reify @@ -6914,7 +6923,7 @@ - + forceinline Reify @@ -6931,7 +6940,7 @@ - + forceinline Reify @@ -6948,7 +6957,7 @@ - + void @@ -6977,7 +6986,7 @@ - + void @@ -7006,7 +7015,7 @@ - + @@ -7035,7 +7044,7 @@ - + @@ -7064,7 +7073,7 @@ - + GECODE_INT_EXPORT void @@ -7094,7 +7103,7 @@ - + GECODE_INT_EXPORT void @@ -7124,7 +7133,7 @@ - + GECODE_INT_EXPORT void @@ -7158,7 +7167,7 @@ - + GECODE_INT_EXPORT void @@ -7192,7 +7201,7 @@ - + GECODE_INT_EXPORT void @@ -7222,7 +7231,7 @@ - + GECODE_INT_EXPORT void @@ -7252,7 +7261,7 @@ - + GECODE_INT_EXPORT void @@ -7286,7 +7295,7 @@ - + GECODE_INT_EXPORT void @@ -7324,7 +7333,7 @@ - + GECODE_INT_EXPORT void @@ -7358,7 +7367,7 @@ - + GECODE_INT_EXPORT void @@ -7388,7 +7397,7 @@ - + GECODE_INT_EXPORT void @@ -7418,7 +7427,7 @@ - + GECODE_INT_EXPORT void @@ -7448,7 +7457,7 @@ - + GECODE_INT_EXPORT void @@ -7478,7 +7487,7 @@ - + GECODE_INT_EXPORT void @@ -7512,7 +7521,7 @@ Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -7546,7 +7555,7 @@ Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -7580,7 +7589,7 @@ - + GECODE_INT_EXPORT void @@ -7614,7 +7623,7 @@ - + GECODE_INT_EXPORT void @@ -7652,7 +7661,7 @@ Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -7690,7 +7699,7 @@ Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -7722,7 +7731,7 @@ - + GECODE_INT_EXPORT void @@ -7756,7 +7765,7 @@ 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 @@ -7790,7 +7799,7 @@ 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 @@ -7824,7 +7833,7 @@ 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 @@ -7858,7 +7867,7 @@ - + GECODE_INT_EXPORT void @@ -7896,7 +7905,7 @@ - + GECODE_INT_EXPORT void @@ -7930,7 +7939,7 @@ - + GECODE_INT_EXPORT void @@ -7964,7 +7973,7 @@ Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1. - + GECODE_INT_EXPORT void @@ -8002,7 +8011,7 @@ Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1. - + GECODE_INT_EXPORT void @@ -8036,7 +8045,7 @@ Throws an exception of type Int::NotZeroOne, if n is neither 0 or 1. - + GECODE_INT_EXPORT void @@ -8070,7 +8079,7 @@ 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 @@ -8104,7 +8113,7 @@ 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 @@ -8138,7 +8147,7 @@ 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 @@ -8170,7 +8179,7 @@ - + GECODE_INT_EXPORT void @@ -8208,7 +8217,7 @@ Posts propagator for $ x_0 \diamond_{\mathit{o}} x_1 = x_2$ - + GECODE_INT_EXPORT void @@ -8246,7 +8255,7 @@ 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 @@ -8280,7 +8289,7 @@ 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 @@ -8314,7 +8323,7 @@ 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 @@ -8352,7 +8361,7 @@ 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 @@ -8390,7 +8399,7 @@ 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 @@ -8428,7 +8437,7 @@ Posts propagator for $ z = b ? x : y $Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -8466,7 +8475,7 @@ Posts propagator for $ z = b ? x : y $ - + GECODE_INT_EXPORT void @@ -8499,7 +8508,7 @@ 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 @@ -8528,7 +8537,7 @@ 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 @@ -8558,7 +8567,7 @@ - + GECODE_INT_EXPORT void @@ -8588,7 +8597,7 @@ - + GECODE_INT_EXPORT void @@ -8622,7 +8631,7 @@ - + GECODE_INT_EXPORT void @@ -8656,7 +8665,7 @@ - + GECODE_INT_EXPORT void @@ -8690,7 +8699,7 @@ Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits. - + GECODE_INT_EXPORT void @@ -8724,7 +8733,7 @@ Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits. - + GECODE_INT_EXPORT void @@ -8758,7 +8767,7 @@ Throws an exception of type Int::OutOfLimits, if the integers in n exceed the limits in Int::Limits. - + GECODE_INT_EXPORT void @@ -8792,7 +8801,7 @@ Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -8826,7 +8835,7 @@ Supports both bounds (ipl = IPL_BND) and domain consistency (ipl = IPL_DOM, default). - + GECODE_INT_EXPORT void @@ -8860,7 +8869,7 @@ - + GECODE_INT_EXPORT void @@ -8894,7 +8903,7 @@ - + GECODE_INT_EXPORT void @@ -8940,7 +8949,7 @@ 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 @@ -8986,7 +8995,7 @@ 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 @@ -9032,7 +9041,7 @@ 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 @@ -9078,7 +9087,7 @@ 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 @@ -9104,7 +9113,7 @@ 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 @@ -9140,7 +9149,7 @@ - + GECODE_INT_EXPORT void @@ -9176,7 +9185,7 @@ - + GECODE_INT_EXPORT void @@ -9211,7 +9220,7 @@ - + GECODE_INT_EXPORT void @@ -9246,7 +9255,7 @@ - + GECODE_INT_EXPORT void @@ -9290,7 +9299,7 @@ - + GECODE_INT_EXPORT void @@ -9320,7 +9329,7 @@ - + GECODE_INT_EXPORT void @@ -9355,7 +9364,7 @@ Throws an exception of type Int::ArgumentSame, if x contains the same unassigned variable multiply. - + GECODE_INT_EXPORT void @@ -9387,7 +9396,7 @@ - + GECODE_INT_EXPORT void @@ -9423,7 +9432,7 @@ - + GECODE_INT_EXPORT void @@ -9461,7 +9470,7 @@ Performs domain propagation but is not domain consistent. - + GECODE_INT_EXPORT void @@ -9499,7 +9508,7 @@ Performs domain propagation but is not domain consistent. - + GECODE_INT_EXPORT void @@ -9537,7 +9546,7 @@ 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 @@ -9575,7 +9584,7 @@ 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 @@ -9613,7 +9622,7 @@ Performs domain propagation but is not domain consistent. - + GECODE_INT_EXPORT void @@ -9651,7 +9660,7 @@ Performs domain propagation but is not domain consistent. - + GECODE_INT_EXPORT void @@ -9689,7 +9698,7 @@ 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 @@ -9727,7 +9736,7 @@ 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 @@ -9757,7 +9766,7 @@ 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 @@ -9787,7 +9796,7 @@ 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 @@ -9821,7 +9830,7 @@ 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 @@ -9855,7 +9864,7 @@ 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 @@ -9889,7 +9898,7 @@ 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 @@ -9923,7 +9932,7 @@ - + GECODE_INT_EXPORT void @@ -9957,7 +9966,7 @@ - + GECODE_INT_EXPORT void @@ -9991,7 +10000,7 @@ - + GECODE_INT_EXPORT void @@ -10025,7 +10034,7 @@ - + GECODE_INT_EXPORT void @@ -10069,7 +10078,7 @@ - + GECODE_INT_EXPORT void @@ -10113,7 +10122,7 @@ - + GECODE_INT_EXPORT void @@ -10143,7 +10152,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 @@ -10173,7 +10182,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 @@ -10201,16 +10210,14 @@ 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). Supports domain consistency (ipl = IPL_DOM, default) only. 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. +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). - + GECODE_INT_EXPORT void @@ -10238,7 +10245,6 @@ 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). Supports domain consistency (ipl = IPL_DOM, default) only. 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. @@ -10246,7 +10252,7 @@ - + GECODE_INT_EXPORT void @@ -10280,7 +10286,7 @@ Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM). - + GECODE_INT_EXPORT void @@ -10310,7 +10316,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 @@ -10344,7 +10350,7 @@ Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM). - + GECODE_INT_EXPORT void @@ -10374,7 +10380,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 @@ -10404,12 +10410,12 @@ 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 @@ -10443,12 +10449,12 @@ 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 @@ -10478,12 +10484,12 @@ 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 @@ -10517,12 +10523,12 @@ 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 @@ -10552,7 +10558,7 @@ Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM). - + GECODE_INT_EXPORT void @@ -10586,7 +10592,7 @@ Supports both bounds consistency (ipl = IPL_BND, default) and domain consistency (ipl = IPL_DOM). - + GECODE_INT_EXPORT void @@ -10619,12 +10625,12 @@ 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 @@ -10658,7 +10664,7 @@ Supports bounds consistency (ipl = IPL_BND, default). - + GECODE_INT_EXPORT void @@ -10687,12 +10693,12 @@ 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 @@ -10717,12 +10723,12 @@ 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 @@ -10747,12 +10753,12 @@ 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 @@ -10781,12 +10787,12 @@ 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 @@ -10815,12 +10821,12 @@ 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 @@ -10849,12 +10855,12 @@ 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 @@ -10883,12 +10889,12 @@ 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 @@ -10921,12 +10927,12 @@ 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 @@ -10959,12 +10965,12 @@ 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 @@ -11002,7 +11008,7 @@ Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_INT_EXPORT void @@ -11035,12 +11041,12 @@ 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 @@ -11077,12 +11083,12 @@ 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 @@ -11119,12 +11125,12 @@ 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 @@ -11153,12 +11159,12 @@ 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 @@ -11191,12 +11197,12 @@ 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 @@ -11225,12 +11231,12 @@ 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 @@ -11263,12 +11269,12 @@ 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 @@ -11306,7 +11312,7 @@ Throws an exception of type Int::ArgumentSizeMismatch, if a and x are of different size. - + GECODE_INT_EXPORT void @@ -11343,12 +11349,12 @@ 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 @@ -11381,12 +11387,12 @@ 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 @@ -11423,12 +11429,12 @@ 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 @@ -11459,12 +11465,12 @@ 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 @@ -11506,7 +11512,7 @@ - + GECODE_INT_EXPORT void @@ -11546,7 +11552,7 @@ - + GECODE_INT_EXPORT void @@ -11590,7 +11596,7 @@ - + GECODE_INT_EXPORT void @@ -11633,12 +11639,12 @@ 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 @@ -11685,12 +11691,12 @@ 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 @@ -11738,7 +11744,7 @@ 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 @@ -11750,42 +11756,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 $ @@ -11820,7 +11826,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11868,7 +11874,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -11880,42 +11886,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 $ @@ -11950,7 +11956,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -11998,7 +12004,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -12010,42 +12016,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 $ @@ -12080,7 +12086,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12128,7 +12134,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -12140,42 +12146,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 $ @@ -12210,7 +12216,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12258,7 +12264,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -12270,42 +12276,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 $ @@ -12340,7 +12346,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12388,7 +12394,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -12400,42 +12406,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 $ @@ -12470,7 +12476,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12518,7 +12524,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -12530,42 +12536,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 $ @@ -12600,7 +12606,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12648,7 +12654,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -12660,42 +12666,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 $ @@ -12730,7 +12736,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12764,7 +12770,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12802,7 +12808,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12842,7 +12848,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12886,7 +12892,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -12917,12 +12923,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -12959,10 +12965,10 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13010,7 +13016,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -13058,7 +13064,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -13110,7 +13116,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -13162,7 +13168,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -13204,7 +13210,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -13246,7 +13252,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -13292,7 +13298,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -13338,7 +13344,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -13377,14 +13383,14 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13423,14 +13429,14 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13473,14 +13479,14 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13523,14 +13529,14 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13553,12 +13559,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13585,12 +13591,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13625,12 +13631,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13669,12 +13675,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13705,12 +13711,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13745,12 +13751,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13781,12 +13787,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13821,12 +13827,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13869,12 +13875,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13921,12 +13927,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -13965,12 +13971,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -14013,12 +14019,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -14048,7 +14054,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14078,7 +14084,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14108,7 +14114,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14138,7 +14144,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14172,7 +14178,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14202,7 +14208,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14228,7 +14234,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 @@ -14254,7 +14260,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14293,7 +14299,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14332,7 +14338,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14362,7 +14368,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14401,7 +14407,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14440,7 +14446,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14470,7 +14476,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14505,7 +14511,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14535,7 +14541,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14570,7 +14576,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14600,7 +14606,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT SymmetryHandle @@ -14617,7 +14623,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT SymmetryHandle @@ -14634,7 +14640,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT SymmetryHandle @@ -14655,7 +14661,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT SymmetryHandle @@ -14672,7 +14678,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT SymmetryHandle @@ -14689,7 +14695,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT SymmetryHandle @@ -14706,7 +14712,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT SymmetryHandle @@ -14727,7 +14733,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr The size of x must be a multiple of ss. - + GECODE_INT_EXPORT SymmetryHandle @@ -14748,7 +14754,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr The size of x must be a multiple of ss. - + GECODE_INT_EXPORT SymmetryHandle @@ -14769,7 +14775,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr The size of v must be a multiple of ss. - + GECODE_INT_EXPORT SymmetryHandle @@ -14790,7 +14796,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT SymmetryHandle @@ -14807,7 +14813,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -14850,7 +14856,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 @@ -14893,7 +14899,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 @@ -14936,7 +14942,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 @@ -14979,7 +14985,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 @@ -15012,7 +15018,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -15045,7 +15051,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -15080,7 +15086,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_INT_EXPORT void @@ -15115,7 +15121,385 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + + + + forceinline Archive & + forceinline Archive& Gecode::operator<< + (Archive &e, unsigned int i) + operator<< + + Archive & + e + + + unsigned int + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator<< + (Archive &e, int i) + operator<< + + Archive & + e + + + int + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator<< + (Archive &e, unsigned short i) + operator<< + + Archive & + e + + + unsigned short + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator<< + (Archive &e, short i) + operator<< + + Archive & + e + + + short + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator<< + (Archive &e, unsigned char i) + operator<< + + Archive & + e + + + unsigned char + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator<< + (Archive &e, char i) + operator<< + + Archive & + e + + + char + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator<< + (Archive &e, bool i) + operator<< + + Archive & + e + + + bool + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator<< + (Archive &e, float d) + operator<< + + Archive & + e + + + float + d + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator<< + (Archive &e, double d) + operator<< + + Archive & + e + + + double + d + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator>> + (Archive &e, unsigned int &i) + operator>> + + Archive & + e + + + unsigned int & + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator>> + (Archive &e, int &i) + operator>> + + Archive & + e + + + int & + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator>> + (Archive &e, unsigned short &i) + operator>> + + Archive & + e + + + unsigned short & + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator>> + (Archive &e, short &i) + operator>> + + Archive & + e + + + short & + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator>> + (Archive &e, unsigned char &i) + operator>> + + Archive & + e + + + unsigned char & + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator>> + (Archive &e, char &i) + operator>> + + Archive & + e + + + char & + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator>> + (Archive &e, bool &i) + operator>> + + Archive & + e + + + bool & + i + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator>> + (Archive &e, float &d) + operator>> + + Archive & + e + + + float & + d + + + + + + + + + + + forceinline Archive & + forceinline Archive& Gecode::operator>> + (Archive &e, double &d) + operator>> + + Archive & + e + + + double & + d + + + + + + + + @@ -15144,7 +15528,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -15173,955 +15557,9 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - - - - class T1 - - - class T2 - - - bool - bool Gecode::operator== - (space_allocator< T1 > const &al1, space_allocator< T2 > const &al2) - operator== - - space_allocator< T1 > const & - al1 - - - space_allocator< T2 > const & - al2 - - throw () - -Tests two space allocators for equality. - -Two allocators are equal when each can release storage allocated from the other. - - - - - - - - class T1 - - - class T2 - - - bool - bool Gecode::operator!= - (space_allocator< T1 > const &al1, space_allocator< T2 > const &al2) - operator!= - - space_allocator< T1 > const & - al1 - - - space_allocator< T2 > const & - al2 - - throw () - -Tests two space allocators for inequality. - -Two allocators are equal when each can release storage allocated from the other. - - - - - - - - class T1 - - - class T2 - - - bool - bool Gecode::operator== - (region_allocator< T1 > const &al1, region_allocator< T2 > const &al2) - operator== - - region_allocator< T1 > const & - al1 - - - region_allocator< T2 > const & - al2 - - throw () - - - - - - - - - - - - class T1 - - - class T2 - - - bool - bool Gecode::operator!= - (region_allocator< T1 > const &al1, region_allocator< T2 > const &al2) - operator!= - - region_allocator< T1 > const & - al1 - - - region_allocator< T2 > const & - al2 - - throw () - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator<< - (Archive &e, unsigned int i) - operator<< - - Archive & - e - - - unsigned int - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator<< - (Archive &e, int i) - operator<< - - Archive & - e - - - int - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator<< - (Archive &e, unsigned short i) - operator<< - - Archive & - e - - - unsigned short - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator<< - (Archive &e, short i) - operator<< - - Archive & - e - - - short - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator<< - (Archive &e, unsigned char i) - operator<< - - Archive & - e - - - unsigned char - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator<< - (Archive &e, char i) - operator<< - - Archive & - e - - - char - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator<< - (Archive &e, bool i) - operator<< - - Archive & - e - - - bool - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator<< - (Archive &e, float d) - operator<< - - Archive & - e - - - float - d - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator<< - (Archive &e, double d) - operator<< - - Archive & - e - - - double - d - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator>> - (Archive &e, unsigned int &i) - operator>> - - Archive & - e - - - unsigned int & - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator>> - (Archive &e, int &i) - operator>> - - Archive & - e - - - int & - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator>> - (Archive &e, unsigned short &i) - operator>> - - Archive & - e - - - unsigned short & - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator>> - (Archive &e, short &i) - operator>> - - Archive & - e - - - short & - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator>> - (Archive &e, unsigned char &i) - operator>> - - Archive & - e - - - unsigned char & - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator>> - (Archive &e, char &i) - operator>> - - Archive & - e - - - char & - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator>> - (Archive &e, bool &i) - operator>> - - Archive & - e - - - bool & - i - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator>> - (Archive &e, float &d) - operator>> - - Archive & - e - - - float & - d - - - - - - - - - - - forceinline Archive & - forceinline Archive& Gecode::operator>> - (Archive &e, double &d) - operator>> - - Archive & - e - - - double & - d - - - - - - - - - - - - - class Var - - - ArrayTraits< VarArray< Var > >::ArgsType - ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ - (const VarArray< Var > &x, const VarArray< Var > &y) - operator+ - - const VarArray< Var > & - x - - - const VarArray< Var > & - y - - - - - - - - - - - - - class Var - - - ArrayTraits< VarArray< Var > >::ArgsType - ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ - (const VarArray< Var > &x, const VarArgArray< Var > &y) - operator+ - - const VarArray< Var > & - x - - - const VarArgArray< Var > & - y - - - - - - - - - - - - - class Var - - - ArrayTraits< VarArray< Var > >::ArgsType - ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ - (const VarArgArray< Var > &x, const VarArray< Var > &y) - operator+ - - const VarArgArray< Var > & - x - - - const VarArray< Var > & - y - - - - - - - - - - - - - class Var - - - ArrayTraits< VarArray< Var > >::ArgsType - ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ - (const VarArray< Var > &x, const Var &y) - operator+ - - const VarArray< Var > & - x - - - const Var & - y - - - - - - - - - - - - - class Var - - - ArrayTraits< VarArray< Var > >::ArgsType - ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ - (const Var &x, const VarArray< Var > &y) - operator+ - - const Var & - x - - - const VarArray< Var > & - y - - - - - - - - - - - - - class View - - - forceinline bool - forceinline bool Gecode::__before - (const View &x, const View &y) - __before - - const View & - x - - - const View & - y - - - - - - - - - - - - - class X - - - class Y - - - forceinline bool - forceinline bool Gecode::__same - (const X &x, const Y &y) - __same - - const X & - x - - - const Y & - y - - - - - - - - - - - - - class X - - - class Y - - - forceinline bool - forceinline bool Gecode::__shared - (const X &x, const Y &y) - __shared - - const X & - x - - - const Y & - y - - - - - - - - - - - - - class T - - - ArrayTraits< PrimArgArray< T > >::ArgsType - ArrayTraits<PrimArgArray<T> >::ArgsType Gecode::operator+ - (const PrimArgArray< T > &x, const PrimArgArray< T > &y) - operator+ - - const PrimArgArray< T > & - x - - - const PrimArgArray< T > & - y - - - - - - - - - - - - - class T - - - ArrayTraits< PrimArgArray< T > >::ArgsType - ArrayTraits<PrimArgArray<T> >::ArgsType Gecode::operator+ - (const PrimArgArray< T > &x, const T &y) - operator+ - - const PrimArgArray< T > & - x - - - const T & - y - - - - - - - - - - - - - class T - - - ArrayTraits< PrimArgArray< T > >::ArgsType - ArrayTraits<PrimArgArray<T> >::ArgsType Gecode::operator+ - (const T &x, const PrimArgArray< T > &y) - operator+ - - const T & - x - - - const PrimArgArray< T > & - y - - - - - - - - - - - - - class T - - - ArrayTraits< ArgArray< T > >::ArgsType - ArrayTraits<ArgArray<T> >::ArgsType Gecode::operator+ - (const ArgArray< T > &x, const ArgArray< T > &y) - operator+ - - const ArgArray< T > & - x - - - const ArgArray< T > & - y - - - - - - - - - - - - - class T - - - ArrayTraits< ArgArray< T > >::ArgsType - ArrayTraits<ArgArray<T> >::ArgsType Gecode::operator+ - (const ArgArray< T > &x, const T &y) - operator+ - - const ArgArray< T > & - x - - - const T & - y - - - - - - - - - - - - - class T - - - ArrayTraits< ArgArray< T > >::ArgsType - ArrayTraits<ArgArray<T> >::ArgsType Gecode::operator+ - (const T &x, const ArgArray< T > &y) - operator+ - - const T & - x - - - const ArgArray< T > & - y - - - - - - - - - - - - - class Var - - - ArrayTraits< VarArgArray< Var > >::ArgsType - ArrayTraits<VarArgArray<Var> >::ArgsType Gecode::operator+ - (const VarArgArray< Var > &x, const VarArgArray< Var > &y) - operator+ - - const VarArgArray< Var > & - x - - - const VarArgArray< Var > & - y - - - - - - - - - - - - - class Var - - - ArrayTraits< VarArgArray< Var > >::ArgsType - ArrayTraits<VarArgArray<Var> >::ArgsType Gecode::operator+ - (const VarArgArray< Var > &x, const Var &y) - operator+ - - const VarArgArray< Var > & - x - - - const Var & - y - - - - - - - - - - - - - class Var - - - ArrayTraits< VarArgArray< Var > >::ArgsType - ArrayTraits<VarArgArray<Var> >::ArgsType Gecode::operator+ - (const Var &x, const VarArgArray< Var > &y) - operator+ - - const Var & - x - - - const VarArgArray< Var > & - y - - - - - - - - - - + class Char @@ -16129,21 +15567,18 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr class Traits - - class Var - std::basic_ostream< Char, Traits > & std::basic_ostream<Char,Traits>& Gecode::operator<< - (std::basic_ostream< Char, Traits > &os, const VarArray< Var > &x) + (std::basic_ostream< Char, Traits > &os, const CHB &chb) operator<< std::basic_ostream< Char, Traits > & os - const VarArray< Var > & - x + const CHB & + chb @@ -16151,71 +15586,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - - - - - - class Char - - - class Traits - - - class View - - - std::basic_ostream< Char, Traits > & - std::basic_ostream<Char,Traits>& Gecode::operator<< - (std::basic_ostream< Char, Traits > &os, const ViewArray< View > &x) - operator<< - - std::basic_ostream< Char, Traits > & - os - - - const ViewArray< View > & - x - - - - - - - - - - - - - class Char - - - class Traits - - - class T - - - std::basic_ostream< Char, Traits > & - std::basic_ostream<Char,Traits>& Gecode::operator<< - (std::basic_ostream< Char, Traits > &os, const ArgArrayBase< T > &x) - operator<< - - std::basic_ostream< Char, Traits > & - os - - - const ArgArrayBase< T > & - x - - - - - - - - + @@ -16241,7 +15612,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16271,7 +15642,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16305,7 +15676,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16361,7 +15732,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16417,28 +15788,25 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - + - class Char - - - class Traits + class Var - std::basic_ostream< Char, Traits > & - std::basic_ostream<Char,Traits>& Gecode::operator<< - (std::basic_ostream< Char, Traits > &os, const CHB &chb) - operator<< + ArrayTraits< VarArray< Var > >::ArgsType + ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ + (const VarArray< Var > &x, const VarArray< Var > &y) + operator+ - std::basic_ostream< Char, Traits > & - os + const VarArray< Var > & + x - const CHB & - chb + const VarArray< Var > & + y @@ -16446,41 +15814,525 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + - - bool - forceinline bool Gecode::me_failed - (ModEvent me) - me_failed + + + + class Var + + + ArrayTraits< VarArray< Var > >::ArgsType + ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ + (const VarArray< Var > &x, const VarArgArray< Var > &y) + operator+ - ModEvent - me + const VarArray< Var > & + x + + + const VarArgArray< Var > & + y -Check whether modification event me is failed. + - + - - bool - forceinline bool Gecode::me_modified - (ModEvent me) - me_modified + + + + class Var + + + ArrayTraits< VarArray< Var > >::ArgsType + ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ + (const VarArgArray< Var > &x, const VarArray< Var > &y) + operator+ - ModEvent - me + const VarArgArray< Var > & + x + + + const VarArray< Var > & + y -Check whether modification event me describes variable modification. + - + + + + + + class Var + + + ArrayTraits< VarArray< Var > >::ArgsType + ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ + (const VarArray< Var > &x, const Var &y) + operator+ + + const VarArray< Var > & + x + + + const Var & + y + + + + + + + + + + + + + class Var + + + ArrayTraits< VarArray< Var > >::ArgsType + ArrayTraits<VarArray<Var> >::ArgsType Gecode::operator+ + (const Var &x, const VarArray< Var > &y) + operator+ + + const Var & + x + + + const VarArray< Var > & + y + + + + + + + + + + + + + class View + + + forceinline bool + forceinline bool Gecode::__before + (const View &x, const View &y) + __before + + const View & + x + + + const View & + y + + + + + + + + + + + + + class X + + + class Y + + + forceinline bool + forceinline bool Gecode::__same + (const X &x, const Y &y) + __same + + const X & + x + + + const Y & + y + + + + + + + + + + + + + class X + + + class Y + + + forceinline bool + forceinline bool Gecode::__shared + (const X &x, const Y &y) + __shared + + const X & + x + + + const Y & + y + + + + + + + + + + + + + class T + + + ArrayTraits< PrimArgArray< T > >::ArgsType + ArrayTraits<PrimArgArray<T> >::ArgsType Gecode::operator+ + (const PrimArgArray< T > &x, const PrimArgArray< T > &y) + operator+ + + const PrimArgArray< T > & + x + + + const PrimArgArray< T > & + y + + + + + + + + + + + + + class T + + + ArrayTraits< PrimArgArray< T > >::ArgsType + ArrayTraits<PrimArgArray<T> >::ArgsType Gecode::operator+ + (const PrimArgArray< T > &x, const T &y) + operator+ + + const PrimArgArray< T > & + x + + + const T & + y + + + + + + + + + + + + + class T + + + ArrayTraits< PrimArgArray< T > >::ArgsType + ArrayTraits<PrimArgArray<T> >::ArgsType Gecode::operator+ + (const T &x, const PrimArgArray< T > &y) + operator+ + + const T & + x + + + const PrimArgArray< T > & + y + + + + + + + + + + + + + class T + + + ArrayTraits< ArgArray< T > >::ArgsType + ArrayTraits<ArgArray<T> >::ArgsType Gecode::operator+ + (const ArgArray< T > &x, const ArgArray< T > &y) + operator+ + + const ArgArray< T > & + x + + + const ArgArray< T > & + y + + + + + + + + + + + + + class T + + + ArrayTraits< ArgArray< T > >::ArgsType + ArrayTraits<ArgArray<T> >::ArgsType Gecode::operator+ + (const ArgArray< T > &x, const T &y) + operator+ + + const ArgArray< T > & + x + + + const T & + y + + + + + + + + + + + + + class T + + + ArrayTraits< ArgArray< T > >::ArgsType + ArrayTraits<ArgArray<T> >::ArgsType Gecode::operator+ + (const T &x, const ArgArray< T > &y) + operator+ + + const T & + x + + + const ArgArray< T > & + y + + + + + + + + + + + + + class Var + + + ArrayTraits< VarArgArray< Var > >::ArgsType + ArrayTraits<VarArgArray<Var> >::ArgsType Gecode::operator+ + (const VarArgArray< Var > &x, const VarArgArray< Var > &y) + operator+ + + const VarArgArray< Var > & + x + + + const VarArgArray< Var > & + y + + + + + + + + + + + + + class Var + + + ArrayTraits< VarArgArray< Var > >::ArgsType + ArrayTraits<VarArgArray<Var> >::ArgsType Gecode::operator+ + (const VarArgArray< Var > &x, const Var &y) + operator+ + + const VarArgArray< Var > & + x + + + const Var & + y + + + + + + + + + + + + + class Var + + + ArrayTraits< VarArgArray< Var > >::ArgsType + ArrayTraits<VarArgArray<Var> >::ArgsType Gecode::operator+ + (const Var &x, const VarArgArray< Var > &y) + operator+ + + const Var & + x + + + const VarArgArray< Var > & + y + + + + + + + + + + + + + class Char + + + class Traits + + + class Var + + + std::basic_ostream< Char, Traits > & + std::basic_ostream<Char,Traits>& Gecode::operator<< + (std::basic_ostream< Char, Traits > &os, const VarArray< Var > &x) + operator<< + + std::basic_ostream< Char, Traits > & + os + + + const VarArray< Var > & + x + + + + + + + + + + + + + class Char + + + class Traits + + + class View + + + std::basic_ostream< Char, Traits > & + std::basic_ostream<Char,Traits>& Gecode::operator<< + (std::basic_ostream< Char, Traits > &os, const ViewArray< View > &x) + operator<< + + std::basic_ostream< Char, Traits > & + os + + + const ViewArray< View > & + x + + + + + + + + + + + + + class Char + + + class Traits + + + class T + + + std::basic_ostream< Char, Traits > & + std::basic_ostream<Char,Traits>& Gecode::operator<< + (std::basic_ostream< Char, Traits > &os, const ArgArrayBase< T > &x) + operator<< + + std::basic_ostream< Char, Traits > & + os + + + const ArgArrayBase< T > & + x + + + + + + + + @@ -16512,7 +16364,161 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + + + + + + class T1 + + + class T2 + + + bool + bool Gecode::operator== + (space_allocator< T1 > const &al1, space_allocator< T2 > const &al2) + operator== + + space_allocator< T1 > const & + al1 + + + space_allocator< T2 > const & + al2 + + throw () + +Tests two space allocators for equality. + +Two allocators are equal when each can release storage allocated from the other. + + + + + + + + class T1 + + + class T2 + + + bool + bool Gecode::operator!= + (space_allocator< T1 > const &al1, space_allocator< T2 > const &al2) + operator!= + + space_allocator< T1 > const & + al1 + + + space_allocator< T2 > const & + al2 + + throw () + +Tests two space allocators for inequality. + +Two allocators are equal when each can release storage allocated from the other. + + + + + + + + class T1 + + + class T2 + + + bool + bool Gecode::operator== + (region_allocator< T1 > const &al1, region_allocator< T2 > const &al2) + operator== + + region_allocator< T1 > const & + al1 + + + region_allocator< T2 > const & + al2 + + throw () + + + + + + + + + + + + class T1 + + + class T2 + + + bool + bool Gecode::operator!= + (region_allocator< T1 > const &al1, region_allocator< T2 > const &al2) + operator!= + + region_allocator< T1 > const & + al1 + + + region_allocator< T2 > const & + al2 + + throw () + + + + + + + + + + bool + forceinline bool Gecode::me_failed + (ModEvent me) + me_failed + + ModEvent + me + + +Check whether modification event me is failed. + + + + + + + + bool + forceinline bool Gecode::me_modified + (ModEvent me) + me_modified + + ModEvent + me + + +Check whether modification event me describes variable modification. + + + + + TFE @@ -16533,7 +16539,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + TFE @@ -16550,7 +16556,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + TFE @@ -16571,7 +16577,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_KERNEL_EXPORT TFE @@ -16588,7 +16594,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_KERNEL_EXPORT TFE @@ -16605,7 +16611,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_KERNEL_EXPORT TFE @@ -16622,7 +16628,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + void @@ -16647,7 +16653,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16674,7 +16680,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16701,7 +16707,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16728,7 +16734,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16755,7 +16761,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16782,7 +16788,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16809,7 +16815,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16836,7 +16842,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16863,7 +16869,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16890,7 +16896,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16917,7 +16923,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16944,7 +16950,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16971,7 +16977,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -16998,7 +17004,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17025,7 +17031,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17051,7 +17057,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17080,7 +17086,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17109,7 +17115,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17136,7 +17142,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17163,7 +17169,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17190,7 +17196,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17217,7 +17223,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17244,7 +17250,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17273,7 +17279,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17302,7 +17308,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17331,7 +17337,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17360,7 +17366,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_KERNEL_EXPORT void @@ -17381,7 +17387,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_KERNEL_EXPORT void @@ -17412,7 +17418,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17434,7 +17440,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17456,7 +17462,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17478,7 +17484,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17500,7 +17506,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17522,7 +17528,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17548,7 +17554,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17574,7 +17580,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17600,7 +17606,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17626,7 +17632,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17652,7 +17658,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17684,7 +17690,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17716,7 +17722,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + forceinline void @@ -17753,7 +17759,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + forceinline void @@ -17790,7 +17796,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + forceinline void @@ -17827,7 +17833,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + forceinline void @@ -17864,7 +17870,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -17893,7 +17899,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -17912,7 +17918,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -17931,7 +17937,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -17950,7 +17956,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -17969,7 +17975,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -17988,7 +17994,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18007,7 +18013,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18026,7 +18032,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18045,7 +18051,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18064,7 +18070,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18083,7 +18089,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18102,7 +18108,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18121,7 +18127,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18140,7 +18146,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18159,7 +18165,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18178,7 +18184,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18197,7 +18203,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18216,7 +18222,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18235,7 +18241,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18254,7 +18260,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18273,7 +18279,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18292,7 +18298,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18311,7 +18317,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18330,7 +18336,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18349,7 +18355,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18368,7 +18374,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18387,7 +18393,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18406,7 +18412,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18425,7 +18431,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18444,7 +18450,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18463,7 +18469,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18479,7 +18485,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18495,7 +18501,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18511,7 +18517,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18530,7 +18536,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18549,7 +18555,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18568,7 +18574,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18587,7 +18593,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18606,7 +18612,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18625,7 +18631,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18642,7 +18648,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18663,7 +18669,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18680,7 +18686,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18701,7 +18707,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -18718,7 +18724,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18739,7 +18745,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18760,7 +18766,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18781,7 +18787,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18802,7 +18808,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18823,7 +18829,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18844,7 +18850,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18865,7 +18871,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18886,7 +18892,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18907,7 +18913,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18928,7 +18934,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18949,7 +18955,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18970,7 +18976,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -18991,7 +18997,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19012,7 +19018,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19033,7 +19039,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19054,7 +19060,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19075,7 +19081,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19096,7 +19102,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19117,7 +19123,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19138,7 +19144,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19159,7 +19165,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19180,7 +19186,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19201,7 +19207,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19222,7 +19228,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19243,7 +19249,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19264,7 +19270,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19285,7 +19291,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19306,7 +19312,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19327,7 +19333,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19348,7 +19354,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19369,7 +19375,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19390,7 +19396,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19411,7 +19417,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19432,7 +19438,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19453,7 +19459,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19474,7 +19480,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19495,7 +19501,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19516,7 +19522,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19537,7 +19543,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19558,7 +19564,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19579,7 +19585,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19600,7 +19606,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19621,7 +19627,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19642,7 +19648,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19663,7 +19669,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19684,7 +19690,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19705,7 +19711,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19726,7 +19732,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19747,7 +19753,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19768,7 +19774,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19789,7 +19795,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19810,7 +19816,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19831,7 +19837,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19852,7 +19858,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19873,7 +19879,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19894,7 +19900,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19915,7 +19921,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19936,7 +19942,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19957,7 +19963,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19978,7 +19984,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -19999,7 +20005,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20020,7 +20026,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20041,7 +20047,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20062,7 +20068,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20083,7 +20089,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20104,7 +20110,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20125,7 +20131,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20146,7 +20152,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20167,7 +20173,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20188,7 +20194,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20209,7 +20215,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20230,7 +20236,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20251,7 +20257,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20272,7 +20278,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20293,7 +20299,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20314,7 +20320,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20335,7 +20341,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20356,7 +20362,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20377,7 +20383,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20398,7 +20404,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20419,7 +20425,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20440,7 +20446,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20461,7 +20467,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20482,7 +20488,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20503,7 +20509,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20524,7 +20530,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20545,7 +20551,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20566,7 +20572,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20587,7 +20593,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntRel @@ -20608,7 +20614,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT BoolExpr @@ -20624,7 +20630,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT BoolExpr @@ -20643,7 +20649,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT BoolExpr @@ -20662,7 +20668,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT BoolExpr @@ -20681,7 +20687,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT BoolExpr @@ -20700,7 +20706,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT BoolExpr @@ -20719,7 +20725,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT BoolExpr @@ -20738,7 +20744,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT BoolExpr @@ -20757,7 +20763,74 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + + + + GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr Gecode::dom + (const IntVar &x, int n) + dom + + const IntVar & + x + + + int + n + + +Return expression for $ x=n$. + + + + + + + + GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr Gecode::dom + (const IntVar &x, int l, int m) + dom + + const IntVar & + x + + + int + l + + + int + m + + +Return expression for $ l\leq x \leq m$. + + + + + + + + GECODE_MINIMODEL_EXPORT BoolExpr + GECODE_MINIMODEL_EXPORT BoolExpr Gecode::dom + (const IntVar &x, const IntSet &s) + dom + + const IntVar & + x + + + const IntSet & + s + + +Return expression for $ x \in s$. + + + + + GECODE_MINIMODEL_EXPORT IntVar @@ -20783,7 +20856,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT BoolVar @@ -20809,7 +20882,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT void @@ -20835,7 +20908,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -20847,12 +20920,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr e -Return expression for $|e|$. +Return expression for $|e|$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -20868,12 +20941,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr y -Return expression for $\min(x,y)$. +Return expression for $\min(x,y)$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -20885,12 +20958,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr x -Return expression for $\min(x)$. +Return expression for $\min(x)$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -20906,12 +20979,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr y -Return expression for $\max(x,y)$. +Return expression for $\max(x,y)$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -20923,12 +20996,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr x -Return expression for $\max(x)$. +Return expression for $\max(x)$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -20944,12 +21017,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr y -Return expression for $x\cdot y$. +Return expression for $x\cdot y$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -20965,12 +21038,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr y -Return expression for $x\ \mathrm{div}\ y$. +Return expression for $x\ \mathrm{div}\ y$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -20986,12 +21059,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr y -Return expression for $x\ \mathrm{mod}\ y$. +Return expression for $x\ \mathrm{mod}\ y$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -21008,7 +21081,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -21020,12 +21093,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr x -Return expression for $\lfloor\sqrt{x}\rfloor$. +Return expression for $\lfloor\sqrt{x}\rfloor$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -21046,7 +21119,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -21062,12 +21135,12 @@ 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 @@ -21083,12 +21156,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr y -Return expression for $x[y]$. +Return expression for $x[y]$. - + GECODE_MINIMODEL_EXPORT BoolExpr @@ -21104,12 +21177,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr y -Return expression for $x[y]$. +Return expression for $x[y]$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -21125,12 +21198,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr y -Return expression for $x[y]$. +Return expression for $x[y]$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -21150,12 +21223,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr y -Return expression for if-then-else $b?x:y$. +Return expression for if-then-else $b?x:y$. - + BoolVar @@ -21181,7 +21254,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + IntVar @@ -21207,7 +21280,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + void @@ -21236,12 +21309,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21270,12 +21343,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21304,12 +21377,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21338,12 +21411,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21372,12 +21445,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21406,12 +21479,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21440,12 +21513,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21474,12 +21547,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21508,12 +21581,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21542,12 +21615,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21576,12 +21649,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21610,12 +21683,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21644,12 +21717,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21678,12 +21751,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21712,12 +21785,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21746,12 +21819,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21780,12 +21853,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21814,12 +21887,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr 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 @@ -21853,7 +21926,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + void @@ -21887,7 +21960,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + void @@ -21912,12 +21985,12 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr IPL_DEF -Post constraint $\{x_0,\dots,x_{n-1}\}=y$. +Post constraint $\{x_0,\dots,x_{n-1}\}=y$. - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -21934,7 +22007,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + GECODE_MINIMODEL_EXPORT LinIntExpr @@ -21951,7 +22024,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -21979,7 +22052,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. - + @@ -22001,7 +22074,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -22027,7 +22100,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -22049,7 +22122,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -22075,7 +22148,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -22097,7 +22170,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -22131,7 +22204,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". - + @@ -22158,7 +22231,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr - + @@ -22192,7 +22265,7 @@ with negative heights", Nicolas Beldiceanu and Mats Carlsson, Pr with Gecode". - + @@ -22219,7 +22292,7 @@ with Gecode". - + @@ -22242,7 +22315,7 @@ with Gecode". - + SetAssign @@ -22258,7 +22331,7 @@ with Gecode". - + SetAssign @@ -22274,7 +22347,7 @@ with Gecode". - + SetAssign @@ -22290,7 +22363,7 @@ with Gecode". - + SetAssign @@ -22306,7 +22379,7 @@ with Gecode". - + SetAssign @@ -22322,7 +22395,7 @@ with Gecode". - + SetAssign @@ -22338,7 +22411,7 @@ with Gecode". - + SetAssign @@ -22355,7 +22428,7 @@ with Gecode". - + SetAssign @@ -22372,7 +22445,7 @@ with Gecode". - + SetAssign @@ -22394,7 +22467,7 @@ with Gecode". The default commit function posts the constraint that the value n must be included in the set variable x. - + SetValBranch @@ -22410,7 +22483,7 @@ with Gecode". - + SetValBranch @@ -22426,7 +22499,7 @@ with Gecode". - + SetValBranch @@ -22442,7 +22515,7 @@ with Gecode". - + SetValBranch @@ -22458,7 +22531,7 @@ with Gecode". - + SetValBranch @@ -22474,7 +22547,7 @@ with Gecode". - + SetValBranch @@ -22490,7 +22563,7 @@ with Gecode". - + SetValBranch @@ -22507,7 +22580,7 @@ with Gecode". - + SetValBranch @@ -22524,7 +22597,7 @@ with Gecode". - + SetValBranch @@ -22546,7 +22619,7 @@ 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 @@ -22562,7 +22635,7 @@ with Gecode". - + SetVarBranch @@ -22579,7 +22652,7 @@ with Gecode". - + SetVarBranch @@ -22600,7 +22673,7 @@ with Gecode". - + SetVarBranch @@ -22621,7 +22694,7 @@ with Gecode". - + SetVarBranch @@ -22638,7 +22711,7 @@ with Gecode". - + SetVarBranch @@ -22655,7 +22728,7 @@ with Gecode". - + SetVarBranch @@ -22676,7 +22749,7 @@ with Gecode". - + SetVarBranch @@ -22697,7 +22770,7 @@ with Gecode". - + SetVarBranch @@ -22718,7 +22791,7 @@ with Gecode". - + SetVarBranch @@ -22739,7 +22812,7 @@ with Gecode". - + SetVarBranch @@ -22760,7 +22833,7 @@ with Gecode". - + SetVarBranch @@ -22781,7 +22854,7 @@ with Gecode". - + SetVarBranch @@ -22802,7 +22875,7 @@ with Gecode". - + SetVarBranch @@ -22823,7 +22896,7 @@ with Gecode". - + SetVarBranch @@ -22840,7 +22913,7 @@ with Gecode". - + SetVarBranch @@ -22861,7 +22934,7 @@ with Gecode". - + SetVarBranch @@ -22878,7 +22951,7 @@ with Gecode". - + SetVarBranch @@ -22899,7 +22972,7 @@ with Gecode". - + SetVarBranch @@ -22916,7 +22989,7 @@ with Gecode". - + SetVarBranch @@ -22933,7 +23006,7 @@ with Gecode". - + SetVarBranch @@ -22950,7 +23023,7 @@ with Gecode". - + SetVarBranch @@ -22967,7 +23040,7 @@ with Gecode". - + SetVarBranch @@ -22984,7 +23057,7 @@ with Gecode". - + SetVarBranch @@ -23001,7 +23074,7 @@ with Gecode". - + SetVarBranch @@ -23018,7 +23091,7 @@ with Gecode". - + SetVarBranch @@ -23035,7 +23108,7 @@ with Gecode". - + SetVarBranch @@ -23056,7 +23129,7 @@ with Gecode". - + SetVarBranch @@ -23077,7 +23150,7 @@ with Gecode". - + SetVarBranch @@ -23098,7 +23171,7 @@ with Gecode". - + SetVarBranch @@ -23119,7 +23192,7 @@ with Gecode". - + SetVarBranch @@ -23140,7 +23213,7 @@ with Gecode". - + SetVarBranch @@ -23161,7 +23234,7 @@ with Gecode". - + SetVarBranch @@ -23182,7 +23255,7 @@ with Gecode". - + SetVarBranch @@ -23203,7 +23276,7 @@ with Gecode". - + SetVarBranch @@ -23220,7 +23293,7 @@ with Gecode". - + SetVarBranch @@ -23241,7 +23314,7 @@ with Gecode". - + SetVarBranch @@ -23258,7 +23331,7 @@ with Gecode". - + SetVarBranch @@ -23279,7 +23352,7 @@ with Gecode". - + forceinline void @@ -23303,12 +23376,12 @@ with Gecode". s -Post propagator for $|s|\geq 1 \land \forall i\in s:\ x \sim_{rt} i$. +Post propagator for $|s|\geq 1 \land \forall i\in s:\ x \sim_{rt} i$. - + forceinline void @@ -23341,9 +23414,9 @@ with Gecode". - + - + class View0 @@ -23354,12 +23427,8 @@ with Gecode". forceinline bool forceinline bool Gecode::viewarrayshared - (const Space &home, const ViewArray< View0 > &va, const View1 &y) + (const ViewArray< View0 > &va, const View1 &y) viewarrayshared - - const Space & - home - const ViewArray< View0 > & va @@ -23374,18 +23443,15 @@ with Gecode". - + - + forceinline bool forceinline bool Gecode::viewarrayshared< Set::SingletonView, Set::SetView > - (const Space &, const ViewArray< Set::SingletonView > &, const Set::SetView &) + (const ViewArray< Set::SingletonView > &, const Set::SetView &) viewarrayshared< Set::SingletonView, Set::SetView > - - const Space & - const ViewArray< Set::SingletonView > & @@ -23398,7 +23464,7 @@ with Gecode". - + void @@ -23427,7 +23493,7 @@ with Gecode". - + @@ -23456,7 +23522,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -23480,12 +23546,12 @@ with Gecode". i -Propagates $ x \sim_r \{i\}$. +Propagates $ x \sim_r \{i\}$. - + GECODE_SET_EXPORT void @@ -23509,12 +23575,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 @@ -23542,12 +23608,12 @@ with Gecode". j -Propagates $ x \sim_r \{i,\dots,j\}$. +Propagates $ x \sim_r \{i,\dots,j\}$. - + GECODE_SET_EXPORT void @@ -23575,12 +23641,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 @@ -23604,12 +23670,12 @@ with Gecode". s -Propagates $ x \sim_r s$. +Propagates $ x \sim_r s$. - + GECODE_SET_EXPORT void @@ -23633,12 +23699,12 @@ with Gecode". 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 @@ -23662,12 +23728,12 @@ with Gecode". j -Propagates $ i \leq |s| \leq j $. +Propagates $ i \leq |s| \leq j $. - + GECODE_SET_EXPORT void @@ -23691,12 +23757,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 @@ -23724,12 +23790,12 @@ with Gecode". r -Post propagator for $ (x \sim_{rt} \{i\}) \equiv r $. +Post propagator for $ (x \sim_{rt} \{i\}) \equiv r $. - + GECODE_SET_EXPORT void @@ -23761,12 +23827,12 @@ with Gecode". 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 @@ -23794,12 +23860,12 @@ with Gecode". r -Post propagator for $ (x \sim_{rt} s) \equiv r $. +Post propagator for $ (x \sim_{rt} s) \equiv r $. - + GECODE_SET_EXPORT void @@ -23824,7 +23890,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -23849,7 +23915,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -23873,12 +23939,12 @@ with Gecode". y -Post propagator for $ x \sim_r y$. +Post propagator for $ x \sim_r y$. - + GECODE_SET_EXPORT void @@ -23906,12 +23972,12 @@ with Gecode". r -Post propagator for $ (x \sim_{rt} y) \equiv r$. +Post propagator for $ (x \sim_{rt} y) \equiv r$. - + GECODE_SET_EXPORT void @@ -23935,12 +24001,12 @@ with Gecode". x -Post propagator for $ s \sim_r \{x\}$. +Post propagator for $ s \sim_r \{x\}$. - + GECODE_SET_EXPORT void @@ -23964,12 +24030,12 @@ with Gecode". s -Post propagator for $ \{x\} \sim_r s$. +Post propagator for $ \{x\} \sim_r s$. - + GECODE_SET_EXPORT void @@ -23997,12 +24063,12 @@ with Gecode". r -Post propagator for $ (s \sim_{rt} \{x\}) \equiv r$. +Post propagator for $ (s \sim_{rt} \{x\}) \equiv r$. - + GECODE_SET_EXPORT void @@ -24030,12 +24096,12 @@ with Gecode". r -Post propagator for $ (\{x\} \sim_{rt} s) \equiv r $. +Post propagator for $ (\{x\} \sim_{rt} s) \equiv r $. - + GECODE_SET_EXPORT void @@ -24059,12 +24125,12 @@ with Gecode". x -Post propagator for $|s|\geq 1 \land \forall i\in s:\ i \sim_{rt} x$. +Post propagator for $|s|\geq 1 \land \forall i\in s:\ i \sim_{rt} x$. - + GECODE_SET_EXPORT void @@ -24092,12 +24158,12 @@ with Gecode". r -Post reified propagator for $\left(|s|\geq 1 \land \forall i\in s:\ i \sim_{rt} x\right)\equiv r$. +Post reified propagator for $\left(|s|\geq 1 \land \forall i\in s:\ i \sim_{rt} x\right)\equiv r$. - + Post propagator for @@ -24114,7 +24180,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -24147,7 +24213,7 @@ with Gecode". Posts propagator for $ z = b ? x : y $ - + Post propagator that propagates that a x is convex GECODE_SET_EXPORT void @@ -24168,7 +24234,7 @@ with Gecode". - + Post propagator that propagates that a y is the convex hull of a x GECODE_SET_EXPORT void @@ -24193,7 +24259,7 @@ with Gecode". - + Select random @@ -24214,7 +24280,7 @@ with Gecode". - + Include median @@ -24231,7 +24297,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -24270,7 +24336,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -24309,7 +24375,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -24339,7 +24405,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -24374,7 +24440,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -24404,7 +24470,7 @@ with Gecode". - + Variables in a x are interchangeable GECODE_SET_EXPORT SymmetryHandle @@ -24421,7 +24487,7 @@ with Gecode". - + GECODE_SET_EXPORT SymmetryHandle @@ -24442,7 +24508,7 @@ with Gecode". The size of x must be a multiple of ss. - + GECODE_SET_EXPORT void @@ -24485,7 +24551,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -24528,7 +24594,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -24561,7 +24627,7 @@ with Gecode". - + GECODE_SET_EXPORT void @@ -24596,7 +24662,7 @@ with Gecode". - + @@ -24618,7 +24684,7 @@ with Gecode". - + @@ -24640,13 +24706,65 @@ with Gecode". - + + + + + + class T + + + void + void Gecode::cmb_hash + (std::size_t &seed, const T h) + cmb_hash + + std::size_t & + seed + + + const T + h + + +Combine hash value h into seed. + + + + + + + + + + class T + + + forceinline void + forceinline void Gecode::cmb_hash + (std::size_t &seed, const T h) + cmb_hash + + std::size_t & + seed + + + const T + h + + +Combine hash value h into seed. + + + + + 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/python/pyio.c b/packages/python/pyio.c index 568ac7125..b7c1950d0 100644 --- a/packages/python/pyio.c +++ b/packages/python/pyio.c @@ -82,6 +82,11 @@ static void *py_open(VFS_t *me, const char *name, const char *io_mode, if (!outbuf) outbuf = ( unsigned char *)malloc(1024); st->u.w_irl.ptr = st->u.w_irl.buf = outbuf; + + + + +]\] st->user_name = TermOutStream; } else if (strcmp(name, "sys.stderr") == 0) { st->user_name = TermErrStream; diff --git a/packages/python/yap_kernel/yap_ipython/prolog/jupyter.yap b/packages/python/yap_kernel/yap_ipython/prolog/jupyter.yap index 0c315ef2d..d26eef57e 100644 --- a/packages/python/yap_kernel/yap_ipython/prolog/jupyter.yap +++ b/packages/python/yap_kernel/yap_ipython/prolog/jupyter.yap @@ -65,32 +65,34 @@ blankc(' '). blankc('\n'). blankc('\t'). +:- dynamic cell_stream/1. streams(false) :- nb_setval(jupyter_cell, false), - flush_output, retract(cell_stream(S)), close(S), fail. streams(false). streams(true) :- + streams( false ), nb_setval(jupyter_cell, true), - \+ current_stream('/python/input',_,_), +% \+ current_stream('/python/input',_,_), open('/python/input', read, Input, [alias(user_input),bom(false),script(false)]), assert( cell_stream( Input) ), set_prolog_flag(user_input,Input), fail. streams(true) :- - \+ current_stream('/python/sys.stdout',_,_), - open('/python/sys.stdout', append, Output, [alias(user_output)]), - assert( cell_stream( Output) ), - fail. +% \+ current_stream('/python/sys.stdout',_,_), + open('/python/sys.stdout', append, Output, [alias(user_output)]), + set_prolog_flag(user_output, Output), + assert( cell_stream( Output) ), + fail. streams(true) :- - \+ current_stream('/python/sys.stderr',_,_), + % \+ current_stream('/python/sys.stderr',_,_), open('/python/sys.stderr', append, Error, [alias(user_error)]), assert( cell_stream( Error) ), set_prolog_flag(user_error, Error), -fail. + fail. streams(true). ready(_Self, Line ) :- diff --git a/packages/python/yap_kernel/yap_ipython/yapi.py b/packages/python/yap_kernel/yap_ipython/yapi.py index 62c34edcd..00efed5d3 100644 --- a/packages/python/yap_kernel/yap_ipython/yapi.py +++ b/packages/python/yap_kernel/yap_ipython/yapi.py @@ -1,26 +1,17 @@ -import os import sys -import abc -import math -import itertools -import trace -from typing import Iterator, List, Tuple, Iterable, Union -from traitlets import Bool, Enum, observe, Int +from typing import List +from traitlets import Bool from yap4py.yapi import * -from yap_ipython.core.completer import Completer, Completion -from yap_ipython.utils.strdispatch import StrDispatch +from yap_ipython.core.completer import Completer # import yap_ipython.core from traitlets import Instance from yap_ipython.core.inputsplitter import * from yap_ipython.core.inputtransformer import * from yap_ipython.core.interactiveshell import * -from pygments import highlight -from pygments.lexers.prolog import PrologLexer -from pygments.formatters import HtmlFormatter from yap_ipython.core import interactiveshell @@ -38,6 +29,7 @@ exit_cell = namedtuple('exit_cell', 'self' ) completions = namedtuple('completions', 'txt self' ) errors = namedtuple('errors', 'self text' ) streams = namedtuple('streams', ' text' ) +nostreams = namedtuple('nostreams', ' text' ) global engine @@ -50,7 +42,6 @@ def tracefunc(frame, event, arg, indent=[0]): indent[0] -= 2 return tracefunc -import sys class YAPInputSplitter(InputSplitter): """An input splitter that recognizes all of iyap's special syntax.""" @@ -560,8 +551,6 @@ class YAPRun: pg = jupyter_query( self, program, squery) self.query = self.yapeng.query(pg) self.query.answer = {} - self.yapeng.mgoal(streams(False),"user", True) - self.yapeng.mgoal(streams(True),"user", True) while self.query.next(): answer = self.query.answer found = True @@ -570,7 +559,6 @@ class YAPRun: if self.query.port == "exit": self.os = None sys.stderr.writeln('Done, with', self.bindings) - self.yapeng.mgoal(streams(False),"user", True) return True,self.bindings if stop or howmany == self.iterations: return True, self.bindings @@ -579,9 +567,8 @@ class YAPRun: else: self.os = None self.query.close() -`` self.query = None + self.query = None sys.stderr.write('Fail\n') - self.yapeng.mgoal(streams(False),"user", True) return True,self.bindings except Exception as e: sys.stderr.write('Exception after', self.bindings, '\n') @@ -738,9 +725,10 @@ class YAPRun: # run the new command using the given tracer # # tracer.runfunc(f,self,cell,state) + self.yapeng.mgoal(streams(True),"user", True) self.jupyter_query( cell ) - # state = tracer.runfunc(jupyter_query( self, cell ) ) self.yapeng.mgoal(streams(False),"user", True) + # state = tracer.runfunc(jupyter_query( self, cell ) ) self.shell.last_execution_succeeded = True self.result.result = (True, dicts) @@ -786,7 +774,6 @@ class YAPRun: s = s[:i-1] if n: its = 0 - j = 0 for ch in n: if not ch.isdigit(): raise SyntaxError()