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
|
// StringUtil.cc for fluxbox
// Copyright (c) 2001 - 2006 Henrik Kinnunen (fluxgen at fluxbox dot org)
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the "Software"),
// to deal in the Software without restriction, including without limitation
// the rights to use, copy, modify, merge, publish, distribute, sublicense,
// and/or sell copies of the Software, and to permit persons to whom the
// Software is furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
// DEALINGS IN THE SOFTWARE.
#include "StringUtil.hh"
#include <cstdio>
#include <cctype>
#include <cassert>
#include <cstring>
#include <cerrno>
#ifndef _WIN32
#include <unistd.h>
#include <sys/types.h>
#include <pwd.h>
#endif
#include <memory>
#include <algorithm>
#include <string>
#include <iostream>
using std::string;
using std::transform;
namespace {
const size_t DIGITS10_ULONGLONGINT = 20; // ULLONG_MAX = 18446744073709551615
const size_t DIGITS16_ULONGLONGINT = 16; // ULLONG_MAX = ffffffffffffffff
template <typename T>
int extractBigNumber(const char* in, T (*extractFunc)(const char*, char**, int), T& out) {
errno = 0;
int ret = 0;
char* end = 0;
T result = extractFunc(in, &end, 0);
if (errno == 0 && end != in) {
out = result;
ret = 1;
}
return ret;
}
template<typename T>
int extractSignedNumber(const std::string& in, T& out) {
long long int result = 0;
if (::extractBigNumber(in.c_str(), strtoll, result)) {
out = static_cast<T>(result);
return 1;
}
return 0;
}
template<typename T>
int extractUnsignedNumber(const std::string& in, T& out) {
unsigned long long int result = 0;
if (::extractBigNumber(in.c_str(), strtoull, result)) {
out = static_cast<T>(result);
return 1;
}
return 0;
}
std::string getHomePath() {
std::string home;
const char* h = NULL;
#ifdef _WIN32
h = getenv("USERPROFILE");
#else
h = getenv("HOME");
#endif
if (h) {
home.assign(h);
} else {
#ifndef _WIN32
uid_t uid = geteuid();
struct passwd* pw = getpwuid(uid);
if (pw) {
home.assign(pw->pw_dir);
}
#endif
}
return home;
}
}
namespace FbTk {
namespace StringUtil {
int extractNumber(const std::string& in, int& out) {
return ::extractSignedNumber<int>(in, out);
}
int extractNumber(const std::string& in, unsigned int& out) {
return ::extractUnsignedNumber<unsigned int>(in, out);
}
int extractNumber(const std::string& in, long& out) {
return ::extractSignedNumber<long>(in, out);
}
int extractNumber(const std::string& in, unsigned long& out) {
return ::extractUnsignedNumber<unsigned long>(in, out);
}
int extractNumber(const std::string& in, long long& out) {
return ::extractSignedNumber<long long>(in, out);
}
int extractNumber(const std::string& in, unsigned long long& out) {
return ::extractUnsignedNumber<unsigned long long>(in, out);
}
std::string number2String(long long num) {
char s[DIGITS10_ULONGLONGINT+1];
int n = snprintf(s, sizeof(s), "%lld", num);
return std::string(s, n);
}
std::string number2HexString(long long num) {
char s[DIGITS16_ULONGLONGINT+1];
int n = snprintf(s, sizeof(s), "%llx", num);
return std::string(s, n);
}
/**
Tries to find a string in another and
ignoring the case of the characters
Returns 0 on failure else pointer to str.
*/
const char *strcasestr(const char *str, const char *ptn) {
const char *s2, *p2;
for( ; *str; str++) {
for(s2=str, p2=ptn; ; s2++,p2++) {
// check if we reached the end of ptn, if so, return str
if (!*p2)
return str;
// check if the chars match(ignoring case)
if (toupper(*s2) != toupper(*p2))
break;
}
}
return 0;
}
#ifdef _WIN32
#include <string>
#define WIN32_LEAN_AND_MEAN 1
#define NOMINMAX
#include <windows.h>
static void removeTrailingPathSeparators(std::string & path) {
// Remove any trailing path separators
size_t beforeLastPathSep = path.find_last_not_of("/\\");
if (beforeLastPathSep != path.size() - 1) {
path.erase(beforeLastPathSep + 1);
}
}
static std::string getFluxboxPrefix() {
static std::string ret;
static bool init = false;
if (!init) {
char buffer[1024];
HMODULE module = GetModuleHandle(NULL);
DWORD size = GetModuleFileName(module, buffer, sizeof(buffer));
if (sizeof(buffer) > 0)
{
buffer[sizeof(buffer) - 1] = 0;
}
static const char slash = '/';
static const char backslash = '\\';
char * lastslash = std::find_end(buffer, buffer+size, &slash, &slash + 1);
char * lastbackslash = std::find_end(buffer, buffer+size, &backslash, &backslash + 1);
ret.assign(buffer);
// Remove the filename
size_t lastPathSep = ret.find_last_of("/\\");
if (lastPathSep != std::string::npos) {
ret.erase(lastPathSep);
}
removeTrailingPathSeparators(ret);
// If the last directory is bin, remove that too.
lastPathSep = ret.find_last_of("/\\");
if (lastPathSep != std::string::npos && ret.substr(lastPathSep + 1) == "bin") {
ret.erase(lastPathSep);
}
removeTrailingPathSeparators(ret);
}
return ret;
}
#endif // _WIN32
/**
if ~ then expand it to home of user
if /DUMMYPREFIX on Windows then expand it to the prefix relative to the
executable on Windows.
returns expanded filename
*/
string expandFilename(const string &filename) {
string retval;
size_t pos = filename.find_first_not_of(" \t");
if (pos != string::npos && filename[pos] == '~') {
retval = getHomePath();
if (pos + 1 < filename.size()) {
// copy from the character after '~'
retval += static_cast<const char *>(filename.c_str() + pos + 1);
}
} else {
retval = filename; //return unmodified value
}
#if defined(_WIN32) && defined(DUMMYPREFIX)
if (retval.find(DUMMYPREFIX) == 0) {
static const std::string dummyPrefix = DUMMYPREFIX;
retval.replace(0, dummyPrefix.size(), getFluxboxPrefix());
}
#endif
return retval;
}
/**
@return string from last "." to end of string
*/
string findExtension(const string &filename) {
//get start of extension
string::size_type start_pos = filename.find_last_of(".");
if (start_pos == string::npos && start_pos != filename.size())
return "";
// return from last . to end of string
return filename.substr(start_pos + 1);
}
string::size_type findCharFromAlphabetAfterTrigger(const std::string& in, char trigger, const char alphabet[], size_t len_alphabet, size_t* found) {
for (const char* s = in.c_str(); *s != '\0'; ) {
if (*s++ == trigger && *s != '\0') {
for (const char* a = alphabet; (a - alphabet) < static_cast<ssize_t>(len_alphabet); ++a) {
if (*s == *a) {
if (found) {
*found = a - alphabet;
}
return s - in.c_str() - 1;
}
}
s++;
}
}
return string::npos;
}
string replaceString(const string &original,
const char *findthis,
const char *replace) {
size_t i = 0;
const int size_of_replace = strlen(replace);
const int size_of_find = strlen(findthis);
string ret_str(original);
while (i < ret_str.size()) {
i = ret_str.find(findthis, i);
if (i == string::npos)
break;
// erase old string and insert replacement
ret_str.erase(i, size_of_find);
ret_str.insert(i, replace);
// jump to next position after insert
i += size_of_replace;
}
return ret_str;
}
/**
Parses a string between "first" and "last" characters
and ignoring ok_chars as whitespaces. The value is
returned in "out".
Returns negative value on error and this value is the position
in the in-string where the error occured.
Returns positive value on success and this value is
for the position + 1 in the in-string where the "last"-char value
was found.
*/
int getStringBetween(string& out, const char *instr, char first, char last,
const char *ok_chars, bool allow_nesting) {
assert(first);
assert(last);
assert(instr);
string::size_type i = 0;
string::size_type total_add=0; //used to add extra if there is a \last to skip
string in(instr);
// eat leading whitespace
i = in.find_first_not_of(ok_chars);
if (i == string::npos)
return -in.size(); // nothing left but whitespace
if (in[i]!=first)
return -i; //return position to error
// find the end of the token
string::size_type j = i, k;
int nesting = 0;
while (1) {
k = in.find_first_of(first, j+1);
j = in.find_first_of(last, j+1);
if (j==string::npos)
return -in.size(); //send negative size
if (allow_nesting && k < j && in[k-1] != '\\') {
nesting++;
j = k;
continue;
}
//we found the last char, check so it doesn't have a '\' before
if (j>1 && in[j-1] != '\\') {
if (allow_nesting && nesting > 0) nesting--;
else
break;
} else if (j>1 && !allow_nesting) { // we leave escapes if we're allowing nesting
in.erase(j-1, 1); //remove the '\'
j--;
total_add++; //save numchars removed so we can calculate totalpos
}
}
out = in.substr(i+1, j-i-1); //copy the string between first and last
//return value to last character
return (j+1+total_add);
}
string toLower(const string &conv) {
string ret = conv;
transform(ret.begin(), ret.end(), ret.begin(), tolower);
return ret;
}
string toUpper(const string &conv) {
string ret = conv;
transform(ret.begin(), ret.end(), ret.begin(), toupper);
return ret;
}
string basename(const string &filename) {
string::size_type first_pos = filename.find_last_of("/");
if (first_pos != string::npos)
return filename.substr(first_pos + 1);
return filename;
}
string::size_type removeFirstWhitespace(string &str) {
string::size_type first_pos = str.find_first_not_of(" \t");
str.erase(0, first_pos);
return first_pos;
}
string::size_type removeTrailingWhitespace(string &str) {
// strip trailing whitespace
string::size_type first_pos = str.find_last_not_of(" \t");
string::size_type last_pos = str.find_first_of(" \t", first_pos);
if (last_pos != string::npos)
str.erase(last_pos);
return first_pos;
}
void getFirstWord(const std::string &in, std::string &word, std::string &rest) {
word = in;
string::size_type first_pos = StringUtil::removeFirstWhitespace(word);
string::size_type second_pos = word.find_first_of(" \t", first_pos);
if (second_pos != string::npos) {
rest = word.substr(second_pos);
word.erase(second_pos);
}
}
} // end namespace StringUtil
} // end namespace FbTk
|