haze-ui 1.33.0 → 1.34.0

package/dist/components/Tree/SortableTree.js

@@ -6,113 +6,132 @@ import { filterTreeByQuery as a, findNodeByKey as o, flattenVisibleTree as s } f
 import c from "./Tree.js";
 import { resolveTreeMove as l, subtreeKeys as u } from "./sortable-tree-utils.js";
 import { grip as d, row as f } from "./sortable-tree-styles.js";
-import { useCallback as p, useMemo as m, useRef as h, useState as g } from "react";
-import { Fragment as _, jsx as v, jsxs as y } from "react/jsx-runtime";
-import { SortableContext as b, useSortable as x, verticalListSortingStrategy as S } from "@dnd-kit/sortable";
-import { DndContext as C, closestCenter as w } from "@dnd-kit/core";
+import { c as p } from "react/compiler-runtime";
+import { useCallback as m, useMemo as h, useRef as g, useState as _ } from "react";
+import { Fragment as v, jsx as y, jsxs as b } from "react/jsx-runtime";
+import { SortableContext as x, useSortable as S, verticalListSortingStrategy as C } from "@dnd-kit/sortable";
+import { DndContext as w, closestCenter as T } from "@dnd-kit/core";
 //#region src/lib/components/Tree/SortableTree.tsx
