Generated on Wed Nov 1 15:05:22 2006 for Gecode by doxygen 1.4.5
Gecode::Set::SetView

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

Inherits Gecode::VariableViewBase< SetVarImp >.

List of all members.

Detailed Description

Set view for set variables

Definition at line 47 of file view.icc.

Constructors and initialization

 SetView (void)
 Default constructor.
 SetView (const SetVar &x)
 Initialize from set variable x.

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 lubMaxN (int n) const
 Return the n-th largest 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.

Cloning

void update (Space *home, bool share, SetView &x)
 Update this view to be a clone of view x.

Related Functions

(Note that these are not member functions.)

std::ostream & operator<< (std::ostream &, const Gecode::Set::SetView &)
 Print set variable view.

Constructor & Destructor Documentation

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

Default constructor.

Definition at line 36 of file set.icc.

Gecode::Set::SetView::SetView (  const SetVar &  x  )  [inline]
 

Initialize from set variable x.

Definition at line 38 of file set.icc.

Member Function Documentation

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

Return minimum cardinality.

Definition at line 66 of file set.icc.

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

Return maximum cardinality.

Definition at line 69 of file set.icc.

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

Return minimum of the least upper bound.

Definition at line 72 of file set.icc.

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

Return maximum of the least upper bound.

Definition at line 75 of file set.icc.

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

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

Definition at line 78 of file set.icc.

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

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

Definition at line 81 of file set.icc.

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

Return minimum of the greatest lower bound.

Definition at line 84 of file set.icc.

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

Return maximum of the greatest lower bound.

Definition at line 87 of file set.icc.

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

Return the number of elements in the greatest lower bound.

Definition at line 51 of file set.icc.

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

Return the number of elements in the least upper bound.

Definition at line 54 of file set.icc.

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

Return the number of unknown elements.

Definition at line 57 of file set.icc.

bool Gecode::Set::SetView::assigned (  void   )  const [inline]
 

Test whether view is assigned.

Definition at line 48 of file set.icc.

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

Test whether i is in the greatest lower bound.

Definition at line 60 of file set.icc.

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

Test whether i is not in the least upper bound.

Definition at line 63 of file set.icc.

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

Restrict cardinality to be greater than or equal to m.

Definition at line 95 of file set.icc.

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

Restrict cardinality to be less than or equal to m.

Definition at line 100 of file set.icc.

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 105 of file set.icc.

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 129 of file set.icc.

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

Update greatest lower bound to contain i.

Definition at line 109 of file set.icc.

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

Restrict least upper bound to not contain i.

Definition at line 113 of file set.icc.

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 117 of file set.icc.

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

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

Definition at line 121 of file set.icc.

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

Remove range sequence described by i from least upper bound.

Definition at line 133 of file set.icc.

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

Include range sequence described by i in greatest lower bound.

Definition at line 125 of file set.icc.

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

Intersect least upper bound with range sequence described by i.

Definition at line 138 of file set.icc.

void Gecode::Set::SetView::update (  Space *  home,
bool  share,
SetView &  x
)  [inline]
 

Update this view to be a clone of view x.

Definition at line 150 of file set.icc.

Friends And Related Function Documentation

std::ostream & operator<< (  std::ostream &  ,
const Gecode::Set::SetView & 
)  [related]
 

Print set variable view.

Definition at line 90 of file print.cc.

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