@unicom-cloud/ui 0.8.93 → 0.8.94

package/tree/Tree.js

@@ -1,5 +1,5 @@
 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 { forwardRef as ve, useContext as Se, useRef as v, useState as Te, useImperativeHandle as Ae, useEffect as B, createElement as Ie } from "react";
 import { isEmptyObject as Me } from "@unicom-cloud/utils/is";
 import E from "lodash/get";
 import q from "lodash/has";
@@ -15,7 +15,7 @@ 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 ae = {
+const oe = {
   key: "key",
   title: "title",
   children: "children",
@@ -24,13 +24,13 @@ const ae = {
   disableCheckbox: "disableCheckbox",
   checkable: "checkable",
   isLeaf: "isLeaf"
-}, oe = "parent", ye = "all", ue = "child", Ue = {
+}, ae = "parent", ye = "all", ue = "child", Ue = {
   selectable: !0,
   autoExpandParent: !0,
   checkedStrategy: ye,
   actionOnClick: "select",
   allowDrop: () => !0,
-  fieldNames: ae,
+  fieldNames: oe,
   animation: !0
 }, Ve = [
   "style",
@@ -49,18 +49,18 @@ const ae = {
   "actionOnClick",
   "animation"
 ];
-function Ge(r, fe) {
-  const C = ve(qe), U = S(null), f = S({}), b = S(), T = S(), M = S(), [o, m] = Te(() => {
-    var s;
-    const e = H(), n = $(e, (s = C.getPrefixCls) == null ? void 0 : s.call(C, "tree")), { checkedKeys: c, halfCheckedKeys: t } = R(
-      r.checkedKeys || r.defaultCheckedKeys || []
+function Ge(s, fe) {
+  const g = Se(qe), U = v(null), f = v({}), b = v(), T = v(), M = v(), [o, k] = Te(() => {
+    var l;
+    const e = H(), n = $(e, (l = g.getPrefixCls) == null ? void 0 : l.call(g, "tree")), { checkedKeys: c, halfCheckedKeys: t } = R(
+      s.checkedKeys || s.defaultCheckedKeys || []
     );
     return {
-      selectedKeys: r.selectedKeys || r.defaultSelectedKeys || [],
+      selectedKeys: s.selectedKeys || s.defaultSelectedKeys || [],
       checkedKeys: c,
       halfCheckedKeys: t,
       expandedKeys: G(
-        r.expandedKeys || r.defaultExpandedKeys
+        s.expandedKeys || s.defaultExpandedKeys
       ),
       loadedKeys: [],
       loadingKeys: [],
@@ -68,11 +68,11 @@ function Ge(r, fe) {
       nodeList: n
     };
   });
-  function N(e) {
-    const { componentConfig: n } = C ?? {}, c = e || r, t = (n == null ? void 0 : n.Tree) || {}, s = {};
-    return Ve.forEach((l) => {
-      le(c[l]) ? le(t[l]) ? s[l] = Ue[l] : s[l] = t[l] : s[l] = c[l];
-    }), s;
+  function _(e) {
+    const { componentConfig: n } = g ?? {}, c = e || s, t = (n == null ? void 0 : n.Tree) || {}, l = {};
+    return Ve.forEach((r) => {
+      le(c[r]) ? le(t[r]) ? l[r] = Ue[r] : l[r] = t[r] : l[r] = c[r];
+    }), l;
   }
   function he(e, n) {
     let c = e;
@@ -82,7 +82,7 @@ function Ge(r, fe) {
     );
   }
   function H() {
-    return "treeData" in r ? r.treeData : Fe(r.children);
+    return "treeData" in s ? s.treeData : Fe(s.children);
   }
   function Ke(e, n) {
     const c = [
@@ -99,71 +99,71 @@ function Ge(r, fe) {
     return e.treeData !== n.treeData || e.children !== n.children || c.some((t) => L(e[t], n[t]));
   }
   function V(e) {
-    const n = N(), { selectable: c } = n, t = {
-      ...ae,
-      ..."treeData" in r ? n.fieldNames : {}
-    }, s = {
+    const n = _(), { selectable: c } = n, t = {
+      ...oe,
+      ..."treeData" in s ? n.fieldNames : {}
+    }, l = {
       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,
+      checkable: q(e, t.checkable) ? E(e, t.checkable) : s.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 q(e, t.key) || delete s.key, s;
+    return q(e, t.key) || delete l.key, l;
   }
   function $(e, n) {
-    var i;
+    var y;
     f.current = {};
-    const c = n || ((i = C.getPrefixCls) == null ? void 0 : i.call(C, "tree")), t = [];
-    let s = 0;
-    const { showLine: l, blockNode: d } = N(), a = (k, u) => {
-      const w = k.length;
-      return k.map((x, g) => {
+    const c = n || ((y = g.getPrefixCls) == null ? void 0 : y.call(g, "tree")), t = [];
+    let l = 0;
+    const { showLine: r, blockNode: i } = _(), d = (C, u) => {
+      const w = C.length;
+      return C.map((m, x) => {
         const {
-          children: y,
+          children: a,
           selectable: h,
           checkable: D,
-          key: _ = `${(u == null ? void 0 : u._key) || ""}-${g}`,
+          key: N = `${(u == null ? void 0 : u._key) || ""}-${x}`,
           ...z
-        } = V(x), O = {
+        } = V(m), O = {
           // data 中含有 dataRef 时，优先级较高
-          dataRef: x,
-          draggable: r.draggable,
+          dataRef: m,
+          draggable: s.draggable,
           selectable: h,
           checkable: D,
-          showLine: l,
-          blockNode: d,
-          ...x,
+          showLine: r,
+          blockNode: i,
+          ...m,
           ...z,
-          key: _,
-          children: y,
-          _key: _,
-          _index: s++,
+          key: N,
+          children: a,
+          _key: N,
+          _index: l++,
           parentKey: u ? u._key : void 0,
           pathParentKeys: u && u.pathParentKeys || [],
           _level: u._level || 0,
           // 保存node在sowLine模式下是否显示缩进线。如果父节点是其所在层级的最后一个节点，那么所有的子节点（包括孙子节点等）在父节点所在层级的缩进格都不显示缩进线。
           _lineless: u && u._lineless ? [...u._lineless || [], u._isTail] : []
         };
-        return w === g + 1 && (O.className = de(
+        return w === x + 1 && (O.className = de(
           `${c}-node-is-tail`,
           O.className
-        )), t.push(O), f.current[_] = O, y && y.length && (f.current[_].children = a(y, {
-          _key: _,
+        )), t.push(O), f.current[N] = O, a && a.length && (f.current[N].children = d(a, {
+          _key: N,
           _level: O._level + 1,
           _lineless: O._lineless,
-          _isTail: w === g + 1,
-          pathParentKeys: [...(u == null ? void 0 : u.pathParentKeys) || [], _]
+          _isTail: w === x + 1,
+          pathParentKeys: [...(u == null ? void 0 : u.pathParentKeys) || [], N]
         })), O;
       });
     };
-    return a(e || [], {}), t;
+    return d(e || [], {}), t;
   }
   function G(e) {
-    if (!N().autoExpandParent)
+    if (!_().autoExpandParent)
       return e || [];
     if (!e)
       return Object.keys(f.current).filter((c) => {
@@ -173,13 +173,13 @@ function Ge(r, fe) {
     const n = {};
     return e.forEach((c) => {
       const t = f.current[c];
-      t && (n[c] = 1, t.pathParentKeys && t.pathParentKeys.forEach((s) => {
-        n[s] = 1;
+      t && (n[c] = 1, t.pathParentKeys && t.pathParentKeys.forEach((l) => {
+        n[l] = 1;
       }));
     }), Object.keys(n);
   }
   function R(e) {
-    if (!r.checkStrictly) {
+    if (!s.checkStrictly) {
       const { checkedKeys: n, indeterminateKeys: c } = ze(
         e,
         f.current
@@ -191,88 +191,92 @@ function Ge(r, fe) {
     }
     return {
       checkedKeys: e,
-      halfCheckedKeys: r.halfCheckedKeys || []
+      halfCheckedKeys: s.halfCheckedKeys || []
     };
   }
   function ke(e, n) {
-    var l, d;
-    const { onSelect: c } = r, t = (l = f.current[e]) == null ? void 0 : l.dataRef, s = {
+    var i;
+    const { onSelect: c, onNodeSelect: t } = s, l = (i = f.current[e]) == null ? void 0 : i.dataRef, r = {
       e: n,
-      data: t,
+      data: l,
       // 潘启宝添加
-      node: K([e])[0]
+      node: K([e])[0],
+      selected: !1,
+      selectedNodes: []
     };
-    if (r.multiple) {
-      const a = [...o.selectedKeys], i = a.indexOf(e);
-      i > -1 ? (a.splice(i, 1), s.selected = !1) : (s.selected = !0, a.push(e)), s.selectedNodes = K(a), "selectedKeys" in r || m((k) => {
-        const u = { ...k };
-        return u.selectedKeys = a, u;
-      }), c == null || c(a, s);
+    if (s.multiple) {
+      const d = [...o.selectedKeys], y = d.indexOf(e);
+      y > -1 ? (d.splice(y, 1), r.selected = !1) : (r.selected = !0, d.push(e)), r.selectedNodes = K(d), "selectedKeys" in s || k((C) => {
+        const u = { ...C };
+        return u.selectedKeys = d, u;
+      }), c == null || c(d, r);
     } else
-      s.selected = !0, s.selectedNodes = K([e]), "selectedKeys" in r || m((a) => {
-        const i = { ...a };
-        return i.selectedKeys = [e], i;
-      }), c == null || c([e], s);
-    (d = r.onNodeSelect) == null || d.call(r, e, t, s);
+      r.selected = !0, r.selectedNodes = K([e]), "selectedKeys" in s || k((d) => {
+        const y = { ...d };
+        return y.selectedKeys = [e], y;
+      }), c == null || c([e], r);
+    t == null || t(e, l, r);
   }
   function J(e, n, c) {
-    var u, w;
-    const { checkedStrategy: t } = N(), { onCheck: s, checkStrictly: l } = r, d = (u = f.current[n]) == null ? void 0 : u.dataRef, a = { e: c, node: K([n])[0] };
-    let i = [...o.checkedKeys || []], k = o.halfCheckedKeys;
+    var w;
+    const { checkedStrategy: t } = _(), { checkStrictly: l, onCheck: r, onNodeCheck: i } = s;
+    let d = [...o.checkedKeys || []], y = o.halfCheckedKeys;
     if (l) {
-      e ? i = i.concat(n) : i = i.filter((g) => g !== n);
-      const x = {};
-      "checkedKeys" in r || (x.checkedKeys = i), "halfCheckedKeys" in r || (x.halfCheckedKeys = k), Me(x) || m((g) => ({ ...g, ...x }));
+      e ? d = d.concat(n) : d = d.filter((x) => x !== n);
+      const m = {};
+      "checkedKeys" in s || (m.checkedKeys = d), "halfCheckedKeys" in s || (m.halfCheckedKeys = y), Me(m) || k((x) => ({ ...x, ...m }));
     } else {
-      const { checkedKeys: x, indeterminateKeys: g } = Be(
+      const { checkedKeys: m, indeterminateKeys: x } = Be(
         n,
         e,
-        i,
+        d,
         f.current,
-        k
+        y
       );
-      i = x, k = g, "checkedKeys" in r ? m((y) => {
-        const h = { ...y };
-        return h.halfCheckedKeys = k, h;
-      }) : m((y) => {
-        const h = { ...y };
-        return h.checkedKeys = i, h.halfCheckedKeys = k, h;
-      }), t === oe ? i = i.filter((y) => {
-        const h = f.current[y];
-        if (!h || i.indexOf(h.parentKey) === -1)
+      d = m, y = x, "checkedKeys" in s ? k((a) => {
+        const h = { ...a };
+        return h.halfCheckedKeys = y, h;
+      }) : k((a) => {
+        const h = { ...a };
+        return h.checkedKeys = d, h.halfCheckedKeys = y, h;
+      }), t === ae ? d = d.filter((a) => {
+        const h = f.current[a];
+        if (!h || d.indexOf(h.parentKey) === -1)
           return !0;
-      }) : t === ue && (i = i.filter((y) => {
-        var D, _;
-        const h = f.current[y];
-        if (!h || !((D = h.children) != null && D.length) || (_ = h.children) != null && _.every((z) => i.indexOf(z._key) === -1))
+      }) : t === ue && (d = d.filter((a) => {
+        var D, N;
+        const h = f.current[a];
+        if (!h || !((D = h.children) != null && D.length) || (N = h.children) != null && N.every((z) => d.indexOf(z._key) === -1))
           return !0;
       }));
     }
-    s == null || s(i, {
-      checkedNodes: K(i),
+    const C = (w = f.current[n]) == null ? void 0 : w.dataRef, u = {
+      checkedNodes: K(d),
       checked: e,
-      halfCheckedKeys: k,
-      halfCheckedNodes: K(k),
-      data: d,
+      halfCheckedKeys: y,
+      halfCheckedNodes: K(y),
+      data: C,
       // 潘启宝添加
-      ...a
-    }), (w = r.onNodeCheck) == null || w.call(r, n, d, a);
+      e: c,
+      node: K([n])[0]
+    };
+    r == null || r(d, u), i == null || i(n, C, u);
   }
   function me(e) {
-    if ($e(r.loadMore)) {
+    if ($e(s.loadMore)) {
       const { loadingKeys: n = [], loadedKeys: c } = o;
-      m((t) => {
-        const s = { ...t };
-        return s.loadingKeys = Array.from(/* @__PURE__ */ new Set([...n, e._key])), s.loadedKeys = c.filter((l) => l !== e._key), s;
+      k((t) => {
+        const l = { ...t };
+        return l.loadingKeys = Array.from(/* @__PURE__ */ new Set([...n, e._key])), l.loadedKeys = c.filter((r) => r !== e._key), l;
       }), I == null || I(K([e._key])[0]).then((t) => {
-        m((s) => {
-          const l = { ...s };
-          return l.loadingKeys = s.loadingKeys.filter((d) => d !== e._key), l.loadedKeys = Array.from(/* @__PURE__ */ new Set([...s.loadedKeys, e._key])), l;
+        k((l) => {
+          const r = { ...l };
+          return r.loadingKeys = l.loadingKeys.filter((i) => i !== e._key), r.loadedKeys = Array.from(/* @__PURE__ */ new Set([...l.loadedKeys, e._key])), r;
         }), W(!e.expanded, e._key);
       }).catch((t) => {
-        m((s) => {
-          const l = { ...s };
-          return l.loadingKeys = s.loadingKeys.filter((d) => d !== e._key), l;
+        k((l) => {
+          const r = { ...l };
+          return r.loadingKeys = l.loadingKeys.filter((i) => i !== e._key), r;
         }), console.error("[tree]load data error: ", t);
       }).finally(() => {
       });
@@ -280,33 +284,33 @@ function Ge(r, fe) {
   }
   function xe(e, n) {
     b.current = K([n._key])[0], T.current = 0;
-    const { onDragStart: c } = r;
+    const { onDragStart: c } = s;
     c == null || c(e, K([n._key])[0]);
   }
   function ge(e, n) {
     b.current = null, T.current = 0;
-    const { onDragEnd: c } = r;
+    const { onDragEnd: c } = s;
     c == null || c(e, K([n._key])[0]);
   }
-  function Ce(e, n, c) {
+  function _e(e, n, c) {
     T.current = c;
-    const { onDragOver: t } = r;
+    const { onDragOver: t } = s;
     t == null || t(e, K([n._key])[0]);
   }
-  function Ne(e, n) {
+  function Ce(e, n) {
     T.current = 0;
-    const { onDragLeave: c } = r;
+    const { onDragLeave: c } = s;
     c == null || c(e, K([n._key])[0]);
   }
-  function _e(e, n) {
+  function Ne(e, n) {
     let c = f.current[e.parentKey];
     for (; c; ) {
-      const { _key: t, parentKey: s } = c;
+      const { _key: t, parentKey: l } = c;
       if (t === n.props._key)
         return !0;
-      if (s === t)
+      if (l === t)
         return;
-      c = f.current[s];
+      c = f.current[l];
     }
   }
   function Q(e, n) {
@@ -317,22 +321,22 @@ function Ge(r, fe) {
     const c = e.key, t = n.key;
     if (c !== void 0 || t !== void 0)
       return c === t;
-    const s = e.props._key, l = n.props._key;
-    return s === void 0 && l === void 0 ? !1 : s === l;
+    const l = e.props._key, r = n.props._key;
+    return l === void 0 && r === void 0 ? !1 : l === r;
   }
   function X(e, n, c) {
     if (b.current) {
-      const { allowDrop: t } = N(), { onDrop: s } = r, l = K([n._key])[0];
-      if (s && !_e(n, b.current) && !Q(b.current, l)) {
+      const { allowDrop: t } = _(), { onDrop: l } = s, r = K([n._key])[0];
+      if (l && !Ne(n, b.current) && !Q(b.current, r)) {
         if (t && !t({
-          dropNode: l,
+          dropNode: r,
           dragNode: b.current,
           dropPosition: c
         }))
           return;
-        s({
+        l({
           dragNode: b.current,
-          dropNode: l,
+          dropNode: r,
           dropPosition: c,
           e
         });
@@ -340,7 +344,7 @@ function Ge(r, fe) {
     }
   }
   function Y(e, n) {
-    const { allowDrop: c } = N();
+    const { allowDrop: c } = _();
     let t = !0;
     return typeof c == "function" && (t = c({
       dropNode: K([e._key])[0],
@@ -349,21 +353,21 @@ function Ge(r, fe) {
     })), t;
   }
   function W(e, n) {
-    const { currentExpandKeys: c, expandedKeys: t = [] } = o, { animation: s } = N(), { onExpand: l } = r;
+    const { currentExpandKeys: c, expandedKeys: t = [] } = o, { animation: l } = _(), { onExpand: r } = s;
     if (c.indexOf(n) > -1)
       return;
-    let d = [];
-    e ? d = Array.from(/* @__PURE__ */ new Set([...t, n])) : d = t.filter((a) => a !== n), "expandedKeys" in r || m((a) => {
-      const i = { ...a };
-      return i.expandedKeys = d, i.currentExpandKeys = s ? [...c, n] : [], i;
-    }), l == null || l(d, {
+    let i = [];
+    e ? i = Array.from(/* @__PURE__ */ new Set([...t, n])) : i = t.filter((d) => d !== n), "expandedKeys" in s || k((d) => {
+      const y = { ...d };
+      return y.expandedKeys = i, y.currentExpandKeys = l ? [...c, n] : [], y;
+    }), r == null || r(i, {
       expanded: e,
       node: K([n])[0],
-      expandedNodes: K(d)
+      expandedNodes: K(i)
     });
   }
   function K(e) {
-    const { __PqbAdapterMode__: n } = r;
+    const { __PqbAdapterMode__: n } = s;
     return A(
       [].concat(e).map((t) => f.current[t]).filter(Boolean)
     ).map((t) => n ? {
@@ -380,49 +384,49 @@ function Ge(r, fe) {
     };
   }
   function A(e, n) {
-    const { autoExpandParent: c } = N(), { loadMore: t } = r, {
-      selectedKeys: s,
-      expandedKeys: l,
-      checkedKeys: d,
-      loadingKeys: a = [],
-      loadedKeys: i = []
+    const { autoExpandParent: c } = _(), { loadMore: t } = s, {
+      selectedKeys: l,
+      expandedKeys: r,
+      checkedKeys: i,
+      loadingKeys: d = [],
+      loadedKeys: y = []
     } = o, {
-      expandedKeysSet: k,
+      expandedKeysSet: C,
       checkedKeysSet: u,
       selectedKeysSet: w,
-      halfCheckedKeysSet: x
-    } = j(n), g = (y) => {
-      const h = y.children && y.children.length, D = {
+      halfCheckedKeysSet: m
+    } = j(n), x = (a) => {
+      const h = a.children && a.children.length, D = {
         isLeaf: !h,
         autoExpandParent: h ? c : !1,
-        expanded: k ? k.has(y._key) : l.indexOf(y._key) > -1
+        expanded: C ? C.has(a._key) : r.indexOf(a._key) > -1
       };
       if (t) {
-        const _ = i.indexOf(y._key) > -1;
-        D.loaded = _, D.isLeaf = h ? !1 : y.isLeaf;
+        const N = y.indexOf(a._key) > -1;
+        D.loaded = N, D.isLeaf = h ? !1 : a.isLeaf;
       }
       return {
-        ...y,
+        ...a,
         ...D,
-        selected: w.has(y._key),
-        indeterminated: x.has(y._key),
-        loading: a.indexOf(y._key) > -1,
-        checked: u.has(y._key),
-        selectedKeys: s,
-        checkedKeys: d,
-        loadingKeys: a,
-        loadedKeys: i,
-        expandedKeys: l,
-        childrenData: y.children || [],
+        selected: w.has(a._key),
+        indeterminated: m.has(a._key),
+        loading: d.indexOf(a._key) > -1,
+        checked: u.has(a._key),
+        selectedKeys: l,
+        checkedKeys: i,
+        loadingKeys: d,
+        loadedKeys: y,
+        expandedKeys: r,
+        childrenData: a.children || [],
         children: null
       };
     };
-    return He(e) ? e.map((y) => g(y)) : g(e);
+    return He(e) ? e.map((a) => x(a)) : x(e);
   }
   function Z(e) {
-    m((n) => {
+    k((n) => {
       const c = { ...n }, { currentExpandKeys: t } = n;
-      return t.indexOf(e) > -1 && (c.currentExpandKeys = t.filter((s, l, d) => s !== e)), c;
+      return t.indexOf(e) > -1 && (c.currentExpandKeys = t.filter((l, r, i) => l !== e)), c;
     });
   }
   function p() {
@@ -441,62 +445,62 @@ function Ge(r, fe) {
     handleNodeDrop: X,
     isSameNode: Q
   })), B(() => {
-    const e = U.current, n = N(e), c = N();
-    if (e !== r || !L(n, c)) {
+    const e = U.current, n = _(e), c = _();
+    if (e !== s || !L(n, c)) {
       const t = {};
       if (Ke(
         { prevMergedProps: n, ...e },
-        { ...c, ...r }
+        { ...c, ...s }
       )) {
-        const l = H(), d = $(l);
-        t.treeData = l, t.nodeList = d;
+        const r = H(), i = $(r);
+        t.treeData = r, t.nodeList = i;
       }
-      if (t.treeData || "checkedKeys" in r && !L(e == null ? void 0 : e.checkedKeys, r.checkedKeys)) {
-        const l = "checkedKeys" in r ? r.checkedKeys : o.checkedKeys, { halfCheckedKeys: d, checkedKeys: a } = R(
-          l || []
+      if (t.treeData || "checkedKeys" in s && !L(e == null ? void 0 : e.checkedKeys, s.checkedKeys)) {
+        const r = "checkedKeys" in s ? s.checkedKeys : o.checkedKeys, { halfCheckedKeys: i, checkedKeys: d } = R(
+          r || []
         );
-        L(a, o.checkedKeys) || (t.checkedKeys = a), L(d, o.halfCheckedKeys) || (t.halfCheckedKeys = d);
+        L(d, o.checkedKeys) || (t.checkedKeys = d), L(i, o.halfCheckedKeys) || (t.halfCheckedKeys = i);
       }
-      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 ?? [], ...o.expandedKeys ?? []].reduce((l, d) => {
-        const a = l.indexOf(d);
-        return a === -1 ? l.push(d) : l.splice(a, 1), l;
-      }, []).filter((l, d, a) => {
-        var i;
-        if (f.current[l])
-          return f.current[l].pathParentKeys.some((u) => a.indexOf(u) > -1) ? !1 : (i = f.current[l].children) == null ? void 0 : i.length;
+      s.checkStrictly && "halfCheckedKeys" in s && !L(e == null ? void 0 : e.halfCheckedKeys, s.halfCheckedKeys) && (t.halfCheckedKeys = s.halfCheckedKeys), "expandedKeys" in s && !L(s.expandedKeys, e == null ? void 0 : e.expandedKeys) && (t.expandedKeys = s.expandedKeys, t.currentExpandKeys = c.animation ? [...t.expandedKeys ?? [], ...o.expandedKeys ?? []].reduce((r, i) => {
+        const d = r.indexOf(i);
+        return d === -1 ? r.push(i) : r.splice(d, 1), r;
+      }, []).filter((r, i, d) => {
+        var y;
+        if (f.current[r])
+          return f.current[r].pathParentKeys.some((u) => d.indexOf(u) > -1) ? !1 : (y = f.current[r].children) == null ? void 0 : y.length;
       }) : []);
-      const s = t.currentExpandKeys || o.currentExpandKeys;
-      t.treeData && s && (t.currentExpandKeys = s.filter((l) => {
-        const d = t.treeData.find((a) => a.key === l);
-        return d && d.children && d.children.length;
-      })), Object.keys(t).length && m((l) => ({ ...l, ...t }));
+      const l = t.currentExpandKeys || o.currentExpandKeys;
+      t.treeData && l && (t.currentExpandKeys = l.filter((r) => {
+        const i = t.treeData.find((d) => d.key === r);
+        return i && i.children && i.children.length;
+      })), Object.keys(t).length && k((r) => ({ ...r, ...t }));
     }
-    return U.current = r, () => {
+    return U.current = s, () => {
     };
-  }), B(() => ("selectedKeys" in r && !L(r.selectedKeys, o.selectedKeys) && m((e) => {
+  }), B(() => ("selectedKeys" in s && !L(s.selectedKeys, o.selectedKeys) && k((e) => {
     const n = { ...e };
-    return n.selectedKeys = r.selectedKeys || [], n;
+    return n.selectedKeys = s.selectedKeys || [], n;
   }), () => {
-  }), [r.selectedKeys, o.selectedKeys]), B(() => {
-    var s;
-    const e = H(), n = $(e, (s = C.getPrefixCls) == null ? void 0 : s.call(C, "tree")), { checkedKeys: c, halfCheckedKeys: t } = R(
-      r.checkedKeys || r.defaultCheckedKeys || []
+  }), [s.selectedKeys, o.selectedKeys]), B(() => {
+    var l;
+    const e = H(), n = $(e, (l = g.getPrefixCls) == null ? void 0 : l.call(g, "tree")), { checkedKeys: c, halfCheckedKeys: t } = R(
+      s.checkedKeys || s.defaultCheckedKeys || []
     );
-    return m((l) => {
-      let d = { ...l };
-      return d = {
-        ...d,
-        selectedKeys: r.selectedKeys || r.defaultSelectedKeys || [],
+    return k((r) => {
+      let i = { ...r };
+      return i = {
+        ...i,
+        selectedKeys: s.selectedKeys || s.defaultSelectedKeys || [],
         checkedKeys: c,
         halfCheckedKeys: t,
         expandedKeys: G(
-          r.expandedKeys || r.defaultExpandedKeys
+          s.expandedKeys || s.defaultExpandedKeys
         ),
         loadedKeys: [],
         loadingKeys: [],
         currentExpandKeys: [],
         nodeList: n
-      }, d;
+      }, i;
     }), () => {
     };
   }, []);
@@ -510,12 +514,12 @@ function Ge(r, fe) {
     icons: Le,
     actionOnClick: we,
     animation: ce
-  } = N(), { loadMore: I, checkable: Oe } = r, re = te ? {
+  } = _(), { loadMore: I, checkable: Oe } = s, re = te ? {
     threshold: 100,
     ...te
   } : ne ? { height: ne, threshold: 100 } : {
     threshold: null
-  }, { getPrefixCls: F, rtl: Pe } = C, P = F == null ? void 0 : F("tree");
+  }, { getPrefixCls: F, rtl: Pe } = g, P = F == null ? void 0 : F("tree");
   return /* @__PURE__ */ se(
     We.Provider,
     {
@@ -532,12 +536,12 @@ function Ge(r, fe) {
         onCheck: J,
         onNodeDragStart: xe,
         onNodeDragEnd: ge,
-        onNodeDragLeave: Ne,
-        onNodeDragOver: Ce,
+        onNodeDragLeave: Ce,
+        onNodeDragOver: _e,
         onNodeDrop: X,
         onExpand: W,
-        renderExtra: r.renderExtra,
-        renderTitle: r.renderTitle,
+        renderExtra: s.renderExtra,
+        renderTitle: s.renderTitle,
         loadMore: I && me,
         allowDrop: Y,
         actionOnClick: we,
@@ -560,34 +564,34 @@ function Ge(r, fe) {
             be
           ),
           style: Ee,
-          filterNode: r.filterNode,
+          filterNode: s.filterNode,
           virtualListProps: re,
           expandedKeys: o.expandedKeys,
           currentExpandKeys: o.currentExpandKeys,
           getNodeProps: A,
           getDataSet: j,
           nodeList: o.nodeList,
-          onMouseDown: r.onMouseDown,
+          onMouseDown: s.onMouseDown,
           ariaProps: {
             role: "tree",
-            "aria-multiselectable": r.multiple,
+            "aria-multiselectable": s.multiple,
             tabIndex: 0,
-            ...Re(r)
+            ...Re(s)
           }
         }
       )
     }
   );
 }
-const v = Se(
+const S = ve(
   Ge
 );
-v.displayName = "Tree";
-v.SHOW_PARENT = oe;
-v.SHOW_ALL = ye;
-v.SHOW_CHILD = ue;
-v.Node = ie;
+S.displayName = "Tree";
+S.SHOW_PARENT = ae;
+S.SHOW_ALL = ye;
+S.SHOW_CHILD = ue;
+S.Node = ie;
 export {
   ie as TreeNode,
-  v as default
+  S as default
 };