@ryuzaki13/react-foundation-ui 1.6.2 → 1.6.3

package/dist/tree-select/TreeMultiSelect.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TreeMultiSelect.d.ts","sourceRoot":"","sources":["../../src/tree-select/TreeMultiSelect.tsx"],"names":[],"mappings":"AAKA,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAWvC,OAAO,EAAE,4BAA4B,EAAE,oBAAoB,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAE7F,MAAM,WAAW,oBAAqB,SAAQ,IAAI,CAAC,WAAW,CAAC,oBAAoB,CAAC,EAAE,aAAa,CAAC;IACnG,KAAK,EAAE,SAAS,cAAc,EAAE,CAAC;IACjC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;IAClC,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,8FAA8F;IAC9F,aAAa,CAAC,EAAE,4BAA4B,CAAC;IAC7C;;;OAGG;IACH,uBAAuB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC5C;AAmCD,wBAAgB,eAAe,CAAC,EAC/B,KAAK,EACL,WAAW,EACX,QAAQ,EACR,WAAiC,EACjC,IAAI,EACJ,KAAK,EACL,KAAK,EACL,QAAQ,EACR,KAAK,EACL,YAAY,EACZ,OAAO,EACP,SAAS,EACT,KAAK,EACL,aAAsB,EACtB,uBAAuB,EACvB,EAAE,oBAAoB,+BA+DtB"}
+{"version":3,"file":"TreeMultiSelect.d.ts","sourceRoot":"","sources":["../../src/tree-select/TreeMultiSelect.tsx"],"names":[],"mappings":"AAKA,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAWvC,OAAO,EAAE,4BAA4B,EAAE,oBAAoB,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAE7F,MAAM,WAAW,oBAAqB,SAAQ,IAAI,CAAC,WAAW,CAAC,oBAAoB,CAAC,EAAE,aAAa,CAAC;IACnG,KAAK,EAAE,SAAS,cAAc,EAAE,CAAC;IACjC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;IAClC,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,8FAA8F;IAC9F,aAAa,CAAC,EAAE,4BAA4B,CAAC;IAC7C;;;OAGG;IACH,uBAAuB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC5C;AA0CD,wBAAgB,eAAe,CAAC,EAC/B,KAAK,EACL,WAAW,EACX,QAAQ,EACR,WAAiC,EACjC,IAAI,EACJ,KAAK,EACL,KAAK,EACL,QAAQ,EACR,KAAK,EACL,YAAY,EACZ,OAAO,EACP,SAAS,EACT,KAAK,EACL,aAAsB,EACtB,uBAAuB,EACvB,EAAE,oBAAoB,+BA+DtB"}

package/dist/tree-select/index.js

@@ -154,17 +154,18 @@ function I(e, t) {
 	return `${e}::${t}`;
 }
 function de(e) {
-	let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), s = 0, c = (e, l) => {
-		t.set(e.id, e), n.set(e.id, l), i.set(e.id, s++);
-		let u = I(e.codeKey, e.value);
-		a.set(u, e.id);
-		let d = o.get(u);
-		d ? d.push(e.id) : o.set(u, [e.id]);
-		let f = (e.children ?? []).map((e) => e.id);
-		r.set(e.id, f);
-		for (let t of e.children ?? []) c(t, e.id);
+	let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), c = 0, l = (e, u) => {
+		t.set(e.id, e), n.set(e.id, u), i.set(e.id, c++);
+		let d = I(e.codeKey, e.value);
+		a.set(d, e.id);
+		let f = o.get(d);
+		f ? f.push(e.id) : o.set(d, [e.id]);
+		let p = (e.children ?? []).map((e) => e.id);
+		r.set(e.id, p);
+		for (let t of e.children ?? []) l(t, e.id);
+		s.set(e.id, e.disabled === !0 || p.some((e) => s.get(e) === !0));
 	};
