@unicom-cloud/ui 0.8.159 → 0.8.160

package/tree/Tree.js

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

package/tree/context.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-05-15 17:45:52 星期五 */
+/* 潘启宝 2026-05-18 15:17:02 星期一 */
 import { createContext as e } from "react";
 //#region components/pc/tree/context.ts
 var t = e({});

package/tree/index.js

@@ -1,20 +1,22 @@
-/* 潘启宝 2026-05-15 17:45:52 星期五 */
-import { TreeContext as e } from "./context.js";
-import t from "./Node.js";
-import n from "./Animation.js";
-import r from "./NodeList.js";
-import { SHOW_CHILD as i, SHOW_PARENT as a } from "./utils.js";
-import o from "./Tree.js";
+/* 潘启宝 2026-05-18 15:17:02 星期一 */
+import { TREE_COMPONENT_INFO as e } from "../utils/names.js";
+import { TreeContext as t } from "./context.js";
+import n from "./Node.js";
+import r from "./Animation.js";
+import i from "./NodeList.js";
+import { SHOW_CHILD as a, SHOW_PARENT as o } from "./utils.js";
+import s from "./Tree.js";
 //#region components/pc/tree/index.ts
-var s = Object.assign(o, {
-	SHOW_PARENT: a,
+var c = Object.assign(s, {
+	id: e.id,
+	SHOW_PARENT: o,
 	SHOW_ALL: "all",
-	SHOW_CHILD: i,
-	Node: t,
-	TreeContext: e,
-	NodeList: r,
-	Animation: n
+	SHOW_CHILD: a,
+	Node: n,
+	TreeContext: t,
+	NodeList: i,
+	Animation: r
 });
 //#endregion
-export { n as TreeAnimation, e as TreeContext, t as TreeNode, r as TreeNodeList, s as default };
+export { r as TreeAnimation, t as TreeContext, n as TreeNode, i as TreeNodeList, c as default };
 /* 独立思考，明辨是非 */

package/tree/utils.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-05-15 17:45:52 星期五 */
+/* 潘启宝 2026-05-18 15:17:02 星期一 */
 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-05-15 17:45:52 星期五 */
+/* 潘启宝 2026-05-18 15:17:02 星期一 */
 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";