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
|
/**
* @file Uri.cpp
*
* This module contains the implementation of the Uri::Uri class.
*
* © 2018 by Richard Walters
*/
#include <inttypes.h>
#include <string>
#include <Uri/Uri.hpp>
#include <vector>
namespace Uri {
/**
* This contains the private properties of a Uri instance.
*/
struct Uri::Impl {
/**
* This is the "scheme" element of the URI.
*/
std::string scheme;
/**
* This is the "UserInfo" element of the URI.
*/
std::string userInfo;
/**
* This is the "host" element of the URI.
*/
std::string host;
/**
* This flag indicates whether or not the
* URI includes a port number.
*/
bool hasPort = false;
/**
* This is the port number element of the URI.
*/
uint16_t port = 0;
/**
* This is the "path" element of the URI,
* as a sequence of segments.
*/
std::vector< std::string > path;
/**
* This is the "query" element of the URI,
* if it has one.
*/
std::string query;
/**
* This is the "fragment" element of the URI,
* if it has one.
*/
std::string fragment;
};
Uri::~Uri() = default;
Uri::Uri()
: impl_(new Impl)
{
}
bool Uri::ParseFromString(const std::string& uriString) {
// First parse the scheme.
const auto schemeEnd = uriString.find(':');
std::string rest;
if (schemeEnd == std::string::npos) {
impl_->scheme.clear();
rest = uriString;
} else {
impl_->scheme = uriString.substr(0, schemeEnd);
rest = uriString.substr(schemeEnd + 1);
}
// Next parse the authority.
impl_->hasPort = false;
const auto pathEnd = rest.find_first_of("?#");
auto authorityAndPathString = rest.substr(0, pathEnd);
const auto queryAndOrFragment = rest.substr(authorityAndPathString.length());
std::string hostPortAndPathString;
if (authorityAndPathString.substr(0, 2) == "//") {
// Strip off authority marker.
authorityAndPathString = authorityAndPathString.substr(2);
// First separate the authority from the path.
auto authorityEnd = authorityAndPathString.find('/');
if (authorityEnd == std::string::npos) {
authorityEnd = authorityAndPathString.length();
}
// Next, check if there is a UserInfo, and if so, extract it.
const auto userInfoDelimiter = authorityAndPathString.find('@');
if (userInfoDelimiter == std::string::npos) {
impl_->userInfo.clear();
hostPortAndPathString = authorityAndPathString;
} else {
impl_->userInfo = authorityAndPathString.substr(0, userInfoDelimiter);
hostPortAndPathString = authorityAndPathString.substr(userInfoDelimiter + 1);
}
// Next, parsing host and port from authority and path.
const auto portDelimiter = hostPortAndPathString.find(':');
if (portDelimiter == std::string::npos) {
impl_->host = hostPortAndPathString.substr(0, authorityEnd);
} else {
impl_->host = hostPortAndPathString.substr(0, portDelimiter);
uint32_t newPort = 0;
for (auto c: hostPortAndPathString.substr(portDelimiter + 1, authorityEnd - portDelimiter - 1)) {
if (
(c < '0')
|| (c > '9')
) {
return false;
}
newPort *= 10;
newPort += (uint16_t)(c - '0');
if (
(newPort & ~((1 << 16) - 1)) != 0
) {
return false;
}
}
impl_->port = (uint16_t)newPort;
impl_->hasPort = true;
}
hostPortAndPathString = authorityAndPathString.substr(authorityEnd);
} else {
impl_->host.clear();
hostPortAndPathString = authorityAndPathString;
}
auto pathString = hostPortAndPathString;
// Next, parse the path.
impl_->path.clear();
if (pathString == "/") {
// Special case of a path that is empty but needs a single
// empty-string element to indicate that it is absolute.
impl_->path.push_back("");
pathString.clear();
} else if (!pathString.empty()) {
for(;;) {
auto pathDelimiter = pathString.find('/');
if (pathDelimiter == std::string::npos) {
impl_->path.push_back(pathString);
pathString.clear();
break;
} else {
impl_->path.emplace_back(
pathString.begin(),
pathString.begin() + pathDelimiter
);
pathString = pathString.substr(pathDelimiter + 1);
}
}
}
// Next, parse the fragment if there is one.
const auto fragmentDelimiter = queryAndOrFragment.find('#');
if (fragmentDelimiter == std::string::npos) {
impl_->fragment.clear();
rest = queryAndOrFragment;
} else {
impl_->fragment = queryAndOrFragment.substr(fragmentDelimiter + 1);
rest = queryAndOrFragment.substr(0, fragmentDelimiter);
}
// Finally, if anything is left, it's the query.
if (rest.empty()) {
impl_->query.clear();
} else {
impl_->query = rest.substr(1);
}
return true;
}
std::string Uri::GetScheme() const {
return impl_->scheme;
}
std::string Uri::GetUserInfo() const {
return impl_->userInfo;
}
std::string Uri::GetHost() const {
return impl_->host;
}
std::vector< std::string > Uri::GetPath() const {
return impl_->path;
}
bool Uri::HasPort() const {
return impl_->hasPort;
}
uint16_t Uri::GetPort() const {
return impl_->port;
}
bool Uri::IsRelativeReference() const {
return impl_->scheme.empty();
}
bool Uri::ContainsRelativePath() const {
if (impl_->path.empty()) {
return true;
} else {
return !impl_->path[0].empty();
}
}
std::string Uri::GetQuery() const {
return impl_->query;
}
std::string Uri::GetFragment() const {
return impl_->fragment;
}
}
|
