38 namespace Gecode {
namespace Int {
namespace ViewValGraph {
42 _prev =
this; _next =
this;
64 l->_prev =
this; l->_next = _next;
65 _next->_prev =
l; _next =
l;
70 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.
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)
bool marked(void) const
Whether element is marked.
void unlink(void)
Unlink this element.
BiLink(void)
Initialize as empty (self referenced)
Gecode toplevel namespace
bool empty(void) const
Whether element has no previous and next element.
BiLink * next(void) const
Return next element.