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
|
/*
* Copyright (c) 2010 Remko Tronçon
* Licensed under the GNU General Public License v3.
* See Documentation/Licenses/GPLv3.txt for more information.
*/
#include <cassert>
#include <algorithm>
#include <sstream>
#include <iomanip>
#include <Swiften/Base/String.h>
namespace Swift {
static inline size_t sequenceLength(char firstByte) {
if ((firstByte & 0x80) == 0) {
return 1;
}
if ((firstByte & 0xE0) == 0xC0) {
return 2;
}
if ((firstByte & 0xF0) == 0xE0) {
return 3;
}
if ((firstByte & 0xF8) == 0xF0) {
return 4;
}
if ((firstByte & 0xFC) == 0xF8) {
return 5;
}
if ((firstByte & 0xFE) == 0xFC) {
return 6;
}
assert(false);
return 1;
}
std::vector<unsigned int> String::getUnicodeCodePoints(const std::string& s) {
std::vector<unsigned int> result;
for (size_t i = 0; i < s.size();) {
unsigned int codePoint = 0;
char firstChar = s[i];
size_t length = sequenceLength(firstChar);
// First character is special
size_t firstCharBitSize = 7 - length;
if (length == 1) {
firstCharBitSize = 7;
}
codePoint = firstChar & ((1<<(firstCharBitSize+1)) - 1);
for (size_t j = 1; j < length; ++j) {
codePoint = (codePoint<<6) | (s[i+j] & 0x3F);
}
result.push_back(codePoint);
i += length;
}
return result;
}
std::pair<std::string,std::string> String::getSplittedAtFirst(const std::string& s, char c) {
assert((c & 0x80) == 0);
size_t firstMatch = s.find(c);
if (firstMatch != s.npos) {
return std::make_pair(s.substr(0,firstMatch),s.substr(firstMatch+1,s.npos));
}
else {
return std::make_pair(s, "");
}
}
void String::replaceAll(std::string& src, char c, const std::string& s) {
size_t lastPos = 0;
size_t matchingIndex = 0;
while ((matchingIndex = src.find(c, lastPos)) != src.npos) {
src.replace(matchingIndex, 1, s);
lastPos = matchingIndex + s.size();
}
}
std::vector<std::string> String::split(const std::string& s, char c) {
assert((c & 0x80) == 0);
std::vector<std::string> result;
std::string accumulator;
for (size_t i = 0; i < s.size(); ++i) {
if (s[i] == c) {
result.push_back(accumulator);
accumulator = "";
}
else {
accumulator += s[i];
}
}
result.push_back(accumulator);
return result;
}
std::string String::convertIntToHexString(int h) {
std::stringstream ss;
ss << std::setbase(16);
ss << h;
return ss.str();
}
int String::convertHexStringToInt(const std::string& s) {
std::stringstream ss;
int h;
ss << std::setbase(16);
ss << s;
ss >> h;
return h;
}
}
|
