Search tree edge for recomputation More...
#include <path.hh>
Public Member Functions | |
Edge (void) | |
Default constructor. | |
Edge (Space *s, Space *c) | |
Edge for space s with clone c (possibly NULL) | |
Space * | space (void) const |
Return space for edge. | |
void | space (Space *s) |
Set space to s. | |
const Choice * | choice (void) const |
Return choice. | |
unsigned int | alt (void) const |
Return number for alternatives. | |
bool | rightmost (void) const |
Test whether current alternative is rightmost. | |
void | next (void) |
Move to next alternative. | |
void | dispose (void) |
Free memory for edge. | |
Protected Attributes | |
Space * | _space |
Space corresponding to this edge (might be NULL) | |
unsigned int | _alt |
Current alternative. | |
const Choice * | _choice |
Choice. |
Gecode::Search::Sequential::Path::Edge::Edge | ( | void | ) | [inline] |
Gecode::Search::Sequential::Path::Edge::Edge | ( | Space * | s, |
Space * | c | ||
) | [inline] |
Space * Gecode::Search::Sequential::Path::Edge::space | ( | void | ) | const [inline] |
void Gecode::Search::Sequential::Path::Edge::space | ( | Space * | s | ) | [inline] |
const Choice * Gecode::Search::Sequential::Path::Edge::choice | ( | void | ) | const [inline] |
unsigned int Gecode::Search::Sequential::Path::Edge::alt | ( | void | ) | const [inline] |
bool Gecode::Search::Sequential::Path::Edge::rightmost | ( | void | ) | const [inline] |
void Gecode::Search::Sequential::Path::Edge::next | ( | void | ) | [inline] |
void Gecode::Search::Sequential::Path::Edge::dispose | ( | void | ) | [inline] |
Space* Gecode::Search::Sequential::Path::Edge::_space [protected] |
unsigned int Gecode::Search::Sequential::Path::Edge::_alt [protected] |
const Choice* Gecode::Search::Sequential::Path::Edge::_choice [protected] |