vue-files-preview-inno 1.0.38-e

package/es/node_modules/mdurl/lib/parse.mjs

@@ -0,0 +1,75 @@
+function p() {
+  this.protocol = null, this.slashes = null, this.auth = null, this.port = null, this.hostname = null, this.hash = null, this.search = null, this.pathname = null;
+}
+const A = /^([a-z0-9.+-]+:)/i, E = /:[0-9]*$/, k = /^(\/\/?(?!\/)[^\?\s]*)(\?[^\s]*)?$/, y = ["<", ">", '"', "`", " ", "\r", `
+`, "	"], I = ["{", "}", "|", "\\", "^", "`"].concat(y), L = ["'"].concat(I), j = ["%", "/", "?", ";", "#"].concat(L), w = ["/", "?", "#"], S = 255, v = /^[+a-z0-9A-Z_-]{0,63}$/, Z = /^([+a-z0-9A-Z_-]{0,63})(.*)$/, C = {
+  javascript: !0,
+  "javascript:": !0
+}, H = {
+  http: !0,
+  https: !0,
+  ftp: !0,
+  gopher: !0,
+  file: !0,
+  "http:": !0,
+  "https:": !0,
+  "ftp:": !0,
+  "gopher:": !0,
+  "file:": !0
+};
+function _(e, h) {
+  if (e && e instanceof p) return e;
+  const l = new p();
+  return l.parse(e, h), l;
+}
+p.prototype.parse = function(e, h) {
+  let l, o, m, t = e;
+  if (t = t.trim(), !h && e.split("#").length === 1) {
+    const s = k.exec(t);
+    if (s)
+      return this.pathname = s[1], s[2] && (this.search = s[2]), this;
+  }
+  let n = A.exec(t);
+  if (n && (n = n[0], l = n.toLowerCase(), this.protocol = n, t = t.substr(n.length)), (h || n || t.match(/^\/\/[^@\/]+@[^@\/]+/)) && (m = t.substr(0, 2) === "//", m && !(n && C[n]) && (t = t.substr(2), this.slashes = !0)), !C[n] && (m || n && !H[n])) {
+    let s = -1;
+    for (let i = 0; i < w.length; i++)
+      o = t.indexOf(w[i]), o !== -1 && (s === -1 || o < s) && (s = o);
+    let b, c;
+    s === -1 ? c = t.lastIndexOf("@") : c = t.lastIndexOf("@", s), c !== -1 && (b = t.slice(0, c), t = t.slice(c + 1), this.auth = b), s = -1;
+    for (let i = 0; i < j.length; i++)
+      o = t.indexOf(j[i]), o !== -1 && (s === -1 || o < s) && (s = o);
+    s === -1 && (s = t.length), t[s - 1] === ":" && s--;
+    const $ = t.slice(0, s);
+    t = t.slice(s), this.parseHost($), this.hostname = this.hostname || "";
+    const O = this.hostname[0] === "[" && this.hostname[this.hostname.length - 1] === "]";
+    if (!O) {
+      const i = this.hostname.split(/\./);
+      for (let f = 0, z = i.length; f < z; f++) {
+        const r = i[f];
+        if (r && !r.match(v)) {
+          let P = "";
+          for (let a = 0, u = r.length; a < u; a++)
+            r.charCodeAt(a) > 127 ? P += "x" : P += r[a];
+          if (!P.match(v)) {
+            const a = i.slice(0, f), u = i.slice(f + 1), x = r.match(Z);
+            x && (a.push(x[1]), u.unshift(x[2])), u.length && (t = u.join(".") + t), this.hostname = a.join(".");
+            break;
+          }
+        }
+      }
+    }
+    this.hostname.length > S && (this.hostname = ""), O && (this.hostname = this.hostname.substr(1, this.hostname.length - 2));
+  }
+  const g = t.indexOf("#");
+  g !== -1 && (this.hash = t.substr(g), t = t.slice(0, g));
+  const d = t.indexOf("?");
+  return d !== -1 && (this.search = t.substr(d), t = t.slice(0, d)), t && (this.pathname = t), H[l] && this.hostname && !this.pathname && (this.pathname = ""), this;
+};
+p.prototype.parseHost = function(e) {
+  let h = E.exec(e);
+  h && (h = h[0], h !== ":" && (this.port = h.substr(1)), e = e.substr(0, e.length - h.length)), e && (this.hostname = e);
+};
+export {
+  _ as default
+};
+//# sourceMappingURL=parse.mjs.map

