BLT/include/blt/std/string.h

159 lines
4.8 KiB
C
Raw Normal View History

2022-12-26 00:34:48 -05:00
/*
* Created by Brett on 26/12/22.
* Licensed under GNU General Public License V3.0
* See LICENSE file for license detail
*/
#ifndef BLT_STRING_H
#define BLT_STRING_H
2023-01-22 18:08:50 -05:00
#include <iostream>
2022-12-26 00:34:48 -05:00
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
2023-01-26 12:21:19 -05:00
#include <blt/std/logging.h>
2022-12-26 00:34:48 -05:00
namespace blt::string {
static inline bool starts_with(const std::string& string, const std::string& search){
if (search.length() > string.length())
return false;
auto chars = string.c_str();
auto search_chars = search.c_str();
for (int i = 0; i < search.length(); i++){
if (chars[i] != search_chars[i])
return false;
}
return true;
}
static inline bool ends_with(const std::string& string, const std::string& search){
if (search.length() > string.length())
return false;
auto chars = string.c_str();
auto search_chars = search.c_str();
auto startPosition = string.length() - search.length();
for (int i = 0; i < search.length(); i++){
if (chars[startPosition + i] != search_chars[i])
return false;
}
return true;
}
2023-01-22 18:08:50 -05:00
static inline bool contains(const std::string& string, const std::string& search){
if (search.length() > string.length())
return false;
auto chars = string.c_str();
auto search_chars = search.c_str();
for (int i = 0; i < string.length(); i++){
if (chars[i] == search_chars[0]) {
bool correct = true;
for (int j = 0; j < search.length(); j++) {
if (chars[i + j] != search_chars[j]) {
correct = false;
break;
}
}
if (correct)
return true;
}
}
return false;
}
/**
* Converts the string into lower case
* @param s string to lower case
* @return a string copy that is all lower case
*/
static inline std::string toLowerCase(const std::string& s) {
std::stringstream str;
std::for_each(
s.begin(), s.end(), [&str](unsigned char ch) {
str << (char) std::tolower(ch);
}
);
return str.str();
}
/**
* Converts the string into upper case
* @param s string to upper case
* @return a string copy that is all upper case
*/
static inline std::string toUpperCase(const std::string& s) {
std::stringstream str;
std::for_each(
s.begin(), s.end(), [&str](unsigned char ch) {
str << (char) std::toupper(ch);
}
);
return str.str();
}
// taken from https://stackoverflow.com/questions/14265581/parse-split-a-string-in-c-using-string-delimiter-standard-c
// extended to return a vector
static inline std::vector<std::string> split(std::string s, const std::string& delim) {
size_t pos = 0;
std::vector<std::string> tokens;
while ((pos = s.find(delim)) != std::string::npos) {
auto token = s.substr(0, pos);
tokens.push_back(token);
s.erase(0, pos + delim.length());
}
tokens.push_back(s);
return tokens;
}
// taken from https://stackoverflow.com/questions/216823/how-to-trim-an-stdstring
// would've preferred to use boost lib but instructions said to avoid external libs
// trim from start (in place)
static inline std::string& ltrim(std::string& s) {
s.erase(
s.begin(), std::find_if(
s.begin(), s.end(), [](unsigned char ch) {
2023-01-24 17:56:48 -05:00
return !std::isblank(ch);
2022-12-26 00:34:48 -05:00
}
));
return s;
}
// trim from end (in place)
static inline std::string& rtrim(std::string& s) {
s.erase(
std::find_if(
s.rbegin(), s.rend(), [](unsigned char ch) {
2023-01-24 17:56:48 -05:00
return !std::isblank(ch);
2022-12-26 00:34:48 -05:00
}
).base(), s.end());
return s;
}
// trim from both ends (in place)
static inline std::string& trim(std::string& s) {
ltrim(s);
rtrim(s);
return s;
}
// trim from start (copying)
static inline std::string ltrim_copy(std::string s) {
ltrim(s);
return s;
}
// trim from end (copying)
static inline std::string rtrim_copy(std::string s) {
rtrim(s);
return s;
}
// trim from both ends (copying)
static inline std::string trim_copy(std::string s) {
trim(s);
return s;
}
2022-12-26 00:34:48 -05:00
}
#endif //BLT_STRING_H