Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
98 lines (86 loc) · 2.04 KB

File metadata and controls

98 lines (86 loc) · 2.04 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
#include "util.hpp"
namespace httpsserver {
uint32_t parseUInt(std::string const &s, uint32_t max) {
uint32_t i = 0; // value
// Check sign
size_t x = 0;
if (s[0]=='+') {
x = 1;
}
// We device max by 10, so we can check if we would exceed it by the next *10 multiplication
max/=10;
// Convert by base 10
for(; x < s.size(); x++) {
char c = s[x];
if (i < max) {
if (c >= '0' && c<='9') {
i = i*10 + (c-'0');
} else {
break;
}
} else {
return max;
}
}
return i;
}
int32_t parseInt(std::string const &s) {
uint32_t max = 0x7fffffff;
if (s[0]=='-') {
return -1 * parseUInt(s.substr(1,max));
}
return parseUInt(s,max);
}
std::string intToString(int i) {
if (i==0) {
return "0";
}
// We need this much digits
int digits = ceil(log10(i+1));
char c[digits+1];
c[digits] = '\0';
for(int x = digits-1; x >= 0; x--) {
char v = (i%10);
c[x] = '0' + v;
i = (i-v)/10;
}
return std::string(c);
}
}
std::string urlDecode(std::string input) {
std::size_t idxReplaced = 0;
// First replace + by space
std::size_t idxFound = input.find('+');
while (idxFound != std::string::npos) {
input.replace(idxFound, 1, 1, ' ');
idxFound = input.find('+', idxFound + 1);
}
// Now replace percent-escapes
idxFound = input.find('%');
while (idxFound != std::string::npos) {
if (idxFound <= input.length() + 3) {
char hex[2] = { input[idxFound+1], input[idxFound+2] };
byte val = 0;
for(int n = 0; n < sizeof(hex); n++) {
val <<= 4;
if ('0' <= hex[n] && hex[n] <= '9') {
val += hex[n]-'0';
}
else if ('A' <= hex[n] && hex[n] <= 'F') {
val += hex[n]-'A'+10;
}
else if ('a' <= hex[n] && hex[n] <= 'f') {
val += hex[n]-'a'+10;
}
else {
goto skipChar;
}
}
input.replace(idxFound, 3, 1, (char)val);
}
skipChar:
idxReplaced = idxFound + 1;
idxFound = input.find('%', idxReplaced);
}
return input;
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.