package/es/node_modules/mdurl/lib/parse.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse.mjs","sources":["../../../../../node_modules/mdurl/lib/parse.mjs"],"sourcesContent":["// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n//\n// Changes from joyent/node:\n//\n// 1. No leading slash in paths,\n//    e.g. in `url.parse('http://foo?bar')` pathname is ``, not `/`\n//\n// 2. Backslashes are not replaced with slashes,\n//    so `http:\\\\example.org\\` is treated like a relative path\n//\n// 3. Trailing colon is treated like a part of the path,\n//    i.e. in `http://example.org:foo` pathname is `:foo`\n//\n// 4. Nothing is URL-encoded in the resulting object,\n//    (in joyent/node some chars in auth and paths are encoded)\n//\n// 5. `url.parse()` does not have `parseQueryString` argument\n//\n// 6. Removed extraneous result properties: `host`, `path`, `query`, etc.,\n//    which can be constructed using other parts of the url.\n//\n\nfunction Url () {\n  this.protocol = null\n  this.slashes = null\n  this.auth = null\n  this.port = null\n  this.hostname = null\n  this.hash = null\n  this.search = null\n  this.pathname = null\n}\n\n// Reference: RFC 3986, RFC 1808, RFC 2396\n\n// define these here so at least they only have to be\n// compiled once on the first module load.\nconst protocolPattern = /^([a-z0-9.+-]+:)/i\nconst portPattern = /:[0-9]*$/\n\n// Special case for a simple path URL\n/* eslint-disable-next-line no-useless-escape */\nconst simplePathPattern = /^(\\/\\/?(?!\\/)[^\\?\\s]*)(\\?[^\\s]*)?$/\n\n// RFC 2396: characters reserved for delimiting URLs.\n// We actually just auto-escape these.\nconst delims = ['<', '>', '\"', '`', ' ', '\\r', '\\n', '\\t']\n\n// RFC 2396: characters not allowed for various reasons.\nconst unwise = ['{', '}', '|', '\\\\', '^', '`'].concat(delims)\n\n// Allowed by RFCs, but cause of XSS attacks.  Always escape these.\nconst autoEscape = ['\\''].concat(unwise)\n// Characters that are never ever allowed in a hostname.\n// Note that any invalid chars are also handled, but these\n// are the ones that are *expected* to be seen, so we fast-path\n// them.\nconst nonHostChars = ['%', '/', '?', ';', '#'].concat(autoEscape)\nconst hostEndingChars = ['/', '?', '#']\nconst hostnameMaxLen = 255\nconst hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/\nconst hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/\n// protocols that can allow \"unsafe\" and \"unwise\" chars.\n// protocols that never have a hostname.\nconst hostlessProtocol = {\n  javascript: true,\n  'javascript:': true\n}\n// protocols that always contain a // bit.\nconst slashedProtocol = {\n  http: true,\n  https: true,\n  ftp: true,\n  gopher: true,\n  file: true,\n  'http:': true,\n  'https:': true,\n  'ftp:': true,\n  'gopher:': true,\n  'file:': true\n}\n\nfunction urlParse (url, slashesDenoteHost) {\n  if (url && url instanceof Url) return url\n\n  const u = new Url()\n  u.parse(url, slashesDenoteHost)\n  return u\n}\n\nUrl.prototype.parse = function (url, slashesDenoteHost) {\n  let lowerProto, hec, slashes\n  let rest = url\n\n  // trim before proceeding.\n  // This is to support parse stuff like \"  http://foo.com  \\n\"\n  rest = rest.trim()\n\n  if (!slashesDenoteHost && url.split('#').length === 1) {\n    // Try fast path regexp\n    const simplePath = simplePathPattern.exec(rest)\n    if (simplePath) {\n      this.pathname = simplePath[1]\n      if (simplePath[2]) {\n        this.search = simplePath[2]\n      }\n      return this\n    }\n  }\n\n  let proto = protocolPattern.exec(rest)\n  if (proto) {\n    proto = proto[0]\n    lowerProto = proto.toLowerCase()\n    this.protocol = proto\n    rest = rest.substr(proto.length)\n  }\n\n  // figure out if it's got a host\n  // user@server is *always* interpreted as a hostname, and url\n  // resolution will treat //foo/bar as host=foo,path=bar because that's\n  // how the browser resolves relative URLs.\n  /* eslint-disable-next-line no-useless-escape */\n  if (slashesDenoteHost || proto || rest.match(/^\\/\\/[^@\\/]+@[^@\\/]+/)) {\n    slashes = rest.substr(0, 2) === '//'\n    if (slashes && !(proto && hostlessProtocol[proto])) {\n      rest = rest.substr(2)\n      this.slashes = true\n    }\n  }\n\n  if (!hostlessProtocol[proto] &&\n      (slashes || (proto && !slashedProtocol[proto]))) {\n    // there's a hostname.\n    // the first instance of /, ?, ;, or # ends the host.\n    //\n    // If there is an @ in the hostname, then non-host chars *are* allowed\n    // to the left of the last @ sign, unless some host-ending character\n    // comes *before* the @-sign.\n    // URLs are obnoxious.\n    //\n    // ex:\n    // http://a@b@c/ => user:a@b host:c\n    // http://a@b?@c => user:a host:c path:/?@c\n\n    // v0.12 TODO(isaacs): This is not quite how Chrome does things.\n    // Review our test case against browsers more comprehensively.\n\n    // find the first instance of any hostEndingChars\n    let hostEnd = -1\n    for (let i = 0; i < hostEndingChars.length; i++) {\n      hec = rest.indexOf(hostEndingChars[i])\n      if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) {\n        hostEnd = hec\n      }\n    }\n\n    // at this point, either we have an explicit point where the\n    // auth portion cannot go past, or the last @ char is the decider.\n    let auth, atSign\n    if (hostEnd === -1) {\n      // atSign can be anywhere.\n      atSign = rest.lastIndexOf('@')\n    } else {\n      // atSign must be in auth portion.\n      // http://a@b/c@d => host:b auth:a path:/c@d\n      atSign = rest.lastIndexOf('@', hostEnd)\n    }\n\n    // Now we have a portion which is definitely the auth.\n    // Pull that off.\n    if (atSign !== -1) {\n      auth = rest.slice(0, atSign)\n      rest = rest.slice(atSign + 1)\n      this.auth = auth\n    }\n\n    // the host is the remaining to the left of the first non-host char\n    hostEnd = -1\n    for (let i = 0; i < nonHostChars.length; i++) {\n      hec = rest.indexOf(nonHostChars[i])\n      if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) {\n        hostEnd = hec\n      }\n    }\n    // if we still have not hit it, then the entire thing is a host.\n    if (hostEnd === -1) {\n      hostEnd = rest.length\n    }\n\n    if (rest[hostEnd - 1] === ':') { hostEnd-- }\n    const host = rest.slice(0, hostEnd)\n    rest = rest.slice(hostEnd)\n\n    // pull out port.\n    this.parseHost(host)\n\n    // we've indicated that there is a hostname,\n    // so even if it's empty, it has to be present.\n    this.hostname = this.hostname || ''\n\n    // if hostname begins with [ and ends with ]\n    // assume that it's an IPv6 address.\n    const ipv6Hostname = this.hostname[0] === '[' &&\n        this.hostname[this.hostname.length - 1] === ']'\n\n    // validate a little.\n    if (!ipv6Hostname) {\n      const hostparts = this.hostname.split(/\\./)\n      for (let i = 0, l = hostparts.length; i < l; i++) {\n        const part = hostparts[i]\n        if (!part) { continue }\n        if (!part.match(hostnamePartPattern)) {\n          let newpart = ''\n          for (let j = 0, k = part.length; j < k; j++) {\n            if (part.charCodeAt(j) > 127) {\n              // we replace non-ASCII char with a temporary placeholder\n              // we need this to make sure size of hostname is not\n              // broken by replacing non-ASCII by nothing\n              newpart += 'x'\n            } else {\n              newpart += part[j]\n            }\n          }\n          // we test again with ASCII char only\n          if (!newpart.match(hostnamePartPattern)) {\n            const validParts = hostparts.slice(0, i)\n            const notHost = hostparts.slice(i + 1)\n            const bit = part.match(hostnamePartStart)\n            if (bit) {\n              validParts.push(bit[1])\n              notHost.unshift(bit[2])\n            }\n            if (notHost.length) {\n              rest = notHost.join('.') + rest\n            }\n            this.hostname = validParts.join('.')\n            break\n          }\n        }\n      }\n    }\n\n    if (this.hostname.length > hostnameMaxLen) {\n      this.hostname = ''\n    }\n\n    // strip [ and ] from the hostname\n    // the host field still retains them, though\n    if (ipv6Hostname) {\n      this.hostname = this.hostname.substr(1, this.hostname.length - 2)\n    }\n  }\n\n  // chop off from the tail first.\n  const hash = rest.indexOf('#')\n  if (hash !== -1) {\n    // got a fragment string.\n    this.hash = rest.substr(hash)\n    rest = rest.slice(0, hash)\n  }\n  const qm = rest.indexOf('?')\n  if (qm !== -1) {\n    this.search = rest.substr(qm)\n    rest = rest.slice(0, qm)\n  }\n  if (rest) { this.pathname = rest }\n  if (slashedProtocol[lowerProto] &&\n      this.hostname && !this.pathname) {\n    this.pathname = ''\n  }\n\n  return this\n}\n\nUrl.prototype.parseHost = function (host) {\n  let port = portPattern.exec(host)\n  if (port) {\n    port = port[0]\n    if (port !== ':') {\n      this.port = port.substr(1)\n    }\n    host = host.substr(0, host.length - port.length)\n  }\n  if (host) { this.hostname = host }\n}\n\nexport default urlParse\n"],"names":["Url","protocolPattern","portPattern","simplePathPattern","delims","unwise","autoEscape","nonHostChars","hostEndingChars","hostnameMaxLen","hostnamePartPattern","hostnamePartStart","hostlessProtocol","slashedProtocol","urlParse","url","slashesDenoteHost","u","lowerProto","hec","slashes","rest","simplePath","proto","hostEnd","auth","atSign","host","ipv6Hostname","hostparts","i","l","part","newpart","j","k","validParts","notHost","bit","hash","qm","port"],"mappings":"AA0CA,SAASA,IAAO;AACd,OAAK,WAAW,MAChB,KAAK,UAAU,MACf,KAAK,OAAO,MACZ,KAAK,OAAO,MACZ,KAAK,WAAW,MAChB,KAAK,OAAO,MACZ,KAAK,SAAS,MACd,KAAK,WAAW;AAClB;AAMA,MAAMC,IAAkB,qBAClBC,IAAc,YAIdC,IAAoB,sCAIpBC,IAAS,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM;AAAA,GAAM,GAAI,GAGnDC,IAAS,CAAC,KAAK,KAAK,KAAK,MAAM,KAAK,GAAG,EAAE,OAAOD,CAAM,GAGtDE,IAAa,CAAC,GAAI,EAAE,OAAOD,CAAM,GAKjCE,IAAe,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,EAAE,OAAOD,CAAU,GAC1DE,IAAkB,CAAC,KAAK,KAAK,GAAG,GAChCC,IAAiB,KACjBC,IAAsB,0BACtBC,IAAoB,gCAGpBC,IAAmB;AAAA,EACvB,YAAY;AAAA,EACZ,eAAe;AACjB,GAEMC,IAAkB;AAAA,EACtB,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,SAAS;AAAA,EACT,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,SAAS;AACX;AAEA,SAASC,EAAUC,GAAKC,GAAmB;AACzC,MAAID,KAAOA,aAAef,EAAK,QAAOe;AAEtC,QAAME,IAAI,IAAIjB,EAAG;AACjB,SAAAiB,EAAE,MAAMF,GAAKC,CAAiB,GACvBC;AACT;AAEAjB,EAAI,UAAU,QAAQ,SAAUe,GAAKC,GAAmB;AACtD,MAAIE,GAAYC,GAAKC,GACjBC,IAAON;AAMX,MAFAM,IAAOA,EAAK,KAAI,GAEZ,CAACL,KAAqBD,EAAI,MAAM,GAAG,EAAE,WAAW,GAAG;AAErD,UAAMO,IAAanB,EAAkB,KAAKkB,CAAI;AAC9C,QAAIC;AACF,kBAAK,WAAWA,EAAW,CAAC,GACxBA,EAAW,CAAC,MACd,KAAK,SAASA,EAAW,CAAC,IAErB;AAAA,EAEX;AAEA,MAAIC,IAAQtB,EAAgB,KAAKoB,CAAI;AAqBrC,MApBIE,MACFA,IAAQA,EAAM,CAAC,GACfL,IAAaK,EAAM,YAAW,GAC9B,KAAK,WAAWA,GAChBF,IAAOA,EAAK,OAAOE,EAAM,MAAM,KAQ7BP,KAAqBO,KAASF,EAAK,MAAM,sBAAsB,OACjED,IAAUC,EAAK,OAAO,GAAG,CAAC,MAAM,MAC5BD,KAAW,EAAEG,KAASX,EAAiBW,CAAK,OAC9CF,IAAOA,EAAK,OAAO,CAAC,GACpB,KAAK,UAAU,MAIf,CAACT,EAAiBW,CAAK,MACtBH,KAAYG,KAAS,CAACV,EAAgBU,CAAK,IAAK;AAiBnD,QAAIC,IAAU;AACd,aAAS,IAAI,GAAG,IAAIhB,EAAgB,QAAQ;AAC1C,MAAAW,IAAME,EAAK,QAAQb,EAAgB,CAAC,CAAC,GACjCW,MAAQ,OAAOK,MAAY,MAAML,IAAMK,OACzCA,IAAUL;AAMd,QAAIM,GAAMC;AACV,IAAIF,MAAY,KAEdE,IAASL,EAAK,YAAY,GAAG,IAI7BK,IAASL,EAAK,YAAY,KAAKG,CAAO,GAKpCE,MAAW,OACbD,IAAOJ,EAAK,MAAM,GAAGK,CAAM,GAC3BL,IAAOA,EAAK,MAAMK,IAAS,CAAC,GAC5B,KAAK,OAAOD,IAIdD,IAAU;AACV,aAAS,IAAI,GAAG,IAAIjB,EAAa,QAAQ;AACvC,MAAAY,IAAME,EAAK,QAAQd,EAAa,CAAC,CAAC,GAC9BY,MAAQ,OAAOK,MAAY,MAAML,IAAMK,OACzCA,IAAUL;AAId,IAAIK,MAAY,OACdA,IAAUH,EAAK,SAGbA,EAAKG,IAAU,CAAC,MAAM,OAAOA;AACjC,UAAMG,IAAON,EAAK,MAAM,GAAGG,CAAO;AAClC,IAAAH,IAAOA,EAAK,MAAMG,CAAO,GAGzB,KAAK,UAAUG,CAAI,GAInB,KAAK,WAAW,KAAK,YAAY;AAIjC,UAAMC,IAAe,KAAK,SAAS,CAAC,MAAM,OACtC,KAAK,SAAS,KAAK,SAAS,SAAS,CAAC,MAAM;AAGhD,QAAI,CAACA,GAAc;AACjB,YAAMC,IAAY,KAAK,SAAS,MAAM,IAAI;AAC1C,eAASC,IAAI,GAAGC,IAAIF,EAAU,QAAQC,IAAIC,GAAGD,KAAK;AAChD,cAAME,IAAOH,EAAUC,CAAC;AACxB,YAAKE,KACD,CAACA,EAAK,MAAMtB,CAAmB,GAAG;AACpC,cAAIuB,IAAU;AACd,mBAASC,IAAI,GAAGC,IAAIH,EAAK,QAAQE,IAAIC,GAAGD;AACtC,YAAIF,EAAK,WAAWE,CAAC,IAAI,MAIvBD,KAAW,MAEXA,KAAWD,EAAKE,CAAC;AAIrB,cAAI,CAACD,EAAQ,MAAMvB,CAAmB,GAAG;AACvC,kBAAM0B,IAAaP,EAAU,MAAM,GAAGC,CAAC,GACjCO,IAAUR,EAAU,MAAMC,IAAI,CAAC,GAC/BQ,IAAMN,EAAK,MAAMrB,CAAiB;AACxC,YAAI2B,MACFF,EAAW,KAAKE,EAAI,CAAC,CAAC,GACtBD,EAAQ,QAAQC,EAAI,CAAC,CAAC,IAEpBD,EAAQ,WACVhB,IAAOgB,EAAQ,KAAK,GAAG,IAAIhB,IAE7B,KAAK,WAAWe,EAAW,KAAK,GAAG;AACnC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,IAAI,KAAK,SAAS,SAAS3B,MACzB,KAAK,WAAW,KAKdmB,MACF,KAAK,WAAW,KAAK,SAAS,OAAO,GAAG,KAAK,SAAS,SAAS,CAAC;AAAA,EAEpE;AAGA,QAAMW,IAAOlB,EAAK,QAAQ,GAAG;AAC7B,EAAIkB,MAAS,OAEX,KAAK,OAAOlB,EAAK,OAAOkB,CAAI,GAC5BlB,IAAOA,EAAK,MAAM,GAAGkB,CAAI;AAE3B,QAAMC,IAAKnB,EAAK,QAAQ,GAAG;AAC3B,SAAImB,MAAO,OACT,KAAK,SAASnB,EAAK,OAAOmB,CAAE,GAC5BnB,IAAOA,EAAK,MAAM,GAAGmB,CAAE,IAErBnB,MAAQ,KAAK,WAAWA,IACxBR,EAAgBK,CAAU,KAC1B,KAAK,YAAY,CAAC,KAAK,aACzB,KAAK,WAAW,KAGX;AACT;AAEAlB,EAAI,UAAU,YAAY,SAAU2B,GAAM;AACxC,MAAIc,IAAOvC,EAAY,KAAKyB,CAAI;AAChC,EAAIc,MACFA,IAAOA,EAAK,CAAC,GACTA,MAAS,QACX,KAAK,OAAOA,EAAK,OAAO,CAAC,IAE3Bd,IAAOA,EAAK,OAAO,GAAGA,EAAK,SAASc,EAAK,MAAM,IAE7Cd,MAAQ,KAAK,WAAWA;AAC9B;","x_google_ignoreList":[0]}

