34namespace Gecode {
namespace Int {
namespace ViewValGraph {
65 return home.ralloc(s);
77 : _val(v), _matching(NULL) {}
81 : _val(v), _matching(NULL), _next_val(
n) {}
123 : _view(View(NULL)) {}
127 : _size(
x.size()), _view(
x) {}
141 return _view.varimp() == NULL;
151 return _size != _view.size();
156 _size = _view.size();
int n
Number of negative literals for node type.
Bidirectional links for edges and anchors in nodes of view-value graph.
BiLink * next(void) const
Return next element.
Edges in view-value graph.
Base-class for nodes (both view and value nodes)
Edge< View > * edge_fst(void) const
Return first edge (organized by bi-links)
Edge< View > * edge_lst(void) const
Return last edge (organized by bi-links)
Value nodes in view-value graph.
ValNode(int v)
Initialize with value v.
Edge< View > * matching(void) const
Return matching edge (NULL if unmatched)
ValNode< View > * next_val(void) const
Return next value node.
int val(void) const
Return value of node.
ValNode< View > ** next_val_ref(void)
Return pointer to next value node fields.
bool matched(void) const
Whether the node is matched.
View view(void) const
Return view.
void update(void)
Update size of view after change.
Edge< View > * val_edges(void) const
Return first edge of all value edges.
Edge< View > ** val_edges_ref(void)
Return pointer to first edge fields of all value edges.
bool fake(void) const
Test whether node has a fake view.
bool changed(void) const
Return whether view has changed its size.
ViewNode(void)
Initialize node for a non-view.
Gecode toplevel namespace
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Post propagator for SetVar x