34 namespace Gecode {
namespace Iter {
namespace Values {
42 template<
class I,
class J>
59 void init(I& i, J& j);
78 template<
class I,
class J>
82 template<
class I,
class J>
86 while (
i() &&
j() && (
i.val() <
j.val()))
88 while (
i() &&
j() && (
j.val() <
i.val()))
90 }
while (
i() &&
j() && (
i.val() !=
j.val()));
93 template<
class I,
class J>
99 template<
class I,
class J>
105 template<
class I,
class J>
111 template<
class I,
class J>
117 template<
class I,
class J>
120 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.
void operator++(void)
Move iterator to next value (if possible)
Value iterator for the intersection of two value iterators.
int val(void) const
Return current value.
bool operator()(void) const
Test whether iterator is still at a value or done.
Gecode toplevel namespace
Inter(void)
Default constructor.