pecunia-root 0.0.9 → 0.1.1

package/dist/node_modules/.pnpm/punycode@2.3.1/node_modules/punycode/punycode.mjs

@@ -0,0 +1,295 @@
+import { __commonJSMin } from "../../../../../_virtual/rolldown_runtime.mjs";
+
+//#region ../../node_modules/.pnpm/punycode@2.3.1/node_modules/punycode/punycode.js
+var require_punycode = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	/** Highest positive signed 32-bit float value */
+	const maxInt = 2147483647;
+	/** Bootstring parameters */
+	const base = 36;
+	const tMin = 1;
+	const tMax = 26;
+	const skew = 38;
+	const damp = 700;
+	const initialBias = 72;
+	const initialN = 128;
+	const delimiter = "-";
+	/** Regular expressions */
+	const regexPunycode = /^xn--/;
+	const regexNonASCII = /[^\0-\x7F]/;
+	const regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g;
+	/** Error messages */
+	const errors = {
+		"overflow": "Overflow: input needs wider integers to process",
+		"not-basic": "Illegal input >= 0x80 (not a basic code point)",
+		"invalid-input": "Invalid input"
+	};
+	/** Convenience shortcuts */
+	const baseMinusTMin = base - tMin;
+	const floor = Math.floor;
+	const stringFromCharCode = String.fromCharCode;
+	/**
+	* A generic error utility function.
+	* @private
+	* @param {String} type The error type.
+	* @returns {Error} Throws a `RangeError` with the applicable error message.
+	*/
+	function error(type) {
+		throw new RangeError(errors[type]);
+	}
+	/**
+	* A generic `Array#map` utility function.
+	* @private
+	* @param {Array} array The array to iterate over.
+	* @param {Function} callback The function that gets called for every array
+	* item.
+	* @returns {Array} A new array of values returned by the callback function.
+	*/
+	function map(array, callback) {
+		const result = [];
+		let length = array.length;
+		while (length--) result[length] = callback(array[length]);
+		return result;
+	}
+	/**
+	* A simple `Array#map`-like wrapper to work with domain name strings or email
+	* addresses.
+	* @private
+	* @param {String} domain The domain name or email address.
+	* @param {Function} callback The function that gets called for every
+	* character.
+	* @returns {String} A new string of characters returned by the callback
+	* function.
+	*/
+	function mapDomain(domain, callback) {
+		const parts = domain.split("@");
+		let result = "";
+		if (parts.length > 1) {
+			result = parts[0] + "@";
+			domain = parts[1];
+		}
+		domain = domain.replace(regexSeparators, ".");
+		const encoded = map(domain.split("."), callback).join(".");
+		return result + encoded;
+	}
+	/**
+	* Creates an array containing the numeric code points of each Unicode
+	* character in the string. While JavaScript uses UCS-2 internally,
+	* this function will convert a pair of surrogate halves (each of which
+	* UCS-2 exposes as separate characters) into a single code point,
+	* matching UTF-16.
+	* @see `punycode.ucs2.encode`
+	* @see <https://mathiasbynens.be/notes/javascript-encoding>
+	* @memberOf punycode.ucs2
+	* @name decode
+	* @param {String} string The Unicode input string (UCS-2).
+	* @returns {Array} The new array of code points.
+	*/
+	function ucs2decode(string) {
+		const output = [];
+		let counter = 0;
+		const length = string.length;
+		while (counter < length) {
+			const value = string.charCodeAt(counter++);
+			if (value >= 55296 && value <= 56319 && counter < length) {
+				const extra = string.charCodeAt(counter++);
+				if ((extra & 64512) == 56320) output.push(((value & 1023) << 10) + (extra & 1023) + 65536);
+				else {
+					output.push(value);
+					counter--;
+				}
+			} else output.push(value);
+		}
+		return output;
+	}
+	/**
+	* Creates a string based on an array of numeric code points.
+	* @see `punycode.ucs2.decode`
+	* @memberOf punycode.ucs2
+	* @name encode
+	* @param {Array} codePoints The array of numeric code points.
+	* @returns {String} The new Unicode string (UCS-2).
+	*/
+	const ucs2encode = (codePoints) => String.fromCodePoint(...codePoints);
+	/**
+	* Converts a basic code point into a digit/integer.
+	* @see `digitToBasic()`
+	* @private
+	* @param {Number} codePoint The basic numeric code point value.
+	* @returns {Number} The numeric value of a basic code point (for use in
+	* representing integers) in the range `0` to `base - 1`, or `base` if
+	* the code point does not represent a value.
+	*/
+	const basicToDigit = function(codePoint) {
+		if (codePoint >= 48 && codePoint < 58) return 26 + (codePoint - 48);
+		if (codePoint >= 65 && codePoint < 91) return codePoint - 65;
+		if (codePoint >= 97 && codePoint < 123) return codePoint - 97;
+		return base;
+	};
+	/**
+	* Converts a digit/integer into a basic code point.
+	* @see `basicToDigit()`
+	* @private
+	* @param {Number} digit The numeric value of a basic code point.
+	* @returns {Number} The basic code point whose value (when used for
+	* representing integers) is `digit`, which needs to be in the range
+	* `0` to `base - 1`. If `flag` is non-zero, the uppercase form is
+	* used; else, the lowercase form is used. The behavior is undefined
+	* if `flag` is non-zero and `digit` has no uppercase form.
+	*/
+	const digitToBasic = function(digit, flag) {
+		return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);
+	};
+	/**
+	* Bias adaptation function as per section 3.4 of RFC 3492.
+	* https://tools.ietf.org/html/rfc3492#section-3.4
+	* @private
+	*/
+	const adapt = function(delta, numPoints, firstTime) {
+		let k = 0;
+		delta = firstTime ? floor(delta / damp) : delta >> 1;
+		delta += floor(delta / numPoints);
+		for (; delta > baseMinusTMin * tMax >> 1; k += base) delta = floor(delta / baseMinusTMin);
+		return floor(k + (baseMinusTMin + 1) * delta / (delta + skew));
+	};
+	/**
+	* Converts a Punycode string of ASCII-only symbols to a string of Unicode
+	* symbols.
+	* @memberOf punycode
+	* @param {String} input The Punycode string of ASCII-only symbols.
+	* @returns {String} The resulting string of Unicode symbols.
+	*/
+	const decode = function(input) {
+		const output = [];
+		const inputLength = input.length;
+		let i = 0;
+		let n = initialN;
+		let bias = initialBias;
+		let basic = input.lastIndexOf(delimiter);
+		if (basic < 0) basic = 0;
+		for (let j = 0; j < basic; ++j) {
+			if (input.charCodeAt(j) >= 128) error("not-basic");
+			output.push(input.charCodeAt(j));
+		}
+		for (let index = basic > 0 ? basic + 1 : 0; index < inputLength;) {
+			const oldi = i;
+			for (let w = 1, k = base;; k += base) {
+				if (index >= inputLength) error("invalid-input");
+				const digit = basicToDigit(input.charCodeAt(index++));
+				if (digit >= base) error("invalid-input");
+				if (digit > floor((maxInt - i) / w)) error("overflow");
+				i += digit * w;
+				const t = k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;
+				if (digit < t) break;
+				const baseMinusT = base - t;
+				if (w > floor(maxInt / baseMinusT)) error("overflow");
+				w *= baseMinusT;
+			}
+			const out = output.length + 1;
+			bias = adapt(i - oldi, out, oldi == 0);
+			if (floor(i / out) > maxInt - n) error("overflow");
+			n += floor(i / out);
+			i %= out;
+			output.splice(i++, 0, n);
+		}
+		return String.fromCodePoint(...output);
+	};
+	/**
+	* Converts a string of Unicode symbols (e.g. a domain name label) to a
+	* Punycode string of ASCII-only symbols.
+	* @memberOf punycode
+	* @param {String} input The string of Unicode symbols.
+	* @returns {String} The resulting Punycode string of ASCII-only symbols.
+	*/
+	const encode = function(input) {
+		const output = [];
+		input = ucs2decode(input);
+		const inputLength = input.length;
+		let n = initialN;
+		let delta = 0;
+		let bias = initialBias;
+		for (const currentValue of input) if (currentValue < 128) output.push(stringFromCharCode(currentValue));
+		const basicLength = output.length;
+		let handledCPCount = basicLength;
+		if (basicLength) output.push(delimiter);
+		while (handledCPCount < inputLength) {
+			let m = maxInt;
+			for (const currentValue of input) if (currentValue >= n && currentValue < m) m = currentValue;
+			const handledCPCountPlusOne = handledCPCount + 1;
+			if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) error("overflow");
+			delta += (m - n) * handledCPCountPlusOne;
+			n = m;
+			for (const currentValue of input) {
+				if (currentValue < n && ++delta > maxInt) error("overflow");
+				if (currentValue === n) {
+					let q = delta;
+					for (let k = base;; k += base) {
+						const t = k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;
+						if (q < t) break;
+						const qMinusT = q - t;
+						const baseMinusT = base - t;
+						output.push(stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0)));
+						q = floor(qMinusT / baseMinusT);
+					}
+					output.push(stringFromCharCode(digitToBasic(q, 0)));
+					bias = adapt(delta, handledCPCountPlusOne, handledCPCount === basicLength);
+					delta = 0;
+					++handledCPCount;
+				}
+			}
+			++delta;
+			++n;
+		}
+		return output.join("");
+	};
+	/**
+	* Converts a Punycode string representing a domain name or an email address
+	* to Unicode. Only the Punycoded parts of the input will be converted, i.e.
+	* it doesn't matter if you call it on a string that has already been
+	* converted to Unicode.
+	* @memberOf punycode
+	* @param {String} input The Punycoded domain name or email address to
+	* convert to Unicode.
+	* @returns {String} The Unicode representation of the given Punycode
+	* string.
+	*/
+	const toUnicode = function(input) {
+		return mapDomain(input, function(string) {
+			return regexPunycode.test(string) ? decode(string.slice(4).toLowerCase()) : string;
+		});
+	};
+	/**
+	* Converts a Unicode string representing a domain name or an email address to
+	* Punycode. Only the non-ASCII parts of the domain name will be converted,
+	* i.e. it doesn't matter if you call it with a domain that's already in
+	* ASCII.
+	* @memberOf punycode
+	* @param {String} input The domain name or email address to convert, as a
+	* Unicode string.
+	* @returns {String} The Punycode representation of the given domain name or
+	* email address.
+	*/
+	const toASCII = function(input) {
+		return mapDomain(input, function(string) {
+			return regexNonASCII.test(string) ? "xn--" + encode(string) : string;
+		});
+	};
+	/** Define the public API */
+	const punycode = {
+		"version": "2.3.1",
+		"ucs2": {
+			"decode": ucs2decode,
+			"encode": ucs2encode
+		},
+		"decode": decode,
+		"encode": encode,
+		"toASCII": toASCII,
+		"toUnicode": toUnicode
+	};
+	module.exports = punycode;
+}));
+
+//#endregion
+export default require_punycode();
+
+export { require_punycode };
+//# sourceMappingURL=punycode.mjs.map

