40 namespace Gecode {
namespace Search {
namespace Meta {
namespace Sequential {
62 return slave->statistics();
66 return slave->stopped();
85 slaves(
heap.alloc<
Slave>(n)), n_slaves(n), cur(0),
89 for (
unsigned int i=n;
i--; ) {
99 unsigned int n_exhausted = 0;
104 for (
unsigned int i=0;
i<
cur;
i++)
113 cur++; n_exhausted++;
157 throw NoBest(
"PBS::constrain");
Search engine implementation interface
void rfree(void *p)
Free memory block starting at p.
unsigned int slice
Size of a slice in a portfolio (in number of failures)
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
Heap heap
The single global heap.
Exception: Best solution search is not supported
Gecode toplevel namespace
Base-class for Stop-object.
struct Gecode::@554::NNF::@60::@61 b
For binary nodes (and, or, eqv)
const unsigned int slice
Size of a slice in a portfolio and scale factor for restarts(in number of failures) ...