Go to the documentation of this file.
34 #ifndef GECODE_GIST_NODECURSOR_HH
35 #define GECODE_GIST_NODECURSOR_HH
39 namespace Gecode {
namespace Gist {
50 unsigned int _alternative;
206 int c_d,
int a_d,
bool clear,
void moveDownwards(void)
Move cursor to the first child node.
int choice
Number of choice nodes.
A cursor that frees all memory.
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.
bool mayMoveSidewards(void)
Test if cursor may move to the first sibling.
DisposeCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
void moveDownwards(void)
Move cursor to the first child node.
Node class that supports visual layout
StatCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
void moveUpwards(void)
Move cursor to the parent node.
bool mayMoveDownwards(void)
Test if the cursor may move to the first child node.
void moveDownwards(void)
Move cursor to the first child node.
NextSolCursor(VisualNode *theNode, bool backwards, const VisualNode::NodeAllocator &na)
Constructor.
bool mayMoveUpwards(void)
Test if the cursor may move to the parent node.
Base class for nodes of the search tree.
Gecode toplevel namespace
const Node::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.
void processCurrentNode(void)
Process node.
void processCurrentNode(void)
Collect statistics.
HideFailedCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na, bool onlyDirtyNodes)
Constructor.
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.
A cursor that collects statistics.
NodeAllocatorBase< VisualNode > NodeAllocator
Static reference to the currently best space.
A cursor that marks all nodes in the tree as not stopping.
A cursor that finds the next solution.
int solved
Number of solved nodes.
A cursor that labels branches.
struct Gecode::@602::NNF::@65::@67 a
For atomic nodes.
UnhideAllCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
A cursor that marks failed subtrees as hidden.
void processCurrentNode(void)
Process node.
void processCurrentNode(void)
Process node.
A cursor that marks all nodes in the tree as not hidden.
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.
Node * 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.
unsigned int alternative(void)
Return current alternative.
int failed
Number of failed nodes.
void moveUpwards(void)
Move cursor to the parent node.
Node * node(void)
Return current node.