@fangzhongya/vue-archive 0.0.2-8 → 0.0.2

package/dist/es/node_modules/.pnpm/punycode@2.3.0/node_modules/punycode/punycode.es6.js

@@ -1,117 +1,218 @@
-const M = "-", B = /^xn--/, S = /[^\0-\x7F]/, T = /[\x2E\u3002\uFF0E\uFF61]/g, D = {
-  overflow: "Overflow: input needs wider integers to process",
+const maxInt = 2147483647;
+const base = 36;
+const tMin = 1;
+const tMax = 26;
+const skew = 38;
+const damp = 700;
+const initialBias = 72;
+const initialN = 128;
+const delimiter = "-";
+const regexPunycode = /^xn--/;
+const regexNonASCII = /[^\0-\x7F]/;
+const regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g;
+const errors = {
+  "overflow": "Overflow: input needs wider integers to process",
   "not-basic": "Illegal input >= 0x80 (not a basic code point)",
   "invalid-input": "Invalid input"
-}, C = 36 - 1, u = Math.floor, g = String.fromCharCode;
-function d(t) {
-  throw new RangeError(D[t]);
+};
+const baseMinusTMin = base - tMin;
+const floor = Math.floor;
+const stringFromCharCode = String.fromCharCode;
+function error(type) {
+  throw new RangeError(errors[type]);
 }
-function E(t, n) {
-  const o = [];
-  let e = t.length;
-  for (; e--; )
-    o[e] = n(t[e]);
-  return o;
+function map(array, callback) {
+  const result = [];
+  let length = array.length;
+  while (length--) {
+    result[length] = callback(array[length]);
+  }
+  return result;
 }
-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 mapDomain(domain, callback) {
+  const parts = domain.split("@");
+  let result = "";
+  if (parts.length > 1) {
+    result = parts[0] + "@";
+    domain = parts[1];
+  }
+  domain = domain.replace(regexSeparators, ".");
+  const labels = domain.split(".");
+  const encoded = map(labels, callback).join(".");
+  return result + encoded;
 }
-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);
+function ucs2decode(string) {
+  const output = [];
+  let counter = 0;
+  const length = string.length;
+  while (counter < length) {
+    const value = string.charCodeAt(counter++);
+    if (value >= 55296 && value <= 56319 && counter < length) {
+      const extra = string.charCodeAt(counter++);
+      if ((extra & 64512) == 56320) {
+        output.push(((value & 1023) << 10) + (extra & 1023) + 65536);
+      } else {
+        output.push(value);
+        counter--;
+      }
+    } else {
+      output.push(value);
+    }
   }
-  return n;
+  return output;
 }
-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)
+const ucs2encode = (codePoints) => String.fromCodePoint(...codePoints);
+const basicToDigit = function(codePoint) {
+  if (codePoint >= 48 && codePoint < 58) {
+    return 26 + (codePoint - 48);
+  }
+  if (codePoint >= 65 && codePoint < 91) {
+    return codePoint - 65;
+  }
+  if (codePoint >= 97 && codePoint < 123) {
+    return codePoint - 97;
+  }
+  return base;
+};
+const digitToBasic = function(digit, flag) {
+  return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);
+};
+const adapt = function(delta, numPoints, firstTime) {
+  let k = 0;
+  delta = firstTime ? floor(delta / damp) : delta >> 1;
+  delta += floor(delta / numPoints);
+  for (; delta > baseMinusTMin * tMax >> 1; k += base) {
+    delta = floor(delta / baseMinusTMin);
+  }
+  return floor(k + (baseMinusTMin + 1) * delta / (delta + skew));
+};
+const decode = function(input) {
+  const output = [];
+  const inputLength = input.length;
+  let i = 0;
+  let n = initialN;
+  let bias = initialBias;
+  let basic = input.lastIndexOf(delimiter);
+  if (basic < 0) {
+    basic = 0;
+  }
+  for (let j = 0; j < basic; ++j) {
+    if (input.charCodeAt(j) >= 128) {
+      error("not-basic");
+    }
+    output.push(input.charCodeAt(j));
+  }
+  for (let index = basic > 0 ? basic + 1 : 0; index < inputLength; ) {
+    const oldi = i;
+    for (let w = 1, k = base; ; k += base) {
+      if (index >= inputLength) {
+        error("invalid-input");
+      }
+      const digit = basicToDigit(input.charCodeAt(index++));
+      if (digit >= base) {
+        error("invalid-input");
+      }
+      if (digit > floor((maxInt - i) / w)) {
+        error("overflow");
+      }
+      i += digit * w;
+      const t = k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;
+      if (digit < t) {
         break;
-      const p = 36 - b;
-      a > u(2147483647 / p) && d("overflow"), a *= p;
+      }
+      const baseMinusT = base - t;
+      if (w > floor(maxInt / baseMinusT)) {
+        error("overflow");
+      }
+      w *= baseMinusT;
+    }
+    const out = output.length + 1;
+    bias = adapt(i - oldi, out, oldi == 0);
+    if (floor(i / out) > maxInt - n) {
+      error("overflow");
     }
-    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);
+    n += floor(i / out);
+    i %= out;
+    output.splice(i++, 0, n);
+  }
+  return String.fromCodePoint(...output);
+};
+const encode = function(input) {
+  const output = [];
+  input = ucs2decode(input);
+  const inputLength = input.length;
+  let n = initialN;
+  let delta = 0;
+  let bias = initialBias;
+  for (const currentValue of input) {
+    if (currentValue < 128) {
+      output.push(stringFromCharCode(currentValue));
+    }
+  }
+  const basicLength = output.length;
+  let handledCPCount = basicLength;
+  if (basicLength) {
+    output.push(delimiter);
   }
-  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)
+  while (handledCPCount < inputLength) {
+    let m = maxInt;
+    for (const currentValue of input) {
+      if (currentValue >= n && currentValue < m) {
+        m = currentValue;
+      }
+    }
+    const handledCPCountPlusOne = handledCPCount + 1;
+    if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {
+      error("overflow");
+    }
+    delta += (m - n) * handledCPCountPlusOne;
+    n = m;
+    for (const currentValue of input) {
+      if (currentValue < n && ++delta > maxInt) {
+        error("overflow");
+      }
+      if (currentValue === n) {
+        let q = delta;
+        for (let k = base; ; k += base) {
+          const t = k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;
+          if (q < t) {
             break;
-          const p = f - b, w = 36 - b;
-          n.push(
-            g(I(b + p % w, 0))
-          ), f = u(p / w);
+          }
+          const qMinusT = q - t;
+          const baseMinusT = base - t;
+          output.push(
+            stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))
+          );
+          q = floor(qMinusT / baseMinusT);
         }
-        n.push(g(I(f, 0))), c = F(s, h, i === l), s = 0, ++i;
+        output.push(stringFromCharCode(digitToBasic(q, 0)));
+        bias = adapt(delta, handledCPCountPlusOne, handledCPCount === basicLength);
+        delta = 0;
+        ++handledCPCount;
       }
