@ryuzaki13/react-foundation-ui 1.5.16 → 1.6.0

package/dist/tree-select/ODataTreeMultiSelect.d.ts

@@ -1,6 +1,11 @@
 import { ODataDependentBaseProps } from "@ryuzaki13/react-foundation-api/odata";
 import { UiBaseProps } from "../types";
-import { TreeMultiSelectOptionsLayout, TreeMultiSelectValue } from "./types";
+import { TreeMultiSelectOptionsLayout, TreeMultiSelectValue, TreeSelectNode } from "./types";
+export type ODataTreeMultiSelectNodesTransformContext = {
+    /** Фактический порядок запрошенных уровней после разрешения metadata-chain. */
+    orderedCodeKeys: readonly string[];
+};
+export type ODataTreeMultiSelectNodesTransform = (nodes: readonly TreeSelectNode[], context: ODataTreeMultiSelectNodesTransformContext) => readonly TreeSelectNode[];
 export interface ODataTreeMultiSelectProps extends Omit<ODataDependentBaseProps, "model" | "value" | "dependencies">, Omit<UiBaseProps<TreeMultiSelectValue>, "placeholder"> {
     model?: ODataDependentBaseProps["model"];
     placeholder?: string;
@@ -14,6 +19,15 @@ export interface ODataTreeMultiSelectProps extends Omit<ODataDependentBaseProps,
      * В режиме `columns` дерево по-прежнему отображается полностью раскрытым.
      */
     defaultExpandedCodeKeys?: readonly string[];
+    /** Явный порядок уровней поверх порядка, автоматически полученного из metadata-chain. */
+    segmentOrder?: readonly string[];
+    /**
+     * Создаёт consumer-представление поверх уже загруженного OData-дерева.
+     *
+     * Преобразование не меняет Query cache и transport-запрос. Callback должен
+     * оставаться чистым и возвращать новые узлы, не мутируя входное дерево.
+     */
+    transformNodes?: ODataTreeMultiSelectNodesTransform;
 }
-export declare function ODataTreeMultiSelect({ label, description, disabled, size, placeholder, query, defaultQuery, onQuery, optionsLayout, value, onChange, odata, segments, model, defaultExpandedCodeKeys }: ODataTreeMultiSelectProps): import("react").JSX.Element;
+export declare function ODataTreeMultiSelect({ label, description, disabled, size, placeholder, query, defaultQuery, onQuery, optionsLayout, value, onChange, odata, segments, model, defaultExpandedCodeKeys, segmentOrder, transformNodes }: ODataTreeMultiSelectProps): import("react").JSX.Element;
 //# sourceMappingURL=ODataTreeMultiSelect.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"ODataTreeMultiSelect.d.ts","sourceRoot":"","sources":["../../src/tree-select/ODataTreeMultiSelect.tsx"],"names":[],"mappings":"AAAA,OAAO,EAAE,uBAAuB,EAAE,MAAM,uCAAuC,CAAC;AAEhF,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAIvC,OAAO,EAAE,4BAA4B,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAC;AAE7E,MAAM,WAAW,yBAChB,SAAQ,IAAI,CAAC,uBAAuB,EAAE,OAAO,GAAG,OAAO,GAAG,cAAc,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,oBAAoB,CAAC,EAAE,aAAa,CAAC;IACjI,KAAK,CAAC,EAAE,uBAAuB,CAAC,OAAO,CAAC,CAAC;IACzC,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,6FAA6F;IAC7F,aAAa,CAAC,EAAE,4BAA4B,CAAC;IAC7C;;;OAGG;IACH,uBAAuB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAC5C;AAED,wBAAgB,oBAAoB,CAAC,EACpC,KAAK,EACL,WAAW,EACX,QAAQ,EACR,IAAI,EACJ,WAAW,EACX,KAAK,EACL,YAAY,EACZ,OAAO,EACP,aAAa,EACb,KAAK,EACL,QAAQ,EACR,KAAK,EACL,QAAQ,EACR,KAAK,EACL,uBAAuB,EACvB,EAAE,yBAAyB,+BA0B3B"}
