@ryuzaki13/react-foundation-ui 1.6.3 → 1.6.5

package/dist/tree-select/index.js

@@ -7,33 +7,33 @@ import { o as m, s as h } from "../chunks/multi-select-BDvaRbUc.js";
 import { useCallback as g, useLayoutEffect as _, useMemo as v, useRef as y, useState as b } from "react";
 import { flattenODataDependentServices as x, sortODataDependentSegmentItemsByChains as S, useODataCollection as C, useODataCollectionChains as w, useODataCollectionModel as T } from "@ryuzaki13/react-foundation-api/odata";
 import { cn as E } from "@ryuzaki13/react-foundation-lib/utils";
-import { Fragment as D, jsx as O, jsxs as k } from "react/jsx-runtime";
-import { CheckIcon as ee, ChevronRightIcon as te, MinusIcon as ne, XIcon as re } from "lucide-react";
-import { compareStrings as A } from "@ryuzaki13/react-foundation-lib/string-comparison";
+import { Fragment as D, jsx as O, jsxs as ee } from "react/jsx-runtime";
+import { CheckIcon as k, ChevronRightIcon as te, MinusIcon as ne, XIcon as re } from "lucide-react";
+import { compareStrings as ie } from "@ryuzaki13/react-foundation-lib/string-comparison";
 //#region src/tree-select/helpers.ts
