34 #ifndef __GECODE_SEARCH_SEQ_PATH_HH__ 35 #define __GECODE_SEARCH_SEQ_PATH_HH__ 44 namespace Gecode {
namespace Search {
namespace Seq {
59 template<
class Tracer>
64 typedef typename Tracer::ID
ID;
83 Space* space(
void)
const;
88 const Choice* choice(
void)
const;
91 unsigned int alt(
void)
const;
93 unsigned int truealt(
void)
const;
95 bool leftmost(
void)
const;
97 bool rightmost(
void)
const;
101 bool lao(
void)
const;
104 unsigned int nid(
void)
const;
116 Path(
unsigned int l);
118 unsigned int ngdl(
void)
const;
120 void ngdl(
unsigned int l);
126 Edge& top(
void)
const;
128 bool empty(
void)
const;
134 void commit(
Space* s,
int i)
const;
143 int entries(
void)
const;
Support::DynamicStack< Edge, Heap > ds
Stack to store edge information.
unsigned int _ngdl
Depth limit for no-good generation.
void * mark(void *p)
Return marked pointer for unmarked pointer p.
Gecode::FloatVal c(-8, 8)
Gecode::IntArgs i(4, 1, 2, 3, 4)
Tracer::ID ID
Node identity type.
const unsigned int a_d
Create a clone during recomputation if distance is greater than a_d (adaptive distance) ...
const Choice * _choice
Choice.
Search tree edge for recomputation
Space * _space
Space corresponding to this edge (might be NULL)
Depth-first path (stack of edges) supporting recomputation.
Choice for performing commit
No-goods recorded from restarts.
Stack with arbitrary number of elements.
unsigned int _alt
Current alternative.
Gecode toplevel namespace
#define GECODE_VTABLE_EXPORT
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.