Gecode::Search::Parallel::Path::Edge Class Reference
Search tree edge for recomputation
More...
#include <path.hh>
List of all members.
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.
|
| bool | work (void) const |
| | Test whether there is an alternative that can be stolen.
|
| void | next (void) |
| | Move to next alternative.
|
| unsigned int | steal (void) |
| | Steal rightmost alternative and return its number.
|
| void | dispose (void) |
| | Free memory for edge.
|
Protected Attributes |
| Space * | _space |
| | Space corresponding to this edge (might be NULL).
|
| unsigned int | _alt |
| | Current alternative.
|
| unsigned int | _alt_max |
| | Number of alternatives left.
|
| const Choice * | _choice |
| | Choice.
|
Detailed Description
Search tree edge for recomputation
Definition at line 61 of file path.hh.
Constructor & Destructor Documentation
| Gecode::Search::Parallel::Path::Edge::Edge |
( |
void |
|
) |
[inline] |
Default constructor.
Definition at line 144 of file path.hh.
| Gecode::Search::Parallel::Path::Edge::Edge |
( |
Space * |
s, |
|
|
Space * |
c | |
|
) |
| | [inline] |
Edge for space s with clone c (possibly NULL).
Definition at line 147 of file path.hh.
Member Function Documentation
| Space * Gecode::Search::Parallel::Path::Edge::space |
( |
void |
|
) |
const [inline] |
Return space for edge.
Definition at line 153 of file path.hh.
| void Gecode::Search::Parallel::Path::Edge::space |
( |
Space * |
s |
) |
[inline] |
| const Choice * Gecode::Search::Parallel::Path::Edge::choice |
( |
void |
|
) |
const [inline] |
Return choice.
Definition at line 184 of file path.hh.
| unsigned int Gecode::Search::Parallel::Path::Edge::alt |
( |
void |
|
) |
const [inline] |
Return number for alternatives.
Definition at line 162 of file path.hh.
| bool Gecode::Search::Parallel::Path::Edge::rightmost |
( |
void |
|
) |
const [inline] |
Test whether current alternative is rightmost.
Definition at line 166 of file path.hh.
| bool Gecode::Search::Parallel::Path::Edge::work |
( |
void |
|
) |
const [inline] |
Test whether there is an alternative that can be stolen.
Definition at line 170 of file path.hh.
| void Gecode::Search::Parallel::Path::Edge::next |
( |
void |
|
) |
[inline] |
Move to next alternative.
Definition at line 174 of file path.hh.
| unsigned int Gecode::Search::Parallel::Path::Edge::steal |
( |
void |
|
) |
[inline] |
Steal rightmost alternative and return its number.
Definition at line 178 of file path.hh.
| void Gecode::Search::Parallel::Path::Edge::dispose |
( |
void |
|
) |
[inline] |
Free memory for edge.
Definition at line 189 of file path.hh.
Member Data Documentation
Space corresponding to this edge (might be NULL).
Definition at line 64 of file path.hh.
Current alternative.
Definition at line 66 of file path.hh.
Number of alternatives left.
Definition at line 68 of file path.hh.
The documentation for this class was generated from the following file:
