@ryuzaki13/react-foundation-lib 0.1.1

package/dist/number-scale/index.js

@@ -0,0 +1,99 @@
+//#region src/number-scale/numberScale.ts
+function e(e) {
+	if (!Number.isFinite(e)) return 0;
+	let t = e.toString().toLowerCase(), n = t.indexOf("e-");
+	if (n >= 0) return Number(t.slice(n + 2));
+	let r = t.indexOf(".");
+	return r >= 0 ? t.length - r - 1 : 0;
+}
+function t(e, t) {
+	if (t <= 0) return Math.round(e);
+	let n = 10 ** t;
+	return Math.round(e * n) / n;
+}
+function n(e, t) {
+	return !Number.isFinite(e) || !Number.isFinite(t) ? {
+		min: 0,
+		max: 100
+	} : e <= t ? {
+		min: e,
+		max: t
+	} : {
+		min: t,
+		max: e
+	};
+}
+function r(e, t, n) {
+	return Number.isFinite(e) ? Math.min(n, Math.max(t, e)) : t;
+}
+function i(e) {
+	return !Number.isFinite(e) || e === void 0 || e <= 0 ? 1 : e;
+}
+function a(e, t, n) {
+	if (!e?.length) return [];
+	let r = /* @__PURE__ */ new Set();
+	return e.filter((e) => Number.isFinite(e.value) && e.value >= t && e.value <= n).slice().sort((e, t) => e.value - t.value).filter((e) => r.has(e.value) ? !1 : (r.add(e.value), !0));
+}
+function o(n, a, o, s) {
+	let c = i(s), l = r(n, a, o), u = Math.max(e(c), e(a), e(o));
+	return r(t(a + Math.round((l - a) / c) * c, u), a, o);
+}
+function s(e, t) {
+	if (!t.length) return;
+	let n = t[0], r = Math.abs(e - n.value);
+	for (let i = 1; i < t.length; i += 1) {
+		let a = t[i], o = Math.abs(e - a.value);
+		o < r && (n = a, r = o);
+	}
+	return n;
+}
+function c(e, t, n, i) {
+	if (!t.length) return r(e, n, i);
+	let a = r(e, n, i);
+	return s(a, t)?.value ?? a;
+}
+function l(e, t) {
+	let { min: r, max: i } = n(t.min, t.max), s = a(t.marks, r, i);
+	return s.length > 0 ? c(e, s, r, i) : o(e, r, i, t.step);
+}
+function u(e, t, n) {
+	return n <= t ? 0 : (r(e, t, n) - t) / (n - t) * 100;
+}
+function d(e, t, n) {
+	if (n <= t) return t;
+	let i = r(e, 0, 100);
+	return t + (n - t) * i / 100;
+}
+function f(e, t, n, r, i = "value") {
+	return i === "index" && t.length > 1 ? e / (t.length - 1) * 100 : i === "index" ? 0 : u(t[e]?.value ?? n, n, r);
+}
+function p(e, t, n, i, a = "value") {
+	if (!t.length) return;
+	let o = r(e, 0, 100), s = t[0], c = Math.abs(o - f(0, t, n, i, a));
+	for (let e = 1; e < t.length; e += 1) {
+		let r = Math.abs(o - f(e, t, n, i, a));
+		r < c && (s = t[e], c = r);
+	}
+	return s;
+}
+function m(e, t) {
+	let { min: r, max: i } = n(t.min, t.max), s = a(t.marks, r, i);
+	return s.length > 0 ? p(e, s, r, i, t.marksPosition)?.value ?? r : o(d(e, r, i), r, i, t.step);
+}
+function h(e, t, s, c = s.min, l = s.max) {
+	let { min: u, max: d } = n(c, l), f = a(s.marks, u, d);
+	if (f.length > 0) {
+		let n = f.map((e) => e.value), i = 0, a = Math.abs(e - n[0]);
+		for (let t = 1; t < n.length; t += 1) {
+			let r = Math.abs(e - n[t]);
+			r < a && (a = r, i = t);
+		}
+		return n[r(i + t, 0, n.length - 1)];
+	}
+	let p = i(s.step);
+	return o(e + t * p, u, d, p);
+}
+//#endregion
+export { r as clampNumberScaleValue, s as findClosestNumberScaleMark, p as findClosestNumberScaleMarkByPercent, f as getNumberScaleMarkPercent, i as normalizeNumberScaleStep, h as offsetNumberScaleValue, d as percentToNumberScaleValue, m as percentToSnappedNumberScaleValue, a as prepareNumberScaleMarks, n as resolveNumberScaleBounds, l as snapNumberScaleValue, c as snapNumberScaleValueToMarks, o as snapNumberScaleValueToStep, u as valueToNumberScalePercent };
+
+//# sourceMappingURL=index.js.map

