-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathOptimizer.cpp
More file actions
151 lines (125 loc) · 2.93 KB
/
Copy pathOptimizer.cpp
File metadata and controls
151 lines (125 loc) · 2.93 KB
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
144
145
146
147
148
149
150
151
/**
*
* @file Optimizer.cpp
* @author Gaspard Kirira
*
* Copyright 2025, Gaspard Kirira.
* All rights reserved.
* https://github.com/vixcpp/vix
*
* Use of this source code is governed by a MIT license
* that can be found in the License file.
*
* Vix.cpp
*
*/
#include <vix/template/Optimizer.hpp>
#include <utility>
namespace vix::template_
{
RootNode Optimizer::optimize(RootNode root) const
{
optimize_root(root);
return root;
}
NodePtr Optimizer::optimize_node(NodePtr node) const
{
if (!node)
{
return nullptr;
}
if (auto *ifNode = dynamic_cast<IfNode *>(node.get()))
{
optimize_if(*ifNode);
return node;
}
if (auto *forNode = dynamic_cast<ForNode *>(node.get()))
{
optimize_for(*forNode);
return node;
}
if (auto *blockNode = dynamic_cast<BlockNode *>(node.get()))
{
optimize_block(*blockNode);
return node;
}
return node;
}
void Optimizer::optimize_root(RootNode &root) const
{
normalize_children(root.children());
}
void Optimizer::optimize_if(IfNode &node) const
{
normalize_children(node.body());
}
void Optimizer::optimize_for(ForNode &node) const
{
normalize_children(node.body());
}
void Optimizer::optimize_block(BlockNode &node) const
{
normalize_children(node.body());
}
void Optimizer::normalize_children(NodeList &children) const
{
NodeList optimized;
optimized.reserve(children.size());
for (auto &child : children)
{
NodePtr current = optimize_node(std::move(child));
if (!current)
{
continue;
}
if (is_empty_text_node(current))
{
continue;
}
if (!optimized.empty() &&
can_merge_text_nodes(optimized.back(), current))
{
merge_text_nodes(optimized.back(), current);
continue;
}
optimized.push_back(std::move(current));
}
children = std::move(optimized);
}
bool Optimizer::is_empty_text_node(const NodePtr &node) const noexcept
{
if (!node)
{
return false;
}
const auto *textNode = dynamic_cast<const TextNode *>(node.get());
if (!textNode)
{
return false;
}
return textNode->value().empty();
}
bool Optimizer::can_merge_text_nodes(
const NodePtr &left,
const NodePtr &right) const noexcept
{
if (!left || !right)
{
return false;
}
return dynamic_cast<const TextNode *>(left.get()) != nullptr &&
dynamic_cast<const TextNode *>(right.get()) != nullptr;
}
void Optimizer::merge_text_nodes(
const NodePtr &left,
const NodePtr &right) const
{
auto *leftText = dynamic_cast<TextNode *>(left.get());
const auto *rightText = dynamic_cast<const TextNode *>(right.get());
if (!leftText || !rightText)
{
return;
}
leftText->set_value(leftText->value() + rightText->value());
}
} // namespace vix::template_