@unicom-cloud/ui 0.8.122 → 0.8.123

package/tree/Tree.js

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