+{"version":3,"file":"ODataTreeMultiSelect.d.ts","sourceRoot":"","sources":["../../src/tree-select/ODataTreeMultiSelect.tsx"],"names":[],"mappings":"AAEA,OAAO,EAAE,uBAAuB,EAAE,MAAM,uCAAuC,CAAC;AAEhF,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAIvC,OAAO,EAAE,4BAA4B,EAAE,oBAAoB,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAE7F,MAAM,MAAM,yCAAyC,GAAG;IACvD,+EAA+E;IAC/E,eAAe,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC,CAAC;AAEF,MAAM,MAAM,kCAAkC,GAAG,CAChD,KAAK,EAAE,SAAS,cAAc,EAAE,EAChC,OAAO,EAAE,yCAAyC,KAC9C,SAAS,cAAc,EAAE,CAAC;AAE/B,MAAM,WAAW,yBAChB,SAAQ,IAAI,CAAC,uBAAuB,EAAE,OAAO,GAAG,OAAO,GAAG,cAAc,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,oBAAoB,CAAC,EAAE,aAAa,CAAC;IACjI,KAAK,CAAC,EAAE,uBAAuB,CAAC,OAAO,CAAC,CAAC;IACzC,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,6FAA6F;IAC7F,aAAa,CAAC,EAAE,4BAA4B,CAAC;IAC7C;;;OAGG;IACH,uBAAuB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5C,yFAAyF;IACzF,YAAY,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC;;;;;OAKG;IACH,cAAc,CAAC,EAAE,kCAAkC,CAAC;CACpD;AAED,wBAAgB,oBAAoB,CAAC,EACpC,KAAK,EACL,WAAW,EACX,QAAQ,EACR,IAAI,EACJ,WAAW,EACX,KAAK,EACL,YAAY,EACZ,OAAO,EACP,aAAa,EACb,KAAK,EACL,QAAQ,EACR,KAAK,EACL,QAAQ,EACR,KAAK,EACL,uBAAuB,EACvB,YAAY,EACZ,cAAc,EACd,EAAE,yBAAyB,+BA+B3B"}

package/dist/tree-select/index.js

