@@ -42,7 +42,7 @@ namespace Url
4242 {
4343 output.append (1 , ' -' );
4444 }
45-
45+
4646 // while h < length(input) do begin
4747 while (h < codepoints.size ())
4848 {
@@ -63,7 +63,7 @@ namespace Url
6363 }
6464 delta += (m - n) * (h + 1 );
6565
66- // let n = m
66+ // let n = m
6767 n = m;
6868
6969 // for each code point c in the input (in order) do begin
@@ -92,7 +92,7 @@ namespace Url
9292 // tmax if k >= bias + tmax, or k - bias otherwise
9393 punycode_uint t = k <= bias ? TMIN :
9494 k >= bias + TMAX ? TMAX : k - bias;
95-
95+
9696 // if q < t then break
9797 if (q < t)
9898 {
@@ -105,7 +105,7 @@ namespace Url
105105 // let q = (q - t) div (base - t)
106106 q = (q - t) / (BASE - t);
107107 }
108-
108+
109109 // output the code point for digit q
110110 output.append (1 , DIGIT_TO_BASIC[q]);
111111
@@ -117,15 +117,14 @@ namespace Url
117117
118118 // increment h
119119 ++h;
120-
121120 }
122121 }
123-
122+
124123 // increment delta and n
125124 ++delta;
126125 ++n;
127126 }
128-
127+
129128 str.assign (output);
130129 return str;
131130 }
@@ -230,7 +229,7 @@ namespace Url
230229 {
231230 throw std::invalid_argument (" Premature termination" );
232231 }
233-
232+
234233 // let digit = the code point's digit-value, fail if it has none
235234 int lookup = BASIC_TO_DIGIT[static_cast <size_t >(*it)];
236235 if (lookup == -1 )
@@ -256,7 +255,7 @@ namespace Url
256255 {
257256 break ;
258257 }
259-
258+
260259 // let w = w * (base - t), fail on overflow
261260 if (w > (MAX_PUNYCODE_UINT / (BASE - t)))
262261 {
@@ -294,10 +293,10 @@ namespace Url
294293 }
295294 w *= (BASE - t);
296295 }
297-
296+
298297 // let bias = adapt(i - oldi, length(output) + 1, test oldi is 0?)
299298 bias = adapt (i - oldi, codepoints.size () + 1 , oldi == 0 );
300-
299+
301300 // let n = n + i div (length(output) + 1), fail on overflow
302301 if ((i / (codepoints.size () + 1 )) > (MAX_PUNYCODE_UINT - n))
303302 {
@@ -387,7 +386,7 @@ namespace Url
387386 // if firsttime then let delta = delta div damp
388387 // else let delta = delta div 2
389388 delta = firsttime ? delta / DAMP : delta >> 1 ;
390-
389+
391390 // let delta = delta + (delta div numpoints)
392391 delta += (delta / numpoints);
393392
@@ -401,7 +400,7 @@ namespace Url
401400 // let k = k + base
402401 delta /= (BASE - TMIN);
403402 }
404-
403+
405404 // return k + (((base - tmin + 1) * delta) div (delta + skew))
406405 return k + (((BASE - TMIN + 1 ) * delta) / (delta + SKEW));
407406 }
0 commit comments