mirror/polybar
3
0
Fork 0
mirror of https://github.com/polybar/polybar.git synced 2026-02-20 00:35:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Application rewrite

Browse Source
This commit is contained in:
Michael Carlberg
2016-06-15 05:32:35 +02:00
parent d72ff7334e
commit d359ab6057
167 changed files with 17368 additions and 8891 deletions
Download Patch File Download Diff File Expand all files Collapse all files

110
src/utils/string.cpp
View File

@ -1,110 +0,0 @@
#include <sstream>
#include <boost/algorithm/string/replace.hpp>
#include "utils/string.hpp"
namespace string
{
bool compare(std::string s1, std::string s2) {
return lower(s1) == lower(s2);
}
// std::string upper(std::string s)
// {
// std::string str(s);
// for (auto &c : str)
// c = std::toupper(c);
// return str;
// }
std::string lower(std::string s)
{
std::string str(s);
for (auto &c : str)
c = std::tolower(c);
return str;
}
std::string replace(std::string haystack, std::string needle, std::string replacement)
{
std::string str(haystack);
std::string::size_type pos;
if ((pos = str.find(needle)) != std::string::npos)
str = str.replace(pos, needle.length(), replacement);
return str;
}
std::string replace_all(std::string haystack, std::string needle, std::string replacement) {
return boost::replace_all_copy(haystack, needle, replacement);
}
std::string squeeze(std::string haystack, char needle) {
return replace_all(haystack, {needle, needle}, {needle});
}
// std::string strip(std::string haystack, char needle)
// {
// std::string str(haystack);
// std::string::size_type pos;
// while ((pos = str.find(needle)) != std::string::npos)
// str.erase(pos, 1);
// return str;
// }
std::string strip_trailing_newline(std::string haystack)
{
std::string str(haystack);
if (str[str.length()-1] == '\n')
str.erase(str.length()-1, 1);
return str;
}
std::string trim(std::string haystack, char needle) {
return rtrim(ltrim(haystack, needle), needle);
}
std::string ltrim(std::string haystack, char needle)
{
std::string str(haystack);
while (str[0] == needle)
str.erase(0, 1);
return str;
}
std::string rtrim(std::string haystack, char needle)
{
std::string str(haystack);
while (str[str.length()-1] == needle)
str.erase(str.length()-1, 1);
return str;
}
std::string join(std::vector<std::string> strs, std::string delim)
{
std::string str;
for (auto &s : strs)
str.append((str.empty() ? "" : delim) + s);
return str;
}
std::vector<std::string> split(std::string s, char delim)
{
std::vector<std::string> vec;
return split_into(s, delim, vec);
}
std::vector<std::string> &split_into(std::string s, char delim, std::vector<std::string> &container)
{
std::string str;
std::stringstream buffer(s);
while (std::getline(buffer, str, delim))
container.emplace_back(str);
return container;
}
std::size_t find_nth(std::string haystack, std::size_t pos, std::string needle, std::size_t nth)
{
std::size_t found_pos = haystack.find(needle, pos);
if(0 == nth || std::string::npos == found_pos) return found_pos;
return find_nth(haystack, found_pos+1, needle, nth-1);
}
}