@@ -84,8 +84,8 @@ function le({ items: e, orderedCodeKeys: t, keyPairsMap: n, hiddenCodeKeys: r, t
 }
 //#endregion
 //#region src/tree-select/model/resolveOrderedTreeSegmentItems.ts
-function N(e, t) {
-	return x(e, t);
+function N(e, t, n) {
+	return x(e, t, n);
 }
 //#endregion
 //#region src/tree-select/model/useODataTreeData.ts
@@ -99,57 +99,61 @@ function ue(e, t, n) {
 function de(e) {
 	return e[0]?.id;
 }
-function P({ odata: e, segments: t, model: n }) {
-	let r = `${e.service}.${e.target}`, i = v(() => ue(e, t, n), [
+function P({ odata: e, segments: t, model: n, segmentOrder: r }) {
+	let i = `${e.service}.${e.target}`, a = v(() => ue(e, t, n), [
 		e,
 		t,
 		n
-	]), a = C([e]), o = v(() => N(i, a), [i, a]), s = v(() => o.map((e) => e.id), [o]), c = de(o) ?? Object.keys(t)[0], l = w({
-		codeKey: c,
+	]), o = C([e]), s = v(() => N(a, o, r), [
+		a,
+		o,
+		r
+	]), c = v(() => s.map((e) => e.id), [s]), l = de(s) ?? Object.keys(t)[0], u = w({
+		codeKey: l,
 		...n
-	}), u = S({
+	}), d = S({
 		odata: e,
-		model: l
-	}), { hiddenCodeKeys: d, textValueCodeKeys: f } = v(() => {
+		model: u
+	}), { hiddenCodeKeys: f, textValueCodeKeys: p } = v(() => {
 		let t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set();
-		for (let r of o) (r.segment.hideCode ?? e.hideCode) && t.add(r.id), r.segment.selectText && n.add(r.id);
+		for (let r of s) (r.segment.hideCode ?? e.hideCode) && t.add(r.id), r.segment.selectText && n.add(r.id);
 		return {
 			hiddenCodeKeys: t,
 			textValueCodeKeys: n
 		};
-	}, [e.hideCode, o]), p = v(() => le({
-		items: u.data?.items ?? [],
-		orderedCodeKeys: s,
-		keyPairsMap: u.data?.keyPairsMap ?? {},
-		hiddenCodeKeys: d,
-		textValueCodeKeys: f,
+	}, [e.hideCode, s]), m = v(() => le({
+		items: d.data?.items ?? [],
+		orderedCodeKeys: c,
+		keyPairsMap: d.data?.keyPairsMap ?? {},
+		hiddenCodeKeys: f,
+		textValueCodeKeys: p,
 		sortByCode: e.sortByCode
 	}), [
-		u.data?.items,
-		u.data?.keyPairsMap,
-		d,
+		d.data?.items,
+		d.data?.keyPairsMap,
+		f,
 		e.sortByCode,
-		s,
-		f
-	]), m = o[0]?.segment.placeholder ?? "Выберите значение", h = !!a[r]?.length;
+		c,
+		p
+	]), h = s[0]?.segment.placeholder ?? "Выберите значение", g = !!o[i]?.length;
 	return {
-		nodes: p,
-		orderedSegmentItems: o,
-		orderedCodeKeys: s,
-		isLoading: u.isLoading,
-		isError: u.isError,
-		placeholder: m,
-		hasResolvedChain: h
+		nodes: m,
+		orderedSegmentItems: s,
+		orderedCodeKeys: c,
+		isLoading: d.isLoading,
+		isError: d.isError,
+		placeholder: h,
+		hasResolvedChain: g
 	};
 }
 //#endregion
 //#region src/tree-select/model/treeUtils.ts
-function F(e, t) {
+function fe(e, t) {
 	return `${e}::${t}`;
 }
-function fe(e) {
+function pe(e) {
 	let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), o = 0, s = (e, c) => {
-		t.set(e.id, e), n.set(e.id, c), i.set(e.id, o++), a.set(F(e.codeKey, e.value), e.id);
+		t.set(e.id, e), n.set(e.id, c), i.set(e.id, o++), a.set(fe(e.codeKey, e.value), e.id);
 		let l = (e.children ?? []).map((e) => e.id);
 		r.set(e.id, l);
 		for (let t of e.children ?? []) s(t, e.id);
@@ -164,19 +168,19 @@ function fe(e) {
 		nodeIdByCodeValue: a
 	};
 }
-function pe(e, t) {
-	if (e) return t.nodeIdByCodeValue.get(F(e.codeKey, e.value));
+function me(e, t) {
+	if (e) return t.nodeIdByCodeValue.get(fe(e.codeKey, e.value));
 }
-function I(e, t) {
+function F(e, t) {
 	let n = /* @__PURE__ */ new Set();
 	if (!e) return n;
 	for (let [r, i] of Object.entries(e)) for (let e of i) {
-		let i = t.nodeIdByCodeValue.get(F(r, e));
+		let i = t.nodeIdByCodeValue.get(fe(r, e));
 		i && n.add(i);
 	}
-	return he(n, t);
+	return ge(n, t);
 }
-function L(e, t) {
+function I(e, t) {
 	let n = [...e].sort((e, n) => (t.preorderIndexById.get(e) ?? 2 ** 53 - 1) - (t.preorderIndexById.get(n) ?? 2 ** 53 - 1)), r = {};
 	for (let e of n) {
 		let n = t.nodeById.get(e);
@@ -184,12 +188,12 @@ function L(e, t) {
 	}
 	return r;
 }
-function R(e, t) {
+function L(e, t) {
 	let n = [], r = t.parentById.get(e);
 	for (; r;) n.push(r), r = t.parentById.get(r);
 	return n;
 }
-function me(e, t, n) {
+function he(e, t, n) {
 	let r = n.parentById.get(e);
 	for (; r;) {
 		if (r === t) return !0;
@@ -197,41 +201,45 @@ function me(e, t, n) {
 	}
 	return !1;
 }
-function z(e, t, n) {
-	for (let r of [...e]) me(r, t, n) && e.delete(r);
+function R(e, t, n) {
+	for (let r of [...e]) he(r, t, n) && e.delete(r);
 }
-function B(e, t, n) {
+function z(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) => B(e, t, n));
+	return r.length !== 0 && r.every((e) => z(e, t, n));
 }
-function he(e, t) {
+function ge(e, t) {
 	let n = new Set(e);
-	for (let e of [...n]) R(e, t).some((e) => n.has(e)) && n.delete(e);
+	for (let e of [...n]) if (t.nodeById.get(e)?.selectionBehavior === "descendants") {
+		n.delete(e);
+		for (let r of W(t, t.childrenById.get(e) ?? [])) n.add(r);
+	}
+	for (let e of [...n]) L(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) ?? [];
-		r.length === 0 || n.has(e) || t.nodeById.get(e)?.disabled || r.every((e) => B(e, n, t)) && (z(n, e, t), n.add(e));
+		r.length === 0 || n.has(e) || t.nodeById.get(e)?.disabled || t.nodeById.get(e)?.selectionBehavior === "descendants" || r.every((e) => z(e, n, t)) && (R(n, e, t), n.add(e));
 	}
 	return n;
 }
-function V(e, t, n) {
+function B(e, t, n) {
 	let r = n.parentById.get(t);
 	for (; r;) {
 		if (e.has(r)) {
 			e.delete(r);
-			for (let t of G(n, n.childrenById.get(r) ?? [])) e.add(t);
+			for (let t of W(n, n.childrenById.get(r) ?? [])) e.add(t);
 			return !0;
 		}
 		r = n.parentById.get(r);
 	}
 	return !1;
 }
-function H(e, t, n) {
-	return t.has(e) ? !0 : R(e, n).some((e) => t.has(e));
+function V(e, t, n) {
+	return t.has(e) ? !0 : L(e, n).some((e) => t.has(e));
 }
-function U(e, t, n, r) {
+function H(e, t, n, r) {
 	let i = n.childrenById.get(e) ?? [];
 	if (t.has(e)) return r.selectedIds.add(e), {
 		selected: !0,
@@ -241,7 +249,7 @@ function U(e, t, n, r) {
 		selected: !1,
 		partial: !1
 	};
-	let a = i.map((e) => U(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) => H(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
@@ -253,18 +261,24 @@ function U(e, t, n, r) {
 		partial: !1
 	};
 }
-function W(e, t) {
+function U(e, t) {
 	let n = {
 		selectedIds: /* @__PURE__ */ new Set(),
 		partialIds: /* @__PURE__ */ new Set()
 	};
-	for (let r of t.rootIds) U(r, e, t, n);
+	for (let r of t.rootIds) H(r, e, t, n);
 	return n;
 }
-function G(e, t = e.rootIds) {
+function W(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 || o ? {
+		return !r || r.disabled ? {
+			containsDisabled: !0,
+			selectedIds: a
+		} : r.selectionBehavior === "descendants" ? {
+			containsDisabled: o,
+			selectedIds: a
+		} : o ? {
 			containsDisabled: !0,
 			selectedIds: a
 		} : {
@@ -274,34 +288,34 @@ function G(e, t = e.rootIds) {
 	};
 	return new Set(t.flatMap((e) => n(e).selectedIds));
 }
-function ge(e, t, n) {
-	let r = I(e, n), i = (e) => {
-		if (H(e, r, n)) {
+function _e(e, t, n) {
+	let r = F(e, n), i = (e) => {
+		if (V(e, r, n)) {
 			if (r.has(e)) {
 				r.delete(e);
 				return;
 			}
-			V(r, e, n) && i(e);
+			B(r, e, n) && i(e);
 			return;
 		}
-		z(r, e, n), r.add(e);
-	}, a = [...G(n, [t])], o = a.length > 0 && a.every((e) => H(e, r, n));
+		R(r, e, n), r.add(e);
+	}, a = [...W(n, [t])], o = a.length > 0 && a.every((e) => V(e, r, n));
 	for (let e of a) {
-		let t = H(e, r, n);
+		let t = V(e, r, n);
 		(o && t || !o && !t) && i(e);
 	}
-	return L(he(r, n), n);
+	return I(ge(r, n), n);
 }
-function _e(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 ve(e, t) {
+function ye(e, t) {
 	let n = /* @__PURE__ */ new Set();
-	for (let r of e) _e(r, t, n);
+	for (let r of e) ve(r, t, n);
 	return n;
 }
-function ye(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;
@@ -310,14 +324,14 @@ function ye(e, t, n) {
 	}
 	return r;
 }
-function K(e, t, n) {
-	let r = (e.children ?? []).map((e) => K(e, t, n)).filter((e) => !!e);
+function G(e, t, n) {
+	let r = (e.children ?? []).map((e) => G(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 be(e, t) {
+function xe(e, t) {
 	let n = t.trim().toLowerCase();
 	if (!n) return {
 		nodes: [...e],
@@ -325,11 +339,11 @@ function be(e, t) {
 	};
 	let r = /* @__PURE__ */ new Set();
 	return {
-		nodes: e.map((e) => K(e, n, r)).filter((e) => !!e),
+		nodes: e.map((e) => G(e, n, r)).filter((e) => !!e),
 		expandedIds: r
 	};
 }
-function xe(e, t) {
+function Se(e, t) {
 	let n = [], r = (e, i, a) => {
 		let o = (e.children?.length ?? 0) > 0, s = o && t.has(e.id);
 		if (n.push({
@@ -346,7 +360,7 @@ function xe(e, t) {
 }
 //#endregion
 //#region src/tree-select/model/buildTreeColumnsLayoutDescriptor.ts
-function Se(e) {
+function Ce(e) {
 	let t = [], n = 0;
 	for (; n < e.length;) {
 		let r = n + 1;
@@ -365,7 +379,7 @@ function Se(e) {
 }
 //#endregion
 //#region src/tree-select/model/resolveBalancedTreeColumnsLayout.ts
-var q = 16, Ce = 48, we = 224, Te = 10, J = 32, Ee = 6, De = 3;
+var K = 16, we = 48, Te = 224, q = 10, J = 32, Ee = 6, De = 3;
 function Y(e, t) {
 	return Number.isFinite(e) && e > 0 ? e : t;
 }
@@ -390,7 +404,7 @@ function Z(e, t) {
 	};
 }
 function Oe({ 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 = Y(t, 240), c = Y(n, 80), l = Y(r, s + 16), u = Y(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, Y(a, 1)), m = Math.min(d, p), h = Math.max(1, Math.floor((d - q + Te) / 234)), g = Math.max(1, Math.min(Ee, h, o || 1)), _ = e.groups.reduce((e, t) => Math.max(e, X(t)), 1);
+	let o = Math.max(0, Math.floor(Number.isFinite(e.itemCount) ? e.itemCount : 0)), s = Y(t, 240), c = Y(n, 80), l = Y(r, s + 16), u = Y(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, Y(a, 1)), m = Math.min(d, p), h = Math.max(1, Math.floor((d - K + q) / 234)), g = Math.max(1, Math.min(Ee, h, o || 1)), _ = e.groups.reduce((e, t) => Math.max(e, X(t)), 1);
 	if (o === 0) return {
 		columnCount: 1,
 		rowCount: 1,
@@ -403,7 +417,7 @@ function Oe({ descriptor: e, availableWidth: t, availableHeight: n, viewportWidt
 	for (let t = 1; t <= g; t += 1) {
 		let n = Math.max(_, Math.ceil(o / t)), r = Z(e, n);
 		for (; r.usedColumnCount > t && n < o;) n += 1, r = Z(e, n);
-		let i = r.usedColumnCount, a = Math.max(m, q + i * we + (i - 1) * Te), s = Ce + n * J, 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 i = r.usedColumnCount, a = Math.max(m, K + i * Te + (i - 1) * q), s = we + n * J, 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,
@@ -506,28 +520,28 @@ function ke({ node: e, level: t, highlight: r, hasChildren: i, isExpanded: a, se
 //#endregion
 //#region src/tree-select/TreePickerBase.tsx
 function Ae({ label: n, description: c, disabled: p, placeholder: m, size: h, nodes: b, selectedIds: x, partialIds: S, selectionMode: C, optionsLayout: w = "tree", defaultExpandedCodeKeys: te, open: ne, onOpenChange: re, bulkActions: k, triggerMode: A = "display", selectedSummary: j, selectedSummaryText: M, query: ae, defaultQuery: oe, onQuery: se, onNodeActivate: ce, onClearSelection: le, isLoading: N, error: ue }) {
-	let de = y(null), P = y(null), [F, pe] = ee(!1), I = ne !== void 0, L = I ? ne : F, [R, me] = ee(() => /* @__PURE__ */ new Map()), z = A === "search" ? C === "multi" ? "search-multi" : "search-single" : "display", B = v(() => fe(b), [b]), he = v(() => `${m} <${B.nodeById.size}>`, [m, B]), V = v(() => new Set(te), [te]), { query: U, setQuery: W, resetQueryOnClose: G } = u({
+	let de = y(null), P = y(null), [fe, me] = ee(!1), F = ne !== void 0, I = F ? ne : fe, [L, he] = ee(() => /* @__PURE__ */ new Map()), R = A === "search" ? C === "multi" ? "search-multi" : "search-single" : "display", z = v(() => pe(b), [b]), ge = v(() => `${m} <${z.nodeById.size}>`, [m, z]), B = v(() => new Set(te), [te]), { query: H, setQuery: U, resetQueryOnClose: W } = u({
 		query: ae,
 		defaultQuery: oe,
 		onQuery: se,
-		triggerMode: z
-	}), ge = (e) => {
-		L && !e && G && W(""), I || pe(e), re?.(e);
-	}, { nodes: _e, expandedIds: K } = v(() => be(b, U), [b, U]), q = v(() => ve(x, B), [x, B]), Ce = v(() => ye(B, V, R), [
-		V,
-		R,
-		B
-	]), we = v(() => new Set([...B.childrenById].filter(([, e]) => e.length > 0).map(([e]) => e)), [B]), Te = v(() => w === "columns" ? we : /* @__PURE__ */ new Set([
-		...Ce,
-		...K,
-		...q
+		triggerMode: R
+	}), _e = (e) => {
+		I && !e && W && U(""), F || me(e), re?.(e);
+	}, { nodes: ve, expandedIds: G } = v(() => xe(b, H), [b, H]), K = v(() => ye(x, z), [x, z]), we = v(() => be(z, B, L), [
+		B,
+		L,
+		z
+	]), Te = v(() => new Set([...z.childrenById].filter(([, e]) => e.length > 0).map(([e]) => e)), [z]), q = v(() => w === "columns" ? Te : /* @__PURE__ */ new Set([
+		...we,
+		...G,
+		...K
 	]), [
+		Te,
 		we,
-		Ce,
 		w,
-		K,
-		q
-	]), J = v(() => xe(_e, Te), [_e, Te]), Ee = v(() => J.findIndex((e) => x.has(e.node.id)), [x, J]), De = v(() => Se(J), [J]), Y = g((e) => {
+		G,
+		K
+	]), J = v(() => Se(ve, q), [ve, q]), Ee = v(() => J.findIndex((e) => x.has(e.node.id)), [x, J]), De = v(() => Ce(J), [J]), Y = g((e) => {
 		let t = Oe({
 			...e,
 			descriptor: De
@@ -546,23 +560,23 @@ function Ae({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 	}, [De]), { activeIndex: X, context: Z, floatingStyles: Ae, 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: J,
 		selectedIndex: Ee,
-		open: L,
-		onOpenChange: ge,
+		open: I,
+		onOpenChange: _e,
 		onSelect: (e) => ce(e.node),
 		getOptionDisabled: (e) => e.node.disabled === !0,
 		disabled: p || N,
 		closeOnSelect: C === "single",
 		allowOpenWithoutOptions: !0,
-		triggerMode: z,
+		triggerMode: R,
 		placementStrategy: w === "columns" ? "auto" : "flip",
 		resolveFloatingSize: w === "columns" ? Y : void 0
-	}), Ue = Z.update, We = x.size > 0, Ge = A === "search" && (L || U.length > 0), Ke = Ge ? U : M ?? "", qe = A === "display" && !!j, Je = z === "search-multi" && !!j, Ye = z === "search-multi" && !We || z === "search-single" && (!M || Ge) || z === "display" && !We, $ = d({
-		mode: z,
-		open: L,
-		currentQuery: U,
+	}), Ue = Z.update, We = x.size > 0, Ge = A === "search" && (I || H.length > 0), Ke = Ge ? H : M ?? "", qe = A === "display" && !!j, Je = R === "search-multi" && !!j, Ye = R === "search-multi" && !We || R === "search-single" && (!M || Ge) || R === "display" && !We, $ = d({
+		mode: R,
+		open: I,
+		currentQuery: H,
 		hasDisplayValue: !!M,
 		inputRef: de,
-		setQuery: W,
+		setQuery: U,
 		openList: Ie,
 		close: Fe,
 		toggleOpen: Le
@@ -573,9 +587,9 @@ function Ae({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 			onDeselectAll: k.onDeselectAll,
 			selectAllButtonRef: P
 		}) : null, Ze ? /* @__PURE__ */ D(t, {
-			value: U,
-			onChange: W,
-			onClear: () => W(""),
+			value: H,
+			onChange: U,
+			onClear: () => U(""),
 			placeholder: "Поиск по дереву",
 			onKeyDown: (e) => {
 				e.key !== "Escape" && e.key !== "Tab" && e.stopPropagation();
@@ -586,20 +600,20 @@ function Ae({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 		}) : null]
 	}) : void 0;
 	_(() => {
-		L && w === "columns" && Ue();
+		I && w === "columns" && Ue();
 	}, [
 		De.signature,
-		L,
+		I,
 		w,
 		Ue
 	]);
 	let $e = (e) => {
 		de.current = e;
 	}, et = () => {
-		le?.(), W(""), C === "single" && Fe();
+		le?.(), U(""), C === "single" && Fe();
 	}, tt = (e) => {
-		e.hasChildren && me((t) => {
-			let n = new Map(t), r = t.get(e.node.id) ?? V.has(e.node.codeKey);
+		e.hasChildren && he((t) => {
+			let n = new Map(t), r = t.get(e.node.id) ?? B.has(e.node.codeKey);
 			return n.set(e.node.id, !r), n;
 		});
 	};
@@ -621,22 +635,22 @@ function Ae({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 				disabled: p,
 				readOnly: A !== "search",
 				value: A === "display" && qe ? "" : Ke,
-				placeholder: Ye ? he : void 0,
+				placeholder: Ye ? ge : void 0,
 				"aria-labelledby": i,
 				"aria-label": i ? void 0 : m,
 				"aria-describedby": o,
 				"aria-haspopup": w === "columns" ? "dialog" : "listbox",
-				"aria-expanded": L,
-				"aria-controls": L ? c : void 0,
+				"aria-expanded": I,
+				"aria-controls": I ? c : void 0,
 				"aria-autocomplete": w !== "columns" && A === "search" ? "list" : "none",
-				"aria-activedescendant": w !== "columns" && L && J.length > 0 ? He(c) : void 0,
+				"aria-activedescendant": w !== "columns" && I && J.length > 0 ? He(c) : void 0,
 				inputClassName: T(We && Q.treeSummary, qe && Q.inputWithOverlay),
 				overlay: qe ? /* @__PURE__ */ D("div", {
 					className: Q.valueOverlay,
 					children: j
 				}) : Je ? j : void 0,
 				endAdornment: /* @__PURE__ */ D(s, {
-					open: L,
+					open: I,
 					disabled: p || N,
 					onToggleMouseDown: $.handleToggleMouseDown,
 					onToggleClick: $.handleToggleClick,
@@ -661,7 +675,7 @@ function Ae({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 					$.handleTriggerFocus(e.currentTarget);
 				},
 				onKeyDown: (e) => {
-					if (w === "columns" && L && e.key === "Tab" && !e.shiftKey && P.current) {
+					if (w === "columns" && I && e.key === "Tab" && !e.shiftKey && P.current) {
 						e.preventDefault(), P.current.focus();
 						return;
 					}
@@ -675,7 +689,7 @@ function Ae({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 					});
 				}
 			}), /* @__PURE__ */ D(a, {
-				open: L,
+				open: I,
 				context: Z,
 				floatingStyles: Ae,
 				listId: c,
@@ -698,7 +712,7 @@ function Ae({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 						errorState: ue,
 						emptyState: !ue && !N ? "Нет данных" : void 0
 					}) : J.map((e, t) => {
-						let n = C === "multi" ? H(e.node.id, x, B) : x.has(e.node.id), r = C === "multi" && !n && S.has(e.node.id), i = t === X, a = e.node.disabled === !0;
+						let n = C === "multi" ? V(e.node.id, x, z) : x.has(e.node.id), r = C === "multi" && !n && S.has(e.node.id), i = t === X, a = e.node.disabled === !0;
 						return /* @__PURE__ */ D("div", {
 							"data-ui": "tree-select-option",
 							id: Ve(c, t),
@@ -720,7 +734,7 @@ function Ae({ label: n, description: c, disabled: p, placeholder: m, size: h, no
 								children: /* @__PURE__ */ D(ke, {
 									node: e.node,
 									level: e.level,
-									highlight: U,
+									highlight: H,
 									hasChildren: e.hasChildren,
 									isExpanded: e.isExpanded,
 									selected: n,
@@ -750,16 +764,16 @@ function je(e, t) {
 	}
 }
 function Me(e, t, n) {
-	let r = I(e, n), i = I(t, n);
+	let r = F(e, n), i = F(t, n);
 	return r.size === i.size && [...r].every((e) => i.has(e));
 }
 function Ne({ 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] = ee(!1), b = v(() => fe(a), [a]), { draftValue: x, setDraftValue: S, prepareOpen: C } = c({
+	let [_, y] = ee(!1), b = v(() => pe(a), [a]), { draftValue: x, setDraftValue: S, prepareOpen: C } = c({
 		value: o,
 		open: _,
 		onCommit: s,
 		isEqual: (e, t) => Me(e, t, b)
-	}), w = _ ? x : o, T = v(() => I(w, b), [w, b]), E = v(() => W(T, b), [T, b]), O = v(() => je(T, b), [T, b]);
+	}), w = _ ? x : o, T = v(() => F(w, b), [w, b]), E = v(() => U(T, b), [T, b]), O = v(() => je(T, b), [T, b]);
 	return /* @__PURE__ */ D(Ae, {
 		label: e,
 		description: t,
@@ -778,7 +792,7 @@ function Ne({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 		},
 		bulkActions: {
 			onSelectAll: () => {
-				S(L(G(b), b));
+				S(I(W(b), b));
 			},
 			onDeselectAll: () => S({})
 		},
@@ -788,7 +802,7 @@ function Ne({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 		defaultQuery: u,
 		onQuery: d,
 		onNodeActivate: (e) => {
-			S((t) => ge(t, e.id, b));
+			S((t) => _e(t, e.id, b));
 		},
 		onClearSelection: () => {
 			S({}), _ || s({});
@@ -799,19 +813,24 @@ function Ne({ label: e, description: t, disabled: n, placeholder: r = "Выбе
 }
 //#endregion
 //#region src/tree-select/ODataTreeMultiSelect.tsx
-function Pe({ 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 }) {
-	let h = P({
+function Pe({ 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, transformNodes: g }) {
+	let _ = P({
 		odata: d,
 		segments: f,
-		model: p
-	});
+		model: p,
+		segmentOrder: h
+	}), y = v(() => g?.(_.nodes, { orderedCodeKeys: _.orderedCodeKeys }) ?? _.nodes, [
+		g,
+		_.nodes,
+		_.orderedCodeKeys
+	]);
 	return /* @__PURE__ */ D(Ne, {
 		label: e,
 		description: t,
-		disabled: n || h.isLoading,
+		disabled: n || _.isLoading,
 		size: r,
-		placeholder: i ?? h.placeholder,
-		nodes: h.nodes,
+		placeholder: i ?? _.placeholder,
+		nodes: y,
 		value: l,
 		onChange: u,
 		query: a,
@@ -819,8 +838,8 @@ function Pe({ label: e, description: t, disabled: n, size: r, placeholder: i, qu
 		onQuery: s,
 		optionsLayout: c,
 		defaultExpandedCodeKeys: m,
-		isLoading: h.isLoading,
-		error: h.isError ? "Ошибка загрузки" : void 0
+		isLoading: _.isLoading,
+		error: _.isError ? "Ошибка загрузки" : void 0
 	});
 }
 //#endregion
@@ -829,7 +848,7 @@ function Fe(e) {
 	if (e) return e.code && e.code !== e.label ? `${e.label} · ${e.code}` : e.label;
 }
 function Ie({ 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(() => fe(a), [a]), g = pe(o, h), _ = g ? h.nodeById.get(g) : void 0;
+	let h = v(() => pe(a), [a]), g = me(o, h), _ = g ? h.nodeById.get(g) : void 0;
 	return /* @__PURE__ */ D(Ae, {
 		label: e,
 		description: t,