34#ifndef __GECODE_SEARCH_SEQ_PATH_HH__
35#define __GECODE_SEARCH_SEQ_PATH_HH__
44namespace 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;
136 Space* recompute(
unsigned int& d,
unsigned int a_d,
Worker& s,
139 Space* recompute(
unsigned int& d,
unsigned int a_d,
Worker& s,
140 const Space& best,
int& mark,
143 int entries(
void)
const;
147 virtual void post(
Space& home)
const;
Choice for performing commit
No-goods recorded from restarts.
Search tree edge for recomputation
Space * _space
Space corresponding to this edge (might be NULL)
const Choice * _choice
Choice.
unsigned int _alt
Current alternative.
Depth-first path (stack of edges) supporting recomputation.
unsigned int _ngdl
Depth limit for no-good generation.
Tracer::ID ID
Node identity type.
Support::DynamicStack< Edge, Heap > ds
Stack to store edge information.
Stack with arbitrary number of elements.
Gecode toplevel namespace
#define GECODE_VTABLE_EXPORT