-
-
Notifications
You must be signed in to change notification settings - Fork 346
/
stringUtils.cpp
272 lines (248 loc) · 7.97 KB
/
stringUtils.cpp
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
/**
* @file stringUtils.cpp
* Contains definitions for string manipulation functions
* within Cantera.
*/
// This file is part of Cantera. See License.txt in the top-level directory or
// at https://cantera.org/license.txt for license and copyright information.
//@{
#include "cantera/base/ct_defs.h"
#ifdef _MSC_VER
#define SNPRINTF _snprintf
#else
#define SNPRINTF snprintf
#endif
//@}
#include "cantera/base/stringUtils.h"
#include "cantera/base/ctexceptions.h"
#include "cantera/base/ctml.h"
#include "cantera/base/utilities.h"
#include <boost/algorithm/string.hpp>
#include <sstream>
#include <cstdio>
namespace ba = boost::algorithm;
namespace Cantera
{
std::string vec2str(const vector_fp& v, const std::string& fmt,
const std::string& sep)
{
char buf[64];
std::stringstream o;
for (size_t i = 0; i < v.size(); i++) {
SNPRINTF(buf, 63, fmt.c_str(), v[i]);
o << buf;
if (i != v.size() - 1) {
o << sep;
}
}
return o.str();
}
std::string stripnonprint(const std::string& s)
{
std::string ss = "";
for (size_t i = 0; i < s.size(); i++) {
if (isprint(s[i])) {
ss += s[i];
}
}
return ss;
}
compositionMap parseCompString(const std::string& ss,
const std::vector<std::string>& names)
{
compositionMap x;
for (size_t k = 0; k < names.size(); k++) {
x[names[k]] = 0.0;
}
size_t start = 0;
size_t stop = 0;
size_t left = 0;
while (stop < ss.size()) {
size_t colon = ss.find(':', left);
if (colon == npos) {
break;
}
size_t valstart = ss.find_first_not_of(" \t\n", colon+1);
stop = ss.find_first_of(", ;\n\t", valstart);
std::string name = ba::trim_copy(ss.substr(start, colon-start));
if (!names.empty() && x.find(name) == x.end()) {
throw CanteraError("parseCompString",
"unknown species '" + name + "'");
}
double value;
try {
value = fpValueCheck(ss.substr(valstart, stop-valstart));
} catch (CanteraError&) {
// If we have a key containing a colon, we expect this to fail. In
// this case, take the current substring as part of the key and look
// to the right of the next colon for the corresponding value.
// Otherwise, this is an invalid composition string.
std::string testname = ss.substr(start, stop-start);
if (testname.find_first_of(" \n\t") != npos) {
// Space, tab, and newline are never allowed in names
throw;
} else if (ss.substr(valstart, stop-valstart).find(':') != npos) {
left = colon + 1;
stop = 0; // Force another iteration of this loop
continue;
} else {
throw;
}
}
if (getValue(x, name, 0.0) != 0.0) {
throw CanteraError("parseCompString",
"Duplicate key: '" + name + "'.");
}
x[name] = value;
start = ss.find_first_not_of(", ;\n\t", stop+1);
left = start;
}
if (left != start) {
throw CanteraError("parseCompString", "Unable to parse key-value pair:"
"\n'{}'", ss.substr(start, stop));
}
if (stop != npos && !ba::trim_copy(ss.substr(stop)).empty()) {
throw CanteraError("parseCompString", "Found non-key:value data "
"in composition string: '" + ss.substr(stop) + "'");
}
return x;
}
int intValue(const std::string& val)
{
return std::atoi(ba::trim_copy(val).c_str());
}
doublereal fpValue(const std::string& val)
{
doublereal rval;
std::stringstream ss(val);
ss.imbue(std::locale("C"));
ss >> rval;
return rval;
}
doublereal fpValueCheck(const std::string& val)
{
std::string str = ba::trim_copy(val);
if (str.empty()) {
throw CanteraError("fpValueCheck", "string has zero length");
}
int numDot = 0;
int numExp = 0;
char ch;
int istart = 0;
ch = str[0];
if (ch == '+' || ch == '-') {
if (str.size() == 1) {
throw CanteraError("fpValueCheck", "string ends in '{}'", ch);
}
istart = 1;
}
for (size_t i = istart; i < str.size(); i++) {
ch = str[i];
if (isdigit(ch)) {
} else if (ch == '.') {
numDot++;
if (numDot > 1) {
throw CanteraError("fpValueCheck",
"string has more than one .");
}
if (numExp > 0) {
throw CanteraError("fpValueCheck",
"string has decimal point in exponent");
}
} else if (ch == 'e' || ch == 'E' || ch == 'd' || ch == 'D') {
numExp++;
str[i] = 'E';
if (numExp > 1) {
throw CanteraError("fpValueCheck",
"string has more than one exp char");
} else if (i == str.size() - 1) {
throw CanteraError("fpValueCheck",
"string ends in '{}'", ch);
}
ch = str[i+1];
if (ch == '+' || ch == '-') {
if (i + 1 == str.size() - 1) {
throw CanteraError("fpValueCheck",
"string ends in '{}'", ch);
}
i++;
}
} else {
throw CanteraError("fpValueCheck",
"Trouble processing string, " + str);
}
}
return fpValue(str);
}
std::string parseSpeciesName(const std::string& nameStr, std::string& phaseName)
{
std::string s = ba::trim_copy(nameStr);
phaseName = "";
size_t ibegin = s.find_first_not_of(" ;\n\t");
if (ibegin != std::string::npos) {
s = s.substr(ibegin,s.size());
size_t icolon = s.find(':');
size_t iend = s.find_first_of(" ;\n\t");
if (icolon != std::string::npos) {
phaseName = s.substr(0, icolon);
s = s.substr(icolon+1, s.size());
icolon = s.find(':');
if (icolon != std::string::npos) {
throw CanteraError("parseSpeciesName",
"two colons in name: '{}'", nameStr);
}
}
if (iend != std::string::npos) {
throw CanteraError("parseSpeciesName", "Species name has "
"\" ;/\n/\t\" in the middle of it: '{}'", nameStr);
}
}
return s;
}
doublereal strSItoDbl(const std::string& strSI)
{
std::vector<std::string> v;
tokenizeString(strSI, v);
doublereal fp = 1.0;
size_t n = v.size();
if (n > 2 || n < 1) {
throw CanteraError("strSItoDbl",
"number of tokens is too high");
} else if (n == 2) {
fp = toSI(v[1]);
}
doublereal val = fpValueCheck(v[0]);
return val * fp;
}
void tokenizeString(const std::string& in_val, std::vector<std::string>& v)
{
std::string val = ba::trim_copy(in_val);
v.clear();
if (val.empty()) {
// In this case, prefer v to be empty instead of split's behavior of
// returning a vector with one element that is the empty string.
return;
}
ba::split(v, val, ba::is_space(), ba::token_compress_on);
}
size_t copyString(const std::string& source, char* dest, size_t length)
{
const char* c_src = source.c_str();
size_t N = std::min(length, source.length()+1);
size_t ret = (length >= source.length() + 1) ? 0 : source.length() + 1;
std::copy(c_src, c_src + N, dest);
if (length != 0) {
dest[length-1] = '\0';
}
return ret;
}
std::string trimCopy(const std::string &input) {
return ba::trim_copy(input);
}
std::string toLowerCopy(const std::string &input) {
return ba::to_lower_copy(input);
}
bool caseInsensitiveEquals(const std::string &input, const std::string &test) {
return ba::iequals(input, test);
}
}