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;

uint32_t max = 0x7fffffff;

if (s[0]=='-') {

return -1 * parseUInt(s.substr(1,max));

}

return parseUInt(s,max);

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::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;