-    ++s, ++e;
+    }
+    ++delta;
+    ++n;
   }
-  return n.join("");
-}, j = function(t) {
-  return m(t, function(n) {
-    return B.test(n) ? A(n.slice(4).toLowerCase()) : n;
+  return output.join("");
+};
+const toUnicode = function(input) {
+  return mapDomain(input, function(string) {
+    return regexPunycode.test(string) ? decode(string.slice(4).toLowerCase()) : string;
   });
-}, O = function(t) {
-  return m(t, function(n) {
-    return S.test(n) ? "xn--" + k(n) : n;
+};
+const toASCII = function(input) {
+  return mapDomain(input, function(string) {
+    return regexNonASCII.test(string) ? "xn--" + encode(string) : string;
   });
-}, V = {
+};
+const punycode = {
   /**
    * A string representing the current Punycode.js version number.
    * @memberOf punycode
    * @type String
    */
-  version: "2.1.0",
+  "version": "2.1.0",
   /**
    * An object of methods to convert from JavaScript's internal character
    * representation (UCS-2) to Unicode code points, and back.
@@ -119,21 +220,21 @@ const L = (t) => String.fromCodePoint(...t), N = function(t) {
    * @memberOf punycode
    * @type Object
    */
-  ucs2: {
-    decode: v,
-    encode: L
+  "ucs2": {
+    "decode": ucs2decode,
+    "encode": ucs2encode
   },
-  decode: A,
-  encode: k,
-  toASCII: O,
-  toUnicode: j
+  "decode": decode,
+  "encode": encode,
+  "toASCII": toASCII,
+  "toUnicode": toUnicode
 };
 export {
-  A as decode,
-  V as default,
-  k as encode,
-  O as toASCII,
-  j as toUnicode,
-  v as ucs2decode,
-  L as ucs2encode
+  decode,
+  punycode as default,
+  encode,
+  toASCII,
+  toUnicode,
+  ucs2decode,
+  ucs2encode
 };

package/dist/es/node_modules/.pnpm/uc.micro@1.0.6/node_modules/uc.micro/categories/Cc/regex.js

@@ -1,7 +1,12 @@
-var e, r;
-function x() {
-  return r || (r = 1, e = /[\0-\x1F\x7F-\x9F]/), e;
+var regex;
+var hasRequiredRegex;
+function requireRegex() {
+  if (hasRequiredRegex)
+    return regex;
+  hasRequiredRegex = 1;
+  regex = /[\0-\x1F\x7F-\x9F]/;
+  return regex;
 }
 export {
-  x as __require
+  requireRegex as __require
 };

package/dist/es/node_modules/.pnpm/uc.micro@1.0.6/node_modules/uc.micro/categories/Cf/regex.js

@@ -1,7 +1,12 @@
-var u, D;
-function e() {
-  return D || (D = 1, u = /[\xAD\u0600-\u0605\u061C\u06DD\u070F\u08E2\u180E\u200B-\u200F\u202A-\u202E\u2060-\u2064\u2066-\u206F\uFEFF\uFFF9-\uFFFB]|\uD804[\uDCBD\uDCCD]|\uD82F[\uDCA0-\uDCA3]|\uD834[\uDD73-\uDD7A]|\uDB40[\uDC01\uDC20-\uDC7F]/), u;
+var regex;
+var hasRequiredRegex;
+function requireRegex() {
+  if (hasRequiredRegex)
+    return regex;
+  hasRequiredRegex = 1;
+  regex = /[\xAD\u0600-\u0605\u061C\u06DD\u070F\u08E2\u180E\u200B-\u200F\u202A-\u202E\u2060-\u2064\u2066-\u206F\uFEFF\uFFF9-\uFFFB]|\uD804[\uDCBD\uDCCD]|\uD82F[\uDCA0-\uDCA3]|\uD834[\uDD73-\uDD7A]|\uDB40[\uDC01\uDC20-\uDC7F]/;
+  return regex;
 }
 export {
-  e as __require
+  requireRegex as __require
 };

package/dist/es/node_modules/.pnpm/uc.micro@1.0.6/node_modules/uc.micro/categories/P/regex.js

@@ -1,4 +1,4 @@
-var u = /[!-#%-\*,-\/:;\?@\[-\]_\{\}\xA1\xA7\xAB\xB6\xB7\xBB\xBF\u037E\u0387\u055A-\u055F\u0589\u058A\u05BE\u05C0\u05C3\u05C6\u05F3\u05F4\u0609\u060A\u060C\u060D\u061B\u061E\u061F\u066A-\u066D\u06D4\u0700-\u070D\u07F7-\u07F9\u0830-\u083E\u085E\u0964\u0965\u0970\u09FD\u0A76\u0AF0\u0C84\u0DF4\u0E4F\u0E5A\u0E5B\u0F04-\u0F12\u0F14\u0F3A-\u0F3D\u0F85\u0FD0-\u0FD4\u0FD9\u0FDA\u104A-\u104F\u10FB\u1360-\u1368\u1400\u166D\u166E\u169B\u169C\u16EB-\u16ED\u1735\u1736\u17D4-\u17D6\u17D8-\u17DA\u1800-\u180A\u1944\u1945\u1A1E\u1A1F\u1AA0-\u1AA6\u1AA8-\u1AAD\u1B5A-\u1B60\u1BFC-\u1BFF\u1C3B-\u1C3F\u1C7E\u1C7F\u1CC0-\u1CC7\u1CD3\u2010-\u2027\u2030-\u2043\u2045-\u2051\u2053-\u205E\u207D\u207E\u208D\u208E\u2308-\u230B\u2329\u232A\u2768-\u2775\u27C5\u27C6\u27E6-\u27EF\u2983-\u2998\u29D8-\u29DB\u29FC\u29FD\u2CF9-\u2CFC\u2CFE\u2CFF\u2D70\u2E00-\u2E2E\u2E30-\u2E4E\u3001-\u3003\u3008-\u3011\u3014-\u301F\u3030\u303D\u30A0\u30FB\uA4FE\uA4FF\uA60D-\uA60F\uA673\uA67E\uA6F2-\uA6F7\uA874-\uA877\uA8CE\uA8CF\uA8F8-\uA8FA\uA8FC\uA92E\uA92F\uA95F\uA9C1-\uA9CD\uA9DE\uA9DF\uAA5C-\uAA5F\uAADE\uAADF\uAAF0\uAAF1\uABEB\uFD3E\uFD3F\uFE10-\uFE19\uFE30-\uFE52\uFE54-\uFE61\uFE63\uFE68\uFE6A\uFE6B\uFF01-\uFF03\uFF05-\uFF0A\uFF0C-\uFF0F\uFF1A\uFF1B\uFF1F\uFF20\uFF3B-\uFF3D\uFF3F\uFF5B\uFF5D\uFF5F-\uFF65]|\uD800[\uDD00-\uDD02\uDF9F\uDFD0]|\uD801\uDD6F|\uD802[\uDC57\uDD1F\uDD3F\uDE50-\uDE58\uDE7F\uDEF0-\uDEF6\uDF39-\uDF3F\uDF99-\uDF9C]|\uD803[\uDF55-\uDF59]|\uD804[\uDC47-\uDC4D\uDCBB\uDCBC\uDCBE-\uDCC1\uDD40-\uDD43\uDD74\uDD75\uDDC5-\uDDC8\uDDCD\uDDDB\uDDDD-\uDDDF\uDE38-\uDE3D\uDEA9]|\uD805[\uDC4B-\uDC4F\uDC5B\uDC5D\uDCC6\uDDC1-\uDDD7\uDE41-\uDE43\uDE60-\uDE6C\uDF3C-\uDF3E]|\uD806[\uDC3B\uDE3F-\uDE46\uDE9A-\uDE9C\uDE9E-\uDEA2]|\uD807[\uDC41-\uDC45\uDC70\uDC71\uDEF7\uDEF8]|\uD809[\uDC70-\uDC74]|\uD81A[\uDE6E\uDE6F\uDEF5\uDF37-\uDF3B\uDF44]|\uD81B[\uDE97-\uDE9A]|\uD82F\uDC9F|\uD836[\uDE87-\uDE8B]|\uD83A[\uDD5E\uDD5F]/;
+var regex = /[!-#%-\*,-\/:;\?@\[-\]_\{\}\xA1\xA7\xAB\xB6\xB7\xBB\xBF\u037E\u0387\u055A-\u055F\u0589\u058A\u05BE\u05C0\u05C3\u05C6\u05F3\u05F4\u0609\u060A\u060C\u060D\u061B\u061E\u061F\u066A-\u066D\u06D4\u0700-\u070D\u07F7-\u07F9\u0830-\u083E\u085E\u0964\u0965\u0970\u09FD\u0A76\u0AF0\u0C84\u0DF4\u0E4F\u0E5A\u0E5B\u0F04-\u0F12\u0F14\u0F3A-\u0F3D\u0F85\u0FD0-\u0FD4\u0FD9\u0FDA\u104A-\u104F\u10FB\u1360-\u1368\u1400\u166D\u166E\u169B\u169C\u16EB-\u16ED\u1735\u1736\u17D4-\u17D6\u17D8-\u17DA\u1800-\u180A\u1944\u1945\u1A1E\u1A1F\u1AA0-\u1AA6\u1AA8-\u1AAD\u1B5A-\u1B60\u1BFC-\u1BFF\u1C3B-\u1C3F\u1C7E\u1C7F\u1CC0-\u1CC7\u1CD3\u2010-\u2027\u2030-\u2043\u2045-\u2051\u2053-\u205E\u207D\u207E\u208D\u208E\u2308-\u230B\u2329\u232A\u2768-\u2775\u27C5\u27C6\u27E6-\u27EF\u2983-\u2998\u29D8-\u29DB\u29FC\u29FD\u2CF9-\u2CFC\u2CFE\u2CFF\u2D70\u2E00-\u2E2E\u2E30-\u2E4E\u3001-\u3003\u3008-\u3011\u3014-\u301F\u3030\u303D\u30A0\u30FB\uA4FE\uA4FF\uA60D-\uA60F\uA673\uA67E\uA6F2-\uA6F7\uA874-\uA877\uA8CE\uA8CF\uA8F8-\uA8FA\uA8FC\uA92E\uA92F\uA95F\uA9C1-\uA9CD\uA9DE\uA9DF\uAA5C-\uAA5F\uAADE\uAADF\uAAF0\uAAF1\uABEB\uFD3E\uFD3F\uFE10-\uFE19\uFE30-\uFE52\uFE54-\uFE61\uFE63\uFE68\uFE6A\uFE6B\uFF01-\uFF03\uFF05-\uFF0A\uFF0C-\uFF0F\uFF1A\uFF1B\uFF1F\uFF20\uFF3B-\uFF3D\uFF3F\uFF5B\uFF5D\uFF5F-\uFF65]|\uD800[\uDD00-\uDD02\uDF9F\uDFD0]|\uD801\uDD6F|\uD802[\uDC57\uDD1F\uDD3F\uDE50-\uDE58\uDE7F\uDEF0-\uDEF6\uDF39-\uDF3F\uDF99-\uDF9C]|\uD803[\uDF55-\uDF59]|\uD804[\uDC47-\uDC4D\uDCBB\uDCBC\uDCBE-\uDCC1\uDD40-\uDD43\uDD74\uDD75\uDDC5-\uDDC8\uDDCD\uDDDB\uDDDD-\uDDDF\uDE38-\uDE3D\uDEA9]|\uD805[\uDC4B-\uDC4F\uDC5B\uDC5D\uDCC6\uDDC1-\uDDD7\uDE41-\uDE43\uDE60-\uDE6C\uDF3C-\uDF3E]|\uD806[\uDC3B\uDE3F-\uDE46\uDE9A-\uDE9C\uDE9E-\uDEA2]|\uD807[\uDC41-\uDC45\uDC70\uDC71\uDEF7\uDEF8]|\uD809[\uDC70-\uDC74]|\uD81A[\uDE6E\uDE6F\uDEF5\uDF37-\uDF3B\uDF44]|\uD81B[\uDE97-\uDE9A]|\uD82F\uDC9F|\uD836[\uDE87-\uDE8B]|\uD83A[\uDD5E\uDD5F]/;
 export {
-  u as default
+  regex as default
 };

package/dist/es/node_modules/.pnpm/uc.micro@1.0.6/node_modules/uc.micro/categories/Z/regex.js

@@ -1,7 +1,12 @@
-var e, u;
-function r() {
-  return u || (u = 1, e = /[ \xA0\u1680\u2000-\u200A\u2028\u2029\u202F\u205F\u3000]/), e;
+var regex;
+var hasRequiredRegex;
+function requireRegex() {
+  if (hasRequiredRegex)
+    return regex;
+  hasRequiredRegex = 1;
+  regex = /[ \xA0\u1680\u2000-\u200A\u2028\u2029\u202F\u205F\u3000]/;
+  return regex;
 }
 export {
-  r as __require
+  requireRegex as __require
 };

package/dist/es/node_modules/.pnpm/uc.micro@1.0.6/node_modules/uc.micro/index.js

@@ -1,13 +1,21 @@
-import { __exports as r } from "../../../../../_virtual/index4.js";
-import { __require as i } from "./properties/Any/regex.js";
-import { __require as o } from "./categories/Cc/regex.js";
-import { __require as m } from "./categories/Cf/regex.js";
-import u from "./categories/P/regex.js";
-import { __require as _ } from "./categories/Z/regex.js";
-var e;
-function s() {
-  return e ? r : (e = 1, r.Any = i(), r.Cc = o(), r.Cf = m(), r.P = u, r.Z = _(), r);
+import { __exports as uc_micro } from "../../../../../_virtual/index4.js";
+import { __require as requireRegex } from "./properties/Any/regex.js";
+import { __require as requireRegex$1 } from "./categories/Cc/regex.js";
+import { __require as requireRegex$2 } from "./categories/Cf/regex.js";
+import regex from "./categories/P/regex.js";
+import { __require as requireRegex$3 } from "./categories/Z/regex.js";
+var hasRequiredUc_micro;
+function requireUc_micro() {
+  if (hasRequiredUc_micro)
+    return uc_micro;
+  hasRequiredUc_micro = 1;
+  uc_micro.Any = requireRegex();
+  uc_micro.Cc = requireRegex$1();
+  uc_micro.Cf = requireRegex$2();
+  uc_micro.P = regex;
+  uc_micro.Z = requireRegex$3();
+  return uc_micro;
 }
 export {
-  s as __require
+  requireUc_micro as __require
 };

package/dist/es/node_modules/.pnpm/uc.micro@1.0.6/node_modules/uc.micro/properties/Any/regex.js

@@ -1,7 +1,12 @@
-var u, F;
-function e() {
-  return F || (F = 1, u = /[\0-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF]/), u;
+var regex;
+var hasRequiredRegex;
+function requireRegex() {
+  if (hasRequiredRegex)
+    return regex;
+  hasRequiredRegex = 1;
+  regex = /[\0-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF]/;
+  return regex;
 }
 export {
-  e as __require
+  requireRegex as __require
 };