Value nodes in view-value graph. More...
#include <view-val-graph.hh>
Public Member Functions | |
ValNode (int v) | |
Initialize with value v. More... | |
ValNode (int v, ValNode< View > *n) | |
Initialize with value v and successor n. More... | |
int | val (void) const |
Return value of node. More... | |
void | matching (Edge< View > *m) |
Set matching edge to m. More... | |
Edge< View > * | matching (void) const |
Return matching edge (NULL if unmatched) More... | |
ValNode< View > ** | next_val_ref (void) |
Return pointer to next value node fields. More... | |
ValNode< View > * | next_val (void) const |
Return next value node. More... | |
void | next_val (ValNode< View > *v) |
Set next value node to v. More... | |
![]() | |
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... | |
Protected Attributes | |
const int | _val |
The value of the node. More... | |
Edge< View > * | _matching |
The matching edge. More... | |
ValNode< View > * | _next_val |
The next value node. More... | |
Additional Inherited Members | |
![]() | |
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... | |
![]() | |
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 |
Value nodes in view-value graph.
Definition at line 146 of file view-val-graph.hh.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
protected |
The value of the node.
Definition at line 149 of file view-val-graph.hh.
|
protected |
The matching edge.
Definition at line 151 of file view-val-graph.hh.
|
protected |
The next value node.
Definition at line 153 of file view-val-graph.hh.