blob: 5fde29c699fd28f9c019c775866878b1aeb4f84d (
plain)
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
|
/*
Ousía
Copyright (C) 2014, 2015 Benjamin Paaßen, Andreas Stöckel
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 3 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, see <http://www.gnu.org/licenses/>.
*/
#include <algorithm>
#include <limits>
#include "Utils.hpp"
namespace ousia {
std::string Utils::trim(const std::string &s)
{
size_t firstNonWhitespace = std::numeric_limits<size_t>::max();
size_t lastNonWhitespace = 0;
for (size_t i = 0; i < s.size(); i++) {
if (!isWhitespace(s[i])) {
firstNonWhitespace = std::min(i, firstNonWhitespace);
lastNonWhitespace = std::max(i, lastNonWhitespace);
}
}
if (firstNonWhitespace < lastNonWhitespace) {
return s.substr(firstNonWhitespace,
lastNonWhitespace - firstNonWhitespace + 1);
}
return std::string{};
}
bool Utils::isIdentifier(const std::string &name)
{
bool first = true;
for (char c : name) {
if (first && !(isAlphabetic(c) || c == '_')) {
return false;
}
if (!first && !(isAlphanumeric(c) || c == '_' || c == '-')) {
return false;
}
first = false;
}
return true;
}
std::vector<std::string> Utils::split(const std::string &s, char delim)
{
std::vector<std::string> res;
const size_t totalLen = s.size();
size_t start = 0;
size_t len = 0;
for (size_t i = 0; i <= totalLen; i++) {
if (i == totalLen || s[i] == delim) {
res.push_back(s.substr(start, len));
start = i + 1;
len = 0;
} else {
len++;
}
}
return res;
}
}
|