package/dist/node_modules/.pnpm/punycode@2.3.1/node_modules/punycode/punycode.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"punycode.mjs","names":[],"sources":["../../../../../../../../node_modules/.pnpm/punycode@2.3.1/node_modules/punycode/punycode.js"],"sourcesContent":["'use strict';\n\n/** Highest positive signed 32-bit float value */\nconst maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1\n\n/** Bootstring parameters */\nconst base = 36;\nconst tMin = 1;\nconst tMax = 26;\nconst skew = 38;\nconst damp = 700;\nconst initialBias = 72;\nconst initialN = 128; // 0x80\nconst delimiter = '-'; // '\\x2D'\n\n/** Regular expressions */\nconst regexPunycode = /^xn--/;\nconst regexNonASCII = /[^\\0-\\x7F]/; // Note: U+007F DEL is excluded too.\nconst regexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g; // RFC 3490 separators\n\n/** Error messages */\nconst errors = {\n\t'overflow': 'Overflow: input needs wider integers to process',\n\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t'invalid-input': 'Invalid input'\n};\n\n/** Convenience shortcuts */\nconst baseMinusTMin = base - tMin;\nconst floor = Math.floor;\nconst stringFromCharCode = String.fromCharCode;\n\n/*--------------------------------------------------------------------------*/\n\n/**\n * A generic error utility function.\n * @private\n * @param {String} type The error type.\n * @returns {Error} Throws a `RangeError` with the applicable error message.\n */\nfunction error(type) {\n\tthrow new RangeError(errors[type]);\n}\n\n/**\n * A generic `Array#map` utility function.\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} callback The function that gets called for every array\n * item.\n * @returns {Array} A new array of values returned by the callback function.\n */\nfunction map(array, callback) {\n\tconst result = [];\n\tlet length = array.length;\n\twhile (length--) {\n\t\tresult[length] = callback(array[length]);\n\t}\n\treturn result;\n}\n\n/**\n * A simple `Array#map`-like wrapper to work with domain name strings or email\n * addresses.\n * @private\n * @param {String} domain The domain name or email address.\n * @param {Function} callback The function that gets called for every\n * character.\n * @returns {String} A new string of characters returned by the callback\n * function.\n */\nfunction mapDomain(domain, callback) {\n\tconst parts = domain.split('@');\n\tlet result = '';\n\tif (parts.length > 1) {\n\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t// the local part (i.e. everything up to `@`) intact.\n\t\tresult = parts[0] + '@';\n\t\tdomain = parts[1];\n\t}\n\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\tdomain = domain.replace(regexSeparators, '\\x2E');\n\tconst labels = domain.split('.');\n\tconst encoded = map(labels, callback).join('.');\n\treturn result + encoded;\n}\n\n/**\n * Creates an array containing the numeric code points of each Unicode\n * character in the string. While JavaScript uses UCS-2 internally,\n * this function will convert a pair of surrogate halves (each of which\n * UCS-2 exposes as separate characters) into a single code point,\n * matching UTF-16.\n * @see `punycode.ucs2.encode`\n * @see <https://mathiasbynens.be/notes/javascript-encoding>\n * @memberOf punycode.ucs2\n * @name decode\n * @param {String} string The Unicode input string (UCS-2).\n * @returns {Array} The new array of code points.\n */\nfunction ucs2decode(string) {\n\tconst output = [];\n\tlet counter = 0;\n\tconst length = string.length;\n\twhile (counter < length) {\n\t\tconst value = string.charCodeAt(counter++);\n\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t// It's a high surrogate, and there is a next character.\n\t\t\tconst extra = string.charCodeAt(counter++);\n\t\t\tif ((extra & 0xFC00) == 0xDC00) { // Low surrogate.\n\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t} else {\n\t\t\t\t// It's an unmatched surrogate; only append this code unit, in case the\n\t\t\t\t// next code unit is the high surrogate of a surrogate pair.\n\t\t\t\toutput.push(value);\n\t\t\t\tcounter--;\n\t\t\t}\n\t\t} else {\n\t\t\toutput.push(value);\n\t\t}\n\t}\n\treturn output;\n}\n\n/**\n * Creates a string based on an array of numeric code points.\n * @see `punycode.ucs2.decode`\n * @memberOf punycode.ucs2\n * @name encode\n * @param {Array} codePoints The array of numeric code points.\n * @returns {String} The new Unicode string (UCS-2).\n */\nconst ucs2encode = codePoints => String.fromCodePoint(...codePoints);\n\n/**\n * Converts a basic code point into a digit/integer.\n * @see `digitToBasic()`\n * @private\n * @param {Number} codePoint The basic numeric code point value.\n * @returns {Number} The numeric value of a basic code point (for use in\n * representing integers) in the range `0` to `base - 1`, or `base` if\n * the code point does not represent a value.\n */\nconst basicToDigit = function(codePoint) {\n\tif (codePoint >= 0x30 && codePoint < 0x3A) {\n\t\treturn 26 + (codePoint - 0x30);\n\t}\n\tif (codePoint >= 0x41 && codePoint < 0x5B) {\n\t\treturn codePoint - 0x41;\n\t}\n\tif (codePoint >= 0x61 && codePoint < 0x7B) {\n\t\treturn codePoint - 0x61;\n\t}\n\treturn base;\n};\n\n/**\n * Converts a digit/integer into a basic code point.\n * @see `basicToDigit()`\n * @private\n * @param {Number} digit The numeric value of a basic code point.\n * @returns {Number} The basic code point whose value (when used for\n * representing integers) is `digit`, which needs to be in the range\n * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n * used; else, the lowercase form is used. The behavior is undefined\n * if `flag` is non-zero and `digit` has no uppercase form.\n */\nconst digitToBasic = function(digit, flag) {\n\t//  0..25 map to ASCII a..z or A..Z\n\t// 26..35 map to ASCII 0..9\n\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n};\n\n/**\n * Bias adaptation function as per section 3.4 of RFC 3492.\n * https://tools.ietf.org/html/rfc3492#section-3.4\n * @private\n */\nconst adapt = function(delta, numPoints, firstTime) {\n\tlet k = 0;\n\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\tdelta += floor(delta / numPoints);\n\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\tdelta = floor(delta / baseMinusTMin);\n\t}\n\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n};\n\n/**\n * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n * symbols.\n * @memberOf punycode\n * @param {String} input The Punycode string of ASCII-only symbols.\n * @returns {String} The resulting string of Unicode symbols.\n */\nconst decode = function(input) {\n\t// Don't use UCS-2.\n\tconst output = [];\n\tconst inputLength = input.length;\n\tlet i = 0;\n\tlet n = initialN;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points: let `basic` be the number of input code\n\t// points before the last delimiter, or `0` if there is none, then copy\n\t// the first basic code points to the output.\n\n\tlet basic = input.lastIndexOf(delimiter);\n\tif (basic < 0) {\n\t\tbasic = 0;\n\t}\n\n\tfor (let j = 0; j < basic; ++j) {\n\t\t// if it's not a basic code point\n\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\terror('not-basic');\n\t\t}\n\t\toutput.push(input.charCodeAt(j));\n\t}\n\n\t// Main decoding loop: start just after the last delimiter if any basic code\n\t// points were copied; start at the beginning otherwise.\n\n\tfor (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t// `index` is the index of the next character to be consumed.\n\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t// which gets added to `i`. The overflow checking is easier\n\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t// value at the end to obtain `delta`.\n\t\tconst oldi = i;\n\t\tfor (let w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\tif (index >= inputLength) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\n\t\t\tconst digit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\tif (digit >= base) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\t\t\tif (digit > floor((maxInt - i) / w)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\ti += digit * w;\n\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\tif (digit < t) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tconst baseMinusT = base - t;\n\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tw *= baseMinusT;\n\n\t\t}\n\n\t\tconst out = output.length + 1;\n\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t// incrementing `n` each time, so we'll fix that now:\n\t\tif (floor(i / out) > maxInt - n) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tn += floor(i / out);\n\t\ti %= out;\n\n\t\t// Insert `n` at position `i` of the output.\n\t\toutput.splice(i++, 0, n);\n\n\t}\n\n\treturn String.fromCodePoint(...output);\n};\n\n/**\n * Converts a string of Unicode symbols (e.g. a domain name label) to a\n * Punycode string of ASCII-only symbols.\n * @memberOf punycode\n * @param {String} input The string of Unicode symbols.\n * @returns {String} The resulting Punycode string of ASCII-only symbols.\n */\nconst encode = function(input) {\n\tconst output = [];\n\n\t// Convert the input in UCS-2 to an array of Unicode code points.\n\tinput = ucs2decode(input);\n\n\t// Cache the length.\n\tconst inputLength = input.length;\n\n\t// Initialize the state.\n\tlet n = initialN;\n\tlet delta = 0;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points.\n\tfor (const currentValue of input) {\n\t\tif (currentValue < 0x80) {\n\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t}\n\t}\n\n\tconst basicLength = output.length;\n\tlet handledCPCount = basicLength;\n\n\t// `handledCPCount` is the number of code points that have been handled;\n\t// `basicLength` is the number of basic code points.\n\n\t// Finish the basic string with a delimiter unless it's empty.\n\tif (basicLength) {\n\t\toutput.push(delimiter);\n\t}\n\n\t// Main encoding loop:\n\twhile (handledCPCount < inputLength) {\n\n\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t// larger one:\n\t\tlet m = maxInt;\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\tm = currentValue;\n\t\t\t}\n\t\t}\n\n\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t// but guard against overflow.\n\t\tconst handledCPCountPlusOne = handledCPCount + 1;\n\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\tn = m;\n\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\t\t\tif (currentValue === n) {\n\t\t\t\t// Represent delta as a generalized variable-length integer.\n\t\t\t\tlet q = delta;\n\t\t\t\tfor (let k = base; /* no condition */; k += base) {\n\t\t\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tconst qMinusT = q - t;\n\t\t\t\t\tconst baseMinusT = base - t;\n\t\t\t\t\toutput.push(\n\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t);\n\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t}\n\n\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount === basicLength);\n\t\t\t\tdelta = 0;\n\t\t\t\t++handledCPCount;\n\t\t\t}\n\t\t}\n\n\t\t++delta;\n\t\t++n;\n\n\t}\n\treturn output.join('');\n};\n\n/**\n * Converts a Punycode string representing a domain name or an email address\n * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n * it doesn't matter if you call it on a string that has already been\n * converted to Unicode.\n * @memberOf punycode\n * @param {String} input The Punycoded domain name or email address to\n * convert to Unicode.\n * @returns {String} The Unicode representation of the given Punycode\n * string.\n */\nconst toUnicode = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexPunycode.test(string)\n\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t: string;\n\t});\n};\n\n/**\n * Converts a Unicode string representing a domain name or an email address to\n * Punycode. Only the non-ASCII parts of the domain name will be converted,\n * i.e. it doesn't matter if you call it with a domain that's already in\n * ASCII.\n * @memberOf punycode\n * @param {String} input The domain name or email address to convert, as a\n * Unicode string.\n * @returns {String} The Punycode representation of the given domain name or\n * email address.\n */\nconst toASCII = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexNonASCII.test(string)\n\t\t\t? 'xn--' + encode(string)\n\t\t\t: string;\n\t});\n};\n\n/*--------------------------------------------------------------------------*/\n\n/** Define the public API */\nconst punycode = {\n\t/**\n\t * A string representing the current Punycode.js version number.\n\t * @memberOf punycode\n\t * @type String\n\t */\n\t'version': '2.3.1',\n\t/**\n\t * An object of methods to convert from JavaScript's internal character\n\t * representation (UCS-2) to Unicode code points, and back.\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode\n\t * @type Object\n\t */\n\t'ucs2': {\n\t\t'decode': ucs2decode,\n\t\t'encode': ucs2encode\n\t},\n\t'decode': decode,\n\t'encode': encode,\n\t'toASCII': toASCII,\n\t'toUnicode': toUnicode\n};\n\nmodule.exports = punycode;\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAGA,MAAM,SAAS;;CAGf,MAAM,OAAO;CACb,MAAM,OAAO;CACb,MAAM,OAAO;CACb,MAAM,OAAO;CACb,MAAM,OAAO;CACb,MAAM,cAAc;CACpB,MAAM,WAAW;CACjB,MAAM,YAAY;;CAGlB,MAAM,gBAAgB;CACtB,MAAM,gBAAgB;CACtB,MAAM,kBAAkB;;CAGxB,MAAM,SAAS;EACd,YAAY;EACZ,aAAa;EACb,iBAAiB;EACjB;;CAGD,MAAM,gBAAgB,OAAO;CAC7B,MAAM,QAAQ,KAAK;CACnB,MAAM,qBAAqB,OAAO;;;;;;;CAUlC,SAAS,MAAM,MAAM;AACpB,QAAM,IAAI,WAAW,OAAO,MAAM;;;;;;;;;;CAWnC,SAAS,IAAI,OAAO,UAAU;EAC7B,MAAM,SAAS,EAAE;EACjB,IAAI,SAAS,MAAM;AACnB,SAAO,SACN,QAAO,UAAU,SAAS,MAAM,QAAQ;AAEzC,SAAO;;;;;;;;;;;;CAaR,SAAS,UAAU,QAAQ,UAAU;EACpC,MAAM,QAAQ,OAAO,MAAM,IAAI;EAC/B,IAAI,SAAS;AACb,MAAI,MAAM,SAAS,GAAG;AAGrB,YAAS,MAAM,KAAK;AACpB,YAAS,MAAM;;AAGhB,WAAS,OAAO,QAAQ,iBAAiB,IAAO;EAEhD,MAAM,UAAU,IADD,OAAO,MAAM,IAAI,EACJ,SAAS,CAAC,KAAK,IAAI;AAC/C,SAAO,SAAS;;;;;;;;;;;;;;;CAgBjB,SAAS,WAAW,QAAQ;EAC3B,MAAM,SAAS,EAAE;EACjB,IAAI,UAAU;EACd,MAAM,SAAS,OAAO;AACtB,SAAO,UAAU,QAAQ;GACxB,MAAM,QAAQ,OAAO,WAAW,UAAU;AAC1C,OAAI,SAAS,SAAU,SAAS,SAAU,UAAU,QAAQ;IAE3D,MAAM,QAAQ,OAAO,WAAW,UAAU;AAC1C,SAAK,QAAQ,UAAW,MACvB,QAAO,OAAO,QAAQ,SAAU,OAAO,QAAQ,QAAS,MAAQ;SAC1D;AAGN,YAAO,KAAK,MAAM;AAClB;;SAGD,QAAO,KAAK,MAAM;;AAGpB,SAAO;;;;;;;;;;CAWR,MAAM,cAAa,eAAc,OAAO,cAAc,GAAG,WAAW;;;;;;;;;;CAWpE,MAAM,eAAe,SAAS,WAAW;AACxC,MAAI,aAAa,MAAQ,YAAY,GACpC,QAAO,MAAM,YAAY;AAE1B,MAAI,aAAa,MAAQ,YAAY,GACpC,QAAO,YAAY;AAEpB,MAAI,aAAa,MAAQ,YAAY,IACpC,QAAO,YAAY;AAEpB,SAAO;;;;;;;;;;;;;CAcR,MAAM,eAAe,SAAS,OAAO,MAAM;AAG1C,SAAO,QAAQ,KAAK,MAAM,QAAQ,QAAQ,QAAQ,MAAM;;;;;;;CAQzD,MAAM,QAAQ,SAAS,OAAO,WAAW,WAAW;EACnD,IAAI,IAAI;AACR,UAAQ,YAAY,MAAM,QAAQ,KAAK,GAAG,SAAS;AACnD,WAAS,MAAM,QAAQ,UAAU;AACjC,SAA8B,QAAQ,gBAAgB,QAAQ,GAAG,KAAK,KACrE,SAAQ,MAAM,QAAQ,cAAc;AAErC,SAAO,MAAM,KAAK,gBAAgB,KAAK,SAAS,QAAQ,MAAM;;;;;;;;;CAU/D,MAAM,SAAS,SAAS,OAAO;EAE9B,MAAM,SAAS,EAAE;EACjB,MAAM,cAAc,MAAM;EAC1B,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,OAAO;EAMX,IAAI,QAAQ,MAAM,YAAY,UAAU;AACxC,MAAI,QAAQ,EACX,SAAQ;AAGT,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,EAAE,GAAG;AAE/B,OAAI,MAAM,WAAW,EAAE,IAAI,IAC1B,OAAM,YAAY;AAEnB,UAAO,KAAK,MAAM,WAAW,EAAE,CAAC;;AAMjC,OAAK,IAAI,QAAQ,QAAQ,IAAI,QAAQ,IAAI,GAAG,QAAQ,cAAwC;GAO3F,MAAM,OAAO;AACb,QAAK,IAAI,IAAI,GAAG,IAAI,OAA0B,KAAK,MAAM;AAExD,QAAI,SAAS,YACZ,OAAM,gBAAgB;IAGvB,MAAM,QAAQ,aAAa,MAAM,WAAW,QAAQ,CAAC;AAErD,QAAI,SAAS,KACZ,OAAM,gBAAgB;AAEvB,QAAI,QAAQ,OAAO,SAAS,KAAK,EAAE,CAClC,OAAM,WAAW;AAGlB,SAAK,QAAQ;IACb,MAAM,IAAI,KAAK,OAAO,OAAQ,KAAK,OAAO,OAAO,OAAO,IAAI;AAE5D,QAAI,QAAQ,EACX;IAGD,MAAM,aAAa,OAAO;AAC1B,QAAI,IAAI,MAAM,SAAS,WAAW,CACjC,OAAM,WAAW;AAGlB,SAAK;;GAIN,MAAM,MAAM,OAAO,SAAS;AAC5B,UAAO,MAAM,IAAI,MAAM,KAAK,QAAQ,EAAE;AAItC,OAAI,MAAM,IAAI,IAAI,GAAG,SAAS,EAC7B,OAAM,WAAW;AAGlB,QAAK,MAAM,IAAI,IAAI;AACnB,QAAK;AAGL,UAAO,OAAO,KAAK,GAAG,EAAE;;AAIzB,SAAO,OAAO,cAAc,GAAG,OAAO;;;;;;;;;CAUvC,MAAM,SAAS,SAAS,OAAO;EAC9B,MAAM,SAAS,EAAE;AAGjB,UAAQ,WAAW,MAAM;EAGzB,MAAM,cAAc,MAAM;EAG1B,IAAI,IAAI;EACR,IAAI,QAAQ;EACZ,IAAI,OAAO;AAGX,OAAK,MAAM,gBAAgB,MAC1B,KAAI,eAAe,IAClB,QAAO,KAAK,mBAAmB,aAAa,CAAC;EAI/C,MAAM,cAAc,OAAO;EAC3B,IAAI,iBAAiB;AAMrB,MAAI,YACH,QAAO,KAAK,UAAU;AAIvB,SAAO,iBAAiB,aAAa;GAIpC,IAAI,IAAI;AACR,QAAK,MAAM,gBAAgB,MAC1B,KAAI,gBAAgB,KAAK,eAAe,EACvC,KAAI;GAMN,MAAM,wBAAwB,iBAAiB;AAC/C,OAAI,IAAI,IAAI,OAAO,SAAS,SAAS,sBAAsB,CAC1D,OAAM,WAAW;AAGlB,aAAU,IAAI,KAAK;AACnB,OAAI;AAEJ,QAAK,MAAM,gBAAgB,OAAO;AACjC,QAAI,eAAe,KAAK,EAAE,QAAQ,OACjC,OAAM,WAAW;AAElB,QAAI,iBAAiB,GAAG;KAEvB,IAAI,IAAI;AACR,UAAK,IAAI,IAAI,OAA0B,KAAK,MAAM;MACjD,MAAM,IAAI,KAAK,OAAO,OAAQ,KAAK,OAAO,OAAO,OAAO,IAAI;AAC5D,UAAI,IAAI,EACP;MAED,MAAM,UAAU,IAAI;MACpB,MAAM,aAAa,OAAO;AAC1B,aAAO,KACN,mBAAmB,aAAa,IAAI,UAAU,YAAY,EAAE,CAAC,CAC7D;AACD,UAAI,MAAM,UAAU,WAAW;;AAGhC,YAAO,KAAK,mBAAmB,aAAa,GAAG,EAAE,CAAC,CAAC;AACnD,YAAO,MAAM,OAAO,uBAAuB,mBAAmB,YAAY;AAC1E,aAAQ;AACR,OAAE;;;AAIJ,KAAE;AACF,KAAE;;AAGH,SAAO,OAAO,KAAK,GAAG;;;;;;;;;;;;;CAcvB,MAAM,YAAY,SAAS,OAAO;AACjC,SAAO,UAAU,OAAO,SAAS,QAAQ;AACxC,UAAO,cAAc,KAAK,OAAO,GAC9B,OAAO,OAAO,MAAM,EAAE,CAAC,aAAa,CAAC,GACrC;IACF;;;;;;;;;;;;;CAcH,MAAM,UAAU,SAAS,OAAO;AAC/B,SAAO,UAAU,OAAO,SAAS,QAAQ;AACxC,UAAO,cAAc,KAAK,OAAO,GAC9B,SAAS,OAAO,OAAO,GACvB;IACF;;;CAMH,MAAM,WAAW;EAMhB,WAAW;EAQX,QAAQ;GACP,UAAU;GACV,UAAU;GACV;EACD,UAAU;EACV,UAAU;EACV,WAAW;EACX,aAAa;EACb;AAED,QAAO,UAAU"}

