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
|
#include "slang-string-util.h"
#include "slang-blob.h"
#include "slang-char-util.h"
#include "slang-text-io.h"
namespace Slang {
// !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! StringUtil !!!!!!!!!!!!!!!!!!!!!!!!!!!
/* static */bool StringUtil::areAllEqual(const List<UnownedStringSlice>& a, const List<UnownedStringSlice>& b, EqualFn equalFn)
{
if (a.getCount() != b.getCount())
{
return false;
}
const Index count = a.getCount();
for (Index i = 0; i < count; ++i)
{
if (!equalFn(a[i], b[i]))
{
return false;
}
}
return true;
}
/* static */bool StringUtil::areAllEqualWithSplit(const UnownedStringSlice& a, const UnownedStringSlice& b, char splitChar, EqualFn equalFn)
{
List<UnownedStringSlice> slicesA, slicesB;
StringUtil::split(a, splitChar, slicesA);
StringUtil::split(b, splitChar, slicesB);
return areAllEqual(slicesA, slicesB, equalFn);
}
/* static */void StringUtil::split(const UnownedStringSlice& in, char splitChar, List<UnownedStringSlice>& outSlices)
{
outSlices.clear();
const char* start = in.begin();
const char* end = in.end();
while (start < end)
{
// Move cur so it's either at the end or at next split character
const char* cur = start;
while (cur < end && *cur != splitChar)
{
cur++;
}
// Add to output
outSlices.add(UnownedStringSlice(start, cur));
// Skip the split character, if at end we are okay anyway
start = cur + 1;
}
}
/* static */void StringUtil::split(const UnownedStringSlice& in, const UnownedStringSlice& splitSlice, List<UnownedStringSlice>& outSlices)
{
const Index splitLen = splitSlice.getLength();
if (splitLen == 1)
{
return split(in, splitSlice[0], outSlices);
}
outSlices.clear();
SLANG_ASSERT(splitLen > 0);
if (splitLen <= 0)
{
return;
}
const char* start = in.begin();
const char* end = in.end();
const char splitChar = splitSlice[0];
while (start < end)
{
// Move cur so it's either at the end or at next splitSlice
const char* cur = start;
while (cur < end)
{
if (*cur == splitChar &&
(cur + splitLen <= end && UnownedStringSlice(cur, splitLen) == splitSlice))
{
// We hit a split
break;
}
cur++;
}
// Add to output
outSlices.add(UnownedStringSlice(start, cur));
// Skip the split, if at end we are okay anyway
start = cur + splitLen;
}
}
/* static */Index StringUtil::split(const UnownedStringSlice& in, char splitChar, Index maxSlices, UnownedStringSlice* outSlices)
{
Index index = 0;
const char* start = in.begin();
const char* end = in.end();
while (start < end && index < maxSlices)
{
// Move cur so it's either at the end or at next split character
const char* cur = start;
while (cur < end && *cur != splitChar)
{
cur++;
}
// Add to output
outSlices[index++] = UnownedStringSlice(start, cur);
// Skip the split character, if at end we are okay anyway
start = cur + 1;
}
return index;
}
/* static */SlangResult StringUtil::split(const UnownedStringSlice& in, char splitChar, Index maxSlices, UnownedStringSlice* outSlices, Index& outSlicesCount)
{
const Index sliceCount = split(in, splitChar, maxSlices, outSlices);
if (sliceCount == maxSlices && sliceCount > 0)
{
// To succeed must have parsed all of the input
if (in.end() != outSlices[sliceCount - 1].end())
{
return SLANG_FAIL;
}
}
outSlicesCount = sliceCount;
return SLANG_OK;
}
/* static */void StringUtil::join(const List<String>& values, char separator, StringBuilder& out)
{
join(values, UnownedStringSlice(&separator, 1), out);
}
/* static */void StringUtil::join(const List<String>& values, const UnownedStringSlice& separator, StringBuilder& out)
{
const Index count = values.getCount();
if (count <= 0)
{
return;
}
out.append(values[0]);
for (Index i = 1; i < count; i++)
{
out.append(separator);
out.append(values[i]);
}
}
/* static */void StringUtil::join(const UnownedStringSlice* values, Index valueCount, char separator, StringBuilder& out)
{
join(values, valueCount, UnownedStringSlice(&separator, 1), out);
}
/* static */void StringUtil::join(const UnownedStringSlice* values, Index valueCount, const UnownedStringSlice& separator, StringBuilder& out)
{
if (valueCount <= 0)
{
return;
}
out.append(values[0]);
for (Index i = 1; i < valueCount; i++)
{
out.append(separator);
out.append(values[i]);
}
}
/* static */Index StringUtil::indexOfInSplit(const UnownedStringSlice& in, char splitChar, const UnownedStringSlice& find)
{
const char* start = in.begin();
const char* end = in.end();
for (Index i = 0; start < end; ++i)
{
// Move cur so it's either at the end or at next split character
const char* cur = start;
while (cur < end && *cur != splitChar)
{
cur++;
}
// See if we have a match
if (UnownedStringSlice(start, cur) == find)
{
return i;
}
// Skip the split character, if at end we are okay anyway
start = cur + 1;
}
return -1;
}
UnownedStringSlice StringUtil::getAtInSplit(const UnownedStringSlice& in, char splitChar, Index index)
{
const char* start = in.begin();
const char* end = in.end();
for (Index i = 0; start < end; ++i)
{
// Move cur so it's either at the end or at next split character
const char* cur = start;
while (cur < end && *cur != splitChar)
{
cur++;
}
if (i == index)
{
return UnownedStringSlice(start, cur);
}
// Skip the split character, if at end we are okay anyway
start = cur + 1;
}
return UnownedStringSlice();
}
/* static */size_t StringUtil::calcFormattedSize(const char* format, va_list args)
{
#if SLANG_WINDOWS_FAMILY
return _vscprintf(format, args);
#else
return vsnprintf(nullptr, 0, format, args);
#endif
}
/* static */void StringUtil::calcFormatted(const char* format, va_list args, size_t numChars, char* dst)
{
#if SLANG_WINDOWS_FAMILY
vsnprintf_s(dst, numChars + 1, _TRUNCATE, format, args);
#else
vsnprintf(dst, numChars + 1, format, args);
#endif
}
/* static */void StringUtil::append(const char* format, va_list args, StringBuilder& buf)
{
// Calculate the size required (not including terminating 0)
size_t numChars;
{
// Create a copy of args, as will be consumed by calcFormattedSize
va_list argsCopy;
va_copy(argsCopy, args);
numChars = calcFormattedSize(format, argsCopy);
va_end(argsCopy);
}
// Requires + 1 , because calcFormatted appends a terminating 0
char* dst = buf.prepareForAppend(numChars + 1);
calcFormatted(format, args, numChars, dst);
buf.appendInPlace(dst, numChars);
}
/* static */void StringUtil::appendFormat(StringBuilder& buf, const char* format, ...)
{
va_list args;
va_start(args, format);
append(format, args, buf);
va_end(args);
}
/* static */String StringUtil::makeStringWithFormat(const char* format, ...)
{
StringBuilder builder;
va_list args;
va_start(args, format);
append(format, args, builder);
va_end(args);
return builder;
}
/* static */UnownedStringSlice StringUtil::getSlice(ISlangBlob* blob)
{
if (blob)
{
size_t size = blob->getBufferSize();
if (size > 0)
{
const char* contents = (const char*)blob->getBufferPointer();
// Check it has terminating 0, if it has we skip it, because slices do not need zero termination
if (contents[size - 1] == 0)
{
size--;
}
return UnownedStringSlice(contents, contents + size);
}
}
return UnownedStringSlice();
}
/* static */String StringUtil::getString(ISlangBlob* blob)
{
return getSlice(blob);
}
ComPtr<ISlangBlob> StringUtil::createStringBlob(const String& string)
{
return ComPtr<ISlangBlob>(new StringBlob(string));
}
/* static */String StringUtil::calcCharReplaced(const UnownedStringSlice& slice, char fromChar, char toChar)
{
if (fromChar == toChar)
{
return slice;
}
const Index numChars = slice.getLength();
const char* srcChars = slice.begin();
StringBuilder builder;
char* dstChars = builder.prepareForAppend(numChars);
for (Index i = 0; i < numChars; ++i)
{
char c = srcChars[i];
dstChars[i] = (c == fromChar) ? toChar : c;
}
builder.appendInPlace(dstChars, numChars);
return builder;
}
/* static */String StringUtil::calcCharReplaced(const String& string, char fromChar, char toChar)
{
return (fromChar == toChar || string.indexOf(fromChar) == Index(-1)) ? string : calcCharReplaced(string.getUnownedSlice(), fromChar, toChar);
}
/* static */void StringUtil::appendStandardLines(const UnownedStringSlice& text, StringBuilder& out)
{
const char* cur = text.begin();
const char* start = cur;
const char* const end = text.end();
while (cur < end)
{
const char c = *cur;
switch (c)
{
case '\n':
{
++cur;
if (cur < end && *cur == '\r')
{
// If we have following \r, we should append with \n
// Append (including \n)
out.append(start, cur);
// Skip the \r
start = ++cur;
}
else
{
// If not, we don't need to append because just \n is 'standard', and everything remaining
// is appended at the end
}
break;
}
case '\r':
{
out.append(start, cur);
out.appendChar('\n');
++cur;
// If next is \n, we want to skip that
cur += Index(cur < end && *cur == '\n');
start = cur;
break;
}
default:
{
cur++;
break;
}
}
}
if (start < end)
{
out.append(start, end);
}
}
/* static */bool StringUtil::extractLine(UnownedStringSlice& ioText, UnownedStringSlice& outLine)
{
char const*const begin = ioText.begin();
char const*const end = ioText.end();
// If we have hit the end then return the 'special' terminator
if (begin == nullptr)
{
outLine = UnownedStringSlice(nullptr, nullptr);
return false;
}
char const* cursor = begin;
while (cursor < end)
{
int c = *cursor++;
switch (c)
{
case '\r': case '\n':
{
// Remember the end of the line
const char*const lineEnd = cursor - 1;
// When we see a line-break character we need
// to record the line break, but we also need
// to deal with the annoying issue of encodings,
// where a multi-byte sequence might encode
// the line break.
if (cursor < end)
{
int d = *cursor;
if ((c ^ d) == ('\r' ^ '\n'))
cursor++;
}
ioText = UnownedStringSlice(cursor, end);
outLine = UnownedStringSlice(begin, lineEnd);
return true;
}
default:
break;
}
}
// There is nothing remaining
ioText = UnownedStringSlice(nullptr, nullptr);
// Could be empty, or the remaining line (without line end terminators of)
SLANG_ASSERT(begin <= cursor);
outLine = UnownedStringSlice(begin, cursor);
return true;
}
/* static */void StringUtil::calcLines(const UnownedStringSlice& textIn, List<UnownedStringSlice>& outLines)
{
outLines.clear();
UnownedStringSlice text(textIn), line;
while (extractLine(text, line))
{
outLines.add(line);
}
}
/* static */UnownedStringSlice StringUtil::trimEndOfLine(const UnownedStringSlice& line)
{
// Strip CR/LF from end of line if present
const char* begin = line.begin();
const char* end = line.end();
if (end > begin)
{
const char c = end[-1];
// If last char is CR/LF move back a char
if (c == '\n' || c == '\r')
{
--end;
// If next char is a match for the CR/LF pair move back an extra char.
end -= Index((end > begin) && (c ^ end[-1]) == ('\r' ^ '\n'));
}
}
return line.head(Index(end - begin));
}
/* static */bool StringUtil::areLinesEqual(const UnownedStringSlice& inA, const UnownedStringSlice& inB)
{
UnownedStringSlice a(inA), b(inB), lineA, lineB;
while (true)
{
const auto hasLineA = extractLine(a, lineA);
const auto hasLineB = extractLine(b, lineB);
if (!(hasLineA && hasLineB))
{
return hasLineA == hasLineB;
}
// The lines must be equal
if (lineA != lineB)
{
return false;
}
}
}
/* static */SlangResult StringUtil::parseDouble(const UnownedStringSlice& text, double& out)
{
const Index bufSize = 32;
const auto len = text.getLength();
if (len > bufSize - 1)
{
List<char> work;
work.setCount(len + 1);
char* dst = work.getBuffer();
::memcpy(dst, text.begin(), len * sizeof(char));
dst[len] = 0;
out = atof(dst);
}
else
{
char buf[bufSize];
::memcpy(buf, text.begin(), len * sizeof(char));
buf[len] = 0;
out = atof(buf);
}
return SLANG_OK;
}
/* static */SlangResult StringUtil::parseInt(const UnownedStringSlice& in, Int& outValue)
{
const char* cur = in.begin();
const char* end = in.end();
bool negate = false;
if (cur < end && *cur == '-')
{
negate = true;
cur++;
}
// We need at least one digit
if (cur >= end || !CharUtil::isDigit(*cur))
{
return SLANG_FAIL;
}
Int value = *cur++ - '0';
// Do the remaining digits
for (; cur < end; ++cur)
{
const char c = *cur;
if (!CharUtil::isDigit(c))
{
return SLANG_FAIL;
}
value = value * 10 + (c - '0');
}
value = negate ? -value : value;
outValue = value;
return SLANG_OK;
}
/* static */SlangResult StringUtil::parseInt64(const UnownedStringSlice& text, int64_t& out)
{
bool negate = false;
const char* cur = text.begin();
const char* end = text.end();
if (cur < end)
{
if (*cur == '-')
{
negate = true;
cur++;
}
else if (*cur == '+')
{
cur++;
}
}
// Must have at least one digit
if (cur >= end || !CharUtil::isDigit(*cur))
{
return SLANG_FAIL;
}
uint64_t value = 0;
// We can have 20 digits, but the last digit can cause overflow.
// Lets do the easy first digits first
Index numSimple = 19;
for (; cur < end && CharUtil::isDigit(*cur) && numSimple > 0; ++cur, --numSimple)
{
value = value * 10 + (*cur - '0');
}
if (cur < end && CharUtil::isDigit(*cur))
{
const auto prevValue = value;
value = value * 10 + (*cur - '0');
cur++;
if (value < prevValue)
{
// We have overflow
return SLANG_FAIL;
}
}
if (negate)
{
if (value > ~((~uint64_t(0)) >> 1))
{
// Overflow
return SLANG_FAIL;
}
out = -int64_t(value);
}
else
{
if (value > ((~uint64_t(0)) >> 1))
{
// Overflow
return SLANG_FAIL;
}
out = value;
}
return (cur == end) ? SLANG_OK : SLANG_FAIL;
}
} // namespace Slang
|