Gecode::Iter::Ranges::Virt::ComplVal Class Reference
[Range iterators with virtual member functions]
Inherits Gecode::Iter::Ranges::MinMax, and Gecode::Iter::Ranges::Virt::Iterator.
Detailed Description
Range iterator for computing the complement (described by values).The complement is computed with respect to a given universe set provided as arguments upon initialization. The universe must always be a superset!
Definition at line 100 of file virtual-ranges-compl.icc.
Constructors and initialization | |
ComplVal (void) | |
Default constructor. | |
ComplVal (int umin, int umax, Iterator *i) | |
Initialize with iterator i. | |
~ComplVal (void) | |
Destructor. | |
Range access | |
virtual int | min (void) const |
Return smallest value of range. | |
virtual int | max (void) const |
Return largest value of range. | |
virtual unsigned int | width (void) const |
Return width of range (distance between minimum and maximum). | |
Iteration control | |
void | operator++ (void) |
Move iterator to next range (if possible). | |
virtual bool | operator() (void) |
Test whether iterator is still at a range or done. | |
Protected Member Functions | |
void | start (void) |
Initialize. | |
Protected Attributes | |
int | UMIN |
Values describing the universe set. | |
int | UMAX |
Iterator * | i |
Iterator to compute complement for. |
Constructor & Destructor Documentation
Gecode::Iter::Ranges::Virt::ComplVal::ComplVal | ( | void | ) | [inline] |
Gecode::Iter::Ranges::Virt::ComplVal::ComplVal | ( | int | umin, | |
int | umax, | |||
Iterator * | i | |||
) | [inline] |
Gecode::Iter::Ranges::Virt::ComplVal::~ComplVal | ( | void | ) | [inline] |
Member Function Documentation
void Gecode::Iter::Ranges::Virt::ComplVal::start | ( | void | ) | [inline, protected] |
int Gecode::Iter::Ranges::Virt::ComplVal::min | ( | void | ) | const [inline, virtual] |
Return smallest value of range.
Reimplemented from Gecode::Iter::Ranges::MinMax.
Definition at line 250 of file virtual-ranges-compl.icc.
int Gecode::Iter::Ranges::Virt::ComplVal::max | ( | void | ) | const [inline, virtual] |
Return largest value of range.
Reimplemented from Gecode::Iter::Ranges::MinMax.
Definition at line 253 of file virtual-ranges-compl.icc.
unsigned int Gecode::Iter::Ranges::Virt::ComplVal::width | ( | void | ) | const [inline, virtual] |
Return width of range (distance between minimum and maximum).
Reimplemented from Gecode::Iter::Ranges::MinMax.
Definition at line 256 of file virtual-ranges-compl.icc.
void Gecode::Iter::Ranges::Virt::ComplVal::operator++ | ( | void | ) | [inline, virtual] |
Move iterator to next range (if possible).
Implements Gecode::Iter::Ranges::Virt::Iterator.
Definition at line 235 of file virtual-ranges-compl.icc.
bool Gecode::Iter::Ranges::Virt::ComplVal::operator() | ( | void | ) | [inline, virtual] |
Test whether iterator is still at a range or done.
Implements Gecode::Iter::Ranges::Virt::Iterator.
Definition at line 247 of file virtual-ranges-compl.icc.
Member Data Documentation
int Gecode::Iter::Ranges::Virt::ComplVal::UMIN [protected] |
int Gecode::Iter::Ranges::Virt::ComplVal::UMAX [protected] |
Definition at line 103 of file virtual-ranges-compl.icc.
Iterator* Gecode::Iter::Ranges::Virt::ComplVal::i [protected] |
The documentation for this class was generated from the following file:
- gecode/iter/virtual-ranges-compl.icc (Revision: 4973)