-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
numbers.cpp
2485 lines (2177 loc) · 61.5 KB
/
numbers.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
// Teal Dulcet
// Requires support for 128-bit integers (the __int128/__int128_t type).
// Support for arbitrary-precision integers requires the GNU Multiple Precision (GMP) library
// sudo apt-get update
// sudo apt-get install libgmp-dev
// Compile without GMP: g++ -std=gnu++17 -Wall -g -O3 -flto -march=native numbers.cpp -o numbers
// Compile with GMP: g++ -std=gnu++17 -Wall -g -O3 -flto -march=native numbers.cpp -o numbers -DHAVE_GMP -lgmpxx -lgmp
// Run: ./numbers [OPTION(S)]... [NUMBER(S)]...
// If any of the NUMBERS are negative, the first must be preceded by a --.
// Optionally configure the program to use an external factor command instead of the builtin prime factorization functionality. This may be faster when factoring some very large numbers, but slower when factoring large ranges of numbers. Just set the FACTOR define below to the factor command path, for example: "/usr/bin/factor". Alternatively, add the -DFACTOR='"<path>"' option when comping the program, for example -DFACTOR='"/usr/bin/factor"'.
// On Linux distributions with GNU Coreutils older than 9.0, including Ubuntu (https://bugs.launchpad.net/ubuntu/+source/coreutils/+bug/696618) and Debian (https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=608832), the factor command (part of GNU Coreutils) is built without arbitrary-precision/bignum support. If this is the case on your system and you are compiling this program with GMP, you would also need to build the factor command with GMP.
// Requires Make, the GNU C compiler, Autoconf and Automake
// sudo apt-get install build-essential autoconf autopoint texinfo bison gperf
/* Build GNU Coreutils
Save current directory
DIRNAME=$PWD
cd /tmp/
git clone --filter=blob:none https://github.com/coreutils/coreutils.git
git clone --filter=blob:none https://github.com/coreutils/gnulib.git
GNULIB_SRCDIR="$PWD/gnulib"
cd coreutils/
./bootstrap --gnulib-srcdir="$GNULIB_SRCDIR"
./configure # --disable-gcc-warnings
make -j "$(nproc)" CFLAGS="-g -O3 -flto" WERROR_CFLAGS=
make -j "$(nproc)" check CFLAGS="-g -O3 -flto" WERROR_CFLAGS= RUN_EXPENSIVE_TESTS=yes RUN_VERY_EXPENSIVE_TESTS=yes
Copy factor command to starting directory
cp --reflink=auto ./src/factor "$DIRNAME/" */
/* Build uutils coreutils (Cross-platform Rust rewrite of the GNU Coreutils, but does not currently support arbitrary-precision/bignums (https://github.com/uutils/coreutils/issues/1559))
Requires Rust
curl https://sh.rustup.rs -sSf | sh
Save current directory
DIRNAME=$PWD
cd /tmp/
git clone --filter=blob:none https://github.com/uutils/coreutils.git
cd coreutils/
make PROFILE=release
make -j "$(nproc)" test
Copy factor command to starting directory
cp --reflink=auto ./target/release/factor "$DIRNAME/" */
#include <iostream>
#include <sstream>
#include <cstring>
#include <iomanip>
#include <cmath>
#include <climits>
#include <cfloat>
#include <limits>
#include <clocale>
#include <array>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cinttypes>
#include <regex>
#include <bit>
#include <getopt.h>
#if HAVE_GMP
#include <gmpxx.h>
#endif
using namespace std;
// factor command
// #define FACTOR "factor"
enum
{
// DEV_DEBUG_OPTION = CHAR_MAX + 1,
TO_OPTION = CHAR_MAX + 1,
FROM_BASE_OPTION,
BINARY_OPTION,
TERNARY_OPTION,
QUATERNARY_OPTION,
QUINARY_OPTION,
DECIMAL_OPTION,
DUO_OPTION,
VIGES_OPTION,
// BASE36_OPTION,
BRAILLE_OPTION,
SPECIAL_OPTION,
ASCII_OPTION,
UPPER_OPTION,
GETOPT_HELP_CHAR = CHAR_MIN - 2,
GETOPT_VERSION_CHAR = CHAR_MIN - 3
};
enum scale_type
{
scale_none,
scale_SI,
scale_IEC,
scale_IEC_I
};
const char *const scale_to_args[] = {"none", "si", "iec", "iec-i"};
enum scale_type const scale_to_types[] = {scale_none, scale_SI, scale_IEC, scale_IEC_I};
const char *const suffix_power_char[] = {"", "K", "M", "G", "T", "P", "E", "Z", "Y", "R", "Q"};
const char *const roman[][13] = {
{"I", "IV", "V", "IX", "X", "XL", "L", "XC", "C", "CD", "D", "CM", "M"}, // ASCII
{"Ⅰ", "ⅠⅤ", "Ⅴ", "ⅠⅩ", "Ⅹ", "ⅩⅬ", "Ⅼ", "ⅩⅭ", "Ⅽ", "ⅭⅮ", "Ⅾ", "ⅭⅯ", "Ⅿ"} // Unicode
};
const short romanvalues[] = {1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000};
const char *const greek[][36] = {
{"α", "β", "γ", "δ", "ε", "ϛ", "ζ", "η", "θ", "ι", "κ", "λ", "μ", "ν", "ξ", "ο", "π", "ϟ", "ρ", "σ", "τ", "υ", "φ", "χ", "ψ", "ω", "ϡ", "α", "β", "γ", "δ", "ε", "ϛ", "ζ", "η", "θ"}, // Unicode lowercase
{"Α", "Β", "Γ", "Δ", "Ε", "Ϛ", "Ζ", "Η", "Θ", "Ι", "Κ", "Λ", "Μ", "Ν", "Ξ", "Ο", "Π", "Ϟ", "Ρ", "Σ", "Τ", "Υ", "Φ", "Χ", "Ψ", "Ω", "Ϡ", "Α", "Β", "Γ", "Δ", "Ε", "Ϛ", "Ζ", "Η", "Θ"} // Unicode uppercase
};
const short greekvalues[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000, 2000, 3000, 4000, 5000, 6000, 7000, 8000, 9000};
const string ONES[] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};
const string TEENS[] = {"", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen"};
const string TENS[] = {"", "ten", "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty", "ninety"};
// https://en.wikipedia.org/wiki/Names_of_large_numbers
const string THOUSANDPOWERS[] = {"", "thousand", "m", "b", "tr", "quadr", "quint", "sext", "sept", "oct", "non"};
const string THOUSANDONES[] = {"", "un", "duo", "tre", "quattuor", "quin", "se", "septe", "octo", "nove"};
const string THOUSANDTENS[] = {"", "dec", "vigint", "trigint", "quadragint", "quinquagint", "sexagint", "septuagint", "octogint", "nonagint"};
const string THOUSANDHUNDREDS[] = {"", "cent", "ducent", "trecent", "quadringent", "quingent", "sescent", "septingent", "octingent", "nongent"};
const string HEXONES[] = {ONES[0], ONES[1], ONES[2], ONES[3], ONES[4], ONES[5], ONES[6], ONES[7], ONES[8], ONES[9], "ann", "bet", "chris", "dot", "ernest", "frost"};
const string HEXTEENS[] = {TEENS[0], TEENS[1], TEENS[2], TEENS[3], TEENS[4], TEENS[5], TEENS[6], TEENS[7], TEENS[8], TEENS[9], "annteen", "betteen", "christeen", "dotteen", "ernesteen", "frosteen"};
const string HEXTENS[] = {TENS[0], TENS[1], TENS[2], TENS[3], TENS[4], TENS[5], TENS[6], TENS[7], TENS[8], TENS[9], "annty", "betty", "christy", "dotty", "ernesty", "frosty"};
const char *const morsecode[][11] = {
// 0-9, -
{"- - - - -", ". - - - -", ". . - - -", ". . . - -", ". . . . -", ". . . . .", "- . . . .", "- - . . .", "- - - . .", "- - - - .", "- . . . . -"}, // ASCII
{"− − − − −", "• − − − −", "• • − − −", "• • • − −", "• • • • −", "• • • • •", "− • • • •", "− − • • •", "− − − • •", "− − − − •", "− • • • • −"}, // Bullet and minus sign
{"– – – – –", "· – – – –", "· · – – –", "· · · – –", "· · · · –", "· · · · ·", "– · · · ·", "– – · · ·", "– – – · ·", "– – – – ·", "– · · · · –"}, // Middle dot and en dash
{"▄▄▄▄ ▄▄▄▄ ▄▄▄▄ ▄▄▄▄ ▄▄▄▄", "▄ ▄▄▄▄ ▄▄▄▄ ▄▄▄▄ ▄▄▄▄", "▄ ▄ ▄▄▄▄ ▄▄▄▄ ▄▄▄▄", "▄ ▄ ▄ ▄▄▄▄ ▄▄▄▄", "▄ ▄ ▄ ▄ ▄▄▄▄", "▄ ▄ ▄ ▄ ▄", "▄▄▄▄ ▄ ▄ ▄ ▄", "▄▄▄▄ ▄▄▄▄ ▄ ▄ ▄", "▄▄▄▄ ▄▄▄▄ ▄▄▄▄ ▄ ▄", "▄▄▄▄ ▄▄▄▄ ▄▄▄▄ ▄▄▄▄ ▄", "▄▄▄▄ ▄ ▄ ▄ ▄ ▄▄▄▄"} // Blocks
};
const char *const gap = " ";
const char *const braille[] = {"⠀", "⠁", "⠂", "⠃", "⠄", "⠅", "⠆", "⠇", "⠈", "⠉", "⠊", "⠋", "⠌", "⠍", "⠎", "⠏", "⠐", "⠑", "⠒", "⠓", "⠔", "⠕", "⠖", "⠗", "⠘", "⠙", "⠚", "⠛", "⠜", "⠝", "⠞", "⠟", "⠠", "⠡", "⠢", "⠣", "⠤", "⠥", "⠦", "⠧", "⠨", "⠩", "⠪", "⠫", "⠬", "⠭", "⠮", "⠯", "⠰", "⠱", "⠲", "⠳", "⠴", "⠵", "⠶", "⠷", "⠸", "⠹", "⠺", "⠻", "⠼", "⠽", "⠾", "⠿"};
const short brailleindexes[] = {26, 1, 3, 9, 25, 17, 11, 27, 19, 10}; // 0-9
const char *const exponents[] = {"⁰", "¹", "²", "³", "⁴", "⁵", "⁶", "⁷", "⁸", "⁹", "⁻"}; // 0-9, -
const char *const fractions[] = {"¼", "½", "¾", "⅐", "⅑", "⅒", "⅓", "⅔", "⅕", "⅖", "⅗", "⅘", "⅙", "⅚", "⅛", "⅜", "⅝", "⅞"};
const long double fractionvalues[] = {1.0L / 4.0L, 1.0L / 2.0L, 3.0L / 4.0L, 1.0L / 7.0L, 1.0L / 9.0L, 1.0L / 10.0L, 1.0L / 3.0L, 2.0L / 3.0L, 1.0L / 5.0L, 2.0L / 5.0L, 3.0L / 5.0L, 4.0L / 5.0L, 1.0L / 6.0L, 5.0L / 6.0L, 1.0L / 8.0L, 3.0L / 8.0L, 5.0L / 8.0L, 7.0L / 8.0L};
const regex re("^.*: ");
const char *const constants[] = {"π", "e"};
const long double constantvalues[] = {M_PI, M_E};
constexpr unsigned __int128 UINT128_MAX = numeric_limits<unsigned __int128>::max();
constexpr __int128 INT128_MAX = numeric_limits<__int128>::max();
constexpr __int128 INT128_MIN = numeric_limits<__int128>::min();
const long double max_bit = scalbn(1.0L, LDBL_MANT_DIG - 1);
const long double MAX = max_bit + (max_bit - 1);
template <typename T>
using T2 = typename conditional_t<is_integral_v<T>, make_unsigned<T>, common_type<T>>::type;
/* debugging for developers. Enables devmsg().
This flag is used only in the GMP code. */
bool dev_debug = false;
/* Prove primality or run probabilistic tests. */
bool flag_prove_primality = true;
#ifndef FACTOR
/* Number of Miller-Rabin tests to run when not proving primality. */
constexpr int MR_REPS = 25;
template <size_t N>
constexpr auto primes()
{
constexpr size_t limit = !(N & 1) ? N - 1 : N;
constexpr size_t size = (limit - 1) / 2;
constexpr auto sieve = [&]() constexpr -> auto
{
array<bool, size> sieve{};
// sieve.fill(true);
// bitset<size> sieve{};
// sieve.set();
for (auto &x : sieve)
x = true;
for (size_t i = 0; i * i <= size; ++i)
{
if (sieve[i])
{
const size_t p = 3 + 2 * i;
for (size_t j = (p * p - 3) / 2; j < size; j += p)
sieve[j] = false;
}
}
return sieve;
}();
// constexpr size_t nprimes = sieve.count();
constexpr size_t nprimes = [](const array<bool, size> &sieve) constexpr -> size_t
// constexpr size_t nprimes = [](const bitset<size> &sieve) constexpr -> size_t
{
size_t nprimes = 0;
for (const auto &x : sieve)
{
if (x)
++nprimes;
}
return nprimes;
}(sieve);
array<unsigned char, nprimes> primes{};
// array<unsigned __int128, nprimes> magic{};
size_t p = 2;
for (size_t i = 0, j = 0; i < size; ++i)
{
if (sieve[i])
{
const size_t ap = 3 + 2 * i;
primes[j] = ap - p;
// magic[j] = UINT128_MAX / ap + 1;
++j;
p = ap;
}
}
p = limit;
bool is_prime = false;
do
{
p += 2;
is_prime = true;
for (size_t i = 0, ap = 2; is_prime and ap * ap <= p; ap += primes[i], ++i)
{
// if (magic[i] * p < magic[i])
if (!(p % ap))
{
is_prime = false;
break;
}
}
} while (!is_prime);
// return tuple{primes, magic, p};
return tuple{primes, p};
}
// constexpr auto [primes_diff, FIRST_OMITTED_PRIME] = primes<1u << 16>(); // 2^16 = 65536
// constexpr auto temp = primes<5000>();
// constexpr auto temp = primes<50000>();
constexpr auto temp = primes<1u << 16>(); // 2^16 = 65536
// constexpr auto temp = primes<500000>();
constexpr auto &primes_diff = get<0>(temp);
constexpr auto &FIRST_OMITTED_PRIME = get<1>(temp);
constexpr size_t PRIMES_PTAB_ENTRIES = size(primes_diff);
// static_assert(PRIMES_PTAB_ENTRIES == 669 - 1);
// static_assert(FIRST_OMITTED_PRIME == 5003);
// static_assert(PRIMES_PTAB_ENTRIES == 5133 - 1);
// static_assert(FIRST_OMITTED_PRIME == 50021);
static_assert(PRIMES_PTAB_ENTRIES == 6542 - 1);
static_assert(FIRST_OMITTED_PRIME == 65537);
// static_assert(PRIMES_PTAB_ENTRIES == 41538 - 1);
// static_assert(FIRST_OMITTED_PRIME == 500009);
#if HAVE_GMP
template <typename T>
mpz_class import(const T &value)
{
mpz_class result;
mpz_import(result.get_mpz_t(), 1, -1, sizeof(value), 0, 0, &value);
return result;
}
template <typename T>
T aexport(const mpz_class &value)
{
T result;
mpz_export(&result, nullptr, -1, sizeof(result), 0, 0, value.get_mpz_t());
return result;
}
// const mpz_class aINT128_MAX = (mpz_class(1) << 127) - 1;
const mpz_class aINT128_MAX = import(INT128_MAX);
#endif
#endif
/* Number of bits in an uintmax_t. */
constexpr size_t W = sizeof(uintmax_t) * CHAR_BIT;
/* Verify that uintmax_t does not have holes in its representation. */
static_assert(UINTMAX_MAX >> (W - 1) == 1);
/* Number of bits in an unsigned __int128. */
constexpr size_t X = sizeof(unsigned __int128) * CHAR_BIT;
/* Verify that unsigned __int128 does not have holes in its representation. */
static_assert(UINT128_MAX >> (X - 1) == 1);
__int128 strtoi128(const char *nptr, char **endptr, int base)
{
const char *s = nptr;
int c;
bool neg = false;
do
{
c = *s++;
} while (isspace(c));
if (c == '-')
{
neg = true;
c = *s++;
}
else if (c == '+')
c = *s++;
if ((base == 0 or base == 16) and c == '0' and (*s == 'x' or *s == 'X'))
{
c = s[1];
s += 2;
base = 16;
}
if (base == 0)
base = c == '0' ? 8 : 10;
unsigned __int128 cutoff = neg ? -(unsigned __int128)INT128_MIN : INT128_MAX;
const int cutlim = cutoff % base;
cutoff /= base;
unsigned __int128 acc;
int any;
for (acc = 0, any = 0;; c = *s++)
{
if (isdigit(c))
c -= '0';
else if (isalpha(c))
c -= isupper(c) ? 'A' - 10 : 'a' - 10;
else
break;
if (c >= base)
break;
if (any < 0 or acc > cutoff or (acc == cutoff and c > cutlim))
any = -1;
else
{
any = 1;
acc *= base;
acc += c;
}
}
if (any < 0)
{
acc = neg ? INT128_MIN : INT128_MAX;
errno = ERANGE;
}
else if (neg)
acc = -acc;
if (endptr != nullptr)
*endptr = (char *)(any ? s - 1 : nptr);
return acc;
}
unsigned __int128 strtou128(const char *nptr, char **endptr, int base)
{
const char *s = nptr;
int c;
bool neg = false;
do
{
c = *s++;
} while (isspace(c));
if (c == '-')
{
neg = true;
c = *s++;
}
else if (c == '+')
c = *s++;
if ((base == 0 or base == 16) and c == '0' and (*s == 'x' or *s == 'X'))
{
c = s[1];
s += 2;
base = 16;
}
if (base == 0)
base = c == '0' ? 8 : 10;
const unsigned __int128 cutoff = UINT128_MAX / base;
const int cutlim = UINT128_MAX % base;
unsigned __int128 acc;
int any;
for (acc = 0, any = 0;; c = *s++)
{
if (isdigit(c))
c -= '0';
else if (isalpha(c))
c -= isupper(c) ? 'A' - 10 : 'a' - 10;
else
break;
if (c >= base)
break;
if (any < 0 or acc > cutoff or (acc == cutoff and c > cutlim))
any = -1;
else
{
any = 1;
acc *= base;
acc += c;
}
}
if (any < 0)
{
acc = UINT128_MAX;
errno = ERANGE;
}
else if (neg)
acc = -acc;
if (endptr != nullptr)
*endptr = (char *)(any ? s - 1 : nptr);
return acc;
}
// Check if the argument is in the argument list
// Adapted from: https://github.com/coreutils/gnulib/blob/master/lib/argmatch.c
template <typename T>
T xargmatch(const char *const context, const char *const arg, const char *const *arglist, const size_t argsize, const T vallist[])
{
const size_t arglen = strlen(arg);
for (size_t i = 0; i < argsize; ++i)
if (!strncmp(arglist[i], arg, arglen) and strlen(arglist[i]) == arglen)
return vallist[i];
cerr << "Error: Invalid argument " << quoted(arg) << " for " << quoted(context) << "\n";
exit(1);
// return -1;
}
// Auto-scale number to unit
// Adapted from: https://github.com/coreutils/coreutils/blob/master/src/numfmt.c
string outputunit(long double number, const scale_type scale, const bool all = false)
{
ostringstream strm;
unsigned x = 0;
long double val = number;
if (val >= -LDBL_MAX and val <= LDBL_MAX)
{
while (abs(val) >= 10)
{
++x;
val /= 10;
}
}
if (scale == scale_none)
{
if (x > LDBL_DIG)
{
cerr << "Error: Number too large to be printed: '" << number << "' (consider using --to)\n";
return {};
}
strm << setprecision(LDBL_DIG) << number;
return strm.str();
}
if (x > 33 - 1)
{
if (all)
return "N/A";
cerr << "Error: Number too large to be printed: '" << number << "' (cannot handle numbers > 999Q)\n";
return {};
}
double scale_base;
switch (scale)
{
case scale_IEC:
case scale_IEC_I:
scale_base = 1024;
break;
case scale_none:
case scale_SI:
default:
scale_base = 1000;
break;
}
unsigned power = 0;
if (number >= -LDBL_MAX and number <= LDBL_MAX)
{
while (abs(number) >= scale_base)
{
++power;
number /= scale_base;
}
}
long double anumber = abs(number);
anumber += anumber < 10 ? 0.0005 : anumber < 100 ? 0.005
: anumber < 1000 ? 0.05
: 0.5;
string str;
if (number and anumber < 1000 and power > 0)
{
strm << setprecision(LDBL_DIG) << number;
str = strm.str();
const unsigned length = 5 + (number < 0 ? 1 : 0);
if (str.length() > length)
{
const int prec = anumber < 10 ? 3 : anumber < 100 ? 2
: 1;
strm.str("");
strm << setprecision(prec) << fixed << number;
str = strm.str();
}
}
else
{
strm << setprecision(0) << fixed << number;
str = strm.str();
}
str += power < size(suffix_power_char) ? suffix_power_char[power] : "(error)";
if (scale == scale_IEC_I and power > 0)
str += "i";
return str;
}
// Output number in bases 2 - 36
template <typename T>
string outputbase(const T number, const short base = 10, const bool uppercase = false)
{
if (base < 2 or base > 36)
{
cerr << "Error: <BASE> must be 2 - 36.\n";
exit(1);
}
// T2<T> anumber = abs(number);
T2<T> anumber = number;
anumber = number < 0 ? -anumber : anumber;
string str;
// This reserves too much space for higher bases
str.reserve(__bit_width(anumber) + (number < 0));
do
{
char digit = anumber % base;
digit += digit < 10 ? '0' : (uppercase ? 'A' : 'a') - 10;
str = digit + str;
anumber /= base;
} while (anumber > 0);
if (number < 0)
str = '-' + str;
return str;
}
// Output numbers 1 - 3999 as Roman numerals
template <typename T>
string outputroman(const T number, const bool unicode, const bool all = false)
{
// T2<T> anumber = abs(number);
T2<T> anumber = number;
anumber = number < 0 ? -anumber : anumber;
if (anumber < 1 or anumber > 3999)
{
if (all)
return "N/A";
cerr << "Error: Number must be between 1 - 3999\n";
return {};
}
string str;
if (number < 0)
str = '-';
for (int i = size(romanvalues) - 1; anumber > 0; --i)
{
T2<T> div = anumber / romanvalues[i];
if (div)
{
anumber %= romanvalues[i];
while (div--)
str += roman[unicode][i];
}
}
return str;
}
// Output numbers 1 - 9999 as Greek numerals
template <typename T>
string outputgreek(const T number, const bool uppercase, const bool all = false)
{
// T2<T> anumber = abs(number);
T2<T> anumber = number;
anumber = number < 0 ? -anumber : anumber;
if (anumber < 1 or anumber > 9999)
{
if (all)
return "N/A";
cerr << "Error: Number must be between 1 - 9999\n";
return {};
}
string str;
if (number < 0)
str = '-';
for (int i = size(greekvalues) - 1; anumber > 0; --i)
{
if (anumber / greekvalues[i])
{
anumber %= greekvalues[i];
if (greekvalues[i] >= 1000)
str += "͵"; // lower left keraia
str += greek[uppercase][i];
if (greekvalues[i] < 1000 and !anumber)
str += "ʹ"; // keraia
}
}
return str;
}
// Convert number to string
template <typename T>
string tostring(T arg)
{
if constexpr (is_same_v<T, __int128> or is_same_v<T, unsigned __int128>)
return outputbase(arg);
else
{
ostringstream strm;
strm << arg;
return strm.str();
}
}
// Output number as Morse code
template <typename T>
string outputmorsecode(const T &number, const unsigned style)
{
// const T2<T> n = abs(number);
T2<T> n = number;
n = number < 0 ? -n : n;
string str;
const string text = tostring(n);
if (number < 0)
{
str = morsecode[style][10];
str += gap;
}
for (size_t i = 0; i < text.length(); ++i)
{
if (i)
str += gap;
str += morsecode[style][text[i] - '0'];
}
return str;
}
// Output number as Braille
template <typename T>
string outputbraille(const T &number)
{
// const T2<T> n = abs(number);
T2<T> n = number;
n = number < 0 ? -n : n;
string str;
const string text = tostring(n);
if (number < 0)
{
str = braille[16];
str += braille[36];
}
str += braille[60]; // Number indicator
for (const char i : text)
str += braille[brailleindexes[i - '0']];
return str;
}
// Output number as exponent
string outputexponent(const intmax_t number)
{
const short base = 10;
// uintmax_t anumber = abs(number);
uintmax_t anumber = number;
anumber = number < 0 ? -anumber : anumber;
string str;
do
{
str = exponents[anumber % base] + str;
anumber /= base;
} while (anumber > 0);
if (number < 0)
str = exponents[10] + str;
return str;
}
string thousandpower(size_t power)
{
string str;
if (power < size(THOUSANDPOWERS))
{
str += THOUSANDPOWERS[power];
if (power > 1)
str += "illion";
return str;
}
--power;
const unsigned scale = 1000;
while (power > 0)
{
string astr;
const unsigned m = power % scale;
power /= scale;
if (m)
{
const unsigned h = m / 100;
const unsigned t = (m % 100) / 10;
const unsigned u = m % 10;
if (u)
astr += m >= 10 ? THOUSANDONES[u] : THOUSANDPOWERS[u + 1] + 'i';
if (u and t)
{
if ((u == 3 or u == 6) and t >= 2 and t <= 5)
astr += 's';
else if (u == 7 or u == 9)
{
if (t == 1 or (t >= 3 and t <= 7))
astr += 'n';
else if (t == 2 or t == 8)
astr += 'm';
}
else if (u == 6 and t == 8)
astr += 'x';
}
if (t)
astr += THOUSANDTENS[t] + (t >= 3 and h ? 'a' : 'i');
else if (u and h)
{
if ((u == 3 or u == 6) and h >= 3 and h <= 5)
astr += 's';
else if (u == 7 or u == 9)
{
if (h >= 1 and h <= 7)
astr += 'n';
else if (h == 8)
astr += 'm';
}
else if (u == 6 and (h == 1 or h == 8))
astr += 'x';
}
if (h)
astr += THOUSANDHUNDREDS[h] + 'i';
astr += "lli";
}
else
astr = "nilli";
str = astr + str;
}
str += "on";
return str;
}
// Output number as text
// Adapted from: https://rosettacode.org/wiki/Number_names
template <typename T>
string outputtext(const T &number, const bool special)
{
// T2<T> n = abs(number);
T2<T> n = number;
n = number < 0 ? -n : n;
string str;
if (number < 0)
// str = '-';
str = "negative ";
if (special and n <= 12 * 12 * 12)
{
if (n == 2)
{
str += "pair";
return str;
}
if (n == 13)
{
str += "baker's dozen";
return str;
}
if (n == 20)
{
str += "score";
return str;
}
if (n % 12 == 0)
{
T temp = n / 12;
if (temp >= 1 and temp < 12)
{
if (temp > 1)
str += outputtext(temp, false) + ' ';
str += "dozen";
return str;
}
if (temp % 12 == 0)
{
temp /= 12;
if (temp >= 1 and temp < 12)
{
if (temp > 1)
str += outputtext(temp, false) + ' ';
str += "gross";
return str;
}
if (temp == 12)
{
str += "great gross";
return str;
}
}
}
}
if (n < 10)
{
if constexpr (!is_integral_v<T>)
str += ONES[n.get_ui()];
else
str += ONES[n];
return str;
}
string astr;
const unsigned scale = 1000;
for (size_t index = 0; n > 0; ++index)
{
unsigned h;
if constexpr (!is_integral_v<T>)
h = mpz_class(n % scale).get_ui();
else
h = n % scale;
n /= scale;
if (h)
{
string aastr;
if (n)
// aastr += ' ';
aastr += astr.empty() and (h < 100 or !(h % 100)) ? " and " : ", ";
if (h >= 100)
{
aastr += ONES[h / 100] + " hundred";
h %= 100;
if (h)
// aastr += ' ';
aastr += " and ";
}
if (h >= 20 or h == 10)
{
aastr += TENS[h / 10];
h %= 10;
if (h)
aastr += '-';
}
if (h < 20 and h > 10)
aastr += TEENS[h - 10];
else if (h < 10 and h > 0)
aastr += ONES[h];
if (index)
aastr += ' ' + thousandpower(index);
astr = aastr + astr;
}
}
str += astr;
return str;
}
// Output hexadecimal number as text
template <typename T>
string outputhextext(const T &number)
{
// T2<T> n = abs(number);
T2<T> n = number;
n = number < 0 ? -n : n;
string str;
const unsigned scale = 0x100;
do
{
unsigned h;
if constexpr (!is_integral_v<T>)
h = mpz_class(n % scale).get_ui();
else
h = n % scale;
n /= scale;
string astr;
if (n)
astr += ' ';
if (h >= 0x20 or h == 0x10)
{
astr += HEXTENS[h / 0x10];
h %= 0x10;
if (h)
astr += '-';
}
if (h < 0x20 and h > 0x10)
astr += HEXTEENS[h - 0x10];
else if (h < 0x10 and (h > 0x0 or astr.length() <= 1))
{
if (n and astr.length() == 1)
astr += "oh-";
astr += HEXONES[h];
}
str = astr + str;
} while (n > 0);
if (number < 0)
// str = '-' + str;
str = "negative " + str;
return str;
}
// Execute command
int exec(const char *const cmd, string &result)
{