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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
|
/* $Id: ministring.cpp $ */
/** @file
* IPRT - Mini C++ string class.
*
* This is a base for both Utf8Str and other places where IPRT may want to use
* a lean C++ string class.
*/
/*
* Copyright (C) 2007-2023 Oracle and/or its affiliates.
*
* This file is part of VirtualBox base platform packages, as
* available from https://www.virtualbox.org.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation, in version 3 of the
* License.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <https://www.gnu.org/licenses>.
*
* The contents of this file may alternatively be used under the terms
* of the Common Development and Distribution License Version 1.0
* (CDDL), a copy of it is provided in the "COPYING.CDDL" file included
* in the VirtualBox distribution, in which case the provisions of the
* CDDL are applicable instead of those of the GPL.
*
* You may elect to license modified versions of this file under the
* terms and conditions of either the GPL or the CDDL or both.
*
* SPDX-License-Identifier: GPL-3.0-only OR CDDL-1.0
*/
/*********************************************************************************************************************************
* Header Files *
*********************************************************************************************************************************/
#include <iprt/cpp/ministring.h>
#include "internal/iprt.h"
#include <iprt/ctype.h>
#include <iprt/uni.h>
#include <iprt/err.h>
/*********************************************************************************************************************************
* Global Variables *
*********************************************************************************************************************************/
const size_t RTCString::npos = ~(size_t)0;
/*********************************************************************************************************************************
* Defined Constants And Macros *
*********************************************************************************************************************************/
/** Allocation block alignment used when appending bytes to a string. */
#define IPRT_MINISTRING_APPEND_ALIGNMENT 64
RTCString &RTCString::assign(const RTCString &a_rSrc)
{
Assert(&a_rSrc != this);
size_t const cchSrc = a_rSrc.length();
if (cchSrc > 0)
{
reserve(cchSrc + 1);
memcpy(m_psz, a_rSrc.c_str(), cchSrc);
m_psz[cchSrc] = '\0';
m_cch = cchSrc;
return *this;
}
setNull();
return *this;
}
int RTCString::assignNoThrow(const RTCString &a_rSrc) RT_NOEXCEPT
{
AssertReturn(&a_rSrc != this, VINF_SUCCESS);
size_t const cchSrc = a_rSrc.length();
if (cchSrc > 0)
{
int rc = reserveNoThrow(cchSrc + 1);
if (RT_SUCCESS(rc))
{
memcpy(m_psz, a_rSrc.c_str(), cchSrc);
m_psz[cchSrc] = '\0';
m_cch = cchSrc;
return VINF_SUCCESS;
}
return rc;
}
setNull();
return VINF_SUCCESS;
}
RTCString &RTCString::assign(const char *a_pszSrc)
{
if (a_pszSrc)
{
size_t cchSrc = strlen(a_pszSrc);
if (cchSrc)
{
Assert((uintptr_t)&a_pszSrc - (uintptr_t)m_psz >= (uintptr_t)m_cbAllocated);
reserve(cchSrc + 1);
memcpy(m_psz, a_pszSrc, cchSrc);
m_psz[cchSrc] = '\0';
m_cch = cchSrc;
return *this;
}
}
setNull();
return *this;
}
int RTCString::assignNoThrow(const char *a_pszSrc) RT_NOEXCEPT
{
if (a_pszSrc)
{
size_t cchSrc = strlen(a_pszSrc);
if (cchSrc)
{
Assert((uintptr_t)&a_pszSrc - (uintptr_t)m_psz >= (uintptr_t)m_cbAllocated);
int rc = reserveNoThrow(cchSrc + 1);
if (RT_SUCCESS(rc))
{
memcpy(m_psz, a_pszSrc, cchSrc);
m_psz[cchSrc] = '\0';
m_cch = cchSrc;
return VINF_SUCCESS;
}
return rc;
}
}
setNull();
return VINF_SUCCESS;
}
RTCString &RTCString::assign(const RTCString &a_rSrc, size_t a_offSrc, size_t a_cchSrc /*= npos*/)
{
AssertReturn(&a_rSrc != this, *this);
if (a_offSrc < a_rSrc.length())
{
size_t cchMax = a_rSrc.length() - a_offSrc;
if (a_cchSrc > cchMax)
a_cchSrc = cchMax;
reserve(a_cchSrc + 1);
memcpy(m_psz, a_rSrc.c_str() + a_offSrc, a_cchSrc);
m_psz[a_cchSrc] = '\0';
m_cch = a_cchSrc;
}
else
setNull();
return *this;
}
int RTCString::assignNoThrow(const RTCString &a_rSrc, size_t a_offSrc, size_t a_cchSrc /*= npos*/) RT_NOEXCEPT
{
AssertReturn(&a_rSrc != this, VINF_SUCCESS);
if (a_offSrc < a_rSrc.length())
{
size_t cchMax = a_rSrc.length() - a_offSrc;
if (a_cchSrc > cchMax)
a_cchSrc = cchMax;
int rc = reserveNoThrow(a_cchSrc + 1);
if (RT_SUCCESS(rc))
{
memcpy(m_psz, a_rSrc.c_str() + a_offSrc, a_cchSrc);
m_psz[a_cchSrc] = '\0';
m_cch = a_cchSrc;
return VINF_SUCCESS;
}
return rc;
}
setNull();
return VINF_SUCCESS;
}
RTCString &RTCString::assign(const char *a_pszSrc, size_t a_cchSrc)
{
if (a_cchSrc)
{
a_cchSrc = RTStrNLen(a_pszSrc, a_cchSrc);
if (a_cchSrc)
{
Assert((uintptr_t)&a_pszSrc - (uintptr_t)m_psz >= (uintptr_t)m_cbAllocated);
reserve(a_cchSrc + 1);
memcpy(m_psz, a_pszSrc, a_cchSrc);
m_psz[a_cchSrc] = '\0';
m_cch = a_cchSrc;
return *this;
}
}
setNull();
return *this;
}
int RTCString::assignNoThrow(const char *a_pszSrc, size_t a_cchSrc) RT_NOEXCEPT
{
if (a_cchSrc)
{
a_cchSrc = RTStrNLen(a_pszSrc, a_cchSrc);
if (a_cchSrc)
{
Assert((uintptr_t)&a_pszSrc - (uintptr_t)m_psz >= (uintptr_t)m_cbAllocated);
int rc = reserveNoThrow(a_cchSrc + 1);
if (RT_SUCCESS(rc))
{
memcpy(m_psz, a_pszSrc, a_cchSrc);
m_psz[a_cchSrc] = '\0';
m_cch = a_cchSrc;
return VINF_SUCCESS;
}
return rc;
}
}
setNull();
return VINF_SUCCESS;
}
RTCString &RTCString::assign(size_t a_cTimes, char a_ch)
{
reserve(a_cTimes + 1);
memset(m_psz, a_ch, a_cTimes);
m_psz[a_cTimes] = '\0';
m_cch = a_cTimes;
return *this;
}
int RTCString::assignNoThrow(size_t a_cTimes, char a_ch) RT_NOEXCEPT
{
int rc = reserveNoThrow(a_cTimes + 1);
if (RT_SUCCESS(rc))
{
memset(m_psz, a_ch, a_cTimes);
m_psz[a_cTimes] = '\0';
m_cch = a_cTimes;
return VINF_SUCCESS;
}
return rc;
}
RTCString &RTCString::printf(const char *pszFormat, ...)
{
va_list va;
va_start(va, pszFormat);
printfV(pszFormat, va);
va_end(va);
return *this;
}
int RTCString::printfNoThrow(const char *pszFormat, ...) RT_NOEXCEPT
{
va_list va;
va_start(va, pszFormat);
int rc = printfVNoThrow(pszFormat, va);
va_end(va);
return rc;
}
/**
* Callback used with RTStrFormatV by RTCString::printfV.
*
* @returns The number of bytes added (not used).
*
* @param pvArg The string object.
* @param pachChars The characters to append.
* @param cbChars The number of characters. 0 on the final callback.
*/
/*static*/ DECLCALLBACK(size_t)
RTCString::printfOutputCallback(void *pvArg, const char *pachChars, size_t cbChars)
{
RTCString *pThis = (RTCString *)pvArg;
if (cbChars)
{
size_t const cchBoth = pThis->m_cch + cbChars;
if (cchBoth >= pThis->m_cbAllocated)
{
/* Double the buffer size, if it's less that _4M. Align sizes like
for append. */
size_t cbAlloc = RT_ALIGN_Z(pThis->m_cbAllocated, IPRT_MINISTRING_APPEND_ALIGNMENT);
cbAlloc += RT_MIN(cbAlloc, _4M);
if (cbAlloc <= cchBoth)
cbAlloc = RT_ALIGN_Z(cchBoth + 1, IPRT_MINISTRING_APPEND_ALIGNMENT);
pThis->reserve(cbAlloc);
#ifndef RT_EXCEPTIONS_ENABLED
AssertReleaseReturn(pThis->capacity() > cchBoth, 0);
#endif
}
memcpy(&pThis->m_psz[pThis->m_cch], pachChars, cbChars);
pThis->m_cch = cchBoth;
pThis->m_psz[cchBoth] = '\0';
}
return cbChars;
}
RTCString &RTCString::printfV(const char *pszFormat, va_list va)
{
cleanup();
RTStrFormatV(printfOutputCallback, this, NULL, NULL, pszFormat, va);
return *this;
}
RTCString &RTCString::appendPrintfV(const char *pszFormat, va_list va)
{
RTStrFormatV(printfOutputCallback, this, NULL, NULL, pszFormat, va);
return *this;
}
struct RTCSTRINGOTHROW
{
RTCString *pThis;
int rc;
};
/**
* Callback used with RTStrFormatV by RTCString::printfVNoThrow.
*
* @returns The number of bytes added (not used).
*
* @param pvArg Pointer to a RTCSTRINGOTHROW structure.
* @param pachChars The characters to append.
* @param cbChars The number of characters. 0 on the final callback.
*/
/*static*/ DECLCALLBACK(size_t)
RTCString::printfOutputCallbackNoThrow(void *pvArg, const char *pachChars, size_t cbChars) RT_NOEXCEPT
{
RTCString *pThis = ((RTCSTRINGOTHROW *)pvArg)->pThis;
if (cbChars)
{
size_t const cchBoth = pThis->m_cch + cbChars;
if (cchBoth >= pThis->m_cbAllocated)
{
/* Double the buffer size, if it's less that _4M. Align sizes like
for append. */
size_t cbAlloc = RT_ALIGN_Z(pThis->m_cbAllocated, IPRT_MINISTRING_APPEND_ALIGNMENT);
cbAlloc += RT_MIN(cbAlloc, _4M);
if (cbAlloc <= cchBoth)
cbAlloc = RT_ALIGN_Z(cchBoth + 1, IPRT_MINISTRING_APPEND_ALIGNMENT);
int rc = pThis->reserveNoThrow(cbAlloc);
if (RT_SUCCESS(rc))
{ /* likely */ }
else
{
((RTCSTRINGOTHROW *)pvArg)->rc = rc;
return cbChars;
}
}
memcpy(&pThis->m_psz[pThis->m_cch], pachChars, cbChars);
pThis->m_cch = cchBoth;
pThis->m_psz[cchBoth] = '\0';
}
return cbChars;
}
int RTCString::printfVNoThrow(const char *pszFormat, va_list va) RT_NOEXCEPT
{
cleanup();
RTCSTRINGOTHROW Args = { this, VINF_SUCCESS };
RTStrFormatV(printfOutputCallbackNoThrow, &Args, NULL, NULL, pszFormat, va);
return Args.rc;
}
int RTCString::appendPrintfVNoThrow(const char *pszFormat, va_list va) RT_NOEXCEPT
{
RTCSTRINGOTHROW Args = { this, VINF_SUCCESS };
RTStrFormatV(printfOutputCallbackNoThrow, &Args, NULL, NULL, pszFormat, va);
return Args.rc;
}
RTCString &RTCString::appendPrintf(const char *pszFormat, ...)
{
va_list va;
va_start(va, pszFormat);
appendPrintfV(pszFormat, va);
va_end(va);
return *this;
}
int RTCString::appendPrintfNoThrow(const char *pszFormat, ...) RT_NOEXCEPT
{
va_list va;
va_start(va, pszFormat);
int rc = appendPrintfVNoThrow(pszFormat, va);
va_end(va);
return rc;
}
RTCString &RTCString::append(const RTCString &that)
{
Assert(&that != this);
return appendWorker(that.c_str(), that.length());
}
int RTCString::appendNoThrow(const RTCString &that) RT_NOEXCEPT
{
Assert(&that != this);
return appendWorkerNoThrow(that.c_str(), that.length());
}
RTCString &RTCString::append(const char *pszThat)
{
return appendWorker(pszThat, strlen(pszThat));
}
int RTCString::appendNoThrow(const char *pszThat) RT_NOEXCEPT
{
return appendWorkerNoThrow(pszThat, strlen(pszThat));
}
RTCString &RTCString::append(const RTCString &rThat, size_t offStart, size_t cchMax /*= RTSTR_MAX*/)
{
if (offStart < rThat.length())
{
size_t cchLeft = rThat.length() - offStart;
return appendWorker(rThat.c_str() + offStart, RT_MIN(cchLeft, cchMax));
}
return *this;
}
int RTCString::appendNoThrow(const RTCString &rThat, size_t offStart, size_t cchMax /*= RTSTR_MAX*/) RT_NOEXCEPT
{
if (offStart < rThat.length())
{
size_t cchLeft = rThat.length() - offStart;
return appendWorkerNoThrow(rThat.c_str() + offStart, RT_MIN(cchLeft, cchMax));
}
return VINF_SUCCESS;
}
RTCString &RTCString::append(const char *pszThat, size_t cchMax)
{
return appendWorker(pszThat, RTStrNLen(pszThat, cchMax));
}
int RTCString::appendNoThrow(const char *pszThat, size_t cchMax) RT_NOEXCEPT
{
return appendWorkerNoThrow(pszThat, RTStrNLen(pszThat, cchMax));
}
RTCString &RTCString::appendWorker(const char *pszSrc, size_t cchSrc)
{
if (cchSrc)
{
Assert((uintptr_t)&pszSrc - (uintptr_t)m_psz >= (uintptr_t)m_cbAllocated);
size_t cchThis = length();
size_t cchBoth = cchThis + cchSrc;
if (cchBoth >= m_cbAllocated)
{
reserve(RT_ALIGN_Z(cchBoth + 1, IPRT_MINISTRING_APPEND_ALIGNMENT));
// calls realloc(cchBoth + 1) and sets m_cbAllocated; may throw bad_alloc.
#ifndef RT_EXCEPTIONS_ENABLED
AssertRelease(capacity() > cchBoth);
#endif
}
memcpy(&m_psz[cchThis], pszSrc, cchSrc);
m_psz[cchBoth] = '\0';
m_cch = cchBoth;
}
return *this;
}
int RTCString::appendWorkerNoThrow(const char *pszSrc, size_t cchSrc) RT_NOEXCEPT
{
if (cchSrc)
{
Assert((uintptr_t)&pszSrc - (uintptr_t)m_psz >= (uintptr_t)m_cbAllocated);
size_t cchThis = length();
size_t cchBoth = cchThis + cchSrc;
if (cchBoth >= m_cbAllocated)
{
int rc = reserveNoThrow(RT_ALIGN_Z(cchBoth + 1, IPRT_MINISTRING_APPEND_ALIGNMENT));
if (RT_SUCCESS(rc))
{ /* likely */ }
else
return rc;
}
memcpy(&m_psz[cchThis], pszSrc, cchSrc);
m_psz[cchBoth] = '\0';
m_cch = cchBoth;
}
return VINF_SUCCESS;
}
RTCString &RTCString::append(char ch)
{
Assert((unsigned char)ch < 0x80); /* Don't create invalid UTF-8. */
if (ch)
{
// allocate in chunks of 20 in case this gets called several times
if (m_cch + 1 >= m_cbAllocated)
{
reserve(RT_ALIGN_Z(m_cch + 2, IPRT_MINISTRING_APPEND_ALIGNMENT));
// calls realloc(cbBoth) and sets m_cbAllocated; may throw bad_alloc.
#ifndef RT_EXCEPTIONS_ENABLED
AssertRelease(capacity() > m_cch + 1);
#endif
}
m_psz[m_cch] = ch;
m_psz[++m_cch] = '\0';
}
return *this;
}
int RTCString::appendNoThrow(char ch) RT_NOEXCEPT
{
Assert((unsigned char)ch < 0x80); /* Don't create invalid UTF-8. */
if (ch)
{
// allocate in chunks of 20 in case this gets called several times
if (m_cch + 1 >= m_cbAllocated)
{
int rc = reserveNoThrow(RT_ALIGN_Z(m_cch + 2, IPRT_MINISTRING_APPEND_ALIGNMENT));
if (RT_SUCCESS(rc))
{ /* likely */ }
else
return rc;
}
m_psz[m_cch] = ch;
m_psz[++m_cch] = '\0';
}
return VINF_SUCCESS;
}
RTCString &RTCString::appendCodePoint(RTUNICP uc)
{
/*
* Single byte encoding.
*/
if (uc < 0x80)
return RTCString::append((char)uc);
/*
* Multibyte encoding.
* Assume max encoding length when resizing the string, that's simpler.
*/
AssertReturn(uc <= UINT32_C(0x7fffffff), *this);
if (m_cch + 6 >= m_cbAllocated)
{
reserve(RT_ALIGN_Z(m_cch + 6 + 1, IPRT_MINISTRING_APPEND_ALIGNMENT));
// calls realloc(cbBoth) and sets m_cbAllocated; may throw bad_alloc.
#ifndef RT_EXCEPTIONS_ENABLED
AssertRelease(capacity() > m_cch + 6);
#endif
}
char *pszNext = RTStrPutCp(&m_psz[m_cch], uc);
m_cch = pszNext - m_psz;
*pszNext = '\0';
return *this;
}
int RTCString::appendCodePointNoThrow(RTUNICP uc) RT_NOEXCEPT
{
/*
* Single byte encoding.
*/
if (uc < 0x80)
return RTCString::appendNoThrow((char)uc);
/*
* Multibyte encoding.
* Assume max encoding length when resizing the string, that's simpler.
*/
AssertReturn(uc <= UINT32_C(0x7fffffff), VERR_INVALID_UTF8_ENCODING);
if (m_cch + 6 >= m_cbAllocated)
{
int rc = reserveNoThrow(RT_ALIGN_Z(m_cch + 6 + 1, IPRT_MINISTRING_APPEND_ALIGNMENT));
if (RT_SUCCESS(rc))
{ /* likely */ }
else
return rc;
}
char *pszNext = RTStrPutCp(&m_psz[m_cch], uc);
m_cch = pszNext - m_psz;
*pszNext = '\0';
return VINF_SUCCESS;
}
RTCString &RTCString::erase(size_t offStart /*= 0*/, size_t cchLength /*= npos*/) RT_NOEXCEPT
{
size_t cch = length();
if (offStart < cch)
{
if (cchLength >= cch - offStart)
{
/* Trail removal, nothing to move. */
m_cch = offStart;
m_psz[offStart] = '\0';
}
else if (cchLength > 0)
{
/* Pull up the tail to offStart. */
size_t cchAfter = cch - offStart - cchLength;
memmove(&m_psz[offStart], &m_psz[offStart + cchLength], cchAfter);
m_cch = cch -= cchLength;
m_psz[cch] = '\0';
}
}
return *this;
}
RTCString &RTCString::replace(size_t offStart, size_t cchLength, const RTCString &rStrReplacement)
{
return replaceWorker(offStart, cchLength, rStrReplacement.c_str(), rStrReplacement.length());
}
int RTCString::replaceNoThrow(size_t offStart, size_t cchLength, const RTCString &rStrReplacement) RT_NOEXCEPT
{
return replaceWorkerNoThrow(offStart, cchLength, rStrReplacement.c_str(), rStrReplacement.length());
}
RTCString &RTCString::replace(size_t offStart, size_t cchLength, const RTCString &rStrReplacement,
size_t offReplacement, size_t cchReplacement)
{
Assert(this != &rStrReplacement);
if (cchReplacement > 0)
{
if (offReplacement < rStrReplacement.length())
{
size_t cchMaxReplacement = rStrReplacement.length() - offReplacement;
return replaceWorker(offStart, cchLength, rStrReplacement.c_str() + offReplacement,
RT_MIN(cchReplacement, cchMaxReplacement));
}
/* Our non-standard handling of out_of_range situations. */
AssertMsgFailed(("offReplacement=%zu (cchReplacement=%zu) rStrReplacement.length()=%zu\n",
offReplacement, cchReplacement, rStrReplacement.length()));
}
return replaceWorker(offStart, cchLength, "", 0);
}
int RTCString::replaceNoThrow(size_t offStart, size_t cchLength, const RTCString &rStrReplacement,
size_t offReplacement, size_t cchReplacement) RT_NOEXCEPT
{
Assert(this != &rStrReplacement);
if (cchReplacement > 0)
{
if (offReplacement < rStrReplacement.length())
{
size_t cchMaxReplacement = rStrReplacement.length() - offReplacement;
return replaceWorkerNoThrow(offStart, cchLength, rStrReplacement.c_str() + offReplacement,
RT_MIN(cchReplacement, cchMaxReplacement));
}
return VERR_OUT_OF_RANGE;
}
return replaceWorkerNoThrow(offStart, cchLength, "", 0);
}
RTCString &RTCString::replace(size_t offStart, size_t cchLength, const char *pszReplacement)
{
return replaceWorker(offStart, cchLength, pszReplacement, strlen(pszReplacement));
}
int RTCString::replaceNoThrow(size_t offStart, size_t cchLength, const char *pszReplacement) RT_NOEXCEPT
{
return replaceWorkerNoThrow(offStart, cchLength, pszReplacement, strlen(pszReplacement));
}
RTCString &RTCString::replace(size_t offStart, size_t cchLength, const char *pszReplacement, size_t cchReplacement)
{
return replaceWorker(offStart, cchLength, pszReplacement, RTStrNLen(pszReplacement, cchReplacement));
}
int RTCString::replaceNoThrow(size_t offStart, size_t cchLength, const char *pszReplacement, size_t cchReplacement) RT_NOEXCEPT
{
return replaceWorkerNoThrow(offStart, cchLength, pszReplacement, RTStrNLen(pszReplacement, cchReplacement));
}
RTCString &RTCString::replaceWorker(size_t offStart, size_t cchLength, const char *pszSrc, size_t cchSrc)
{
Assert((uintptr_t)&pszSrc - (uintptr_t)m_psz >= (uintptr_t)m_cbAllocated || !cchSrc);
/*
* Our non-standard handling of out_of_range situations.
*/
size_t const cchOldLength = length();
AssertMsgReturn(offStart < cchOldLength, ("offStart=%zu (cchLength=%zu); length()=%zu\n", offStart, cchLength, cchOldLength),
*this);
/*
* Correct the length parameter.
*/
size_t cchMaxLength = cchOldLength - offStart;
if (cchMaxLength < cchLength)
cchLength = cchMaxLength;
/*
* Adjust string allocation if necessary.
*/
size_t cchNew = cchOldLength - cchLength + cchSrc;
if (cchNew >= m_cbAllocated)
{
reserve(RT_ALIGN_Z(cchNew + 1, IPRT_MINISTRING_APPEND_ALIGNMENT));
// calls realloc(cchBoth + 1) and sets m_cbAllocated; may throw bad_alloc.
#ifndef RT_EXCEPTIONS_ENABLED
AssertRelease(capacity() > cchNew);
#endif
}
/*
* Make the change.
*/
size_t cchAfter = cchOldLength - offStart - cchLength;
if (cchAfter > 0)
memmove(&m_psz[offStart + cchSrc], &m_psz[offStart + cchLength], cchAfter);
memcpy(&m_psz[offStart], pszSrc, cchSrc);
m_psz[cchNew] = '\0';
m_cch = cchNew;
return *this;
}
int RTCString::replaceWorkerNoThrow(size_t offStart, size_t cchLength, const char *pszSrc, size_t cchSrc) RT_NOEXCEPT
{
Assert((uintptr_t)&pszSrc - (uintptr_t)m_psz >= (uintptr_t)m_cbAllocated || !cchSrc);
/*
* Our non-standard handling of out_of_range situations.
*/
size_t const cchOldLength = length();
AssertMsgReturn(offStart < cchOldLength, ("offStart=%zu (cchLength=%zu); length()=%zu\n", offStart, cchLength, cchOldLength),
VERR_OUT_OF_RANGE);
/*
* Correct the length parameter.
*/
size_t cchMaxLength = cchOldLength - offStart;
if (cchMaxLength < cchLength)
cchLength = cchMaxLength;
/*
* Adjust string allocation if necessary.
*/
size_t cchNew = cchOldLength - cchLength + cchSrc;
if (cchNew >= m_cbAllocated)
{
int rc = reserveNoThrow(RT_ALIGN_Z(cchNew + 1, IPRT_MINISTRING_APPEND_ALIGNMENT));
if (RT_SUCCESS(rc))
{ /* likely */ }
else
return rc;
}
/*
* Make the change.
*/
size_t cchAfter = cchOldLength - offStart - cchLength;
if (cchAfter > 0)
memmove(&m_psz[offStart + cchSrc], &m_psz[offStart + cchLength], cchAfter);
memcpy(&m_psz[offStart], pszSrc, cchSrc);
m_psz[cchNew] = '\0';
m_cch = cchNew;
return VINF_SUCCESS;
}
RTCString &RTCString::truncate(size_t cchMax) RT_NOEXCEPT
{
if (cchMax < m_cch)
{
/*
* Make sure the truncated string ends with a correctly encoded
* codepoint and is not missing a few bytes.
*/
if (cchMax > 0)
{
char chTail = m_psz[cchMax];
if ( (chTail & 0x80) == 0 /* single byte codepoint */
|| (chTail & 0xc0) == 0xc0) /* first byte of codepoint sequence. */
{ /* likely */ }
else
{
/* We need to find the start of the codepoint sequence: */
do
cchMax -= 1;
while ( cchMax > 0
&& (m_psz[cchMax] & 0xc0) != 0xc0);
}
}
/*
* Do the truncating.
*/
m_psz[cchMax] = '\0';
m_cch = cchMax;
}
return *this;
}
size_t RTCString::find(const char *pszNeedle, size_t offStart /*= 0*/) const RT_NOEXCEPT
{
if (offStart < length())
{
const char *pszThis = c_str();
if (pszThis)
{
if (pszNeedle && *pszNeedle != '\0')
{
const char *pszHit = strstr(pszThis + offStart, pszNeedle);
if (pszHit)
return pszHit - pszThis;
}
}
}
return npos;
}
size_t RTCString::find(const RTCString *pStrNeedle, size_t offStart /*= 0*/) const RT_NOEXCEPT
{
if (offStart < length())
{
const char *pszThis = c_str();
if (pszThis)
{
if (pStrNeedle)
{
const char *pszNeedle = pStrNeedle->c_str();
if (pszNeedle && *pszNeedle != '\0')
{
const char *pszHit = strstr(pszThis + offStart, pszNeedle);
if (pszHit)
return pszHit - pszThis;
}
}
}
}
return npos;
}
size_t RTCString::find(const RTCString &rStrNeedle, size_t offStart /*= 0*/) const RT_NOEXCEPT
{
return find(&rStrNeedle, offStart);
}
size_t RTCString::find(const char chNeedle, size_t offStart /*= 0*/) const RT_NOEXCEPT
{
Assert((unsigned int)chNeedle < 128U);
if (offStart < length())
{
const char *pszThis = c_str();
if (pszThis)
{
const char *pszHit = (const char *)memchr(&pszThis[offStart], chNeedle, length() - offStart);
if (pszHit)
return pszHit - pszThis;
}
}
return npos;
}
void RTCString::findReplace(char chFind, char chReplace) RT_NOEXCEPT
{
Assert((unsigned int)chFind < 128U);
Assert((unsigned int)chReplace < 128U);
for (size_t i = 0; i < length(); ++i)
{
char *p = &m_psz[i];
if (*p == chFind)
*p = chReplace;
}
}
size_t RTCString::count(char ch) const RT_NOEXCEPT
{
Assert((unsigned int)ch < 128U);
size_t c = 0;
const char *psz = m_psz;
if (psz)
{
char chCur;
while ((chCur = *psz++) != '\0')
if (chCur == ch)
c++;
}
return c;
}
#if 0 /** @todo implement these when needed. */
size_t RTCString::count(const char *psz, CaseSensitivity cs = CaseSensitive) const RT_NOEXCEPT
{
}
size_t RTCString::count(const RTCString *pStr, CaseSensitivity cs = CaseSensitive) const RT_NOEXCEPT
{
}
#endif
RTCString &RTCString::strip() RT_NOEXCEPT
{
stripRight();
return stripLeft();
}
RTCString &RTCString::stripLeft() RT_NOEXCEPT
{
char *psz = m_psz;
size_t const cch = m_cch;
size_t off = 0;
while (off < cch && RT_C_IS_SPACE(psz[off]))
off++;
if (off > 0)
{
if (off != cch)
{
memmove(psz, &psz[off], cch - off + 1);
m_cch = cch - off;
}
else
setNull();
}
return *this;
}
RTCString &RTCString::stripRight() RT_NOEXCEPT
{
char *psz = m_psz;
size_t cch = m_cch;
while (cch > 0 && RT_C_IS_SPACE(psz[cch - 1]))
cch--;
if (m_cch != cch)
{
m_cch = cch;
psz[cch] = '\0';
}
return *this;
}
RTCString RTCString::substrCP(size_t pos /*= 0*/, size_t n /*= npos*/) const
{
RTCString ret;
if (n)
{
const char *psz;
if ((psz = c_str()))
{
RTUNICP cp;
// walk the UTF-8 characters until where the caller wants to start
size_t i = pos;
while (*psz && i--)
if (RT_FAILURE(RTStrGetCpEx(&psz, &cp)))
return ret; // return empty string on bad encoding
const char *pFirst = psz;
if (n == npos)
// all the rest:
ret = pFirst;
else
{
i = n;
while (*psz && i--)
if (RT_FAILURE(RTStrGetCpEx(&psz, &cp)))
return ret; // return empty string on bad encoding
size_t cbCopy = psz - pFirst;
if (cbCopy)
{
ret.reserve(cbCopy + 1); // may throw bad_alloc
#ifndef RT_EXCEPTIONS_ENABLED
AssertRelease(capacity() >= cbCopy + 1);
#endif
memcpy(ret.m_psz, pFirst, cbCopy);
ret.m_cch = cbCopy;
ret.m_psz[cbCopy] = '\0';
}
}
}
}
return ret;
}
bool RTCString::endsWith(const RTCString &that, CaseSensitivity cs /*= CaseSensitive*/) const RT_NOEXCEPT
{
size_t l1 = length();
if (l1 == 0)
return false;
size_t l2 = that.length();
if (l1 < l2)
return false;
if (!m_psz) /* Don't crash when running against an empty string. */
return false;
/** @todo r=bird: See handling of l2 == in startsWith; inconsistent output (if l2 == 0, it matches anything). */
size_t l = l1 - l2;
if (cs == CaseSensitive)
return ::RTStrCmp(&m_psz[l], that.m_psz) == 0;
return ::RTStrICmp(&m_psz[l], that.m_psz) == 0;
}
bool RTCString::startsWith(const RTCString &that, CaseSensitivity cs /*= CaseSensitive*/) const RT_NOEXCEPT
{
size_t l1 = length();
size_t l2 = that.length();
if (l1 == 0 || l2 == 0) /** @todo r=bird: this differs from endsWith, and I think other IPRT code. If l2 == 0, it matches anything. */
return false;
if (l1 < l2)
return false;
if (cs == CaseSensitive)
return ::RTStrNCmp(m_psz, that.m_psz, l2) == 0;
return ::RTStrNICmp(m_psz, that.m_psz, l2) == 0;
}
bool RTCString::startsWithWord(const char *pszWord, CaseSensitivity enmCase /*= CaseSensitive*/) const RT_NOEXCEPT
{
const char *pszSrc = RTStrStripL(c_str()); /** @todo RTStrStripL doesn't use RTUniCpIsSpace (nbsp) */
size_t cchWord = strlen(pszWord);
if ( enmCase == CaseSensitive
? RTStrNCmp(pszSrc, pszWord, cchWord) == 0
: RTStrNICmp(pszSrc, pszWord, cchWord) == 0)
{
if ( pszSrc[cchWord] == '\0'
|| RT_C_IS_SPACE(pszSrc[cchWord])
|| RT_C_IS_PUNCT(pszSrc[cchWord]) )
return true;
RTUNICP uc = RTStrGetCp(&pszSrc[cchWord]);
if (RTUniCpIsSpace(uc))
return true;
}
return false;
}
bool RTCString::startsWithWord(const RTCString &rThat, CaseSensitivity enmCase /*= CaseSensitive*/) const RT_NOEXCEPT
{
return startsWithWord(rThat.c_str(), enmCase);
}
bool RTCString::contains(const RTCString &that, CaseSensitivity cs /*= CaseSensitive*/) const RT_NOEXCEPT
{
/** @todo r-bird: Not checking for NULL strings like startsWith does (and
* endsWith only does half way). */
if (cs == CaseSensitive)
return ::RTStrStr(m_psz, that.m_psz) != NULL;
return ::RTStrIStr(m_psz, that.m_psz) != NULL;
}
bool RTCString::contains(const char *pszNeedle, CaseSensitivity cs /*= CaseSensitive*/) const RT_NOEXCEPT
{
/** @todo r-bird: Not checking for NULL strings like startsWith does (and
* endsWith only does half way). */
if (cs == CaseSensitive)
return ::RTStrStr(m_psz, pszNeedle) != NULL;
return ::RTStrIStr(m_psz, pszNeedle) != NULL;
}
int RTCString::toInt(uint64_t &i) const RT_NOEXCEPT
{
if (!m_psz)
return VERR_NO_DIGITS;
return RTStrToUInt64Ex(m_psz, NULL, 0, &i);
}
int RTCString::toInt(uint32_t &i) const RT_NOEXCEPT
{
if (!m_psz)
return VERR_NO_DIGITS;
return RTStrToUInt32Ex(m_psz, NULL, 0, &i);
}
RTCList<RTCString, RTCString *>
RTCString::split(const RTCString &a_rstrSep, SplitMode mode /* = RemoveEmptyParts */) const
{
RTCList<RTCString> strRet;
if (!m_psz)
return strRet;
if (a_rstrSep.isEmpty())
{
strRet.append(RTCString(m_psz));
return strRet;
}
size_t cch = m_cch;
char const *pszTmp = m_psz;
while (cch > 0)
{
char const *pszNext = strstr(pszTmp, a_rstrSep.c_str());
if (!pszNext)
{
strRet.append(RTCString(pszTmp, cch));
break;
}
size_t cchNext = pszNext - pszTmp;
if ( cchNext > 0
|| mode == KeepEmptyParts)
strRet.append(RTCString(pszTmp, cchNext));
pszTmp += cchNext + a_rstrSep.length();
cch -= cchNext + a_rstrSep.length();
}
return strRet;
}
/* static */
RTCString
RTCString::joinEx(const RTCList<RTCString, RTCString *> &a_rList,
const RTCString &a_rstrPrefix /* = "" */,
const RTCString &a_rstrSep /* = "" */)
{
RTCString strRet;
if (a_rList.size() > 1)
{
/* calc the required size */
size_t cbNeeded = a_rstrSep.length() * (a_rList.size() - 1) + 1;
cbNeeded += a_rstrPrefix.length() * (a_rList.size() - 1) + 1;
for (size_t i = 0; i < a_rList.size(); ++i)
cbNeeded += a_rList.at(i).length();
strRet.reserve(cbNeeded);
/* do the appending. */
for (size_t i = 0; i < a_rList.size() - 1; ++i)
{
if (a_rstrPrefix.isNotEmpty())
strRet.append(a_rstrPrefix);
strRet.append(a_rList.at(i));
strRet.append(a_rstrSep);
}
strRet.append(a_rList.last());
}
/* special case: one list item. */
else if (a_rList.size() > 0)
{
if (a_rstrPrefix.isNotEmpty())
strRet.append(a_rstrPrefix);
strRet.append(a_rList.last());
}
return strRet;
}
/* static */
RTCString
RTCString::join(const RTCList<RTCString, RTCString *> &a_rList,
const RTCString &a_rstrSep /* = "" */)
{
return RTCString::joinEx(a_rList,
"" /* a_rstrPrefix */, a_rstrSep);
}
RTDECL(const RTCString) operator+(const RTCString &a_rStr1, const RTCString &a_rStr2)
{
RTCString strRet(a_rStr1);
strRet += a_rStr2;
return strRet;
}
RTDECL(const RTCString) operator+(const RTCString &a_rStr1, const char *a_pszStr2)
{
RTCString strRet(a_rStr1);
strRet += a_pszStr2;
return strRet;
}
RTDECL(const RTCString) operator+(const char *a_psz1, const RTCString &a_rStr2)
{
RTCString strRet(a_psz1);
strRet += a_rStr2;
return strRet;
}
|