package/dist/node_modules/.pnpm/sparse-bitfield@3.0.3/node_modules/sparse-bitfield/index.mjs

@@ -0,0 +1,81 @@
+import { __commonJSMin } from "../../../../../_virtual/rolldown_runtime.mjs";
+import { require_memory_pager } from "../../../memory-pager@1.5.0/node_modules/memory-pager/index.mjs";
+
+//#region ../../node_modules/.pnpm/sparse-bitfield@3.0.3/node_modules/sparse-bitfield/index.js
+var require_sparse_bitfield = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	var pager = require_memory_pager();
+	module.exports = Bitfield;
+	function Bitfield(opts) {
+		if (!(this instanceof Bitfield)) return new Bitfield(opts);
+		if (!opts) opts = {};
+		if (Buffer.isBuffer(opts)) opts = { buffer: opts };
+		this.pageOffset = opts.pageOffset || 0;
+		this.pageSize = opts.pageSize || 1024;
+		this.pages = opts.pages || pager(this.pageSize);
+		this.byteLength = this.pages.length * this.pageSize;
+		this.length = 8 * this.byteLength;
+		if (!powerOfTwo(this.pageSize)) throw new Error("The page size should be a power of two");
+		this._trackUpdates = !!opts.trackUpdates;
+		this._pageMask = this.pageSize - 1;
+		if (opts.buffer) {
+			for (var i = 0; i < opts.buffer.length; i += this.pageSize) this.pages.set(i / this.pageSize, opts.buffer.slice(i, i + this.pageSize));
+			this.byteLength = opts.buffer.length;
+			this.length = 8 * this.byteLength;
+		}
+	}
+	Bitfield.prototype.get = function(i) {
+		var o = i & 7;
+		var j = (i - o) / 8;
+		return !!(this.getByte(j) & 128 >> o);
+	};
+	Bitfield.prototype.getByte = function(i) {
+		var o = i & this._pageMask;
+		var j = (i - o) / this.pageSize;
+		var page = this.pages.get(j, true);
+		return page ? page.buffer[o + this.pageOffset] : 0;
+	};
+	Bitfield.prototype.set = function(i, v) {
+		var o = i & 7;
+		var j = (i - o) / 8;
+		var b = this.getByte(j);
+		return this.setByte(j, v ? b | 128 >> o : b & (255 ^ 128 >> o));
+	};
+	Bitfield.prototype.toBuffer = function() {
+		var all = alloc(this.pages.length * this.pageSize);
+		for (var i = 0; i < this.pages.length; i++) {
+			var next = this.pages.get(i, true);
+			var allOffset = i * this.pageSize;
+			if (next) next.buffer.copy(all, allOffset, this.pageOffset, this.pageOffset + this.pageSize);
+		}
+		return all;
+	};
+	Bitfield.prototype.setByte = function(i, b) {
+		var o = i & this._pageMask;
+		var j = (i - o) / this.pageSize;
+		var page = this.pages.get(j, false);
+		o += this.pageOffset;
+		if (page.buffer[o] === b) return false;
+		page.buffer[o] = b;
+		if (i >= this.byteLength) {
+			this.byteLength = i + 1;
+			this.length = this.byteLength * 8;
+		}
+		if (this._trackUpdates) this.pages.updated(page);
+		return true;
+	};
+	function alloc(n) {
+		if (Buffer.alloc) return Buffer.alloc(n);
+		var b = new Buffer(n);
+		b.fill(0);
+		return b;
+	}
+	function powerOfTwo(x) {
+		return !(x & x - 1);
+	}
+}));
+
+//#endregion
+export default require_sparse_bitfield();
+
+export { require_sparse_bitfield };
+//# sourceMappingURL=index.mjs.map

