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
|
/*
* The Mana Client
* Copyright (C) 2007-2009 The Mana World Development Team
* Copyright (C) 2009-2010 The Mana Developers
*
* This file is part of The Mana 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>
const int UTF8_MAX_SIZE = 10;
std::string &trim(std::string &str)
{
std::string::size_type 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(int address)
{
static char asciiIP[16];
sprintf(asciiIP, "%i.%i.%i.%i",
(unsigned char)(address),
(unsigned char)(address >> 8),
(unsigned char)(address >> 16),
(unsigned char)(address >> 24));
return asciiIP;
}
std::string strprintf(char const *format, ...)
{
char buf[256];
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)
{
std::string::size_type 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();
std::string::const_iterator endA = a.end();
std::string::const_iterator itB = b.begin();
std::string::const_iterator endB = b.end();
for (; itA < endA, itB < endB; ++itA, ++itB)
{
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(char chr)
{
return (chr == ' ' || chr == ',' || chr == '.' || chr == '"');
}
const std::string findSameSubstring(const std::string &str1, const std::string &str2)
{
int minLength = str1.length() > str2.length() ? str2.length() : 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 char* getSafeUtf8String(std::string text)
{
char* buf = new char[text.size() + UTF8_MAX_SIZE];
memcpy(buf, text.c_str(), text.size());
memset(buf + text.size(), 0, UTF8_MAX_SIZE);
return buf;
}
std::string autocomplete(std::vector<std::string> &candidates,
std::string base)
{
std::vector<std::string>::iterator i = candidates.begin();
toLower(base);
std::string newName("");
while (i != candidates.end())
{
if (!i->empty())
{
std::string name = *i;
toLower(name);
std::string::size_type pos = name.find(base, 0);
if (pos == 0)
{
if (newName != "")
{
toLower(newName);
newName = findSameSubstring(name, newName);
}
else
{
newName = *i;
}
}
}
++i;
}
return newName;
}
|
