@qraft/asyncapi-plugin 1.0.0-beta.2 → 1.0.0-beta.4

package/dist/_vendor/urijs/src/punycode.js

@@ -1,542 +0,0 @@
-import { commonjsGlobal } from '../../../_virtual/_commonjsHelpers.js';
-import { __module as punycode$1 } from '../../../_virtual/punycode.js';
-
-/*! https://mths.be/punycode v1.4.0 by @mathias */
-var punycode = punycode$1.exports;
-
-var hasRequiredPunycode;
-
-function requirePunycode () {
-	if (hasRequiredPunycode) return punycode$1.exports;
-	hasRequiredPunycode = 1;
-	(function (module, exports) {
-(function(root) {
-
-			/** Detect free variables */
-			var freeExports = exports &&
-				!exports.nodeType && exports;
-			var freeModule = module &&
-				!module.nodeType && module;
-			var freeGlobal = typeof commonjsGlobal == 'object' && commonjsGlobal;
-			if (
-				freeGlobal.global === freeGlobal ||
-				freeGlobal.window === freeGlobal ||
-				freeGlobal.self === freeGlobal
-			) {
-				root = freeGlobal;
-			}
-
-			/**
-			 * The `punycode` object.
-			 * @name punycode
-			 * @type Object
-			 */
-			var punycode,
-
-			/** Highest positive signed 32-bit float value */
-			maxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1
-
-			/** Bootstring parameters */
-			base = 36,
-			tMin = 1,
-			tMax = 26,
-			skew = 38,
-			damp = 700,
-			initialBias = 72,
-			initialN = 128, // 0x80
-			delimiter = '-', // '\x2D'
-
-			/** Regular expressions */
-			regexPunycode = /^xn--/,
-			regexNonASCII = /[^\x20-\x7E]/, // unprintable ASCII chars + non-ASCII chars
-			regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g, // RFC 3490 separators
-
-			/** Error messages */
-			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 */
-			baseMinusTMin = base - tMin,
-			floor = Math.floor,
-			stringFromCharCode = String.fromCharCode,
-
-			/** Temporary variable */
-			key;
-
-			/*--------------------------------------------------------------------------*/
-
-			/**
-			 * 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, fn) {
-				var length = array.length;
-				var result = [];
-				while (length--) {
-					result[length] = fn(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 {Array} A new string of characters returned by the callback
-			 * function.
-			 */
-			function mapDomain(string, fn) {
-				var parts = string.split('@');
-				var result = '';
-				if (parts.length > 1) {
-					// In email addresses, only the domain name should be punycoded. Leave
-					// the local part (i.e. everything up to `@`) intact.
-					result = parts[0] + '@';
-					string = parts[1];
-				}
-				// Avoid `split(regex)` for IE8 compatibility. See #17.
-				string = string.replace(regexSeparators, '\x2E');
-				var labels = string.split('.');
-				var encoded = map(labels, fn).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) {
-				var output = [],
-				    counter = 0,
-				    length = string.length,
-				    value,
-				    extra;
-				while (counter < length) {
-					value = string.charCodeAt(counter++);
-					if (value >= 0xD800 && value <= 0xDBFF && counter < length) {
-						// high surrogate, and there is a next character
-						extra = string.charCodeAt(counter++);
-						if ((extra & 0xFC00) == 0xDC00) { // low surrogate
-							output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);
-						} else {
-							// unmatched surrogate; only append this code unit, in case the next
-							// code unit is the high surrogate of a surrogate pair
-							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).
-			 */
-			function ucs2encode(array) {
-				return map(array, function(value) {
-					var output = '';
-					if (value > 0xFFFF) {
-						value -= 0x10000;
-						output += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800);
-						value = 0xDC00 | value & 0x3FF;
-					}
-					output += stringFromCharCode(value);
-					return output;
-				}).join('');
-			}
-
-			/**
-			 * 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.
-			 */
-			function basicToDigit(codePoint) {
-				if (codePoint - 48 < 10) {
-					return codePoint - 22;
-				}
-				if (codePoint - 65 < 26) {
-					return codePoint - 65;
-				}
-				if (codePoint - 97 < 26) {
-					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.
-			 */
-			function digitToBasic(digit, flag) {
-				//  0..25 map to ASCII a..z or A..Z
-				// 26..35 map to ASCII 0..9
-				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
-			 */
-			function adapt(delta, numPoints, firstTime) {
-				var k = 0;
-				delta = firstTime ? floor(delta / damp) : delta >> 1;
-				delta += floor(delta / numPoints);
-				for (/* no initialization */; 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.
-			 */
-			function decode(input) {
-				// Don't use UCS-2
-				var output = [],
-				    inputLength = input.length,
-				    out,
-				    i = 0,
-				    n = initialN,
-				    bias = initialBias,
-				    basic,
-				    j,
-				    index,
-				    oldi,
-				    w,
-				    k,
-				    digit,
-				    t,
-				    /** Cached calculation results */
-				    baseMinusT;
-
-				// Handle the basic code points: let `basic` be the number of input code
-				// points before the last delimiter, or `0` if there is none, then copy
-				// the first basic code points to the output.
-
-				basic = input.lastIndexOf(delimiter);
-				if (basic < 0) {
-					basic = 0;
-				}
-
-				for (j = 0; j < basic; ++j) {
-					// if it's not a basic code point
-					if (input.charCodeAt(j) >= 0x80) {
-						error('not-basic');
-					}
-					output.push(input.charCodeAt(j));
-				}
-
-				// Main decoding loop: start just after the last delimiter if any basic code
-				// points were copied; start at the beginning otherwise.
-
-				for (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {
-
-					// `index` is the index of the next character to be consumed.
-					// Decode a generalized variable-length integer into `delta`,
-					// which gets added to `i`. The overflow checking is easier
-					// if we increase `i` as we go, then subtract off its starting
-					// value at the end to obtain `delta`.
-					for (oldi = i, w = 1, k = base; /* no condition */; k += base) {
-
-						if (index >= inputLength) {
-							error('invalid-input');
-						}
-
-						digit = basicToDigit(input.charCodeAt(index++));
-
-						if (digit >= base || digit > floor((maxInt - i) / w)) {
-							error('overflow');
-						}
-
-						i += digit * w;
-						t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);
-
-						if (digit < t) {
-							break;
-						}
-
-						baseMinusT = base - t;
-						if (w > floor(maxInt / baseMinusT)) {
-							error('overflow');
-						}
-
-						w *= baseMinusT;
-
-					}
-
-					out = output.length + 1;
-					bias = adapt(i - oldi, out, oldi == 0);
-
-					// `i` was supposed to wrap around from `out` to `0`,
-					// incrementing `n` each time, so we'll fix that now:
-					if (floor(i / out) > maxInt - n) {
-						error('overflow');
-					}
-
-					n += floor(i / out);
-					i %= out;
-
-					// Insert `n` at position `i` of the output
-					output.splice(i++, 0, n);
-
-				}
-
-				return ucs2encode(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.
-			 */
-			function encode(input) {
-				var n,
-				    delta,
-				    handledCPCount,
-				    basicLength,
-				    bias,
-				    j,
-				    m,
-				    q,
-				    k,
-				    t,
-				    currentValue,
-				    output = [],
-				    /** `inputLength` will hold the number of code points in `input`. */
-				    inputLength,
-				    /** Cached calculation results */
-				    handledCPCountPlusOne,
-				    baseMinusT,
-				    qMinusT;
-
-				// Convert the input in UCS-2 to Unicode
-				input = ucs2decode(input);
-
-				// Cache the length
-				inputLength = input.length;
-
-				// Initialize the state
-				n = initialN;
-				delta = 0;
-				bias = initialBias;
-
-				// Handle the basic code points
-				for (j = 0; j < inputLength; ++j) {
-					currentValue = input[j];
-					if (currentValue < 0x80) {
-						output.push(stringFromCharCode(currentValue));
-					}
-				}
-
-				handledCPCount = basicLength = output.length;
-
-				// `handledCPCount` is the number of code points that have been handled;
-				// `basicLength` is the number of basic code points.
-
-				// Finish the basic string - if it is not empty - with a delimiter
-				if (basicLength) {
-					output.push(delimiter);
-				}
-
-				// Main encoding loop:
-				while (handledCPCount < inputLength) {
-
-					// All non-basic code points < n have been handled already. Find the next
-					// larger one:
-					for (m = maxInt, j = 0; j < inputLength; ++j) {
-						currentValue = input[j];
-						if (currentValue >= n && currentValue < m) {
-							m = currentValue;
-						}
-					}
-
-					// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,
-					// but guard against overflow
-					handledCPCountPlusOne = handledCPCount + 1;
-					if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {
-						error('overflow');
-					}
-
-					delta += (m - n) * handledCPCountPlusOne;
-					n = m;
-
-					for (j = 0; j < inputLength; ++j) {
-						currentValue = input[j];
-
-						if (currentValue < n && ++delta > maxInt) {
-							error('overflow');
-						}
-
-						if (currentValue == n) {
-							// Represent delta as a generalized variable-length integer
-							for (q = delta, k = base; /* no condition */; k += base) {
-								t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);
-								if (q < t) {
-									break;
-								}
-								qMinusT = q - t;
-								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.
-			 */
-			function toUnicode(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.
-			 */
-			function toASCII(input) {
-				return mapDomain(input, function(string) {
-					return regexNonASCII.test(string)
-						? 'xn--' + encode(string)
-						: string;
-				});
-			}
-
-			/*--------------------------------------------------------------------------*/
-
-			/** Define the public API */
-			punycode = {
-				/**
-				 * A string representing the current Punycode.js version number.
-				 * @memberOf punycode
-				 * @type String
-				 */
-				'version': '1.3.2',
-				/**
-				 * An object of methods to convert from JavaScript's internal character
-				 * representation (UCS-2) to Unicode code points, and back.
-				 * @see <https://mathiasbynens.be/notes/javascript-encoding>
-				 * @memberOf punycode
-				 * @type Object
-				 */
-				'ucs2': {
-					'decode': ucs2decode,
-					'encode': ucs2encode
-				},
-				'decode': decode,
-				'encode': encode,
-				'toASCII': toASCII,
-				'toUnicode': toUnicode
-			};
-
-			/** Expose `punycode` */
-			// Some AMD build optimizers, like r.js, check for specific condition patterns
-			// like the following:
-			if (freeExports && freeModule) {
-				if (module.exports == freeExports) {
-					// in Node.js, io.js, or RingoJS v0.8.0+
-					freeModule.exports = punycode;
-				} else {
-					// in Narwhal or RingoJS v0.7.0-
-					for (key in punycode) {
-						punycode.hasOwnProperty(key) && (freeExports[key] = punycode[key]);
-					}
-				}
-			} else {
-				// in Rhino or a web browser
-				root.punycode = punycode;
-			}
-
-		}(punycode)); 
-	} (punycode$1, punycode$1.exports));
-	return punycode$1.exports;
-}
-
-export { requirePunycode as __require };
-//# sourceMappingURL=punycode.js.map

package/dist/_vendor/urijs/src/punycode.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"punycode.js","sources":["../../../../../../node_modules/urijs/src/punycode.js"],"sourcesContent":["/*! https://mths.be/punycode v1.4.0 by @mathias */\n;(function(root) {\n\n\t/** Detect free variables */\n\tvar freeExports = typeof exports == 'object' && exports &&\n\t\t!exports.nodeType && exports;\n\tvar freeModule = typeof module == 'object' && module &&\n\t\t!module.nodeType && module;\n\tvar freeGlobal = typeof global == 'object' && global;\n\tif (\n\t\tfreeGlobal.global === freeGlobal ||\n\t\tfreeGlobal.window === freeGlobal ||\n\t\tfreeGlobal.self === freeGlobal\n\t) {\n\t\troot = freeGlobal;\n\t}\n\n\t/**\n\t * The `punycode` object.\n\t * @name punycode\n\t * @type Object\n\t */\n\tvar punycode,\n\n\t/** Highest positive signed 32-bit float value */\n\tmaxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1\n\n\t/** Bootstring parameters */\n\tbase = 36,\n\ttMin = 1,\n\ttMax = 26,\n\tskew = 38,\n\tdamp = 700,\n\tinitialBias = 72,\n\tinitialN = 128, // 0x80\n\tdelimiter = '-', // '\\x2D'\n\n\t/** Regular expressions */\n\tregexPunycode = /^xn--/,\n\tregexNonASCII = /[^\\x20-\\x7E]/, // unprintable ASCII chars + non-ASCII chars\n\tregexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g, // RFC 3490 separators\n\n\t/** Error messages */\n\terrors = {\n\t\t'overflow': 'Overflow: input needs wider integers to process',\n\t\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t\t'invalid-input': 'Invalid input'\n\t},\n\n\t/** Convenience shortcuts */\n\tbaseMinusTMin = base - tMin,\n\tfloor = Math.floor,\n\tstringFromCharCode = String.fromCharCode,\n\n\t/** Temporary variable */\n\tkey;\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/**\n\t * A generic error utility function.\n\t * @private\n\t * @param {String} type The error type.\n\t * @returns {Error} Throws a `RangeError` with the applicable error message.\n\t */\n\tfunction error(type) {\n\t\tthrow new RangeError(errors[type]);\n\t}\n\n\t/**\n\t * A generic `Array#map` utility function.\n\t * @private\n\t * @param {Array} array The array to iterate over.\n\t * @param {Function} callback The function that gets called for every array\n\t * item.\n\t * @returns {Array} A new array of values returned by the callback function.\n\t */\n\tfunction map(array, fn) {\n\t\tvar length = array.length;\n\t\tvar result = [];\n\t\twhile (length--) {\n\t\t\tresult[length] = fn(array[length]);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * A simple `Array#map`-like wrapper to work with domain name strings or email\n\t * addresses.\n\t * @private\n\t * @param {String} domain The domain name or email address.\n\t * @param {Function} callback The function that gets called for every\n\t * character.\n\t * @returns {Array} A new string of characters returned by the callback\n\t * function.\n\t */\n\tfunction mapDomain(string, fn) {\n\t\tvar parts = string.split('@');\n\t\tvar result = '';\n\t\tif (parts.length > 1) {\n\t\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t\t// the local part (i.e. everything up to `@`) intact.\n\t\t\tresult = parts[0] + '@';\n\t\t\tstring = parts[1];\n\t\t}\n\t\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\t\tstring = string.replace(regexSeparators, '\\x2E');\n\t\tvar labels = string.split('.');\n\t\tvar encoded = map(labels, fn).join('.');\n\t\treturn result + encoded;\n\t}\n\n\t/**\n\t * Creates an array containing the numeric code points of each Unicode\n\t * character in the string. While JavaScript uses UCS-2 internally,\n\t * this function will convert a pair of surrogate halves (each of which\n\t * UCS-2 exposes as separate characters) into a single code point,\n\t * matching UTF-16.\n\t * @see `punycode.ucs2.encode`\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode.ucs2\n\t * @name decode\n\t * @param {String} string The Unicode input string (UCS-2).\n\t * @returns {Array} The new array of code points.\n\t */\n\tfunction ucs2decode(string) {\n\t\tvar output = [],\n\t\t    counter = 0,\n\t\t    length = string.length,\n\t\t    value,\n\t\t    extra;\n\t\twhile (counter < length) {\n\t\t\tvalue = string.charCodeAt(counter++);\n\t\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t\t// high surrogate, and there is a next character\n\t\t\t\textra = string.charCodeAt(counter++);\n\t\t\t\tif ((extra & 0xFC00) == 0xDC00) { // low surrogate\n\t\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t\t} else {\n\t\t\t\t\t// unmatched surrogate; only append this code unit, in case the next\n\t\t\t\t\t// code unit is the high surrogate of a surrogate pair\n\t\t\t\t\toutput.push(value);\n\t\t\t\t\tcounter--;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\toutput.push(value);\n\t\t\t}\n\t\t}\n\t\treturn output;\n\t}\n\n\t/**\n\t * Creates a string based on an array of numeric code points.\n\t * @see `punycode.ucs2.decode`\n\t * @memberOf punycode.ucs2\n\t * @name encode\n\t * @param {Array} codePoints The array of numeric code points.\n\t * @returns {String} The new Unicode string (UCS-2).\n\t */\n\tfunction ucs2encode(array) {\n\t\treturn map(array, function(value) {\n\t\t\tvar output = '';\n\t\t\tif (value > 0xFFFF) {\n\t\t\t\tvalue -= 0x10000;\n\t\t\t\toutput += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800);\n\t\t\t\tvalue = 0xDC00 | value & 0x3FF;\n\t\t\t}\n\t\t\toutput += stringFromCharCode(value);\n\t\t\treturn output;\n\t\t}).join('');\n\t}\n\n\t/**\n\t * Converts a basic code point into a digit/integer.\n\t * @see `digitToBasic()`\n\t * @private\n\t * @param {Number} codePoint The basic numeric code point value.\n\t * @returns {Number} The numeric value of a basic code point (for use in\n\t * representing integers) in the range `0` to `base - 1`, or `base` if\n\t * the code point does not represent a value.\n\t */\n\tfunction basicToDigit(codePoint) {\n\t\tif (codePoint - 48 < 10) {\n\t\t\treturn codePoint - 22;\n\t\t}\n\t\tif (codePoint - 65 < 26) {\n\t\t\treturn codePoint - 65;\n\t\t}\n\t\tif (codePoint - 97 < 26) {\n\t\t\treturn codePoint - 97;\n\t\t}\n\t\treturn base;\n\t}\n\n\t/**\n\t * Converts a digit/integer into a basic code point.\n\t * @see `basicToDigit()`\n\t * @private\n\t * @param {Number} digit The numeric value of a basic code point.\n\t * @returns {Number} The basic code point whose value (when used for\n\t * representing integers) is `digit`, which needs to be in the range\n\t * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n\t * used; else, the lowercase form is used. The behavior is undefined\n\t * if `flag` is non-zero and `digit` has no uppercase form.\n\t */\n\tfunction digitToBasic(digit, flag) {\n\t\t//  0..25 map to ASCII a..z or A..Z\n\t\t// 26..35 map to ASCII 0..9\n\t\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n\t}\n\n\t/**\n\t * Bias adaptation function as per section 3.4 of RFC 3492.\n\t * https://tools.ietf.org/html/rfc3492#section-3.4\n\t * @private\n\t */\n\tfunction adapt(delta, numPoints, firstTime) {\n\t\tvar k = 0;\n\t\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\t\tdelta += floor(delta / numPoints);\n\t\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\t\tdelta = floor(delta / baseMinusTMin);\n\t\t}\n\t\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n\t}\n\n\t/**\n\t * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n\t * symbols.\n\t * @memberOf punycode\n\t * @param {String} input The Punycode string of ASCII-only symbols.\n\t * @returns {String} The resulting string of Unicode symbols.\n\t */\n\tfunction decode(input) {\n\t\t// Don't use UCS-2\n\t\tvar output = [],\n\t\t    inputLength = input.length,\n\t\t    out,\n\t\t    i = 0,\n\t\t    n = initialN,\n\t\t    bias = initialBias,\n\t\t    basic,\n\t\t    j,\n\t\t    index,\n\t\t    oldi,\n\t\t    w,\n\t\t    k,\n\t\t    digit,\n\t\t    t,\n\t\t    /** Cached calculation results */\n\t\t    baseMinusT;\n\n\t\t// Handle the basic code points: let `basic` be the number of input code\n\t\t// points before the last delimiter, or `0` if there is none, then copy\n\t\t// the first basic code points to the output.\n\n\t\tbasic = input.lastIndexOf(delimiter);\n\t\tif (basic < 0) {\n\t\t\tbasic = 0;\n\t\t}\n\n\t\tfor (j = 0; j < basic; ++j) {\n\t\t\t// if it's not a basic code point\n\t\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\t\terror('not-basic');\n\t\t\t}\n\t\t\toutput.push(input.charCodeAt(j));\n\t\t}\n\n\t\t// Main decoding loop: start just after the last delimiter if any basic code\n\t\t// points were copied; start at the beginning otherwise.\n\n\t\tfor (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t\t// `index` is the index of the next character to be consumed.\n\t\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t\t// which gets added to `i`. The overflow checking is easier\n\t\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t\t// value at the end to obtain `delta`.\n\t\t\tfor (oldi = i, w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\t\tif (index >= inputLength) {\n\t\t\t\t\terror('invalid-input');\n\t\t\t\t}\n\n\t\t\t\tdigit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\t\tif (digit >= base || digit > floor((maxInt - i) / w)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\ti += digit * w;\n\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\t\tif (digit < t) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbaseMinusT = base - t;\n\t\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tw *= baseMinusT;\n\n\t\t\t}\n\n\t\t\tout = output.length + 1;\n\t\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t\t// incrementing `n` each time, so we'll fix that now:\n\t\t\tif (floor(i / out) > maxInt - n) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tn += floor(i / out);\n\t\t\ti %= out;\n\n\t\t\t// Insert `n` at position `i` of the output\n\t\t\toutput.splice(i++, 0, n);\n\n\t\t}\n\n\t\treturn ucs2encode(output);\n\t}\n\n\t/**\n\t * Converts a string of Unicode symbols (e.g. a domain name label) to a\n\t * Punycode string of ASCII-only symbols.\n\t * @memberOf punycode\n\t * @param {String} input The string of Unicode symbols.\n\t * @returns {String} The resulting Punycode string of ASCII-only symbols.\n\t */\n\tfunction encode(input) {\n\t\tvar n,\n\t\t    delta,\n\t\t    handledCPCount,\n\t\t    basicLength,\n\t\t    bias,\n\t\t    j,\n\t\t    m,\n\t\t    q,\n\t\t    k,\n\t\t    t,\n\t\t    currentValue,\n\t\t    output = [],\n\t\t    /** `inputLength` will hold the number of code points in `input`. */\n\t\t    inputLength,\n\t\t    /** Cached calculation results */\n\t\t    handledCPCountPlusOne,\n\t\t    baseMinusT,\n\t\t    qMinusT;\n\n\t\t// Convert the input in UCS-2 to Unicode\n\t\tinput = ucs2decode(input);\n\n\t\t// Cache the length\n\t\tinputLength = input.length;\n\n\t\t// Initialize the state\n\t\tn = initialN;\n\t\tdelta = 0;\n\t\tbias = initialBias;\n\n\t\t// Handle the basic code points\n\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\tcurrentValue = input[j];\n\t\t\tif (currentValue < 0x80) {\n\t\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t\t}\n\t\t}\n\n\t\thandledCPCount = basicLength = output.length;\n\n\t\t// `handledCPCount` is the number of code points that have been handled;\n\t\t// `basicLength` is the number of basic code points.\n\n\t\t// Finish the basic string - if it is not empty - with a delimiter\n\t\tif (basicLength) {\n\t\t\toutput.push(delimiter);\n\t\t}\n\n\t\t// Main encoding loop:\n\t\twhile (handledCPCount < inputLength) {\n\n\t\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t\t// larger one:\n\t\t\tfor (m = maxInt, j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\t\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\t\tm = currentValue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t\t// but guard against overflow\n\t\t\thandledCPCountPlusOne = handledCPCount + 1;\n\t\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\t\tn = m;\n\n\t\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\n\t\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tif (currentValue == n) {\n\t\t\t\t\t// Represent delta as a generalized variable-length integer\n\t\t\t\t\tfor (q = delta, k = base; /* no condition */; k += base) {\n\t\t\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tqMinusT = q - t;\n\t\t\t\t\t\tbaseMinusT = base - t;\n\t\t\t\t\t\toutput.push(\n\t\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t\t);\n\t\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t\t}\n\n\t\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);\n\t\t\t\t\tdelta = 0;\n\t\t\t\t\t++handledCPCount;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t++delta;\n\t\t\t++n;\n\n\t\t}\n\t\treturn output.join('');\n\t}\n\n\t/**\n\t * Converts a Punycode string representing a domain name or an email address\n\t * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n\t * it doesn't matter if you call it on a string that has already been\n\t * converted to Unicode.\n\t * @memberOf punycode\n\t * @param {String} input The Punycoded domain name or email address to\n\t * convert to Unicode.\n\t * @returns {String} The Unicode representation of the given Punycode\n\t * string.\n\t */\n\tfunction toUnicode(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexPunycode.test(string)\n\t\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/**\n\t * Converts a Unicode string representing a domain name or an email address to\n\t * Punycode. Only the non-ASCII parts of the domain name will be converted,\n\t * i.e. it doesn't matter if you call it with a domain that's already in\n\t * ASCII.\n\t * @memberOf punycode\n\t * @param {String} input The domain name or email address to convert, as a\n\t * Unicode string.\n\t * @returns {String} The Punycode representation of the given domain name or\n\t * email address.\n\t */\n\tfunction toASCII(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexNonASCII.test(string)\n\t\t\t\t? 'xn--' + encode(string)\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/** Define the public API */\n\tpunycode = {\n\t\t/**\n\t\t * A string representing the current Punycode.js version number.\n\t\t * @memberOf punycode\n\t\t * @type String\n\t\t */\n\t\t'version': '1.3.2',\n\t\t/**\n\t\t * An object of methods to convert from JavaScript's internal character\n\t\t * representation (UCS-2) to Unicode code points, and back.\n\t\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t\t * @memberOf punycode\n\t\t * @type Object\n\t\t */\n\t\t'ucs2': {\n\t\t\t'decode': ucs2decode,\n\t\t\t'encode': ucs2encode\n\t\t},\n\t\t'decode': decode,\n\t\t'encode': encode,\n\t\t'toASCII': toASCII,\n\t\t'toUnicode': toUnicode\n\t};\n\n\t/** Expose `punycode` */\n\t// Some AMD build optimizers, like r.js, check for specific condition patterns\n\t// like the following:\n\tif (\n\t\ttypeof define == 'function' &&\n\t\ttypeof define.amd == 'object' &&\n\t\tdefine.amd\n\t) {\n\t\tdefine('punycode', function() {\n\t\t\treturn punycode;\n\t\t});\n\t} else if (freeExports && freeModule) {\n\t\tif (module.exports == freeExports) {\n\t\t\t// in Node.js, io.js, or RingoJS v0.8.0+\n\t\t\tfreeModule.exports = punycode;\n\t\t} else {\n\t\t\t// in Narwhal or RingoJS v0.7.0-\n\t\t\tfor (key in punycode) {\n\t\t\t\tpunycode.hasOwnProperty(key) && (freeExports[key] = punycode[key]);\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// in Rhino or a web browser\n\t\troot.punycode = punycode;\n\t}\n\n}(this));\n"],"names":["global","this"],"mappings":";;;;;;;;;;;;AACC,CAAC,SAAS,IAAI,EAAE;;AAEjB;AACA,GAAC,IAAI,WAAW,GAAiC,OAAO;AACxD,IAAE,CAAC,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAA;AAC9B,GAAC,IAAI,UAAU,GAAgC,MAAM;AACrD,IAAE,CAAC,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAA;GAC3B,IAAI,UAAU,GAAG,OAAOA,cAAM,IAAI,QAAQ,IAAIA,cAAM,CAAA;GACpD;AACD,IAAE,UAAU,CAAC,MAAM,KAAK,UAAU;AAClC,IAAE,UAAU,CAAC,MAAM,KAAK,UAAU;IAChC,UAAU,CAAC,IAAI,KAAK,UAAA;KACnB;IACD,IAAI,GAAG,UAAU,CAAA;AACnB,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAC,IAAI,QAAQ;;AAEb;GACC,MAAM,GAAG,UAAU;;AAEpB;GACC,IAAI,GAAG,EAAE;GACT,IAAI,GAAG,CAAC;GACR,IAAI,GAAG,EAAE;GACT,IAAI,GAAG,EAAE;GACT,IAAI,GAAG,GAAG;GACV,WAAW,GAAG,EAAE;GAChB,QAAQ,GAAG,GAAG;GACd,SAAS,GAAG,GAAG;;AAEhB;GACC,aAAa,GAAG,OAAO;GACvB,aAAa,GAAG,cAAc;GAC9B,eAAe,GAAG,2BAA2B;;AAE9C;AACA,GAAC,MAAM,GAAG;IACR,UAAU,EAAE,iDAAiD;IAC7D,WAAW,EAAE,gDAAgD;AAC/D,IAAE,eAAe,EAAE,eAAA;IACjB;;AAEF;AACA,GAAC,aAAa,GAAG,IAAI,GAAG,IAAI;AAC5B,GAAC,KAAK,GAAG,IAAI,CAAC,KAAK;AACnB,GAAC,kBAAkB,GAAG,MAAM,CAAC,YAAY;;AAEzC;AACA,GAAC,GAAG,CAAA;;AAEJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,GAAC,SAAS,KAAK,CAAC,IAAI,EAAE;IACpB,MAAM,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;AACpC,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAC,SAAS,GAAG,CAAC,KAAK,EAAE,EAAE,EAAE;AACzB,IAAE,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAA;IACzB,IAAI,MAAM,GAAG,EAAE,CAAA;IACf,OAAO,MAAM,EAAE,EAAE;KAChB,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAA;AACrC,KAAA;AACA,IAAE,OAAO,MAAM,CAAA;AACf,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAC,SAAS,SAAS,CAAC,MAAM,EAAE,EAAE,EAAE;IAC9B,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IAC7B,IAAI,MAAM,GAAG,EAAE,CAAA;AACjB,IAAE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACxB;AACA;AACA,KAAG,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;AAC1B,KAAG,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;AACpB,KAAA;AACA;IACE,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,eAAe,EAAE,MAAM,CAAC,CAAA;IAChD,IAAI,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;AAChC,IAAE,IAAI,OAAO,GAAG,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACvC,OAAO,MAAM,GAAG,OAAO,CAAA;AACzB,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAC,SAAS,UAAU,CAAC,MAAM,EAAE;IAC3B,IAAI,MAAM,GAAG,EAAE;QACX,OAAO,GAAG,CAAC;AACjB,QAAM,MAAM,GAAG,MAAM,CAAC,MAAM;AAC5B,QAAM,KAAK;AACX,QAAM,KAAK,CAAA;AACX,IAAE,OAAO,OAAO,GAAG,MAAM,EAAE;KACxB,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAA;AACvC,KAAG,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,MAAM,IAAI,OAAO,GAAG,MAAM,EAAE;AAC/D;MACI,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAA;AACxC,MAAI,IAAI,CAAC,KAAK,GAAG,MAAM,KAAK,MAAM,EAAE;AACpC,OAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,KAAK,EAAE,KAAK,KAAK,GAAG,KAAK,CAAC,GAAG,OAAO,CAAC,CAAA;AACrE,OAAK,MAAM;AACX;AACA;AACA,OAAK,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;AACvB,OAAK,OAAO,EAAE,CAAA;AACd,OAAA;AACA,MAAI,MAAM;AACV,MAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;AACtB,MAAA;AACA,KAAA;AACA,IAAE,OAAO,MAAM,CAAA;AACf,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAC,SAAS,UAAU,CAAC,KAAK,EAAE;AAC5B,IAAE,OAAO,GAAG,CAAC,KAAK,EAAE,SAAS,KAAK,EAAE;KACjC,IAAI,MAAM,GAAG,EAAE,CAAA;AAClB,KAAG,IAAI,KAAK,GAAG,MAAM,EAAE;MACnB,KAAK,IAAI,OAAO,CAAA;MAChB,MAAM,IAAI,kBAAkB,CAAC,KAAK,KAAK,EAAE,GAAG,KAAK,GAAG,MAAM,CAAC,CAAA;AAC/D,MAAI,KAAK,GAAG,MAAM,GAAG,KAAK,GAAG,KAAK,CAAA;AAClC,MAAA;AACA,KAAG,MAAM,IAAI,kBAAkB,CAAC,KAAK,CAAC,CAAA;AACtC,KAAG,OAAO,MAAM,CAAA;AAChB,KAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;AACb,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAC,SAAS,YAAY,CAAC,SAAS,EAAE;AAClC,IAAE,IAAI,SAAS,GAAG,EAAE,GAAG,EAAE,EAAE;KACxB,OAAO,SAAS,GAAG,EAAE,CAAA;AACxB,KAAA;AACA,IAAE,IAAI,SAAS,GAAG,EAAE,GAAG,EAAE,EAAE;KACxB,OAAO,SAAS,GAAG,EAAE,CAAA;AACxB,KAAA;AACA,IAAE,IAAI,SAAS,GAAG,EAAE,GAAG,EAAE,EAAE;KACxB,OAAO,SAAS,GAAG,EAAE,CAAA;AACxB,KAAA;AACA,IAAE,OAAO,IAAI,CAAA;AACb,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAC,SAAS,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE;AACpC;AACA;AACA,IAAE,OAAO,KAAK,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;AAC5D,IAAA;;AAEA;AACA;AACA;AACA;AACA;GACC,SAAS,KAAK,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE;IAC3C,IAAI,CAAC,GAAG,CAAC,CAAA;AACX,IAAE,KAAK,GAAG,SAAS,GAAG,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,CAAA;AACtD,IAAE,KAAK,IAAI,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,CAAA;AACnC,IAAE,8BAA8B,KAAK,GAAG,aAAa,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE;AAC9E,KAAG,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,CAAA;AACvC,KAAA;AACA,IAAE,OAAO,KAAK,CAAC,CAAC,GAAG,CAAC,aAAa,GAAG,CAAC,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,CAAA;AAChE,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAC,SAAS,MAAM,CAAC,KAAK,EAAE;AACxB;IACE,IAAI,MAAM,GAAG,EAAE;AACjB,QAAM,WAAW,GAAG,KAAK,CAAC,MAAM;AAChC,QAAM,GAAG;QACH,CAAC,GAAG,CAAC;QACL,CAAC,GAAG,QAAQ;QACZ,IAAI,GAAG,WAAW;AACxB,QAAM,KAAK;AACX,QAAM,CAAC;AACP,QAAM,KAAK;AACX,QAAM,IAAI;AACV,QAAM,CAAC;AACP,QAAM,CAAC;AACP,QAAM,KAAK;AACX,QAAM,CAAC;AACP;AACA,QAAM,UAAU,CAAA;;AAEhB;AACA;AACA;;AAEA,IAAE,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,CAAA;AACtC,IAAE,IAAI,KAAK,GAAG,CAAC,EAAE;KACd,KAAK,GAAG,CAAC,CAAA;AACZ,KAAA;;IAEE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,EAAE,CAAC,EAAE;AAC9B;KACG,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;MAChC,KAAK,CAAC,WAAW,CAAC,CAAA;AACtB,MAAA;KACG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;AACnC,KAAA;;AAEA;AACA;;AAEA,IAAE,KAAK,KAAK,GAAG,KAAK,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,WAAW,6BAA6B;;AAE1F;AACA;AACA;AACA;AACA;AACA,KAAG,KAAK,IAAI,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,sBAAsB,CAAC,IAAI,IAAI,EAAE;;AAElE,MAAI,IAAI,KAAK,IAAI,WAAW,EAAE;OACzB,KAAK,CAAC,eAAe,CAAC,CAAA;AAC3B,OAAA;;MAEI,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;;AAEnD,MAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE;OACrD,KAAK,CAAC,UAAU,CAAC,CAAA;AACtB,OAAA;;AAEA,MAAI,CAAC,IAAI,KAAK,GAAG,CAAC,CAAA;AAClB,MAAI,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAA;;AAE/D,MAAI,IAAI,KAAK,GAAG,CAAC,EAAE;OACd,MAAA;AACL,OAAA;;AAEA,MAAI,UAAU,GAAG,IAAI,GAAG,CAAC,CAAA;MACrB,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,UAAU,CAAC,EAAE;OACnC,KAAK,CAAC,UAAU,CAAC,CAAA;AACtB,OAAA;;MAEI,CAAC,IAAI,UAAU,CAAA;;AAEnB,MAAA;;AAEA,KAAG,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;AAC1B,KAAG,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,IAAI,IAAI,CAAC,CAAC,CAAA;;AAEzC;AACA;KACG,IAAI,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE;MAChC,KAAK,CAAC,UAAU,CAAC,CAAA;AACrB,MAAA;;AAEA,KAAG,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;KACnB,CAAC,IAAI,GAAG,CAAA;;AAEX;KACG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;;AAE3B,KAAA;;AAEA,IAAE,OAAO,UAAU,CAAC,MAAM,CAAC,CAAA;AAC3B,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAC,SAAS,MAAM,CAAC,KAAK,EAAE;AACxB,IAAE,IAAI,CAAC;AACP,QAAM,KAAK;AACX,QAAM,cAAc;AACpB,QAAM,WAAW;AACjB,QAAM,IAAI;AACV,QAAM,CAAC;AACP,QAAM,CAAC;AACP,QAAM,CAAC;AACP,QAAM,CAAC;AACP,QAAM,CAAC;AACP,QAAM,YAAY;QACZ,MAAM,GAAG,EAAE;AACjB;AACA,QAAM,WAAW;AACjB;AACA,QAAM,qBAAqB;AAC3B,QAAM,UAAU;AAChB,QAAM,OAAO,CAAA;;AAEb;AACA,IAAE,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAA;;AAE3B;AACA,IAAE,WAAW,GAAG,KAAK,CAAC,MAAM,CAAA;;AAE5B;IACE,CAAC,GAAG,QAAQ,CAAA;IACZ,KAAK,GAAG,CAAC,CAAA;IACT,IAAI,GAAG,WAAW,CAAA;;AAEpB;IACE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,EAAE,CAAC,EAAE;AACpC,KAAG,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;AAC1B,KAAG,IAAI,YAAY,GAAG,IAAI,EAAE;MACxB,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC,CAAA;AACjD,MAAA;AACA,KAAA;;AAEA,IAAE,cAAc,GAAG,WAAW,GAAG,MAAM,CAAC,MAAM,CAAA;;AAE9C;AACA;;AAEA;IACE,IAAI,WAAW,EAAE;AACnB,KAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;AACzB,KAAA;;AAEA;AACA,IAAE,OAAO,cAAc,GAAG,WAAW,EAAE;;AAEvC;AACA;AACA,KAAG,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,EAAE,CAAC,EAAE;AACjD,MAAI,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;MACvB,IAAI,YAAY,IAAI,CAAC,IAAI,YAAY,GAAG,CAAC,EAAE;OAC1C,CAAC,GAAG,YAAY,CAAA;AACrB,OAAA;AACA,MAAA;;AAEA;AACA;AACA,KAAG,qBAAqB,GAAG,cAAc,GAAG,CAAC,CAAA;AAC7C,KAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,KAAK,IAAI,qBAAqB,CAAC,EAAE;MAC5D,KAAK,CAAC,UAAU,CAAC,CAAA;AACrB,MAAA;;AAEA,KAAG,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,qBAAqB,CAAA;KACxC,CAAC,GAAG,CAAC,CAAA;;KAEL,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,EAAE,CAAC,EAAE;AACrC,MAAI,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;;MAEvB,IAAI,YAAY,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,MAAM,EAAE;OACzC,KAAK,CAAC,UAAU,CAAC,CAAA;AACtB,OAAA;;AAEA,MAAI,IAAI,YAAY,IAAI,CAAC,EAAE;AAC3B;AACA,OAAK,KAAK,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,IAAI,sBAAsB,CAAC,IAAI,IAAI,EAAE;AAC9D,QAAM,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAA;AACjE,QAAM,IAAI,CAAC,GAAG,CAAC,EAAE;SACV,MAAA;AACP,SAAA;AACA,QAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAA;AACrB,QAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAA;QACrB,MAAM,CAAC,IAAI;SACV,kBAAkB,CAAC,YAAY,CAAC,CAAC,GAAG,OAAO,GAAG,UAAU,EAAE,CAAC,CAAC,CAAA;SAC5D,CAAA;AACP,QAAM,CAAC,GAAG,KAAK,CAAC,OAAO,GAAG,UAAU,CAAC,CAAA;AACrC,QAAA;;AAEA,OAAK,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;OACnD,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,qBAAqB,EAAE,cAAc,IAAI,WAAW,CAAC,CAAA;OACzE,KAAK,GAAG,CAAC,CAAA;AACd,OAAK,EAAE,cAAc,CAAA;AACrB,OAAA;AACA,MAAA;;AAEA,KAAG,EAAE,KAAK,CAAA;AACV,KAAG,EAAE,CAAC,CAAA;;AAEN,KAAA;AACA,IAAE,OAAO,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;AACxB,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAC,SAAS,SAAS,CAAC,KAAK,EAAE;AAC3B,IAAE,OAAO,SAAS,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE;AAC3C,KAAG,OAAO,aAAa,CAAC,IAAI,CAAC,MAAM,CAAA;QAC7B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAA;AAC1C,QAAM,MAAM,CAAA;AACZ,KAAG,CAAC,CAAA;AACJ,IAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAC,SAAS,OAAO,CAAC,KAAK,EAAE;AACzB,IAAE,OAAO,SAAS,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE;AAC3C,KAAG,OAAO,aAAa,CAAC,IAAI,CAAC,MAAM,CAAA;AACnC,QAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAA;AAC5B,QAAM,MAAM,CAAA;AACZ,KAAG,CAAC,CAAA;AACJ,IAAA;;AAEA;;AAEA;AACA,GAAC,QAAQ,GAAG;AACZ;AACA;AACA;AACA;AACA;IACE,SAAS,EAAE,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAE,MAAM,EAAE;KACP,QAAQ,EAAE,UAAU;AACvB,KAAG,QAAQ,EAAE,UAAA;KACV;IACD,QAAQ,EAAE,MAAM;IAChB,QAAQ,EAAE,MAAM;IAChB,SAAS,EAAE,OAAO;AACpB,IAAE,WAAW,EAAE,SAAA;IACb,CAAA;;AAEF;AACA;AACA;GASQ,IAAI,WAAW,IAAI,UAAU,EAAE;AACvC,IAAE,IAAI,MAAM,CAAC,OAAO,IAAI,WAAW,EAAE;AACrC;AACA,KAAG,UAAU,CAAC,OAAO,GAAG,QAAQ,CAAA;AAChC,KAAG,MAAM;AACT;AACA,KAAG,KAAK,GAAG,IAAI,QAAQ,EAAE;AACzB,MAAI,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,WAAW,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAA;AACtE,MAAA;AACA,KAAA;AACA,IAAE,MAAM;AACR;AACA,IAAE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;AAC1B,IAAA;;GAEC,CAACC,QAAI,CAAC,EAAA;;;;;;;","x_google_ignoreList":[0]}