bkui-vue 3.0.4 → 3.0.5

package/dist/index.esm.js

@@ -31378,7 +31378,7 @@ var xk = _i(/* @__PURE__ */ f({
 	nodeEnterView: wk,
 	nodeSelected: wk
 }, $ = /* @__PURE__ */ function(e) {
-	return e.DEPTH = "__depth", e.HAS_CHILD = "__has_child", e.INDEX = "__index", e.IS_ASYNC = "__is_async", e.IS_ASYNC_INIT = "__is_async_init", e.IS_CACHED = "__is_cached", e.IS_CHECKED = "__is_checked", e.IS_INDETERMINATE = "__is_indeterminate", e.IS_LOADING = "__is_loading", e.IS_MATCH = "__is_match", e.IS_NULL = "__IS_NULL", e.IS_OPEN = "__is_open", e.IS_ROOT = "__is_root", e.IS_SELECTED = "__is_selected", e.ORDER = "__order", e.PARENT = "__parent", e.PATH = "__path", e.TREE_NODE_ATTR = "__attr__", e.UUID = "__uuid", e;
+	return e.DEPTH = "__depth", e.HAS_CHILD = "__has_child", e.INDEX = "__index", e.IS_ASYNC = "__is_async", e.IS_ASYNC_INIT = "__is_async_init", e.IS_CACHED = "__is_cached", e.IS_CHECKED = "__is_checked", e.IS_INDETERMINATE = "__is_indeterminate", e.IS_LOADING = "__is_loading", e.IS_MATCH = "__is_match", e.IS_NULL = "__IS_NULL", e.IS_OPEN = "__is_open", e.IS_ROOT = "__is_root", e.IS_SELECTED = "__is_selected", e.ORDER = "__order", e.PARENT = "__parent", e.PATH = "__path", e.HAS_NEXT_SIBLING = "__has_next_sibling", e.TREE_NODE_ATTR = "__attr__", e.UUID = "__uuid", e;
 }({}), Ek = {
 	__is_open: "isOpen",
 	__is_selected: "selected",
@@ -31471,10 +31471,37 @@ var xk = _i(/* @__PURE__ */ f({
 		enabled: Y.bool.def(!1),
 		callback: Y.func.def(void 0)
 	})]).def(!1)
-}, kk = (e) => ({ renderEmpty: (t) => d(gC, {
+}, kk = /* @__PURE__ */ f({
+	name: "BkTreeNodeRow",
+	props: {
+		item: {
+			type: Object,
+			required: !0
+		},
+		showTree: {
+			type: Boolean,
+			default: !0
+		},
+		version: {
+			type: Number,
+			default: 0
+		},
+		globalVersion: {
+			type: Number,
+			default: 0
+		},
+		renderFn: {
+			type: Function,
+			required: !0
+		}
+	},
+	setup(e) {
+		return () => (e.version, e.globalVersion, e.renderFn(e.item, e.showTree));
+	}
+}), Ak = (e) => ({ renderEmpty: (t) => d(gC, {
 	scene: "part",
 	type: t
-}, { default: () => [e.emptyText] }) }), Ak = (e) => {
+}, { default: () => [e.emptyText] }) }), jk = (e) => {
 	let t = {
 		enabled: e.intersectionObserver,
 		once: !1,
@@ -31521,7 +31548,7 @@ var xk = _i(/* @__PURE__ */ f({
 			return Array.from(r).filter((e) => e.offsetHeight + e.offsetTop >= i && e.offsetTop < i);
 		}
 	};
-}, jk = (e, t) => {
+}, Mk = (e, t) => {
 	let { getChildNodes: n, getNodeAttr: r, getParentNode: i, getSchemaVal: a, isRootNode: o } = t, s = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Set(), l = (e) => {
 		let t = a(e);
 		if (!t) return;
@@ -31586,7 +31613,7 @@ var xk = _i(/* @__PURE__ */ f({
 		},
 		isNodeIndeterminate: h
 	};
-}, Mk = (e, t, n = {}) => {
+}, Nk = (e, t, n = {}) => {
 	let r = (t) => {
 		if (!t) return null;
 		if (e.schema.has(t)) return t;
@@ -31613,12 +31640,15 @@ var xk = _i(/* @__PURE__ */ f({
 			}
 			l[i] = a, (i === $.IS_CHECKED || i === $.IS_INDETERMINATE) && e.syncCheckedState?.(t), s.silent || (n.onSchemaChange?.(t, i, a), e.notifySchemaChange?.(t, i, a));
 		}
-	}, s = (t) => e.nodeMap?.get(`${t}`) ?? e.data.find((e) => `${u(e)}` == `${t}`), c = (e, t, n) => {
+	}, s = (t) => {
+		if (!(t == null || t === "")) return e.nodeMap?.get(`${t}`);
+	}, c = (e, t, n, r) => {
 		if (Array.isArray(e)) {
-			Array.prototype.forEach.call(e, (r) => o(s(r), t, n, e));
+			Array.prototype.forEach.call(e, (i) => o(s(i), t, n, e, r));
 			return;
 		}
-		o(s(e), t, n, e);
+		let i = s(e);
+		i && o(i, t, n, e, r);
 	}, l = (e) => a(e, $.PATH), u = (e) => {
 		let n = a(e, $.UUID);
 		if (n != null && n !== "") return n;
@@ -31629,15 +31659,23 @@ var xk = _i(/* @__PURE__ */ f({
 		if (i && (e.childMap?.get(i)?.length ?? 0) > 0) return !0;
 		let o = t?.children || "children";
 		return !!(I(n)?.[o]?.length || n?.[o]?.length);
-	}, p = (e) => !!a(e, $.IS_MATCH), m = (e) => !!a(e, $.IS_CHECKED), h = (e) => a(a(e, $.PARENT), $.UUID), g = (e) => !!a(e, $.IS_LOADING), _ = (e) => a(e, $.PARENT), v = (e) => !!a(e, $.IS_MATCH), y = (e, t) => a(s(e), t), b = (e) => y(e, $.INDEX), x = (e) => a(e, $.INDEX), S = (t) => {
-		if (typeof t == "string") return !!y(t, $.IS_ROOT);
+	}, p = (e) => !!a(e, $.IS_MATCH), m = (e) => !!a(e, $.IS_CHECKED), h = (e) => a(a(e, $.PARENT), $.UUID), g = (e) => !!a(e, $.IS_LOADING), _ = (e) => a(e, $.PARENT), v = (e) => !!a(e, $.IS_MATCH), b = (e, t) => a(s(e), t), x = (e) => b(e, $.INDEX), S = (e) => a(e, $.INDEX), C = (t) => {
+		if (typeof t == "string") return !!b(t, $.IS_ROOT);
 		if (a(t, $.IS_ROOT)) return !0;
 		if (a(t, $.PARENT)) return !1;
 		let n = r(t);
 		return !!n && !!e.rootNodes?.includes(n);
-	}, C = (e) => h(s(e)), w = (e) => l(s(e)), T = (e, t) => {
+	}, w = (e) => h(s(e)), T = (e) => l(s(e)), E = (e, t) => {
 		o(e, $.IS_LOADING, t);
-	}, E = (e) => typeof e == "object" && e ? d(e) : typeof e == "string" ? !!y(e, $.IS_OPEN) : !1, D = (e, t) => a(a(e, $.PARENT), t), O = (e) => E(a(e, $.PARENT)), k = (e) => S(e) || E(e) || O(e), A = (e, n) => {
+	}, D = (e) => typeof e == "object" && e ? d(e) : typeof e == "string" ? !!b(e, $.IS_OPEN) : !1, O = (e, t) => a(a(e, $.PARENT), t), k = (e) => {
+		if (C(e)) return !0;
+		let t = _(e);
+		for (; t;) {
+			if (!d(t)) return !1;
+			t = _(t);
+		}
+		return !0;
+	}, A = (e, n) => {
 		let r = e.split("-").reduce((e, n) => {
 			let r = Number(n);
 			return Array.isArray(e) ? e[r] : e[t.children][r];
@@ -31650,14 +31688,14 @@ var xk = _i(/* @__PURE__ */ f({
 		return i?.[o] || n?.[o] || [];
 	}, M = (e) => s(e), N = (e) => {
 		let n = e;
-		return typeof n == "string" && (n = M(n)), S(n) ? { [t.children]: t.data } : _(n);
+		return typeof n == "string" && (n = M(n)), C(n) ? { [t.children]: t.data } : _(n);
 	}, P = (e) => ({
 		[Ek[$.IS_LOADING]]: a(e, $.IS_LOADING),
 		[Ek[$.HAS_CHILD]]: f(e),
 		[Ek[$.IS_MATCH]]: p(e),
 		[Ek[$.IS_CHECKED]]: m(e),
 		[Ek[$.IS_OPEN]]: d(e),
-		[Ek[$.IS_ROOT]]: S(e),
+		[Ek[$.IS_ROOT]]: C(e),
 		fullPath: a(e, $.PATH),
 		uuid: u(e),
 		parent: a(e, $.PARENT),
@@ -31670,21 +31708,21 @@ var xk = _i(/* @__PURE__ */ f({
 		getNodeById: s,
 		getNodeParentId: h,
 		getParentNodeData: N,
-		getNodePathById: w,
-		getNodeAttrById: y,
-		getNodeParentIdById: C,
-		getNodeIndexById: b,
-		getNodeIndexByNode: x,
-		getRootNodeList: () => e.rootNodes ?? e.data.filter((e) => S(e)),
-		getParentNodeAttr: D,
+		getNodePathById: T,
+		getNodeAttrById: b,
+		getNodeParentIdById: w,
+		getNodeIndexById: x,
+		getNodeIndexByNode: S,
+		getRootNodeList: () => e.rootNodes ?? e.data.filter((e) => C(e)),
+		getParentNodeAttr: O,
 		getParentNode: _,
 		setNodeAttr: o,
 		setNodeAttrById: c,
 		getNodePath: l,
-		isRootNode: S,
+		isRootNode: C,
 		isNodeOpened: d,
 		hasChildNode: f,
-		isItemOpen: E,
+		isItemOpen: D,
 		isNodeChecked: m,
 		isNodeMatched: p,
 		isNodeLoading: g,
@@ -31693,11 +31731,11 @@ var xk = _i(/* @__PURE__ */ f({
 		getSourceNodeByUID: M,
 		isMatchedNode: v,
 		resolveScopedSlotParam: P,
-		setTreeNodeLoading: T,
-		extendNodeAttr: (e) => Object.assign({}, e, { [$.TREE_NODE_ATTR]: P(e) }),
+		setTreeNodeLoading: E,
+		extendNodeAttr: (e) => y(Object.assign({}, I(e), { [$.TREE_NODE_ATTR]: P(e) })),
 		getChildNodes: j,
-		extendNodeScopedData: (e) => ({
-			data: e,
+		extendNodeScopedData: (e) => y({
+			data: I(e),
 			attributes: P(e)
 		}),
 		getIntersectionResponse: (e) => {
@@ -31715,10 +31753,10 @@ var xk = _i(/* @__PURE__ */ f({
 			};
 		}
 	};
-}, Nk = "1px dashed #c3cdd7", Pk = (e, t, n = null, r = null, i = null, a = []) => {
+}, Pk = "1px dashed #c3cdd7", Fk = (e, t, n = null, r = null, i = null, a = []) => {
 	let o = e[t];
-	return typeof o == "boolean" ? o ? r : i : Fk(n, e, t, a);
-}, Fk = (e, t, n, r = []) => {
+	return typeof o == "boolean" ? o ? r : i : Ik(n, e, t, a);
+}, Ik = (e, t, n, r = []) => {
 	let i = t[n];
 	if (typeof i == "string") return typeof e == "object" && e ? (Object.prototype.hasOwnProperty.call(e, i) || console.error(`cannot find node label with key ${i}`), e[i]) : i;
 	if (typeof i == "function") {
@@ -31727,19 +31765,19 @@ var xk = _i(/* @__PURE__ */ f({
 		console.error("props label with function return value is not string, please check and return string");
 		return;
 	}
-}, Ik = (e, t) => Fk(e, t, "label"), Lk = (e, t) => ({
-	"--level-line": Pk(t, "levelLine", e, Nk, null, ["tree"]),
+}, Lk = (e, t) => Ik(e, t, "label"), Rk = (e, t) => ({
+	"--level-line": Fk(t, "levelLine", e, Pk, null, ["tree"]),
 	"--lineHeight": `${t.lineHeight}px`,
 	"--indent": `${t.indent}px`,
 	"--offset-left": `${t.offsetLeft}px`
-}), Rk = (e, t, n, r = !0) => {
+}), zk = (e, t, n, r = !0) => {
 	let { schema: i } = n, a = i.get(e)?.[$.DEPTH] ?? i.get(I(e))?.[$.DEPTH];
 	return r ? {
 		"--depth": a,
-		...typeof t.levelLine == "function" ? { "--level-line": Pk(t, "levelLine", e, Nk, null, ["node"]) } : {}
+		...typeof t.levelLine == "function" ? { "--level-line": Fk(t, "levelLine", e, Pk, null, ["node"]) } : {}
 	} : {};
-}, zk = (e, t) => e.get(t) || e.get(I(t)) || {}, Bk = (e, t, n, r = !0) => {
-	let { __is_root: i, __is_open: a, __parent: o, __depth: s } = zk(t, e), c = i ?? (o == null && (s === 0 || s === void 0)), { resolveClassName: l } = X();
+}, Bk = (e, t) => e.get(t) || e.get(I(t)) || {}, Vk = (e, t, n, r = !0) => {
+	let { __is_root: i, __is_open: a, __parent: o, __depth: s } = Bk(t, e), c = i ?? (o == null && (s === 0 || s === void 0)), { resolveClassName: l } = X();
 	return {
 		"is-root": !!c,
 		[`${l("tree-node")}`]: !0,
@@ -31747,8 +31785,8 @@ var xk = _i(/* @__PURE__ */ f({
 		"is-virtual-render": n.virtualRender,
 		"level-line": n.levelLine && r
 	};
-}, Vk = (e, t) => {
-	let { __is_checked: n, __is_indeterminate: r, __is_selected: i } = zk(t, e), { resolveClassName: a } = X();
+}, Hk = (e, t) => {
+	let { __is_checked: n, __is_indeterminate: r, __is_selected: i } = Bk(t, e), { resolveClassName: a } = X();
 	return {
 		"is-checked": n,
 		"is-indeterminate": r,
@@ -31757,24 +31795,24 @@ var xk = _i(/* @__PURE__ */ f({
 		"node-leaf": e.is_leaf,
 		[`${a("node-row")}`]: !0
 	};
-}, Hk = (e, t) => e === t ? !0 : e == null || t == null ? !1 : `${e}` == `${t}`, Uk = (e = [], t, n, r) => {
+}, Uk = (e, t) => e === t ? !0 : e == null || t == null ? !1 : `${e}` == `${t}`, Wk = (e = [], t, n, r) => {
 	for (let i of e) {
-		if (Hk(i?.[n], t)) return i;
+		if (Uk(i?.[n], t)) return i;
 		let e = i?.[r];
 		if (Array.isArray(e) && e.length) {
-			let i = Uk(e, t, n, r);
+			let i = Wk(e, t, n, r);
 			if (i) return i;
 		}
 	}
 	return null;
-}, Wk = (e = [], t, n, r, i) => {
-	let a = Uk(e, t, n, r);
+}, Gk = (e = [], t, n, r, i) => {
+	let a = Wk(e, t, n, r);
 	return a && i(a), e;
-}, Gk = (e = [], t, n, r) => {
+}, Kk = (e = [], t, n, r) => {
 	let i = (e, a) => {
 		for (let o = 0; o < e.length; o++) {
 			let s = e[o];
-			if (Hk(s?.[n], t)) {
+			if (Uk(s?.[n], t)) {
 				let [t] = e.splice(o, 1);
 				return {
 					node: t,
@@ -31798,10 +31836,10 @@ var xk = _i(/* @__PURE__ */ f({
 		...i(e, null),
 		data: e
 	};
-}, Kk = (e = [], t, n, r, i, a) => {
+}, qk = (e = [], t, n, r, i, a) => {
 	let { dropType: o, willInsertAfter: s = !0 } = a;
 	if (o === "child") {
-		let a = Uk(e, n, r, i);
+		let a = Wk(e, n, r, i);
 		if (!a) return {
 			data: e,
 			parentNode: null,
@@ -31820,7 +31858,7 @@ var xk = _i(/* @__PURE__ */ f({
 	let c = (e, a) => {
 		for (let o = 0; o < e.length; o++) {
 			let l = e[o];
-			if (Hk(l?.[r], n)) {
+			if (Uk(l?.[r], n)) {
 				let n = s ? o + 1 : o;
 				return e.splice(n, 0, t), {
 					parentNode: a,
@@ -31844,10 +31882,10 @@ var xk = _i(/* @__PURE__ */ f({
 		data: e,
 		...c(e, null)
 	};
-}, qk = (e = [], t, n, r, i, a) => {
-	let o = Gk(e, t, r, i);
+}, Jk = (e = [], t, n, r, i, a) => {
+	let o = Kk(e, t, r, i);
 	if (!o.node) return null;
-	let s = Kk(e, o.node, n, r, i, a);
+	let s = qk(e, o.node, n, r, i, a);
 	return s.targetNode ? {
 		trigger: "drag",
 		data: e,
@@ -31859,8 +31897,8 @@ var xk = _i(/* @__PURE__ */ f({
 		sourceIndex: o.index,
 		targetIndex: s.index
 	} : null;
-}, Jk = (e) => e ?? { __IS_NULL: !0 }, Yk = (e, t, n) => Array.isArray(t) ? t.some((t) => Yk(e, t, n)) : typeof t == "string" || typeof t == "number" ? Hk(t, n) : e === t, Xk = (e, t) => typeof e.showCheckbox == "function" ? e.showCheckbox(t) : e.showCheckbox, Zk = (e) => typeof e.cascade == "boolean" ? e.cascade : !!e.checkStrictly, Qk = (e, t, n, r = {}) => {
-	let { setNodeAttr: i, getNodeId: a, getNodePath: o, getNodeAttr: s, resolveScopedSlotParam: c, setTreeNodeLoading: l } = Mk(t, e), u = /* @__PURE__ */ new Map(), d = (e) => {
+}, Yk = (e) => e ?? { __IS_NULL: !0 }, Xk = (e, t, n) => Array.isArray(t) ? t.some((t) => Xk(e, t, n)) : typeof t == "string" || typeof t == "number" ? Uk(t, n) : e === t, Zk = (e, t) => typeof e.showCheckbox == "function" ? e.showCheckbox(t) : e.showCheckbox, Qk = (e) => typeof e.cascade == "boolean" ? e.cascade : !!e.checkStrictly, $k = (e, t, n, r = {}) => {
+	let { setNodeAttr: i, getNodeId: a, getNodePath: o, getNodeAttr: s, resolveScopedSlotParam: c, setTreeNodeLoading: l } = Nk(t, e), u = /* @__PURE__ */ new Map(), d = (e) => {
 		r.onTreeDataChange?.(e), n?.emit(Ck.NODE_ASYNC_LOAD, e);
 	}, f = (t, n, s) => {
 		if (typeof t == "object" && t) {
@@ -31869,7 +31907,7 @@ var xk = _i(/* @__PURE__ */ f({
 			i(n, $.IS_OPEN, !0);
 			let l = Array.isArray(t) ? t : [t];
 			if (!r.onTreeDataChange) {
-				if (Wk(e.data, c, e.nodeKey || $.UUID, e.children, (t) => {
+				if (Gk(e.data, c, e.nodeKey || $.UUID, e.children, (t) => {
 					t[e.children] = l;
 				}), !e.nodeKey && o(n)) {
 					let t = `${o(n)}`.split("-").reduce((t, n) => {
@@ -31881,7 +31919,7 @@ var xk = _i(/* @__PURE__ */ f({
 				return Promise.resolve(t);
 			}
 			let f = r.getTreeData?.() ?? e.data;
-			return Wk(f, c, e.nodeKey || $.UUID, e.children, (t) => {
+			return Gk(f, c, e.nodeKey || $.UUID, e.children, (t) => {
 				t[Ek[$.IS_OPEN]] = !0, t[e.children] = l;
 			}), d({
 				trigger: "async",
@@ -31921,14 +31959,14 @@ var xk = _i(/* @__PURE__ */ f({
 		asyncNodeClick: p,
 		deepAutoOpen: m
 	};
-}, $k = (e, t, n, r, i) => {
-	let a = e.selected, { setNodeAttr: o, setNodeAttrById: s, getSchemaVal: c, getNodeAttr: l, getNodeId: u, getChildNodes: f, isRootNode: p, hasChildNode: h, isItemOpen: g, isNodeOpened: _, isNodeLoading: y, isNodeChecked: b, getParentNode: S, resolveScopedSlotParam: C, extendNodeAttr: w, extendNodeScopedData: T, getRootNodeList: E } = Mk(n, e), { resolveClassName: D } = X(), { registerNextLoop: O, syncNodeOpenState: k, scheduleUiRefresh: A } = i, { setNodeCheckedState: j, setDescendantChecked: M, forEachDescendant: N, updateParentChecked: P, getCheckedEmitPayload: F, rebuildCheckedSetsFromList: I, clearAllCheckedState: L, isNodeIndeterminate: R } = jk(n, {
-		getChildNodes: f,
-		getNodeAttr: l,
-		getParentNode: S,
-		getSchemaVal: c,
-		isRootNode: p
-	}), { asyncNodeClick: z, deepAutoOpen: ee } = Qk(e, n, t, i), B = (e) => g(e) ? d(nc, { class: [D("tree-icon"), D("node-prefix")] }, null) : d(Xs, { class: [D("tree-icon"), D("node-prefix")] }, null), te = (e) => {
+}, eA = (e, t, n, r, i) => {
+	let a = e.selected, o = null, { setNodeAttr: s, setNodeAttrById: c, getSchemaVal: l, getNodeAttr: u, getNodeId: f, getChildNodes: p, isRootNode: h, hasChildNode: g, isItemOpen: _, isNodeOpened: y, isNodeLoading: b, isNodeChecked: S, getParentNode: C, resolveScopedSlotParam: w, extendNodeAttr: T, extendNodeScopedData: E } = Nk(n, e), { resolveClassName: D } = X(), { registerNextLoop: O, syncNodeOpenState: k, scheduleUiRefresh: A } = i, { setNodeCheckedState: j, setDescendantChecked: M, forEachDescendant: N, updateParentChecked: P, getCheckedEmitPayload: F, rebuildCheckedSetsFromList: I, clearAllCheckedState: L, isNodeIndeterminate: R } = Mk(n, {
+		getChildNodes: p,
+		getNodeAttr: u,
+		getParentNode: C,
+		getSchemaVal: l,
+		isRootNode: h
+	}), { asyncNodeClick: z, deepAutoOpen: ee } = $k(e, n, t, i), B = (e) => _(e) ? d(nc, { class: [D("tree-icon"), D("node-prefix")] }, null) : d(Xs, { class: [D("tree-icon"), D("node-prefix")] }, null), te = (e) => {
 		if (typeof e == "string") return e;
 		if (typeof e == "object" && e) {
 			if (v(e)) return e;
@@ -31939,26 +31977,26 @@ var xk = _i(/* @__PURE__ */ f({
 			}, r);
 		}
 		return null;
-	}, V = (e) => t.slots.nodeLoading?.(ve(e)) ?? y(e) ? d(Qc, null, null) : "", H = (n) => {
-		if (t.slots.nodeAction) return t.slots.nodeAction(ve(n));
-		let r = null;
-		if (y(n)) return V(n);
-		if (typeof e.prefixIcon == "function" && (r = e.prefixIcon(ve(n), "node_action"), r !== "default")) return te(r);
-		if (r === "default" || typeof e.prefixIcon == "boolean" && e.prefixIcon) {
+	}, V = (e) => t.slots.nodeLoading?.(ye(e)) ?? b(e) ? d(Qc, null, null) : "", H = (n, r) => {
+		if (t.slots.nodeAction) return t.slots.nodeAction(r ?? ye(n));
+		let i = null;
+		if (b(n)) return V(n);
+		if (typeof e.prefixIcon == "function" && (i = e.prefixIcon(r ?? ye(n), "node_action"), i !== "default")) return te(i);
+		if (i === "default" || typeof e.prefixIcon == "boolean" && e.prefixIcon) {
 			let t = typeof e.autoCheckChildren == "function" ? e.autoCheckChildren(n) : e.autoCheckChildren;
-			if (h(n) || n.async || !t) return g(n) ? d(Es, { class: D("node-prefix") }, null) : d(Wc, { class: D("node-prefix") }, null);
+			if (g(n) || n.async || !t) return _(n) ? d(Es, { class: D("node-prefix") }, null) : d(Wc, { class: D("node-prefix") }, null);
 		}
 		return null;
-	}, ne = (n) => {
+	}, ne = (n, r) => {
 		if (!e.showNodeTypeIcon) return null;
-		if (t.slots.nodeType) return t.slots.nodeType(ve(n));
-		let r = null;
-		return typeof e.prefixIcon == "function" && (r = e.prefixIcon(ve(n), "node_type"), r !== "default") ? te(r) : r === "default" || typeof e.prefixIcon == "boolean" && e.prefixIcon ? p(n) || h(n) ? B(n) : d(ol, { class: [D("tree-icon"), D("node-prefix")] }, null) : null;
+		if (t.slots.nodeType) return t.slots.nodeType(r ?? ye(n));
+		let i = null;
+		return typeof e.prefixIcon == "function" && (i = e.prefixIcon(r ?? ye(n), "node_type"), i !== "default") ? te(i) : i === "default" || typeof e.prefixIcon == "boolean" && e.prefixIcon ? h(n) || g(n) ? B(n) : d(ol, { class: [D("tree-icon"), D("node-prefix")] }, null) : null;
 	}, U = (e, t, n) => {
 		N(e, (e) => {
 			Array.isArray(t) ? t.forEach((t, r) => {
-				o(e, t, n[r], void 0, { silent: !0 });
-			}) : o(e, t, n, void 0, { silent: !0 });
+				s(e, t, n[r], void 0, { silent: !0 });
+			}) : s(e, t, n, void 0, { silent: !0 });
 		});
 	}, re = (t) => e.async?.trigger?.length ? e.async?.trigger.includes(t) : !0, ie = () => {
 		x(() => {
@@ -31967,143 +32005,156 @@ var xk = _i(/* @__PURE__ */ f({
 		});
 	}, ae = (t, n, r = {}) => {
 		let i = !!n;
-		j(t, i, !1), Zk(e) && (M(t, i), P(t)), r.refresh !== !1 && A?.(), r.emitEvent !== !1 && ie();
+		j(t, i, !1), Qk(e) && (M(t, i), P(t)), r.refresh !== !1 && (Qk(e) ? A?.() : A?.(t)), r.emitEvent !== !1 && ie();
 	}, oe = (e, t, n) => {
-		n?.preventDefault(), n?.stopImmediatePropagation(), n?.stopPropagation(), ae(e, t), me(e, n, "checked");
-	}, se = (e) => R(e), ce = (t) => Xk(e, T(t)) ? d("span", {
-		class: "node-check-box",
-		onClick: ye
-	}, [d(Qp, {
-		disabled: e.disableCheck,
-		indeterminate: se(t),
-		modelValue: b(t),
-		size: "small",
-		onChange: (e, n) => oe(t, !!e, n)
-	}, null)]) : null, W = (e, n = null, r = null, i = !0) => {
-		let a = n === null ? !g(e) : !!n;
-		if (o(e, $.IS_OPEN, a, void 0, { silent: !0 }), k?.(e, a), i) {
-			let n = g(e) ? Ck.NODE_EXPAND : Ck.NODE_COLLAPSE;
-			t.emit(n, e, C(e), c(e), r);
+		n?.preventDefault(), n?.stopImmediatePropagation(), n?.stopPropagation(), ae(e, t), he(e, n, "checked");
+	}, se = (e) => R(e), ce = (t, n) => {
+		if (typeof e.showCheckbox == "function") {
+			if (!Zk(e, n?.data ? n : E(t))) return null;
+		} else if (!Zk(e, t)) return null;
+		return d("span", {
+			class: "node-check-box",
+			onClick: be
+		}, [d(Qp, {
+			disabled: e.disableCheck,
+			indeterminate: se(t),
+			modelValue: S(t),
+			size: "small",
+			onChange: (e, n) => oe(t, !!e, n)
+		}, null)]);
+	}, W = (e, n = null, r = null, i = !0) => {
+		let a = n === null ? !_(e) : !!n;
+		if (s(e, $.IS_OPEN, a, void 0, { silent: !0 }), k?.(e, a), i) {
+			let n = _(e) ? Ck.NODE_EXPAND : Ck.NODE_COLLAPSE;
+			t.emit(n, e, w(e), l(e), r);
 		}
 	}, G = (e, t, n) => {
 		if (Array.isArray(e)) {
-			e.forEach((e) => o(Jk(e), t, n));
+			e.forEach((e) => s(Yk(e), t, n));
 			return;
 		}
-		o(Jk(e), t, n);
+		s(Yk(e), t, n);
 	}, le = (e, t = !0, n = !1) => {
-		let r = Jk(e);
+		let r = Yk(e);
 		if (!r[$.IS_NULL]) {
-			if (n && t && !p(r)) {
-				let e = [], t = S(r);
-				for (; t;) e.unshift(t), t = S(t);
+			if (n && t && !h(r)) {
+				let e = [], t = C(r);
+				for (; t;) e.unshift(t), t = C(t);
 				e.forEach((e) => {
-					g(e) || W(e, !0, null, !1);
+					_(e) || W(e, !0, null, !1);
 				});
 			}
 			W(r, t, null, !1);
 		}
 	}, ue = (e, t, n, r = !1) => {
-		let i = Jk(e);
+		let i = Yk(e);
 		if (i[$.IS_NULL]) return;
 		let a = Array.isArray(t) ? t : [t], o = Array.isArray(n) ? n : [n];
 		if (r) {
-			if (a.forEach((e, t) => G(i, e, o[t])), !p(i)) {
-				let e = S(i);
+			if (a.forEach((e, t) => G(i, e, o[t])), !h(i)) {
+				let e = C(i);
 				if (!e) return;
 				a.forEach((t, i) => {
-					l(e, t) !== n && ue(e, t, o[i], r);
+					u(e, t) !== n && ue(e, t, o[i], r);
 				});
 			}
 		} else a.forEach((e, t) => G(i, e, o[t]));
 	}, de = (e, t, n) => {
-		if (g(e)) {
+		if (_(e)) {
 			W(e, !1, t, !0);
 			return;
 		}
-		l(e, $.IS_ASYNC) && re(n) ? z(e).finally(() => {
-			l(e, $.IS_LOADING) ? O("setNodeOpenedAfterLoading", {
+		u(e, $.IS_ASYNC) && re(n) ? z(e).finally(() => {
+			u(e, $.IS_LOADING) ? O("setNodeOpenedAfterLoading", {
 				type: "once",
 				fn: () => W(e, !0, t, !0)
 			}) : W(e, !0, t, !0);
 		}) : W(e, !0, t, !0);
 	}, K = (e, t) => {
 		e.stopImmediatePropagation(), e.stopPropagation(), e.preventDefault(), de(t, e, "expand");
-	}, fe = (r, i = !0, c = !0, d = !1, f = "") => {
-		let p = Array.isArray(r) ? r : [r];
-		if (!p.length) return;
-		let m = Jk(p[0]);
-		if (typeof m == "number" || typeof m == "string" || typeof m == "symbol") {
-			let e = String(m);
-			m = n.nodeMap?.get(e) ?? n.data.find((t) => `${u(t)}` === e) ?? { [$.IS_NULL]: !0 };
-		}
-		if (!m[$.IS_NULL]) {
-			if (!e.selectable || typeof e.selectable == "function" && !e.selectable(r) || e.disabledFolderSelectable && m.is_folder === !0) {
-				console.warn("props.selectable is false or undefined, please set selectable with true");
-				return;
-			}
-			a != null && s(a, $.IS_SELECTED, !i), e.selected && e.selected !== a && s(e.selected, $.IS_SELECTED, !i), o(m, $.IS_SELECTED, i), a = u(m), d && t.emit(Ck.NODE_SELECTED, {
-				selected: i,
-				node: m
-			}), c && p.length === 1 && le(m, !0, !0), c && l(m, $.IS_ASYNC) && re(f) && z(m).then(() => {
-				x(() => {
-					p.shift(), fe(p, i, c, d, f);
-				});
-			});
+	}, fe = (e) => {
+		if (!(e == null || e === "")) return Array.isArray(e) ? fe(e[0]) : typeof e == "string" || typeof e == "number" || typeof e == "symbol" ? e : typeof e == "object" ? f(e) : e;
+	}, pe = (r, i = !0, l = !0, d = !1, p = "") => {
+		let m = Array.isArray(r) ? r : [r];
+		if (!m.length) return;
+		let h = Yk(m[0]);
+		if (typeof h == "number" || typeof h == "string" || typeof h == "symbol") {
+			let e = String(h);
+			h = n.nodeMap?.get(e) ?? { [$.IS_NULL]: !0 };
+		}
+		if (h[$.IS_NULL]) return;
+		if (!e.selectable || typeof e.selectable == "function" && !e.selectable(r) || e.disabledFolderSelectable && h.is_folder === !0) {
+			console.warn("props.selectable is false or undefined, please set selectable with true");
+			return;
 		}
-	}, pe = (t) => typeof e.nodeContentAction == "function" ? Reflect.apply(e.nodeContentAction, void 0, [{ node: t }]) : typeof e.nodeContentAction == "string" ? [e.nodeContentAction] : Array.isArray(e.nodeContentAction) ? e.nodeContentAction : [
+		let g = f(h), _ = g == null ? "" : String(g), v = a == null ? "" : String(a);
+		if (i && v !== "" && v === _ && u(h, $.IS_SELECTED)) return;
+		o && o !== h ? (s(o, $.IS_SELECTED, !1, void 0, { silent: !0 }), A?.(o)) : v && v !== _ && c(a, $.IS_SELECTED, !1, { silent: !0 });
+		let y = fe(e.selected), b = y == null ? "" : String(y);
+		b && b !== _ && b !== v && c(y, $.IS_SELECTED, !1, { silent: !0 }), s(h, $.IS_SELECTED, i, void 0, { silent: !0 }), o = h, a = g, A?.(h), d && t.emit(Ck.NODE_SELECTED, {
+			selected: i,
+			node: h
+		}), l && m.length === 1 && le(h, !0, !0), l && u(h, $.IS_ASYNC) && re(p) && z(h).then(() => {
+			x(() => {
+				m.shift(), pe(m, i, l, d, p);
+			});
+		});
+	}, me = (t) => typeof e.nodeContentAction == "function" ? Reflect.apply(e.nodeContentAction, void 0, [{ node: t }]) : typeof e.nodeContentAction == "string" ? [e.nodeContentAction] : Array.isArray(e.nodeContentAction) ? e.nodeContentAction : [
 		"selected",
 		"expand",
 		"click"
-	], me = (n, r, i) => {
-		let a = pe(n), o = _(n), s = i === "checked";
-		if (a.includes("selected") && fe(n, !0, !1, !0, i), a.includes("expand") && !o && !s && de(n, r, "expand"), a.includes("collapse") && o && !s && de(n, r, "expand"), a.includes("click") && !s) {
+	], he = (n, r, i) => {
+		let a = me(n), o = y(n), s = i === "checked";
+		if (a.includes("selected") && pe(n, !0, !1, !0, i), a.includes("expand") && !o && !s && de(n, r, "expand"), a.includes("collapse") && o && !s && de(n, r, "expand"), a.includes("click") && !s) {
 			let e = Ck.NODE_CLICK;
-			t.emit(e, n, C(n), c(n), r);
+			t.emit(e, n, w(n), l(n), r);
 		}
-		a.includes("checked") && i !== "checked" && Xk(e, T(n)) && !e.disableCheck && oe(n, !b(n), r);
-	}, he = (e, t) => {
-		if (p(t)) return !1;
-		let n = l(t, $.DEPTH) ?? 0;
+		a.includes("checked") && i !== "checked" && Zk(e, E(n)) && !e.disableCheck && oe(n, !S(n), r);
+	}, ge = (e, t) => {
+		if (h(t)) return !1;
+		let n = u(t, $.DEPTH) ?? 0;
 		if (e === n) return !0;
 		if (e > n) return !1;
 		let r = t;
-		for (let t = n; t > e; t--) if (r = S(r), !r) return !1;
-		let i = S(r), a = i ? f(i) : E(), o = a.indexOf(r);
-		return o >= 0 && o < a.length - 1;
-	}, ge = (t) => {
-		if (!e.levelLine || p(t)) return null;
-		let n = (e) => ({ "--depth": e }), r = (l(t, $.DEPTH) ?? 0) + 1;
-		return Array(r).fill("").map((e, t) => t).filter((e) => he(e, t)).filter((e) => e > 0).map((e) => d("span", {
-			style: n(r - e),
+		for (let t = n; t > e; t--) if (r = C(r), !r) return !1;
+		return !!u(r, $.HAS_NEXT_SIBLING);
+	}, _e = (t) => {
+		if (!e.levelLine || h(t)) return null;
+		let n = (u(t, $.DEPTH) ?? 0) + 1, r = [];
+		for (let e = 1; e < n; e++) ge(e, t) && r.push(d("span", {
+			style: { "--depth": n - e },
 			class: "node-virtual-line"
 		}, null));
-	}, _e = (n) => t.slots.node ? t.slots.node?.(ve(n)) : t.slots.default ? t.slots.default?.(T(n)) : [Ik(n, e)], ve = (t) => e.keepSlotData ? T(t) : w(t), ye = (e) => {
+		return r.length ? r : null;
+	}, ve = (n, r) => t.slots.node ? t.slots.node?.(r?.nodeScoped ?? ye(n)) : t.slots.default ? t.slots.default?.(r?.defaultScoped ?? E(n)) : [Lk(n, e)], ye = (t) => e.keepSlotData ? E(t) : T(t), be = (e) => {
 		e.stopImmediatePropagation(), e.stopPropagation();
 	};
 	return {
 		renderTreeNode: (r, i = !0) => {
-			let a = H(r);
+			let a = null, o = null, s = () => (a ||= ye(r), a), c = () => e.keepSlotData ? s() : (o ||= E(r), o), l = t.slots.nodeAction || t.slots.nodeType || t.slots.nodeAppend || t.slots.node || typeof e.prefixIcon == "function" ? s() : null, u = H(r, l);
 			return d("div", {
-				key: u(r),
-				class: [Vk(r, n.schema), { [D("tree-node-draggable")]: e.draggable || e.dragSort }],
-				"data-tree-node": u(r),
+				key: f(r),
+				class: [Hk(r, n.schema), { [D("tree-node-draggable")]: e.draggable || e.dragSort }],
+				"data-tree-node": f(r),
 				draggable: e.draggable || e.dragSort
 			}, [d("div", {
-				style: Rk(r, e, n, i),
-				class: Bk(r, n.schema, e, i),
-				onClick: (e) => me(r, e, "click")
+				style: zk(r, e, n, i),
+				class: Vk(r, n.schema, e, i),
+				onClick: (e) => he(r, e, "click")
 			}, [
 				d("div", {
-					class: [D("node-action"), a ? "" : "empty-child"],
+					class: [D("node-action"), u ? "" : "empty-child"],
 					onClick: (e) => K(e, r)
-				}, [a]),
+				}, [u]),
 				d("div", { class: D("node-content") }, [
-					[ce(r), ne(r)],
-					d("span", { class: D("node-text") }, [_e(r)]),
-					t.slots.nodeAppend?.(ve(r))
+					[ce(r, typeof e.showCheckbox == "function" ? c() : null), ne(r, l)],
+					d("span", { class: D("node-text") }, [ve(r, {
+						nodeScoped: t.slots.node ? l ?? s() : void 0,
+						defaultScoped: t.slots.default ? c() : void 0
+					})]),
+					t.slots.nodeAppend?.(l ?? s())
 				]),
-				i && ge(r)
+				i && _e(r)
 			])]);
 		},
 		handleTreeNodeClick: de,
@@ -32111,7 +32162,7 @@ var xk = _i(/* @__PURE__ */ f({
 		asyncNodeClick: z,
 		setNodeAction: G,
 		setNodeOpened: W,
-		setSelect: fe,
+		setSelect: pe,
 		setOpen: le,
 		setNodeAttribute: ue,
 		isIndeterminate: se,
@@ -32122,8 +32173,8 @@ var xk = _i(/* @__PURE__ */ f({
 		rebuildCheckedSetsFromList: I,
 		clearAllCheckedState: L
 	};
-}, eA = (e, t, n, r, i = {}) => {
-	let { getSourceNodeByUID: a, getParentNode: o, extendNodeAttr: s, getNodeId: l } = Mk(r, e), { resolveClassName: u } = X(), d = c(() => typeof e.disableDrag == "function"), f = c(() => typeof e.disableDrop == "function"), p = "", m = "move", h = null, g = !0, _ = A(!1), v = () => n.value?.$el, y = (e) => {
+}, tA = (e, t, n, r, i = {}) => {
+	let { getSourceNodeByUID: a, getParentNode: o, extendNodeAttr: s, getNodeId: l } = Nk(r, e), { resolveClassName: u } = X(), d = c(() => typeof e.disableDrag == "function"), f = c(() => typeof e.disableDrop == "function"), p = "", m = "move", h = null, g = !0, _ = A(!1), v = () => n.value?.$el, y = (e) => {
 		if (!(e instanceof HTMLElement)) return null;
 		let t = v(), n = e.closest("[data-tree-node]");
 		return !n || !t?.contains(n) ? null : n;
@@ -32177,7 +32228,7 @@ var xk = _i(/* @__PURE__ */ f({
 		}
 		let r = u(t === "before" ? "tree-drop-before" : t === "after" ? "tree-drop-after" : "tree-drop-inner");
 		e.classList.add(r);
-	}, F = (e) => e ? (i.onTreeDataChange?.(e), e) : null, I = (t, n, r, a = !0) => F(qk(i.getTreeData?.() ?? e.data, `${l(t)}`, `${l(n)}`, e.nodeKey || $.UUID, e.children, {
+	}, F = (e) => e ? (i.onTreeDataChange?.(e), e) : null, I = (t, n, r, a = !0) => F(Jk(i.getTreeData?.() ?? e.data, `${l(t)}`, `${l(n)}`, e.nodeKey || $.UUID, e.children, {
 		dropType: r,
 		willInsertAfter: a
 	})), L = () => {
@@ -32272,43 +32323,49 @@ var xk = _i(/* @__PURE__ */ f({
 	}), H(() => [e.draggable, e.dragSort], () => x(() => re())), E(() => {
 		U(), M();
 	}), { isDragging: _ };
-}, tA = (e) => {
+}, nA = (e) => {
 	let t = L(e, "search"), n = (e) => [
 		"string",
 		"number",
 		"boolean"
-	].includes(typeof e), r = (e, t) => e === t, i = (e, t) => {
+	].includes(typeof e), r = (e, t) => e === t, i = (e, t) => e.test(`${t}`), a = (e, t) => `${t}`.toLowerCase().includes(e), o = c(() => t.value === void 0 || t.value === !1), s = c(() => t.value && typeof t.value == "object" ? t.value : { value: "" }), l = c(() => s.value.resultType ?? "tree"), u = c(() => s.value.showChildNodes ?? !1), d = c(() => o.value ? "" : n(t.value) ? t.value : s.value.value ?? ""), f = c(() => !o.value && `${d.value}`.length > 0), p = c(() => l.value === "tree"), m = () => {
+		if (o.value) return () => !0;
+		let e = d.value;
+		if (`${e}`.length === 0) return () => !1;
+		if (n(t.value)) {
+			let t = `${e}`;
+			try {
+				let e = new RegExp(t, "i");
+				return (t) => i(e, t);
+			} catch {
+				let e = t.toLowerCase();
+				return (t) => a(e, t);
+			}
+		}
+		let { match: c = "fuzzy" } = s.value;
+		if (typeof c == "function") return (t, n) => !!c(e, t, n);
+		if (c === "full") return (t) => r(e, t);
+		let l = `${e}`;
 		try {
-			return RegExp(`${e}`, "i").test(`${t}`);
+			let e = new RegExp(l, "i");
+			return (t) => i(e, t);
 		} catch {
-			return `${t}`.toLowerCase().includes(`${e}`.toLowerCase());
+			let e = l.toLowerCase();
+			return (t) => a(e, t);
 		}
-	}, a = (e, t) => Reflect.apply(e, void 0, t), o = c(() => t.value === void 0 || t.value === !1), s = c(() => t.value && typeof t.value == "object" ? t.value : { value: "" }), l = c(() => s.value.resultType ?? "tree"), u = c(() => s.value.showChildNodes ?? !1), d = () => n(t.value) ? t.value : s.value.value ?? "";
+	};
 	return {
-		searchFn: (e, c) => {
-			if (o.value) return !0;
-			let l = d();
-			if (`${l}`.length === 0) return !1;
-			if (n(t.value)) return a(i, [
-				l,
-				e,
-				c
-			]);
-			let { match: u = "fuzzy" } = s.value;
-			return a(typeof u == "function" ? u : u === "fuzzy" ? i : r, [
-				l,
-				e,
-				c
-			]);
-		},
+		searchFn: (e, t) => m()(e, t),
+		createMatcher: m,
+		searchValue: d,
 		refSearch: t,
-		isSearchActive: c(() => o.value ? !1 : `${d()}`.length > 0),
+		isSearchActive: f,
 		isSearchDisabled: o,
 		resultType: l,
-		isTreeUI: c(() => l.value === "tree"),
+		isTreeUI: p,
 		showChildNodes: u
 	};
-}, nA = (e) => y(e), rA = Ek[$.IS_OPEN], iA = Ek[$.IS_CHECKED], aA = Ek[$.IS_SELECTED], oA = Ek[$.IS_ASYNC], sA = Ek[$.IS_MATCH], cA = Ek[$.IS_CACHED], lA = Ek[$.IS_LOADING], uA = (e) => {
+}, rA = (e) => y(e), iA = Ek[$.IS_OPEN], aA = Ek[$.IS_CHECKED], oA = Ek[$.IS_SELECTED], sA = Ek[$.IS_ASYNC], cA = Ek[$.IS_MATCH], lA = Ek[$.IS_CACHED], uA = Ek[$.IS_LOADING], dA = (e) => {
 	let t = (t = void 0, n = null) => {
 		let { data: r, children: i } = e, a = [], o = [], s = 0, c = 0, l = /* @__PURE__ */ new WeakMap(), u = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new WeakMap(), f = [];
 		function p(e, t, n, r) {
@@ -32366,7 +32423,7 @@ var xk = _i(/* @__PURE__ */ f({
 				if (typeof T != "object") continue;
 				let O = I(T), k = x === null ? `${D}` : `${x}-${D}`, A = `${S(O)}`, j = O[i], M = !!(j && j.length);
 				m || (O[$.UUID] = A);
-				let N = !!C(O, rA, $.IS_OPEN, h);
+				let N = !!C(O, iA, $.IS_OPEN, h);
 				if (g) N && r && p(r, $.IS_OPEN, !0, w);
 				else if (r) {
 					let e = !!l.get(r)?.[$.IS_OPEN];
@@ -32374,13 +32431,13 @@ var xk = _i(/* @__PURE__ */ f({
 				}
 				let P = !1;
 				if (_) {
-					let t = y ? Yk(O, e.selected, A) : !1;
-					P = !!C(O, aA, $.IS_SELECTED, t);
+					let t = y ? Xk(O, e.selected, A) : !1;
+					P = !!C(O, oA, $.IS_SELECTED, t);
 				}
 				let F = !1;
-				if (b && Xk(e, { data: O })) {
-					let t = v ? Yk(O, e.checked, A) : !1;
-					F = !!C(O, iA, $.IS_CHECKED, t);
+				if (b && Zk(e, { data: O })) {
+					let t = v ? Xk(O, e.checked, A) : !1;
+					F = !!C(O, aA, $.IS_CHECKED, t);
 				}
 				let L = {
 					[$.DEPTH]: n,
@@ -32391,19 +32448,29 @@ var xk = _i(/* @__PURE__ */ f({
 					[$.PATH]: k,
 					[$.IS_ROOT]: r === null,
 					[$.ORDER]: s,
+					[$.HAS_NEXT_SIBLING]: !1,
 					[$.IS_SELECTED]: P,
-					[$.IS_MATCH]: !!C(O, sA, $.IS_MATCH, !1),
+					[$.IS_MATCH]: !!C(O, cA, $.IS_MATCH, !1),
 					[$.IS_OPEN]: N,
 					[$.IS_CHECKED]: F,
-					[$.IS_CACHED]: !!C(O, cA, $.IS_CACHED, !1),
-					[$.IS_ASYNC]: C(O, oA, $.IS_ASYNC, null),
-					[$.IS_LOADING]: !!C(O, lA, $.IS_LOADING, !1),
+					[$.IS_CACHED]: !!C(O, lA, $.IS_CACHED, !1),
+					[$.IS_ASYNC]: C(O, sA, $.IS_ASYNC, null),
+					[$.IS_LOADING]: !!C(O, uA, $.IS_LOADING, !1),
 					[$.IS_INDETERMINATE]: !1
 				};
-				if (F && a.push(O), N && (c += 1), l.set(O, L), u.set(A, O), r === null) f.push(O);
-				else {
+				if (F && a.push(O), N && (c += 1), l.set(O, L), u.set(A, O), r === null) {
+					if (f.length) {
+						let e = f[f.length - 1], t = l.get(e);
+						t && (t[$.HAS_NEXT_SIBLING] = !0);
+					}
+					f.push(O);
+				} else {
 					let e = d.get(r);
-					e || (e = [], d.set(r, e)), e.push(O);
+					if (e || (e = [], d.set(r, e)), e.length) {
+						let t = e[e.length - 1], n = l.get(t);
+						n && (n[$.HAS_NEXT_SIBLING] = !0);
+					}
+					e.push(O);
 				}
 				o.push(O), s += 1, M && E(j, n + 1, O, k);
 			}
@@ -32421,14 +32488,14 @@ var xk = _i(/* @__PURE__ */ f({
 		];
 	}, n = t(), r = /* @__PURE__ */ new Map(), i = [], a = [], o = P({
 		data: n[0],
-		schema: nA(n[1]),
-		nodeMap: nA(n[2]),
-		childMap: nA(n[3]),
+		schema: rA(n[1]),
+		nodeMap: rA(n[2]),
+		childMap: rA(n[3]),
 		rootNodes: n[4],
 		openCount: n[5] || 0,
 		checkedList: n[6] || [],
 		levelLineSchema: {}
-	}), { asyncNodeClick: s, deepAutoOpen: c } = Qk(e, o), l = (e) => {
+	}), { asyncNodeClick: s, deepAutoOpen: c } = $k(e, o), l = (e) => {
 		i.push(e);
 	}, u = (e, t, n = !0) => {
 		n && r.has(e) && r.delete(e), r.set(e, t);
@@ -32452,12 +32519,23 @@ var xk = _i(/* @__PURE__ */ f({
 		m.push(e);
 	}, g = (e, n = o.schema) => {
 		let r = t(e, n);
-		o.schema = nA(r[1]), o.nodeMap = nA(r[2]), o.childMap = nA(r[3]), o.rootNodes = r[4], o.openCount = r[5] || 0, o.checkedList = r[6] || [], o.data = r[0], m.forEach((e) => e());
+		o.schema = rA(r[1]), o.nodeMap = rA(r[2]), o.childMap = rA(r[3]), o.rootNodes = r[4], o.openCount = r[5] || 0, o.checkedList = r[6] || [], o.data = r[0], m.forEach((e) => e());
 	};
 	return H(() => e.data, (t) => {
 		g(t, o.schema), e.async?.callback && e.async?.deepAutoOpen === "every" && c(), p();
 	}, { deep: !!e.watchDataDeep }), e.selectable && w(() => {
-		H(() => e.selected, (e) => {
+		let t = (n) => {
+			if (!(n == null || n === "")) {
+				if (Array.isArray(n)) return t(n[0]);
+				if (typeof n == "string" || typeof n == "number") return n;
+				if (typeof n == "object") {
+					let t = n, r = e.nodeKey;
+					return r && t[r] !== void 0 && t[r] !== null ? t[r] : t[$.UUID];
+				}
+				return n;
+			}
+		};
+		H(() => t(e.selected), (e) => {
 			a.length = 0, i.forEach((t) => {
 				Reflect.apply(t, void 0, [e]), a.push(() => Reflect.apply(t, void 0, [e]));
 			}), u("afterSelectWatch", a);
@@ -32474,16 +32552,28 @@ var xk = _i(/* @__PURE__ */ f({
 		onAfterRebuild: h,
 		onSelected: l
 	};
-}, dA = (e, t) => {
-	let { checkNodeIsOpen: n, getChildNodes: r, getNodeAttr: i, getNodeOrder: a, getSchemaVal: o, isNodeOpened: s } = t, c = F([]), l = F(0), u = !1, d = (e) => {
-		c.value = e;
-	}, f = () => {
-		u || (u = !0, x(() => {
-			u = !1, l.value += 1;
-		}));
-	}, p = (t) => {
+}, fA = 50, pA = (e, t) => {
+	let { checkNodeIsOpen: n, getChildNodes: r, getNodeAttr: i, getNodeId: a, getNodeOrder: o, getSchemaVal: s, isNodeOpened: c } = t, l = F([]), u = F(0), d = F(0), f = k({}), p = !1, m = !1, h = /* @__PURE__ */ new Set(), g = (e) => {
+		l.value = e;
+	}, _ = (e) => {
+		let t = a(e);
+		return t == null ? "" : `${t}`;
+	}, v = () => {
+		p = !1, m || h.size > fA ? u.value += 1 : h.forEach((e) => {
+			e && (f[e] = (f[e] || 0) + 1);
+		}), m = !1, h.clear(), d.value += 1;
+	}, y = (e) => {
+		if (e) {
+			let t = _(e);
+			t ? h.add(t) : m = !0;
+		} else m = !0;
+		p || (p = !0, x(v));
+	}, b = (e) => {
+		let t = _(e);
+		return t && f[t] || 0;
+	}, S = (t) => {
 		if (!t && (e.openCount || 0) <= 0 && e.rootNodes?.length) {
-			d(e.rootNodes.slice());
+			g(e.rootNodes.slice());
 			return;
 		}
 		let r = t ?? n, i = [], a = e.data;
@@ -32491,187 +32581,260 @@ var xk = _i(/* @__PURE__ */ f({
 			let t = a[e];
 			r(t) && i.push(t);
 		}
-		d(i);
-	}, m = (e, t) => {
+		g(i);
+	}, C = (e) => {
+		g(e.slice());
+	}, w = (e, t) => {
 		let n = r(e);
 		for (let e = 0, r = n.length; e < r; e++) {
 			let r = n[e];
-			t.push(r), s(r) && m(r, t);
+			t.push(r), c(r) && w(r, t);
 		}
-	}, h = (e) => {
-		let t = c.value, n = I(e);
+	}, T = (t) => {
+		let n = e.data, r = 0, i = n.length - 1;
+		for (; r <= i;) {
+			let e = r + i >> 1, a = Number(o(n[e]));
+			if (a === t) return e;
+			a < t ? r = e + 1 : i = e - 1;
+		}
+		return -1;
+	}, E = (t) => {
+		let n = Number(o(t)), r = Number(i(t, $.DEPTH) ?? 0);
+		if (Number.isNaN(n)) return;
+		let a = T(n) + 1;
+		if (a <= 0) return;
+		let c = e.data;
+		for (let t = a, n = c.length; t < n && !(Number(i(c[t], $.DEPTH) ?? -1) <= r); t++) {
+			let n = s(c[t]);
+			n?.[$.IS_OPEN] && (n[$.IS_OPEN] = !1, (e.openCount || 0) > 0 && --e.openCount);
+		}
+	}, D = (e) => {
+		let t = l.value, n = I(e);
 		for (let r = 0, i = t.length; r < i; r++) {
 			let i = t[r];
 			if (i === e || i === n || I(i) === n) return r;
 		}
 		return -1;
-	}, g = (e) => {
-		let t = c.value;
+	}, O = (e) => {
+		let t = l.value;
 		if (!t.length) return -1;
-		let n = a(I(e)) ?? a(e);
-		if (n == null || Number.isNaN(Number(n))) return h(e);
+		let n = o(I(e)) ?? o(e);
+		if (n == null || Number.isNaN(Number(n))) return D(e);
 		let r = 0, i = t.length - 1;
 		for (; r <= i;) {
-			let e = r + i >> 1, o = Number(a(t[e]));
-			if (o === Number(n)) return e;
-			o < Number(n) ? r = e + 1 : i = e - 1;
+			let e = r + i >> 1, a = Number(o(t[e]));
+			if (a === Number(n)) return e;
+			a < Number(n) ? r = e + 1 : i = e - 1;
 		}
-		return h(e);
-	}, _ = (t, n, r) => {
+		return D(e);
+	}, A = (t, n, r) => {
 		for (let i = n; i < r; i++) {
-			let n = o(t[i]);
+			let n = s(t[i]);
 			n?.[$.IS_OPEN] && (n[$.IS_OPEN] = !1, (e.openCount || 0) > 0 && --e.openCount);
 		}
-	}, v = (e) => {
-		let t = g(e);
+	}, j = (e) => {
+		let t = O(e);
 		if (t < 0) {
-			f();
+			y(e);
 			return;
 		}
-		let n = c.value, r = Number(i(e, $.DEPTH) ?? 0), a = n[t + 1];
-		if (a && Number(i(a, $.DEPTH) ?? -1) > r) {
-			f();
+		let n = l.value, a = Number(i(e, $.DEPTH) ?? 0), o = n[t + 1];
+		if (o && Number(i(o, $.DEPTH) ?? -1) > a) {
+			y(e);
 			return;
 		}
-		let o = [];
-		if (m(e, o), !o.length) {
-			f();
+		let s = r(e);
+		if (!s.length) {
+			y(e);
 			return;
 		}
-		d(n.slice(0, t + 1).concat(o, n.slice(t + 1)));
-	}, y = (e) => {
-		let t = g(e);
+		let u = [];
+		for (let e = 0, t = s.length; e < t; e++) {
+			let t = s[e];
+			u.push(t), c(t) && w(t, u);
+		}
+		g(n.slice(0, t + 1).concat(u, n.slice(t + 1))), y(e);
+	}, M = (e) => {
+		let t = O(e);
 		if (t < 0) {
-			f();
+			E(e), y(e);
 			return;
 		}
-		let n = c.value, r = Number(i(e, $.DEPTH) ?? 0), a = t + 1;
+		let n = l.value, r = Number(i(e, $.DEPTH) ?? 0), a = t + 1;
 		for (; a < n.length && !(Number(i(n[a], $.DEPTH) ?? -1) <= r);) a += 1;
-		if (a === t + 1) {
-			f();
+		if (E(e), a === t + 1) {
+			y(e);
 			return;
 		}
-		_(n, t + 1, a), d(n.slice(0, t + 1).concat(n.slice(a)));
+		A(n, t + 1, a), g(n.slice(0, t + 1).concat(n.slice(a))), y(e);
 	};
-	return p(), {
-		visibleNodes: c,
-		uiVersion: l,
-		rebuildVisibleNodes: p,
-		expandVisibleNode: v,
-		collapseVisibleNode: y,
+	return S(), {
+		visibleNodes: l,
+		uiVersion: u,
+		uiTick: d,
+		nodeUiVersions: f,
+		getNodeUiVersion: b,
+		rebuildVisibleNodes: S,
+		setVisibleNodes: C,
+		expandVisibleNode: j,
+		collapseVisibleNode: M,
 		syncNodeOpenState: (e, t) => {
 			if (t) {
-				v(e);
+				j(e);
 				return;
 			}
-			y(e);
+			M(e);
 		},
-		scheduleUiRefresh: f
+		scheduleUiRefresh: y
 	};
-}, fA = _i(/* @__PURE__ */ f({
+}, mA = _i(/* @__PURE__ */ f({
 	name: "Tree",
 	props: Ok,
 	emits: Tk,
 	setup(e, t) {
-		let n = A(), r = A(e.data), { flatData: i, onSelected: a, rebuildData: o, registerNextLoop: s, onAfterRebuild: c } = uA(e), { checkNodeIsOpen: l, isRootNode: u, isNodeOpened: f, isNodeChecked: p, isNodeMatched: m, hasChildNode: h, getNodeId: g, getNodeAttr: _, getNodeById: v, getParentNode: y, getRootNodeList: b, getIntersectionResponse: S, getChildNodes: C, getNodePath: T, getSchemaVal: E } = Mk(i, e), { searchFn: D, isSearchActive: O, refSearch: j, isSearchDisabled: M, isTreeUI: N, resultType: P, showChildNodes: F } = tA(e), I = k(/* @__PURE__ */ new Set()), L = k(/* @__PURE__ */ new Set()), R = /* @__PURE__ */ new Map(), { visibleNodes: z, uiVersion: ee, rebuildVisibleNodes: B, syncNodeOpenState: te, scheduleUiRefresh: V } = dA(i, {
+		let n = A(), r = A(e.data), { flatData: i, onSelected: a, rebuildData: o, registerNextLoop: s, onAfterRebuild: c } = dA(e), { checkNodeIsOpen: l, isRootNode: u, isNodeOpened: f, isNodeChecked: p, isNodeMatched: m, hasChildNode: h, getNodeId: g, getNodeAttr: _, getNodeById: v, getParentNode: y, getRootNodeList: b, getIntersectionResponse: S, getChildNodes: C, getNodePath: T, getSchemaVal: E, setNodeAttr: D } = Nk(i, e), { createMatcher: O, searchValue: k, isSearchActive: j, isTreeUI: M, resultType: N, showChildNodes: P } = nA(e), F = /* @__PURE__ */ new Set(), I = /* @__PURE__ */ new Set(), L = [], R = /* @__PURE__ */ new Map(), { visibleNodes: z, uiVersion: ee, uiTick: B, nodeUiVersions: te, rebuildVisibleNodes: V, setVisibleNodes: ne, syncNodeOpenState: U, scheduleUiRefresh: re } = pA(i, {
 			checkNodeIsOpen: l,
-			getChildNodes: C,
+			getChildNodes: (e) => {
+				let t = C(e);
+				return j.value ? t.filter((e) => I.has(`${g(e)}`)) : t;
+			},
 			getNodeAttr: _,
+			getNodeId: g,
 			getNodePath: T,
 			getNodeOrder: (e) => _(e, $.ORDER) ?? 0,
 			getSchemaVal: E,
 			isNodeOpened: f
-		}), ne = (e) => O.value ? L.has(`${g(e)}`) : l(e), U = (e, t) => {
-			if (O.value) {
-				B(ne);
+		}), ie = (e) => {
+			if (!I.has(`${g(e)}`)) return !1;
+			let t = y(e);
+			for (; t;) {
+				if (!f(t)) return !1;
+				t = y(t);
+			}
+			return !0;
+		}, ae = () => {
+			if (!M.value) {
+				ne(L);
 				return;
 			}
-			te(e, t);
+			let e = [];
+			for (let t = 0, n = L.length; t < n; t++) {
+				let n = L[t];
+				ie(n) && e.push(n);
+			}
+			ne(e);
+		}, oe = (e, t) => {
+			if (j.value && !M.value) {
+				re(e);
+				return;
+			}
+			U(e, t);
 		};
 		i.notifySchemaChange = (e, t) => {
-			t !== $.IS_OPEN && V();
+			t !== $.IS_OPEN && re(e);
 		};
-		let re = (e) => `${g(e)}`, ie = (e) => {
-			let t = re(e);
-			R.has(t) || R.set(t, f(e)), Se(e, $.IS_OPEN, !0, !1);
-		}, ae = () => {
+		let se = (e) => `${g(e)}`, ce = (e) => {
+			let t = se(e);
+			R.has(t) || R.set(t, f(e)), D(e, $.IS_OPEN, !0, void 0, { silent: !0 });
+		}, W = () => {
 			R.forEach((e, t) => {
 				let n = v(t);
-				n && Se(n, $.IS_OPEN, e, !1);
+				n && D(n, $.IS_OPEN, e, void 0, { silent: !0 });
 			}), R.clear();
-		}, oe = (e) => {
+		}, G = () => {
+			let e = 0, t = i.data;
+			for (let n = 0, r = t.length; n < r; n++) E(t[n])?.[$.IS_OPEN] && (e += 1);
+			i.openCount = e;
+		}, le = () => {
+			F.forEach((e) => {
+				let t = v(e);
+				t && D(t, $.IS_MATCH, !1, void 0, { silent: !0 });
+			}), F.clear();
+		}, ue = (e) => {
 			let t = y(e);
 			for (; t;) {
-				let e = re(t);
-				L.add(e), ie(t), t = y(t);
+				let e = se(t);
+				I.add(e), ce(t), t = y(t);
 			}
-		}, se = (e) => {
-			(i.childMap?.get(e) ?? []).forEach((e) => {
-				L.add(re(e)), se(e);
-			});
-		}, { getLastVisibleElement: ce, intersectionObserver: W } = Ak(e), G = () => {
+		}, de = (e) => {
+			let t = C(e);
+			for (let e = 0, n = t.length; e < n; e++) {
+				let n = t[e];
+				I.add(se(n)), h(n) && ce(n), de(n);
+			}
+		}, { getLastVisibleElement: K, intersectionObserver: fe } = jk(e), pe = () => {
 			let e = /* @__PURE__ */ new Set();
 			return i.data.forEach((t) => {
 				f(t) && e.add(`${g(t)}`);
 			}), e;
-		}, le = (t) => `${t?.[e.nodeKey || $.UUID]}`, ue = (t) => t?.[e.children] || [], de = Ek[$.IS_OPEN], K = (e, t) => {
-			t.delete(le(e)), ue(e).forEach((e) => {
-				K(e, t);
+		}, me = (t) => `${t?.[e.nodeKey || $.UUID]}`, he = (t) => t?.[e.children] || [], ge = Ek[$.IS_OPEN], _e = (e, t) => {
+			t.delete(me(e)), he(e).forEach((e) => {
+				_e(e, t);
 			});
-		}, fe = (t, n) => {
+		}, ve = (t, n) => {
 			if (n.trigger !== "drag" || n.dropType !== "child" || !n.targetNode) return;
 			let r = e.dragTargetOpenState || "inherit";
 			if (r === "inherit") return;
-			let i = le(n.targetNode);
-			r === "expand" && t.add(i), r === "collapse" && K(n.targetNode, t);
-		}, pe = (e, t, n = !0) => {
+			let i = me(n.targetNode);
+			r === "expand" && t.add(i), r === "collapse" && _e(n.targetNode, t);
+		}, ye = (e, t, n = !0) => {
 			e.forEach((e) => {
-				let r = n && t.has(le(e));
-				(r || !n || Object.prototype.hasOwnProperty.call(e, de)) && (e[de] = r), pe(ue(e), t, r);
+				let r = n && t.has(me(e));
+				(r || !n || Object.prototype.hasOwnProperty.call(e, ge)) && (e[ge] = r), ye(he(e), t, r);
 			});
-		}, me = (e) => {
-			let t = G();
-			fe(t, e), pe(e.data, t);
-		}, he = (n) => {
-			n.trigger === "drag" && me(n), r.value = n.data ?? [], o(r.value), t.emit(Ck.NODE_DATA_CHANGE, n), e.onDataChange?.(n);
-		}, { renderTreeNode: ge, handleTreeNodeClick: _e, setOpen: ve, setNodeAction: ye, setSelect: be, asyncNodeClick: xe, setNodeAttribute: Se, applyCheckedChange: Ce, emitCheckedChange: we, rebuildCheckedSetsFromList: Te, clearAllCheckedState: Ee } = $k(e, t, i, z, {
+		}, be = (e) => {
+			let t = pe();
+			ve(t, e), ye(e.data, t);
+		}, xe = (n) => {
+			n.trigger === "drag" && be(n), r.value = n.data ?? [], o(r.value), t.emit(Ck.NODE_DATA_CHANGE, n), e.onDataChange?.(n);
+		}, { renderTreeNode: Se, handleTreeNodeClick: Ce, setOpen: we, setNodeAction: Te, setSelect: Ee, asyncNodeClick: De, applyCheckedChange: Oe, emitCheckedChange: ke, rebuildCheckedSetsFromList: Ae, clearAllCheckedState: je } = eA(e, t, i, z, {
 			getTreeData: () => r.value,
-			onTreeDataChange: he,
+			onTreeDataChange: xe,
 			registerNextLoop: s,
-			syncNodeOpenState: U,
-			scheduleUiRefresh: V
-		}), De = () => {
-			Te(i.checkedList || []), B(O.value ? ne : void 0);
-		};
-		c(De), H(() => i.data, De);
-		let Oe = bi(120, () => {
-			if (!O.value) {
-				R.size && ae(), I.size && (I.forEach((e) => {
-					let t = v(e);
-					t && Se(t, $.IS_MATCH, !1, !1);
-				}), I.clear()), L.clear(), B();
+			syncNodeOpenState: oe,
+			scheduleUiRefresh: re
+		}), Me = () => {
+			if (W(), le(), I.clear(), L = [], !j.value) {
+				G(), V(), re();
 				return;
 			}
-			ae(), I.clear(), L.clear(), i.data.forEach((t) => {
-				let n = !M.value && D(Ik(t, e), t), r = re(t);
-				n && (I.add(r), L.add(r)), Se(t, [$.IS_MATCH, $.IS_OPEN], [n, f(t)], !1);
-			}), i.data.forEach((e) => {
-				I.has(re(e)) && (P.value === "tree" && oe(e), F.value && (ie(e), se(e)));
-			}), B(ne);
-		});
-		H([
-			j,
-			P,
-			F,
-			O
+			let t = O(), n = i.data, r = [];
+			for (let i = 0, a = n.length; i < a; i++) {
+				let a = n[i];
+				if (!t(Lk(a, e), a)) continue;
+				let o = se(a);
+				F.add(o), I.add(o), r.push(a), D(a, $.IS_MATCH, !0, void 0, { silent: !0 });
+			}
+			for (let e = 0, t = r.length; e < t; e++) {
+				let t = r[e];
+				N.value === "tree" && ue(t), P.value && (ce(t), de(t));
+			}
+			for (let e = 0, t = n.length; e < t; e++) {
+				let t = n[e];
+				I.has(se(t)) && L.push(t);
+			}
+			ae(), re();
+		}, Ne = () => {
+			if (Ae(i.checkedList || []), j.value) {
+				Me();
+				return;
+			}
+			V();
+		};
+		c(Ne), H(() => i.data, Ne);
+		let Pe = bi(120, Me);
+		H(() => [
+			k.value,
+			N.value,
+			P.value
 		], () => {
-			Oe();
+			Pe();
 		}, { immediate: !0 }), w(() => {
 			e.virtualRender && x(() => {
-				Ne();
+				ze();
 			});
 		});
-		let ke = (e, t = !0, n = !1) => {
+		let Fe = (e, t = !0, n = !1) => {
 			((e) => {
 				if (Array.isArray(e)) return e.map((e) => typeof e == "string" || typeof e == "number" ? v(e) : e).filter(Boolean);
 				if (typeof e == "string" || typeof e == "number") {
@@ -32680,19 +32843,19 @@ var xk = _i(/* @__PURE__ */ f({
 				}
 				return [e].filter(Boolean);
 			})(e).forEach((e) => {
-				let n = Jk(e);
-				n[$.IS_NULL] || Ce(n, t, {
+				let n = Yk(e);
+				n[$.IS_NULL] || Oe(n, t, {
 					emitEvent: !1,
 					refresh: !1
 				});
-			}), V(), n && we();
+			}), re(), n && ke();
 		};
 		a((t) => {
-			be(t, !0, e.autoOpenParentNode, !0);
+			Ee(t, !0, e.autoOpenParentNode, !1);
 		}), H(() => e.data, (e) => {
 			r.value = e;
 		});
-		let Ae = () => {
+		let Ie = () => {
 			let t = (n) => (n ?? []).map((n) => {
 				let r = (0, Sk.cloneDeep)(n);
 				if (!r) return r;
@@ -32700,17 +32863,17 @@ var xk = _i(/* @__PURE__ */ f({
 				return r[e.children] = t(a), r;
 			});
 			return t(b());
-		}, je = (e) => e ? {
-			data: Ae(),
+		}, Le = (e) => e ? {
+			data: Ie(),
 			schema: i.schema,
 			levelLineSchema: i.levelLineSchema
 		} : i;
 		H(() => [e.checked], () => {
-			Ee(), ke(e.checked, !0);
+			je(), Fe(e.checked, !0);
 		}, { immediate: !0 });
-		let Me = () => {
+		let Re = () => {
 			n.value?.reset();
-		}, Ne = (t) => {
+		}, ze = (t) => {
 			if (t == null) {
 				n.value.fixToTop({ index: 1 });
 				return;
@@ -32732,85 +32895,117 @@ var xk = _i(/* @__PURE__ */ f({
 				n.value.fixToTop({ index: z.value.findIndex((e) => g(e) === r) + 1 });
 				return;
 			}
+		}, Be = (e, t = !0, n = !1) => {
+			Fe(v(e), t, n);
+		}, Ve = () => {
+			let e = i.data;
+			for (let t = 0, n = e.length; t < n; t++) {
+				let n = E(e[t]);
+				n?.[$.IS_OPEN] && (n[$.IS_OPEN] = !1);
+			}
+			i.openCount = 0, j.value ? ae() : V(), re();
+		}, He = () => {
+			let e = i.data, t = 0;
+			for (let n = 0, r = e.length; n < r; n++) {
+				let r = e[n];
+				if (!h(r)) continue;
+				let i = E(r);
+				i && (i[$.IS_OPEN] || (i[$.IS_OPEN] = !0), t += 1);
+			}
+			i.openCount = t, j.value ? ae() : V(), re();
 		};
 		t.expose({
-			handleTreeNodeClick: _e,
+			handleTreeNodeClick: Ce,
 			isNodeChecked: p,
 			isRootNode: u,
 			isNodeOpened: f,
 			isNodeMatched: m,
 			hasChildNode: h,
-			setOpen: ve,
-			setChecked: ke,
-			setCheckedById: (e, t = !0, n = !1) => {
-				ke(v(e), t, n);
-			},
-			setNodeAction: ye,
-			setNodeOpened: ve,
-			setSelect: be,
-			scrollToTop: Ne,
-			asyncNodeClick: xe,
-			getData: je,
-			reset: Me,
+			setOpen: we,
+			setChecked: Fe,
+			setCheckedById: Be,
+			setNodeAction: Te,
+			setNodeOpened: we,
+			setSelect: Ee,
+			scrollToTop: ze,
+			asyncNodeClick: De,
+			getData: Le,
+			reset: Re,
 			getNodeAttr: _,
-			getParentNode: y
+			getParentNode: y,
+			collapseAll: Ve,
+			expandAll: He,
+			openAllNodes: He
 		});
-		let { renderEmpty: Pe } = kk(e);
-		eA(e, t, n, i, {
+		let { renderEmpty: Ue } = Ak(e);
+		tA(e, t, n, i, {
 			getTreeData: () => r.value,
-			onTreeDataChange: he
+			onTreeDataChange: xe
 		});
-		let Fe = (e) => {
-			if (e.length) return e.map((e) => ge(e, !O.value || N.value));
-			let n = O.value ? "search-empty" : "empty";
-			return t.slots.empty?.() ?? Pe(n);
-		}, Ie = ([r, i, a]) => {
-			if (W.value.enabled && r.offset.y > 5) {
+		let We = (e) => {
+			if (e.length) {
+				let t = !j.value || M.value, n = ee.value;
+				return e.map((e) => {
+					let r = `${g(e)}`;
+					return d(kk, {
+						key: r,
+						item: e,
+						showTree: t,
+						version: te[r] || 0,
+						globalVersion: n,
+						renderFn: Se
+					}, null);
+				});
+			}
+			let n = j.value ? "search-empty" : "empty";
+			return t.slots.empty?.() ?? Ue(n);
+		}, Ge = ([r, i, a]) => {
+			if (fe.value.enabled && r.offset.y > 5) {
 				if (!e.virtualRender) {
-					let e = S(ce(r.offset.y, n.value.refRoot)[0]);
-					W.value?.callback?.(e), t.emit(Ck.NODE_ENTER_VIEW, e);
+					let e = S(K(r.offset.y, n.value.refRoot)[0]);
+					fe.value?.callback?.(e), t.emit(Ck.NODE_ENTER_VIEW, e);
 					return;
 				}
 				let i = S(a.slice(-1)[0]);
-				W.value?.callback?.(i), t.emit(Ck.NODE_ENTER_VIEW, i);
+				fe.value?.callback?.(i), t.emit(Ck.NODE_ENTER_VIEW, i);
 				return;
 			}
-		}, { resolveClassName: Le } = X();
-		return () => (ee.value, d(rh, {
+		}, { resolveClassName: Ke } = X();
+		return () => (B.value, d(rh, {
 			ref: n,
-			style: Lk(null, e),
+			style: Rk(null, e),
 			height: e.height,
-			class: Le("tree"),
-			contentClassName: Le("container"),
+			class: Ke("tree"),
+			contentClassName: Ke("container"),
 			enabled: e.virtualRender,
 			keepAlive: !0,
 			lineHeight: e.lineHeight,
 			list: z.value,
 			rowKey: e.nodeKey || $.UUID,
 			throttleDelay: 0,
-			onContentScroll: Ie
-		}, { default: (e) => Fe(e.data || []) }));
+			onContentScroll: Ge
+		}, { default: (e) => We(e.data || []) }));
 	}
-})), pA = "upload", mA = /* @__PURE__ */ function(e) {
+})), hA = "upload", gA = /* @__PURE__ */ function(e) {
 	return e.BUTTON = "button", e.DRAGGABLE = "draggable", e.PICTURE = "picture", e;
-}({}), hA = /* @__PURE__ */ function(e) {
+}({}), _A = /* @__PURE__ */ function(e) {
 	return e.BINARY = "binary", e.FORMDATA = "formdata", e;
-}({}), gA = /* @__PURE__ */ function(e) {
+}({}), vA = /* @__PURE__ */ function(e) {
 	return e.FAIL = "fail", e.NEW = "new", e.SUCCESS = "success", e.UPLOADING = "uploading", e;
-}({}), _A = [
-	mA.BUTTON,
-	mA.DRAGGABLE,
-	mA.PICTURE
-], vA = [hA.FORMDATA, hA.BINARY], yA = {
+}({}), yA = [
+	gA.BUTTON,
+	gA.DRAGGABLE,
+	gA.PICTURE
+], bA = [_A.FORMDATA, _A.BINARY], xA = {
 	type: {
 		type: String,
 		default: "formdata",
-		validator: (e) => !e || vA.includes(e) ? !0 : (console.error(`invalid type, ${e}, the type must be one of 【${vA.join(" | ")}】`), !1)
+		validator: (e) => !e || bA.includes(e) ? !0 : (console.error(`invalid type, ${e}, the type must be one of 【${bA.join(" | ")}】`), !1)
 	},
 	theme: {
 		type: String,
 		default: "draggable",
-		validator: (e) => !e || _A.includes(e) ? !0 : (console.error(`invalid theme, ${e}, the theme must be one of 【${_A.join(" | ")}】`), !1)
+		validator: (e) => !e || yA.includes(e) ? !0 : (console.error(`invalid theme, ${e}, the theme must be one of 【${yA.join(" | ")}】`), !1)
 	},
 	files: {
 		type: Array,
@@ -32917,17 +33112,17 @@ var xk = _i(/* @__PURE__ */ f({
 };
 //#endregion
 //#region ../../packages/upload/src/upload-list.tsx
-function bA(e) {
+function SA(e) {
 	return typeof e == "function" || Object.prototype.toString.call(e) === "[object Object]" && !v(e);
 }
-var xA = /* @__PURE__ */ f({
+var CA = /* @__PURE__ */ f({
 	name: "UploadList",
 	props: {
-		theme: yA.theme,
-		disabled: yA.disabled,
-		files: yA.files,
-		multiple: yA.multiple,
-		isShowPreview: yA.isShowPreview
+		theme: xA.theme,
+		disabled: xA.disabled,
+		files: xA.files,
+		multiple: xA.multiple,
+		isShowPreview: xA.isShowPreview
 	},
 	emits: [
 		"remove",
@@ -32935,7 +33130,7 @@ var xA = /* @__PURE__ */ f({
 		"retry"
 	],
 	setup(e, { slots: t, emit: r }) {
-		let i = uo("upload"), { resolveClassName: a } = X(), { theme: s, disabled: l, multiple: f, isShowPreview: p } = R(e), h = `${a(pA)}-list`, g = c(() => s.value === mA.PICTURE), _ = c(() => g.value && !f.value), v = c(() => mi({
+		let i = uo("upload"), { resolveClassName: a } = X(), { theme: s, disabled: l, multiple: f, isShowPreview: p } = R(e), h = `${a(hA)}-list`, g = c(() => s.value === gA.PICTURE), _ = c(() => g.value && !f.value), v = c(() => mi({
 			[h]: !0,
 			[`${h}--${s.value}`]: !0,
 			[`${h}--disabled`]: l.value
@@ -32961,7 +33156,7 @@ var xA = /* @__PURE__ */ f({
 		}
 		let C = () => {
 			let n;
-			return d(o, { name: `${h}__item` }, bA(n = e.files.map((e) => {
+			return d(o, { name: `${h}__item` }, SA(n = e.files.map((e) => {
 				let n = mi({
 					[`${h}__item`]: !0,
 					[`${h}__item-picture`]: !0,
@@ -32996,7 +33191,7 @@ var xA = /* @__PURE__ */ f({
 			}, null)])])
 		], T = () => {
 			let n;
-			return d(o, { name: `${h}__item` }, bA(n = e.files.map((e) => {
+			return d(o, { name: `${h}__item` }, SA(n = e.files.map((e) => {
 				let n = mi({
 					[`${h}__item`]: !0,
 					[`${h}__item--${e.status}`]: !0
@@ -33051,16 +33246,16 @@ var xA = /* @__PURE__ */ f({
 		])];
 		return () => d(n, null, [_.value ? t?.innerTrigger?.(e.files?.[0]) : d("ul", { class: v.value }, [g.value ? C() : T(), t?.innerTrigger?.()])]);
 	}
-}), SA = /* @__PURE__ */ f({
+}), wA = /* @__PURE__ */ f({
 	name: "UploadTrigger",
 	props: {
-		theme: yA.theme,
-		disabled: yA.disabled,
-		multiple: yA.multiple,
-		accept: yA.accept,
+		theme: xA.theme,
+		disabled: xA.disabled,
+		multiple: xA.multiple,
+		accept: xA.accept,
 		file: { type: Object },
-		selectChange: yA.selectChange,
-		isShowPreview: yA.isShowPreview
+		selectChange: xA.selectChange,
+		isShowPreview: xA.isShowPreview
 	},
 	emits: [
 		"change",
@@ -33068,7 +33263,7 @@ var xA = /* @__PURE__ */ f({
 		"preview"
 	],
 	setup(e, { slots: t, emit: r }) {
-		let i = uo("upload"), { resolveClassName: a } = X(), { theme: o, disabled: s, file: l, multiple: u, accept: f, isShowPreview: p } = R(e), m = `${a(pA)}-trigger`, h = c(() => o.value === mA.BUTTON), g = c(() => o.value === mA.DRAGGABLE), _ = c(() => o.value === mA.PICTURE), v = c(() => _.value && !u.value), y = c(() => _.value && !f.value ? "image/png,image/jpeg,image/jpg" : f.value), b = A(null), x = c(() => mi({
+		let i = uo("upload"), { resolveClassName: a } = X(), { theme: o, disabled: s, file: l, multiple: u, accept: f, isShowPreview: p } = R(e), m = `${a(hA)}-trigger`, h = c(() => o.value === gA.BUTTON), g = c(() => o.value === gA.DRAGGABLE), _ = c(() => o.value === gA.PICTURE), v = c(() => _.value && !u.value), y = c(() => _.value && !f.value ? "image/png,image/jpeg,image/jpg" : f.value), b = A(null), x = c(() => mi({
 			[m]: !0,
 			[`${m}--${o.value}`]: !0,
 			[`${m}--single-picture`]: v.value,
@@ -33153,7 +33348,7 @@ var xA = /* @__PURE__ */ f({
 			onChange: C
 		}, null)]);
 	}
-}), CA = /* @__PURE__ */ K((/* @__PURE__ */ G(((e, t) => {
+}), TA = /* @__PURE__ */ K((/* @__PURE__ */ G(((e, t) => {
 	(function(n) {
 		if (typeof e == "object") t.exports = n();
 		else if (typeof define == "function" && define.amd) define(n);
@@ -33397,7 +33592,7 @@ var xA = /* @__PURE__ */ f({
 			return t ? p(n) : n;
 		}, m;
 	});
-})))()), wA = "An error occurred during upload", TA = (e, t, n) => {
+})))()), EA = "An error occurred during upload", DA = (e, t, n) => {
 	if (Array.isArray(n)) {
 		let [r, i] = n;
 		if (r instanceof Blob) {
@@ -33409,7 +33604,7 @@ var xA = /* @__PURE__ */ f({
 	}
 	e.append(t, n);
 };
-function EA(e) {
+function OA(e) {
 	let t = e.responseText || e.response;
 	if (!t) return t || {};
 	try {
@@ -33418,7 +33613,7 @@ function EA(e) {
 		return t;
 	}
 }
-var DA = (e) => {
+var kA = (e) => {
 	if (typeof XMLHttpRequest > "u") throw Error("XMLHttpRequest is undefined");
 	let t = new XMLHttpRequest(), { action: n, type: r } = e, i = r === "formdata";
 	t.upload && t.upload.addEventListener("progress", (t) => {
@@ -33429,24 +33624,24 @@ var DA = (e) => {
 	if (i && e.data) {
 		let t = e.data;
 		Array.isArray(t) || (t = [t]), t.forEach((e) => {
-			for (let [t, n] of Object.entries(e)) TA(a, t, n);
+			for (let [t, n] of Object.entries(e)) DA(a, t, n);
 		});
 	}
 	if (i && e.formDataAttributes) {
 		let t = e.formDataAttributes;
 		Array.isArray(t) || (t = [t]), t.forEach((e) => {
-			TA(a, e.name, e.value);
+			DA(a, e.name, e.value);
 		});
 	}
 	if (i && a.append(e.filename, e.file, e.file.name), t.addEventListener("error", () => {
-		let n = /* @__PURE__ */ Error(wA), r = EA(t);
-		r && (n = Error(r.message || wA)), console.log(r, n), e.onError(n);
+		let n = /* @__PURE__ */ Error(EA), r = OA(t);
+		r && (n = Error(r.message || EA)), console.log(r, n), e.onError(n);
 	}), t.addEventListener("load", () => {
 		if (t.status < 200 || t.status >= 300) {
-			let n = EA(t), r = /* @__PURE__ */ Error(wA);
-			return n && (r = Error(n.message || wA)), e.onError(r);
+			let n = OA(t), r = /* @__PURE__ */ Error(EA);
+			return n && (r = Error(n.message || EA)), e.onError(r);
 		}
-		e.onSuccess(EA(t));
+		e.onSuccess(OA(t));
 	}), t.addEventListener("loadend", () => {
 		e.onComplete();
 	}), t.open(e.method, n, !0), e.withCredentials && "withCredentials" in t && (t.withCredentials = !0), e.header) if (Array.isArray(e.header)) e.header.forEach((e) => {
@@ -33461,11 +33656,11 @@ var DA = (e) => {
 	if (o instanceof Headers) o.forEach((e, n) => t.setRequestHeader(n, e));
 	else for (let [e, n] of Object.entries(o)) ge(n) || t.setRequestHeader(e, String(n));
 	return t.send(i ? a : e.file), t;
-}, OA = File.prototype.slice || File.prototype.mozSlice || File.prototype.webkitSlice, kA = async (e) => {
+}, AA = File.prototype.slice || File.prototype.mozSlice || File.prototype.webkitSlice, jA = async (e) => {
 	let t = e.chunkSize * 1024 * 1024, { file: n } = e;
 	if (!n) throw Error("File not found");
-	let r = Math.ceil(n.size / t), i = await jA(n, t), a = [];
-	AA(e, n, r, i, a, t), await Promise.all(a).then(() => {
+	let r = Math.ceil(n.size / t), i = await NA(n, t), a = [];
+	MA(e, n, r, i, a, t), await Promise.all(a).then(() => {
 		let t = {
 			size: n.size,
 			name: n.name,
@@ -33474,10 +33669,10 @@ var DA = (e) => {
 		}, a = new XMLHttpRequest();
 		a.open(e.method, e.mergeUrl, !0), a.onreadystatechange = () => {
 			if (a.readyState === 4) {
-				let t = EA(a);
+				let t = OA(a);
 				if (a.status < 200 || a.status >= 300) {
-					let n = /* @__PURE__ */ Error(wA);
-					return t && (n = Error(t.message || wA)), e.onError(n);
+					let n = /* @__PURE__ */ Error(EA);
+					return t && (n = Error(t.message || EA)), e.onError(n);
 				}
 				e.onSuccess(t);
 			}
@@ -33485,31 +33680,31 @@ var DA = (e) => {
 			e.onComplete();
 		}, a.setRequestHeader("Content-type", "application/JSON"), a.send(JSON.stringify(t));
 	});
-}, AA = (e, t, n, r, i, a) => {
+}, MA = (e, t, n, r, i, a) => {
 	for (let o = 0; o < n; o++) {
 		let s = new Promise((i, s) => {
 			let c = o * a, l = Math.min(t.size, c + a), u = new FormData();
 			if (e.data) {
 				let t = e.data;
 				Array.isArray(t) || (t = [t]), t.forEach((e) => {
-					for (let [t, n] of Object.entries(e)) TA(u, t, n);
+					for (let [t, n] of Object.entries(e)) DA(u, t, n);
 				});
 			}
 			if (e.formDataAttributes) {
 				let t = e.formDataAttributes;
 				Array.isArray(t) || (t = [t]), t.forEach((e) => {
-					TA(u, e.name, e.value);
+					DA(u, e.name, e.value);
 				});
 			}
-			u.append("file", OA.call(t, c, l)), u.append("name", t.name), u.append("total", n.toString()), u.append("index", o.toString()), u.append("size", t.size.toString()), u.append("hash", r.toString());
+			u.append("file", AA.call(t, c, l)), u.append("name", t.name), u.append("total", n.toString()), u.append("index", o.toString()), u.append("size", t.size.toString()), u.append("hash", r.toString());
 			let d = new XMLHttpRequest();
 			if (d.onreadystatechange = () => {
 				if (d.readyState === 4) {
-					let t = EA(d);
+					let t = OA(d);
 					if (d.status < 200 || d.status >= 300) {
 						s(t);
-						let n = /* @__PURE__ */ Error(wA);
-						t && (n = Error(t.message || wA)), e.onError(n);
+						let n = /* @__PURE__ */ Error(EA);
+						t && (n = Error(t.message || EA)), e.onError(n);
 					} else i("reponseText");
 				}
 			}, d.upload.addEventListener("progress", (t) => {
@@ -33530,16 +33725,16 @@ var DA = (e) => {
 		});
 		i.push(s);
 	}
-}, jA = (e, t) => new Promise((n, r) => {
-	let i = Math.ceil(e.size / t), a = 0, o = new CA.default.ArrayBuffer(), s = new FileReader();
+}, NA = (e, t) => new Promise((n, r) => {
+	let i = Math.ceil(e.size / t), a = 0, o = new TA.default.ArrayBuffer(), s = new FileReader();
 	function c() {
 		let n = a * t, r = n + t >= e.size ? e.size : n + t;
-		s.readAsArrayBuffer(OA.call(e, n, r));
+		s.readAsArrayBuffer(AA.call(e, n, r));
 	}
 	s.onload = (t) => {
 		if (o.append(t.target.result), a += 1, a < i) c();
 		else {
-			let t = o.end(), r = new CA.default();
+			let t = o.end(), r = new TA.default();
 			r.append(t), r.append(e.name), n(r.end());
 		}
 	}, s.onerror = () => {
@@ -33550,21 +33745,21 @@ var DA = (e) => {
 });
 //#endregion
 //#region ../../packages/upload/src/use-file-handler.ts
-function MA(e) {
+function PA(e) {
 	return Date.now() + e;
 }
-var NA = (e, t) => {
+var FA = (e, t) => {
 	let n = c(() => typeof e.size == "number" ? e.size : e?.size?.maxImgSize), r = c(() => typeof e.size == "number" ? e.size : e?.size?.maxImgSize), i = A([]);
 	function a(e) {
 		return i.value.find((t) => t.uid === e.uid);
 	}
 	let o = 0;
 	function s(t) {
-		o += 1, t.uid = MA(o);
+		o += 1, t.uid = PA(o);
 		let a = {
 			uid: t.uid,
 			name: t.name,
-			status: gA.NEW,
+			status: vA.NEW,
 			size: t.size,
 			raw: t
 		}, s = t.type.startsWith("image/"), c = null;
@@ -33576,7 +33771,7 @@ var NA = (e, t) => {
 			}
 			a.isPic = !0;
 		}
-		return e.validateName && !e.validateName?.test(a.name) && (a.status = gA.FAIL, a.statusText = "invalid filename", c = Error(a.statusText)), s && t.size > n.value * 1024 ** 2 && (a.status = gA.FAIL, a.statusText = "invalid file size", c = Error(a.statusText)), !s && t.size > r.value * 1024 ** 2 && (a.status = gA.FAIL, a.statusText = "invalid file size", c = Error(a.statusText)), i.value.push(a), c;
+		return e.validateName && !e.validateName?.test(a.name) && (a.status = vA.FAIL, a.statusText = "invalid filename", c = Error(a.statusText)), s && t.size > n.value * 1024 ** 2 && (a.status = vA.FAIL, a.statusText = "invalid file size", c = Error(a.statusText)), !s && t.size > r.value * 1024 ** 2 && (a.status = vA.FAIL, a.statusText = "invalid file size", c = Error(a.statusText)), i.value.push(a), c;
 	}
 	async function l(n) {
 		let r = n instanceof File ? a(n) : n, o = (e) => {
@@ -33599,8 +33794,8 @@ var NA = (e, t) => {
 	return H(() => e.files, (e) => {
 		i.value = e.map((e) => (o += 1, {
 			...e,
-			uid: e.uid ?? MA(o),
-			status: e.status ?? gA.SUCCESS
+			uid: e.uid ?? PA(o),
+			status: e.status ?? vA.SUCCESS
 		}));
 	}, {
 		immediate: !0,
@@ -33613,9 +33808,9 @@ var NA = (e, t) => {
 		handleSuccess: d,
 		handleProgress: f
 	};
-}, PA = _i(/* @__PURE__ */ f({
+}, IA = _i(/* @__PURE__ */ f({
 	name: "Upload",
-	props: yA,
+	props: xA,
 	emits: [
 		"exceed",
 		"progress",
@@ -33626,11 +33821,11 @@ var NA = (e, t) => {
 		"preview"
 	],
 	setup(e, { slots: t, emit: n, expose: r }) {
-		let { resolveClassName: i } = X(), a = F({}), o = c(() => e.theme === mA.PICTURE), s = c(() => o.value && !e.multiple), l = c(() => mi({
-			[`${i(pA)}`]: !0,
-			[`${i(pA)}--${e.theme}`]: !0,
-			[`${i(pA)}--disabled`]: e.disabled,
-			[`${i(pA)}--single-picture`]: s.value,
+		let { resolveClassName: i } = X(), a = F({}), o = c(() => e.theme === gA.PICTURE), s = c(() => o.value && !e.multiple), l = c(() => mi({
+			[`${i(hA)}`]: !0,
+			[`${i(hA)}--${e.theme}`]: !0,
+			[`${i(hA)}--disabled`]: e.disabled,
+			[`${i(hA)}--single-picture`]: s.value,
 			[e.extCls]: e.extCls ?? !1
 		})), u = c(() => ({
 			theme: e.theme,
@@ -33643,7 +33838,7 @@ var NA = (e, t) => {
 		function f(e, t) {
 			E(e), n("delete", e, t);
 		}
-		let { fileList: p, handlePreprocess: m, handleRemove: h, handleProgress: g, handleSuccess: _, handleError: v } = NA(e, { onRemove: f });
+		let { fileList: p, handlePreprocess: m, handleRemove: h, handleProgress: g, handleSuccess: _, handleError: v } = FA(e, { onRemove: f });
 		function y(t) {
 			if (!t.length) return;
 			if (e.limit > 1 && p.value.length + t.length > e.limit) {
@@ -33715,7 +33910,7 @@ var NA = (e, t) => {
 				onComplete: () => {
 					r && r.indexOf(t) === r.length - 1 && n("done", p.value);
 				}
-			}, w = e.sliceUpload ? kA : DA;
+			}, w = e.sliceUpload ? jA : kA;
 			x && (w = x);
 			let T = w(C);
 			a.value[S] = T, T instanceof Promise && T.then(C.onSuccess, C.onError);
@@ -33735,9 +33930,9 @@ var NA = (e, t) => {
 			handleRemove: h,
 			handleRetry: S
 		}), () => d("div", { class: l.value }, [
-			!o.value && d(SA, b(u.value, { onChange: y }), t),
+			!o.value && d(wA, b(u.value, { onChange: y }), t),
 			t.tip ? t.tip() : e.tip && d("div", { class: `${i("upload")}__tip` }, [e.tip]),
-			d(xA, {
+			d(CA, {
 				disabled: e.disabled,
 				files: p.value,
 				isShowPreview: e.isShowPreview,
@@ -33747,7 +33942,7 @@ var NA = (e, t) => {
 				onRemove: h,
 				onRetry: S
 			}, {
-				innerTrigger: (e) => o.value && d(SA, b(u.value, {
+				innerTrigger: (e) => o.value && d(wA, b(u.value, {
 					file: e,
 					onChange: y,
 					onPreview: x,
@@ -33757,7 +33952,7 @@ var NA = (e, t) => {
 			})
 		]);
 	}
-})), FA = /* @__PURE__ */ le({
+})), LA = /* @__PURE__ */ le({
 	$bkPopover: () => Nf,
 	Affix: () => ho,
 	Alert: () => Al,
@@ -33814,20 +34009,20 @@ var NA = (e, t) => {
 	TimePicker: () => mk,
 	Timeline: () => hk,
 	Transfer: () => xk,
-	Tree: () => fA,
-	Upload: () => PA,
+	Tree: () => mA,
+	Upload: () => IA,
 	VirtualRender: () => rh,
 	scrollbar: () => DT
-}), IA = (e = "Bk") => (t, n) => {
+}), RA = (e = "Bk") => (t, n) => {
 	let r = t.config.globalProperties.bkUIPrefix || e;
-	Object.keys(FA).forEach((e) => {
-		let n = FA[e];
-		"install" in n ? t.use(n, { prefix: r }) : t.component(r + e, FA[e]);
+	Object.keys(LA).forEach((e) => {
+		let n = LA[e];
+		"install" in n ? t.use(n, { prefix: r }) : t.component(r + e, LA[e]);
 	}), n && so(n, t);
-}, LA = {
-	createInstall: IA,
-	install: IA()
-}, RA = "3.0.4";
-window.__bkui_vue_version__ = RA;
+}, zA = {
+	createInstall: RA,
+	install: RA()
+}, BA = "3.0.5";
+window.__bkui_vue_version__ = BA;
 //#endregion
-export { Nf as $bkPopover, ho as Affix, Al as Alert, jl as AnimateNumber, Ml as Backtop, Nl as Badge, Rl as Breadcrumb, Xl as Button, Rp as Card, e_ as Cascader, Qp as Checkbox, ay as CodeDiff, dy as Collapse, HS as ColorPicker, fo as ConfigProvider, GS as Container, Vx as DatePicker, nC as Dialog, Dm as Divider, aC as Dropdown, gC as Exception, _C as FixedNavbar, zC as Form, WC as InfoBox, Lp as Input, KC as Link, Jl as Loading, rw as Menu, _w as Message, QS as Modal, yw as Navigation, Sw as Notify, sp as OverflowTitle, kw as Pagination, jw as PopConfirm, Pf as Popover, Mw as Popover2, Nw as Process, Lw as Progress, Uw as Radio, Gw as Rate, Kw as ResizeLayout, lE as SearchSelect, ch as Select, fE as Sideslider, gE as Slider, yE as Steps, bE as Swiper, TE as Switcher, LE as Tab, pk as Table, ah as Tag, Jg as TagInput, mk as TimePicker, hk as Timeline, xk as Transfer, fA as Tree, PA as Upload, rh as VirtualRender, Lf as bkEllipsis, If as bkEllipsisInstance, ql as bkLoading, qf as bkTooltips, nu as clickoutside, LA as default, ao as defaultRootConfig, Gf as mousewheel, op as overflowTitle, so as provideGlobalConfig, io as rootProviderKey, DT as scrollbar, oo as setPrefixVariable, co as useGlobalConfig, uo as useLocale, X as usePrefix, RA as version };
+export { Nf as $bkPopover, ho as Affix, Al as Alert, jl as AnimateNumber, Ml as Backtop, Nl as Badge, Rl as Breadcrumb, Xl as Button, Rp as Card, e_ as Cascader, Qp as Checkbox, ay as CodeDiff, dy as Collapse, HS as ColorPicker, fo as ConfigProvider, GS as Container, Vx as DatePicker, nC as Dialog, Dm as Divider, aC as Dropdown, gC as Exception, _C as FixedNavbar, zC as Form, WC as InfoBox, Lp as Input, KC as Link, Jl as Loading, rw as Menu, _w as Message, QS as Modal, yw as Navigation, Sw as Notify, sp as OverflowTitle, kw as Pagination, jw as PopConfirm, Pf as Popover, Mw as Popover2, Nw as Process, Lw as Progress, Uw as Radio, Gw as Rate, Kw as ResizeLayout, lE as SearchSelect, ch as Select, fE as Sideslider, gE as Slider, yE as Steps, bE as Swiper, TE as Switcher, LE as Tab, pk as Table, ah as Tag, Jg as TagInput, mk as TimePicker, hk as Timeline, xk as Transfer, mA as Tree, IA as Upload, rh as VirtualRender, Lf as bkEllipsis, If as bkEllipsisInstance, ql as bkLoading, qf as bkTooltips, nu as clickoutside, zA as default, ao as defaultRootConfig, Gf as mousewheel, op as overflowTitle, so as provideGlobalConfig, io as rootProviderKey, DT as scrollbar, oo as setPrefixVariable, co as useGlobalConfig, uo as useLocale, X as usePrefix, BA as version };