package/dist/number-scale/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../src/number-scale/numberScale.ts"],"sourcesContent":["import { NumberScaleBounds, NumberScaleMark, NumberScaleMarksPosition, NumberScaleOptions } from \"./types\";\n\nfunction countFractionDigits(value: number) {\n\tif (!Number.isFinite(value)) {\n\t\treturn 0;\n\t}\n\n\tconst normalized = value.toString().toLowerCase();\n\tconst exponentIndex = normalized.indexOf(\"e-\");\n\tif (exponentIndex >= 0) {\n\t\treturn Number(normalized.slice(exponentIndex + 2));\n\t}\n\n\tconst dotIndex = normalized.indexOf(\".\");\n\treturn dotIndex >= 0 ? normalized.length - dotIndex - 1 : 0;\n}\n\nfunction roundWithPrecision(value: number, precision: number) {\n\tif (precision <= 0) {\n\t\treturn Math.round(value);\n\t}\n\n\tconst factor = 10 ** precision;\n\treturn Math.round(value * factor) / factor;\n}\n\n/**\n * Возвращает безопасные границы числовой шкалы и меняет их местами, если min больше max.\n */\nexport function resolveNumberScaleBounds(min: number, max: number): NumberScaleBounds {\n\tif (!Number.isFinite(min) || !Number.isFinite(max)) {\n\t\treturn { min: 0, max: 100 };\n\t}\n\n\treturn min <= max ? { min, max } : { min: max, max: min };\n}\n\n/**\n * Ограничивает значение конечными границами шкалы.\n */\nexport function clampNumberScaleValue(value: number, min: number, max: number) {\n\tif (!Number.isFinite(value)) {\n\t\treturn min;\n\t}\n\n\treturn Math.min(max, Math.max(min, value));\n}\n\n/**\n * Нормализует шаг шкалы: некорректные, нулевые и отрицательные значения заменяет на 1.\n */\nexport function normalizeNumberScaleStep(step?: number) {\n\tif (!Number.isFinite(step) || step === undefined || step <= 0) {\n\t\treturn 1;\n\t}\n\n\treturn step;\n}\n\n/**\n * Фильтрует, сортирует и дедуплицирует marks по finite value внутри границ шкалы.\n */\nexport function prepareNumberScaleMarks<TMark extends NumberScaleMark>(\n\tmarks: readonly TMark[] | undefined,\n\tmin: number,\n\tmax: number\n): TMark[] {\n\tif (!marks?.length) {\n\t\treturn [];\n\t}\n\n\tconst seen = new Set<number>();\n\n\treturn marks\n\t\t.filter((mark) => Number.isFinite(mark.value) && mark.value >= min && mark.value <= max)\n\t\t.slice()\n\t\t.sort((left, right) => left.value - right.value)\n\t\t.filter((mark) => {\n\t\t\tif (seen.has(mark.value)) {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tseen.add(mark.value);\n\t\t\treturn true;\n\t\t});\n}\n\n/**\n * Привязывает значение к ближайшему шагу с учётом десятичной точности min/max/step.\n */\nexport function snapNumberScaleValueToStep(value: number, min: number, max: number, step?: number) {\n\tconst normalizedStep = normalizeNumberScaleStep(step);\n\tconst clamped = clampNumberScaleValue(value, min, max);\n\tconst precision = Math.max(countFractionDigits(normalizedStep), countFractionDigits(min), countFractionDigits(max));\n\tconst snapped = min + Math.round((clamped - min) / normalizedStep) * normalizedStep;\n\n\treturn clampNumberScaleValue(roundWithPrecision(snapped, precision), min, max);\n}\n\n/**\n * Возвращает ближайший mark по числовому value.\n */\nexport function findClosestNumberScaleMark<TMark extends NumberScaleMark>(value: number, marks: readonly TMark[]) {\n\tif (!marks.length) {\n\t\treturn undefined;\n\t}\n\n\tlet nearest = marks[0];\n\tlet distance = Math.abs(value - nearest.value);\n\n\tfor (let index = 1; index < marks.length; index += 1) {\n\t\tconst mark = marks[index];\n\t\tconst nextDistance = Math.abs(value - mark.value);\n\n\t\tif (nextDistance < distance) {\n\t\t\tnearest = mark;\n\t\t\tdistance = nextDistance;\n\t\t}\n\t}\n\n\treturn nearest;\n}\n\n/**\n * Привязывает значение к value ближайшего mark.\n */\nexport function snapNumberScaleValueToMarks<TMark extends NumberScaleMark>(\n\tvalue: number,\n\tmarks: readonly TMark[],\n\tmin: number,\n\tmax: number\n) {\n\tif (!marks.length) {\n\t\treturn clampNumberScaleValue(value, min, max);\n\t}\n\n\tconst clamped = clampNumberScaleValue(value, min, max);\n\treturn findClosestNumberScaleMark(clamped, marks)?.value ?? clamped;\n}\n\n/**\n * Привязывает значение к marks, если они есть, иначе к step.\n */\nexport function snapNumberScaleValue<TMark extends NumberScaleMark>(value: number, options: NumberScaleOptions<TMark>) {\n\tconst { min, max } = resolveNumberScaleBounds(options.min, options.max);\n\tconst preparedMarks = prepareNumberScaleMarks(options.marks, min, max);\n\n\tif (preparedMarks.length > 0) {\n\t\treturn snapNumberScaleValueToMarks(value, preparedMarks, min, max);\n\t}\n\n\treturn snapNumberScaleValueToStep(value, min, max, options.step);\n}\n\nexport function valueToNumberScalePercent(value: number, min: number, max: number) {\n\tif (max <= min) {\n\t\treturn 0;\n\t}\n\n\treturn ((clampNumberScaleValue(value, min, max) - min) / (max - min)) * 100;\n}\n\nexport function percentToNumberScaleValue(percent: number, min: number, max: number) {\n\tif (max <= min) {\n\t\treturn min;\n\t}\n\n\tconst safePercent = clampNumberScaleValue(percent, 0, 100);\n\treturn min + ((max - min) * safePercent) / 100;\n}\n\n/**\n * Возвращает позицию mark в процентах: по числовому value или равномерно по индексу.\n */\nexport function getNumberScaleMarkPercent(\n\tmarkIndex: number,\n\tmarks: readonly NumberScaleMark[],\n\tmin: number,\n\tmax: number,\n\tmarksPosition: NumberScaleMarksPosition = \"value\"\n) {\n\tif (marksPosition === \"index\" && marks.length > 1) {\n\t\treturn (markIndex / (marks.length - 1)) * 100;\n\t}\n\n\tif (marksPosition === \"index\") {\n\t\treturn 0;\n\t}\n\n\treturn valueToNumberScalePercent(marks[markIndex]?.value ?? min, min, max);\n}\n\n/**\n * Находит ближайший mark по визуальной позиции процента.\n */\nexport function findClosestNumberScaleMarkByPercent<TMark extends NumberScaleMark>(\n\tpercent: number,\n\tmarks: readonly TMark[],\n\tmin: number,\n\tmax: number,\n\tmarksPosition: NumberScaleMarksPosition = \"value\"\n) {\n\tif (!marks.length) {\n\t\treturn undefined;\n\t}\n\n\tconst safePercent = clampNumberScaleValue(percent, 0, 100);\n\tlet nearest = marks[0];\n\tlet distance = Math.abs(safePercent - getNumberScaleMarkPercent(0, marks, min, max, marksPosition));\n\n\tfor (let index = 1; index < marks.length; index += 1) {\n\t\tconst nextDistance = Math.abs(safePercent - getNumberScaleMarkPercent(index, marks, min, max, marksPosition));\n\n\t\tif (nextDistance < distance) {\n\t\t\tnearest = marks[index];\n\t\t\tdistance = nextDistance;\n\t\t}\n\t}\n\n\treturn nearest;\n}\n\n/**\n * Преобразует pointer percent в значение шкалы с учётом равномерного позиционирования marks.\n */\nexport function percentToSnappedNumberScaleValue<TMark extends NumberScaleMark>(percent: number, options: NumberScaleOptions<TMark>) {\n\tconst { min, max } = resolveNumberScaleBounds(options.min, options.max);\n\tconst preparedMarks = prepareNumberScaleMarks(options.marks, min, max);\n\n\tif (preparedMarks.length > 0) {\n\t\tconst closestMark = findClosestNumberScaleMarkByPercent(percent, preparedMarks, min, max, options.marksPosition);\n\t\treturn closestMark?.value ?? min;\n\t}\n\n\treturn snapNumberScaleValueToStep(percentToNumberScaleValue(percent, min, max), min, max, options.step);\n}\n\n/**\n * Смещает значение на offset шагов или на offset marks.\n */\nexport function offsetNumberScaleValue<TMark extends NumberScaleMark>(\n\tcurrentValue: number,\n\toffset: number,\n\toptions: NumberScaleOptions<TMark>,\n\tlowerBound = options.min,\n\tupperBound = options.max\n) {\n\tconst { min, max } = resolveNumberScaleBounds(lowerBound, upperBound);\n\tconst preparedMarks = prepareNumberScaleMarks(options.marks, min, max);\n\n\tif (preparedMarks.length > 0) {\n\t\tconst values = preparedMarks.map((mark) => mark.value);\n\t\tlet nearestIndex = 0;\n\t\tlet nearestDistance = Math.abs(currentValue - values[0]);\n\n\t\tfor (let index = 1; index < values.length; index += 1) {\n\t\t\tconst nextDistance = Math.abs(currentValue - values[index]);\n\t\t\tif (nextDistance < nearestDistance) {\n\t\t\t\tnearestDistance = nextDistance;\n\t\t\t\tnearestIndex = index;\n\t\t\t}\n\t\t}\n\n\t\tconst nextIndex = clampNumberScaleValue(nearestIndex + offset, 0, values.length - 1);\n\t\treturn values[nextIndex];\n\t}\n\n\tconst normalizedStep = normalizeNumberScaleStep(options.step);\n\treturn snapNumberScaleValueToStep(currentValue + offset * normalizedStep, min, max, normalizedStep);\n}\n"],"mappings":";AAEA,SAAS,EAAoB,GAAe;CAC3C,IAAI,CAAC,OAAO,SAAS,CAAK,GACzB,OAAO;CAGR,IAAM,IAAa,EAAM,SAAS,CAAC,CAAC,YAAY,GAC1C,IAAgB,EAAW,QAAQ,IAAI;CAC7C,IAAI,KAAiB,GACpB,OAAO,OAAO,EAAW,MAAM,IAAgB,CAAC,CAAC;CAGlD,IAAM,IAAW,EAAW,QAAQ,GAAG;CACvC,OAAO,KAAY,IAAI,EAAW,SAAS,IAAW,IAAI;AAC3D;AAEA,SAAS,EAAmB,GAAe,GAAmB;CAC7D,IAAI,KAAa,GAChB,OAAO,KAAK,MAAM,CAAK;CAGxB,IAAM,IAAS,MAAM;CACrB,OAAO,KAAK,MAAM,IAAQ,CAAM,IAAI;AACrC;AAKA,SAAgB,EAAyB,GAAa,GAAgC;CAKrF,OAJI,CAAC,OAAO,SAAS,CAAG,KAAK,CAAC,OAAO,SAAS,CAAG,IACzC;EAAE,KAAK;EAAG,KAAK;CAAI,IAGpB,KAAO,IAAM;EAAE;EAAK;CAAI,IAAI;EAAE,KAAK;EAAK,KAAK;CAAI;AACzD;AAKA,SAAgB,EAAsB,GAAe,GAAa,GAAa;CAK9E,OAJK,OAAO,SAAS,CAAK,IAInB,KAAK,IAAI,GAAK,KAAK,IAAI,GAAK,CAAK,CAAC,IAHjC;AAIT;AAKA,SAAgB,EAAyB,GAAe;CAKvD,OAJI,CAAC,OAAO,SAAS,CAAI,KAAK,MAAS,KAAA,KAAa,KAAQ,IACpD,IAGD;AACR;AAKA,SAAgB,EACf,GACA,GACA,GACU;CACV,IAAI,CAAC,GAAO,QACX,OAAO,CAAC;CAGT,IAAM,oBAAO,IAAI,IAAY;CAE7B,OAAO,EACL,QAAQ,MAAS,OAAO,SAAS,EAAK,KAAK,KAAK,EAAK,SAAS,KAAO,EAAK,SAAS,CAAG,CAAC,CACvF,MAAM,CAAC,CACP,MAAM,GAAM,MAAU,EAAK,QAAQ,EAAM,KAAK,CAAC,CAC/C,QAAQ,MACJ,EAAK,IAAI,EAAK,KAAK,IACf,MAGR,EAAK,IAAI,EAAK,KAAK,GACZ,GACP;AACH;AAKA,SAAgB,EAA2B,GAAe,GAAa,GAAa,GAAe;CAClG,IAAM,IAAiB,EAAyB,CAAI,GAC9C,IAAU,EAAsB,GAAO,GAAK,CAAG,GAC/C,IAAY,KAAK,IAAI,EAAoB,CAAc,GAAG,EAAoB,CAAG,GAAG,EAAoB,CAAG,CAAC;CAGlH,OAAO,EAAsB,EAFb,IAAM,KAAK,OAAO,IAAU,KAAO,CAAc,IAAI,GAEZ,CAAS,GAAG,GAAK,CAAG;AAC9E;AAKA,SAAgB,EAA0D,GAAe,GAAyB;CACjH,IAAI,CAAC,EAAM,QACV;CAGD,IAAI,IAAU,EAAM,IAChB,IAAW,KAAK,IAAI,IAAQ,EAAQ,KAAK;CAE7C,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAM,QAAQ,KAAS,GAAG;EACrD,IAAM,IAAO,EAAM,IACb,IAAe,KAAK,IAAI,IAAQ,EAAK,KAAK;EAEhD,AAAI,IAAe,MAClB,IAAU,GACV,IAAW;CAEb;CAEA,OAAO;AACR;AAKA,SAAgB,EACf,GACA,GACA,GACA,GACC;CACD,IAAI,CAAC,EAAM,QACV,OAAO,EAAsB,GAAO,GAAK,CAAG;CAG7C,IAAM,IAAU,EAAsB,GAAO,GAAK,CAAG;CACrD,OAAO,EAA2B,GAAS,CAAK,CAAC,EAAE,SAAS;AAC7D;AAKA,SAAgB,EAAoD,GAAe,GAAoC;CACtH,IAAM,EAAE,QAAK,WAAQ,EAAyB,EAAQ,KAAK,EAAQ,GAAG,GAChE,IAAgB,EAAwB,EAAQ,OAAO,GAAK,CAAG;CAMrE,OAJI,EAAc,SAAS,IACnB,EAA4B,GAAO,GAAe,GAAK,CAAG,IAG3D,EAA2B,GAAO,GAAK,GAAK,EAAQ,IAAI;AAChE;AAEA,SAAgB,EAA0B,GAAe,GAAa,GAAa;CAKlF,OAJI,KAAO,IACH,KAGC,EAAsB,GAAO,GAAK,CAAG,IAAI,MAAQ,IAAM,KAAQ;AACzE;AAEA,SAAgB,EAA0B,GAAiB,GAAa,GAAa;CACpF,IAAI,KAAO,GACV,OAAO;CAGR,IAAM,IAAc,EAAsB,GAAS,GAAG,GAAG;CACzD,OAAO,KAAQ,IAAM,KAAO,IAAe;AAC5C;AAKA,SAAgB,EACf,GACA,GACA,GACA,GACA,IAA0C,SACzC;CASD,OARI,MAAkB,WAAW,EAAM,SAAS,IACvC,KAAa,EAAM,SAAS,KAAM,MAGvC,MAAkB,UACd,IAGD,EAA0B,EAAM,EAAU,EAAE,SAAS,GAAK,GAAK,CAAG;AAC1E;AAKA,SAAgB,EACf,GACA,GACA,GACA,GACA,IAA0C,SACzC;CACD,IAAI,CAAC,EAAM,QACV;CAGD,IAAM,IAAc,EAAsB,GAAS,GAAG,GAAG,GACrD,IAAU,EAAM,IAChB,IAAW,KAAK,IAAI,IAAc,EAA0B,GAAG,GAAO,GAAK,GAAK,CAAa,CAAC;CAElG,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAM,QAAQ,KAAS,GAAG;EACrD,IAAM,IAAe,KAAK,IAAI,IAAc,EAA0B,GAAO,GAAO,GAAK,GAAK,CAAa,CAAC;EAE5G,AAAI,IAAe,MAClB,IAAU,EAAM,IAChB,IAAW;CAEb;CAEA,OAAO;AACR;AAKA,SAAgB,EAAgE,GAAiB,GAAoC;CACpI,IAAM,EAAE,QAAK,WAAQ,EAAyB,EAAQ,KAAK,EAAQ,GAAG,GAChE,IAAgB,EAAwB,EAAQ,OAAO,GAAK,CAAG;CAOrE,OALI,EAAc,SAAS,IACN,EAAoC,GAAS,GAAe,GAAK,GAAK,EAAQ,aAC3F,CAAA,EAAa,SAAS,IAGvB,EAA2B,EAA0B,GAAS,GAAK,CAAG,GAAG,GAAK,GAAK,EAAQ,IAAI;AACvG;AAKA,SAAgB,EACf,GACA,GACA,GACA,IAAa,EAAQ,KACrB,IAAa,EAAQ,KACpB;CACD,IAAM,EAAE,QAAK,WAAQ,EAAyB,GAAY,CAAU,GAC9D,IAAgB,EAAwB,EAAQ,OAAO,GAAK,CAAG;CAErE,IAAI,EAAc,SAAS,GAAG;EAC7B,IAAM,IAAS,EAAc,KAAK,MAAS,EAAK,KAAK,GACjD,IAAe,GACf,IAAkB,KAAK,IAAI,IAAe,EAAO,EAAE;EAEvD,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAO,QAAQ,KAAS,GAAG;GACtD,IAAM,IAAe,KAAK,IAAI,IAAe,EAAO,EAAM;GAC1D,AAAI,IAAe,MAClB,IAAkB,GAClB,IAAe;EAEjB;EAGA,OAAO,EADW,EAAsB,IAAe,GAAQ,GAAG,EAAO,SAAS,CACpE;CACf;CAEA,IAAM,IAAiB,EAAyB,EAAQ,IAAI;CAC5D,OAAO,EAA2B,IAAe,IAAS,GAAgB,GAAK,GAAK,CAAc;AACnG"}

