@aiao/utils 0.0.4 → 0.0.5

package/dist/async/AsyncTaskExecutor.d.ts

@@ -0,0 +1,63 @@
+/**
+ * 执行器状态接口
+ */
+interface ExecutorStatus {
+    running: number;
+    queued: number;
+    maxConcurrent: number;
+}
+/**
+ * 异步任务执行器
+ * 支持并发控制和动态任务调度
+ */
+export declare class AsyncTaskExecutor {
+    private maxConcurrent;
+    private running;
+    private queue;
+    constructor(maxConcurrent?: number);
+    /**
+     * 添加任务到执行器
+     * @param task - 返回 Promise 的异步任务函数
+     * @returns 返回任务执行结果的 Promise
+     */
+    addTask<T>(task: () => Promise<T>): Promise<T>;
+    /**
+     * 批量添加多个任务
+     * @param tasks - 任务数组
+     * @returns 返回所有任务结果的 Promise 数组
+     */
+    addTasks<T>(tasks: (() => Promise<T>)[]): Promise<T[]>;
+    /**
+     * 获取当前状态
+     * @returns 包含运行中任务数、队列长度和最大并发数
+     */
+    getStatus(): ExecutorStatus;
+    /**
+     * 动态修改最大并发数
+     * @param newMax - 新的最大并发数
+     */
+    setMaxConcurrent(newMax: number): void;
+    /**
+     * 清空队列（不影响正在执行的任务）
+     */
+    clearQueue(): void;
+    /**
+     * 等待所有任务完成
+     * @returns 当所有任务完成时 resolve
+     */
+    waitForAll(): Promise<void>;
+    /**
+     * 获取当前运行中的任务数
+     */
+    getRunningCount(): number;
+    /**
+     * 获取队列中等待的任务数
+     */
+    getQueuedCount(): number;
+    /**
+     * 执行队列中的下一个任务
+     */
+    private _runNext;
+}
+export {};
+//# sourceMappingURL=AsyncTaskExecutor.d.ts.map

package/dist/async/AsyncTaskExecutor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AsyncTaskExecutor.d.ts","sourceRoot":"","sources":["../../src/async/AsyncTaskExecutor.ts"],"names":[],"mappings":"AASA;;GAEG;AACH,UAAU,cAAc;IACtB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,aAAa,CAAS;IAC9B,OAAO,CAAC,OAAO,CAAa;IAC5B,OAAO,CAAC,KAAK,CAAwB;gBAEzB,aAAa,GAAE,MAAU;IAIrC;;;;OAIG;IACH,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IAY9C;;;;OAIG;IACH,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC;IAItD;;;OAGG;IACH,SAAS,IAAI,cAAc;IAQ3B;;;OAGG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAQtC;;OAEG;IACH,UAAU,IAAI,IAAI;IAOlB;;;OAGG;IACH,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAa3B;;OAEG;IACH,eAAe,IAAI,MAAM;IAIzB;;OAEG;IACH,cAAc,IAAI,MAAM;IAIxB;;OAEG;IACH,OAAO,CAAC,QAAQ;CAmBjB"}

package/dist/async/index.d.ts

@@ -1,3 +1,4 @@
+export * from './AsyncTaskExecutor.js';
 export * from './nextMacroTask.js';
 export * from './nextMicroTask.js';
 export * from './sleep.js';

package/dist/async/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/async/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAC;AACnC,cAAc,oBAAoB,CAAC;AACnC,cAAc,YAAY,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/async/index.ts"],"names":[],"mappings":"AAAA,cAAc,wBAAwB,CAAC;AACvC,cAAc,oBAAoB,CAAC;AACnC,cAAc,oBAAoB,CAAC;AACnC,cAAc,YAAY,CAAC"}

package/dist/index.js

@@ -1,4 +1,4 @@
-import { Observable as ae, BehaviorSubject as V, distinctUntilChanged as Z, skip as le } from "rxjs";
+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 {
@@ -25,9 +25,9 @@ class he {
     return this.#e.get(t).observable;
   }
 }
