@unicom-cloud/ui 0.8.168 → 0.8.169

package/tree/Tree.js

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

package/tree/constants.d.ts

@@ -0,0 +1,10 @@
+export declare const TREE_DEFAULT_FIELD_NAMES: {
+    key: string;
+    title: string;
+    selectable: string;
+    disableCheckbox: string;
+    checkable: string;
+    children: string;
+    isLeaf: string;
+    disabled: string;
+};