package/dist/number-scale/numberScale.d.ts

@@ -0,0 +1,52 @@
+import { NumberScaleBounds, NumberScaleMark, NumberScaleMarksPosition, NumberScaleOptions } from "./types";
+/**
+ * Возвращает безопасные границы числовой шкалы и меняет их местами, если min больше max.
+ */
+export declare function resolveNumberScaleBounds(min: number, max: number): NumberScaleBounds;
+/**
+ * Ограничивает значение конечными границами шкалы.
+ */
+export declare function clampNumberScaleValue(value: number, min: number, max: number): number;
+/**
+ * Нормализует шаг шкалы: некорректные, нулевые и отрицательные значения заменяет на 1.
+ */
+export declare function normalizeNumberScaleStep(step?: number): number;
+/**
+ * Фильтрует, сортирует и дедуплицирует marks по finite value внутри границ шкалы.
+ */
+export declare function prepareNumberScaleMarks<TMark extends NumberScaleMark>(marks: readonly TMark[] | undefined, min: number, max: number): TMark[];
+/**
+ * Привязывает значение к ближайшему шагу с учётом десятичной точности min/max/step.
+ */
+export declare function snapNumberScaleValueToStep(value: number, min: number, max: number, step?: number): number;
+/**
+ * Возвращает ближайший mark по числовому value.
+ */
+export declare function findClosestNumberScaleMark<TMark extends NumberScaleMark>(value: number, marks: readonly TMark[]): TMark | undefined;
+/**
+ * Привязывает значение к value ближайшего mark.
+ */
+export declare function snapNumberScaleValueToMarks<TMark extends NumberScaleMark>(value: number, marks: readonly TMark[], min: number, max: number): number;
+/**
+ * Привязывает значение к marks, если они есть, иначе к step.
+ */
+export declare function snapNumberScaleValue<TMark extends NumberScaleMark>(value: number, options: NumberScaleOptions<TMark>): number;
+export declare function valueToNumberScalePercent(value: number, min: number, max: number): number;
+export declare function percentToNumberScaleValue(percent: number, min: number, max: number): number;
+/**
+ * Возвращает позицию mark в процентах: по числовому value или равномерно по индексу.
+ */
+export declare function getNumberScaleMarkPercent(markIndex: number, marks: readonly NumberScaleMark[], min: number, max: number, marksPosition?: NumberScaleMarksPosition): number;
+/**
+ * Находит ближайший mark по визуальной позиции процента.
+ */
+export declare function findClosestNumberScaleMarkByPercent<TMark extends NumberScaleMark>(percent: number, marks: readonly TMark[], min: number, max: number, marksPosition?: NumberScaleMarksPosition): TMark | undefined;
+/**
+ * Преобразует pointer percent в значение шкалы с учётом равномерного позиционирования marks.
+ */
+export declare function percentToSnappedNumberScaleValue<TMark extends NumberScaleMark>(percent: number, options: NumberScaleOptions<TMark>): number;
+/**
+ * Смещает значение на offset шагов или на offset marks.
+ */
+export declare function offsetNumberScaleValue<TMark extends NumberScaleMark>(currentValue: number, offset: number, options: NumberScaleOptions<TMark>, lowerBound?: number, upperBound?: number): number;
+//# sourceMappingURL=numberScale.d.ts.map