package/es/node_modules/path-webpack/path.mjs

@@ -0,0 +1,202 @@
+import { getDefaultExportFromCjs as h } from "../../_virtual/_commonjsHelpers.mjs";
+if (!C)
+  var C = {
+    cwd: function() {
+      return "/";
+    }
+  };
+function c(o) {
+  if (typeof o != "string")
+    throw new TypeError("Path must be a string. Received " + o);
+}
+function A(o, e) {
+  for (var r = "", i = -1, l = 0, f, n = 0; n <= o.length; ++n) {
+    if (n < o.length)
+      f = o.charCodeAt(n);
+    else {
+      if (f === 47)
+        break;
+      f = 47;
+    }
+    if (f === 47) {
+      if (!(i === n - 1 || l === 1)) if (i !== n - 1 && l === 2) {
+        if (r.length < 2 || r.charCodeAt(r.length - 1) !== 46 || r.charCodeAt(r.length - 2) !== 46) {
+          if (r.length > 2) {
+            for (var a = r.length - 1, t = a; t >= 0 && r.charCodeAt(t) !== 47; --t)
+              ;
+            if (t !== a) {
+              t === -1 ? r = "" : r = r.slice(0, t), i = n, l = 0;
+              continue;
+            }
+          } else if (r.length === 2 || r.length === 1) {
+            r = "", i = n, l = 0;
+            continue;
+          }
+        }
+        e && (r.length > 0 ? r += "/.." : r = "..");
+      } else
+        r.length > 0 ? r += "/" + o.slice(i + 1, n) : r = o.slice(i + 1, n);
+      i = n, l = 0;
+    } else f === 46 && l !== -1 ? ++l : l = -1;
+  }
+  return r;
+}
+function k(o, e) {
+  var r = e.dir || e.root, i = e.base || (e.name || "") + (e.ext || "");
+  return r ? r === e.root ? r + i : r + o + i : i;
+}
+var d = {
+  // path.resolve([from ...], to)
+  resolve: function() {
+    for (var e = "", r = !1, i, l = arguments.length - 1; l >= -1 && !r; l--) {
+      var f;
+      l >= 0 ? f = arguments[l] : (i === void 0 && (i = C.cwd()), f = i), c(f), f.length !== 0 && (e = f + "/" + e, r = f.charCodeAt(0) === 47);
+    }
+    return e = A(e, !r), r ? e.length > 0 ? "/" + e : "/" : e.length > 0 ? e : ".";
+  },
+  normalize: function(e) {
+    if (c(e), e.length === 0)
+      return ".";
+    var r = e.charCodeAt(0) === 47, i = e.charCodeAt(e.length - 1) === 47;
+    return e = A(e, !r), e.length === 0 && !r && (e = "."), e.length > 0 && i && (e += "/"), r ? "/" + e : e;
+  },
+  isAbsolute: function(e) {
+    return c(e), e.length > 0 && e.charCodeAt(0) === 47;
+  },
+  join: function() {
+    if (arguments.length === 0)
+      return ".";
+    for (var e, r = 0; r < arguments.length; ++r) {
+      var i = arguments[r];
+      c(i), i.length > 0 && (e === void 0 ? e = i : e += "/" + i);
+    }
+    return e === void 0 ? "." : d.normalize(e);
+  },
+  relative: function(e, r) {
+    if (c(e), c(r), e === r || (e = d.resolve(e), r = d.resolve(r), e === r))
+      return "";
+    for (var i = 1; i < e.length && e.charCodeAt(i) === 47; ++i)
+      ;
+    for (var l = e.length, f = l - i, n = 1; n < r.length && r.charCodeAt(n) === 47; ++n)
+      ;
+    for (var a = r.length, t = a - n, v = f < t ? f : t, u = -1, s = 0; s <= v; ++s) {
+      if (s === v) {
+        if (t > v) {
+          if (r.charCodeAt(n + s) === 47)
+            return r.slice(n + s + 1);
+          if (s === 0)
+            return r.slice(n + s);
+        } else f > v && (e.charCodeAt(i + s) === 47 ? u = s : s === 0 && (u = 0));
+        break;
+      }
+      var m = e.charCodeAt(i + s), b = r.charCodeAt(n + s);
+      if (m !== b)
+        break;
+      m === 47 && (u = s);
+    }
+    var g = "";
+    for (s = i + u + 1; s <= l; ++s)
+      (s === l || e.charCodeAt(s) === 47) && (g.length === 0 ? g += ".." : g += "/..");
+    return g.length > 0 ? g + r.slice(n + u) : (n += u, r.charCodeAt(n) === 47 && ++n, r.slice(n));
+  },
+  _makeLong: function(e) {
+    return e;
+  },
+  dirname: function(e) {
+    if (c(e), e.length === 0)
+      return ".";
+    for (var r = e.charCodeAt(0), i = r === 47, l = -1, f = !0, n = e.length - 1; n >= 1; --n)
+      if (r = e.charCodeAt(n), r === 47) {
+        if (!f) {
+          l = n;
+          break;
+        }
+      } else
+        f = !1;
+    return l === -1 ? i ? "/" : "." : i && l === 1 ? "//" : e.slice(0, l);
+  },
+  basename: function(e, r) {
+    if (r !== void 0 && typeof r != "string")
+      throw new TypeError('"ext" argument must be a string');
+    c(e);
+    var i = 0, l = -1, f = !0, n;
+    if (r !== void 0 && r.length > 0 && r.length <= e.length) {
+      if (r.length === e.length && r === e)
+        return "";
+      var a = r.length - 1, t = -1;
+      for (n = e.length - 1; n >= 0; --n) {
+        var v = e.charCodeAt(n);
+        if (v === 47) {
+          if (!f) {
+            i = n + 1;
+            break;
+          }
+        } else
+          t === -1 && (f = !1, t = n + 1), a >= 0 && (v === r.charCodeAt(a) ? --a === -1 && (l = n) : (a = -1, l = t));
+      }
+      return i === l ? l = t : l === -1 && (l = e.length), e.slice(i, l);
+    } else {
+      for (n = e.length - 1; n >= 0; --n)
+        if (e.charCodeAt(n) === 47) {
+          if (!f) {
+            i = n + 1;
+            break;
+          }
+        } else l === -1 && (f = !1, l = n + 1);
+      return l === -1 ? "" : e.slice(i, l);
+    }
+  },
+  extname: function(e) {
+    c(e);
+    for (var r = -1, i = 0, l = -1, f = !0, n = 0, a = e.length - 1; a >= 0; --a) {
+      var t = e.charCodeAt(a);
+      if (t === 47) {
+        if (!f) {
+          i = a + 1;
+          break;
+        }
+        continue;
+      }
+      l === -1 && (f = !1, l = a + 1), t === 46 ? r === -1 ? r = a : n !== 1 && (n = 1) : r !== -1 && (n = -1);
+    }
+    return r === -1 || l === -1 || // We saw a non-dot character immediately before the dot
+    n === 0 || // The (right-most) trimmed path component is exactly '..'
+    n === 1 && r === l - 1 && r === i + 1 ? "" : e.slice(r, l);
+  },
+  format: function(e) {
+    if (e === null || typeof e != "object")
+      throw new TypeError(
+        'Parameter "pathObject" must be an object, not ' + typeof e
+      );
+    return k("/", e);
+  },
+  parse: function(e) {
+    c(e);
+    var r = { root: "", dir: "", base: "", ext: "", name: "" };
+    if (e.length === 0)
+      return r;
+    var i = e.charCodeAt(0), l = i === 47, f;
+    l ? (r.root = "/", f = 1) : f = 0;
+    for (var n = -1, a = 0, t = -1, v = !0, u = e.length - 1, s = 0; u >= f; --u) {
+      if (i = e.charCodeAt(u), i === 47) {
+        if (!v) {
+          a = u + 1;
+          break;
+        }
+        continue;
+      }
+      t === -1 && (v = !1, t = u + 1), i === 46 ? n === -1 ? n = u : s !== 1 && (s = 1) : n !== -1 && (s = -1);
+    }
+    return n === -1 || t === -1 || // We saw a non-dot character immediately before the dot
+    s === 0 || // The (right-most) trimmed path component is exactly '..'
+    s === 1 && n === t - 1 && n === a + 1 ? t !== -1 && (a === 0 && l ? r.base = r.name = e.slice(1, t) : r.base = r.name = e.slice(a, t)) : (a === 0 && l ? (r.name = e.slice(1, n), r.base = e.slice(1, t)) : (r.name = e.slice(a, n), r.base = e.slice(a, t)), r.ext = e.slice(n, t)), a > 0 ? r.dir = e.slice(0, a - 1) : l && (r.dir = "/"), r;
+  },
+  sep: "/",
+  delimiter: ":",
+  posix: null
+}, w = d;
+const y = /* @__PURE__ */ h(w);
+export {
+  y as default
+};
+//# sourceMappingURL=path.mjs.map

