@unicom-cloud/ui 0.8.95 → 0.8.97

package/tree/Tree.js

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