34 namespace Gecode {
namespace Int {
namespace ViewValGraph {
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.
int p
Number of positive literals for node type.
void add(BiLink *l)
Add l after this element.
int n
Number of negative literals for node type.
void mark(void)
Mark element (invalidates next element pointer)
BiLink * next(void) const
Return next element.
bool marked(void) const
Whether element is marked.
void unlink(void)
Unlink this element.
BiLink(void)
Initialize as empty (self referenced)
Gecode toplevel namespace
BiLink * prev(void) const
Return previous element.
bool empty(void) const
Whether element has no previous and next element.