39 :
x(
y),
e(
y->val_edges()) {
40 while ((
e != NULL) &&
e->used(
x))
54 }
while ((
e != NULL) &&
e->used(
x));
60 return e->val(
x)->val();
ViewNode< View > * x
View node.
int val(void) const
Return current value.
IterPruneVal(ViewNode< View > *x)
Initialize with edges for view node x.
void operator++(void)
Move iterator to next value (if possible)
bool operator()(void) const
Test whether iterator is still at a value or done.
Edge< View > * e
Current value edge.
View nodes in view-value graph.
Support classes for propagators using a view-value graph.
Gecode toplevel namespace
Post propagator for SetVar SetOpType SetVar y