Gecode::Set::ComplementView< View > Class Template Reference
[Set views]
Inherits Gecode::DerivedViewBase< View >.
Detailed Description
template<class View>
class Gecode::Set::ComplementView< View >
Complement set view.
A complement set view for a set view provides operations such that behaves like the complement of . The complement is defined in terms of the set universe.
Definition at line 1000 of file view.icc.
View-dependent propagator support | |
static void | schedule (Space *home, Propagator *p, ModEvent me) |
Schedule propagator p with modification event me. | |
static ModEvent | me (ModEventDelta med) |
Return modification event for view type in med. | |
static ModEventDelta | med (ModEvent) |
Translate modification event me to modification event delta for view. | |
Reflection | |
static Support::Symbol | type (void) |
Return specification for this view, using variable map m. | |
Reflection::Arg * | spec (const Space *home, Reflection::VarMap &m) const |
Return specification for this view, using variable map m. | |
Delta information for advisors | |
static ModEvent | modevent (const Delta *d) |
Return modification event. | |
int | glbMin (const Delta *d) const |
Return minimum value just pruned from glb. | |
int | glbMax (const Delta *d) const |
Return maximum value just pruned from glb. | |
bool | glbAny (const Delta *d) const |
Test whether arbitrary values got pruned from glb. | |
int | lubMin (const Delta *d) const |
Return minimum value just pruned from lub. | |
int | lubMax (const Delta *d) const |
Return maximum value just pruned from lub. | |
bool | lubAny (const Delta *d) const |
Test whether arbitrary values got pruned from lub. | |
Constructors and initialization | |
ComplementView (void) | |
Default constructor. | |
ComplementView (View &x) | |
Initialize with set view x. | |
ComplementView (Space *home, const Reflection::VarMap &vars, Reflection::Arg *arg) | |
Initialize from specification. | |
Value access | |
unsigned int | cardMin (void) const |
Return minimum cardinality. | |
unsigned int | cardMax (void) const |
Return maximum cardinality. | |
int | lubMin (void) const |
Return minimum of the least upper bound. | |
int | lubMax (void) const |
Return maximum of the least upper bound. | |
int | lubMinN (int n) const |
Return n-th smallest element of the least upper bound. | |
int | glbMin (void) const |
Return minimum of the greatest lower bound. | |
int | glbMax (void) const |
Return maximum of the greatest lower bound. | |
unsigned int | glbSize (void) const |
Return the number of elements in the greatest lower bound. | |
unsigned int | lubSize (void) const |
Return the number of elements in the least upper bound. | |
unsigned int | unknownSize (void) const |
Return the number of unknown elements. | |
Domain tests | |
bool | assigned (void) const |
Test whether view is assigned. | |
bool | contains (int i) const |
Test whether i is in the greatest lower bound. | |
bool | notContains (int i) const |
Test whether i is not in the least upper bound. | |
Domain update by value | |
ModEvent | cardMin (Space *home, unsigned int m) |
Restrict cardinality to be greater than or equal to m. | |
ModEvent | cardMax (Space *home, unsigned int m) |
Restrict cardinality to be less than or equal to m. | |
ModEvent | include (Space *home, int i, int j) |
Update greatest lower bound to include all elements between and including i and j. | |
ModEvent | exclude (Space *home, int i, int j) |
Restrict least upper bound to not contain all elements between and including i and j. | |
ModEvent | include (Space *home, int i) |
Update greatest lower bound to contain i. | |
ModEvent | exclude (Space *home, int i) |
Restrict least upper bound to not contain i. | |
ModEvent | intersect (Space *home, int i, int j) |
Update least upper bound to contain at most all elements between and including i and j. | |
ModEvent | intersect (Space *home, int i) |
Update least upper bound to contain at most the element i. | |
Domain update by range iterator | |
template<class I> | |
ModEvent | excludeI (Space *home, I &i) |
Remove range sequence described by i from least upper bound. | |
template<class I> | |
ModEvent | includeI (Space *home, I &i) |
Include range sequence described by i in greatest lower bound. | |
template<class I> | |
ModEvent | intersectI (Space *home, I &iter) |
Intersect least upper bound with range sequence described by i. | |
Dependencies | |
void | subscribe (Space *home, Propagator *p, PropCond pc, bool process=true) |
Subscribe propagator p with propagation condition pc to view. | |
void | cancel (Space *home, Propagator *p, PropCond pc) |
Cancel subscription of propagator p with propagation condition pc to view. | |
void | subscribe (Space *home, Advisor *a) |
Subscribe advisor a to view. | |
void | cancel (Space *home, Advisor *a) |
Cancel subscription of advisor a. | |
Cloning | |
void | update (Space *home, bool share, ComplementView &x) |
Update this view to be a clone of view x. | |
View comparison | |
template<class View> | |
bool | same (const Set::ComplementView< View > &x, const Set::ComplementView< View > &y) |
Test whether views x and y are the same. | |
template<class View> | |
bool | before (const Set::ComplementView< View > &x, const Set::ComplementView< View > &y) |
Test whether view x comes before y (arbitrary order). | |
View comparison | |
template<class View> | |
bool | same (const Set::OffsetSetView< View > &x, const Set::OffsetSetView< View > &y) |
Test whether views x and y are the same. | |
template<class View> | |
bool | before (const Set::OffsetSetView< View > &x, const Set::OffsetSetView< View > &y) |
Test whether view x comes before y (arbitrary order). | |
Static Public Member Functions | |
static PropCond | pc_negateset (PropCond pc) |
Negate the propagation condition pc. | |
static ModEvent | me_negateset (ModEvent me) |
Negate the modification event me. | |
Related Functions | |
(Note that these are not member functions.) | |
template<class View> | |
std::ostream & | operator<< (std::ostream &, const Gecode::Set::ComplementView< View > &) |
Print set complement view. |
Constructor & Destructor Documentation
Gecode::Set::ComplementView< View >::ComplementView | ( | void | ) | [inline] |
Gecode::Set::ComplementView< View >::ComplementView | ( | View & | x | ) | [inline] |
Gecode::Set::ComplementView< View >::ComplementView | ( | Space * | home, | |
const Reflection::VarMap & | vars, | |||
Reflection::Arg * | arg | |||
) | [inline] |
Member Function Documentation
PropCond Gecode::Set::ComplementView< View >::pc_negateset | ( | PropCond | pc | ) | [inline, static] |
ModEvent Gecode::Set::ComplementView< View >::me_negateset | ( | ModEvent | me | ) | [inline, static] |
unsigned int Gecode::Set::ComplementView< View >::cardMin | ( | void | ) | const [inline] |
unsigned int Gecode::Set::ComplementView< View >::cardMax | ( | void | ) | const [inline] |
int Gecode::Set::ComplementView< View >::lubMin | ( | void | ) | const [inline] |
int Gecode::Set::ComplementView< View >::lubMax | ( | void | ) | const [inline] |
int Gecode::Set::ComplementView< View >::lubMinN | ( | int | n | ) | const |
Return n-th smallest element of the least upper bound.
int Gecode::Set::ComplementView< View >::glbMin | ( | void | ) | const [inline] |
int Gecode::Set::ComplementView< View >::glbMax | ( | void | ) | const [inline] |
unsigned int Gecode::Set::ComplementView< View >::glbSize | ( | void | ) | const [inline] |
Return the number of elements in the greatest lower bound.
Definition at line 88 of file complement.icc.
unsigned int Gecode::Set::ComplementView< View >::lubSize | ( | void | ) | const [inline] |
Return the number of elements in the least upper bound.
Definition at line 94 of file complement.icc.
unsigned int Gecode::Set::ComplementView< View >::unknownSize | ( | void | ) | const [inline] |
bool Gecode::Set::ComplementView< View >::assigned | ( | void | ) | const [inline] |
bool Gecode::Set::ComplementView< View >::contains | ( | int | i | ) | const [inline] |
bool Gecode::Set::ComplementView< View >::notContains | ( | int | i | ) | const [inline] |
ModEvent Gecode::Set::ComplementView< View >::cardMin | ( | Space * | home, | |
unsigned int | m | |||
) | [inline] |
Restrict cardinality to be greater than or equal to m.
Definition at line 176 of file complement.icc.
ModEvent Gecode::Set::ComplementView< View >::cardMax | ( | Space * | home, | |
unsigned int | m | |||
) | [inline] |
ModEvent Gecode::Set::ComplementView< View >::include | ( | Space * | home, | |
int | i, | |||
int | j | |||
) | [inline] |
Update greatest lower bound to include all elements between and including i and j.
Definition at line 220 of file complement.icc.
ModEvent Gecode::Set::ComplementView< View >::exclude | ( | Space * | home, | |
int | i, | |||
int | j | |||
) | [inline] |
Restrict least upper bound to not contain all elements between and including i and j.
Definition at line 226 of file complement.icc.
ModEvent Gecode::Set::ComplementView< View >::include | ( | Space * | home, | |
int | i | |||
) | [inline] |
ModEvent Gecode::Set::ComplementView< View >::exclude | ( | Space * | home, | |
int | i | |||
) | [inline] |
ModEvent Gecode::Set::ComplementView< View >::intersect | ( | Space * | home, | |
int | i, | |||
int | j | |||
) | [inline] |
Update least upper bound to contain at most all elements between and including i and j.
Definition at line 212 of file complement.icc.
ModEvent Gecode::Set::ComplementView< View >::intersect | ( | Space * | home, | |
int | i | |||
) | [inline] |
Update least upper bound to contain at most the element i.
Definition at line 204 of file complement.icc.
ModEvent Gecode::Set::ComplementView< View >::excludeI | ( | Space * | home, | |
I & | i | |||
) | [inline] |
Remove range sequence described by i from least upper bound.
Definition at line 232 of file complement.icc.
ModEvent Gecode::Set::ComplementView< View >::includeI | ( | Space * | home, | |
I & | i | |||
) | [inline] |
Include range sequence described by i in greatest lower bound.
Definition at line 238 of file complement.icc.
ModEvent Gecode::Set::ComplementView< View >::intersectI | ( | Space * | home, | |
I & | iter | |||
) | [inline] |
Intersect least upper bound with range sequence described by i.
Definition at line 244 of file complement.icc.
void Gecode::Set::ComplementView< View >::schedule | ( | Space * | home, | |
Propagator * | p, | |||
ModEvent | me | |||
) | [inline, static] |
ModEvent Gecode::Set::ComplementView< View >::me | ( | ModEventDelta | med | ) | [inline, static] |
ModEventDelta Gecode::Set::ComplementView< View >::med | ( | ModEvent | me | ) | [inline, static] |
Translate modification event me to modification event delta for view.
Definition at line 287 of file complement.icc.
void Gecode::Set::ComplementView< View >::subscribe | ( | Space * | home, | |
Propagator * | p, | |||
PropCond | pc, | |||
bool | process = true | |||
) | [inline] |
Subscribe propagator p with propagation condition pc to view.
In case process is false, the propagator is just subscribed but not processed for execution (this must be used when creating subscriptions during propagation).
Definition at line 251 of file complement.icc.
void Gecode::Set::ComplementView< View >::cancel | ( | Space * | home, | |
Propagator * | p, | |||
PropCond | pc | |||
) | [inline] |
Cancel subscription of propagator p with propagation condition pc to view.
Definition at line 258 of file complement.icc.
void Gecode::Set::ComplementView< View >::subscribe | ( | Space * | home, | |
Advisor * | a | |||
) | [inline] |
void Gecode::Set::ComplementView< View >::cancel | ( | Space * | home, | |
Advisor * | a | |||
) | [inline] |
void Gecode::Set::ComplementView< View >::update | ( | Space * | home, | |
bool | share, | |||
ComplementView< View > & | x | |||
) | [inline] |
Reflection::Arg * Gecode::Set::ComplementView< View >::spec | ( | const Space * | home, | |
Reflection::VarMap & | m | |||
) | const [inline] |
Return specification for this view, using variable map m.
Definition at line 300 of file complement.icc.
Support::Symbol Gecode::Set::ComplementView< View >::type | ( | void | ) | [inline, static] |
Return specification for this view, using variable map m.
Definition at line 306 of file complement.icc.
ModEvent Gecode::Set::ComplementView< View >::modevent | ( | const Delta * | d | ) | [inline, static] |
int Gecode::Set::ComplementView< View >::glbMin | ( | const Delta * | d | ) | const [inline] |
int Gecode::Set::ComplementView< View >::glbMax | ( | const Delta * | d | ) | const [inline] |
bool Gecode::Set::ComplementView< View >::glbAny | ( | const Delta * | d | ) | const [inline] |
int Gecode::Set::ComplementView< View >::lubMin | ( | const Delta * | d | ) | const [inline] |
int Gecode::Set::ComplementView< View >::lubMax | ( | const Delta * | d | ) | const [inline] |
bool Gecode::Set::ComplementView< View >::lubAny | ( | const Delta * | d | ) | const [inline] |
Friends And Related Function Documentation
bool same | ( | const Set::ComplementView< View > & | x, | |
const Set::ComplementView< View > & | y | |||
) | [related] |
bool before | ( | const Set::ComplementView< View > & | x, | |
const Set::ComplementView< View > & | y | |||
) | [related] |
Test whether view x comes before y (arbitrary order).
Definition at line 588 of file complement.icc.
bool same | ( | const Set::OffsetSetView< View > & | x, | |
const Set::OffsetSetView< View > & | y | |||
) | [related] |
bool before | ( | const Set::OffsetSetView< View > & | x, | |
const Set::OffsetSetView< View > & | y | |||
) | [related] |
std::ostream & operator<< | ( | std::ostream & | , | |
const Gecode::Set::ComplementView< View > & | ||||
) | [related] |
The documentation for this class was generated from the following files:
- gecode/set/view.icc (Revision: 7328)
- gecode/set/view/complement.icc (Revision: 7328)