@unicom-cloud/ui 0.8.154 → 0.8.156

package/tree/Tree.js

@@ -1,24 +1,24 @@
-/* 潘启宝 2026-04-03 14:07:06 星期五 */
-import { isArray as e, isEqualWith as t, isFunction as n, isNumber as r } from "../utils/is.js";
-import i from "../utils/className.js";
-import { pickDataAttributes as a } from "../utils/pick.js";
-import o from "../hooks/use-merge-props/index.js";
-import s from "../config-provider/context.js";
+/* 潘启宝 2026-04-14 16:51:07 星期二 */
+import { isArray as e, isArrayAndNotEmpty as t, isEqualWith as n, isFunction as r, isNumber as i } from "../utils/is.js";
+import a from "../utils/className.js";
+import { pickDataAttributes as o } from "../utils/pick.js";
+import s from "../hooks/use-merge-props/index.js";
+import c from "../config-provider/context.js";
 import "../config-provider/index.js";
-import { CHILDREN_NAME as c } from "../constant/index.js";
-import { TreeContext as l } from "./Context2.js";
-import u from "./Node.js";
-import ee from "./NodeList.js";
-import { getAllCheckedKeysByCheck as te, getCheckedKeysByInitKeys as d, getTreeDataFromTreeChildren as ne } from "./utils.js";
-import { createElement as f, forwardRef as re, useCallback as p, useContext as ie, useEffect as ae, useImperativeHandle as oe, useMemo as m, useRef as h, useState as g } from "react";
+import { CHILDREN_NAME as l } from "../constant/index.js";
+import { TreeContext as u } from "./Context2.js";
+import ee from "./Node.js";
+import te from "./NodeList.js";
+import { getAllCheckedKeysByCheck as d, getCheckedKeysByInitKeys as ne, getTreeDataFromTreeChildren as f } from "./utils.js";
+import { createElement as re, forwardRef as ie, useCallback as p, useContext as ae, useEffect as m, useImperativeHandle as oe, useMemo as h, useRef as g, useState as _ } from "react";
 import { jsx as se } from "react/jsx-runtime";
