forked from m2osw/csspp
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathexpr_additive.cpp
More file actions
340 lines (300 loc) · 9.76 KB
/
expr_additive.cpp
File metadata and controls
340 lines (300 loc) · 9.76 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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
// CSS Preprocessor
// Copyright (c) 2015-2019 Made to Order Software Corp. All Rights Reserved
//
// 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.
//
// 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
/** \file
* \brief Implementation of the CSS Preprocessor expression.
*
* The CSS Preprocessor expression class is used to reduce a list
* of nodes by applying expressions to the various values.
*
* \sa \ref expression_rules
*/
#include "csspp/expression.h"
#include "csspp/exceptions.h"
#include "csspp/parser.h"
#include "csspp/unicode_range.h"
#include <algorithm>
#include <cmath>
#include <iostream>
namespace csspp
{
namespace
{
node_type_t additive_operator(node::pointer_t n)
{
switch(n->get_type())
{
case node_type_t::ADD:
case node_type_t::SUBTRACT:
return n->get_type();
default:
return node_type_t::UNKNOWN;
}
}
node::pointer_t add(node::pointer_t lhs, node::pointer_t rhs, bool subtract)
{
node_type_t type(node_type_t::UNKNOWN);
bool test_dimensions(true);
integer_t ai(0);
integer_t bi(0);
decimal_number_t af(0.0);
decimal_number_t bf(0.0);
bool swapped(false);
switch(mix_node_types(lhs->get_type(), rhs->get_type()))
{
case mix_node_types(node_type_t::STRING, node_type_t::STRING):
if(!subtract)
{
// string concatenation
node::pointer_t result(new node(node_type_t::STRING, lhs->get_position()));
result->set_string(lhs->get_string() + rhs->get_string());
return result;
}
break;
case mix_node_types(node_type_t::INTEGER, node_type_t::INTEGER):
ai = lhs->get_integer();
bi = rhs->get_integer();
type = node_type_t::INTEGER;
break;
case mix_node_types(node_type_t::DECIMAL_NUMBER, node_type_t::DECIMAL_NUMBER):
af = lhs->get_decimal_number();
bf = rhs->get_decimal_number();
type = node_type_t::DECIMAL_NUMBER;
break;
case mix_node_types(node_type_t::DECIMAL_NUMBER, node_type_t::INTEGER):
af = lhs->get_decimal_number();
bf = static_cast<decimal_number_t>(rhs->get_integer());
type = node_type_t::DECIMAL_NUMBER;
break;
case mix_node_types(node_type_t::INTEGER, node_type_t::DECIMAL_NUMBER):
af = static_cast<decimal_number_t>(lhs->get_integer());
bf = rhs->get_decimal_number();
type = node_type_t::DECIMAL_NUMBER;
break;
case mix_node_types(node_type_t::PERCENT, node_type_t::PERCENT):
af = lhs->get_decimal_number();
bf = rhs->get_decimal_number();
type = node_type_t::PERCENT;
test_dimensions = false;
break;
case mix_node_types(node_type_t::INTEGER, node_type_t::COLOR):
case mix_node_types(node_type_t::DECIMAL_NUMBER, node_type_t::COLOR):
swap(lhs, rhs);
swapped = true;
#if __cplusplus >= 201700
[[fallthrough]];
#endif
case mix_node_types(node_type_t::COLOR, node_type_t::INTEGER):
case mix_node_types(node_type_t::COLOR, node_type_t::DECIMAL_NUMBER):
if(rhs->get_string() == "")
{
decimal_number_t offset;
if(rhs->is(node_type_t::INTEGER))
{
offset = static_cast<decimal_number_t>(rhs->get_integer());
}
else
{
offset = rhs->get_decimal_number();
}
color c(lhs->get_color());
color_component_t red;
color_component_t green;
color_component_t blue;
color_component_t alpha;
c.get_color(red, green, blue, alpha);
if(subtract)
{
if(swapped)
{
red = offset - red;
green = offset - green;
blue = offset - blue;
alpha = offset - alpha;
}
else
{
red -= offset;
green -= offset;
blue -= offset;
alpha -= offset;
}
}
else
{
red += offset;
green += offset;
blue += offset;
alpha += offset;
}
c.set_color(red, green, blue, alpha);
node::pointer_t result(new node(node_type_t::COLOR, lhs->get_position()));
result->set_color(c);
return result;
}
error::instance() << rhs->get_position()
<< "color offsets (numbers added with + or - operators) must be unit less values, "
<< (rhs->is(node_type_t::INTEGER)
? static_cast<decimal_number_t>(rhs->get_integer())
: rhs->get_decimal_number())
<< rhs->get_string()
<< " is not acceptable."
<< error_mode_t::ERROR_ERROR;
return node::pointer_t();
case mix_node_types(node_type_t::COLOR, node_type_t::COLOR):
{
color lc(lhs->get_color());
color const rc(rhs->get_color());
color_component_t lred;
color_component_t lgreen;
color_component_t lblue;
color_component_t lalpha;
color_component_t rred;
color_component_t rgreen;
color_component_t rblue;
color_component_t ralpha;
lc.get_color(lred, lgreen, lblue, lalpha);
rc.get_color(rred, rgreen, rblue, ralpha);
if(subtract)
{
lred -= rred;
lgreen -= rgreen;
lblue -= rblue;
lalpha -= ralpha;
}
else
{
lred += rred;
lgreen += rgreen;
lblue += rblue;
lalpha += ralpha;
}
lc.set_color(lred, lgreen, lblue, lalpha);
node::pointer_t result(new node(node_type_t::COLOR, lhs->get_position()));
result->set_color(lc);
return result;
}
default:
break;
}
if(type == node_type_t::UNKNOWN)
{
node_type_t lt(lhs->get_type());
node_type_t rt(rhs->get_type());
error::instance() << lhs->get_position()
<< "incompatible types between "
<< lt
<< (lt == node_type_t::IDENTIFIER || lt == node_type_t::STRING ? " (" + lhs->get_string() + ")" : "")
<< " and "
<< rt
<< (rt == node_type_t::IDENTIFIER || rt == node_type_t::STRING ? " (" + rhs->get_string() + ")" : "")
<< " for operator '"
<< (subtract ? "-" : "+")
<< "'."
<< error_mode_t::ERROR_ERROR;
return node::pointer_t();
}
if(test_dimensions)
{
std::string const ldim(lhs->get_string());
std::string const rdim(rhs->get_string());
if(ldim != rdim)
{
error::instance() << lhs->get_position()
<< "incompatible dimensions: \""
<< ldim
<< "\" and \""
<< rdim
<< "\" cannot be used as is with operator '"
<< (subtract ? "-" : "+")
<< "'."
<< error_mode_t::ERROR_ERROR;
return node::pointer_t();
}
}
node::pointer_t result(new node(type, lhs->get_position()));
if(type != node_type_t::PERCENT)
{
// do not lose the dimension
result->set_string(lhs->get_string());
}
switch(type)
{
case node_type_t::INTEGER:
if(subtract)
{
result->set_integer(ai - bi);
}
else
{
result->set_integer(ai + bi);
}
break;
case node_type_t::DECIMAL_NUMBER:
case node_type_t::PERCENT:
if(subtract)
{
result->set_decimal_number(af - bf);
}
else
{
result->set_decimal_number(af + bf);
}
break;
default:
throw csspp_exception_logic("expression.cpp:add(): 'type' set to a value which is not handled here."); // LCOV_EXCL_LINE
}
return result;
}
} // no name namespace
node::pointer_t expression::additive()
{
// additive: multiplicative
// | additive '+' multiplicative
// | additive '-' multiplicative
node::pointer_t result(multiplicative());
if(!result)
{
return node::pointer_t();
}
node_type_t op(additive_operator(f_current));
while(op != node_type_t::UNKNOWN)
{
// skip the additive operator
next();
node::pointer_t rhs(multiplicative());
if(!rhs)
{
return node::pointer_t();
}
// apply the additive operation
result = add(result, rhs, op == node_type_t::SUBTRACT);
if(!result)
{
return node::pointer_t();
}
op = additive_operator(f_current);
}
return result;
}
} // namespace csspp
// Local Variables:
// mode: cpp
// indent-tabs-mode: nil
// c-basic-offset: 4
// tab-width: 4
// End:
// vim: ts=4 sw=4 et