Search tree edge for recomputation
More...
#include <path.hh>
Search tree edge for recomputation
Definition at line 61 of file path.hh.
Gecode::Search::Sequential::Path::Edge::Edge |
( |
void |
| ) |
|
|
inline |
Default constructor.
Definition at line 132 of file path.hh.
Gecode::Search::Sequential::Path::Edge::Edge |
( |
Space * |
s, |
|
|
Space * |
c |
|
) |
| |
|
inline |
Edge for space s with clone c (possibly NULL)
Definition at line 135 of file path.hh.
Space * Gecode::Search::Sequential::Path::Edge::space |
( |
void |
| ) |
const |
|
inline |
Return space for edge.
Definition at line 139 of file path.hh.
void Gecode::Search::Sequential::Path::Edge::space |
( |
Space * |
s | ) |
|
|
inline |
const Choice * Gecode::Search::Sequential::Path::Edge::choice |
( |
void |
| ) |
const |
|
inline |
Return choice.
Definition at line 161 of file path.hh.
unsigned int Gecode::Search::Sequential::Path::Edge::alt |
( |
void |
| ) |
const |
|
inline |
Return number for alternatives.
Definition at line 148 of file path.hh.
bool Gecode::Search::Sequential::Path::Edge::rightmost |
( |
void |
| ) |
const |
|
inline |
Test whether current alternative is rightmost.
Definition at line 152 of file path.hh.
void Gecode::Search::Sequential::Path::Edge::next |
( |
void |
| ) |
|
|
inline |
Move to next alternative.
Definition at line 156 of file path.hh.
void Gecode::Search::Sequential::Path::Edge::dispose |
( |
void |
| ) |
|
|
inline |
Free memory for edge.
Definition at line 166 of file path.hh.
Space* Gecode::Search::Sequential::Path::Edge::_space |
|
protected |
Space corresponding to this edge (might be NULL)
Definition at line 64 of file path.hh.
unsigned int Gecode::Search::Sequential::Path::Edge::_alt |
|
protected |
Current alternative.
Definition at line 66 of file path.hh.
const Choice* Gecode::Search::Sequential::Path::Edge::_choice |
|
protected |
The documentation for this class was generated from the following file: