@aiao/utils 0.0.16 → 0.0.17

package/README.md

@@ -1 +1,24 @@
-# utils
+# @aiao/utils
+
+Aiao 项目通用工具库，提供常用的工具函数。
+
+## 功能特性
+
+- **类型工具**: TypeScript 类型增强
+- **字符串处理**: 字符串常用操作
+- **时间处理**: 日期时间相关工具
+- **RxJS 工具**: RxJS 辅助函数
+
+## 安装
+
+```bash
+npm install @aiao/utils
+# 或
+pnpm add @aiao/utils
+```
+
+## 使用
+
+```typescript
+import { deepClone, debounce, formatTime } from '@aiao/utils';
+```

package/dist/async/AsyncQueueExecutor.d.ts

@@ -23,7 +23,8 @@ export declare class AsyncQueueExecutor {
     private maxConcurrent;
     private running;
     private queue;
-    private queue_map;
+    private queueMap;
+    private drainResolvers;
     constructor(maxConcurrent?: number);
     /**
      * 添加任务到执行器
@@ -59,10 +60,14 @@ export declare class AsyncQueueExecutor {
      * 获取队列中等待的任务数
      */
     getQueuedCount(): number;
+    /**
+     * drain：当 running 和 queue 均为空时通知所有等待方
+     */
+    private _checkDrain;
     /**
      * 执行队列中的下一个任务
      */
-    private _run_next;
+    private _runNext;
 }
 export {};
 //# sourceMappingURL=AsyncQueueExecutor.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"AsyncQueueExecutor.d.ts","sourceRoot":"","sources":["../../src/async/AsyncQueueExecutor.ts"],"names":[],"mappings":"AAaA;;GAEG;AACH,UAAU,cAAc;IACtB;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,aAAa,CAAS;IAC9B,OAAO,CAAC,OAAO,CAAa;IAC5B,OAAO,CAAC,KAAK,CAAmB;IAChC,OAAO,CAAC,SAAS,CAAiD;gBAEtD,aAAa,GAAE,MAAU;IAIrC;;;;;OAKG;IACH,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;IAiBpE;;;OAGG;IACH,SAAS,IAAI,cAAc;IAQ3B;;;OAGG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAQtC;;OAEG;IACH,UAAU,IAAI,IAAI;IAQlB;;;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,SAAS;CAoBlB"}
+{"version":3,"file":"AsyncQueueExecutor.d.ts","sourceRoot":"","sources":["../../src/async/AsyncQueueExecutor.ts"],"names":[],"mappings":"AAaA;;GAEG;AACH,UAAU,cAAc;IACtB;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,aAAa,CAAS;IAC9B,OAAO,CAAC,OAAO,CAAa;IAC5B,OAAO,CAAC,KAAK,CAAmB;IAChC,OAAO,CAAC,QAAQ,CAAiD;IACjE,OAAO,CAAC,cAAc,CAAyB;gBAEnC,aAAa,GAAE,MAAU;IAIrC;;;;;OAKG;IACH,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;IAiBpE;;;OAGG;IACH,SAAS,IAAI,cAAc;IAQ3B;;;OAGG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAQtC;;OAEG;IACH,UAAU,IAAI,IAAI;IASlB;;;OAGG;IACH,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAS3B;;OAEG;IACH,eAAe,IAAI,MAAM;IAIzB;;OAEG;IACH,cAAc,IAAI,MAAM;IAIxB;;OAEG;IACH,OAAO,CAAC,WAAW;IAMnB;;OAEG;IACH,OAAO,CAAC,QAAQ;CAuBjB"}

package/dist/index.js

@@ -204,10 +204,10 @@ const wt = (e) => !(!e || !e.then || !d(e.then));
 function At(e) {
   return e instanceof RegExp;
 }
