@unicom-cloud/ui 0.8.91 → 0.8.92

package/tree/Tree.js

@@ -1,21 +1,21 @@
-import { jsx as re } from "react/jsx-runtime";
-import { forwardRef as Se, useContext as ve, useRef as S, useState as Te, useImperativeHandle as Ae, useEffect as z, createElement as Ie } from "react";
+import { jsx as se } from "react/jsx-runtime";
+import { forwardRef as Se, useContext as ve, useRef as S, useState as Te, useImperativeHandle as Ae, useEffect as B, createElement as Ie } from "react";
 import { isEmptyObject as Me } from "@unicom-cloud/utils/is";
-import D from "lodash/get";
-import B from "lodash/has";
+import E from "lodash/get";
+import q from "lodash/has";
 import He from "lodash/isArray";
-import E from "lodash/isEqualWith";
+import L from "lodash/isEqualWith";
 import $e from "lodash/isFunction";
-import se from "lodash/isUndefined";
+import le from "lodash/isUndefined";
 import "../config-provider/ConfigProvider.js";
-import le from "@unicom-cloud/utils/class-name";
-import { pickDataAttributes as We } from "../components/common/utils/pick.js";
-import { TreeContext as Re } from "./Context.js";
-import de from "./Node.js";
+import de from "@unicom-cloud/utils/class-name";
+import { pickDataAttributes as Re } from "../components/common/utils/pick.js";
+import { TreeContext as We } from "./Context.js";
+import ie from "./Node.js";
 import je from "./NodeList.js";
 import { getTreeDataFromTreeChildren as Fe, getCheckedKeysByInitKeys as ze, getAllCheckedKeysByCheck as Be } from "./util.js";
 import qe from "../config-provider/context.js";
