Base-class for nodes (both view and value nodes) More...
#include <view-val-graph.hh>
Public Member Functions | |
Node (void) | |
Initialize. More... | |
Edge< View > * | edge_fst (void) const |
Return first edge (organized by bi-links) More... | |
Edge< View > * | edge_lst (void) const |
Return last edge (organized by bi-links) More... | |
![]() | |
BiLink (void) | |
Initialize as empty (self referenced) More... | |
BiLink * | prev (void) const |
Return previous element. More... | |
BiLink * | next (void) const |
Return next element. More... | |
void | prev (BiLink *l) |
Set previous element to l. More... | |
void | next (BiLink *l) |
Set next element to l. More... | |
void | add (BiLink *l) |
Add l after this element. More... | |
void | unlink (void) |
Unlink this element. More... | |
void | mark (void) |
Mark element (invalidates next element pointer) More... | |
bool | marked (void) const |
Whether element is marked. More... | |
bool | empty (void) const |
Whether element has no previous and next element. More... | |
Static Public Member Functions | |
static void * | operator new (size_t, Space &) |
Allocate memory from space. More... | |
static void | operator delete (void *, size_t) |
Needed for exceptions. More... | |
static void | operator delete (void *, Space &) |
Needed for exceptions. More... | |
Public Attributes | |
Edge< View > * | iter |
Next edge for computing strongly connected components. More... | |
unsigned int | low |
Values for computing strongly connected components. More... | |
unsigned int | min |
unsigned int | comp |
Base-class for nodes (both view and value nodes)
Note: the obvious ill-design to have also nodes and edges parametric wrt View is because the right design (having template function members) gets miscompiled (and actually not even compiled with some C++ compilers). Duh!
Definition at line 120 of file view-val-graph.hh.
|
inline |
|
inline |
|
inline |
|
inlinestatic |
|
inlinestatic |
|
inlinestatic |
Edge<View>* Gecode::Int::ViewValGraph::Node< View >::iter |
Next edge for computing strongly connected components.
Definition at line 123 of file view-val-graph.hh.
unsigned int Gecode::Int::ViewValGraph::Node< View >::low |
Values for computing strongly connected components.
Definition at line 125 of file view-val-graph.hh.
unsigned int Gecode::Int::ViewValGraph::Node< View >::min |
Definition at line 125 of file view-val-graph.hh.
unsigned int Gecode::Int::ViewValGraph::Node< View >::comp |
Definition at line 125 of file view-val-graph.hh.