38 namespace Gecode {
namespace Int {
namespace ViewValGraph {
43 :
x(y), e(y->val_edges()) {
44 while ((
e != NULL) &&
e->used(
x))
58 }
while ((e != NULL) && e->used(
x));
64 return e->val(
x)->val();
IterPruneVal(ViewNode< View > *x)
Initialize with edges for view node x.
View nodes in view-value graph.
Edge< View > * e
Current value edge.
void operator++(void)
Move iterator to next value (if possible)
Node * x
Pointer to corresponding Boolean expression node.
int val(void) const
Return current value.
bool operator()(void) const
Test whether iterator is still at a value or done.
Gecode toplevel namespace
ViewNode< View > * x
View node.