mirror of
https://github.com/shadps4-emu/ext-hwinfo.git
synced 2026-01-31 00:55:22 +01:00
139 lines
3.4 KiB
C++
139 lines
3.4 KiB
C++
// Copyright Leon Freist
|
|
// Author Leon Freist <freist@informatik.uni-freiburg.de>
|
|
|
|
#pragma once
|
|
|
|
#include <string>
|
|
|
|
/**
|
|
* remove all white spaces (' ', '\t', '\n') from start and end of input
|
|
* inplace!
|
|
* @param input
|
|
*/
|
|
inline void strip(std::string& input) {
|
|
if (input.empty()) {
|
|
return;
|
|
}
|
|
// optimization for input size == 1
|
|
if (input.size() == 1) {
|
|
if (input[0] == ' ' || input[0] == '\t' || input[0] == '\n') {
|
|
input = "";
|
|
return;
|
|
} else {
|
|
return;
|
|
}
|
|
}
|
|
size_t start_index = 0;
|
|
while (true) {
|
|
char c = input[start_index];
|
|
if (c != ' ' && c != '\t' && c != '\n') {
|
|
break;
|
|
}
|
|
start_index++;
|
|
}
|
|
size_t end_index = input.size() - 1;
|
|
while (true) {
|
|
char c = input[end_index];
|
|
if (c != ' ' && c != '\t' && c != '\n') {
|
|
break;
|
|
}
|
|
end_index--;
|
|
}
|
|
if (end_index <= start_index) {
|
|
input.assign("");
|
|
return;
|
|
}
|
|
input.assign(input.begin() + start_index, input.begin() + end_index + 1);
|
|
}
|
|
|
|
/**
|
|
* Count occurrences of a substring in input
|
|
* @param input
|
|
* @param substring
|
|
* @return
|
|
*/
|
|
inline unsigned count_substring(const std::string& input, const std::string& substring) {
|
|
unsigned occurrences = 0;
|
|
std::string::size_type shift = 0;
|
|
while ((shift = input.find(substring, shift)) != std::string::npos) {
|
|
occurrences++;
|
|
shift += substring.size();
|
|
}
|
|
return occurrences;
|
|
}
|
|
|
|
/**
|
|
* Split input string at delimiter and return result
|
|
* @param input
|
|
* @param delimiter
|
|
* @return
|
|
*/
|
|
inline std::vector<std::string> split(const std::string& input, const std::string& delimiter) {
|
|
std::vector<std::string> result;
|
|
size_t shift = 0;
|
|
while (true) {
|
|
size_t match = input.find(delimiter, shift);
|
|
result.emplace_back(input.substr(shift, match - shift));
|
|
if (match == std::string::npos) {
|
|
break;
|
|
}
|
|
shift = match + delimiter.size();
|
|
}
|
|
return result;
|
|
}
|
|
|
|
/**
|
|
* Split input string at delimiter (char) and return result
|
|
* @param input
|
|
* @param delimiter
|
|
* @return
|
|
*/
|
|
inline std::vector<std::string> split(const std::string& input, const char delimiter) {
|
|
std::vector<std::string> result;
|
|
size_t shift = 0;
|
|
while (true) {
|
|
size_t match = input.find(delimiter, shift);
|
|
if (match == std::string::npos) {
|
|
break;
|
|
}
|
|
result.emplace_back(input.substr(shift, match - shift));
|
|
shift = match + 1;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
/**
|
|
* split input at delimiter and return substring at position index.
|
|
* index can be negative, where -1 is the last occurrence.
|
|
* @param input
|
|
* @param delimiter
|
|
* @param index
|
|
* @return
|
|
*/
|
|
inline std::string split_get_index(const std::string& input, const std::string& delimiter, int index) {
|
|
unsigned occ = count_substring(input, delimiter) + 1;
|
|
index = index < 0 ? static_cast<int>(occ + index) : index;
|
|
if (occ <= index) {
|
|
return "";
|
|
}
|
|
|
|
std::string::size_type start_index = 0;
|
|
while (true) {
|
|
if (index == 0) {
|
|
break;
|
|
}
|
|
start_index = input.find(delimiter, start_index) + delimiter.size();
|
|
index--;
|
|
}
|
|
std::string::size_type end_index = input.find(delimiter, start_index);
|
|
if (end_index == std::string::npos) {
|
|
return {input.begin() + static_cast<int64_t>(start_index), input.end()};
|
|
}
|
|
return {input.begin() + static_cast<int64_t>(start_index), input.begin() + static_cast<int64_t>(end_index)};
|
|
}
|
|
|
|
/**
|
|
* Convert windows wstring to string
|
|
* @return
|
|
*/
|
|
inline std::string wstring_to_string() { return ""; } |