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
|
/*
* The ManaPlus Client
* Copyright (C) 2007-2009 The Mana World Development Team
* Copyright (C) 2009-2010 The Mana Developers
* Copyright (C) 2011-2013 The ManaPlus Developers
*
* This file is part of The ManaPlus Client.
*
* 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
* 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 "utils/stringutils.h"
#include <string.h>
#include <algorithm>
#include <cstdarg>
#include <cstdio>
#include <list>
#include <sys/time.h>
#include <ctype.h>
#include "debug.h"
static int UTF8_MAX_SIZE = 10;
std::string &trim(std::string &str)
{
size_t pos = str.find_last_not_of(' ');
if (pos != std::string::npos)
{
str.erase(pos + 1);
pos = str.find_first_not_of(' ');
if (pos != std::string::npos)
str.erase(0, pos);
}
else
{
// There is nothing else but whitespace in the string
str.clear();
}
return str;
}
std::string &toLower(std::string &str)
{
std::transform(str.begin(), str.end(), str.begin(), tolower);
return str;
}
std::string &toUpper(std::string &str)
{
std::transform(str.begin(), str.end(), str.begin(), toupper);
return str;
}
unsigned int atox(const std::string &str)
{
unsigned int value;
sscanf(str.c_str(), "0x%06x", &value);
return value;
}
const char *ipToString(const int address)
{
static char asciiIP[18];
sprintf(asciiIP, "%i.%i.%i.%i",
static_cast<unsigned char>(address),
static_cast<unsigned char>(address >> 8),
static_cast<unsigned char>(address >> 16),
static_cast<unsigned char>(address >> 24));
return asciiIP;
}
std::string strprintf(const char *const format, ...)
{
char buf[257];
va_list(args);
va_start(args, format);
int nb = vsnprintf(buf, 256, format, args);
va_end(args);
if (nb < 256)
return buf;
// The static size was not big enough, try again with a dynamic allocation.
++nb;
char *buf2 = new char[nb];
va_start(args, format);
vsnprintf(buf2, nb, format, args);
va_end(args);
std::string res(buf2);
delete [] buf2;
return res;
}
/*
std::string &removeBadChars(std::string &str)
{
size_t pos;
do
{
pos = str.find_first_of("@#[]");
if (pos != std::string::npos)
str.erase(pos, 1);
}
while (pos != std::string::npos);
return str;
}
*/
std::string removeColors(std::string msg)
{
for (unsigned int f = 0; f < msg.length() - 2 && msg.length() > 2; f++)
{
while (msg.length() > f + 2 && msg.at(f) == '#'
&& msg.at(f + 1) == '#')
{
msg = msg.erase(f, 3);
}
}
return msg;
}
int compareStrI(const std::string &a, const std::string &b)
{
std::string::const_iterator itA = a.begin();
const std::string::const_iterator endA = a.end();
std::string::const_iterator itB = b.begin();
const std::string::const_iterator endB = b.end();
for (; itA < endA, itB < endB; ++itA, ++itB)
{
const int comp = tolower(*itA) - tolower(*itB);
if (comp)
return comp;
}
// Check string lengths
if (itA == endA && itB == endB)
return 0;
else if (itA == endA)
return -1;
else
return 1;
}
bool isWordSeparator(const signed char chr)
{
return (chr == ' ' || chr == ',' || chr == '.' || chr == '"');
}
const std::string findSameSubstring(const std::string &str1,
const std::string &str2)
{
const int minLength = str1.length() > str2.length()
? static_cast<int>(str2.length()) : static_cast<int>(str1.length());
for (int f = 0; f < minLength; f ++)
{
if (str1.at(f) != str2.at(f))
return str1.substr(0, f);
}
return str1.substr(0, minLength);
}
const std::string findSameSubstringI(const std::string &s1,
const std::string &s2)
{
std::string str1 = s1;
std::string str2 = s2;
toLower(str1);
toLower(str2);
const size_t minLength = str1.length() > str2.length()
? str2.length() : str1.length();
for (size_t f = 0; f < minLength; f ++)
{
if (str1.at(f) != str2.at(f))
return s1.substr(0, f);
}
return s1.substr(0, minLength);
}
size_t findI(std::string str, std::string subStr)
{
str = toLower(str);
subStr = toLower(subStr);
return str.find(subStr);
}
size_t findI(std::string text, StringVect &list)
{
std::string str = toLower(text);
FOR_EACH (StringVectCIter, i, list)
{
std::string subStr = *i;
subStr = toLower(subStr);
const size_t idx = str.find(subStr);
if (idx != std::string::npos)
return idx;
}
return std::string::npos;
}
int base = 94;
int start = 33;
const std::string encodeStr(unsigned int value, const unsigned int size)
{
std::string buf;
do
{
buf += static_cast<signed char>(value % base + start);
value /= base;
}
while (value);
while (buf.length() < size)
buf += static_cast<signed char>(start);
return buf;
}
unsigned int decodeStr(const std::string &str)
{
if (str.empty())
return 0;
int res = str[0] - start;
int mult = 1;
for (unsigned int f = 1; f < str.length(); f ++)
{
mult *= base;
res = res + (str[f] - start) * mult;
}
return res;
}
std::string extractNameFromSprite(std::string str)
{
const size_t pos1 = str.rfind(".");
if (pos1 != std::string::npos)
{
size_t pos2 = str.rfind("/");
const size_t pos3 = str.rfind("\\");
if (pos3 != std::string::npos)
{
if (pos2 == std::string::npos || pos3 > pos2)
pos2 = pos3;
}
if (pos2 == std::string::npos)
pos2 = static_cast<size_t>(-1);
const int size = static_cast<int>(pos1) - static_cast<int>(pos2) - 1;
if (size > 0)
str = str.substr(pos2 + 1, size);
}
return str;
}
std::string removeSpriteIndex(std::string str)
{
const size_t pos1 = str.rfind("[");
if (pos1 != std::string::npos)
{
size_t pos2 = str.rfind("/");
const size_t pos3 = str.rfind("\\");
if (pos3 != std::string::npos)
{
if (pos2 == std::string::npos || pos3 > pos2)
pos2 = pos3;
}
if (pos2 == std::string::npos)
pos2 = static_cast<size_t>(-1);
const int size = static_cast<int>(pos1) - static_cast<int>(pos2) - 1;
if (size > 0)
str = str.substr(pos2 + 1, size);
}
return str;
}
const char* getSafeUtf8String(std::string text)
{
const int size = static_cast<int>(text.size()) + UTF8_MAX_SIZE;
char *const buf = new char[size];
memcpy(buf, text.c_str(), text.size());
memset(buf + text.size(), 0, UTF8_MAX_SIZE);
return buf;
}
void getSafeUtf8String(std::string text, char *const buf)
{
const int size = static_cast<int>(text.size()) + UTF8_MAX_SIZE;
if (size > 65500)
text = text.substr(0, 65500);
memcpy(buf, text.c_str(), text.size());
memset(buf + text.size(), 0, UTF8_MAX_SIZE);
return;
}
std::string getFileName(std::string path)
{
size_t pos1 = path.rfind("/");
const size_t pos2 = path.rfind("\\");
if (pos1 == std::string::npos)
pos1 = pos2;
else if (pos2 != std::string::npos && pos2 > pos1)
pos1 = pos2;
if (pos1 == std::string::npos)
return path;
return path.substr(pos1 + 1);
}
std::string getFileDir(std::string path)
{
size_t pos1 = path.rfind("/");
const size_t pos2 = path.rfind("\\");
if (pos1 == std::string::npos)
pos1 = pos2;
else if (pos2 != std::string::npos && pos2 > pos1)
pos1 = pos2;
if (pos1 == std::string::npos)
return path;
return path.substr(0, pos1);
}
std::string& replaceAll(std::string& context, const std::string& from,
const std::string& to)
{
if (from.empty())
return context;
size_t lookHere = 0;
size_t foundHere;
while ((foundHere = context.find(from, lookHere)) != std::string::npos)
{
context.replace(foundHere, from.size(), to);
lookHere = foundHere + to.size();
}
return context;
}
bool getBoolFromString(const std::string &text)
{
std::string txt = text;
toLower(trim(txt));
if (txt == "true" || txt == "yes" || txt == "on" || txt == "1")
return true;
else if (txt == "false" || txt == "no" || txt == "off" || txt == "0")
return false;
else
return static_cast<bool>(atoi(txt.c_str()));
}
void replaceSpecialChars(std::string &text)
{
size_t pos1 = text.find("&");
while (pos1 != std::string::npos)
{
const size_t idx = pos1 + 1;
if (idx >= text.size())
break;
size_t f;
for (f = idx; f < text.size(); f ++)
{
if (text[f] < '0' || text[f] > '9')
break;
}
if (idx + 1 < f && text[f] == ';')
{
std::string str = " ";
str[0] = static_cast<signed char>(atoi(text.substr(
idx, f - idx).c_str()));
text = text.substr(0, pos1) + str + text.substr(f + 1);
pos1 += 1;
}
else
{
pos1 = f + 1;
}
pos1 = text.find("&", pos1);
}
}
std::string normalize(const std::string &name)
{
std::string normalized = name;
return toLower(trim(normalized));
}
std::set<int> splitToIntSet(const std::string &text,
const char separator)
{
std::set<int> tokens;
std::stringstream ss(text);
std::string item;
while (std::getline(ss, item, separator))
tokens.insert(atoi(item.c_str()));
return tokens;
}
std::list<int> splitToIntList(const std::string &text,
const char separator)
{
std::list<int> tokens;
std::stringstream ss(text);
std::string item;
while (std::getline(ss, item, separator))
tokens.push_back(atoi(item.c_str()));
return tokens;
}
std::list<std::string> splitToStringList(const std::string &text,
const char separator)
{
std::list<std::string> tokens;
std::stringstream ss(text);
std::string item;
while (std::getline(ss, item, separator))
tokens.push_back(item);
return tokens;
}
void splitToStringVector(StringVect &tokens, const std::string &text,
const char separator)
{
std::stringstream ss(text);
std::string item;
while (std::getline(ss, item, separator))
{
item = trim(item);
if (!item.empty())
tokens.push_back(item);
}
}
void splitToStringSet(std::set<std::string> &tokens, const std::string &text,
const char separator)
{
std::stringstream ss(text);
std::string item;
while (std::getline(ss, item, separator))
{
item = trim(item);
if (!item.empty())
tokens.insert(item);
}
}
void splitToIntVector(std::vector<int> &tokens, const std::string &text,
const char separator)
{
std::stringstream ss(text);
std::string item;
while (std::getline(ss, item, separator))
{
item = trim(item);
if (!item.empty())
tokens.push_back(atoi(item.c_str()));
}
}
std::string combineDye(std::string file, std::string dye)
{
if (dye.empty())
return file;
const size_t pos = file.find_last_of("|");
if (pos != std::string::npos)
return file.substr(0, pos).append("|").append(dye);
return file.append("|").append(dye);
}
std::string combineDye2(std::string file, std::string dye)
{
if (dye.empty())
return file;
const size_t pos = file.find_last_of("|");
if (pos != std::string::npos)
{
std::string dye1 = file.substr(pos + 1);
std::string str("");
file = file.substr(0, pos);
std::list<std::string> list1 = splitToStringList(dye1, ';');
std::list<std::string> list2 = splitToStringList(dye, ';');
for (std::list<std::string>::const_iterator it1 = list1.begin(),
it2 = list2.begin(), it1_end = list1.end(), it2_end = list2.end();
it1 != it1_end && it2 != it2_end; ++it1, ++it2)
{
str.append(*it1).append(":").append(*it2).append(";");
}
return file.append("|").append(str);
}
else
{
return file;
}
}
std::string packList(const std::list<std::string> &list)
{
std::list<std::string>::const_iterator i = list.begin();
std::string str("");
while (i != list.end())
{
str.append(*i).append("|");
++ i;
}
if (str.size() > 1)
str = str.substr(0, str.size() - 1);
return str;
}
std::list<std::string> unpackList(const std::string &str)
{
return splitToStringList(str, '|');
}
std::string stringToHexPath(const std::string &str)
{
if (str.empty())
return "";
std::string hex = strprintf("%%%2x/", static_cast<int>(str[0]));
for (unsigned f = 1, sz = static_cast<unsigned>(str.size()); f < sz; f ++)
hex.append(strprintf("%%%2x", static_cast<int>(str[f])));
return hex;
}
void deleteCharLeft(std::string &str, unsigned *const pos)
{
if (!pos)
return;
while (*pos > 0)
{
(*pos)--;
const int v = str[*pos];
str.erase(*pos, 1);
if ((v & 192) != 128)
break;
}
}
bool findLast(const std::string &str1, const std::string &str2)
{
const size_t s1 = str1.size();
const size_t s2 = str2.size();
if (s1 < s2)
return false;
std::string tmp = str1.substr(s1 - s2);
if (tmp == str2)
return true;
return false;
}
bool findFirst(const std::string &str1, const std::string &str2)
{
const size_t s1 = str1.size();
const size_t s2 = str2.size();
if (s1 < s2)
return false;
std::string tmp = str1.substr(0, s2);
if (tmp == str2)
return true;
return false;
}
bool findCutLast(std::string &str1, std::string str2)
{
const size_t s1 = str1.size();
const size_t s2 = str2.size();
if (s1 < s2)
return false;
std::string tmp = str1.substr(s1 - s2);
if (tmp == str2)
{
str1 = str1.substr(0, s1 - s2);
return true;
}
return false;
}
bool findCutFirst(std::string &str1, std::string str2)
{
const size_t s1 = str1.size();
const size_t s2 = str2.size();
if (s1 < s2)
return false;
std::string tmp = str1.substr(0, s2);
if (tmp == str2)
{
str1 = str1.substr(s2);
return true;
}
return false;
}
std::string &removeProtocol(std::string &url)
{
const size_t i = url.find("://");
if (i != std::string::npos)
url = url.substr(i + 3);
return url;
}
bool strStartWith(std::string str1, std::string str2)
{
if (str1.size() < str2.size())
return false;
return str1.substr(0, str2.size()) == str2;
}
std::string getDateString()
{
char buffer[80];
time_t rawtime;
struct tm *timeinfo;
time (&rawtime);
timeinfo = localtime(&rawtime);
strftime(buffer, 79, "%Y-%m-%d", timeinfo);
return std::string(buffer);
}
signed char parseBoolean(const std::string &value)
{
std::string opt = value.substr(0, 1);
if (opt == "1" ||
opt == "y" || opt == "Y" ||
opt == "t" || opt == "T")
return 1;
else if (opt == "0" ||
opt == "n" || opt == "N" ||
opt == "f" || opt == "F")
return 0;
else
return -1;
}
std::string encodeLinkText(std::string data)
{
return replaceAll(data, "|", "\342\235\230");
}
std::string decodeLinkText(std::string data)
{
return replaceAll(data, "\342\235\230", "|");
}
|