1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
/*
* Copyright (C) 2002, 2006-2009 by the Widelands Development Team
*
* 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 "helper.h"
#include <cstdarg>
#include <memory>
#include <string>
#include <boost/algorithm/string/replace.hpp>
#include <boost/format.hpp>
#include <boost/lexical_cast.hpp>
using namespace std;
vector<string> split_string(const string& s, const char* const separators) {
vector<string> result;
for (string::size_type pos = 0, endpos;
(pos = s.find_first_not_of(separators, pos)) != string::npos;
pos = endpos) {
endpos = s.find_first_of(separators, pos);
result.push_back(s.substr(pos, endpos - pos));
}
return result;
}
char* next_word(char* & p, bool& reached_end, char const terminator) {
assert(terminator);
char* const result = p;
for (; *p != terminator; ++p)
if (*p == '\0') {
reached_end = true;
goto end;
}
reached_end = false;
*p = '\0'; // terminate the word
++p; // move past the terminator
end:
if (result < p)
return result;
throw wexception("expected word");
}
|