@aiao/utils 0.0.1

package/index.js

@@ -0,0 +1,955 @@
+import { Observable as ae, BehaviorSubject as Z, distinctUntilChanged as V, skip as le } from "rxjs";
+import ue from "ms";
+import { distance as fe } from "fastest-levenshtein";
+class he {
+  #e = /* @__PURE__ */ new Map();
+  emit(t, r) {
+    const n = this.#e.get(t);
+    if (n?.channel)
+      n.channel.postMessage(r);
+    else
+      throw new Error("broadcast-channel not found");
+  }
+  on(t) {
+    if (!this.#e.has(t)) {
+      const r = new ae((n) => {
+        const o = this.#e.get(t);
+        o.observerCount++, o.observer = n;
+        const c = (i) => n.next(i.data), s = new BroadcastChannel(t);
+        return s.addEventListener("message", c), o.channel = s, () => {
+          o.observerCount--, o.observerCount <= 0 && (s.removeEventListener("message", c), this.#e.delete(t));
+        };
+      });
+      return this.#e.set(t, { observable: r, observerCount: 0 }), r;
+    }
+    return this.#e.get(t).observable;
+  }
+}
+const j = new he(), et = (e) => ({
+  message$: j.on(e),
+  emit: (n) => j.emit(e, n)
+}), pe = [
+  "mousemove",
+  "keydown",
+  "wheel",
+  "DOMMouseScroll",
+  "mousewheel",
+  "mousedown",
+  "touchstart",
+  "touchmove",
+  "MSPointerDown",
+  "MSPointerMove",
+  "visibilitychange",
+  "focus"
+];
+class tt {
+  constructor(t) {
+    this.options = t, this.#e = t?.timeout || this.#e;
+  }
+  #e = 1e3 * 2;
+  #t;
+  #r = new Z(!1);
+  idle$ = this.#r.asObservable().pipe(V());
+  start() {
+    clearTimeout(this.#t), this.#o(), this.#n();
+  }
+  #n = () => {
+    this.#r.next(!1), clearTimeout(this.#t), this.#t = setTimeout(() => {
+      this.#r.next(!0);
+    }, this.#e);
+  };
+  #o() {
+    pe.forEach(
+      (t) => document.addEventListener(t, this.#n, {
+        capture: !0,
+        passive: !0
+      })
+    );
+  }
+}
+class rt {
+  constructor(t) {
+    this.name = t, window.addEventListener("beforeunload", () => this.#n && this.#n(!0));
+  }
+  #e = new Z(!1);
+  #t = this.#e.asObservable().pipe(V(), le(1));
+  #r;
+  #n;
+  get isLeader() {
+    return this.#e.value;
+  }
+  leadership() {
+    return this.#r || (this.#r = navigator.locks.request(this.name, async () => (this.#e.next(!0), new Promise((t) => {
+      this.#n = t;
+    })))), this.#t;
+  }
+}
+function nt(e, t) {
+  if (e.length === 0) return;
+  let r = 0;
+  function n() {
+    r >= e.length || requestIdleCallback((o) => {
+      for (; o.timeRemaining() > 0 && r < e.length; )
+        t(e[r], r), r++;
+      n();
+    });
+  }
+  n();
+}
+const ot = (e, t) => e.reduce(
+  (r, n, o) => o % t === 0 ? [...r, [n]] : [...r.slice(0, -1), [...r.slice(-1)[0], n]],
+  []
+), st = (e, t) => e.filter((r) => !t.includes(r)), ct = (e) => Array.prototype.concat([], ...e), de = (e) => e.flatMap((t) => Array.isArray(t) ? de(t) : t), it = (...e) => e.reduce((t, r) => t.filter((n) => r.includes(n))), b = Array.isArray, me = (e) => e instanceof ArrayBuffer;
+function at(e) {
+  return e === !0 || e === !1 || e != null && typeof e.valueOf() == "boolean";
+}
+function q(e) {
+  return e instanceof Date || typeof e == "object" && Object.prototype.toString.call(e) === "[object Date]";
+}
+const p = (e) => !!(e && e.constructor && e.call && e.apply), h = (e) => {
+  try {
+    return Number(e) === e;
+  } catch {
+    return !1;
+  }
+}, ye = (e) => e && e.constructor === Symbol, lt = (e) => {
+  if (e === !0 || e === !1 || e === null || e === void 0) return !0;
+  if (h(e)) return e === 0;
+  if (q(e)) return isNaN(e.getTime());
+  if (p(e) || ye(e)) return !1;
+  const t = e.length;
+  if (h(t)) return t === 0;
+  const r = e.size;
+  return h(r) ? r === 0 : Object.keys(e).length === 0;
+}, ut = (e) => h(e) && e % 1 !== 0, we = (e) => Number.isInteger(e);
+function ft(e) {
+  return b(e) && e.every(we);
+}
+const H = (e) => e == null;
+function ht(e) {
+  return b(e) && e.every(h);
+}
+const R = (e) => !!e && e.constructor === Object, pt = (e) => typeof e == "object" && e !== null;
+function ge(e) {
+  if (Object.prototype.toString.call(e) !== "[object Object]")
+    return !1;
+  const t = Object.getPrototypeOf(e);
+  return t === null || t === Object.prototype;
+}
+function dt(e) {
+  return e == null || typeof e != "object" && typeof e != "function";
+}
+const mt = (e) => !(!e || !e.then || !p(e.then));
+function yt(e) {
+  return e instanceof RegExp;
+}
+function O(e) {
+  return typeof e == "string";
+}
+const wt = (e) => b(e) ? e.every(O) : !1, M = (e) => e instanceof Uint8Array, gt = (e) => Array.isArray(e) ? e : H(e) ? [] : [e], At = (e) => (t, r) => t[e] > r[e] ? 1 : r[e] > t[e] ? -1 : 0, B = /* @__PURE__ */ Promise.resolve(), Et = (e) => e ? B.then(e) : B, St = (e) => new Promise((t) => setTimeout(t, e)), Ae = new TextDecoder(), bt = (e) => Ae.decode(e);
+function Ee(e, t) {
+  for (const r in e)
+    Object.prototype.hasOwnProperty.call(e, r) && (t(r, e[r], e), J(e[r], t));
+}
+const J = (e, t) => {
+  Array.isArray(e) ? e.forEach((r) => J(r, t)) : R(e) && Ee(e, t);
+}, C = (e) => new Uint8Array(
+  atob(e).split("").map((t) => t.charCodeAt(0))
+);
+async function Ot(e, t, r) {
+  const n = await crypto.subtle.importKey(
+    "raw",
+    C(t),
+    {
+      name: "AES-GCM",
+      length: 256
+    },
+    !0,
+    ["decrypt"]
+  ), o = C(r), c = await crypto.subtle.decrypt(
+    {
+      name: "AES-GCM",
+      iv: o
+    },
+    n,
+    C(e)
+  );
+  return new TextDecoder().decode(c);
+}
+const S = (e) => {
+  if (O(e))
+    return btoa(e);
+  if (M(e))
+    return btoa(String.fromCharCode.apply(null, e));
+  if (me(e)) {
+    const t = new Uint8Array(e);
+    return btoa(String.fromCharCode.apply(null, t));
+  }
+  return btoa(String.fromCharCode.apply(null, e));
+}, { subtle: Se } = globalThis.crypto;
+async function be() {
+  return await Se.generateKey(
+    {
+      name: "AES-GCM",
+      length: 256
+    },
+    !0,
+    ["encrypt", "decrypt"]
+  );
+}
+async function Oe(e) {
+  const t = await crypto.subtle.exportKey("raw", e);
+  return S(t);
+}
+async function Tt(e) {
+  const t = new TextEncoder(), r = await be(), n = crypto.getRandomValues(new Uint8Array(16)), o = await crypto.subtle.encrypt(
+    {
+      name: "AES-GCM",
+      iv: n
+    },
+    r,
+    t.encode(e)
+  );
+  return {
+    key: await Oe(r),
+    iv: S(n),
+    cipherText: S(o)
+  };
+}
+const Te = (e) => atob(e.replace(/[-]/g, "+").replace(/[_]/g, "/")), Ct = (e) => {
+  const t = e.split(".");
+  if (t.length !== 3) throw new Error("JWT is not valid: not a JWT structure");
+  const r = t[1];
+  return JSON.parse(Te(r));
+};
+function N(e) {
+  const t = new ArrayBuffer(e.length), r = new Uint8Array(t);
+  for (let n = 0, o = e.length; n < o; n++)
+    r[n] = e.charCodeAt(n);
+  return t;
+}
+function Ce(e) {
+  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = N(r);
+  return crypto.subtle.importKey(
+    "pkcs8",
+    n,
+    {
+      name: "RSA-OAEP",
+      hash: "SHA-256"
+    },
+    !0,
+    ["decrypt"]
+  );
+}
+async function Pt(e, t) {
+  const r = await Ce(t), n = await crypto.subtle.decrypt(
+    {
+      name: "RSA-OAEP"
+    },
+    r,
+    C(e)
+  );
+  return new TextDecoder().decode(n);
+}
+function Pe(e) {
+  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = N(r);
+  return crypto.subtle.importKey(
+    "spki",
+    n,
+    {
+      name: "RSA-OAEP",
+      hash: "SHA-256"
+    },
+    !0,
+    ["encrypt"]
+  );
+}
+async function Mt(e, t) {
+  const r = await Pe(t), n = await crypto.subtle.encrypt(
+    {
+      name: "RSA-OAEP"
+    },
+    r,
+    N(e)
+  );
+  return S(n);
+}
+const D = "PUBLIC KEY", x = "RAS PRIVATE KEY";
+async function _(e, t = "pkcs8") {
+  const r = await crypto.subtle.exportKey(t, e);
+  return S(r);
+}
+async function $t(e = 1024) {
+  const { publicKey: t, privateKey: r } = await crypto.subtle.generateKey(
+    {
+      name: "RSA-OAEP",
+      modulusLength: e,
+      //can be 1024, 2048, or 4096
+      publicExponent: new Uint8Array([1, 0, 1]),
+      hash: { name: "SHA-512" }
+      //can be "SHA-1", "SHA-256", "SHA-384", or "SHA-512"
+    },
+    !0,
+    ["encrypt", "decrypt"]
+  ), n = await _(t, "spki"), o = await _(r, "pkcs8");
+  return {
+    publicKey: `-----BEGIN ${D}-----
+${n}
+-----END ${D}-----`,
+    privateKey: `-----BEGIN ${x}-----
+${o}
+-----END ${x}-----`
+  };
+}
+const Rt = (e) => h(e) || q(e) ? !0 : H(e) ? !1 : new Date(e).getTime() > 0, Me = (e) => {
+  const t = e > 0 ? "+" : "-", r = Math.abs(e), n = `${Math.floor(r / 60)}`.padStart(2, "0"), o = `${r % 60}`.padStart(2, "0");
+  return {
+    flag: t,
+    absOffset: r,
+    hour: n,
+    minute: o
+  };
+}, $e = (e, t, r) => {
+  const { flag: n, hour: o, minute: c } = Me(r);
+  return `${e}T${t}${n}${o}:${c}`;
+}, Nt = (e, t, r) => new Date($e(e, t, r)), Q = (e, t) => {
+  const r = t.getTime() - e.getTime(), n = Math.floor(r / 864e5), o = Math.floor(n / 30), c = Math.floor(o / 12), s = Math.floor(r / 36e5) % 24, i = Math.floor(r / 6e4) % 60, a = Math.floor(r / 1e3) % 60;
+  return { year: c, month: o, day: n, hour: s, minute: i, second: a };
+}, Y = (e, t, r) => r ? `${t} ${r[e] || e}` : `${t} ${e}`, X = ["year", "month", "day", "hour", "minute", "second"], Lt = (e, t, r) => {
+  const n = Q(e, t), o = X.find((s) => n[s] > 0) || "second", c = n[o];
+  return p(r) ? r({ key: o, value: c }) : Y(o, c, r);
+}, It = (e, t, r) => {
+  const n = Q(e, t);
+  return p(r) ? r(n) : X.filter((o) => o).map((o) => Y(o, n[o], r)).join(" ");
+}, jt = (e) => O(e) && /\d{4}-[01]\d-[0-3]\dT[0-2]\d:[0-5]\d:[0-5]\d(?:\.\d+)?(?:Z|\+[0-2]\d(?:\\:[0-5]\d)?)?/g.test(e);
+function Bt(e) {
+  return h(e) ? !0 : O(e) ? !!/^(?<value>-?(?:\d+)?\.?\d+) *(?<type>milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(
+    e
+  )?.groups : !1;
+}
+function Dt(e) {
+  return ue(e);
+}
+const xt = () => Math.floor(Date.now() / 1e3), _t = (e, t = 50) => {
+  let r;
+  return function(...n) {
+    const o = () => {
+      r = void 0, e.apply(this, n);
+    };
+    r !== void 0 && clearTimeout(r), r = setTimeout(o, t);
+  };
+}, Ut = () => {
+};
+function Kt(e) {
+  let t = !1, r;
+  return function() {
+    if (t)
+      return r;
+    const n = e();
+    return t = !0, r = n, n;
+  };
+}
+const kt = (e, t) => {
+  let r = 0;
+  return function(...n) {
+    const o = (/* @__PURE__ */ new Date()).getTime();
+    o - r >= t && (e.apply(this, n), r = o);
+  };
+}, ee = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
+function w(e, t, r) {
+  const n = r[0];
+  if (t != null && e >= t)
+    throw new Error(e + " >= " + t);
+  if (e.slice(-1) === n || t && t.slice(-1) === n)
+    throw new Error("trailing zero");
+  if (t) {
+    let s = 0;
+    for (; (e[s] || n) === t[s]; )
+      s++;
+    if (s > 0)
+      return t.slice(0, s) + w(e.slice(s), t.slice(s), r);
+  }
+  const o = e ? r.indexOf(e[0]) : 0, c = t != null ? r.indexOf(t[0]) : r.length;
+  if (c - o > 1) {
+    const s = Math.round(0.5 * (o + c));
+    return r[s];
+  } else
+    return t && t.length > 1 ? t.slice(0, 1) : r[o] + w(e.slice(1), null, r);
+}
+function te(e) {
+  if (e.length !== re(e[0]))
+    throw new Error("invalid integer part of order key: " + e);
+}
+function re(e) {
+  if (e >= "a" && e <= "z")
+    return e.charCodeAt(0) - 97 + 2;
+  if (e >= "A" && e <= "Z")
+    return 90 - e.charCodeAt(0) + 2;
+  throw new Error("invalid order key head: " + e);
+}
+function E(e) {
+  const t = re(e[0]);
+  if (t > e.length)
+    throw new Error("invalid order key: " + e);
+  return e.slice(0, t);
+}
+function U(e, t) {
+  if (e === "A" + t[0].repeat(26))
+    throw new Error("invalid order key: " + e);
+  const r = E(e);
+  if (e.slice(r.length).slice(-1) === t[0])
+    throw new Error("invalid order key: " + e);
+}
+function K(e, t) {
+  te(e);
+  const [r, ...n] = e.split("");
+  let o = !0;
+  for (let c = n.length - 1; o && c >= 0; c--) {
+    const s = t.indexOf(n[c]) + 1;
+    s === t.length ? n[c] = t[0] : (n[c] = t[s], o = !1);
+  }
+  if (o) {
+    if (r === "Z")
+      return "a" + t[0];
+    if (r === "z")
+      return null;
+    const c = String.fromCharCode(r.charCodeAt(0) + 1);
+    return c > "a" ? n.push(t[0]) : n.pop(), c + n.join("");
+  } else
+    return r + n.join("");
+}
+function Re(e, t) {
+  te(e);
+  const [r, ...n] = e.split("");
+  let o = !0;
+  for (let c = n.length - 1; o && c >= 0; c--) {
+    const s = t.indexOf(n[c]) - 1;
+    s === -1 ? n[c] = t.slice(-1) : (n[c] = t[s], o = !1);
+  }
+  if (o) {
+    if (r === "a")
+      return "Z" + t.slice(-1);
+    if (r === "A")
+      return null;
+    const c = String.fromCharCode(r.charCodeAt(0) - 1);
+    return c < "Z" ? n.push(t.slice(-1)) : n.pop(), c + n.join("");
+  } else
+    return r + n.join("");
+}
+function y(e, t, r = ee) {
+  if (e != null && U(e, r), t != null && U(t, r), e != null && t != null && e >= t)
+    throw new Error(e + " >= " + t);
+  if (e == null) {
+    if (t == null)
+      return "a" + r[0];
+    const a = E(t), u = t.slice(a.length);
+    if (a === "A" + r[0].repeat(26))
+      return a + w("", u, r);
+    if (a < t)
+      return a;
+    const l = Re(a, r);
+    if (l == null)
+      throw new Error("cannot decrement any more");
+    return l;
+  }
+  if (t == null) {
+    const a = E(e), u = e.slice(a.length), l = K(a, r);
+    return l ?? a + w(u, null, r);
+  }
+  const n = E(e), o = e.slice(n.length), c = E(t), s = t.slice(c.length);
+  if (n === c)
+    return n + w(o, s, r);
+  const i = K(n, r);
+  if (i == null)
+    throw new Error("cannot increment any more");
+  return i < t ? i : n + w(o, null, r);
+}
+function k(e, t, r, n = ee) {
+  if (r === 0)
+    return [];
+  if (r === 1)
+    return [y(e, t, n)];
+  if (t == null) {
+    let s = y(e, t, n);
+    const i = [s];
+    for (let a = 0; a < r - 1; a++)
+      s = y(s, t, n), i.push(s);
+    return i;
+  }
+  if (e == null) {
+    let s = y(e, t, n);
+    const i = [s];
+    for (let a = 0; a < r - 1; a++)
+      s = y(e, s, n), i.push(s);
+    return i.reverse(), i;
+  }
+  const o = Math.floor(r / 2), c = y(e, t, n);
+  return [...k(e, c, o, n), c, ...k(c, t, r - o - 1, n)];
+}
+const Ne = (e) => !isNaN(parseFloat(e)), Le = (e, t) => Math.ceil(e / t) * t, zt = (e, t = 80, r = 1) => Le(e * r, t), Ft = (e, t = 12) => parseFloat(e.toPrecision(t)), Gt = (e) => {
+  if (e == null || e === !0 || e === !1)
+    return NaN;
+  const t = Number(e);
+  return isNaN(t) ? t : t < 0 ? Math.ceil(t) : Math.floor(t);
+}, Wt = (e) => Ne(e) ? Number(e) : e, Ie = (e) => {
+  for (const r of Object.getOwnPropertyNames(e)) {
+    const n = e[r];
+    !R(n) && !p(n) || n === null || Ie(n);
+  }
+  return Object.isFrozen(e) ? e : Object.freeze(e);
+}, je = (e) => e.replace(/\[/g, ".").replace(/\]/g, "").split(".");
+function ne(e, t, r, n) {
+  const o = p(n) ? n : void 0;
+  return je(t).reduce((s, i, a, u) => {
+    if (a === u.length - 1)
+      return s[i] = r, s;
+    if (i in s)
+      return s[i];
+    if (!i) return s;
+    if (o) {
+      const l = o(s[i], i, s);
+      if (l) return s[i] = l;
+    }
+    return s[i] = /^[0-9]{1,}$/.test(u[a + 1]) ? [] : {};
+  }, e), e;
+}
+function Be(e, t, r) {
+  return ne(e, t, r);
+}
+function De(e, t, r, n) {
+  const o = p(n) ? n : void 0;
+  return ne(e, t, r, o);
+}
+const vt = (e) => {
+  const t = {};
+  return Object.keys(e).forEach((r) => {
+    r.match(/[^\]]*\[\d+\]/) ? Be(t, r, e[r]) : De(t, r, e[r], Object);
+  }), t;
+}, xe = (e, t, r) => {
+  const n = (c) => String.prototype.split.call(t, c).filter(Boolean).reduce((s, i) => s != null ? s[i] : s, e), o = n(/[,[\]]+?/) || n(/[,[\].]+?/);
+  return o === void 0 || o === e ? r : o;
+}, _e = (e, t) => {
+  const r = t.split(".");
+  return !!e && (r.length > 1 ? _e(e[t.split(".")[0]], r.slice(1).join(".")) : Object.hasOwnProperty.call(e, t));
+};
+function Ue(e, t) {
+  return e.length !== t.length ? !1 : e.every((r, n) => r === t[n]);
+}
+const z = (e, t) => {
+  if (e === t || Object.is(e, t)) return !0;
+  if (e && t && typeof e == "object" && typeof t == "object") {
+    if (e.constructor !== t.constructor) return !1;
+    let r, n;
+    if (Array.isArray(e)) {
+      if (r = e.length, r != t.length) return !1;
+      for (n = r; n-- !== 0; ) if (!z(e[n], t[n])) return !1;
+      return !0;
+    }
+    if (M(e) && M(t)) return Ue(e, t);
+    if (e.constructor === RegExp) return e.source === t.source && e.flags === t.flags;
+    if (e.valueOf !== Object.prototype.valueOf) return e.valueOf() === t.valueOf();
+    if (e.toString !== Object.prototype.toString) return e.toString() === t.toString();
+    const o = Object.keys(e);
+    if (r = o.length, r !== Object.keys(t).length) return !1;
+    for (n = r; n-- !== 0; ) if (!Object.prototype.hasOwnProperty.call(t, o[n])) return !1;
+    for (n = r; n-- !== 0; ) {
+      const c = o[n];
+      if (!z(e[c], t[c])) return !1;
+    }
+    return !0;
+  }
+  return e !== e && t !== t;
+}, Zt = (e, t) => e ? !t || t.length === 0 ? e : t.reduce(
+  (r, n) => (delete r[n], r),
+  { ...e }
+) : {};
+function Vt(e, t) {
+  return Object.keys(e).filter((r) => !t(e[r], r)).reduce((r, n) => (r[n] = e[n], r), {});
+}
+function qt(e, t) {
+  return e ? t.reduce(
+    (r, n) => (Object.prototype.hasOwnProperty.call(e, n) && (r[n] = e[n]), r),
+    {}
+  ) : {};
+}
+function Ht(e, t) {
+  return Object.keys(e).filter((r) => t(e[r], r)).reduce((r, n) => (r[n] = e[n], r), {});
+}
+const $ = (e, t = "", r = {}) => (b(e) ? e.forEach((n, o) => $(n, `${t}[${o}]`, r)) : ge(e) ? Object.keys(e).forEach(
+  (n) => $(e[n], `${t ? t + "." : ""}${n}`, r)
+) : r[`${t}`] = e, r);
+function Jt(e) {
+  return $(e);
+}
+const Qt = (e) => {
+  const t = {};
+  for (const r in e)
+    Object.prototype.hasOwnProperty.call(e, r) && (t[r] = e[r]);
+  return t;
+};
+function Yt(e, t) {
+  if (!e || !e.length)
+    return {};
+  const r = p(t) ? t : b(t) ? (n, o) => t[o] : () => t;
+  return e.reduce(
+    (n, o, c) => (n[o] = r(o, c), n),
+    {}
+  );
+}
+const Xt = (typeof window > "u" ? "undefined" : typeof window) == "object", er = (e) => e[Math.floor(Math.random() * e.length)], tr = (e = Number.MIN_SAFE_INTEGER, t = Number.MAX_SAFE_INTEGER) => Math.random() * (t - e) + e;
+function rr(e = Number.MIN_SAFE_INTEGER, t = Number.MAX_SAFE_INTEGER) {
+  return Math.floor(Math.random() * (t - e + 1) + e);
+}
+const Ke = "0", oe = "123456789", se = Ke + oe, ce = "abcdefghijklmnopqrstuvwxyz", ke = ce.toUpperCase(), ze = ce + ke, Fe = "_-", Ge = se + ze + Fe, F = (e = 16, t = Ge) => {
+  let r = "";
+  const n = crypto.getRandomValues(new Uint8Array(e |= 0)), o = t.length - 1;
+  for (; e--; ) r += t[n[e] & o];
+  return r;
+}, We = (e = 16) => F(1, oe) + F(e - 1, se), nr = (e = 16) => parseInt(We(e), 10), ie = (e) => {
+  if (!e) return "";
+  const t = e.toLowerCase();
+  return ve(t);
+}, ve = (e) => e ? e.substring(0, 1).toUpperCase() + e.substring(1, e.length) : "", Ze = /[A-Z]?[a-z]+|[0-9]+|[A-Z]+(?![a-z])/g, L = (e) => Array.from(e.match(Ze) ?? []);
+function or(e) {
+  const t = L(e);
+  if (t.length === 0)
+    return "";
+  const [r, ...n] = t;
+  return `${r.toLowerCase()}${n.map((o) => ie(o)).join("")}`;
+}
+const sr = async (e, t = "deflate") => {
+  try {
+    const n = new TextEncoder().encode(e), o = new CompressionStream(t), s = o.writable.getWriter();
+    await s.write(n), await s.close();
+    const a = o.readable.getReader(), u = [];
+    let l = 0;
+    for (; ; ) {
+      const { done: d, value: P } = await a.read();
+      if (d) break;
+      u.push(P), l += P.length;
+    }
+    const g = new Uint8Array(l);
+    let A = 0;
+    for (const d of u)
+      g.set(d, A), A += d.length;
+    let m = btoa(String.fromCharCode(...g));
+    return m = m.replace(/\+/g, "-").replace(/\//g, "_").replace(/=+$/, ""), m;
+  } catch (r) {
+    throw console.error("压缩过程中出错:", r), r;
+  }
+}, cr = async (e, t = "deflate") => {
+  try {
+    let r = e.replace(/-/g, "+").replace(/_/g, "/");
+    const n = (4 - r.length % 4) % 4;
+    r += "=".repeat(n);
+    const o = atob(r), c = new Uint8Array(o.length);
+    for (let f = 0; f < o.length; f++)
+      c[f] = o.charCodeAt(f);
+    const s = new DecompressionStream(t), a = s.writable.getWriter();
+    await a.write(c), await a.close();
+    const l = s.readable.getReader(), g = [];
+    let A = 0;
+    for (; ; ) {
+      const { done: f, value: I } = await l.read();
+      if (f) break;
+      g.push(I), A += I.length;
+    }
+    const m = new Uint8Array(A);
+    let d = 0;
+    for (const f of g)
+      m.set(f, d), d += f.length;
+    return new TextDecoder().decode(m);
+  } catch (r) {
+    throw console.error("解压过程中出错:", r), r;
+  }
+}, Ve = (e) => L(e).map((r) => r.toLowerCase()).join("-"), qe = {
+  "〇": 0,
+  一: 1,
+  二: 2,
+  三: 3,
+  四: 4,
+  五: 5,
+  六: 6,
+  七: 7,
+  八: 8,
+  九: 9,
+  十: 10,
+  百: 100,
+  千: 1e3,
+  万: 1e4,
+  零: 0,
+  壹: 1,
+  贰: 2,
+  叁: 3,
+  肆: 4,
+  伍: 5,
+  陆: 6,
+  柒: 7,
+  捌: 8,
+  玖: 9,
+  拾: 10,
+  佰: 100,
+  仟: 1e3,
+  0: 0,
+  1: 1,
+  2: 2,
+  3: 3,
+  4: 4,
+  5: 5,
+  6: 6,
+  7: 7,
+  8: 8,
+  9: 9
+};
+function ir(e) {
+  let t = 0, r = 0, n = 0, o = !1;
+  for (const c of e.split("").reverse()) {
+    if (r = qe[c], r === void 0)
+      throw new Error(`无法解析的数字: ${c}`);
+    switch (r) {
+      case 10: {
+        n = 1;
+        break;
+      }
+      case 100:
+        n = 2;
+        break;
+      case 1e3: {
+        n = 3;
+        break;
+      }
+      case 1e4: {
+        n = 4;
+        break;
+      }
+    }
+    r < 10 ? (t += r * 10 ** n, n++, o = !1) : o = !0;
+  }
+  return o && (t += r), t;
+}
+const ar = (e) => {
+  const t = {};
+  return new URLSearchParams(e).forEach((n, o) => {
+    if (Object.prototype.hasOwnProperty.call(t, o)) {
+      const c = t[o];
+      Array.isArray(c) ? c.push(n) : t[o] = [c, n];
+    } else
+      t[o] = n;
+  }), t;
+}, lr = (e) => {
+  const t = new URLSearchParams();
+  for (const r in e)
+    if (Object.prototype.hasOwnProperty.call(e, r)) {
+      const n = e[r];
+      Array.isArray(n) ? n.forEach((o) => t.append(r, `${o}`)) : t.set(r, `${n}`);
+    }
+  return t.sort(), t.toString();
+}, He = ["角", "分", "厘"], G = ["零", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖"], T = [
+  ["元", "万", "亿", "兆", "京", "垓"],
+  ["", "拾", "佰", "仟"]
+], W = Math.pow(10, 22), ur = (e) => {
+  const t = e < 0 ? "欠" : "";
+  let r = Math.abs(e);
+  if (r > W)
+    throw new Error(`max value is ${W}`);
+  let n = "";
+  if (e > Math.floor(e)) {
+    const o = +("0." + `${r}`.split(".")[1]);
+    n = He.reduce(
+      (c, s, i) => c + (G[Math.floor(o * 10 * Math.pow(10, i)) % 10] + s).replace(/零./, ""),
+      ""
+    );
+  }
+  n = n || "整", r = Math.floor(r);
+  for (let o = 0; o < T[0].length && r > 0; o++) {
+    let c = "";
+    for (let s = 0; s < T[1].length && r > 0; s++)
+      c = G[r % 10] + T[1][s] + c, r = Math.floor(r / 10);
+    n = c.replace(/(零.)*零$/g, "").replace(/^$/, "零") + T[0][o] + n;
+  }
+  return `${t}${n.replace(/(零.)*零元/, "元").replace(/(零.)+/g, "零").replace(/^整$/, "零元整")}`;
+};
+function fr(e, t) {
+  const r = e || "", n = t || "", o = Math.max(r.length, n.length);
+  return o === 0 ? 1 : (o - fe(r, n)) / o;
+}
+const hr = (e) => L(e).map((r) => r.toLowerCase()).join("_"), pr = (e) => Ve(e).split("-").filter((t) => !!t).map((t) => ie(t.toLowerCase())).join(" "), dr = (e) => e.trim().replace(/\s+/g, " "), mr = (e, t) => e.replace(/\${([^}]+)}/g, (r, n) => xe(t, n.trim(), "")), Je = (e) => e ? e.substring(0, 1).toLowerCase() + e.substring(1, e.length) : "", yr = (e) => {
+  if (!e) return "";
+  const t = e.toLowerCase();
+  return Je(t);
+}, v = /^([^/:]+):\/*/, wr = (...e) => {
+  if (e = e.filter((s) => s !== ""), e.length === 0)
+    return "";
+  if (e.findIndex((s) => !(O(s) || h(s))) >= 0)
+    throw new Error("paths must be a string or number");
+  let r = "";
+  const n = `${e[0]}`;
+  n.startsWith("//") ? r = "//" : n.startsWith("/") ? r = "/" : (n.startsWith("file:") && e.length > 1 && (n + e[1]).match(/^file:\/\/\//) ? r = n.replace(v, "$1:///") : r = n.replace(v, "$1://"), e.shift()), r && !r.endsWith("/") && (r += "/");
+  let o = e.map(
+    (s) => `${s}`.replace(/^\/+/, "").replace(/^\.\/+/, "").replace(/\/+$/, "")
+  ).filter((s) => s !== "").join("/");
+  for (; o.includes("/../"); ) {
+    const s = o.split("/"), i = s.findIndex((a) => a === "..");
+    s.splice(i - 1, 2), o = s.join("/");
+  }
+  let c = r + o;
+  if (c.includes("?")) {
+    const s = c.split("?").filter((i) => i !== "");
+    c = s.shift() + "?", s.length > 0 && (c += s.join("&"));
+  }
+  return c.replace(/\/(\?|&|#[^!])/g, "$1");
+};
+class gr {
+  #e = /* @__PURE__ */ new Map();
+  addEventListener(t, r) {
+    this.#t(t).add(r);
+  }
+  hasEventListener(t, r) {
+    return this.#e.has(t) && this.#t(t).has(r);
+  }
+  removeEventListener(t, r) {
+    this.#t(t).delete(r);
+  }
+  dispatchEvent(t) {
+    this.#t(t.type).forEach((r) => r.call(this, t));
+  }
+  removeAllEventListener() {
+    this.#e.clear();
+  }
+  #t(t) {
+    if (this.#e.has(t))
+      return this.#e.get(t);
+    {
+      const n = /* @__PURE__ */ new Set();
+      return this.#e.set(t, n), n;
+    }
+  }
+}
+const Ar = "data:image/gif;base64,R0lGODlhAQABAIAAAAUEBAAAACwAAAAAAQABAAACAkQBADs=", Er = "data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw==", Sr = (e, ...t) => {
+  const r = [];
+  R(e) ? Object.keys(e).sort().forEach((o) => {
+    const c = e[o];
+    r.push([o, c]);
+  }) : r.push([e]), t.length && t.forEach((o) => {
+    console.log(o);
+  }), (console?.table ?? console.log)(r);
+};
+export {
+  ee as BASE_62_DIGITS,
+  gr as EventDispatcher,
+  Ar as IMAGE_MIN_BASE64_BLACK,
+  Er as IMAGE_MIN_BASE64_TRANSPARENT,
+  Xt as IS_BROWSER,
+  tt as IdleTimer,
+  rt as LeaderElection,
+  Ot as aesDecrypt,
+  Tt as aesEncrypt,
+  C as base64Decode,
+  S as base64Encode,
+  or as camelCase,
+  Rt as canBeDate,
+  Ne as canBeNumber,
+  ie as capitalize,
+  ve as capitalizeFirst,
+  ot as chunk,
+  sr as compressToBase64Url,
+  et as createBroadcastTopic,
+  Nt as dateStringToDate,
+  $e as dateStringWithTimezone,
+  _t as debounce,
+  Ct as decodeJWTPayload,
+  cr as decompressFromBase64Url,
+  Ie as deepFreeze,
+  st as difference,
+  Ut as emptyFunction,
+  ct as flatten,
+  de as flattenDeep,
+  vt as flattenPathObjectToPlainObject,
+  It as formatCountdown,
+  Lt as formatPassTime,
+  y as generateKeyBetween,
+  k as generateKeysBetween,
+  xe as get,
+  _e as has,
+  it as intersection,
+  b as isArray,
+  me as isArrayBuffer,
+  at as isBoolean,
+  q as isDate,
+  lt as isEmpty,
+  z as isEqual,
+  Ue as isEqualUint8Array,
+  ut as isFloat,
+  p as isFunction,
+  jt as isISODateString,
+  we as isInt,
+  ft as isIntArray,
+  Bt as isMSTime,
+  H as isNil,
+  h as isNumber,
+  ht as isNumberArray,
+  R as isObject,
+  pt as isObjectLike,
+  ge as isPlainObject,
+  dt as isPrimitive,
+  mt as isPromise,
+  yt as isRegExp,
+  O as isString,
+  wt as isStringArray,
+  ye as isSymbol,
+  M as isUint8Array,
+  Ve as kebabCase,
+  Sr as logError,
+  Dt as msTimeToMilliseconds,
+  gt as needArray,
+  Et as nextTick,
+  Ut as noop,
+  Le as numberStep,
+  zt as numberStepScreenSize,
+  Ft as numberStrip,
+  Zt as omit,
+  Vt as omitBy,
+  Kt as once,
+  ir as parseChineseNumber,
+  Q as parseTime,
+  nt as performChunk,
+  qt as pick,
+  Ht as pickBy,
+  Jt as plainObjectToFlattenPathObject,
+  j as pool,
+  ar as queryParse,
+  lr as queryStringify,
+  er as randomArrayItem,
+  tr as randomFloat,
+  rr as randomInt,
+  F as randomString,
+  nr as randomUintByLength,
+  We as randomUintString,
+  ur as rmbUppercase,
+  Pt as rsaDecrypt,
+  Mt as rsaEncrypt,
+  $t as rsaGenerateKey,
+  Be as set,
+  ne as setBase,
+  De as setWith,
+  fr as similarity,
+  St as sleep,
+  hr as snakeCase,
+  At as sortBy,
+  pr as startCase,
+  dr as stringSingleline,
+  mr as stringTemplate,
+  Y as stringTime,
+  N as stringToArrayBuffer,
+  kt as throttle,
+  Gt as toInt,
+  Qt as toPlainObject,
+  J as traverseObjectKeys,
+  Wt as tryToNumber,
+  bt as uint8ArrayToString,
+  yr as uncapitalize,
+  Je as uncapitalizeFirst,
+  xt as unixTimestamp,
+  wr as urlJoin,
+  Yt as zipObject
+};