@vc-shell/framework 2.0.0-alpha.8 → 2.0.0-pr221.637b802

package/dist/chunks/vendor-punycode-js-CgGegfA_.js

@@ -0,0 +1,133 @@
+const k = /^xn--/, B = /[^\0-\x7F]/, S = /[\x2E\u3002\uFF0E\uFF61]/g, T = {
+  overflow: "Overflow: input needs wider integers to process",
+  "not-basic": "Illegal input >= 0x80 (not a basic code point)",
+  "invalid-input": "Invalid input"
+}, C = 35, l = Math.floor, g = String.fromCharCode;
+function d(t) {
+  throw new RangeError(T[t]);
+}
+function D(t, n) {
+  const o = [];
+  let e = t.length;
+  for (; e--; )
+    o[e] = n(t[e]);
+  return o;
+}
+function I(t, n) {
+  const o = t.split("@");
+  let e = "";
+  o.length > 1 && (e = o[0] + "@", t = o[1]), t = t.replace(S, ".");
+  const s = t.split("."), i = D(s, n).join(".");
+  return e + i;
+}
+function M(t) {
+  const n = [];
+  let o = 0;
+  const e = t.length;
+  for (; o < e; ) {
+    const s = t.charCodeAt(o++);
+    if (s >= 55296 && s <= 56319 && o < e) {
+      const i = t.charCodeAt(o++);
+      (i & 64512) == 56320 ? n.push(((s & 1023) << 10) + (i & 1023) + 65536) : (n.push(s), o--);
+    } else
+      n.push(s);
+  }
+  return n;
+}
+const E = (t) => String.fromCodePoint(...t), L = function(t) {
+  return t >= 48 && t < 58 ? 26 + (t - 48) : t >= 65 && t < 91 ? t - 65 : t >= 97 && t < 123 ? t - 97 : 36;
+}, m = function(t, n) {
+  return t + 22 + 75 * (t < 26) - ((n != 0) << 5);
+}, v = function(t, n, o) {
+  let e = 0;
+  for (t = o ? l(t / 700) : t >> 1, t += l(t / n); t > C * 26 >> 1; e += 36)
+    t = l(t / C);
+  return l(e + (C + 1) * t / (t + 38));
+}, F = function(t) {
+  const n = [], o = t.length;
+  let e = 0, s = 128, i = 72, u = t.lastIndexOf("-");
+  u < 0 && (u = 0);
+  for (let c = 0; c < u; ++c)
+    t.charCodeAt(c) >= 128 && d("not-basic"), n.push(t.charCodeAt(c));
+  for (let c = u > 0 ? u + 1 : 0; c < o; ) {
+    const r = e;
+    for (let a = 1, f = 36; ; f += 36) {
+      c >= o && d("invalid-input");
+      const x = L(t.charCodeAt(c++));
+      x >= 36 && d("invalid-input"), x > l((2147483647 - e) / a) && d("overflow"), e += x * a;
+      const p = f <= i ? 1 : f >= i + 26 ? 26 : f - i;
+      if (x < p)
+        break;
+      const b = 36 - p;
+      a > l(2147483647 / b) && d("overflow"), a *= b;
+    }
+    const h = n.length + 1;
+    i = v(e - r, h, r == 0), l(e / h) > 2147483647 - s && d("overflow"), s += l(e / h), e %= h, n.splice(e++, 0, s);
+  }
+  return String.fromCodePoint(...n);
+}, A = function(t) {
+  const n = [];
+  t = M(t);
+  const o = t.length;
+  let e = 128, s = 0, i = 72;
+  for (const r of t)
+    r < 128 && n.push(g(r));
+  const u = n.length;
+  let c = u;
+  for (u && n.push("-"); c < o; ) {
+    let r = 2147483647;
+    for (const a of t)
+      a >= e && a < r && (r = a);
+    const h = c + 1;
+    r - e > l((2147483647 - s) / h) && d("overflow"), s += (r - e) * h, e = r;
+    for (const a of t)
+      if (a < e && ++s > 2147483647 && d("overflow"), a === e) {
+        let f = s;
+        for (let x = 36; ; x += 36) {
+          const p = x <= i ? 1 : x >= i + 26 ? 26 : x - i;
+          if (f < p)
+            break;
+          const b = f - p, w = 36 - p;
+          n.push(
+            g(m(p + b % w, 0))
+          ), f = l(b / w);
+        }
+        n.push(g(m(f, 0))), i = v(s, h, c === u), s = 0, ++c;
+      }
+    ++s, ++e;
+  }
+  return n.join("");
+}, N = function(t) {
+  return I(t, function(n) {
+    return k.test(n) ? F(n.slice(4).toLowerCase()) : n;
+  });
+}, j = function(t) {
+  return I(t, function(n) {
+    return B.test(n) ? "xn--" + A(n) : n;
+  });
+}, O = {
+  /**
+   * A string representing the current Punycode.js version number.
+   * @memberOf punycode
+   * @type String
+   */
+  version: "2.3.1",
+  /**
+   * 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: M,
+    encode: E
+  },
+  decode: F,
+  encode: A,
+  toASCII: j,
+  toUnicode: N
+};
+export {
+  O as p
+};

package/dist/chunks/vendor-punycode-js-CgGegfA_.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vendor-punycode-js-CgGegfA_.js","sources":["../../../node_modules/punycode.js/punycode.es6.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\nexport { ucs2decode, ucs2encode, decode, encode, toASCII, toUnicode };\nexport default punycode;\n"],"names":["regexPunycode","regexNonASCII","regexSeparators","errors","baseMinusTMin","floor","stringFromCharCode","error","type","map","array","callback","result","length","mapDomain","domain","parts","labels","encoded","ucs2decode","string","output","counter","value","extra","ucs2encode","codePoints","basicToDigit","codePoint","digitToBasic","digit","flag","adapt","delta","numPoints","firstTime","k","decode","input","inputLength","i","n","bias","basic","j","index","oldi","w","t","baseMinusT","out","encode","currentValue","basicLength","handledCPCount","m","handledCPCountPlusOne","q","qMinusT","toUnicode","toASCII","punycode"],"mappings":"AAgBA,MAAMA,IAAgB,SAChBC,IAAgB,cAChBC,IAAkB,6BAGlBC,IAAS;AAAA,EACd,UAAY;AAAA,EACZ,aAAa;AAAA,EACb,iBAAiB;AAClB,GAGMC,IAAgB,IAChBC,IAAQ,KAAK,OACbC,IAAqB,OAAO;AAUlC,SAASC,EAAMC,GAAM;AACpB,QAAM,IAAI,WAAWL,EAAOK,CAAI,CAAC;AAClC;AAUA,SAASC,EAAIC,GAAOC,GAAU;AAC7B,QAAMC,IAAS,CAAA;AACf,MAAIC,IAASH,EAAM;AACnB,SAAOG;AACN,IAAAD,EAAOC,CAAM,IAAIF,EAASD,EAAMG,CAAM,CAAC;AAExC,SAAOD;AACR;AAYA,SAASE,EAAUC,GAAQJ,GAAU;AACpC,QAAMK,IAAQD,EAAO,MAAM,GAAG;AAC9B,MAAIH,IAAS;AACb,EAAII,EAAM,SAAS,MAGlBJ,IAASI,EAAM,CAAC,IAAI,KACpBD,IAASC,EAAM,CAAC,IAGjBD,IAASA,EAAO,QAAQb,GAAiB,GAAM;AAC/C,QAAMe,IAASF,EAAO,MAAM,GAAG,GACzBG,IAAUT,EAAIQ,GAAQN,CAAQ,EAAE,KAAK,GAAG;AAC9C,SAAOC,IAASM;AACjB;AAeA,SAASC,EAAWC,GAAQ;AAC3B,QAAMC,IAAS,CAAA;AACf,MAAIC,IAAU;AACd,QAAMT,IAASO,EAAO;AACtB,SAAOE,IAAUT,KAAQ;AACxB,UAAMU,IAAQH,EAAO,WAAWE,GAAS;AACzC,QAAIC,KAAS,SAAUA,KAAS,SAAUD,IAAUT,GAAQ;AAE3D,YAAMW,IAAQJ,EAAO,WAAWE,GAAS;AACzC,OAAKE,IAAQ,UAAW,QACvBH,EAAO,OAAOE,IAAQ,SAAU,OAAOC,IAAQ,QAAS,KAAO,KAI/DH,EAAO,KAAKE,CAAK,GACjBD;AAAA,IAEF;AACC,MAAAD,EAAO,KAAKE,CAAK;AAAA,EAEnB;AACA,SAAOF;AACR;AAUA,MAAMI,IAAa,CAAAC,MAAc,OAAO,cAAc,GAAGA,CAAU,GAW7DC,IAAe,SAASC,GAAW;AACxC,SAAIA,KAAa,MAAQA,IAAY,KAC7B,MAAMA,IAAY,MAEtBA,KAAa,MAAQA,IAAY,KAC7BA,IAAY,KAEhBA,KAAa,MAAQA,IAAY,MAC7BA,IAAY,KAEb;AACR,GAaMC,IAAe,SAASC,GAAOC,GAAM;AAG1C,SAAOD,IAAQ,KAAK,MAAMA,IAAQ,QAAQC,KAAQ,MAAM;AACzD,GAOMC,IAAQ,SAASC,GAAOC,GAAWC,GAAW;AACnD,MAAIC,IAAI;AAGR,OAFAH,IAAQE,IAAY9B,EAAM4B,IAAQ,GAAI,IAAIA,KAAS,GACnDA,KAAS5B,EAAM4B,IAAQC,CAAS,GACFD,IAAQ7B,IAAgB,MAAQ,GAAGgC,KAAK;AACrE,IAAAH,IAAQ5B,EAAM4B,IAAQ7B,CAAa;AAEpC,SAAOC,EAAM+B,KAAKhC,IAAgB,KAAK6B,KAASA,IAAQ,GAAK;AAC9D,GASMI,IAAS,SAASC,GAAO;AAE9B,QAAMjB,IAAS,CAAA,GACTkB,IAAcD,EAAM;AAC1B,MAAIE,IAAI,GACJC,IAAI,KACJC,IAAO,IAMPC,IAAQL,EAAM,YAAY,GAAS;AACvC,EAAIK,IAAQ,MACXA,IAAQ;AAGT,WAASC,IAAI,GAAGA,IAAID,GAAO,EAAEC;AAE5B,IAAIN,EAAM,WAAWM,CAAC,KAAK,OAC1BrC,EAAM,WAAW,GAElBc,EAAO,KAAKiB,EAAM,WAAWM,CAAC,CAAC;AAMhC,WAASC,IAAQF,IAAQ,IAAIA,IAAQ,IAAI,GAAGE,IAAQN,KAAwC;AAO3F,UAAMO,IAAON;AACb,aAASO,IAAI,GAAGX,IAAI,MAA0BA,KAAK,IAAM;AAExD,MAAIS,KAASN,KACZhC,EAAM,eAAe;AAGtB,YAAMuB,IAAQH,EAAaW,EAAM,WAAWO,GAAO,CAAC;AAEpD,MAAIf,KAAS,MACZvB,EAAM,eAAe,GAElBuB,IAAQzB,GAAO,aAASmC,KAAKO,CAAC,KACjCxC,EAAM,UAAU,GAGjBiC,KAAKV,IAAQiB;AACb,YAAMC,IAAIZ,KAAKM,IAAO,IAAQN,KAAKM,IAAO,KAAO,KAAON,IAAIM;AAE5D,UAAIZ,IAAQkB;AACX;AAGD,YAAMC,IAAa,KAAOD;AAC1B,MAAID,IAAI1C,EAAM,aAAS4C,CAAU,KAChC1C,EAAM,UAAU,GAGjBwC,KAAKE;AAAA,IAEN;AAEA,UAAMC,IAAM7B,EAAO,SAAS;AAC5B,IAAAqB,IAAOV,EAAMQ,IAAIM,GAAMI,GAAKJ,KAAQ,CAAC,GAIjCzC,EAAMmC,IAAIU,CAAG,IAAI,aAAST,KAC7BlC,EAAM,UAAU,GAGjBkC,KAAKpC,EAAMmC,IAAIU,CAAG,GAClBV,KAAKU,GAGL7B,EAAO,OAAOmB,KAAK,GAAGC,CAAC;AAAA,EAExB;AAEA,SAAO,OAAO,cAAc,GAAGpB,CAAM;AACtC,GASM8B,IAAS,SAASb,GAAO;AAC9B,QAAMjB,IAAS,CAAA;AAGf,EAAAiB,IAAQnB,EAAWmB,CAAK;AAGxB,QAAMC,IAAcD,EAAM;AAG1B,MAAIG,IAAI,KACJR,IAAQ,GACRS,IAAO;AAGX,aAAWU,KAAgBd;AAC1B,IAAIc,IAAe,OAClB/B,EAAO,KAAKf,EAAmB8C,CAAY,CAAC;AAI9C,QAAMC,IAAchC,EAAO;AAC3B,MAAIiC,IAAiBD;AAWrB,OALIA,KACHhC,EAAO,KAAK,GAAS,GAIfiC,IAAiBf,KAAa;AAIpC,QAAIgB,IAAI;AACR,eAAWH,KAAgBd;AAC1B,MAAIc,KAAgBX,KAAKW,IAAeG,MACvCA,IAAIH;AAMN,UAAMI,IAAwBF,IAAiB;AAC/C,IAAIC,IAAId,IAAIpC,GAAO,aAAS4B,KAASuB,CAAqB,KACzDjD,EAAM,UAAU,GAGjB0B,MAAUsB,IAAId,KAAKe,GACnBf,IAAIc;AAEJ,eAAWH,KAAgBd;AAI1B,UAHIc,IAAeX,KAAK,EAAER,IAAQ,cACjC1B,EAAM,UAAU,GAEb6C,MAAiBX,GAAG;AAEvB,YAAIgB,IAAIxB;AACR,iBAASG,IAAI,MAA0BA,KAAK,IAAM;AACjD,gBAAMY,IAAIZ,KAAKM,IAAO,IAAQN,KAAKM,IAAO,KAAO,KAAON,IAAIM;AAC5D,cAAIe,IAAIT;AACP;AAED,gBAAMU,IAAUD,IAAIT,GACdC,IAAa,KAAOD;AAC1B,UAAA3B,EAAO;AAAA,YACNf,EAAmBuB,EAAamB,IAAIU,IAAUT,GAAY,CAAC,CAAC;AAAA,UAClE,GACKQ,IAAIpD,EAAMqD,IAAUT,CAAU;AAAA,QAC/B;AAEA,QAAA5B,EAAO,KAAKf,EAAmBuB,EAAa4B,GAAG,CAAC,CAAC,CAAC,GAClDf,IAAOV,EAAMC,GAAOuB,GAAuBF,MAAmBD,CAAW,GACzEpB,IAAQ,GACR,EAAEqB;AAAA,MACH;AAGD,MAAErB,GACF,EAAEQ;AAAA,EAEH;AACA,SAAOpB,EAAO,KAAK,EAAE;AACtB,GAaMsC,IAAY,SAASrB,GAAO;AACjC,SAAOxB,EAAUwB,GAAO,SAASlB,GAAQ;AACxC,WAAOpB,EAAc,KAAKoB,CAAM,IAC7BiB,EAAOjB,EAAO,MAAM,CAAC,EAAE,YAAW,CAAE,IACpCA;AAAA,EACJ,CAAC;AACF,GAaMwC,IAAU,SAAStB,GAAO;AAC/B,SAAOxB,EAAUwB,GAAO,SAASlB,GAAQ;AACxC,WAAOnB,EAAc,KAAKmB,CAAM,IAC7B,SAAS+B,EAAO/B,CAAM,IACtBA;AAAA,EACJ,CAAC;AACF,GAKMyC,IAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMhB,SAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQX,MAAQ;AAAA,IACP,QAAU1C;AAAA,IACV,QAAUM;AAAA,EACZ;AAAA,EACC,QAAUY;AAAA,EACV,QAAUc;AAAA,EACV,SAAWS;AAAA,EACX,WAAaD;AACd;","x_google_ignoreList":[0]}

package/dist/chunks/vendor-rope-sequence-BWC2FSrq.js

@@ -0,0 +1,100 @@
+var l = 200, p = function() {
+};
+p.prototype.append = function(t) {
+  return t.length ? (t = p.from(t), !this.length && t || t.length < l && this.leafAppend(t) || this.length < l && t.leafPrepend(this) || this.appendInner(t)) : this;
+};
+p.prototype.prepend = function(t) {
+  return t.length ? p.from(t).append(this) : this;
+};
+p.prototype.appendInner = function(t) {
+  return new u(this, t);
+};
+p.prototype.slice = function(t, r) {
+  return t === void 0 && (t = 0), r === void 0 && (r = this.length), t >= r ? p.empty : this.sliceInner(Math.max(0, t), Math.min(this.length, r));
+};
+p.prototype.get = function(t) {
+  if (!(t < 0 || t >= this.length))
+    return this.getInner(t);
+};
+p.prototype.forEach = function(t, r, e) {
+  r === void 0 && (r = 0), e === void 0 && (e = this.length), r <= e ? this.forEachInner(t, r, e, 0) : this.forEachInvertedInner(t, r, e, 0);
+};
+p.prototype.map = function(t, r, e) {
+  r === void 0 && (r = 0), e === void 0 && (e = this.length);
+  var n = [];
+  return this.forEach(function(i, s) {
+    return n.push(t(i, s));
+  }, r, e), n;
+};
+p.from = function(t) {
+  return t instanceof p ? t : t && t.length ? new o(t) : p.empty;
+};
+var o = /* @__PURE__ */ (function(h) {
+  function t(e) {
+    h.call(this), this.values = e;
+  }
+  h && (t.__proto__ = h), t.prototype = Object.create(h && h.prototype), t.prototype.constructor = t;
+  var r = { length: { configurable: !0 }, depth: { configurable: !0 } };
+  return t.prototype.flatten = function() {
+    return this.values;
+  }, t.prototype.sliceInner = function(n, i) {
+    return n == 0 && i == this.length ? this : new t(this.values.slice(n, i));
+  }, t.prototype.getInner = function(n) {
+    return this.values[n];
+  }, t.prototype.forEachInner = function(n, i, s, f) {
+    for (var a = i; a < s; a++)
+      if (n(this.values[a], f + a) === !1)
+        return !1;
+  }, t.prototype.forEachInvertedInner = function(n, i, s, f) {
+    for (var a = i - 1; a >= s; a--)
+      if (n(this.values[a], f + a) === !1)
+        return !1;
+  }, t.prototype.leafAppend = function(n) {
+    if (this.length + n.length <= l)
+      return new t(this.values.concat(n.flatten()));
+  }, t.prototype.leafPrepend = function(n) {
+    if (this.length + n.length <= l)
+      return new t(n.flatten().concat(this.values));
+  }, r.length.get = function() {
+    return this.values.length;
+  }, r.depth.get = function() {
+    return 0;
+  }, Object.defineProperties(t.prototype, r), t;
+})(p);
+p.empty = new o([]);
+var u = /* @__PURE__ */ (function(h) {
+  function t(r, e) {
+    h.call(this), this.left = r, this.right = e, this.length = r.length + e.length, this.depth = Math.max(r.depth, e.depth) + 1;
+  }
+  return h && (t.__proto__ = h), t.prototype = Object.create(h && h.prototype), t.prototype.constructor = t, t.prototype.flatten = function() {
+    return this.left.flatten().concat(this.right.flatten());
+  }, t.prototype.getInner = function(e) {
+    return e < this.left.length ? this.left.get(e) : this.right.get(e - this.left.length);
+  }, t.prototype.forEachInner = function(e, n, i, s) {
+    var f = this.left.length;
+    if (n < f && this.left.forEachInner(e, n, Math.min(i, f), s) === !1 || i > f && this.right.forEachInner(e, Math.max(n - f, 0), Math.min(this.length, i) - f, s + f) === !1)
+      return !1;
+  }, t.prototype.forEachInvertedInner = function(e, n, i, s) {
+    var f = this.left.length;
+    if (n > f && this.right.forEachInvertedInner(e, n - f, Math.max(i, f) - f, s + f) === !1 || i < f && this.left.forEachInvertedInner(e, Math.min(n, f), i, s) === !1)
+      return !1;
+  }, t.prototype.sliceInner = function(e, n) {
+    if (e == 0 && n == this.length)
+      return this;
+    var i = this.left.length;
+    return n <= i ? this.left.slice(e, n) : e >= i ? this.right.slice(e - i, n - i) : this.left.slice(e, i).append(this.right.slice(0, n - i));
+  }, t.prototype.leafAppend = function(e) {
+    var n = this.right.leafAppend(e);
+    if (n)
+      return new t(this.left, n);
+  }, t.prototype.leafPrepend = function(e) {
+    var n = this.left.leafPrepend(e);
+    if (n)
+      return new t(n, this.right);
+  }, t.prototype.appendInner = function(e) {
+    return this.left.depth >= Math.max(this.right.depth, e.depth) + 1 ? new t(this.left, new t(this.right, e)) : new t(this, e);
+  }, t;
+})(p);
+export {
+  p as R
+};

package/dist/chunks/vendor-rope-sequence-BWC2FSrq.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vendor-rope-sequence-BWC2FSrq.js","sources":["../../../node_modules/rope-sequence/dist/index.js"],"sourcesContent":["var GOOD_LEAF_SIZE = 200;\n\n// :: class<T> A rope sequence is a persistent sequence data structure\n// that supports appending, prepending, and slicing without doing a\n// full copy. It is represented as a mostly-balanced tree.\nvar RopeSequence = function RopeSequence () {};\n\nRopeSequence.prototype.append = function append (other) {\n  if (!other.length) { return this }\n  other = RopeSequence.from(other);\n\n  return (!this.length && other) ||\n    (other.length < GOOD_LEAF_SIZE && this.leafAppend(other)) ||\n    (this.length < GOOD_LEAF_SIZE && other.leafPrepend(this)) ||\n    this.appendInner(other)\n};\n\n// :: (union<[T], RopeSequence<T>>) → RopeSequence<T>\n// Prepend an array or other rope to this one, returning a new rope.\nRopeSequence.prototype.prepend = function prepend (other) {\n  if (!other.length) { return this }\n  return RopeSequence.from(other).append(this)\n};\n\nRopeSequence.prototype.appendInner = function appendInner (other) {\n  return new Append(this, other)\n};\n\n// :: (?number, ?number) → RopeSequence<T>\n// Create a rope repesenting a sub-sequence of this rope.\nRopeSequence.prototype.slice = function slice (from, to) {\n    if ( from === void 0 ) from = 0;\n    if ( to === void 0 ) to = this.length;\n\n  if (from >= to) { return RopeSequence.empty }\n  return this.sliceInner(Math.max(0, from), Math.min(this.length, to))\n};\n\n// :: (number) → T\n// Retrieve the element at the given position from this rope.\nRopeSequence.prototype.get = function get (i) {\n  if (i < 0 || i >= this.length) { return undefined }\n  return this.getInner(i)\n};\n\n// :: ((element: T, index: number) → ?bool, ?number, ?number)\n// Call the given function for each element between the given\n// indices. This tends to be more efficient than looping over the\n// indices and calling `get`, because it doesn't have to descend the\n// tree for every element.\nRopeSequence.prototype.forEach = function forEach (f, from, to) {\n    if ( from === void 0 ) from = 0;\n    if ( to === void 0 ) to = this.length;\n\n  if (from <= to)\n    { this.forEachInner(f, from, to, 0); }\n  else\n    { this.forEachInvertedInner(f, from, to, 0); }\n};\n\n// :: ((element: T, index: number) → U, ?number, ?number) → [U]\n// Map the given functions over the elements of the rope, producing\n// a flat array.\nRopeSequence.prototype.map = function map (f, from, to) {\n    if ( from === void 0 ) from = 0;\n    if ( to === void 0 ) to = this.length;\n\n  var result = [];\n  this.forEach(function (elt, i) { return result.push(f(elt, i)); }, from, to);\n  return result\n};\n\n// :: (?union<[T], RopeSequence<T>>) → RopeSequence<T>\n// Create a rope representing the given array, or return the rope\n// itself if a rope was given.\nRopeSequence.from = function from (values) {\n  if (values instanceof RopeSequence) { return values }\n  return values && values.length ? new Leaf(values) : RopeSequence.empty\n};\n\nvar Leaf = /*@__PURE__*/(function (RopeSequence) {\n  function Leaf(values) {\n    RopeSequence.call(this);\n    this.values = values;\n  }\n\n  if ( RopeSequence ) Leaf.__proto__ = RopeSequence;\n  Leaf.prototype = Object.create( RopeSequence && RopeSequence.prototype );\n  Leaf.prototype.constructor = Leaf;\n\n  var prototypeAccessors = { length: { configurable: true },depth: { configurable: true } };\n\n  Leaf.prototype.flatten = function flatten () {\n    return this.values\n  };\n\n  Leaf.prototype.sliceInner = function sliceInner (from, to) {\n    if (from == 0 && to == this.length) { return this }\n    return new Leaf(this.values.slice(from, to))\n  };\n\n  Leaf.prototype.getInner = function getInner (i) {\n    return this.values[i]\n  };\n\n  Leaf.prototype.forEachInner = function forEachInner (f, from, to, start) {\n    for (var i = from; i < to; i++)\n      { if (f(this.values[i], start + i) === false) { return false } }\n  };\n\n  Leaf.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {\n    for (var i = from - 1; i >= to; i--)\n      { if (f(this.values[i], start + i) === false) { return false } }\n  };\n\n  Leaf.prototype.leafAppend = function leafAppend (other) {\n    if (this.length + other.length <= GOOD_LEAF_SIZE)\n      { return new Leaf(this.values.concat(other.flatten())) }\n  };\n\n  Leaf.prototype.leafPrepend = function leafPrepend (other) {\n    if (this.length + other.length <= GOOD_LEAF_SIZE)\n      { return new Leaf(other.flatten().concat(this.values)) }\n  };\n\n  prototypeAccessors.length.get = function () { return this.values.length };\n\n  prototypeAccessors.depth.get = function () { return 0 };\n\n  Object.defineProperties( Leaf.prototype, prototypeAccessors );\n\n  return Leaf;\n}(RopeSequence));\n\n// :: RopeSequence\n// The empty rope sequence.\nRopeSequence.empty = new Leaf([]);\n\nvar Append = /*@__PURE__*/(function (RopeSequence) {\n  function Append(left, right) {\n    RopeSequence.call(this);\n    this.left = left;\n    this.right = right;\n    this.length = left.length + right.length;\n    this.depth = Math.max(left.depth, right.depth) + 1;\n  }\n\n  if ( RopeSequence ) Append.__proto__ = RopeSequence;\n  Append.prototype = Object.create( RopeSequence && RopeSequence.prototype );\n  Append.prototype.constructor = Append;\n\n  Append.prototype.flatten = function flatten () {\n    return this.left.flatten().concat(this.right.flatten())\n  };\n\n  Append.prototype.getInner = function getInner (i) {\n    return i < this.left.length ? this.left.get(i) : this.right.get(i - this.left.length)\n  };\n\n  Append.prototype.forEachInner = function forEachInner (f, from, to, start) {\n    var leftLen = this.left.length;\n    if (from < leftLen &&\n        this.left.forEachInner(f, from, Math.min(to, leftLen), start) === false)\n      { return false }\n    if (to > leftLen &&\n        this.right.forEachInner(f, Math.max(from - leftLen, 0), Math.min(this.length, to) - leftLen, start + leftLen) === false)\n      { return false }\n  };\n\n  Append.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {\n    var leftLen = this.left.length;\n    if (from > leftLen &&\n        this.right.forEachInvertedInner(f, from - leftLen, Math.max(to, leftLen) - leftLen, start + leftLen) === false)\n      { return false }\n    if (to < leftLen &&\n        this.left.forEachInvertedInner(f, Math.min(from, leftLen), to, start) === false)\n      { return false }\n  };\n\n  Append.prototype.sliceInner = function sliceInner (from, to) {\n    if (from == 0 && to == this.length) { return this }\n    var leftLen = this.left.length;\n    if (to <= leftLen) { return this.left.slice(from, to) }\n    if (from >= leftLen) { return this.right.slice(from - leftLen, to - leftLen) }\n    return this.left.slice(from, leftLen).append(this.right.slice(0, to - leftLen))\n  };\n\n  Append.prototype.leafAppend = function leafAppend (other) {\n    var inner = this.right.leafAppend(other);\n    if (inner) { return new Append(this.left, inner) }\n  };\n\n  Append.prototype.leafPrepend = function leafPrepend (other) {\n    var inner = this.left.leafPrepend(other);\n    if (inner) { return new Append(inner, this.right) }\n  };\n\n  Append.prototype.appendInner = function appendInner (other) {\n    if (this.left.depth >= Math.max(this.right.depth, other.depth) + 1)\n      { return new Append(this.left, new Append(this.right, other)) }\n    return new Append(this, other)\n  };\n\n  return Append;\n}(RopeSequence));\n\nexport default RopeSequence;\n"],"names":["GOOD_LEAF_SIZE","RopeSequence","other","Append","from","to","i","f","result","elt","values","Leaf","prototypeAccessors","start","left","right","leftLen","inner"],"mappings":"AAAA,IAAIA,IAAiB,KAKjBC,IAAe,WAAyB;AAAC;AAE7CA,EAAa,UAAU,SAAS,SAAiBC,GAAO;AACtD,SAAKA,EAAM,UACXA,IAAQD,EAAa,KAAKC,CAAK,GAEvB,CAAC,KAAK,UAAUA,KACrBA,EAAM,SAASF,KAAkB,KAAK,WAAWE,CAAK,KACtD,KAAK,SAASF,KAAkBE,EAAM,YAAY,IAAI,KACvD,KAAK,YAAYA,CAAK,KANI;AAO9B;AAIAD,EAAa,UAAU,UAAU,SAAkBC,GAAO;AACxD,SAAKA,EAAM,SACJD,EAAa,KAAKC,CAAK,EAAE,OAAO,IAAI,IADf;AAE9B;AAEAD,EAAa,UAAU,cAAc,SAAsBC,GAAO;AAChE,SAAO,IAAIC,EAAO,MAAMD,CAAK;AAC/B;AAIAD,EAAa,UAAU,QAAQ,SAAgBG,GAAMC,GAAI;AAIvD,SAHOD,MAAS,WAASA,IAAO,IACzBC,MAAO,WAASA,IAAK,KAAK,SAE7BD,KAAQC,IAAaJ,EAAa,QAC/B,KAAK,WAAW,KAAK,IAAI,GAAGG,CAAI,GAAG,KAAK,IAAI,KAAK,QAAQC,CAAE,CAAC;AACrE;AAIAJ,EAAa,UAAU,MAAM,SAAcK,GAAG;AAC5C,MAAI,EAAAA,IAAI,KAAKA,KAAK,KAAK;AACvB,WAAO,KAAK,SAASA,CAAC;AACxB;AAOAL,EAAa,UAAU,UAAU,SAAkBM,GAAGH,GAAMC,GAAI;AAC5D,EAAKD,MAAS,WAASA,IAAO,IACzBC,MAAO,WAASA,IAAK,KAAK,SAE7BD,KAAQC,IACR,KAAK,aAAaE,GAAGH,GAAMC,GAAI,CAAC,IAEhC,KAAK,qBAAqBE,GAAGH,GAAMC,GAAI,CAAC;AAC9C;AAKAJ,EAAa,UAAU,MAAM,SAAcM,GAAGH,GAAMC,GAAI;AACpD,EAAKD,MAAS,WAASA,IAAO,IACzBC,MAAO,WAASA,IAAK,KAAK;AAEjC,MAAIG,IAAS,CAAA;AACb,cAAK,QAAQ,SAAUC,GAAKH,GAAG;AAAE,WAAOE,EAAO,KAAKD,EAAEE,GAAKH,CAAC,CAAC;AAAA,EAAG,GAAGF,GAAMC,CAAE,GACpEG;AACT;AAKAP,EAAa,OAAO,SAAeS,GAAQ;AACzC,SAAIA,aAAkBT,IAAuBS,IACtCA,KAAUA,EAAO,SAAS,IAAIC,EAAKD,CAAM,IAAIT,EAAa;AACnE;AAEA,IAAIU,IAAqB,0BAAUV,GAAc;AAC/C,WAASU,EAAKD,GAAQ;AACpB,IAAAT,EAAa,KAAK,IAAI,GACtB,KAAK,SAASS;AAAA,EAChB;AAEA,EAAKT,MAAeU,EAAK,YAAYV,IACrCU,EAAK,YAAY,OAAO,OAAQV,KAAgBA,EAAa,SAAS,GACtEU,EAAK,UAAU,cAAcA;AAE7B,MAAIC,IAAqB,EAAE,QAAQ,EAAE,cAAc,GAAI,GAAG,OAAO,EAAE,cAAc,KAAM;AAEvF,SAAAD,EAAK,UAAU,UAAU,WAAoB;AAC3C,WAAO,KAAK;AAAA,EACd,GAEAA,EAAK,UAAU,aAAa,SAAqBP,GAAMC,GAAI;AACzD,WAAID,KAAQ,KAAKC,KAAM,KAAK,SAAiB,OACtC,IAAIM,EAAK,KAAK,OAAO,MAAMP,GAAMC,CAAE,CAAC;AAAA,EAC7C,GAEAM,EAAK,UAAU,WAAW,SAAmBL,GAAG;AAC9C,WAAO,KAAK,OAAOA,CAAC;AAAA,EACtB,GAEAK,EAAK,UAAU,eAAe,SAAuBJ,GAAGH,GAAMC,GAAIQ,GAAO;AACvE,aAASP,IAAIF,GAAME,IAAID,GAAIC;AACvB,UAAIC,EAAE,KAAK,OAAOD,CAAC,GAAGO,IAAQP,CAAC,MAAM;AAAS,eAAO;AAAA,EAC3D,GAEAK,EAAK,UAAU,uBAAuB,SAA+BJ,GAAGH,GAAMC,GAAIQ,GAAO;AACvF,aAASP,IAAIF,IAAO,GAAGE,KAAKD,GAAIC;AAC5B,UAAIC,EAAE,KAAK,OAAOD,CAAC,GAAGO,IAAQP,CAAC,MAAM;AAAS,eAAO;AAAA,EAC3D,GAEAK,EAAK,UAAU,aAAa,SAAqBT,GAAO;AACtD,QAAI,KAAK,SAASA,EAAM,UAAUF;AAC9B,aAAO,IAAIW,EAAK,KAAK,OAAO,OAAOT,EAAM,QAAO,CAAE,CAAC;AAAA,EACzD,GAEAS,EAAK,UAAU,cAAc,SAAsBT,GAAO;AACxD,QAAI,KAAK,SAASA,EAAM,UAAUF;AAC9B,aAAO,IAAIW,EAAKT,EAAM,QAAO,EAAG,OAAO,KAAK,MAAM,CAAC;AAAA,EACzD,GAEAU,EAAmB,OAAO,MAAM,WAAY;AAAE,WAAO,KAAK,OAAO;AAAA,EAAO,GAExEA,EAAmB,MAAM,MAAM,WAAY;AAAE,WAAO;AAAA,EAAE,GAEtD,OAAO,iBAAkBD,EAAK,WAAWC,CAAkB,GAEpDD;AACT,GAAEV,CAAY;AAIdA,EAAa,QAAQ,IAAIU,EAAK,EAAE;AAEhC,IAAIR,IAAuB,0BAAUF,GAAc;AACjD,WAASE,EAAOW,GAAMC,GAAO;AAC3B,IAAAd,EAAa,KAAK,IAAI,GACtB,KAAK,OAAOa,GACZ,KAAK,QAAQC,GACb,KAAK,SAASD,EAAK,SAASC,EAAM,QAClC,KAAK,QAAQ,KAAK,IAAID,EAAK,OAAOC,EAAM,KAAK,IAAI;AAAA,EACnD;AAEA,SAAKd,MAAeE,EAAO,YAAYF,IACvCE,EAAO,YAAY,OAAO,OAAQF,KAAgBA,EAAa,SAAS,GACxEE,EAAO,UAAU,cAAcA,GAE/BA,EAAO,UAAU,UAAU,WAAoB;AAC7C,WAAO,KAAK,KAAK,QAAO,EAAG,OAAO,KAAK,MAAM,QAAO,CAAE;AAAA,EACxD,GAEAA,EAAO,UAAU,WAAW,SAAmBG,GAAG;AAChD,WAAOA,IAAI,KAAK,KAAK,SAAS,KAAK,KAAK,IAAIA,CAAC,IAAI,KAAK,MAAM,IAAIA,IAAI,KAAK,KAAK,MAAM;AAAA,EACtF,GAEAH,EAAO,UAAU,eAAe,SAAuBI,GAAGH,GAAMC,GAAIQ,GAAO;AACzE,QAAIG,IAAU,KAAK,KAAK;AAIxB,QAHIZ,IAAOY,KACP,KAAK,KAAK,aAAaT,GAAGH,GAAM,KAAK,IAAIC,GAAIW,CAAO,GAAGH,CAAK,MAAM,MAElER,IAAKW,KACL,KAAK,MAAM,aAAaT,GAAG,KAAK,IAAIH,IAAOY,GAAS,CAAC,GAAG,KAAK,IAAI,KAAK,QAAQX,CAAE,IAAIW,GAASH,IAAQG,CAAO,MAAM;AAClH,aAAO;AAAA,EACb,GAEAb,EAAO,UAAU,uBAAuB,SAA+BI,GAAGH,GAAMC,GAAIQ,GAAO;AACzF,QAAIG,IAAU,KAAK,KAAK;AAIxB,QAHIZ,IAAOY,KACP,KAAK,MAAM,qBAAqBT,GAAGH,IAAOY,GAAS,KAAK,IAAIX,GAAIW,CAAO,IAAIA,GAASH,IAAQG,CAAO,MAAM,MAEzGX,IAAKW,KACL,KAAK,KAAK,qBAAqBT,GAAG,KAAK,IAAIH,GAAMY,CAAO,GAAGX,GAAIQ,CAAK,MAAM;AAC1E,aAAO;AAAA,EACb,GAEAV,EAAO,UAAU,aAAa,SAAqBC,GAAMC,GAAI;AAC3D,QAAID,KAAQ,KAAKC,KAAM,KAAK;AAAU,aAAO;AAC7C,QAAIW,IAAU,KAAK,KAAK;AACxB,WAAIX,KAAMW,IAAkB,KAAK,KAAK,MAAMZ,GAAMC,CAAE,IAChDD,KAAQY,IAAkB,KAAK,MAAM,MAAMZ,IAAOY,GAASX,IAAKW,CAAO,IACpE,KAAK,KAAK,MAAMZ,GAAMY,CAAO,EAAE,OAAO,KAAK,MAAM,MAAM,GAAGX,IAAKW,CAAO,CAAC;AAAA,EAChF,GAEAb,EAAO,UAAU,aAAa,SAAqBD,GAAO;AACxD,QAAIe,IAAQ,KAAK,MAAM,WAAWf,CAAK;AACvC,QAAIe;AAAS,aAAO,IAAId,EAAO,KAAK,MAAMc,CAAK;AAAA,EACjD,GAEAd,EAAO,UAAU,cAAc,SAAsBD,GAAO;AAC1D,QAAIe,IAAQ,KAAK,KAAK,YAAYf,CAAK;AACvC,QAAIe;AAAS,aAAO,IAAId,EAAOc,GAAO,KAAK,KAAK;AAAA,EAClD,GAEAd,EAAO,UAAU,cAAc,SAAsBD,GAAO;AAC1D,WAAI,KAAK,KAAK,SAAS,KAAK,IAAI,KAAK,MAAM,OAAOA,EAAM,KAAK,IAAI,IACtD,IAAIC,EAAO,KAAK,MAAM,IAAIA,EAAO,KAAK,OAAOD,CAAK,CAAC,IACvD,IAAIC,EAAO,MAAMD,CAAK;AAAA,EAC/B,GAEOC;AACT,GAAEF,CAAY;","x_google_ignoreList":[0]}