Go to the documentation of this file.
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));
82 for (
int i=
p->getNumberOfChildren();
i--;) {
83 if (
p->getChild(na,
i) == _node) {
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));
119 HideFailedCursor::mayMoveDownwards(
void) {
121 return (!onlyDirty ||
n->isDirty()) &&
123 (
n->hasSolvedChildren() ||
n->getNoOfOpenChildren(na) > 0) &&
136 if (
n->getStatus() ==
BRANCH &&
137 !
n->hasSolvedChildren() &&
138 n->getNoOfOpenChildren(
na) == 0) {
140 n->setChildrenLayoutDone(
false);
167 if (
n->getStatus() ==
STOP) {
182 NextSolCursor::notOnSol(
void) {
232 curDepth(0), depth(0), failed(0), solved(0), choice(0), open(0) {}
237 switch (
n->getStatus()) {
261 int c_d,
int a_d,
bool clear,
264 _c_d(
c_d), _a_d(
a_d), _clear(clear) {}
270 if (!
na.hasLabel(
n)) {
274 n->getBranchLabel(_na,
p,
p->getChoice(),
277 if (
n->getNumberOfChildren() < 1 &&
void moveDownwards(void)
Move cursor to the first child node.
int choice
Number of choice nodes.
@ UNDETERMINED
Node that has not been explored yet.
int open
Number of open nodes.
void moveSidewards(void)
Move cursor to the first sibling.
int depth
Depth of the search tree.
A cursor that can be run over a tree.
DisposeCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
@ STOP
Node representing stop point.
void moveDownwards(void)
Move cursor to the first child node.
bool hasSolvedChildren(void)
Return whether the subtree of this node has any solved children.
Node class that supports visual layout
StatCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
NodeStatus getStatus(void) const
Return current status of the node.
void moveUpwards(void)
Move cursor to the parent node.
Gecode::IntArgs i(4, 1, 2, 3, 4)
void moveDownwards(void)
Move cursor to the first child node.
NextSolCursor(VisualNode *theNode, bool backwards, const VisualNode::NodeAllocator &na)
Constructor.
bool isRoot(void) const
Check if this node is the root of a tree.
Base class for nodes of the search tree.
Gecode toplevel namespace
const VisualNode ::NodeAllocator & na
The node allocator.
BranchLabelCursor(VisualNode *theNode, BestNode *curBest, int c_d, int a_d, bool clear, VisualNode::NodeAllocator &na)
Constructor.
bool mayMoveSidewards(void)
Test if cursor may move to the first sibling.
struct Gecode::@579::NNF::@61::@63 a
For atomic nodes.
void processCurrentNode(void)
Process node.
void processCurrentNode(void)
Collect statistics.
void clearLabel(T *n)
Remove label of node n.
bool mayMoveDownwards(void)
Test if cursor may move to the first child node.
bool mayMoveUpwards(void)
Test if the cursor may move to the parent node.
Static reference to the currently best space.
int solved
Number of solved nodes.
@ BRANCH
Node representing a branch.
int getParent(void) const
Return the parent.
void dispose(void)
Free allocated memory.
UnhideAllCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
void processCurrentNode(void)
Process node.
void processCurrentNode(void)
Process node.
void moveSidewards(void)
Move cursor to the first sibling.
NodeCursor(Node *theNode, const typename Node::NodeAllocator &na)
Construct cursor, initially set to theNode.
void processCurrentNode(void)
Do nothing.
VisualNode * startNode(void)
Return start node.
void processCurrentNode(void)
UnstopAllCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
void processCurrentNode(void)
Dispose node.
const unsigned int c_d
Create a clone after every c_d commits (commit distance)
const unsigned int a_d
Create a clone during recomputation if distance is greater than a_d (adaptive distance)
bool mayMoveDownwards(void)
Test if cursor may move to the first child node.
int n
Number of negative literals for node type.
@ FAILED
Node representing failure.
int p
Number of positive literals for node type.
unsigned int alternative(void)
Return current alternative.
int failed
Number of failed nodes.
const FloatNum max
Largest allowed float value.
@ SOLVED
Node representing a solution.
void moveUpwards(void)
Move cursor to the parent node.
void setLabel(T *n, const QString &l)
Set label of node n to l.
VisualNode * node(void)
Return current node.