Parallel A* search.
More...
|
| | AStar (Space *s, const Options &o) |
| | Initialize for space s with options o.
|
| | ~AStar (void) override |
| | Destructor.
|
| | ~Frontier (void) override |
| | Destructor.
|
| Space * | next (void) override |
| | Return next better solution (nullptr if none or stopped).
|
| Search::Statistics | statistics (void) const override |
| | Return statistics.
|
| bool | stopped (void) const override |
| | Whether search has been stopped.
|
| bool | limited (void) const override |
| | Whether search stopped at the width or frontier limit.
|
| void | constrain (const Space &s) override |
| | Constrain future solutions to be better than s.
|
| void | reset (Space *s) override |
| | Reset engine to restart at space s.
|
| virtual NoGoods & | nogoods (void) |
| | Return no-goods (the no-goods are empty).
|
| virtual | ~Engine (void) |
| | Destructor.
|
|
| bool | open (void) const override |
| | Whether there are open nodes.
|
| Entry | select (void) override |
| | Remove and return the next open node.
|
| void | submit (const Entry &e, bool) override |
| | Add child e, or delete it; leased tells whether its parent is still leased.
|
| bool | advance (void) override |
| | Called when all work is done, return whether there is new work.
|
| void | clear (void) override |
| | Delete all open nodes.
|
| virtual void | started (const Space &r) |
| | Called with the root r when search starts.
|
| | Frontier (const Options &o) |
| | Initialize with options o.
|
| void | initialize (Space *s, bool clone) |
| | Start search from root s.
|
| void | push (Task *t) |
| | Add pending task t.
|
| void | terminate (void) |
| | Stop all workers (must be called by subclass destructors).
|
| void | publish (Space *s, std::int64_t b) |
| | Make s with bound b the incumbent, if it improves.
|
| void | launch (void) |
| | Start the threads.
|
| void | wake (void) |
| | Wake up all workers.
|
| bool | enabled (unsigned int id) |
| | Whether worker id is currently enabled.
|
| void | work (unsigned int id) |
| | Run worker id.
|
| | Engine (void) |
| | Construct a meta engine without worker control.
|
| | Engine (const Options &o, unsigned int capacity) |
| | Construct a leaf engine and bind worker control to capacity.
|
|
| static void * | operator new (size_t s) |
| | Memory management.
|
| static void | operator delete (void *p) |
| | Free memory allocated from heap.
|
| static const unsigned int | max_batch = 8 |
| | Maximal number of children a worker collects before submitting.
|
Parallel A* search.
Definition at line 46 of file astar.cpp.
◆ AStar()
| Gecode::Search::Par::AStar::AStar |
( |
Space * | s, |
|
|
const Options & | o ) |
|
inline |
Initialize for space s with options o.
Definition at line 74 of file astar.cpp.
◆ ~AStar()
| Gecode::Search::Par::AStar::~AStar |
( |
void | | ) |
|
|
inlineoverride |
◆ open()
| bool Gecode::Search::Par::AStar::open |
( |
void | | ) |
const |
|
inlineoverrideprotectedvirtual |
◆ select()
| Entry Gecode::Search::Par::AStar::select |
( |
void | | ) |
|
|
inlineoverrideprotectedvirtual |
◆ submit()
| void Gecode::Search::Par::AStar::submit |
( |
const Entry & | e, |
|
|
bool | leased ) |
|
inlineoverrideprotectedvirtual |
◆ advance()
| bool Gecode::Search::Par::AStar::advance |
( |
void | | ) |
|
|
inlineoverrideprotectedvirtual |
◆ clear()
| void Gecode::Search::Par::AStar::clear |
( |
void | | ) |
|
|
inlineoverrideprotectedvirtual |
◆ queue
| Queue Gecode::Search::Par::AStar::queue |
|
protected |
The documentation for this class was generated from the following file: