/* * Copyright (C) 2003-2014 The Music Player Daemon Project * http://www.musicpd.org * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License along * with this program; if not, write to the Free Software Foundation, Inc., * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ #include "Util.hxx" #include #include #include #include #include /** Get rid of white space at both ends */ void trimstring(std::string &s, const char *ws) { auto pos = s.find_first_not_of(ws); if (pos == std::string::npos) { s.clear(); return; } s.replace(0, pos, std::string()); pos = s.find_last_not_of(ws); if (pos != std::string::npos && pos != s.length()-1) s.replace(pos + 1, std::string::npos, std::string()); } std::string caturl(const std::string &s1, const std::string &s2) { std::string out(s1); if (out[out.size()-1] == '/') { if (s2[0] == '/') out.erase(out.size()-1); } else { if (s2[0] != '/') out.push_back('/'); } out += s2; return out; } static void path_catslash(std::string &s) { if (s.empty() || s[s.length() - 1] != '/') s += '/'; } std::string path_getfather(const std::string &s) { std::string father = s; // ?? if (father.empty()) return "./"; if (father[father.length() - 1] == '/') { // Input ends with /. Strip it, handle special case for root if (father.length() == 1) return father; father.erase(father.length()-1); } auto slp = father.rfind('/'); if (slp == std::string::npos) return "./"; father.erase(slp); path_catslash(father); return father; } std::list stringToTokens(const std::string &str, const char *delims, bool skipinit) { std::list tokens; std::string::size_type startPos = 0; // Skip initial delims, return empty if this eats all. if (skipinit && (startPos = str.find_first_not_of(delims, 0)) == std::string::npos) return tokens; while (startPos < str.size()) { // Find next delimiter or end of string (end of token) auto pos = str.find_first_of(delims, startPos); // Add token to the vector and adjust start if (pos == std::string::npos) { tokens.emplace_back(str, startPos); break; } else if (pos == startPos) { // Dont' push empty tokens after first if (tokens.empty()) tokens.emplace_back(); startPos = ++pos; } else { tokens.emplace_back(str, startPos, pos - startPos); startPos = ++pos; } } return tokens; } template bool csvToStrings(const std::string &s, T &tokens) { std::string current; tokens.clear(); enum states {TOKEN, ESCAPE}; states state = TOKEN; for (unsigned int i = 0; i < s.length(); i++) { switch (s[i]) { case ',': switch(state) { case TOKEN: tokens.insert(tokens.end(), current); current.clear(); continue; case ESCAPE: current += ','; state = TOKEN; continue; } break; case '\\': switch(state) { case TOKEN: state=ESCAPE; continue; case ESCAPE: current += '\\'; state = TOKEN; continue; } break; default: switch(state) { case ESCAPE: state = TOKEN; break; case TOKEN: break; } current += s[i]; } } switch(state) { case TOKEN: tokens.insert(tokens.end(), current); break; case ESCAPE: return false; } return true; } //template bool csvToStrings >(const string &, list &); template bool csvToStrings >(const std::string &, std::vector &); template bool csvToStrings >(const std::string &, std::set &);