-const ie = {
+const ae = {
   key: "key",
   title: "title",
   children: "children",
@@ -24,13 +24,13 @@ const ie = {
   disableCheckbox: "disableCheckbox",
   checkable: "checkable",
   isLeaf: "isLeaf"
-}, oe = "parent", ae = "all", ye = "child", Ue = {
+}, oe = "parent", ye = "all", ue = "child", Ue = {
   selectable: !0,
   autoExpandParent: !0,
-  checkedStrategy: ae,
+  checkedStrategy: ye,
   actionOnClick: "select",
   allowDrop: () => !0,
-  fieldNames: ie,
+  fieldNames: ae,
   animation: !0
 }, Ve = [
   "style",
@@ -49,42 +49,42 @@ const ie = {
   "actionOnClick",
   "animation"
 ];
-function Ge(r, ue) {
-  const g = ve(qe), q = S(null), f = S({}), _ = S(), T = S(), M = S(), [o, k] = Te(() => {
+function Ge(r, fe) {
+  const g = ve(qe), U = S(null), f = S({}), b = S(), T = S(), M = S(), [a, k] = Te(() => {
     var l;
-    const e = H(), t = $(e, (l = g.getPrefixCls) == null ? void 0 : l.call(g, "tree")), { checkedKeys: c, halfCheckedKeys: n } = W(
+    const e = H(), n = $(e, (l = g.getPrefixCls) == null ? void 0 : l.call(g, "tree")), { checkedKeys: c, halfCheckedKeys: t } = R(
       r.checkedKeys || r.defaultCheckedKeys || []
     );
     return {
       selectedKeys: r.selectedKeys || r.defaultSelectedKeys || [],
       checkedKeys: c,
-      halfCheckedKeys: n,
-      expandedKeys: V(
+      halfCheckedKeys: t,
+      expandedKeys: G(
         r.expandedKeys || r.defaultExpandedKeys
       ),
       loadedKeys: [],
       loadingKeys: [],
       currentExpandKeys: [],
-      nodeList: t
+      nodeList: n
     };
   });
   function C(e) {
-    const { componentConfig: t } = g ?? {}, c = e || r, n = (t == null ? void 0 : t.Tree) || {}, l = {};
+    const { componentConfig: n } = g ?? {}, c = e || r, t = (n == null ? void 0 : n.Tree) || {}, l = {};
     return Ve.forEach((s) => {
-      se(c[s]) ? se(n[s]) ? l[s] = Ue[s] : l[s] = n[s] : l[s] = c[s];
+      le(c[s]) ? le(t[s]) ? l[s] = Ue[s] : l[s] = t[s] : l[s] = c[s];
     }), l;
   }
-  function fe(e, t) {
+  function he(e, n) {
     let c = e;
-    t && (c = t._key), M.current && M.current.scrollIntoView(
+    n && (c = n._key), M.current && M.current.scrollIntoView(
       c,
-      t || f.current[c]
+      n || f.current[c]
     );
   }
   function H() {
     return "treeData" in r ? r.treeData : Fe(r.children);
   }
-  function he(e, t) {
+  function Ke(e, n) {
     const c = [
       "fieldNames",
       "selectable",
@@ -96,96 +96,96 @@ function Ge(r, ue) {
       "treeData",
       "children"
     ];
-    return e.treeData !== t.treeData || e.children !== t.children || c.some((n) => E(e[n], t[n]));
+    return e.treeData !== n.treeData || e.children !== n.children || c.some((t) => L(e[t], n[t]));
   }
-  function U(e) {
-    const t = C(), { selectable: c } = t, n = {
-      ...ie,
-      ..."treeData" in r ? t.fieldNames : {}
+  function V(e) {
+    const n = C(), { selectable: c } = n, t = {
+      ...ae,
+      ..."treeData" in r ? n.fieldNames : {}
     }, l = {
-      children: D(e, n.children),
-      selectable: B(e, n.selectable) ? D(e, n.selectable) : c,
-      checkable: B(e, n.checkable) ? D(e, n.checkable) : r.checkable,
-      title: D(e, n.title),
-      disabled: D(e, n.disabled),
-      disableCheckbox: D(e, n.disableCheckbox),
-      isLeaf: D(e, n.isLeaf),
-      key: D(e, n.key)
+      children: E(e, t.children),
+      selectable: q(e, t.selectable) ? E(e, t.selectable) : c,
+      checkable: q(e, t.checkable) ? E(e, t.checkable) : r.checkable,
+      title: E(e, t.title),
+      disabled: E(e, t.disabled),
+      disableCheckbox: E(e, t.disableCheckbox),
+      isLeaf: E(e, t.isLeaf),
+      key: E(e, t.key)
     };
-    return B(e, n.key) || delete l.key, l;
+    return q(e, t.key) || delete l.key, l;
   }
-  function $(e, t) {
+  function $(e, n) {
     var y;
     f.current = {};
-    const c = t || ((y = g.getPrefixCls) == null ? void 0 : y.call(g, "tree")), n = [];
+    const c = n || ((y = g.getPrefixCls) == null ? void 0 : y.call(g, "tree")), t = [];
     let l = 0;
-    const { showLine: s, blockNode: d } = C(), i = (m, a) => {
-      const x = m.length;
-      return m.map((h, N) => {
+    const { showLine: s, blockNode: d } = C(), i = (_, u) => {
+      const w = _.length;
+      return _.map((m, x) => {
         const {
-          children: u,
-          selectable: L,
-          checkable: P,
-          key: b = `${(a == null ? void 0 : a._key) || ""}-${N}`,
-          ...Pe
-        } = U(h), w = {
+          children: o,
+          selectable: h,
+          checkable: D,
+          key: N = `${(u == null ? void 0 : u._key) || ""}-${x}`,
+          ...z
+        } = V(m), O = {
           // data 中含有 dataRef 时，优先级较高
-          dataRef: h,
+          dataRef: m,
           draggable: r.draggable,
-          selectable: L,
-          checkable: P,
+          selectable: h,
+          checkable: D,
           showLine: s,
           blockNode: d,
-          ...h,
-          ...Pe,
-          key: b,
-          children: u,
-          _key: b,
+          ...m,
+          ...z,
+          key: N,
+          children: o,
+          _key: N,
           _index: l++,
-          parentKey: a ? a._key : void 0,
-          pathParentKeys: a && a.pathParentKeys || [],
-          _level: a._level || 0,
+          parentKey: u ? u._key : void 0,
+          pathParentKeys: u && u.pathParentKeys || [],
+          _level: u._level || 0,
           // 保存node在sowLine模式下是否显示缩进线。如果父节点是其所在层级的最后一个节点，那么所有的子节点（包括孙子节点等）在父节点所在层级的缩进格都不显示缩进线。
-          _lineless: a && a._lineless ? [...a._lineless || [], a._isTail] : []
+          _lineless: u && u._lineless ? [...u._lineless || [], u._isTail] : []
         };
-        return x === N + 1 && (w.className = le(
+        return w === x + 1 && (O.className = de(
           `${c}-node-is-tail`,
-          w.className
-        )), n.push(w), f.current[b] = w, u && u.length && (f.current[b].children = i(u, {
-          _key: b,
-          _level: w._level + 1,
-          _lineless: w._lineless,
-          _isTail: x === N + 1,
-          pathParentKeys: [...(a == null ? void 0 : a.pathParentKeys) || [], b]
-        })), w;
+          O.className
+        )), t.push(O), f.current[N] = O, o && o.length && (f.current[N].children = i(o, {
+          _key: N,
+          _level: O._level + 1,
+          _lineless: O._lineless,
+          _isTail: w === x + 1,
+          pathParentKeys: [...(u == null ? void 0 : u.pathParentKeys) || [], N]
+        })), O;
       });
     };
-    return i(e || [], {}), n;
+    return i(e || [], {}), t;
   }
-  function V(e) {
+  function G(e) {
     if (!C().autoExpandParent)
       return e || [];
     if (!e)
       return Object.keys(f.current).filter((c) => {
-        const n = f.current[c];
-        return n.children && n.children.length;
+        const t = f.current[c];
+        return t.children && t.children.length;
       });
-    const t = {};
+    const n = {};
     return e.forEach((c) => {
-      const n = f.current[c];
-      n && (t[c] = 1, n.pathParentKeys && n.pathParentKeys.forEach((l) => {
-        t[l] = 1;
+      const t = f.current[c];
+      t && (n[c] = 1, t.pathParentKeys && t.pathParentKeys.forEach((l) => {
+        n[l] = 1;
       }));
-    }), Object.keys(t);
+    }), Object.keys(n);
   }
-  function W(e) {
+  function R(e) {
     if (!r.checkStrictly) {
-      const { checkedKeys: t, indeterminateKeys: c } = ze(
+      const { checkedKeys: n, indeterminateKeys: c } = ze(
         e,
         f.current
       );
       return {
-        checkedKeys: t,
+        checkedKeys: n,
         halfCheckedKeys: c
       };
     }
@@ -194,140 +194,144 @@ function Ge(r, ue) {
       halfCheckedKeys: r.halfCheckedKeys || []
     };
   }
-  function Ke(e, t) {
+  function ke(e, n) {
     var l;
-    const { onSelect: c } = r, n = {
-      e: t,
+    const { onSelect: c } = r, t = {
+      e: n,
       data: (l = f.current[e]) == null ? void 0 : l.dataRef,
       // 潘启宝添加
       node: K([e])[0]
     };
     if (r.multiple) {
-      const s = [...o.selectedKeys], d = s.indexOf(e);
-      d > -1 ? (s.splice(d, 1), n.selected = !1) : (n.selected = !0, s.push(e)), n.selectedNodes = K(s), "selectedKeys" in r || k((i) => {
+      const s = [...a.selectedKeys], d = s.indexOf(e);
+      d > -1 ? (s.splice(d, 1), t.selected = !1) : (t.selected = !0, s.push(e)), t.selectedNodes = K(s), "selectedKeys" in r || k((i) => {
         const y = { ...i };
         return y.selectedKeys = s, y;
-      }), c == null || c(s, n);
+      }), c == null || c(s, t);
     } else
-      n.selected = !0, n.selectedNodes = K([e]), "selectedKeys" in r || k((s) => {
+      t.selected = !0, t.selectedNodes = K([e]), "selectedKeys" in r || k((s) => {
         const d = { ...s };
         return d.selectedKeys = [e], d;
-      }), c == null || c([e], n);
+      }), c == null || c([e], t);
   }
-  function G(e, t, c) {
-    const { checkedStrategy: n } = C(), { onCheck: l, checkStrictly: s } = r, d = { e: c, node: K([t])[0] };
-    let i = [...o.checkedKeys || []], y = o.halfCheckedKeys;
+  function J(e, n, c) {
+    var u, w;
+    const { checkedStrategy: t } = C(), { onCheck: l, checkStrictly: s } = r, d = { e: c, node: K([n])[0] };
+    let i = [...a.checkedKeys || []], y = a.halfCheckedKeys;
     if (s) {
-      e ? i = i.concat(t) : i = i.filter((a) => a !== t);
+      e ? i = i.concat(n) : i = i.filter((x) => x !== n);
       const m = {};
-      "checkedKeys" in r || (m.checkedKeys = i), "halfCheckedKeys" in r || (m.halfCheckedKeys = y), Me(m) || k((a) => ({ ...a, ...m }));
+      "checkedKeys" in r || (m.checkedKeys = i), "halfCheckedKeys" in r || (m.halfCheckedKeys = y), Me(m) || k((x) => ({ ...x, ...m }));
     } else {
-      const { checkedKeys: m, indeterminateKeys: a } = Be(
-        t,
+      const { checkedKeys: m, indeterminateKeys: x } = Be(
+        n,
         e,
         i,
         f.current,
         y
       );
-      i = m, y = a, "checkedKeys" in r ? k((x) => {
-        const h = { ...x };
+      i = m, y = x, "checkedKeys" in r ? k((o) => {
+        const h = { ...o };
         return h.halfCheckedKeys = y, h;
-      }) : k((x) => {
-        const h = { ...x };
+      }) : k((o) => {
+        const h = { ...o };
         return h.checkedKeys = i, h.halfCheckedKeys = y, h;
-      }), n === oe ? i = i.filter((x) => {
-        const h = f.current[x];
+      }), t === oe ? i = i.filter((o) => {
+        const h = f.current[o];
         if (!h || i.indexOf(h.parentKey) === -1)
           return !0;
-      }) : n === ye && (i = i.filter((x) => {
-        var N, u;
-        const h = f.current[x];
-        if (!h || !((N = h.children) != null && N.length) || (u = h.children) != null && u.every((L) => i.indexOf(L._key) === -1))
+      }) : t === ue && (i = i.filter((o) => {
+        var D, N;
+        const h = f.current[o];
+        if (!h || !((D = h.children) != null && D.length) || (N = h.children) != null && N.every((z) => i.indexOf(z._key) === -1))
           return !0;
       }));
     }
+    const _ = (u = f.current[n]) == null ? void 0 : u.dataRef;
     l == null || l(i, {
+      data: _,
+      // 潘启宝添加
       checkedNodes: K(i),
       checked: e,
       halfCheckedKeys: y,
       halfCheckedNodes: K(y),
       ...d
-    });
+    }), (w = r.onNodeCheck) == null || w.call(r, n, _, d);
   }
-  function ke(e) {
+  function me(e) {
     if ($e(r.loadMore)) {
-      const { loadingKeys: t = [], loadedKeys: c } = o;
-      k((n) => {
-        const l = { ...n };
-        return l.loadingKeys = Array.from(/* @__PURE__ */ new Set([...t, e._key])), l.loadedKeys = c.filter((s) => s !== e._key), l;
-      }), I == null || I(K([e._key])[0]).then((n) => {
+      const { loadingKeys: n = [], loadedKeys: c } = a;
+      k((t) => {
+        const l = { ...t };
+        return l.loadingKeys = Array.from(/* @__PURE__ */ new Set([...n, e._key])), l.loadedKeys = c.filter((s) => s !== e._key), l;
+      }), I == null || I(K([e._key])[0]).then((t) => {
         k((l) => {
           const s = { ...l };
           return s.loadingKeys = l.loadingKeys.filter((d) => d !== e._key), s.loadedKeys = Array.from(/* @__PURE__ */ new Set([...l.loadedKeys, e._key])), s;
-        }), R(!e.expanded, e._key);
-      }).catch((n) => {
+        }), W(!e.expanded, e._key);
+      }).catch((t) => {
         k((l) => {
           const s = { ...l };
           return s.loadingKeys = l.loadingKeys.filter((d) => d !== e._key), s;
-        }), console.error("[tree]load data error: ", n);
+        }), console.error("[tree]load data error: ", t);
       }).finally(() => {
       });
     }
   }
-  function me(e, t) {
-    _.current = K([t._key])[0], T.current = 0;
+  function xe(e, n) {
+    b.current = K([n._key])[0], T.current = 0;
     const { onDragStart: c } = r;
-    c == null || c(e, K([t._key])[0]);
+    c == null || c(e, K([n._key])[0]);
   }
-  function xe(e, t) {
-    _.current = null, T.current = 0;
+  function ge(e, n) {
+    b.current = null, T.current = 0;
     const { onDragEnd: c } = r;
-    c == null || c(e, K([t._key])[0]);
+    c == null || c(e, K([n._key])[0]);
   }
-  function ge(e, t, c) {
+  function Ce(e, n, c) {
     T.current = c;
-    const { onDragOver: n } = r;
-    n == null || n(e, K([t._key])[0]);
+    const { onDragOver: t } = r;
+    t == null || t(e, K([n._key])[0]);
   }
-  function Ce(e, t) {
+  function Ne(e, n) {
     T.current = 0;
     const { onDragLeave: c } = r;
-    c == null || c(e, K([t._key])[0]);
+    c == null || c(e, K([n._key])[0]);
   }
-  function Ne(e, t) {
+  function _e(e, n) {
     let c = f.current[e.parentKey];
     for (; c; ) {
-      const { _key: n, parentKey: l } = c;
-      if (n === t.props._key)
+      const { _key: t, parentKey: l } = c;
+      if (t === n.props._key)
         return !0;
-      if (l === n)
+      if (l === t)
         return;
       c = f.current[l];
     }
   }
-  function J(e, t) {
-    if (e === void 0 || t === void 0)
+  function Q(e, n) {
+    if (e === void 0 || n === void 0)
       return !1;
-    if (e === t)
+    if (e === n)
       return !0;
-    const c = e.key, n = t.key;
-    if (c !== void 0 || n !== void 0)
-      return c === n;
-    const l = e.props._key, s = t.props._key;
+    const c = e.key, t = n.key;
+    if (c !== void 0 || t !== void 0)
+      return c === t;
+    const l = e.props._key, s = n.props._key;
     return l === void 0 && s === void 0 ? !1 : l === s;
   }
-  function Q(e, t, c) {
-    if (_.current) {
-      const { allowDrop: n } = C(), { onDrop: l } = r, s = K([t._key])[0];
-      if (l && !Ne(t, _.current) && !J(_.current, s)) {
-        if (n && !n({
+  function X(e, n, c) {
+    if (b.current) {
+      const { allowDrop: t } = C(), { onDrop: l } = r, s = K([n._key])[0];
+      if (l && !_e(n, b.current) && !Q(b.current, s)) {
+        if (t && !t({
           dropNode: s,
-          dragNode: _.current,
+          dragNode: b.current,
           dropPosition: c
         }))
           return;
         l({
-          dragNode: _.current,
+          dragNode: b.current,
           dropNode: s,
           dropPosition: c,
           e
@@ -335,147 +339,147 @@ function Ge(r, ue) {
       }
     }
   }
-  function X(e, t) {
+  function Y(e, n) {
     const { allowDrop: c } = C();
-    let n = !0;
-    return typeof c == "function" && (n = c({
+    let t = !0;
+    return typeof c == "function" && (t = c({
       dropNode: K([e._key])[0],
-      dragNode: _.current,
-      dropPosition: t
-    })), n;
+      dragNode: b.current,
+      dropPosition: n
+    })), t;
   }
-  function R(e, t) {
-    const { currentExpandKeys: c, expandedKeys: n = [] } = o, { animation: l } = C(), { onExpand: s } = r;
-    if (c.indexOf(t) > -1)
+  function W(e, n) {
+    const { currentExpandKeys: c, expandedKeys: t = [] } = a, { animation: l } = C(), { onExpand: s } = r;
+    if (c.indexOf(n) > -1)
       return;
     let d = [];
-    e ? d = Array.from(/* @__PURE__ */ new Set([...n, t])) : d = n.filter((i) => i !== t), "expandedKeys" in r || k((i) => {
+    e ? d = Array.from(/* @__PURE__ */ new Set([...t, n])) : d = t.filter((i) => i !== n), "expandedKeys" in r || k((i) => {
       const y = { ...i };
-      return y.expandedKeys = d, y.currentExpandKeys = l ? [...c, t] : [], y;
+      return y.expandedKeys = d, y.currentExpandKeys = l ? [...c, n] : [], y;
     }), s == null || s(d, {
       expanded: e,
-      node: K([t])[0],
+      node: K([n])[0],
       expandedNodes: K(d)
     });
   }
   function K(e) {
-    const { __PqbAdapterMode__: t } = r;
+    const { __PqbAdapterMode__: n } = r;
     return A(
-      [].concat(e).map((n) => f.current[n]).filter(Boolean)
-    ).map((n) => t ? {
-      props: n,
+      [].concat(e).map((t) => f.current[t]).filter(Boolean)
+    ).map((t) => n ? {
+      props: t,
       key: e
-    } : /* @__PURE__ */ Ie(de, { ...n, key: n.key }));
+    } : /* @__PURE__ */ Ie(ie, { ...t, key: t.key }));
   }
   function j(e) {
     return {
-      expandedKeysSet: (e == null ? void 0 : e.expandedKeysSet) || new Set((o == null ? void 0 : o.expandedKeys) || []),
-      checkedKeysSet: (e == null ? void 0 : e.checkedKeysSet) || new Set((o == null ? void 0 : o.checkedKeys) || []),
-      selectedKeysSet: (e == null ? void 0 : e.selectedKeysSet) || new Set((o == null ? void 0 : o.selectedKeys) || []),
-      halfCheckedKeysSet: (e == null ? void 0 : e.halfCheckedKeysSet) || new Set((o == null ? void 0 : o.halfCheckedKeys) || [])
+      expandedKeysSet: (e == null ? void 0 : e.expandedKeysSet) || new Set((a == null ? void 0 : a.expandedKeys) || []),
+      checkedKeysSet: (e == null ? void 0 : e.checkedKeysSet) || new Set((a == null ? void 0 : a.checkedKeys) || []),
+      selectedKeysSet: (e == null ? void 0 : e.selectedKeysSet) || new Set((a == null ? void 0 : a.selectedKeys) || []),
+      halfCheckedKeysSet: (e == null ? void 0 : e.halfCheckedKeysSet) || new Set((a == null ? void 0 : a.halfCheckedKeys) || [])
     };
   }
-  function A(e, t) {
-    const { autoExpandParent: c } = C(), { loadMore: n } = r, {
+  function A(e, n) {
+    const { autoExpandParent: c } = C(), { loadMore: t } = r, {
       selectedKeys: l,
       expandedKeys: s,
       checkedKeys: d,
       loadingKeys: i = [],
       loadedKeys: y = []
-    } = o, {
-      expandedKeysSet: m,
-      checkedKeysSet: a,
-      selectedKeysSet: x,
-      halfCheckedKeysSet: h
-    } = j(t), N = (u) => {
-      const L = u.children && u.children.length, P = {
-        isLeaf: !L,
-        autoExpandParent: L ? c : !1,
-        expanded: m ? m.has(u._key) : s.indexOf(u._key) > -1
+    } = a, {
+      expandedKeysSet: _,
+      checkedKeysSet: u,
+      selectedKeysSet: w,
+      halfCheckedKeysSet: m
+    } = j(n), x = (o) => {
+      const h = o.children && o.children.length, D = {
+        isLeaf: !h,
+        autoExpandParent: h ? c : !1,
+        expanded: _ ? _.has(o._key) : s.indexOf(o._key) > -1
       };
-      if (n) {
-        const b = y.indexOf(u._key) > -1;
-        P.loaded = b, P.isLeaf = L ? !1 : u.isLeaf;
+      if (t) {
+        const N = y.indexOf(o._key) > -1;
+        D.loaded = N, D.isLeaf = h ? !1 : o.isLeaf;
       }
       return {
-        ...u,
-        ...P,
-        selected: x.has(u._key),
-        indeterminated: h.has(u._key),
-        loading: i.indexOf(u._key) > -1,
-        checked: a.has(u._key),
+        ...o,
+        ...D,
+        selected: w.has(o._key),
+        indeterminated: m.has(o._key),
+        loading: i.indexOf(o._key) > -1,
+        checked: u.has(o._key),
         selectedKeys: l,
         checkedKeys: d,
         loadingKeys: i,
         loadedKeys: y,
         expandedKeys: s,
-        childrenData: u.children || [],
+        childrenData: o.children || [],
         children: null
       };
     };
-    return He(e) ? e.map((u) => N(u)) : N(e);
+    return He(e) ? e.map((o) => x(o)) : x(e);
   }
-  function Y(e) {
-    k((t) => {
-      const c = { ...t }, { currentExpandKeys: n } = t;
-      return n.indexOf(e) > -1 && (c.currentExpandKeys = n.filter((l, s, d) => l !== e)), c;
+  function Z(e) {
+    k((n) => {
+      const c = { ...n }, { currentExpandKeys: t } = n;
+      return t.indexOf(e) > -1 && (c.currentExpandKeys = t.filter((l, s, d) => l !== e)), c;
     });
   }
-  function Z() {
-    return o;
+  function p() {
+    return a;
   }
-  Ae(ue, () => ({
-    scrollIntoView: fe,
-    handleCheck: G,
-    getTreeState: Z,
-    handleExpandEnd: Y,
+  Ae(fe, () => ({
+    scrollIntoView: he,
+    handleCheck: J,
+    getTreeState: p,
+    handleExpandEnd: Z,
     getNodeProps: A,
     getDataSet: j,
     getCacheNode: K,
-    handleExpand: R,
-    handleAllowDrop: X,
-    handleNodeDrop: Q,
-    isSameNode: J
-  })), z(() => {
-    const e = q.current, t = C(e), c = C();
-    if (e !== r || !E(t, c)) {
-      const n = {};
-      if (he(
-        { prevMergedProps: t, ...e },
+    handleExpand: W,
+    handleAllowDrop: Y,
+    handleNodeDrop: X,
+    isSameNode: Q
+  })), B(() => {
+    const e = U.current, n = C(e), c = C();
+    if (e !== r || !L(n, c)) {
+      const t = {};
+      if (Ke(
+        { prevMergedProps: n, ...e },
         { ...c, ...r }
       )) {
         const s = H(), d = $(s);
-        n.treeData = s, n.nodeList = d;
+        t.treeData = s, t.nodeList = d;
       }
-      if (n.treeData || "checkedKeys" in r && !E(e == null ? void 0 : e.checkedKeys, r.checkedKeys)) {
-        const s = "checkedKeys" in r ? r.checkedKeys : o.checkedKeys, { halfCheckedKeys: d, checkedKeys: i } = W(
+      if (t.treeData || "checkedKeys" in r && !L(e == null ? void 0 : e.checkedKeys, r.checkedKeys)) {
+        const s = "checkedKeys" in r ? r.checkedKeys : a.checkedKeys, { halfCheckedKeys: d, checkedKeys: i } = R(
           s || []
         );
-        E(i, o.checkedKeys) || (n.checkedKeys = i), E(d, o.halfCheckedKeys) || (n.halfCheckedKeys = d);
+        L(i, a.checkedKeys) || (t.checkedKeys = i), L(d, a.halfCheckedKeys) || (t.halfCheckedKeys = d);
       }
-      r.checkStrictly && "halfCheckedKeys" in r && !E(e == null ? void 0 : e.halfCheckedKeys, r.halfCheckedKeys) && (n.halfCheckedKeys = r.halfCheckedKeys), "expandedKeys" in r && !E(r.expandedKeys, e == null ? void 0 : e.expandedKeys) && (n.expandedKeys = r.expandedKeys, n.currentExpandKeys = c.animation ? [...n.expandedKeys ?? [], ...o.expandedKeys ?? []].reduce((s, d) => {
+      r.checkStrictly && "halfCheckedKeys" in r && !L(e == null ? void 0 : e.halfCheckedKeys, r.halfCheckedKeys) && (t.halfCheckedKeys = r.halfCheckedKeys), "expandedKeys" in r && !L(r.expandedKeys, e == null ? void 0 : e.expandedKeys) && (t.expandedKeys = r.expandedKeys, t.currentExpandKeys = c.animation ? [...t.expandedKeys ?? [], ...a.expandedKeys ?? []].reduce((s, d) => {
         const i = s.indexOf(d);
         return i === -1 ? s.push(d) : s.splice(i, 1), s;
       }, []).filter((s, d, i) => {
         var y;
         if (f.current[s])
-          return f.current[s].pathParentKeys.some((a) => i.indexOf(a) > -1) ? !1 : (y = f.current[s].children) == null ? void 0 : y.length;
+          return f.current[s].pathParentKeys.some((u) => i.indexOf(u) > -1) ? !1 : (y = f.current[s].children) == null ? void 0 : y.length;
       }) : []);
-      const l = n.currentExpandKeys || o.currentExpandKeys;
-      n.treeData && l && (n.currentExpandKeys = l.filter((s) => {
-        const d = n.treeData.find((i) => i.key === s);
+      const l = t.currentExpandKeys || a.currentExpandKeys;
+      t.treeData && l && (t.currentExpandKeys = l.filter((s) => {
+        const d = t.treeData.find((i) => i.key === s);
         return d && d.children && d.children.length;
-      })), Object.keys(n).length && k((s) => ({ ...s, ...n }));
+      })), Object.keys(t).length && k((s) => ({ ...s, ...t }));
     }
-    return q.current = r, () => {
+    return U.current = r, () => {
     };
-  }), z(() => ("selectedKeys" in r && !E(r.selectedKeys, o.selectedKeys) && k((e) => {
-    const t = { ...e };
-    return t.selectedKeys = r.selectedKeys || [], t;
+  }), B(() => ("selectedKeys" in r && !L(r.selectedKeys, a.selectedKeys) && k((e) => {
+    const n = { ...e };
+    return n.selectedKeys = r.selectedKeys || [], n;
   }), () => {
-  }), [r.selectedKeys, o.selectedKeys]), z(() => {
+  }), [r.selectedKeys, a.selectedKeys]), B(() => {
     var l;
-    const e = H(), t = $(e, (l = g.getPrefixCls) == null ? void 0 : l.call(g, "tree")), { checkedKeys: c, halfCheckedKeys: n } = W(
+    const e = H(), n = $(e, (l = g.getPrefixCls) == null ? void 0 : l.call(g, "tree")), { checkedKeys: c, halfCheckedKeys: t } = R(
       r.checkedKeys || r.defaultCheckedKeys || []
     );
     return k((s) => {
@@ -484,95 +488,95 @@ function Ge(r, ue) {
         ...d,
         selectedKeys: r.selectedKeys || r.defaultSelectedKeys || [],
         checkedKeys: c,
-        halfCheckedKeys: n,
-        expandedKeys: V(
+        halfCheckedKeys: t,
+        expandedKeys: G(
           r.expandedKeys || r.defaultExpandedKeys
         ),
         loadedKeys: [],
         loadingKeys: [],
         currentExpandKeys: [],
-        nodeList: t
+        nodeList: n
       }, d;
     }), () => {
     };
   }, []);
   const {
-    className: _e,
-    showLine: be,
-    size: p,
-    virtualListProps: ee,
+    className: be,
+    showLine: De,
+    size: ee,
+    virtualListProps: te,
     height: ne,
-    style: De,
-    icons: Ee,
-    actionOnClick: Le,
-    animation: te
-  } = C(), { loadMore: I, checkable: we } = r, ce = ee ? {
+    style: Ee,
+    icons: Le,
+    actionOnClick: we,
+    animation: ce
+  } = C(), { loadMore: I, checkable: Oe } = r, re = te ? {
     threshold: 100,
-    ...ee
+    ...te
   } : ne ? { height: ne, threshold: 100 } : {
     threshold: null
-  }, { getPrefixCls: F, rtl: Oe } = g, O = F == null ? void 0 : F("tree");
-  return /* @__PURE__ */ re(
-    Re.Provider,
+  }, { getPrefixCls: F, rtl: Pe } = g, P = F == null ? void 0 : F("tree");
+  return /* @__PURE__ */ se(
+    We.Provider,
     {
       value: {
-        icons: Ee,
-        animation: te,
+        icons: Le,
+        animation: ce,
         key2nodeProps: f.current,
-        getFieldInfo: U,
-        getTreeState: Z,
+        getFieldInfo: V,
+        getTreeState: p,
         getNodeProps: A,
-        onExpandEnd: te ? Y : () => {
+        onExpandEnd: ce ? Z : () => {
         },
-        onSelect: Ke,
-        onCheck: G,
-        onNodeDragStart: me,
-        onNodeDragEnd: xe,
-        onNodeDragLeave: Ce,
-        onNodeDragOver: ge,
-        onNodeDrop: Q,
-        onExpand: R,
+        onSelect: ke,
+        onCheck: J,
+        onNodeDragStart: xe,
+        onNodeDragEnd: ge,
+        onNodeDragLeave: Ne,
+        onNodeDragOver: Ce,
+        onNodeDrop: X,
+        onExpand: W,
         renderExtra: r.renderExtra,
         renderTitle: r.renderTitle,
-        loadMore: I && ke,
-        allowDrop: X,
-        actionOnClick: Le,
-        virtualListProps: ce,
-        onNodeClick(e, t, c) {
-          var n;
-          (n = r.onNodeClick) == null || n.call(r, e, t, c);
+        loadMore: I && me,
+        allowDrop: Y,
+        actionOnClick: we,
+        virtualListProps: re,
+        onNodeSelect(e, n, c) {
+          var t;
+          (t = r.onNodeSelect) == null || t.call(r, e, n, c);
         }
       },
-      children: /* @__PURE__ */ re(
+      children: /* @__PURE__ */ se(
         je,
         {
           ref: (e) => {
             M.current = e;
           },
-          className: le(
-            O,
+          className: de(
+            P,
             {
-              [`${O}-checkable`]: we,
-              [`${O}-show-line`]: be,
-              [`${O}-size-${p}`]: p,
-              [`${O}-rtl`]: Oe
+              [`${P}-checkable`]: Oe,
+              [`${P}-show-line`]: De,
+              [`${P}-size-${ee}`]: ee,
+              [`${P}-rtl`]: Pe
             },
-            _e
+            be
           ),
-          style: De,
+          style: Ee,
           filterNode: r.filterNode,
-          virtualListProps: ce,
-          expandedKeys: o.expandedKeys,
-          currentExpandKeys: o.currentExpandKeys,
+          virtualListProps: re,
+          expandedKeys: a.expandedKeys,
+          currentExpandKeys: a.currentExpandKeys,
           getNodeProps: A,
           getDataSet: j,
-          nodeList: o.nodeList,
+          nodeList: a.nodeList,
           onMouseDown: r.onMouseDown,
           ariaProps: {
             role: "tree",
             "aria-multiselectable": r.multiple,
             tabIndex: 0,
-            ...We(r)
+            ...Re(r)
           }
         }
       )
@@ -584,10 +588,10 @@ const v = Se(
 );
 v.displayName = "Tree";
 v.SHOW_PARENT = oe;
-v.SHOW_ALL = ae;
-v.SHOW_CHILD = ye;
-v.Node = de;
+v.SHOW_ALL = ye;
+v.SHOW_CHILD = ue;
+v.Node = ie;
 export {
-  de as TreeNode,
+  ie as TreeNode,
   v as default
 };