Generated on Fri Mar 20 15:57:10 2015 for Gecode by doxygen 1.6.3

Gecode::Set::ComplementView< View > Class Template Reference
[Set views]

Complement set view. More...

#include <view.hpp>

List of all members.

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 Char , class Traits , class View >
std::basic_ostream< Char,
Traits > & 
operator<< (std::basic_ostream< Char, Traits > &os, const ComplementView< View > &x)
 Print complement set view.

View-dependent propagator support



static void schedule (Space &home, Propagator &p, ModEvent me)
 Schedule propagator p with modification event me.
static ModEvent me (const ModEventDelta &med)
 Return modification event for view type in med.
static ModEventDelta med (ModEvent)
 Translate modification event me to modification event delta for view.

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 &y)
 Initialize with set view y.

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 (unsigned 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 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 schedule=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.

Detailed Description

template<class View>
class Gecode::Set::ComplementView< View >

Complement set view.

A complement set view $s$ for a set view $t$ provides operations such that $s$ behaves like the complement of $\{t\}$. The complement is defined in terms of the set universe.

Definition at line 754 of file view.hpp.


Constructor & Destructor Documentation

template<class View >
Gecode::Set::ComplementView< View >::ComplementView ( void   )  [inline]

Default constructor.

Definition at line 48 of file complement.hpp.

template<class View >
Gecode::Set::ComplementView< View >::ComplementView ( View &  y  )  [inline, explicit]

Initialize with set view y.

Definition at line 52 of file complement.hpp.


Member Function Documentation

template<class View >
PropCond Gecode::Set::ComplementView< View >::pc_negateset ( PropCond  pc  )  [inline, static]

Negate the propagation condition pc.

Definition at line 69 of file complement.hpp.

template<class View >
ModEvent Gecode::Set::ComplementView< View >::me_negateset ( ModEvent  me  )  [inline, static]

Negate the modification event me.

Definition at line 57 of file complement.hpp.

template<class View >
unsigned int Gecode::Set::ComplementView< View >::cardMin ( void   )  const [inline]

Return minimum cardinality.

Definition at line 105 of file complement.hpp.

template<class View >
unsigned int Gecode::Set::ComplementView< View >::cardMax ( void   )  const [inline]

Return maximum cardinality.

Definition at line 111 of file complement.hpp.

template<class View >
int Gecode::Set::ComplementView< View >::lubMin ( void   )  const [inline]

Return minimum of the least upper bound.

Definition at line 117 of file complement.hpp.

template<class View >
int Gecode::Set::ComplementView< View >::lubMax ( void   )  const [inline]

Return maximum of the least upper bound.

Definition at line 129 of file complement.hpp.

template<class View>
int Gecode::Set::ComplementView< View >::lubMinN ( unsigned int  n  )  const

Return n-th smallest element of the least upper bound.

template<class View >
int Gecode::Set::ComplementView< View >::glbMin ( void   )  const [inline]

Return minimum of the greatest lower bound.

Definition at line 142 of file complement.hpp.

template<class View >
int Gecode::Set::ComplementView< View >::glbMax ( void   )  const [inline]

Return maximum of the greatest lower bound.

Definition at line 154 of file complement.hpp.

template<class View >
unsigned int Gecode::Set::ComplementView< View >::glbSize ( void   )  const [inline]

Return the number of elements in the greatest lower bound.

Definition at line 79 of file complement.hpp.

template<class View >
unsigned int Gecode::Set::ComplementView< View >::lubSize ( void   )  const [inline]

Return the number of elements in the least upper bound.

Definition at line 85 of file complement.hpp.

template<class View >
unsigned int Gecode::Set::ComplementView< View >::unknownSize ( void   )  const [inline]

Return the number of unknown elements.

Definition at line 91 of file complement.hpp.

template<class View >
bool Gecode::Set::ComplementView< View >::contains ( int  i  )  const [inline]

Test whether i is in the greatest lower bound.

Definition at line 97 of file complement.hpp.

template<class View >
bool Gecode::Set::ComplementView< View >::notContains ( int  i  )  const [inline]

Test whether i is not in the least upper bound.

Definition at line 101 of file complement.hpp.

template<class View >
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 167 of file complement.hpp.

template<class View >
ModEvent Gecode::Set::ComplementView< View >::cardMax ( Space home,
unsigned int  m 
) [inline]

Restrict cardinality to be less than or equal to m.

Definition at line 175 of file complement.hpp.

template<class View >
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 211 of file complement.hpp.

template<class View >
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 217 of file complement.hpp.

template<class View >
ModEvent Gecode::Set::ComplementView< View >::include ( Space home,
int  i 
) [inline]

Update greatest lower bound to contain i.

Definition at line 183 of file complement.hpp.

template<class View >
ModEvent Gecode::Set::ComplementView< View >::exclude ( Space home,
int  i 
) [inline]

Restrict least upper bound to not contain i.

Definition at line 189 of file complement.hpp.

template<class View >
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 203 of file complement.hpp.

template<class View >
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 195 of file complement.hpp.

template<class View >
template<class I >
ModEvent Gecode::Set::ComplementView< View >::excludeI ( Space home,
I &  i 
) [inline]

Remove range sequence described by i from least upper bound.

Definition at line 223 of file complement.hpp.

template<class View >
template<class I >
ModEvent Gecode::Set::ComplementView< View >::includeI ( Space home,
I &  i 
) [inline]

Include range sequence described by i in greatest lower bound.

Definition at line 229 of file complement.hpp.

template<class View >
template<class I >
ModEvent Gecode::Set::ComplementView< View >::intersectI ( Space home,
I &  iter 
) [inline]

Intersect least upper bound with range sequence described by i.

Definition at line 235 of file complement.hpp.

template<class View >
void Gecode::Set::ComplementView< View >::schedule ( Space home,
Propagator p,
ModEvent  me 
) [inline, static]

Schedule propagator p with modification event me.

Reimplemented from Gecode::DerivedView< View >.

Definition at line 267 of file complement.hpp.

template<class View >
ModEvent Gecode::Set::ComplementView< View >::me ( const ModEventDelta med  )  [inline, static]

Return modification event for view type in med.

Reimplemented from Gecode::DerivedView< View >.

Definition at line 272 of file complement.hpp.

template<class View >
ModEventDelta Gecode::Set::ComplementView< View >::med ( ModEvent  me  )  [inline, static]

Translate modification event me to modification event delta for view.

Reimplemented from Gecode::DerivedView< View >.

Definition at line 278 of file complement.hpp.

template<class View >
void Gecode::Set::ComplementView< View >::subscribe ( Space home,
Propagator p,
PropCond  pc,
bool  schedule = true 
) [inline]

Subscribe propagator p with propagation condition pc to view.

In case schedule is false, the propagator is just subscribed but not scheduled for execution (this must be used when creating subscriptions during propagation).

Reimplemented from Gecode::DerivedView< View >.

Definition at line 242 of file complement.hpp.

template<class View >
void Gecode::Set::ComplementView< View >::cancel ( Space home,
Propagator p,
PropCond  pc 
) [inline]

Cancel subscription of propagator p with propagation condition pc to view.

Reimplemented from Gecode::DerivedView< View >.

Definition at line 249 of file complement.hpp.

template<class View >
void Gecode::Set::ComplementView< View >::subscribe ( Space home,
Advisor a 
) [inline]

Subscribe advisor a to view.

Reimplemented from Gecode::DerivedView< View >.

Definition at line 255 of file complement.hpp.

template<class View >
void Gecode::Set::ComplementView< View >::cancel ( Space home,
Advisor a 
) [inline]

Cancel subscription of advisor a.

Reimplemented from Gecode::DerivedView< View >.

Definition at line 261 of file complement.hpp.

template<class View >
ModEvent Gecode::Set::ComplementView< View >::modevent ( const Delta d  )  [inline, static]

Return modification event.

Reimplemented from Gecode::DerivedView< View >.

Definition at line 289 of file complement.hpp.

template<class View >
int Gecode::Set::ComplementView< View >::glbMin ( const Delta d  )  const [inline]

Return minimum value just pruned from glb.

Definition at line 295 of file complement.hpp.

template<class View >
int Gecode::Set::ComplementView< View >::glbMax ( const Delta d  )  const [inline]

Return maximum value just pruned from glb.

Definition at line 301 of file complement.hpp.

template<class View >
bool Gecode::Set::ComplementView< View >::glbAny ( const Delta d  )  const [inline]

Test whether arbitrary values got pruned from glb.

Definition at line 307 of file complement.hpp.

template<class View >
int Gecode::Set::ComplementView< View >::lubMin ( const Delta d  )  const [inline]

Return minimum value just pruned from lub.

Definition at line 313 of file complement.hpp.

template<class View >
int Gecode::Set::ComplementView< View >::lubMax ( const Delta d  )  const [inline]

Return maximum value just pruned from lub.

Definition at line 319 of file complement.hpp.

template<class View >
bool Gecode::Set::ComplementView< View >::lubAny ( const Delta d  )  const [inline]

Test whether arbitrary values got pruned from lub.

Definition at line 325 of file complement.hpp.


Friends And Related Function Documentation

template<class Char , class Traits , class View >
std::basic_ostream< Char, Traits > & operator<< ( std::basic_ostream< Char, Traits > &  os,
const ComplementView< View > &  x 
) [related]

Print complement set view.

Definition at line 546 of file complement.hpp.


The documentation for this class was generated from the following files: