@unicom-cloud/utils 0.1.22 → 0.1.23

package/package.json

@@ -1 +1 @@
-{"name":"@unicom-cloud/utils","version":"0.1.22","dependencies":{},"peerDependencies":{"lodash":"^4.17.21"},"main":"./index.js","type":"module","types":"types/index.d.ts","publishConfig":{"registry":"https://registry.npmjs.org/","access":"public"}}
+{"name":"@unicom-cloud/utils","version":"0.1.23","dependencies":{},"peerDependencies":{"lodash":"^4.17.21"},"main":"./index.js","type":"module","types":"types/index.d.ts","publishConfig":{"registry":"https://registry.npmjs.org/","access":"public"}}

package/tree/search/index.js

@@ -1,20 +1,16 @@
 import "../../is/index.js";
 import S from "lodash/isArray";
 import B from "lodash/isObjectLike";
-import m from "lodash/isString";
+import p from "lodash/isString";
 import C from "lodash/isNumber";
 import K from "lodash/isFunction";
 import L from "lodash/isRegExp";
-function j(o, f, h, w) {
-  return f && o ? { shouldExit: !0, newMatch: !0 } : h && !o ? { shouldExit: !0, newMatch: !1 } : { shouldExit: !1, newMatch: w || o };
+function j(i, a, m, w) {
+  return a && i ? { shouldExit: !0, newMatch: !0 } : m && !i ? { shouldExit: !0, newMatch: !1 } : { shouldExit: !1, newMatch: w || i };
 }
-function k(o, f) {
-  const h = { ...o };
-  return delete h[f], h;
-}
-function Q(o, f, h = {}) {
-  if (!S(o)) throw new TypeError("参数 treeData 必须是一个数组");
-  if (!B(f)) throw new TypeError("参数 searchCondition 必须是一个对象");
+function P(i, a, m = {}) {
+  if (!S(i)) throw new TypeError("参数 treeData 必须是一个数组");
+  if (!B(a)) throw new TypeError("参数 searchCondition 必须是一个对象");
   const w = {
     strategy: "BFS",
     childrenKey: "children",
@@ -27,11 +23,11 @@ function Q(o, f, h = {}) {
     returnTree: !1,
     returnTreeMaxDepth: 0,
     // 只在 returnTree 为 true 时才生效
-    ...h
+    ...m
     // 用户配置覆盖默认值
   }, {
     strategy: E,
-    childrenKey: a,
+    childrenKey: u,
     strict: R,
     fuzzyMatch: b,
     returnAllMatches: M,
@@ -39,18 +35,18 @@ function Q(o, f, h = {}) {
     allowEmptyString: z,
     matchMode: T,
     returnTree: g,
-    returnTreeMaxDepth: p
+    returnTreeMaxDepth: d
   } = w, D = T === "OR", x = T === "AND", y = E === "BFS";
   if (!(y || E === "DFS")) throw new Error('配置 strategy 必须是 "BFS" 或 "DFS"');
   if (!(D || x)) throw new Error('配置 matchMode 必须是 "AND" 或 "OR"');
-  if (!m(a)) throw new TypeError("配置 childrenKey 必须是字符串");
+  if (!p(u)) throw new TypeError("配置 childrenKey 必须是字符串");
   if (g) {
     if (!M) throw new Error(
       "当 returnTree 为 true 时，returnAllMatches 也必须为 true"
     );
-    if (!(C(p) && p > -1)) throw new TypeError("配置 returnTreeMaxDepth 必须是一个非负整数");
+    if (!(C(d) && d > -1)) throw new TypeError("配置 returnTreeMaxDepth 必须是一个非负整数");
   }
-  const d = [...o], A = [], F = Object.entries(f);
+  const h = [...i], A = [], F = Object.entries(a);
   if (F.length) {
     const N = (r) => {
       let s = !1;
@@ -58,62 +54,62 @@ function Q(o, f, h = {}) {
         const t = r[n];
         if (e === "" && !z)
           continue;
-        let i = !1;
+        let o = !1;
         if (K(e))
-          i = !!e(t, r);
-        else if (L(e) && m(t))
-          i = t ? e.test(t) : !1;
-        else if (b && m(e) && m(t)) {
+          o = !!e(t, r);
+        else if (L(e) && p(t))
+          o = t ? e.test(t) : !1;
+        else if (b && p(e) && p(t)) {
           let l = e, c = t;
-          v || (l = e.toLowerCase(), c = t.toLowerCase()), i = c.includes(l);
+          v || (l = e.toLowerCase(), c = t.toLowerCase()), o = c.includes(l);
         } else
-          i = R ? t === e : t == e;
-        const u = j(i, D, x, s);
-        if (u.shouldExit)
-          return u.newMatch;
-        s = u.newMatch;
+          o = R ? t === e : t == e;
+        const f = j(o, D, x, s);
+        if (f.shouldExit)
+          return f.newMatch;
+        s = f.newMatch;
       }
       return s;
     };
     if (g) {
       const r = (n, e = 1) => {
-        const t = p > 0 && e > p, i = !t && N(n), u = t ? void 0 : n[a], l = [];
-        if (S(u))
-          for (const c of u) {
+        const t = d > 0 && e > d, o = !t && N(n), f = t ? void 0 : n[u], l = [];
+        if (S(f))
+          for (const c of f) {
             const O = r(c, e + 1);
             O && l.push(O);
           }
-        if (i || l.length > 0) {
-          const c = k(n, a);
-          return l.length > 0 && (c[a] = l), c;
+        if (o || l.length > 0) {
+          const c = { ...n };
+          return l.length > 0 && (c[u] = l), c;
         }
         return null;
       }, s = [];
-      for (const n of o) {
+      for (const n of i) {
         const e = r(n, 1);
         e && s.push(e);
       }
       return s;
     } else
-      for (; d.length > 0; ) {
-        const r = y ? d.shift() : d.pop();
+      for (; h.length > 0; ) {
+        const r = y ? h.shift() : h.pop();
         if (!r) continue;
         if (N(r))
           if (M)
             A.push(r);
           else
             return r;
-        const s = r[a];
+        const s = r[u];
         if (S(s))
           if (y)
-            d.push(...s);
+            h.push(...s);
           else
             for (let n = s.length - 1; n >= 0; n--)
-              d.push(s[n]);
+              h.push(s[n]);
       }
   }
   return M ? A : null;
 }
 export {
-  Q as default
+  P as default
 };