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
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Computational Engine *
* *
* Copyright (c) 1999-2025, Ben Burton *
* For further details contact Ben Burton (bab@debian.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. *
* *
* As an exception, when this program is distributed through (i) the *
* App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or *
* (iii) Google Play by Google Inc., then that store may impose any *
* digital rights management, device limits and/or redistribution *
* restrictions that are required by its terms of service. *
* *
* 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, see <https://www.gnu.org/licenses/>. *
* *
**************************************************************************/
#include <cstdlib>
#include <cctype>
#include <climits>
#include "maths/integer.h"
#include "utilities/stringutils.h"
#include "utilities/boolset.h"
namespace regina {
bool startsWith(const std::string& str, const std::string& prefix) {
if (str.length() < prefix.length())
return false;
auto a = str.begin();
auto b = prefix.begin();
for ( ; b != prefix.end(); ++a, ++b)
if (*a != *b)
return false;
return true;
}
std::string stripWhitespace(const std::string& str) {
std::string::size_type start = 0;
std::string::size_type end = str.length();
while (start < end && isspace(str[start]))
++start;
while (start < end && isspace(str[end - 1]))
--end;
return str.substr(start, end - start);
}
bool valueOf(const std::string& str, int8_t& dest) {
// TODO: Check errno, and check for overflow when casting back to int.
char* endPtr;
dest = static_cast<int8_t>(strtol(str.c_str(), &endPtr, 10));
return ((! str.empty()) && (*endPtr == 0));
}
bool valueOf(const std::string& str, uint8_t& dest) {
// TODO: Check errno, and check for overflow when casting back to unsigned.
char* endPtr;
dest = static_cast<uint8_t>(strtoul(str.c_str(), &endPtr, 10));
return ((! str.empty()) && (*endPtr == 0));
}
bool valueOf(const std::string& str, short& dest) {
// TODO: Check errno, and check for overflow when casting back to int.
char* endPtr;
dest = static_cast<short>(strtol(str.c_str(), &endPtr, 10));
return ((! str.empty()) && (*endPtr == 0));
}
bool valueOf(const std::string& str, unsigned short& dest) {
// TODO: Check errno, and check for overflow when casting back to unsigned.
char* endPtr;
dest = static_cast<unsigned short>(strtoul(str.c_str(), &endPtr, 10));
return ((! str.empty()) && (*endPtr == 0));
}
bool valueOf(const std::string& str, int& dest) {
// TODO: Check errno, and check for overflow when casting back to int.
char* endPtr;
dest = static_cast<int>(strtol(str.c_str(), &endPtr, 10));
return ((! str.empty()) && (*endPtr == 0));
}
bool valueOf(const std::string& str, unsigned& dest) {
// TODO: Check errno, and check for overflow when casting back to unsigned.
char* endPtr;
dest = static_cast<unsigned>(strtoul(str.c_str(), &endPtr, 10));
return ((! str.empty()) && (*endPtr == 0));
}
bool valueOf(const std::string& str, long& dest) {
char* endPtr;
dest = strtol(str.c_str(), &endPtr, 10);
return ((! str.empty()) && (*endPtr == 0));
}
bool valueOf(const std::string& str, unsigned long& dest) {
char* endPtr;
dest = strtoul(str.c_str(), &endPtr, 10);
return ((! str.empty()) && (*endPtr == 0));
}
bool valueOf(const std::string& str, long long& dest) {
char* endPtr;
dest = strtoll(str.c_str(), &endPtr, 10);
return ((! str.empty()) && (*endPtr == 0));
}
bool valueOf(const std::string& str, unsigned long long& dest) {
char* endPtr;
dest = strtoull(str.c_str(), &endPtr, 10);
return ((! str.empty()) && (*endPtr == 0));
}
bool valueOf(const std::string& str, double& dest) {
char* endPtr;
dest = strtod(str.c_str(), &endPtr);
return ((! str.empty()) && (*endPtr == 0));
}
bool valueOf(const std::string& str, bool& dest) {
if (str.empty()) {
dest = false;
return false;
}
if (str[0] == 't' || str[0] == 'T' || str[0] == '1') {
dest = true;
return true;
}
dest = false;
return (str[0] == 'F' || str[0] == 'f' || str[0] == '0');
}
bool valueOf(const std::string& str, BoolSet& dest) {
if (str.length() != 2) {
dest.clear();
return false;
}
char t = str[0];
char f = str[1];
if (t != '-' && t != 'T' && t != 't') {
dest.clear();
return false;
}
if (f != '-' && f != 'F' && f != 'f') {
dest.clear();
return false;
}
dest = BoolSet(t != '-', f != '-');
return true;
}
std::string stringToToken(std::string str) {
for (auto& c : str)
if (isspace(c))
c = '_';
return str; // I *believe* this is a move, not a copy (C++ Core Issue 1148).
}
std::vector<std::string> basicTokenise(const std::string& str) {
std::vector<std::string> ans;
std::string::size_type len = str.length();
std::string::size_type pos = 0;
// Skip initial whitespace.
while (pos < len && isspace(str[pos]))
++pos;
if (pos == len)
return {};
// Extract each token.
std::string::size_type tokStart;
while (pos < len) {
// Find the characters making up this token.
tokStart = pos;
while (pos < len && ! isspace(str[pos]))
++pos;
ans.push_back(str.substr(tokStart, pos - tokStart));
// Skip the subsequent whitespace.
while (pos < len && isspace(str[pos]))
++pos;
}
return ans;
}
} // namespace regina
|
