Generated on Sat Feb 7 2015 02:01:18 for Gecode by doxygen 1.8.9.1
layoutcursor.hpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Guido Tack <tack@gecode.org>
5  *
6  * Copyright:
7  * Guido Tack, 2006
8  *
9  * Last modified:
10  * $Date: 2013-05-06 09:02:17 +0200 (Mon, 06 May 2013) $ by $Author: tack $
11  * $Revision: 13613 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 namespace Gecode { namespace Gist {
39 
40  forceinline bool
43  node()->isDirty();
44  }
45 
46  inline
48  const VisualNode::NodeAllocator& na)
49  : NodeCursor<VisualNode>(theNode,na) {}
50 
51  forceinline void
53  VisualNode* currentNode = node();
54  if (currentNode->isDirty()) {
55  if (currentNode->isHidden()) {
56  // do nothing
57  } else if (false && currentNode->getNumberOfChildren() < 1) {
58  currentNode->setShape(Shape::leaf);
59  } else {
60  currentNode->computeShape(na,startNode());
61  }
62  currentNode->setDirty(false);
63  }
64  if (currentNode->getNumberOfChildren() >= 1)
65  currentNode->setChildrenLayoutDone(true);
66  }
67 
68 }}
69 
70 // STATISTICS: gist-any
bool mayMoveDownwards(void)
Test if cursor may move to the first child node.
Definition: nodecursor.hpp:93
bool isDirty(void)
Return whether node is marked as dirty.
Definition: visualnode.hpp:157
bool isHidden(void)
Return if node is hidden.
Definition: visualnode.hpp:133
void setChildrenLayoutDone(bool d)
Mark node whether the layout of the node's children has been completed.
Definition: visualnode.hpp:172
void setDirty(bool d)
Mark node as dirty.
Definition: visualnode.hpp:162
Node allocator.
Definition: node.hh:52
unsigned int getNumberOfChildren(void) const
Return the number of children.
Definition: node.hpp:218
bool mayMoveDownwards(void)
Test if the cursor may move to the first child node.
const VisualNode::NodeAllocator & na
The node allocator.
Definition: nodecursor.hh:57
void processCurrentNode(void)
Compute layout for current node.
VisualNode * startNode(void)
Return start node.
A cursor that can be run over a tree.
Definition: nodecursor.hh:47
#define forceinline
Definition: config.hpp:132
Node class that supports visual layout
Definition: visualnode.hh:129
void computeShape(const NodeAllocator &na, VisualNode *root)
Compute the shape according to the shapes of the children.
Definition: visualnode.cpp:403
VisualNode * node(void)
Return current node.
static Shape * leaf
Static shape for leaf nodes.
Definition: visualnode.hh:108
LayoutCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
Gecode toplevel namespace
void setShape(Shape *s)
Set the shape of this node.
Definition: visualnode.cpp:395