Node whose alternatives are expanded one at a time. More...
#include <gecode/search/seq/choice-expansion.hh>
Public Member Functions | |
| ChoiceExpansion (void) | |
| Initialize without node. | |
| operator bool (void) const | |
| Whether there is a node. | |
| Space & | space (void) const |
| Return the node. | |
| void | select (std::unique_ptr< Space > s) |
| Take stable node s. | |
| std::unique_ptr< Space > | take (void) |
| Return the node before its choice has been computed. | |
| void | reset (void) |
| Delete the node. | |
| ExpansionStep | next (Worker &worker, unsigned long int depth, unsigned long long int node_revision, const Space *incumbent, unsigned long long int revision) |
| Commit and propagate the next alternative. | |
Detailed Description
Node whose alternatives are expanded one at a time.
Definition at line 62 of file choice-expansion.hh.
Constructor & Destructor Documentation
◆ ChoiceExpansion()
|
inline |
Initialize without node.
Definition at line 72 of file choice-expansion.hh.
Member Function Documentation
◆ operator bool()
|
inlineexplicit |
Whether there is a node.
Definition at line 74 of file choice-expansion.hh.
◆ space()
|
inline |
Return the node.
Definition at line 76 of file choice-expansion.hh.
◆ select()
|
inline |
Take stable node s.
Definition at line 78 of file choice-expansion.hh.
◆ take()
|
inline |
Return the node before its choice has been computed.
Definition at line 84 of file choice-expansion.hh.
◆ reset()
|
inline |
Delete the node.
Definition at line 89 of file choice-expansion.hh.
◆ next()
|
inline |
Commit and propagate the next alternative.
The child is constrained by incumbent if the node has been constrained with an older revision than revision. The last alternative reuses the node itself.
Definition at line 101 of file choice-expansion.hh.
The documentation for this class was generated from the following file:
- gecode/search/seq/choice-expansion.hh
