wudd/source/utils/StringTools.cpp

/***************************************************************************
 * 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 <vector>
#include <string>
#include <string.h>
#include <stdarg.h>
#include <stdlib.h>
#include <stdio.h>
#include <wchar.h>
#include <strings.h>
#include <wut_types.h>
#include <stdio.h>
#include "StringTools.h"


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)) {
        int32_t 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;

    int32_t 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;
}

bool StringTools::findStringIC(const std::string &strHaystack, const std::string &strNeedle) {
    auto it = std::search(
            strHaystack.begin(), strHaystack.end(),
            strNeedle.begin(), strNeedle.end(),
            [](char ch1, char ch2) { return std::toupper(ch1) == std::toupper(ch2); }
    );
    return (it != strHaystack.end());
}

bool StringTools::replace(std::string &str, const std::string &from, const std::string &to) {
    size_t start_pos = str.find(from);
    if (start_pos == std::string::npos) {
        return false;
    }
    str.replace(start_pos, from.length(), to);
    return true;
}


bool StringTools::strCompareIC(const std::string &str1, const std::string &str2) {
    return str1.size() == str2.size() && std::equal(str1.begin(), str1.end(), str2.begin(), [](auto a, auto b) { return std::tolower(a) == std::tolower(b); });
}