-	for (let t of e) c(t);
+	for (let t of e) l(t);
 	return {
 		rootIds: e.map((e) => e.id),
 		nodeById: t,
@@ -172,7 +173,8 @@ function de(e) {
 		childrenById: r,
 		preorderIndexById: i,
 		nodeIdByCodeValue: a,
-		nodeIdsByCodeValue: o
+		nodeIdsByCodeValue: o,
+		subtreeContainsDisabledById: s
 	};
 }
 function L(e, t) {
@@ -186,7 +188,7 @@ function R(e, t) {
 	let n = /* @__PURE__ */ new Set();
 	if (!e) return n;
 	for (let [r, i] of Object.entries(e)) for (let e of i) for (let i of t.nodeIdsByCodeValue.get(I(r, e)) ?? []) n.add(i);
-	return U(n, t);
+	return W(n, t);
 }
 function z(e, t) {
 	let n = [...e].sort((e, n) => (t.preorderIndexById.get(e) ?? 2 ** 53 - 1) - (t.preorderIndexById.get(n) ?? 2 ** 53 - 1)), r = {}, i = /* @__PURE__ */ new Set();
@@ -211,42 +213,52 @@ function B(e, t, n) {
 	}
 	return !1;
 }
-function V(e, t, n) {
-	for (let r of [...e]) B(r, t, n) && e.delete(r);
+function V(e, t) {
+	let n = L(e, t);
+	return !n.length || n.some((e) => {
+		let n = t.nodeById.get(e);
+		return !n || n.selectionBehavior === "descendants" || t.subtreeContainsDisabledById.get(e) === !0;
+	}) ? !1 : !n.some((e, r) => n.some((n, i) => r !== i && (B(e, n, t) || B(n, e, t))));
+}
+function me(e, t) {
+	return V(e, t) ? L(e, t) : [e];
 }
 function H(e, t, n) {
+	for (let r of [...e]) B(r, t, n) && e.delete(r);
+}
+function U(e, t, n) {
 	if (t.has(e)) return !0;
 	if (n.nodeById.get(e)?.disabled) return !1;
 	let r = n.childrenById.get(e) ?? [];
-	return r.length !== 0 && r.every((e) => H(e, t, n));
+	return r.length !== 0 && r.every((e) => U(e, t, n));
 }
-function U(e, t) {
+function W(e, t) {
 	let n = new Set(e);
 	for (let e of [...n]) if (t.nodeById.get(e)?.selectionBehavior === "descendants") {
 		n.delete(e);
-		for (let r of q(t, t.childrenById.get(e) ?? [])) n.add(r);
+		for (let r of K(t, t.childrenById.get(e) ?? [])) n.add(r);
 	}
 	for (let e of [...n]) pe(e, t).some((e) => n.has(e)) && n.delete(e);
 	let r = [...t.nodeById.keys()].sort((e, n) => (t.preorderIndexById.get(n) ?? 0) - (t.preorderIndexById.get(e) ?? 0));
 	for (let e of r) {
 		let r = t.childrenById.get(e) ?? [];
-		if (!(r.length === 0 || n.has(e) || t.nodeById.get(e)?.disabled || t.nodeById.get(e)?.selectionBehavior === "descendants") && r.every((e) => H(e, n, t))) {
+		if (!(r.length === 0 || n.has(e) || t.nodeById.get(e)?.disabled || t.nodeById.get(e)?.selectionBehavior === "descendants") && r.every((e) => U(e, n, t))) {
 			let r = L(e, t);
-			if (r.every((e) => {
+			if (V(e, t) && r.every((e) => {
 				let r = t.nodeById.get(e);
-				return r && !r.disabled && r.selectionBehavior !== "descendants" && H(e, n, t);
-			})) for (let e of r) V(n, e, t), n.add(e);
+				return r && !r.disabled && r.selectionBehavior !== "descendants" && U(e, n, t);
+			})) for (let e of r) H(n, e, t), n.add(e);
 		}
 	}
 	return n;
 }
-function W(e, t, n) {
+function he(e, t, n) {
 	let r = n.parentById.get(t);
 	for (; r;) {
 		if (e.has(r)) {
 			for (let t of L(r, n)) if (e.has(t)) {
 				e.delete(t);
-				for (let r of q(n, n.childrenById.get(t) ?? [])) e.add(r);
+				for (let r of K(n, n.childrenById.get(t) ?? [])) e.add(r);
 			}
 			return !0;
 		}
@@ -257,7 +269,7 @@ function W(e, t, n) {
 function G(e, t, n) {
 	return t.has(e) ? !0 : pe(e, n).some((e) => t.has(e));
 }
-function K(e, t, n, r) {
+function ge(e, t, n, r) {
 	let i = n.childrenById.get(e) ?? [];
 	if (t.has(e)) return r.selectedIds.add(e), {
 		selected: !0,
@@ -267,7 +279,7 @@ function K(e, t, n, r) {
 		selected: !1,
 		partial: !1
 	};
-	let a = i.map((e) => K(e, t, n, r)), o = a.every((e) => e.selected && !e.partial), s = a.some((e) => e.selected || e.partial);
+	let a = i.map((e) => ge(e, t, n, r)), o = a.every((e) => e.selected && !e.partial), s = a.some((e) => e.selected || e.partial);
 	return o ? (r.selectedIds.add(e), {
 		selected: !0,
 		partial: !1
@@ -279,24 +291,27 @@ function K(e, t, n, r) {
 		partial: !1
 	};
 }
-function me(e, t) {
+function _e(e, t) {
 	let n = {
 		selectedIds: /* @__PURE__ */ new Set(),
 		partialIds: /* @__PURE__ */ new Set()
 	};
-	for (let r of t.rootIds) K(r, e, t, n);
+	for (let r of t.rootIds) ge(r, e, t, n);
 	return n;
 }
-function q(e, t = e.rootIds) {
+function K(e, t = e.rootIds) {
 	let n = (t) => {
 		let r = e.nodeById.get(t), i = (e.childrenById.get(t) ?? []).map(n), a = i.flatMap((e) => e.selectedIds), o = r?.disabled === !0 || i.some((e) => e.containsDisabled);
-		return !r || r.disabled ? {
+		if (!r || r.disabled) return {
 			containsDisabled: !0,
 			selectedIds: a
-		} : r.selectionBehavior === "descendants" ? {
+		};
+		if (r.selectionBehavior === "descendants") return {
 			containsDisabled: o,
 			selectedIds: a
-		} : o ? {
+		};
+		let s = !V(t, e);
+		return o || s ? {
 			containsDisabled: !0,
 			selectedIds: a
 		} : {
@@ -306,34 +321,34 @@ function q(e, t = e.rootIds) {
 	};
 	return new Set(t.flatMap((e) => n(e).selectedIds));
 }
-function he(e, t, n) {
+function ve(e, t, n) {
 	let r = R(e, n), i = (e) => {
 		if (r.has(e)) {
 			for (let t of L(e, n)) r.delete(t);
 			return;
 		}
 		if (G(e, r, n)) {
-			W(r, e, n) && i(e);
+			he(r, e, n) && i(e);
 			return;
 		}
-		for (let t of L(e, n)) V(r, t, n), r.add(t);
-	}, a = [...q(n, [t])], o = a.length > 0 && a.every((e) => G(e, r, n));
-	for (let e of a) {
+		for (let t of me(e, n)) H(r, t, n), r.add(t);
+	}, a = [...K(n, [t])], o = a.length === 0 && r.has(t) ? [t] : a, s = o.length > 0 && o.every((e) => G(e, r, n));
+	for (let e of o) {
 		let t = G(e, r, n);
-		(o && t || !o && !t) && i(e);
+		(s && t || !s && !t) && i(e);
 	}
-	return z(U(r, n), n);
+	return z(W(r, n), n);
 }
-function ge(e, t, n) {
+function ye(e, t, n) {
 	let r = t.parentById.get(e);
 	for (; r;) n.add(r), r = t.parentById.get(r);
 }
-function _e(e, t) {
+function be(e, t) {
 	let n = /* @__PURE__ */ new Set();
-	for (let r of e) ge(r, t, n);
+	for (let r of e) ye(r, t, n);
 	return n;
 }
-function ve(e, t, n) {
+function xe(e, t, n) {
 	let r = /* @__PURE__ */ new Set();
 	for (let [i, a] of e.childrenById) {
 		if (a.length === 0) continue;
@@ -342,14 +357,14 @@ function ve(e, t, n) {
 	}
 	return r;
 }
-function J(e, t, n) {
-	let r = (e.children ?? []).map((e) => J(e, t, n)).filter((e) => !!e);
+function q(e, t, n) {
+	let r = (e.children ?? []).map((e) => q(e, t, n)).filter((e) => !!e);
 	return !e.searchText.toLowerCase().includes(t) && r.length === 0 ? null : (r.length > 0 && n.add(e.id), r.length === 0 ? e : {
 		...e,
 		children: r
 	});
 }
-function ye(e, t) {
+function Se(e, t) {
 	let n = t.trim().toLowerCase();
 	if (!n) return {
 		nodes: [...e],
@@ -357,11 +372,11 @@ function ye(e, t) {
 	};
 	let r = /* @__PURE__ */ new Set();
 	return {
-		nodes: e.map((e) => J(e, n, r)).filter((e) => !!e),
+		nodes: e.map((e) => q(e, n, r)).filter((e) => !!e),
 		expandedIds: r
 	};
 }
-function be(e, t) {
+function Ce(e, t) {
 	let n = [], r = (e, i, a) => {
 		let o = (e.children?.length ?? 0) > 0, s = o && t.has(e.id);
 		if (n.push({
@@ -378,7 +393,7 @@ function be(e, t) {
 }
 //#endregion
 //#region src/tree-select/model/buildTreeColumnsLayoutDescriptor.ts
-function xe(e) {
+function we(e) {
 	let t = [], n = 0;
 	for (; n < e.length;) {
 		let r = n + 1;
@@ -397,18 +412,18 @@ function xe(e) {
 }
 //#endregion
 //#region src/tree-select/model/resolveBalancedTreeColumnsLayout.ts
-var Y = 16, Se = 48, Ce = 224, X = 10, we = 32, Te = 6, Ee = 3;
+var J = 16, Y = 48, Te = 224, X = 10, Ee = 32, De = 6, Oe = 3;
 function Z(e, t) {
 	return Number.isFinite(e) && e > 0 ? e : t;
 }
-function De(e) {
+function ke(e) {
 	let t = e.endIndexExclusive - e.startIndex;
-	return Math.min(Ee, t);
+	return Math.min(Oe, t);
 }
-function Oe(e, t) {
+function Ae(e, t) {
 	let n = Math.max(1, t), r = [], i = 1, a = 1, o = 0;
 	for (let t of e.groups) {
-		let e = De(t), s = n - a + 1;
+		let e = ke(t), s = n - a + 1;
 		a > 1 && e > s && (o += s, i += 1, a = 1);
 		for (let e = t.startIndex; e < t.endIndexExclusive; e += 1) r[e] = {
 			column: i,
@@ -421,8 +436,8 @@ function Oe(e, t) {
 		intentionalGapCount: o
 	};
 }
-function ke({ descriptor: e, availableWidth: t, availableHeight: n, viewportWidth: r, viewportHeight: i, referenceWidth: a }) {
-	let o = Math.max(0, Math.floor(Number.isFinite(e.itemCount) ? e.itemCount : 0)), s = Z(t, 240), c = Z(n, 80), l = Z(r, s + 16), u = Z(i, c), d = Math.max(1, Math.min(s, Math.max(1, l - 16))), f = Math.max(1, Math.min(c, u - 16)), p = Math.max(1, Z(a, 1)), m = Math.min(d, p), h = Math.max(1, Math.floor((d - Y + X) / 234)), g = Math.max(1, Math.min(Te, h, o || 1)), _ = e.groups.reduce((e, t) => Math.max(e, De(t)), 1);
+function je({ descriptor: e, availableWidth: t, availableHeight: n, viewportWidth: r, viewportHeight: i, referenceWidth: a }) {
+	let o = Math.max(0, Math.floor(Number.isFinite(e.itemCount) ? e.itemCount : 0)), s = Z(t, 240), c = Z(n, 80), l = Z(r, s + 16), u = Z(i, c), d = Math.max(1, Math.min(s, Math.max(1, l - 16))), f = Math.max(1, Math.min(c, u - 16)), p = Math.max(1, Z(a, 1)), m = Math.min(d, p), h = Math.max(1, Math.floor((d - J + X) / 234)), g = Math.max(1, Math.min(De, h, o || 1)), _ = e.groups.reduce((e, t) => Math.max(e, ke(t)), 1);
 	if (o === 0) return {
 		columnCount: 1,
 		rowCount: 1,
@@ -433,9 +448,9 @@ function ke({ descriptor: e, availableWidth: t, availableHeight: n, viewportWidt
 	};
 	let v, y = Infinity;
 	for (let t = 1; t <= g; t += 1) {
-		let n = Math.max(_, Math.ceil(o / t)), r = Oe(e, n);
-		for (; r.usedColumnCount > t && n < o;) n += 1, r = Oe(e, n);
-		let i = r.usedColumnCount, a = Math.max(m, Y + i * Ce + (i - 1) * X), s = Se + n * we, c = a / d, l = s / f, u = (i * n - o) / o, p = r.intentionalGapCount / o, h = Math.max(c, l) + .25 * Math.abs(c - l) + .01 * u + .02 * p + .04 * (i - 1);
+		let n = Math.max(_, Math.ceil(o / t)), r = Ae(e, n);
+		for (; r.usedColumnCount > t && n < o;) n += 1, r = Ae(e, n);
+		let i = r.usedColumnCount, a = Math.max(m, J + i * Te + (i - 1) * X), s = Y + n * Ee, c = a / d, l = s / f, u = (i * n - o) / o, p = r.intentionalGapCount / o, h = Math.max(c, l) + .25 * Math.abs(c - l) + .01 * u + .02 * p + .04 * (i - 1);
 		h < y && (y = h, v = {
 			columnCount: i,
 			rowCount: n,
@@ -451,7 +466,7 @@ function ke({ descriptor: e, availableWidth: t, availableHeight: n, viewportWidt
 		width: m,
 		minWidth: m,
 		maxHeight: f,
-		placements: Oe(e, o).placements
+		placements: Ae(e, o).placements
 	};
 }
 var Q = {
@@ -485,7 +500,7 @@ var Q = {
 };
 //#endregion
 //#region src/tree-select/TreeNodeContent.tsx
-function Ae({ node: e, level: t, highlight: r, hasChildren: i, isExpanded: a, selected: o, partial: s, selectionMode: c, optionsLayout: l = "tree", onToggleExpand: u, onToggleSelection: d }) {
+function Me({ node: e, level: t, highlight: r, hasChildren: i, isExpanded: a, selected: o, partial: s, selectionMode: c, optionsLayout: l = "tree", onToggleExpand: u, onToggleSelection: d }) {
 	let f = l === "tree", m = l === "columns" && t === 0;
 	return /* @__PURE__ */ k(D, { children: [
 		/* @__PURE__ */ O("span", {
@@ -537,32 +552,32 @@ function Ae({ node: e, level: t, highlight: r, hasChildren: i, isExpanded: a, se
 }
 //#endregion
 //#region src/tree-select/TreePickerBase.tsx
-function je({ label: n, description: c, disabled: p, placeholder: m, size: h, nodes: x, selectedIds: S, partialIds: C, selectionMode: w, optionsLayout: T = "tree", defaultExpandedCodeKeys: ee, open: te, onOpenChange: ne, bulkActions: A, triggerMode: j = "display", selectedSummary: M, selectedSummaryText: N, query: ie, defaultQuery: ae, onQuery: oe, onNodeActivate: se, onClearSelection: ce, isLoading: P, error: le }) {
-	let ue = y(null), F = y(null), [I, L] = b(!1), fe = te !== void 0, R = fe ? te : I, [z, pe] = b(() => /* @__PURE__ */ new Map()), B = j === "search" ? w === "multi" ? "search-multi" : "search-single" : "display", V = v(() => de(x), [x]), H = v(() => `${m} <${V.nodeById.size}>`, [m, V]), U = v(() => new Set(ee), [ee]), { query: W, setQuery: K, resetQueryOnClose: me } = u({
+function Ne({ label: n, description: c, disabled: p, placeholder: m, size: h, nodes: x, selectedIds: S, partialIds: C, selectionMode: w, optionsLayout: T = "tree", defaultExpandedCodeKeys: ee, open: te, onOpenChange: ne, bulkActions: A, triggerMode: j = "display", selectedSummary: M, selectedSummaryText: N, query: ie, defaultQuery: ae, onQuery: oe, onNodeActivate: se, onClearSelection: ce, isLoading: P, error: le }) {
+	let ue = y(null), F = y(null), [I, L] = b(!1), fe = te !== void 0, R = fe ? te : I, [z, pe] = b(() => /* @__PURE__ */ new Map()), B = j === "search" ? w === "multi" ? "search-multi" : "search-single" : "display", V = v(() => de(x), [x]), me = v(() => `${m} <${V.nodeById.size}>`, [m, V]), H = v(() => new Set(ee), [ee]), { query: U, setQuery: W, resetQueryOnClose: he } = u({
 		query: ie,
 		defaultQuery: ae,
 		onQuery: oe,
 		triggerMode: B
-	}), q = (e) => {
-		R && !e && me && K(""), fe || L(e), ne?.(e);
-	}, { nodes: he, expandedIds: ge } = v(() => ye(x, W), [x, W]), J = v(() => _e(S, V), [S, V]), Y = v(() => ve(V, U, z), [
-		U,
+	}), ge = (e) => {
+		R && !e && he && W(""), fe || L(e), ne?.(e);
+	}, { nodes: _e, expandedIds: K } = v(() => Se(x, U), [x, U]), ve = v(() => be(S, V), [S, V]), ye = v(() => xe(V, H, z), [
+		H,
 		z,
 		V
-	]), Se = v(() => new Set([...V.childrenById].filter(([, e]) => e.length > 0).map(([e]) => e)), [V]), Ce = v(() => T === "columns" ? Se : /* @__PURE__ */ new Set([
-		...Y,
-		...ge,
-		...J
+	]), q = v(() => new Set([...V.childrenById].filter(([, e]) => e.length > 0).map(([e]) => e)), [V]), J = v(() => T === "columns" ? q : /* @__PURE__ */ new Set([
+		...ye,
+		...K,
+		...ve
 	]), [
-		Se,
-		Y,
+		q,
+		ye,
 		T,
-		ge,
-		J
-	]), X = v(() => be(he, Ce), [he, Ce]), we = v(() => X.findIndex((e) => S.has(e.node.id)), [S, X]), Te = v(() => xe(X), [X]), Ee = g((e) => {
-		let t = ke({
+		K,
+		ve
+	]), Y = v(() => Ce(_e, J), [_e, J]), Te = v(() => Y.findIndex((e) => S.has(e.node.id)), [S, Y]), X = v(() => we(Y), [Y]), Ee = g((e) => {
+		let t = je({
 			...e,
-			descriptor: Te
+			descriptor: X
 		}), n = {};
 		return t.placements.forEach((e, t) => {
 			n[`--tree-option-${t}-column`] = String(e.column), n[`--tree-option-${t}-row`] = String(e.row);
@@ -575,11 +590,11 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 			"--tree-row-count": String(t.rowCount),
 			...n
 		};
-	}, [Te]), { activeIndex: Z, context: De, floatingStyles: Oe, getFloatingProps: je, setReference: Me, setFloating: Ne, setOptionRef: Pe, close: Fe, openList: Ie, toggleOpen: Le, selectOption: Re, handleReferenceKeyDown: ze, handleFloatingKeyDown: Be, getOptionId: Ve, getActiveOptionId: He } = o({
-		options: X,
-		selectedIndex: we,
+	}, [X]), { activeIndex: De, context: Oe, floatingStyles: Z, getFloatingProps: ke, setReference: Ae, setFloating: Ne, setOptionRef: Pe, close: Fe, openList: Ie, toggleOpen: Le, selectOption: Re, handleReferenceKeyDown: ze, handleFloatingKeyDown: Be, getOptionId: Ve, getActiveOptionId: He } = o({
+		options: Y,
+		selectedIndex: Te,
 		open: R,
-		onOpenChange: q,
+		onOpenChange: ge,
 		onSelect: (e) => se(e.node),
 		getOptionDisabled: (e) => e.node.disabled === !0,
 		disabled: p || P,
@@ -588,13 +603,13 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 		triggerMode: B,
 		placementStrategy: T === "columns" ? "auto" : "flip",
 		resolveFloatingSize: T === "columns" ? Ee : void 0
-	}), Ue = De.update, We = S.size > 0, Ge = j === "search" && (R || W.length > 0), Ke = Ge ? W : N ?? "", qe = j === "display" && !!M, Je = B === "search-multi" && !!M, Ye = B === "search-multi" && !We || B === "search-single" && (!N || Ge) || B === "display" && !We, $ = d({
+	}), Ue = Oe.update, We = S.size > 0, Ge = j === "search" && (R || U.length > 0), Ke = Ge ? U : N ?? "", qe = j === "display" && !!M, Je = B === "search-multi" && !!M, Ye = B === "search-multi" && !We || B === "search-single" && (!N || Ge) || B === "display" && !We, $ = d({
 		mode: B,
 		open: R,
-		currentQuery: W,
+		currentQuery: U,
 		hasDisplayValue: !!N,
 		inputRef: ue,
-		setQuery: K,
+		setQuery: W,
 		openList: Ie,
 		close: Fe,
 		toggleOpen: Le
@@ -605,9 +620,9 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 			onDeselectAll: A.onDeselectAll,
 			selectAllButtonRef: F
 		}) : null, Ze ? /* @__PURE__ */ O(t, {
-			value: W,
-			onChange: K,
-			onClear: () => K(""),
+			value: U,
+			onChange: W,
+			onClear: () => W(""),
 			placeholder: "Поиск по дереву",
 			onKeyDown: (e) => {
 				e.key !== "Escape" && e.key !== "Tab" && e.stopPropagation();
@@ -620,7 +635,7 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 	_(() => {
 		R && T === "columns" && Ue();
 	}, [
-		Te.signature,
+		X.signature,
 		R,
 		T,
 		Ue
@@ -628,10 +643,10 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 	let $e = (e) => {
 		ue.current = e;
 	}, et = () => {
-		ce?.(), K(""), w === "single" && Fe();
+		ce?.(), W(""), w === "single" && Fe();
 	}, tt = (e) => {
 		e.hasChildren && pe((t) => {
-			let n = new Map(t), r = t.get(e.node.id) ?? U.has(e.node.codeKey);
+			let n = new Map(t), r = t.get(e.node.id) ?? H.has(e.node.codeKey);
 			return n.set(e.node.id, !r), n;
 		});
 	};
@@ -644,7 +659,7 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 			let c = `${t}-listbox`, l = typeof n == "string" ? n : m;
 			return /* @__PURE__ */ k(D, { children: [/* @__PURE__ */ O(r, {
 				ref: $e,
-				rootRef: Me,
+				rootRef: Ae,
 				id: t,
 				type: "text",
 				role: "combobox",
@@ -653,7 +668,7 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 				disabled: p,
 				readOnly: j !== "search",
 				value: j === "display" && qe ? "" : Ke,
-				placeholder: Ye ? H : void 0,
+				placeholder: Ye ? me : void 0,
 				"aria-labelledby": i,
 				"aria-label": i ? void 0 : m,
 				"aria-describedby": o,
@@ -661,7 +676,7 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 				"aria-expanded": R,
 				"aria-controls": R ? c : void 0,
 				"aria-autocomplete": T !== "columns" && j === "search" ? "list" : "none",
-				"aria-activedescendant": T !== "columns" && R && X.length > 0 ? He(c) : void 0,
+				"aria-activedescendant": T !== "columns" && R && Y.length > 0 ? He(c) : void 0,
 				inputClassName: E(We && Q.treeSummary, qe && Q.inputWithOverlay),
 				overlay: qe ? /* @__PURE__ */ O("div", {
 					className: Q.valueOverlay,
@@ -700,7 +715,7 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 					ze(e), !e.defaultPrevented && $.handleTriggerKeyDown({
 						event: e,
 						onActivateWhenOpen: () => {
-							let e = Z >= 0 ? X[Z] : void 0;
+							let e = De >= 0 ? Y[De] : void 0;
 							e && Re(e);
 						},
 						enableSpaceActivation: j === "display"
@@ -708,17 +723,17 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 				}
 			}), /* @__PURE__ */ O(a, {
 				open: R,
-				context: De,
-				floatingStyles: Oe,
+				context: Oe,
+				floatingStyles: Z,
 				listId: c,
 				labelId: i,
 				popupAriaLabel: l,
 				descriptionId: o,
-				activeOptionId: T !== "columns" && X.length > 0 ? He(c) : void 0,
+				activeOptionId: T !== "columns" && Y.length > 0 ? He(c) : void 0,
 				ariaMultiselectable: T !== "columns" && w === "multi",
 				popupRole: T === "columns" ? "dialog" : "listbox",
 				setFloating: Ne,
-				getFloatingProps: je,
+				getFloatingProps: ke,
 				onKeyDown: Be,
 				className: e.uiPopupOptions,
 				layoutClassName: T === "columns" ? Q.treeColumnsPopupLayout : void 0,
@@ -726,11 +741,11 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 				header: Qe,
 				children: /* @__PURE__ */ O("div", {
 					className: E(T === "columns" && Q.treeColumns),
-					children: X.length === 0 ? /* @__PURE__ */ O(f, {
+					children: Y.length === 0 ? /* @__PURE__ */ O(f, {
 						errorState: le,
 						emptyState: !le && !P ? "Нет данных" : void 0
-					}) : X.map((e, t) => {
-						let n = w === "multi" ? G(e.node.id, S, V) : S.has(e.node.id), r = w === "multi" && !n && C.has(e.node.id), i = t === Z, a = e.node.disabled === !0;
+					}) : Y.map((e, t) => {
+						let n = w === "multi" ? G(e.node.id, S, V) : S.has(e.node.id), r = w === "multi" && !n && C.has(e.node.id), i = t === De, a = e.node.disabled === !0;
 						return /* @__PURE__ */ O("div", {
 							"data-ui": "tree-select-option",
 							id: Ve(c, t),
@@ -749,10 +764,10 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 							onClick: () => Re(e),
 							children: /* @__PURE__ */ O("div", {
 								className: Q.treeNodeButton,
-								children: /* @__PURE__ */ O(Ae, {
+								children: /* @__PURE__ */ O(Me, {
 									node: e.node,
 									level: e.level,
-									highlight: W,
+									highlight: U,
 									hasChildren: e.hasChildren,
 									isExpanded: e.isExpanded,
 									selected: n,
@@ -772,27 +787,28 @@ function je({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 }
 //#endregion
 //#region src/tree-select/TreeMultiSelect.tsx
-function Me(e, t) {
-	if (e.size !== 0) {
-		if (e.size === 1) {
-			let n = t.nodeById.get([...e][0]);
-			return n ? n.label : void 0;
+function Pe(e, t) {
+	let n = z(e, t), r = Object.values(n).reduce((e, t) => e + t.length, 0);
+	if (r !== 0) {
+		if (r === 1) {
+			let n = [...e].sort((e, n) => (t.preorderIndexById.get(e) ?? 2 ** 53 - 1) - (t.preorderIndexById.get(n) ?? 2 ** 53 - 1))[0], r = t.nodeById.get(n);
+			return r ? r.label : void 0;
 		}
-		return m(e.size);
+		return m(r);
 	}
 }
-function Ne(e, t, n) {
+function Fe(e, t, n) {
 	let r = R(e, n), i = R(t, n);
 	return r.size === i.size && [...r].every((e) => i.has(e));
 }
-function Pe({ label: e, description: t, disabled: n, placeholder: r = "Выберите значения", size: i, nodes: a, value: o, onChange: s, query: l, defaultQuery: u, onQuery: d, isLoading: f, error: p, optionsLayout: m = "tree", defaultExpandedCodeKeys: g }) {
+function Ie({ label: e, description: t, disabled: n, placeholder: r = "Выберите значения", size: i, nodes: a, value: o, onChange: s, query: l, defaultQuery: u, onQuery: d, isLoading: f, error: p, optionsLayout: m = "tree", defaultExpandedCodeKeys: g }) {
 	let [_, y] = b(!1), x = v(() => de(a), [a]), { draftValue: S, setDraftValue: C, prepareOpen: w } = c({
 		value: o,
 		open: _,
 		onCommit: s,
-		isEqual: (e, t) => Ne(e, t, x)
-	}), T = _ ? S : o, E = v(() => R(T, x), [T, x]), D = v(() => me(E, x), [E, x]), k = v(() => Me(E, x), [E, x]);
-	return /* @__PURE__ */ O(je, {
+		isEqual: (e, t) => Fe(e, t, x)
+	}), T = _ ? S : o, E = v(() => R(T, x), [T, x]), D = v(() => _e(E, x), [E, x]), k = v(() => Pe(E, x), [E, x]);
+	return /* @__PURE__ */ O(Ne, {
 		label: e,
 		description: t,
 		disabled: n,
@@ -810,7 +826,7 @@ function Pe({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 		},
 		bulkActions: {
 			onSelectAll: () => {
-				C(z(q(x), x));
+				C(z(K(x), x));
 			},
 			onDeselectAll: () => C({})
 		},
@@ -820,7 +836,7 @@ function Pe({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 		defaultQuery: u,
 		onQuery: d,
 		onNodeActivate: (e) => {
-			C((t) => he(t, e.id, x));
+			C((t) => ve(t, e.id, x));
 		},
 		onClearSelection: () => {
 			C({}), _ || s({});
@@ -831,7 +847,7 @@ function Pe({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 }
 //#endregion
 //#region src/tree-select/ODataTreeMultiSelect.tsx
-function Fe({ label: e, description: t, disabled: n, size: r, placeholder: i, query: a, defaultQuery: o, onQuery: s, optionsLayout: c, value: l, onChange: u, odata: d, segments: f, model: p, defaultExpandedCodeKeys: m, segmentOrder: h, allowEmptyCodeKeys: g, transformNodes: _ }) {
+function Le({ label: e, description: t, disabled: n, size: r, placeholder: i, query: a, defaultQuery: o, onQuery: s, optionsLayout: c, value: l, onChange: u, odata: d, segments: f, model: p, defaultExpandedCodeKeys: m, segmentOrder: h, allowEmptyCodeKeys: g, transformNodes: _ }) {
 	let y = F({
 		odata: d,
 		segments: f,
@@ -843,7 +859,7 @@ function Fe({ label: e, description: t, disabled: n, size: r, placeholder: i, qu
 		y.nodes,
 		y.orderedCodeKeys
 	]);
-	return /* @__PURE__ */ O(Pe, {
+	return /* @__PURE__ */ O(Ie, {
 		label: e,
 		description: t,
 		disabled: n || y.isLoading,
@@ -863,12 +879,12 @@ function Fe({ label: e, description: t, disabled: n, size: r, placeholder: i, qu
 }
 //#endregion
 //#region src/tree-select/TreeSelect.tsx
-function Ie(e) {
+function Re(e) {
 	if (e) return e.code && e.code !== e.label ? `${e.label} · ${e.code}` : e.label;
 }
-function Le({ label: e, description: t, disabled: n, placeholder: r = "Выберите значение", size: i, nodes: a, value: o, onChange: s, query: c, defaultQuery: l, onQuery: u, isLoading: d, error: f, clearable: p = !1, defaultExpandedCodeKeys: m }) {
+function ze({ label: e, description: t, disabled: n, placeholder: r = "Выберите значение", size: i, nodes: a, value: o, onChange: s, query: c, defaultQuery: l, onQuery: u, isLoading: d, error: f, clearable: p = !1, defaultExpandedCodeKeys: m }) {
 	let h = v(() => de(a), [a]), g = fe(o, h), _ = g ? h.nodeById.get(g) : void 0;
-	return /* @__PURE__ */ O(je, {
+	return /* @__PURE__ */ O(Ne, {
 		label: e,
 		description: t,
 		disabled: n,
@@ -880,7 +896,7 @@ function Le({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 		selectionMode: "single",
 		defaultExpandedCodeKeys: m,
 		triggerMode: "search",
-		selectedSummaryText: Ie(_),
+		selectedSummaryText: Re(_),
 		query: c,
 		defaultQuery: l,
 		onQuery: u,
@@ -895,13 +911,13 @@ function Le({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 }
 //#endregion
 //#region src/tree-select/ODataTreeSelect.tsx
-function Re({ label: e, description: t, disabled: n, size: r, placeholder: i, query: a, defaultQuery: o, onQuery: s, value: c, onChange: l, odata: u, segments: d, model: f, clearable: p, defaultExpandedCodeKeys: m }) {
+function Be({ label: e, description: t, disabled: n, size: r, placeholder: i, query: a, defaultQuery: o, onQuery: s, value: c, onChange: l, odata: u, segments: d, model: f, clearable: p, defaultExpandedCodeKeys: m }) {
 	let h = F({
 		odata: u,
 		segments: d,
 		model: f
 	});
-	return /* @__PURE__ */ O(Le, {
+	return /* @__PURE__ */ O(ze, {
 		label: e,
 		description: t,
 		disabled: n || h.isLoading,
@@ -920,6 +936,6 @@ function Re({ label: e, description: t, disabled: n, size: r, placeholder: i, qu
 	});
 }
 //#endregion
-export { Fe as ODataTreeMultiSelect, Re as ODataTreeSelect, Pe as TreeMultiSelect, Le as TreeSelect, j as treeSelectValueToSelectedFilters };
+export { Le as ODataTreeMultiSelect, Be as ODataTreeSelect, Ie as TreeMultiSelect, ze as TreeSelect, j as treeSelectValueToSelectedFilters };
 
 //# sourceMappingURL=index.js.map