Gecode::Set::LDSB Namespace Reference
Symmetry breaking for set variables. More...
Classes | |
| class | VariableMap |
| Map from variable implementation to index. More... | |
| class | LDSBSetBrancher |
| Symmetry-breaking brancher with generic view and value selection. More... | |
Functions | |
| template<class View > | |
| ValueSymmetryImp< View > * | specialUpdate (Space &home, ValueSymmetryImp< View > *s, IntSet usedValues) |
| Bulk update of a value symmetry s, using usedValues. | |
| bool | equalLUB (const Set::SetView &x, const Set::SetView &y) |
| Do two set variables have equal least-upper-bounds? | |
| SymmetryImp< SetView > * | createSetSym (Space &home, const SymmetryHandle &s, VariableMap variableMap) |
Detailed Description
Symmetry breaking for set variables.
Function Documentation
template<class View >
| ValueSymmetryImp<View>* Gecode::Set::LDSB::specialUpdate | ( | Space & | home, | |
| ValueSymmetryImp< View > * | s, | |||
| IntSet | usedValues | |||
| ) | [inline] |
Bulk update of a value symmetry s, using usedValues.
Calculates the intersection and difference of the values in the symmetry and usedValues, updates the symmetry to eliminate the used values, and makes a new symmetry containing the intersection values, if there are at least two. Returns the new symmetry, or NULL if the intersection has fewer than two elements.
Definition at line 100 of file brancher.hpp.
| bool Gecode::Set::LDSB::equalLUB | ( | const Set::SetView & | x, | |
| const Set::SetView & | y | |||
| ) |
Do two set variables have equal least-upper-bounds?
Definition at line 44 of file sym-imp.cpp.
| SymmetryImp<SetView>* Gecode::Set::LDSB::createSetSym | ( | Space & | home, | |
| const SymmetryHandle & | s, | |||
| VariableMap | variableMap | |||
| ) |