Range iterator for integer sets.
More...
#include <int.hh>
|
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 integer sets.
Definition at line 292 of file int.hh.
◆ IntSetRanges() [1/2]
Gecode::IntSetRanges::IntSetRanges |
( |
void | | ) |
|
|
inline |
◆ IntSetRanges() [2/2]
Gecode::IntSetRanges::IntSetRanges |
( |
const IntSet & | s | ) |
|
|
inline |
◆ init()
void Gecode::IntSetRanges::init |
( |
const IntSet & | s | ) |
|
|
inline |
◆ operator()()
bool Gecode::IntSetRanges::operator() |
( |
void | | ) |
const |
|
inline |
◆ operator++()
void Gecode::IntSetRanges::operator++ |
( |
void | | ) |
|
|
inline |
Move iterator to next range (if possible)
Definition at line 250 of file int-set-1.hpp.
◆ min()
int Gecode::IntSetRanges::min |
( |
void | | ) |
const |
|
inline |
◆ max()
int Gecode::IntSetRanges::max |
( |
void | | ) |
const |
|
inline |
◆ width()
unsigned int Gecode::IntSetRanges::width |
( |
void | | ) |
const |
|
inline |
Return width of range (distance between minimum and maximum)
Definition at line 267 of file int-set-1.hpp.
The documentation for this class was generated from the following files: