@aiao/utils 0.0.5 → 0.0.6

package/dist/index.js

@@ -1,34 +1,59 @@
-import { Observable as ae, BehaviorSubject as W, 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();
+import { Observable as ae, shareReplay as le, BehaviorSubject as G, distinctUntilChanged as V, skip as ue } from "rxjs";
+import fe from "ms";
+import { distance as he } from "fastest-levenshtein";
+class pe {
+  cache = /* @__PURE__ */ new Map();
+  /**
+   * 发送消息到指定频道
+   * @param event 频道名称
+   * @param data 消息数据
+   * @throws 如果频道不存在则抛出错误
+   */
   emit(t, r) {
-    const n = this.#e.get(t);
-    if (n?.channel)
-      n.channel.postMessage(r);
-    else
-      throw new Error("broadcast-channel not found");
+    const n = this.cache.get(t);
+    if (!n)
+      throw new Error(`BroadcastChannel "${t}" not found`);
+    n.channel.postMessage(r);
   }
+  /**
+   * 订阅指定频道的消息
+   * @param event 频道名称
+   * @returns Observable 消息流
+   */
   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 r = this.cache.get(t);
+    if (r)
+      return r.refCount++, r.observable;
+    const n = new BroadcastChannel(t), o = new ae((s) => {
+      const i = (a) => {
+        try {
+          s.next(a.data);
+        } catch (l) {
+          s.error(l);
+        }
+      };
+      return n.addEventListener("message", i), () => {
+        n.removeEventListener("message", i), this.decrementRef(t);
+      };
+    }).pipe(le(1)), c = {
+      observable: o,
+      channel: n,
+      refCount: 1
+    };
+    return this.cache.set(t, c), o;
+  }
+  /**
+   * 减少引用计数，当计数为 0 时关闭频道
+   */
+  decrementRef(t) {
+    const r = this.cache.get(t);
+    r && (r.refCount--, r.refCount <= 0 && (r.channel.close(), this.cache.delete(t)));
   }
 }