-function j(e) {
+function A(e) {
 	return e ? { [e.codeKey]: [e.value] } : {};
 }
 //#endregion
 //#region src/tree-select/model/buildODataTreeNodes.ts
-function M(e, t, n) {
+function j(e, t, n) {
 	return e ? `${e}/${t}:${n}` : `${t}:${n}`;
 }
-function N(e, t, n) {
+function M(e, t, n) {
 	let r = n[t];
 	return r && e[r] || e[t];
 }
-function ie(e) {
+function N(e) {
 	return [...new Set(e.filter(Boolean))].join(" ");
 }
 function ae(e) {
 	return {
-		id: M(e.parentId, e.codeKey, e.value),
+		id: j(e.parentId, e.codeKey, e.value),
 		codeKey: e.codeKey,
 		value: e.value,
 		label: e.label,
 		code: e.code,
-		searchText: ie([
+		searchText: N([
 			e.value,
 			e.label,
 			e.code
@@ -46,7 +46,7 @@ function ae(e) {
 function oe(e, t) {
 	e.sort((e, n) => {
 		let r = t ? e.sortCode : e.label, i = t ? n.sortCode : n.label;
-		return A(r, i) || A(e.sortCode, n.sortCode);
+		return ie(r, i) || ie(e.sortCode, n.sortCode);
 	});
 	for (let n of e) oe(n.children, t);
 }
@@ -69,7 +69,7 @@ function ce({ items: e, orderedCodeKeys: t, keyPairsMap: n, hiddenCodeKeys: r, t
 		for (let l of t) {
 			let t = String(o[l] ?? "");
 			if (!t && !a?.has(l)) break;
-			let u = String(N(o, l, n) ?? ""), d = i?.has(l) ? u : t, f = `${l}:${d}`, p = e ? e.childByBranchKey : c, m = p.get(f);
+			let u = String(M(o, l, n) ?? ""), d = i?.has(l) ? u : t, f = `${l}:${d}`, p = e ? e.childByBranchKey : c, m = p.get(f);
 			m || (m = ae({
 				parentId: e?.id,
 				codeKey: l,
@@ -84,12 +84,12 @@ function ce({ items: e, orderedCodeKeys: t, keyPairsMap: n, hiddenCodeKeys: r, t
 }
 //#endregion
 //#region src/tree-select/model/resolveOrderedTreeSegmentItems.ts
-function P(e, t, n) {
+function le(e, t, n) {
 	return S(e, t, n);
 }
 //#endregion
 //#region src/tree-select/model/useODataTreeData.ts
-function le(e, t, n) {
+function P(e, t, n) {
 	return x([{
 		odata: e,
 		segments: t,
@@ -100,11 +100,11 @@ function ue(e) {
 	return e[0]?.id;
 }
 function F({ odata: e, segments: t, model: n, segmentOrder: r, allowEmptyCodeKeys: i }) {
-	let a = `${e.service}.${e.target}`, o = v(() => le(e, t, n), [
+	let a = `${e.service}.${e.target}`, o = v(() => P(e, t, n), [
 		e,
 		t,
 		n
-	]), s = w([e]), c = v(() => P(o, s, r), [
+	]), s = w([e]), c = v(() => le(o, s, r), [
 		o,
 		s,
 		r
@@ -188,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 W(n, t);
+	return K(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();
@@ -200,12 +200,12 @@ function z(e, t) {
 	}
 	return r;
 }
-function pe(e, t) {
+function B(e, t) {
 	let n = [], r = t.parentById.get(e);
 	for (; r;) n.push(r), r = t.parentById.get(r);
 	return n;
 }
-function B(e, t, n) {
+function V(e, t, n) {
 	let r = n.parentById.get(e);
 	for (; r;) {
 		if (r === t) return !0;
@@ -213,52 +213,62 @@ function B(e, t, n) {
 	}
 	return !1;
 }
-function V(e, t) {
+function H(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))));
+	}) ? !1 : !n.some((e, r) => n.some((n, i) => r !== i && (V(e, n, t) || V(n, e, t))));
 }
-function me(e, t) {
-	return V(e, t) ? L(e, t) : [e];
+function U(e, t) {
+	return H(e, t) ? L(e, t) : [e];
 }
-function H(e, t, n) {
-	for (let r of [...e]) B(r, t, n) && e.delete(r);
+function pe(e, t, n) {
+	for (let r of [...e]) V(r, t, n) && e.delete(r);
 }
-function U(e, t, n) {
+function W(e, t, n) {
+	let r = [t];
+	for (let t = 0; t < r.length; t += 1) {
+		let i = r[t];
+		if (i) {
+			r.push(...n.childrenById.get(i) ?? []);
+			for (let t of L(i, n)) e.delete(t);
+		}
+	}
+}
+function G(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) => U(e, t, n));
+	return r.length !== 0 && r.every((e) => G(e, t, n));
 }
-function W(e, t) {
+function K(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 K(t, t.childrenById.get(e) ?? [])) n.add(r);
+		for (let r of J(t, t.childrenById.get(e) ?? [])) n.add(r);
 	}
-	for (let e of [...n]) pe(e, t).some((e) => n.has(e)) && n.delete(e);
+	for (let e of [...n]) B(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) => U(e, n, t))) {
+		if (!(r.length === 0 || n.has(e) || t.nodeById.get(e)?.disabled || t.nodeById.get(e)?.selectionBehavior === "descendants") && r.every((e) => G(e, n, t))) {
 			let r = L(e, t);
-			if (V(e, t) && r.every((e) => {
+			if (H(e, t) && r.every((e) => {
 				let r = t.nodeById.get(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 r && !r.disabled && r.selectionBehavior !== "descendants" && G(e, n, t);
+			})) for (let e of r) pe(n, e, t), n.add(e);
 		}
 	}
 	return n;
 }
-function he(e, t, n) {
+function me(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 K(n, n.childrenById.get(t) ?? [])) e.add(r);
+				for (let r of J(n, n.childrenById.get(t) ?? [])) e.add(r);
 			}
 			return !0;
 		}
@@ -266,10 +276,10 @@ function he(e, t, n) {
 	}
 	return !1;
 }
-function G(e, t, n) {
-	return t.has(e) ? !0 : pe(e, n).some((e) => t.has(e));
+function q(e, t, n) {
+	return t.has(e) ? !0 : B(e, n).some((e) => t.has(e));
 }
-function ge(e, t, n, r) {
+function he(e, t, n, r) {
 	let i = n.childrenById.get(e) ?? [];
 	if (t.has(e)) return r.selectedIds.add(e), {
 		selected: !0,
@@ -279,7 +289,7 @@ function ge(e, t, n, r) {
 		selected: !1,
 		partial: !1
 	};
-	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);
+	let a = i.map((e) => he(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
@@ -291,15 +301,15 @@ function ge(e, t, n, r) {
 		partial: !1
 	};
 }
-function _e(e, t) {
+function ge(e, t) {
 	let n = {
 		selectedIds: /* @__PURE__ */ new Set(),
 		partialIds: /* @__PURE__ */ new Set()
 	};
-	for (let r of t.rootIds) ge(r, e, t, n);
+	for (let r of t.rootIds) he(r, e, t, n);
 	return n;
 }
-function K(e, t = e.rootIds) {
+function J(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);
 		if (!r || r.disabled) return {
@@ -310,7 +320,7 @@ function K(e, t = e.rootIds) {
 			containsDisabled: o,
 			selectedIds: a
 		};
-		let s = !V(t, e);
+		let s = !H(t, e);
 		return o || s ? {
 			containsDisabled: !0,
 			selectedIds: a
@@ -321,34 +331,40 @@ function K(e, t = e.rootIds) {
 	};
 	return new Set(t.flatMap((e) => n(e).selectedIds));
 }
-function ve(e, t, n) {
-	let r = R(e, n), i = (e) => {
+function _e(e, t, n) {
+	let r = R(e, n);
+	if (G(t, r, n)) return W(r, t, n), z(K(r, n), n);
+	let i = (e) => {
 		if (r.has(e)) {
-			for (let t of L(e, n)) r.delete(t);
+			W(r, e, n);
 			return;
 		}
 		if (G(e, r, n)) {
-			he(r, e, n) && i(e);
+			W(r, e, n);
 			return;
 		}
-		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));
+		if (q(e, r, n)) {
+			me(r, e, n) && (q(e, r, n) || G(e, r, n) ? i(e) : W(r, e, n));
+			return;
+		}
+		for (let t of U(e, n)) pe(r, t, n), r.add(t);
+	}, a = [...J(n, [t])], o = a.length === 0 && (q(t, r, n) || G(t, r, n)) ? [t] : a, s = o.length > 0 && o.every((e) => q(e, r, n) || G(e, r, n));
 	for (let e of o) {
-		let t = G(e, r, n);
+		let t = q(e, r, n) || G(e, r, n);
 		(s && t || !s && !t) && i(e);
 	}
-	return z(W(r, n), n);
+	return z(K(r, n), n);
 }
-function ye(e, t, n) {
+function ve(e, t, n) {
 	let r = t.parentById.get(e);
 	for (; r;) n.add(r), r = t.parentById.get(r);
 }
-function be(e, t) {
+function ye(e, t) {
 	let n = /* @__PURE__ */ new Set();
-	for (let r of e) ye(r, t, n);
+	for (let r of e) ve(r, t, n);
 	return n;
 }
-function xe(e, t, n) {
+function be(e, t, n) {
 	let r = /* @__PURE__ */ new Set();
 	for (let [i, a] of e.childrenById) {
 		if (a.length === 0) continue;
@@ -357,8 +373,8 @@ function xe(e, t, n) {
 	}
 	return r;
 }
-function q(e, t, n) {
-	let r = (e.children ?? []).map((e) => q(e, t, n)).filter((e) => !!e);
+function xe(e, t, n) {
+	let r = (e.children ?? []).map((e) => xe(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
@@ -372,7 +388,7 @@ function Se(e, t) {
 	};
 	let r = /* @__PURE__ */ new Set();
 	return {
-		nodes: e.map((e) => q(e, n, r)).filter((e) => !!e),
+		nodes: e.map((e) => xe(e, n, r)).filter((e) => !!e),
 		expandedIds: r
 	};
 }
@@ -412,18 +428,18 @@ function we(e) {
 }
 //#endregion
 //#region src/tree-select/model/resolveBalancedTreeColumnsLayout.ts
-var J = 16, Y = 48, Te = 224, X = 10, Ee = 32, De = 6, Oe = 3;
+var Te = 16, Y = 48, Ee = 224, X = 10, De = 32, Oe = 6, ke = 3;
 function Z(e, t) {
 	return Number.isFinite(e) && e > 0 ? e : t;
 }
-function ke(e) {
+function Ae(e) {
 	let t = e.endIndexExclusive - e.startIndex;
-	return Math.min(Oe, t);
+	return Math.min(ke, t);
 }
-function Ae(e, t) {
+function je(e, t) {
 	let n = Math.max(1, t), r = [], i = 1, a = 1, o = 0;
 	for (let t of e.groups) {
-		let e = ke(t), s = n - a + 1;
+		let e = Ae(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,
@@ -436,8 +452,8 @@ function Ae(e, t) {
 		intentionalGapCount: o
 	};
 }
-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);
+function Me({ 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 - Te + X) / 234)), g = Math.max(1, Math.min(Oe, h, o || 1)), _ = e.groups.reduce((e, t) => Math.max(e, Ae(t)), 1);
 	if (o === 0) return {
 		columnCount: 1,
 		rowCount: 1,
@@ -448,9 +464,9 @@ function je({ 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 = 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);
+		let n = Math.max(_, Math.ceil(o / t)), r = je(e, n);
+		for (; r.usedColumnCount > t && n < o;) n += 1, r = je(e, n);
+		let i = r.usedColumnCount, a = Math.max(m, Te + i * Ee + (i - 1) * X), s = Y + n * De, 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,
@@ -466,7 +482,7 @@ function je({ descriptor: e, availableWidth: t, availableHeight: n, viewportWidt
 		width: m,
 		minWidth: m,
 		maxHeight: f,
-		placements: Ae(e, o).placements
+		placements: je(e, o).placements
 	};
 }
 var Q = {
@@ -500,9 +516,9 @@ var Q = {
 };
 //#endregion
 //#region src/tree-select/TreeNodeContent.tsx
-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 }) {
+function Ne({ 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: [
+	return /* @__PURE__ */ ee(D, { children: [
 		/* @__PURE__ */ O("span", {
 			className: Q.treeIndent,
 			style: { "--tree-level": t },
@@ -536,7 +552,7 @@ function Me({ node: e, level: t, highlight: r, hasChildren: i, isExpanded: a, se
 		}) : c === "multi" ? /* @__PURE__ */ O("span", {
 			className: E(Q.treeSelection, o && Q.treeSelectionChecked, s && Q.treeSelectionPartial),
 			"aria-hidden": "true",
-			children: o ? /* @__PURE__ */ O(ee, { className: Q.treeSelectionIcon }) : s ? /* @__PURE__ */ O(ne, { className: Q.treeSelectionIcon }) : null
+			children: o ? /* @__PURE__ */ O(k, { className: Q.treeSelectionIcon }) : s ? /* @__PURE__ */ O(ne, { className: Q.treeSelectionIcon }) : null
 		}) : null,
 		/* @__PURE__ */ O("div", {
 			className: Q.treeNodeOptionContent,
@@ -552,30 +568,30 @@ function Me({ node: e, level: t, highlight: r, hasChildren: i, isExpanded: a, se
 }
 //#endregion
 //#region src/tree-select/TreePickerBase.tsx
-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
-	}), 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
-	]), 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
+function Pe({ label: n, description: c, disabled: p, placeholder: m, size: h, nodes: x, selectedIds: S, partialIds: C, selectionMode: w, optionsLayout: T = "tree", defaultExpandedCodeKeys: k, unavailableNodeIds: te, open: ne, onOpenChange: ie, bulkActions: A, triggerMode: j = "display", selectedSummary: M, selectedSummaryText: N, query: ae, defaultQuery: oe, onQuery: se, onNodeActivate: ce, onClearSelection: le, isLoading: P, error: ue }) {
+	let F = y(null), I = y(null), [L, fe] = b(!1), R = ne !== void 0, z = R ? ne : L, [B, V] = b(() => /* @__PURE__ */ new Map()), H = j === "search" ? w === "multi" ? "search-multi" : "search-single" : "display", U = v(() => de(x), [x]), pe = v(() => `${m} <${U.nodeById.size}>`, [m, U]), W = v(() => new Set(k), [k]), { query: G, setQuery: K, resetQueryOnClose: me } = u({
+		query: ae,
+		defaultQuery: oe,
+		onQuery: se,
+		triggerMode: H
+	}), he = (e) => {
+		z && !e && me && K(""), R || fe(e), ie?.(e);
+	}, { nodes: ge, expandedIds: J } = v(() => Se(x, G), [x, G]), _e = v(() => ye(S, U), [S, U]), ve = v(() => be(U, W, B), [
+		W,
+		B,
+		U
+	]), xe = v(() => new Set([...U.childrenById].filter(([, e]) => e.length > 0).map(([e]) => e)), [U]), Te = v(() => T === "columns" ? xe : /* @__PURE__ */ new Set([
+		...ve,
+		...J,
+		..._e
 	]), [
-		q,
-		ye,
+		xe,
+		ve,
 		T,
-		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({
+		J,
+		_e
+	]), Y = v(() => Ce(ge, Te), [ge, Te]), Ee = v(() => Y.findIndex((e) => S.has(e.node.id)), [S, Y]), X = v(() => we(Y), [Y]), De = g((e) => {
+		let t = Me({
 			...e,
 			descriptor: X
 		}), n = {};
@@ -590,39 +606,39 @@ function Ne({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 			"--tree-row-count": String(t.rowCount),
 			...n
 		};
-	}, [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({
+	}, [X]), { activeIndex: Oe, context: ke, floatingStyles: Z, getFloatingProps: Ae, setReference: je, setFloating: Pe, setOptionRef: Fe, close: Ie, openList: Le, toggleOpen: Re, selectOption: ze, handleReferenceKeyDown: Be, handleFloatingKeyDown: Ve, getOptionId: He, getActiveOptionId: Ue } = o({
 		options: Y,
-		selectedIndex: Te,
-		open: R,
-		onOpenChange: ge,
-		onSelect: (e) => se(e.node),
-		getOptionDisabled: (e) => e.node.disabled === !0,
+		selectedIndex: Ee,
+		open: z,
+		onOpenChange: he,
+		onSelect: (e) => ce(e.node),
+		getOptionDisabled: (e) => e.node.disabled === !0 || te?.has(e.node.id) === !0,
 		disabled: p || P,
 		closeOnSelect: w === "single",
 		allowOpenWithoutOptions: !0,
-		triggerMode: B,
+		triggerMode: H,
 		placementStrategy: T === "columns" ? "auto" : "flip",
-		resolveFloatingSize: T === "columns" ? Ee : void 0
-	}), 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: U,
+		resolveFloatingSize: T === "columns" ? De : void 0
+	}), We = ke.update, Ge = S.size > 0, Ke = j === "search" && (z || G.length > 0), qe = Ke ? G : N ?? "", Je = j === "display" && !!M, Ye = H === "search-multi" && !!M, Xe = H === "search-multi" && !Ge || H === "search-single" && (!N || Ke) || H === "display" && !Ge, $ = d({
+		mode: H,
+		open: z,
+		currentQuery: G,
 		hasDisplayValue: !!N,
-		inputRef: ue,
-		setQuery: W,
-		openList: Ie,
-		close: Fe,
-		toggleOpen: Le
-	}), Xe = T === "columns" && w === "multi" && A, Ze = j === "display", Qe = Xe || Ze ? /* @__PURE__ */ k("div", {
+		inputRef: F,
+		setQuery: K,
+		openList: Le,
+		close: Ie,
+		toggleOpen: Re
+	}), Ze = T === "columns" && w === "multi" && A, Qe = j === "display", $e = Ze || Qe ? /* @__PURE__ */ ee("div", {
 		className: Q.treePopupHeader,
-		children: [Xe ? /* @__PURE__ */ O(i, {
+		children: [Ze ? /* @__PURE__ */ O(i, {
 			onSelectAll: A.onSelectAll,
 			onDeselectAll: A.onDeselectAll,
-			selectAllButtonRef: F
-		}) : null, Ze ? /* @__PURE__ */ O(t, {
-			value: U,
-			onChange: W,
-			onClear: () => W(""),
+			selectAllButtonRef: I
+		}) : null, Qe ? /* @__PURE__ */ O(t, {
+			value: G,
+			onChange: K,
+			onClear: () => K(""),
 			placeholder: "Поиск по дереву",
 			onKeyDown: (e) => {
 				e.key !== "Escape" && e.key !== "Tab" && e.stopPropagation();
@@ -633,20 +649,20 @@ function Ne({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 		}) : null]
 	}) : void 0;
 	_(() => {
-		R && T === "columns" && Ue();
+		z && T === "columns" && We();
 	}, [
 		X.signature,
-		R,
+		z,
 		T,
-		Ue
+		We
 	]);
-	let $e = (e) => {
-		ue.current = e;
-	}, et = () => {
-		ce?.(), W(""), w === "single" && Fe();
-	}, tt = (e) => {
-		e.hasChildren && pe((t) => {
-			let n = new Map(t), r = t.get(e.node.id) ?? H.has(e.node.codeKey);
+	let et = (e) => {
+		F.current = e;
+	}, tt = () => {
+		le?.(), K(""), w === "single" && Ie();
+	}, nt = (e) => {
+		e.hasChildren && V((t) => {
+			let n = new Map(t), r = t.get(e.node.id) ?? W.has(e.node.codeKey);
 			return n.set(e.node.id, !r), n;
 		});
 	};
@@ -657,9 +673,9 @@ function Ne({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 		size: h,
 		children: ({ controlId: t, labelId: i, describedBy: o }) => {
 			let c = `${t}-listbox`, l = typeof n == "string" ? n : m;
-			return /* @__PURE__ */ k(D, { children: [/* @__PURE__ */ O(r, {
-				ref: $e,
-				rootRef: Ae,
+			return /* @__PURE__ */ ee(D, { children: [/* @__PURE__ */ O(r, {
+				ref: et,
+				rootRef: je,
 				id: t,
 				type: "text",
 				role: "combobox",
@@ -667,34 +683,34 @@ function Ne({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 				isLoading: P,
 				disabled: p,
 				readOnly: j !== "search",
-				value: j === "display" && qe ? "" : Ke,
-				placeholder: Ye ? me : void 0,
+				value: j === "display" && Je ? "" : qe,
+				placeholder: Xe ? pe : void 0,
 				"aria-labelledby": i,
 				"aria-label": i ? void 0 : m,
 				"aria-describedby": o,
 				"aria-haspopup": T === "columns" ? "dialog" : "listbox",
-				"aria-expanded": R,
-				"aria-controls": R ? c : void 0,
+				"aria-expanded": z,
+				"aria-controls": z ? c : void 0,
 				"aria-autocomplete": T !== "columns" && j === "search" ? "list" : "none",
-				"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", {
+				"aria-activedescendant": T !== "columns" && z && Y.length > 0 ? Ue(c) : void 0,
+				inputClassName: E(Ge && Q.treeSummary, Je && Q.inputWithOverlay),
+				overlay: Je ? /* @__PURE__ */ O("div", {
 					className: Q.valueOverlay,
 					children: M
-				}) : Je ? M : void 0,
+				}) : Ye ? M : void 0,
 				endAdornment: /* @__PURE__ */ O(s, {
-					open: R,
+					open: z,
 					disabled: p || P,
 					onToggleMouseDown: $.handleToggleMouseDown,
 					onToggleClick: $.handleToggleClick,
-					children: We && ce ? /* @__PURE__ */ O("button", {
+					children: Ge && le ? /* @__PURE__ */ O("button", {
 						type: "button",
 						className: Q.treeClearButton,
 						onMouseDown: (e) => {
 							e.preventDefault(), e.stopPropagation();
 						},
 						onClick: (e) => {
-							e.preventDefault(), e.stopPropagation(), et();
+							e.preventDefault(), e.stopPropagation(), tt();
 						},
 						"aria-label": "Очистить выбор",
 						children: /* @__PURE__ */ O(re, {})
@@ -708,48 +724,48 @@ function Ne({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 					$.handleTriggerFocus(e.currentTarget);
 				},
 				onKeyDown: (e) => {
-					if (T === "columns" && R && e.key === "Tab" && !e.shiftKey && F.current) {
-						e.preventDefault(), F.current.focus();
+					if (T === "columns" && z && e.key === "Tab" && !e.shiftKey && I.current) {
+						e.preventDefault(), I.current.focus();
 						return;
 					}
-					ze(e), !e.defaultPrevented && $.handleTriggerKeyDown({
+					Be(e), !e.defaultPrevented && $.handleTriggerKeyDown({
 						event: e,
 						onActivateWhenOpen: () => {
-							let e = De >= 0 ? Y[De] : void 0;
-							e && Re(e);
+							let e = Oe >= 0 ? Y[Oe] : void 0;
+							e && ze(e);
 						},
 						enableSpaceActivation: j === "display"
 					});
 				}
 			}), /* @__PURE__ */ O(a, {
-				open: R,
-				context: Oe,
+				open: z,
+				context: ke,
 				floatingStyles: Z,
 				listId: c,
 				labelId: i,
 				popupAriaLabel: l,
 				descriptionId: o,
-				activeOptionId: T !== "columns" && Y.length > 0 ? He(c) : void 0,
+				activeOptionId: T !== "columns" && Y.length > 0 ? Ue(c) : void 0,
 				ariaMultiselectable: T !== "columns" && w === "multi",
 				popupRole: T === "columns" ? "dialog" : "listbox",
-				setFloating: Ne,
-				getFloatingProps: ke,
-				onKeyDown: Be,
+				setFloating: Pe,
+				getFloatingProps: Ae,
+				onKeyDown: Ve,
 				className: e.uiPopupOptions,
 				layoutClassName: T === "columns" ? Q.treeColumnsPopupLayout : void 0,
 				bodyClassName: "scrollable",
-				header: Qe,
+				header: $e,
 				children: /* @__PURE__ */ O("div", {
 					className: E(T === "columns" && Q.treeColumns),
 					children: Y.length === 0 ? /* @__PURE__ */ O(f, {
-						errorState: le,
-						emptyState: !le && !P ? "Нет данных" : void 0
+						errorState: ue,
+						emptyState: !ue && !P ? "Нет данных" : void 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;
+						let n = w === "multi" ? q(e.node.id, S, U) : S.has(e.node.id), r = w === "multi" && !n && C.has(e.node.id), i = t === Oe, a = e.node.disabled === !0 || te?.has(e.node.id) === !0;
 						return /* @__PURE__ */ O("div", {
 							"data-ui": "tree-select-option",
-							id: Ve(c, t),
-							ref: (e) => Pe(t, e),
+							id: He(c, t),
+							ref: (e) => Fe(t, e),
 							role: T === "columns" ? void 0 : "option",
 							"aria-selected": T === "columns" ? void 0 : n,
 							"aria-disabled": a || void 0,
@@ -761,21 +777,24 @@ function Ne({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 							onMouseDown: (e) => {
 								e.preventDefault();
 							},
-							onClick: () => Re(e),
+							onClick: () => ze(e),
 							children: /* @__PURE__ */ O("div", {
 								className: Q.treeNodeButton,
-								children: /* @__PURE__ */ O(Me, {
-									node: e.node,
+								children: /* @__PURE__ */ O(Ne, {
+									node: a ? {
+										...e.node,
+										disabled: !0
+									} : e.node,
 									level: e.level,
-									highlight: U,
+									highlight: G,
 									hasChildren: e.hasChildren,
 									isExpanded: e.isExpanded,
 									selected: n,
 									partial: r,
 									selectionMode: w,
 									optionsLayout: T,
-									onToggleExpand: () => tt(e),
-									onToggleSelection: () => Re(e)
+									onToggleExpand: () => nt(e),
+									onToggleSelection: () => ze(e)
 								})
 							})
 						}, e.node.id);
@@ -787,7 +806,7 @@ function Ne({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 }
 //#endregion
 //#region src/tree-select/TreeMultiSelect.tsx
-function Pe(e, t) {
+function Fe(e, t) {
 	let n = z(e, t), r = Object.values(n).reduce((e, t) => e + t.length, 0);
 	if (r !== 0) {
 		if (r === 1) {
@@ -797,18 +816,22 @@ function Pe(e, t) {
 		return m(r);
 	}
 }
-function Fe(e, t, n) {
+function Ie(e, t, n) {
 	let r = R(e, n), i = R(t, n);
 	return r.size === i.size && [...r].every((e) => i.has(e));
 }
-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 }) {
+function Le({ 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) => 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, {
+		isEqual: (e, t) => Ie(e, t, x)
+	}), T = _ ? S : o, E = v(() => R(T, x), [T, x]), D = v(() => ge(E, x), [E, x]), ee = v(() => new Set([...x.nodeById.keys()].filter((e) => x.nodeById.get(e)?.disabled !== !0 && !q(e, E, x) && !D.selectedIds.has(e) && J(x, [e]).size === 0)), [
+		E,
+		D.selectedIds,
+		x
+	]), k = v(() => Fe(E, x), [E, x]);
+	return /* @__PURE__ */ O(Pe, {
 		label: e,
 		description: t,
 		disabled: n,
@@ -820,13 +843,14 @@ function Ie({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 		selectionMode: "multi",
 		optionsLayout: m,
 		defaultExpandedCodeKeys: g,
+		unavailableNodeIds: ee,
 		open: _,
 		onOpenChange: (e) => {
 			e && !_ && w(), y(e);
 		},
 		bulkActions: {
 			onSelectAll: () => {
-				C(z(K(x), x));
+				C(z(J(x), x));
 			},
 			onDeselectAll: () => C({})
 		},
@@ -836,7 +860,7 @@ function Ie({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 		defaultQuery: u,
 		onQuery: d,
 		onNodeActivate: (e) => {
-			C((t) => ve(t, e.id, x));
+			C((t) => _e(t, e.id, x));
 		},
 		onClearSelection: () => {
 			C({}), _ || s({});
@@ -847,7 +871,7 @@ function Ie({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 }
 //#endregion
 //#region src/tree-select/ODataTreeMultiSelect.tsx
-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: _ }) {
+function Re({ 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,
@@ -859,7 +883,7 @@ function Le({ label: e, description: t, disabled: n, size: r, placeholder: i, qu
 		y.nodes,
 		y.orderedCodeKeys
 	]);
-	return /* @__PURE__ */ O(Ie, {
+	return /* @__PURE__ */ O(Le, {
 		label: e,
 		description: t,
 		disabled: n || y.isLoading,
@@ -879,12 +903,12 @@ function Le({ label: e, description: t, disabled: n, size: r, placeholder: i, qu
 }
 //#endregion
 //#region src/tree-select/TreeSelect.tsx
-function Re(e) {
+function ze(e) {
 	if (e) return e.code && e.code !== e.label ? `${e.label} · ${e.code}` : e.label;
 }
-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 }) {
+function Be({ 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(Ne, {
+	return /* @__PURE__ */ O(Pe, {
 		label: e,
 		description: t,
 		disabled: n,
@@ -896,7 +920,7 @@ function ze({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 		selectionMode: "single",
 		defaultExpandedCodeKeys: m,
 		triggerMode: "search",
-		selectedSummaryText: Re(_),
+		selectedSummaryText: ze(_),
 		query: c,
 		defaultQuery: l,
 		onQuery: u,
@@ -911,13 +935,13 @@ function ze({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 }
 //#endregion
 //#region src/tree-select/ODataTreeSelect.tsx
-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 }) {
+function Ve({ 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(ze, {
+	return /* @__PURE__ */ O(Be, {
 		label: e,
 		description: t,
 		disabled: n || h.isLoading,
@@ -936,6 +960,6 @@ function Be({ label: e, description: t, disabled: n, size: r, placeholder: i, qu
 	});
 }
 //#endregion
-export { Le as ODataTreeMultiSelect, Be as ODataTreeSelect, Ie as TreeMultiSelect, ze as TreeSelect, j as treeSelectValueToSelectedFilters };
+export { Re as ODataTreeMultiSelect, Ve as ODataTreeSelect, Le as TreeMultiSelect, Be as TreeSelect, A as treeSelectValueToSelectedFilters };
 
 //# sourceMappingURL=index.js.map