-
Notifications
You must be signed in to change notification settings - Fork 12
/
tinyexpr.cpp
2450 lines (2261 loc) · 89.5 KB
/
tinyexpr.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
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
// SPDX-License-Identifier: Zlib
/*
* TINYEXPR - Tiny recursive descent parser and evaluation engine in C
*
* Copyright (c) 2015-2020 Lewis Van Winkle
*
* http://CodePlea.com
*
* This software is provided 'as-is', without any express or implied
* warranty. In no event will the authors be held liable for any damages
* arising from the use of this software.
*
* Permission is granted to anyone to use this software for any purpose,
* including commercial applications, and to alter it and redistribute it
* freely, subject to the following restrictions:
*
* 1. The origin of this software must not be misrepresented; you must not
* claim that you wrote the original software. If you use this software
* in a product, an acknowledgement in the product documentation would be
* appreciated but is not required.
* 2. Altered source versions must be plainly marked as such, and must not be
* misrepresented as being the original software.
* 3. This notice may not be removed or altered from any source distribution.
*/
/*
* TINYEXPR++ - Tiny recursive descent parser and evaluation engine in C++
*
* Copyright (c) 2020-2024 Blake Madden
*
* C++ version of the TinyExpr library.
*
* This software is provided 'as-is', without any express or implied
* warranty. In no event will the authors be held liable for any damages
* arising from the use of this software.
*
* Permission is granted to anyone to use this software for any purpose,
* including commercial applications, and to alter it and redistribute it
* freely, subject to the following restrictions:
*
* 1. The origin of this software must not be misrepresented; you must not
* claim that you wrote the original software. If you use this software
* in a product, an acknowledgement in the product documentation would be
* appreciated but is not required.
* 2. Altered source versions must be plainly marked as such, and must not be
* misrepresented as being the original software.
* 3. This notice may not be removed or altered from any source distribution.
*/
#include "tinyexpr.h"
// builtin functions
namespace te_builtins
{
[[nodiscard]]
constexpr static te_type te_false_value() noexcept
{
return 0;
}
[[nodiscard]]
constexpr static te_type te_true_value() noexcept
{
return 1;
}
[[nodiscard]]
constexpr static te_type te_nan_value() noexcept
{
return te_parser::te_nan;
}
[[nodiscard]]
static te_type te_max_integer() noexcept
{
return te_parser::get_max_integer();
}
[[nodiscard]]
static te_type te_even(te_type val)
{
if (!std::isfinite(val))
{
return te_parser::te_nan;
}
int64_t rounded{ static_cast<int64_t>(std::ceil(std::abs(val))) };
if ((rounded % 2) != 0)
{
++rounded;
}
return (val < 0 ? -(static_cast<te_type>(rounded)) : static_cast<te_type>(rounded));
}
[[nodiscard]]
static te_type te_odd(te_type val)
{
if (!std::isfinite(val))
{
return te_parser::te_nan;
}
int64_t rounded{ static_cast<int64_t>(std::ceil(std::abs(val))) };
if ((rounded % 2) == 0)
{
++rounded;
}
return (val < 0 ? -(static_cast<te_type>(rounded)) : static_cast<te_type>(rounded));
}
[[nodiscard]]
static te_type te_is_even(te_type val)
{
if (!std::isfinite(val))
{
return te_parser::te_nan;
}
const int64_t floored{ static_cast<int64_t>(std::floor(val)) };
return ((floored % 2) == 0 ? te_true_value() : te_false_value());
}
[[nodiscard]]
static te_type te_is_odd(te_type val)
{
if (!std::isfinite(val))
{
return te_parser::te_nan;
}
const int64_t floored{ static_cast<int64_t>(std::floor(val)) };
return ((floored % 2) != 0 ? te_true_value() : te_false_value());
}
[[nodiscard]]
constexpr static te_type te_equal(te_type val1, te_type val2) noexcept
{
return static_cast<te_type>((val1 == val2) ? 1 : 0);
}
[[nodiscard]]
constexpr static te_type te_not_equal(te_type val1, te_type val2) noexcept
{
return static_cast<te_type>((val1 != val2) ? 1 : 0);
}
[[nodiscard]]
constexpr static te_type te_less_than(te_type val1, te_type val2) noexcept
{
return static_cast<te_type>((val1 < val2) ? 1 : 0);
}
[[nodiscard]]
constexpr static te_type te_less_than_equal_to(te_type val1, te_type val2) noexcept
{
return static_cast<te_type>((val1 <= val2) ? 1 : 0);
}
[[nodiscard]]
constexpr static te_type te_greater_than(te_type val1, te_type val2) noexcept
{
return static_cast<te_type>((val1 > val2) ? 1 : 0);
}
[[nodiscard]]
constexpr static te_type te_greater_than_equal_to(te_type val1, te_type val2) noexcept
{
return static_cast<te_type>((val1 >= val2) ? 1 : 0);
}
[[nodiscard]]
constexpr static te_type te_and(te_type val1, te_type val2)
{
// clang-format off
return (!std::isfinite(val1) && !std::isfinite(val2)) ?
te_parser::te_nan :
static_cast<te_type>(
(te_parser::double_to_bool(val1) && te_parser::double_to_bool(val2)) ? 1 : 0);
// clang-format on
}
[[nodiscard]]
constexpr static te_type te_or(te_type val1, te_type val2)
{
// clang-format off
return (!std::isfinite(val1) && !std::isfinite(val2)) ?
te_parser::te_nan :
static_cast<te_type>(
(te_parser::double_to_bool(val1) || te_parser::double_to_bool(val2)) ? 1 : 0);
// clang-format on
}
[[nodiscard]]
static te_type te_not(te_type val)
{
return std::isfinite(val) ? static_cast<te_type>(!te_parser::double_to_bool(val)) :
te_parser::te_nan;
}
[[nodiscard]]
constexpr static te_type te_pi() noexcept
{
return static_cast<te_type>(3.14159265358979323846); // NOLINT
}
[[nodiscard]]
constexpr static te_type te_e() noexcept
{
return static_cast<te_type>(2.71828182845904523536); // NOLINT
}
[[nodiscard]]
static te_type te_fac(te_type val) noexcept
{ /* simplest version of factorial */
if (!std::isfinite(val) || val < 0.0)
{
return te_parser::te_nan;
}
if (val > (std::numeric_limits<unsigned int>::max)())
{
return std::numeric_limits<te_type>::infinity();
}
const auto usignVal = static_cast<size_t>(val);
uint32_t result{ 1 };
for (uint32_t i = 1; i <= usignVal; i++)
{
if (i > (std::numeric_limits<uint32_t>::max)() / result)
{
return std::numeric_limits<te_type>::infinity();
}
result *= i;
}
return static_cast<te_type>(result);
}
[[nodiscard]]
static te_type te_absolute_value(te_type val)
{
return std::fabs(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_log(te_type val)
{
return std::log(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_log10(te_type val)
{
return std::log10(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_pow(te_type val1, te_type val2)
{
return std::pow(static_cast<te_type>(val1), static_cast<te_type>(val2));
}
[[nodiscard]]
static te_type te_tan(te_type val)
{
return std::tan(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_tanh(te_type val)
{
return std::tanh(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_trunc(te_type val)
{
return std::trunc(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_sin(te_type val)
{
return std::sin(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_sinh(te_type val)
{
return std::sinh(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_sqrt(te_type val)
{
if (val < 0)
{
throw std::runtime_error("Negative value passed to SQRT.");
}
return std::sqrt(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_floor(te_type val)
{
return std::floor(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_ceil(te_type val)
{
return std::ceil(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_exp(te_type val)
{
return std::exp(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_cos(te_type val)
{
return std::cos(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_cosh(te_type val)
{
return std::cosh(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_acos(te_type val)
{
return std::acos(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_asin(te_type val)
{
if (std::isfinite(val) && (val < -1.0 || val > 1.0))
{
throw std::runtime_error("Argument passed to ASIN must be between -1 and 1.");
}
return std::asin(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_atan(te_type val)
{
return std::atan(static_cast<te_type>(val));
}
[[nodiscard]]
static te_type te_atan2(te_type val1, te_type val2)
{
return std::atan2(static_cast<te_type>(val1), (static_cast<te_type>(val2)));
}
[[nodiscard]]
static te_type te_tgamma(te_type val)
{
return std::tgamma(val);
}
[[nodiscard]]
static te_type te_random()
{
std::random_device rdev;
std::mt19937 gen(rdev());
std::uniform_real_distribution<te_type> distr(0, 1);
return distr(gen);
}
[[nodiscard]]
constexpr static te_type te_divide(te_type val1, te_type val2)
{
if (val2 == 0)
{
throw std::runtime_error("Division by zero.");
}
return val1 / val2;
}
[[nodiscard]]
static te_type te_modulus(te_type val1, te_type val2)
{
if (val2 == 0)
{
throw std::runtime_error("Modulus by zero.");
}
return std::fmod(val1, val2);
}
[[nodiscard]]
static te_type te_sum(te_type val1, te_type val2, te_type val3, te_type val4, te_type val5,
te_type val6, te_type val7)
{
return (!std::isfinite(val1) ? 0 : val1) + (!std::isfinite(val2) ? 0 : val2) +
(!std::isfinite(val3) ? 0 : val3) + (!std::isfinite(val4) ? 0 : val4) +
(!std::isfinite(val5) ? 0 : val5) + (!std::isfinite(val6) ? 0 : val6) +
(!std::isfinite(val7) ? 0 : val7);
}
[[nodiscard]]
static te_type te_average(te_type val1, te_type val2, te_type val3, te_type val4, te_type val5,
te_type val6, te_type val7)
{
const auto validN = (!std::isfinite(val1) ? 0 : 1) + (!std::isfinite(val2) ? 0 : 1) +
(!std::isfinite(val3) ? 0 : 1) + (!std::isfinite(val4) ? 0 : 1) +
(!std::isfinite(val5) ? 0 : 1) + (!std::isfinite(val6) ? 0 : 1) +
(!std::isfinite(val7) ? 0 : 1);
const auto total = te_sum(val1, val2, val3, val4, val5, val6, val7);
return te_divide(total, static_cast<te_type>(validN));
}
/// @warning This version of round emulates Excel behavior of supporting
/// negative decimal places (e.g., ROUND(21.5, -1) = 20). Be aware
/// of that if using this function outside of TinyExpr++.
[[nodiscard]]
static te_type te_round(te_type val, te_type decimalPlaces) // NOLINT
{
const bool useNegativeRound{ decimalPlaces < 0 };
const size_t adjustedDecimalPlaces{ !std::isfinite(decimalPlaces) ?
0 :
static_cast<size_t>(std::abs(decimalPlaces)) };
const auto decimalPostition = static_cast<te_type>(std::pow(10, adjustedDecimalPlaces));
if (!std::isfinite(decimalPostition))
{
return te_parser::te_nan;
}
constexpr te_type ROUND_EPSILON{ 0.5 }; // NOLINT
if (!useNegativeRound)
{
if (val < 0)
{
return (decimalPostition == 0) ?
std::ceil(val - ROUND_EPSILON) :
std::ceil(static_cast<te_type>(val * decimalPostition) - ROUND_EPSILON) /
decimalPostition;
}
return (decimalPostition == 0) ?
std::floor(val + ROUND_EPSILON) :
std::floor(static_cast<te_type>(val * decimalPostition) + ROUND_EPSILON) /
decimalPostition;
}
// ROUND(21.5, -1) = 20
if (val < 0)
{
return std::ceil(static_cast<te_type>(val / decimalPostition) - ROUND_EPSILON) *
decimalPostition;
}
return std::floor(static_cast<te_type>(val / decimalPostition) + ROUND_EPSILON) *
decimalPostition;
}
// Combinations (without repetition)
[[nodiscard]]
static te_type te_ncr(te_type val1, te_type val2) noexcept
{
if (!std::isfinite(val1) || !std::isfinite(val2) || val1 < 0.0 || val2 < 0.0 || val1 < val2)
{
return te_parser::te_nan;
}
if (val1 > ((std::numeric_limits<unsigned int>::max)()) ||
val2 > (std::numeric_limits<unsigned int>::max)())
{
return std::numeric_limits<te_type>::infinity();
}
const uint32_t usignN{ static_cast<unsigned int>(val1) };
uint32_t usignR{ static_cast<unsigned int>(val2) };
uint32_t result{ 1 };
if (usignR > usignN / 2)
{
usignR = usignN - usignR;
}
for (decltype(usignR) i = 1; i <= usignR; i++)
{
if (result > ((std::numeric_limits<uint32_t>::max)()) / (usignN - usignR + i))
{
return std::numeric_limits<te_type>::infinity();
}
result *= usignN - usignR + i;
result /= i;
}
return static_cast<te_type>(result);
}
// Permutations (without repetition)
[[nodiscard]]
static te_type te_npr(te_type val1, te_type val2) noexcept
{
return te_ncr(val1, val2) * te_fac(val2);
}
[[nodiscard]]
constexpr static te_type te_add(te_type val1, te_type val2) noexcept
{
return val1 + val2;
}
[[nodiscard]]
constexpr static te_type te_sub(te_type val1, te_type val2) noexcept
{
return val1 - val2;
}
[[nodiscard]]
constexpr static te_type te_mul(te_type val1, te_type val2) noexcept
{
return val1 * val2;
}
#if __cplusplus >= 202002L && !defined(TE_FLOAT)
//--------------------------------------------------
[[nodiscard]]
static te_type te_right_rotate8(te_type val1, te_type val2)
{
constexpr int BITNESS{ 8 };
if (std::floor(val1) != val1 || std::floor(val2) != val2)
{
throw std::runtime_error("Bitwise RIGHT ROTATE operation must use integers.");
}
if (val1 < 0)
{
throw std::runtime_error("Bitwise RIGHT ROTATE value must be positive.");
}
if (val2 > BITNESS)
{
throw std::runtime_error("Rotation operation must be between 0-8.");
}
return static_cast<te_type>(std::rotr(static_cast<uint8_t>(val1), static_cast<int>(val2)));
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_left_rotate8(te_type val1, te_type val2)
{
constexpr int BITNESS{ 8 };
if (std::floor(val1) != val1 || std::floor(val2) != val2)
{
throw std::runtime_error("Bitwise LEFT ROTATE operation must use integers.");
}
if (val1 < 0)
{
throw std::runtime_error("Bitwise LEFT ROTATE value must be positive.");
}
if (val2 > BITNESS)
{
throw std::runtime_error("Rotation operation must be between 0-8.");
}
return static_cast<te_type>(std::rotl(static_cast<uint8_t>(val1), static_cast<int>(val2)));
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_right_rotate16(te_type val1, te_type val2)
{
constexpr int BITNESS{ 16 };
if (std::floor(val1) != val1 || std::floor(val2) != val2)
{
throw std::runtime_error("Bitwise RIGHT ROTATE operation must use integers.");
}
if (val1 < 0)
{
throw std::runtime_error("Bitwise RIGHT ROTATE value must be positive.");
}
if (val2 > BITNESS)
{
throw std::runtime_error("Rotation operation must be between 0-16.");
}
return static_cast<te_type>(std::rotr(static_cast<uint16_t>(val1), static_cast<int>(val2)));
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_left_rotate16(te_type val1, te_type val2)
{
constexpr int BITNESS{ 16 };
if (std::floor(val1) != val1 || std::floor(val2) != val2)
{
throw std::runtime_error("Bitwise LEFT ROTATE operation must use integers.");
}
if (val1 < 0)
{
throw std::runtime_error("Bitwise LEFT ROTATE value must be positive.");
}
if (val2 > BITNESS)
{
throw std::runtime_error("Rotation operation must be between 0-16.");
}
return static_cast<te_type>(std::rotl(static_cast<uint16_t>(val1), static_cast<int>(val2)));
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_right_rotate32(te_type val1, te_type val2)
{
constexpr int BITNESS{ 32 };
if constexpr (!te_parser::supports_32bit())
{
throw std::runtime_error("32-bit bitwise operations are not supported.");
}
if (std::floor(val1) != val1 || std::floor(val2) != val2)
{
throw std::runtime_error("Bitwise RIGHT ROTATE operation must use integers.");
}
if (val1 < 0)
{
throw std::runtime_error("Bitwise RIGHT ROTATE value must be positive.");
}
if (val2 > BITNESS)
{
throw std::runtime_error("Rotation operation must be between 0-32.");
}
return static_cast<te_type>(std::rotr(static_cast<uint32_t>(val1), static_cast<int>(val2)));
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_left_rotate32(te_type val1, te_type val2)
{
constexpr int BITNESS{ 32 };
if constexpr (!te_parser::supports_32bit())
{
throw std::runtime_error("32-bit bitwise operations are not supported.");
}
if (std::floor(val1) != val1 || std::floor(val2) != val2)
{
throw std::runtime_error("Bitwise LEFT ROTATE operation must use integers.");
}
if (val1 < 0)
{
throw std::runtime_error("Bitwise LEFT ROTATE value must be positive.");
}
if (val2 > BITNESS)
{
throw std::runtime_error("Rotation operation must be between 0-32.");
}
return static_cast<te_type>(std::rotl(static_cast<uint32_t>(val1), static_cast<int>(val2)));
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_right_rotate64(te_type val1, te_type val2)
{
constexpr int BITNESS{ 63 };
if constexpr (!te_parser::supports_64bit())
{
throw std::runtime_error("64-bit bitwise operations are not supported.");
}
if (std::floor(val1) != val1 || std::floor(val2) != val2)
{
throw std::runtime_error("Bitwise RIGHT ROTATE operation must use integers.");
}
if (val1 < 0)
{
throw std::runtime_error("Bitwise RIGHT ROTATE value must be positive.");
}
if (val2 > BITNESS)
{
throw std::runtime_error("Rotation operation must be between 0-63");
}
return static_cast<te_type>(std::rotr(static_cast<uint64_t>(val1), static_cast<int>(val2)));
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_left_rotate64(te_type val1, te_type val2)
{
constexpr int BITNESS{ 63 };
if constexpr (!te_parser::supports_64bit())
{
throw std::runtime_error("64-bit bitwise operations are not supported.");
}
if (std::floor(val1) != val1 || std::floor(val2) != val2)
{
throw std::runtime_error("Bitwise LEFT ROTATE operation must use integers.");
}
if (val1 < 0)
{
throw std::runtime_error("Bitwise LEFT ROTATE value must be positive.");
}
if (val2 > BITNESS)
{
throw std::runtime_error("Rotation operation must be between 0-63");
}
return static_cast<te_type>(std::rotl(static_cast<uint64_t>(val1), static_cast<int>(val2)));
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_right_rotate(te_type val1, te_type val2)
{
if constexpr (te_parser::supports_64bit())
{
return te_right_rotate64(val1, val2);
}
else if constexpr (te_parser::supports_32bit())
{
return te_right_rotate32(val1, val2);
}
else
{
return te_right_rotate16(val1, val2);
}
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_left_rotate(te_type val1, te_type val2)
{
if constexpr (te_parser::supports_64bit())
{
return te_left_rotate64(val1, val2);
}
else if constexpr (te_parser::supports_32bit())
{
return te_left_rotate32(val1, val2);
}
else
{
return te_left_rotate16(val1, val2);
}
}
#endif
//--------------------------------------------------
[[nodiscard]]
static te_type te_bitwise_not8(te_type val)
{
if (std::floor(val) != val)
{
throw std::runtime_error("Bitwise NOT must use integers.");
}
if (val < 0)
{
throw std::runtime_error("Bitwise NOT value must be positive.");
}
if (val > std::numeric_limits<uint8_t>::max())
{
throw std::runtime_error("Value is too large for bitwise NOT.");
}
// force the bit manipulation to stay unsigned, like what Excel does
const uint8_t intVal{ static_cast<uint8_t>(val) };
const decltype(intVal) result{ std::bit_not<decltype(intVal)>{}(intVal) };
return static_cast<te_type>(result);
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_bitwise_not16(te_type val)
{
if (std::floor(val) != val)
{
throw std::runtime_error("Bitwise NOT must use integers.");
}
if (val < 0)
{
throw std::runtime_error("Bitwise NOT value must be positive.");
}
if (val > std::numeric_limits<uint16_t>::max())
{
throw std::runtime_error("Value is too large for bitwise NOT.");
}
const uint16_t intVal{ static_cast<uint16_t>(val) };
const decltype(intVal) result{ std::bit_not<decltype(intVal)>{}(intVal) };
return static_cast<te_type>(result);
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_bitwise_not32(te_type val)
{
if constexpr (!te_parser::supports_32bit())
{
throw std::runtime_error("32-bit bitwise operations are not supported.");
}
if (std::floor(val) != val)
{
throw std::runtime_error("Bitwise NOT must use integers.");
}
if (val < 0)
{
throw std::runtime_error("Bitwise NOT value must be positive.");
}
if (val > std::numeric_limits<uint32_t>::max())
{
throw std::runtime_error("Value is too large for bitwise NOT.");
}
const uint32_t intVal{ static_cast<uint32_t>(val) };
const decltype(intVal) result{ std::bit_not<decltype(intVal)>{}(intVal) };
return static_cast<te_type>(result);
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_bitwise_not64(te_type val)
{
if constexpr (!te_parser::supports_64bit())
{
throw std::runtime_error("64-bit bitwise operations are not supported.");
}
if (std::floor(val) != val)
{
throw std::runtime_error("Bitwise NOT must use integers.");
}
if (val < 0)
{
throw std::runtime_error("Bitwise NOT value must be positive.");
}
if (val > std::numeric_limits<uint64_t>::max())
{
throw std::runtime_error("Value is too large for bitwise NOT.");
}
const uint64_t intVal{ static_cast<uint64_t>(val) };
const decltype(intVal) result{ std::bit_not<decltype(intVal)>{}(intVal) };
return static_cast<te_type>(result);
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_bitwise_not(te_type val)
{
if constexpr (te_parser::supports_64bit())
{
return te_bitwise_not64(val);
}
else if constexpr (te_parser::supports_32bit())
{
return te_bitwise_not32(val);
}
else
{
return te_bitwise_not16(val);
}
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_bitwise_or(te_type val1, te_type val2)
{
if (std::floor(val1) != val1 || std::floor(val2) != val2)
{
throw std::runtime_error("Bitwise OR operation must use integers.");
}
// negative technically should be allowed, but spreadsheet programs do
// not allow them; hence, we won't either
if (val1 < 0 || val2 < 0)
{
throw std::runtime_error("Bitwise OR operation must use positive integers.");
}
if (val1 > te_parser::MAX_BITOPS_VAL || val2 > te_parser::MAX_BITOPS_VAL)
{
throw std::runtime_error("Value is too large for bitwise operation.");
}
return static_cast<te_type>(static_cast<uint64_t>(val1) | static_cast<uint64_t>(val2));
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_bitwise_xor(te_type val1, te_type val2)
{
if (std::floor(val1) != val1 || std::floor(val2) != val2)
{
throw std::runtime_error("Bitwise XOR operation must use integers.");
}
// negative technically should be allowed, but spreadsheet programs do
// not allow them; hence, we won't either
if (val1 < 0 || val2 < 0)
{
throw std::runtime_error("Bitwise XOR operation must use positive integers.");
}
if (val1 > te_parser::MAX_BITOPS_VAL || val2 > te_parser::MAX_BITOPS_VAL)
{
throw std::runtime_error("Value is too large for bitwise operation.");
}
return static_cast<te_type>(static_cast<uint64_t>(val1) ^ static_cast<uint64_t>(val2));
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_bitwise_and(te_type val1, te_type val2)
{
if (std::floor(val1) != val1 || std::floor(val2) != val2)
{
throw std::runtime_error("Bitwise AND operation must use integers.");
}
// negative technically should be allowed, but spreadsheet programs do
// not allow them; hence, we won't either
if (val1 < 0 || val2 < 0)
{
throw std::runtime_error("Bitwise AND operation must use positive integers.");
}
if (val1 > te_parser::MAX_BITOPS_VAL || val2 > te_parser::MAX_BITOPS_VAL)
{
throw std::runtime_error("Value is too large for bitwise operation.");
}
return static_cast<te_type>(static_cast<uint64_t>(val1) & static_cast<uint64_t>(val2));
}
// Shift operators
//--------------------------------------------------
[[nodiscard]]
static te_type te_left_shift(te_type val1, te_type val2)
{
// For 64-bit, you can shift 63 bits.
// If we are limited to something like 53 bits, then we can use that (same as Excel)
constexpr static auto MAX_BITNESS_PARAM =
(te_parser::supports_64bit() ? te_parser::get_max_integer_bitness() - 1 :
te_parser::get_max_integer_bitness());
if (std::floor(val1) != val1)
{
throw std::runtime_error("Left side of left shift (<<) operation must be an integer.");
}
if (std::floor(val2) != val2)
{
throw std::runtime_error(
"Additive expression of left shift (<<) operation must be an integer.");
}
if (val1 < 0)
{
throw std::runtime_error("Left side of left shift (<<) operation cannot be negative.");
}
if (val1 > te_parser::MAX_BITOPS_VAL)
{
throw std::runtime_error("Value is too large for bitwise operation.");
}
// bitness is limited to 53-bit or 64-bit, so ensure shift doesn't go beyond that
// and cause undefined behavior
if (val2 < 0 || val2 > MAX_BITNESS_PARAM)
{
throw std::runtime_error(
"Additive expression of left shift (<<) operation must be between 0-" +
std::to_string(MAX_BITNESS_PARAM));
}
const auto multipler = (static_cast<uint64_t>(1) << static_cast<uint64_t>(val2));
const auto maxBaseNumber = (std::numeric_limits<uint64_t>::max() / multipler);
if (static_cast<uint64_t>(val1) > maxBaseNumber)
{
throw std::runtime_error(
"Overflow in left shift (<<) operation; base number is too large.");
}
return static_cast<te_type>(static_cast<uint64_t>(val1) << static_cast<uint64_t>(val2));
}
//--------------------------------------------------
[[nodiscard]]
static te_type te_right_shift(te_type val1, te_type val2)
{
constexpr static auto MAX_BITNESS_PARAM =
(te_parser::supports_64bit() ? te_parser::get_max_integer_bitness() - 1 :
te_parser::get_max_integer_bitness());
if (std::floor(val1) != val1)
{
throw std::runtime_error("Left side of right shift (>>) operation must be an integer.");
}
if (std::floor(val2) != val2)
{
throw std::runtime_error(
"Additive expression of right shift (>>) operation must be an integer.");
}
if (val1 < 0)
{
throw std::runtime_error("Left side of right shift (<<) operation cannot be negative.");
}
if (val1 > te_parser::MAX_BITOPS_VAL)
{
throw std::runtime_error("Value is too large for bitwise operation.");
}
if (val2 < 0 || val2 > MAX_BITNESS_PARAM)
{
throw std::runtime_error(
"Additive expression of right shift (>>) operation must be between 0-" +
std::to_string(MAX_BITNESS_PARAM));
}
return static_cast<te_type>(static_cast<uint64_t>(val1) >> static_cast<uint64_t>(val2));
}
/// @warning This emulates Excel, where a negative shift amount acts as a right shift.\n
/// Be aware of this if using this function outside of TinyExpr++.
//--------------------------------------------------
[[nodiscard]]
static te_type te_left_shift_or_right(te_type val1, te_type val2)
{
return (val2 >= 0) ? te_left_shift(val1, val2) : te_right_shift(val1, std::abs(val2));
}
/// @warning This emulates Excel, where a negative shift amount acts as a right shift.\n
/// Be aware of this if using this function outside of TinyExpr++.