38 namespace Gecode {
namespace Gist {
44 : _startNode(theNode), _node(theNode),
45 _alternative(theNode->getAlternative(na0)),
71 return _node != _startNode && !_node->isRoot();
77 _node =
static_cast<Node*
>(_node->getParent(na));
78 if (_node->isRoot()) {
81 Node*
p =
static_cast<Node*
>(_node->getParent(na));
94 return _node->getNumberOfChildren() > 0;
101 _node = _node->getChild(na,0);
107 return (!_node->isRoot()) && (_node != _startNode) &&
108 (_alternative < _node->getParent(na)->getNumberOfChildren() - 1);
115 static_cast<Node*
>(_node->getParent(na)->getChild(na,++_alternative));
121 return (!onlyDirty || n->
isDirty()) &&
182 NextSolCursor::notOnSol(
void) {
232 curDepth(0), depth(0), failed(0), solved(0), choice(0), open(0) {}
261 int c_d,
int a_d,
bool clear,
264 _c_d(c_d), _a_d(a_d), _clear(clear) {}
276 _na.setLabel(n,QString(l.c_str()));