package/dist/number-scale/numberScale.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"numberScale.d.ts","sourceRoot":"","sources":["../../src/number-scale/numberScale.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,wBAAwB,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AA0B3G;;GAEG;AACH,wBAAgB,wBAAwB,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,iBAAiB,CAMpF;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,UAM5E;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CAAC,IAAI,CAAC,EAAE,MAAM,UAMrD;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,SAAS,eAAe,EACpE,KAAK,EAAE,SAAS,KAAK,EAAE,GAAG,SAAS,EACnC,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,GACT,KAAK,EAAE,CAmBT;AAED;;GAEG;AACH,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,UAOhG;AAED;;GAEG;AACH,wBAAgB,0BAA0B,CAAC,KAAK,SAAS,eAAe,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,KAAK,EAAE,qBAmB/G;AAED;;GAEG;AACH,wBAAgB,2BAA2B,CAAC,KAAK,SAAS,eAAe,EACxE,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,SAAS,KAAK,EAAE,EACvB,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,UAQX;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,SAAS,eAAe,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,kBAAkB,CAAC,KAAK,CAAC,UASpH;AAED,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,UAMhF;AAED,wBAAgB,yBAAyB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,UAOlF;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CACxC,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,SAAS,eAAe,EAAE,EACjC,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EACX,aAAa,GAAE,wBAAkC,UAWjD;AAED;;GAEG;AACH,wBAAgB,mCAAmC,CAAC,KAAK,SAAS,eAAe,EAChF,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,SAAS,KAAK,EAAE,EACvB,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EACX,aAAa,GAAE,wBAAkC,qBAoBjD;AAED;;GAEG;AACH,wBAAgB,gCAAgC,CAAC,KAAK,SAAS,eAAe,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,kBAAkB,CAAC,KAAK,CAAC,UAUlI;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,SAAS,eAAe,EACnE,YAAY,EAAE,MAAM,EACpB,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,kBAAkB,CAAC,KAAK,CAAC,EAClC,UAAU,SAAc,EACxB,UAAU,SAAc,UAwBxB"}