package/dist/node_modules/.pnpm/sparse-bitfield@3.0.3/node_modules/sparse-bitfield/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":[],"sources":["../../../../../../../../node_modules/.pnpm/sparse-bitfield@3.0.3/node_modules/sparse-bitfield/index.js"],"sourcesContent":["var pager = require('memory-pager')\n\nmodule.exports = Bitfield\n\nfunction Bitfield (opts) {\n  if (!(this instanceof Bitfield)) return new Bitfield(opts)\n  if (!opts) opts = {}\n  if (Buffer.isBuffer(opts)) opts = {buffer: opts}\n\n  this.pageOffset = opts.pageOffset || 0\n  this.pageSize = opts.pageSize || 1024\n  this.pages = opts.pages || pager(this.pageSize)\n\n  this.byteLength = this.pages.length * this.pageSize\n  this.length = 8 * this.byteLength\n\n  if (!powerOfTwo(this.pageSize)) throw new Error('The page size should be a power of two')\n\n  this._trackUpdates = !!opts.trackUpdates\n  this._pageMask = this.pageSize - 1\n\n  if (opts.buffer) {\n    for (var i = 0; i < opts.buffer.length; i += this.pageSize) {\n      this.pages.set(i / this.pageSize, opts.buffer.slice(i, i + this.pageSize))\n    }\n    this.byteLength = opts.buffer.length\n    this.length = 8 * this.byteLength\n  }\n}\n\nBitfield.prototype.get = function (i) {\n  var o = i & 7\n  var j = (i - o) / 8\n\n  return !!(this.getByte(j) & (128 >> o))\n}\n\nBitfield.prototype.getByte = function (i) {\n  var o = i & this._pageMask\n  var j = (i - o) / this.pageSize\n  var page = this.pages.get(j, true)\n\n  return page ? page.buffer[o + this.pageOffset] : 0\n}\n\nBitfield.prototype.set = function (i, v) {\n  var o = i & 7\n  var j = (i - o) / 8\n  var b = this.getByte(j)\n\n  return this.setByte(j, v ? b | (128 >> o) : b & (255 ^ (128 >> o)))\n}\n\nBitfield.prototype.toBuffer = function () {\n  var all = alloc(this.pages.length * this.pageSize)\n\n  for (var i = 0; i < this.pages.length; i++) {\n    var next = this.pages.get(i, true)\n    var allOffset = i * this.pageSize\n    if (next) next.buffer.copy(all, allOffset, this.pageOffset, this.pageOffset + this.pageSize)\n  }\n\n  return all\n}\n\nBitfield.prototype.setByte = function (i, b) {\n  var o = i & this._pageMask\n  var j = (i - o) / this.pageSize\n  var page = this.pages.get(j, false)\n\n  o += this.pageOffset\n\n  if (page.buffer[o] === b) return false\n  page.buffer[o] = b\n\n  if (i >= this.byteLength) {\n    this.byteLength = i + 1\n    this.length = this.byteLength * 8\n  }\n\n  if (this._trackUpdates) this.pages.updated(page)\n\n  return true\n}\n\nfunction alloc (n) {\n  if (Buffer.alloc) return Buffer.alloc(n)\n  var b = new Buffer(n)\n  b.fill(0)\n  return b\n}\n\nfunction powerOfTwo (x) {\n  return !(x & (x - 1))\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI;AAEJ,QAAO,UAAU;CAEjB,SAAS,SAAU,MAAM;AACvB,MAAI,EAAE,gBAAgB,UAAW,QAAO,IAAI,SAAS,KAAK;AAC1D,MAAI,CAAC,KAAM,QAAO,EAAE;AACpB,MAAI,OAAO,SAAS,KAAK,CAAE,QAAO,EAAC,QAAQ,MAAK;AAEhD,OAAK,aAAa,KAAK,cAAc;AACrC,OAAK,WAAW,KAAK,YAAY;AACjC,OAAK,QAAQ,KAAK,SAAS,MAAM,KAAK,SAAS;AAE/C,OAAK,aAAa,KAAK,MAAM,SAAS,KAAK;AAC3C,OAAK,SAAS,IAAI,KAAK;AAEvB,MAAI,CAAC,WAAW,KAAK,SAAS,CAAE,OAAM,IAAI,MAAM,yCAAyC;AAEzF,OAAK,gBAAgB,CAAC,CAAC,KAAK;AAC5B,OAAK,YAAY,KAAK,WAAW;AAEjC,MAAI,KAAK,QAAQ;AACf,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,QAAQ,KAAK,KAAK,SAChD,MAAK,MAAM,IAAI,IAAI,KAAK,UAAU,KAAK,OAAO,MAAM,GAAG,IAAI,KAAK,SAAS,CAAC;AAE5E,QAAK,aAAa,KAAK,OAAO;AAC9B,QAAK,SAAS,IAAI,KAAK;;;AAI3B,UAAS,UAAU,MAAM,SAAU,GAAG;EACpC,IAAI,IAAI,IAAI;EACZ,IAAI,KAAK,IAAI,KAAK;AAElB,SAAO,CAAC,EAAE,KAAK,QAAQ,EAAE,GAAI,OAAO;;AAGtC,UAAS,UAAU,UAAU,SAAU,GAAG;EACxC,IAAI,IAAI,IAAI,KAAK;EACjB,IAAI,KAAK,IAAI,KAAK,KAAK;EACvB,IAAI,OAAO,KAAK,MAAM,IAAI,GAAG,KAAK;AAElC,SAAO,OAAO,KAAK,OAAO,IAAI,KAAK,cAAc;;AAGnD,UAAS,UAAU,MAAM,SAAU,GAAG,GAAG;EACvC,IAAI,IAAI,IAAI;EACZ,IAAI,KAAK,IAAI,KAAK;EAClB,IAAI,IAAI,KAAK,QAAQ,EAAE;AAEvB,SAAO,KAAK,QAAQ,GAAG,IAAI,IAAK,OAAO,IAAK,KAAK,MAAO,OAAO,GAAI;;AAGrE,UAAS,UAAU,WAAW,WAAY;EACxC,IAAI,MAAM,MAAM,KAAK,MAAM,SAAS,KAAK,SAAS;AAElD,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KAAK;GAC1C,IAAI,OAAO,KAAK,MAAM,IAAI,GAAG,KAAK;GAClC,IAAI,YAAY,IAAI,KAAK;AACzB,OAAI,KAAM,MAAK,OAAO,KAAK,KAAK,WAAW,KAAK,YAAY,KAAK,aAAa,KAAK,SAAS;;AAG9F,SAAO;;AAGT,UAAS,UAAU,UAAU,SAAU,GAAG,GAAG;EAC3C,IAAI,IAAI,IAAI,KAAK;EACjB,IAAI,KAAK,IAAI,KAAK,KAAK;EACvB,IAAI,OAAO,KAAK,MAAM,IAAI,GAAG,MAAM;AAEnC,OAAK,KAAK;AAEV,MAAI,KAAK,OAAO,OAAO,EAAG,QAAO;AACjC,OAAK,OAAO,KAAK;AAEjB,MAAI,KAAK,KAAK,YAAY;AACxB,QAAK,aAAa,IAAI;AACtB,QAAK,SAAS,KAAK,aAAa;;AAGlC,MAAI,KAAK,cAAe,MAAK,MAAM,QAAQ,KAAK;AAEhD,SAAO;;CAGT,SAAS,MAAO,GAAG;AACjB,MAAI,OAAO,MAAO,QAAO,OAAO,MAAM,EAAE;EACxC,IAAI,IAAI,IAAI,OAAO,EAAE;AACrB,IAAE,KAAK,EAAE;AACT,SAAO;;CAGT,SAAS,WAAY,GAAG;AACtB,SAAO,EAAE,IAAK,IAAI"}

package/dist/node_modules/.pnpm/tr46@5.1.1/node_modules/tr46/index.mjs

@@ -0,0 +1,206 @@
+import { __commonJSMin } from "../../../../../_virtual/rolldown_runtime.mjs";
+import { require_punycode } from "../../../punycode@2.3.1/node_modules/punycode/punycode.mjs";
+import { require_regexes } from "./lib/regexes.mjs";
+import { require_mappingTable } from "./lib/mappingTable.mjs";
+import { require_statusMapping } from "./lib/statusMapping.mjs";
+
+//#region ../../node_modules/.pnpm/tr46@5.1.1/node_modules/tr46/index.js
+var require_tr46 = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	const punycode = require_punycode();
+	const regexes = require_regexes();
+	const mappingTable = require_mappingTable();
+	const { STATUS_MAPPING } = require_statusMapping();
+	function containsNonASCII(str) {
+		return /[^\x00-\x7F]/u.test(str);
+	}
+	function findStatus(val) {
+		let start = 0;
+		let end = mappingTable.length - 1;
+		while (start <= end) {
+			const mid = Math.floor((start + end) / 2);
+			const target = mappingTable[mid];
+			const min = Array.isArray(target[0]) ? target[0][0] : target[0];
+			const max = Array.isArray(target[0]) ? target[0][1] : target[0];
+			if (min <= val && max >= val) return target.slice(1);
+			else if (min > val) end = mid - 1;
+			else start = mid + 1;
+		}
+		return null;
+	}
+	function mapChars(domainName, { transitionalProcessing }) {
+		let processed = "";
+		for (const ch of domainName) {
+			const [status, mapping] = findStatus(ch.codePointAt(0));
+			switch (status) {
+				case STATUS_MAPPING.disallowed:
+					processed += ch;
+					break;
+				case STATUS_MAPPING.ignored: break;
+				case STATUS_MAPPING.mapped:
+					if (transitionalProcessing && ch === "ẞ") processed += "ss";
+					else processed += mapping;
+					break;
+				case STATUS_MAPPING.deviation:
+					if (transitionalProcessing) processed += mapping;
+					else processed += ch;
+					break;
+				case STATUS_MAPPING.valid:
+					processed += ch;
+					break;
+			}
+		}
+		return processed;
+	}
+	function validateLabel(label, { checkHyphens, checkBidi, checkJoiners, transitionalProcessing, useSTD3ASCIIRules, isBidi }) {
+		if (label.length === 0) return true;
+		if (label.normalize("NFC") !== label) return false;
+		const codePoints = Array.from(label);
+		if (checkHyphens) {
+			if (codePoints[2] === "-" && codePoints[3] === "-" || label.startsWith("-") || label.endsWith("-")) return false;
+		}
+		if (!checkHyphens) {
+			if (label.startsWith("xn--")) return false;
+		}
+		if (label.includes(".")) return false;
+		if (regexes.combiningMarks.test(codePoints[0])) return false;
+		for (const ch of codePoints) {
+			const codePoint = ch.codePointAt(0);
+			const [status] = findStatus(codePoint);
+			if (transitionalProcessing) {
+				if (status !== STATUS_MAPPING.valid) return false;
+			} else if (status !== STATUS_MAPPING.valid && status !== STATUS_MAPPING.deviation) return false;
+			if (useSTD3ASCIIRules && codePoint <= 127) {
+				if (!/^(?:[a-z]|[0-9]|-)$/u.test(ch)) return false;
+			}
+		}
+		if (checkJoiners) {
+			let last = 0;
+			for (const [i, ch] of codePoints.entries()) if (ch === "‌" || ch === "‍") {
+				if (i > 0) {
+					if (regexes.combiningClassVirama.test(codePoints[i - 1])) continue;
+					if (ch === "‌") {
+						const next = codePoints.indexOf("‌", i + 1);
+						const test = next < 0 ? codePoints.slice(last) : codePoints.slice(last, next);
+						if (regexes.validZWNJ.test(test.join(""))) {
+							last = i + 1;
+							continue;
+						}
+					}
+				}
+				return false;
+			}
+		}
+		if (checkBidi && isBidi) {
+			let rtl;
+			if (regexes.bidiS1LTR.test(codePoints[0])) rtl = false;
+			else if (regexes.bidiS1RTL.test(codePoints[0])) rtl = true;
+			else return false;
+			if (rtl) {
+				if (!regexes.bidiS2.test(label) || !regexes.bidiS3.test(label) || regexes.bidiS4EN.test(label) && regexes.bidiS4AN.test(label)) return false;
+			} else if (!regexes.bidiS5.test(label) || !regexes.bidiS6.test(label)) return false;
+		}
+		return true;
+	}
+	function isBidiDomain(labels) {
+		const domain = labels.map((label) => {
+			if (label.startsWith("xn--")) try {
+				return punycode.decode(label.substring(4));
+			} catch {
+				return "";
+			}
+			return label;
+		}).join(".");
+		return regexes.bidiDomain.test(domain);
+	}
+	function processing(domainName, options) {
+		let string = mapChars(domainName, options);
+		string = string.normalize("NFC");
+		const labels = string.split(".");
+		const isBidi = isBidiDomain(labels);
+		let error = false;
+		for (const [i, origLabel] of labels.entries()) {
+			let label = origLabel;
+			let transitionalProcessingForThisLabel = options.transitionalProcessing;
+			if (label.startsWith("xn--")) {
+				if (containsNonASCII(label)) {
+					error = true;
+					continue;
+				}
+				try {
+					label = punycode.decode(label.substring(4));
+				} catch {
+					if (!options.ignoreInvalidPunycode) {
+						error = true;
+						continue;
+					}
+				}
+				labels[i] = label;
+				if (label === "" || !containsNonASCII(label)) error = true;
+				transitionalProcessingForThisLabel = false;
+			}
+			if (error) continue;
+			if (!validateLabel(label, {
+				...options,
+				transitionalProcessing: transitionalProcessingForThisLabel,
+				isBidi
+			})) error = true;
+		}
+		return {
+			string: labels.join("."),
+			error
+		};
+	}
+	function toASCII(domainName, { checkHyphens = false, checkBidi = false, checkJoiners = false, useSTD3ASCIIRules = false, verifyDNSLength = false, transitionalProcessing = false, ignoreInvalidPunycode = false } = {}) {
+		const result = processing(domainName, {
+			checkHyphens,
+			checkBidi,
+			checkJoiners,
+			useSTD3ASCIIRules,
+			transitionalProcessing,
+			ignoreInvalidPunycode
+		});
+		let labels = result.string.split(".");
+		labels = labels.map((l) => {
+			if (containsNonASCII(l)) try {
+				return `xn--${punycode.encode(l)}`;
+			} catch {
+				result.error = true;
+			}
+			return l;
+		});
+		if (verifyDNSLength) {
+			const total = labels.join(".").length;
+			if (total > 253 || total === 0) result.error = true;
+			for (let i = 0; i < labels.length; ++i) if (labels[i].length > 63 || labels[i].length === 0) {
+				result.error = true;
+				break;
+			}
+		}
+		if (result.error) return null;
+		return labels.join(".");
+	}
+	function toUnicode(domainName, { checkHyphens = false, checkBidi = false, checkJoiners = false, useSTD3ASCIIRules = false, transitionalProcessing = false, ignoreInvalidPunycode = false } = {}) {
+		const result = processing(domainName, {
+			checkHyphens,
+			checkBidi,
+			checkJoiners,
+			useSTD3ASCIIRules,
+			transitionalProcessing,
+			ignoreInvalidPunycode
+		});
+		return {
+			domain: result.string,
+			error: result.error
+		};
+	}
+	module.exports = {
+		toASCII,
+		toUnicode
+	};
+}));
+
+//#endregion
+export default require_tr46();
+
+export { require_tr46 };
+//# sourceMappingURL=index.mjs.map