package/es/node_modules/path-webpack/path.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"path.mjs","sources":["../../../../node_modules/path-webpack/path.js"],"sourcesContent":["'use strict';\n\nif (!process) {\n  var process = {\n    \"cwd\" : function () { return '/' }\n  };\n}\n\nfunction assertPath(path) {\n  if (typeof path !== 'string') {\n    throw new TypeError('Path must be a string. Received ' + path);\n  }\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeStringPosix(path, allowAboveRoot) {\n  var res = '';\n  var lastSlash = -1;\n  var dots = 0;\n  var code;\n  for (var i = 0; i <= path.length; ++i) {\n    if (i < path.length)\n      code = path.charCodeAt(i);\n    else if (code === 47/*/*/)\n      break;\n    else\n      code = 47/*/*/;\n    if (code === 47/*/*/) {\n      if (lastSlash === i - 1 || dots === 1) {\n        // NOOP\n      } else if (lastSlash !== i - 1 && dots === 2) {\n        if (res.length < 2 ||\n            res.charCodeAt(res.length - 1) !== 46/*.*/ ||\n            res.charCodeAt(res.length - 2) !== 46/*.*/) {\n          if (res.length > 2) {\n            var start = res.length - 1;\n            var j = start;\n            for (; j >= 0; --j) {\n              if (res.charCodeAt(j) === 47/*/*/)\n                break;\n            }\n            if (j !== start) {\n              if (j === -1)\n                res = '';\n              else\n                res = res.slice(0, j);\n              lastSlash = i;\n              dots = 0;\n              continue;\n            }\n          } else if (res.length === 2 || res.length === 1) {\n            res = '';\n            lastSlash = i;\n            dots = 0;\n            continue;\n          }\n        }\n        if (allowAboveRoot) {\n          if (res.length > 0)\n            res += '/..';\n          else\n            res = '..';\n        }\n      } else {\n        if (res.length > 0)\n          res += '/' + path.slice(lastSlash + 1, i);\n        else\n          res = path.slice(lastSlash + 1, i);\n      }\n      lastSlash = i;\n      dots = 0;\n    } else if (code === 46/*.*/ && dots !== -1) {\n      ++dots;\n    } else {\n      dots = -1;\n    }\n  }\n  return res;\n}\n\nfunction _format(sep, pathObject) {\n  var dir = pathObject.dir || pathObject.root;\n  var base = pathObject.base ||\n    ((pathObject.name || '') + (pathObject.ext || ''));\n  if (!dir) {\n    return base;\n  }\n  if (dir === pathObject.root) {\n    return dir + base;\n  }\n  return dir + sep + base;\n}\n\nvar posix = {\n  // path.resolve([from ...], to)\n  resolve: function resolve() {\n    var resolvedPath = '';\n    var resolvedAbsolute = false;\n    var cwd;\n\n    for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n      var path;\n      if (i >= 0)\n        path = arguments[i];\n      else {\n        if (cwd === undefined)\n          cwd = process.cwd();\n        path = cwd;\n      }\n\n      assertPath(path);\n\n      // Skip empty entries\n      if (path.length === 0) {\n        continue;\n      }\n\n      resolvedPath = path + '/' + resolvedPath;\n      resolvedAbsolute = path.charCodeAt(0) === 47/*/*/;\n    }\n\n    // At this point the path should be resolved to a full absolute path, but\n    // handle relative paths to be safe (might happen when process.cwd() fails)\n\n    // Normalize the path\n    resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute);\n\n    if (resolvedAbsolute) {\n      if (resolvedPath.length > 0)\n        return '/' + resolvedPath;\n      else\n        return '/';\n    } else if (resolvedPath.length > 0) {\n      return resolvedPath;\n    } else {\n      return '.';\n    }\n  },\n\n\n  normalize: function normalize(path) {\n    assertPath(path);\n\n    if (path.length === 0)\n      return '.';\n\n    var isAbsolute = path.charCodeAt(0) === 47/*/*/;\n    var trailingSeparator = path.charCodeAt(path.length - 1) === 47/*/*/;\n\n    // Normalize the path\n    path = normalizeStringPosix(path, !isAbsolute);\n\n    if (path.length === 0 && !isAbsolute)\n      path = '.';\n    if (path.length > 0 && trailingSeparator)\n      path += '/';\n\n    if (isAbsolute)\n      return '/' + path;\n    return path;\n  },\n\n\n  isAbsolute: function isAbsolute(path) {\n    assertPath(path);\n    return path.length > 0 && path.charCodeAt(0) === 47/*/*/;\n  },\n\n\n  join: function join() {\n    if (arguments.length === 0)\n      return '.';\n    var joined;\n    for (var i = 0; i < arguments.length; ++i) {\n      var arg = arguments[i];\n      assertPath(arg);\n      if (arg.length > 0) {\n        if (joined === undefined)\n          joined = arg;\n        else\n          joined += '/' + arg;\n      }\n    }\n    if (joined === undefined)\n      return '.';\n    return posix.normalize(joined);\n  },\n\n\n  relative: function relative(from, to) {\n    assertPath(from);\n    assertPath(to);\n\n    if (from === to)\n      return '';\n\n    from = posix.resolve(from);\n    to = posix.resolve(to);\n\n    if (from === to)\n      return '';\n\n    // Trim any leading backslashes\n    var fromStart = 1;\n    for (; fromStart < from.length; ++fromStart) {\n      if (from.charCodeAt(fromStart) !== 47/*/*/)\n        break;\n    }\n    var fromEnd = from.length;\n    var fromLen = (fromEnd - fromStart);\n\n    // Trim any leading backslashes\n    var toStart = 1;\n    for (; toStart < to.length; ++toStart) {\n      if (to.charCodeAt(toStart) !== 47/*/*/)\n        break;\n    }\n    var toEnd = to.length;\n    var toLen = (toEnd - toStart);\n\n    // Compare paths to find the longest common path from root\n    var length = (fromLen < toLen ? fromLen : toLen);\n    var lastCommonSep = -1;\n    var i = 0;\n    for (; i <= length; ++i) {\n      if (i === length) {\n        if (toLen > length) {\n          if (to.charCodeAt(toStart + i) === 47/*/*/) {\n            // We get here if `from` is the exact base path for `to`.\n            // For example: from='/foo/bar'; to='/foo/bar/baz'\n            return to.slice(toStart + i + 1);\n          } else if (i === 0) {\n            // We get here if `from` is the root\n            // For example: from='/'; to='/foo'\n            return to.slice(toStart + i);\n          }\n        } else if (fromLen > length) {\n          if (from.charCodeAt(fromStart + i) === 47/*/*/) {\n            // We get here if `to` is the exact base path for `from`.\n            // For example: from='/foo/bar/baz'; to='/foo/bar'\n            lastCommonSep = i;\n          } else if (i === 0) {\n            // We get here if `to` is the root.\n            // For example: from='/foo'; to='/'\n            lastCommonSep = 0;\n          }\n        }\n        break;\n      }\n      var fromCode = from.charCodeAt(fromStart + i);\n      var toCode = to.charCodeAt(toStart + i);\n      if (fromCode !== toCode)\n        break;\n      else if (fromCode === 47/*/*/)\n        lastCommonSep = i;\n    }\n\n    var out = '';\n    // Generate the relative path based on the path difference between `to`\n    // and `from`\n    for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n      if (i === fromEnd || from.charCodeAt(i) === 47/*/*/) {\n        if (out.length === 0)\n          out += '..';\n        else\n          out += '/..';\n      }\n    }\n\n    // Lastly, append the rest of the destination (`to`) path that comes after\n    // the common path parts\n    if (out.length > 0)\n      return out + to.slice(toStart + lastCommonSep);\n    else {\n      toStart += lastCommonSep;\n      if (to.charCodeAt(toStart) === 47/*/*/)\n        ++toStart;\n      return to.slice(toStart);\n    }\n  },\n\n\n  _makeLong: function _makeLong(path) {\n    return path;\n  },\n\n\n  dirname: function dirname(path) {\n    assertPath(path);\n    if (path.length === 0)\n      return '.';\n    var code = path.charCodeAt(0);\n    var hasRoot = (code === 47/*/*/);\n    var end = -1;\n    var matchedSlash = true;\n    for (var i = path.length - 1; i >= 1; --i) {\n      code = path.charCodeAt(i);\n      if (code === 47/*/*/) {\n        if (!matchedSlash) {\n          end = i;\n          break;\n        }\n      } else {\n        // We saw the first non-path separator\n        matchedSlash = false;\n      }\n    }\n\n    if (end === -1)\n      return hasRoot ? '/' : '.';\n    if (hasRoot && end === 1)\n      return '//';\n    return path.slice(0, end);\n  },\n\n\n  basename: function basename(path, ext) {\n    if (ext !== undefined && typeof ext !== 'string')\n      throw new TypeError('\"ext\" argument must be a string');\n    assertPath(path);\n\n    var start = 0;\n    var end = -1;\n    var matchedSlash = true;\n    var i;\n\n    if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n      if (ext.length === path.length && ext === path)\n        return '';\n      var extIdx = ext.length - 1;\n      var firstNonSlashEnd = -1;\n      for (i = path.length - 1; i >= 0; --i) {\n        var code = path.charCodeAt(i);\n        if (code === 47/*/*/) {\n          // If we reached a path separator that was not part of a set of path\n          // separators at the end of the string, stop now\n          if (!matchedSlash) {\n            start = i + 1;\n            break;\n          }\n        } else {\n          if (firstNonSlashEnd === -1) {\n            // We saw the first non-path separator, remember this index in case\n            // we need it if the extension ends up not matching\n            matchedSlash = false;\n            firstNonSlashEnd = i + 1;\n          }\n          if (extIdx >= 0) {\n            // Try to match the explicit extension\n            if (code === ext.charCodeAt(extIdx)) {\n              if (--extIdx === -1) {\n                // We matched the extension, so mark this as the end of our path\n                // component\n                end = i;\n              }\n            } else {\n              // Extension does not match, so our result is the entire path\n              // component\n              extIdx = -1;\n              end = firstNonSlashEnd;\n            }\n          }\n        }\n      }\n\n      if (start === end)\n        end = firstNonSlashEnd;\n      else if (end === -1)\n        end = path.length;\n      return path.slice(start, end);\n    } else {\n      for (i = path.length - 1; i >= 0; --i) {\n        if (path.charCodeAt(i) === 47/*/*/) {\n          // If we reached a path separator that was not part of a set of path\n          // separators at the end of the string, stop now\n          if (!matchedSlash) {\n            start = i + 1;\n            break;\n          }\n        } else if (end === -1) {\n          // We saw the first non-path separator, mark this as the end of our\n          // path component\n          matchedSlash = false;\n          end = i + 1;\n        }\n      }\n\n      if (end === -1)\n        return '';\n      return path.slice(start, end);\n    }\n  },\n\n\n  extname: function extname(path) {\n    assertPath(path);\n    var startDot = -1;\n    var startPart = 0;\n    var end = -1;\n    var matchedSlash = true;\n    // Track the state of characters (if any) we see before our first dot and\n    // after any path separator we find\n    var preDotState = 0;\n    for (var i = path.length - 1; i >= 0; --i) {\n      var code = path.charCodeAt(i);\n      if (code === 47/*/*/) {\n        // If we reached a path separator that was not part of a set of path\n        // separators at the end of the string, stop now\n        if (!matchedSlash) {\n          startPart = i + 1;\n          break;\n        }\n        continue;\n      }\n      if (end === -1) {\n        // We saw the first non-path separator, mark this as the end of our\n        // extension\n        matchedSlash = false;\n        end = i + 1;\n      }\n      if (code === 46/*.*/) {\n        // If this is our first dot, mark it as the start of our extension\n        if (startDot === -1)\n          startDot = i;\n        else if (preDotState !== 1)\n          preDotState = 1;\n      } else if (startDot !== -1) {\n        // We saw a non-dot and non-path separator before our dot, so we should\n        // have a good chance at having a non-empty extension\n        preDotState = -1;\n      }\n    }\n\n    if (startDot === -1 ||\n        end === -1 ||\n        // We saw a non-dot character immediately before the dot\n        preDotState === 0 ||\n        // The (right-most) trimmed path component is exactly '..'\n        (preDotState === 1 &&\n         startDot === end - 1 &&\n         startDot === startPart + 1)) {\n      return '';\n    }\n    return path.slice(startDot, end);\n  },\n\n\n  format: function format(pathObject) {\n    if (pathObject === null || typeof pathObject !== 'object') {\n      throw new TypeError(\n        'Parameter \"pathObject\" must be an object, not ' + typeof(pathObject)\n      );\n    }\n    return _format('/', pathObject);\n  },\n\n\n  parse: function parse(path) {\n    assertPath(path);\n\n    var ret = { root: '', dir: '', base: '', ext: '', name: '' };\n    if (path.length === 0)\n      return ret;\n    var code = path.charCodeAt(0);\n    var isAbsolute = (code === 47/*/*/);\n    var start;\n    if (isAbsolute) {\n      ret.root = '/';\n      start = 1;\n    } else {\n      start = 0;\n    }\n    var startDot = -1;\n    var startPart = 0;\n    var end = -1;\n    var matchedSlash = true;\n    var i = path.length - 1;\n\n    // Track the state of characters (if any) we see before our first dot and\n    // after any path separator we find\n    var preDotState = 0;\n\n    // Get non-dir info\n    for (; i >= start; --i) {\n      code = path.charCodeAt(i);\n      if (code === 47/*/*/) {\n        // If we reached a path separator that was not part of a set of path\n        // separators at the end of the string, stop now\n        if (!matchedSlash) {\n          startPart = i + 1;\n          break;\n        }\n        continue;\n      }\n      if (end === -1) {\n        // We saw the first non-path separator, mark this as the end of our\n        // extension\n        matchedSlash = false;\n        end = i + 1;\n      }\n      if (code === 46/*.*/) {\n        // If this is our first dot, mark it as the start of our extension\n        if (startDot === -1)\n          startDot = i;\n        else if (preDotState !== 1)\n          preDotState = 1;\n      } else if (startDot !== -1) {\n        // We saw a non-dot and non-path separator before our dot, so we should\n        // have a good chance at having a non-empty extension\n        preDotState = -1;\n      }\n    }\n\n    if (startDot === -1 ||\n        end === -1 ||\n        // We saw a non-dot character immediately before the dot\n        preDotState === 0 ||\n        // The (right-most) trimmed path component is exactly '..'\n        (preDotState === 1 &&\n         startDot === end - 1 &&\n         startDot === startPart + 1)) {\n      if (end !== -1) {\n        if (startPart === 0 && isAbsolute)\n          ret.base = ret.name = path.slice(1, end);\n        else\n          ret.base = ret.name = path.slice(startPart, end);\n      }\n    } else {\n      if (startPart === 0 && isAbsolute) {\n        ret.name = path.slice(1, startDot);\n        ret.base = path.slice(1, end);\n      } else {\n        ret.name = path.slice(startPart, startDot);\n        ret.base = path.slice(startPart, end);\n      }\n      ret.ext = path.slice(startDot, end);\n    }\n\n    if (startPart > 0)\n      ret.dir = path.slice(0, startPart - 1);\n    else if (isAbsolute)\n      ret.dir = '/';\n\n    return ret;\n  },\n\n\n  sep: '/',\n  delimiter: ':',\n  posix: null\n};\n\n\nmodule.exports = posix;\n"],"names":["process","assertPath","path","normalizeStringPosix","allowAboveRoot","res","lastSlash","dots","code","i","start","j","_format","sep","pathObject","dir","base","posix","resolvedPath","resolvedAbsolute","cwd","isAbsolute","trailingSeparator","joined","arg","from","to","fromStart","fromEnd","fromLen","toStart","toEnd","toLen","length","lastCommonSep","fromCode","toCode","out","hasRoot","end","matchedSlash","ext","extIdx","firstNonSlashEnd","startDot","startPart","preDotState","ret"],"mappings":";AAEA,IAAI,CAACA;AACH,MAAIA,IAAU;AAAA,IACZ,KAAQ,WAAY;AAAE,aAAO;AAAA,IAAG;AAAA,EACpC;AAGA,SAASC,EAAWC,GAAM;AACxB,MAAI,OAAOA,KAAS;AAClB,UAAM,IAAI,UAAU,qCAAqCA,CAAI;AAEjE;AAGA,SAASC,EAAqBD,GAAME,GAAgB;AAKlD,WAJIC,IAAM,IACNC,IAAY,IACZC,IAAO,GACPC,GACKC,IAAI,GAAGA,KAAKP,EAAK,QAAQ,EAAEO,GAAG;AACrC,QAAIA,IAAIP,EAAK;AACX,MAAAM,IAAON,EAAK,WAAWO,CAAC;AAAA,SACrB;AAAA,UAAID,MAAS;AAChB;AAEA,MAAAA,IAAO;AAAA;AACT,QAAIA,MAAS,IAAS;AACpB,UAAI,EAAAF,MAAcG,IAAI,KAAKF,MAAS,GAE7B,KAAID,MAAcG,IAAI,KAAKF,MAAS,GAAG;AAC5C,YAAIF,EAAI,SAAS,KACbA,EAAI,WAAWA,EAAI,SAAS,CAAC,MAAM,MACnCA,EAAI,WAAWA,EAAI,SAAS,CAAC,MAAM;AACrC,cAAIA,EAAI,SAAS,GAAG;AAGlB,qBAFIK,IAAQL,EAAI,SAAS,GACrBM,IAAID,GACDC,KAAK,KACNN,EAAI,WAAWM,CAAC,MAAM,IADb,EAAEA;AACf;AAGF,gBAAIA,MAAMD,GAAO;AACf,cAAIC,MAAM,KACRN,IAAM,KAENA,IAAMA,EAAI,MAAM,GAAGM,CAAC,GACtBL,IAAYG,GACZF,IAAO;AACP;AAAA,YACd;AAAA,UACA,WAAqBF,EAAI,WAAW,KAAKA,EAAI,WAAW,GAAG;AAC/C,YAAAA,IAAM,IACNC,IAAYG,GACZF,IAAO;AACP;AAAA,UACZ;AAAA;AAEQ,QAAIH,MACEC,EAAI,SAAS,IACfA,KAAO,QAEPA,IAAM;AAAA,MAElB;AACQ,QAAIA,EAAI,SAAS,IACfA,KAAO,MAAMH,EAAK,MAAMI,IAAY,GAAGG,CAAC,IAExCJ,IAAMH,EAAK,MAAMI,IAAY,GAAGG,CAAC;AAErC,MAAAH,IAAYG,GACZF,IAAO;AAAA,IACb,MAAW,CAAIC,MAAS,MAAWD,MAAS,KACtC,EAAEA,IAEFA,IAAO;AAAA,EAEb;AACE,SAAOF;AACT;AAEA,SAASO,EAAQC,GAAKC,GAAY;AAChC,MAAIC,IAAMD,EAAW,OAAOA,EAAW,MACnCE,IAAOF,EAAW,SAClBA,EAAW,QAAQ,OAAOA,EAAW,OAAO;AAChD,SAAKC,IAGDA,MAAQD,EAAW,OACdC,IAAMC,IAERD,IAAMF,IAAMG,IALVA;AAMX;AAEA,IAAIC,IAAQ;AAAA;AAAA,EAEV,SAAS,WAAmB;AAK1B,aAJIC,IAAe,IACfC,IAAmB,IACnBC,GAEKX,IAAI,UAAU,SAAS,GAAGA,KAAK,MAAM,CAACU,GAAkBV,KAAK;AACpE,UAAIP;AAYJ,MAXIO,KAAK,IACPP,IAAO,UAAUO,CAAC,KAEdW,MAAQ,WACVA,IAAMpB,EAAQ,IAAG,IACnBE,IAAOkB,IAGTnB,EAAWC,CAAI,GAGXA,EAAK,WAAW,MAIpBgB,IAAehB,IAAO,MAAMgB,GAC5BC,IAAmBjB,EAAK,WAAW,CAAC,MAAM;AAAA,IAChD;AAQI,WAFAgB,IAAef,EAAqBe,GAAc,CAACC,CAAgB,GAE/DA,IACED,EAAa,SAAS,IACjB,MAAMA,IAEN,MACAA,EAAa,SAAS,IACxBA,IAEA;AAAA,EAEb;AAAA,EAGE,WAAW,SAAmBhB,GAAM;AAGlC,QAFAD,EAAWC,CAAI,GAEXA,EAAK,WAAW;AAClB,aAAO;AAET,QAAImB,IAAanB,EAAK,WAAW,CAAC,MAAM,IACpCoB,IAAoBpB,EAAK,WAAWA,EAAK,SAAS,CAAC,MAAM;AAU7D,WAPAA,IAAOC,EAAqBD,GAAM,CAACmB,CAAU,GAEzCnB,EAAK,WAAW,KAAK,CAACmB,MACxBnB,IAAO,MACLA,EAAK,SAAS,KAAKoB,MACrBpB,KAAQ,MAENmB,IACK,MAAMnB,IACRA;AAAA,EACX;AAAA,EAGE,YAAY,SAAoBA,GAAM;AACpC,WAAAD,EAAWC,CAAI,GACRA,EAAK,SAAS,KAAKA,EAAK,WAAW,CAAC,MAAM;AAAA,EACrD;AAAA,EAGE,MAAM,WAAgB;AACpB,QAAI,UAAU,WAAW;AACvB,aAAO;AAET,aADIqB,GACKd,IAAI,GAAGA,IAAI,UAAU,QAAQ,EAAEA,GAAG;AACzC,UAAIe,IAAM,UAAUf,CAAC;AACrB,MAAAR,EAAWuB,CAAG,GACVA,EAAI,SAAS,MACXD,MAAW,SACbA,IAASC,IAETD,KAAU,MAAMC;AAAA,IAE1B;AACI,WAAID,MAAW,SACN,MACFN,EAAM,UAAUM,CAAM;AAAA,EACjC;AAAA,EAGE,UAAU,SAAkBE,GAAMC,GAAI;AAUpC,QATAzB,EAAWwB,CAAI,GACfxB,EAAWyB,CAAE,GAETD,MAASC,MAGbD,IAAOR,EAAM,QAAQQ,CAAI,GACzBC,IAAKT,EAAM,QAAQS,CAAE,GAEjBD,MAASC;AACX,aAAO;AAIT,aADIC,IAAY,GACTA,IAAYF,EAAK,UAClBA,EAAK,WAAWE,CAAS,MAAM,IADL,EAAEA;AAChC;AAQF,aALIC,IAAUH,EAAK,QACfI,IAAWD,IAAUD,GAGrBG,IAAU,GACPA,IAAUJ,EAAG,UACdA,EAAG,WAAWI,CAAO,MAAM,IADL,EAAEA;AAC5B;AAUF,aAPIC,IAAQL,EAAG,QACXM,IAASD,IAAQD,GAGjBG,IAAUJ,IAAUG,IAAQH,IAAUG,GACtCE,IAAgB,IAChBzB,IAAI,GACDA,KAAKwB,GAAQ,EAAExB,GAAG;AACvB,UAAIA,MAAMwB,GAAQ;AAChB,YAAID,IAAQC,GAAQ;AAClB,cAAIP,EAAG,WAAWI,IAAUrB,CAAC,MAAM;AAGjC,mBAAOiB,EAAG,MAAMI,IAAUrB,IAAI,CAAC;AAC1B,cAAIA,MAAM;AAGf,mBAAOiB,EAAG,MAAMI,IAAUrB,CAAC;AAAA,QAEvC,MAAe,CAAIoB,IAAUI,MACfR,EAAK,WAAWE,IAAYlB,CAAC,MAAM,KAGrCyB,IAAgBzB,IACPA,MAAM,MAGfyB,IAAgB;AAGpB;AAAA,MACR;AACM,UAAIC,IAAWV,EAAK,WAAWE,IAAYlB,CAAC,GACxC2B,IAASV,EAAG,WAAWI,IAAUrB,CAAC;AACtC,UAAI0B,MAAaC;AACf;AACG,MAAID,MAAa,OACpBD,IAAgBzB;AAAA,IACxB;AAEI,QAAI4B,IAAM;AAGV,SAAK5B,IAAIkB,IAAYO,IAAgB,GAAGzB,KAAKmB,GAAS,EAAEnB;AACtD,OAAIA,MAAMmB,KAAWH,EAAK,WAAWhB,CAAC,MAAM,QACtC4B,EAAI,WAAW,IACjBA,KAAO,OAEPA,KAAO;AAMb,WAAIA,EAAI,SAAS,IACRA,IAAMX,EAAG,MAAMI,IAAUI,CAAa,KAE7CJ,KAAWI,GACPR,EAAG,WAAWI,CAAO,MAAM,MAC7B,EAAEA,GACGJ,EAAG,MAAMI,CAAO;AAAA,EAE7B;AAAA,EAGE,WAAW,SAAmB5B,GAAM;AAClC,WAAOA;AAAA,EACX;AAAA,EAGE,SAAS,SAAiBA,GAAM;AAE9B,QADAD,EAAWC,CAAI,GACXA,EAAK,WAAW;AAClB,aAAO;AAKT,aAJIM,IAAON,EAAK,WAAW,CAAC,GACxBoC,IAAW9B,MAAS,IACpB+B,IAAM,IACNC,IAAe,IACV/B,IAAIP,EAAK,SAAS,GAAGO,KAAK,GAAG,EAAEA;AAEtC,UADAD,IAAON,EAAK,WAAWO,CAAC,GACpBD,MAAS;AACX,YAAI,CAACgC,GAAc;AACjB,UAAAD,IAAM9B;AACN;AAAA,QACV;AAAA;AAGQ,QAAA+B,IAAe;AAInB,WAAID,MAAQ,KACHD,IAAU,MAAM,MACrBA,KAAWC,MAAQ,IACd,OACFrC,EAAK,MAAM,GAAGqC,CAAG;AAAA,EAC5B;AAAA,EAGE,UAAU,SAAkBrC,GAAMuC,GAAK;AACrC,QAAIA,MAAQ,UAAa,OAAOA,KAAQ;AACtC,YAAM,IAAI,UAAU,iCAAiC;AACvD,IAAAxC,EAAWC,CAAI;AAEf,QAAIQ,IAAQ,GACR6B,IAAM,IACNC,IAAe,IACf/B;AAEJ,QAAIgC,MAAQ,UAAaA,EAAI,SAAS,KAAKA,EAAI,UAAUvC,EAAK,QAAQ;AACpE,UAAIuC,EAAI,WAAWvC,EAAK,UAAUuC,MAAQvC;AACxC,eAAO;AACT,UAAIwC,IAASD,EAAI,SAAS,GACtBE,IAAmB;AACvB,WAAKlC,IAAIP,EAAK,SAAS,GAAGO,KAAK,GAAG,EAAEA,GAAG;AACrC,YAAID,IAAON,EAAK,WAAWO,CAAC;AAC5B,YAAID,MAAS;AAGX,cAAI,CAACgC,GAAc;AACjB,YAAA9B,IAAQD,IAAI;AACZ;AAAA,UACZ;AAAA;AAEU,UAAIkC,MAAqB,OAGvBH,IAAe,IACfG,IAAmBlC,IAAI,IAErBiC,KAAU,MAERlC,MAASiC,EAAI,WAAWC,CAAM,IAC5B,EAAEA,MAAW,OAGfH,IAAM9B,MAKRiC,IAAS,IACTH,IAAMI;AAAA,MAIpB;AAEM,aAAIjC,MAAU6B,IACZA,IAAMI,IACCJ,MAAQ,OACfA,IAAMrC,EAAK,SACNA,EAAK,MAAMQ,GAAO6B,CAAG;AAAA,IAClC,OAAW;AACL,WAAK9B,IAAIP,EAAK,SAAS,GAAGO,KAAK,GAAG,EAAEA;AAClC,YAAIP,EAAK,WAAWO,CAAC,MAAM;AAGzB,cAAI,CAAC+B,GAAc;AACjB,YAAA9B,IAAQD,IAAI;AACZ;AAAA,UACZ;AAAA,cACe,CAAI8B,MAAQ,OAGjBC,IAAe,IACfD,IAAM9B,IAAI;AAId,aAAI8B,MAAQ,KACH,KACFrC,EAAK,MAAMQ,GAAO6B,CAAG;AAAA,IAClC;AAAA,EACA;AAAA,EAGE,SAAS,SAAiBrC,GAAM;AAC9B,IAAAD,EAAWC,CAAI;AAQf,aAPI0C,IAAW,IACXC,IAAY,GACZN,IAAM,IACNC,IAAe,IAGfM,IAAc,GACTrC,IAAIP,EAAK,SAAS,GAAGO,KAAK,GAAG,EAAEA,GAAG;AACzC,UAAID,IAAON,EAAK,WAAWO,CAAC;AAC5B,UAAID,MAAS,IAAS;AAGpB,YAAI,CAACgC,GAAc;AACjB,UAAAK,IAAYpC,IAAI;AAChB;AAAA,QACV;AACQ;AAAA,MACR;AACM,MAAI8B,MAAQ,OAGVC,IAAe,IACfD,IAAM9B,IAAI,IAERD,MAAS,KAEPoC,MAAa,KACfA,IAAWnC,IACJqC,MAAgB,MACvBA,IAAc,KACPF,MAAa,OAGtBE,IAAc;AAAA,IAEtB;AAEI,WAAIF,MAAa,MACbL,MAAQ;AAAA,IAERO,MAAgB;AAAA,IAEfA,MAAgB,KAChBF,MAAaL,IAAM,KACnBK,MAAaC,IAAY,IACrB,KAEF3C,EAAK,MAAM0C,GAAUL,CAAG;AAAA,EACnC;AAAA,EAGE,QAAQ,SAAgBzB,GAAY;AAClC,QAAIA,MAAe,QAAQ,OAAOA,KAAe;AAC/C,YAAM,IAAI;AAAA,QACR,mDAAmD,OAAOA;AAAA,MAClE;AAEI,WAAOF,EAAQ,KAAKE,CAAU;AAAA,EAClC;AAAA,EAGE,OAAO,SAAeZ,GAAM;AAC1B,IAAAD,EAAWC,CAAI;AAEf,QAAI6C,IAAM,EAAE,MAAM,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,MAAM,GAAE;AAC1D,QAAI7C,EAAK,WAAW;AAClB,aAAO6C;AACT,QAAIvC,IAAON,EAAK,WAAW,CAAC,GACxBmB,IAAcb,MAAS,IACvBE;AACJ,IAAIW,KACF0B,EAAI,OAAO,KACXrC,IAAQ,KAERA,IAAQ;AAaV,aAXIkC,IAAW,IACXC,IAAY,GACZN,IAAM,IACNC,IAAe,IACf/B,IAAIP,EAAK,SAAS,GAIlB4C,IAAc,GAGXrC,KAAKC,GAAO,EAAED,GAAG;AAEtB,UADAD,IAAON,EAAK,WAAWO,CAAC,GACpBD,MAAS,IAAS;AAGpB,YAAI,CAACgC,GAAc;AACjB,UAAAK,IAAYpC,IAAI;AAChB;AAAA,QACV;AACQ;AAAA,MACR;AACM,MAAI8B,MAAQ,OAGVC,IAAe,IACfD,IAAM9B,IAAI,IAERD,MAAS,KAEPoC,MAAa,KACfA,IAAWnC,IACJqC,MAAgB,MACvBA,IAAc,KACPF,MAAa,OAGtBE,IAAc;AAAA,IAEtB;AAEI,WAAIF,MAAa,MACbL,MAAQ;AAAA,IAERO,MAAgB;AAAA,IAEfA,MAAgB,KAChBF,MAAaL,IAAM,KACnBK,MAAaC,IAAY,IACxBN,MAAQ,OACNM,MAAc,KAAKxB,IACrB0B,EAAI,OAAOA,EAAI,OAAO7C,EAAK,MAAM,GAAGqC,CAAG,IAEvCQ,EAAI,OAAOA,EAAI,OAAO7C,EAAK,MAAM2C,GAAWN,CAAG,MAG/CM,MAAc,KAAKxB,KACrB0B,EAAI,OAAO7C,EAAK,MAAM,GAAG0C,CAAQ,GACjCG,EAAI,OAAO7C,EAAK,MAAM,GAAGqC,CAAG,MAE5BQ,EAAI,OAAO7C,EAAK,MAAM2C,GAAWD,CAAQ,GACzCG,EAAI,OAAO7C,EAAK,MAAM2C,GAAWN,CAAG,IAEtCQ,EAAI,MAAM7C,EAAK,MAAM0C,GAAUL,CAAG,IAGhCM,IAAY,IACdE,EAAI,MAAM7C,EAAK,MAAM,GAAG2C,IAAY,CAAC,IAC9BxB,MACP0B,EAAI,MAAM,MAELA;AAAA,EACX;AAAA,EAGE,KAAK;AAAA,EACL,WAAW;AAAA,EACX,OAAO;AACT,GAGA7C,IAAiBe;;","x_google_ignoreList":[0]}

package/es/node_modules/punycode.js/punycode.es6.mjs

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

package/es/node_modules/punycode.js/punycode.es6.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"punycode.es6.mjs","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":["delimiter","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":"AAaA,MAAMA,IAAY,KAGZC,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;AAUK,MAACI,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,YAAYvC,CAAS;AACvC,EAAI4C,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,KAAKtB,CAAS,GAIfuD,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]}