@unicom-cloud/ui 0.8.160 → 0.8.162

package/tree/Tree.js

@@ -1,22 +1,23 @@
-/* 潘启宝 2026-05-18 15:17:02 星期一 */
+/* 潘启宝 2026-05-26 15:50:14 星期二 山东省济南市 */
 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 u from "../config-provider/context.js";
-import "../config-provider/index.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 { TreeContext as ee } from "./context.js";
+import { TreeContext as ne } from "./context.js";
 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";
+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 { jsx as fe } from "react/jsx-runtime";
+import _ from "lodash/get";
+import v from "lodash/has";
 //#region components/pc/tree/Tree.tsx
-var ue = {
+var pe = {
 	key: "key",
 	title: "title",
 	children: d,
@@ -25,88 +26,88 @@ var ue = {
 	disableCheckbox: "disableCheckbox",
 	checkable: "checkable",
 	isLeaf: "isLeaf"
-}, de = {
+}, me = {
 	selectable: !0,
 	autoExpandParent: !0,
 	checkedStrategy: "all",
 	actionOnClick: "select",
 	allowDrop: () => !0,
-	fieldNames: ue,
+	fieldNames: pe,
 	animation: !0
 };
-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), [
+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,
-		je
-	]), L = m((e) => {
+		Ne
+	]), L = p((e) => {
 		let t = {
-			...ue,
-			...C ? Ee : {}
+			...pe,
+			...C ? Oe : {}
 		}, n = {
-			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),
-			isLeaf: v(e, t.isLeaf),
-			key: v(e, t.key)
+			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)
 		};
-		return y(e, t.key) ? n.key = v(e, t.key) : delete n.key, n;
+		return v(e, t.key) ? n.key = _(e, t.key) : delete n.key, n;
 	}, [
 		N,
 		j,
-		Ee,
+		Oe,
 		C,
-		Te
+		De
 	]);
 	function R(e) {
 		return i(F) && i(e) && e > F - 1;
 	}