package/dist/number-scale/types.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Режим расчёта визуальных позиций marks.
+ * `value` использует числовую пропорцию, `index` расставляет marks равномерно.
+ */
+export type NumberScaleMarksPosition = "value" | "index";
+export interface NumberScaleMark {
+    /**
+     * Координата mark на внутренней числовой шкале.
+     */
+    value: number;
+}
+export interface NumberScaleOptions<TMark extends NumberScaleMark = NumberScaleMark> {
+    /**
+     * Минимальная координата шкалы.
+     */
+    min: number;
+    /**
+     * Максимальная координата шкалы.
+     */
+    max: number;
+    /**
+     * Шаг snap-логики, используется если нет marks.
+     */
+    step?: number;
+    /**
+     * Дискретные точки шкалы, к которым snap-ится значение.
+     */
+    marks?: readonly TMark[];
+    /**
+     * Режим размещения marks на track.
+     */
+    marksPosition?: NumberScaleMarksPosition;
+}
+export interface NumberScaleBounds {
+    /**
+     * Нормализованная минимальная координата.
+     */
+    min: number;
+    /**
+     * Нормализованная максимальная координата.
+     */
+    max: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/number-scale/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/number-scale/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,MAAM,wBAAwB,GAAG,OAAO,GAAG,OAAO,CAAC;AAEzD,MAAM,WAAW,eAAe;IAC/B;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,kBAAkB,CAAC,KAAK,SAAS,eAAe,GAAG,eAAe;IAClF;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;OAEG;IACH,KAAK,CAAC,EAAE,SAAS,KAAK,EAAE,CAAC;IACzB;;OAEG;IACH,aAAa,CAAC,EAAE,wBAAwB,CAAC;CACzC;AAED,MAAM,WAAW,iBAAiB;IACjC;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;CACZ"}

package/dist/odata/buildSeparatedArrays.d.ts

@@ -0,0 +1,10 @@
+import { CollectionItem, CollectionPair } from "./types";
+/**
+ * Создание разделенных массивов для каждого кодового поля
+ * @param items - исходные данные справочника
+ * @param pairs - пары код-текст
+ * @param excludeEmpty - флаг исключения пустых значений
+ * @returns Объект с разделенными массивами по кодовым полям
+ */
+export declare function buildSeparatedArrays<T extends CollectionItem>(items: T[], pairs: CollectionPair[], excludeEmpty?: boolean, sortByCode?: boolean): Record<string, T[]>;
+//# sourceMappingURL=buildSeparatedArrays.d.ts.map

package/dist/odata/buildSeparatedArrays.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"buildSeparatedArrays.d.ts","sourceRoot":"","sources":["../../src/odata/buildSeparatedArrays.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAUzD;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,SAAS,cAAc,EAC5D,KAAK,EAAE,CAAC,EAAE,EACV,KAAK,EAAE,cAAc,EAAE,EACvB,YAAY,GAAE,OAAc,EAC5B,UAAU,GAAE,OAAc,GACxB,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CA8IrB"}

package/dist/odata/dateUtils.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Форматы в стиле OData (совместимы с SAP UI5 DateFormat)
+ *
+ * Примеры:
+ * * datetime'2025-11-11T12:00:00'
+ * * datetimeoffset'2025-11-11T12:00:00Z'
+ * * time'PT12H30M00S'
+ */
+export declare const ODataDateFormat: {
+    datetime(date: Date): string;
+    datetimeOffset(date: Date): string;
+    time(date: Date): string;
+};
+//# sourceMappingURL=dateUtils.d.ts.map

package/dist/odata/dateUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dateUtils.d.ts","sourceRoot":"","sources":["../../src/odata/dateUtils.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,eAAO,MAAM,eAAe;mBACZ,IAAI,GAAG,MAAM;yBAGP,IAAI,GAAG,MAAM;eAGvB,IAAI,GAAG,MAAM;CAGxB,CAAC"}

package/dist/odata/findCollectionPairs.d.ts

@@ -0,0 +1,11 @@
+import { CollectionItem, CollectionPair } from "./types";
+export declare function findCollectionPairs(item: CollectionItem, options?: {
+    textSuffixes?: string[];
+    caseSensitive?: boolean;
+    returnUnpaired?: boolean;
+}): {
+    pairs: CollectionPair[];
+    pairsMap: CollectionItem;
+    unpaired?: string[];
+};
+//# sourceMappingURL=findCollectionPairs.d.ts.map

package/dist/odata/findCollectionPairs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findCollectionPairs.d.ts","sourceRoot":"","sources":["../../src/odata/findCollectionPairs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAEzD,wBAAgB,mBAAmB,CAClC,IAAI,EAAE,cAAc,EACpB,OAAO,GAAE;IAAE,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IAAC,aAAa,CAAC,EAAE,OAAO,CAAC;IAAC,cAAc,CAAC,EAAE,OAAO,CAAA;CAAO;WAuCrE,cAAc,EAAE;cAAY,cAAc;eAAa,MAAM,EAAE;EAOtF"}

package/dist/odata/index.d.ts

@@ -0,0 +1,6 @@
+export * from "./buildSeparatedArrays";
+export * from "./dateUtils";
+export * from "./findCollectionPairs";
+export * from "./store";
+export * from "./types";
+//# sourceMappingURL=index.d.ts.map

package/dist/odata/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/odata/index.ts"],"names":[],"mappings":"AAAA,cAAc,wBAAwB,CAAC;AACvC,cAAc,aAAa,CAAC;AAC5B,cAAc,uBAAuB,CAAC;AACtC,cAAc,SAAS,CAAC;AACxB,cAAc,SAAS,CAAC"}

package/dist/odata/index.js

@@ -0,0 +1,102 @@
+import { t as e } from "../chunks/dateUtils-D9dpdTl7.js";
+import { t } from "../chunks/string-comparison-BKT7PXmq.js";
+import { create as n } from "zustand";
+import { immer as r } from "zustand/middleware/immer";
+//#region src/odata/buildSeparatedArrays.ts
+function i(e) {
+	let t = {};
+	return e.forEach((e) => {
+		t[e.codeKey] = [];
+	}), t;
+}
+function a(e, n, r = !0, a = !0) {
+	if (!e || e.length === 0) return i(n);
+	let o = /* @__PURE__ */ new Set(), s = e[0];
+	s && Object.keys(s).forEach((e) => {
+		o.add(e);
+	});
+	let c = n.filter((e) => o.has(e.codeKey) && o.has(e.textKey));
+	if (c.length === 0) return i(n);
+	let l = {}, u = /* @__PURE__ */ new Map();
+	for (let e of c) {
+		let t = e.codeKey;
+		u.set(t, {
+			codeKey: e.codeKey,
+			textKey: e.textKey,
+			uniqueSet: /* @__PURE__ */ new Set()
+		}), l[t] = [];
+	}
+	n.forEach((e) => {
+		let t = e.codeKey;
+		u.has(t) || (l[t] = []);
+	});
+	for (let t of e) for (let [e, n] of u) {
+		let { codeKey: i, textKey: a, uniqueSet: o } = n, s = String(t[i]), c = String(t[a]);
+		if (r && !c || s == null) continue;
+		let u = `${String(s)}|${String(c)}`;
+		o.has(u) || (o.add(u), l[e].push({
+			[i]: s,
+			[a]: c
+		}));
+	}
+	for (let [e, n] of u) {
+		let r = l[e];
+		if (r.length > 0) {
+			let e = a ? n.codeKey : n.textKey;
+			r.sort((n, r) => {
+				let i = n[e] || "", a = r[e] || "";
+				return t(String(i), String(a));
+			});
+		}
+	}
+	return l;
+}
+//#endregion
+//#region src/odata/findCollectionPairs.ts
+function o(e, t = {}) {
+	let { textSuffixes: n = [
+		"_txt",
+		"_text",
+		"_t",
+		"_Text",
+		"_TXT",
+		"_T"
+	], caseSensitive: r = !1, returnUnpaired: i = !1 } = t, a = Object.keys(e), o = [], s = {}, c = /* @__PURE__ */ new Set(), l = new Set(a), u = n.map((e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")).join("|"), d = RegExp(`(.*)(${u})$`, r ? "" : "i"), f = a.filter((e) => d.test(e));
+	for (let e of f) {
+		if (c.has(e)) continue;
+		let t = e.match(d);
+		if (t) {
+			let n = t[1];
+			a.includes(n) && !c.has(n) && (o.push({
+				codeKey: n,
+				textKey: e
+			}), s[n] = e, c.add(n), c.add(e), l.delete(n), l.delete(e));
+		}
+	}
+	let p = {
+		pairs: o,
+		pairsMap: s
+	};
+	return i && (p.unpaired = Array.from(l)), p;
+}
+//#endregion
+//#region src/odata/store.ts
+var s = n()(r((e) => ({
+	defaultMaxVisibleItems: 200,
+	defaultMinSearchCodeLength: 3,
+	defaultMinSearchTextLength: 1,
+	defaultSearchDebounceDelay: 100,
+	setDefaultMaxVisibleItems: (t) => e({ defaultMaxVisibleItems: t }),
+	setDefaultMinSearchTextLength: (t) => e({ defaultMinSearchTextLength: t }),
+	setDefaultMinSearchCodeLength: (t) => e({ defaultMinSearchCodeLength: t }),
+	setDefaultSearchDebounceDelay: (t) => e({ defaultSearchDebounceDelay: t })
+}))), c = {
+	useMaxVisibleItems: () => s((e) => e.defaultMaxVisibleItems),
+	useMinSearchCodeLength: () => s((e) => e.defaultMinSearchCodeLength),
+	useMinSearchTextLength: () => s((e) => e.defaultMinSearchTextLength),
+	useSearchDebounce: () => s((e) => e.defaultSearchDebounceDelay)
+};
+//#endregion
+export { e as ODataDateFormat, a as buildSeparatedArrays, o as findCollectionPairs, c as odataCollectionConfig, s as useODataCollectionStore };
+
+//# sourceMappingURL=index.js.map

package/dist/odata/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../src/odata/buildSeparatedArrays.ts","../../src/odata/findCollectionPairs.ts","../../src/odata/store.ts"],"sourcesContent":["import { compareStrings } from \"../string-comparison\";\n\nimport { CollectionItem, CollectionPair } from \"./types\";\n\nfunction createEmptySeparated<T extends CollectionItem>(pairs: CollectionPair[]) {\n\tconst resultRef: Record<string, T[]> = {};\n\tpairs.forEach((pair) => {\n\t\tresultRef[pair.codeKey] = [];\n\t});\n\treturn resultRef;\n}\n\n/**\n * Создание разделенных массивов для каждого кодового поля\n * @param items - исходные данные справочника\n * @param pairs - пары код-текст\n * @param excludeEmpty - флаг исключения пустых значений\n * @returns Объект с разделенными массивами по кодовым полям\n */\nexport function buildSeparatedArrays<T extends CollectionItem>(\n\titems: T[],\n\tpairs: CollectionPair[],\n\texcludeEmpty: boolean = true,\n\tsortByCode: boolean = true\n): Record<string, T[]> {\n\t// Если items пустой, возвращаем пустые массивы для всех пар\n\tif (!items || items.length === 0) {\n\t\treturn createEmptySeparated(pairs);\n\t}\n\n\t// Определяем, какие ключи действительно существуют в items\n\tconst availableKeys = new Set<string>();\n\tconst firstItem = items[0];\n\n\tif (firstItem) {\n\t\t// Собираем все доступные ключи из первого элемента\n\t\tObject.keys(firstItem).forEach((key) => {\n\t\t\tavailableKeys.add(key);\n\t\t});\n\t}\n\n\t// Фильтруем пары, оставляем только те, где оба ключа существуют в items\n\tconst validPairs = pairs.filter((pair) => {\n\t\treturn availableKeys.has(pair.codeKey as string) && availableKeys.has(pair.textKey as string);\n\t});\n\n\t// Если нет валидных пар, возвращаем пустой результат\n\tif (validPairs.length === 0) {\n\t\treturn createEmptySeparated(pairs);\n\t}\n\n\tconst result: Record<string, T[]> = {};\n\t// Инициализируем структуры данных\n\tconst pairMap = new Map<\n\t\tstring,\n\t\t{\n\t\t\tcodeKey: keyof T;\n\t\t\ttextKey: keyof T;\n\t\t\tuniqueSet: Set<string>;\n\t\t}\n\t>();\n\n\t// Подготовка для валидных пар\n\tfor (const pair of validPairs) {\n\t\tconst codeKeyStr = pair.codeKey as string;\n\t\tpairMap.set(codeKeyStr, {\n\t\t\tcodeKey: pair.codeKey,\n\t\t\ttextKey: pair.textKey,\n\t\t\tuniqueSet: new Set<string>()\n\t\t});\n\t\tresult[codeKeyStr] = [];\n\t}\n\n\t// Для невалидных пар создаем пустые массивы\n\tpairs.forEach((pair) => {\n\t\tconst codeKeyStr = pair.codeKey as string;\n\t\tif (!pairMap.has(codeKeyStr)) {\n\t\t\tresult[codeKeyStr] = [];\n\t\t}\n\t});\n\n\t// Единый проход по всем элементам\n\tfor (const item of items) {\n\t\tfor (const [codeKeyStr, pairData] of pairMap) {\n\t\t\tconst { codeKey, textKey, uniqueSet } = pairData;\n\n\t\t\t// Получаем значения с проверкой на существование\n\t\t\tconst codeValue = String(item[codeKey]);\n\t\t\tconst textValue = String(item[textKey]);\n\n\t\t\t// Если excludeEmpty и текстовое значение пустое - пропускаем\n\t\t\tif (excludeEmpty && !textValue) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Проверяем, что codeValue существует\n\t\t\tif (codeValue === undefined || codeValue === null) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Проверка уникальности\n\t\t\tconst uniqueKey = `${String(codeValue)}|${String(textValue)}`;\n\t\t\tif (!uniqueSet.has(uniqueKey)) {\n\t\t\t\tuniqueSet.add(uniqueKey);\n\n\t\t\t\t// Создаем новый объект только с нужными полями\n\t\t\t\tresult[codeKeyStr].push({\n\t\t\t\t\t[codeKey]: codeValue,\n\t\t\t\t\t[textKey]: textValue\n\t\t\t\t} as T);\n\t\t\t}\n\t\t}\n\t}\n\n\t// Сортировка результатов для валидных пар\n\tfor (const [codeKeyStr, pairData] of pairMap) {\n\t\tconst array = result[codeKeyStr];\n\t\tif (array.length > 0) {\n\t\t\tconst sortKey = sortByCode ? pairData.codeKey : pairData.textKey;\n\n\t\t\tarray.sort((a, b) => {\n\t\t\t\tconst valA = a[sortKey] || \"\";\n\t\t\t\tconst valB = b[sortKey] || \"\";\n\t\t\t\treturn compareStrings(String(valA), String(valB));\n\t\t\t});\n\t\t}\n\t}\n\n\treturn result;\n\n\t//\n\n\t// pairs.forEach((pair) => {\n\t// \tlet filteredItems = items;\n\n\t// \t// Фильтруем пустые значения, если требуется\n\t// \tif (excludeEmpty) {\n\t// \t\tfilteredItems = items.filter((item) => item[pair.textKey]);\n\t// \t}\n\n\t// \t// Создаем массив только с нужными полями\n\t// \tconst separatedItems = filteredItems.map(\n\t// \t\t(item) =>\n\t// \t\t\t({\n\t// \t\t\t\t[pair.codeKey]: item[pair.codeKey],\n\t// \t\t\t\t[pair.textKey]: item[pair.textKey]\n\t// \t\t\t}) as T\n\t// \t);\n\n\t// \t// Удаляем дубликаты\n\t// \tconst uniqueItems: T[] = Array.from(\n\t// \t\tnew Map(separatedItems.map((item) => [`${item[pair.codeKey]}|${item[pair.textKey]}`, item])).values()\n\t// \t);\n\n\t// \tconst sortKey = sortByCode ? pair.codeKey : pair.textKey;\n\n\t// \tuniqueItems.sort((a, b) => {\n\t// \t\tconst textA = a[sortKey] || \"\";\n\t// \t\tconst textB = b[sortKey] || \"\";\n\t// \t\treturn compareStrings(String(textA), String(textB));\n\t// \t});\n\n\t// \tresult[pair.codeKey] = uniqueItems;\n\t// });\n\n\t// return result;\n}\n","import { CollectionItem, CollectionPair } from \"./types\";\n\nexport function findCollectionPairs(\n\titem: CollectionItem,\n\toptions: { textSuffixes?: string[]; caseSensitive?: boolean; returnUnpaired?: boolean } = {}\n) {\n\tconst { textSuffixes = [\"_txt\", \"_text\", \"_t\", \"_Text\", \"_TXT\", \"_T\"], caseSensitive = false, returnUnpaired = false } = options;\n\n\tconst fields = Object.keys(item);\n\tconst pairs = [] as CollectionPair[];\n\tconst pairsMap = {} as Record<string, string>;\n\tconst usedFields = new Set();\n\tconst unpairedFields = new Set(fields);\n\n\t// Создаем регулярное выражение для поиска текстовых полей\n\tconst suffixPattern = textSuffixes.map((s) => s.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\")).join(\"|\");\n\tconst textFieldRegex = new RegExp(`(.*)(${suffixPattern})$`, caseSensitive ? \"\" : \"i\");\n\n\t// Сначала проходим по всем полям и находим текстовые\n\tconst textFields = fields.filter((field) => textFieldRegex.test(field));\n\n\t// Для каждого текстового поля ищем соответствующее кодовое\n\tfor (const textField of textFields) {\n\t\tif (usedFields.has(textField)) continue;\n\n\t\tconst match = textField.match(textFieldRegex);\n\t\tif (match) {\n\t\t\tconst baseName = match[1]; // Имя без суффикса\n\n\t\t\tif (fields.includes(baseName) && !usedFields.has(baseName)) {\n\t\t\t\tpairs.push({\n\t\t\t\t\tcodeKey: baseName,\n\t\t\t\t\ttextKey: textField\n\t\t\t\t});\n\t\t\t\tpairsMap[baseName] = textField;\n\t\t\t\tusedFields.add(baseName);\n\t\t\t\tusedFields.add(textField);\n\t\t\t\tunpairedFields.delete(baseName);\n\t\t\t\tunpairedFields.delete(textField);\n\t\t\t}\n\t\t}\n\t}\n\n\tconst result: { pairs: CollectionPair[]; pairsMap: CollectionItem; unpaired?: string[] } = { pairs, pairsMap };\n\n\tif (returnUnpaired) {\n\t\tresult.unpaired = Array.from(unpairedFields);\n\t}\n\n\treturn result;\n}\n","// Глобальные конфигурируемые параметры\n\nimport { create } from \"zustand\";\nimport { immer } from \"zustand/middleware/immer\";\n\ntype ODataCollectionState = {\n\tdefaultMaxVisibleItems: number;\n\tdefaultMinSearchTextLength: number;\n\tdefaultMinSearchCodeLength: number;\n\tdefaultSearchDebounceDelay: number;\n};\n\ntype ODataCollectionActions = {\n\tsetDefaultMaxVisibleItems: (value: number) => void;\n\tsetDefaultMinSearchTextLength: (value: number) => void;\n\tsetDefaultMinSearchCodeLength: (value: number) => void;\n\tsetDefaultSearchDebounceDelay: (value: number) => void;\n};\n\nexport const useODataCollectionStore = create<ODataCollectionState & ODataCollectionActions>()(\n\timmer((set) => ({\n\t\tdefaultMaxVisibleItems: 200,\n\t\tdefaultMinSearchCodeLength: 3,\n\t\tdefaultMinSearchTextLength: 1,\n\t\tdefaultSearchDebounceDelay: 100,\n\n\t\tsetDefaultMaxVisibleItems: (defaultMaxVisibleItems) => set({ defaultMaxVisibleItems }),\n\t\tsetDefaultMinSearchTextLength: (defaultMinSearchTextLength) => set({ defaultMinSearchTextLength }),\n\t\tsetDefaultMinSearchCodeLength: (defaultMinSearchCodeLength) => set({ defaultMinSearchCodeLength }),\n\t\tsetDefaultSearchDebounceDelay: (defaultSearchDebounceDelay) => set({ defaultSearchDebounceDelay })\n\t}))\n);\n\n// export const useODataCollectionDefaultMaxVisibleItems = () => useODataCollectionStore((s) => s.defaultMaxVisibleItems);\n// export const useODataCollectionDefaultMinSearchCodeLength = () => useODataCollectionStore((s) => s.defaultMinSearchCodeLength);\n// export const useODataCollectionDefaultMinSearchTextLength = () => useODataCollectionStore((s) => s.defaultMinSearchTextLength);\n// export const useODataCollectionDefaultSearchDebounceDelay = () => useODataCollectionStore((s) => s.defaultSearchDebounceDelay);\n\nexport const odataCollectionConfig = {\n\tuseMaxVisibleItems: () => useODataCollectionStore((s) => s.defaultMaxVisibleItems),\n\tuseMinSearchCodeLength: () => useODataCollectionStore((s) => s.defaultMinSearchCodeLength),\n\tuseMinSearchTextLength: () => useODataCollectionStore((s) => s.defaultMinSearchTextLength),\n\tuseSearchDebounce: () => useODataCollectionStore((s) => s.defaultSearchDebounceDelay)\n};\n"],"mappings":";;;;;AAIA,SAAS,EAA+C,GAAyB;CAChF,IAAM,IAAiC,CAAC;CAIxC,OAHA,EAAM,SAAS,MAAS;EACvB,EAAU,EAAK,WAAW,CAAC;CAC5B,CAAC,GACM;AACR;AASA,SAAgB,EACf,GACA,GACA,IAAwB,IACxB,IAAsB,IACA;CAEtB,IAAI,CAAC,KAAS,EAAM,WAAW,GAC9B,OAAO,EAAqB,CAAK;CAIlC,IAAM,oBAAgB,IAAI,IAAY,GAChC,IAAY,EAAM;CAExB,AAAI,KAEH,OAAO,KAAK,CAAS,CAAC,CAAC,SAAS,MAAQ;EACvC,EAAc,IAAI,CAAG;CACtB,CAAC;CAIF,IAAM,IAAa,EAAM,QAAQ,MACzB,EAAc,IAAI,EAAK,OAAiB,KAAK,EAAc,IAAI,EAAK,OAAiB,CAC5F;CAGD,IAAI,EAAW,WAAW,GACzB,OAAO,EAAqB,CAAK;CAGlC,IAAM,IAA8B,CAAC,GAE/B,oBAAU,IAAI,IAOlB;CAGF,KAAK,IAAM,KAAQ,GAAY;EAC9B,IAAM,IAAa,EAAK;EAMxB,AALA,EAAQ,IAAI,GAAY;GACvB,SAAS,EAAK;GACd,SAAS,EAAK;GACd,2BAAW,IAAI,IAAY;EAC5B,CAAC,GACD,EAAO,KAAc,CAAC;CACvB;CAGA,EAAM,SAAS,MAAS;EACvB,IAAM,IAAa,EAAK;EACxB,AAAK,EAAQ,IAAI,CAAU,MAC1B,EAAO,KAAc,CAAC;CAExB,CAAC;CAGD,KAAK,IAAM,KAAQ,GAClB,KAAK,IAAM,CAAC,GAAY,MAAa,GAAS;EAC7C,IAAM,EAAE,YAAS,YAAS,iBAAc,GAGlC,IAAY,OAAO,EAAK,EAAQ,GAChC,IAAY,OAAO,EAAK,EAAQ;EAQtC,IALI,KAAgB,CAAC,KAKjB,KAAyC,MAC5C;EAID,IAAM,IAAY,GAAG,OAAO,CAAS,EAAE,GAAG,OAAO,CAAS;EAC1D,AAAK,EAAU,IAAI,CAAS,MAC3B,EAAU,IAAI,CAAS,GAGvB,EAAO,EAAW,CAAC,KAAK;IACtB,IAAU;IACV,IAAU;EACZ,CAAM;CAER;CAID,KAAK,IAAM,CAAC,GAAY,MAAa,GAAS;EAC7C,IAAM,IAAQ,EAAO;EACrB,IAAI,EAAM,SAAS,GAAG;GACrB,IAAM,IAAU,IAAa,EAAS,UAAU,EAAS;GAEzD,EAAM,MAAM,GAAG,MAAM;IACpB,IAAM,IAAO,EAAE,MAAY,IACrB,IAAO,EAAE,MAAY;IAC3B,OAAO,EAAe,OAAO,CAAI,GAAG,OAAO,CAAI,CAAC;GACjD,CAAC;EACF;CACD;CAEA,OAAO;AAsCR;;;ACpKA,SAAgB,EACf,GACA,IAA0F,CAAC,GAC1F;CACD,IAAM,EAAE,kBAAe;EAAC;EAAQ;EAAS;EAAM;EAAS;EAAQ;CAAI,GAAG,mBAAgB,IAAO,oBAAiB,OAAU,GAEnH,IAAS,OAAO,KAAK,CAAI,GACzB,IAAQ,CAAC,GACT,IAAW,CAAC,GACZ,oBAAa,IAAI,IAAI,GACrB,IAAiB,IAAI,IAAI,CAAM,GAG/B,IAAgB,EAAa,KAAK,MAAM,EAAE,QAAQ,uBAAuB,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,GAC1F,IAAqB,OAAO,QAAQ,EAAc,KAAK,IAAgB,KAAK,GAAG,GAG/E,IAAa,EAAO,QAAQ,MAAU,EAAe,KAAK,CAAK,CAAC;CAGtE,KAAK,IAAM,KAAa,GAAY;EACnC,IAAI,EAAW,IAAI,CAAS,GAAG;EAE/B,IAAM,IAAQ,EAAU,MAAM,CAAc;EAC5C,IAAI,GAAO;GACV,IAAM,IAAW,EAAM;GAEvB,AAAI,EAAO,SAAS,CAAQ,KAAK,CAAC,EAAW,IAAI,CAAQ,MACxD,EAAM,KAAK;IACV,SAAS;IACT,SAAS;GACV,CAAC,GACD,EAAS,KAAY,GACrB,EAAW,IAAI,CAAQ,GACvB,EAAW,IAAI,CAAS,GACxB,EAAe,OAAO,CAAQ,GAC9B,EAAe,OAAO,CAAS;EAEjC;CACD;CAEA,IAAM,IAAqF;EAAE;EAAO;CAAS;CAM7G,OAJI,MACH,EAAO,WAAW,MAAM,KAAK,CAAc,IAGrC;AACR;;;AC/BA,IAAa,IAA0B,EAAsD,CAAC,CAC7F,GAAO,OAAS;CACf,wBAAwB;CACxB,4BAA4B;CAC5B,4BAA4B;CAC5B,4BAA4B;CAE5B,4BAA4B,MAA2B,EAAI,EAAE,0BAAuB,CAAC;CACrF,gCAAgC,MAA+B,EAAI,EAAE,8BAA2B,CAAC;CACjG,gCAAgC,MAA+B,EAAI,EAAE,8BAA2B,CAAC;CACjG,gCAAgC,MAA+B,EAAI,EAAE,8BAA2B,CAAC;AAClG,EAAE,CACH,GAOa,IAAwB;CACpC,0BAA0B,GAAyB,MAAM,EAAE,sBAAsB;CACjF,8BAA8B,GAAyB,MAAM,EAAE,0BAA0B;CACzF,8BAA8B,GAAyB,MAAM,EAAE,0BAA0B;CACzF,yBAAyB,GAAyB,MAAM,EAAE,0BAA0B;AACrF"}

package/dist/odata/store.d.ts

@@ -0,0 +1,42 @@
+type ODataCollectionState = {
+    defaultMaxVisibleItems: number;
+    defaultMinSearchTextLength: number;
+    defaultMinSearchCodeLength: number;
+    defaultSearchDebounceDelay: number;
+};
+type ODataCollectionActions = {
+    setDefaultMaxVisibleItems: (value: number) => void;
+    setDefaultMinSearchTextLength: (value: number) => void;
+    setDefaultMinSearchCodeLength: (value: number) => void;
+    setDefaultSearchDebounceDelay: (value: number) => void;
+};
+export declare const useODataCollectionStore: import("zustand").UseBoundStore<Omit<import("zustand").StoreApi<ODataCollectionState & ODataCollectionActions>, "setState"> & {
+    setState(nextStateOrUpdater: (ODataCollectionState & ODataCollectionActions) | Partial<ODataCollectionState & ODataCollectionActions> | ((state: {
+        defaultMaxVisibleItems: number;
+        defaultMinSearchTextLength: number;
+        defaultMinSearchCodeLength: number;
+        defaultSearchDebounceDelay: number;
+        setDefaultMaxVisibleItems: (value: number) => void;
+        setDefaultMinSearchTextLength: (value: number) => void;
+        setDefaultMinSearchCodeLength: (value: number) => void;
+        setDefaultSearchDebounceDelay: (value: number) => void;
+    }) => void), shouldReplace?: false): void;
+    setState(nextStateOrUpdater: (ODataCollectionState & ODataCollectionActions) | ((state: {
+        defaultMaxVisibleItems: number;
+        defaultMinSearchTextLength: number;
+        defaultMinSearchCodeLength: number;
+        defaultSearchDebounceDelay: number;
+        setDefaultMaxVisibleItems: (value: number) => void;
+        setDefaultMinSearchTextLength: (value: number) => void;
+        setDefaultMinSearchCodeLength: (value: number) => void;
+        setDefaultSearchDebounceDelay: (value: number) => void;
+    }) => void), shouldReplace: true): void;
+}>;
+export declare const odataCollectionConfig: {
+    useMaxVisibleItems: () => number;
+    useMinSearchCodeLength: () => number;
+    useMinSearchTextLength: () => number;
+    useSearchDebounce: () => number;
+};
+export {};
+//# sourceMappingURL=store.d.ts.map

package/dist/odata/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/odata/store.ts"],"names":[],"mappings":"AAKA,KAAK,oBAAoB,GAAG;IAC3B,sBAAsB,EAAE,MAAM,CAAC;IAC/B,0BAA0B,EAAE,MAAM,CAAC;IACnC,0BAA0B,EAAE,MAAM,CAAC;IACnC,0BAA0B,EAAE,MAAM,CAAC;CACnC,CAAC;AAEF,KAAK,sBAAsB,GAAG;IAC7B,yBAAyB,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;IACnD,6BAA6B,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;IACvD,6BAA6B,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;IACvD,6BAA6B,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;CACvD,CAAC;AAEF,eAAO,MAAM,uBAAuB;;gCAbX,MAAM;oCACF,MAAM;oCACN,MAAM;oCACN,MAAM;mCAIP,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI;uCACnB,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI;uCACvB,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI;uCACvB,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI;;;gCAV9B,MAAM;oCACF,MAAM;oCACN,MAAM;oCACN,MAAM;mCAIP,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI;uCACnB,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI;uCACvB,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI;uCACvB,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI;;EAetD,CAAC;AAOF,eAAO,MAAM,qBAAqB;;;;;CAKjC,CAAC"}

package/dist/odata/types.d.ts

@@ -0,0 +1,12 @@
+export type CollectionItem = {
+    [K: string]: string;
+};
+export interface CollectionPair {
+    codeKey: string;
+    textKey: string;
+}
+export interface DependencyFilter {
+    key: string;
+    values: CollectionItem[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/odata/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/odata/types.ts"],"names":[],"mappings":"AASA,MAAM,MAAM,cAAc,GAAG;IAC5B,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;CACpB,CAAC;AAGF,MAAM,WAAW,cAAc;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CAChB;AAGD,MAAM,WAAW,gBAAgB;IAChC,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,cAAc,EAAE,CAAC;CACzB"}

package/dist/odata-service/baseTypes.d.ts

@@ -0,0 +1,6 @@
+import type { BaseMetaType } from "./types";
+export declare const BASE_META_TYPES: readonly ["string", "number", "boolean", "date"];
+export declare const BASE_META_TYPE_LABELS: Readonly<Record<BaseMetaType, string>>;
+export declare function isBaseMetaType(type: unknown): type is BaseMetaType;
+export declare function resolveBaseTypeLabel(type: BaseMetaType): string;
+//# sourceMappingURL=baseTypes.d.ts.map

package/dist/odata-service/baseTypes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"baseTypes.d.ts","sourceRoot":"","sources":["../../src/odata-service/baseTypes.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAE5C,eAAO,MAAM,eAAe,kDAAoG,CAAC;AAIjI,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,CAKvE,CAAC;AAEH,wBAAgB,cAAc,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,IAAI,YAAY,CAElE;AAED,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,CAE/D"}

package/dist/odata-service/builder.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Построитель URL для OData сущностей на основе метаданных
+ */
+import { EntityMetadata, EntityParameterProperty, FunctionImportMetadata, ODataOperationMethod, ODataServiceConfig, WrappedODataParameters } from "./types";
+type ParameterizedMetadata = {
+    parameters?: EntityParameterProperty[];
+};
+/**
+ * Собирает строку параметров запроса к сущности на основе метаданных
+ *
+ * @param metadata Метаданные сущности
+ * @param params Значения параметров
+ */
+export declare function buildParameterEntries(metadata: ParameterizedMetadata, params: WrappedODataParameters): Array<[string, string]>;
+/**
+ * Собирает строку параметров запроса к сущности на основе metadata.
+ */
+export declare function buildEntityParameters(metadata: EntityMetadata, params: WrappedODataParameters): string;
+/**
+ * Собирает query string-параметры для FunctionImport.
+ */
+export declare function buildFunctionImportParameters(metadata: FunctionImportMetadata, params: WrappedODataParameters): URLSearchParams;
+export declare function buildEntityOperationPath(metadata: EntityMetadata, config: ODataServiceConfig, params: WrappedODataParameters, method: Exclude<ODataOperationMethod, "fi">): string;
+/**
+ * Собирает строку запроса к FunctionImport.
+ */
+export declare function buildFunctionImportPath(metadata: FunctionImportMetadata, config: ODataServiceConfig, params: WrappedODataParameters): string;
+/**
+ * Собирает строку запроса к EntitySet
+ */
+export declare function buildEntityPath(metadata: EntityMetadata, config: ODataServiceConfig, params: WrappedODataParameters): string;
+export {};
+//# sourceMappingURL=builder.d.ts.map

package/dist/odata-service/builder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"builder.d.ts","sourceRoot":"","sources":["../../src/odata-service/builder.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EACN,cAAc,EACd,uBAAuB,EACvB,sBAAsB,EACtB,oBAAoB,EACpB,kBAAkB,EAElB,sBAAsB,EACtB,MAAM,SAAS,CAAC;AAEjB,KAAK,qBAAqB,GAAG;IAC5B,UAAU,CAAC,EAAE,uBAAuB,EAAE,CAAC;CACvC,CAAC;AAwBF;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,qBAAqB,EAAE,MAAM,EAAE,sBAAsB,GAAG,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CA6B9H;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAE,sBAAsB,GAAG,MAAM,CAGtG;AAED;;GAEG;AACH,wBAAgB,6BAA6B,CAAC,QAAQ,EAAE,sBAAsB,EAAE,MAAM,EAAE,sBAAsB,GAAG,eAAe,CAQ/H;AAED,wBAAgB,wBAAwB,CACvC,QAAQ,EAAE,cAAc,EACxB,MAAM,EAAE,kBAAkB,EAC1B,MAAM,EAAE,sBAAsB,EAC9B,MAAM,EAAE,OAAO,CAAC,oBAAoB,EAAE,IAAI,CAAC,GACzC,MAAM,CAyBR;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CACtC,QAAQ,EAAE,sBAAsB,EAChC,MAAM,EAAE,kBAAkB,EAC1B,MAAM,EAAE,sBAAsB,GAC5B,MAAM,CAMR;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,cAAc,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,EAAE,sBAAsB,GAAG,MAAM,CAK5H"}

package/dist/odata-service/columns.d.ts

@@ -0,0 +1,10 @@
+import { EntityColumnProperty } from "./types";
+/**
+ * Возвращает code-like filterable-колонки.
+ */
+export declare function collectFilterableColumns(columns: readonly Readonly<EntityColumnProperty>[]): Readonly<EntityColumnProperty>[];
+/**
+ * Возвращает идентификаторы code-like filterable-колонок.
+ */
+export declare function collectFilterableColumnsIds(columns: readonly Readonly<EntityColumnProperty>[]): Readonly<Set<string>>;
+//# sourceMappingURL=columns.d.ts.map

package/dist/odata-service/columns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"columns.d.ts","sourceRoot":"","sources":["../../src/odata-service/columns.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAC;AAE/C;;GAEG;AACH,wBAAgB,wBAAwB,CAAC,OAAO,EAAE,SAAS,QAAQ,CAAC,oBAAoB,CAAC,EAAE,GAAG,QAAQ,CAAC,oBAAoB,CAAC,EAAE,CAE7H;AAED;;GAEG;AACH,wBAAgB,2BAA2B,CAAC,OAAO,EAAE,SAAS,QAAQ,CAAC,oBAAoB,CAAC,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAErH"}