
Range iterator for the least upper bound. More...
#include <var-imp.hpp>
Constructors and initialization | |
| LubRanges (void) | |
| Default constructor. More... | |
| LubRanges (const T &x) | |
| Initialize with least upper bound ranges for set variable x. More... | |
| void | init (const T &x) |
| Initialize with least upper bound ranges for set variable x. More... | |
Iteration control | |
| bool | operator() (void) const |
| Test whether iterator is still at a range or done. More... | |
| void | operator++ (void) |
| Move iterator to next range (if possible) More... | |
Range access | |
| int | min (void) const |
| Return smallest value of range. More... | |
| int | max (void) const |
| Return largest value of range. More... | |
| unsigned int | width (void) const |
| Return width of range (distance between minimum and maximum) More... | |
Range iterator for the least upper bound.
This class provides (by specialization) a range iterator for the least upper bounds of all set views.
Note that this template class serves only as a specification of the interface of the various specializations.
Definition at line 321 of file var-imp.hpp.
| Gecode::Set::LubRanges< T >::LubRanges | ( | void | ) |
Default constructor.
| Gecode::Set::LubRanges< T >::LubRanges | ( | const T & | x | ) |
Initialize with least upper bound ranges for set variable x.
| void Gecode::Set::LubRanges< T >::init | ( | const T & | x | ) |
Initialize with least upper bound ranges for set variable x.
| bool Gecode::Set::LubRanges< T >::operator() | ( | void | ) | const |
Test whether iterator is still at a range or done.
| void Gecode::Set::LubRanges< T >::operator++ | ( | void | ) |
Move iterator to next range (if possible)
| int Gecode::Set::LubRanges< T >::min | ( | void | ) | const |
Return smallest value of range.
| int Gecode::Set::LubRanges< T >::max | ( | void | ) | const |
Return largest value of range.
| unsigned int Gecode::Set::LubRanges< T >::width | ( | void | ) | const |
Return width of range (distance between minimum and maximum)