-function C(e) {
+function O(e) {
   return typeof e == "string";
 }
-const Et = (e) => b(e) ? e.every(C) : !1, $ = (e) => e instanceof Uint8Array, St = (e) => Array.isArray(e) ? e : V(e) ? [] : [e], bt = (e, t = [], r = []) => {
+const Et = (e) => b(e) ? e.every(O) : !1, M = (e) => e instanceof Uint8Array, St = (e) => Array.isArray(e) ? e : V(e) ? [] : [e], bt = (e, t = [], r = []) => {
   const n = [...e];
   return n.sort((o, c) => {
     for (let s = 0; s < t.length; s++) {
@@ -221,15 +221,16 @@ const Et = (e) => b(e) ? e.every(C) : !1, $ = (e) => e instanceof Uint8Array, St
     }
     return 0;
   }), n;
-}, Ct = (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;
-}, Ot = (e, t) => e.filter(/* @__PURE__ */ ((r) => (n) => r.has(t(n)) ? !1 : r.add(t(n)))(/* @__PURE__ */ new Set()));
+}, Ct = (e, t) => e.filter(/* @__PURE__ */ ((r) => (n) => r.has(t(n)) ? !1 : r.add(t(n)))(/* @__PURE__ */ new Set()));
 class Tt {
   maxConcurrent;
   running = 0;
   queue = [];
-  queue_map = /* @__PURE__ */ new Map();
+  queueMap = /* @__PURE__ */ new Map();
+  drainResolvers = [];
   constructor(t = 3) {
     this.maxConcurrent = t || 1;
   }
@@ -240,17 +241,17 @@ class Tt {
    * @returns 返回任务执行结果的 Promise
    */
   addTask(t, r) {
-    if (r && this.queue_map.has(r))
-      return this.queue_map.get(r);
+    if (r && this.queueMap.has(r))
+      return this.queueMap.get(r);
     const n = new Promise((o, c) => {
       this.queue.push({
         task: t,
         resolve: o,
         reject: c,
         id: r
-      }), this._run_next();
+      }), this._runNext();
     });
-    return r !== void 0 && this.queue_map.set(r, n), n;
+    return r !== void 0 && this.queueMap.set(r, n), n;
   }
   /**
    * 获取当前状态
@@ -269,7 +270,7 @@ class Tt {
    */
   setMaxConcurrent(t) {
     for (t = t || 1, this.maxConcurrent = t; this.running < this.maxConcurrent && this.queue.length > 0; )
-      this._run_next();
+      this._runNext();
   }
   /**
    * 清空队列（不影响正在执行的任务）
@@ -277,18 +278,15 @@ class Tt {
   clearQueue() {
     this.queue.forEach(({ reject: t }) => {
       t(new Error("Task cancelled: queue cleared"));
-    }), this.queue = [], this.queue_map.clear();
+    }), this.queue = [], this.queueMap.clear(), this._checkDrain();
   }
   /**
    * 等待所有任务完成
    * @returns 当所有任务完成时 resolve
    */
   waitForAll() {
-    return new Promise((t) => {
-      const r = () => {
-        this.running === 0 && this.queue.length === 0 ? t() : setTimeout(r, 50);
-      };
-      r();
+    return this.running === 0 && this.queue.length === 0 ? Promise.resolve() : new Promise((t) => {
+      this.drainResolvers.push(t);
     });
   }
   /**
@@ -303,11 +301,20 @@ class Tt {
   getQueuedCount() {
     return this.queue.length;
   }
+  /**
+   * drain：当 running 和 queue 均为空时通知所有等待方
+   */
+  _checkDrain() {
+    this.running === 0 && this.queue.length === 0 && this.drainResolvers.splice(0).forEach((t) => t());
+  }
   /**
    * 执行队列中的下一个任务
    */
-  _run_next() {
-    if (this.running >= this.maxConcurrent || this.queue.length === 0) return;
+  _runNext() {
+    if (this.running >= this.maxConcurrent || this.queue.length === 0) {
+      this._checkDrain();
+      return;
+    }
     const t = this.queue.shift();
     if (!t) return;
     const { task: r, resolve: n, reject: o, id: c } = t;
@@ -316,11 +323,11 @@ class Tt {
     }).catch((s) => {
       o(s);
     }).finally(() => {
-      this.running--, c !== void 0 && this.queue_map.delete(c), this._run_next();
+      this.running--, c !== void 0 && this.queueMap.delete(c), this._runNext();
     });
   }
 }
-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)), Ee = new TextDecoder(), Rt = (e) => Ee.decode(e);
+const Pt = (e) => setTimeout(() => e(), 0), D = /* @__PURE__ */ Promise.resolve(), Mt = (e) => e ? D.then(e) : D, $t = (e) => new Promise((t) => setTimeout(t, e)), Ee = new TextDecoder(), Rt = (e) => Ee.decode(e);
 function Se(e, t) {
   for (const r in e)
     Object.prototype.hasOwnProperty.call(e, r) && (t(r, e[r], e), Z(e[r], t));
@@ -330,7 +337,7 @@ const Z = (e, t) => {
 }, T = (e) => new Uint8Array(
   atob(e).split("").map((t) => t.charCodeAt(0))
 );
-async function _t(e, t, r) {
+async function It(e, t, r) {
   const n = await crypto.subtle.importKey(
     "raw",
     T(t),
@@ -351,9 +358,9 @@ async function _t(e, t, r) {
   return new TextDecoder().decode(c);
 }
 const S = (e) => {
-  if (C(e))
+  if (O(e))
     return btoa(e);
-  if ($(e) || Array.isArray(e))
+  if (M(e) || Array.isArray(e))
     return btoa(String.fromCharCode(...e));
   if (ye(e)) {
     const t = new Uint8Array(e);
@@ -361,7 +368,7 @@ const S = (e) => {
   }
   throw new TypeError(`Unsupported type for base64 encoding: ${typeof e}`);
 }, { subtle: be } = globalThis.crypto;
-async function Ce() {
+async function Oe() {
   return await be.generateKey(
     {
       name: "AES-GCM",
@@ -371,12 +378,12 @@ async function Ce() {
     ["encrypt", "decrypt"]
   );
 }
-async function Oe(e) {
+async function Ce(e) {
   const t = await crypto.subtle.exportKey("raw", e);
   return S(t);
 }
-async function It(e) {
-  const t = new TextEncoder(), r = await Ce(), n = crypto.getRandomValues(new Uint8Array(16)), o = await crypto.subtle.encrypt(
+async function xt(e) {
+  const t = new TextEncoder(), r = await Oe(), n = crypto.getRandomValues(new Uint8Array(16)), o = await crypto.subtle.encrypt(
     {
       name: "AES-GCM",
       iv: n
@@ -385,25 +392,25 @@ async function It(e) {
     t.encode(e)
   );
   return {
-    key: await Oe(r),
+    key: await Ce(r),
     iv: S(n),
     cipherText: S(o)
   };
 }
-const Te = (e) => atob(e.replace(/[-]/g, "+").replace(/[_]/g, "/")), xt = (e) => {
+const Te = (e) => atob(e.replace(/[-]/g, "+").replace(/[_]/g, "/")), Nt = (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 _(e) {
+function I(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 Pe(e) {
-  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = _(r);
+  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = I(r);
   return crypto.subtle.importKey(
     "pkcs8",
     n,
@@ -425,8 +432,8 @@ async function Bt(e, t) {
   );
   return new TextDecoder().decode(n);
 }
-function $e(e) {
-  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = _(r);
+function Me(e) {
+  const t = e.replace(/-----.*-----/g, "").trim(), r = atob(t), n = I(r);
   return crypto.subtle.importKey(
     "spki",
     n,
@@ -438,22 +445,22 @@ function $e(e) {
     ["encrypt"]
   );
 }
-async function Lt(e, t) {
-  const r = await $e(t), n = await crypto.subtle.encrypt(
+async function Dt(e, t) {
+  const r = await Me(t), n = await crypto.subtle.encrypt(
     {
       name: "RSA-OAEP"
     },
     r,
-    _(e)
+    I(e)
   );
   return S(n);
 }
-const j = "PUBLIC KEY", D = "RSA PRIVATE KEY";
-async function N(e, t = "pkcs8") {
+const L = "PUBLIC KEY", j = "RSA PRIVATE KEY";
+async function _(e, t = "pkcs8") {
   const r = await crypto.subtle.exportKey(t, e);
   return S(r);
 }
-async function jt(e = 1024) {
+async function Lt(e = 1024) {
   const { publicKey: t, privateKey: r } = await crypto.subtle.generateKey(
     {
       name: "RSA-OAEP",
@@ -465,17 +472,17 @@ async function jt(e = 1024) {
     },
     !0,
     ["encrypt", "decrypt"]
-  ), n = await N(t, "spki"), o = await N(r, "pkcs8");
+  ), n = await _(t, "spki"), o = await _(r, "pkcs8");
   return {
-    publicKey: `-----BEGIN ${j}-----
+    publicKey: `-----BEGIN ${L}-----
 ${n}
------END ${j}-----`,
-    privateKey: `-----BEGIN ${D}-----
+-----END ${L}-----`,
+    privateKey: `-----BEGIN ${j}-----
 ${o}
------END ${D}-----`
+-----END ${j}-----`
   };
 }
-const Dt = (e) => p(e) || G(e) ? !0 : V(e) ? !1 : new Date(e).getTime() > 0, Me = (e) => {
+const jt = (e) => p(e) || G(e) ? !0 : V(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,
@@ -484,24 +491,24 @@ const Dt = (e) => p(e) || G(e) ? !0 : V(e) ? !1 : new Date(e).getTime() > 0, Me
     minute: o
   };
 }, Re = (e, t, r) => {
-  const { flag: n, hour: o, minute: c } = Me(r);
+  const { flag: n, hour: o, minute: c } = $e(r);
   return `${e}T${t}${n}${o}:${c}`;
-}, Nt = (e, t, r) => new Date(Re(e, t, r)), H = (e, t) => {
+}, _t = (e, t, r) => new Date(Re(e, t, r)), H = (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 };
-}, Q = (e, t, r) => r ? `${t} ${r[e] || e}` : `${t} ${e}`, J = ["year", "month", "day", "hour", "minute", "second"], kt = (e, t, r) => {
-  const n = H(e, t), o = J.find((s) => n[s] > 0) || "second", c = n[o];
-  return d(r) ? r({ key: o, value: c }) : Q(o, c, r);
+}, J = (e, t, r) => r ? `${t} ${r[e] || e}` : `${t} ${e}`, Q = ["year", "month", "day", "hour", "minute", "second"], kt = (e, t, r) => {
+  const n = H(e, t), o = Q.find((s) => n[s] > 0) || "second", c = n[o];
+  return d(r) ? r({ key: o, value: c }) : J(o, c, r);
 }, Ut = (e, t, r) => {
   const n = H(e, t);
-  return d(r) ? r(n) : J.filter((o) => o).map((o) => Q(o, n[o], r)).join(" ");
-}, Kt = (e) => C(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);
+  return d(r) ? r(n) : Q.filter((o) => o).map((o) => J(o, n[o], r)).join(" ");
+}, 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 : C(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(
+  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 Ft = (e) => ue(e), zt = () => Math.floor(Date.now() / 1e3), Wt = (e, t = 50) => {
+const Ft = (e) => ue(e), zt = () => Math.floor(Date.now() / 1e3), vt = (e, t = 50) => {
   let r;
   return function(...n) {
     const o = () => {
@@ -509,7 +516,7 @@ const Ft = (e) => ue(e), zt = () => Math.floor(Date.now() / 1e3), Wt = (e, t = 5
     };
     r !== void 0 && clearTimeout(r), r = setTimeout(o, t);
   };
-}, vt = () => {
+}, Wt = () => {
 };
 function Gt(e) {
   let t = !1, r;
@@ -588,7 +595,7 @@ function U(e, t) {
   }
   return r + n.join("");
 }
-function _e(e, t) {
+function Ie(e, t) {
   ee(e);
   const r = e[0], n = e.slice(1).split("");
   let o = !0;
@@ -615,7 +622,7 @@ function g(e, t, r = Y) {
       return a + w("", l, r);
     if (a < t)
       return a;
-    const u = _e(a, r);
+    const u = Ie(a, r);
     if (u == null)
       throw new Error("cannot decrement any more");
     return u;
@@ -654,29 +661,37 @@ function K(e, t, r, n = Y) {
   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 Ie = (e) => {
+const xe = (e) => {
   if (e == null || e === "") return !1;
   const t = parseFloat(e);
   return !(isNaN(t) || !isFinite(t));
-}, xe = (e, t) => Math.ceil(e / t) * t, Zt = (e, t = 80, r = 1) => xe(e * r, t), Ht = (e, t = 12) => parseFloat(e.toPrecision(t)), Qt = (e) => {
+}, Ne = (e, t) => Math.ceil(e / t) * t, Zt = (e, t = 80, r = 1) => Ne(e * r, t), Ht = (e, t = 12) => parseFloat(e.toPrecision(t)), Jt = (e) => {
   const t = Number(e);
   return t < 0 ? Math.ceil(t) : Math.floor(t);
-}, Jt = (e) => {
-  if (Ie(e)) {
+}, Qt = (e) => {
+  if (xe(e)) {
     const t = Number(e);
     return isNaN(t) || !isFinite(t) ? e : t;
   }
   return e;
-}, Yt = (e) => e == null || typeof e != "object" ? e : structuredClone(e), Be = (e) => {
+}, Yt = (e) => {
+  if (e == null || typeof e != "object")
+    return e;
+  try {
+    return structuredClone(e);
+  } catch {
+    return JSON.parse(JSON.stringify(e));
+  }
+}, Be = (e) => {
   for (const r of Object.getOwnPropertyNames(e)) {
     const n = e[r];
     !R(n) && !d(n) || n === null || Be(n);
   }
   return Object.isFrozen(e) ? e : Object.freeze(e);
-}, Le = (e) => e.replace(/\[/g, ".").replace(/\]/g, "").split(".");
+}, De = (e) => e.replace(/\[/g, ".").replace(/\]/g, "").split(".");
 function te(e, t, r, n) {
   const o = d(n) ? n : void 0;
-  return Le(t).reduce((s, i, a, l) => {
+  return De(t).reduce((s, i, a, l) => {
     if (a === l.length - 1)
       return s[i] = r, s;
     if (i in s)
@@ -689,19 +704,19 @@ function te(e, t, r, n) {
     return s[i] = /^[0-9]{1,}$/.test(l[a + 1]) ? [] : {};
   }, e), e;
 }
-function je(e, t, r) {
+function Le(e, t, r) {
   return te(e, t, r);
 }
-function De(e, t, r, n) {
+function je(e, t, r, n) {
   const o = d(n) ? n : void 0;
   return te(e, t, r, o);
 }
 const Xt = (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+\]/) ? Le(t, r, e[r]) : je(t, r, e[r], Object);
   }), t;
-}, Ne = (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;
 }, ke = (e, t) => {
@@ -721,7 +736,7 @@ const q = (e, t) => {
       for (n = r; n-- !== 0; ) if (!q(e[n], t[n])) return !1;
       return !0;
     }
-    if ($(e) && $(t)) return Ue(e, t);
+    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();
@@ -751,11 +766,11 @@ function nr(e, t) {
 function or(e, t) {
   return Object.keys(e).filter((r) => t(e[r], r)).reduce((r, n) => (r[n] = e[n], r), {});
 }
-const M = (e, t = "", r = {}) => (b(e) ? e.forEach((n, o) => M(n, `${t}[${o}]`, r)) : Ae(e) ? Object.keys(e).forEach(
-  (n) => M(e[n], `${t ? t + "." : ""}${n}`, r)
+const $ = (e, t = "", r = {}) => (b(e) ? e.forEach((n, o) => $(n, `${t}[${o}]`, r)) : Ae(e) ? Object.keys(e).forEach(
+  (n) => $(e[n], `${t ? t + "." : ""}${n}`, r)
 ) : r[`${t}`] = e, r);
 function sr(e) {
-  return M(e);
+  return $(e);
 }
 const cr = (e) => {
   const t = {};
@@ -776,18 +791,18 @@ const ar = typeof window == "object", lr = (e) => e[Math.floor(Math.random() * e
 function fr(e = Number.MIN_SAFE_INTEGER, t = Number.MAX_SAFE_INTEGER) {
   return Math.floor(Math.random() * (t - e + 1) + e);
 }
-const Ke = "0", re = "123456789", ne = Ke + re, oe = "abcdefghijklmnopqrstuvwxyz", qe = oe.toUpperCase(), Fe = oe + qe, ze = "_-", We = ne + Fe + ze, F = (e = 16, t = We) => {
+const Ke = "0", re = "123456789", ne = Ke + re, oe = "abcdefghijklmnopqrstuvwxyz", qe = oe.toUpperCase(), Fe = oe + qe, ze = "_-", ve = ne + Fe + ze, 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;
-}, ve = (e = 16) => F(1, re) + F(e - 1, ne), hr = (e = 16) => parseInt(ve(e), 10), se = (e) => {
+}, We = (e = 16) => F(1, re) + F(e - 1, ne), hr = (e = 16) => parseInt(We(e), 10), se = (e) => {
   if (!e) return "";
   const t = e.toLowerCase();
   return Ge(t);
-}, Ge = (e) => e ? e.substring(0, 1).toUpperCase() + e.substring(1, e.length) : "", Ve = /[A-Z]?[a-z]+|[0-9]+|[A-Z]+(?![a-z])/g, I = (e) => Array.from(e.match(Ve) ?? []);
+}, Ge = (e) => e ? e.substring(0, 1).toUpperCase() + e.substring(1, e.length) : "", Ve = /[A-Z]?[a-z]+|[0-9]+|[A-Z]+(?![a-z])/g, x = (e) => Array.from(e.match(Ve) ?? []);
 function pr(e) {
-  const t = I(e);
+  const t = x(e);
   if (t.length === 0)
     return "";
   const [r, ...n] = t;
@@ -826,9 +841,9 @@ const dr = async (e, t = "deflate") => {
     const u = s.readable.getReader(), f = [];
     let A = 0;
     for (; ; ) {
-      const { done: h, value: x } = await u.read();
+      const { done: h, value: N } = await u.read();
       if (h) break;
-      f.push(x), A += x.length;
+      f.push(N), A += N.length;
     }
     const y = new Uint8Array(A);
     let m = 0;
@@ -838,7 +853,7 @@ const dr = async (e, t = "deflate") => {
   } catch (r) {
     throw console.error("解压过程中出错:", r), r;
   }
-}, Ze = (e) => I(e).map((r) => r.toLowerCase()).join("-"), He = {
+}, Ze = (e) => x(e).map((r) => r.toLowerCase()).join("-"), He = {
   "〇": 0,
   一: 1,
   二: 2,
@@ -920,28 +935,28 @@ const gr = (e) => {
       Array.isArray(n) ? n.forEach((o) => t.append(r, `${o}`)) : t.set(r, `${n}`);
     }
   return t.sort(), t.toString();
-}, Qe = ["角", "分", "厘"], z = ["零", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖"], O = [
+}, Je = ["角", "分", "厘"], z = ["零", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖"], C = [
   ["元", "万", "亿", "兆", "京", "垓"],
   ["", "拾", "佰", "仟"]
-], W = Math.pow(10, 22), Ar = (e) => {
+], v = Math.pow(10, 22), Ar = (e) => {
   const t = e < 0 ? "欠" : "";
   let r = Math.abs(e);
-  if (r > W)
-    throw new Error(`max value is ${W}`);
+  if (r > v)
+    throw new Error(`max value is ${v}`);
   let n = "";
   if (e > Math.floor(e)) {
     const o = +("0." + `${r}`.split(".")[1]);
-    n = Qe.reduce(
+    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 < C[0].length && r > 0; o++) {
     let c = "";
-    for (let s = 0; s < O[1].length && r > 0; s++)
-      c = z[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 < C[1].length && r > 0; s++)
+      c = z[r % 10] + C[1][s] + c, r = Math.floor(r / 10);
+    n = c.replace(/(零.)*零$/g, "").replace(/^$/, "零") + C[0][o] + n;
   }
   return `${t}${n.replace(/(零.)*零元/, "元").replace(/(零.)+/g, "零").replace(/^整$/, "零元整")}`;
 };
@@ -949,18 +964,18 @@ function Er(e, t) {
   const r = e || "", n = t || "", o = Math.max(r.length, n.length);
   return o === 0 ? 1 : (o - fe(r, n)) / o;
 }
-const Sr = (e) => I(e).map((r) => r.toLowerCase()).join("_"), br = (e) => Ze(e).split("-").filter((t) => !!t).map((t) => se(t.toLowerCase())).join(" "), Cr = (e) => e.trim().replace(/\s+/g, " "), Or = (e, t) => e.replace(/\${([^}]+)}/g, (r, n) => Ne(t, n.trim(), "")), Je = (e) => e ? e.substring(0, 1).toLowerCase() + e.substring(1, e.length) : "", Tr = (e) => {
+const Sr = (e) => x(e).map((r) => r.toLowerCase()).join("_"), br = (e) => Ze(e).split("-").filter((t) => !!t).map((t) => se(t.toLowerCase())).join(" "), Or = (e) => e.trim().replace(/\s+/g, " "), Cr = (e, t) => e.replace(/\${([^}]+)}/g, (r, n) => _e(t, n.trim(), "")), Qe = (e) => e ? e.substring(0, 1).toLowerCase() + e.substring(1, e.length) : "", Tr = (e) => {
   if (!e) return "";
   const t = e.toLowerCase();
-  return Je(t);
-}, v = /^([^/:]+):\/*/, Pr = (...e) => {
+  return Qe(t);
+}, W = /^([^/:]+):\/*/, Pr = (...e) => {
   if (e = e.filter((s) => s !== ""), e.length === 0)
     return "";
-  if (e.findIndex((s) => !(C(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]}`;
-  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 += "/");
+  n.startsWith("//") ? r = "//" : n.startsWith("/") ? r = "/" : (n.startsWith("file:") && e.length > 1 && (n + e[1]).match(/^file:\/\/\//) ? r = n.replace(W, "$1:///") : r = n.replace(W, "$1://"), e.shift()), r && !r.endsWith("/") && (r += "/");
   let o = e.map(
     (s) => `${s}`.replace(/^\/+/, "").replace(/^\.\/+/, "").replace(/\/+$/, "")
   ).filter((s) => s !== "").join("/");
@@ -975,7 +990,7 @@ const Sr = (e) => I(e).map((r) => r.toLowerCase()).join("_"), br = (e) => Ze(e).
   }
   return c.replace(/\/(\?|&|#[^!])/g, "$1");
 };
-class $r {
+class Mr {
   #e = /* @__PURE__ */ new Map();
   /**
    * 添加事件监听器
@@ -1034,7 +1049,7 @@ class $r {
     return this.#e.set(t, r), r;
   }
 }
-const Mr = "data:image/gif;base64,R0lGODlhAQABAIAAAAUEBAAAACwAAAAAAQABAAACAkQBADs=", Rr = "data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw==", _r = (e, ...t) => {
+const $r = "data:image/gif;base64,R0lGODlhAQABAIAAAAUEBAAAACwAAAAAAQABAAACAkQBADs=", Rr = "data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw==", Ir = (e, ...t) => {
   const r = [];
   R(e) ? Object.keys(e).sort().forEach((o) => {
     const c = e[o];
@@ -1046,19 +1061,19 @@ const Mr = "data:image/gif;base64,R0lGODlhAQABAIAAAAUEBAAAACwAAAAAAQABAAACAkQBAD
 export {
   Tt as AsyncQueueExecutor,
   Y as BASE_62_DIGITS,
-  $r as EventDispatcher,
-  Mr as IMAGE_MIN_BASE64_BLACK,
+  Mr as EventDispatcher,
+  $r as IMAGE_MIN_BASE64_BLACK,
   Rr as IMAGE_MIN_BASE64_TRANSPARENT,
   ar as IS_BROWSER,
   rt as IdleTimer,
   nt as LeaderElection,
-  _t as aesDecrypt,
-  It as aesEncrypt,
+  It as aesDecrypt,
+  xt as aesEncrypt,
   T as base64Decode,
   S as base64Encode,
   pr as camelCase,
-  Dt as canBeDate,
-  Ie as canBeNumber,
+  jt as canBeDate,
+  xe as canBeNumber,
   se as capitalize,
   Ge as capitalizeFirst,
   ot as checkOPFSAvailable,
@@ -1066,14 +1081,14 @@ export {
   Yt as cloneDeep,
   dr as compressToBase64Url,
   tt as createBroadcastTopic,
-  Nt as dateStringToDate,
+  _t as dateStringToDate,
   Re as dateStringWithTimezone,
-  Wt as debounce,
-  xt as decodeJWTPayload,
+  vt as debounce,
+  Nt as decodeJWTPayload,
   mr as decompressFromBase64Url,
   Be as deepFreeze,
   at as difference,
-  vt as emptyFunction,
+  Wt as emptyFunction,
   lt as flatten,
   me as flattenDeep,
   Xt as flattenPathObjectToPlainObject,
@@ -1081,7 +1096,7 @@ export {
   kt as formatPassTime,
   g as generateKeyBetween,
   K as generateKeysBetween,
-  Ne as get,
+  _e as get,
   ke as has,
   ut as intersection,
   b as isArray,
@@ -1108,18 +1123,18 @@ export {
   gt as isPrimitive,
   wt as isPromise,
   At as isRegExp,
-  C as isString,
+  O as isString,
   Et as isStringArray,
   ge as isSymbol,
-  $ as isUint8Array,
+  M as isUint8Array,
   Ze as kebabCase,
-  _r as logError,
+  Ir as logError,
   Ft as msTimeToMilliseconds,
   St as needArray,
   Pt as nextMacroTask,
-  $t as nextMicroTask,
-  vt as noop,
-  xe as numberStep,
+  Mt as nextMicroTask,
+  Wt as noop,
+  Ne as numberStep,
   Zt as numberStepScreenSize,
   Ht as numberStrip,
   tr as omit,
@@ -1140,33 +1155,33 @@ export {
   fr as randomInt,
   F as randomString,
   hr as randomUintByLength,
-  ve as randomUintString,
+  We as randomUintString,
   ct as requestIdleCallbackPolyfill,
   Ar as rmbUppercase,
   Bt as rsaDecrypt,
-  Lt as rsaEncrypt,
-  jt as rsaGenerateKey,
-  je as set,
+  Dt as rsaEncrypt,
+  Lt as rsaGenerateKey,
+  Le as set,
   te as setBase,
-  De as setWith,
+  je as setWith,
   Er as similarity,
-  Mt as sleep,
+  $t as sleep,
   Sr as snakeCase,
-  Ct as sortBy,
+  Ot as sortBy,
   br as startCase,
-  Cr as stringSingleline,
-  Or as stringTemplate,
-  Q as stringTime,
-  _ as stringToArrayBuffer,
+  Or as stringSingleline,
+  Cr as stringTemplate,
+  J as stringTime,
+  I as stringToArrayBuffer,
   Vt as throttle,
-  Qt as toInt,
+  Jt as toInt,
   cr as toPlainObject,
   Z as traverseObjectKeys,
-  Jt as tryToNumber,
+  Qt as tryToNumber,
   Rt as uint8ArrayToString,
   Tr as uncapitalize,
-  Je as uncapitalizeFirst,
-  Ot as unionBy,
+  Qe as uncapitalizeFirst,
+  Ct as unionBy,
   zt as unixTimestamp,
   Pr as urlJoin,
   ir as zipObject

package/dist/object/cloneDeep.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cloneDeep.d.ts","sourceRoot":"","sources":["../../src/object/cloneDeep.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,OAAO,CAAC,KAAG,CAKvC,CAAC"}
+{"version":3,"file":"cloneDeep.d.ts","sourceRoot":"","sources":["../../src/object/cloneDeep.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,OAAO,CAAC,KAAG,CASvC,CAAC"}

package/package.json

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