@rpcbase/ui 0.213.0 → 0.215.0

package/dist/index165.js

@@ -1,8 +1,173 @@
-import e from "./index166.js";
-function n(t) {
-  return new e(t).getCountries();
+import w from "./index246.js";
+function p(r, e) {
+  var t = typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
+  if (t) return (t = t.call(r)).next.bind(t);
+  if (Array.isArray(r) || (t = S(r)) || e) {
+    t && (r = t);
+    var n = 0;
+    return function() {
+      return n >= r.length ? { done: !0 } : { done: !1, value: r[n++] };
+    };
+  }
+  throw new TypeError(`Invalid attempt to iterate non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+}
+function S(r, e) {
+  if (r) {
+    if (typeof r == "string") return v(r, e);
+    var t = {}.toString.call(r).slice(8, -1);
+    return t === "Object" && r.constructor && (t = r.constructor.name), t === "Map" || t === "Set" ? Array.from(r) : t === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? v(r, e) : void 0;
+  }
+}
+function v(r, e) {
+  (e == null || e > r.length) && (e = r.length);
+  for (var t = 0, n = Array(e); t < e; t++) n[t] = r[t];
+  return n;
+}
+function f(r) {
+  "@babel/helpers - typeof";
+  return f = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(e) {
+    return typeof e;
+  } : function(e) {
+    return e && typeof Symbol == "function" && e.constructor === Symbol && e !== Symbol.prototype ? "symbol" : typeof e;
+  }, f(r);
+}
+function C(r, e) {
+  if (!(r instanceof e)) throw new TypeError("Cannot call a class as a function");
+}
+function P(r, e) {
+  for (var t = 0; t < e.length; t++) {
+    var n = e[t];
+    n.enumerable = n.enumerable || !1, n.configurable = !0, "value" in n && (n.writable = !0), Object.defineProperty(r, O(n.key), n);
+  }
+}
+function A(r, e, t) {
+  return e && P(r.prototype, e), Object.defineProperty(r, "prototype", { writable: !1 }), r;
+}
+function O(r) {
+  var e = M(r, "string");
+  return f(e) == "symbol" ? e : e + "";
+}
+function M(r, e) {
+  if (f(r) != "object" || !r) return r;
+  var t = r[Symbol.toPrimitive];
+  if (t !== void 0) {
+    var n = t.call(r, e);
+    if (f(n) != "object") return n;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+  return String(r);
+}
+var E = /* @__PURE__ */ (function() {
+  function r(e) {
+    C(this, r), this.matchTree = new w().parse(e);
+  }
+  return A(r, [{
+    key: "match",
+    value: function(t) {
+      var n = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, i = n.allowOverflow;
+      if (!t)
+        throw new Error("String is required");
+      var o = l(t.split(""), this.matchTree, !0);
+      if (o && o.match && delete o.matchedChars, !(o && o.overflow && !i))
+        return o;
+    }
+  }]);
+})();
+function l(r, e, t) {
+  if (typeof e == "string") {
+    var n = r.join("");
+    return e.indexOf(n) === 0 ? r.length === e.length ? {
+      match: !0,
+      matchedChars: r
+    } : {
+      partialMatch: !0
+      // matchedChars: characters
+    } : n.indexOf(e) === 0 ? t && r.length > e.length ? {
+      overflow: !0
+    } : {
+      match: !0,
+      matchedChars: r.slice(0, e.length)
+    } : void 0;
+  }
+  if (Array.isArray(e)) {
+    for (var i = r.slice(), o = 0; o < e.length; ) {
+      var s = e[o], a = l(i, s, t && o === e.length - 1);
+      if (a) {
+        if (a.overflow)
+          return a;
+        if (a.match) {
+          if (i = i.slice(a.matchedChars.length), i.length === 0)
+            return o === e.length - 1 ? {
+              match: !0,
+              matchedChars: r
+            } : {
+              partialMatch: !0
+              // matchedChars: characters
+            };
+        } else {
+          if (a.partialMatch)
+            return {
+              partialMatch: !0
+              // matchedChars: characters
+            };
+          throw new Error(`Unsupported match result:
+`.concat(JSON.stringify(a, null, 2)));
+        }
+      } else return;
+      o++;
+    }
+    return t ? {
+      overflow: !0
+    } : {
+      match: !0,
+      matchedChars: r.slice(0, r.length - i.length)
+    };
+  }
+  switch (e.op) {
+    case "|":
+      for (var c, d = p(e.args), h; !(h = d()).done; ) {
+        var g = h.value, u = l(r, g, t);
+        if (u) {
+          if (u.overflow)
+            return u;
+          if (u.match)
+            return {
+              match: !0,
+              matchedChars: u.matchedChars
+            };
+          if (u.partialMatch)
+            c = !0;
+          else
+            throw new Error(`Unsupported match result:
+`.concat(JSON.stringify(u, null, 2)));
+        }
+      }
+      return c ? {
+        partialMatch: !0
+        // matchedChars: ...
+      } : void 0;
+    case "[]":
+      for (var b = p(e.args), m; !(m = b()).done; ) {
+        var y = m.value;
+        if (r[0] === y)
+          return r.length === 1 ? {
+            match: !0,
+            matchedChars: r
+          } : t ? {
+            overflow: !0
+          } : {
+            match: !0,
+            matchedChars: [y]
+          };
+      }
+      return;
+    /* istanbul ignore next */
+    default:
+      throw new Error("Unsupported instruction tree: ".concat(e));
+  }
 }
 export {
-  n as default
+  E as default
 };
 //# sourceMappingURL=index165.js.map

package/dist/index165.js.map

@@ -1 +1 @@
-{"version":3,"file":"index165.js","sources":["../../../node_modules/libphonenumber-js/es6/getCountries.js"],"sourcesContent":["import Metadata from './metadata.js';\nexport default function getCountries(metadata) {\n  return new Metadata(metadata).getCountries();\n}\n//# sourceMappingURL=getCountries.js.map"],"names":["getCountries","metadata","Metadata"],"mappings":";AACe,SAASA,EAAaC,GAAU;AAC7C,SAAO,IAAIC,EAASD,CAAQ,EAAE,aAAY;AAC5C;","x_google_ignoreList":[0]}
+{"version":3,"file":"index165.js","sources":["../../../node_modules/libphonenumber-js/es6/AsYouTypeFormatter.PatternMatcher.js"],"sourcesContent":["function _createForOfIteratorHelperLoose(r, e) { var t = \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"]; if (t) return (t = t.call(r)).next.bind(t); if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && \"number\" == typeof r.length) { t && (r = t); var o = 0; return function () { return o >= r.length ? { done: !0 } : { done: !1, value: r[o++] }; }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\nfunction _unsupportedIterableToArray(r, a) { if (r) { if (\"string\" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return \"Object\" === t && r.constructor && (t = r.constructor.name), \"Map\" === t || \"Set\" === t ? Array.from(r) : \"Arguments\" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }\nfunction _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }\nfunction _typeof(o) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o; }, _typeof(o); }\nfunction _classCallCheck(a, n) { if (!(a instanceof n)) throw new TypeError(\"Cannot call a class as a function\"); }\nfunction _defineProperties(e, r) { for (var t = 0; t < r.length; t++) { var o = r[t]; o.enumerable = o.enumerable || !1, o.configurable = !0, \"value\" in o && (o.writable = !0), Object.defineProperty(e, _toPropertyKey(o.key), o); } }\nfunction _createClass(e, r, t) { return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, \"prototype\", { writable: !1 }), e; }\nfunction _toPropertyKey(t) { var i = _toPrimitive(t, \"string\"); return \"symbol\" == _typeof(i) ? i : i + \"\"; }\nfunction _toPrimitive(t, r) { if (\"object\" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || \"default\"); if (\"object\" != _typeof(i)) return i; throw new TypeError(\"@@toPrimitive must return a primitive value.\"); } return (\"string\" === r ? String : Number)(t); }\nimport PatternParser from './AsYouTypeFormatter.PatternParser.js';\nvar PatternMatcher = /*#__PURE__*/function () {\n  function PatternMatcher(pattern) {\n    _classCallCheck(this, PatternMatcher);\n    this.matchTree = new PatternParser().parse(pattern);\n  }\n  return _createClass(PatternMatcher, [{\n    key: \"match\",\n    value: function match(string) {\n      var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n        allowOverflow = _ref.allowOverflow;\n      if (!string) {\n        throw new Error('String is required');\n      }\n      var result = _match(string.split(''), this.matchTree, true);\n      if (result && result.match) {\n        delete result.matchedChars;\n      }\n      if (result && result.overflow) {\n        if (!allowOverflow) {\n          return;\n        }\n      }\n      return result;\n    }\n  }]);\n}();\n/**\r\n * Matches `characters` against a pattern compiled into a `tree`.\r\n * @param  {string[]} characters\r\n * @param  {Tree} tree — A pattern compiled into a `tree`. See the `*.d.ts` file for the description of the `tree` structure.\r\n * @param  {boolean} last — Whether it's the last (rightmost) subtree on its level of the match tree.\r\n * @return {object} See the `*.d.ts` file for the description of the result object.\r\n */\nexport { PatternMatcher as default };\nfunction _match(characters, tree, last) {\n  // If `tree` is a string, then `tree` is a single character.\n  // That's because when a pattern is parsed, multi-character-string parts\n  // of a pattern are compiled into arrays of single characters.\n  // I still wrote this piece of code for a \"general\" hypothetical case\n  // when `tree` could be a string of several characters, even though\n  // such case is not possible with the current implementation.\n  if (typeof tree === 'string') {\n    var characterString = characters.join('');\n    if (tree.indexOf(characterString) === 0) {\n      // `tree` is always a single character.\n      // If `tree.indexOf(characterString) === 0`\n      // then `characters.length === tree.length`.\n      /* istanbul ignore else */\n      if (characters.length === tree.length) {\n        return {\n          match: true,\n          matchedChars: characters\n        };\n      }\n      // `tree` is always a single character.\n      // If `tree.indexOf(characterString) === 0`\n      // then `characters.length === tree.length`.\n      /* istanbul ignore next */\n      return {\n        partialMatch: true\n        // matchedChars: characters\n      };\n    }\n    if (characterString.indexOf(tree) === 0) {\n      if (last) {\n        // The `else` path is not possible because `tree` is always a single character.\n        // The `else` case for `characters.length > tree.length` would be\n        // `characters.length <= tree.length` which means `characters.length <= 1`.\n        // `characters` array can't be empty, so that means `characters === [tree]`,\n        // which would also mean `tree.indexOf(characterString) === 0` and that'd mean\n        // that the `if (tree.indexOf(characterString) === 0)` condition before this\n        // `if` condition would be entered, and returned from there, not reaching this code.\n        /* istanbul ignore else */\n        if (characters.length > tree.length) {\n          return {\n            overflow: true\n          };\n        }\n      }\n      return {\n        match: true,\n        matchedChars: characters.slice(0, tree.length)\n      };\n    }\n    return;\n  }\n  if (Array.isArray(tree)) {\n    var restCharacters = characters.slice();\n    var i = 0;\n    while (i < tree.length) {\n      var subtree = tree[i];\n      var result = _match(restCharacters, subtree, last && i === tree.length - 1);\n      if (!result) {\n        return;\n      } else if (result.overflow) {\n        return result;\n      } else if (result.match) {\n        // Continue with the next subtree with the rest of the characters.\n        restCharacters = restCharacters.slice(result.matchedChars.length);\n        if (restCharacters.length === 0) {\n          if (i === tree.length - 1) {\n            return {\n              match: true,\n              matchedChars: characters\n            };\n          } else {\n            return {\n              partialMatch: true\n              // matchedChars: characters\n            };\n          }\n        }\n      } else {\n        /* istanbul ignore else */\n        if (result.partialMatch) {\n          return {\n            partialMatch: true\n            // matchedChars: characters\n          };\n        } else {\n          throw new Error(\"Unsupported match result:\\n\".concat(JSON.stringify(result, null, 2)));\n        }\n      }\n      i++;\n    }\n    // If `last` then overflow has already been checked\n    // by the last element of the `tree` array.\n    /* istanbul ignore if */\n    if (last) {\n      return {\n        overflow: true\n      };\n    }\n    return {\n      match: true,\n      matchedChars: characters.slice(0, characters.length - restCharacters.length)\n    };\n  }\n  switch (tree.op) {\n    case '|':\n      var partialMatch;\n      for (var _iterator = _createForOfIteratorHelperLoose(tree.args), _step; !(_step = _iterator()).done;) {\n        var branch = _step.value;\n        var _result = _match(characters, branch, last);\n        if (_result) {\n          if (_result.overflow) {\n            return _result;\n          } else if (_result.match) {\n            return {\n              match: true,\n              matchedChars: _result.matchedChars\n            };\n          } else {\n            /* istanbul ignore else */\n            if (_result.partialMatch) {\n              partialMatch = true;\n            } else {\n              throw new Error(\"Unsupported match result:\\n\".concat(JSON.stringify(_result, null, 2)));\n            }\n          }\n        }\n      }\n      if (partialMatch) {\n        return {\n          partialMatch: true\n          // matchedChars: ...\n        };\n      }\n      // Not even a partial match.\n      return;\n    case '[]':\n      for (var _iterator2 = _createForOfIteratorHelperLoose(tree.args), _step2; !(_step2 = _iterator2()).done;) {\n        var _char = _step2.value;\n        if (characters[0] === _char) {\n          if (characters.length === 1) {\n            return {\n              match: true,\n              matchedChars: characters\n            };\n          }\n          if (last) {\n            return {\n              overflow: true\n            };\n          }\n          return {\n            match: true,\n            matchedChars: [_char]\n          };\n        }\n      }\n      // No character matches.\n      return;\n\n    /* istanbul ignore next */\n    default:\n      throw new Error(\"Unsupported instruction tree: \".concat(tree));\n  }\n}\n//# sourceMappingURL=AsYouTypeFormatter.PatternMatcher.js.map"],"names":["_createForOfIteratorHelperLoose","_unsupportedIterableToArray","o","a","_arrayLikeToArray","e","_typeof","_classCallCheck","n","_defineProperties","r","_toPropertyKey","_createClass","t","i","_toPrimitive","PatternMatcher","pattern","PatternParser","string","_ref","allowOverflow","result","_match","characters","tree","last","characterString","restCharacters","subtree","partialMatch","_iterator","_step","branch","_result","_iterator2","_step2","_char"],"mappings":";AAAA,SAASA,EAAgC,GAAG,GAAG;AAAE,MAAI,IAAmB,OAAO,SAAtB,OAAgC,EAAE,OAAO,QAAQ,KAAK,EAAE,YAAY;AAAG,MAAI,EAAG,SAAQ,IAAI,EAAE,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC;AAAG,MAAI,MAAM,QAAQ,CAAC,MAAM,IAAIC,EAA4B,CAAC,MAAM,GAAuC;AAAE,UAAM,IAAI;AAAI,QAAIC,IAAI;AAAG,WAAO,WAAY;AAAE,aAAOA,KAAK,EAAE,SAAS,EAAE,MAAM,GAAE,IAAK,EAAE,MAAM,IAAI,OAAO,EAAEA,GAAG,EAAC;AAAA,IAAI;AAAA,EAAG;AAAE,QAAM,IAAI,UAAU;AAAA,mFAAuI;AAAG;AACziB,SAASD,EAA4B,GAAGE,GAAG;AAAE,MAAI,GAAG;AAAE,QAAgB,OAAO,KAAnB,SAAsB,QAAOC,EAAkB,GAAGD,CAAC;AAAG,QAAI,IAAI,CAAA,EAAG,SAAS,KAAK,CAAC,EAAE,MAAM,GAAG,EAAE;AAAG,WAAoB,MAAb,YAAkB,EAAE,gBAAgB,IAAI,EAAE,YAAY,OAAiB,MAAV,SAAyB,MAAV,QAAc,MAAM,KAAK,CAAC,IAAoB,MAAhB,eAAqB,2CAA2C,KAAK,CAAC,IAAIC,EAAkB,GAAGD,CAAC,IAAI;AAAA,EAAQ;AAAE;AACzX,SAASC,EAAkB,GAAGD,GAAG;AAAE,GAASA,KAAR,QAAaA,IAAI,EAAE,YAAYA,IAAI,EAAE;AAAS,WAASE,IAAI,GAAG,IAAI,MAAMF,CAAC,GAAGE,IAAIF,GAAGE,IAAK,GAAEA,CAAC,IAAI,EAAEA,CAAC;AAAG,SAAO;AAAG;AACnJ,SAASC,EAAQJ,GAAG;AAAE;AAA2B,SAAOI,IAAwB,OAAO,UAArB,cAA2C,OAAO,OAAO,YAA1B,WAAqC,SAAUJ,GAAG;AAAE,WAAO,OAAOA;AAAA,EAAG,IAAI,SAAUA,GAAG;AAAE,WAAOA,KAAmB,OAAO,UAArB,cAA+BA,EAAE,gBAAgB,UAAUA,MAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,EAAG,GAAGI,EAAQJ,CAAC;AAAG;AAC7T,SAASK,EAAgBJ,GAAGK,GAAG;AAAE,MAAI,EAAEL,aAAaK,GAAI,OAAM,IAAI,UAAU,mCAAmC;AAAG;AAClH,SAASC,EAAkBJ,GAAGK,GAAG;AAAE,WAAS,IAAI,GAAG,IAAIA,EAAE,QAAQ,KAAK;AAAE,QAAIR,IAAIQ,EAAE,CAAC;AAAG,IAAAR,EAAE,aAAaA,EAAE,cAAc,IAAIA,EAAE,eAAe,IAAI,WAAWA,MAAMA,EAAE,WAAW,KAAK,OAAO,eAAeG,GAAGM,EAAeT,EAAE,GAAG,GAAGA,CAAC;AAAA,EAAG;AAAE;AACvO,SAASU,EAAaP,GAAGK,GAAG,GAAG;AAAE,SAAOA,KAAKD,EAAkBJ,EAAE,WAAWK,CAAC,GAAiC,OAAO,eAAeL,GAAG,aAAa,EAAE,UAAU,GAAE,CAAE,GAAGA;AAAG;AAC1K,SAASM,EAAeE,GAAG;AAAE,MAAIC,IAAIC,EAAaF,GAAG,QAAQ;AAAG,SAAmBP,EAAQQ,CAAC,KAArB,WAAyBA,IAAIA,IAAI;AAAI;AAC5G,SAASC,EAAaF,GAAGH,GAAG;AAAE,MAAgBJ,EAAQO,CAAC,KAArB,YAA0B,CAACA,EAAG,QAAOA;AAAG,MAAIR,IAAIQ,EAAE,OAAO,WAAW;AAAG,MAAeR,MAAX,QAAc;AAAE,QAAIS,IAAIT,EAAE,KAAKQ,GAAGH,CAAc;AAAG,QAAgBJ,EAAQQ,CAAC,KAArB,SAAwB,QAAOA;AAAG,UAAM,IAAI,UAAU,8CAA8C;AAAA,EAAG;AAAE,SAAyB,OAAiBD,CAAC;AAAG;AAExT,IAACG,IAA8B,4BAAY;AAC5C,WAASA,EAAeC,GAAS;AAC/B,IAAAV,EAAgB,MAAMS,CAAc,GACpC,KAAK,YAAY,IAAIE,EAAa,EAAG,MAAMD,CAAO;AAAA,EACpD;AACA,SAAOL,EAAaI,GAAgB,CAAC;AAAA,IACnC,KAAK;AAAA,IACL,OAAO,SAAeG,GAAQ;AAC5B,UAAIC,IAAO,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC7EC,IAAgBD,EAAK;AACvB,UAAI,CAACD;AACH,cAAM,IAAI,MAAM,oBAAoB;AAEtC,UAAIG,IAASC,EAAOJ,EAAO,MAAM,EAAE,GAAG,KAAK,WAAW,EAAI;AAI1D,UAHIG,KAAUA,EAAO,SACnB,OAAOA,EAAO,cAEZ,EAAAA,KAAUA,EAAO,YACf,CAACD;AAIP,eAAOC;AAAA,IACT;AAAA,EACJ,CAAG,CAAC;AACJ,GAAC;AASD,SAASC,EAAOC,GAAYC,GAAMC,GAAM;AAOtC,MAAI,OAAOD,KAAS,UAAU;AAC5B,QAAIE,IAAkBH,EAAW,KAAK,EAAE;AACxC,WAAIC,EAAK,QAAQE,CAAe,MAAM,IAKhCH,EAAW,WAAWC,EAAK,SACtB;AAAA,MACL,OAAO;AAAA,MACP,cAAcD;AAAA,IACxB,IAMa;AAAA,MACL,cAAc;AAAA;AAAA,IAEtB,IAEQG,EAAgB,QAAQF,CAAI,MAAM,IAChCC,KASEF,EAAW,SAASC,EAAK,SACpB;AAAA,MACL,UAAU;AAAA,IACtB,IAGa;AAAA,MACL,OAAO;AAAA,MACP,cAAcD,EAAW,MAAM,GAAGC,EAAK,MAAM;AAAA,IACrD,IAEI;AAAA,EACF;AACA,MAAI,MAAM,QAAQA,CAAI,GAAG;AAGvB,aAFIG,IAAiBJ,EAAW,MAAK,GACjCV,IAAI,GACDA,IAAIW,EAAK,UAAQ;AACtB,UAAII,IAAUJ,EAAKX,CAAC,GAChBQ,IAASC,EAAOK,GAAgBC,GAASH,KAAQZ,MAAMW,EAAK,SAAS,CAAC;AAC1E,UAAKH,GAEE;AAAA,YAAIA,EAAO;AAChB,iBAAOA;AACF,YAAIA,EAAO;AAGhB,cADAM,IAAiBA,EAAe,MAAMN,EAAO,aAAa,MAAM,GAC5DM,EAAe,WAAW;AAC5B,mBAAId,MAAMW,EAAK,SAAS,IACf;AAAA,cACL,OAAO;AAAA,cACP,cAAcD;AAAA,YAC5B,IAEmB;AAAA,cACL,cAAc;AAAA;AAAA,YAE5B;AAAA,eAGa;AAEL,cAAIF,EAAO;AACT,mBAAO;AAAA,cACL,cAAc;AAAA;AAAA,YAE1B;AAEU,gBAAM,IAAI,MAAM;AAAA,EAA8B,OAAO,KAAK,UAAUA,GAAQ,MAAM,CAAC,CAAC,CAAC;AAAA,QAEzF;AAAA,YA7BE;AA8BF,MAAAR;AAAA,IACF;AAIA,WAAIY,IACK;AAAA,MACL,UAAU;AAAA,IAClB,IAEW;AAAA,MACL,OAAO;AAAA,MACP,cAAcF,EAAW,MAAM,GAAGA,EAAW,SAASI,EAAe,MAAM;AAAA,IACjF;AAAA,EACE;AACA,UAAQH,EAAK,IAAE;AAAA,IACb,KAAK;AAEH,eADIK,GACKC,IAAY/B,EAAgCyB,EAAK,IAAI,GAAGO,GAAO,EAAEA,IAAQD,EAAS,GAAI,QAAO;AACpG,YAAIE,IAASD,EAAM,OACfE,IAAUX,EAAOC,GAAYS,GAAQP,CAAI;AAC7C,YAAIQ,GAAS;AACX,cAAIA,EAAQ;AACV,mBAAOA;AACF,cAAIA,EAAQ;AACjB,mBAAO;AAAA,cACL,OAAO;AAAA,cACP,cAAcA,EAAQ;AAAA,YACpC;AAGY,cAAIA,EAAQ;AACV,YAAAJ,IAAe;AAAA;AAEf,kBAAM,IAAI,MAAM;AAAA,EAA8B,OAAO,KAAK,UAAUI,GAAS,MAAM,CAAC,CAAC,CAAC;AAAA,QAG5F;AAAA,MACF;AACA,aAAIJ,IACK;AAAA,QACL,cAAc;AAAA;AAAA,MAExB,IAGM;AAAA,IACF,KAAK;AACH,eAASK,IAAanC,EAAgCyB,EAAK,IAAI,GAAGW,GAAQ,EAAEA,IAASD,EAAU,GAAI,QAAO;AACxG,YAAIE,IAAQD,EAAO;AACnB,YAAIZ,EAAW,CAAC,MAAMa;AACpB,iBAAIb,EAAW,WAAW,IACjB;AAAA,YACL,OAAO;AAAA,YACP,cAAcA;AAAA,UAC5B,IAEcE,IACK;AAAA,YACL,UAAU;AAAA,UACxB,IAEiB;AAAA,YACL,OAAO;AAAA,YACP,cAAc,CAACW,CAAK;AAAA,UAChC;AAAA,MAEM;AAEA;AAAA;AAAA,IAGF;AACE,YAAM,IAAI,MAAM,iCAAiC,OAAOZ,CAAI,CAAC;AAAA,EACnE;AACA;","x_google_ignoreList":[0]}