-var T = () => /* @__PURE__ */ y("svg", {
-	viewBox: "0 0 10 16",
-	fill: "currentColor",
-	children: [
-		/* @__PURE__ */ v("circle", {
-			cx: "2.5",
-			cy: "2.5",
-			r: "1.5"
-		}),
-		/* @__PURE__ */ v("circle", {
-			cx: "7.5",
-			cy: "2.5",
-			r: "1.5"
-		}),
-		/* @__PURE__ */ v("circle", {
-			cx: "2.5",
-			cy: "8",
-			r: "1.5"
-		}),
-		/* @__PURE__ */ v("circle", {
-			cx: "7.5",
-			cy: "8",
-			r: "1.5"
-		}),
-		/* @__PURE__ */ v("circle", {
-			cx: "2.5",
-			cy: "13.5",
-			r: "1.5"
-		}),
-		/* @__PURE__ */ v("circle", {
-			cx: "7.5",
-			cy: "13.5",
-			r: "1.5"
-		})
-	]
-});
-function E() {
-	let t = n();
-	if (!t) return null;
-	let r = t.listeners?.onPointerDown;
-	return /* @__PURE__ */ v("span", {
+var E = () => {
+	let e = p(1), t;
+	return e[0] === Symbol.for("react.memo_cache_sentinel") ? (t = /* @__PURE__ */ b("svg", {
+		viewBox: "0 0 10 16",
+		fill: "currentColor",
+		children: [
+			/* @__PURE__ */ y("circle", {
+				cx: "2.5",
+				cy: "2.5",
+				r: "1.5"
+			}),
+			/* @__PURE__ */ y("circle", {
+				cx: "7.5",
+				cy: "2.5",
+				r: "1.5"
+			}),
+			/* @__PURE__ */ y("circle", {
+				cx: "2.5",
+				cy: "8",
+				r: "1.5"
+			}),
+			/* @__PURE__ */ y("circle", {
+				cx: "7.5",
+				cy: "8",
+				r: "1.5"
+			}),
+			/* @__PURE__ */ y("circle", {
+				cx: "2.5",
+				cy: "13.5",
+				r: "1.5"
+			}),
+			/* @__PURE__ */ y("circle", {
+				cx: "7.5",
+				cy: "13.5",
+				r: "1.5"
+			})
+		]
+	}), e[0] = t) : t = e[0], t;
+};
+function D() {
+	let t = p(4), r = n();
+	if (!r) return null;
+	let i = r.listeners?.onPointerDown, a;
+	t[0] === Symbol.for("react.memo_cache_sentinel") ? (a = [d], t[0] = a) : a = t[0];
+	let o;
+	t[1] === Symbol.for("react.memo_cache_sentinel") ? (o = /* @__PURE__ */ y(E, {}), t[1] = o) : o = t[1];
+	let s;
+	return t[2] === i ? s = t[3] : (s = /* @__PURE__ */ y("span", {
 		"aria-hidden": "true",
 		"data-slot": "drag-handle",
-		onPointerDown: r,
-		className: e([d]),
-		children: /* @__PURE__ */ v(T, {})
-	});
+		onPointerDown: i,
+		className: e(a),
+		children: o
+	}), t[2] = i, t[3] = s), s;
 }
-function D({ node: n, treeDisabled: i, inDraggedSubtree: a, handleMode: o, children: s }) {
-	let { attributes: c, listeners: l, setNodeRef: u, transform: d, transition: p, isDragging: m } = x({
-		id: n.key,
-		disabled: i || !!n.disabled
-	});
-	function h(e) {
-		let t = l?.onKeyDown;
+function O(n) {
+	let i = p(25), { node: a, treeDisabled: o, inDraggedSubtree: s, handleMode: c, children: l } = n, u = o || !!a.disabled, d;
+	i[0] !== a.key || i[1] !== u ? (d = {
+		id: a.key,
+		disabled: u
+	}, i[0] = a.key, i[1] = u, i[2] = d) : d = i[2];
+	let { attributes: m, listeners: h, setNodeRef: g, transform: _, transition: v, isDragging: b } = S(d), x;
+	i[3] === h?.onKeyDown ? x = i[4] : (x = function(e) {
+		let t = h?.onKeyDown;
 		t?.(e), e.defaultPrevented && e.stopPropagation();
-	}
-	return /* @__PURE__ */ v(t.Provider, {
-		value: {
-			attributes: c,
-			listeners: l
-		},
-		children: /* @__PURE__ */ v("div", {
-			ref: u,
-			"data-slot": "sortable-row",
-			"data-sortable-row": "",
-			style: r(d, p),
-			...o ? void 0 : l,
-			onKeyDown: h,
-			className: e([
-				f,
-				!o && "haze-sortable-tree-styles__rowDraggable",
-				m && "haze-sortable-tree-styles__rowDragging",
-				a && "haze-sortable-tree-styles__rowInSubtree"
-			]),
-			children: s
-		})
-	});
+	}, i[3] = h?.onKeyDown, i[4] = x);
+	let C = x, w;
+	i[5] !== m || i[6] !== h ? (w = {
+		attributes: m,
+		listeners: h
+	}, i[5] = m, i[6] = h, i[7] = w) : w = i[7];
+	let T;
+	i[8] !== _ || i[9] !== v ? (T = r(_, v), i[8] = _, i[9] = v, i[10] = T) : T = i[10];
+	let E = !c && "haze-sortable-tree-styles__rowDraggable", D = b && "haze-sortable-tree-styles__rowDragging", O = s && "haze-sortable-tree-styles__rowInSubtree", k;
+	i[11] !== E || i[12] !== D || i[13] !== O ? (k = [
+		f,
+		E,
+		D,
+		O
+	], i[11] = E, i[12] = D, i[13] = O, i[14] = k) : k = i[14];
+	let A = c ? void 0 : h, j;
+	i[15] !== l || i[16] !== C || i[17] !== g || i[18] !== A || i[19] !== T || i[20] !== k ? (j = /* @__PURE__ */ y("div", {
+		ref: g,
+		"data-slot": "sortable-row",
+		"data-sortable-row": "",
+		style: T,
+		...A,
+		onKeyDown: C,
+		className: e(k),
+		children: l
+	}), i[15] = l, i[16] = C, i[17] = g, i[18] = A, i[19] = T, i[20] = k, i[21] = j) : j = i[21];
+	let M;
+	return i[22] !== j || i[23] !== w ? (M = /* @__PURE__ */ y(t.Provider, {
+		value: w,
+		children: j
+	}), i[22] = j, i[23] = w, i[24] = M) : M = i[24], M;
 }
-function O({ treeData: e, disabled: t = !1, dragHandle: n = !1, titleRender: r, searchValue: d, expandedKeys: f, onExpand: x, onMove: T, className: O, ...k }) {
-	let A = i(), [j, M] = g(null), N = h(/* @__PURE__ */ new Set()), [P, F] = g([]), I = p((e, t) => {
-		F(e), x?.(e, t);
-	}, [x]), L = m(() => a(e, d), [e, d]), R = Array.isArray(f) ? f : P, z = m(() => !L || L.ancestorKeys.length === 0 ? R : Array.from(/* @__PURE__ */ new Set([...R, ...L.ancestorKeys])), [R, L]), B = L ? L.tree : e, V = m(() => s(B, z, !1).map((e) => e.key), [B, z]), H = p((e) => {
+function k({ treeData: e, disabled: t = !1, dragHandle: n = !1, titleRender: r, searchValue: d, expandedKeys: f, onExpand: p, onMove: S, className: E, ...k }) {
+	let A = i(), [j, M] = _(null), N = g(/* @__PURE__ */ new Set()), [P, F] = _([]), I = m((e, t) => {
+		F(e), p?.(e, t);
+	}, [p]), L = h(() => a(e, d), [e, d]), R = Array.isArray(f) ? f : P, z = h(() => !L || L.ancestorKeys.length === 0 ? R : Array.from(/* @__PURE__ */ new Set([...R, ...L.ancestorKeys])), [R, L]), B = L ? L.tree : e, V = h(() => s(B, z, !1).map((e) => e.key), [B, z]), H = m((e) => {
 		let t = j === null ? e.droppableContainers : e.droppableContainers.filter((e) => String(e.id) === j || !N.current.has(String(e.id)));
-		return w({
+		return T({
 			...e,
 			droppableContainers: t
 		});
-	}, [j]), U = p((t) => {
+	}, [j]), U = m((t) => {
 		let n = String(t.active.id), r = o(e, n);
 		N.current = r ? u(r) : /* @__PURE__ */ new Set(), M(n);
-	}, [e]), W = p(() => {
+	}, [e]), W = m(() => {
 		N.current = /* @__PURE__ */ new Set(), M(null);
-	}, []), G = p((t) => {
+	}, []), G = m((t) => {
 		if (W(), !t.over) return;
 		let n = l(e, String(t.active.id), String(t.over.id));
-		n && T?.(n);
+		n && S?.(n);
 	}, [
 		W,
-		T,
+		S,
 		e
-	]), K = p((e, r) => /* @__PURE__ */ v(D, {
+	]), K = m((e, r) => /* @__PURE__ */ y(O, {
 		node: r,
 		treeDisabled: t,
 		handleMode: n,
@@ -123,29 +142,29 @@ function O({ treeData: e, disabled: t = !1, dragHandle: n = !1, titleRender: r,
 		t,
 		n
 	]);
-	return /* @__PURE__ */ v(C, {
+	return /* @__PURE__ */ y(w, {
 		sensors: A,
 		collisionDetection: H,
 		onDragStart: U,
 		onDragEnd: G,
 		onDragCancel: W,
-		children: /* @__PURE__ */ v(b, {
+		children: /* @__PURE__ */ y(x, {
 			items: V,
-			strategy: S,
-			children: /* @__PURE__ */ v(c, {
+			strategy: C,
+			children: /* @__PURE__ */ y(c, {
 				treeData: e,
 				disabled: t,
 				searchValue: d,
-				titleRender: n || r ? (e) => /* @__PURE__ */ y(_, { children: [n && /* @__PURE__ */ v(E, {}), r ? r(e) : e.title] }) : void 0,
+				titleRender: n || r ? (e) => /* @__PURE__ */ b(v, { children: [n && /* @__PURE__ */ y(D, {}), r ? r(e) : e.title] }) : void 0,
 				expandedKeys: f,
 				onExpand: I,
 				rowWrap: K,
 				keyboardNavigation: j === null,
-				className: O,
+				className: E,
 				...k
 			})
 		})
 	});
 }
 //#endregion
-export { O as default };
+export { k as default };

package/dist/components/Tree/Tree.js

@@ -3,22 +3,23 @@
 import { classnames as e } from "../../utils/classnames.js";
 import { getDirection as t } from "../../utils/direction.js";
 import { useStrings as n } from "../LocaleProvider/useStrings.js";
-import r from "../VirtualList/VirtualList.js";
-import { filterTreeByQuery as i, findNodeByKey as a, flattenVisibleTree as o, getChildKeys as s, getParentKey as c, mergeLoadedChildren as l, pruneLoadedChildren as u } from "./utils.js";
+import { mergeRefs as r } from "../../utils/refs.js";
+import i from "../VirtualList/VirtualList.js";
+import { filterTreeByQuery as a, findNodeByKey as o, flattenVisibleTree as s, getChildKeys as c, getParentKey as l, mergeLoadedChildren as u, pruneLoadedChildren as d } from "./utils.js";
 import ee from "./TreeItem.js";
 /* empty css               */
-import { useCallback as d, useEffect as f, useMemo as p, useRef as m, useState as h } from "react";
-import { jsx as g, jsxs as te } from "react/jsx-runtime";
-import { useControl as _ } from "react-use-control";
+import { useCallback as f, useEffect as p, useMemo as m, useRef as h, useState as g } from "react";
+import { jsx as _, jsxs as te } from "react/jsx-runtime";
+import { useControl as v } from "react-use-control";
 //#region src/lib/components/Tree/Tree.tsx
 var ne = "haze-Tree__base", re = "haze-Tree__virtualTree", ie = 320, ae = 32, oe = "haze-Tree__group", se = "haze-Tree__emptyBlock";
-function v(e, t) {
+function ce(e, t) {
 	if (!(t in e)) return e;
 	let n = {};
 	for (let [r, i] of Object.entries(e)) r !== t && (n[r] = i);
 	return n;
 }
-function ce(e, t, n) {
+function le(e, t, n) {
 	if (n) return {
 		checked: e,
 		halfChecked: []
@@ -26,8 +27,8 @@ function ce(e, t, n) {
 	let r = new Set(e), i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), o = (e) => {
 		for (let n of e) if (n.children?.length) {
 			o(n.children);
-			let e = s(t, n.key), c = e.filter((e) => r.has(e));
-			c.length === 0 ? a.add(n.key) : c.length < e.length && (i.add(n.key), a.add(n.key));
+			let e = c(t, n.key), s = e.filter((e) => r.has(e));
+			s.length === 0 ? a.add(n.key) : s.length < e.length && (i.add(n.key), a.add(n.key));
 		}
 	};
 	return o(t), {
@@ -35,20 +36,20 @@ function ce(e, t, n) {
 		halfChecked: Array.from(i)
 	};
 }
-function y({ treeData: y, multiple: le = !1, checkable: b = !1, checkStrictly: x = !1, selectable: S = !0, disabled: C = !1, blockNode: ue = !1, showLine: de = !1, showIcon: fe = !1, switcherIcon: pe, loadingIcon: me, titleRender: he, iconRender: ge, virtualized: w, loadData: T, searchValue: E, rowWrap: D, keyboardNavigation: _e = !0, expandedKeys: ve, selectedKeys: ye, checkedKeys: be, className: O, onExpand: xe, onSelect: Se, onCheck: Ce }) {
-	let we = n("tree"), [k, Te] = _(ve, []), [A, Ee] = _(ye, []), [De, Oe] = _(be, []), ke = De, j = !!T, [M, Ae] = h({}), [N, P] = h({}), F = m(/* @__PURE__ */ new Set()), I = p(() => u(M, y), [M, y]);
-	f(() => {
-		I !== M && Ae(I);
+function y({ treeData: y, multiple: ue = !1, checkable: b = !1, checkStrictly: x = !1, selectable: S = !0, disabled: C = !1, blockNode: de = !1, showLine: fe = !1, showIcon: pe = !1, switcherIcon: me, loadingIcon: he, titleRender: ge, iconRender: _e, virtualized: w, loadData: T, searchValue: E, rowWrap: D, keyboardNavigation: ve = !0, expandedKeys: ye, selectedKeys: be, checkedKeys: xe, ref: Se, className: O, onExpand: Ce, onSelect: we, onCheck: Te }) {
+	let Ee = n("tree"), [k, De] = v(ye, []), [A, Oe] = v(be, []), [ke, Ae] = v(xe, []), je = ke, j = !!T, [M, Me] = g({}), [N, P] = g({}), F = h(/* @__PURE__ */ new Set()), I = m(() => d(M, y), [M, y]);
+	p(() => {
+		I !== M && Me(I);
 	}, [I, M]);
-	let L = p(() => l(y, I), [y, I]), R = d((e, t) => {
+	let L = m(() => u(y, I), [y, I]), R = f((e, t) => {
 		T && !F.current.has(e) && (F.current.add(e), P((t) => ({
 			...t,
 			[e]: "loading"
 		})), T(t).then((t) => {
-			F.current.delete(e), Ae((n) => ({
+			F.current.delete(e), Me((n) => ({
 				...n,
 				[e]: t
-			})), P((t) => v(t, e));
+			})), P((t) => ce(t, e));
 		}).catch(() => {
 			F.current.delete(e), P((t) => ({
 				...t,
@@ -56,14 +57,14 @@ function y({ treeData: y, multiple: le = !1, checkable: b = !1, checkStrictly: x
 			}));
 		}));
 	}, [T]);
-	function je(e) {
-		let t = a(L, e);
+	function Ne(e) {
+		let t = o(L, e);
 		t && R(e, t);
 	}
-	let z = p(() => i(L, E), [L, E]), Me = z !== null, B = z ? z.tree : L, V = p(() => !z || z.ancestorKeys.length === 0 ? k : Array.from(/* @__PURE__ */ new Set([...k, ...z.ancestorKeys])), [k, z]);
-	f(() => {
+	let z = m(() => a(L, E), [L, E]), Pe = z !== null, B = z ? z.tree : L, V = m(() => !z || z.ancestorKeys.length === 0 ? k : Array.from(/* @__PURE__ */ new Set([...k, ...z.ancestorKeys])), [k, z]);
+	p(() => {
 		if (T) for (let e of V) {
-			let t = a(L, e);
+			let t = o(L, e);
 			t && !t.children?.length && t.isLeaf !== !0 && I[e] === void 0 && N[e] === void 0 && R(e, t);
 		}
 	}, [
@@ -74,21 +75,21 @@ function y({ treeData: y, multiple: le = !1, checkable: b = !1, checkStrictly: x
 		I,
 		N
 	]);
-	let Ne = p(() => ce(ke, L, x), [
-		ke,
+	let Fe = m(() => le(je, L, x), [
+		je,
 		L,
 		x
-	]), H = Ne.checked, Pe = Ne.halfChecked, Fe = w !== void 0 && w !== !1, U = typeof w == "object" ? w : void 0, [Ie, Le] = h(null), [W, Re] = h(null), G = m(null), ze = m(null), K = p(() => o(B, V, C), [
+	]), H = Fe.checked, Ie = Fe.halfChecked, Le = w !== void 0 && w !== !1, U = typeof w == "object" ? w : void 0, [Re, ze] = g(null), [W, Be] = g(null), Ve = h(null), He = h(null), G = f((e) => r(Ve, Se)(e), [Se]), K = m(() => s(B, V, C), [
 		B,
 		V,
 		C
-	]), Be = (() => {
-		let e = K.find((e) => e.key === Ie && !e.disabled);
+	]), Ue = (() => {
+		let e = K.find((e) => e.key === Re && !e.disabled);
 		return e ? e.key : K.find((e) => !e.disabled)?.key ?? null;
 	})();
 	function q(e) {
 		let t = K[e];
-		t && !t.disabled && (Fe && ze.current?.scrollToIndex(e, "auto"), Le(t.key), Re(t.key));
+		t && !t.disabled && (Le && He.current?.scrollToIndex(e, "auto"), ze(t.key), Be(t.key));
 	}
 	function J(e, t) {
 		for (let n = e + t; n >= 0 && n < K.length; n += t) {
@@ -101,10 +102,10 @@ function y({ treeData: y, multiple: le = !1, checkable: b = !1, checkStrictly: x
 		let t = e.target;
 		if (t.getAttribute("role") !== "treeitem") return;
 		let n = t.dataset.treeKey;
-		n && Le(n);
+		n && ze(n);
 	}
 	function X(e) {
-		if (!_e) return;
+		if (!ve) return;
 		let n = K;
 		if (n.length === 0) return;
 		let r = e.target;
@@ -148,58 +149,58 @@ function y({ treeData: y, multiple: le = !1, checkable: b = !1, checkStrictly: x
 				return;
 		}
 	}
-	f(() => {
+	p(() => {
 		if (W === null) return;
-		let e = G.current;
+		let e = Ve.current;
 		if (!e) return;
 		let t = Array.from(e.querySelectorAll("[role=\"treeitem\"]")).find((e) => e.dataset.treeKey === W);
-		t && (t.focus(), Re(null));
+		t && (t.focus(), Be(null));
 	}, [W, K]);
 	function Z(e) {
 		let t = k.includes(e), n = t ? k.filter((t) => t !== e) : [...k, e];
-		Te(n), !t && N[e] === "error" && P((t) => v(t, e)), xe?.(n, {
+		De(n), !t && N[e] === "error" && P((t) => ce(t, e)), Ce?.(n, {
 			expanded: !t,
-			node: a(L, e)
+			node: o(L, e)
 		});
 	}
 	function Q(e) {
-		let t = a(L, e);
+		let t = o(L, e);
 		if (!t?.selectable && t?.selectable !== void 0 || !S) return;
 		let n;
-		n = le ? A.indexOf(e) >= 0 ? A.filter((t) => t !== e) : [...A, e] : A.includes(e) ? [] : [e], Ee(n), Se?.(n, {
+		n = ue ? A.indexOf(e) >= 0 ? A.filter((t) => t !== e) : [...A, e] : A.includes(e) ? [] : [e], Oe(n), we?.(n, {
 			selected: n.includes(e),
-			selectedNodes: n.map((e) => a(L, e)).filter(Boolean),
+			selectedNodes: n.map((e) => o(L, e)).filter(Boolean),
 			node: t
 		});
 	}
 	function $(e) {
-		if (!b || a(L, e)?.disableCheckbox) return;
+		if (!b || o(L, e)?.disableCheckbox) return;
 		let t = H.includes(e), n;
 		if (x) n = t ? H.filter((t) => t !== e) : [...H, e];
 		else {
-			let r = s(L, e);
+			let r = c(L, e);
 			if (t) {
 				n = H.filter((t) => t !== e && !r.includes(t));
-				let t = c(L, e);
-				for (; t;) n = n.filter((e) => e !== t), t = c(L, t);
+				let t = l(L, e);
+				for (; t;) n = n.filter((e) => e !== t), t = l(L, t);
 			} else {
 				let t = [e, ...r].filter((e) => !H.includes(e));
 				n = [...H, ...t];
-				let i = c(L, e);
-				for (; i;) s(L, i).every((e) => n.includes(e)) && !n.includes(i) && n.push(i), i = c(L, i);
+				let i = l(L, e);
+				for (; i;) c(L, i).every((e) => n.includes(e)) && !n.includes(i) && n.push(i), i = l(L, i);
 			}
 		}
-		let r = ce(n, L, x);
-		Oe(x ? n : r.checked), Ce?.(x ? n : r, {
+		let r = le(n, L, x);
+		Ae(x ? n : r.checked), Te?.(x ? n : r, {
 			checked: !t,
-			checkedNodes: n.map((e) => a(L, e)).filter(Boolean),
-			node: a(L, e),
+			checkedNodes: n.map((e) => o(L, e)).filter(Boolean),
+			node: o(L, e),
 			halfCheckedKeys: r.halfChecked
 		});
 	}
-	function Ve(t, n, r) {
+	function We(t, n, r) {
 		return t.map((i, a) => {
-			let o = !!i.children?.length, s = V.includes(i.key), c = A.includes(i.key), l = H.includes(i.key), u = Pe.includes(i.key), d = N[i.key], f = l ? "checked" : u ? "halfChecked" : "unchecked", p = a === t.length - 1, m = [...r, p], h = /* @__PURE__ */ g(ee, {
+			let o = !!i.children?.length, s = V.includes(i.key), c = A.includes(i.key), l = H.includes(i.key), u = Ie.includes(i.key), d = N[i.key], f = l ? "checked" : u ? "halfChecked" : "unchecked", p = a === t.length - 1, m = [...r, p], h = /* @__PURE__ */ _(ee, {
 				node: i,
 				level: n,
 				expanded: s,
@@ -208,37 +209,37 @@ function y({ treeData: y, multiple: le = !1, checkable: b = !1, checkStrictly: x
 				disabled: C,
 				checkable: b,
 				selectable: S,
-				blockNode: ue,
-				showLine: de,
-				showIcon: fe,
-				switcherIcon: pe,
-				loadingIcon: me,
+				blockNode: de,
+				showLine: fe,
+				showIcon: pe,
+				switcherIcon: me,
+				loadingIcon: he,
 				loading: d === "loading",
 				loadable: j,
 				loadFailed: d === "error",
 				searchValue: E,
-				titleRender: he,
-				iconRender: ge,
+				titleRender: ge,
+				iconRender: _e,
 				isLast: m,
-				tabIndex: i.key === Be ? 0 : -1,
+				tabIndex: i.key === Ue ? 0 : -1,
 				onToggle: () => Z(i.key),
 				onSelect: () => Q(i.key),
 				onCheck: () => $(i.key),
-				onRetry: () => je(i.key)
+				onRetry: () => Ne(i.key)
 			});
 			return /* @__PURE__ */ te("div", {
 				role: "group",
 				"data-slot": "group",
 				className: e(oe),
-				children: [D ? D(h, i) : h, o && s && /* @__PURE__ */ g("div", {
+				children: [D ? D(h, i) : h, o && s && /* @__PURE__ */ _("div", {
 					"data-slot": "list",
-					children: Ve(i.children, n + 1, m)
+					children: We(i.children, n + 1, m)
 				})]
 			}, i.key);
 		});
 	}
-	function He(e) {
-		let t = H.includes(e.key), n = Pe.includes(e.key), r = N[e.key], i = t ? "checked" : n ? "halfChecked" : "unchecked", a = /* @__PURE__ */ g(ee, {
+	function Ge(e) {
+		let t = H.includes(e.key), n = Ie.includes(e.key), r = N[e.key], i = t ? "checked" : n ? "halfChecked" : "unchecked", a = /* @__PURE__ */ _(ee, {
 			node: e.node,
 			level: e.level,
 			expanded: V.includes(e.key),
@@ -247,62 +248,62 @@ function y({ treeData: y, multiple: le = !1, checkable: b = !1, checkStrictly: x
 			disabled: C,
 			checkable: b,
 			selectable: S,
-			blockNode: ue,
-			showLine: de,
-			showIcon: fe,
-			switcherIcon: pe,
-			loadingIcon: me,
+			blockNode: de,
+			showLine: fe,
+			showIcon: pe,
+			switcherIcon: me,
+			loadingIcon: he,
 			loading: r === "loading",
 			loadable: j,
 			loadFailed: r === "error",
 			searchValue: E,
-			titleRender: he,
-			iconRender: ge,
+			titleRender: ge,
+			iconRender: _e,
 			isLast: e.isLast,
-			tabIndex: e.key === Be ? 0 : -1,
+			tabIndex: e.key === Ue ? 0 : -1,
 			onToggle: () => Z(e.key),
 			onSelect: () => Q(e.key),
 			onCheck: () => $(e.key),
-			onRetry: () => je(e.key)
+			onRetry: () => Ne(e.key)
 		});
 		return D ? D(a, e.node) : a;
 	}
-	return Me && B.length === 0 ? /* @__PURE__ */ g("div", {
+	return Pe && B.length === 0 ? /* @__PURE__ */ _("div", {
 		role: "tree",
 		"data-slot": "tree",
 		ref: G,
 		onKeyDown: X,
 		onFocus: Y,
 		className: e([ne, O]),
-		children: g("div", {
+		children: _("div", {
 			"data-slot": "empty",
 			className: e(se),
-			children: we.noMatch
+			children: Ee.noMatch
 		})
-	}) : Fe ? /* @__PURE__ */ g("div", {
+	}) : Le ? /* @__PURE__ */ _("div", {
 		role: "tree",
 		"data-slot": "tree",
 		ref: G,
 		onKeyDown: X,
 		onFocus: Y,
 		className: e([re, O]),
-		children: g(r, {
-			ref: ze,
+		children: _(i, {
+			ref: He,
 			"data-virtualized": !0,
 			items: K,
 			height: U?.height ?? ie,
 			itemHeight: U?.itemHeight ?? ae,
 			overscan: U?.overscan,
-			renderItem: He
+			renderItem: Ge
 		})
-	}) : /* @__PURE__ */ g("div", {
+	}) : /* @__PURE__ */ _("div", {
 		role: "tree",
 		"data-slot": "tree",
 		ref: G,
 		onKeyDown: X,
 		onFocus: Y,
 		className: e([ne, O]),
-		children: Ve(B, 0, [])
+		children: We(B, 0, [])
 	});
 }
 //#endregion