Backward iterator for ranges of integer variable implementations. More...
#include <var-imp.hpp>
Constructors and initialization | |
| IntVarImpBwd (void) | |
| Default constructor. | |
| IntVarImpBwd (const IntVarImp *x) | |
| Initialize with ranges from variable implementation x. | |
| void | init (const IntVarImp *x) |
| Initialize with ranges from variable implementation x. | |
Iteration control | |
| bool | operator() (void) const |
| Test whether iterator is still at a range or done. | |
| void | operator++ (void) |
| Move iterator to previous 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) | |
Backward iterator for ranges of integer variable implementations.
Note that this iterator is not a range iterator as the ranges are not iterated in increasing but in decreasing order.
Definition at line 430 of file var-imp.hpp.
| Gecode::Int::IntVarImpBwd::IntVarImpBwd | ( | void | ) | [inline] |
| Gecode::Int::IntVarImpBwd::IntVarImpBwd | ( | const IntVarImp * | x | ) | [inline] |
| void Gecode::Int::IntVarImpBwd::init | ( | const IntVarImp * | x | ) | [inline] |
| bool Gecode::Int::IntVarImpBwd::operator() | ( | void | ) | const [inline] |
| void Gecode::Int::IntVarImpBwd::operator++ | ( | void | ) | [inline] |
| int Gecode::Int::IntVarImpBwd::min | ( | void | ) | const [inline] |
Return smallest value of range.
Reimplemented in Gecode::Int::ViewRanges< MinusView >.
| int Gecode::Int::IntVarImpBwd::max | ( | void | ) | const [inline] |
Return largest value of range.
Reimplemented in Gecode::Int::ViewRanges< MinusView >.
| unsigned int Gecode::Int::IntVarImpBwd::width | ( | void | ) | const [inline] |