@unicom-cloud/ui 0.8.167 → 0.8.168

package/tree/Tree.js

@@ -1,114 +1,111 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 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 d from "../hooks/use-update-effect/index.js";
-import { CHILDREN_NAME as f } from "../constant/index.js";
-import { TreeContext as p } from "./context.js";
-import ne 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 m, useContext as le, useEffect as h, useImperativeHandle as ue, useMemo as g, useRef as _, useState as v } from "react";
-import { jsx as de } from "react/jsx-runtime";
-import y from "lodash/get";
-import b from "lodash/has";
+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";
 //#region components/pc/tree/Tree.tsx
-var fe = {
+var pe = {
 	key: "key",
 	title: "title",
-	children: f,
+	children: te,
 	selectable: "selectable",
 	disabled: "disabled",
 	disableCheckbox: "disableCheckbox",
 	checkable: "checkable",
 	isLeaf: "isLeaf"
-}, pe = {
+}, me = {
 	selectable: !0,
 	autoExpandParent: !0,
 	checkedStrategy: "all",
 	actionOnClick: "select",
 	allowDrop: () => !0,
-	fieldNames: fe,
+	fieldNames: pe,
 	animation: !0
 };
-function me(c, f) {
-	let { getPrefixCls: ce, componentConfig: me, rtl: he } = le(u), ge = l(c, pe, me?.Tree), x = "selectedKeys" in c, S = "checkedKeys" in c, _e = "halfCheckedKeys" in c, ve = "expandedKeys" in c, C = "treeData" in c, { ___PqbAdapterMode___: ye, className: be, showLine: w, size: xe, virtualListProps: T, height: E, style: Se, icons: Ce, actionOnClick: we, animation: D, checkedStrategy: Te, autoExpandParent: O, allowDrop: k, selectable: Ee, fieldNames: De, blockNode: Oe, expandedKeys: A, defaultExpandedKeys: ke, selectedKeys: j, defaultSelectedKeys: Ae, checkedKeys: M, defaultCheckedKeys: je, treeData: Me, children: N, checkStrictly: P, halfCheckedKeys: Ne, renderExtra: Pe, renderTitle: Fe, checkable: F, draggable: Ie, multiple: Le, loadMore: I, filterNode: Re, onMouseDown: ze, onExpand: Be, onSelect: Ve, onNodeSelect: He, onCheck: Ue, onNodeCheck: We, onDragStart: Ge, onDragEnd: Ke, onDragOver: qe, onDragLeave: Je, onDrop: Ye, maxLevel: L } = ge, R = ce?.("tree"), z = g(() => C ? Me : oe(N), [
-		N,
-		C,
-		Me
-	]), Xe = _(!!z), Ze = m((e) => {
+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) => {
 		let t = {
-			...fe,
-			...C ? De : {}
+			...pe,
+			...S ? Oe : {}
 		}, n = {
-			children: b(e, t.children) ? y(e, t.children) : N,
-			selectable: b(e, t.selectable) ? y(e, t.selectable) : Ee,
-			checkable: b(e, t.checkable) ? y(e, t.checkable) : F,
-			title: y(e, t.title),
-			disabled: y(e, t.disabled),
-			disableCheckbox: y(e, t.disableCheckbox),
-			isLeaf: y(e, t.isLeaf),
-			key: y(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 b(e, t.key) ? n.key = y(e, t.key) : delete n.key, n;
+		return f(e, t.key) ? n.key = d(e, t.key).toString() : delete n.key, n;
 	}, [
-		F,
-		N,
-		De,
-		C,
-		Ee
+		P,
+		M,
+		Oe,
+		S,
+		De
 	]);
 	function Qe(e) {
-		return i(L) && i(e) && e > L - 1;
+		return i(I) && i(e) && e > I - 1;
 	}
-	let $e = m((e) => {
+	let $e = h((e) => {
 		B.current = {};
 		let n = [], r = 0, i = (e, a) => {
 			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}`, ...f } = Ze(e), p = {
+				let { children: u, selectable: d, checkable: f, key: p = `${a?._key || ""}-${l}`, ...ee } = z(e), m = {
 					dataRef: e,
-					draggable: Ie,
-					selectable: ee,
-					checkable: te,
-					showLine: w,
-					blockNode: Oe,
+					draggable: Le,
+					selectable: d,
+					checkable: f,
+					showLine: C,
+					blockNode: ke,
 					...e,
-					...f,
-					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 && (p.className = o(`${R}-node-is-tail`, p.className)), n.push(p), B.current[d] = p, 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: p._lineless,
+					_lineless: m._lineless,
 					_isTail: c === l + 1,
-					pathParentKeys: [...a?.pathParentKeys || [], d]
-				}) : B.current[d].children = [], p;
+					pathParentKeys: [...a?.pathParentKeys || [], p]
+				}) : B.current[p].children = [], m;
 			});
 		};
 		return i(e || [], { _level: 0 }), n;
 	}, [
-		Oe,
-		Ie,
-		Ze,
-		R,
-		w,
-		L
-	]), et = m((e) => {
-		if (!P) {
-			let { checkedKeys: t, indeterminateKeys: n } = ae(e, B.current);
+		ke,
+		Le,
+		z,
+		L,
+		C,
+		I
+	]), et = h((e) => {
+		if (!N) {
+			let { checkedKeys: t, indeterminateKeys: n } = oe(e, B.current);
 			return {
 				checkedKeys: t,
 				halfCheckedKeys: n
@@ -116,30 +113,30 @@ function me(c, f) {
 		}
 		return {
 			checkedKeys: e,
-			halfCheckedKeys: Ne || []
+			halfCheckedKeys: Pe || []
 		};
-	}, [P, Ne]), B = _({}), V = _(null), H = _(null), tt = _(null), nt = g(() => {
+	}, [N, Pe]), B = v({}), V = v(null), H = v(null), tt = v(null), nt = _(() => {
 		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]), rt = g(() => $e(z), [$e, z]), [U, it] = v(() => j || Ae || []), [W, G] = v(() => {
-		let { checkedKeys: e, halfCheckedKeys: t } = et(M || je || []);
+	}, [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
 		};
-	}), [K, at] = v(() => lt(A || ke)), [q, ot] = v(() => []), [J, st] = v(() => []), [Y, X] = v(() => []);
+	}), [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), tt.current && tt.current.scrollIntoView(n, t || B.current[n]);
 	}
 	function lt(t) {
-		if (!O) return t || [];
+		if (!D) return t || [];
 		if (!t) return Object.keys(B.current).filter((e) => {
 			let { children: t } = B.current[e] ?? {};
 			return t?.length;
@@ -160,33 +157,33 @@ function me(c, f) {
 			selected: !1,
 			selectedNodes: []
 		};
-		if (Le) {
+		if (Re) {
 			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), x || it(t), Ve?.(t, r);
-		} else r.selected = !0, r.selectedNodes = Z([e]), x || it([e]), Ve?.([e], r);
-		He?.(e, n, r);
+			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 dt(e, t, n) {
 		let r = [...W.keys || []], i = W.halfKeys;
-		if (P) r = e ? r.concat(t) : r.filter((e) => e !== t), S || G((e) => {
+		if (N) r = e ? r.concat(t) : r.filter((e) => e !== t), x || G((e) => {
 			let t = { ...e };
 			return t.keys = r, t;
-		}), _e || G((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, G(S ? (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;
 			}));
@@ -200,30 +197,30 @@ function me(c, f) {
 			e: n,
 			node: Z([t])[0]
 		};
-		Ue?.(r, o), We?.(t, a, o);
+		We?.(r, o), Ge?.(t, a, o);
 	}
 	function ft(e) {
 		if (Qe(e._level)) {
-			console.warn(`[Tree] Cannot load more: reached max level ${L}`);
+			console.warn(`[Tree] Cannot load more: reached max level ${I}`);
 			return;
 		}
-		r(I) && (X(Array.from(new Set([...Y, e._key]))), st(J.filter((t) => t !== e._key)), I?.(Z([e._key])[0]).then((t) => {
+		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) => {
 			X(Y.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, Ge?.(e, Z([t._key])[0]);
+		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, Ke?.(e, Z([t._key])[0]);
+		V.current = null, H.current = 0, qe?.(e, Z([t._key])[0]);
 	}
 	function ht(e, t, n) {
-		H.current = n, qe?.(e, Z([t._key])[0]);
+		H.current = n, Je?.(e, Z([t._key])[0]);
 	}
 	function gt(e, t) {
-		H.current = 0, Je?.(e, Z([t._key])[0]);
+		H.current = 0, Ye?.(e, Z([t._key])[0]);
 	}
 	function _t(e, t) {
 		let n = B.current[e.parentKey];
@@ -245,13 +242,13 @@ function me(c, f) {
 	function yt(e, t, n) {
 		if (V.current) {
 			let r = Z([t._key])[0];
-			if (Ye && !_t(t, V.current) && !vt(V.current, r)) {
-				if (k && !k({
+			if (Xe && !_t(t, V.current) && !vt(V.current, r)) {
+				if (O && !O({
 					dropNode: r,
 					dragNode: V.current,
 					dropPosition: n
 				})) return;
-				Ye({
+				Xe({
 					dragNode: V.current,
 					dropNode: r,
 					dropPosition: n,
@@ -262,7 +259,7 @@ function me(c, f) {
 	}
 	function bt(e, t) {
 		let n = !0;
-		return r(k) && (n = k({
+		return r(O) && (n = O({
 			dropNode: Z([e._key])[0],
 			dragNode: V.current,
 			dropPosition: t
@@ -271,8 +268,8 @@ function me(c, f) {
 	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), D && ot((e) => [...e, t]);
-		let i = Be;
+		at((e) => n), E && ot((e) => [...e, t]);
+		let i = Ve;
 		r(i) && i(n, {
 			expanded: e,
 			node: Z([t])[0],
@@ -280,10 +277,10 @@ function me(c, f) {
 		});
 	}
 	function Z(e) {
-		return $([].concat(e).map((e) => B.current[e]).filter(Boolean)).map((t, n, r) => ye ? {
+		return $([].concat(e).map((e) => B.current[e]).filter(Boolean)).map((t, n, r) => be ? {
 			props: t,
 			key: e
-		} : /* @__PURE__ */ se(ne, {
+		} : /* @__PURE__ */ ce(re, {
 			...t,
 			key: t.key
 		}));
@@ -300,10 +297,10 @@ function me(c, f) {
 		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 ? O : !1,
+				autoExpandParent: t ? D : !1,
 				expanded: r ? r.has(e._key) : K.includes(e._key)
 			};
-			return I && (s.loaded = J.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),
@@ -321,7 +318,7 @@ function me(c, f) {
 		};
 		return e(t) ? t.map((e, t, n) => s(e)) : s(t);
 	}
-	let St = te((e) => {
+	let St = ee((e) => {
 		q.includes(e) && ot(q.filter((t, n, r) => t !== e));
 	});
 	function Ct() {
@@ -336,32 +333,32 @@ function me(c, f) {
 			nodeList: rt
 		};
 	}
-	return h(() => {
-		if (!(S && M || _e && P)) return;
-		let { halfCheckedKeys: e, checkedKeys: t } = et(M);
+	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;
 		}), () => {};
 	}, [
-		P,
-		M,
+		N,
+		j,
 		et,
-		S,
-		_e
-	]), d(() => (O && (Xe.current ||= (at((e) => lt(A || ke)), !0)), () => {}), [z]), h(() => {
-		if (ve) return n(A, K) || at((e) => A), () => {};
+		x,
+		ve
+	]), m(() => (D && (Ze.current ||= (at((e) => lt(k || Ae)), !0)), () => {}), [R]), g(() => {
+		if (ye) return n(k, K) || at((e) => k), () => {};
 	}, [
-		A,
+		k,
 		K,
-		ve
-	]), h(() => {
-		if (x) return n(j, U) || it(j || []), () => {};
+		ye
+	]), g(() => {
+		if (b) return n(A, U) || it(A || []), () => {};
 	}, [
-		x,
-		j,
+		b,
+		A,
 		U
-	]), ue(f, () => ({
+	]), de(te, () => ({
 		scrollIntoView: ct,
 		handleCheck: dt,
 		getTreeState: Ct,
@@ -373,15 +370,15 @@ function me(c, f) {
 		handleAllowDrop: bt,
 		handleNodeDrop: yt,
 		isSameNode: vt
-	})), /* @__PURE__ */ de(p.Provider, {
+	})), /* @__PURE__ */ fe(ne.Provider, {
 		value: {
-			icons: Ce,
-			animation: D,
+			icons: we,
+			animation: E,
 			key2nodeProps: B.current,
-			getFieldInfo: Ze,
+			getFieldInfo: z,
 			getTreeState: Ct,
 			getNodeProps: $,
-			onExpandEnd: D ? St : ee.noop,
+			onExpandEnd: E ? St : p.noop,
 			onSelect: ut,
 			onCheck: dt,
 			onNodeDragStart: pt,
@@ -390,41 +387,41 @@ function me(c, f) {
 			onNodeDragOver: ht,
 			onNodeDrop: yt,
 			onExpand: xt,
-			renderExtra: Pe,
-			renderTitle: Fe,
-			loadMore: I && ft,
+			renderExtra: Fe,
+			renderTitle: Ie,
+			loadMore: F && ft,
 			allowDrop: bt,
-			actionOnClick: we,
+			actionOnClick: Te,
 			virtualListProps: nt
 		},
-		children: /* @__PURE__ */ de(re, {
+		children: /* @__PURE__ */ fe(ie, {
 			ref: tt,
-			className: o(R, {
-				[`${R}-checkable`]: F,
-				[`${R}-show-line`]: w,
-				[`${R}-size-${xe}`]: xe,
-				[`${R}-rtl`]: he
-			}, be),
-			style: Se,
-			filterNode: Re,
+			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,
 			getNodeProps: $,
 			getDataSet: Q,
 			nodeList: rt,
-			onMouseDown: ze,
+			onMouseDown: Be,
 			ariaProps: {
 				role: "tree",
-				"aria-multiselectable": Le,
+				"aria-multiselectable": Re,
 				tabIndex: 0,
-				...s(ge)
+				...s(_e)
 			}
 		})
 	});
 }
-var he = ce(me);
-he.displayName = c.displayName;
+var ge = le(he);
+ge.displayName = c.displayName;
 //#endregion
-export { he as default };
+export { ge as default };
 /* 独立思考，明辨是非 */

package/tree/context.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 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-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 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-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 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-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 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-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 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-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 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-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 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-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 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";

package/tree-select/index.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { TREE_SELECT_COMPONENT_INFO as e } from "../utils/names.js";
 import t from "../tree/Node.js";
 import { SHOW_CHILD as n, SHOW_PARENT as r } from "../tree/utils.js";

package/tree-select/utils.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { isArray as e, isPlainObject as t, isUndefinedOrNull as n } from "../utils/is.js";
 //#region components/pc/tree-select/utils.ts
 var r = {

package/trigger/Trigger.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { isArray as e, isExist as t, isFunction as n, isHTMLElement as r, isPlainObject as i, isScrollElement as a, isString as ee, isStringOrNumber as te, isTrue as ne, isUndefined as o } from "../utils/is.js";
 import { Esc as re } from "../utils/keyboardCode.js";
 import ie from "../utils/callbackOriginRef.js";

package/trigger/getPopupStyle.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { isArray as e, isNumber as t, isServerRendering as n, isUndefined as r } from "../utils/is.js";
 import { getArrowProp as i } from "./utils.js";
 import "react";

package/trigger/index.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { TRIGGER_COMPONENT_INFO as e } from "../utils/names.js";
 import { EventsByTriggerNeed as t } from "./utils.js";
 import n from "./Trigger.js";

package/trigger/utils.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { isFalse as e, isObject as t, isTrue as n } from "../utils/is.js";
 import { merge as r } from "../utils/lodash.js";
 import { object_exports as i } from "../utils/object.js";

package/typewriter/Typewriter.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import e from "../utils/className.js";
 import { TYPEWRITER_COMPONENT_INFO as t } from "../utils/names.js";
 import n from "../hooks/use-merge-props/index.js";

package/typewriter/index.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { TYPEWRITER_COMPONENT_INFO as e } from "../utils/names.js";
 import t from "./Typewriter.js";
 export * from "@unicom-cloud/ui-common/border-beam";

package/typography/Base.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { isPlainObject as e, isUndefined as t } from "../utils/is.js";
 import n from "../hooks/use-controllable-value/index.js";
 import r from "../utils/className.js";

package/typography/EditContent.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { isFunction as e } from "../utils/is.js";
 import t from "../utils/className.js";
 import n from "../utils/mergedToString.js";

package/typography/Ellipsis.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { isFunction as e, isPlainObject as t, isServerRendering as n } from "../utils/is.js";
 import r from "../hooks/use-controllable-value/index.js";
 import i from "../utils/className.js";

package/typography/Operations.js

@@ -1,4 +1,4 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
+/* 潘启宝 2026-06-17 16:36:33 星期三 山东省济南市 */
 import { isArray as e, isFunction as t, isPlainObject as n } from "../utils/is.js";
 import r from "../utils/mergedToString.js";
 import i from "../hooks/use-keyboard-event/index.js";