-	let Xe = m((e) => {
+	let Qe = p((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: d, checkable: ee, key: f = `${a?._key || ""}-${l}`, ...te } = L(e), p = {
+				let { children: u, selectable: ee, checkable: te, key: d = `${a?._key || ""}-${l}`, ...ne } = L(e), f = {
 					dataRef: e,
-					draggable: Fe,
-					selectable: d,
-					checkable: ee,
-					showLine: ve,
-					blockNode: De,
+					draggable: Le,
+					selectable: ee,
+					checkable: te,
+					showLine: be,
+					blockNode: ke,
 					...e,
-					...te,
-					key: f,
+					...ne,
+					key: d,
 					children: u,
-					_key: f,
+					_key: d,
 					_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 && (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,
+				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,
 					_level: a._level + 1,
-					_lineless: p._lineless,
+					_lineless: f._lineless,
 					_isTail: c === l + 1,
-					pathParentKeys: [...a?.pathParentKeys || [], f]
-				}) : B.current[f].children = [], p;
+					pathParentKeys: [...a?.pathParentKeys || [], d]
+				}) : B.current[d].children = [], f;
 			});
 		};
 		return i(e || [], { _level: 0 }), n;
 	}, [
-		De,
-		Fe,
+		ke,
+		Le,
 		L,
 		I,
-		ve,
+		be,
 		F
-	]), z = m((e) => {
+	]), z = p((e) => {
 		if (!M) {
-			let { checkedKeys: t, indeterminateKeys: n } = ne(e, B.current);
+			let { checkedKeys: t, indeterminateKeys: n } = ae(e, B.current);
 			return {
 				checkedKeys: t,
 				halfCheckedKeys: n
@@ -114,9 +115,9 @@ function fe(c, d) {
 		}
 		return {
 			checkedKeys: e,
-			halfCheckedKeys: Me || []
+			halfCheckedKeys: Pe || []
 		};
-	}, [M, Me]), B = g({}), V = g(null), H = g(null), U = g(null), Ze = h(() => {
+	}, [M, Pe]), B = h({}), V = h(null), H = h(null), U = h(null), $e = m(() => {
 		let e = { threshold: null };
 		return e = w ? {
 			threshold: 100,
@@ -125,19 +126,19 @@ function fe(c, d) {
 			height: T,
 			threshold: 100
 		} : { threshold: null }, e;
-	}, [T, w]), Qe = h(() => Xe(Ye), [Xe, Ye]), [W, G] = _(() => k || ke || []), [K, q] = _(() => {
-		let { checkedKeys: e, halfCheckedKeys: t } = z(A || Ae || []);
+	}, [T, w]), et = m(() => Qe(Ze), [Qe, Ze]), [W, G] = g(() => k || je || []), [K, q] = g(() => {
+		let { checkedKeys: e, halfCheckedKeys: t } = z(A || Me || []);
 		return {
 			keys: e,
 			halfKeys: t
 		};
-	}), [J, $e] = _(() => it(O || Oe)), [Y, et] = _(() => []), [X, tt] = _(() => []), [Z, nt] = _(() => []);
-	function rt(e, t) {
+	}), [J, tt] = g(() => ot(O || Ae)), [Y, nt] = g(() => []), [X, rt] = g(() => []), [Z, it] = g(() => []);
+	function at(e, t) {
 		let n = e;
 		t && (n = t._key), U.current && U.current.scrollIntoView(n, t || B.current[n]);
 	}
-	function it(t) {
-		if (!we) return t || [];
+	function ot(t) {
+		if (!Ee) return t || [];
 		if (!t) return Object.keys(B.current).filter((e) => {
 			let { children: t } = B.current[e] ?? {};
 			return t?.length;
@@ -150,7 +151,7 @@ function fe(c, d) {
 			}));
 		}), Object.keys(n);
 	}
-	function at(e, t) {
+	function st(e, t) {
 		let n = B.current[e]?.dataRef, r = {
 			e: t,
 			data: n,
@@ -158,33 +159,33 @@ function fe(c, d) {
 			selected: !1,
 			selectedNodes: []
 		};
-		if (Ie) {
+		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), x || G(t), Be?.(t, r);
-		} else r.selected = !0, r.selectedNodes = Q([e]), x || G([e]), Be?.([e], r);
-		Ve?.(e, n, r);
+			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);
+		Ue?.(e, n, r);
 	}
-	function ot(e, t, n) {
+	function ct(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) => {
+		if (M) r = e ? r.concat(t) : r.filter((e) => e !== t), x || q((e) => {
 			let t = { ...e };
 			return t.keys = r, t;
-		}), me || q((e) => {
+		}), S || q((e) => {
 			let t = { ...e };
 			return t.halfKeys = i, t;
 		});
 		else {
-			let { checkedKeys: n, indeterminateKeys: a } = p(t, e, r, B.current, i);
-			r = n, i = a, q(S ? (e) => {
+			let { checkedKeys: n, indeterminateKeys: a } = ie(t, e, r, B.current, i);
+			r = n, i = a, q(x ? (e) => {
 				let t = { ...e };
 				return t.halfKeys = i, t;
 			} : (e) => {
 				let t = { ...e };
 				return t.keys = r, t.halfKeys = i, t;
-			}), Ce === "parent" ? r = r.filter((e) => {
+			}), Te === "parent" ? r = r.filter((e) => {
 				let t = B.current[e];
 				if (!t || !r.includes(t.parentKey)) return !0;
-			}) : Ce === "child" && (r = r.filter((e) => {
+			}) : Te === "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;
 			}));
@@ -198,32 +199,32 @@ function fe(c, d) {
 			e: n,
 			node: Q([t])[0]
 		};
-		He?.(r, o), Ue?.(t, a, o);
+		We?.(r, o), Ge?.(t, a, o);
 	}
-	function st(e) {
+	function lt(e) {
 		if (R(e._level)) {
 			console.warn(`[Tree] Cannot load more: reached max level ${F}`);
 			return;
 		}
-		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);
+		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);
 		}).catch((t) => {
-			nt(Z.filter((t) => t !== e._key)), console.error("[tree]load data error: ", t);
+			it(Z.filter((t) => t !== e._key)), console.error("[tree]load data error: ", t);
 		}).finally(() => {}));
 	}
