/
variant.cpp
707 lines (557 loc) · 14.8 KB
/
variant.cpp
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
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
/*
Copyright (C) 2008 - 2017 by David White <dave@whitevine.net>
Part of the Battle for Wesnoth Project http://www.wesnoth.org/
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.
See the COPYING file for more details.
*/
#include <cassert>
#include <cmath>
#include <iostream>
#include <cstring>
#include <stack>
#include "formatter.hpp"
#include "formula/function.hpp"
#include "utils/math.hpp"
#include "log.hpp"
static lg::log_domain log_scripting_formula("scripting/formula");
#define DBG_SF LOG_STREAM(debug, log_scripting_formula)
#define LOG_SF LOG_STREAM(info, log_scripting_formula)
#define WRN_SF LOG_STREAM(warn, log_scripting_formula)
#define ERR_SF LOG_STREAM(err, log_scripting_formula)
#include <cassert>
#include <cmath>
#include <memory>
namespace wfl
{
// Static value to initialize null variants to ensure its value is never nullptr.
static value_base_ptr null_value(new variant_value_base);
static std::string variant_type_to_string(VARIANT_TYPE type)
{
return VARIANT_TYPE::enum_to_string(type);
}
// Small helper function to get a standard type error message.
static std::string was_expecting(const std::string& message, const variant& v)
{
std::ostringstream ss;
ss << "TYPE ERROR: expected " << message << " but found "
<< v.type_string() << " (" << v.to_debug_string() << ")";
return ss.str();
}
type_error::type_error(const std::string& str) : game::error(str)
{
std::cerr << "ERROR: " << message << "\n" << call_stack_manager::get();
}
variant_iterator::variant_iterator()
: type_(VARIANT_TYPE::TYPE_NULL)
, container_(nullptr)
, iter_()
{
}
variant_iterator::variant_iterator(const variant_value_base* value, const boost::any& iter)
: type_(value->get_type())
, container_(value)
, iter_(iter)
{
}
variant variant_iterator::operator*() const
{
if(!container_) {
return variant();
}
return container_->deref_iterator(iter_);
}
variant_iterator& variant_iterator::operator++()
{
if(container_) {
container_->iterator_inc(iter_);
}
return *this;
}
variant_iterator variant_iterator::operator++(int)
{
variant_iterator temp(*this);
if(container_) {
container_->iterator_inc(iter_);
}
return temp;
}
variant_iterator& variant_iterator::operator--()
{
if(container_) {
container_->iterator_dec(iter_);
}
return *this;
}
variant_iterator variant_iterator::operator--(int)
{
variant_iterator temp(*this);
if(container_) {
container_->iterator_dec(iter_);
}
return temp;
}
bool variant_iterator::operator==(const variant_iterator& that) const
{
if(!container_ && !that.container_) {
return true;
}
if(container_ == that.container_) {
return container_->iterator_equals(iter_, that.iter_);
}
return false;
}
bool variant_iterator::operator!=(const variant_iterator& that) const
{
return !operator==(that);
}
variant::variant()
: value_(null_value)
{}
variant::variant(int n)
: value_(std::make_shared<variant_int>(n))
{
assert(value_.get());
}
variant::variant(int n, variant::DECIMAL_VARIANT_TYPE)
: value_(std::make_shared<variant_decimal>(n))
{
assert(value_.get());
}
variant::variant(double n, variant::DECIMAL_VARIANT_TYPE)
: value_(std::make_shared<variant_decimal>(n))
{
assert(value_.get());
}
variant::variant(const std::vector<variant>& vec)
: value_((std::make_shared<variant_list>(vec)))
{
assert(value_.get());
}
variant::variant(const std::string& str)
: value_(std::make_shared<variant_string>(str))
{
assert(value_.get());
}
variant::variant(const std::map<variant,variant>& map)
: value_((std::make_shared<variant_map>(map)))
{
assert(value_.get());
}
variant& variant::operator=(const variant& v)
{
value_ = v.value_;
return *this;
}
variant variant::operator[](size_t n) const
{
if(is_callable()) {
return *this;
}
must_be(VARIANT_TYPE::TYPE_LIST);
try {
return value_cast<variant_list>()->get_container()[n];
} catch(std::out_of_range&) {
throw type_error("invalid index");
}
}
variant variant::operator[](const variant& v) const
{
if(is_callable()) {
return *this;
}
if(is_map()) {
auto& map = value_cast<variant_map>()->get_container();
auto i = map.find(v);
if(i == map.end()) {
return variant();
}
return i->second;
} else if(is_list()) {
if(v.is_list()) {
std::vector<variant> slice;
for(size_t i = 0; i < v.num_elements(); ++i) {
slice.push_back((*this)[v[i]]);
}
return variant(slice);
} else if(v.as_int() < 0) {
return operator[](num_elements() + v.as_int());
}
return operator[](v.as_int());
}
throw type_error(was_expecting("a list or a map", *this));
}
variant variant::get_keys() const
{
must_be(VARIANT_TYPE::TYPE_MAP);
std::vector<variant> tmp;
for(const auto& i : value_cast<variant_map>()->get_container()) {
tmp.push_back(i.first);
}
return variant(tmp);
}
variant variant::get_values() const
{
must_be(VARIANT_TYPE::TYPE_MAP);
std::vector<variant> tmp;
for(const auto& i : value_cast<variant_map>()->get_container()) {
tmp.push_back(i.second);
}
return variant(tmp);
}
variant_iterator variant::begin() const
{
return value_->make_iterator().begin();
}
variant_iterator variant::end() const
{
return value_->make_iterator().end();
}
bool variant::is_empty() const
{
return value_->is_empty();
}
size_t variant::num_elements() const
{
if(!is_list() && !is_map()) {
throw type_error(was_expecting("a list or a map", *this));
}
return value_->num_elements();
}
variant variant::get_member(const std::string& name) const
{
if(is_callable()) {
return value_cast<variant_callable>()->get_callable()->query_value(name);
}
if(name == "self") {
return *this;
}
return variant();
}
int variant::as_int() const
{
if(is_null()) { return 0; }
if(is_decimal()) { return as_decimal() / 1000; }
must_be(VARIANT_TYPE::TYPE_INT);
return value_cast<variant_int>()->get_numeric_value();
}
int variant::as_decimal() const
{
if(is_decimal()) {
return value_cast<variant_decimal>()->get_numeric_value();
} else if(is_int()) {
return value_cast<variant_int>()->get_numeric_value() * 1000;
} else if(is_null()) {
return 0;
}
throw type_error(was_expecting("an integer or a decimal", *this));
}
bool variant::as_bool() const
{
return value_->as_bool();
}
const std::string& variant::as_string() const
{
must_be(VARIANT_TYPE::TYPE_STRING);
return value_cast<variant_string>()->get_string();
}
const std::vector<variant>& variant::as_list() const
{
must_be(VARIANT_TYPE::TYPE_LIST);
return value_cast<variant_list>()->get_container();
}
const std::map<variant, variant>& variant::as_map() const
{
must_be(VARIANT_TYPE::TYPE_MAP);
return value_cast<variant_map>()->get_container();
}
variant variant::operator+(const variant& v) const
{
if(is_list() && v.is_list()) {
auto& list = value_cast<variant_list>()->get_container();
auto& other_list = v.value_cast<variant_list>()->get_container();
std::vector<variant> res;
res.reserve(list.size() + other_list.size());
for(const auto& member : list) {
res.push_back(member);
}
for(const auto& member : other_list) {
res.push_back(member);
}
return variant(res);
}
if(is_map() && v.is_map()) {
std::map<variant, variant> res = value_cast<variant_map>()->get_container();
for(const auto& member : v.value_cast<variant_map>()->get_container()) {
res[member.first] = member.second;
}
return variant(res);
}
if(is_decimal() || v.is_decimal()) {
return variant(as_decimal() + v.as_decimal() , DECIMAL_VARIANT);
}
return variant(as_int() + v.as_int());
}
variant variant::operator-(const variant& v) const
{
if(is_decimal() || v.is_decimal()) {
return variant(as_decimal() - v.as_decimal() , DECIMAL_VARIANT);
}
return variant(as_int() - v.as_int());
}
variant variant::operator*(const variant& v) const
{
if(is_decimal() || v.is_decimal()) {
long long long_int = as_decimal();
long_int *= v.as_decimal();
long_int /= 100;
if(long_int%10 >= 5) {
long_int /= 10;
++long_int;
} else {
long_int/=10;
}
return variant(static_cast<int>(long_int) , DECIMAL_VARIANT );
}
return variant(as_int() * v.as_int());
}
variant variant::operator/(const variant& v) const
{
if(is_decimal() || v.is_decimal()) {
int denominator = v.as_decimal();
if(denominator == 0) {
throw type_error("divide by zero error");
}
long long long_int = as_decimal();
long_int *= 10000;
long_int /= denominator;
if(long_int%10 >= 5) {
long_int /= 10;
++long_int;
} else {
long_int/=10;
}
return variant(static_cast<int>(long_int), DECIMAL_VARIANT);
}
const int numerator = as_int();
const int denominator = v.as_int();
if(denominator == 0) {
throw type_error("divide by zero error");
}
return variant(numerator / denominator);
}
variant variant::operator%(const variant& v) const
{
if(is_decimal() || v.is_decimal()) {
const int numerator = as_decimal();
const int denominator = v.as_decimal();
if(denominator == 0) {
throw type_error("divide by zero error");
}
return variant(numerator % denominator, DECIMAL_VARIANT);
} else {
const int numerator = as_int();
const int denominator = v.as_int();
if(denominator == 0) {
throw type_error("divide by zero error");
}
return variant(numerator % denominator);
}
}
variant variant::operator^(const variant& v) const
{
if(is_decimal() || v.is_decimal()) {
double res = pow(as_decimal() / 1000.0 , v.as_decimal() / 1000.0);
if(std::isnan(res)) {
return variant();
}
return variant(res, DECIMAL_VARIANT);
}
return variant(static_cast<int>(round_portable(pow(static_cast<double>(as_int()), v.as_int()))));
}
variant variant::operator-() const
{
if(is_decimal()) {
return variant(-as_decimal(), DECIMAL_VARIANT);
}
return variant(-as_int());
}
bool variant::operator==(const variant& v) const
{
if(type() != v.type()) {
if(is_decimal() || v.is_decimal()) {
return as_decimal() == v.as_decimal();
}
return false;
}
return value_->equals(*v.value_);
}
bool variant::operator!=(const variant& v) const
{
return !operator==(v);
}
bool variant::operator<(const variant& v) const
{
if(type() != v.type()) {
if(is_decimal() && v.is_int()) {
return as_decimal() < v.as_decimal();
}
if(v.is_decimal() && is_int()) {
return as_decimal() < v.as_decimal();
}
return type() < v.type();
}
return value_->less_than(*v.value_);
}
bool variant::operator>=(const variant& v) const
{
return !(*this < v);
}
bool variant::operator<=(const variant& v) const
{
return !(v < *this);
}
bool variant::operator>(const variant& v) const
{
return v < *this;
}
variant variant::list_elements_add(const variant& v) const
{
must_both_be(VARIANT_TYPE::TYPE_LIST, v);
return value_cast<variant_list>()->list_op(v.value_, [](variant& v1, variant& v2) { return v1 + v2; });
}
variant variant::list_elements_sub(const variant& v) const
{
must_both_be(VARIANT_TYPE::TYPE_LIST, v);
return value_cast<variant_list>()->list_op(v.value_, [](variant& v1, variant& v2) { return v1 - v2; });
}
variant variant::list_elements_mul(const variant& v) const
{
must_both_be(VARIANT_TYPE::TYPE_LIST, v);
return value_cast<variant_list>()->list_op(v.value_, [](variant& v1, variant& v2) { return v1 * v2; });
}
variant variant::list_elements_div(const variant& v) const
{
must_both_be(VARIANT_TYPE::TYPE_LIST, v);
return value_cast<variant_list>()->list_op(v.value_, [](variant& v1, variant& v2) { return v1 / v2; });
}
variant variant::concatenate(const variant& v) const
{
if(is_list()) {
v.must_be(VARIANT_TYPE::TYPE_LIST);
std::vector<variant> res;
res.reserve(num_elements() + v.num_elements());
for(size_t i = 0; i < num_elements(); ++i) {
res.push_back((*this)[i]);
}
for(size_t i = 0; i < v.num_elements(); ++i) {
res.push_back(v[i]);
}
return variant(res);
} else if(is_string()) {
v.must_be(VARIANT_TYPE::TYPE_STRING);
std::string res = as_string() + v.as_string();
return variant(res);
}
throw type_error(was_expecting("a list or a string", *this));
}
variant variant::build_range(const variant& v) const
{
must_both_be(VARIANT_TYPE::TYPE_INT, v);
return value_cast<variant_int>()->build_range_variant(v.as_int());
}
bool variant::contains(const variant& v) const
{
if(!is_list() && !is_map()) {
throw type_error(was_expecting("a list or a map", *this));
}
if(is_list()) {
return value_cast<variant_list>()->contains(v);
} else {
return value_cast<variant_map>()->contains(v);
}
}
void variant::must_be(VARIANT_TYPE t) const
{
if(type() != t) {
throw type_error(was_expecting(variant_type_to_string(t), *this));
}
}
void variant::must_both_be(VARIANT_TYPE t, const variant& second) const
{
if(type() != t || second.type() != t) {
throw type_error(formatter() << "TYPE ERROR: expected two "
<< variant_type_to_string(t) << " but found "
<< type_string() << " (" << to_debug_string() << ")" << " and "
<< second.type_string() << " (" << second.to_debug_string() << ")");
}
}
std::string variant::serialize_to_string() const
{
return value_->get_serialized_string();
}
void variant::serialize_from_string(const std::string& str)
{
try {
*this = formula(str).evaluate();
} catch(...) {
*this = variant(str);
}
}
std::string variant::string_cast() const
{
return value_->string_cast();
}
std::string variant::to_debug_string(bool verbose, formula_seen_stack* seen) const
{
if(!seen) {
formula_seen_stack seen_stack;
seen = &seen_stack;
}
return value_->get_debug_string(*seen, verbose);
}
variant variant::execute_variant(const variant& var)
{
std::stack<variant> vars;
if(var.is_list()) {
for(size_t n = 1; n <= var.num_elements(); ++n) {
vars.push(var[var.num_elements() - n]);
}
} else {
vars.push(var);
}
std::vector<variant> made_moves;
while(!vars.empty()) {
if(vars.top().is_null()) {
vars.pop();
continue;
}
if(auto action = vars.top().try_convert<action_callable>()) {
variant res = action->execute_self(*this);
if(res.is_int() && res.as_bool()) {
made_moves.push_back(vars.top());
}
} else if(vars.top().is_string() && vars.top().as_string() == "continue") {
// if(infinite_loop_guardian_.continue_check()) {
made_moves.push_back(vars.top());
// } else {
//too many calls in a row - possible infinite loop
// ERR_SF << "ERROR #5001 while executing 'continue' formula keyword" << std::endl;
// if(safe_call)
// error = variant(new game_logic::safe_call_result(nullptr, 5001));
// }
} else if(vars.top().is_string() && (vars.top().as_string() == "end_turn" || vars.top().as_string() == "end")) {
break;
} else {
//this information is unneeded when evaluating formulas from commandline
ERR_SF << "UNRECOGNIZED MOVE: " << vars.top().to_debug_string() << std::endl;
}
vars.pop();
}
return variant(made_moves);
}
}