this repo has no description
dekker.one
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
34namespace Gecode { namespace Gist {
35
36 forceinline bool
37 LayoutCursor::mayMoveDownwards(void) {
38 return NodeCursor<VisualNode>::mayMoveDownwards() &&
39 node()->isDirty();
40 }
41
42 inline
43 LayoutCursor::LayoutCursor(VisualNode* theNode,
44 const VisualNode::NodeAllocator& na)
45 : NodeCursor<VisualNode>(theNode,na) {}
46
47 forceinline void
48 LayoutCursor::processCurrentNode(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