40 namespace Gecode {
namespace Int {
namespace ViewValGraph {
45 : view(NULL), val(NULL), n_view(0), n_val(0),
count(1U) {}
59 while (xi() && (*v != NULL)) {
60 if ((*v)->val() == xi.val()) {
64 v = (*v)->next_val_ref();
66 }
else if ((*v)->val() < xi.val()) {
68 v = (*v)->next_val_ref();
100 if (!e->
val(x)->matching()) {
105 e->
val(x)->matching()->revert(e->
val(x));
119 x = e->
val(x)->matching()->view(e->
val(x));
126 x = m.
pop(); e = x->
iter;
goto next;
135 if (
count > (UINT_MAX >> 1)) {
137 for (
int i=n_view;
i--; )
153 unsigned int cnt0 =
count;
154 unsigned int cnt1 =
count;
156 for (
int i = n_view;
i--; )
177 if (e->
dst(w)->low < w->
min)
192 if (!visit.
empty()) {
193 w=visit.
pop(); e=w->
iter;
goto next;