forked from bkaradzic/bx
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstring.cpp
1293 lines (1081 loc) · 26.4 KB
/
string.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
/*
* Copyright 2010-2024 Branimir Karadzic. All rights reserved.
* License: https://github.com/bkaradzic/bx/blob/master/LICENSE
*/
#include <bx/allocator.h>
#include <bx/file.h>
#include <bx/hash.h>
#include <bx/string.h>
namespace bx
{
inline bool isInRange(char _ch, char _from, char _to)
{
return unsigned(_ch - _from) <= unsigned(_to-_from);
}
bool isSpace(char _ch)
{
return ' ' == _ch // Space.
|| '\t' == _ch // Horizontal tab.
|| '\n' == _ch // Line feed / new line.
|| '\r' == _ch // Carriage return.
|| '\v' == _ch // Vertical tab.
|| '\f' == _ch // Form feed / new page.
;
}
bool isUpper(char _ch)
{
return isInRange(_ch, 'A', 'Z');
}
bool isLower(char _ch)
{
return isInRange(_ch, 'a', 'z');
}
bool isAlpha(char _ch)
{
return isLower(_ch) || isUpper(_ch);
}
bool isNumeric(char _ch)
{
return isInRange(_ch, '0', '9');
}
bool isAlphaNum(char _ch)
{
return false
|| isAlpha(_ch)
|| isNumeric(_ch)
;
}
bool isHexNum(char _ch)
{
return false
|| isInRange(toLower(_ch), 'a', 'f')
|| isNumeric(_ch)
;
}
bool isPrint(char _ch)
{
return isInRange(_ch, ' ', '~');
}
typedef bool (*CharTestFn)(char _ch);
template<CharTestFn fn>
inline bool isCharTest(const StringView& _str)
{
bool result = true;
for (const char* ptr = _str.getPtr(), *term = _str.getTerm()
; ptr != term && result
; ++ptr
)
{
result &= fn(*ptr);
}
return result;
}
bool isSpace(const StringView& _str)
{
return isCharTest<isSpace>(_str);
}
bool isUpper(const StringView& _str)
{
return isCharTest<isUpper>(_str);
}
bool isLower(const StringView& _str)
{
return isCharTest<isLower>(_str);
}
bool isAlpha(const StringView& _str)
{
return isCharTest<isAlpha>(_str);
}
bool isNumeric(const StringView& _str)
{
return isCharTest<isNumeric>(_str);
}
bool isAlphaNum(const StringView& _str)
{
return isCharTest<isAlphaNum>(_str);
}
bool isHexNum(const StringView& _str)
{
return isCharTest<isHexNum>(_str);
}
bool isPrint(const StringView& _str)
{
return isCharTest<isPrint>(_str);
}
char toLower(char _ch)
{
return _ch + (isUpper(_ch) ? 0x20 : 0);
}
void toLowerUnsafe(char* _inOutStr, int32_t _len)
{
for (int32_t ii = 0; ii < _len; ++ii)
{
_inOutStr[ii] = toLower(_inOutStr[ii]);
}
}
void toLower(char* _inOutStr, int32_t _max)
{
const int32_t len = strLen(_inOutStr, _max);
toLowerUnsafe(_inOutStr, len);
}
char toUpper(char _ch)
{
return _ch - (isLower(_ch) ? 0x20 : 0);
}
void toUpperUnsafe(char* _inOutStr, int32_t _len)
{
for (int32_t ii = 0; ii < _len; ++ii)
{
_inOutStr[ii] = toUpper(_inOutStr[ii]);
}
}
void toUpper(char* _inOutStr, int32_t _max)
{
const int32_t len = strLen(_inOutStr, _max);
toUpperUnsafe(_inOutStr, len);
}
typedef char (*CharFn)(char _ch);
inline char toNoop(char _ch)
{
return _ch;
}
template<CharFn fn>
inline int32_t strCmp(const char* _lhs, int32_t _lhsMax, const char* _rhs, int32_t _rhsMax)
{
int32_t max = min(_lhsMax, _rhsMax);
for (
; 0 < max && fn(*_lhs) == fn(*_rhs)
; ++_lhs, ++_rhs, --max
)
{
if (*_lhs == '\0'
|| *_rhs == '\0')
{
break;
}
}
if (0 == max)
{
return _lhsMax == _rhsMax ? 0 : _lhsMax > _rhsMax ? 1 : -1;
}
return fn(*_lhs) - fn(*_rhs);
}
int32_t strCmp(const StringView& _lhs, const StringView& _rhs, int32_t _max)
{
return strCmp<toNoop>(
_lhs.getPtr()
, min(_lhs.getLength(), _max)
, _rhs.getPtr()
, min(_rhs.getLength(), _max)
);
}
int32_t strCmpI(const StringView& _lhs, const StringView& _rhs, int32_t _max)
{
return strCmp<toLower>(
_lhs.getPtr()
, min(_lhs.getLength(), _max)
, _rhs.getPtr()
, min(_rhs.getLength(), _max)
);
}
inline int32_t strCmpV(const char* _lhs, int32_t _lhsMax, const char* _rhs, int32_t _rhsMax)
{
int32_t max = min(_lhsMax, _rhsMax);
int32_t ii = 0;
int32_t idx = 0;
bool zero = true;
for (
; 0 < max && _lhs[ii] == _rhs[ii]
; ++ii, --max
)
{
const uint8_t ch = _lhs[ii];
if ('\0' == ch
|| '\0' == _rhs[ii])
{
break;
}
if (!isNumeric(ch) )
{
idx = ii+1;
zero = true;
}
else if ('0' != ch)
{
zero = false;
}
}
if (0 == max)
{
return _lhsMax == _rhsMax ? 0 : _lhs[ii] - _rhs[ii];
}
if ('0' != _lhs[idx]
&& '0' != _rhs[idx])
{
int32_t jj = 0;
for (jj = ii
; 0 < max && isNumeric(_lhs[jj])
; ++jj, --max
)
{
if (!isNumeric(_rhs[jj]) )
{
return 1;
}
}
if (isNumeric(_rhs[jj]))
{
return -1;
}
}
else if (zero
&& idx < ii
&& (isNumeric(_lhs[ii]) || isNumeric(_rhs[ii]) ) )
{
return (_lhs[ii] - '0') - (_rhs[ii] - '0');
}
return 0 == max && _lhsMax == _rhsMax ? 0 : _lhs[ii] - _rhs[ii];
}
int32_t strCmpV(const StringView& _lhs, const StringView& _rhs, int32_t _max)
{
return strCmpV(
_lhs.getPtr()
, min(_lhs.getLength(), _max)
, _rhs.getPtr()
, min(_rhs.getLength(), _max)
);
}
int32_t strLen(const char* _str, int32_t _max)
{
if (NULL == _str)
{
return 0;
}
const char* ptr = _str;
for (; 0 < _max && *ptr != '\0'; ++ptr, --_max) {};
return int32_t(ptr - _str);
}
inline int32_t strCopy(char* _dst, int32_t _dstSize, const char* _src, int32_t _num)
{
BX_ASSERT(NULL != _dst, "_dst can't be NULL!");
BX_ASSERT(NULL != _src, "_src can't be NULL!");
BX_ASSERT(0 < _dstSize, "_dstSize can't be 0!");
const int32_t len = strLen(_src, _num);
const int32_t max = _dstSize-1;
const int32_t num = (len < max ? len : max);
memCopy(_dst, _src, num);
_dst[num] = '\0';
return num;
}
int32_t strCopy(char* _dst, int32_t _dstSize, const StringView& _str, int32_t _num)
{
return strCopy(_dst, _dstSize, _str.getPtr(), min(_str.getLength(), _num) );
}
inline int32_t strCat(char* _dst, int32_t _dstSize, const char* _src, int32_t _num)
{
BX_ASSERT(NULL != _dst, "_dst can't be NULL!");
BX_ASSERT(NULL != _src, "_src can't be NULL!");
BX_ASSERT(0 < _dstSize, "_dstSize can't be 0!");
const int32_t max = _dstSize;
const int32_t len = strLen(_dst, max);
return strCopy(&_dst[len], max-len, _src, _num);
}
int32_t strCat(char* _dst, int32_t _dstSize, const StringView& _str, int32_t _num)
{
return strCat(_dst, _dstSize, _str.getPtr(), min(_str.getLength(), _num) );
}
inline const char* strFindUnsafe(const char* _str, int32_t _len, char _ch)
{
for (int32_t ii = 0; ii < _len; ++ii)
{
if (_str[ii] == _ch)
{
return &_str[ii];
}
}
return NULL;
}
inline const char* strFind(const char* _str, int32_t _max, char _ch)
{
return strFindUnsafe(_str, strLen(_str, _max), _ch);
}
StringView strFind(const StringView& _str, char _ch)
{
const char* ptr = strFindUnsafe(_str.getPtr(), _str.getLength(), _ch);
if (NULL == ptr)
{
return StringView(_str.getTerm(), _str.getTerm() );
}
return StringView(ptr, ptr+1);
}
inline const char* strRFindUnsafe(const char* _str, int32_t _len, char _ch)
{
for (int32_t ii = _len-1; 0 <= ii; --ii)
{
if (_str[ii] == _ch)
{
return &_str[ii];
}
}
return NULL;
}
StringView strRFind(const StringView& _str, char _ch)
{
const char* ptr = strRFindUnsafe(_str.getPtr(), _str.getLength(), _ch);
if (NULL == ptr)
{
return StringView(_str.getTerm(), _str.getTerm() );
}
return StringView(ptr, ptr+1);
}
template<CharFn fn>
inline const char* strFind(const char* _str, int32_t _strMax, const char* _find, int32_t _findMax)
{
const char* ptr = _str;
int32_t stringLen = _strMax;
const int32_t findLen = _findMax;
for (; stringLen >= findLen; ++ptr, --stringLen)
{
// Find start of the string.
while (fn(*ptr) != fn(*_find) )
{
++ptr;
--stringLen;
// Search pattern length can't be longer than the string.
if (findLen > stringLen)
{
return NULL;
}
}
if (0 == strCmp<fn>(ptr, _findMax, _find, _findMax) )
{
return ptr;
}
}
return NULL;
}
StringView strFind(const StringView& _str, const StringView& _find, int32_t _num)
{
int32_t len = min(_find.getLength(), _num);
const char* ptr = strFind<toNoop>(
_str.getPtr()
, _str.getLength()
, _find.getPtr()
, len
);
if (NULL == ptr)
{
return StringView(_str.getTerm(), _str.getTerm() );
}
return StringView(ptr, len);
}
StringView strFindI(const StringView& _str, const StringView& _find, int32_t _num)
{
int32_t len = min(_find.getLength(), _num);
const char* ptr = strFind<toLower>(
_str.getPtr()
, _str.getLength()
, _find.getPtr()
, len
);
if (NULL == ptr)
{
return StringView(_str.getTerm(), _str.getTerm() );
}
return StringView(ptr, len);
}
StringView strLTrim(const StringView& _str, const StringView& _chars)
{
const char* ptr = _str.getPtr();
const char* chars = _chars.getPtr();
const uint32_t charsLen = _chars.getLength();
for (uint32_t ii = 0, len = _str.getLength(); ii < len; ++ii)
{
if (NULL == strFindUnsafe(chars, charsLen, ptr[ii]) )
{
return StringView(ptr + ii, len-ii);
}
}
return StringView(_str.getTerm(), _str.getTerm() );
}
StringView strLTrimSpace(const StringView& _str)
{
for (const char* ptr = _str.getPtr(), *term = _str.getTerm(); ptr != term; ++ptr)
{
if (!isSpace(*ptr) )
{
return StringView(ptr, term);
}
}
return StringView(_str.getTerm(), _str.getTerm() );
}
StringView strLTrimNonSpace(const StringView& _str)
{
for (const char* ptr = _str.getPtr(), *term = _str.getTerm(); ptr != term; ++ptr)
{
if (isSpace(*ptr) )
{
return StringView(ptr, term);
}
}
return StringView(_str.getTerm(), _str.getTerm() );
}
StringView strRTrim(const StringView& _str, const StringView& _chars)
{
if (!_str.isEmpty() )
{
const char* ptr = _str.getPtr();
const char* chars = _chars.getPtr();
const uint32_t charsLen = _chars.getLength();
for (int32_t len = _str.getLength(), ii = len - 1; 0 <= ii; --ii)
{
if (NULL == strFindUnsafe(chars, charsLen, ptr[ii]))
{
return StringView(ptr, ii + 1);
}
}
return StringView(_str.getPtr(), _str.getPtr());
}
return _str;
}
StringView strRTrimSpace(const StringView& _str)
{
if (!_str.isEmpty() )
{
const char* ptr = _str.getPtr();
for (int32_t len = _str.getLength(), ii = len - 1; 0 <= ii; --ii)
{
if (!isSpace(ptr[ii]) )
{
return StringView(ptr, ii + 1);
}
}
return StringView(_str.getPtr(), _str.getPtr());
}
return _str;
}
StringView strTrim(const StringView& _str, const StringView& _chars)
{
return strLTrim(strRTrim(_str, _chars), _chars);
}
StringView strTrimSpace(const StringView& _str)
{
return strLTrimSpace(strRTrimSpace(_str) );
}
constexpr uint32_t kFindStep = 1024;
StringView strFindNl(const StringView& _str)
{
StringView str(_str);
// This method returns the character past the \n, so
// there is no need to look for he \r which preceedes it.
StringView eol = strFind(str, "\n");
if (!eol.isEmpty() )
{
return StringView(eol.getTerm(), str.getTerm() );
}
return StringView(_str.getTerm(), _str.getTerm() );
}
StringView strFindEol(const StringView& _str)
{
StringView str(_str);
for (; str.getPtr() != _str.getTerm()
; str = StringView(min(str.getPtr() + kFindStep, _str.getTerm() ), min(str.getPtr() + kFindStep*2, _str.getTerm() ) )
)
{
StringView eol = strFind(str, "\r\n");
if (!eol.isEmpty() )
{
return StringView(eol.getPtr(), _str.getTerm() );
}
eol = strFind(str, '\n');
if (!eol.isEmpty() )
{
return StringView(eol.getPtr(), _str.getTerm() );
}
}
return StringView(_str.getTerm(), _str.getTerm() );
}
static const char* strSkipWord(const char* _str, int32_t _max)
{
for (char ch = *_str++; 0 < _max && (isAlphaNum(ch) || '_' == ch); ch = *_str++, --_max) {};
return _str-1;
}
StringView strWord(const StringView& _str)
{
const char* ptr = _str.getPtr();
const char* term = strSkipWord(ptr, _str.getLength() );
return StringView(ptr, term);
}
StringView strFindBlock(const StringView& _str, char _open, char _close)
{
const char* curr = _str.getPtr();
const char* term = _str.getTerm();
const char* start = NULL;
int32_t count = 0;
for (char ch = *curr; curr != term && count >= 0; ch = *(++curr) )
{
if (ch == _open)
{
if (0 == count)
{
start = curr;
}
++count;
}
else if (ch == _close)
{
--count;
if (NULL == start)
{
break;
}
if (0 == count)
{
return StringView(start, curr+1);
}
}
}
return StringView(term, term);
}
StringView normalizeEolLf(char* _out, int32_t _size, const StringView& _str)
{
const char* start = _out;
const char* end = _out;
if (0 < _size)
{
const char* curr = _str.getPtr();
const char* term = _str.getTerm();
end = _out + _size;
for (char ch = *curr; curr != term && _out < end; ch = *(++curr) )
{
if ('\r' != ch)
{
*_out++ = ch;
}
}
end = _out;
}
return StringView(start, end);
}
StringView findIdentifierMatch(const StringView& _str, const StringView& _word)
{
const int32_t len = _word.getLength();
StringView ptr = strFind(_str, _word);
for (; !ptr.isEmpty(); ptr = strFind(StringView(ptr.getPtr() + len, _str.getTerm() ), _word) )
{
char ch = ptr.getPtr() != _str.getPtr() ? *(ptr.getPtr() - 1) : ' ';
if (isAlphaNum(ch) || '_' == ch)
{
continue;
}
ch = *(ptr.getPtr() + len);
if (isAlphaNum(ch) || '_' == ch)
{
continue;
}
return ptr;
}
return StringView(_str.getTerm(), _str.getTerm() );
}
StringView findIdentifierMatch(const StringView& _str, const char** _words, int32_t _num)
{
int32_t ii = 0;
for (StringView word = *_words; ii < _num && !word.isEmpty(); ++ii, ++_words, word = *_words)
{
StringView match = findIdentifierMatch(_str, word);
if (!match.isEmpty() )
{
return match;
}
}
return StringView(_str.getTerm(), _str.getTerm() );
}
namespace
{
struct Param
{
Param()
: width(0)
, base(10)
, prec(INT32_MAX)
, fill(' ')
, bits(0)
, left(false)
, upper(false)
, spec(false)
, sign(false)
{
}
int32_t width;
int32_t base;
int32_t prec;
char fill;
uint8_t bits;
bool left;
bool upper;
bool spec;
bool sign;
};
static int32_t write(WriterI* _writer, const char* _str, int32_t _len, const Param& _param, Error* _err)
{
int32_t size = 0;
int32_t len = (int32_t)strLen(_str, _len);
if (_param.width > 0)
{
len = min(_param.width, len);
}
const bool hasMinus = (NULL != _str && '-' == _str[0]);
const bool hasSign = _param.sign || hasMinus;
char sign = hasSign ? hasMinus ? '-' : '+' : '\0';
const char* str = _str;
if (hasMinus)
{
str++;
len--;
}
int32_t padding = _param.width > len ? _param.width - len - hasSign: 0;
if (!_param.left)
{
if (' ' != _param.fill
&& '\0' != sign)
{
size += write(_writer, sign, _err);
sign = '\0';
}
size += writeRep(_writer, _param.fill, max(0, padding), _err);
}
if ('\0' != sign)
{
size += write(_writer, sign, _err);
}
if (NULL == _str)
{
size += write(_writer, "(null)", 6, _err);
}
else if (_param.upper)
{
for (int32_t ii = 0; ii < len; ++ii)
{
size += write(_writer, toUpper(str[ii]), _err);
}
}
else
{
size += write(_writer, str, len, _err);
}
if (_param.left)
{
size += writeRep(_writer, _param.fill, padding, _err);
}
return size;
}
static int32_t write(WriterI* _writer, char _ch, const Param& _param, Error* _err)
{
return write(_writer, &_ch, 1, _param, _err);
}
static int32_t write(WriterI* _writer, const char* _str, const Param& _param, Error* _err)
{
return write(_writer, _str, _param.prec, _param, _err);
}
static int32_t write(WriterI* _writer, const StringView& _str, const Param& _param, Error* _err)
{
return write(_writer, _str.getPtr(), min(_param.prec, _str.getLength() ), _param, _err);
}
static int32_t write(WriterI* _writer, int32_t _i, const Param& _param, Error* _err)
{
char str[33];
int32_t len = toString(str, sizeof(str), _i, _param.base);
if (len == 0)
{
return 0;
}
return write(_writer, str, len, _param, _err);
}
static int32_t write(WriterI* _writer, int64_t _i, const Param& _param, Error* _err)
{
char str[33];
int32_t len = toString(str, sizeof(str), _i, _param.base);
if (len == 0)
{
return 0;
}
return write(_writer, str, len, _param, _err);
}
static int32_t write(WriterI* _writer, uint32_t _u, const Param& _param, Error* _err)
{
char str[33];
int32_t len = toString(str, sizeof(str), _u, _param.base);
if (len == 0)
{
return 0;
}
return write(_writer, str, len, _param, _err);
}
static int32_t write(WriterI* _writer, uint64_t _u, const Param& _param, Error* _err)
{
char str[33];
int32_t len = toString(str, sizeof(str), _u, _param.base);
if (len == 0)
{
return 0;
}
return write(_writer, str, len, _param, _err);
}
static int32_t write(WriterI* _writer, double _d, const Param& _param, Error* _err)
{
char str[1024];
int32_t len = toString(str, sizeof(str), _d);
if (len == 0)
{
return 0;
}
const char* dot = strFind(str, INT32_MAX, '.');
if (NULL != dot)
{
const int32_t prec = INT32_MAX == _param.prec ? 6 : _param.prec;
const char* strEnd = str + len;
const char* exponent = strFind(str, INT32_MAX, 'e');
const char* fracEnd = NULL != exponent ? exponent : strEnd;
char* fracBegin = &str[dot - str + min(prec + _param.spec, 1)];
const int32_t curPrec = int32_t(fracEnd - fracBegin);
// Move exponent to its final location after trimming or adding extra 0s.
if (fracEnd != strEnd)
{
const int32_t exponentLen = int32_t(strEnd - fracEnd);
char* finalExponentPtr = &fracBegin[prec];
memMove(finalExponentPtr, fracEnd, exponentLen);
finalExponentPtr[exponentLen] = '\0';
len = int32_t(&finalExponentPtr[exponentLen] - str);
}
else
{
len = (int32_t)(fracBegin + prec - str);
}
if (curPrec < prec)
{
for (int32_t ii = curPrec; ii < prec; ++ii)
{
fracBegin[ii] = '0';
}
}
}
return write(_writer, str, len, _param, _err);
}
static int32_t write(WriterI* _writer, const void* _ptr, const Param& _param, Error* _err)
{
char str[35] = "0x";
int32_t len = toString(str + 2, sizeof(str) - 2, uint32_t(uintptr_t(_ptr) ), 16);
if (len == 0)
{
return 0;
}
len += 2;
return write(_writer, str, len, _param, _err);
}
} // anonymous namespace
int32_t write(WriterI* _writer, const StringView& _format, va_list _argList, Error* _err)
{
MemoryReader reader(_format.getPtr(), _format.getLength() );
int32_t size = 0;
while (_err->isOk() )
{
char ch = '\0';
Error err;
read(&reader, ch, &err);
if (!_err->isOk()
|| !err.isOk() )
{
break;
}
else if ('%' == ch)
{
// %[Flags][Width][.Precision][Length]Type
read(&reader, ch, &err);
Param param;
// Reference(s):
// - Flags field
// https://en.wikipedia.org/wiki/Printf_format_string#Flags_field
//
while (err.isOk()
&& ( ' ' == ch
|| '-' == ch
|| '+' == ch
|| '0' == ch
|| '#' == ch)
)
{
switch (ch)
{
default:
case ' ': param.fill = ' '; break;
case '-': param.left = true; break;
case '+': param.sign = true; break;
case '0': param.fill = '0'; break;
case '#': param.spec = true; break;
}
read(&reader, ch, &err);
}
if (param.left)
{
param.fill = ' ';
}
// Reference(s):
// - Width field
// https://en.wikipedia.org/wiki/Printf_format_string#Width_field
//
if ('*' == ch)
{
read(&reader, ch, &err);
param.width = va_arg(_argList, int32_t);
if (0 > param.width)
{
param.left = true;