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 template<class Cursor>
37 forceinline
38 NodeVisitor<Cursor>::NodeVisitor(const Cursor& c0) : c(c0) {}
39
40 template<class Cursor>
41 forceinline void
42 NodeVisitor<Cursor>::setCursor(const Cursor& c0) { c = c0; }
43
44 template<class Cursor>
45 forceinline Cursor&
46 NodeVisitor<Cursor>::getCursor(void) { return c; }
47
48 template<class Cursor>
49 forceinline void
50 PostorderNodeVisitor<Cursor>::moveToLeaf(void) {
51 while (c.mayMoveDownwards()) {
52 c.moveDownwards();
53 }
54 }
55
56 template<class Cursor>
57 PostorderNodeVisitor<Cursor>::PostorderNodeVisitor(const Cursor& c0)
58 : NodeVisitor<Cursor>(c0) {
59 moveToLeaf();
60 }
61
62 template<class Cursor>
63 forceinline bool
64 PostorderNodeVisitor<Cursor>::next(void) {
65 c.processCurrentNode();
66 if (c.mayMoveSidewards()) {
67 c.moveSidewards();
68 moveToLeaf();
69 } else if (c.mayMoveUpwards()) {
70 c.moveUpwards();
71 } else {
72 return false;
73 }
74 return true;
75 }
76
77 template<class Cursor>
78 forceinline void
79 PostorderNodeVisitor<Cursor>::run(void) {
80 while (next()) {}
81 }
82
83 template<class Cursor>
84 forceinline bool
85 PreorderNodeVisitor<Cursor>::backtrack(void) {
86 while (! c.mayMoveSidewards() && c.mayMoveUpwards()) {
87 c.moveUpwards();
88 }
89 if (! c.mayMoveUpwards()) {
90 return false;
91 } else {
92 c.moveSidewards();
93 }
94 return true;
95 }
96
97 template<class Cursor>
98 PreorderNodeVisitor<Cursor>::PreorderNodeVisitor(const Cursor& c0)
99 : NodeVisitor<Cursor>(c0) {}
100
101 template<class Cursor>
102 forceinline bool
103 PreorderNodeVisitor<Cursor>::next(void) {
104 c.processCurrentNode();
105 if (c.mayMoveDownwards()) {
106 c.moveDownwards();
107 } else if (c.mayMoveSidewards()) {
108 c.moveSidewards();
109 } else {
110 return backtrack();
111 }
112 return true;
113 }
114
115 template<class Cursor>
116 forceinline void
117 PreorderNodeVisitor<Cursor>::run(void) {
118 while (next()) {}
119 }
120}}
121
122// STATISTICS: gist-any