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

Gecode::Set::SetView Class Reference
[Set views]

Set view for set variables More...

#include <view.hpp>

List of all members.

Related Functions

(Note that these are not member functions.)



template<class Char , class Traits >
std::basic_ostream< Char,
Traits > & 
operator<< (std::basic_ostream< Char, Traits > &os, const SetView &x)
 Print set variable view.

Constructors and initialization



 SetView (void)
 Default constructor.
 SetView (const SetVar &y)
 Initialize from set variable y.
 SetView (SetVarImp *y)
 Initialize from set variable implementation 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.

Delta information for advisors



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.
static ModEvent modevent (const Delta &d)
 Return modification event.

Detailed Description

Set view for set variables

Definition at line 60 of file view.hpp.


Constructor & Destructor Documentation

Gecode::Set::SetView::SetView ( void   )  [inline]

Default constructor.

Definition at line 52 of file set.hpp.

Gecode::Set::SetView::SetView ( const SetVar y  )  [inline]

Initialize from set variable y.

Definition at line 54 of file set.hpp.

Gecode::Set::SetView::SetView ( SetVarImp y  )  [inline]

Initialize from set variable implementation y.

Definition at line 57 of file set.hpp.


Member Function Documentation

unsigned int Gecode::Set::SetView::cardMin ( void   )  const [inline]

Return minimum cardinality.

Definition at line 86 of file set.hpp.

unsigned int Gecode::Set::SetView::cardMax ( void   )  const [inline]

Return maximum cardinality.

Definition at line 90 of file set.hpp.

int Gecode::Set::SetView::lubMin ( void   )  const [inline]

Return minimum of the least upper bound.

Definition at line 94 of file set.hpp.

int Gecode::Set::SetView::lubMax ( void   )  const [inline]

Return maximum of the least upper bound.

Definition at line 98 of file set.hpp.

int Gecode::Set::SetView::lubMinN ( unsigned int  n  )  const [inline]

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

Definition at line 102 of file set.hpp.

int Gecode::Set::SetView::glbMin ( void   )  const [inline]

Return minimum of the greatest lower bound.

Definition at line 106 of file set.hpp.

int Gecode::Set::SetView::glbMax ( void   )  const [inline]

Return maximum of the greatest lower bound.

Definition at line 110 of file set.hpp.

unsigned int Gecode::Set::SetView::glbSize ( void   )  const [inline]

Return the number of elements in the greatest lower bound.

Definition at line 66 of file set.hpp.

unsigned int Gecode::Set::SetView::lubSize ( void   )  const [inline]

Return the number of elements in the least upper bound.

Definition at line 70 of file set.hpp.

unsigned int Gecode::Set::SetView::unknownSize ( void   )  const [inline]

Return the number of unknown elements.

Definition at line 74 of file set.hpp.

bool Gecode::Set::SetView::contains ( int  i  )  const [inline]

Test whether i is in the greatest lower bound.

Definition at line 78 of file set.hpp.

bool Gecode::Set::SetView::notContains ( int  i  )  const [inline]

Test whether i is not in the least upper bound.

Definition at line 82 of file set.hpp.

ModEvent Gecode::Set::SetView::cardMin ( Space home,
unsigned int  m 
) [inline]

Restrict cardinality to be greater than or equal to m.

Definition at line 120 of file set.hpp.

ModEvent Gecode::Set::SetView::cardMax ( Space home,
unsigned int  m 
) [inline]

Restrict cardinality to be less than or equal to m.

Definition at line 125 of file set.hpp.

ModEvent Gecode::Set::SetView::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 130 of file set.hpp.

ModEvent Gecode::Set::SetView::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 160 of file set.hpp.

ModEvent Gecode::Set::SetView::include ( Space home,
int  i 
) [inline]

Update greatest lower bound to contain i.

Definition at line 135 of file set.hpp.

ModEvent Gecode::Set::SetView::exclude ( Space home,
int  i 
) [inline]

Restrict least upper bound to not contain i.

Definition at line 140 of file set.hpp.

ModEvent Gecode::Set::SetView::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 145 of file set.hpp.

ModEvent Gecode::Set::SetView::intersect ( Space home,
int  i 
) [inline]

Update least upper bound to contain at most the element i.

Definition at line 150 of file set.hpp.

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

Remove range sequence described by i from least upper bound.

Definition at line 164 of file set.hpp.

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

Include range sequence described by i in greatest lower bound.

Definition at line 155 of file set.hpp.

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

Intersect least upper bound with range sequence described by i.

Definition at line 168 of file set.hpp.

ModEvent Gecode::Set::SetView::modevent ( const Delta d  )  [inline, static]

Return modification event.

Reimplemented from Gecode::VarImpView< SetVar >.

Definition at line 179 of file set.hpp.

int Gecode::Set::SetView::glbMin ( const Delta d  )  const [inline]

Return minimum value just pruned from glb.

Definition at line 182 of file set.hpp.

int Gecode::Set::SetView::glbMax ( const Delta d  )  const [inline]

Return maximum value just pruned from glb.

Definition at line 185 of file set.hpp.

bool Gecode::Set::SetView::glbAny ( const Delta d  )  const [inline]

Test whether arbitrary values got pruned from glb.

Definition at line 188 of file set.hpp.

int Gecode::Set::SetView::lubMin ( const Delta d  )  const [inline]

Return minimum value just pruned from lub.

Definition at line 191 of file set.hpp.

int Gecode::Set::SetView::lubMax ( const Delta d  )  const [inline]

Return maximum value just pruned from lub.

Definition at line 194 of file set.hpp.

bool Gecode::Set::SetView::lubAny ( const Delta d  )  const [inline]

Test whether arbitrary values got pruned from lub.

Definition at line 197 of file set.hpp.


Friends And Related Function Documentation

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

Print set variable view.

Definition at line 85 of file print.hpp.


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