-const N = new he(), et = (e) => ({
-  message$: N.on(e),
-  emit: (n) => N.emit(e, n)
+const L = new he(), et = (e) => ({
+  message$: L.on(e),
+  emit: (n) => L.emit(e, n)
 }), pe = [
   "mousemove",
   "keydown",
@@ -45,8 +45,8 @@ const N = new he(), et = (e) => ({
 class tt {
   #e = 1e3 * 2;
   #t;
-  #r = new V(!1);
-  idle$ = this.#r.asObservable().pipe(Z());
+  #r = new W(!1);
+  idle$ = this.#r.asObservable().pipe(V());
   constructor(t) {
     this.#e = t?.timeout || this.#e;
   }
@@ -71,8 +71,8 @@ class rt {
   constructor(t) {
     this.name = t, window.addEventListener("beforeunload", () => this.#n && this.#n(!0));
   }
-  #e = new V(!1);
-  #t = this.#e.asObservable().pipe(Z(), le(1));
+  #e = new W(!1);
+  #t = this.#e.asObservable().pipe(V(), le(1));
   #r;
   #n;
   get isLeader() {
@@ -105,7 +105,7 @@ const ot = (e, t) => {
 function at(e) {
   return e === !0 || e === !1 || e != null && typeof e.valueOf() == "boolean";
 }
-function q(e) {
+function Z(e) {
   return e instanceof Date || typeof e == "object" && Object.prototype.toString.call(e) === "[object Date]";
 }
 const d = (e) => !!(e && e.constructor && e.call && e.apply), p = (e) => {
@@ -117,22 +117,22 @@ const d = (e) => !!(e && e.constructor && e.call && e.apply), p = (e) => {
 }, ye = (e) => e && e.constructor === Symbol, lt = (e) => {
   if (e === !0 || e === !1 || e === null || e === void 0) return !0;
   if (p(e)) return e === 0;
-  if (q(e)) return isNaN(e.getTime());
+  if (Z(e)) return isNaN(e.getTime());
   if (d(e) || ye(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, we = (e) => Number.isInteger(e);
+}, ut = (e) => p(e) && e % 1 !== 0, ge = (e) => Number.isInteger(e);
 function ft(e) {
-  return S(e) && e.every(we);
+  return S(e) && e.every(ge);
 }
-const H = (e) => e == null;
+const Q = (e) => e == null;
 function ht(e) {
   return S(e) && e.every(p);
 }
-const R = (e) => !!e && e.constructor === Object, pt = (e) => typeof e == "object" && e !== null;
-function ge(e) {
+const x = (e) => !!e && e.constructor === Object, pt = (e) => typeof e == "object" && e !== null;
+function we(e) {
   if (Object.prototype.toString.call(e) !== "[object Object]")
     return !1;
   const t = Object.getPrototypeOf(e);
@@ -145,10 +145,10 @@ const mt = (e) => !(!e || !e.then || !d(e.then));
 function yt(e) {
   return e instanceof RegExp;
 }
-function O(e) {
+function T(e) {
   return typeof e == "string";
 }
-const wt = (e) => S(e) ? e.every(O) : !1, P = (e) => e instanceof Uint8Array, gt = (e) => Array.isArray(e) ? e : H(e) ? [] : [e], At = (e, t = [], r = []) => {
+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 n = [...e];
   return n.sort((o, c) => {
     for (let s = 0; s < t.length; s++) {
@@ -165,13 +165,111 @@ const wt = (e) => S(e) ? e.every(O) : !1, P = (e) => e instanceof Uint8Array, gt
 }, Et = (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())), St = (e) => setTimeout(() => e(), 0), j = /* @__PURE__ */ Promise.resolve(), Ot = (e) => e ? j.then(e) : j, Tt = (e) => new Promise((t) => setTimeout(t, e)), Ae = new TextDecoder(), Ct = (e) => Ae.decode(e);
+}, bt = (e, t) => e.filter(/* @__PURE__ */ ((r) => (n) => r.has(t(n)) ? !1 : r.add(t(n)))(/* @__PURE__ */ new Set()));
+class St {
+  maxConcurrent;
+  running = 0;
+  queue = [];
+  constructor(t = 3) {
+    this.maxConcurrent = t || 1;
+  }
+  /**
+   * 添加任务到执行器
+   * @param task - 返回 Promise 的异步任务函数
+   * @returns 返回任务执行结果的 Promise
+   */
+  addTask(t) {
+    return new Promise((r, n) => {
+      this.queue.push({
+        task: t,
+        resolve: r,
+        reject: n
+      }), this._runNext();
+    });
+  }
+  /**
+   * 批量添加多个任务
+   * @param tasks - 任务数组
+   * @returns 返回所有任务结果的 Promise 数组
+   */
+  addTasks(t) {
+    return Promise.all(t.map((r) => this.addTask(r)));
+  }
+  /**
+   * 获取当前状态
+   * @returns 包含运行中任务数、队列长度和最大并发数
+   */
+  getStatus() {
+    return {
+      running: this.running,
+      queued: this.queue.length,
+      maxConcurrent: this.maxConcurrent
+    };
+  }
+  /**
+   * 动态修改最大并发数
+   * @param newMax - 新的最大并发数
+   */
+  setMaxConcurrent(t) {
+    for (t = t || 1, this.maxConcurrent = t; this.running < this.maxConcurrent && this.queue.length > 0; )
+      this._runNext();
+  }
+  /**
+   * 清空队列（不影响正在执行的任务）
+   */
+  clearQueue() {
+    this.queue.forEach(({ reject: t }) => {
+      t(new Error("Task cancelled: queue cleared"));
+    }), this.queue = [];
+  }
+  /**
+   * 等待所有任务完成
+   * @returns 当所有任务完成时 resolve
+   */
+  waitForAll() {
+    return new Promise((t) => {
+      const r = () => {
+        this.running === 0 && this.queue.length === 0 ? t() : setTimeout(r, 50);
+      };
+      r();
+    });
+  }
+  /**
+   * 获取当前运行中的任务数
+   */
+  getRunningCount() {
+    return this.running;
+  }
+  /**
+   * 获取队列中等待的任务数
+   */
+  getQueuedCount() {
+    return this.queue.length;
+  }
+  /**
+   * 执行队列中的下一个任务
+   */
+  _runNext() {
+    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);
+    }).finally(() => {
+      this.running--, this._runNext();
+    });
+  }
+}
+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) {
   for (const r in e)
-    Object.prototype.hasOwnProperty.call(e, r) && (t(r, e[r], e), J(e[r], t));
+    Object.prototype.hasOwnProperty.call(e, r) && (t(r, e[r], e), H(e[r], t));
 }
-const J = (e, t) => {
-  Array.isArray(e) ? e.forEach((r) => J(r, t)) : R(e) && Ee(e, t);
+const H = (e, t) => {
+  Array.isArray(e) ? e.forEach((r) => H(r, t)) : x(e) && Ee(e, t);
 }, C = (e) => new Uint8Array(
   atob(e).split("").map((t) => t.charCodeAt(0))
 );
@@ -196,9 +294,9 @@ async function Mt(e, t, r) {
   return new TextDecoder().decode(c);
 }
 const b = (e) => {
-  if (O(e))
+  if (T(e))
     return btoa(e);
-  if (P(e) || Array.isArray(e))
+  if (M(e) || Array.isArray(e))
     return btoa(String.fromCharCode(...e));
   if (me(e)) {
     const t = new Uint8Array(e);
@@ -216,11 +314,11 @@ async function Se() {
     ["encrypt", "decrypt"]
   );
 }
-async function Oe(e) {
+async function Te(e) {
   const t = await crypto.subtle.exportKey("raw", e);
   return b(t);
 }
-async function Pt(e) {
+async function $t(e) {
   const t = new TextEncoder(), r = await Se(), n = crypto.getRandomValues(new Uint8Array(16)), o = await crypto.subtle.encrypt(
     {
       name: "AES-GCM",
@@ -230,25 +328,25 @@ async function Pt(e) {
     t.encode(e)
   );
   return {
-    key: await Oe(r),
+    key: await Te(r),
     iv: b(n),
     cipherText: b(o)
   };
 }
-const Te = (e) => atob(e.replace(/[-]/g, "+").replace(/[_]/g, "/")), $t = (e) => {
+const Oe = (e) => atob(e.replace(/[-]/g, "+").replace(/[_]/g, "/")), xt = (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));
+  return JSON.parse(Oe(r));
 };
-function B(e) {
+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 = B(r);
+  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = N(r);
   return crypto.subtle.importKey(
     "pkcs8",
     n,
@@ -260,7 +358,7 @@ function Ce(e) {
     ["decrypt"]
   );
 }
-async function Rt(e, t) {
+async function Nt(e, t) {
   const r = await Ce(t), n = await crypto.subtle.decrypt(
     {
       name: "RSA-OAEP"
@@ -270,8 +368,8 @@ async function Rt(e, t) {
   );
   return new TextDecoder().decode(n);
 }
-function Me(e) {
-  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = B(r);
+function Pe(e) {
+  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = N(r);
   return crypto.subtle.importKey(
     "spki",
     n,
@@ -283,22 +381,22 @@ function Me(e) {
     ["encrypt"]
   );
 }
-async function Bt(e, t) {
-  const r = await Me(t), n = await crypto.subtle.encrypt(
+async function Rt(e, t) {
+  const r = await Pe(t), n = await crypto.subtle.encrypt(
     {
       name: "RSA-OAEP"
     },
     r,
-    B(e)
+    N(e)
   );
   return b(n);
 }
-const D = "PUBLIC KEY", x = "RAS PRIVATE KEY";
-async function U(e, t = "pkcs8") {
+const I = "PUBLIC KEY", _ = "RAS PRIVATE KEY";
+async function D(e, t = "pkcs8") {
   const r = await crypto.subtle.exportKey(t, e);
   return b(r);
 }
-async function Lt(e = 1024) {
+async function Bt(e = 1024) {
   const { publicKey: t, privateKey: r } = await crypto.subtle.generateKey(
     {
       name: "RSA-OAEP",
@@ -310,17 +408,17 @@ async function Lt(e = 1024) {
     },
     !0,
     ["encrypt", "decrypt"]
-  ), n = await U(t, "spki"), o = await U(r, "pkcs8");
+  ), n = await D(t, "spki"), o = await D(r, "pkcs8");
   return {
-    publicKey: `-----BEGIN ${D}-----
+    publicKey: `-----BEGIN ${I}-----
 ${n}
------END ${D}-----`,
-    privateKey: `-----BEGIN ${x}-----
+-----END ${I}-----`,
+    privateKey: `-----BEGIN ${_}-----
 ${o}
------END ${x}-----`
+-----END ${_}-----`
   };
 }
-const It = (e) => p(e) || q(e) ? !0 : H(e) ? !1 : new Date(e).getTime() > 0, Pe = (e) => {
+const Lt = (e) => p(e) || Z(e) ? !0 : Q(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,
@@ -329,24 +427,24 @@ const It = (e) => p(e) || q(e) ? !0 : H(e) ? !1 : new Date(e).getTime() > 0, Pe
     minute: o
   };
 }, $e = (e, t, r) => {
-  const { flag: n, hour: o, minute: c } = Pe(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) => {
+}, jt = (e, t, r) => new Date($e(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"], jt = (e, t, r) => {
-  const n = Q(e, t), o = X.find((s) => n[s] > 0) || "second", c = n[o];
+}, Y = (e, t, r) => r ? `${t} ${r[e] || e}` : `${t} ${e}`, X = ["year", "month", "day", "hour", "minute", "second"], It = (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);
-}, Dt = (e, t, r) => {
-  const n = Q(e, t);
+}, _t = (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(" ");
-}, xt = (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 Ut(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(
+}, 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(
     e
   )?.groups : !1;
 }
-const _t = (e) => ue(e), Kt = () => Math.floor(Date.now() / 1e3), kt = (e, t = 50) => {
+const Ut = (e) => ue(e), Kt = () => Math.floor(Date.now() / 1e3), zt = (e, t = 50) => {
   let r;
   return function(...n) {
     const o = () => {
@@ -354,9 +452,9 @@ const _t = (e) => ue(e), Kt = () => Math.floor(Date.now() / 1e3), kt = (e, t = 5
     };
     r !== void 0 && clearTimeout(r), r = setTimeout(o, t);
   };
-}, zt = () => {
+}, Ft = () => {
 };
-function Ft(e) {
+function qt(e) {
   let t = !1, r;
   return function() {
     if (t)
@@ -372,7 +470,7 @@ const Gt = (e, t) => {
     o - r >= t && (e.apply(this, n), r = o);
   };
 }, ee = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
-function g(e, t, r) {
+function w(e, t, r) {
   const n = r[0];
   if (t != null && e >= t)
     throw new Error(e + " >= " + t);
@@ -383,14 +481,14 @@ function g(e, t, r) {
     for (; (e[s] || n) === t[s]; )
       s++;
     if (s > 0)
-      return t.slice(0, s) + g(e.slice(s), t.slice(s), r);
+      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] + g(e.slice(1), null, r);
+    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]))
@@ -409,14 +507,14 @@ function E(e) {
     throw new Error("invalid order key: " + e);
   return e.slice(0, t);
 }
-function _(e, t) {
+function k(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) {
+function U(e, t) {
   te(e);
   const [r, ...n] = e.split("");
   let o = !0;
@@ -434,7 +532,7 @@ function K(e, t) {
   } else
     return r + n.join("");
 }
-function Re(e, t) {
+function xe(e, t) {
   te(e);
   const [r, ...n] = e.split("");
   let o = !0;
@@ -452,79 +550,79 @@ function Re(e, t) {
   } else
     return r + n.join("");
 }
-function w(e, t, r = ee) {
-  if (e != null && _(e, r), t != null && _(t, r), e != null && t != null && e >= t)
+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) {
     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 + g("", u, r);
+      return a + w("", u, r);
     if (a < t)
       return a;
-    const l = Re(a, r);
+    const l = xe(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 + g(u, null, r);
+    const a = E(e), u = e.slice(a.length), l = U(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 + g(o, s, r);
-  const i = K(n, r);
+    return n + w(o, s, r);
+  const i = U(n, r);
   if (i == null)
     throw new Error("cannot increment any more");
-  return i < t ? i : n + g(o, null, r);
+  return i < t ? i : n + w(o, null, r);
 }
-function k(e, t, r, n = ee) {
+function K(e, t, r, n = ee) {
   if (r === 0)
     return [];
   if (r === 1)
-    return [w(e, t, n)];
+    return [g(e, t, n)];
   if (t == null) {
-    let s = w(e, t, n);
+    let s = g(e, t, n);
     const i = [s];
     for (let a = 0; a < r - 1; a++)
-      s = w(s, t, n), i.push(s);
+      s = g(s, t, n), i.push(s);
     return i;
   }
   if (e == null) {
-    let s = w(e, t, n);
+    let s = g(e, t, n);
     const i = [s];
     for (let a = 0; a < r - 1; a++)
-      s = w(e, s, n), i.push(s);
+      s = g(e, s, n), i.push(s);
     return i.reverse(), i;
   }
-  const o = Math.floor(r / 2), c = w(e, t, n);
-  return [...k(e, c, o, n), c, ...k(c, t, r - o - 1, n)];
+  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 Be = (e) => {
+const Ne = (e) => {
   if (e == null || e === "") return !1;
   const t = parseFloat(e);
   return !(isNaN(t) || !isFinite(t));
-}, Le = (e, t) => Math.ceil(e / t) * t, Wt = (e, t = 80, r = 1) => Le(e * r, t), vt = (e, t = 12) => parseFloat(e.toPrecision(t)), Vt = (e) => {
+}, 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) => {
   const t = Number(e);
   return t < 0 ? Math.ceil(t) : Math.floor(t);
 }, Zt = (e) => {
-  if (Be(e)) {
+  if (Ne(e)) {
     const t = Number(e);
     return isNaN(t) || !isFinite(t) ? e : t;
   }
   return e;
-}, Ie = (e) => {
+}, Be = (e) => {
   for (const r of Object.getOwnPropertyNames(e)) {
     const n = e[r];
-    !R(n) && !d(n) || n === null || Ie(n);
+    !x(n) && !d(n) || n === null || Be(n);
   }
   return Object.isFrozen(e) ? e : Object.freeze(e);
-}, Ne = (e) => e.replace(/\[/g, ".").replace(/\]/g, "").split(".");
+}, Le = (e) => e.replace(/\[/g, ".").replace(/\]/g, "").split(".");
 function ne(e, t, r, n) {
   const o = d(n) ? n : void 0;
-  return Ne(t).reduce((s, i, a, u) => {
+  return Le(t).reduce((s, i, a, u) => {
     if (a === u.length - 1)
       return s[i] = r, s;
     if (i in s)
@@ -540,23 +638,23 @@ function ne(e, t, r, n) {
 function je(e, t, r) {
   return ne(e, t, r);
 }
-function De(e, t, r, n) {
+function Ie(e, t, r, n) {
   const o = d(n) ? n : void 0;
   return ne(e, t, r, o);
 }
-const qt = (e) => {
+const Qt = (e) => {
   const t = {};
   return Object.keys(e).forEach((r) => {
-    r.match(/[^\]]*\[\d+\]/) ? je(t, r, e[r]) : De(t, r, e[r], Object);
+    r.match(/[^\]]*\[\d+\]/) ? je(t, r, e[r]) : Ie(t, r, e[r], Object);
   }), t;
-}, xe = (e, t, r) => {
+}, _e = (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;
-}, Ue = (e, t) => {
+}, De = (e, t) => {
   const r = t.split(".");
-  return !!e && (r.length > 1 ? Ue(e[t.split(".")[0]], r.slice(1).join(".")) : Object.hasOwnProperty.call(e, t));
+  return !!e && (r.length > 1 ? De(e[t.split(".")[0]], r.slice(1).join(".")) : Object.hasOwnProperty.call(e, t));
 };
-function _e(e, t) {
+function ke(e, t) {
   return e.length !== t.length ? !1 : e.every((r, n) => r === t[n]);
 }
 const z = (e, t) => {
@@ -569,7 +667,7 @@ const z = (e, t) => {
       for (n = r; n-- !== 0; ) if (!z(e[n], t[n])) return !1;
       return !0;
     }
-    if (P(e) && P(t)) return _e(e, t);
+    if (M(e) && M(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();
@@ -587,31 +685,31 @@ const z = (e, t) => {
   (r, n) => (delete r[n], r),
   { ...e }
 ) : {};
-function Qt(e, t) {
+function Yt(e, t) {
   return Object.keys(e).filter((r) => !t(e[r], r)).reduce((r, n) => (r[n] = e[n], r), {});
 }
-function Yt(e, t) {
+function Xt(e, t) {
   return e ? t.reduce(
     (r, n) => (Object.prototype.hasOwnProperty.call(e, n) && (r[n] = e[n]), r),
     {}
   ) : {};
 }
-function Xt(e, t) {
+function er(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)) : ge(e) ? Object.keys(e).forEach(
+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)
 ) : r[`${t}`] = e, r);
-function er(e) {
+function tr(e) {
   return $(e);
 }
-const tr = (e) => {
+const rr = (e) => {
   const t = {};
   for (const r in e)
     Object.prototype.hasOwnProperty.call(e, r) && (t[r] = e[r]);
   return t;
 };
-function rr(e, t) {
+function nr(e, t) {
   if (!e || !e.length)
     return {};
   const r = d(t) ? t : S(t) ? (n, o) => t[o] : () => t;
@@ -620,37 +718,37 @@ function rr(e, t) {
     {}
   );
 }
-const nr = typeof window == "object", or = (e) => e[Math.floor(Math.random() * e.length)], sr = (e = Number.MIN_SAFE_INTEGER, t = Number.MAX_SAFE_INTEGER) => Math.random() * (t - e) + e;
-function cr(e = Number.MIN_SAFE_INTEGER, t = Number.MAX_SAFE_INTEGER) {
+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) {
   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) => {
+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) => {
   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), ir = (e = 16) => parseInt(We(e), 10), ie = (e) => {
+}, Ge = (e = 16) => F(1, oe) + F(e - 1, se), ar = (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) : "", Ve = /[A-Z]?[a-z]+|[0-9]+|[A-Z]+(?![a-z])/g, L = (e) => Array.from(e.match(Ve) ?? []);
-function ar(e) {
-  const t = L(e);
+}, 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);
   if (t.length === 0)
     return "";
   const [r, ...n] = t;
   return `${r.toLowerCase()}${n.map((o) => ie(o)).join("")}`;
 }
-const lr = async (e, t = "deflate") => {
+const ur = 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: m, value: M } = await a.read();
+      const { done: m, value: P } = await a.read();
       if (m) break;
-      u.push(M), l += M.length;
+      u.push(P), l += P.length;
     }
     const f = new Uint8Array(l);
     let A = 0;
@@ -661,7 +759,7 @@ const lr = async (e, t = "deflate") => {
   } catch (r) {
     throw console.error("压缩过程中出错:", r), r;
   }
-}, ur = async (e, t = "deflate") => {
+}, fr = async (e, t = "deflate") => {
   try {
     let r = e.replace(/-/g, "+").replace(/_/g, "/");
     const n = (4 - r.length % 4) % 4;
@@ -674,9 +772,9 @@ const lr = async (e, t = "deflate") => {
     const l = s.readable.getReader(), f = [];
     let A = 0;
     for (; ; ) {
-      const { done: h, value: I } = await l.read();
+      const { done: h, value: B } = await l.read();
       if (h) break;
-      f.push(I), A += I.length;
+      f.push(B), A += B.length;
     }
     const y = new Uint8Array(A);
     let m = 0;
@@ -686,7 +784,7 @@ const lr = async (e, t = "deflate") => {
   } catch (r) {
     throw console.error("解压过程中出错:", r), r;
   }
-}, Ze = (e) => L(e).map((r) => r.toLowerCase()).join("-"), qe = {
+}, Ve = (e) => R(e).map((r) => r.toLowerCase()).join("-"), Ze = {
   "〇": 0,
   一: 1,
   二: 2,
@@ -725,10 +823,10 @@ const lr = async (e, t = "deflate") => {
   8: 8,
   9: 9
 };
-function fr(e) {
+function hr(e) {
   let t = 0, r = 0, n = 0, o = !1;
   for (const c of e.split("").reverse()) {
-    if (r = qe[c], r === void 0)
+    if (r = Ze[c], r === void 0)
       throw new Error(`无法解析的数字: ${c}`);
     switch (r) {
       case 10: {
@@ -751,7 +849,7 @@ function fr(e) {
   }
   return o && (t += r), t;
 }
-const hr = (e) => {
+const pr = (e) => {
   const t = {};
   return new URLSearchParams(e).forEach((n, o) => {
     if (Object.prototype.hasOwnProperty.call(t, o)) {
@@ -760,7 +858,7 @@ const hr = (e) => {
     } else
       t[o] = n;
   }), t;
-}, pr = (e) => {
+}, dr = (e) => {
   const t = new URLSearchParams();
   for (const r in e)
     if (Object.prototype.hasOwnProperty.call(e, r)) {
@@ -768,43 +866,43 @@ const hr = (e) => {
       Array.isArray(n) ? n.forEach((o) => t.append(r, `${o}`)) : t.set(r, `${n}`);
     }
   return t.sort(), t.toString();
-}, He = ["角", "分", "厘"], G = ["零", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖"], T = [
+}, Qe = ["角", "分", "厘"], q = ["零", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖"], O = [
   ["元", "万", "亿", "兆", "京", "垓"],
   ["", "拾", "佰", "仟"]
-], W = Math.pow(10, 22), dr = (e) => {
+], G = Math.pow(10, 22), mr = (e) => {
   const t = e < 0 ? "欠" : "";
   let r = Math.abs(e);
-  if (r > W)
-    throw new Error(`max value is ${W}`);
+  if (r > G)
+    throw new Error(`max value is ${G}`);
   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 = Qe.reduce(
+      (c, s, i) => c + (q[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++) {
+  for (let o = 0; o < O[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;
+    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;
   }
   return `${t}${n.replace(/(零.)*零元/, "元").replace(/(零.)+/g, "零").replace(/^整$/, "零元整")}`;
 };
-function mr(e, t) {
+function yr(e, t) {
   const r = e || "", n = t || "", o = Math.max(r.length, n.length);
   return o === 0 ? 1 : (o - fe(r, n)) / o;
 }
-const yr = (e) => L(e).map((r) => r.toLowerCase()).join("_"), wr = (e) => Ze(e).split("-").filter((t) => !!t).map((t) => ie(t.toLowerCase())).join(" "), gr = (e) => e.trim().replace(/\s+/g, " "), Ar = (e, t) => e.replace(/\${([^}]+)}/g, (r, n) => xe(t, n.trim(), "")), Je = (e) => e ? e.substring(0, 1).toLowerCase() + e.substring(1, e.length) : "", Er = (e) => {
+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) => {
   if (!e) return "";
   const t = e.toLowerCase();
-  return Je(t);
-}, v = /^([^/:]+):\/*/, br = (...e) => {
+  return He(t);
+}, v = /^([^/:]+):\/*/, Sr = (...e) => {
   if (e = e.filter((s) => s !== ""), e.length === 0)
     return "";
-  if (e.findIndex((s) => !(O(s) || p(s))) >= 0)
+  if (e.findIndex((s) => !(T(s) || p(s))) >= 0)
     throw new Error("paths must be a string or number");
   let r = "";
   const n = `${e[0]}`;
@@ -823,7 +921,7 @@ const yr = (e) => L(e).map((r) => r.toLowerCase()).join("_"), wr = (e) => Ze(e).
   }
   return c.replace(/\/(\?|&|#[^!])/g, "$1");
 };
-class Sr {
+class Tr {
   #e = /* @__PURE__ */ new Map();
   /**
    * 添加事件监听器
@@ -877,9 +975,9 @@ class Sr {
     }
   }
 }
-const Or = "data:image/gif;base64,R0lGODlhAQABAIAAAAUEBAAAACwAAAAAAQABAAACAkQBADs=", Tr = "data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw==", Cr = (e, ...t) => {
+const Or = "data:image/gif;base64,R0lGODlhAQABAIAAAAUEBAAAACwAAAAAAQABAAACAkQBADs=", Cr = "data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw==", Pr = (e, ...t) => {
   const r = [];
-  R(e) ? Object.keys(e).sort().forEach((o) => {
+  x(e) ? Object.keys(e).sort().forEach((o) => {
     const c = e[o];
     r.push([o, c]);
   }) : r.push([e]), t.length && t.forEach((o) => {
@@ -887,125 +985,126 @@ const Or = "data:image/gif;base64,R0lGODlhAQABAIAAAAUEBAAAACwAAAAAAQABAAACAkQBAD
   }), (console?.table ?? console.log)(r);
 };
 export {
+  St as AsyncTaskExecutor,
   ee as BASE_62_DIGITS,
-  Sr as EventDispatcher,
+  Tr as EventDispatcher,
   Or as IMAGE_MIN_BASE64_BLACK,
-  Tr as IMAGE_MIN_BASE64_TRANSPARENT,
-  nr as IS_BROWSER,
+  Cr as IMAGE_MIN_BASE64_TRANSPARENT,
+  or as IS_BROWSER,
   tt as IdleTimer,
   rt as LeaderElection,
   Mt as aesDecrypt,
-  Pt as aesEncrypt,
+  $t as aesEncrypt,
   C as base64Decode,
   b as base64Encode,
-  ar as camelCase,
-  It as canBeDate,
-  Be as canBeNumber,
+  lr as camelCase,
+  Lt as canBeDate,
+  Ne as canBeNumber,
   ie as capitalize,
   ve as capitalizeFirst,
   ot as chunk,
-  lr as compressToBase64Url,
+  ur as compressToBase64Url,
   et as createBroadcastTopic,
-  Nt as dateStringToDate,
+  jt as dateStringToDate,
   $e as dateStringWithTimezone,
-  kt as debounce,
-  $t as decodeJWTPayload,
-  ur as decompressFromBase64Url,
-  Ie as deepFreeze,
+  zt as debounce,
+  xt as decodeJWTPayload,
+  fr as decompressFromBase64Url,
+  Be as deepFreeze,
   st as difference,
-  zt as emptyFunction,
+  Ft as emptyFunction,
   ct as flatten,
   de as flattenDeep,
-  qt as flattenPathObjectToPlainObject,
-  Dt as formatCountdown,
-  jt as formatPassTime,
-  w as generateKeyBetween,
-  k as generateKeysBetween,
-  xe as get,
-  Ue as has,
+  Qt as flattenPathObjectToPlainObject,
+  _t as formatCountdown,
+  It 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,
-  q as isDate,
+  Z as isDate,
   lt as isEmpty,
   z as isEqual,
   Ht as isEqualDate,
-  _e as isEqualUint8Array,
+  ke as isEqualUint8Array,
   ut as isFloat,
   d as isFunction,
-  xt as isISODateString,
-  we as isInt,
+  Dt as isISODateString,
+  ge as isInt,
   ft as isIntArray,
-  Ut as isMSTime,
-  H as isNil,
+  kt as isMSTime,
+  Q as isNil,
   p as isNumber,
   ht as isNumberArray,
-  R as isObject,
+  x as isObject,
   pt as isObjectLike,
-  ge as isPlainObject,
+  we as isPlainObject,
   dt as isPrimitive,
   mt as isPromise,
   yt as isRegExp,
-  O as isString,
-  wt as isStringArray,
+  T as isString,
+  gt as isStringArray,
   ye as isSymbol,
-  P as isUint8Array,
-  Ze as kebabCase,
-  Cr as logError,
-  _t as msTimeToMilliseconds,
-  gt as needArray,
-  St as nextMacroTask,
+  M as isUint8Array,
+  Ve as kebabCase,
+  Pr as logError,
+  Ut as msTimeToMilliseconds,
+  wt as needArray,
+  Tt as nextMacroTask,
   Ot as nextMicroTask,
-  zt as noop,
-  Le as numberStep,
-  Wt as numberStepScreenSize,
-  vt as numberStrip,
+  Ft as noop,
+  Re as numberStep,
+  vt as numberStepScreenSize,
+  Wt as numberStrip,
   Jt as omit,
-  Qt as omitBy,
-  Ft as once,
+  Yt as omitBy,
+  qt as once,
   At as orderBy,
-  fr as parseChineseNumber,
-  Q as parseTime,
+  hr as parseChineseNumber,
+  J as parseTime,
   nt as performChunk,
-  Yt as pick,
-  Xt as pickBy,
-  er as plainObjectToFlattenPathObject,
-  N as pool,
-  hr as queryParse,
-  pr as queryStringify,
-  or as randomArrayItem,
-  sr as randomFloat,
-  cr as randomInt,
+  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,
   F as randomString,
-  ir as randomUintByLength,
-  We as randomUintString,
-  dr as rmbUppercase,
-  Rt as rsaDecrypt,
-  Bt as rsaEncrypt,
-  Lt as rsaGenerateKey,
+  ar as randomUintByLength,
+  Ge as randomUintString,
+  mr as rmbUppercase,
+  Nt as rsaDecrypt,
+  Rt as rsaEncrypt,
+  Bt as rsaGenerateKey,
   je as set,
   ne as setBase,
-  De as setWith,
-  mr as similarity,
-  Tt as sleep,
-  yr as snakeCase,
+  Ie as setWith,
+  yr as similarity,
+  Ct as sleep,
+  gr as snakeCase,
   Et as sortBy,
   wr as startCase,
-  gr as stringSingleline,
-  Ar as stringTemplate,
+  Ar as stringSingleline,
+  Er as stringTemplate,
   Y as stringTime,
-  B as stringToArrayBuffer,
+  N as stringToArrayBuffer,
   Gt as throttle,
   Vt as toInt,
-  tr as toPlainObject,
-  J as traverseObjectKeys,
+  rr as toPlainObject,
+  H as traverseObjectKeys,
   Zt as tryToNumber,
-  Ct as uint8ArrayToString,
-  Er as uncapitalize,
-  Je as uncapitalizeFirst,
+  Pt as uint8ArrayToString,
+  br as uncapitalize,
+  He as uncapitalizeFirst,
   bt as unionBy,
   Kt as unixTimestamp,
-  br as urlJoin,
-  rr as zipObject
+  Sr as urlJoin,
+  nr as zipObject
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@aiao/utils",
-  "version": "0.0.4",
+  "version": "0.0.5",
   "type": "module",
   "main": "./dist/index.js",
   "module": "./dist/index.js",