Util.cxx 3.08 KB
Newer Older
1
/*
2
 * Copyright 2003-2016 The Music Player Daemon Project
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
 * 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"

22 23
#include <assert.h>

24
/** Get rid of white space at both ends */
25 26
void
trimstring(std::string &s, const char *ws)
27
{
28 29 30 31 32 33
	auto pos = s.find_first_not_of(ws);
	if (pos == std::string::npos) {
		s.clear();
		return;
	}
	s.replace(0, pos, std::string());
34

35 36 37
	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());
38 39 40 41 42
}

static void
path_catslash(std::string &s)
{
43
	if (s.empty() || s.back() != '/')
44 45 46 47 48 49 50 51 52 53 54 55
		s += '/';
}

std::string
path_getfather(const std::string &s)
{
	std::string father = s;

	// ??
	if (father.empty())
		return "./";

56
	if (father.back() == '/') {
57 58 59 60 61 62 63 64 65 66 67 68 69 70 71
		// 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;
}

72
std::list<std::string>
73 74 75
stringToTokens(const std::string &str,
	       const char *delims, bool skipinit)
{
76
	std::list<std::string> tokens;
77 78 79 80 81 82 83 84 85 86 87 88 89 90

	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) {
91
			tokens.emplace_back(str, startPos);
92 93 94 95
			break;
		} else if (pos == startPos) {
			// Dont' push empty tokens after first
			if (tokens.empty())
96
				tokens.emplace_back();
97 98
			startPos = ++pos;
		} else {
99
			tokens.emplace_back(str, startPos, pos - startPos);
100 101 102 103 104 105 106
			startPos = ++pos;
		}
	}

	return tokens;
}

107 108
template <class T>
bool
109
csvToStrings(const char *s, T &tokens)
110
{
111 112
	assert(tokens.empty());

113 114
	std::string current;

115 116 117
	while (true) {
		char ch = *s++;
		if (ch == 0) {
118
			tokens.emplace_back(std::move(current));
119
			return true;
120
		}
121 122 123 124 125 126

		if (ch == '\\') {
			ch = *s++;
			if (ch == 0)
				return false;
		} else if (ch == ',') {
127
			tokens.emplace_back(std::move(current));
128 129 130 131 132
			current.clear();
			continue;
		}

		current.push_back(ch);
133 134 135
	}
}

136
template bool csvToStrings<std::list<std::string>>(const char *, std::list<std::string> &);