@unicom-cloud/ui 0.8.108 → 0.8.109

package/tree/Tree.js

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