Public Member Functions |
Static Public Member Functions |
Protected Attributes |
List of all members
Gecode::Int::ViewValGraph::Edge< View > Class Template Reference
Edges in view-value graph. More...
#include <gecode/int/view-val-graph.hh>
Public Member Functions | |
| Edge (ValNode< View > *v, ViewNode< View > *x) | |
| Construct new edge between x and v. | |
| Edge (ValNode< View > *v, ViewNode< View > *x, Edge< View > *n) | |
| Construct new edge between x and v with next edge n. | |
| Node< View > * | dst (Node< View > *s) const |
| Return destination of edge when source s is given. | |
| ViewNode< View > * | view (ValNode< View > *v) const |
| Return view node when value node v is given. | |
| ValNode< View > * | val (ViewNode< View > *x) const |
| Return value node when view node x is given. | |
| bool | used (Node< View > *v) const |
| Whether edge is used (marked or between nodes from the same scc). | |
| void | use (void) |
| Mark node as used. | |
| void | free (void) |
| Unmark node as used. | |
| void | revert (Node< View > *d) |
| Revert edge to node d for matching. | |
| Edge< View > * | next_edge (void) const |
| Return next edge in list of value edges. | |
| Edge< View > ** | next_edge_ref (void) |
| Return reference to next edge in list of value edges. | |
| Edge< View > * | next (void) const |
| Return next edge in list of edges per node. | |
| Public Member Functions inherited from Gecode::Int::ViewValGraph::BiLink | |
| BiLink (void) | |
| Initialize as empty (self referenced). | |
| BiLink * | prev (void) const |
| Return previous element. | |
| BiLink * | next (void) const |
| Return next element. | |
| void | prev (BiLink *l) |
| Set previous element to l. | |
| void | next (BiLink *l) |
| Set next element to l. | |
| void | add (BiLink *l) |
| Add l after this element. | |
| void | unlink (void) |
| Unlink this element. | |
| void | mark (void) |
| Mark element (invalidates next element pointer). | |
| bool | marked (void) const |
| Whether element is marked. | |
| bool | empty (void) const |
| Whether element has no previous and next element. | |
Static Public Member Functions | |
| static void * | operator new (size_t, Space &) |
| Allocate memory from space. | |
| static void | operator delete (void *, size_t) |
| Needed for exceptions. | |
| static void | operator delete (void *, Space &) |
| Needed for exceptions. | |
Protected Attributes | |
| Edge< View > * | _next_edge |
| Next edge in chain of value edges. | |
| CombPtrFlag< Node< View > > | sd |
| Combine source and destination node and flag. | |
Detailed Description
template<class View>
class Gecode::Int::ViewValGraph::Edge< View >
class Gecode::Int::ViewValGraph::Edge< View >
Edges in view-value graph.
Definition at line 208 of file view-val-graph.hh.
Constructor & Destructor Documentation
◆ Edge() [1/2]
◆ Edge() [2/2]
Member Function Documentation
◆ dst()
◆ view()
◆ val()
◆ used()
template<class View>
|
inline |
◆ use()
template<class View>
|
inline |
◆ free()
template<class View>
|
inline |
◆ revert()
template<class View>
|
inline |
◆ next_edge()
template<class View>
|
inline |
◆ next_edge_ref()
template<class View>
|
inline |
◆ next()
template<class View>
|
inline |
◆ operator new()
template<class View>
|
inlinestatic |
◆ operator delete() [1/2]
template<class View>
|
inlinestatic |
◆ operator delete() [2/2]
template<class View>
|
inlinestatic |
Member Data Documentation
◆ _next_edge
template<class View>
|
protected |
Next edge in chain of value edges.
Definition at line 211 of file view-val-graph.hh.
◆ sd
template<class View>
|
protected |
Combine source and destination node and flag.
Definition at line 213 of file view-val-graph.hh.
The documentation for this class was generated from the following files:
- gecode/int/view-val-graph.hh
- gecode/int/view-val-graph/edge.hpp
