|
| Diff (void) |
| Default constructor.
|
|
| Diff (LubRanges< T > &i, GlbRanges< T > &j) |
| Initialize with iterator i and j.
|
|
void | init (LubRanges< T > &i, GlbRanges< T > &j) |
| Initialize with iterator i and j.
|
|
void | operator++ (void) |
| Move iterator to next range (if possible)
|
|
| MinMax (void) |
| Default constructor.
|
|
| MinMax (int min, int max) |
| Initialize with range min to max.
|
|
bool | operator() (void) const |
| Test whether iterator is still at a range or done.
|
|
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)
|
|
void | finish (void) |
| Set range such that iteration stops
|
|
LubRanges< T > | i |
| Iterator from which to subtract.
|
|
GlbRanges< T > | j |
| Iterator to be subtracted.
|
|
int | mi |
| Minimum of current range.
|
|
int | ma |
| Maximum of current range.
|
|
template<class T>
class Gecode::Set::UnknownRanges< T >
Range iterator for the unknown set.
This class provides a range iterator for the unknown set of all set views. The unknown set is the difference between least upper and greatest lower bound, i.e. those elements which still may be in the set, but are not yet known to be in.
Definition at line 402 of file var-imp.hpp.