@nano-lib/util 1.0.14 → 1.0.15

package/lib/index.mjs

@@ -1,273 +1,273 @@
-const H = (e, t, n, r) => (e /= r / 2, e < 1 ? n / 2 * e * e + t : (e--, -n / 2 * (e * (e - 2) - 1) + t)), N = window.requestAnimationFrame || window.webkitRequestAnimationFrame || window.mozRequestAnimationFrame || window.msRequestAnimationFrame || ((e) => window.setTimeout(e, 16.666666666666668));
-function P(e, t) {
-  if (t) {
-    document.querySelector(t).scrollTop = e;
+const kn = (t, i, o, s) => (t /= s / 2, t < 1 ? o / 2 * t * t + i : (t--, -o / 2 * (t * (t - 2) - 1) + i)), Vn = window.requestAnimationFrame || window.webkitRequestAnimationFrame || window.mozRequestAnimationFrame || window.msRequestAnimationFrame || ((t) => window.setTimeout(t, 16.666666666666668));
+function $n(t, i) {
+  if (i) {
+    document.querySelector(i).scrollTop = t;
     return;
   }
-  document.documentElement.scrollTop = e, document.body.parentNode.scrollTop = e, document.body.scrollTop = e;
-}
-function B(e) {
-  return e ? document.querySelector(e).scrollTop : document.documentElement.scrollTop || document.body.parentNode.scrollTop || document.body.scrollTop;
-}
-function q(e) {
-  const { target: t, to: n = 0, duration: r = 500, callback: o } = e ?? {}, i = B(t), s = n - i, c = 20;
-  let a = 0;
-  const u = function() {
-    a += c;
-    const f = H(a, i, s, r);
-    P(f, t), a < r ? N(u) : o && o();
+  document.documentElement.scrollTop = t, document.body.parentNode.scrollTop = t, document.body.scrollTop = t;
+}
+function jn(t) {
+  return t ? document.querySelector(t).scrollTop : document.documentElement.scrollTop || document.body.parentNode.scrollTop || document.body.scrollTop;
+}
+function Un(t) {
+  const { target: i, to: o = 0, duration: s = 500, callback: u } = t ?? {}, f = jn(i), d = o - f, a = 20;
+  let b = 0;
+  const m = function() {
+    b += a;
+    const v = kn(b, f, d, s);
+    $n(v, i), b < s ? Vn(m) : u && u();
   };
-  u();
+  m();
 }
-function j(e, t) {
+function Zn(t, i) {
   switch (arguments.length) {
     case 1:
-      return parseInt((Math.random() * e + 1).toString(), 10);
+      return parseInt((Math.random() * t + 1).toString(), 10);
     case 2:
-      return parseInt((Math.random() * (t - e + 1) + e).toString(), 10);
+      return parseInt((Math.random() * (i - t + 1) + t).toString(), 10);
     default:
       return 0;
   }
 }
-function G() {
-  let e = "";
-  const t = [];
-  for (let n = 0; n <= 15; n++)
-    t[n] = n.toString(16);
-  for (let n = 1; n <= 36; n++)
-    n === 9 || n === 14 || n === 19 || n === 24 ? e += "-" : n === 15 ? e += 4 : n === 20 ? e += t[Math.random() * 4 | 8] : e += t[Math.random() * 16 | 0];
-  return e;
-}
-function m(e, t) {
-  if (!e) return "-";
-  e.toString().length === 10 && (e = +e * 1e3), t ?? (t = "YYYY-MM-DD HH:mm:ss");
-  const n = new Date(e), r = (s, c, a = " ") => {
-    if (s.length >= c) return s;
-    const u = c - s.length;
-    let f = Math.ceil(u / a.length);
-    for (; f >>= 1; )
-      a += a, f === 1 && (a += a);
-    return a.slice(0, u) + s;
-  };
-  let o;
-  const i = {
-    "Y+": n.getFullYear().toString(),
-    "M+": (n.getMonth() + 1).toString(),
-    "D+": n.getDate().toString(),
-    "H+": n.getHours().toString(),
-    "m+": n.getMinutes().toString(),
-    "s+": n.getSeconds().toString()
-  };
-  for (const s in i)
-    o = new RegExp("(" + s + ")").exec(t), o && (t = t.replace(o[1], o[1].length == 1 ? i[s] : r(i[s], o[1].length, "0")));
+function Gn() {
+  let t = "";
+  const i = [];
+  for (let o = 0; o <= 15; o++)
+    i[o] = o.toString(16);
+  for (let o = 1; o <= 36; o++)
+    o === 9 || o === 14 || o === 19 || o === 24 ? t += "-" : o === 15 ? t += 4 : o === 20 ? t += i[Math.random() * 4 | 8] : t += i[Math.random() * 16 | 0];
   return t;
 }
-function U(e, t) {
-  `${e}`.length === 10 ? e = parseInt(e + "") * 1e3 : e = +e;
-  const n = new Date(e), o = (Date.now() - Number(n)) / 1e3;
-  return o < 30 ? "刚刚" : o < 3600 ? `${Math.ceil(o / 60)}分钟前` : o < 3600 * 24 ? `${Math.ceil(o / 3600)}小时前` : o < 3600 * 24 * 2 ? "1天前" : t ? m(e, t) : `${n.getMonth() + 1}月${n.getDate()}日${n.getHours()}时${n.getMinutes()}分`;
-}
-function Z(e) {
-  const t = e || /* @__PURE__ */ new Date(), n = new Date(t), r = new Date(t);
-  return n.setHours(0, 0, 0), r.setHours(23, 59, 59), {
-    dateRange: [m(n), m(r)],
-    timestampRange: [n.getTime(), r.getTime()]
+function xt(t, i) {
+  if (!t) return "-";
+  t.toString().length === 10 && (t = +t * 1e3), i ?? (i = "YYYY-MM-DD HH:mm:ss");
+  const o = new Date(t), s = (d, a, b = " ") => {
+    if (d.length >= a) return d;
+    const m = a - d.length;
+    let v = Math.ceil(m / b.length);
+    for (; v >>= 1; )
+      b += b, v === 1 && (b += b);
+    return b.slice(0, m) + d;
+  };
+  let u;
+  const f = {
+    "Y+": o.getFullYear().toString(),
+    "M+": (o.getMonth() + 1).toString(),
+    "D+": o.getDate().toString(),
+    "H+": o.getHours().toString(),
+    "m+": o.getMinutes().toString(),
+    "s+": o.getSeconds().toString()
+  };
+  for (const d in f)
+    u = new RegExp("(" + d + ")").exec(i), u && (i = i.replace(u[1], u[1].length == 1 ? f[d] : s(f[d], u[1].length, "0")));
+  return i;
+}
+function Wn(t, i) {
+  `${t}`.length === 10 ? t = parseInt(t + "") * 1e3 : t = +t;
+  const o = new Date(t), u = (Date.now() - Number(o)) / 1e3;
+  return u < 30 ? "刚刚" : u < 3600 ? `${Math.ceil(u / 60)}分钟前` : u < 3600 * 24 ? `${Math.ceil(u / 3600)}小时前` : u < 3600 * 24 * 2 ? "1天前" : i ? xt(t, i) : `${o.getMonth() + 1}月${o.getDate()}日${o.getHours()}时${o.getMinutes()}分`;
+}
+function Jn(t) {
+  const i = t || /* @__PURE__ */ new Date(), o = new Date(i), s = new Date(i);
+  return o.setHours(0, 0, 0), s.setHours(23, 59, 59), {
+    dateRange: [xt(o), xt(s)],
+    timestampRange: [o.getTime(), s.getTime()]
   };
 }
-const J = {
-  set(e, t) {
-    sessionStorage && e && t && sessionStorage.setItem(e, t);
+const Xn = {
+  set(t, i) {
+    sessionStorage && t && i && sessionStorage.setItem(t, i);
   },
-  get(e) {
-    return !sessionStorage || !e ? null : sessionStorage.getItem(e);
+  get(t) {
+    return !sessionStorage || !t ? null : sessionStorage.getItem(t);
   },
-  setJSON(e, t) {
-    t && this.set(e, JSON.stringify(t));
+  setJSON(t, i) {
+    i && this.set(t, JSON.stringify(i));
   },
-  getJSON(e) {
-    const t = this.get(e);
-    return t ? JSON.parse(t) : null;
+  getJSON(t) {
+    const i = this.get(t);
+    return i ? JSON.parse(i) : null;
   },
-  remove(e) {
-    sessionStorage.removeItem(e);
+  remove(t) {
+    sessionStorage.removeItem(t);
   },
   clear() {
     sessionStorage.clear();
   }
-}, W = {
-  set(e, t) {
-    localStorage && e && t && localStorage.setItem(e, t);
+}, Kn = {
+  set(t, i) {
+    localStorage && t && i && localStorage.setItem(t, i);
   },
-  get(e) {
-    return !localStorage || !e ? null : localStorage.getItem(e);
+  get(t) {
+    return !localStorage || !t ? null : localStorage.getItem(t);
   },
-  setJSON(e, t) {
-    t && this.set(e, JSON.stringify(t));
+  setJSON(t, i) {
+    i && this.set(t, JSON.stringify(i));
   },
-  getJSON(e) {
-    const t = this.get(e);
-    return t ? JSON.parse(t) : null;
+  getJSON(t) {
+    const i = this.get(t);
+    return i ? JSON.parse(i) : null;
   },
-  remove(e) {
-    localStorage.removeItem(e);
+  remove(t) {
+    localStorage.removeItem(t);
   },
   clear() {
     localStorage.clear();
   }
 };
-function V(e, t) {
-  if (!e || !t)
+function Qn(t, i) {
+  if (!t || !i)
     return;
-  let n = e.className;
-  const r = n.indexOf(t);
-  r === -1 ? n += `${t}` : n = n.substring(0, r) + n.substring(r + t.length), e.className = n;
+  let o = t.className;
+  const s = o.indexOf(i);
+  s === -1 ? o += `${i}` : o = o.substring(0, s) + o.substring(s + i.length), t.className = o;
 }
-function E(e, t) {
-  return e.className.match(new RegExp("(?:\\s|^)" + t + "(?:\\s|$)"));
+function Ct(t, i) {
+  return t.className.match(new RegExp("(?:\\s|^)" + i + "(?:\\s|$)"));
 }
-function X(e, t) {
-  E(e, t) || (e.className += ` ${t}`);
+function tr(t, i) {
+  Ct(t, i) || (t.className += ` ${i}`);
 }
-function Q(e, t) {
-  if (E(e, t)) {
-    const n = new RegExp("(?:\\s|^)" + t + "(?:\\s|$)");
-    e.className = e.className.replace(n, " ");
+function er(t, i) {
+  if (Ct(t, i)) {
+    const o = new RegExp("(?:\\s|^)" + i + "(?:\\s|$)");
+    t.className = t.className.replace(o, " ");
   }
 }
-function K(e) {
-  let t = !1;
-  return function(...n) {
-    t || (t = !0, window.requestAnimationFrame(() => {
-      e.apply(this, n), t = !1;
+function nr(t) {
+  let i = !1;
+  return function(...o) {
+    i || (i = !0, window.requestAnimationFrame(() => {
+      t.apply(this, o), i = !1;
     }));
   };
 }
-function ee(e) {
-  e && (e.oncontextmenu = () => !1);
+function rr(t) {
+  t && (t.oncontextmenu = () => !1);
 }
-function te(e) {
-  return /^(http(s)?:\/\/)/.test(e);
+function ir(t) {
+  return /^(http(s)?:\/\/)/.test(t);
 }
-function ne(e) {
-  return /^(https?:|mailto:|tel:)/.test(e);
+function or(t) {
+  return /^(https?:|mailto:|tel:)/.test(t);
 }
-function re(e) {
-  return Object.prototype.toString.call(e) === "[object String]";
+function sr(t) {
+  return Object.prototype.toString.call(t) === "[object String]";
 }
-function oe(e) {
-  return /^[+-]?(0|([1-9]\d*))(\.\d+)?$/g.test(e);
+function fr(t) {
+  return /^[+-]?(0|([1-9]\d*))(\.\d+)?$/g.test(t);
 }
-function ie(e) {
-  return !Object.keys(e).length;
+function cr(t) {
+  return !Object.keys(t).length;
 }
-function se(e) {
-  return /^(https?|ftp):\/\/([a-zA-Z0-9.-]+(:[a-zA-Z0-9.&%$-]+)*@)*((25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]?)(\.(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9]?[0-9])){3}|([a-zA-Z0-9-]+\.)*[a-zA-Z0-9-]+\.(com|edu|gov|int|mil|net|org|biz|arpa|info|name|pro|aero|coop|museum|[a-zA-Z]{2}))(:[0-9]+)*(\/($|[a-zA-Z0-9.,?'\\+&%$#=~_-]+))*$/.test(e);
+function ur(t) {
+  return /^(https?|ftp):\/\/([a-zA-Z0-9.-]+(:[a-zA-Z0-9.&%$-]+)*@)*((25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]?)(\.(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9]?[0-9])){3}|([a-zA-Z0-9-]+\.)*[a-zA-Z0-9-]+\.(com|edu|gov|int|mil|net|org|biz|arpa|info|name|pro|aero|coop|museum|[a-zA-Z]{2}))(:[0-9]+)*(\/($|[a-zA-Z0-9.,?'\\+&%$#=~_-]+))*$/.test(t);
 }
-function ce(e, t = 8) {
-  return new RegExp(`^S*(?=S{${t}},})(?=S*d)(?=S*[A-Z])(?=S*[a-z])(?=S*[!@#$%^&*?])S*$`).test(e);
+function ar(t, i = 8) {
+  return new RegExp(`^S*(?=S{${i}},})(?=S*d)(?=S*[A-Z])(?=S*[a-z])(?=S*[!@#$%^&*?])S*$`).test(t);
 }
-function ae(e) {
-  return /^(([^<>()\[\]\\.,;:\s@"]+(\.[^<>()\[\]\\.,;:\s@"]+)*)|(".+"))@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\])|(([a-zA-Z\-0-9]+\.)+[a-zA-Z]{2,}))$/.test(e);
+function hr(t) {
+  return /^(([^<>()\[\]\\.,;:\s@"]+(\.[^<>()\[\]\\.,;:\s@"]+)*)|(".+"))@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\])|(([a-zA-Z\-0-9]+\.)+[a-zA-Z]{2,}))$/.test(t);
 }
-function O(e) {
-  return /^\d{6}((((((19|20)\d{2})(0[13-9]|1[012])(0[1-9]|[12]\d|30))|(((19|20)\d{2})(0[13578]|1[02])31)|((19|20)\d{2})02(0[1-9]|1\d|2[0-8])|((((19|20)([13579][26]|[2468][048]|0[48]))|(2000))0229))\d{3})|((((\d{2})(0[13-9]|1[012])(0[1-9]|[12]\d|30))|((\d{2})(0[13578]|1[02])31)|((\d{2})02(0[1-9]|1\d|2[0-8]))|(([13579][26]|[2468][048]|0[048])0229))\d{2}))(\d|X|x)$/.test(e);
+function Pt(t) {
+  return /^\d{6}((((((19|20)\d{2})(0[13-9]|1[012])(0[1-9]|[12]\d|30))|(((19|20)\d{2})(0[13578]|1[02])31)|((19|20)\d{2})02(0[1-9]|1\d|2[0-8])|((((19|20)([13579][26]|[2468][048]|0[48]))|(2000))0229))\d{3})|((((\d{2})(0[13-9]|1[012])(0[1-9]|[12]\d|30))|((\d{2})(0[13578]|1[02])31)|((\d{2})02(0[1-9]|1\d|2[0-8]))|(([13579][26]|[2468][048]|0[048])0229))\d{2}))(\d|X|x)$/.test(t);
 }
-function ue(e) {
-  return /^0\d{2,3}-?\d{7,8}$/.test(e);
+function lr(t) {
+  return /^0\d{2,3}-?\d{7,8}$/.test(t);
 }
-function fe(e) {
-  return /^1[3-9]\d{9}$/.test(e);
+function dr(t) {
+  return /^1[3-9]\d{9}$/.test(t);
 }
-const M = () => {
+const $t = () => {
 };
-function ct(e) {
-  return new Promise((t) => setTimeout(t, e));
-}
-function at(e, t) {
-  return new Promise((n) => {
-    const r = setInterval(() => {
-      if (e === 0)
-        return clearInterval(r), n(!0), !1;
-      t && t(e), e--;
+function vi(t) {
+  return new Promise((i) => setTimeout(i, t));
+}
+function yi(t, i) {
+  return new Promise((o) => {
+    const s = setInterval(() => {
+      if (t === 0)
+        return clearInterval(s), o(!0), !1;
+      i && i(t), t--;
     }, 1e3);
   });
 }
-function ut(e, t) {
-  const n = e.slice(), r = [];
-  let o = n.length;
-  const i = [];
-  if (t > o) return null;
-  for (; t--; ) {
-    const s = Math.floor(Math.random() * o);
-    r[t] = n[s in i ? i[s] : s], i[s] = --o in i ? i[o] : o;
-  }
-  return r;
-}
-function ft(e, t) {
-  let n = null;
-  return function(...r) {
-    n !== null && clearTimeout(n), n = setTimeout(() => {
-      e.apply(this, r), n = null;
-    }, t);
+function bi(t, i) {
+  const o = t.slice(), s = [];
+  let u = o.length;
+  const f = [];
+  if (i > u) return null;
+  for (; i--; ) {
+    const d = Math.floor(Math.random() * u);
+    s[i] = o[d in f ? f[d] : d], f[d] = --u in f ? f[u] : u;
+  }
+  return s;
+}
+function wi(t, i) {
+  let o = null;
+  return function(...s) {
+    o !== null && clearTimeout(o), o = setTimeout(() => {
+      t.apply(this, s), o = null;
+    }, i);
   };
 }
-function lt(e) {
-  if (!O(e))
+function Ti(t) {
+  if (!Pt(t))
     throw new Error("Please provide a valid ID number!");
-  const t = e.length, n = t === 15 ? e[t - 1] : e[t - 2];
-  return parseInt(n) % 2 === 1 ? "1" : "2";
+  const i = t.length, o = i === 15 ? t[i - 1] : t[i - 2];
+  return parseInt(o) % 2 === 1 ? "1" : "2";
 }
-function dt(e) {
-  if (!O(e))
+function Fi(t) {
+  if (!Pt(t))
     throw new Error("Please provide a valid ID number!");
-  return e.substring(6, 10) + "-" + e.substring(10, 12) + "-" + e.substring(12, 14);
-}
-const le = (e, t = "") => {
-  t || (t = location.origin);
-  const n = new RegExp(/^http(s)?:\/\//), r = new RegExp(/^((?:[a-z]+:)?\/\/|data:image\/)(.*)/i);
-  return n.test(e) || r.test(e) ? e : t + e;
-}, ht = (e, t = "") => {
-  typeof e == "string" && (e = e === "" ? [] : e.split(","));
-  for (const n in e)
-    e[n] = le(e[n], t);
-  return e;
+  return t.substring(6, 10) + "-" + t.substring(10, 12) + "-" + t.substring(12, 14);
+}
+const pr = (t, i = "") => {
+  i || (i = location.origin);
+  const o = new RegExp(/^http(s)?:\/\//), s = new RegExp(/^((?:[a-z]+:)?\/\/|data:image\/)(.*)/i);
+  return o.test(t) || s.test(t) ? t : i + t;
+}, Si = (t, i = "") => {
+  typeof t == "string" && (t = t === "" ? [] : t.split(","));
+  for (const o in t)
+    t[o] = pr(t[o], i);
+  return t;
 };
-function pt(e) {
-  let t = M;
-  return (...n) => new Promise((r, o) => {
-    t(), t = () => {
-      r = o = M;
-    }, e(...n).then(
-      (i) => r(i),
-      (i) => o(i)
+function Ei(t) {
+  let i = $t;
+  return (...o) => new Promise((s, u) => {
+    i(), i = () => {
+      s = u = $t;
+    }, t(...o).then(
+      (f) => s(f),
+      (f) => u(f)
     );
   });
 }
-function gt(e, t) {
-  const n = document.createElement("a");
-  n.download = t, n.href = e, n.click();
-}
-function de(e) {
-  const t = [];
-  for (let n = 0; n < e.length; n++)
-    e[n] && t.push(e[n]);
-  return t;
+function Bi(t, i) {
+  const o = document.createElement("a");
+  o.download = i, o.href = t, o.click();
 }
-function mt(e, t, n = !1) {
-  let r = Math.round(e / t * 1e4) / 100;
-  return Number.isNaN(r) && (r = 0), n ? Math.floor(r) : r;
-}
-function vt(e) {
-  const t = document.createElement("link");
-  t.rel = "stylesheet", t.href = e, t.crossOrigin = "anonymous", document.getElementsByTagName("head")[0].appendChild(t);
-}
-function _t(e) {
-  return new Promise((t, n) => {
-    const r = document.createElement("script");
-    r.type = "text/javascript", r.src = e, r.onload = () => t(), r.onerror = (o) => n(o), document.getElementsByTagName("head")[0].appendChild(r);
+function gr(t) {
+  const i = [];
+  for (let o = 0; o < t.length; o++)
+    t[o] && i.push(t[o]);
+  return i;
+}
+function _i(t, i, o = !1) {
+  let s = Math.round(t / i * 1e4) / 100;
+  return Number.isNaN(s) && (s = 0), o ? Math.floor(s) : s;
+}
+function Ri(t) {
+  const i = document.createElement("link");
+  i.rel = "stylesheet", i.href = t, i.crossOrigin = "anonymous", document.getElementsByTagName("head")[0].appendChild(i);
+}
+function Di(t) {
+  return new Promise((i, o) => {
+    const s = document.createElement("script");
+    s.type = "text/javascript", s.src = t, s.onload = () => i(), s.onerror = (u) => o(u), document.getElementsByTagName("head")[0].appendChild(s);
   });
 }
-const he = [
+const xr = [
   ["date", "YYYY-MM-DD"],
   ["daterange", "YYYY-MM-DD"],
   ["datetime", "YYYY-MM-DD HH:mm:ss"],
@@ -277,7 +277,7 @@ const he = [
   ["year", "YYYY"],
   ["yearrange", "YYYY"],
   ["time", "HH:mm:ss"]
-], pe = {
+], mr = {
   view: "查看",
   add: "添加",
   edit: "编辑",
@@ -326,7 +326,7 @@ const he = [
   export: "导出",
   import: "导入",
   defaultErrorCode: "系统未知错误，请反馈给管理员"
-}, ge = {
+}, vr = {
   400: "请求失败，请您稍后重试！",
   401: "认证失败，无法访问系统资源！",
   403: "当前操作没有权限！",
@@ -337,115 +337,115 @@ const he = [
   502: "网关错误！",
   503: "服务不可用！",
   504: "网关超时！"
-}, me = new Map(he), l = pe, ve = ge, x = ["jpg", "jpeg", "png", "bmp", "gif"], D = ["mp3", "mp4", "webm", "ogg", "3gp"], Y = ["doc", "docx", "xls", "xlsx", "ppt", "txt", "pdf", "zip"], _e = [...x, ...D, ...Y];
-function be(e) {
-  return ve[e] ?? l.defaultErrorCode;
+}, yr = new Map(xr), et = mr, br = vr, ie = ["jpg", "jpeg", "png", "bmp", "gif"], oe = ["mp3", "mp4", "webm", "ogg", "3gp"], se = ["doc", "docx", "xls", "xlsx", "ppt", "txt", "pdf", "zip"], wr = [...ie, ...oe, ...se];
+function Tr(t) {
+  return br[t] ?? et.defaultErrorCode;
 }
-function ye(e) {
-  return e == null ? l.unfilled : (e = typeof e == "number" ? `${e}` : e, e === "1" ? l.yes : l.no);
+function Fr(t) {
+  return t == null ? et.unfilled : (t = typeof t == "number" ? `${t}` : t, t === "1" ? et.yes : et.no);
 }
-function we(e) {
-  return e == null ? l.unfilled : (e = typeof e == "number" ? `${e}` : e, e === "1" ? l.have : l.noHave);
+function Sr(t) {
+  return t == null ? et.unfilled : (t = typeof t == "number" ? `${t}` : t, t === "1" ? et.have : et.noHave);
 }
-function Ee(e) {
-  return e ? e.replace(/(\d{3})\d{4}(\d{4})/, "$1****$2") : "";
+function Er(t) {
+  return t ? t.replace(/(\d{3})\d{4}(\d{4})/, "$1****$2") : "";
 }
-function Oe(e, t, n) {
-  if (t ?? (t = 4), n ?? (n = 4), e) {
-    const r = e.length;
-    return e.substring(0, t) + "*".repeat(r - t - n) + e.substring(r - n);
+function Br(t, i, o) {
+  if (i ?? (i = 4), o ?? (o = 4), t) {
+    const s = t.length;
+    return t.substring(0, i) + "*".repeat(s - i - o) + t.substring(s - o);
   }
   return "";
 }
-function Me(e) {
-  return e.replace(/( |^)[a-z]/g, (t) => t.toUpperCase());
+function _r(t) {
+  return t.replace(/( |^)[a-z]/g, (i) => i.toUpperCase());
 }
-function Te(e) {
-  return e.replace(/( |^)[A-Z]/g, (t) => t.toLowerCase());
+function Rr(t) {
+  return t.replace(/( |^)[A-Z]/g, (i) => i.toLowerCase());
 }
-function Re(e, t) {
-  const n = e.find((r) => r.value === t);
-  return n ? n.label : "";
+function Dr(t, i) {
+  const o = t.find((s) => s.value === i);
+  return o ? o.label : "";
 }
-function Ae(e, t, n) {
-  const r = [], o = t.split(","), i = n.split(",");
-  return Array.from(new Set(o)).forEach((c) => {
-    const a = e.find((u) => u.value === c);
-    a && i.forEach((u) => {
-      var p;
-      const f = (p = a.children) == null ? void 0 : p.find((F) => F.value === u);
-      f && r.push(f);
+function Ar(t, i, o) {
+  const s = [], u = i.split(","), f = o.split(",");
+  return Array.from(new Set(u)).forEach((a) => {
+    const b = t.find((m) => m.value === a);
+    b && f.forEach((m) => {
+      var B;
+      const v = (B = b.children) == null ? void 0 : B.find((_) => _.value === m);
+      v && s.push(v);
     });
-  }), r.map((c) => c.label).join();
+  }), s.map((a) => a.label).join();
+}
+function fe(t, i, o) {
+  var f;
+  if (!i) return "";
+  const s = i.split(","), u = o.find((d) => d.value === s[t]);
+  return u ? ((f = u.children) != null && f.length && fe(t + 1, i, u.children), u.label) : "";
 }
-function z(e, t, n) {
-  var i;
+function Ir(t, i, o) {
   if (!t) return "";
-  const r = t.split(","), o = n.find((s) => s.value === r[e]);
-  return o ? ((i = o.children) != null && i.length && z(e + 1, t, o.children), o.label) : "";
-}
-function Se(e, t, n) {
-  if (!e) return "";
-  const r = e.split(","), o = [], i = r.length - 1, s = r.findIndex((c) => c === n);
-  if (s !== -1) {
-    const c = r[i] === n;
-    r.splice(c ? 0 : s, c ? i : 1);
-  }
-  return r.forEach((c) => {
-    const a = t.find((u) => u.value === c);
-    a && o.push(a);
-  }), o.map((c) => c.label).join();
-}
-function xe(e) {
-  let t = "";
-  for (const n of Object.keys(e)) {
-    const r = e[n], o = `${encodeURIComponent(n)}=`;
-    if (r !== null && typeof r < "u")
-      if (typeof r == "object") {
-        for (const i of Object.keys(r))
-          if (r[i] !== null && typeof r[i] < "u") {
-            const s = `${n}[${i}]`, c = `${encodeURIComponent(s)}=`;
-            t += `${c + encodeURIComponent(r[i])}&`;
+  const s = t.split(","), u = [], f = s.length - 1, d = s.findIndex((a) => a === o);
+  if (d !== -1) {
+    const a = s[f] === o;
+    s.splice(a ? 0 : d, a ? f : 1);
+  }
+  return s.forEach((a) => {
+    const b = i.find((m) => m.value === a);
+    b && u.push(b);
+  }), u.map((a) => a.label).join();
+}
+function Mr(t) {
+  let i = "";
+  for (const o of Object.keys(t)) {
+    const s = t[o], u = `${encodeURIComponent(o)}=`;
+    if (s !== null && typeof s < "u")
+      if (typeof s == "object") {
+        for (const f of Object.keys(s))
+          if (s[f] !== null && typeof s[f] < "u") {
+            const d = `${o}[${f}]`, a = `${encodeURIComponent(d)}=`;
+            i += `${a + encodeURIComponent(s[f])}&`;
           }
       } else
-        t += `${o + encodeURIComponent(r)}&`;
+        i += `${u + encodeURIComponent(s)}&`;
   }
-  return t;
+  return i;
 }
-function De(e) {
-  return e ? de(
-    Object.keys(e).map((t) => e[t] === void 0 ? "" : `${encodeURIComponent(t)}=${encodeURIComponent(e[t])}`)
+function Or(t) {
+  return t ? gr(
+    Object.keys(t).map((i) => t[i] === void 0 ? "" : `${encodeURIComponent(i)}=${encodeURIComponent(t[i])}`)
   ).join("&") : "";
 }
-function Ye(e) {
-  const t = decodeURIComponent(e.split("?")[1]).replace(/\+/g, " ");
-  if (!t)
+function qr(t) {
+  const i = decodeURIComponent(t.split("?")[1]).replace(/\+/g, " ");
+  if (!i)
     return {};
-  const n = {};
-  return t.split("&").forEach((o) => {
-    const i = o.indexOf("=");
-    if (i !== -1) {
-      const s = o.substring(0, i), c = o.substring(i + 1, o.length);
-      n[s] = c;
+  const o = {};
+  return i.split("&").forEach((u) => {
+    const f = u.indexOf("=");
+    if (f !== -1) {
+      const d = u.substring(0, f), a = u.substring(f + 1, u.length);
+      o[d] = a;
     }
-  }), n;
+  }), o;
 }
-var I = function() {
+var ce = function() {
   if (typeof Map < "u")
     return Map;
-  function e(t, n) {
-    var r = -1;
-    return t.some(function(o, i) {
-      return o[0] === n ? (r = i, !0) : !1;
-    }), r;
+  function t(i, o) {
+    var s = -1;
+    return i.some(function(u, f) {
+      return u[0] === o ? (s = f, !0) : !1;
+    }), s;
   }
   return (
     /** @class */
     function() {
-      function t() {
+      function i() {
         this.__entries__ = [];
       }
-      return Object.defineProperty(t.prototype, "size", {
+      return Object.defineProperty(i.prototype, "size", {
         /**
          * @returns {boolean}
          */
@@ -454,433 +454,2158 @@ var I = function() {
         },
         enumerable: !0,
         configurable: !0
-      }), t.prototype.get = function(n) {
-        var r = e(this.__entries__, n), o = this.__entries__[r];
-        return o && o[1];
-      }, t.prototype.set = function(n, r) {
-        var o = e(this.__entries__, n);
-        ~o ? this.__entries__[o][1] = r : this.__entries__.push([n, r]);
-      }, t.prototype.delete = function(n) {
-        var r = this.__entries__, o = e(r, n);
-        ~o && r.splice(o, 1);
-      }, t.prototype.has = function(n) {
-        return !!~e(this.__entries__, n);
-      }, t.prototype.clear = function() {
+      }), i.prototype.get = function(o) {
+        var s = t(this.__entries__, o), u = this.__entries__[s];
+        return u && u[1];
+      }, i.prototype.set = function(o, s) {
+        var u = t(this.__entries__, o);
+        ~u ? this.__entries__[u][1] = s : this.__entries__.push([o, s]);
+      }, i.prototype.delete = function(o) {
+        var s = this.__entries__, u = t(s, o);
+        ~u && s.splice(u, 1);
+      }, i.prototype.has = function(o) {
+        return !!~t(this.__entries__, o);
+      }, i.prototype.clear = function() {
         this.__entries__.splice(0);
-      }, t.prototype.forEach = function(n, r) {
-        r === void 0 && (r = null);
-        for (var o = 0, i = this.__entries__; o < i.length; o++) {
-          var s = i[o];
-          n.call(r, s[1], s[0]);
+      }, i.prototype.forEach = function(o, s) {
+        s === void 0 && (s = null);
+        for (var u = 0, f = this.__entries__; u < f.length; u++) {
+          var d = f[u];
+          o.call(s, d[1], d[0]);
         }
-      }, t;
+      }, i;
     }()
   );
-}(), w = typeof window < "u" && typeof document < "u" && window.document === document, v = function() {
+}(), qt = typeof window < "u" && typeof document < "u" && window.document === document, mt = function() {
   return typeof global < "u" && global.Math === Math ? global : typeof self < "u" && self.Math === Math ? self : typeof window < "u" && window.Math === Math ? window : Function("return this")();
-}(), ze = function() {
-  return typeof requestAnimationFrame == "function" ? requestAnimationFrame.bind(v) : function(e) {
+}(), Cr = function() {
+  return typeof requestAnimationFrame == "function" ? requestAnimationFrame.bind(mt) : function(t) {
     return setTimeout(function() {
-      return e(Date.now());
+      return t(Date.now());
     }, 1e3 / 60);
   };
-}(), Ie = 2;
-function Ce(e, t) {
-  var n = !1, r = !1, o = 0;
-  function i() {
-    n && (n = !1, e()), r && c();
-  }
-  function s() {
-    ze(i);
-  }
-  function c() {
-    var a = Date.now();
-    if (n) {
-      if (a - o < Ie)
+}(), Pr = 2;
+function zr(t, i) {
+  var o = !1, s = !1, u = 0;
+  function f() {
+    o && (o = !1, t()), s && a();
+  }
+  function d() {
+    Cr(f);
+  }
+  function a() {
+    var b = Date.now();
+    if (o) {
+      if (b - u < Pr)
         return;
-      r = !0;
+      s = !0;
     } else
-      n = !0, r = !1, setTimeout(s, t);
-    o = a;
+      o = !0, s = !1, setTimeout(d, i);
+    u = b;
   }
-  return c;
+  return a;
 }
-var $e = 20, Le = ["top", "right", "bottom", "left", "width", "height", "size", "weight"], ke = typeof MutationObserver < "u", Fe = (
+var Hr = 20, Lr = ["top", "right", "bottom", "left", "width", "height", "size", "weight"], Nr = typeof MutationObserver < "u", Yr = (
   /** @class */
   function() {
-    function e() {
-      this.connected_ = !1, this.mutationEventsAdded_ = !1, this.mutationsObserver_ = null, this.observers_ = [], this.onTransitionEnd_ = this.onTransitionEnd_.bind(this), this.refresh = Ce(this.refresh.bind(this), $e);
-    }
-    return e.prototype.addObserver = function(t) {
-      ~this.observers_.indexOf(t) || this.observers_.push(t), this.connected_ || this.connect_();
-    }, e.prototype.removeObserver = function(t) {
-      var n = this.observers_, r = n.indexOf(t);
-      ~r && n.splice(r, 1), !n.length && this.connected_ && this.disconnect_();
-    }, e.prototype.refresh = function() {
-      var t = this.updateObservers_();
-      t && this.refresh();
-    }, e.prototype.updateObservers_ = function() {
-      var t = this.observers_.filter(function(n) {
-        return n.gatherActive(), n.hasActive();
+    function t() {
+      this.connected_ = !1, this.mutationEventsAdded_ = !1, this.mutationsObserver_ = null, this.observers_ = [], this.onTransitionEnd_ = this.onTransitionEnd_.bind(this), this.refresh = zr(this.refresh.bind(this), Hr);
+    }
+    return t.prototype.addObserver = function(i) {
+      ~this.observers_.indexOf(i) || this.observers_.push(i), this.connected_ || this.connect_();
+    }, t.prototype.removeObserver = function(i) {
+      var o = this.observers_, s = o.indexOf(i);
+      ~s && o.splice(s, 1), !o.length && this.connected_ && this.disconnect_();
+    }, t.prototype.refresh = function() {
+      var i = this.updateObservers_();
+      i && this.refresh();
+    }, t.prototype.updateObservers_ = function() {
+      var i = this.observers_.filter(function(o) {
+        return o.gatherActive(), o.hasActive();
       });
-      return t.forEach(function(n) {
-        return n.broadcastActive();
-      }), t.length > 0;
-    }, e.prototype.connect_ = function() {
-      !w || this.connected_ || (document.addEventListener("transitionend", this.onTransitionEnd_), window.addEventListener("resize", this.refresh), ke ? (this.mutationsObserver_ = new MutationObserver(this.refresh), this.mutationsObserver_.observe(document, {
+      return i.forEach(function(o) {
+        return o.broadcastActive();
+      }), i.length > 0;
+    }, t.prototype.connect_ = function() {
+      !qt || this.connected_ || (document.addEventListener("transitionend", this.onTransitionEnd_), window.addEventListener("resize", this.refresh), Nr ? (this.mutationsObserver_ = new MutationObserver(this.refresh), this.mutationsObserver_.observe(document, {
         attributes: !0,
         childList: !0,
         characterData: !0,
         subtree: !0
       })) : (document.addEventListener("DOMSubtreeModified", this.refresh), this.mutationEventsAdded_ = !0), this.connected_ = !0);
-    }, e.prototype.disconnect_ = function() {
-      !w || !this.connected_ || (document.removeEventListener("transitionend", this.onTransitionEnd_), window.removeEventListener("resize", this.refresh), this.mutationsObserver_ && this.mutationsObserver_.disconnect(), this.mutationEventsAdded_ && document.removeEventListener("DOMSubtreeModified", this.refresh), this.mutationsObserver_ = null, this.mutationEventsAdded_ = !1, this.connected_ = !1);
-    }, e.prototype.onTransitionEnd_ = function(t) {
-      var n = t.propertyName, r = n === void 0 ? "" : n, o = Le.some(function(i) {
-        return !!~r.indexOf(i);
+    }, t.prototype.disconnect_ = function() {
+      !qt || !this.connected_ || (document.removeEventListener("transitionend", this.onTransitionEnd_), window.removeEventListener("resize", this.refresh), this.mutationsObserver_ && this.mutationsObserver_.disconnect(), this.mutationEventsAdded_ && document.removeEventListener("DOMSubtreeModified", this.refresh), this.mutationsObserver_ = null, this.mutationEventsAdded_ = !1, this.connected_ = !1);
+    }, t.prototype.onTransitionEnd_ = function(i) {
+      var o = i.propertyName, s = o === void 0 ? "" : o, u = Lr.some(function(f) {
+        return !!~s.indexOf(f);
       });
-      o && this.refresh();
-    }, e.getInstance = function() {
-      return this.instance_ || (this.instance_ = new e()), this.instance_;
-    }, e.instance_ = null, e;
+      u && this.refresh();
+    }, t.getInstance = function() {
+      return this.instance_ || (this.instance_ = new t()), this.instance_;
+    }, t.instance_ = null, t;
   }()
-), C = function(e, t) {
-  for (var n = 0, r = Object.keys(t); n < r.length; n++) {
-    var o = r[n];
-    Object.defineProperty(e, o, {
-      value: t[o],
+), ue = function(t, i) {
+  for (var o = 0, s = Object.keys(i); o < s.length; o++) {
+    var u = s[o];
+    Object.defineProperty(t, u, {
+      value: i[u],
       enumerable: !1,
       writable: !1,
       configurable: !0
     });
   }
-  return e;
-}, d = function(e) {
-  var t = e && e.ownerDocument && e.ownerDocument.defaultView;
-  return t || v;
-}, $ = b(0, 0, 0, 0);
-function _(e) {
-  return parseFloat(e) || 0;
-}
-function T(e) {
-  for (var t = [], n = 1; n < arguments.length; n++)
-    t[n - 1] = arguments[n];
-  return t.reduce(function(r, o) {
-    var i = e["border-" + o + "-width"];
-    return r + _(i);
+  return t;
+}, ot = function(t) {
+  var i = t && t.ownerDocument && t.ownerDocument.defaultView;
+  return i || mt;
+}, ae = yt(0, 0, 0, 0);
+function vt(t) {
+  return parseFloat(t) || 0;
+}
+function jt(t) {
+  for (var i = [], o = 1; o < arguments.length; o++)
+    i[o - 1] = arguments[o];
+  return i.reduce(function(s, u) {
+    var f = t["border-" + u + "-width"];
+    return s + vt(f);
   }, 0);
 }
-function He(e) {
-  for (var t = ["top", "right", "bottom", "left"], n = {}, r = 0, o = t; r < o.length; r++) {
-    var i = o[r], s = e["padding-" + i];
-    n[i] = _(s);
-  }
-  return n;
-}
-function Ne(e) {
-  var t = e.getBBox();
-  return b(0, 0, t.width, t.height);
-}
-function Pe(e) {
-  var t = e.clientWidth, n = e.clientHeight;
-  if (!t && !n)
-    return $;
-  var r = d(e).getComputedStyle(e), o = He(r), i = o.left + o.right, s = o.top + o.bottom, c = _(r.width), a = _(r.height);
-  if (r.boxSizing === "border-box" && (Math.round(c + i) !== t && (c -= T(r, "left", "right") + i), Math.round(a + s) !== n && (a -= T(r, "top", "bottom") + s)), !qe(e)) {
-    var u = Math.round(c + i) - t, f = Math.round(a + s) - n;
-    Math.abs(u) !== 1 && (c -= u), Math.abs(f) !== 1 && (a -= f);
-  }
-  return b(o.left, o.top, c, a);
-}
-var Be = /* @__PURE__ */ function() {
-  return typeof SVGGraphicsElement < "u" ? function(e) {
-    return e instanceof d(e).SVGGraphicsElement;
-  } : function(e) {
-    return e instanceof d(e).SVGElement && typeof e.getBBox == "function";
+function kr(t) {
+  for (var i = ["top", "right", "bottom", "left"], o = {}, s = 0, u = i; s < u.length; s++) {
+    var f = u[s], d = t["padding-" + f];
+    o[f] = vt(d);
+  }
+  return o;
+}
+function Vr(t) {
+  var i = t.getBBox();
+  return yt(0, 0, i.width, i.height);
+}
+function $r(t) {
+  var i = t.clientWidth, o = t.clientHeight;
+  if (!i && !o)
+    return ae;
+  var s = ot(t).getComputedStyle(t), u = kr(s), f = u.left + u.right, d = u.top + u.bottom, a = vt(s.width), b = vt(s.height);
+  if (s.boxSizing === "border-box" && (Math.round(a + f) !== i && (a -= jt(s, "left", "right") + f), Math.round(b + d) !== o && (b -= jt(s, "top", "bottom") + d)), !Ur(t)) {
+    var m = Math.round(a + f) - i, v = Math.round(b + d) - o;
+    Math.abs(m) !== 1 && (a -= m), Math.abs(v) !== 1 && (b -= v);
+  }
+  return yt(u.left, u.top, a, b);
+}
+var jr = /* @__PURE__ */ function() {
+  return typeof SVGGraphicsElement < "u" ? function(t) {
+    return t instanceof ot(t).SVGGraphicsElement;
+  } : function(t) {
+    return t instanceof ot(t).SVGElement && typeof t.getBBox == "function";
   };
 }();
-function qe(e) {
-  return e === d(e).document.documentElement;
-}
-function je(e) {
-  return w ? Be(e) ? Ne(e) : Pe(e) : $;
-}
-function Ge(e) {
-  var t = e.x, n = e.y, r = e.width, o = e.height, i = typeof DOMRectReadOnly < "u" ? DOMRectReadOnly : Object, s = Object.create(i.prototype);
-  return C(s, {
-    x: t,
-    y: n,
-    width: r,
-    height: o,
-    top: n,
-    right: t + r,
-    bottom: o + n,
-    left: t
-  }), s;
-}
-function b(e, t, n, r) {
-  return { x: e, y: t, width: n, height: r };
-}
-var Ue = (
+function Ur(t) {
+  return t === ot(t).document.documentElement;
+}
+function Zr(t) {
+  return qt ? jr(t) ? Vr(t) : $r(t) : ae;
+}
+function Gr(t) {
+  var i = t.x, o = t.y, s = t.width, u = t.height, f = typeof DOMRectReadOnly < "u" ? DOMRectReadOnly : Object, d = Object.create(f.prototype);
+  return ue(d, {
+    x: i,
+    y: o,
+    width: s,
+    height: u,
+    top: o,
+    right: i + s,
+    bottom: u + o,
+    left: i
+  }), d;
+}
+function yt(t, i, o, s) {
+  return { x: t, y: i, width: o, height: s };
+}
+var Wr = (
   /** @class */
   function() {
-    function e(t) {
-      this.broadcastWidth = 0, this.broadcastHeight = 0, this.contentRect_ = b(0, 0, 0, 0), this.target = t;
-    }
-    return e.prototype.isActive = function() {
-      var t = je(this.target);
-      return this.contentRect_ = t, t.width !== this.broadcastWidth || t.height !== this.broadcastHeight;
-    }, e.prototype.broadcastRect = function() {
-      var t = this.contentRect_;
-      return this.broadcastWidth = t.width, this.broadcastHeight = t.height, t;
-    }, e;
+    function t(i) {
+      this.broadcastWidth = 0, this.broadcastHeight = 0, this.contentRect_ = yt(0, 0, 0, 0), this.target = i;
+    }
+    return t.prototype.isActive = function() {
+      var i = Zr(this.target);
+      return this.contentRect_ = i, i.width !== this.broadcastWidth || i.height !== this.broadcastHeight;
+    }, t.prototype.broadcastRect = function() {
+      var i = this.contentRect_;
+      return this.broadcastWidth = i.width, this.broadcastHeight = i.height, i;
+    }, t;
   }()
-), Ze = (
+), Jr = (
   /** @class */
   /* @__PURE__ */ function() {
-    function e(t, n) {
-      var r = Ge(n);
-      C(this, { target: t, contentRect: r });
+    function t(i, o) {
+      var s = Gr(o);
+      ue(this, { target: i, contentRect: s });
     }
-    return e;
+    return t;
   }()
-), Je = (
+), Xr = (
   /** @class */
   function() {
-    function e(t, n, r) {
-      if (this.activeObservations_ = [], this.observations_ = new I(), typeof t != "function")
+    function t(i, o, s) {
+      if (this.activeObservations_ = [], this.observations_ = new ce(), typeof i != "function")
         throw new TypeError("The callback provided as parameter 1 is not a function.");
-      this.callback_ = t, this.controller_ = n, this.callbackCtx_ = r;
+      this.callback_ = i, this.controller_ = o, this.callbackCtx_ = s;
     }
-    return e.prototype.observe = function(t) {
+    return t.prototype.observe = function(i) {
       if (!arguments.length)
         throw new TypeError("1 argument required, but only 0 present.");
       if (!(typeof Element > "u" || !(Element instanceof Object))) {
-        if (!(t instanceof d(t).Element))
+        if (!(i instanceof ot(i).Element))
           throw new TypeError('parameter 1 is not of type "Element".');
-        var n = this.observations_;
-        n.has(t) || (n.set(t, new Ue(t)), this.controller_.addObserver(this), this.controller_.refresh());
+        var o = this.observations_;
+        o.has(i) || (o.set(i, new Wr(i)), this.controller_.addObserver(this), this.controller_.refresh());
       }
-    }, e.prototype.unobserve = function(t) {
+    }, t.prototype.unobserve = function(i) {
       if (!arguments.length)
         throw new TypeError("1 argument required, but only 0 present.");
       if (!(typeof Element > "u" || !(Element instanceof Object))) {
-        if (!(t instanceof d(t).Element))
+        if (!(i instanceof ot(i).Element))
           throw new TypeError('parameter 1 is not of type "Element".');
-        var n = this.observations_;
-        n.has(t) && (n.delete(t), n.size || this.controller_.removeObserver(this));
+        var o = this.observations_;
+        o.has(i) && (o.delete(i), o.size || this.controller_.removeObserver(this));
       }
-    }, e.prototype.disconnect = function() {
+    }, t.prototype.disconnect = function() {
       this.clearActive(), this.observations_.clear(), this.controller_.removeObserver(this);
-    }, e.prototype.gatherActive = function() {
-      var t = this;
-      this.clearActive(), this.observations_.forEach(function(n) {
-        n.isActive() && t.activeObservations_.push(n);
+    }, t.prototype.gatherActive = function() {
+      var i = this;
+      this.clearActive(), this.observations_.forEach(function(o) {
+        o.isActive() && i.activeObservations_.push(o);
       });
-    }, e.prototype.broadcastActive = function() {
+    }, t.prototype.broadcastActive = function() {
       if (this.hasActive()) {
-        var t = this.callbackCtx_, n = this.activeObservations_.map(function(r) {
-          return new Ze(r.target, r.broadcastRect());
+        var i = this.callbackCtx_, o = this.activeObservations_.map(function(s) {
+          return new Jr(s.target, s.broadcastRect());
         });
-        this.callback_.call(t, n, t), this.clearActive();
+        this.callback_.call(i, o, i), this.clearActive();
       }
-    }, e.prototype.clearActive = function() {
+    }, t.prototype.clearActive = function() {
       this.activeObservations_.splice(0);
-    }, e.prototype.hasActive = function() {
+    }, t.prototype.hasActive = function() {
       return this.activeObservations_.length > 0;
-    }, e;
+    }, t;
   }()
-), L = typeof WeakMap < "u" ? /* @__PURE__ */ new WeakMap() : new I(), k = (
+), he = typeof WeakMap < "u" ? /* @__PURE__ */ new WeakMap() : new ce(), le = (
   /** @class */
   /* @__PURE__ */ function() {
-    function e(t) {
-      if (!(this instanceof e))
+    function t(i) {
+      if (!(this instanceof t))
         throw new TypeError("Cannot call a class as a function.");
       if (!arguments.length)
         throw new TypeError("1 argument required, but only 0 present.");
-      var n = Fe.getInstance(), r = new Je(t, n, this);
-      L.set(this, r);
+      var o = Yr.getInstance(), s = new Xr(i, o, this);
+      he.set(this, s);
     }
-    return e;
+    return t;
   }()
 );
 [
   "observe",
   "unobserve",
   "disconnect"
-].forEach(function(e) {
-  k.prototype[e] = function() {
-    var t;
-    return (t = L.get(this))[e].apply(t, arguments);
+].forEach(function(t) {
+  le.prototype[t] = function() {
+    var i;
+    return (i = he.get(this))[t].apply(i, arguments);
   };
 });
-var We = function() {
-  return typeof v.ResizeObserver < "u" ? v.ResizeObserver : k;
+var Kr = function() {
+  return typeof mt.ResizeObserver < "u" ? mt.ResizeObserver : le;
 }();
-function Ve(e) {
-  for (const t of e) {
-    const n = t.target.__resizeListeners__ || [];
-    n.length && n.forEach((r) => r());
+function Qr(t) {
+  for (const i of t) {
+    const o = i.target.__resizeListeners__ || [];
+    o.length && o.forEach((s) => s());
   }
 }
-function bt(e, t) {
-  typeof window > "u" || (e.__resizeListeners__ || (e.__resizeListeners__ = [], e.__ro__ = new We(Ve), e.__ro__.observe(e)), e.__resizeListeners__.push(t));
+function Ai(t, i) {
+  typeof window > "u" || (t.__resizeListeners__ || (t.__resizeListeners__ = [], t.__ro__ = new Kr(Qr), t.__ro__.observe(t)), t.__resizeListeners__.push(i));
 }
-function yt(e, t) {
-  !e || !e.__resizeListeners__ || (e.__resizeListeners__.splice(e.__resizeListeners__.indexOf(t), 1), e.__resizeListeners__.length || e.__ro__.disconnect());
+function Ii(t, i) {
+  !t || !t.__resizeListeners__ || (t.__resizeListeners__.splice(t.__resizeListeners__.indexOf(i), 1), t.__resizeListeners__.length || t.__ro__.disconnect());
 }
-let h = [], Xe = { consecutiveFrames: 0, lastBlinkTime: 0 }, Qe = { consecutiveFrames: 0, lastBlinkTime: 0 };
-const Ke = /* @__PURE__ */ new Map([
-  ["nod", [st, 30, 100]],
-  ["shake", [it, 7, 100]],
-  ["mouth", [ot, 0.35, 100]],
-  ["eye", [rt, 0.3, 100]]
-]), wt = ["nod", "shake", "mouth", "eye"], Et = {
+var gt = { exports: {} }, ti = gt.exports, Ut;
+function bt() {
+  return Ut || (Ut = 1, function(t, i) {
+    (function() {
+      var o, s = 244837814094590, u = (s & 16777215) == 15715070;
+      function f(e, n, r) {
+        e != null && (typeof e == "number" ? this.fromNumber(e, n, r) : n == null && typeof e != "string" ? this.fromString(e, 256) : this.fromString(e, n));
+      }
+      function d() {
+        return new f(null);
+      }
+      function a(e, n, r, c, x, y) {
+        for (; --y >= 0; ) {
+          var S = n * this[e++] + r[c] + x;
+          x = Math.floor(S / 67108864), r[c++] = S & 67108863;
+        }
+        return x;
+      }
+      function b(e, n, r, c, x, y) {
+        for (var S = n & 32767, E = n >> 15; --y >= 0; ) {
+          var N = this[e] & 32767, k = this[e++] >> 15, Z = E * N + k * S;
+          N = S * N + ((Z & 32767) << 15) + r[c] + (x & 1073741823), x = (N >>> 30) + (Z >>> 15) + E * k + (x >>> 30), r[c++] = N & 1073741823;
+        }
+        return x;
+      }
+      function m(e, n, r, c, x, y) {
+        for (var S = n & 16383, E = n >> 14; --y >= 0; ) {
+          var N = this[e] & 16383, k = this[e++] >> 14, Z = E * N + k * S;
+          N = S * N + ((Z & 16383) << 14) + r[c] + x, x = (N >> 28) + (Z >> 14) + E * k, r[c++] = N & 268435455;
+        }
+        return x;
+      }
+      var v = typeof navigator < "u";
+      v && u && navigator.appName == "Microsoft Internet Explorer" ? (f.prototype.am = b, o = 30) : v && u && navigator.appName != "Netscape" ? (f.prototype.am = a, o = 26) : (f.prototype.am = m, o = 28), f.prototype.DB = o, f.prototype.DM = (1 << o) - 1, f.prototype.DV = 1 << o;
+      var B = 52;
+      f.prototype.FV = Math.pow(2, B), f.prototype.F1 = B - o, f.prototype.F2 = 2 * o - B;
+      var _ = "0123456789abcdefghijklmnopqrstuvwxyz", M = new Array(), R, q;
+      for (R = 48, q = 0; q <= 9; ++q) M[R++] = q;
+      for (R = 97, q = 10; q < 36; ++q) M[R++] = q;
+      for (R = 65, q = 10; q < 36; ++q) M[R++] = q;
+      function p(e) {
+        return _.charAt(e);
+      }
+      function w(e, n) {
+        var r = M[e.charCodeAt(n)];
+        return r ?? -1;
+      }
+      function g(e) {
+        for (var n = this.t - 1; n >= 0; --n) e[n] = this[n];
+        e.t = this.t, e.s = this.s;
+      }
+      function l(e) {
+        this.t = 1, this.s = e < 0 ? -1 : 0, e > 0 ? this[0] = e : e < -1 ? this[0] = e + this.DV : this.t = 0;
+      }
+      function T(e) {
+        var n = d();
+        return n.fromInt(e), n;
+      }
+      function h(e, n) {
+        var r;
+        if (n == 16) r = 4;
+        else if (n == 8) r = 3;
+        else if (n == 256) r = 8;
+        else if (n == 2) r = 1;
+        else if (n == 32) r = 5;
+        else if (n == 4) r = 2;
+        else {
+          this.fromRadix(e, n);
+          return;
+        }
+        this.t = 0, this.s = 0;
+        for (var c = e.length, x = !1, y = 0; --c >= 0; ) {
+          var S = r == 8 ? e[c] & 255 : w(e, c);
+          if (S < 0) {
+            e.charAt(c) == "-" && (x = !0);
+            continue;
+          }
+          x = !1, y == 0 ? this[this.t++] = S : y + r > this.DB ? (this[this.t - 1] |= (S & (1 << this.DB - y) - 1) << y, this[this.t++] = S >> this.DB - y) : this[this.t - 1] |= S << y, y += r, y >= this.DB && (y -= this.DB);
+        }
+        r == 8 && (e[0] & 128) != 0 && (this.s = -1, y > 0 && (this[this.t - 1] |= (1 << this.DB - y) - 1 << y)), this.clamp(), x && f.ZERO.subTo(this, this);
+      }
+      function F() {
+        for (var e = this.s & this.DM; this.t > 0 && this[this.t - 1] == e; ) --this.t;
+      }
+      function A(e) {
+        if (this.s < 0) return "-" + this.negate().toString(e);
+        var n;
+        if (e == 16) n = 4;
+        else if (e == 8) n = 3;
+        else if (e == 2) n = 1;
+        else if (e == 32) n = 5;
+        else if (e == 4) n = 2;
+        else return this.toRadix(e);
+        var r = (1 << n) - 1, c, x = !1, y = "", S = this.t, E = this.DB - S * this.DB % n;
+        if (S-- > 0)
+          for (E < this.DB && (c = this[S] >> E) > 0 && (x = !0, y = p(c)); S >= 0; )
+            E < n ? (c = (this[S] & (1 << E) - 1) << n - E, c |= this[--S] >> (E += this.DB - n)) : (c = this[S] >> (E -= n) & r, E <= 0 && (E += this.DB, --S)), c > 0 && (x = !0), x && (y += p(c));
+        return x ? y : "0";
+      }
+      function O() {
+        var e = d();
+        return f.ZERO.subTo(this, e), e;
+      }
+      function C() {
+        return this.s < 0 ? this.negate() : this;
+      }
+      function H(e) {
+        var n = this.s - e.s;
+        if (n != 0) return n;
+        var r = this.t;
+        if (n = r - e.t, n != 0) return this.s < 0 ? -n : n;
+        for (; --r >= 0; ) if ((n = this[r] - e[r]) != 0) return n;
+        return 0;
+      }
+      function D(e) {
+        var n = 1, r;
+        return (r = e >>> 16) != 0 && (e = r, n += 16), (r = e >> 8) != 0 && (e = r, n += 8), (r = e >> 4) != 0 && (e = r, n += 4), (r = e >> 2) != 0 && (e = r, n += 2), (r = e >> 1) != 0 && (e = r, n += 1), n;
+      }
+      function P() {
+        return this.t <= 0 ? 0 : this.DB * (this.t - 1) + D(this[this.t - 1] ^ this.s & this.DM);
+      }
+      function z(e, n) {
+        var r;
+        for (r = this.t - 1; r >= 0; --r) n[r + e] = this[r];
+        for (r = e - 1; r >= 0; --r) n[r] = 0;
+        n.t = this.t + e, n.s = this.s;
+      }
+      function L(e, n) {
+        for (var r = e; r < this.t; ++r) n[r - e] = this[r];
+        n.t = Math.max(this.t - e, 0), n.s = this.s;
+      }
+      function $(e, n) {
+        var r = e % this.DB, c = this.DB - r, x = (1 << c) - 1, y = Math.floor(e / this.DB), S = this.s << r & this.DM, E;
+        for (E = this.t - 1; E >= 0; --E)
+          n[E + y + 1] = this[E] >> c | S, S = (this[E] & x) << r;
+        for (E = y - 1; E >= 0; --E) n[E] = 0;
+        n[y] = S, n.t = this.t + y + 1, n.s = this.s, n.clamp();
+      }
+      function K(e, n) {
+        n.s = this.s;
+        var r = Math.floor(e / this.DB);
+        if (r >= this.t) {
+          n.t = 0;
+          return;
+        }
+        var c = e % this.DB, x = this.DB - c, y = (1 << c) - 1;
+        n[0] = this[r] >> c;
+        for (var S = r + 1; S < this.t; ++S)
+          n[S - r - 1] |= (this[S] & y) << x, n[S - r] = this[S] >> c;
+        c > 0 && (n[this.t - r - 1] |= (this.s & y) << x), n.t = this.t - r, n.clamp();
+      }
+      function G(e, n) {
+        for (var r = 0, c = 0, x = Math.min(e.t, this.t); r < x; )
+          c += this[r] - e[r], n[r++] = c & this.DM, c >>= this.DB;
+        if (e.t < this.t) {
+          for (c -= e.s; r < this.t; )
+            c += this[r], n[r++] = c & this.DM, c >>= this.DB;
+          c += this.s;
+        } else {
+          for (c += this.s; r < e.t; )
+            c -= e[r], n[r++] = c & this.DM, c >>= this.DB;
+          c -= e.s;
+        }
+        n.s = c < 0 ? -1 : 0, c < -1 ? n[r++] = this.DV + c : c > 0 && (n[r++] = c), n.t = r, n.clamp();
+      }
+      function it(e, n) {
+        var r = this.abs(), c = e.abs(), x = r.t;
+        for (n.t = x + c.t; --x >= 0; ) n[x] = 0;
+        for (x = 0; x < c.t; ++x) n[x + r.t] = r.am(0, c[x], n, x, 0, r.t);
+        n.s = 0, n.clamp(), this.s != e.s && f.ZERO.subTo(n, n);
+      }
+      function ct(e) {
+        for (var n = this.abs(), r = e.t = 2 * n.t; --r >= 0; ) e[r] = 0;
+        for (r = 0; r < n.t - 1; ++r) {
+          var c = n.am(r, n[r], e, 2 * r, 0, 1);
+          (e[r + n.t] += n.am(r + 1, 2 * n[r], e, 2 * r + 1, c, n.t - r - 1)) >= n.DV && (e[r + n.t] -= n.DV, e[r + n.t + 1] = 1);
+        }
+        e.t > 0 && (e[e.t - 1] += n.am(r, n[r], e, 2 * r, 0, 1)), e.s = 0, e.clamp();
+      }
+      function ut(e, n, r) {
+        var c = e.abs();
+        if (!(c.t <= 0)) {
+          var x = this.abs();
+          if (x.t < c.t) {
+            n != null && n.fromInt(0), r != null && this.copyTo(r);
+            return;
+          }
+          r == null && (r = d());
+          var y = d(), S = this.s, E = e.s, N = this.DB - D(c[c.t - 1]);
+          N > 0 ? (c.lShiftTo(N, y), x.lShiftTo(N, r)) : (c.copyTo(y), x.copyTo(r));
+          var k = y.t, Z = y[k - 1];
+          if (Z != 0) {
+            var U = Z * (1 << this.F1) + (k > 1 ? y[k - 2] >> this.F2 : 0), Q = this.FV / U, lt = (1 << this.F1) / U, J = 1 << this.F2, X = r.t, dt = X - k, tt = n ?? d();
+            for (y.dlShiftTo(dt, tt), r.compareTo(tt) >= 0 && (r[r.t++] = 1, r.subTo(tt, r)), f.ONE.dlShiftTo(k, tt), tt.subTo(y, y); y.t < k; ) y[y.t++] = 0;
+            for (; --dt >= 0; ) {
+              var St = r[--X] == Z ? this.DM : Math.floor(r[X] * Q + (r[X - 1] + J) * lt);
+              if ((r[X] += y.am(0, St, r, dt, 0, k)) < St)
+                for (y.dlShiftTo(dt, tt), r.subTo(tt, r); r[X] < --St; ) r.subTo(tt, r);
+            }
+            n != null && (r.drShiftTo(k, n), S != E && f.ZERO.subTo(n, n)), r.t = k, r.clamp(), N > 0 && r.rShiftTo(N, r), S < 0 && f.ZERO.subTo(r, r);
+          }
+        }
+      }
+      function at(e) {
+        var n = d();
+        return this.abs().divRemTo(e, null, n), this.s < 0 && n.compareTo(f.ZERO) > 0 && e.subTo(n, n), n;
+      }
+      function I(e) {
+        this.m = e;
+      }
+      function me(e) {
+        return e.s < 0 || e.compareTo(this.m) >= 0 ? e.mod(this.m) : e;
+      }
+      function ve(e) {
+        return e;
+      }
+      function ye(e) {
+        e.divRemTo(this.m, null, e);
+      }
+      function be(e, n, r) {
+        e.multiplyTo(n, r), this.reduce(r);
+      }
+      function we(e, n) {
+        e.squareTo(n), this.reduce(n);
+      }
+      I.prototype.convert = me, I.prototype.revert = ve, I.prototype.reduce = ye, I.prototype.mulTo = be, I.prototype.sqrTo = we;
+      function Te() {
+        if (this.t < 1) return 0;
+        var e = this[0];
+        if ((e & 1) == 0) return 0;
+        var n = e & 3;
+        return n = n * (2 - (e & 15) * n) & 15, n = n * (2 - (e & 255) * n) & 255, n = n * (2 - ((e & 65535) * n & 65535)) & 65535, n = n * (2 - e * n % this.DV) % this.DV, n > 0 ? this.DV - n : -n;
+      }
+      function nt(e) {
+        this.m = e, this.mp = e.invDigit(), this.mpl = this.mp & 32767, this.mph = this.mp >> 15, this.um = (1 << e.DB - 15) - 1, this.mt2 = 2 * e.t;
+      }
+      function Fe(e) {
+        var n = d();
+        return e.abs().dlShiftTo(this.m.t, n), n.divRemTo(this.m, null, n), e.s < 0 && n.compareTo(f.ZERO) > 0 && this.m.subTo(n, n), n;
+      }
+      function Se(e) {
+        var n = d();
+        return e.copyTo(n), this.reduce(n), n;
+      }
+      function Ee(e) {
+        for (; e.t <= this.mt2; )
+          e[e.t++] = 0;
+        for (var n = 0; n < this.m.t; ++n) {
+          var r = e[n] & 32767, c = r * this.mpl + ((r * this.mph + (e[n] >> 15) * this.mpl & this.um) << 15) & e.DM;
+          for (r = n + this.m.t, e[r] += this.m.am(0, c, e, n, 0, this.m.t); e[r] >= e.DV; )
+            e[r] -= e.DV, e[++r]++;
+        }
+        e.clamp(), e.drShiftTo(this.m.t, e), e.compareTo(this.m) >= 0 && e.subTo(this.m, e);
+      }
+      function Be(e, n) {
+        e.squareTo(n), this.reduce(n);
+      }
+      function _e(e, n, r) {
+        e.multiplyTo(n, r), this.reduce(r);
+      }
+      nt.prototype.convert = Fe, nt.prototype.revert = Se, nt.prototype.reduce = Ee, nt.prototype.mulTo = _e, nt.prototype.sqrTo = Be;
+      function Re() {
+        return (this.t > 0 ? this[0] & 1 : this.s) == 0;
+      }
+      function De(e, n) {
+        if (e > 4294967295 || e < 1) return f.ONE;
+        var r = d(), c = d(), x = n.convert(this), y = D(e) - 1;
+        for (x.copyTo(r); --y >= 0; )
+          if (n.sqrTo(r, c), (e & 1 << y) > 0) n.mulTo(c, x, r);
+          else {
+            var S = r;
+            r = c, c = S;
+          }
+        return n.revert(r);
+      }
+      function Ae(e, n) {
+        var r;
+        return e < 256 || n.isEven() ? r = new I(n) : r = new nt(n), this.exp(e, r);
+      }
+      f.prototype.copyTo = g, f.prototype.fromInt = l, f.prototype.fromString = h, f.prototype.clamp = F, f.prototype.dlShiftTo = z, f.prototype.drShiftTo = L, f.prototype.lShiftTo = $, f.prototype.rShiftTo = K, f.prototype.subTo = G, f.prototype.multiplyTo = it, f.prototype.squareTo = ct, f.prototype.divRemTo = ut, f.prototype.invDigit = Te, f.prototype.isEven = Re, f.prototype.exp = De, f.prototype.toString = A, f.prototype.negate = O, f.prototype.abs = C, f.prototype.compareTo = H, f.prototype.bitLength = P, f.prototype.mod = at, f.prototype.modPowInt = Ae, f.ZERO = T(0), f.ONE = T(1);
+      function Ie() {
+        var e = d();
+        return this.copyTo(e), e;
+      }
+      function Me() {
+        if (this.s < 0) {
+          if (this.t == 1) return this[0] - this.DV;
+          if (this.t == 0) return -1;
+        } else {
+          if (this.t == 1) return this[0];
+          if (this.t == 0) return 0;
+        }
+        return (this[1] & (1 << 32 - this.DB) - 1) << this.DB | this[0];
+      }
+      function Oe() {
+        return this.t == 0 ? this.s : this[0] << 24 >> 24;
+      }
+      function qe() {
+        return this.t == 0 ? this.s : this[0] << 16 >> 16;
+      }
+      function Ce(e) {
+        return Math.floor(Math.LN2 * this.DB / Math.log(e));
+      }
+      function Pe() {
+        return this.s < 0 ? -1 : this.t <= 0 || this.t == 1 && this[0] <= 0 ? 0 : 1;
+      }
+      function ze(e) {
+        if (e == null && (e = 10), this.signum() == 0 || e < 2 || e > 36) return "0";
+        var n = this.chunkSize(e), r = Math.pow(e, n), c = T(r), x = d(), y = d(), S = "";
+        for (this.divRemTo(c, x, y); x.signum() > 0; )
+          S = (r + y.intValue()).toString(e).substr(1) + S, x.divRemTo(c, x, y);
+        return y.intValue().toString(e) + S;
+      }
+      function He(e, n) {
+        this.fromInt(0), n == null && (n = 10);
+        for (var r = this.chunkSize(n), c = Math.pow(n, r), x = !1, y = 0, S = 0, E = 0; E < e.length; ++E) {
+          var N = w(e, E);
+          if (N < 0) {
+            e.charAt(E) == "-" && this.signum() == 0 && (x = !0);
+            continue;
+          }
+          S = n * S + N, ++y >= r && (this.dMultiply(c), this.dAddOffset(S, 0), y = 0, S = 0);
+        }
+        y > 0 && (this.dMultiply(Math.pow(n, y)), this.dAddOffset(S, 0)), x && f.ZERO.subTo(this, this);
+      }
+      function Le(e, n, r) {
+        if (typeof n == "number")
+          if (e < 2) this.fromInt(1);
+          else
+            for (this.fromNumber(e, r), this.testBit(e - 1) || this.bitwiseTo(f.ONE.shiftLeft(e - 1), wt, this), this.isEven() && this.dAddOffset(1, 0); !this.isProbablePrime(n); )
+              this.dAddOffset(2, 0), this.bitLength() > e && this.subTo(f.ONE.shiftLeft(e - 1), this);
+        else {
+          var c = new Array(), x = e & 7;
+          c.length = (e >> 3) + 1, n.nextBytes(c), x > 0 ? c[0] &= (1 << x) - 1 : c[0] = 0, this.fromString(c, 256);
+        }
+      }
+      function Ne() {
+        var e = this.t, n = new Array();
+        n[0] = this.s;
+        var r = this.DB - e * this.DB % 8, c, x = 0;
+        if (e-- > 0)
+          for (r < this.DB && (c = this[e] >> r) != (this.s & this.DM) >> r && (n[x++] = c | this.s << this.DB - r); e >= 0; )
+            r < 8 ? (c = (this[e] & (1 << r) - 1) << 8 - r, c |= this[--e] >> (r += this.DB - 8)) : (c = this[e] >> (r -= 8) & 255, r <= 0 && (r += this.DB, --e)), (c & 128) != 0 && (c |= -256), x == 0 && (this.s & 128) != (c & 128) && ++x, (x > 0 || c != this.s) && (n[x++] = c);
+        return n;
+      }
+      function Ye(e) {
+        return this.compareTo(e) == 0;
+      }
+      function ke(e) {
+        return this.compareTo(e) < 0 ? this : e;
+      }
+      function Ve(e) {
+        return this.compareTo(e) > 0 ? this : e;
+      }
+      function $e(e, n, r) {
+        var c, x, y = Math.min(e.t, this.t);
+        for (c = 0; c < y; ++c) r[c] = n(this[c], e[c]);
+        if (e.t < this.t) {
+          for (x = e.s & this.DM, c = y; c < this.t; ++c) r[c] = n(this[c], x);
+          r.t = this.t;
+        } else {
+          for (x = this.s & this.DM, c = y; c < e.t; ++c) r[c] = n(x, e[c]);
+          r.t = e.t;
+        }
+        r.s = n(this.s, e.s), r.clamp();
+      }
+      function je(e, n) {
+        return e & n;
+      }
+      function Ue(e) {
+        var n = d();
+        return this.bitwiseTo(e, je, n), n;
+      }
+      function wt(e, n) {
+        return e | n;
+      }
+      function Ze(e) {
+        var n = d();
+        return this.bitwiseTo(e, wt, n), n;
+      }
+      function zt(e, n) {
+        return e ^ n;
+      }
+      function Ge(e) {
+        var n = d();
+        return this.bitwiseTo(e, zt, n), n;
+      }
+      function Ht(e, n) {
+        return e & ~n;
+      }
+      function We(e) {
+        var n = d();
+        return this.bitwiseTo(e, Ht, n), n;
+      }
+      function Je() {
+        for (var e = d(), n = 0; n < this.t; ++n) e[n] = this.DM & ~this[n];
+        return e.t = this.t, e.s = ~this.s, e;
+      }
+      function Xe(e) {
+        var n = d();
+        return e < 0 ? this.rShiftTo(-e, n) : this.lShiftTo(e, n), n;
+      }
+      function Ke(e) {
+        var n = d();
+        return e < 0 ? this.lShiftTo(-e, n) : this.rShiftTo(e, n), n;
+      }
+      function Qe(e) {
+        if (e == 0) return -1;
+        var n = 0;
+        return (e & 65535) == 0 && (e >>= 16, n += 16), (e & 255) == 0 && (e >>= 8, n += 8), (e & 15) == 0 && (e >>= 4, n += 4), (e & 3) == 0 && (e >>= 2, n += 2), (e & 1) == 0 && ++n, n;
+      }
+      function tn() {
+        for (var e = 0; e < this.t; ++e)
+          if (this[e] != 0) return e * this.DB + Qe(this[e]);
+        return this.s < 0 ? this.t * this.DB : -1;
+      }
+      function en(e) {
+        for (var n = 0; e != 0; )
+          e &= e - 1, ++n;
+        return n;
+      }
+      function nn() {
+        for (var e = 0, n = this.s & this.DM, r = 0; r < this.t; ++r) e += en(this[r] ^ n);
+        return e;
+      }
+      function rn(e) {
+        var n = Math.floor(e / this.DB);
+        return n >= this.t ? this.s != 0 : (this[n] & 1 << e % this.DB) != 0;
+      }
+      function on(e, n) {
+        var r = f.ONE.shiftLeft(e);
+        return this.bitwiseTo(r, n, r), r;
+      }
+      function sn(e) {
+        return this.changeBit(e, wt);
+      }
+      function fn(e) {
+        return this.changeBit(e, Ht);
+      }
+      function cn(e) {
+        return this.changeBit(e, zt);
+      }
+      function un(e, n) {
+        for (var r = 0, c = 0, x = Math.min(e.t, this.t); r < x; )
+          c += this[r] + e[r], n[r++] = c & this.DM, c >>= this.DB;
+        if (e.t < this.t) {
+          for (c += e.s; r < this.t; )
+            c += this[r], n[r++] = c & this.DM, c >>= this.DB;
+          c += this.s;
+        } else {
+          for (c += this.s; r < e.t; )
+            c += e[r], n[r++] = c & this.DM, c >>= this.DB;
+          c += e.s;
+        }
+        n.s = c < 0 ? -1 : 0, c > 0 ? n[r++] = c : c < -1 && (n[r++] = this.DV + c), n.t = r, n.clamp();
+      }
+      function an(e) {
+        var n = d();
+        return this.addTo(e, n), n;
+      }
+      function hn(e) {
+        var n = d();
+        return this.subTo(e, n), n;
+      }
+      function ln(e) {
+        var n = d();
+        return this.multiplyTo(e, n), n;
+      }
+      function dn() {
+        var e = d();
+        return this.squareTo(e), e;
+      }
+      function pn(e) {
+        var n = d();
+        return this.divRemTo(e, n, null), n;
+      }
+      function gn(e) {
+        var n = d();
+        return this.divRemTo(e, null, n), n;
+      }
+      function xn(e) {
+        var n = d(), r = d();
+        return this.divRemTo(e, n, r), new Array(n, r);
+      }
+      function mn(e) {
+        this[this.t] = this.am(0, e - 1, this, 0, 0, this.t), ++this.t, this.clamp();
+      }
+      function vn(e, n) {
+        if (e != 0) {
+          for (; this.t <= n; ) this[this.t++] = 0;
+          for (this[n] += e; this[n] >= this.DV; )
+            this[n] -= this.DV, ++n >= this.t && (this[this.t++] = 0), ++this[n];
+        }
+      }
+      function st() {
+      }
+      function Lt(e) {
+        return e;
+      }
+      function yn(e, n, r) {
+        e.multiplyTo(n, r);
+      }
+      function bn(e, n) {
+        e.squareTo(n);
+      }
+      st.prototype.convert = Lt, st.prototype.revert = Lt, st.prototype.mulTo = yn, st.prototype.sqrTo = bn;
+      function wn(e) {
+        return this.exp(e, new st());
+      }
+      function Tn(e, n, r) {
+        var c = Math.min(this.t + e.t, n);
+        for (r.s = 0, r.t = c; c > 0; ) r[--c] = 0;
+        var x;
+        for (x = r.t - this.t; c < x; ++c) r[c + this.t] = this.am(0, e[c], r, c, 0, this.t);
+        for (x = Math.min(e.t, n); c < x; ++c) this.am(0, e[c], r, c, 0, n - c);
+        r.clamp();
+      }
+      function Fn(e, n, r) {
+        --n;
+        var c = r.t = this.t + e.t - n;
+        for (r.s = 0; --c >= 0; ) r[c] = 0;
+        for (c = Math.max(n - this.t, 0); c < e.t; ++c)
+          r[this.t + c - n] = this.am(n - c, e[c], r, 0, 0, this.t + c - n);
+        r.clamp(), r.drShiftTo(1, r);
+      }
+      function rt(e) {
+        this.r2 = d(), this.q3 = d(), f.ONE.dlShiftTo(2 * e.t, this.r2), this.mu = this.r2.divide(e), this.m = e;
+      }
+      function Sn(e) {
+        if (e.s < 0 || e.t > 2 * this.m.t) return e.mod(this.m);
+        if (e.compareTo(this.m) < 0) return e;
+        var n = d();
+        return e.copyTo(n), this.reduce(n), n;
+      }
+      function En(e) {
+        return e;
+      }
+      function Bn(e) {
+        for (e.drShiftTo(this.m.t - 1, this.r2), e.t > this.m.t + 1 && (e.t = this.m.t + 1, e.clamp()), this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3), this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2); e.compareTo(this.r2) < 0; ) e.dAddOffset(1, this.m.t + 1);
+        for (e.subTo(this.r2, e); e.compareTo(this.m) >= 0; ) e.subTo(this.m, e);
+      }
+      function _n(e, n) {
+        e.squareTo(n), this.reduce(n);
+      }
+      function Rn(e, n, r) {
+        e.multiplyTo(n, r), this.reduce(r);
+      }
+      rt.prototype.convert = Sn, rt.prototype.revert = En, rt.prototype.reduce = Bn, rt.prototype.mulTo = Rn, rt.prototype.sqrTo = _n;
+      function Dn(e, n) {
+        var r = e.bitLength(), c, x = T(1), y;
+        if (r <= 0) return x;
+        r < 18 ? c = 1 : r < 48 ? c = 3 : r < 144 ? c = 4 : r < 768 ? c = 5 : c = 6, r < 8 ? y = new I(n) : n.isEven() ? y = new rt(n) : y = new nt(n);
+        var S = new Array(), E = 3, N = c - 1, k = (1 << c) - 1;
+        if (S[1] = y.convert(this), c > 1) {
+          var Z = d();
+          for (y.sqrTo(S[1], Z); E <= k; )
+            S[E] = d(), y.mulTo(Z, S[E - 2], S[E]), E += 2;
+        }
+        var U = e.t - 1, Q, lt = !0, J = d(), X;
+        for (r = D(e[U]) - 1; U >= 0; ) {
+          for (r >= N ? Q = e[U] >> r - N & k : (Q = (e[U] & (1 << r + 1) - 1) << N - r, U > 0 && (Q |= e[U - 1] >> this.DB + r - N)), E = c; (Q & 1) == 0; )
+            Q >>= 1, --E;
+          if ((r -= E) < 0 && (r += this.DB, --U), lt)
+            S[Q].copyTo(x), lt = !1;
+          else {
+            for (; E > 1; )
+              y.sqrTo(x, J), y.sqrTo(J, x), E -= 2;
+            E > 0 ? y.sqrTo(x, J) : (X = x, x = J, J = X), y.mulTo(J, S[Q], x);
+          }
+          for (; U >= 0 && (e[U] & 1 << r) == 0; )
+            y.sqrTo(x, J), X = x, x = J, J = X, --r < 0 && (r = this.DB - 1, --U);
+        }
+        return y.revert(x);
+      }
+      function An(e) {
+        var n = this.s < 0 ? this.negate() : this.clone(), r = e.s < 0 ? e.negate() : e.clone();
+        if (n.compareTo(r) < 0) {
+          var c = n;
+          n = r, r = c;
+        }
+        var x = n.getLowestSetBit(), y = r.getLowestSetBit();
+        if (y < 0) return n;
+        for (x < y && (y = x), y > 0 && (n.rShiftTo(y, n), r.rShiftTo(y, r)); n.signum() > 0; )
+          (x = n.getLowestSetBit()) > 0 && n.rShiftTo(x, n), (x = r.getLowestSetBit()) > 0 && r.rShiftTo(x, r), n.compareTo(r) >= 0 ? (n.subTo(r, n), n.rShiftTo(1, n)) : (r.subTo(n, r), r.rShiftTo(1, r));
+        return y > 0 && r.lShiftTo(y, r), r;
+      }
+      function In(e) {
+        if (e <= 0) return 0;
+        var n = this.DV % e, r = this.s < 0 ? e - 1 : 0;
+        if (this.t > 0)
+          if (n == 0) r = this[0] % e;
+          else for (var c = this.t - 1; c >= 0; --c) r = (n * r + this[c]) % e;
+        return r;
+      }
+      function Mn(e) {
+        var n = e.isEven();
+        if (this.isEven() && n || e.signum() == 0) return f.ZERO;
+        for (var r = e.clone(), c = this.clone(), x = T(1), y = T(0), S = T(0), E = T(1); r.signum() != 0; ) {
+          for (; r.isEven(); )
+            r.rShiftTo(1, r), n ? ((!x.isEven() || !y.isEven()) && (x.addTo(this, x), y.subTo(e, y)), x.rShiftTo(1, x)) : y.isEven() || y.subTo(e, y), y.rShiftTo(1, y);
+          for (; c.isEven(); )
+            c.rShiftTo(1, c), n ? ((!S.isEven() || !E.isEven()) && (S.addTo(this, S), E.subTo(e, E)), S.rShiftTo(1, S)) : E.isEven() || E.subTo(e, E), E.rShiftTo(1, E);
+          r.compareTo(c) >= 0 ? (r.subTo(c, r), n && x.subTo(S, x), y.subTo(E, y)) : (c.subTo(r, c), n && S.subTo(x, S), E.subTo(y, E));
+        }
+        if (c.compareTo(f.ONE) != 0) return f.ZERO;
+        if (E.compareTo(e) >= 0) return E.subtract(e);
+        if (E.signum() < 0) E.addTo(e, E);
+        else return E;
+        return E.signum() < 0 ? E.add(e) : E;
+      }
+      var V = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997], On = (1 << 26) / V[V.length - 1];
+      function qn(e) {
+        var n, r = this.abs();
+        if (r.t == 1 && r[0] <= V[V.length - 1]) {
+          for (n = 0; n < V.length; ++n)
+            if (r[0] == V[n]) return !0;
+          return !1;
+        }
+        if (r.isEven()) return !1;
+        for (n = 1; n < V.length; ) {
+          for (var c = V[n], x = n + 1; x < V.length && c < On; ) c *= V[x++];
+          for (c = r.modInt(c); n < x; ) if (c % V[n++] == 0) return !1;
+        }
+        return r.millerRabin(e);
+      }
+      function Cn(e) {
+        var n = this.subtract(f.ONE), r = n.getLowestSetBit();
+        if (r <= 0) return !1;
+        var c = n.shiftRight(r);
+        e = e + 1 >> 1, e > V.length && (e = V.length);
+        for (var x = d(), y = 0; y < e; ++y) {
+          x.fromInt(V[Math.floor(Math.random() * V.length)]);
+          var S = x.modPow(c, this);
+          if (S.compareTo(f.ONE) != 0 && S.compareTo(n) != 0) {
+            for (var E = 1; E++ < r && S.compareTo(n) != 0; )
+              if (S = S.modPowInt(2, this), S.compareTo(f.ONE) == 0) return !1;
+            if (S.compareTo(n) != 0) return !1;
+          }
+        }
+        return !0;
+      }
+      f.prototype.chunkSize = Ce, f.prototype.toRadix = ze, f.prototype.fromRadix = He, f.prototype.fromNumber = Le, f.prototype.bitwiseTo = $e, f.prototype.changeBit = on, f.prototype.addTo = un, f.prototype.dMultiply = mn, f.prototype.dAddOffset = vn, f.prototype.multiplyLowerTo = Tn, f.prototype.multiplyUpperTo = Fn, f.prototype.modInt = In, f.prototype.millerRabin = Cn, f.prototype.clone = Ie, f.prototype.intValue = Me, f.prototype.byteValue = Oe, f.prototype.shortValue = qe, f.prototype.signum = Pe, f.prototype.toByteArray = Ne, f.prototype.equals = Ye, f.prototype.min = ke, f.prototype.max = Ve, f.prototype.and = Ue, f.prototype.or = Ze, f.prototype.xor = Ge, f.prototype.andNot = We, f.prototype.not = Je, f.prototype.shiftLeft = Xe, f.prototype.shiftRight = Ke, f.prototype.getLowestSetBit = tn, f.prototype.bitCount = nn, f.prototype.testBit = rn, f.prototype.setBit = sn, f.prototype.clearBit = fn, f.prototype.flipBit = cn, f.prototype.add = an, f.prototype.subtract = hn, f.prototype.multiply = ln, f.prototype.divide = pn, f.prototype.remainder = gn, f.prototype.divideAndRemainder = xn, f.prototype.modPow = Dn, f.prototype.modInverse = Mn, f.prototype.pow = wn, f.prototype.gcd = An, f.prototype.isProbablePrime = qn, f.prototype.square = dn, f.prototype.Barrett = rt;
+      var ht, j, Y;
+      function Pn(e) {
+        j[Y++] ^= e & 255, j[Y++] ^= e >> 8 & 255, j[Y++] ^= e >> 16 & 255, j[Y++] ^= e >> 24 & 255, Y >= Ft && (Y -= Ft);
+      }
+      function Nt() {
+        Pn((/* @__PURE__ */ new Date()).getTime());
+      }
+      if (j == null) {
+        j = new Array(), Y = 0;
+        var W;
+        if (typeof window < "u" && window.crypto) {
+          if (window.crypto.getRandomValues) {
+            var Yt = new Uint8Array(32);
+            for (window.crypto.getRandomValues(Yt), W = 0; W < 32; ++W)
+              j[Y++] = Yt[W];
+          } else if (navigator.appName == "Netscape" && navigator.appVersion < "5") {
+            var kt = window.crypto.random(32);
+            for (W = 0; W < kt.length; ++W)
+              j[Y++] = kt.charCodeAt(W) & 255;
+          }
+        }
+        for (; Y < Ft; )
+          W = Math.floor(65536 * Math.random()), j[Y++] = W >>> 8, j[Y++] = W & 255;
+        Y = 0, Nt();
+      }
+      function zn() {
+        if (ht == null) {
+          for (Nt(), ht = Yn(), ht.init(j), Y = 0; Y < j.length; ++Y)
+            j[Y] = 0;
+          Y = 0;
+        }
+        return ht.next();
+      }
+      function Hn(e) {
+        var n;
+        for (n = 0; n < e.length; ++n) e[n] = zn();
+      }
+      function Vt() {
+      }
+      Vt.prototype.nextBytes = Hn;
+      function Tt() {
+        this.i = 0, this.j = 0, this.S = new Array();
+      }
+      function Ln(e) {
+        var n, r, c;
+        for (n = 0; n < 256; ++n)
+          this.S[n] = n;
+        for (r = 0, n = 0; n < 256; ++n)
+          r = r + this.S[n] + e[n % e.length] & 255, c = this.S[n], this.S[n] = this.S[r], this.S[r] = c;
+        this.i = 0, this.j = 0;
+      }
+      function Nn() {
+        var e;
+        return this.i = this.i + 1 & 255, this.j = this.j + this.S[this.i] & 255, e = this.S[this.i], this.S[this.i] = this.S[this.j], this.S[this.j] = e, this.S[e + this.S[this.i] & 255];
+      }
+      Tt.prototype.init = Ln, Tt.prototype.next = Nn;
+      function Yn() {
+        return new Tt();
+      }
+      var Ft = 256;
+      t.exports = {
+        default: f,
+        BigInteger: f,
+        SecureRandom: Vt
+      };
+    }).call(ti);
+  }(gt)), gt.exports;
+}
+var Et, Zt;
+function ei() {
+  if (Zt) return Et;
+  Zt = 1;
+  const { BigInteger: t } = bt();
+  function i(b) {
+    let m = b.toString(16);
+    if (m[0] !== "-")
+      m.length % 2 === 1 ? m = "0" + m : m.match(/^[0-7]/) || (m = "00" + m);
+    else {
+      m = m.substr(1);
+      let v = m.length;
+      v % 2 === 1 ? v += 1 : m.match(/^[0-7]/) || (v += 2);
+      let B = "";
+      for (let _ = 0; _ < v; _++) B += "f";
+      B = new t(B, 16), m = B.xor(b).add(t.ONE), m = m.toString(16).replace(/^-/, "");
+    }
+    return m;
+  }
+  class o {
+    constructor() {
+      this.tlv = null, this.t = "00", this.l = "00", this.v = "";
+    }
+    /**
+     * 获取 der 编码比特流16进制串
+     */
+    getEncodedHex() {
+      return this.tlv || (this.v = this.getValue(), this.l = this.getLength(), this.tlv = this.t + this.l + this.v), this.tlv;
+    }
+    getLength() {
+      const m = this.v.length / 2;
+      let v = m.toString(16);
+      return v.length % 2 === 1 && (v = "0" + v), m < 128 ? v : (128 + v.length / 2).toString(16) + v;
+    }
+    getValue() {
+      return "";
+    }
+  }
+  class s extends o {
+    constructor(m) {
+      super(), this.t = "02", m && (this.v = i(m));
+    }
+    getValue() {
+      return this.v;
+    }
+  }
+  class u extends o {
+    constructor(m) {
+      super(), this.t = "30", this.asn1Array = m;
+    }
+    getValue() {
+      return this.v = this.asn1Array.map((m) => m.getEncodedHex()).join(""), this.v;
+    }
+  }
+  function f(b, m) {
+    return +b[m + 2] < 8 ? 1 : +b.substr(m + 2, 2) & 128;
+  }
+  function d(b, m) {
+    const v = f(b, m), B = b.substr(m + 2, v * 2);
+    return B ? (+B[0] < 8 ? new t(B, 16) : new t(B.substr(2), 16)).intValue() : -1;
+  }
+  function a(b, m) {
+    const v = f(b, m);
+    return m + (v + 1) * 2;
+  }
+  return Et = {
+    /**
+     * ASN.1 der 编码，针对 sm2 签名
+     */
+    encodeDer(b, m) {
+      const v = new s(b), B = new s(m);
+      return new u([v, B]).getEncodedHex();
+    },
+    /**
+     * 解析 ASN.1 der，针对 sm2 验签
+     */
+    decodeDer(b) {
+      const m = a(b, 0), v = a(b, m), B = d(b, m), _ = b.substr(v, B * 2), M = v + _.length, R = a(b, M), q = d(b, M), p = b.substr(R, q * 2), w = new t(_, 16), g = new t(p, 16);
+      return { r: w, s: g };
+    }
+  }, Et;
+}
+var Bt, Gt;
+function ni() {
+  if (Gt) return Bt;
+  Gt = 1;
+  const { BigInteger: t } = bt(), i = new t("2"), o = new t("3");
+  class s {
+    constructor(a, b) {
+      this.x = b, this.q = a;
+    }
+    /**
+     * 判断相等
+     */
+    equals(a) {
+      return a === this ? !0 : this.q.equals(a.q) && this.x.equals(a.x);
+    }
+    /**
+     * 返回具体数值
+     */
+    toBigInteger() {
+      return this.x;
+    }
+    /**
+     * 取反
+     */
+    negate() {
+      return new s(this.q, this.x.negate().mod(this.q));
+    }
+    /**
+     * 相加
+     */
+    add(a) {
+      return new s(this.q, this.x.add(a.toBigInteger()).mod(this.q));
+    }
+    /**
+     * 相减
+     */
+    subtract(a) {
+      return new s(this.q, this.x.subtract(a.toBigInteger()).mod(this.q));
+    }
+    /**
+     * 相乘
+     */
+    multiply(a) {
+      return new s(this.q, this.x.multiply(a.toBigInteger()).mod(this.q));
+    }
+    /**
+     * 相除
+     */
+    divide(a) {
+      return new s(this.q, this.x.multiply(a.toBigInteger().modInverse(this.q)).mod(this.q));
+    }
+    /**
+     * 平方
+     */
+    square() {
+      return new s(this.q, this.x.square().mod(this.q));
+    }
+  }
+  class u {
+    constructor(a, b, m, v) {
+      this.curve = a, this.x = b, this.y = m, this.z = v ?? t.ONE, this.zinv = null;
+    }
+    getX() {
+      return this.zinv === null && (this.zinv = this.z.modInverse(this.curve.q)), this.curve.fromBigInteger(this.x.toBigInteger().multiply(this.zinv).mod(this.curve.q));
+    }
+    getY() {
+      return this.zinv === null && (this.zinv = this.z.modInverse(this.curve.q)), this.curve.fromBigInteger(this.y.toBigInteger().multiply(this.zinv).mod(this.curve.q));
+    }
+    /**
+     * 判断相等
+     */
+    equals(a) {
+      return a === this ? !0 : this.isInfinity() ? a.isInfinity() : a.isInfinity() ? this.isInfinity() : a.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(a.z)).mod(this.curve.q).equals(t.ZERO) ? a.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(a.z)).mod(this.curve.q).equals(t.ZERO) : !1;
+    }
+    /**
+     * 是否是无穷远点
+     */
+    isInfinity() {
+      return this.x === null && this.y === null ? !0 : this.z.equals(t.ZERO) && !this.y.toBigInteger().equals(t.ZERO);
+    }
+    /**
+     * 取反，x 轴对称点
+     */
+    negate() {
+      return new u(this.curve, this.x, this.y.negate(), this.z);
+    }
+    /**
+     * 相加
+     *
+     * 标准射影坐标系：
+     *
+     * λ1 = x1 * z2
+     * λ2 = x2 * z1
+     * λ3 = λ1 − λ2
+     * λ4 = y1 * z2
+     * λ5 = y2 * z1
+     * λ6 = λ4 − λ5
+     * λ7 = λ1 + λ2
+     * λ8 = z1 * z2
+     * λ9 = λ3^2
+     * λ10 = λ3 * λ9
+     * λ11 = λ8 * λ6^2 − λ7 * λ9
+     * x3 = λ3 * λ11
+     * y3 = λ6 * (λ9 * λ1 − λ11) − λ4 * λ10
+     * z3 = λ10 * λ8
+     */
+    add(a) {
+      if (this.isInfinity()) return a;
+      if (a.isInfinity()) return this;
+      const b = this.x.toBigInteger(), m = this.y.toBigInteger(), v = this.z, B = a.x.toBigInteger(), _ = a.y.toBigInteger(), M = a.z, R = this.curve.q, q = b.multiply(M).mod(R), p = B.multiply(v).mod(R), w = q.subtract(p), g = m.multiply(M).mod(R), l = _.multiply(v).mod(R), T = g.subtract(l);
+      if (t.ZERO.equals(w))
+        return t.ZERO.equals(T) ? this.twice() : this.curve.infinity;
+      const h = q.add(p), F = v.multiply(M).mod(R), A = w.square().mod(R), O = w.multiply(A).mod(R), C = F.multiply(T.square()).subtract(h.multiply(A)).mod(R), H = w.multiply(C).mod(R), D = T.multiply(A.multiply(q).subtract(C)).subtract(g.multiply(O)).mod(R), P = O.multiply(F).mod(R);
+      return new u(this.curve, this.curve.fromBigInteger(H), this.curve.fromBigInteger(D), P);
+    }
+    /**
+     * 自加
+     *
+     * 标准射影坐标系：
+     *
+     * λ1 = 3 * x1^2 + a * z1^2
+     * λ2 = 2 * y1 * z1
+     * λ3 = y1^2
+     * λ4 = λ3 * x1 * z1
+     * λ5 = λ2^2
+     * λ6 = λ1^2 − 8 * λ4
+     * x3 = λ2 * λ6
+     * y3 = λ1 * (4 * λ4 − λ6) − 2 * λ5 * λ3
+     * z3 = λ2 * λ5
+     */
+    twice() {
+      if (this.isInfinity()) return this;
+      if (!this.y.toBigInteger().signum()) return this.curve.infinity;
+      const a = this.x.toBigInteger(), b = this.y.toBigInteger(), m = this.z, v = this.curve.q, B = this.curve.a.toBigInteger(), _ = a.square().multiply(o).add(B.multiply(m.square())).mod(v), M = b.shiftLeft(1).multiply(m).mod(v), R = b.square().mod(v), q = R.multiply(a).multiply(m).mod(v), p = M.square().mod(v), w = _.square().subtract(q.shiftLeft(3)).mod(v), g = M.multiply(w).mod(v), l = _.multiply(q.shiftLeft(2).subtract(w)).subtract(p.shiftLeft(1).multiply(R)).mod(v), T = M.multiply(p).mod(v);
+      return new u(this.curve, this.curve.fromBigInteger(g), this.curve.fromBigInteger(l), T);
+    }
+    /**
+     * 倍点计算
+     */
+    multiply(a) {
+      if (this.isInfinity()) return this;
+      if (!a.signum()) return this.curve.infinity;
+      const b = a.multiply(o), m = this.negate();
+      let v = this;
+      for (let B = b.bitLength() - 2; B > 0; B--) {
+        v = v.twice();
+        const _ = b.testBit(B), M = a.testBit(B);
+        _ !== M && (v = v.add(_ ? this : m));
+      }
+      return v;
+    }
+  }
+  class f {
+    constructor(a, b, m) {
+      this.q = a, this.a = this.fromBigInteger(b), this.b = this.fromBigInteger(m), this.infinity = new u(this, null, null);
+    }
+    /**
+     * 判断两个椭圆曲线是否相等
+     */
+    equals(a) {
+      return a === this ? !0 : this.q.equals(a.q) && this.a.equals(a.a) && this.b.equals(a.b);
+    }
+    /**
+     * 生成椭圆曲线域元素
+     */
+    fromBigInteger(a) {
+      return new s(this.q, a);
+    }
+    /**
+     * 解析 16 进制串为椭圆曲线点
+     */
+    decodePointHex(a) {
+      switch (parseInt(a.substr(0, 2), 16)) {
+        // 第一个字节
+        case 0:
+          return this.infinity;
+        case 2:
+        case 3:
+          const b = this.fromBigInteger(new t(a.substr(2), 16));
+          let m = this.fromBigInteger(b.multiply(b.square()).add(
+            b.multiply(this.a)
+          ).add(this.b).toBigInteger().modPow(
+            this.q.divide(new t("4")).add(t.ONE),
+            this.q
+          ));
+          return m.toBigInteger().mod(i).equals(new t(a.substr(0, 2), 16).subtract(i)) || (m = m.negate()), new u(this, b, m);
+        case 4:
+        case 6:
+        case 7:
+          const v = (a.length - 2) / 2, B = a.substr(2, v), _ = a.substr(v + 2, v);
+          return new u(this, this.fromBigInteger(new t(B, 16)), this.fromBigInteger(new t(_, 16)));
+        default:
+          return null;
+      }
+    }
+  }
+  return Bt = {
+    ECPointFp: u,
+    ECCurveFp: f
+  }, Bt;
+}
+var _t, Wt;
+function ri() {
+  if (Wt) return _t;
+  Wt = 1;
+  const { BigInteger: t, SecureRandom: i } = bt(), { ECCurveFp: o } = ni(), s = new i(), { curve: u, G: f, n: d } = b();
+  function a() {
+    return u;
+  }
+  function b() {
+    const g = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), l = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16), T = new t("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16), h = new o(g, l, T), O = h.decodePointHex("04" + "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7" + "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0"), C = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16);
+    return { curve: h, G: O, n: C };
+  }
+  function m(g, l, T) {
+    const F = (g ? new t(g, l, T) : new t(d.bitLength(), s)).mod(d.subtract(t.ONE)).add(t.ONE), A = _(F.toString(16), 64), O = f.multiply(F), C = _(O.getX().toBigInteger().toString(16), 64), H = _(O.getY().toBigInteger().toString(16), 64), D = "04" + C + H;
+    return { privateKey: A, publicKey: D };
+  }
+  function v(g) {
+    if (g.length !== 130) throw new Error("Invalid public key to compress");
+    const l = (g.length - 2) / 2, T = g.substr(2, l), h = new t(g.substr(l + 2, l), 16);
+    let F = "03";
+    return h.mod(new t("2")).equals(t.ZERO) && (F = "02"), F + T;
+  }
+  function B(g) {
+    g = unescape(encodeURIComponent(g));
+    const l = g.length, T = [];
+    for (let F = 0; F < l; F++)
+      T[F >>> 2] |= (g.charCodeAt(F) & 255) << 24 - F % 4 * 8;
+    const h = [];
+    for (let F = 0; F < l; F++) {
+      const A = T[F >>> 2] >>> 24 - F % 4 * 8 & 255;
+      h.push((A >>> 4).toString(16)), h.push((A & 15).toString(16));
+    }
+    return h.join("");
+  }
+  function _(g, l) {
+    return g.length >= l ? g : new Array(l - g.length + 1).join("0") + g;
+  }
+  function M(g) {
+    return g.map((l) => (l = l.toString(16), l.length === 1 ? "0" + l : l)).join("");
+  }
+  function R(g) {
+    const l = [];
+    let T = 0;
+    for (let h = 0; h < g.length * 2; h += 2)
+      l[h >>> 3] |= parseInt(g[T], 10) << 24 - h % 8 * 4, T++;
+    try {
+      const h = [];
+      for (let F = 0; F < g.length; F++) {
+        const A = l[F >>> 2] >>> 24 - F % 4 * 8 & 255;
+        h.push(String.fromCharCode(A));
+      }
+      return decodeURIComponent(escape(h.join("")));
+    } catch {
+      throw new Error("Malformed UTF-8 data");
+    }
+  }
+  function q(g) {
+    const l = [];
+    let T = g.length;
+    T % 2 !== 0 && (g = _(g, T + 1)), T = g.length;
+    for (let h = 0; h < T; h += 2)
+      l.push(parseInt(g.substr(h, 2), 16));
+    return l;
+  }
+  function p(g) {
+    const l = u.decodePointHex(g);
+    if (!l) return !1;
+    const T = l.getX();
+    return l.getY().square().equals(T.multiply(T.square()).add(T.multiply(u.a)).add(u.b));
+  }
+  function w(g, l) {
+    const T = u.decodePointHex(g);
+    if (!T) return !1;
+    const h = u.decodePointHex(l);
+    return h ? T.equals(h) : !1;
+  }
+  return _t = {
+    getGlobalCurve: a,
+    generateEcparam: b,
+    generateKeyPairHex: m,
+    compressPublicKeyHex: v,
+    utf8ToHex: B,
+    leftPad: _,
+    arrayToHex: M,
+    arrayToUtf8: R,
+    hexToArray: q,
+    verifyPublicKey: p,
+    comparePublicKeyHex: w
+  }, _t;
+}
+var Rt, Jt;
+function de() {
+  if (Jt) return Rt;
+  Jt = 1;
+  const t = new Uint32Array(68), i = new Uint32Array(64);
+  function o(B, _) {
+    const M = _ & 31;
+    return B << M | B >>> 32 - M;
+  }
+  function s(B, _) {
+    const M = [];
+    for (let R = B.length - 1; R >= 0; R--) M[R] = (B[R] ^ _[R]) & 255;
+    return M;
+  }
+  function u(B) {
+    return B ^ o(B, 9) ^ o(B, 17);
+  }
+  function f(B) {
+    return B ^ o(B, 15) ^ o(B, 23);
+  }
+  function d(B) {
+    let _ = B.length * 8, M = _ % 512;
+    M = M >= 448 ? 512 - M % 448 - 1 : 448 - M - 1;
+    const R = new Array((M - 7) / 8), q = new Array(8);
+    for (let h = 0, F = R.length; h < F; h++) R[h] = 0;
+    for (let h = 0, F = q.length; h < F; h++) q[h] = 0;
+    _ = _.toString(2);
+    for (let h = 7; h >= 0; h--)
+      if (_.length > 8) {
+        const F = _.length - 8;
+        q[h] = parseInt(_.substr(F), 2), _ = _.substr(0, F);
+      } else _.length > 0 && (q[h] = parseInt(_, 2), _ = "");
+    const p = new Uint8Array([...B, 128, ...R, ...q]), w = new DataView(p.buffer, 0), g = p.length / 64, l = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);
+    for (let h = 0; h < g; h++) {
+      t.fill(0), i.fill(0);
+      const F = 16 * h;
+      for (let I = 0; I < 16; I++)
+        t[I] = w.getUint32((F + I) * 4, !1);
+      for (let I = 16; I < 68; I++)
+        t[I] = f(t[I - 16] ^ t[I - 9] ^ o(t[I - 3], 15)) ^ o(t[I - 13], 7) ^ t[I - 6];
+      for (let I = 0; I < 64; I++)
+        i[I] = t[I] ^ t[I + 4];
+      const A = 2043430169, O = 2055708042;
+      let C = l[0], H = l[1], D = l[2], P = l[3], z = l[4], L = l[5], $ = l[6], K = l[7], G, it, ct, ut, at;
+      for (let I = 0; I < 64; I++)
+        at = I >= 0 && I <= 15 ? A : O, G = o(o(C, 12) + z + o(at, I), 7), it = G ^ o(C, 12), ct = (I >= 0 && I <= 15 ? C ^ H ^ D : C & H | C & D | H & D) + P + it + i[I], ut = (I >= 0 && I <= 15 ? z ^ L ^ $ : z & L | ~z & $) + K + G + t[I], P = D, D = o(H, 9), H = C, C = ct, K = $, $ = o(L, 19), L = z, z = u(ut);
+      l[0] ^= C, l[1] ^= H, l[2] ^= D, l[3] ^= P, l[4] ^= z, l[5] ^= L, l[6] ^= $, l[7] ^= K;
+    }
+    const T = [];
+    for (let h = 0, F = l.length; h < F; h++) {
+      const A = l[h];
+      T.push((A & 4278190080) >>> 24, (A & 16711680) >>> 16, (A & 65280) >>> 8, A & 255);
+    }
+    return T;
+  }
+  const a = 64, b = new Uint8Array(a), m = new Uint8Array(a);
+  for (let B = 0; B < a; B++)
+    b[B] = 54, m[B] = 92;
+  function v(B, _) {
+    for (_.length > a && (_ = d(_)); _.length < a; ) _.push(0);
+    const M = s(_, b), R = s(_, m), q = d([...M, ...B]);
+    return d([...R, ...q]);
+  }
+  return Rt = {
+    sm3: d,
+    hmac: v
+  }, Rt;
+}
+var Dt, Xt;
+function ii() {
+  if (Xt) return Dt;
+  Xt = 1;
+  const { BigInteger: t } = bt(), { encodeDer: i, decodeDer: o } = ei(), s = ri(), u = de().sm3, { G: f, curve: d, n: a } = s.generateEcparam(), b = 0;
+  function m(p, w, g = 1) {
+    p = typeof p == "string" ? s.hexToArray(s.utf8ToHex(p)) : Array.prototype.slice.call(p), w = s.getGlobalCurve().decodePointHex(w);
+    const l = s.generateKeyPairHex(), T = new t(l.privateKey, 16);
+    let h = l.publicKey;
+    h.length > 128 && (h = h.substr(h.length - 128));
+    const F = w.multiply(T), A = s.hexToArray(s.leftPad(F.getX().toBigInteger().toRadix(16), 64)), O = s.hexToArray(s.leftPad(F.getY().toBigInteger().toRadix(16), 64)), C = s.arrayToHex(u([].concat(A, p, O)));
+    let H = 1, D = 0, P = [];
+    const z = [].concat(A, O), L = () => {
+      P = u([...z, H >> 24 & 255, H >> 16 & 255, H >> 8 & 255, H & 255]), H++, D = 0;
+    };
+    L();
+    for (let K = 0, G = p.length; K < G; K++)
+      D === P.length && L(), p[K] ^= P[D++] & 255;
+    const $ = s.arrayToHex(p);
+    return g === b ? h + $ + C : h + C + $;
+  }
+  function v(p, w, g = 1, {
+    output: l = "string"
+  } = {}) {
+    w = new t(w, 16);
+    let T = p.substr(128, 64), h = p.substr(192);
+    g === b && (T = p.substr(p.length - 64), h = p.substr(128, p.length - 128 - 64));
+    const F = s.hexToArray(h), O = s.getGlobalCurve().decodePointHex("04" + p.substr(0, 128)).multiply(w), C = s.hexToArray(s.leftPad(O.getX().toBigInteger().toRadix(16), 64)), H = s.hexToArray(s.leftPad(O.getY().toBigInteger().toRadix(16), 64));
+    let D = 1, P = 0, z = [];
+    const L = [].concat(C, H), $ = () => {
+      z = u([...L, D >> 24 & 255, D >> 16 & 255, D >> 8 & 255, D & 255]), D++, P = 0;
+    };
+    $();
+    for (let G = 0, it = F.length; G < it; G++)
+      P === z.length && $(), F[G] ^= z[P++] & 255;
+    return s.arrayToHex(u([].concat(C, F, H))) === T.toLowerCase() ? l === "array" ? F : s.arrayToUtf8(F) : l === "array" ? [] : "";
+  }
+  function B(p, w, {
+    pointPool: g,
+    der: l,
+    hash: T,
+    publicKey: h,
+    userId: F
+  } = {}) {
+    let A = typeof p == "string" ? s.utf8ToHex(p) : s.arrayToHex(p);
+    T && (h = h || R(w), A = M(A, h, F));
+    const O = new t(w, 16), C = new t(A, 16);
+    let H = null, D = null, P = null;
+    do {
+      do {
+        let z;
+        g && g.length ? z = g.pop() : z = q(), H = z.k, D = C.add(z.x1).mod(a);
+      } while (D.equals(t.ZERO) || D.add(H).equals(a));
+      P = O.add(t.ONE).modInverse(a).multiply(H.subtract(D.multiply(O))).mod(a);
+    } while (P.equals(t.ZERO));
+    return l ? i(D, P) : s.leftPad(D.toString(16), 64) + s.leftPad(P.toString(16), 64);
+  }
+  function _(p, w, g, { der: l, hash: T, userId: h } = {}) {
+    let F = typeof p == "string" ? s.utf8ToHex(p) : s.arrayToHex(p);
+    T && (F = M(F, g, h));
+    let A, O;
+    if (l) {
+      const L = o(w);
+      A = L.r, O = L.s;
+    } else
+      A = new t(w.substring(0, 64), 16), O = new t(w.substring(64), 16);
+    const C = d.decodePointHex(g), H = new t(F, 16), D = A.add(O).mod(a);
+    if (D.equals(t.ZERO)) return !1;
+    const P = f.multiply(O).add(C.multiply(D)), z = H.add(P.getX().toBigInteger()).mod(a);
+    return A.equals(z);
+  }
+  function M(p, w, g = "1234567812345678") {
+    g = s.utf8ToHex(g);
+    const l = s.leftPad(f.curve.a.toBigInteger().toRadix(16), 64), T = s.leftPad(f.curve.b.toBigInteger().toRadix(16), 64), h = s.leftPad(f.getX().toBigInteger().toRadix(16), 64), F = s.leftPad(f.getY().toBigInteger().toRadix(16), 64);
+    let A, O;
+    if (w.length === 128)
+      A = w.substr(0, 64), O = w.substr(64, 64);
+    else {
+      const P = f.curve.decodePointHex(w);
+      A = s.leftPad(P.getX().toBigInteger().toRadix(16), 64), O = s.leftPad(P.getY().toBigInteger().toRadix(16), 64);
+    }
+    const C = s.hexToArray(g + l + T + h + F + A + O), H = g.length * 4;
+    C.unshift(H & 255), C.unshift(H >> 8 & 255);
+    const D = u(C);
+    return s.arrayToHex(u(D.concat(s.hexToArray(p))));
+  }
+  function R(p) {
+    const w = f.multiply(new t(p, 16)), g = s.leftPad(w.getX().toBigInteger().toString(16), 64), l = s.leftPad(w.getY().toBigInteger().toString(16), 64);
+    return "04" + g + l;
+  }
+  function q() {
+    const p = s.generateKeyPairHex(), w = d.decodePointHex(p.publicKey);
+    return p.k = new t(p.privateKey, 16), p.x1 = w.getX().toBigInteger(), p;
+  }
+  return Dt = {
+    generateKeyPairHex: s.generateKeyPairHex,
+    compressPublicKeyHex: s.compressPublicKeyHex,
+    comparePublicKeyHex: s.comparePublicKeyHex,
+    doEncrypt: m,
+    doDecrypt: v,
+    doSignature: B,
+    doVerifySignature: _,
+    getPublicKeyFromPrivateKey: R,
+    getPoint: q,
+    verifyPublicKey: s.verifyPublicKey
+  }, Dt;
+}
+var At, Kt;
+function oi() {
+  if (Kt) return At;
+  Kt = 1;
+  const { sm3: t, hmac: i } = de();
+  function o(d, a) {
+    return d.length >= a ? d : new Array(a - d.length + 1).join("0") + d;
+  }
+  function s(d) {
+    return d.map((a) => (a = a.toString(16), a.length === 1 ? "0" + a : a)).join("");
+  }
+  function u(d) {
+    const a = [];
+    let b = d.length;
+    b % 2 !== 0 && (d = o(d, b + 1)), b = d.length;
+    for (let m = 0; m < b; m += 2)
+      a.push(parseInt(d.substr(m, 2), 16));
+    return a;
+  }
+  function f(d) {
+    const a = [];
+    for (let b = 0, m = d.length; b < m; b++) {
+      const v = d.codePointAt(b);
+      if (v <= 127)
+        a.push(v);
+      else if (v <= 2047)
+        a.push(192 | v >>> 6), a.push(128 | v & 63);
+      else if (v <= 55295 || v >= 57344 && v <= 65535)
+        a.push(224 | v >>> 12), a.push(128 | v >>> 6 & 63), a.push(128 | v & 63);
+      else if (v >= 65536 && v <= 1114111)
+        b++, a.push(240 | v >>> 18 & 28), a.push(128 | v >>> 12 & 63), a.push(128 | v >>> 6 & 63), a.push(128 | v & 63);
+      else
+        throw a.push(v), new Error("input is not supported");
+    }
+    return a;
+  }
+  return At = function(d, a) {
+    if (d = typeof d == "string" ? f(d) : Array.prototype.slice.call(d), a) {
+      if ((a.mode || "hmac") !== "hmac") throw new Error("invalid mode");
+      let m = a.key;
+      if (!m) throw new Error("invalid key");
+      return m = typeof m == "string" ? u(m) : Array.prototype.slice.call(m), s(i(d, m));
+    }
+    return s(t(d));
+  }, At;
+}
+var It, Qt;
+function si() {
+  if (Qt) return It;
+  Qt = 1;
+  const t = 0, i = 32, o = 16, s = [
+    214,
+    144,
+    233,
+    254,
+    204,
+    225,
+    61,
+    183,
+    22,
+    182,
+    20,
+    194,
+    40,
+    251,
+    44,
+    5,
+    43,
+    103,
+    154,
+    118,
+    42,
+    190,
+    4,
+    195,
+    170,
+    68,
+    19,
+    38,
+    73,
+    134,
+    6,
+    153,
+    156,
+    66,
+    80,
+    244,
+    145,
+    239,
+    152,
+    122,
+    51,
+    84,
+    11,
+    67,
+    237,
+    207,
+    172,
+    98,
+    228,
+    179,
+    28,
+    169,
+    201,
+    8,
+    232,
+    149,
+    128,
+    223,
+    148,
+    250,
+    117,
+    143,
+    63,
+    166,
+    71,
+    7,
+    167,
+    252,
+    243,
+    115,
+    23,
+    186,
+    131,
+    89,
+    60,
+    25,
+    230,
+    133,
+    79,
+    168,
+    104,
+    107,
+    129,
+    178,
+    113,
+    100,
+    218,
+    139,
+    248,
+    235,
+    15,
+    75,
+    112,
+    86,
+    157,
+    53,
+    30,
+    36,
+    14,
+    94,
+    99,
+    88,
+    209,
+    162,
+    37,
+    34,
+    124,
+    59,
+    1,
+    33,
+    120,
+    135,
+    212,
+    0,
+    70,
+    87,
+    159,
+    211,
+    39,
+    82,
+    76,
+    54,
+    2,
+    231,
+    160,
+    196,
+    200,
+    158,
+    234,
+    191,
+    138,
+    210,
+    64,
+    199,
+    56,
+    181,
+    163,
+    247,
+    242,
+    206,
+    249,
+    97,
+    21,
+    161,
+    224,
+    174,
+    93,
+    164,
+    155,
+    52,
+    26,
+    85,
+    173,
+    147,
+    50,
+    48,
+    245,
+    140,
+    177,
+    227,
+    29,
+    246,
+    226,
+    46,
+    130,
+    102,
+    202,
+    96,
+    192,
+    41,
+    35,
+    171,
+    13,
+    83,
+    78,
+    111,
+    213,
+    219,
+    55,
+    69,
+    222,
+    253,
+    142,
+    47,
+    3,
+    255,
+    106,
+    114,
+    109,
+    108,
+    91,
+    81,
+    141,
+    27,
+    175,
+    146,
+    187,
+    221,
+    188,
+    127,
+    17,
+    217,
+    92,
+    65,
+    31,
+    16,
+    90,
+    216,
+    10,
+    193,
+    49,
+    136,
+    165,
+    205,
+    123,
+    189,
+    45,
+    116,
+    208,
+    18,
+    184,
+    229,
+    180,
+    176,
+    137,
+    105,
+    151,
+    74,
+    12,
+    150,
+    119,
+    126,
+    101,
+    185,
+    241,
+    9,
+    197,
+    110,
+    198,
+    132,
+    24,
+    240,
+    125,
+    236,
+    58,
+    220,
+    77,
+    32,
+    121,
+    238,
+    95,
+    62,
+    215,
+    203,
+    57,
+    72
+  ], u = [
+    462357,
+    472066609,
+    943670861,
+    1415275113,
+    1886879365,
+    2358483617,
+    2830087869,
+    3301692121,
+    3773296373,
+    4228057617,
+    404694573,
+    876298825,
+    1347903077,
+    1819507329,
+    2291111581,
+    2762715833,
+    3234320085,
+    3705924337,
+    4177462797,
+    337322537,
+    808926789,
+    1280531041,
+    1752135293,
+    2223739545,
+    2695343797,
+    3166948049,
+    3638552301,
+    4110090761,
+    269950501,
+    741554753,
+    1213159005,
+    1684763257
+  ];
+  function f(p) {
+    const w = [];
+    for (let g = 0, l = p.length; g < l; g += 2)
+      w.push(parseInt(p.substr(g, 2), 16));
+    return w;
+  }
+  function d(p) {
+    return p.map((w) => (w = w.toString(16), w.length === 1 ? "0" + w : w)).join("");
+  }
+  function a(p) {
+    const w = [];
+    for (let g = 0, l = p.length; g < l; g++) {
+      const T = p.codePointAt(g);
+      if (T <= 127)
+        w.push(T);
+      else if (T <= 2047)
+        w.push(192 | T >>> 6), w.push(128 | T & 63);
+      else if (T <= 55295 || T >= 57344 && T <= 65535)
+        w.push(224 | T >>> 12), w.push(128 | T >>> 6 & 63), w.push(128 | T & 63);
+      else if (T >= 65536 && T <= 1114111)
+        g++, w.push(240 | T >>> 18 & 28), w.push(128 | T >>> 12 & 63), w.push(128 | T >>> 6 & 63), w.push(128 | T & 63);
+      else
+        throw w.push(T), new Error("input is not supported");
+    }
+    return w;
+  }
+  function b(p) {
+    const w = [];
+    for (let g = 0, l = p.length; g < l; g++)
+      p[g] >= 240 && p[g] <= 247 ? (w.push(String.fromCodePoint(((p[g] & 7) << 18) + ((p[g + 1] & 63) << 12) + ((p[g + 2] & 63) << 6) + (p[g + 3] & 63))), g += 3) : p[g] >= 224 && p[g] <= 239 ? (w.push(String.fromCodePoint(((p[g] & 15) << 12) + ((p[g + 1] & 63) << 6) + (p[g + 2] & 63))), g += 2) : p[g] >= 192 && p[g] <= 223 ? (w.push(String.fromCodePoint(((p[g] & 31) << 6) + (p[g + 1] & 63))), g++) : w.push(String.fromCodePoint(p[g]));
+    return w.join("");
+  }
+  function m(p, w) {
+    const g = w & 31;
+    return p << g | p >>> 32 - g;
+  }
+  function v(p) {
+    return (s[p >>> 24 & 255] & 255) << 24 | (s[p >>> 16 & 255] & 255) << 16 | (s[p >>> 8 & 255] & 255) << 8 | s[p & 255] & 255;
+  }
+  function B(p) {
+    return p ^ m(p, 2) ^ m(p, 10) ^ m(p, 18) ^ m(p, 24);
+  }
+  function _(p) {
+    return p ^ m(p, 13) ^ m(p, 23);
+  }
+  function M(p, w, g) {
+    const l = new Array(4), T = new Array(4);
+    for (let h = 0; h < 4; h++)
+      T[0] = p[4 * h] & 255, T[1] = p[4 * h + 1] & 255, T[2] = p[4 * h + 2] & 255, T[3] = p[4 * h + 3] & 255, l[h] = T[0] << 24 | T[1] << 16 | T[2] << 8 | T[3];
+    for (let h = 0, F; h < 32; h += 4)
+      F = l[1] ^ l[2] ^ l[3] ^ g[h + 0], l[0] ^= B(v(F)), F = l[2] ^ l[3] ^ l[0] ^ g[h + 1], l[1] ^= B(v(F)), F = l[3] ^ l[0] ^ l[1] ^ g[h + 2], l[2] ^= B(v(F)), F = l[0] ^ l[1] ^ l[2] ^ g[h + 3], l[3] ^= B(v(F));
+    for (let h = 0; h < 16; h += 4)
+      w[h] = l[3 - h / 4] >>> 24 & 255, w[h + 1] = l[3 - h / 4] >>> 16 & 255, w[h + 2] = l[3 - h / 4] >>> 8 & 255, w[h + 3] = l[3 - h / 4] & 255;
+  }
+  function R(p, w, g) {
+    const l = new Array(4), T = new Array(4);
+    for (let h = 0; h < 4; h++)
+      T[0] = p[0 + 4 * h] & 255, T[1] = p[1 + 4 * h] & 255, T[2] = p[2 + 4 * h] & 255, T[3] = p[3 + 4 * h] & 255, l[h] = T[0] << 24 | T[1] << 16 | T[2] << 8 | T[3];
+    l[0] ^= 2746333894, l[1] ^= 1453994832, l[2] ^= 1736282519, l[3] ^= 2993693404;
+    for (let h = 0, F; h < 32; h += 4)
+      F = l[1] ^ l[2] ^ l[3] ^ u[h + 0], w[h + 0] = l[0] ^= _(v(F)), F = l[2] ^ l[3] ^ l[0] ^ u[h + 1], w[h + 1] = l[1] ^= _(v(F)), F = l[3] ^ l[0] ^ l[1] ^ u[h + 2], w[h + 2] = l[2] ^= _(v(F)), F = l[0] ^ l[1] ^ l[2] ^ u[h + 3], w[h + 3] = l[3] ^= _(v(F));
+    if (g === t)
+      for (let h = 0, F; h < 16; h++)
+        F = w[h], w[h] = w[31 - h], w[31 - h] = F;
+  }
+  function q(p, w, g, {
+    padding: l = "pkcs#7",
+    mode: T,
+    iv: h = [],
+    output: F = "string"
+  } = {}) {
+    if (T === "cbc" && (typeof h == "string" && (h = f(h)), h.length !== 128 / 8))
+      throw new Error("iv is invalid");
+    if (typeof w == "string" && (w = f(w)), w.length !== 128 / 8)
+      throw new Error("key is invalid");
+    if (typeof p == "string" ? g !== t ? p = a(p) : p = f(p) : p = [...p], (l === "pkcs#5" || l === "pkcs#7") && g !== t) {
+      const P = o - p.length % o;
+      for (let z = 0; z < P; z++) p.push(P);
+    }
+    const A = new Array(i);
+    R(w, A, g);
+    const O = [];
+    let C = h, H = p.length, D = 0;
+    for (; H >= o; ) {
+      const P = p.slice(D, D + 16), z = new Array(16);
+      if (T === "cbc")
+        for (let L = 0; L < o; L++)
+          g !== t && (P[L] ^= C[L]);
+      M(P, z, A);
+      for (let L = 0; L < o; L++)
+        T === "cbc" && g === t && (z[L] ^= C[L]), O[D + L] = z[L];
+      T === "cbc" && (g !== t ? C = z : C = P), H -= o, D += o;
+    }
+    if ((l === "pkcs#5" || l === "pkcs#7") && g === t) {
+      const P = O.length, z = O[P - 1];
+      for (let L = 1; L <= z; L++)
+        if (O[P - L] !== z) throw new Error("padding is invalid");
+      O.splice(P - z, z);
+    }
+    return F !== "array" ? g !== t ? d(O) : b(O) : O;
+  }
+  return It = {
+    encrypt(p, w, g) {
+      return q(p, w, 1, g);
+    },
+    decrypt(p, w, g) {
+      return q(p, w, 0, g);
+    }
+  }, It;
+}
+var Mt, te;
+function fi() {
+  return te || (te = 1, Mt = {
+    sm2: ii(),
+    sm3: oi(),
+    sm4: si()
+  }), Mt;
+}
+var pe = fi();
+const ge = pe.sm2, xe = pe.sm4, Mi = (t, i, o = "04") => o + ge.doEncrypt(t, i), Oi = (t, i, o = "04") => ge.doDecrypt(t.startsWith(o) ? t.slice(2) : t, i), qi = (t, i) => xe.encrypt(t, i), Ci = (t, i) => xe.decrypt(t, i);
+let ft = [], ci = { consecutiveFrames: 0, lastBlinkTime: 0 }, ui = { consecutiveFrames: 0, lastBlinkTime: 0 };
+const ai = /* @__PURE__ */ new Map([
+  ["nod", [mi, 30, 100]],
+  ["shake", [xi, 7, 100]],
+  ["mouth", [gi, 0.35, 100]],
+  ["eye", [pi, 0.3, 100]]
+]), Pi = ["nod", "shake", "mouth", "eye"], zi = {
   nod: "请点点头",
   shake: "请摇摇头",
   mouth: "请张张嘴",
   eye: "请眨眨眼"
 };
-function R(e, t) {
-  if (e.length !== t.length) throw new Error("euclideanDistance: arr1.length !== arr2.length");
-  const n = Array.from(e), r = Array.from(t);
+function ee(t, i) {
+  if (t.length !== i.length) throw new Error("euclideanDistance: arr1.length !== arr2.length");
+  const o = Array.from(t), s = Array.from(i);
   return Math.sqrt(
-    n.map((o, i) => o - r[i]).reduce((o, i) => o + Math.pow(i, 2), 0)
+    o.map((u, f) => u - s[f]).reduce((u, f) => u + Math.pow(f, 2), 0)
   );
 }
-function* et(e, t, n = 8, r = 0) {
-  for (let o = n; o > 0; o--)
-    yield e(t, 0.5, r);
+function* hi(t, i, o = 8, s = 0) {
+  for (let u = o; u > 0; u--)
+    yield t(i, 0.5, s);
 }
-function g(e) {
-  return [e.x, e.y];
+function pt(t) {
+  return [t.x, t.y];
 }
-function y(e, t) {
-  const n = e.x - t.x, r = e.y - t.y;
-  return Math.sqrt(n * n + r * r);
+function Ot(t, i) {
+  const o = t.x - i.x, s = t.y - i.y;
+  return Math.sqrt(o * o + s * s);
 }
-function A(e) {
-  const t = y(e[1], e[5]), n = y(e[2], e[4]), r = y(e[0], e[3]);
-  return (t + n) / (2 * r);
+function ne(t) {
+  const i = Ot(t[1], t[5]), o = Ot(t[2], t[4]), s = Ot(t[0], t[3]);
+  return (i + o) / (2 * s);
 }
-function tt(e) {
-  const t = R(g(e[13]), g(e[19])), n = R(g(e[0]), g(e[6]));
-  return t / n;
+function li(t) {
+  const i = ee(pt(t[13]), pt(t[19])), o = ee(pt(t[0]), pt(t[6]));
+  return i / o;
 }
-function nt(e) {
-  const t = e.positions[30], n = e.positions[36], r = e.positions[45], o = (n.x + r.x) / 2;
-  return (t.x - o) / (r.x - n.x) * 30;
+function di(t) {
+  const i = t.positions[30], o = t.positions[36], s = t.positions[45], u = (o.x + s.x) / 2;
+  return (i.x - u) / (s.x - o.x) * 30;
 }
-function rt(e, t) {
-  const n = Date.now(), r = S(A(e.getLeftEye()), t, Xe, n), o = S(A(e.getRightEye()), t, Qe, n);
-  return !!(r || o);
+function pi(t, i) {
+  const o = Date.now(), s = re(ne(t.getLeftEye()), i, ci, o), u = re(ne(t.getRightEye()), i, ui, o);
+  return !!(s || u);
 }
-function S(e, t, n, r) {
-  if (e < t)
-    n.consecutiveFrames++;
-  else if (n.consecutiveFrames >= 3 && r - n.lastBlinkTime > 500)
-    return n.lastBlinkTime = r, n.consecutiveFrames = 0, !0;
+function re(t, i, o, s) {
+  if (t < i)
+    o.consecutiveFrames++;
+  else if (o.consecutiveFrames >= 3 && s - o.lastBlinkTime > 500)
+    return o.lastBlinkTime = s, o.consecutiveFrames = 0, !0;
   return !1;
 }
-function ot(e, t) {
-  return tt(e.getMouth()) > t;
+function gi(t, i) {
+  return li(t.getMouth()) > i;
 }
-function it(e, t) {
-  const n = nt(e);
-  return Math.abs(n) > t;
+function xi(t, i) {
+  const o = di(t);
+  return Math.abs(o) > i;
 }
-function st(e, t) {
-  const n = h.length, r = e.positions[33];
-  if (n < 5)
-    h.push(r.y);
-  else if (n === 5) {
-    const o = Math.min(...h);
-    if (Math.max(...h) - o > t)
+function mi(t, i) {
+  const o = ft.length, s = t.positions[33];
+  if (o < 5)
+    ft.push(s.y);
+  else if (o === 5) {
+    const u = Math.min(...ft);
+    if (Math.max(...ft) - u > i)
       return !0;
-    h = [];
+    ft = [];
   }
   return !1;
 }
-function Ot(e, t = "blob", n = 1) {
-  return new Promise((r) => {
-    const o = document.createElement("canvas"), i = o.getContext("2d");
-    o.width = e.videoWidth, o.height = e.videoHeight, i == null || i.drawImage(e, 0, 0, o.width, o.height), t === "blob" ? o.toBlob(
-      (s) => {
-        const c = new FileReader();
-        c.onload = () => r(c.result), c.readAsArrayBuffer(s);
+function Hi(t, i = "blob", o = 1) {
+  return new Promise((s) => {
+    const u = document.createElement("canvas"), f = u.getContext("2d");
+    u.width = t.videoWidth, u.height = t.videoHeight, f == null || f.drawImage(t, 0, 0, u.width, u.height), i === "blob" ? u.toBlob(
+      (d) => {
+        const a = new FileReader();
+        a.onload = () => s(a.result), a.readAsArrayBuffer(d);
       },
       "image/png",
-      n
-    ) : r(o.toDataURL("image/png", n));
+      o
+    ) : s(u.toDataURL("image/png", o));
   });
 }
-async function Mt(e, t, n, r = 5) {
-  const [o, i, s] = Ke.get(n);
-  if (!o) return !1;
-  const c = [], a = et(e, t, r, s);
-  for (const u of a) {
-    const f = await u;
-    if (!f) continue;
-    const p = o(f.landmarks, i);
-    c.push(p);
-  }
-  return c.includes(!0);
-}
-const Tt = { DATE_VALUE_FORMAT: me, COMMON_TEXT: l, IMAGE_TYPE: x, MEDIA_TYPE: D, DOC_TYPE: Y, FILE_TYPE: _e }, Rt = {
-  encodeURIToParams: xe,
-  paramsToQueryString: De,
-  queryStringToParams: Ye,
-  errorCodeToString: be,
-  YNToString: ye,
-  HNToString: we,
-  valueToLabel: Re,
-  chargeToLabel: Ae,
-  cascaderToLabel: z,
-  multipleSelectToLabel: Se,
-  phoneToAsterisk: Ee,
-  idNumberToAsterisk: Oe,
-  firstLetterToUpperCase: Me,
-  firstLetterToLowerCase: Te
-}, At = {
-  validHttp: te,
-  validExternal: ne,
-  validString: re,
-  validNumberStr: oe,
-  validEmptyObject: ie,
-  validURL: se,
-  validPassword: ce,
-  validEmail: ae,
-  validIdNumber: O,
-  validPhone: fe,
-  validTel: ue
-}, St = { scrollTo: q, addClass: X, removeClass: Q, hasClass: E, toggleClass: V, noContextmenu: ee, useRafThrottle: K }, xt = { parseTime: m, getTimeDistance: U, getDayRange: Z }, Dt = { local: W, session: J }, Yt = { uuid: G, randomNum: j };
+async function Li(t, i, o, s = 5) {
+  const [u, f, d] = ai.get(o);
+  if (!u) return !1;
+  const a = [], b = hi(t, i, s, d);
+  for (const m of b) {
+    const v = await m;
+    if (!v) continue;
+    const B = u(v.landmarks, f);
+    a.push(B);
+  }
+  return a.includes(!0);
+}
+const Ni = { DATE_VALUE_FORMAT: yr, COMMON_TEXT: et, IMAGE_TYPE: ie, MEDIA_TYPE: oe, DOC_TYPE: se, FILE_TYPE: wr }, Yi = {
+  encodeURIToParams: Mr,
+  paramsToQueryString: Or,
+  queryStringToParams: qr,
+  errorCodeToString: Tr,
+  YNToString: Fr,
+  HNToString: Sr,
+  valueToLabel: Dr,
+  chargeToLabel: Ar,
+  cascaderToLabel: fe,
+  multipleSelectToLabel: Ir,
+  phoneToAsterisk: Er,
+  idNumberToAsterisk: Br,
+  firstLetterToUpperCase: _r,
+  firstLetterToLowerCase: Rr
+}, ki = {
+  validHttp: ir,
+  validExternal: or,
+  validString: sr,
+  validNumberStr: fr,
+  validEmptyObject: cr,
+  validURL: ur,
+  validPassword: ar,
+  validEmail: hr,
+  validIdNumber: Pt,
+  validPhone: dr,
+  validTel: lr
+}, Vi = { scrollTo: Un, addClass: tr, removeClass: er, hasClass: Ct, toggleClass: Qn, noContextmenu: rr, useRafThrottle: nr }, $i = { parseTime: xt, getTimeDistance: Wn, getDayRange: Jn }, ji = { local: Kn, session: Xn }, Ui = { uuid: Gn, randomNum: Zn };
 export {
-  Tt as CONSTANTS,
-  M as NOOP,
-  bt as addResizeListener,
-  Dt as cacheUtil,
-  at as countdownTimer,
-  pt as creatCancelTask,
-  xt as dateUtil,
-  ft as debounce,
-  gt as downloadFile,
-  St as elementUtil,
-  wt as faceLivingEvent,
-  Et as faceLivingEventHint,
-  ht as getArrayFullUrl,
-  dt as getBirthdayByIdNumber,
-  Mt as getFaceGestureResult,
-  Ot as getFaceVideoFrame,
-  le as getFullUrl,
-  lt as getGenderByIdNumber,
-  mt as getPercentage,
-  ut as getRandomItemInArray,
-  vt as loadCss,
-  _t as loadJs,
-  Yt as randomUtil,
-  yt as removeResizeListener,
-  ct as sleep,
-  Rt as toUtil,
-  de as trimArray,
-  At as validUtil
+  Ni as CONSTANTS,
+  $t as NOOP,
+  Ai as addResizeListener,
+  ji as cacheUtil,
+  yi as countdownTimer,
+  Ei as creatCancelTask,
+  $i as dateUtil,
+  wi as debounce,
+  Bi as downloadFile,
+  Vi as elementUtil,
+  Pi as faceLivingEvent,
+  zi as faceLivingEventHint,
+  Si as getArrayFullUrl,
+  Fi as getBirthdayByIdNumber,
+  Li as getFaceGestureResult,
+  Hi as getFaceVideoFrame,
+  pr as getFullUrl,
+  Ti as getGenderByIdNumber,
+  _i as getPercentage,
+  bi as getRandomItemInArray,
+  Ri as loadCss,
+  Di as loadJs,
+  Ui as randomUtil,
+  Ii as removeResizeListener,
+  vi as sleep,
+  ge as sm2Crypto,
+  Oi as sm2Decrypt,
+  Mi as sm2Encrypt,
+  xe as sm4Crypto,
+  Ci as sm4Decrypt,
+  qi as sm4Encrypt,
+  Yi as toUtil,
+  gr as trimArray,
+  ki as validUtil
 };