-const L = new he(), et = (e) => ({
-  message$: L.on(e),
-  emit: (n) => L.emit(e, n)
-}), pe = [
+const I = new pe(), rt = (e) => ({
+  message$: I.on(e),
+  emit: (n) => I.emit(e, n)
+}), de = [
   "mousemove",
   "keydown",
   "wheel",
@@ -42,10 +67,10 @@ const L = new he(), et = (e) => ({
   "visibilitychange",
   "focus"
 ];
-class tt {
+class nt {
   #e = 1e3 * 2;
   #t;
-  #r = new W(!1);
+  #r = new G(!1);
   idle$ = this.#r.asObservable().pipe(V());
   constructor(t) {
     this.#e = t?.timeout || this.#e;
@@ -59,7 +84,7 @@ class tt {
     }, this.#e);
   };
   #o() {
-    pe.forEach(
+    de.forEach(
       (t) => document.addEventListener(t, this.#n, {
         capture: !0,
         passive: !0
@@ -67,12 +92,12 @@ class tt {
     );
   }
 }
-class rt {
+class ot {
   constructor(t) {
     this.name = t, window.addEventListener("beforeunload", () => this.#n && this.#n(!0));
   }
-  #e = new W(!1);
-  #t = this.#e.asObservable().pipe(V(), le(1));
+  #e = new G(!1);
+  #t = this.#e.asObservable().pipe(V(), ue(1));
   #r;
   #n;
   get isLeader() {
@@ -84,7 +109,14 @@ class rt {
     })))), this.#t;
   }
 }
-function nt(e, t) {
+const me = () => "storage" in navigator && "getDirectory" in navigator.storage, st = async () => {
+  try {
+    return me() ? !!await navigator.storage.getDirectory() : !1;
+  } catch (e) {
+    return console.error("OPFS not available:", e), !1;
+  }
+};
+function ct(e, t) {
   if (e.length === 0) return;
   let r = 0;
   function n() {
@@ -96,13 +128,13 @@ function nt(e, t) {
   }
   n();
 }
-const ot = (e, t) => {
+const it = (e, t) => {
   const r = Math.floor(t), n = [];
   for (let o = 0; o < e.length; o += r)
     n.push(e.slice(o, o + r));
   return 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))), S = Array.isArray, me = (e) => e instanceof ArrayBuffer;
-function at(e) {
+}, at = (e, t) => e.filter((r) => !t.includes(r)), lt = (e) => Array.prototype.concat([], ...e), ye = (e) => e.flatMap((t) => Array.isArray(t) ? ye(t) : t), ut = (...e) => e.reduce((t, r) => t.filter((n) => r.includes(n))), b = Array.isArray, ge = (e) => e instanceof ArrayBuffer;
+function ft(e) {
   return e === !0 || e === !1 || e != null && typeof e.valueOf() == "boolean";
 }
 function Z(e) {
@@ -114,86 +146,84 @@ const d = (e) => !!(e && e.constructor && e.call && e.apply), p = (e) => {
   } catch {
     return !1;
   }
-}, ye = (e) => e && e.constructor === Symbol, lt = (e) => {
+}, we = (e) => e && e.constructor === Symbol, ht = (e) => {
   if (e === !0 || e === !1 || e === null || e === void 0) return !0;
   if (p(e)) return e === 0;
   if (Z(e)) return isNaN(e.getTime());
-  if (d(e) || ye(e)) return !1;
+  if (d(e) || we(e)) return !1;
   const t = e.length;
   if (p(t)) return t === 0;
   const r = e.size;
   return p(r) ? r === 0 : Object.keys(e).length === 0;
-}, ut = (e) => p(e) && e % 1 !== 0, ge = (e) => Number.isInteger(e);
-function ft(e) {
-  return S(e) && e.every(ge);
+}, pt = (e) => p(e) && e % 1 !== 0, Ae = (e) => Number.isInteger(e);
+function dt(e) {
+  return b(e) && e.every(Ae);
 }
-const Q = (e) => e == null;
-function ht(e) {
-  return S(e) && e.every(p);
+const H = (e) => e == null;
+function mt(e) {
+  return b(e) && e.every(p);
 }
-const x = (e) => !!e && e.constructor === Object, pt = (e) => typeof e == "object" && e !== null;
-function we(e) {
+const _ = (e) => !!e && e.constructor === Object, yt = (e) => typeof e == "object" && e !== null;
+function Ee(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) {
+function gt(e) {
   return e == null || typeof e != "object" && typeof e != "function";
 }
-const mt = (e) => !(!e || !e.then || !d(e.then));
-function yt(e) {
+const wt = (e) => !(!e || !e.then || !d(e.then));
+function At(e) {
   return e instanceof RegExp;
 }
-function T(e) {
+function O(e) {
   return typeof e == "string";
 }
-const gt = (e) => S(e) ? e.every(T) : !1, M = (e) => e instanceof Uint8Array, wt = (e) => Array.isArray(e) ? e : Q(e) ? [] : [e], At = (e, t = [], r = []) => {
+const Et = (e) => b(e) ? e.every(O) : !1, $ = (e) => e instanceof Uint8Array, St = (e) => Array.isArray(e) ? e : H(e) ? [] : [e], bt = (e, t = [], r = []) => {
   const n = [...e];
   return n.sort((o, c) => {
     for (let s = 0; s < t.length; s++) {
-      const i = t[s], a = r[s] || "asc", u = o[i], l = c[i];
-      if (u == null && l == null) continue;
-      if (u == null) return a === "desc" ? 1 : -1;
-      if (l == null) return a === "desc" ? -1 : 1;
+      const i = t[s], a = r[s] || "asc", l = o[i], u = c[i];
+      if (l == null && u == null) continue;
+      if (l == null) return a === "desc" ? 1 : -1;
+      if (u == null) return a === "desc" ? -1 : 1;
       let f = 0;
-      if (u < l ? f = -1 : u > l && (f = 1), a === "desc" && (f = -f), f !== 0)
+      if (l < u ? f = -1 : l > u && (f = 1), a === "desc" && (f = -f), f !== 0)
         return f;
     }
     return 0;
   }), n;
-}, Et = (e) => (t, r) => {
+}, Ot = (e) => (t, r) => {
   const n = t[e], o = r[e];
   return n == null && o == null ? 0 : n == null ? 1 : o == null ? -1 : n > o ? 1 : n < o ? -1 : 0;
-}, bt = (e, t) => e.filter(/* @__PURE__ */ ((r) => (n) => r.has(t(n)) ? !1 : r.add(t(n)))(/* @__PURE__ */ new Set()));
-class St {
+}, Tt = (e, t) => e.filter(/* @__PURE__ */ ((r) => (n) => r.has(t(n)) ? !1 : r.add(t(n)))(/* @__PURE__ */ new Set()));
+class Ct {
   maxConcurrent;
   running = 0;
   queue = [];
+  queue_map = /* @__PURE__ */ new Map();
   constructor(t = 3) {
     this.maxConcurrent = t || 1;
   }
   /**
    * 添加任务到执行器
    * @param task - 返回 Promise 的异步任务函数
+   * @param id - 任务唯一标识符（可选），用于去重相同任务
    * @returns 返回任务执行结果的 Promise
    */
-  addTask(t) {
-    return new Promise((r, n) => {
+  addTask(t, r) {
+    if (r && this.queue_map.has(r))
+      return this.queue_map.get(r);
+    const n = new Promise((o, c) => {
       this.queue.push({
         task: t,
-        resolve: r,
-        reject: n
-      }), this._runNext();
+        resolve: o,
+        reject: c,
+        id: r
+      }), this._run_next();
     });
-  }
-  /**
-   * 批量添加多个任务
-   * @param tasks - 任务数组
-   * @returns 返回所有任务结果的 Promise 数组
-   */
-  addTasks(t) {
-    return Promise.all(t.map((r) => this.addTask(r)));
+    return r !== void 0 && this.queue_map.set(r, n), n;
   }
   /**
    * 获取当前状态
@@ -212,7 +242,7 @@ class St {
    */
   setMaxConcurrent(t) {
     for (t = t || 1, this.maxConcurrent = t; this.running < this.maxConcurrent && this.queue.length > 0; )
-      this._runNext();
+      this._run_next();
   }
   /**
    * 清空队列（不影响正在执行的任务）
@@ -220,7 +250,7 @@ class St {
   clearQueue() {
     this.queue.forEach(({ reject: t }) => {
       t(new Error("Task cancelled: queue cleared"));
-    }), this.queue = [];
+    }), this.queue = [], this.queue_map.clear();
   }
   /**
    * 等待所有任务完成
@@ -249,31 +279,31 @@ class St {
   /**
    * 执行队列中的下一个任务
    */
-  _runNext() {
+  _run_next() {
     if (this.running >= this.maxConcurrent || this.queue.length === 0) return;
     const t = this.queue.shift();
     if (!t) return;
-    const { task: r, resolve: n, reject: o } = t;
-    this.running++, Promise.resolve().then(() => r()).then((c) => {
-      n(c);
-    }).catch((c) => {
-      o(c);
+    const { task: r, resolve: n, reject: o, id: c } = t;
+    this.running++, Promise.resolve().then(() => r()).then((s) => {
+      n(s);
+    }).catch((s) => {
+      o(s);
     }).finally(() => {
-      this.running--, this._runNext();
+      this.running--, c !== void 0 && this.queue_map.delete(c), this._run_next();
     });
   }
 }
-const Tt = (e) => setTimeout(() => e(), 0), j = /* @__PURE__ */ Promise.resolve(), Ot = (e) => e ? j.then(e) : j, Ct = (e) => new Promise((t) => setTimeout(t, e)), Ae = new TextDecoder(), Pt = (e) => Ae.decode(e);
-function Ee(e, t) {
+const Pt = (e) => setTimeout(() => e(), 0), L = /* @__PURE__ */ Promise.resolve(), $t = (e) => e ? L.then(e) : L, Mt = (e) => new Promise((t) => setTimeout(t, e)), Se = new TextDecoder(), _t = (e) => Se.decode(e);
+function be(e, t) {
   for (const r in e)
-    Object.prototype.hasOwnProperty.call(e, r) && (t(r, e[r], e), H(e[r], t));
+    Object.prototype.hasOwnProperty.call(e, r) && (t(r, e[r], e), Q(e[r], t));
 }
-const H = (e, t) => {
-  Array.isArray(e) ? e.forEach((r) => H(r, t)) : x(e) && Ee(e, t);
+const Q = (e, t) => {
+  Array.isArray(e) ? e.forEach((r) => Q(r, t)) : _(e) && be(e, t);
 }, C = (e) => new Uint8Array(
   atob(e).split("").map((t) => t.charCodeAt(0))
 );
-async function Mt(e, t, r) {
+async function Rt(e, t, r) {
   const n = await crypto.subtle.importKey(
     "raw",
     C(t),
@@ -293,19 +323,19 @@ async function Mt(e, t, r) {
   );
   return new TextDecoder().decode(c);
 }
-const b = (e) => {
-  if (T(e))
+const S = (e) => {
+  if (O(e))
     return btoa(e);
-  if (M(e) || Array.isArray(e))
+  if ($(e) || Array.isArray(e))
     return btoa(String.fromCharCode(...e));
-  if (me(e)) {
+  if (ge(e)) {
     const t = new Uint8Array(e);
     return btoa(String.fromCharCode(...t));
   }
   throw new TypeError(`Unsupported type for base64 encoding: ${typeof e}`);
-}, { subtle: be } = globalThis.crypto;
-async function Se() {
-  return await be.generateKey(
+}, { subtle: Oe } = globalThis.crypto;
+async function Te() {
+  return await Oe.generateKey(
     {
       name: "AES-GCM",
       length: 256
@@ -314,12 +344,12 @@ async function Se() {
     ["encrypt", "decrypt"]
   );
 }
-async function Te(e) {
+async function Ce(e) {
   const t = await crypto.subtle.exportKey("raw", e);
-  return b(t);
+  return S(t);
 }
-async function $t(e) {
-  const t = new TextEncoder(), r = await Se(), n = crypto.getRandomValues(new Uint8Array(16)), o = await crypto.subtle.encrypt(
+async function xt(e) {
+  const t = new TextEncoder(), r = await Te(), n = crypto.getRandomValues(new Uint8Array(16)), o = await crypto.subtle.encrypt(
     {
       name: "AES-GCM",
       iv: n
@@ -328,25 +358,25 @@ async function $t(e) {
     t.encode(e)
   );
   return {
-    key: await Te(r),
-    iv: b(n),
-    cipherText: b(o)
+    key: await Ce(r),
+    iv: S(n),
+    cipherText: S(o)
   };
 }
-const Oe = (e) => atob(e.replace(/[-]/g, "+").replace(/[_]/g, "/")), xt = (e) => {
+const Pe = (e) => atob(e.replace(/[-]/g, "+").replace(/[_]/g, "/")), Bt = (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(Oe(r));
+  return JSON.parse(Pe(r));
 };
-function N(e) {
+function R(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);
+function $e(e) {
+  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = R(r);
   return crypto.subtle.importKey(
     "pkcs8",
     n,
@@ -358,8 +388,8 @@ function Ce(e) {
     ["decrypt"]
   );
 }
-async function Nt(e, t) {
-  const r = await Ce(t), n = await crypto.subtle.decrypt(
+async function It(e, t) {
+  const r = await $e(t), n = await crypto.subtle.decrypt(
     {
       name: "RSA-OAEP"
     },
@@ -368,8 +398,8 @@ async function Nt(e, t) {
   );
   return new TextDecoder().decode(n);
 }
-function Pe(e) {
-  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = N(r);
+function Me(e) {
+  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = R(r);
   return crypto.subtle.importKey(
     "spki",
     n,
@@ -381,22 +411,22 @@ function Pe(e) {
     ["encrypt"]
   );
 }
-async function Rt(e, t) {
-  const r = await Pe(t), n = await crypto.subtle.encrypt(
+async function Lt(e, t) {
+  const r = await Me(t), n = await crypto.subtle.encrypt(
     {
       name: "RSA-OAEP"
     },
     r,
-    N(e)
+    R(e)
   );
-  return b(n);
+  return S(n);
 }
-const I = "PUBLIC KEY", _ = "RAS PRIVATE KEY";
+const j = "PUBLIC KEY", N = "RAS PRIVATE KEY";
 async function D(e, t = "pkcs8") {
   const r = await crypto.subtle.exportKey(t, e);
-  return b(r);
+  return S(r);
 }
-async function Bt(e = 1024) {
+async function jt(e = 1024) {
   const { publicKey: t, privateKey: r } = await crypto.subtle.generateKey(
     {
       name: "RSA-OAEP",
@@ -410,15 +440,15 @@ async function Bt(e = 1024) {
     ["encrypt", "decrypt"]
   ), n = await D(t, "spki"), o = await D(r, "pkcs8");
   return {
-    publicKey: `-----BEGIN ${I}-----
+    publicKey: `-----BEGIN ${j}-----
 ${n}
------END ${I}-----`,
-    privateKey: `-----BEGIN ${_}-----
+-----END ${j}-----`,
+    privateKey: `-----BEGIN ${N}-----
 ${o}
------END ${_}-----`
+-----END ${N}-----`
   };
 }
-const Lt = (e) => p(e) || Z(e) ? !0 : Q(e) ? !1 : new Date(e).getTime() > 0, Me = (e) => {
+const Nt = (e) => p(e) || Z(e) ? !0 : H(e) ? !1 : new Date(e).getTime() > 0, _e = (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,
@@ -426,25 +456,25 @@ const Lt = (e) => p(e) || Z(e) ? !0 : Q(e) ? !1 : new Date(e).getTime() > 0, Me
     hour: n,
     minute: o
   };
-}, $e = (e, t, r) => {
-  const { flag: n, hour: o, minute: c } = Me(r);
+}, Re = (e, t, r) => {
+  const { flag: n, hour: o, minute: c } = _e(r);
   return `${e}T${t}${n}${o}:${c}`;
-}, jt = (e, t, r) => new Date($e(e, t, r)), J = (e, t) => {
+}, Dt = (e, t, r) => new Date(Re(e, t, r)), J = (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"], It = (e, t, r) => {
+}, Y = (e, t, r) => r ? `${t} ${r[e] || e}` : `${t} ${e}`, X = ["year", "month", "day", "hour", "minute", "second"], Ut = (e, t, r) => {
   const n = J(e, t), o = X.find((s) => n[s] > 0) || "second", c = n[o];
   return d(r) ? r({ key: o, value: c }) : Y(o, c, r);
-}, _t = (e, t, r) => {
+}, kt = (e, t, r) => {
   const n = J(e, t);
   return d(r) ? r(n) : X.filter((o) => o).map((o) => Y(o, n[o], r)).join(" ");
-}, Dt = (e) => T(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 kt(e) {
-  return p(e) ? !0 : T(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(
+}, Kt = (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 qt(e) {
+  return p(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;
 }
-const Ut = (e) => ue(e), Kt = () => Math.floor(Date.now() / 1e3), zt = (e, t = 50) => {
+const Ft = (e) => fe(e), zt = () => Math.floor(Date.now() / 1e3), Wt = (e, t = 50) => {
   let r;
   return function(...n) {
     const o = () => {
@@ -452,9 +482,9 @@ const Ut = (e) => ue(e), Kt = () => Math.floor(Date.now() / 1e3), zt = (e, t = 5
     };
     r !== void 0 && clearTimeout(r), r = setTimeout(o, t);
   };
-}, Ft = () => {
+}, vt = () => {
 };
-function qt(e) {
+function Gt(e) {
   let t = !1, r;
   return function() {
     if (t)
@@ -463,7 +493,7 @@ function qt(e) {
     return t = !0, r = n, n;
   };
 }
-const Gt = (e, t) => {
+const Vt = (e, t) => {
   let r = 0;
   return function(...n) {
     const o = (/* @__PURE__ */ new Date()).getTime();
@@ -473,201 +503,198 @@ const Gt = (e, t) => {
 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(`${e} >= ${t}`);
+  if (e.endsWith(n) || t && t.endsWith(n))
     throw new Error("trailing zero");
   if (t) {
     let s = 0;
-    for (; (e[s] || n) === t[s]; )
+    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));
+    const s = Math.round((o + c) / 2);
     return r[s];
-  } else
-    return t && t.length > 1 ? t.slice(0, 1) : r[o] + w(e.slice(1), null, r);
+  }
+  return t && t.length > 1 ? t[0] : 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) {
+  const t = e.charCodeAt(0), r = 97, n = 90;
   if (e >= "a" && e <= "z")
-    return e.charCodeAt(0) - 97 + 2;
+    return t - r + 2;
   if (e >= "A" && e <= "Z")
-    return 90 - e.charCodeAt(0) + 2;
-  throw new Error("invalid order key head: " + e);
+    return n - t + 2;
+  throw new Error(`invalid order key head: ${e}`);
 }
 function E(e) {
-  const t = re(e[0]);
+  const t = te(e[0]);
   if (t > e.length)
-    throw new Error("invalid order key: " + e);
+    throw new Error(`invalid order key: ${e}`);
   return e.slice(0, t);
 }
-function k(e, t) {
+function re(e) {
+  if (e.length !== te(e[0]))
+    throw new Error(`invalid integer part of order key: ${e}`);
+}
+function U(e, t) {
   if (e === "A" + t[0].repeat(26))
-    throw new Error("invalid order key: " + e);
+    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);
+  if (e.slice(r.length).endsWith(t[0]))
+    throw new Error(`invalid order key: ${e}`);
 }
-function U(e, t) {
-  te(e);
-  const [r, ...n] = e.split("");
+function k(e, t) {
+  re(e);
+  const r = e[0], n = e.slice(1).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;
+    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("");
+  }
+  return r + n.join("");
 }
 function xe(e, t) {
-  te(e);
-  const [r, ...n] = e.split("");
+  re(e);
+  const r = e[0], n = e.slice(1).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);
+    s === -1 ? n[c] = t[t.length - 1] : (n[c] = t[s], o = !1);
   }
   if (o) {
-    if (r === "a")
-      return "Z" + t.slice(-1);
-    if (r === "A")
-      return null;
+    if (r === "a") return "Z" + t[t.length - 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("");
+    return c < "Z" ? n.push(t[t.length - 1]) : n.pop(), c + n.join("");
+  }
+  return r + n.join("");
 }
 function g(e, t, r = ee) {
-  if (e != null && k(e, r), t != null && k(t, r), e != null && t != null && e >= t)
-    throw new Error(e + " >= " + t);
+  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 && t == null)
+    return "a" + r[0];
   if (e == null) {
-    if (t == null)
-      return "a" + r[0];
-    const a = E(t), u = t.slice(a.length);
+    const a = E(t), l = t.slice(a.length);
     if (a === "A" + r[0].repeat(26))
-      return a + w("", u, r);
+      return a + w("", l, r);
     if (a < t)
       return a;
-    const l = xe(a, r);
-    if (l == null)
+    const u = xe(a, r);
+    if (u == null)
       throw new Error("cannot decrement any more");
-    return l;
+    return u;
   }
   if (t == null) {
-    const a = E(e), u = e.slice(a.length), l = U(a, r);
-    return l ?? a + w(u, null, r);
+    const a = E(e), l = e.slice(a.length);
+    return k(a, r) ?? a + w(l, 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 = U(n, 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 [g(e, t, n)];
+  if (r === 0) return [];
+  if (r === 1) return [g(e, t, n)];
   if (t == null) {
-    let s = g(e, t, n);
-    const i = [s];
-    for (let a = 0; a < r - 1; a++)
-      s = g(s, t, n), i.push(s);
-    return i;
+    const s = [];
+    let i = g(e, t, n);
+    s.push(i);
+    for (let a = 1; a < r; a++)
+      i = g(i, t, n), s.push(i);
+    return s;
   }
   if (e == null) {
-    let s = g(e, t, n);
-    const i = [s];
-    for (let a = 0; a < r - 1; a++)
-      s = g(e, s, n), i.push(s);
-    return i.reverse(), i;
+    const s = [];
+    let i = g(e, t, n);
+    s.push(i);
+    for (let a = 1; a < r; a++)
+      i = g(e, i, n), s.push(i);
+    return s.reverse();
   }
   const o = Math.floor(r / 2), c = g(e, t, n);
   return [...K(e, c, o, n), c, ...K(c, t, r - o - 1, n)];
 }
-const Ne = (e) => {
+const Be = (e) => {
   if (e == null || e === "") return !1;
   const t = parseFloat(e);
   return !(isNaN(t) || !isFinite(t));
-}, Re = (e, t) => Math.ceil(e / t) * t, vt = (e, t = 80, r = 1) => Re(e * r, t), Wt = (e, t = 12) => parseFloat(e.toPrecision(t)), Vt = (e) => {
+}, Ie = (e, t) => Math.ceil(e / t) * t, Zt = (e, t = 80, r = 1) => Ie(e * r, t), Ht = (e, t = 12) => parseFloat(e.toPrecision(t)), Qt = (e) => {
   const t = Number(e);
   return t < 0 ? Math.ceil(t) : Math.floor(t);
-}, Zt = (e) => {
-  if (Ne(e)) {
+}, Jt = (e) => {
+  if (Be(e)) {
     const t = Number(e);
     return isNaN(t) || !isFinite(t) ? e : t;
   }
   return e;
-}, Be = (e) => {
+}, Le = (e) => {
   for (const r of Object.getOwnPropertyNames(e)) {
     const n = e[r];
-    !x(n) && !d(n) || n === null || Be(n);
+    !_(n) && !d(n) || n === null || Le(n);
   }
   return Object.isFrozen(e) ? e : Object.freeze(e);
-}, Le = (e) => e.replace(/\[/g, ".").replace(/\]/g, "").split(".");
+}, je = (e) => e.replace(/\[/g, ".").replace(/\]/g, "").split(".");
 function ne(e, t, r, n) {
   const o = d(n) ? n : void 0;
-  return Le(t).reduce((s, i, a, u) => {
-    if (a === u.length - 1)
+  return je(t).reduce((s, i, a, l) => {
+    if (a === l.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;
+      const u = o(s[i], i, s);
+      if (u) return s[i] = u;
     }
-    return s[i] = /^[0-9]{1,}$/.test(u[a + 1]) ? [] : {};
+    return s[i] = /^[0-9]{1,}$/.test(l[a + 1]) ? [] : {};
   }, e), e;
 }
-function je(e, t, r) {
+function Ne(e, t, r) {
   return ne(e, t, r);
 }
-function Ie(e, t, r, n) {
+function De(e, t, r, n) {
   const o = d(n) ? n : void 0;
   return ne(e, t, r, o);
 }
-const Qt = (e) => {
+const Yt = (e) => {
   const t = {};
   return Object.keys(e).forEach((r) => {
-    r.match(/[^\]]*\[\d+\]/) ? je(t, r, e[r]) : Ie(t, r, e[r], Object);
+    r.match(/[^\]]*\[\d+\]/) ? Ne(t, r, e[r]) : De(t, r, e[r], Object);
   }), t;
-}, _e = (e, t, r) => {
+}, Ue = (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;
-}, De = (e, t) => {
+}, ke = (e, t) => {
   const r = t.split(".");
-  return !!e && (r.length > 1 ? De(e[t.split(".")[0]], r.slice(1).join(".")) : Object.hasOwnProperty.call(e, t));
+  return !!e && (r.length > 1 ? ke(e[t.split(".")[0]], r.slice(1).join(".")) : Object.hasOwnProperty.call(e, t));
 };
-function ke(e, t) {
+function Ke(e, t) {
   return e.length !== t.length ? !1 : e.every((r, n) => r === t[n]);
 }
-const z = (e, t) => {
+const q = (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;
+      for (n = r; n-- !== 0; ) if (!q(e[n], t[n])) return !1;
       return !0;
     }
-    if (M(e) && M(t)) return ke(e, t);
+    if ($(e) && $(t)) return Ke(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();
@@ -676,90 +703,90 @@ const z = (e, t) => {
     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;
+      if (!q(e[c], t[c])) return !1;
     }
     return !0;
   }
   return e !== e && t !== t;
-}, Ht = (e, t) => +e == +t, Jt = (e, t) => e ? !t || t.length === 0 ? e : t.reduce(
+}, Xt = (e, t) => +e == +t, er = (e, t) => e ? !t || t.length === 0 ? e : t.reduce(
   (r, n) => (delete r[n], r),
   { ...e }
 ) : {};
-function Yt(e, t) {
+function tr(e, t) {
   return Object.keys(e).filter((r) => !t(e[r], r)).reduce((r, n) => (r[n] = e[n], r), {});
 }
-function Xt(e, t) {
+function rr(e, t) {
   return e ? t.reduce(
     (r, n) => (Object.prototype.hasOwnProperty.call(e, n) && (r[n] = e[n]), r),
     {}
   ) : {};
 }
-function er(e, t) {
+function nr(e, t) {
   return Object.keys(e).filter((r) => t(e[r], r)).reduce((r, n) => (r[n] = e[n], r), {});
 }
-const $ = (e, t = "", r = {}) => (S(e) ? e.forEach((n, o) => $(n, `${t}[${o}]`, r)) : we(e) ? Object.keys(e).forEach(
-  (n) => $(e[n], `${t ? t + "." : ""}${n}`, r)
+const M = (e, t = "", r = {}) => (b(e) ? e.forEach((n, o) => M(n, `${t}[${o}]`, r)) : Ee(e) ? Object.keys(e).forEach(
+  (n) => M(e[n], `${t ? t + "." : ""}${n}`, r)
 ) : r[`${t}`] = e, r);
-function tr(e) {
-  return $(e);
+function or(e) {
+  return M(e);
 }
-const rr = (e) => {
+const sr = (e) => {
   const t = {};
   for (const r in e)
     Object.prototype.hasOwnProperty.call(e, r) && (t[r] = e[r]);
   return t;
 };
-function nr(e, t) {
+function cr(e, t) {
   if (!e || !e.length)
     return {};
-  const r = d(t) ? t : S(t) ? (n, o) => t[o] : () => t;
+  const r = d(t) ? t : b(t) ? (n, o) => t[o] : () => t;
   return e.reduce(
     (n, o, c) => (n[o] = r(o, c), n),
     {}
   );
 }
-const or = typeof window == "object", sr = (e) => e[Math.floor(Math.random() * e.length)], cr = (e = Number.MIN_SAFE_INTEGER, t = Number.MAX_SAFE_INTEGER) => Math.random() * (t - e) + e;
-function ir(e = Number.MIN_SAFE_INTEGER, t = Number.MAX_SAFE_INTEGER) {
+const ir = typeof window == "object", ar = (e) => e[Math.floor(Math.random() * e.length)], lr = (e = Number.MIN_SAFE_INTEGER, t = Number.MAX_SAFE_INTEGER) => Math.random() * (t - e) + e;
+function ur(e = Number.MIN_SAFE_INTEGER, t = Number.MAX_SAFE_INTEGER) {
   return Math.floor(Math.random() * (t - e + 1) + e);
 }
-const Ue = "0", oe = "123456789", se = Ue + oe, ce = "abcdefghijklmnopqrstuvwxyz", Ke = ce.toUpperCase(), ze = ce + Ke, Fe = "_-", qe = se + ze + Fe, F = (e = 16, t = qe) => {
+const qe = "0", oe = "123456789", se = qe + oe, ce = "abcdefghijklmnopqrstuvwxyz", Fe = ce.toUpperCase(), ze = ce + Fe, We = "_-", ve = se + ze + We, F = (e = 16, t = ve) => {
   let r = "";
   const n = crypto.getRandomValues(new Uint8Array(e |= 0)), o = t.length - 1;
   for (; e--; ) r += t[n[e] & o];
   return r;
-}, Ge = (e = 16) => F(1, oe) + F(e - 1, se), ar = (e = 16) => parseInt(Ge(e), 10), ie = (e) => {
+}, Ge = (e = 16) => F(1, oe) + F(e - 1, se), fr = (e = 16) => parseInt(Ge(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) : "", We = /[A-Z]?[a-z]+|[0-9]+|[A-Z]+(?![a-z])/g, R = (e) => Array.from(e.match(We) ?? []);
-function lr(e) {
-  const t = R(e);
+  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, x = (e) => Array.from(e.match(Ze) ?? []);
+function hr(e) {
+  const t = x(e);
   if (t.length === 0)
     return "";
   const [r, ...n] = t;
   return `${r.toLowerCase()}${n.map((o) => ie(o)).join("")}`;
 }
-const ur = async (e, t = "deflate") => {
+const pr = 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;
+    const a = o.readable.getReader(), l = [];
+    let u = 0;
     for (; ; ) {
       const { done: m, value: P } = await a.read();
       if (m) break;
-      u.push(P), l += P.length;
+      l.push(P), u += P.length;
     }
-    const f = new Uint8Array(l);
+    const f = new Uint8Array(u);
     let A = 0;
-    for (const m of u)
+    for (const m of l)
       f.set(m, A), A += m.length;
     let y = btoa(String.fromCharCode(...f));
     return y = y.replace(/\+/g, "-").replace(/\//g, "_").replace(/=+$/, ""), y;
   } catch (r) {
     throw console.error("压缩过程中出错:", r), r;
   }
-}, fr = async (e, t = "deflate") => {
+}, dr = async (e, t = "deflate") => {
   try {
     let r = e.replace(/-/g, "+").replace(/_/g, "/");
     const n = (4 - r.length % 4) % 4;
@@ -769,10 +796,10 @@ const ur = async (e, t = "deflate") => {
       c[h] = o.charCodeAt(h);
     const s = new DecompressionStream(t), a = s.writable.getWriter();
     await a.write(c), await a.close();
-    const l = s.readable.getReader(), f = [];
+    const u = s.readable.getReader(), f = [];
     let A = 0;
     for (; ; ) {
-      const { done: h, value: B } = await l.read();
+      const { done: h, value: B } = await u.read();
       if (h) break;
       f.push(B), A += B.length;
     }
@@ -784,7 +811,7 @@ const ur = async (e, t = "deflate") => {
   } catch (r) {
     throw console.error("解压过程中出错:", r), r;
   }
-}, Ve = (e) => R(e).map((r) => r.toLowerCase()).join("-"), Ze = {
+}, He = (e) => x(e).map((r) => r.toLowerCase()).join("-"), Qe = {
   "〇": 0,
   一: 1,
   二: 2,
@@ -823,10 +850,10 @@ const ur = async (e, t = "deflate") => {
   8: 8,
   9: 9
 };
-function hr(e) {
+function mr(e) {
   let t = 0, r = 0, n = 0, o = !1;
   for (const c of e.split("").reverse()) {
-    if (r = Ze[c], r === void 0)
+    if (r = Qe[c], r === void 0)
       throw new Error(`无法解析的数字: ${c}`);
     switch (r) {
       case 10: {
@@ -849,7 +876,7 @@ function hr(e) {
   }
   return o && (t += r), t;
 }
-const pr = (e) => {
+const yr = (e) => {
   const t = {};
   return new URLSearchParams(e).forEach((n, o) => {
     if (Object.prototype.hasOwnProperty.call(t, o)) {
@@ -858,7 +885,7 @@ const pr = (e) => {
     } else
       t[o] = n;
   }), t;
-}, dr = (e) => {
+}, gr = (e) => {
   const t = new URLSearchParams();
   for (const r in e)
     if (Object.prototype.hasOwnProperty.call(e, r)) {
@@ -866,43 +893,43 @@ const pr = (e) => {
       Array.isArray(n) ? n.forEach((o) => t.append(r, `${o}`)) : t.set(r, `${n}`);
     }
   return t.sort(), t.toString();
-}, Qe = ["角", "分", "厘"], q = ["零", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖"], O = [
+}, Je = ["角", "分", "厘"], z = ["零", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖"], T = [
   ["元", "万", "亿", "兆", "京", "垓"],
   ["", "拾", "佰", "仟"]
-], G = Math.pow(10, 22), mr = (e) => {
+], W = Math.pow(10, 22), wr = (e) => {
   const t = e < 0 ? "欠" : "";
   let r = Math.abs(e);
-  if (r > G)
-    throw new Error(`max value is ${G}`);
+  if (r > W)
+    throw new Error(`max value is ${W}`);
   let n = "";
   if (e > Math.floor(e)) {
     const o = +("0." + `${r}`.split(".")[1]);
-    n = Qe.reduce(
-      (c, s, i) => c + (q[Math.floor(o * 10 * Math.pow(10, i)) % 10] + s).replace(/零./, ""),
+    n = Je.reduce(
+      (c, s, i) => c + (z[Math.floor(o * 10 * Math.pow(10, i)) % 10] + s).replace(/零./, ""),
       ""
     );
   }
   n = n || "整", r = Math.floor(r);
-  for (let o = 0; o < O[0].length && r > 0; o++) {
+  for (let o = 0; o < T[0].length && r > 0; o++) {
     let c = "";
-    for (let s = 0; s < O[1].length && r > 0; s++)
-      c = q[r % 10] + O[1][s] + c, r = Math.floor(r / 10);
-    n = c.replace(/(零.)*零$/g, "").replace(/^$/, "零") + O[0][o] + n;
+    for (let s = 0; s < T[1].length && r > 0; s++)
+      c = z[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 yr(e, t) {
+function Ar(e, t) {
   const r = e || "", n = t || "", o = Math.max(r.length, n.length);
-  return o === 0 ? 1 : (o - fe(r, n)) / o;
+  return o === 0 ? 1 : (o - he(r, n)) / o;
 }
-const gr = (e) => R(e).map((r) => r.toLowerCase()).join("_"), wr = (e) => Ve(e).split("-").filter((t) => !!t).map((t) => ie(t.toLowerCase())).join(" "), Ar = (e) => e.trim().replace(/\s+/g, " "), Er = (e, t) => e.replace(/\${([^}]+)}/g, (r, n) => _e(t, n.trim(), "")), He = (e) => e ? e.substring(0, 1).toLowerCase() + e.substring(1, e.length) : "", br = (e) => {
+const Er = (e) => x(e).map((r) => r.toLowerCase()).join("_"), Sr = (e) => He(e).split("-").filter((t) => !!t).map((t) => ie(t.toLowerCase())).join(" "), br = (e) => e.trim().replace(/\s+/g, " "), Or = (e, t) => e.replace(/\${([^}]+)}/g, (r, n) => Ue(t, n.trim(), "")), Ye = (e) => e ? e.substring(0, 1).toLowerCase() + e.substring(1, e.length) : "", Tr = (e) => {
   if (!e) return "";
   const t = e.toLowerCase();
-  return He(t);
-}, v = /^([^/:]+):\/*/, Sr = (...e) => {
+  return Ye(t);
+}, v = /^([^/:]+):\/*/, Cr = (...e) => {
   if (e = e.filter((s) => s !== ""), e.length === 0)
     return "";
-  if (e.findIndex((s) => !(T(s) || p(s))) >= 0)
+  if (e.findIndex((s) => !(O(s) || p(s))) >= 0)
     throw new Error("paths must be a string or number");
   let r = "";
   const n = `${e[0]}`;
@@ -921,7 +948,7 @@ const gr = (e) => R(e).map((r) => r.toLowerCase()).join("_"), wr = (e) => Ve(e).
   }
   return c.replace(/\/(\?|&|#[^!])/g, "$1");
 };
-class Tr {
+class Pr {
   #e = /* @__PURE__ */ new Map();
   /**
    * 添加事件监听器
@@ -975,9 +1002,9 @@ class Tr {
     }
   }
 }
-const Or = "data:image/gif;base64,R0lGODlhAQABAIAAAAUEBAAAACwAAAAAAQABAAACAkQBADs=", Cr = "data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw==", Pr = (e, ...t) => {
+const $r = "data:image/gif;base64,R0lGODlhAQABAIAAAAUEBAAAACwAAAAAAQABAAACAkQBADs=", Mr = "data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw==", _r = (e, ...t) => {
   const r = [];
-  x(e) ? Object.keys(e).sort().forEach((o) => {
+  _(e) ? Object.keys(e).sort().forEach((o) => {
     const c = e[o];
     r.push([o, c]);
   }) : r.push([e]), t.length && t.forEach((o) => {
@@ -985,126 +1012,128 @@ const Or = "data:image/gif;base64,R0lGODlhAQABAIAAAAUEBAAAACwAAAAAAQABAAACAkQBAD
   }), (console?.table ?? console.log)(r);
 };
 export {
-  St as AsyncTaskExecutor,
+  Ct as AsyncQueueExecutor,
   ee as BASE_62_DIGITS,
-  Tr as EventDispatcher,
-  Or as IMAGE_MIN_BASE64_BLACK,
-  Cr as IMAGE_MIN_BASE64_TRANSPARENT,
-  or as IS_BROWSER,
-  tt as IdleTimer,
-  rt as LeaderElection,
-  Mt as aesDecrypt,
-  $t as aesEncrypt,
+  Pr as EventDispatcher,
+  $r as IMAGE_MIN_BASE64_BLACK,
+  Mr as IMAGE_MIN_BASE64_TRANSPARENT,
+  ir as IS_BROWSER,
+  nt as IdleTimer,
+  ot as LeaderElection,
+  Rt as aesDecrypt,
+  xt as aesEncrypt,
   C as base64Decode,
-  b as base64Encode,
-  lr as camelCase,
-  Lt as canBeDate,
-  Ne as canBeNumber,
+  S as base64Encode,
+  hr as camelCase,
+  Nt as canBeDate,
+  Be as canBeNumber,
   ie as capitalize,
-  ve as capitalizeFirst,
-  ot as chunk,
-  ur as compressToBase64Url,
-  et as createBroadcastTopic,
-  jt as dateStringToDate,
-  $e as dateStringWithTimezone,
-  zt as debounce,
-  xt as decodeJWTPayload,
-  fr as decompressFromBase64Url,
-  Be as deepFreeze,
-  st as difference,
-  Ft as emptyFunction,
-  ct as flatten,
-  de as flattenDeep,
-  Qt as flattenPathObjectToPlainObject,
-  _t as formatCountdown,
-  It as formatPassTime,
+  Ve as capitalizeFirst,
+  st as checkOPFSAvailable,
+  it as chunk,
+  pr as compressToBase64Url,
+  rt as createBroadcastTopic,
+  Dt as dateStringToDate,
+  Re as dateStringWithTimezone,
+  Wt as debounce,
+  Bt as decodeJWTPayload,
+  dr as decompressFromBase64Url,
+  Le as deepFreeze,
+  at as difference,
+  vt as emptyFunction,
+  lt as flatten,
+  ye as flattenDeep,
+  Yt as flattenPathObjectToPlainObject,
+  kt as formatCountdown,
+  Ut as formatPassTime,
   g as generateKeyBetween,
   K as generateKeysBetween,
-  _e as get,
-  De as has,
-  it as intersection,
-  S as isArray,
-  me as isArrayBuffer,
-  at as isBoolean,
+  Ue as get,
+  ke as has,
+  ut as intersection,
+  b as isArray,
+  ge as isArrayBuffer,
+  ft as isBoolean,
   Z as isDate,
-  lt as isEmpty,
-  z as isEqual,
-  Ht as isEqualDate,
-  ke as isEqualUint8Array,
-  ut as isFloat,
+  ht as isEmpty,
+  q as isEqual,
+  Xt as isEqualDate,
+  Ke as isEqualUint8Array,
+  pt as isFloat,
   d as isFunction,
-  Dt as isISODateString,
-  ge as isInt,
-  ft as isIntArray,
-  kt as isMSTime,
-  Q as isNil,
+  Kt as isISODateString,
+  Ae as isInt,
+  dt as isIntArray,
+  qt as isMSTime,
+  H as isNil,
   p as isNumber,
-  ht as isNumberArray,
-  x as isObject,
-  pt as isObjectLike,
-  we as isPlainObject,
-  dt as isPrimitive,
-  mt as isPromise,
-  yt as isRegExp,
-  T as isString,
-  gt as isStringArray,
-  ye as isSymbol,
-  M as isUint8Array,
-  Ve as kebabCase,
-  Pr as logError,
-  Ut as msTimeToMilliseconds,
-  wt as needArray,
-  Tt as nextMacroTask,
-  Ot as nextMicroTask,
-  Ft as noop,
-  Re as numberStep,
-  vt as numberStepScreenSize,
-  Wt as numberStrip,
-  Jt as omit,
-  Yt as omitBy,
-  qt as once,
-  At as orderBy,
-  hr as parseChineseNumber,
+  mt as isNumberArray,
+  me as isOPFSSupported,
+  _ as isObject,
+  yt as isObjectLike,
+  Ee as isPlainObject,
+  gt as isPrimitive,
+  wt as isPromise,
+  At as isRegExp,
+  O as isString,
+  Et as isStringArray,
+  we as isSymbol,
+  $ as isUint8Array,
+  He as kebabCase,
+  _r as logError,
+  Ft as msTimeToMilliseconds,
+  St as needArray,
+  Pt as nextMacroTask,
+  $t as nextMicroTask,
+  vt as noop,
+  Ie as numberStep,
+  Zt as numberStepScreenSize,
+  Ht as numberStrip,
+  er as omit,
+  tr as omitBy,
+  Gt as once,
+  bt as orderBy,
+  mr as parseChineseNumber,
   J as parseTime,
-  nt as performChunk,
-  Xt as pick,
-  er as pickBy,
-  tr as plainObjectToFlattenPathObject,
-  L as pool,
-  pr as queryParse,
-  dr as queryStringify,
-  sr as randomArrayItem,
-  cr as randomFloat,
-  ir as randomInt,
+  ct as performChunk,
+  rr as pick,
+  nr as pickBy,
+  or as plainObjectToFlattenPathObject,
+  I as pool,
+  yr as queryParse,
+  gr as queryStringify,
+  ar as randomArrayItem,
+  lr as randomFloat,
+  ur as randomInt,
   F as randomString,
-  ar as randomUintByLength,
+  fr as randomUintByLength,
   Ge as randomUintString,
-  mr as rmbUppercase,
-  Nt as rsaDecrypt,
-  Rt as rsaEncrypt,
-  Bt as rsaGenerateKey,
-  je as set,
+  wr as rmbUppercase,
+  It as rsaDecrypt,
+  Lt as rsaEncrypt,
+  jt as rsaGenerateKey,
+  Ne as set,
   ne as setBase,
-  Ie as setWith,
-  yr as similarity,
-  Ct as sleep,
-  gr as snakeCase,
-  Et as sortBy,
-  wr as startCase,
-  Ar as stringSingleline,
-  Er as stringTemplate,
+  De as setWith,
+  Ar as similarity,
+  Mt as sleep,
+  Er as snakeCase,
+  Ot as sortBy,
+  Sr as startCase,
+  br as stringSingleline,
+  Or as stringTemplate,
   Y as stringTime,
-  N as stringToArrayBuffer,
-  Gt as throttle,
-  Vt as toInt,
-  rr as toPlainObject,
-  H as traverseObjectKeys,
-  Zt as tryToNumber,
-  Pt as uint8ArrayToString,
-  br as uncapitalize,
-  He as uncapitalizeFirst,
-  bt as unionBy,
-  Kt as unixTimestamp,
-  Sr as urlJoin,
-  nr as zipObject
+  R as stringToArrayBuffer,
+  Vt as throttle,
+  Qt as toInt,
+  sr as toPlainObject,
+  Q as traverseObjectKeys,
+  Jt as tryToNumber,
+  _t as uint8ArrayToString,
+  Tr as uncapitalize,
+  Ye as uncapitalizeFirst,
+  Tt as unionBy,
+  zt as unixTimestamp,
+  Cr as urlJoin,
+  cr as zipObject
 };