-
Notifications
You must be signed in to change notification settings - Fork 96
/
Copy pathvalue_visitors.h
1151 lines (986 loc) · 31.9 KB
/
value_visitors.h
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
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#ifndef JINJA2CPP_SRC_VALUE_VISITORS_H
#define JINJA2CPP_SRC_VALUE_VISITORS_H
#include "expression_evaluator.h"
#include "helpers.h"
#include "jinja2cpp/value.h"
#include <boost/algorithm/string/predicate.hpp>
#include <boost/optional.hpp>
#include <fmt/format.h>
#include <fmt/xchar.h>
#include <iostream>
#include <cmath>
#include <limits>
#include <utility>
#include <typeinfo>
namespace jinja2
{
namespace detail
{
template<typename V>
struct RecursiveUnwrapper
{
V* m_visitor{};
RecursiveUnwrapper(V* v)
: m_visitor(v)
{}
template<typename T>
static const auto& UnwrapRecursive(const T& arg)
{
return arg; // std::forward<T>(arg);
}
template<typename T>
static auto& UnwrapRecursive(const RecursiveWrapper<T>& arg)
{
return arg.GetValue();
}
// template<typename T>
// static auto& UnwrapRecursive(RecursiveWrapper<T>& arg)
// {
// return arg.GetValue();
// }
template<typename ... Args>
auto operator()(const Args& ... args) const
{
assert(m_visitor != nullptr);
return (*m_visitor)(UnwrapRecursive(args)...);
}
};
template<typename Fn>
auto ApplyUnwrapped(const InternalValueData& val, Fn&& fn)
{
auto valueRef = GetIf<ValueRef>(&val);
auto targetString = GetIf<TargetString>(&val);
auto targetSV = GetIf<TargetStringView>(&val);
// auto internalValueRef = GetIf<InternalValueRef>(&val);
if (valueRef != nullptr)
return fn(valueRef->get().data());
else if (targetString != nullptr)
return fn(*targetString);
else if (targetSV != nullptr)
return fn(*targetSV);
// else if (internalValueRef != nullptr)
// return fn(internalValueRef->get());
return fn(val);
}
} // namespace detail
template<typename V, typename ... Args>
auto Apply(const InternalValue& val, Args&& ... args)
{
return detail::ApplyUnwrapped(val.GetData(), [&args...](auto& val) {
auto v = V(args...);
return nonstd::visit(detail::RecursiveUnwrapper<V>(&v), val);
});
}
template<typename V, typename ... Args>
auto Apply2(const InternalValue& val1, const InternalValue& val2, Args&& ... args)
{
return detail::ApplyUnwrapped(val1.GetData(), [&val2, &args...](auto& uwVal1) {
return detail::ApplyUnwrapped(val2.GetData(), [&uwVal1, &args...](auto& uwVal2) {
auto v = V(args...);
return nonstd::visit(detail::RecursiveUnwrapper<V>(&v), uwVal1, uwVal2);
});
});
}
bool ConvertToBool(const InternalValue& val);
namespace visitors
{
template<typename R = InternalValue>
struct BaseVisitor
{
R operator() (const GenericMap&) const
{
assert(false);
return R();
}
R operator() (const GenericList&) const
{
assert(false);
return R();
}
R operator() (const ValueRef&) const
{
assert(false);
return R();
}
R operator() (const TargetString&) const
{
assert(false);
return R();
}
template<typename T>
R operator() (T&&) const
{
return R();
}
template<typename T, typename U>
R operator() (T&&, U&&) const
{
return R();
}
};
template<typename CharT>
struct ValueRendererBase
{
ValueRendererBase(std::basic_string<CharT>& os)
: m_os(&os)
{
}
template<typename T>
void operator()(const T& val) const;
void operator()(double val) const;
void operator()(const nonstd::basic_string_view<CharT>& val) const
{
m_os->append(val.begin(), val.end());
}
void operator()(const std::basic_string<CharT>& val) const
{
m_os->append(val.begin(), val.end());
}
void operator()(const EmptyValue&) const {}
void operator()(const ValuesList&) const {}
void operator()(const ValuesMap&) const {}
void operator()(const GenericMap&) const {}
void operator()(const GenericList&) const {}
void operator()(const MapAdapter&) const {}
void operator()(const ListAdapter&) const {}
void operator()(const ValueRef&) const {}
void operator()(const TargetString&) const {}
void operator()(const TargetStringView&) const {}
void operator()(const KeyValuePair&) const {}
void operator()(const Callable&) const {}
void operator()(const UserCallable&) const {}
void operator()(const std::shared_ptr<IRendererBase>) const {}
template<typename T>
void operator()(const boost::recursive_wrapper<T>&) const {}
template<typename T>
void operator()(const RecWrapper<T>&) const {}
auto GetOs() const { return std::back_inserter(*m_os); }
std::basic_string<CharT>* m_os;
};
template<>
template<typename T>
void ValueRendererBase<char>::operator()(const T& val) const
{
fmt::format_to(GetOs(), "{}", val);
}
template<>
template<typename T>
void ValueRendererBase<wchar_t>::operator()(const T& val) const
{
fmt::format_to(GetOs(), L"{}", val);
}
template<>
inline void ValueRendererBase<char>::operator()(double val) const
{
fmt::format_to(GetOs(), "{:.8g}", val);
}
template<>
inline void ValueRendererBase<wchar_t>::operator()(double val) const
{
fmt::format_to(GetOs(), L"{:.8g}", val);
}
struct InputValueConvertor
{
using result_t = boost::optional<InternalValue>;
InputValueConvertor(bool byValue, bool allowStringRef)
: m_byValue(byValue)
, m_allowStringRef(allowStringRef)
{
}
template<typename ChT>
result_t operator()(const std::basic_string<ChT>& val) const
{
if (m_allowStringRef)
return result_t(TargetStringView(nonstd::basic_string_view<ChT>(val)));
return result_t(TargetString(val));
}
template<typename ChT>
result_t operator()(std::basic_string<ChT>& val) const
{
return result_t(TargetString(std::move(val)));
}
result_t operator()(const ValuesList& vals) const
{
if (m_byValue)
{
ValuesList newVals(vals);
return result_t(InternalValue(ListAdapter::CreateAdapter(std::move(newVals))));
}
return result_t(InternalValue(ListAdapter::CreateAdapter(vals)));
}
result_t operator() (ValuesList& vals) const
{
return result_t(InternalValue(ListAdapter::CreateAdapter(std::move(vals))));
}
result_t operator() (const GenericList& vals) const
{
if (m_byValue)
{
GenericList newVals(vals);
return result_t(InternalValue(ListAdapter::CreateAdapter(std::move(newVals))));
}
return result_t(InternalValue(ListAdapter::CreateAdapter(vals)));
}
result_t operator() (GenericList& vals) const
{
return result_t(InternalValue(ListAdapter::CreateAdapter(std::move(vals))));
}
result_t operator()(const ValuesMap& vals) const
{
if (m_byValue)
{
ValuesMap newVals(vals);
return result_t(CreateMapAdapter(std::move(newVals)));
}
return result_t(CreateMapAdapter(vals));
}
result_t operator()(ValuesMap& vals) const { return result_t(CreateMapAdapter(std::move(vals))); }
result_t operator()(const GenericMap& vals) const
{
if (m_byValue)
{
GenericMap newVals(vals);
return result_t(CreateMapAdapter(std::move(newVals)));
}
return result_t(CreateMapAdapter(vals));
}
result_t operator()(GenericMap& vals) const { return result_t(CreateMapAdapter(std::move(vals))); }
result_t operator()(const UserCallable& val) const { return ConvertUserCallable(val); }
result_t operator()(UserCallable& val) const { return ConvertUserCallable(std::move(val)); }
template<typename T>
result_t operator()(const RecWrapper<T>& val) const
{
return this->operator()(const_cast<const T&>(*val));
}
template<typename T>
result_t operator()(RecWrapper<T>& val) const
{
return this->operator()(*val);
}
template<typename T>
result_t operator()(const T& val) const
{
return result_t(InternalValue(val));
}
static result_t ConvertUserCallable(const UserCallable& val);
bool m_byValue{};
bool m_allowStringRef{};
};
template<typename CharT>
struct ValueRenderer;
template<>
struct ValueRenderer<char> : ValueRendererBase<char>
{
ValueRenderer(std::string& os)
: ValueRendererBase<char>::ValueRendererBase<char>(os)
{
}
using ValueRendererBase<char>::operator ();
void operator()(const std::wstring& str) const
{
(*m_os) += ConvertString<std::string>(str);
}
void operator()(const nonstd::wstring_view& str) const
{
(*m_os) += ConvertString<std::string>(str);
}
void operator() (bool val) const
{
m_os->append(val ? "true" : "false");
}
};
template<>
struct ValueRenderer<wchar_t> : ValueRendererBase<wchar_t>
{
ValueRenderer(std::wstring& os)
: ValueRendererBase<wchar_t>::ValueRendererBase<wchar_t>(os)
{
}
using ValueRendererBase<wchar_t>::operator ();
void operator()(const std::string& str) const
{
(*m_os) += ConvertString<std::wstring>(str);
}
void operator()(const nonstd::string_view& str) const
{
(*m_os) += ConvertString<std::wstring>(str);
}
void operator() (bool val) const
{
// fmt::format_to(GetOs(), L"{}", (const wchar_t*)(val ? "true" : "false"));
m_os->append(val ? L"true" : L"false");
}
};
struct UnaryOperation : BaseVisitor<InternalValue>
{
using BaseVisitor::operator ();
UnaryOperation(UnaryExpression::Operation oper)
: m_oper(oper)
{
}
InternalValue operator() (int64_t val) const
{
InternalValue result;
switch (m_oper)
{
case jinja2::UnaryExpression::LogicalNot:
result = val ? false : true;
break;
case jinja2::UnaryExpression::UnaryPlus:
result = +val;
break;
case jinja2::UnaryExpression::UnaryMinus:
result = -val;
break;
}
return result;
}
InternalValue operator() (double val) const
{
InternalValue result;
switch (m_oper)
{
case jinja2::UnaryExpression::LogicalNot:
result = fabs(val) > std::numeric_limits<double>::epsilon() ? false : true;
break;
case jinja2::UnaryExpression::UnaryPlus:
result = +val;
break;
case jinja2::UnaryExpression::UnaryMinus:
result = -val;
break;
}
return result;
}
InternalValue operator() (bool val) const
{
InternalValue result;
switch (m_oper)
{
case jinja2::UnaryExpression::LogicalNot:
result = !val;
break;
default:
break;
}
return result;
}
InternalValue operator() (const MapAdapter&) const
{
InternalValue result;
switch (m_oper)
{
case jinja2::UnaryExpression::LogicalNot:
result = true;
break;
default:
break;
}
return result;
}
InternalValue operator() (const ListAdapter&) const
{
InternalValue result;
switch (m_oper)
{
case jinja2::UnaryExpression::LogicalNot:
result = true;
break;
default:
break;
}
return result;
}
template<typename CharT>
InternalValue operator() (const std::basic_string<CharT>& val) const
{
InternalValue result;
switch (m_oper)
{
case jinja2::UnaryExpression::LogicalNot:
result = val.empty();
break;
default:
break;
}
return result;
}
template<typename CharT>
InternalValue operator() (const nonstd::basic_string_view<CharT>& val) const
{
InternalValue result;
switch (m_oper)
{
case jinja2::UnaryExpression::LogicalNot:
result = val.empty();
break;
default:
break;
}
return result;
}
InternalValue operator() (const EmptyValue&) const
{
InternalValue result;
switch (m_oper)
{
case jinja2::UnaryExpression::LogicalNot:
result = true;
break;
default:
break;
}
return result;
}
UnaryExpression::Operation m_oper;
};
struct BinaryMathOperation : BaseVisitor<>
{
using BaseVisitor::operator ();
using ResultType = InternalValue;
// InternalValue operator() (int, int) const {return InternalValue();}
bool AlmostEqual(double x, double y) const
{
return std::abs(x - y) <= std::numeric_limits<double>::epsilon() * std::abs(x + y) * 6
|| std::abs(x - y) < std::numeric_limits<double>::min();
}
BinaryMathOperation(BinaryExpression::Operation oper, BinaryExpression::CompareType compType = BinaryExpression::CaseSensitive)
: m_oper(oper)
, m_compType(compType)
{
}
ResultType operator() (double left, double right) const
{
ResultType result = 0.0;
switch (m_oper)
{
case jinja2::BinaryExpression::Plus:
result = left + right;
break;
case jinja2::BinaryExpression::Minus:
result = left - right;
break;
case jinja2::BinaryExpression::Mul:
result = left * right;
break;
case jinja2::BinaryExpression::Div:
result = left / right;
break;
case jinja2::BinaryExpression::DivRemainder:
result = std::fmod(left, right);
break;
case jinja2::BinaryExpression::DivInteger:
{
double val = left / right;
result = val < 0 ? ceil(val) : floor(val);
break;
}
case jinja2::BinaryExpression::Pow:
result = pow(left, right);
break;
case jinja2::BinaryExpression::LogicalEq:
result = AlmostEqual(left, right);
break;
case jinja2::BinaryExpression::LogicalNe:
result = !AlmostEqual(left, right);
break;
case jinja2::BinaryExpression::LogicalGt:
result = left > right;
break;
case jinja2::BinaryExpression::LogicalLt:
result = left < right;
break;
case jinja2::BinaryExpression::LogicalGe:
result = left > right || AlmostEqual(left, right);
break;
case jinja2::BinaryExpression::LogicalLe:
result = left < right || AlmostEqual(left, right);
break;
default:
break;
}
return result;
}
ResultType operator() (int64_t left, int64_t right) const
{
ResultType result;
switch (m_oper)
{
case jinja2::BinaryExpression::Plus:
result = left + right;
break;
case jinja2::BinaryExpression::Minus:
result = left - right;
break;
case jinja2::BinaryExpression::Mul:
result = left * right;
break;
case jinja2::BinaryExpression::DivInteger:
result = left / right;
break;
case jinja2::BinaryExpression::Div:
case jinja2::BinaryExpression::DivRemainder:
case jinja2::BinaryExpression::Pow:
result = this->operator ()(static_cast<double>(left), static_cast<double>(right));
break;
case jinja2::BinaryExpression::LogicalEq:
result = left == right;
break;
case jinja2::BinaryExpression::LogicalNe:
result = left != right;
break;
case jinja2::BinaryExpression::LogicalGt:
result = left > right;
break;
case jinja2::BinaryExpression::LogicalLt:
result = left < right;
break;
case jinja2::BinaryExpression::LogicalGe:
result = left >= right;
break;
case jinja2::BinaryExpression::LogicalLe:
result = left <= right;
break;
default:
break;
}
return result;
}
ResultType operator() (int64_t left, double right) const
{
return this->operator ()(static_cast<double>(left), static_cast<double>(right));
}
ResultType operator() (double left, int64_t right) const
{
return this->operator ()(static_cast<double>(left), static_cast<double>(right));
}
template<typename CharT>
ResultType operator() (const std::basic_string<CharT> &left, const std::basic_string<CharT> &right) const
{
return ProcessStrings(nonstd::basic_string_view<CharT>(left), nonstd::basic_string_view<CharT>(right));
}
template<typename CharT1, typename CharT2>
std::enable_if_t<!std::is_same<CharT1, CharT2>::value, ResultType> operator() (const std::basic_string<CharT1>& left, const std::basic_string<CharT2>& right) const
{
auto rightStr = ConvertString<std::basic_string<CharT1>>(right);
return ProcessStrings(nonstd::basic_string_view<CharT1>(left), nonstd::basic_string_view<CharT1>(rightStr));
}
template<typename CharT>
ResultType operator() (const nonstd::basic_string_view<CharT> &left, const std::basic_string<CharT> &right) const
{
return ProcessStrings(left, nonstd::basic_string_view<CharT>(right));
}
template<typename CharT1, typename CharT2>
std::enable_if_t<!std::is_same<CharT1, CharT2>::value, ResultType> operator() (const nonstd::basic_string_view<CharT1>& left, const std::basic_string<CharT2>& right) const
{
auto rightStr = ConvertString<std::basic_string<CharT1>>(right);
return ProcessStrings(left, nonstd::basic_string_view<CharT1>(rightStr));
}
template<typename CharT>
ResultType operator() (const std::basic_string<CharT> &left, const nonstd::basic_string_view<CharT> &right) const
{
return ProcessStrings(nonstd::basic_string_view<CharT>(left), right);
}
template<typename CharT1, typename CharT2>
std::enable_if_t<!std::is_same<CharT1, CharT2>::value, ResultType> operator() (const std::basic_string<CharT1>& left, const nonstd::basic_string_view<CharT2>& right) const
{
auto rightStr = ConvertString<std::basic_string<CharT1>>(right);
return ProcessStrings(nonstd::basic_string_view<CharT1>(left), nonstd::basic_string_view<CharT1>(rightStr));
}
template<typename CharT>
ResultType operator() (const nonstd::basic_string_view<CharT> &left, const nonstd::basic_string_view<CharT> &right) const
{
return ProcessStrings(left, right);
}
template<typename CharT1, typename CharT2>
std::enable_if_t<!std::is_same<CharT1, CharT2>::value, ResultType> operator() (const nonstd::basic_string_view<CharT1>& left, const nonstd::basic_string_view<CharT2>& right) const
{
auto rightStr = ConvertString<std::basic_string<CharT1>>(right);
return ProcessStrings(left, nonstd::basic_string_view<CharT1>(rightStr));
}
template<typename CharT>
ResultType operator() (const std::basic_string<CharT> &left, int64_t right) const
{
return RepeatString(nonstd::basic_string_view<CharT>(left), right);
}
template<typename CharT>
ResultType operator() (const nonstd::basic_string_view<CharT> &left, int64_t right) const
{
return RepeatString(left, right);
}
template<typename CharT>
ResultType RepeatString(const nonstd::basic_string_view<CharT>& left, const int64_t right) const
{
using string = std::basic_string<CharT>;
ResultType result;
if(m_oper == jinja2::BinaryExpression::Mul)
{
string str;
for (int i = 0; i < right; ++i)
str.append(left.begin(), left.end());
result = TargetString(std::move(str));
}
return result;
}
template<typename CharT>
ResultType ProcessStrings(const nonstd::basic_string_view<CharT>& left, const nonstd::basic_string_view<CharT>& right) const
{
using string = std::basic_string<CharT>;
ResultType result;
switch (m_oper)
{
case jinja2::BinaryExpression::Plus:
{
auto str = string(left.begin(), left.end());
str.append(right.begin(), right.end());
result = TargetString(std::move(str));
break;
}
case jinja2::BinaryExpression::LogicalEq:
result = m_compType == BinaryExpression::CaseSensitive ? left == right : boost::iequals(left, right);
break;
case jinja2::BinaryExpression::LogicalNe:
result = m_compType == BinaryExpression::CaseSensitive ? left != right : !boost::iequals(left, right);
break;
case jinja2::BinaryExpression::LogicalGt:
result = m_compType == BinaryExpression::CaseSensitive ? left > right : boost::lexicographical_compare(right, left, boost::algorithm::is_iless());
break;
case jinja2::BinaryExpression::LogicalLt:
result = m_compType == BinaryExpression::CaseSensitive ? left < right : boost::lexicographical_compare(left, right, boost::algorithm::is_iless());
break;
case jinja2::BinaryExpression::LogicalGe:
if (m_compType == BinaryExpression::CaseSensitive)
{
result = left >= right;
}
else
{
result = boost::iequals(left, right) ? true : boost::lexicographical_compare(right, left, boost::algorithm::is_iless());
}
break;
case jinja2::BinaryExpression::LogicalLe:
if (m_compType == BinaryExpression::CaseSensitive)
{
result = left <= right;
}
else
{
result = boost::iequals(left, right) ? true : boost::lexicographical_compare(left, right, boost::algorithm::is_iless());
}
break;
default:
break;
}
return result;
}
ResultType operator() (const KeyValuePair& left, const KeyValuePair& right) const
{
ResultType result;
switch (m_oper)
{
case jinja2::BinaryExpression::LogicalEq:
result = ConvertToBool(this->operator ()(left.key, right.key)) && ConvertToBool(Apply2<BinaryMathOperation>(left.value, right.value, BinaryExpression::LogicalEq, m_compType));
break;
case jinja2::BinaryExpression::LogicalNe:
result = ConvertToBool(this->operator ()(left.key, right.key)) || ConvertToBool(Apply2<BinaryMathOperation>(left.value, right.value, BinaryExpression::LogicalNe, m_compType));
break;
default:
break;
}
return result;
}
ResultType operator() (const ListAdapter& left, const ListAdapter& right) const
{
ResultType result;
if (m_oper == jinja2::BinaryExpression::Plus)
{
InternalValueList values;
values.reserve(left.GetSize().value_or(0) + right.GetSize().value_or(0));
for (auto& v : left)
values.push_back(v);
for (auto& v : right)
values.push_back(v);
result = ListAdapter::CreateAdapter(std::move(values));
}
return result;
}
ResultType operator() (const ListAdapter& left, int64_t right) const
{
ResultType result;
if (right >= 0 && m_oper == jinja2::BinaryExpression::Mul)
{
InternalValueList values;
values.reserve(left.GetSize().value_or(0));
for (auto& v : left)
values.push_back(v);
auto listSize = values.size() * right;
result = ListAdapter::CreateAdapter(static_cast<size_t>(listSize),
[size = values.size(), values = std::move(values)](size_t idx) { return values[idx % size]; });
}
return result;
}
ResultType operator() (bool left, bool right) const
{
ResultType result;
switch (m_oper)
{
case jinja2::BinaryExpression::LogicalEq:
result = left == right;
break;
case jinja2::BinaryExpression::LogicalNe:
result = left != right;
break;
case jinja2::BinaryExpression::LogicalLt:
result = (left ? 1 : 0) < (right ? 1 : 0);
break;
default:
break;
}
return result;
}
ResultType operator() (EmptyValue, EmptyValue) const
{
ResultType result;
switch (m_oper)
{
case jinja2::BinaryExpression::LogicalEq:
result = true;
break;
case jinja2::BinaryExpression::LogicalNe:
result = false;
break;
default:
break;
}
return result;
}
template<typename T>
ResultType operator() (EmptyValue, T&&) const
{
ResultType result;
switch (m_oper)
{
case jinja2::BinaryExpression::LogicalEq:
result = false;
break;
case jinja2::BinaryExpression::LogicalNe:
result = true;
break;
default:
break;
}
return result;
}
template<typename T>
ResultType operator() (T&&, EmptyValue) const
{
ResultType result;
switch (m_oper)
{
case jinja2::BinaryExpression::LogicalEq:
result = false;
break;
case jinja2::BinaryExpression::LogicalNe:
result = true;
break;
default:
break;
}
return result;
}
BinaryExpression::Operation m_oper;
BinaryExpression::CompareType m_compType;
};
struct BooleanEvaluator : BaseVisitor<bool>
{
using BaseVisitor::operator ();
bool operator() (int64_t val) const
{
return val != 0;
}
bool operator() (double val) const
{
return fabs(val) < std::numeric_limits<double>::epsilon();
}
bool operator() (bool val) const
{
return val;
}
template<typename CharT>
bool operator()(const std::basic_string<CharT>& str) const
{
return !str.empty();
}
template<typename CharT>
bool operator()(const nonstd::basic_string_view<CharT>& str) const
{
return !str.empty();
}
bool operator() (const MapAdapter& val) const
{
return val.GetSize() != 0ULL;
}
bool operator() (const ListAdapter& val) const
{
return val.GetSize() != 0ULL;
}
bool operator() (const EmptyValue&) const
{
return false;
}
};
template<typename TargetType>
struct NumberEvaluator
{
NumberEvaluator(TargetType def = 0) : m_def(def)
{}
TargetType operator ()(int64_t val) const
{
return static_cast<TargetType>(val);
}
TargetType operator ()(double val) const
{
return static_cast<TargetType>(val);
}
TargetType operator ()(bool val) const
{
return static_cast<TargetType>(val);
}
template<typename U>
TargetType operator()(U&&) const
{
return m_def;
}
TargetType m_def;
};
using IntegerEvaluator = NumberEvaluator<int64_t>;
using DoubleEvaluator = NumberEvaluator<double>;
struct StringJoiner : BaseVisitor<TargetString>
{
using BaseVisitor::operator ();
template<typename CharT>
TargetString operator() (EmptyValue, const std::basic_string<CharT>& str) const
{