2021-12-25 20:14:56 +01:00
|
|
|
/***************************************************************************
|
|
|
|
* Copyright (C) 2010
|
|
|
|
* by Dimok
|
|
|
|
*
|
|
|
|
* This software is provided 'as-is', without any express or implied
|
|
|
|
* warranty. In no event will the authors be held liable for any
|
|
|
|
* damages arising from the use of this software.
|
|
|
|
*
|
|
|
|
* Permission is granted to anyone to use this software for any
|
|
|
|
* purpose, including commercial applications, and to alter it and
|
|
|
|
* redistribute it freely, subject to the following restrictions:
|
|
|
|
*
|
|
|
|
* 1. The origin of this software must not be misrepresented; you
|
|
|
|
* must not claim that you wrote the original software. If you use
|
|
|
|
* this software in a product, an acknowledgment in the product
|
|
|
|
* documentation would be appreciated but is not required.
|
|
|
|
*
|
|
|
|
* 2. Altered source versions must be plainly marked as such, and
|
|
|
|
* must not be misrepresented as being the original software.
|
|
|
|
*
|
|
|
|
* 3. This notice may not be removed or altered from any source
|
|
|
|
* distribution.
|
|
|
|
*
|
|
|
|
* for WiiXplorer 2010
|
|
|
|
***************************************************************************/
|
|
|
|
#include <stdarg.h>
|
|
|
|
#include <stdio.h>
|
2022-02-02 19:12:52 +01:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <string>
|
2021-12-25 20:14:56 +01:00
|
|
|
#include <strings.h>
|
|
|
|
#include <utils/StringTools.h>
|
2022-02-02 19:12:52 +01:00
|
|
|
#include <vector>
|
|
|
|
#include <wchar.h>
|
|
|
|
#include <wut_types.h>
|
2021-12-25 20:14:56 +01:00
|
|
|
|
|
|
|
|
|
|
|
BOOL StringTools::EndsWith(const std::string &a, const std::string &b) {
|
|
|
|
if (b.size() > a.size())
|
|
|
|
return false;
|
|
|
|
return std::equal(a.begin() + a.size() - b.size(), a.end(), b.begin());
|
|
|
|
}
|
|
|
|
|
|
|
|
const char *StringTools::byte_to_binary(int32_t x) {
|
|
|
|
static char b[9];
|
|
|
|
b[0] = '\0';
|
|
|
|
|
|
|
|
int32_t z;
|
|
|
|
for (z = 128; z > 0; z >>= 1) {
|
|
|
|
strcat(b, ((x & z) == z) ? "1" : "0");
|
|
|
|
}
|
|
|
|
|
|
|
|
return b;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string StringTools::removeCharFromString(std::string &input, char toBeRemoved) {
|
|
|
|
std::string output = input;
|
|
|
|
size_t position;
|
|
|
|
while (1) {
|
|
|
|
position = output.find(toBeRemoved);
|
|
|
|
if (position == std::string::npos)
|
|
|
|
break;
|
|
|
|
output.erase(position, 1);
|
|
|
|
}
|
|
|
|
return output;
|
|
|
|
}
|
|
|
|
|
|
|
|
const char *StringTools::fmt(const char *format, ...) {
|
|
|
|
static char strChar[512];
|
|
|
|
strChar[0] = 0;
|
|
|
|
|
|
|
|
va_list va;
|
|
|
|
va_start(va, format);
|
|
|
|
if ((vsprintf(strChar, format, va) >= 0)) {
|
|
|
|
va_end(va);
|
|
|
|
return (const char *) strChar;
|
|
|
|
}
|
|
|
|
va_end(va);
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
const wchar_t *StringTools::wfmt(const char *format, ...) {
|
|
|
|
static char tmp[512];
|
|
|
|
static wchar_t strWChar[512];
|
|
|
|
strWChar[0] = 0;
|
|
|
|
tmp[0] = 0;
|
|
|
|
|
|
|
|
if (!format)
|
|
|
|
return (const wchar_t *) strWChar;
|
|
|
|
|
|
|
|
if (strcmp(format, "") == 0)
|
|
|
|
return (const wchar_t *) strWChar;
|
|
|
|
|
|
|
|
va_list va;
|
|
|
|
va_start(va, format);
|
|
|
|
if ((vsprintf(tmp, format, va) >= 0)) {
|
|
|
|
int bt;
|
|
|
|
int32_t strlength = strlen(tmp);
|
|
|
|
bt = mbstowcs(strWChar, tmp, (strlength < 512) ? strlength : 512);
|
|
|
|
|
|
|
|
if (bt > 0) {
|
|
|
|
strWChar[bt] = 0;
|
|
|
|
return (const wchar_t *) strWChar;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
va_end(va);
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
int32_t StringTools::strprintf(std::string &str, const char *format, ...) {
|
|
|
|
static char tmp[512];
|
|
|
|
tmp[0] = 0;
|
|
|
|
int32_t result = 0;
|
|
|
|
|
|
|
|
va_list va;
|
|
|
|
va_start(va, format);
|
|
|
|
if ((vsprintf(tmp, format, va) >= 0)) {
|
|
|
|
str = tmp;
|
|
|
|
result = str.size();
|
|
|
|
}
|
|
|
|
va_end(va);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string StringTools::strfmt(const char *format, ...) {
|
|
|
|
std::string str;
|
|
|
|
static char tmp[512];
|
|
|
|
tmp[0] = 0;
|
|
|
|
|
|
|
|
va_list va;
|
|
|
|
va_start(va, format);
|
|
|
|
if ((vsprintf(tmp, format, va) >= 0)) {
|
|
|
|
str = tmp;
|
|
|
|
}
|
|
|
|
va_end(va);
|
|
|
|
|
|
|
|
return str;
|
|
|
|
}
|
|
|
|
|
|
|
|
BOOL StringTools::char2wchar_t(const char *strChar, wchar_t *dest) {
|
|
|
|
if (!strChar || !dest)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
int bt;
|
|
|
|
bt = mbstowcs(dest, strChar, strlen(strChar));
|
|
|
|
if (bt > 0) {
|
|
|
|
dest[bt] = 0;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
int32_t StringTools::strtokcmp(const char *string, const char *compare, const char *separator) {
|
|
|
|
if (!string || !compare)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
char TokCopy[512];
|
|
|
|
strncpy(TokCopy, compare, sizeof(TokCopy));
|
|
|
|
TokCopy[511] = '\0';
|
|
|
|
|
|
|
|
char *strTok = strtok(TokCopy, separator);
|
|
|
|
|
|
|
|
while (strTok != NULL) {
|
|
|
|
if (strcasecmp(string, strTok) == 0) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
strTok = strtok(NULL, separator);
|
|
|
|
}
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int32_t StringTools::strextcmp(const char *string, const char *extension, char seperator) {
|
|
|
|
if (!string || !extension)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
char *ptr = strrchr(string, seperator);
|
|
|
|
if (!ptr)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
return strcasecmp(ptr + 1, extension);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
std::vector<std::string> StringTools::stringSplit(const std::string &inValue, const std::string &splitter) {
|
|
|
|
std::string value = inValue;
|
|
|
|
std::vector<std::string> result;
|
|
|
|
while (true) {
|
|
|
|
uint32_t index = value.find(splitter);
|
|
|
|
if (index == std::string::npos) {
|
|
|
|
result.push_back(value);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
std::string first = value.substr(0, index);
|
|
|
|
result.push_back(first);
|
|
|
|
if (index + splitter.size() == value.length()) {
|
|
|
|
result.push_back("");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (index + splitter.size() > value.length()) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
value = value.substr(index + splitter.size(), value.length());
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
const char *StringTools::FullpathToFilename(const char *path) {
|
|
|
|
if (!path)
|
|
|
|
return path;
|
|
|
|
|
|
|
|
const char *ptr = path;
|
|
|
|
const char *Filename = ptr;
|
|
|
|
|
|
|
|
while (*ptr != '\0') {
|
|
|
|
if (ptr[0] == '/' && ptr[1] != '\0')
|
|
|
|
Filename = ptr + 1;
|
|
|
|
|
|
|
|
++ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
return Filename;
|
|
|
|
}
|
|
|
|
|
|
|
|
void StringTools::RemoveDoubleSlashs(std::string &str) {
|
|
|
|
uint32_t length = str.size();
|
|
|
|
|
|
|
|
//! clear path of double slashes
|
|
|
|
for (uint32_t i = 1; i < length; ++i) {
|
|
|
|
if (str[i - 1] == '/' && str[i] == '/') {
|
|
|
|
str.erase(i, 1);
|
|
|
|
i--;
|
|
|
|
length--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// You must free the result if result is non-NULL.
|
|
|
|
char *StringTools::str_replace(char *orig, char *rep, char *with) {
|
|
|
|
char *result; // the return string
|
|
|
|
char *ins; // the next insert point
|
|
|
|
char *tmp; // varies
|
|
|
|
int len_rep; // length of rep (the string to remove)
|
|
|
|
int len_with; // length of with (the string to replace rep with)
|
2022-02-02 19:12:52 +01:00
|
|
|
int len_front;// distance between rep and end of last rep
|
2021-12-25 20:14:56 +01:00
|
|
|
int count; // number of replacements
|
|
|
|
|
|
|
|
// sanity checks and initialization
|
|
|
|
if (!orig || !rep)
|
|
|
|
return NULL;
|
|
|
|
len_rep = strlen(rep);
|
|
|
|
if (len_rep == 0)
|
2022-02-02 19:12:52 +01:00
|
|
|
return NULL;// empty rep causes infinite loop during count
|
2021-12-25 20:14:56 +01:00
|
|
|
if (!with)
|
|
|
|
with = (char *) "";
|
|
|
|
len_with = strlen(with);
|
|
|
|
|
|
|
|
// count the number of replacements needed
|
|
|
|
ins = orig;
|
|
|
|
for (count = 0; (tmp = strstr(ins, rep)); ++count) {
|
|
|
|
ins = tmp + len_rep;
|
|
|
|
}
|
|
|
|
|
|
|
|
tmp = result = (char *) malloc(strlen(orig) + (len_with - len_rep) * count + 1);
|
|
|
|
|
|
|
|
if (!result)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
// first time through the loop, all the variable are set correctly
|
|
|
|
// from here on,
|
|
|
|
// tmp points to the end of the result string
|
|
|
|
// ins points to the next occurrence of rep in orig
|
|
|
|
// orig points to the remainder of orig after "end of rep"
|
|
|
|
while (count--) {
|
|
|
|
ins = strstr(orig, rep);
|
|
|
|
len_front = ins - orig;
|
|
|
|
tmp = strncpy(tmp, orig, len_front) + len_front;
|
|
|
|
tmp = strcpy(tmp, with) + len_with;
|
2022-02-02 19:12:52 +01:00
|
|
|
orig += len_front + len_rep;// move to next "end of rep"
|
2021-12-25 20:14:56 +01:00
|
|
|
}
|
|
|
|
strcpy(tmp, orig);
|
|
|
|
return result;
|
|
|
|
}
|