38 #ifndef GECODE_GIST_NODECURSOR_HH
39 #define GECODE_GIST_NODECURSOR_HH
43 namespace Gecode {
namespace Gist {
54 unsigned int _alternative;
210 int c_d,
int a_d,
bool clear,
bool mayMoveDownwards(void)
Test if cursor may move to the first child node.
bool mayMoveDownwards(void)
Test if the cursor may move to the first child node.
BranchLabelCursor(VisualNode *theNode, BestNode *curBest, int c_d, int a_d, bool clear, VisualNode::NodeAllocator &na)
Constructor.
Static reference to the currently best space.
void moveUpwards(void)
Move cursor to the parent node.
NodeAllocatorBase< VisualNode > NodeAllocator
void moveDownwards(void)
Move cursor to the first child node.
int depth
Depth of the search tree.
bool mayMoveSidewards(void)
Test if cursor may move to the first sibling.
void moveSidewards(void)
Move cursor to the first sibling.
Base class for nodes of the search tree.
DisposeCursor(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 collects statistics.
bool mayMoveUpwards(void)
Test if the cursor may move to the parent node.
int n
Number of negative literals for node type.
HideFailedCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na, bool onlyDirtyNodes)
Constructor.
void moveDownwards(void)
Move cursor to the first child node.
const Node::NodeAllocator & na
The node allocator.
void moveUpwards(void)
Move cursor to the parent node.
const unsigned int a_d
Create a clone during recomputation if distance is greater than a_d (adaptive distance) ...
void processCurrentNode(void)
Process node.
void moveDownwards(void)
Move cursor to the first child node.
void processCurrentNode(void)
Dispose node.
Node * startNode(void)
Return start node.
A cursor that frees all memory.
StatCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
UnhideAllCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
void moveSidewards(void)
Move cursor to the first sibling.
A cursor that marks all nodes in the tree as not stopping.
bool mayMoveDownwards(void)
Test if cursor may move to the first child node.
int open
Number of open nodes.
A cursor that can be run over a tree.
A cursor that marks all nodes in the tree as not hidden.
Node class that supports visual layout
int choice
Number of choice nodes.
const unsigned int c_d
Create a clone after every c_d commits (commit distance)
A cursor that finds the next solution.
int failed
Number of failed nodes.
bool mayMoveSidewards(void)
Test if cursor may move to the first sibling.
void processCurrentNode(void)
Do nothing.
Node * node(void)
Return current node.
UnstopAllCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
NodeCursor(Node *theNode, const typename Node::NodeAllocator &na)
Construct cursor, initially set to theNode.
Gecode toplevel namespace
unsigned int alternative(void)
Return current alternative.
void processCurrentNode(void)
Collect statistics.
bool mayMoveUpwards(void)
Test if the cursor may move to the parent node.
A cursor that labels branches.
struct Gecode::@518::NNF::@57::@59 a
For atomic nodes.
void processCurrentNode(void)
int solved
Number of solved nodes.
NextSolCursor(VisualNode *theNode, bool backwards, const VisualNode::NodeAllocator &na)
Constructor.