package/dist/node_modules/.pnpm/tr46@5.1.1/node_modules/tr46/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":[],"sources":["../../../../../../../../node_modules/.pnpm/tr46@5.1.1/node_modules/tr46/index.js"],"sourcesContent":["\"use strict\";\n\nconst punycode = require(\"punycode/\");\nconst regexes = require(\"./lib/regexes.js\");\nconst mappingTable = require(\"./lib/mappingTable.json\");\nconst { STATUS_MAPPING } = require(\"./lib/statusMapping.js\");\n\nfunction containsNonASCII(str) {\n  return /[^\\x00-\\x7F]/u.test(str);\n}\n\nfunction findStatus(val) {\n  let start = 0;\n  let end = mappingTable.length - 1;\n\n  while (start <= end) {\n    const mid = Math.floor((start + end) / 2);\n\n    const target = mappingTable[mid];\n    const min = Array.isArray(target[0]) ? target[0][0] : target[0];\n    const max = Array.isArray(target[0]) ? target[0][1] : target[0];\n\n    if (min <= val && max >= val) {\n      return target.slice(1);\n    } else if (min > val) {\n      end = mid - 1;\n    } else {\n      start = mid + 1;\n    }\n  }\n\n  return null;\n}\n\nfunction mapChars(domainName, { transitionalProcessing }) {\n  let processed = \"\";\n\n  for (const ch of domainName) {\n    const [status, mapping] = findStatus(ch.codePointAt(0));\n\n    switch (status) {\n      case STATUS_MAPPING.disallowed:\n        processed += ch;\n        break;\n      case STATUS_MAPPING.ignored:\n        break;\n      case STATUS_MAPPING.mapped:\n        if (transitionalProcessing && ch === \"ẞ\") {\n          processed += \"ss\";\n        } else {\n          processed += mapping;\n        }\n        break;\n      case STATUS_MAPPING.deviation:\n        if (transitionalProcessing) {\n          processed += mapping;\n        } else {\n          processed += ch;\n        }\n        break;\n      case STATUS_MAPPING.valid:\n        processed += ch;\n        break;\n    }\n  }\n\n  return processed;\n}\n\nfunction validateLabel(label, {\n  checkHyphens,\n  checkBidi,\n  checkJoiners,\n  transitionalProcessing,\n  useSTD3ASCIIRules,\n  isBidi\n}) {\n  // \"must be satisfied for a non-empty label\"\n  if (label.length === 0) {\n    return true;\n  }\n\n  // \"1. The label must be in Unicode Normalization Form NFC.\"\n  if (label.normalize(\"NFC\") !== label) {\n    return false;\n  }\n\n  const codePoints = Array.from(label);\n\n  // \"2. If CheckHyphens, the label must not contain a U+002D HYPHEN-MINUS character in both the\n  // third and fourth positions.\"\n  //\n  // \"3. If CheckHyphens, the label must neither begin nor end with a U+002D HYPHEN-MINUS character.\"\n  if (checkHyphens) {\n    if ((codePoints[2] === \"-\" && codePoints[3] === \"-\") ||\n        (label.startsWith(\"-\") || label.endsWith(\"-\"))) {\n      return false;\n    }\n  }\n\n  // \"4. If not CheckHyphens, the label must not begin with “xn--”.\"\n  if (!checkHyphens) {\n    if (label.startsWith(\"xn--\")) {\n      return false;\n    }\n  }\n\n  // \"5. The label must not contain a U+002E ( . ) FULL STOP.\"\n  if (label.includes(\".\")) {\n    return false;\n  }\n\n  // \"6. The label must not begin with a combining mark, that is: General_Category=Mark.\"\n  if (regexes.combiningMarks.test(codePoints[0])) {\n    return false;\n  }\n\n  // \"7. Each code point in the label must only have certain Status values according to Section 5\"\n  for (const ch of codePoints) {\n    const codePoint = ch.codePointAt(0);\n    const [status] = findStatus(codePoint);\n    if (transitionalProcessing) {\n      // \"For Transitional Processing (deprecated), each value must be valid.\"\n      if (status !== STATUS_MAPPING.valid) {\n        return false;\n      }\n    } else if (status !== STATUS_MAPPING.valid && status !== STATUS_MAPPING.deviation) {\n      // \"For Nontransitional Processing, each value must be either valid or deviation.\"\n      return false;\n    }\n    // \"In addition, if UseSTD3ASCIIRules=true and the code point is an ASCII code point (U+0000..U+007F), then it must\n    // be a lowercase letter (a-z), a digit (0-9), or a hyphen-minus (U+002D). (Note: This excludes uppercase ASCII\n    // A-Z which are mapped in UTS #46 and disallowed in IDNA2008.)\"\n    if (useSTD3ASCIIRules && codePoint <= 0x7F) {\n      if (!/^(?:[a-z]|[0-9]|-)$/u.test(ch)) {\n        return false;\n      }\n    }\n  }\n\n  // \"8. If CheckJoiners, the label must satisify the ContextJ rules\"\n  // https://tools.ietf.org/html/rfc5892#appendix-A\n  if (checkJoiners) {\n    let last = 0;\n    for (const [i, ch] of codePoints.entries()) {\n      if (ch === \"\\u200C\" || ch === \"\\u200D\") {\n        if (i > 0) {\n          if (regexes.combiningClassVirama.test(codePoints[i - 1])) {\n            continue;\n          }\n          if (ch === \"\\u200C\") {\n            // TODO: make this more efficient\n            const next = codePoints.indexOf(\"\\u200C\", i + 1);\n            const test = next < 0 ? codePoints.slice(last) : codePoints.slice(last, next);\n            if (regexes.validZWNJ.test(test.join(\"\"))) {\n              last = i + 1;\n              continue;\n            }\n          }\n        }\n        return false;\n      }\n    }\n  }\n\n  // \"9. If CheckBidi, and if the domain name is a Bidi domain name, then the label must satisfy...\"\n  // https://tools.ietf.org/html/rfc5893#section-2\n  if (checkBidi && isBidi) {\n    let rtl;\n\n    // 1\n    if (regexes.bidiS1LTR.test(codePoints[0])) {\n      rtl = false;\n    } else if (regexes.bidiS1RTL.test(codePoints[0])) {\n      rtl = true;\n    } else {\n      return false;\n    }\n\n    if (rtl) {\n      // 2-4\n      if (!regexes.bidiS2.test(label) ||\n          !regexes.bidiS3.test(label) ||\n          (regexes.bidiS4EN.test(label) && regexes.bidiS4AN.test(label))) {\n        return false;\n      }\n    } else if (!regexes.bidiS5.test(label) ||\n               !regexes.bidiS6.test(label)) { // 5-6\n      return false;\n    }\n  }\n\n  return true;\n}\n\nfunction isBidiDomain(labels) {\n  const domain = labels.map(label => {\n    if (label.startsWith(\"xn--\")) {\n      try {\n        return punycode.decode(label.substring(4));\n      } catch {\n        return \"\";\n      }\n    }\n    return label;\n  }).join(\".\");\n  return regexes.bidiDomain.test(domain);\n}\n\nfunction processing(domainName, options) {\n  // 1. Map.\n  let string = mapChars(domainName, options);\n\n  // 2. Normalize.\n  string = string.normalize(\"NFC\");\n\n  // 3. Break.\n  const labels = string.split(\".\");\n  const isBidi = isBidiDomain(labels);\n\n  // 4. Convert/Validate.\n  let error = false;\n  for (const [i, origLabel] of labels.entries()) {\n    let label = origLabel;\n    let transitionalProcessingForThisLabel = options.transitionalProcessing;\n    if (label.startsWith(\"xn--\")) {\n      if (containsNonASCII(label)) {\n        error = true;\n        continue;\n      }\n\n      try {\n        label = punycode.decode(label.substring(4));\n      } catch {\n        if (!options.ignoreInvalidPunycode) {\n          error = true;\n          continue;\n        }\n      }\n      labels[i] = label;\n\n      if (label === \"\" || !containsNonASCII(label)) {\n        error = true;\n      }\n\n      transitionalProcessingForThisLabel = false;\n    }\n\n    // No need to validate if we already know there is an error.\n    if (error) {\n      continue;\n    }\n    const validation = validateLabel(label, {\n      ...options,\n      transitionalProcessing: transitionalProcessingForThisLabel,\n      isBidi\n    });\n    if (!validation) {\n      error = true;\n    }\n  }\n\n  return {\n    string: labels.join(\".\"),\n    error\n  };\n}\n\nfunction toASCII(domainName, {\n  checkHyphens = false,\n  checkBidi = false,\n  checkJoiners = false,\n  useSTD3ASCIIRules = false,\n  verifyDNSLength = false,\n  transitionalProcessing = false,\n  ignoreInvalidPunycode = false\n} = {}) {\n  const result = processing(domainName, {\n    checkHyphens,\n    checkBidi,\n    checkJoiners,\n    useSTD3ASCIIRules,\n    transitionalProcessing,\n    ignoreInvalidPunycode\n  });\n  let labels = result.string.split(\".\");\n  labels = labels.map(l => {\n    if (containsNonASCII(l)) {\n      try {\n        return `xn--${punycode.encode(l)}`;\n      } catch {\n        result.error = true;\n      }\n    }\n    return l;\n  });\n\n  if (verifyDNSLength) {\n    const total = labels.join(\".\").length;\n    if (total > 253 || total === 0) {\n      result.error = true;\n    }\n\n    for (let i = 0; i < labels.length; ++i) {\n      if (labels[i].length > 63 || labels[i].length === 0) {\n        result.error = true;\n        break;\n      }\n    }\n  }\n\n  if (result.error) {\n    return null;\n  }\n  return labels.join(\".\");\n}\n\nfunction toUnicode(domainName, {\n  checkHyphens = false,\n  checkBidi = false,\n  checkJoiners = false,\n  useSTD3ASCIIRules = false,\n  transitionalProcessing = false,\n  ignoreInvalidPunycode = false\n} = {}) {\n  const result = processing(domainName, {\n    checkHyphens,\n    checkBidi,\n    checkJoiners,\n    useSTD3ASCIIRules,\n    transitionalProcessing,\n    ignoreInvalidPunycode\n  });\n\n  return {\n    domain: result.string,\n    error: result.error\n  };\n}\n\nmodule.exports = {\n  toASCII,\n  toUnicode\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;CAEA,MAAM;CACN,MAAM;CACN,MAAM;CACN,MAAM,EAAE;CAER,SAAS,iBAAiB,KAAK;AAC7B,SAAO,gBAAgB,KAAK,IAAI;;CAGlC,SAAS,WAAW,KAAK;EACvB,IAAI,QAAQ;EACZ,IAAI,MAAM,aAAa,SAAS;AAEhC,SAAO,SAAS,KAAK;GACnB,MAAM,MAAM,KAAK,OAAO,QAAQ,OAAO,EAAE;GAEzC,MAAM,SAAS,aAAa;GAC5B,MAAM,MAAM,MAAM,QAAQ,OAAO,GAAG,GAAG,OAAO,GAAG,KAAK,OAAO;GAC7D,MAAM,MAAM,MAAM,QAAQ,OAAO,GAAG,GAAG,OAAO,GAAG,KAAK,OAAO;AAE7D,OAAI,OAAO,OAAO,OAAO,IACvB,QAAO,OAAO,MAAM,EAAE;YACb,MAAM,IACf,OAAM,MAAM;OAEZ,SAAQ,MAAM;;AAIlB,SAAO;;CAGT,SAAS,SAAS,YAAY,EAAE,0BAA0B;EACxD,IAAI,YAAY;AAEhB,OAAK,MAAM,MAAM,YAAY;GAC3B,MAAM,CAAC,QAAQ,WAAW,WAAW,GAAG,YAAY,EAAE,CAAC;AAEvD,WAAQ,QAAR;IACE,KAAK,eAAe;AAClB,kBAAa;AACb;IACF,KAAK,eAAe,QAClB;IACF,KAAK,eAAe;AAClB,SAAI,0BAA0B,OAAO,IACnC,cAAa;SAEb,cAAa;AAEf;IACF,KAAK,eAAe;AAClB,SAAI,uBACF,cAAa;SAEb,cAAa;AAEf;IACF,KAAK,eAAe;AAClB,kBAAa;AACb;;;AAIN,SAAO;;CAGT,SAAS,cAAc,OAAO,EAC5B,cACA,WACA,cACA,wBACA,mBACA,UACC;AAED,MAAI,MAAM,WAAW,EACnB,QAAO;AAIT,MAAI,MAAM,UAAU,MAAM,KAAK,MAC7B,QAAO;EAGT,MAAM,aAAa,MAAM,KAAK,MAAM;AAMpC,MAAI,cACF;OAAK,WAAW,OAAO,OAAO,WAAW,OAAO,OAC3C,MAAM,WAAW,IAAI,IAAI,MAAM,SAAS,IAAI,CAC/C,QAAO;;AAKX,MAAI,CAAC,cACH;OAAI,MAAM,WAAW,OAAO,CAC1B,QAAO;;AAKX,MAAI,MAAM,SAAS,IAAI,CACrB,QAAO;AAIT,MAAI,QAAQ,eAAe,KAAK,WAAW,GAAG,CAC5C,QAAO;AAIT,OAAK,MAAM,MAAM,YAAY;GAC3B,MAAM,YAAY,GAAG,YAAY,EAAE;GACnC,MAAM,CAAC,UAAU,WAAW,UAAU;AACtC,OAAI,wBAEF;QAAI,WAAW,eAAe,MAC5B,QAAO;cAEA,WAAW,eAAe,SAAS,WAAW,eAAe,UAEtE,QAAO;AAKT,OAAI,qBAAqB,aAAa,KACpC;QAAI,CAAC,uBAAuB,KAAK,GAAG,CAClC,QAAO;;;AAOb,MAAI,cAAc;GAChB,IAAI,OAAO;AACX,QAAK,MAAM,CAAC,GAAG,OAAO,WAAW,SAAS,CACxC,KAAI,OAAO,OAAY,OAAO,KAAU;AACtC,QAAI,IAAI,GAAG;AACT,SAAI,QAAQ,qBAAqB,KAAK,WAAW,IAAI,GAAG,CACtD;AAEF,SAAI,OAAO,KAAU;MAEnB,MAAM,OAAO,WAAW,QAAQ,KAAU,IAAI,EAAE;MAChD,MAAM,OAAO,OAAO,IAAI,WAAW,MAAM,KAAK,GAAG,WAAW,MAAM,MAAM,KAAK;AAC7E,UAAI,QAAQ,UAAU,KAAK,KAAK,KAAK,GAAG,CAAC,EAAE;AACzC,cAAO,IAAI;AACX;;;;AAIN,WAAO;;;AAOb,MAAI,aAAa,QAAQ;GACvB,IAAI;AAGJ,OAAI,QAAQ,UAAU,KAAK,WAAW,GAAG,CACvC,OAAM;YACG,QAAQ,UAAU,KAAK,WAAW,GAAG,CAC9C,OAAM;OAEN,QAAO;AAGT,OAAI,KAEF;QAAI,CAAC,QAAQ,OAAO,KAAK,MAAM,IAC3B,CAAC,QAAQ,OAAO,KAAK,MAAM,IAC1B,QAAQ,SAAS,KAAK,MAAM,IAAI,QAAQ,SAAS,KAAK,MAAM,CAC/D,QAAO;cAEA,CAAC,QAAQ,OAAO,KAAK,MAAM,IAC3B,CAAC,QAAQ,OAAO,KAAK,MAAM,CACpC,QAAO;;AAIX,SAAO;;CAGT,SAAS,aAAa,QAAQ;EAC5B,MAAM,SAAS,OAAO,KAAI,UAAS;AACjC,OAAI,MAAM,WAAW,OAAO,CAC1B,KAAI;AACF,WAAO,SAAS,OAAO,MAAM,UAAU,EAAE,CAAC;WACpC;AACN,WAAO;;AAGX,UAAO;IACP,CAAC,KAAK,IAAI;AACZ,SAAO,QAAQ,WAAW,KAAK,OAAO;;CAGxC,SAAS,WAAW,YAAY,SAAS;EAEvC,IAAI,SAAS,SAAS,YAAY,QAAQ;AAG1C,WAAS,OAAO,UAAU,MAAM;EAGhC,MAAM,SAAS,OAAO,MAAM,IAAI;EAChC,MAAM,SAAS,aAAa,OAAO;EAGnC,IAAI,QAAQ;AACZ,OAAK,MAAM,CAAC,GAAG,cAAc,OAAO,SAAS,EAAE;GAC7C,IAAI,QAAQ;GACZ,IAAI,qCAAqC,QAAQ;AACjD,OAAI,MAAM,WAAW,OAAO,EAAE;AAC5B,QAAI,iBAAiB,MAAM,EAAE;AAC3B,aAAQ;AACR;;AAGF,QAAI;AACF,aAAQ,SAAS,OAAO,MAAM,UAAU,EAAE,CAAC;YACrC;AACN,SAAI,CAAC,QAAQ,uBAAuB;AAClC,cAAQ;AACR;;;AAGJ,WAAO,KAAK;AAEZ,QAAI,UAAU,MAAM,CAAC,iBAAiB,MAAM,CAC1C,SAAQ;AAGV,yCAAqC;;AAIvC,OAAI,MACF;AAOF,OAAI,CALe,cAAc,OAAO;IACtC,GAAG;IACH,wBAAwB;IACxB;IACD,CAAC,CAEA,SAAQ;;AAIZ,SAAO;GACL,QAAQ,OAAO,KAAK,IAAI;GACxB;GACD;;CAGH,SAAS,QAAQ,YAAY,EAC3B,eAAe,OACf,YAAY,OACZ,eAAe,OACf,oBAAoB,OACpB,kBAAkB,OAClB,yBAAyB,OACzB,wBAAwB,UACtB,EAAE,EAAE;EACN,MAAM,SAAS,WAAW,YAAY;GACpC;GACA;GACA;GACA;GACA;GACA;GACD,CAAC;EACF,IAAI,SAAS,OAAO,OAAO,MAAM,IAAI;AACrC,WAAS,OAAO,KAAI,MAAK;AACvB,OAAI,iBAAiB,EAAE,CACrB,KAAI;AACF,WAAO,OAAO,SAAS,OAAO,EAAE;WAC1B;AACN,WAAO,QAAQ;;AAGnB,UAAO;IACP;AAEF,MAAI,iBAAiB;GACnB,MAAM,QAAQ,OAAO,KAAK,IAAI,CAAC;AAC/B,OAAI,QAAQ,OAAO,UAAU,EAC3B,QAAO,QAAQ;AAGjB,QAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,EACnC,KAAI,OAAO,GAAG,SAAS,MAAM,OAAO,GAAG,WAAW,GAAG;AACnD,WAAO,QAAQ;AACf;;;AAKN,MAAI,OAAO,MACT,QAAO;AAET,SAAO,OAAO,KAAK,IAAI;;CAGzB,SAAS,UAAU,YAAY,EAC7B,eAAe,OACf,YAAY,OACZ,eAAe,OACf,oBAAoB,OACpB,yBAAyB,OACzB,wBAAwB,UACtB,EAAE,EAAE;EACN,MAAM,SAAS,WAAW,YAAY;GACpC;GACA;GACA;GACA;GACA;GACA;GACD,CAAC;AAEF,SAAO;GACL,QAAQ,OAAO;GACf,OAAO,OAAO;GACf;;AAGH,QAAO,UAAU;EACf;EACA;EACD"}