-	function ct(e, t) {
-		V.current = Q([t._key])[0], H.current = 0, We?.(e, Q([t._key])[0]);
+	function ut(e, t) {
+		V.current = Q([t._key])[0], H.current = 0, Ke?.(e, Q([t._key])[0]);
 	}
-	function lt(e, t) {
-		V.current = null, H.current = 0, Ge?.(e, Q([t._key])[0]);
+	function dt(e, t) {
+		V.current = null, H.current = 0, qe?.(e, Q([t._key])[0]);
 	}
-	function ut(e, t, n) {
-		H.current = n, Ke?.(e, Q([t._key])[0]);
+	function ft(e, t, n) {
+		H.current = n, Je?.(e, Q([t._key])[0]);
 	}
-	function dt(e, t) {
-		H.current = 0, qe?.(e, Q([t._key])[0]);
+	function pt(e, t) {
+		H.current = 0, Ye?.(e, Q([t._key])[0]);
 	}
-	function ft(e, t) {
+	function mt(e, t) {
 		let n = B.current[e.parentKey];
 		for (; n;) {
 			let { _key: e, parentKey: r } = n;
@@ -232,7 +233,7 @@ function fe(c, d) {
 			n = B.current[r];
 		}
 	}
-	function pt(e, t) {
+	function ht(e, t) {
 		if (a(e) || a(t)) return !1;
 		if (e === t) return !0;
 		let n = e.key, r = t.key;
@@ -240,16 +241,16 @@ function fe(c, d) {
 		let i = e.props._key, o = t.props._key;
 		return a(i) && a(o) ? !1 : i === o;
 	}
-	function mt(e, t, n) {
+	function gt(e, t, n) {
 		if (V.current) {
 			let r = Q([t._key])[0];
-			if (Je && !ft(t, V.current) && !pt(V.current, r)) {
+			if (Xe && !mt(t, V.current) && !ht(V.current, r)) {
 				if (D && !D({
 					dropNode: r,
 					dragNode: V.current,
 					dropPosition: n
 				})) return;
-				Je({
+				Xe({
 					dragNode: V.current,
 					dropNode: r,
 					dropPosition: n,
@@ -258,7 +259,7 @@ function fe(c, d) {
 			}
 		}
 	}
-	function ht(e, t) {
+	function _t(e, t) {
 		let n = !0;
 		return r(D) && (n = D({
 			dropNode: Q([e._key])[0],
@@ -266,25 +267,27 @@ function fe(c, d) {
 			dropPosition: t
 		})), n;
 	}
-	function gt(e, t) {
+	function vt(e, t) {
 		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, {
+		tt((e) => n), E && nt((e) => [...e, t]);
+		let i = Ve;
+		r(i) && i(n, {
 			expanded: e,
 			node: Q([t])[0],
 			expandedNodes: Q(n)
 		});
 	}
 	function Q(e) {
-		return $([].concat(e).map((e) => B.current[e]).filter(Boolean)).map((t) => ge ? {
+		return $([].concat(e).map((e) => B.current[e]).filter(Boolean)).map((t, n, r) => ve ? {
 			props: t,
 			key: e
-		} : /* @__PURE__ */ ie(f, {
+		} : /* @__PURE__ */ se(f, {
 			...t,
 			key: t.key
 		}));
 	}
-	function _t(e) {
+	function yt(e) {
 		return {
 			expandedKeysSet: e?.expandedKeysSet || new Set(J || []),
 			checkedKeysSet: e?.checkedKeysSet || new Set(K.keys || []),
@@ -293,10 +296,10 @@ function fe(c, d) {
 		};
 	}
 	function $(t, n) {
-		let { expandedKeysSet: r, checkedKeysSet: i, selectedKeysSet: a, halfCheckedKeysSet: o } = _t(n), s = (e) => {
+		let { expandedKeysSet: r, checkedKeysSet: i, selectedKeysSet: a, halfCheckedKeysSet: o } = yt(n), s = (e) => {
 			let t = e.children?.length, n = R(e._level), s = {
 				isLeaf: !t || n,
-				autoExpandParent: t ? we : !1,
+				autoExpandParent: t ? Ee : !1,
 				expanded: r ? r.has(e._key) : J.includes(e._key)
 			};
 			return P && (s.loaded = X.includes(e._key) || n, s.isLeaf = (t ? !1 : e.isLeaf) || n), {
@@ -315,12 +318,12 @@ function fe(c, d) {
 				children: null
 			};
 		};
-		return e(t) ? t.map((e) => s(e)) : s(t);
-	}
-	function vt(e) {
-		Y.includes(e) && et(Y.filter((t, n, r) => t !== e));
+		return e(t) ? t.map((e, t, n) => s(e)) : s(t);
 	}
-	function yt() {
+	let bt = te((e) => {
+		Y.includes(e) && nt(Y.filter((t, n, r) => t !== e));
+	});
+	function xt() {
 		return {
 			selectedKeys: W,
 			checkedKeys: K.keys,
@@ -329,11 +332,11 @@ function fe(c, d) {
 			currentExpandKeys: Y,
 			loadedKeys: X,
 			loadingKeys: Z,
-			nodeList: Qe
+			nodeList: et
 		};
 	}
-	return se(() => {
-		if (!(S && A || me && M)) return;
+	return ue(() => {
+		if (!(x && A || S && M)) return;
 		let { halfCheckedKeys: e, checkedKeys: t } = z(A);
 		return q((n) => {
 			let r = { ...n };
@@ -343,86 +346,84 @@ function fe(c, d) {
 		M,
 		A,
 		z,
-		S,
-		me
-	]), se(() => {
-		if (he) return n(O, J) || $e((e) => O), () => {};
+		x,
+		S
+	]), ue(() => {
+		if (_e) return n(O, J) || tt((e) => O), () => {};
 	}, [
 		O,
 		J,
-		he
-	]), se(() => {
-		if (x) return n(k, W) || G(k || []), () => {};
+		_e
+	]), ue(() => {
+		if (b) return n(k, W) || G(k || []), () => {};
 	}, [
-		x,
+		b,
 		k,
 		W
-	]), ce(d, () => ({
-		scrollIntoView: rt,
-		handleCheck: ot,
-		getTreeState: yt,
-		handleExpandEnd: vt,
+	]), de(d, () => ({
+		scrollIntoView: at,
+		handleCheck: ct,
+		getTreeState: xt,
+		handleExpandEnd: bt,
 		getNodeProps: $,
-		getDataSet: _t,
+		getDataSet: yt,
 		getCacheNode: Q,
-		handleExpand: gt,
-		handleAllowDrop: ht,
-		handleNodeDrop: mt,
-		isSameNode: pt
-	})), /* @__PURE__ */ le(ee.Provider, {
+		handleExpand: vt,
+		handleAllowDrop: _t,
+		handleNodeDrop: gt,
+		isSameNode: ht
+	})), /* @__PURE__ */ fe(ne.Provider, {
 		value: {
-			icons: xe,
+			icons: Ce,
 			animation: E,
 			key2nodeProps: B.current,
 			getFieldInfo: L,
-			getTreeState: yt,
+			getTreeState: xt,
 			getNodeProps: $,
-			onExpandEnd: E ? vt : () => {},
-			onSelect: at,
-			onCheck: ot,
-			onNodeDragStart: ct,
-			onNodeDragEnd: lt,
-			onNodeDragLeave: dt,
-			onNodeDragOver: ut,
-			onNodeDrop: mt,
-			onExpand: gt,
-			renderExtra: Ne,
-			renderTitle: Pe,
-			loadMore: P && st,
-			allowDrop: ht,
-			actionOnClick: Se,
-			virtualListProps: Ze
+			onExpandEnd: E ? bt : ee.noop,
+			onSelect: st,
+			onCheck: ct,
+			onNodeDragStart: ut,
+			onNodeDragEnd: dt,
+			onNodeDragLeave: pt,
+			onNodeDragOver: ft,
+			onNodeDrop: gt,
+			onExpand: vt,
+			renderExtra: Fe,
+			renderTitle: Ie,
+			loadMore: P && lt,
+			allowDrop: _t,
+			actionOnClick: we,
+			virtualListProps: $e
 		},
-		children: /* @__PURE__ */ le(te, {
-			ref: (e) => {
-				U.current = e;
-			},
+		children: /* @__PURE__ */ fe(re, {
+			ref: U,
 			className: o(I, {
 				[`${I}-checkable`]: N,
-				[`${I}-show-line`]: ve,
-				[`${I}-size-${ye}`]: ye,
-				[`${I}-rtl`]: b
-			}, _e),
-			style: be,
-			filterNode: Le,
-			virtualListProps: Ze,
+				[`${I}-show-line`]: be,
+				[`${I}-size-${xe}`]: xe,
+				[`${I}-rtl`]: y
+			}, ye),
+			style: Se,
+			filterNode: ze,
+			virtualListProps: $e,
 			expandedKeys: J,
 			currentExpandKeys: Y,
 			getNodeProps: $,
-			getDataSet: _t,
-			nodeList: Qe,
-			onMouseDown: Re,
+			getDataSet: yt,
+			nodeList: et,
+			onMouseDown: Be,
 			ariaProps: {
 				role: "tree",
-				"aria-multiselectable": Ie,
+				"aria-multiselectable": Re,
 				tabIndex: 0,
-				...s(pe)
+				...s(ge)
 			}
 		})
 	});
 }
-var b = ae(fe);
-b.displayName = c.displayName;
+var y = ce(he);
+y.displayName = c.displayName;
 //#endregion
-export { b as default };
+export { y as default };
 /* 独立思考，明辨是非 */

package/tree/context.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-05-18 15:17:02 星期一 */
+/* 潘启宝 2026-05-26 15:50:14 星期二 山东省济南市 */
 import { createContext as e } from "react";
 //#region components/pc/tree/context.ts
 var t = e({});

package/tree/index.d.ts

@@ -0,0 +1,42 @@
+import { TreeContext } from './context';
+import Node from './Node';
+import NodeList from './NodeList';
+declare const Tree: import("./Tree").ForwardRefFormControlProps & {
+    SHOW_PARENT: string;
+    SHOW_ALL: string;
+    SHOW_CHILD: string;
+    Node: import("react").NamedExoticComponent<import("./interface").NodeProps>;
+    TreeContext: import("react").Context<{
+        icons?: import("./interface").NodeProps["icons"];
+        loadMore?: (node: import("./interface").NodeProps) => void;
+        renderExtra?: import("./interface").TreeProps["renderExtra"];
+        renderTitle?: import("./interface").TreeProps["renderTitle"];
+        virtualListProps?: import("../virtual-list").AvailableVirtualListProps;
+        onSelect?: (_key: string, e: any) => void;
+        onCheck?: (checked: boolean, _key: string, e: any) => void;
+        onExpand?: (expanded: boolean, _key: string) => void;
+        onNodeDrop?: (e: import("react").DragEvent<HTMLSpanElement>, nodeProps: import("./interface").NodeProps, dragPosition: 0 | 1 | -1) => void;
+        key2nodeProps?: {
+            [key: string]: import("./interface").NodeProps;
+        };
+        actionOnClick?: import("./interface").TreeProps["actionOnClick"];
+        getNodeProps?: <T extends import("./interface").NodeProps | import("./interface").NodeProps[]>(nodes: T, dataSet?: any) => T;
+        getTreeState?: () => import("./interface").TreeState;
+        onExpandEnd?: (key: string) => void;
+        animation?: boolean;
+        onNodeDragStart?: (e: import("react").DragEvent<HTMLSpanElement>, nodeProps: import("./interface").NodeProps) => void;
+        onNodeDragEnd?: (e: import("react").DragEvent<HTMLSpanElement>, nodeProps: import("./interface").NodeProps) => void;
+        onNodeDragOver?: (e: import("react").DragEvent<HTMLSpanElement>, nodeProps: import("./interface").NodeProps, position: any) => void;
+        onNodeDragLeave?: (e: import("react").DragEvent<HTMLSpanElement>, nodeProps: import("./interface").NodeProps) => void;
+        allowDrop?: (nodeProps: import("./interface").NodeProps, dragPosition: 0 | 1 | -1) => boolean;
+        getFieldInfo?: (nodeProps: import("./interface").NodeProps) => import("./interface").TreeDataType;
+    }>;
+    NodeList: import("react").ForwardRefExoticComponent<Omit<any, "ref"> & import("react").RefAttributes<unknown>>;
+    zh: string;
+    en: string;
+    displayName: string;
+    id: string;
+};
+export { TreeContext, Node as TreeNode, NodeList as TreeNodeList };
+export default Tree;
+export type { ActionOnClick, AllowDrop, FakeNodeInstance, FieldNamesType, key2nodePropsType, NodeInstance, NodeProps, SHOW_ALL, SHOW_CHILD, SHOW_PARENT, TreeDataType, TreeProps, TreeState, } from './interface';

package/tree/index.js

@@ -1,22 +1,20 @@
-/* 潘启宝 2026-05-18 15:17:02 星期一 */
+/* 潘启宝 2026-05-26 15:50:14 星期二 山东省济南市 */
 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";
+import r from "./NodeList.js";
+import { SHOW_CHILD as i, SHOW_PARENT as a } from "./utils.js";
+import o from "./Tree.js";
 //#region components/pc/tree/index.ts
-var c = Object.assign(s, {
-	id: e.id,
-	SHOW_PARENT: o,
+var s = Object.assign(o, {
+	...e,
+	SHOW_PARENT: a,
 	SHOW_ALL: "all",
-	SHOW_CHILD: a,
+	SHOW_CHILD: i,
 	Node: n,
 	TreeContext: t,
-	NodeList: i,
-	Animation: r
+	NodeList: r
 });
 //#endregion
-export { r as TreeAnimation, t as TreeContext, n as TreeNode, i as TreeNodeList, c as default };
+export { t as TreeContext, n as TreeNode, r as TreeNodeList, s as default };
 /* 独立思考，明辨是非 */

package/tree/interface.d.ts

@@ -300,6 +300,7 @@ export interface TreeProps extends Size {
 export interface NodeProps {
     style?: CSSProperties;
     className?: string;
+    prefixCls?: string;
     blockNode?: boolean;
     /**
      * @zh 该节点显示的标题

package/tree/utils.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-05-18 15:17:02 星期一 */
+/* 潘启宝 2026-05-26 15:50:14 星期二 山东省济南市 */
 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-18 15:17:02 星期一 */
+/* 潘启宝 2026-05-26 15:50:14 星期二 山东省济南市 */
 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";