-
Notifications
You must be signed in to change notification settings - Fork 12
/
NString.cpp
410 lines (350 loc) · 7.98 KB
/
NString.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
/*
* This file is part of nzbget. See <https://nzbget.com>.
*
* Copyright (C) 2015-2019 Andrey Prygunkov <hugbug@users.sourceforge.net>
*
* 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; either version 2 of the License, or
* (at your option) any later version.
*
* 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 <http://www.gnu.org/licenses/>.
*/
#include "nzbget.h"
#include "NString.h"
template <int size>
BString<size>::BString(const char* format, ...)
{
va_list ap;
va_start(ap, format);
FormatV(format, ap);
va_end(ap);
}
template <int size>
void BString<size>::Set(const char* str, int len)
{
m_data[0] = '\0';
int addLen = len > 0 ? std::min(size - 1, len) : size - 1;
strncpy(m_data, str, addLen);
m_data[addLen] = '\0';
}
template <int size>
void BString<size>::Append(const char* str, int len)
{
if (len == 0)
{
len = strlen(str);
}
int curLen = strlen(m_data);
int avail = size - curLen - 1;
int addLen = std::min(avail, len);
if (addLen > 0)
{
strncpy(m_data + curLen, str, addLen);
m_data[curLen + addLen] = '\0';
}
}
template <int size>
void BString<size>::AppendFmt(const char* format, ...)
{
va_list ap;
va_start(ap, format);
AppendFmtV(format, ap);
va_end(ap);
}
template <int size>
void BString<size>::AppendFmtV(const char* format, va_list ap)
{
int curLen = strlen(m_data);
int avail = size - curLen;
if (avail > 0)
{
vsnprintf(m_data + curLen, avail, format, ap);
}
}
template <int size>
int BString<size>::Format(const char* format, ...)
{
va_list ap;
va_start(ap, format);
int len = FormatV(format, ap);
va_end(ap);
return len;
}
template <int size>
int BString<size>::FormatV(const char* format, va_list ap)
{
// ensure result isn't negative (in case of bad argument)
int len = std::max(vsnprintf(m_data, size, format, ap), 0);
return len;
}
bool CString::operator==(const CString& other) const
{
return (!m_data && !other.m_data) ||
(m_data && other.m_data && !strcmp(m_data, other.m_data));
}
bool CString::operator==(const char* other) const
{
return (!m_data && !other) ||
(m_data && other && !strcmp(m_data, other));
}
void CString::Set(const char* str, int len)
{
if (str)
{
if (len == 0)
{
len = strlen(str);
}
m_data = (char*)realloc(m_data, len + 1);
strncpy(m_data, str, len);
m_data[len] = '\0';
}
else
{
free(m_data);
m_data = nullptr;
}
}
void CString::Append(const char* str, int len)
{
if (len == 0)
{
len = strlen(str);
}
int curLen = Length();
int newLen = curLen + len;
m_data = (char*)realloc(m_data, newLen + 1);
strncpy(m_data + curLen, str, len);
m_data[curLen + len] = '\0';
}
void CString::AppendFmt(const char* format, ...)
{
va_list ap;
va_start(ap, format);
AppendFmtV(format, ap);
va_end(ap);
}
void CString::AppendFmtV(const char* format, va_list ap)
{
va_list ap2;
va_copy(ap2, ap);
int addLen = vsnprintf(nullptr, 0, format, ap);
if (addLen < 0) return; // error
int curLen = Length();
int newLen = curLen + addLen;
char* newData = (char*)realloc(m_data, newLen + 1);
if (newData == nullptr)
{
return;
}
m_data = newData;
vsnprintf(m_data + curLen, newLen + 1, format, ap2);
va_end(ap2);
}
int CString::Format(const char* format, ...)
{
va_list ap;
va_start(ap, format);
int len = FormatV(format, ap);
va_end(ap);
return len;
}
int CString::FormatV(const char* format, va_list ap)
{
va_list ap2;
va_copy(ap2, ap);
// "std::max" to ensure result isn't negative (in case of bad argument)
int newLen = std::max(vsnprintf(nullptr, 0, format, ap), 0);
m_data = (char*)realloc(m_data, newLen + 1);
newLen = vsnprintf(m_data, newLen + 1, format, ap2);
va_end(ap2);
return newLen;
}
int CString::Find(const char* str, int pos)
{
if (pos != 0 && pos >= Length())
{
return -1;
}
char* res = strstr(m_data + pos, str);
return res ? (int)(res - m_data) : -1;
}
void CString::Replace(int pos, int len, const char* str, int strLen)
{
int addLen = strlen(str);
if (strLen > 0)
{
addLen = std::min(addLen, strLen);
}
int curLen = Length();
int delLen = pos + len <= curLen ? len : curLen - pos;
int newLen = curLen - delLen + addLen;
if (pos > curLen) return; // bad argument
char* newvalue = (char*)malloc(newLen + 1);
strncpy(newvalue, m_data, pos);
strncpy(newvalue + pos, str, addLen);
strcpy(newvalue + pos + addLen, m_data + pos + len);
free(m_data);
m_data = newvalue;
}
void CString::Replace(const char* from, const char* to)
{
int fromLen = strlen(from);
int toLen = strlen(to);
int pos = 0;
while ((pos = Find(from, pos)) != -1)
{
Replace(pos, fromLen, to);
pos += toLen;
}
}
void CString::Bind(char* str)
{
free(m_data);
m_data = str;
}
char* CString::Unbind()
{
char* olddata = m_data;
m_data = nullptr;
return olddata;
}
void CString::Reserve(int capacity)
{
int curLen = Length();
if (capacity > curLen || curLen == 0)
{
m_data = (char*)realloc(m_data, capacity + 1);
m_data[curLen] = '\0';
}
}
CString CString::FormatStr(const char* format, ...)
{
CString result;
va_list ap;
va_start(ap, format);
result.FormatV(format, ap);
va_end(ap);
return result;
}
void CString::TrimRight()
{
int len = Length();
if (len == 0)
{
return;
}
char* end = m_data + len - 1;
while (end >= m_data && (*end == '\n' || *end == '\r' || *end == ' ' || *end == '\t'))
{
*end = '\0';
end--;
}
}
WString::WString(const char* utfstr)
{
m_data = (wchar_t*)malloc((strlen(utfstr) * 2 + 1) * sizeof(wchar_t));
wchar_t* out = m_data;
unsigned int codepoint = 0;
while (*utfstr != 0)
{
unsigned char ch = (unsigned char)*utfstr;
if (ch <= 0x7f)
codepoint = ch;
else if (ch <= 0xbf)
codepoint = (codepoint << 6) | (ch & 0x3f);
else if (ch <= 0xdf)
codepoint = ch & 0x1f;
else if (ch <= 0xef)
codepoint = ch & 0x0f;
else
codepoint = ch & 0x07;
++utfstr;
if (((*utfstr & 0xc0) != 0x80) && (codepoint <= 0x10ffff))
{
if (codepoint > 0xffff)
{
*out++ = (wchar_t)(0xd800 + (codepoint >> 10));
*out++ = (wchar_t)(0xdc00 + (codepoint & 0x03ff));
}
else if (codepoint < 0xd800 || codepoint >= 0xe000)
*out++ = (wchar_t)(codepoint);
}
}
*out = '\0';
}
void StringBuilder::Clear()
{
free(m_data);
m_data = nullptr;
m_length = 0;
m_capacity = 0;
}
char* StringBuilder::Unbind()
{
char* olddata = m_data;
m_data = nullptr;
m_length = 0;
m_capacity = 0;
return olddata;
}
void StringBuilder::Reserve(int capacity, bool exact)
{
int oldCapacity = Capacity();
if (capacity > oldCapacity || oldCapacity == 0)
{
char* oldData = m_data;
// we may grow more than requested
int smartCapacity = exact ? 0 : (int)(oldCapacity * 1.5);
m_capacity = smartCapacity > capacity ? smartCapacity : capacity;
m_data = (char*)realloc(m_data, m_capacity + 1);
if (!oldData)
{
m_data[0] = '\0';
}
}
}
void StringBuilder::Append(const char* str, int len)
{
if (len == 0)
{
len = strlen(str);
}
int curLen = Length();
int newLen = curLen + len;
Reserve(newLen, false);
strncpy(m_data + curLen, str, len);
m_data[curLen + len] = '\0';
m_length = newLen;
}
void StringBuilder::AppendFmt(const char* format, ...)
{
va_list ap;
va_start(ap, format);
AppendFmtV(format, ap);
va_end(ap);
}
void StringBuilder::AppendFmtV(const char* format, va_list ap)
{
va_list ap2;
va_copy(ap2, ap);
int addLen = vsnprintf(nullptr, 0, format, ap);
if (addLen < 0) return; // error
int curLen = Length();
int newLen = curLen + addLen;
Reserve(newLen, false);
vsnprintf(m_data + curLen, newLen + 1, format, ap2);
m_length = newLen;
va_end(ap2);
}
// Instantiate all classes used in our project
template class BString<1024>;
template class BString<100>;
template class BString<20>;