@unicom-cloud/ui 0.8.119 → 0.8.121

package/tree/Tree.js

@@ -1,19 +1,18 @@
-/* 2025-11-11 09:22:07 */
+/* 2025-11-14 10:03:09 */
 import { jsx as Oe } from "react/jsx-runtime";
-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 { 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 h from "lodash/get";
 import j from "lodash/has";
 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 Dt from "@unicom-cloud/ui-common/hooks/use-merge-props";
+import Te from "@unicom-cloud/ui-common/utils/className";
+import { isArray as Pe, isEqualWith as Ae, isFunction as Ie } from "@unicom-cloud/ui-common/utils/is";
+import { pickDataAttributes as Et } from "@unicom-cloud/ui-common/utils/pick";
 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";
+import Pt from "../config-provider/context.js";
 const $e = {
   key: "key",
   title: "title",
@@ -23,7 +22,7 @@ const $e = {
   disableCheckbox: "disableCheckbox",
   checkable: "checkable",
   isLeaf: "isLeaf"
-}, He = "parent", Re = "all", je = "child", It = {
+}, He = "parent", Re = "all", je = "child", At = {
   selectable: !0,
   autoExpandParent: !0,
   checkedStrategy: Re,
@@ -32,10 +31,10 @@ const $e = {
   fieldNames: $e,
   animation: !0
 };
-function Pt(x, We) {
-  const { getPrefixCls: Be, componentConfig: qe, rtl: ze } = gt(At), se = Dt(
+function It(x, We) {
+  const { getPrefixCls: Be, componentConfig: qe, rtl: ze } = gt(Pt), se = Dt(
     x,
-    It,
+    At,
     qe?.Tree
   ), L = "selectedKeys" in x, v = "checkedKeys" in x, F = "halfCheckedKeys" in x, ce = "expandedKeys" in x, w = "treeData" in x, {
     __PqbAdapterMode__: Ve,
@@ -56,12 +55,12 @@ function Pt(x, We) {
     blockNode: ue,
     expandedKeys: T,
     defaultExpandedKeys: Xe,
-    selectedKeys: A,
+    selectedKeys: P,
     defaultSelectedKeys: Ye,
-    checkedKeys: I,
+    checkedKeys: A,
     defaultCheckedKeys: Ze,
     treeData: fe,
-    children: P,
+    children: I,
     checkStrictly: S,
     halfCheckedKeys: he,
     renderExtra: et,
@@ -82,13 +81,13 @@ function Pt(x, We) {
     onDragOver: dt,
     onDragLeave: ut,
     onDrop: pe
-  } = se, K = Be?.("tree"), me = te(() => w ? fe : wt(P), [P, w, fe]), G = ne(
+  } = se, K = Be?.("tree"), me = te(() => w ? fe : wt(I), [I, w, fe]), G = ne(
     (e) => {
       const t = {
         ...$e,
         ...w ? de : {}
       }, r = {
-        children: j(e, t.children) ? h(e, t.children) : P,
+        children: j(e, t.children) ? h(e, t.children) : I,
         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),
@@ -99,7 +98,7 @@ function Pt(x, We) {
       };
       return j(e, t.key) ? r.key = h(e, t.key) : delete r.key, r;
     },
-    [V, P, de, w, ie]
+    [V, I, de, w, ie]
   ), xe = ne(
     (e) => {
       o.current = {};
@@ -112,8 +111,8 @@ function Pt(x, We) {
             children: d,
             selectable: i,
             checkable: ee,
-            key: N = `${l?._key || ""}-${u}`,
-            ...Ct
+            key: C = `${l?._key || ""}-${u}`,
+            ..._t
           } = G(c), m = {
             // data 中含有 dataRef 时，优先级较高
             dataRef: c,
@@ -123,10 +122,10 @@ function Pt(x, We) {
             showLine: W,
             blockNode: ue,
             ...c,
-            ...Ct,
-            key: N,
+            ..._t,
+            key: C,
             children: d,
-            _key: N,
+            _key: C,
             _index: r++,
             parentKey: l ? l._key : void 0,
             pathParentKeys: l && l.pathParentKeys || [],
@@ -137,12 +136,12 @@ function Pt(x, We) {
           return k === u + 1 && (m.className = Te(
             `${K}-node-is-tail`,
             m.className
-          )), t.push(m), o.current[N] = m, d && d.length && (o.current[N].children = n(d, {
-            _key: N,
+          )), t.push(m), o.current[C] = m, d && d.length && (o.current[C].children = n(d, {
+            _key: C,
             _level: m._level + 1,
             _lineless: m._lineless,
             _isTail: k === u + 1,
-            pathParentKeys: [...l?.pathParentKeys || [], N]
+            pathParentKeys: [...l?.pathParentKeys || [], C]
           })), m;
         });
       };
@@ -167,7 +166,7 @@ function Pt(x, We) {
       };
     },
     [S, he]
-  ), o = R({}), y = R(null), $ = R(null), Q = R(null), _e = te(() => {
+  ), o = R({}), y = R(null), $ = R(null), Q = R(null), Ne = te(() => {
     let e = {
       threshold: null
     };
@@ -177,12 +176,12 @@ function Pt(x, We) {
     } : q ? e = { height: q, threshold: 100 } : e = {
       threshold: null
     }, e;
-  }, [q, B]), Ce = te(() => xe(me), [xe, me]), [_, U] = g(() => A || Ye || []), [p, b] = g(() => {
+  }, [q, B]), _e = te(() => xe(me), [xe, me]), [N, U] = g(() => P || Ye || []), [p, b] = g(() => {
     const { checkedKeys: e, halfCheckedKeys: t } = J(
-      I || Ze || []
+      A || Ze || []
     );
     return { keys: e, halfKeys: t };
-  }), [f, Ne] = g(() => ht(T || Xe)), [D, ge] = g(() => []), [E, Se] = g(() => []), [C, X] = g(() => []);
+  }), [f, Ce] = g(() => ht(T || Xe)), [D, ge] = g(() => []), [E, Se] = g(() => []), [_, X] = g(() => []);
   function ft(e, t) {
     let r = e;
     t && (r = t._key), Q.current && Q.current.scrollIntoView(
@@ -199,7 +198,7 @@ function Pt(x, We) {
     const t = {};
     return e.forEach((n) => {
       const s = o.current[n];
-      s && (t[n] = 1, Ae(s.pathParentKeys) && s.pathParentKeys.forEach((l) => {
+      s && (t[n] = 1, Pe(s.pathParentKeys) && s.pathParentKeys.forEach((l) => {
         t[l] = 1;
       }));
     }), Object.keys(t);
@@ -214,7 +213,7 @@ function Pt(x, We) {
       selectedNodes: []
     };
     if (ke) {
-      const s = [..._], l = s.indexOf(e);
+      const s = [...N], 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);
@@ -267,16 +266,16 @@ function Pt(x, We) {
     lt?.(n, k), ot?.(t, l, k);
   }
   function kt(e) {
-    Pe(M) && (X(
-      Array.from(/* @__PURE__ */ new Set([...C, e._key]))
+    Ie(M) && (X(
+      Array.from(/* @__PURE__ */ new Set([..._, e._key]))
     ), Se(
       E.filter((t) => t !== e._key)
     ), M?.(a([e._key])[0]).then((t) => {
-      X(C.filter((r) => r !== e._key)), Se(
+      X(_.filter((r) => r !== e._key)), Se(
         Array.from(/* @__PURE__ */ new Set([...E, e._key]))
       ), Y(!e.expanded, e._key);
     }).catch((t) => {
-      X(C.filter((r) => r !== e._key)), console.error("[tree]load data error: ", t);
+      X(_.filter((r) => r !== e._key)), console.error("[tree]load data error: ", t);
     }).finally(() => {
     }));
   }
@@ -292,7 +291,7 @@ function Pt(x, We) {
   function xt(e, t) {
     $.current = 0, ut?.(e, a([t._key])[0]);
   }
-  function _t(e, t) {
+  function Nt(e, t) {
     let r = o.current[e.parentKey];
     for (; r; ) {
       const { _key: n, parentKey: s } = r;
@@ -317,7 +316,7 @@ function Pt(x, We) {
   function Ee(e, t, r) {
     if (y.current) {
       const n = a([t._key])[0];
-      if (pe && !_t(t, y.current) && !De(y.current, n)) {
+      if (pe && !Nt(t, y.current) && !De(y.current, n)) {
         if (O && !O({
           dropNode: n,
           dragNode: y.current,
@@ -335,7 +334,7 @@ function Pt(x, We) {
   }
   function Le(e, t) {
     let r = !0;
-    return Pe(O) && (r = O({
+    return Ie(O) && (r = O({
       dropNode: a([e._key])[0],
       dragNode: y.current,
       dropPosition: t
@@ -345,7 +344,7 @@ function Pt(x, We) {
     if (D.indexOf(t) > -1)
       return;
     const r = e ? Array.from(/* @__PURE__ */ new Set([...f, t])) : f.filter((n) => n !== t);
-    Ne((n) => r), z && ge((n) => [...n, t]), st?.(r, {
+    Ce((n) => r), z && ge((n) => [...n, t]), st?.(r, {
       expanded: e,
       node: a([t])[0],
       expandedNodes: a(r)
@@ -363,7 +362,7 @@ function Pt(x, We) {
     return {
       expandedKeysSet: e?.expandedKeysSet || new Set(f || []),
       checkedKeysSet: e?.checkedKeysSet || new Set(p.keys || []),
-      selectedKeysSet: e?.selectedKeysSet || new Set(_ || []),
+      selectedKeysSet: e?.selectedKeysSet || new Set(N || []),
       halfCheckedKeysSet: e?.halfCheckedKeysSet || new Set(p.halfKeys || [])
     };
   }
@@ -388,18 +387,18 @@ function Pt(x, We) {
         ...d,
         selected: s.has(c._key),
         indeterminated: l.has(c._key),
-        loading: C.indexOf(c._key) > -1,
+        loading: _.indexOf(c._key) > -1,
         checked: n.has(c._key),
-        selectedKeys: _,
+        selectedKeys: N,
         checkedKeys: p.keys,
-        loadingKeys: C,
+        loadingKeys: _,
         loadedKeys: E,
         expandedKeys: f,
         childrenData: c.children || [],
         children: null
       };
     };
-    return Ae(e) ? e.map((c) => k(c)) : k(e);
+    return Pe(e) ? e.map((c) => k(c)) : k(e);
   }
   function ve(e) {
     if (D.indexOf(e) > -1) {
@@ -409,19 +408,19 @@ function Pt(x, We) {
   }
   function we() {
     return {
-      selectedKeys: _,
+      selectedKeys: N,
       checkedKeys: p.keys,
       halfCheckedKeys: p.halfKeys,
       expandedKeys: f,
       currentExpandKeys: D,
       loadedKeys: E,
-      loadingKeys: C,
-      nodeList: Ce
+      loadingKeys: _,
+      nodeList: _e
     };
   }
   return re(() => {
-    if (!(v && I || F && S)) return;
-    const { halfCheckedKeys: e, checkedKeys: t } = J(I);
+    if (!(v && A || F && S)) return;
+    const { halfCheckedKeys: e, checkedKeys: t } = J(A);
     return b((r) => {
       const n = { ...r };
       return n.keys = t, n.halfKeys = e, n;
@@ -429,19 +428,19 @@ function Pt(x, We) {
     };
   }, [
     S,
-    I,
+    A,
     J,
     v,
     F
   ]), re(() => {
     if (ce)
-      return Ie(T, f) || Ne((e) => T), () => {
+      return Ae(T, f) || Ce((e) => T), () => {
       };
   }, [T, f, ce]), re(() => {
     if (L)
-      return Ie(A, _) || U(A || []), () => {
+      return Ae(P, N) || U(P || []), () => {
       };
-  }, [L, A, _]), St(We, () => ({
+  }, [L, P, N]), St(We, () => ({
     scrollIntoView: ft,
     handleCheck: be,
     getTreeState: we,
@@ -478,7 +477,7 @@ function Pt(x, We) {
         loadMore: M && kt,
         allowDrop: Le,
         actionOnClick: Ue,
-        virtualListProps: _e
+        virtualListProps: Ne
       },
       children: /* @__PURE__ */ Oe(
         vt,
@@ -498,12 +497,12 @@ function Pt(x, We) {
           ),
           style: Je,
           filterNode: nt,
-          virtualListProps: _e,
+          virtualListProps: Ne,
           expandedKeys: f,
           currentExpandKeys: D,
           getNodeProps: H,
           getDataSet: Z,
-          nodeList: Ce,
+          nodeList: _e,
           onMouseDown: rt,
           ariaProps: {
             role: "tree",
@@ -516,9 +515,9 @@ function Pt(x, We) {
     }
   );
 }
-const Fe = Nt(Pt);
+const Fe = Ct(It);
 Fe.displayName = "Tree";
-const Xt = Object.assign(Fe, {
+const Ut = Object.assign(Fe, {
   SHOW_PARENT: He,
   SHOW_ALL: Re,
   SHOW_CHILD: je,
@@ -526,5 +525,5 @@ const Xt = Object.assign(Fe, {
 });
 export {
   Me as TreeNode,
-  Xt as default
+  Ut as default
 };

package/tree/index.js

@@ -1,4 +1,4 @@
-/* 2025-11-11 09:22:07 */
+/* 2025-11-14 10:03:09 */
 import { default as r } from "./Tree.js";
 import { default as t } from "./Node.js";
 export {

package/tree/utils.js

@@ -1,4 +1,4 @@
-/* 2025-11-11 09:22:07 */
+/* 2025-11-14 10:03:09 */
 import o from "react";
 const K = (t) => {
   const n = (a) => o.Children.map(a, (e) => {

package/tree-select/List.js

@@ -1,12 +1,11 @@
-/* 2025-11-11 09:22:07 */
+/* 2025-11-14 10:03:09 */
 import { jsxs as j, jsx as v } from "react/jsx-runtime";
 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";
+import { isFunction as F, isString as H } from "@unicom-cloud/ui-common/utils/is";
 function O(r, y) {
   const {
-    value: i,
+    value: c,
     multiple: h,
     loadMore: d,
     treeCheckedStrategy: S,
@@ -17,23 +16,23 @@ function O(r, y) {
     treeCheckable: M
   } = r, k = f && f.renderTitle, u = I(void 0), p = o(
     (t, { checkedNodes: e, checked: l, node: n }) => {
-      const c = t.map((a) => {
+      const i = t.map((a) => {
         const s = e.find((b) => b && b.props._key === a);
         return s ? {
           label: s.props.title,
           value: s.props._key,
           disabled: s.props.disabled
-        } : i.find((D) => D.value === a) || {
+        } : c.find((D) => D.value === a) || {
           label: a,
           value: a
         };
       });
-      r.onChange(c, {
+      r.onChange(i, {
         checked: l,
         trigger: n?.props
       });
     },
-    [r.onChange, i]
+    [r.onChange, c]
   ), m = o(
     (t, { node: e, selected: l }) => {
       let n = [
@@ -43,19 +42,19 @@ function O(r, y) {
         }
       ];
       if (h) {
-        n = [...i];
-        const c = n.findIndex((a) => a.value === e.props._key);
-        c > -1 ? n.splice(c, 1) : n.push({
+        n = [...c];
+        const i = n.findIndex((a) => a.value === e.props._key);
+        i > -1 ? n.splice(i, 1) : n.push({
           value: e.props._key,
           label: e.props.title
         });
       }
       r.onChange(n, { trigger: e?.props, selected: l });
     },
-    [r.onChange, i, h]
+    [r.onChange, c, h]
   ), g = o((t, { node: e, e: l }) => {
-    const { checked: n, checkable: c, disabled: a, disableCheckbox: s } = e.props;
-    u.current && !s && !a && c !== !1 && u.current?.handleCheck?.(!n, e.props._key, l);
+    const { checked: n, checkable: i, disabled: a, disableCheckbox: s } = e.props;
+    u.current && !s && !a && i !== !1 && u.current?.handleCheck?.(!n, e.props._key, l);
   }, []), R = o(
     (t) => {
       if (F(d)) {
@@ -74,9 +73,9 @@ function O(r, y) {
         const n = l.toLowerCase().indexOf(e.toLowerCase());
         if (n === -1)
           return l;
-        const c = l.substring(0, 0 + n), a = l.substring(n + e.length);
+        const i = l.substring(0, 0 + n), a = l.substring(n + e.length);
         return /* @__PURE__ */ j("span", { children: [
-          c,
+          i,
           /* @__PURE__ */ v("span", { className: `${C}-highlight`, children: l.substring(n, n + e.length) }),
           a
         ] });
@@ -86,8 +85,8 @@ function O(r, y) {
     [C, r.inputValue, k]
   ), N = x(() => r.treeCheckable ? {
     onCheck: p,
-    checkedKeys: i.map((t) => t.value)
-  } : {}, [p, i, r.treeCheckable]), V = x(() => r.treeCheckable ? [] : i.map((t) => t.value), [r.treeCheckable, i]), T = o(
+    checkedKeys: c.map((t) => t.value)
+  } : {}, [p, c, r.treeCheckable]), V = x(() => r.treeCheckable ? [] : c.map((t) => t.value), [r.treeCheckable, c]), T = o(
     (t, e) => {
       r.treeCheckable ? g(t, e) : m(t, e);
     },
@@ -118,7 +117,7 @@ function O(r, y) {
     }
   );
 }
-const G = z(O);
+const E = z(O);
 export {
-  G as default
+  E as default
 };