@unicom-cloud/ui 0.8.115 → 0.8.117

package/tree/Tree.js

@@ -1,18 +1,19 @@
+/* 2025-11-03 10:27:46 */
 import { jsx as Oe } from "react/jsx-runtime";
-import { forwardRef as Ct, useContext as gt, useMemo as te, useCallback as ne, useRef as R, useState as g, useEffect as re, useImperativeHandle as St, createElement as bt } from "react";
+import { forwardRef as Nt, useContext as gt, useMemo as te, useCallback as ne, useRef as R, useState as g, useEffect as re, useImperativeHandle as St, createElement as bt } from "react";
 import h from "lodash/get";
 import j from "lodash/has";
-import Te from "lodash/isArray";
-import Pe from "lodash/isEqualWith";
-import Ae from "lodash/isFunction";
-import { a as Dt } from "../chunk/DstheLSK.js";
-import { u as Et } from "../chunk/FgWHhRFz.js";
-import Ie from "@unicom-cloud/utils/class-name";
-import { a as Lt } from "../chunk/ClqoGc3r.js";
-import { TreeContext as vt } from "./Context.js";
-import { T as Me } from "../chunk/efH9HX0H.js";
-import wt from "./NodeList.js";
-import { getTreeDataFromTreeChildren as Ot, getCheckedKeysByInitKeys as Tt, getAllCheckedKeysByCheck as Pt } from "./util.js";
+import "../config-provider/ConfigProvider.js";
+import Dt from "../dist/ui-common/hooks/use-merge-props/index.js";
+import Te from "@unicom-cloud/utils/class-name";
+import "../dist/ui-common/utils/is.js";
+import { pickDataAttributes as Et } from "../dist/ui-common/utils/pick.js";
+import { TreeContext as Lt } from "./Context.js";
+import Me from "./Node.js";
+import vt from "./NodeList.js";
+import { getTreeDataFromTreeChildren as wt, getCheckedKeysByInitKeys as Ot, getAllCheckedKeysByCheck as Tt } from "./utils.js";
+import At from "../config-provider/context.js";
+import { isArray as Ae, isEqualWith as Ie, isFunction as Pe } from "@unicom-cloud/utils/is";
 const $e = {
   key: "key",
   title: "title",
@@ -22,7 +23,7 @@ const $e = {
   disableCheckbox: "disableCheckbox",
   checkable: "checkable",
   isLeaf: "isLeaf"
-}, He = "parent", Re = "all", je = "child", At = {
+}, He = "parent", Re = "all", je = "child", It = {
   selectable: !0,
   autoExpandParent: !0,
   checkedStrategy: Re,
@@ -31,10 +32,10 @@ const $e = {
   fieldNames: $e,
   animation: !0
 };
-function It(x, We) {
-  const { getPrefixCls: Be, componentConfig: qe, rtl: ze } = gt(Dt), se = Et(
+function Pt(x, We) {
+  const { getPrefixCls: Be, componentConfig: qe, rtl: ze } = gt(At), se = Dt(
     x,
-    At,
+    It,
     qe?.Tree
   ), L = "selectedKeys" in x, v = "checkedKeys" in x, F = "halfCheckedKeys" in x, ce = "expandedKeys" in x, w = "treeData" in x, {
     __PqbAdapterMode__: Ve,
@@ -55,12 +56,12 @@ function It(x, We) {
     blockNode: ue,
     expandedKeys: T,
     defaultExpandedKeys: Xe,
-    selectedKeys: P,
+    selectedKeys: A,
     defaultSelectedKeys: Ye,
-    checkedKeys: A,
+    checkedKeys: I,
     defaultCheckedKeys: Ze,
     treeData: fe,
-    children: I,
+    children: P,
     checkStrictly: S,
     halfCheckedKeys: he,
     renderExtra: et,
@@ -81,13 +82,13 @@ function It(x, We) {
     onDragOver: dt,
     onDragLeave: ut,
     onDrop: pe
-  } = se, K = Be?.("tree"), me = te(() => w ? fe : Ot(I), [I, w, fe]), G = ne(
+  } = se, K = Be?.("tree"), me = te(() => w ? fe : wt(P), [P, w, fe]), G = ne(
     (e) => {
       const t = {
         ...$e,
         ...w ? de : {}
       }, r = {
-        children: j(e, t.children) ? h(e, t.children) : I,
+        children: j(e, t.children) ? h(e, t.children) : P,
         selectable: j(e, t.selectable) ? h(e, t.selectable) : ie,
         checkable: j(e, t.checkable) ? h(e, t.checkable) : V,
         title: h(e, t.title),
@@ -98,7 +99,7 @@ function It(x, We) {
       };
       return j(e, t.key) ? r.key = h(e, t.key) : delete r.key, r;
     },
-    [V, I, de, w, ie]
+    [V, P, de, w, ie]
   ), xe = ne(
     (e) => {
       o.current = {};
@@ -111,8 +112,8 @@ function It(x, We) {
             children: d,
             selectable: i,
             checkable: ee,
-            key: C = `${l?._key || ""}-${u}`,
-            ..._t
+            key: N = `${l?._key || ""}-${u}`,
+            ...Ct
           } = G(c), m = {
             // data 中含有 dataRef 时，优先级较高
             dataRef: c,
@@ -122,10 +123,10 @@ function It(x, We) {
             showLine: W,
             blockNode: ue,
             ...c,
-            ..._t,
-            key: C,
+            ...Ct,
+            key: N,
             children: d,
-            _key: C,
+            _key: N,
             _index: r++,
             parentKey: l ? l._key : void 0,
             pathParentKeys: l && l.pathParentKeys || [],
@@ -133,15 +134,15 @@ function It(x, We) {
             // 保存 node 在 sowLine 模式下是否显示缩进线。如果父节点是其所在层级的最后一个节点，那么所有的子节点（包括孙子节点等）在父节点所在层级的缩进格都不显示缩进线。
             _lineless: l && l._lineless ? [...l._lineless || [], l._isTail] : []
           };
-          return k === u + 1 && (m.className = Ie(
+          return k === u + 1 && (m.className = Te(
             `${K}-node-is-tail`,
             m.className
-          )), t.push(m), o.current[C] = m, d && d.length && (o.current[C].children = n(d, {
-            _key: C,
+          )), t.push(m), o.current[N] = m, d && d.length && (o.current[N].children = n(d, {
+            _key: N,
             _level: m._level + 1,
             _lineless: m._lineless,
             _isTail: k === u + 1,
-            pathParentKeys: [...l?.pathParentKeys || [], C]
+            pathParentKeys: [...l?.pathParentKeys || [], N]
           })), m;
         });
       };
@@ -151,7 +152,7 @@ function It(x, We) {
   ), J = ne(
     (e) => {
       if (!S) {
-        const { checkedKeys: t, indeterminateKeys: r } = Tt(
+        const { checkedKeys: t, indeterminateKeys: r } = Ot(
           e,
           o.current
         );
@@ -166,7 +167,7 @@ function It(x, We) {
       };
     },
     [S, he]
-  ), o = R({}), y = R(null), $ = R(null), Q = R(null), Ne = te(() => {
+  ), o = R({}), y = R(null), $ = R(null), Q = R(null), _e = te(() => {
     let e = {
       threshold: null
     };
@@ -176,12 +177,12 @@ function It(x, We) {
     } : q ? e = { height: q, threshold: 100 } : e = {
       threshold: null
     }, e;
-  }, [q, B]), _e = te(() => xe(me), [xe, me]), [N, U] = g(() => P || Ye || []), [p, b] = g(() => {
+  }, [q, B]), Ce = te(() => xe(me), [xe, me]), [_, U] = g(() => A || Ye || []), [p, b] = g(() => {
     const { checkedKeys: e, halfCheckedKeys: t } = J(
-      A || Ze || []
+      I || Ze || []
     );
     return { keys: e, halfKeys: t };
-  }), [f, Ce] = g(() => ht(T || Xe)), [D, ge] = g(() => []), [E, Se] = g(() => []), [_, X] = g(() => []);
+  }), [f, Ne] = g(() => ht(T || Xe)), [D, ge] = g(() => []), [E, Se] = g(() => []), [C, X] = g(() => []);
   function ft(e, t) {
     let r = e;
     t && (r = t._key), Q.current && Q.current.scrollIntoView(
@@ -198,7 +199,7 @@ function It(x, We) {
     const t = {};
     return e.forEach((n) => {
       const s = o.current[n];
-      s && (t[n] = 1, Te(s.pathParentKeys) && s.pathParentKeys.forEach((l) => {
+      s && (t[n] = 1, Ae(s.pathParentKeys) && s.pathParentKeys.forEach((l) => {
         t[l] = 1;
       }));
     }), Object.keys(t);
@@ -213,7 +214,7 @@ function It(x, We) {
       selectedNodes: []
     };
     if (ke) {
-      const s = [...N], l = s.indexOf(e);
+      const s = [..._], l = s.indexOf(e);
       l > -1 ? (s.splice(l, 1), n.selected = !1) : (n.selected = !0, s.push(e)), n.selectedNodes = a(s), L || U(s), Ke?.(s, n);
     } else
       n.selected = !0, n.selectedNodes = a([e]), L || U([e]), Ke?.([e], n);
@@ -230,7 +231,7 @@ function It(x, We) {
         return u.halfKeys = s, u;
       });
     else {
-      const { checkedKeys: c, indeterminateKeys: u } = Pt(
+      const { checkedKeys: c, indeterminateKeys: u } = Tt(
         t,
         e,
         n,
@@ -266,16 +267,16 @@ function It(x, We) {
     lt?.(n, k), ot?.(t, l, k);
   }
   function kt(e) {
-    Ae(M) && (X(
-      Array.from(/* @__PURE__ */ new Set([..._, e._key]))
+    Pe(M) && (X(
+      Array.from(/* @__PURE__ */ new Set([...C, e._key]))
     ), Se(
       E.filter((t) => t !== e._key)
     ), M?.(a([e._key])[0]).then((t) => {
-      X(_.filter((r) => r !== e._key)), Se(
+      X(C.filter((r) => r !== e._key)), Se(
         Array.from(/* @__PURE__ */ new Set([...E, e._key]))
       ), Y(!e.expanded, e._key);
     }).catch((t) => {
-      X(_.filter((r) => r !== e._key)), console.error("[tree]load data error: ", t);
+      X(C.filter((r) => r !== e._key)), console.error("[tree]load data error: ", t);
     }).finally(() => {
     }));
   }
@@ -291,7 +292,7 @@ function It(x, We) {
   function xt(e, t) {
     $.current = 0, ut?.(e, a([t._key])[0]);
   }
-  function Nt(e, t) {
+  function _t(e, t) {
     let r = o.current[e.parentKey];
     for (; r; ) {
       const { _key: n, parentKey: s } = r;
@@ -316,7 +317,7 @@ function It(x, We) {
   function Ee(e, t, r) {
     if (y.current) {
       const n = a([t._key])[0];
-      if (pe && !Nt(t, y.current) && !De(y.current, n)) {
+      if (pe && !_t(t, y.current) && !De(y.current, n)) {
         if (O && !O({
           dropNode: n,
           dragNode: y.current,
@@ -334,7 +335,7 @@ function It(x, We) {
   }
   function Le(e, t) {
     let r = !0;
-    return Ae(O) && (r = O({
+    return Pe(O) && (r = O({
       dropNode: a([e._key])[0],
       dragNode: y.current,
       dropPosition: t
@@ -344,7 +345,7 @@ function It(x, We) {
     if (D.indexOf(t) > -1)
       return;
     const r = e ? Array.from(/* @__PURE__ */ new Set([...f, t])) : f.filter((n) => n !== t);
-    Ce((n) => r), z && ge((n) => [...n, t]), st?.(r, {
+    Ne((n) => r), z && ge((n) => [...n, t]), st?.(r, {
       expanded: e,
       node: a([t])[0],
       expandedNodes: a(r)
@@ -362,7 +363,7 @@ function It(x, We) {
     return {
       expandedKeysSet: e?.expandedKeysSet || new Set(f || []),
       checkedKeysSet: e?.checkedKeysSet || new Set(p.keys || []),
-      selectedKeysSet: e?.selectedKeysSet || new Set(N || []),
+      selectedKeysSet: e?.selectedKeysSet || new Set(_ || []),
       halfCheckedKeysSet: e?.halfCheckedKeysSet || new Set(p.halfKeys || [])
     };
   }
@@ -387,18 +388,18 @@ function It(x, We) {
         ...d,
         selected: s.has(c._key),
         indeterminated: l.has(c._key),
-        loading: _.indexOf(c._key) > -1,
+        loading: C.indexOf(c._key) > -1,
         checked: n.has(c._key),
-        selectedKeys: N,
+        selectedKeys: _,
         checkedKeys: p.keys,
-        loadingKeys: _,
+        loadingKeys: C,
         loadedKeys: E,
         expandedKeys: f,
         childrenData: c.children || [],
         children: null
       };
     };
-    return Te(e) ? e.map((c) => k(c)) : k(e);
+    return Ae(e) ? e.map((c) => k(c)) : k(e);
   }
   function ve(e) {
     if (D.indexOf(e) > -1) {
@@ -408,19 +409,19 @@ function It(x, We) {
   }
   function we() {
     return {
-      selectedKeys: N,
+      selectedKeys: _,
       checkedKeys: p.keys,
       halfCheckedKeys: p.halfKeys,
       expandedKeys: f,
       currentExpandKeys: D,
       loadedKeys: E,
-      loadingKeys: _,
-      nodeList: _e
+      loadingKeys: C,
+      nodeList: Ce
     };
   }
   return re(() => {
-    if (!(v && A || F && S)) return;
-    const { halfCheckedKeys: e, checkedKeys: t } = J(A);
+    if (!(v && I || F && S)) return;
+    const { halfCheckedKeys: e, checkedKeys: t } = J(I);
     return b((r) => {
       const n = { ...r };
       return n.keys = t, n.halfKeys = e, n;
@@ -428,19 +429,19 @@ function It(x, We) {
     };
   }, [
     S,
-    A,
+    I,
     J,
     v,
     F
   ]), re(() => {
     if (ce)
-      return Pe(T, f) || Ce((e) => T), () => {
+      return Ie(T, f) || Ne((e) => T), () => {
       };
   }, [T, f, ce]), re(() => {
     if (L)
-      return Pe(P, N) || U(P || []), () => {
+      return Ie(A, _) || U(A || []), () => {
       };
-  }, [L, P, N]), St(We, () => ({
+  }, [L, A, _]), St(We, () => ({
     scrollIntoView: ft,
     handleCheck: be,
     getTreeState: we,
@@ -453,7 +454,7 @@ function It(x, We) {
     handleNodeDrop: Ee,
     isSameNode: De
   })), /* @__PURE__ */ Oe(
-    vt.Provider,
+    Lt.Provider,
     {
       value: {
         icons: Qe,
@@ -477,15 +478,15 @@ function It(x, We) {
         loadMore: M && kt,
         allowDrop: Le,
         actionOnClick: Ue,
-        virtualListProps: Ne
+        virtualListProps: _e
       },
       children: /* @__PURE__ */ Oe(
-        wt,
+        vt,
         {
           ref: (e) => {
             Q.current = e;
           },
-          className: Ie(
+          className: Te(
             K,
             {
               [`${K}-checkable`]: V,
@@ -497,25 +498,25 @@ function It(x, We) {
           ),
           style: Je,
           filterNode: nt,
-          virtualListProps: Ne,
+          virtualListProps: _e,
           expandedKeys: f,
           currentExpandKeys: D,
           getNodeProps: H,
           getDataSet: Z,
-          nodeList: _e,
+          nodeList: Ce,
           onMouseDown: rt,
           ariaProps: {
             role: "tree",
             "aria-multiselectable": ke,
             tabIndex: 0,
-            ...Lt(se)
+            ...Et(se)
           }
         }
       )
     }
   );
 }
-const Fe = Ct(It);
+const Fe = Nt(Pt);
 Fe.displayName = "Tree";
 const Xt = Object.assign(Fe, {
   SHOW_PARENT: He,

package/tree/index.js

@@ -1,5 +1,6 @@
+/* 2025-11-03 10:27:46 */
 import { default as r } from "./Tree.js";
-import { T as t } from "../chunk/efH9HX0H.js";
+import { default as t } from "./Node.js";
 export {
   t as TreeNode,
   r as default

package/tree/utils.js

@@ -0,0 +1,77 @@
+/* 2025-11-03 10:27:46 */
+import o from "react";
+const K = (t) => {
+  const n = (a) => o.Children.map(a, (e) => {
+    if (!o.isValidElement(e))
+      return;
+    const i = e.key;
+    return {
+      ...e.props,
+      key: i,
+      children: n(e.props.children)
+    };
+  });
+  return n(t);
+};
+function f(t, n) {
+  const a = /* @__PURE__ */ new Set(), e = (i) => {
+    i.map((s) => {
+      const c = s.key, r = n[c];
+      !r || r.disabled || r.disableCheckbox || r.checkable === !1 || (a.add(c), e(r.children || []));
+    });
+  };
+  return t && e(t.children || []), a;
+}
+const u = (t, n, a, e) => {
+  [...n[t].pathParentKeys].reverse().some((s) => {
+    const c = n[s];
+    if (c && !c.disabled && !c.disableCheckbox && c.checkable !== !1) {
+      let r = 0, l = 0;
+      c.children.some(({ key: d }) => {
+        const h = n[d];
+        if (!h || h.disabled || h.disableCheckbox || h.checkable === !1)
+          return !1;
+        if (r++, a.has(d))
+          l++;
+        else if (e.has(d))
+          return l += 0.5, !0;
+      }), !l || l === r ? e.delete(s) : e.add(s), l && l === r ? a.add(s) : a.delete(s);
+    } else
+      return !0;
+  });
+};
+function S(t, n) {
+  const a = new Set(t || []), e = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set();
+  return t.forEach((s) => {
+    i.has(s) || f(n[s], n).forEach((r, l, d) => {
+      i.add(r);
+    }), n[s] && !n[s].pathParentKeys.some(
+      (c) => a.has(c)
+    ) && u(s, n, a, e);
+  }), {
+    checkedKeys: [.../* @__PURE__ */ new Set([...a, ...i])],
+    indeterminateKeys: [...e]
+  };
+}
+function m(t, n, a, e, i) {
+  if (!e[t])
+    return {
+      checkedKeys: a,
+      indeterminateKeys: i
+    };
+  const s = new Set(a), c = new Set(i), r = f(e[t], e), l = s;
+  return n ? (l.add(t), c.delete(t), r.forEach((d, h, b) => {
+    l.add(d);
+  })) : (c.delete(t), l.delete(t), r.forEach((d, h, b) => {
+    l.delete(d);
+  })), u(t, e, s, c), {
+    checkedKeys: [...l],
+    indeterminateKeys: [...c]
+  };
+}
+export {
+  m as getAllCheckedKeysByCheck,
+  S as getCheckedKeysByInitKeys,
+  f as getChildNodeKeys,
+  K as getTreeDataFromTreeChildren
+};

package/tree-select/List.js

@@ -1,8 +1,9 @@
+/* 2025-11-03 10:27:46 */
 import { jsxs as j, jsx as v } from "react/jsx-runtime";
-import z from "lodash/isFunction";
-import I from "lodash/isString";
-import { forwardRef as K, useRef as $, useCallback as o, useMemo as x, useImperativeHandle as F } from "react";
-import H from "../tree/Tree.js";
+import { forwardRef as z, useRef as I, useCallback as o, useMemo as x, useImperativeHandle as K } from "react";
+import $ from "../tree/Tree.js";
+import "../dist/ui-common/utils/is.js";
+import { isFunction as F, isString as H } from "@unicom-cloud/utils/is";
 function O(r, y) {
   const {
     value: i,
@@ -14,7 +15,7 @@ function O(r, y) {
     treeProps: f,
     prefixCls: C,
     treeCheckable: M
-  } = r, k = f && f.renderTitle, u = $(void 0), m = o(
+  } = r, k = f && f.renderTitle, u = I(void 0), p = o(
     (t, { checkedNodes: e, checked: l, node: n }) => {
       const c = t.map((a) => {
         const s = e.find((b) => b && b.props._key === a);
@@ -33,7 +34,7 @@ function O(r, y) {
       });
     },
     [r.onChange, i]
-  ), p = o(
+  ), m = o(
     (t, { node: e, selected: l }) => {
       let n = [
         {
@@ -57,7 +58,7 @@ function O(r, y) {
     u.current && !s && !a && c !== !1 && u.current?.handleCheck?.(!n, e.props._key, l);
   }, []), R = o(
     (t) => {
-      if (z(d)) {
+      if (F(d)) {
         const e = t.props.dataRef;
         return d(t, e);
       }
@@ -69,7 +70,7 @@ function O(r, y) {
       if (k)
         return k(t);
       const e = r.inputValue, { title: l } = t;
-      if (e && I(l)) {
+      if (e && H(l)) {
         const n = l.toLowerCase().indexOf(e.toLowerCase());
         if (n === -1)
           return l;
@@ -84,16 +85,16 @@ function O(r, y) {
     },
     [C, r.inputValue, k]
   ), N = x(() => r.treeCheckable ? {
-    onCheck: m,
+    onCheck: p,
     checkedKeys: i.map((t) => t.value)
-  } : {}, [m, i, r.treeCheckable]), V = x(() => r.treeCheckable ? [] : i.map((t) => t.value), [r.treeCheckable, i]), T = o(
+  } : {}, [p, i, r.treeCheckable]), V = x(() => r.treeCheckable ? [] : i.map((t) => t.value), [r.treeCheckable, i]), T = o(
     (t, e) => {
-      r.treeCheckable ? g(t, e) : p(t, e);
+      r.treeCheckable ? g(t, e) : m(t, e);
     },
-    [r.treeCheckable, g, p]
+    [r.treeCheckable, g, m]
   );
-  return F(y, () => u.current, []), /* @__PURE__ */ v(
-    H,
+  return K(y, () => u.current, []), /* @__PURE__ */ v(
+    $,
     {
       ref: u,
       size: r.size,
@@ -117,7 +118,7 @@ function O(r, y) {
     }
   );
 }
-const G = K(O);
+const G = z(O);
 export {
   G as default
 };