-
-
Notifications
You must be signed in to change notification settings - Fork 1.2k
/
node.cc
143 lines (125 loc) · 4.01 KB
/
node.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
/*
* OpenSCAD (www.openscad.org)
* Copyright (C) 2009-2011 Clifford Wolf <clifford@clifford.at> and
* Marius Kintel <marius@kintel.net>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* As a special exception, you have permission to link this program
* with the CGAL library and distribute executables, as long as you
* follow the requirements of the GNU GPL in regard to all of the
* software in the executable aside from CGAL.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "core/node.h"
#include "ModuleInstantiation.h"
#include "progress.h"
#include <functional>
#include <iostream>
#include <algorithm>
size_t AbstractNode::idx_counter;
AbstractNode::AbstractNode(const ModuleInstantiation *mi) :
modinst(mi),
idx(idx_counter++)
{
}
std::string AbstractNode::toString() const
{
return this->name() + "()";
}
std::shared_ptr<const AbstractNode> AbstractNode::getNodeByID(int idx, std::deque<std::shared_ptr<const AbstractNode>>& path) const
{
auto self = shared_from_this();
if (this->idx == idx) {
path.push_back(self);
return self;
}
for (const auto& node : this->children) {
auto res = node->getNodeByID(idx, path);
if (res) {
path.push_back(self);
return res;
}
}
return nullptr;
}
std::string GroupNode::name() const
{
return "group";
}
std::string GroupNode::verbose_name() const
{
return this->_name;
}
std::string ListNode::name() const
{
return "list";
}
std::string RootNode::name() const
{
return "root";
}
std::string AbstractIntersectionNode::toString() const
{
return this->name() + "()";
}
std::string AbstractIntersectionNode::name() const
{
// We write intersection here since the module will have to be evaluated
// before we get here and it will not longer retain the intersection_for parameters
return "intersection";
}
void AbstractNode::progress_prepare()
{
std::for_each(this->children.begin(), this->children.end(), std::mem_fn(&AbstractNode::progress_prepare));
this->progress_mark = ++progress_report_count;
}
void AbstractNode::progress_report() const
{
progress_update(shared_from_this(), this->progress_mark);
}
std::ostream& operator<<(std::ostream& stream, const AbstractNode& node)
{
stream << node.toString();
return stream;
}
/*!
Locates and returns the node containing a root modifier (!).
Returns nullptr if no root modifier was found.
If a second root modifier was found, nextLocation (if non-zero) will be set to point to
the location of that second modifier.
*/
std::shared_ptr<AbstractNode> find_root_tag(const std::shared_ptr<AbstractNode>& node, const Location **nextLocation)
{
std::shared_ptr<AbstractNode> rootTag;
std::function<void (const std::shared_ptr<const AbstractNode>&)> recursive_find_tag = [&](const std::shared_ptr<const AbstractNode>& node) {
for (const auto& child : node->children) {
if (child->modinst->tag_root) {
if (!rootTag) {
rootTag = child;
// shortcut if we're not interested in further root modifiers
if (!nextLocation) return;
} else if (nextLocation && rootTag->modinst != child->modinst) {
// Throw if we have more than one root modifier in the source
*nextLocation = &child->modinst->location();
return;
}
}
recursive_find_tag(child);
}
};
recursive_find_tag(node);
return rootTag;
}