38 namespace Gecode {
namespace Iter {
namespace Values {
46 template<
class I,
class J>
63 void init(I& i, J& j);
82 template<
class I,
class J>
86 template<
class I,
class J>
90 while (
i() && j() && (
i.val() < j.val()))
92 while (
i() && j() && (j.val() <
i.val()))
94 }
while (
i() && j() && (
i.val() != j.val()));
97 template<
class I,
class J>
103 template<
class I,
class J>
109 template<
class I,
class J>
115 template<
class I,
class J>
121 template<
class I,
class J>
124 assert(
i.val() == j.val());
void next(void)
Find next element from intersection.
void init(I &i, J &j)
Initialize with values from i and j.
int val(void) const
Return current value.
Gecode::IntArgs i(4, 1, 2, 3, 4)
void operator++(void)
Move iterator to next value (if possible)
Value iterator for the intersection of two value iterators.
Gecode toplevel namespace
bool operator()(void) const
Test whether iterator is still at a value or done.
Inter(void)
Default constructor.