@unicom-cloud/ui 0.8.166 → 0.8.168

package/tree/Tree.js

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

package/tree/context.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-12 15:24:06 星期五 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { createContext as e } from "react";
 //#region components/pc/tree/context.ts
 var t = e({});

package/tree/index.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-12 15:24:06 星期五 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { TREE_COMPONENT_INFO as e } from "../utils/names.js";
 import { TreeContext as t } from "./context.js";
 import n from "./Node.js";

package/tree/utils.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-12 15:24:06 星期五 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 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-06-12 15:24:06 星期五 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 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-06-12 15:24:06 星期五 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { isArray as e, isEmptyArray as t, isEmptyObject as n, isEmptyValue as r, isFunction as i, isNil as a, isPlainObject as o, isUndefined as s } from "../utils/is.js";
 import c from "../hooks/use-controllable-value/index.js";
 import l from "../utils/callOrReturn.js";

package/tree-select/hook/useKeyCache.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-12 15:24:06 星期五 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import e from "../../hooks/use-force-update/index.js";
 import t from "../../utils/className.js";
 import { ConfigContext as n } from "../../config-provider/context.js";

package/tree-select/hook/useStateValue.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-12 15:24:06 星期五 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { isArray as e, isEqualWith as t, isPlainObject as n, isUndefined as r, isUndefinedOrNull as i } from "../../utils/is.js";
 import a from "../../hooks/use-update-effect/index.js";
 import { getCheckedKeysByInitKeys as o } from "../../tree/utils.js";

package/tree-select/hook/useTreeData.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-12 15:24:06 星期五 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import e from "../../hooks/use-update-effect/index.js";
 import t from "../../hooks/use-previous/index.js";
 import { getTreeDataFromTreeChildren as n } from "../../tree/utils.js";