38 namespace Gecode {
namespace Iter {
namespace Ranges {
92 unsigned int width(
void)
const;
102 :
r(r0),
c(0),
n(n0) {}
133 return static_cast<unsigned int>(
r[
c].
max-
r[
c].
min)+1;
void init(Range *r, int n)
Initialize with n ranges from r.
bool operator()(void) const
Test whether iterator is still at a range or done.
Gecode::FloatVal c(-8, 8)
int n
Number of ranges in array.
int n
Number of negative literals for node type.
int max(void) const
Return largest value of range.
Array(void)
Default constructor.
Range iterator for array of ranges
int min(void) const
Return smallest value of range.
Range * r
Array for ranges.
void reset(void)
Reset iterator to start from beginning.
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
Gecode toplevel namespace
void operator++(void)
Move iterator to next range (if possible)