
Go to the source code of this file.
Classes | |
| class | Gecode::Int::Unshare::VarPtrLess< Var > |
| Sort order for variables. More... | |
Namespaces | |
| Gecode::Int::Unshare | |
| Unsharing shared variables. | |
| Gecode::Int | |
| Finite domain integers. | |
Functions | |
| void | Gecode::Int::Unshare::link (Home home, IntVar **x, int n, IntPropLevel ipl) |
| Replace by fresh yet equal integer variables. More... | |
| void | Gecode::Int::Unshare::link (Home home, BoolVar **x, int n, IntPropLevel) |
| Replace by fresh yet equal Boolean variables. More... | |
| template<class Var > | |
| void | Gecode::Int::Unshare::unshare (Home home, VarArgArray< Var > &x, IntPropLevel ipl) |
| Replace unassigned shared variables by fresh, yet equal variables. More... | |
| void | Gecode::unshare (Home home, IntVarArgs &x, IntPropLevel ipl=IPL_DEF) |
| Replace multiple variable occurences in x by fresh variables. More... | |
| void | Gecode::unshare (Home home, BoolVarArgs &x, IntPropLevel ipl=IPL_DEF) |
| Replace multiple variable occurences in x by fresh variables. More... | |
| void Gecode::unshare | ( | Home | home, |
| IntVarArgs & | x, | ||
| IntPropLevel | ipl = IPL_DEF |
||
| ) |
Replace multiple variable occurences in x by fresh variables.
Supports domain consistency (ipl = IPL_DOM, default) and bounds consistency (ipl = IPL_BND).
Definition at line 136 of file unshare.cpp.
| void Gecode::unshare | ( | Home | home, |
| BoolVarArgs & | x, | ||
| IntPropLevel | |||
| ) |
Replace multiple variable occurences in x by fresh variables.
Definition at line 141 of file unshare.cpp.