38 _prev =
this; _next =
this;
60 l->_prev =
this; l->_next = _next;
61 _next->_prev = l; _next = l;
66 p->_next = n; n->_prev = p;
Bidirectional links for edges and anchors in nodes of view-value graph.
BiLink * prev(void) const
Return previous element.
void add(BiLink *l)
Add l after this element.
void unlink(void)
Unlink this element.
BiLink(void)
Initialize as empty (self referenced)
bool empty(void) const
Whether element has no previous and next element.
bool marked(void) const
Whether element is marked.
void mark(void)
Mark element (invalidates next element pointer)
BiLink * next(void) const
Return next element.
Support classes for propagators using a view-value graph.
Gecode toplevel namespace