Range iterator for least upper bound of constantly empty set view More...
#include <const.hpp>
Constructors and initialization | |
LubRanges (void) | |
Default constructor. | |
LubRanges (const EmptyView &x) | |
Initialize with ranges for view x. | |
void | init (const EmptyView &x) |
Initialize with ranges for view x. |
Iteration control | |
bool | operator() (void) const |
Test whether iterator is still at a range or done. | |
void | operator++ (void) |
Move iterator to next range (if possible) |
Range access | |
int | min (void) const |
Return smallest value of range. | |
int | max (void) const |
Return largest value of range. | |
unsigned int | width (void) const |
Return width of range (distance between minimum and maximum) |
Additional Inherited Members | |
Empty (void) | |
Default constructor. | |
void | init (void) |
Initialize. | |
bool | operator() (void) const |
Test whether iterator is still at a range or done. | |
void | operator++ (void) |
Move iterator to next range (if possible) | |
int | min (void) const |
Return smallest value of range. | |
int | max (void) const |
Return largest value of range. | |
unsigned int | width (void) const |
Return width of range (distance between minimum and maximum) |
Range iterator for least upper bound of constantly empty set view
|
inline |
|
inline |
|
inline |
bool Gecode::Set::LubRanges< EmptyView >::operator() | ( | void | ) | const |
Test whether iterator is still at a range or done.
void Gecode::Set::LubRanges< EmptyView >::operator++ | ( | void | ) |
Move iterator to next range (if possible)
int Gecode::Set::LubRanges< EmptyView >::min | ( | void | ) | const |
Return smallest value of range.
int Gecode::Set::LubRanges< EmptyView >::max | ( | void | ) | const |
Return largest value of range.
unsigned int Gecode::Set::LubRanges< EmptyView >::width | ( | void | ) | const |
Return width of range (distance between minimum and maximum)