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 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308
|
/// <summary>
/// Copyright (C) 2004-2025 Free Software Foundation, Inc.
///
/// Author: Alexander Gnauck AG-Software, mailto:gnauck@ag-software.de
///
/// This file is part of GNU Libidn.
///
/// GNU Libidn is free software: you can redistribute it and/or
/// modify it under the terms of either:
///
/// * the GNU Lesser General Public License as published by the Free
/// Software Foundation; either version 3 of the License, or (at
/// your option) any later version.
///
/// or
///
/// * the GNU General Public License as published by the Free
/// Software Foundation; either version 2 of the License, or (at
/// your option) any later version.
///
/// or both in parallel, as here.
///
/// GNU Libidn is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
/// General Public License for more details.
///
/// You should have received copies of the GNU General Public License and
/// the GNU Lesser General Public License along with this program. If
/// not, see <https://www.gnu.org/licenses/>.
/// </summary>
using System;
using System.Text;
namespace Gnu.Inet.Encoding
{
public class Punycode
{
/* Punycode parameters */
internal const int TMIN = 1;
internal const int TMAX = 26;
internal const int BASE = 36;
internal const int INITIAL_N = 128;
internal const int INITIAL_BIAS = 72;
internal const int DAMP = 700;
internal const int SKEW = 38;
internal const char DELIMITER = '-';
/// <summary>
/// Punycodes a unicode string.
/// </summary>
/// <param name="input">Unicode string.</param>
/// <returns> Punycoded string.</returns>
public static string Encode(string input)
{
int n = INITIAL_N;
int delta = 0;
int bias = INITIAL_BIAS;
StringBuilder output = new StringBuilder();
// Copy all basic code points to the output
int b = 0;
for (int i = 0; i < input.Length; i++)
{
char c = input[i];
if (IsBasic(c))
{
output.Append(c);
b++;
}
}
// Append delimiter
if (b > 0)
{
output.Append(DELIMITER);
}
int h = b;
while (h < input.Length)
{
int m = System.Int32.MaxValue;
// Find the minimum code point >= n
for (int i = 0; i < input.Length; i++)
{
int c = input[i];
if (c >= n && c < m)
{
m = c;
}
}
if (m - n > (System.Int32.MaxValue - delta) / (h + 1))
{
throw new PunycodeException(PunycodeException.OVERFLOW);
}
delta = delta + (m - n) * (h + 1);
n = m;
for (int j = 0; j < input.Length; j++)
{
int c = input[j];
if (c < n)
{
delta++;
if (0 == delta)
{
throw new PunycodeException(PunycodeException.OVERFLOW);
}
}
if (c == n)
{
int q = delta;
for (int k = BASE; ; k += BASE)
{
int t;
if (k <= bias)
{
t = TMIN;
}
else if (k >= bias + TMAX)
{
t = TMAX;
}
else
{
t = k - bias;
}
if (q < t)
{
break;
}
output.Append((char) Digit2Codepoint(t + (q - t) % (BASE - t)));
q = (q - t) / (BASE - t);
}
output.Append((char) Digit2Codepoint(q));
bias = Adapt(delta, h + 1, h == b);
delta = 0;
h++;
}
}
delta++;
n++;
}
return output.ToString();
}
/// <summary>
/// Decode a punycoded string.
/// </summary>
/// <param name="input">Punycode string</param>
/// <returns> Unicode string.</returns>
public static string Decode(string input)
{
int n = INITIAL_N;
int i = 0;
int bias = INITIAL_BIAS;
StringBuilder output = new StringBuilder();
int d = input.LastIndexOf((System.Char) DELIMITER);
if (d > 0)
{
for (int j = 0; j < d; j++)
{
char c = input[j];
if (!IsBasic(c))
{
throw new PunycodeException(PunycodeException.BAD_INPUT);
}
output.Append(c);
}
d++;
}
else
{
d = 0;
}
while (d < input.Length)
{
int oldi = i;
int w = 1;
for (int k = BASE; ; k += BASE)
{
if (d == input.Length)
{
throw new PunycodeException(PunycodeException.BAD_INPUT);
}
int c = input[d++];
int digit = Codepoint2Digit(c);
if (digit > (System.Int32.MaxValue - i) / w)
{
throw new PunycodeException(PunycodeException.OVERFLOW);
}
i = i + digit * w;
int t;
if (k <= bias)
{
t = TMIN;
}
else if (k >= bias + TMAX)
{
t = TMAX;
}
else
{
t = k - bias;
}
if (digit < t)
{
break;
}
w = w * (BASE - t);
}
bias = Adapt(i - oldi, output.Length + 1, oldi == 0);
if (i / (output.Length + 1) > Int32.MaxValue - n)
{
throw new PunycodeException(PunycodeException.OVERFLOW);
}
n = n + i / (output.Length + 1);
i = i % (output.Length + 1);
// following overload is not supported on CF
//output.Insert(i,(char) n);
output.Insert(i, new char[1] { (char) n });
i++;
}
return output.ToString();
}
public static int Adapt(int delta, int numpoints, bool first)
{
if (first)
{
delta = delta / DAMP;
}
else
{
delta = delta / 2;
}
delta = delta + (delta / numpoints);
int k = 0;
while (delta > ((BASE - TMIN) * TMAX) / 2)
{
delta = delta / (BASE - TMIN);
k = k + BASE;
}
return k + ((BASE - TMIN + 1) * delta) / (delta + SKEW);
}
public static bool IsBasic(char c)
{
return c < 0x80;
}
public static int Digit2Codepoint(int d)
{
if (d < 26)
{
// 0..25 : 'a'..'z'
return d + 'a';
}
else if (d < 36)
{
// 26..35 : '0'..'9';
return d - 26 + '0';
}
else
{
throw new PunycodeException(PunycodeException.BAD_INPUT);
}
}
public static int Codepoint2Digit(int c)
{
if (c - '0' < 10)
{
// '0'..'9' : 26..35
return c - '0' + 26;
}
else if (c - 'a' < 26)
{
// 'a'..'z' : 0..25
return c - 'a';
}
else
{
throw new PunycodeException(PunycodeException.BAD_INPUT);
}
}
}
}
|