-import _ from "lodash/get";
-import v from "lodash/has";
+import v from "lodash/get";
+import y from "lodash/has";
 //#region components/pc/tree/Tree.tsx
 var ce = {
 	key: "key",
 	title: "title",
-	children: c,
+	children: l,
 	selectable: "selectable",
 	disabled: "disabled",
 	disableCheckbox: "disableCheckbox",
@@ -33,49 +33,49 @@ var ce = {
 	fieldNames: ce,
 	animation: !0
 };
-function ue(c, re) {
-	let { getPrefixCls: ue, componentConfig: y, rtl: de } = ie(s), fe = o(c, le, y?.Tree), b = "selectedKeys" in c, x = "checkedKeys" in c, S = "halfCheckedKeys" in c, pe = "expandedKeys" in c, C = "treeData" in c, { ___PqbAdapterMode___: me, className: he, showLine: w, size: ge, virtualListProps: _e, height: ve, style: ye, icons: be, actionOnClick: xe, animation: T, checkedStrategy: Se, autoExpandParent: Ce, allowDrop: E, selectable: we, fieldNames: Te, blockNode: Ee, expandedKeys: D, defaultExpandedKeys: De, selectedKeys: O, defaultSelectedKeys: Oe, checkedKeys: k, defaultCheckedKeys: ke, treeData: Ae, children: A, checkStrictly: j, halfCheckedKeys: je, renderExtra: Me, renderTitle: Ne, checkable: M, draggable: Pe, multiple: Fe, loadMore: N, filterNode: Ie, onMouseDown: Le, onExpand: Re, onSelect: ze, onNodeSelect: Be, onCheck: Ve, onNodeCheck: He, onDragStart: Ue, onDragEnd: We, onDragOver: Ge, onDragLeave: Ke, onDrop: qe, maxLevel: P } = fe, F = ue?.("tree"), Je = m(() => C ? Ae : ne(A), [
-		A,
-		C,
+function ue(l, ie) {
+	let { getPrefixCls: ue, componentConfig: b, rtl: de } = ae(c), fe = s(l, le, b?.Tree), x = "selectedKeys" in l, S = "checkedKeys" in l, C = "halfCheckedKeys" in l, pe = "expandedKeys" in l, w = "treeData" in l, { ___PqbAdapterMode___: me, className: he, showLine: ge, size: _e, virtualListProps: ve, height: T, style: ye, icons: be, actionOnClick: xe, animation: E, checkedStrategy: Se, autoExpandParent: Ce, allowDrop: D, selectable: we, fieldNames: Te, blockNode: Ee, expandedKeys: O, defaultExpandedKeys: De, selectedKeys: k, defaultSelectedKeys: Oe, checkedKeys: A, defaultCheckedKeys: ke, treeData: Ae, children: j, checkStrictly: M, halfCheckedKeys: je, renderExtra: Me, renderTitle: Ne, checkable: N, draggable: Pe, multiple: Fe, loadMore: P, filterNode: Ie, onMouseDown: Le, onExpand: Re, onSelect: ze, onNodeSelect: Be, onCheck: Ve, onNodeCheck: He, onDragStart: Ue, onDragEnd: We, onDragOver: Ge, onDragLeave: Ke, onDrop: qe, maxLevel: F } = fe, I = ue?.("tree"), Je = h(() => w ? Ae : f(j), [
+		j,
+		w,
 		Ae
-	]), I = p((e) => {
+	]), L = p((e) => {
 		let t = {
 			...ce,
-			...C ? Te : {}
+			...w ? Te : {}
 		}, n = {
-			children: v(e, t.children) ? _(e, t.children) : A,
-			selectable: v(e, t.selectable) ? _(e, t.selectable) : we,
-			checkable: v(e, t.checkable) ? _(e, t.checkable) : M,
-			title: _(e, t.title),
-			disabled: _(e, t.disabled),
-			disableCheckbox: _(e, t.disableCheckbox),
-			isLeaf: _(e, t.isLeaf),
-			key: _(e, t.key)
+			children: y(e, t.children) ? v(e, t.children) : j,
+			selectable: y(e, t.selectable) ? v(e, t.selectable) : we,
+			checkable: y(e, t.checkable) ? v(e, t.checkable) : N,
+			title: v(e, t.title),
+			disabled: v(e, t.disabled),
+			disableCheckbox: v(e, t.disableCheckbox),
+			isLeaf: v(e, t.isLeaf),
+			key: v(e, t.key)
 		};
-		return v(e, t.key) ? n.key = _(e, t.key) : delete n.key, n;
+		return y(e, t.key) ? n.key = v(e, t.key) : delete n.key, n;
 	}, [
-		M,
-		A,
+		N,
+		j,
 		Te,
-		C,
+		w,
 		we
 	]);
-	function L(e) {
-		return r(P) && r(e) && e > P - 1;
+	function R(e) {
+		return i(F) && i(e) && e > F - 1;
 	}
-	let Ye = p((t) => {
-		z.current = {};
-		let n = [], r = 0, a = (t, o) => {
-			let s = L(o._level), c = t.length;
-			return t.map((t, l) => {
-				let { children: u, selectable: ee, checkable: te, key: d = `${o?._key || ""}-${l}`, ...ne } = I(t), f = {
-					dataRef: t,
+	let Ye = p((e) => {
+		B.current = {};
+		let n = [], r = 0, i = (e, o) => {
+			let s = R(o._level), c = e.length;
+			return e.map((e, l) => {
+				let { children: u, selectable: ee, checkable: te, key: d = `${o?._key || ""}-${l}`, ...ne } = L(e), f = {
+					dataRef: e,
 					draggable: Pe,
 					selectable: ee,
 					checkable: te,
-					showLine: w,
+					showLine: ge,
 					blockNode: Ee,
-					...t,
+					...e,
 					...ne,
 					key: d,
 					children: u,
@@ -86,26 +86,26 @@ function ue(c, re) {
 					_level: o._level,
 					_lineless: o && o._lineless ? [...o._lineless || [], o._isTail] : []
 				};
-				return c === l + 1 && (f.className = i(`${F}-node-is-tail`, f.className)), n.push(f), z.current[d] = f, e(u) && u.length && !s ? z.current[d].children = a(u, {
+				return c === l + 1 && (f.className = a(`${I}-node-is-tail`, f.className)), n.push(f), B.current[d] = f, t(u) && !s ? B.current[d].children = i(u, {
 					_key: d,
 					_level: o._level + 1,
 					_lineless: f._lineless,
 					_isTail: c === l + 1,
 					pathParentKeys: [...o?.pathParentKeys || [], d]
-				}) : z.current[d].children = [], f;
+				}) : B.current[d].children = [], f;
 			});
 		};
-		return a(t || [], { _level: 0 }), n;
+		return i(e || [], { _level: 0 }), n;
 	}, [
 		Ee,
 		Pe,
+		L,
 		I,
-		F,
-		w,
-		P
-	]), R = p((e) => {
-		if (!j) {
-			let { checkedKeys: t, indeterminateKeys: n } = d(e, z.current);
+		ge,
+		F
+	]), z = p((e) => {
+		if (!M) {
+			let { checkedKeys: t, indeterminateKeys: n } = ne(e, B.current);
 			return {
 				checkedKeys: t,
 				halfCheckedKeys: n
@@ -115,42 +115,42 @@ function ue(c, re) {
 			checkedKeys: e,
 			halfCheckedKeys: je || []
 		};
-	}, [j, je]), z = h({}), B = h(null), V = h(null), H = h(null), Xe = m(() => {
+	}, [M, je]), B = g({}), V = g(null), H = g(null), U = g(null), Xe = h(() => {
 		let e = { threshold: null };
-		return e = _e ? {
+		return e = ve ? {
 			threshold: 100,
-			..._e
-		} : ve ? {
-			height: ve,
+			...ve
+		} : T ? {
+			height: T,
 			threshold: 100
 		} : { threshold: null }, e;
-	}, [ve, _e]), Ze = m(() => Ye(Je), [Ye, Je]), [U, W] = g(() => O || Oe || []), [G, K] = g(() => {
-		let { checkedKeys: e, halfCheckedKeys: t } = R(k || ke || []);
+	}, [T, ve]), Ze = h(() => Ye(Je), [Ye, Je]), [W, G] = _(() => k || Oe || []), [K, q] = _(() => {
+		let { checkedKeys: e, halfCheckedKeys: t } = z(A || ke || []);
 		return {
 			keys: e,
 			halfKeys: t
 		};
-	}), [q, Qe] = g(() => nt(D || De)), [J, $e] = g(() => []), [Y, et] = g(() => []), [X, Z] = g(() => []);
-	function tt(e, t) {
+	}), [J, Qe] = _(() => rt(O || De)), [Y, $e] = _(() => []), [X, et] = _(() => []), [Z, tt] = _(() => []);
+	function nt(e, t) {
 		let n = e;
-		t && (n = t._key), H.current && H.current.scrollIntoView(n, t || z.current[n]);
+		t && (n = t._key), U.current && U.current.scrollIntoView(n, t || B.current[n]);
 	}
-	function nt(t) {
+	function rt(t) {
 		if (!Ce) return t || [];
-		if (!t) return Object.keys(z.current).filter((e) => {
-			let { children: t } = z.current[e] ?? {};
+		if (!t) return Object.keys(B.current).filter((e) => {
+			let { children: t } = B.current[e] ?? {};
 			return t && t.length;
 		});
 		let n = {};
 		return t.forEach((t) => {
-			let r = z.current[t];
+			let r = B.current[t];
 			r && (n[t] = 1, e(r.pathParentKeys) && r.pathParentKeys.forEach((e) => {
 				n[e] = 1;
 			}));
 		}), Object.keys(n);
 	}
-	function rt(e, t) {
-		let n = z.current[e]?.dataRef, r = {
+	function it(e, t) {
+		let n = B.current[e]?.dataRef, r = {
 			e: t,
 			data: n,
 			node: Q([e])[0],
@@ -158,37 +158,37 @@ function ue(c, re) {
 			selectedNodes: []
 		};
 		if (Fe) {
-			let t = [...U], n = t.indexOf(e);
-			n > -1 ? (t.splice(n, 1), r.selected = !1) : (r.selected = !0, t.push(e)), r.selectedNodes = Q(t), b || W(t), ze?.(t, r);
-		} else r.selected = !0, r.selectedNodes = Q([e]), b || W([e]), ze?.([e], r);
+			let t = [...W], n = t.indexOf(e);
+			n > -1 ? (t.splice(n, 1), r.selected = !1) : (r.selected = !0, t.push(e)), r.selectedNodes = Q(t), x || G(t), ze?.(t, r);
+		} else r.selected = !0, r.selectedNodes = Q([e]), x || G([e]), ze?.([e], r);
 		Be?.(e, n, r);
 	}
-	function it(e, t, n) {
-		let r = [...G.keys || []], i = G.halfKeys;
-		if (j) r = e ? r.concat(t) : r.filter((e) => e !== t), x || K((e) => {
+	function at(e, t, n) {
+		let r = [...K.keys || []], i = K.halfKeys;
+		if (M) r = e ? r.concat(t) : r.filter((e) => e !== t), S || q((e) => {
 			let t = { ...e };
 			return t.keys = r, t;
-		}), S || K((e) => {
+		}), C || q((e) => {
 			let t = { ...e };
 			return t.halfKeys = i, t;
 		});
 		else {
-			let { checkedKeys: n, indeterminateKeys: a } = te(t, e, r, z.current, i);
-			r = n, i = a, K(x ? (e) => {
+			let { checkedKeys: n, indeterminateKeys: a } = d(t, e, r, B.current, i);
+			r = n, i = a, q(S ? (e) => {
 				let t = { ...e };
 				return t.halfKeys = i, t;
 			} : (e) => {
 				let t = { ...e };
 				return t.keys = r, t.halfKeys = i, t;
 			}), Se === "parent" ? r = r.filter((e) => {
-				let t = z.current[e];
+				let t = B.current[e];
 				if (!t || !r.includes(t.parentKey)) return !0;
 			}) : Se === "child" && (r = r.filter((e) => {
-				let t = z.current[e];
+				let t = B.current[e];
 				if (!t || !t.children?.length || t.children?.every?.((e) => !r.includes(e._key))) return !0;
 			}));
 		}
-		let a = z.current[t]?.dataRef, o = {
+		let a = B.current[t]?.dataRef, o = {
 			checkedNodes: Q(r),
 			checked: e,
 			halfCheckedKeys: i,
@@ -199,39 +199,39 @@ function ue(c, re) {
 		};
 		Ve?.(r, o), He?.(t, a, o);
 	}
-	function at(e) {
-		if (L(e._level)) {
-			console.warn(`[Tree] Cannot load more: reached max level ${P}`);
+	function ot(e) {
+		if (R(e._level)) {
+			console.warn(`[Tree] Cannot load more: reached max level ${F}`);
 			return;
 		}
-		n(N) && (Z(Array.from(new Set([...X, e._key]))), et(Y.filter((t) => t !== e._key)), N?.(Q([e._key])[0]).then((t) => {
-			Z(X.filter((t) => t !== e._key)), et(Array.from(new Set([...Y, e._key]))), mt(!e.expanded, e._key);
+		r(P) && (tt(Array.from(new Set([...Z, e._key]))), et(X.filter((t) => t !== e._key)), P?.(Q([e._key])[0]).then((t) => {
+			tt(Z.filter((t) => t !== e._key)), et(Array.from(new Set([...X, e._key]))), ht(!e.expanded, e._key);
 		}).catch((t) => {
-			Z(X.filter((t) => t !== e._key)), console.error("[tree]load data error: ", t);
+			tt(Z.filter((t) => t !== e._key)), console.error("[tree]load data error: ", t);
 		}).finally(() => {}));
 	}
-	function ot(e, t) {
-		B.current = Q([t._key])[0], V.current = 0, Ue?.(e, Q([t._key])[0]);
-	}
 	function st(e, t) {
-		B.current = null, V.current = 0, We?.(e, Q([t._key])[0]);
+		V.current = Q([t._key])[0], H.current = 0, Ue?.(e, Q([t._key])[0]);
 	}
-	function ct(e, t, n) {
-		V.current = n, Ge?.(e, Q([t._key])[0]);
+	function ct(e, t) {
+		V.current = null, H.current = 0, We?.(e, Q([t._key])[0]);
 	}
-	function lt(e, t) {
-		V.current = 0, Ke?.(e, Q([t._key])[0]);
+	function lt(e, t, n) {
+		H.current = n, Ge?.(e, Q([t._key])[0]);
 	}
 	function ut(e, t) {
-		let n = z.current[e.parentKey];
+		H.current = 0, Ke?.(e, Q([t._key])[0]);
+	}
+	function dt(e, t) {
+		let n = B.current[e.parentKey];
 		for (; n;) {
 			let { _key: e, parentKey: r } = n;
 			if (e === t.props._key) return !0;
 			if (r === e) return;
-			n = z.current[r];
+			n = B.current[r];
 		}
 	}
-	function dt(e, t) {
+	function ft(e, t) {
 		if (e === void 0 || t === void 0) return !1;
 		if (e === t) return !0;
 		let n = e.key, r = t.key;
@@ -239,17 +239,17 @@ function ue(c, re) {
 		let i = e.props._key, a = t.props._key;
 		return i === void 0 && a === void 0 ? !1 : i === a;
 	}
-	function ft(e, t, n) {
-		if (B.current) {
+	function pt(e, t, n) {
+		if (V.current) {
 			let r = Q([t._key])[0];
-			if (qe && !ut(t, B.current) && !dt(B.current, r)) {
-				if (E && !E({
+			if (qe && !dt(t, V.current) && !ft(V.current, r)) {
+				if (D && !D({
 					dropNode: r,
-					dragNode: B.current,
+					dragNode: V.current,
 					dropPosition: n
 				})) return;
 				qe({
-					dragNode: B.current,
+					dragNode: V.current,
 					dropNode: r,
 					dropPosition: n,
 					e
@@ -257,171 +257,171 @@ function ue(c, re) {
 			}
 		}
 	}
-	function pt(e, t) {
-		let r = !0;
-		return n(E) && (r = E({
+	function mt(e, t) {
+		let n = !0;
+		return r(D) && (n = D({
 			dropNode: Q([e._key])[0],
-			dragNode: B.current,
+			dragNode: V.current,
 			dropPosition: t
-		})), r;
+		})), n;
 	}
-	function mt(e, t) {
-		if (J.includes(t)) return;
-		let n = e ? Array.from(new Set([...q, t])) : q.filter((e) => e !== t);
-		Qe((e) => n), T && $e((e) => [...e, t]), Re?.(n, {
+	function ht(e, t) {
+		if (Y.includes(t)) return;
+		let n = e ? Array.from(new Set([...J, t])) : J.filter((e) => e !== t);
+		Qe((e) => n), E && $e((e) => [...e, t]), Re?.(n, {
 			expanded: e,
 			node: Q([t])[0],
 			expandedNodes: Q(n)
 		});
 	}
 	function Q(e) {
-		return $([].concat(e).map((e) => z.current[e]).filter(Boolean)).map((t) => me ? {
+		return $([].concat(e).map((e) => B.current[e]).filter(Boolean)).map((t) => me ? {
 			props: t,
 			key: e
-		} : /* @__PURE__ */ f(u, {
+		} : /* @__PURE__ */ re(ee, {
 			...t,
 			key: t.key
 		}));
 	}
-	function ht(e) {
+	function gt(e) {
 		return {
-			expandedKeysSet: e?.expandedKeysSet || new Set(q || []),
-			checkedKeysSet: e?.checkedKeysSet || new Set(G.keys || []),
-			selectedKeysSet: e?.selectedKeysSet || new Set(U || []),
-			halfCheckedKeysSet: e?.halfCheckedKeysSet || new Set(G.halfKeys || [])
+			expandedKeysSet: e?.expandedKeysSet || new Set(J || []),
+			checkedKeysSet: e?.checkedKeysSet || new Set(K.keys || []),
+			selectedKeysSet: e?.selectedKeysSet || new Set(W || []),
+			halfCheckedKeysSet: e?.halfCheckedKeysSet || new Set(K.halfKeys || [])
 		};
 	}
 	function $(t, n) {
-		let { expandedKeysSet: r, checkedKeysSet: i, selectedKeysSet: a, halfCheckedKeysSet: o } = ht(n), s = (e) => {
-			let t = e.children && e.children.length, n = L(e._level), s = {
+		let { expandedKeysSet: r, checkedKeysSet: i, selectedKeysSet: a, halfCheckedKeysSet: o } = gt(n), s = (e) => {
+			let t = e.children && e.children.length, n = R(e._level), s = {
 				isLeaf: !t || n,
 				autoExpandParent: t ? Ce : !1,
-				expanded: r ? r.has(e._key) : q.includes(e._key)
+				expanded: r ? r.has(e._key) : J.includes(e._key)
 			};
-			return N && (s.loaded = Y.includes(e._key) || n, s.isLeaf = (t ? !1 : e.isLeaf) || n), {
+			return P && (s.loaded = X.includes(e._key) || n, s.isLeaf = (t ? !1 : e.isLeaf) || n), {
 				...e,
 				...s,
 				selected: a.has(e._key),
 				indeterminated: o.has(e._key),
-				loading: X.includes(e._key),
+				loading: Z.includes(e._key),
 				checked: i.has(e._key),
-				selectedKeys: U,
-				checkedKeys: G.keys,
-				loadingKeys: X,
-				loadedKeys: Y,
-				expandedKeys: q,
+				selectedKeys: W,
+				checkedKeys: K.keys,
+				loadingKeys: Z,
+				loadedKeys: X,
+				expandedKeys: J,
 				childrenData: e.children || [],
 				children: null
 			};
 		};
 		return e(t) ? t.map((e) => s(e)) : s(t);
 	}
-	function gt(e) {
-		J.includes(e) && $e(J.filter((t, n, r) => t !== e));
+	function _t(e) {
+		Y.includes(e) && $e(Y.filter((t, n, r) => t !== e));
 	}
-	function _t() {
+	function vt() {
 		return {
-			selectedKeys: U,
-			checkedKeys: G.keys,
-			halfCheckedKeys: G.halfKeys,
-			expandedKeys: q,
-			currentExpandKeys: J,
-			loadedKeys: Y,
-			loadingKeys: X,
+			selectedKeys: W,
+			checkedKeys: K.keys,
+			halfCheckedKeys: K.halfKeys,
+			expandedKeys: J,
+			currentExpandKeys: Y,
+			loadedKeys: X,
+			loadingKeys: Z,
 			nodeList: Ze
 		};
 	}
-	return ae(() => {
-		if (!(x && k || S && j)) return;
-		let { halfCheckedKeys: e, checkedKeys: t } = R(k);
-		return K((n) => {
+	return m(() => {
+		if (!(S && A || C && M)) return;
+		let { halfCheckedKeys: e, checkedKeys: t } = z(A);
+		return q((n) => {
 			let r = { ...n };
 			return r.keys = t, r.halfKeys = e, r;
 		}), () => {};
 	}, [
-		j,
-		k,
-		R,
-		x,
-		S
-	]), ae(() => {
-		if (pe) return t(D, q) || Qe((e) => D), () => {};
+		M,
+		A,
+		z,
+		S,
+		C
+	]), m(() => {
+		if (pe) return n(O, J) || Qe((e) => O), () => {};
 	}, [
-		D,
-		q,
+		O,
+		J,
 		pe
-	]), ae(() => {
-		if (b) return t(O, U) || W(O || []), () => {};
+	]), m(() => {
+		if (x) return n(k, W) || G(k || []), () => {};
 	}, [
-		b,
-		O,
-		U
-	]), oe(re, () => ({
-		scrollIntoView: tt,
-		handleCheck: it,
-		getTreeState: _t,
-		handleExpandEnd: gt,
+		x,
+		k,
+		W
+	]), oe(ie, () => ({
+		scrollIntoView: nt,
+		handleCheck: at,
+		getTreeState: vt,
+		handleExpandEnd: _t,
 		getNodeProps: $,
-		getDataSet: ht,
+		getDataSet: gt,
 		getCacheNode: Q,
-		handleExpand: mt,
-		handleAllowDrop: pt,
-		handleNodeDrop: ft,
-		isSameNode: dt
-	})), /* @__PURE__ */ se(l.Provider, {
+		handleExpand: ht,
+		handleAllowDrop: mt,
+		handleNodeDrop: pt,
+		isSameNode: ft
+	})), /* @__PURE__ */ se(u.Provider, {
 		value: {
 			icons: be,
-			animation: T,
-			key2nodeProps: z.current,
-			getFieldInfo: I,
-			getTreeState: _t,
+			animation: E,
+			key2nodeProps: B.current,
+			getFieldInfo: L,
+			getTreeState: vt,
 			getNodeProps: $,
-			onExpandEnd: T ? gt : () => {},
-			onSelect: rt,
-			onCheck: it,
-			onNodeDragStart: ot,
-			onNodeDragEnd: st,
-			onNodeDragLeave: lt,
-			onNodeDragOver: ct,
-			onNodeDrop: ft,
-			onExpand: mt,
+			onExpandEnd: E ? _t : () => {},
+			onSelect: it,
+			onCheck: at,
+			onNodeDragStart: st,
+			onNodeDragEnd: ct,
+			onNodeDragLeave: ut,
+			onNodeDragOver: lt,
+			onNodeDrop: pt,
+			onExpand: ht,
 			renderExtra: Me,
 			renderTitle: Ne,
-			loadMore: N && at,
-			allowDrop: pt,
+			loadMore: P && ot,
+			allowDrop: mt,
 			actionOnClick: xe,
 			virtualListProps: Xe
 		},
-		children: /* @__PURE__ */ se(ee, {
+		children: /* @__PURE__ */ se(te, {
 			ref: (e) => {
-				H.current = e;
+				U.current = e;
 			},
-			className: i(F, {
-				[`${F}-checkable`]: M,
-				[`${F}-show-line`]: w,
-				[`${F}-size-${ge}`]: ge,
-				[`${F}-rtl`]: de
+			className: a(I, {
+				[`${I}-checkable`]: N,
+				[`${I}-show-line`]: ge,
+				[`${I}-size-${_e}`]: _e,
+				[`${I}-rtl`]: de
 			}, he),
 			style: ye,
 			filterNode: Ie,
 			virtualListProps: Xe,
-			expandedKeys: q,
-			currentExpandKeys: J,
+			expandedKeys: J,
+			currentExpandKeys: Y,
 			getNodeProps: $,
-			getDataSet: ht,
+			getDataSet: gt,
 			nodeList: Ze,
 			onMouseDown: Le,
 			ariaProps: {
 				role: "tree",
 				"aria-multiselectable": Fe,
 				tabIndex: 0,
-				...a(fe)
+				...o(fe)
 			}
 		})
 	});
 }
-var y = re(ue);
-y.displayName = "Tree";
+var b = ie(ue);
+b.displayName = "Tree";
 //#endregion
-export { y as default };
+export { b as default };
 /* 独立思考，明辨是非 */

package/tree/context.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-04-03 14:07:06 星期五 */
+/* 潘启宝 2026-04-14 16:51:07 星期二 */
 import { createContext as e } from "react";
 //#region components/pc/tree/context.tsx
 var t = e({});

package/tree/index.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-04-03 14:07:06 星期五 */
+/* 潘启宝 2026-04-14 16:51:07 星期二 */
 import { TreeContext as e } from "./Context2.js";
 import t from "./Node.js";
 import n from "./Animation.js";

package/tree/utils.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-04-03 14:07:06 星期五 */
+/* 潘启宝 2026-04-14 16:51:07 星期二 */
 import e from "react";
 //#region components/pc/tree/utils.ts
 var t = "parent", n = "all", r = "child", i = (t) => {

package/tree-select/List.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-04-03 14:07:06 星期五 */
+/* 潘启宝 2026-04-14 16:51:07 星期二 */
 import { isFunction as e, isString as t } from "../utils/is.js";
 import n from "../tree/index.js";
 import { forwardRef as r, useCallback as i, useImperativeHandle as a, useMemo as o, useRef as s } from "react";

package/tree-select/TreeSelect.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-04-03 14:07:06 星期五 */
+/* 潘启宝 2026-04-14 16:51:07 星期二 */
 import { isArray as e, isEmptyArray as t, isEmptyObject as n, isEmptyValue as r, isFunction as i, isNil as a, isPlainObject as o } from "../utils/is.js";
 import s from "../hooks/use-merge-value/index.js";
 import c from "../utils/callOrReturn.js";

package/tree-select/hook/useKeyCache.d.ts

@@ -1,4 +1,4 @@
-import type { TreeSelectDataType } from '../../tree-select/interface';
+import type { TreeSelectDataType } from '../interface';
 export type KeyCacheType = {
     [key: string]: TreeSelectDataType;
 };

package/tree-select/hook/useKeyCache.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-04-03 14:07:06 星期五 */
+/* 潘启宝 2026-04-14 16:51:07 星期二 */
 import e from "../../hooks/use-force-update/index.js";
 import t from "../../utils/className.js";
 import n from "../../config-provider/context.js";