Generated on Tue Jan 26 2021 00:00:00 for Gecode by doxygen 1.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  * This file is part of Gecode, the generic constraint
10  * development environment:
11  * http://www.gecode.org
12  *
13  * Permission is hereby granted, free of charge, to any person obtaining
14  * a copy of this software and associated documentation files (the
15  * "Software"), to deal in the Software without restriction, including
16  * without limitation the rights to use, copy, modify, merge, publish,
17  * distribute, sublicense, and/or sell copies of the Software, and to
18  * permit persons to whom the Software is furnished to do so, subject to
19  * the following conditions:
20  *
21  * The above copyright notice and this permission notice shall be
22  * included in all copies or substantial portions of the Software.
23  *
24  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31  *
32  */
33 
34 namespace Gecode { namespace Gist {
35 
36  forceinline bool
39  node()->isDirty();
40  }
41 
42  inline
44  const VisualNode::NodeAllocator& na)
45  : NodeCursor<VisualNode>(theNode,na) {}
46 
47  forceinline void
49  VisualNode* currentNode = node();
50  if (currentNode->isDirty()) {
51  if (currentNode->isHidden()) {
52  // do nothing
53  } else if (false && currentNode->getNumberOfChildren() < 1) {
54  currentNode->setShape(Shape::leaf);
55  } else {
56  currentNode->computeShape(na);
57  }
58  currentNode->setDirty(false);
59  }
60  if (currentNode->getNumberOfChildren() >= 1)
61  currentNode->setChildrenLayoutDone(true);
62  }
63 
64 }}
65 
66 // STATISTICS: gist-any
void processCurrentNode(void)
Compute layout for current node.
bool mayMoveDownwards(void)
Test if the cursor may move to the first child node.
LayoutCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
A cursor that can be run over a tree.
Definition: nodecursor.hh:43
const Node::NodeAllocator & na
The node allocator.
Definition: nodecursor.hh:53
VisualNode * node(void)
Return current node.
Definition: nodecursor.hpp:46
bool mayMoveDownwards(void)
Test if cursor may move to the first child node.
Definition: nodecursor.hpp:89
unsigned int getNumberOfChildren(void) const
Return the number of children.
Definition: node.hpp:214
static Shape * leaf
Static shape for leaf nodes.
Definition: visualnode.hh:104
Node class that supports visual layout
Definition: visualnode.hh:125
void setShape(Shape *s)
Set the shape of this node.
Definition: visualnode.cpp:391
bool isHidden(void)
Return if node is hidden.
Definition: visualnode.hpp:129
void computeShape(const NodeAllocator &na)
Compute the shape according to the shapes of the children.
Definition: visualnode.cpp:399
void setDirty(bool d)
Mark node as dirty.
Definition: visualnode.hpp:158
bool isDirty(void)
Return whether node is marked as dirty.
Definition: visualnode.hpp:153
void setChildrenLayoutDone(bool d)
Mark node whether the layout of the node's children has been completed.
Definition: visualnode.hpp:168
#define forceinline
Definition: config.hpp:185