@ryuzaki13/react-foundation-lib 0.1.1

package/dist/array/array.d.ts

@@ -0,0 +1,30 @@
+export declare function arrayGroupBy<T>(array: readonly T[], key: keyof T): Record<string, T[]>;
+export declare function arrayToMap<T>(array: readonly T[], key: keyof T): Record<string, T>;
+export declare function arrayGroupByToArray<T>(array: readonly T[], key: keyof T): Array<{
+    key: string;
+    items: T[];
+}>;
+export declare function arrayUniqueBy<T>(array: readonly T[], key: keyof T): T[];
+/**
+ * Удаляет дубликаты из массива с сохранением первого вхождения.
+ *
+ * Нужна для нормализации списков примитивных значений перед передачей
+ * в кеш-ключи, SQL-запросы и другие слои, где повторные элементы не несут смысла.
+ */
+export declare function arrayDeduplicate<T>(array: readonly T[]): T[];
+/**
+ * Фильтрует массив идентификаторов: оставляет только присутствующие в `allowedIds`,
+ * удаляет дубликаты, исключает пустые строки.
+ *
+ * Зачем: унификация нормализации пользовательских списков ID
+ * (grouped columns, locked visible columns и т.п.) перед вычислением layout.
+ */
+export declare function filterAndDeduplicateIds<TId extends string>(ids: readonly string[] | undefined, allowedIds: readonly TId[]): TId[];
+export declare function appendMissingIds<TId extends string>(baseIds: readonly TId[], idsToAppend: readonly TId[]): TId[];
+export declare function pickExistingMapValues<TKey, TValue>(keys: readonly TKey[], valuesByKey: ReadonlyMap<TKey, TValue>): TValue[];
+export declare function arraysEqual<T>(left: readonly T[], right: readonly T[]): boolean;
+export declare function moveItem<T>(items: readonly T[], from: number, to: number): T[];
+export declare function normalizeObjects<T, K extends keyof T, O = T>(items: readonly T[] | undefined, key: K, copyist?: ((item: T, key: T[K]) => O) | false): O[] | undefined;
+export declare function normalizeStringArray(items: readonly string[] | undefined): string[] | undefined;
+export declare function addUnique(target: string[], seen: Set<string>, fieldId: string | undefined): void;
+//# sourceMappingURL=array.d.ts.map

package/dist/array/array.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/array/array.ts"],"names":[],"mappings":"AAEA,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAMtF;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAQlF;AAED,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,CAAC,EAAE,CAAA;CAAE,CAAC,CAW5G;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAQvE;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,EAAE,CAY5D;AAED;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CAAC,GAAG,SAAS,MAAM,EAAE,GAAG,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,EAAE,UAAU,EAAE,SAAS,GAAG,EAAE,GAAG,GAAG,EAAE,CAcjI;AAED,wBAAgB,gBAAgB,CAAC,GAAG,SAAS,MAAM,EAAE,OAAO,EAAE,SAAS,GAAG,EAAE,EAAE,WAAW,EAAE,SAAS,GAAG,EAAE,GAAG,GAAG,EAAE,CAWhH;AAED,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,IAAI,EAAE,EAAE,WAAW,EAAE,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,MAAM,EAAE,CAY3H;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,GAAG,OAAO,CAQ/E;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,CAAC,EAAE,CAU9E;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAC3D,KAAK,EAAE,SAAS,CAAC,EAAE,GAAG,SAAS,EAC/B,GAAG,EAAE,CAAC,EACN,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,GAC3C,CAAC,EAAE,GAAG,SAAS,CAuBjB;AAED,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,GAAG,MAAM,EAAE,GAAG,SAAS,CAe/F;AAED,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAKhG"}

package/dist/array/index.d.ts

@@ -0,0 +1,3 @@
+export * from "./array";
+export * from "./reorder";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/array/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC"}

package/dist/array/index.js

@@ -0,0 +1,2 @@
+import { a as e, c as t, d as n, f as r, h as i, i as a, l as o, m as s, n as c, o as l, p as u, r as d, s as f, t as p, u as m } from "../chunks/array-BBSjoTRy.js";
+export { d as addUnique, a as appendMissingIds, e as arrayDeduplicate, l as arrayGroupBy, f as arrayGroupByToArray, t as arrayToMap, o as arrayUniqueBy, m as arraysEqual, n as filterAndDeduplicateIds, p as moveArrayItem, c as moveArrayItemByIndex, r as moveItem, u as normalizeObjects, s as normalizeStringArray, i as pickExistingMapValues };

package/dist/array/reorder.d.ts

@@ -0,0 +1,10 @@
+export type ReorderAction = "start" | "end" | "up" | "down";
+/**
+ * Перемещает элемент списка по одному из предопределённых действий.
+ */
+export declare function moveArrayItemByIndex<T>(items: readonly T[], index: number, action: ReorderAction): T[];
+/**
+ * Перемещает элемент списка из одного индекса в другой.
+ */
+export declare function moveArrayItem<T>(items: readonly T[], fromIndex: number, toIndex: number): T[];
+//# sourceMappingURL=reorder.d.ts.map

package/dist/array/reorder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reorder.d.ts","sourceRoot":"","sources":["../../src/array/reorder.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,aAAa,GAAG,OAAO,GAAG,KAAK,GAAG,IAAI,GAAG,MAAM,CAAC;AAiB5D;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,GAAG,CAAC,EAAE,CAiBtG;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,EAAE,CAe7F"}

package/dist/auth/getClientFingerprint.d.ts

@@ -0,0 +1,2 @@
+export declare function getClientFingerprint(): Promise<string | null>;
+//# sourceMappingURL=getClientFingerprint.d.ts.map

package/dist/auth/getClientFingerprint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"getClientFingerprint.d.ts","sourceRoot":"","sources":["../../src/auth/getClientFingerprint.ts"],"names":[],"mappings":"AAIA,wBAAsB,oBAAoB,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CAgBnE"}

package/dist/binary/binaryToBlob.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Преобразует base64 или бинарную строку в Blob.
+ *
+ * Data URL с префиксом `data:*;base64,` поддерживается, сам URL здесь не создаётся.
+ */
+export declare const binaryToBlob: (binaryData: string, mimeType?: string, isBase64?: boolean) => Blob;
+/**
+ * Определяет MIME-тип по имени файла, data URL или сигнатуре base64-данных.
+ *
+ * Если определить тип не удалось, используется PDF: большинство документов в этом контуре приходят именно так.
+ */
+export declare const detectMimeType: (fileName?: string, binaryData?: string) => string;
+//# sourceMappingURL=binaryToBlob.d.ts.map

package/dist/binary/binaryToBlob.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"binaryToBlob.d.ts","sourceRoot":"","sources":["../../src/binary/binaryToBlob.ts"],"names":[],"mappings":"AAwKA;;;;GAIG;AACH,eAAO,MAAM,YAAY,GAAI,YAAY,MAAM,EAAE,WAAU,MAA+B,EAAE,kBAAe,KAAG,IAmB7G,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,cAAc,GAAI,WAAW,MAAM,EAAE,aAAa,MAAM,KAAG,MAwBvE,CAAC"}

package/dist/binary/index.d.ts

@@ -0,0 +1,3 @@
+export * from "./binaryToBlob";
+export * from "./useBinaryFile";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/binary/index.ts"],"names":[],"mappings":"AAAA,cAAc,gBAAgB,CAAC;AAC/B,cAAc,iBAAiB,CAAC"}

package/dist/binary/index.js

@@ -0,0 +1,126 @@
+import { logError as e } from "../utils/index.js";
+import { useEffect as t, useEffectEvent as n, useState as r } from "react";
+//#region src/binary/binaryToBlob.ts
+var i = "application/octet-stream", a = "application/pdf", o = /^data:([^,]*);base64,([\s\S]*)$/i, s = {
+	bmp: "image/bmp",
+	csv: "text/csv",
+	doc: "application/msword",
+	docx: "application/vnd.openxmlformats-officedocument.wordprocessingml.document",
+	gif: "image/gif",
+	jpeg: "image/jpeg",
+	jpg: "image/jpeg",
+	json: "application/json",
+	pdf: "application/pdf",
+	png: "image/png",
+	ppt: "application/vnd.ms-powerpoint",
+	pptx: "application/vnd.openxmlformats-officedocument.presentationml.presentation",
+	svg: "image/svg+xml",
+	tif: "image/tiff",
+	tiff: "image/tiff",
+	txt: "text/plain",
+	webp: "image/webp",
+	xls: "application/vnd.ms-excel",
+	xlsx: "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet",
+	xml: "application/xml",
+	zip: "application/zip"
+}, c = (e) => {
+	let t = e.replace(/\s/g, "").replace(/-/g, "+").replace(/_/g, "/"), n = t.length % 4;
+	if (n === 1 || !/^[A-Za-z0-9+/]*={0,2}$/.test(t)) throw Error("Некорректный формат base64");
+	return n === 0 ? t : `${t}${"=".repeat(4 - n)}`;
+}, l = (e) => {
+	let t = e.match(o);
+	if (!t) return {
+		data: e,
+		mimeType: null
+	};
+	let [, n, r] = t;
+	return {
+		data: r,
+		mimeType: n.split(";")[0].trim() || null
+	};
+}, u = (e) => {
+	let t = l(e);
+	return {
+		data: c(t.data),
+		mimeType: t.mimeType
+	};
+}, d = (e) => {
+	let t = e.match(o);
+	return t && t[1].split(";")[0].trim() || null;
+}, f = (e) => {
+	let { data: t } = u(e), n = atob(t), r = new Uint8Array(n.length);
+	for (let e = 0; e < n.length; e++) r[e] = n.charCodeAt(e);
+	return r;
+}, p = (e) => {
+	let t = new Uint8Array(e.length);
+	for (let n = 0; n < e.length; n++) t[n] = e.charCodeAt(n);
+	return t;
+}, m = (e) => {
+	let t = new ArrayBuffer(e.byteLength);
+	return new Uint8Array(t).set(e), t;
+}, h = (e) => {
+	try {
+		let { data: t } = l(e), n = t.slice(0, 128);
+		return atob(c(n));
+	} catch {
+		return null;
+	}
+}, g = (e) => {
+	let t = h(e);
+	if (!t) return null;
+	let n = new Uint8Array(t.length);
+	for (let e = 0; e < t.length; e++) n[e] = t.charCodeAt(e);
+	if (n[0] === 37 && n[1] === 80 && n[2] === 68 && n[3] === 70) return "application/pdf";
+	if (n[0] === 255 && n[1] === 216 && n[2] === 255) return "image/jpeg";
+	if (n[0] === 137 && n[1] === 80 && n[2] === 78 && n[3] === 71) return "image/png";
+	if (n[0] === 71 && n[1] === 73 && n[2] === 70) return "image/gif";
+	if (n[0] === 82 && n[1] === 73 && n[2] === 70 && n[3] === 70) return "image/webp";
+	if (n[0] === 80 && n[1] === 75) return "application/zip";
+	let r = t.replace(/^\uFEFF/, "").trimStart().slice(0, 16);
+	return r.startsWith("<?xml") || r.startsWith("<") ? "application/xml" : null;
+}, _ = (e, t = i, n = !0) => {
+	if (!e) throw Error("Не переданы бинарные данные");
+	try {
+		let r = n ? f(e) : p(e);
+		if (r.length === 0) throw Error("После преобразования не осталось данных");
+		return new Blob([m(r)], { type: t.trim() || i });
+	} catch (e) {
+		throw e instanceof Error ? e : Error("Некорректный формат бинарных данных");
+	}
+}, v = (e, t) => {
+	if (e) {
+		let t = e.toLowerCase().split(".").pop();
+		if (t && s[t]) return s[t];
+	}
+	if (t) {
+		let e = d(t);
+		if (e) return e;
+		let n = g(t);
+		if (n) return n;
+	}
+	return a;
+};
+//#endregion
+//#region src/binary/useBinaryFile.ts
+function y(i) {
+	let [a, o] = r(null), [s, c] = r(null), l = n((e) => o(e)), u = n((e) => c(e));
+	return t(() => {
+		if (i) try {
+			let e = v(void 0, i), t = _(i, e, !0);
+			l({
+				blob: t,
+				mime: e
+			}), u(null);
+		} catch (t) {
+			e(t), u(String(t)), l(null);
+		}
+		else l(null), u(null);
+	}, [i]), {
+		data: a,
+		error: s
+	};
+}
+//#endregion
+export { _ as binaryToBlob, v as detectMimeType, y as useBinaryFile };
+
+//# sourceMappingURL=index.js.map

package/dist/binary/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../src/binary/binaryToBlob.ts","../../src/binary/useBinaryFile.ts"],"sourcesContent":["const DEFAULT_BLOB_MIME_TYPE = \"application/octet-stream\";\nconst DEFAULT_DOCUMENT_MIME_TYPE = \"application/pdf\";\nconst BASE64_DATA_URL_PATTERN = /^data:([^,]*);base64,([\\s\\S]*)$/i;\n\nconst MIME_TYPE_BY_EXTENSION: Record<string, string> = {\n\tbmp: \"image/bmp\",\n\tcsv: \"text/csv\",\n\tdoc: \"application/msword\",\n\tdocx: \"application/vnd.openxmlformats-officedocument.wordprocessingml.document\",\n\tgif: \"image/gif\",\n\tjpeg: \"image/jpeg\",\n\tjpg: \"image/jpeg\",\n\tjson: \"application/json\",\n\tpdf: \"application/pdf\",\n\tpng: \"image/png\",\n\tppt: \"application/vnd.ms-powerpoint\",\n\tpptx: \"application/vnd.openxmlformats-officedocument.presentationml.presentation\",\n\tsvg: \"image/svg+xml\",\n\ttif: \"image/tiff\",\n\ttiff: \"image/tiff\",\n\ttxt: \"text/plain\",\n\twebp: \"image/webp\",\n\txls: \"application/vnd.ms-excel\",\n\txlsx: \"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet\",\n\txml: \"application/xml\",\n\tzip: \"application/zip\"\n};\n\nconst normalizeBase64 = (value: string): string => {\n\tconst normalized = value.replace(/\\s/g, \"\").replace(/-/g, \"+\").replace(/_/g, \"/\");\n\tconst paddingRest = normalized.length % 4;\n\n\tif (paddingRest === 1 || !/^[A-Za-z0-9+/]*={0,2}$/.test(normalized)) {\n\t\tthrow new Error(\"Некорректный формат base64\");\n\t}\n\n\treturn paddingRest === 0 ? normalized : `${normalized}${\"=\".repeat(4 - paddingRest)}`;\n};\n\nconst getBase64RawPayload = (binaryData: string): { data: string; mimeType: string | null } => {\n\tconst dataUrlMatch = binaryData.match(BASE64_DATA_URL_PATTERN);\n\n\tif (!dataUrlMatch) {\n\t\treturn { data: binaryData, mimeType: null };\n\t}\n\n\tconst [, rawMimeType, rawData] = dataUrlMatch;\n\tconst mimeType = rawMimeType.split(\";\")[0].trim();\n\n\treturn {\n\t\tdata: rawData,\n\t\tmimeType: mimeType || null\n\t};\n};\n\nconst getBase64Payload = (binaryData: string): { data: string; mimeType: string | null } => {\n\tconst payload = getBase64RawPayload(binaryData);\n\n\treturn {\n\t\tdata: normalizeBase64(payload.data),\n\t\tmimeType: payload.mimeType\n\t};\n};\n\nconst getDataUrlMimeType = (binaryData: string): string | null => {\n\tconst dataUrlMatch = binaryData.match(BASE64_DATA_URL_PATTERN);\n\n\tif (!dataUrlMatch) {\n\t\treturn null;\n\t}\n\n\tconst mimeType = dataUrlMatch[1].split(\";\")[0].trim();\n\n\treturn mimeType || null;\n};\n\nconst decodeBase64ToBytes = (binaryData: string): Uint8Array => {\n\tconst { data } = getBase64Payload(binaryData);\n\tconst binaryString = atob(data);\n\tconst byteArray = new Uint8Array(binaryString.length);\n\n\tfor (let index = 0; index < binaryString.length; index++) {\n\t\tbyteArray[index] = binaryString.charCodeAt(index);\n\t}\n\n\treturn byteArray;\n};\n\nconst binaryStringToBytes = (binaryData: string): Uint8Array => {\n\tconst byteArray = new Uint8Array(binaryData.length);\n\n\tfor (let index = 0; index < binaryData.length; index++) {\n\t\tbyteArray[index] = binaryData.charCodeAt(index);\n\t}\n\n\treturn byteArray;\n};\n\nconst copyBytesToArrayBuffer = (byteArray: Uint8Array): ArrayBuffer => {\n\tconst buffer = new ArrayBuffer(byteArray.byteLength);\n\tconst view = new Uint8Array(buffer);\n\n\tview.set(byteArray);\n\n\treturn buffer;\n};\n\nconst decodeHeaderFromBase64 = (binaryData: string): string | null => {\n\ttry {\n\t\tconst { data } = getBase64RawPayload(binaryData);\n\t\tconst headerData = data.slice(0, 128);\n\t\tconst binaryString = atob(normalizeBase64(headerData));\n\n\t\treturn binaryString;\n\t} catch {\n\t\treturn null;\n\t}\n};\n\nconst detectMimeTypeBySignature = (binaryData: string): string | null => {\n\tconst header = decodeHeaderFromBase64(binaryData);\n\n\tif (!header) {\n\t\treturn null;\n\t}\n\n\tconst bytes = new Uint8Array(header.length);\n\n\tfor (let index = 0; index < header.length; index++) {\n\t\tbytes[index] = header.charCodeAt(index);\n\t}\n\n\tif (bytes[0] === 0x25 && bytes[1] === 0x50 && bytes[2] === 0x44 && bytes[3] === 0x46) {\n\t\treturn \"application/pdf\";\n\t}\n\n\tif (bytes[0] === 0xff && bytes[1] === 0xd8 && bytes[2] === 0xff) {\n\t\treturn \"image/jpeg\";\n\t}\n\n\tif (bytes[0] === 0x89 && bytes[1] === 0x50 && bytes[2] === 0x4e && bytes[3] === 0x47) {\n\t\treturn \"image/png\";\n\t}\n\n\tif (bytes[0] === 0x47 && bytes[1] === 0x49 && bytes[2] === 0x46) {\n\t\treturn \"image/gif\";\n\t}\n\n\tif (bytes[0] === 0x52 && bytes[1] === 0x49 && bytes[2] === 0x46 && bytes[3] === 0x46) {\n\t\treturn \"image/webp\";\n\t}\n\n\tif (bytes[0] === 0x50 && bytes[1] === 0x4b) {\n\t\treturn \"application/zip\";\n\t}\n\n\tconst textHeader = header\n\t\t.replace(/^\\uFEFF/, \"\")\n\t\t.trimStart()\n\t\t.slice(0, 16);\n\n\tif (textHeader.startsWith(\"<?xml\") || textHeader.startsWith(\"<\")) {\n\t\treturn \"application/xml\";\n\t}\n\n\treturn null;\n};\n\n/**\n * Преобразует base64 или бинарную строку в Blob.\n *\n * Data URL с префиксом `data:*;base64,` поддерживается, сам URL здесь не создаётся.\n */\nexport const binaryToBlob = (binaryData: string, mimeType: string = DEFAULT_BLOB_MIME_TYPE, isBase64 = true): Blob => {\n\tif (!binaryData) {\n\t\tthrow new Error(\"Не переданы бинарные данные\");\n\t}\n\n\ttry {\n\t\tconst byteArray = isBase64 ? decodeBase64ToBytes(binaryData) : binaryStringToBytes(binaryData);\n\n\t\tif (byteArray.length === 0) {\n\t\t\tthrow new Error(\"После преобразования не осталось данных\");\n\t\t}\n\n\t\treturn new Blob([copyBytesToArrayBuffer(byteArray)], { type: mimeType.trim() || DEFAULT_BLOB_MIME_TYPE });\n\t} catch (error) {\n\t\tif (error instanceof Error) {\n\t\t\tthrow error;\n\t\t}\n\t\tthrow new Error(\"Некорректный формат бинарных данных\");\n\t}\n};\n\n/**\n * Определяет MIME-тип по имени файла, data URL или сигнатуре base64-данных.\n *\n * Если определить тип не удалось, используется PDF: большинство документов в этом контуре приходят именно так.\n */\nexport const detectMimeType = (fileName?: string, binaryData?: string): string => {\n\tif (fileName) {\n\t\tconst extension = fileName.toLowerCase().split(\".\").pop();\n\n\t\tif (extension && MIME_TYPE_BY_EXTENSION[extension]) {\n\t\t\treturn MIME_TYPE_BY_EXTENSION[extension];\n\t\t}\n\t}\n\n\tif (binaryData) {\n\t\tconst dataUrlMimeType = getDataUrlMimeType(binaryData);\n\n\t\tif (dataUrlMimeType) {\n\t\t\treturn dataUrlMimeType;\n\t\t}\n\n\t\tconst signatureMimeType = detectMimeTypeBySignature(binaryData);\n\n\t\tif (signatureMimeType) {\n\t\t\treturn signatureMimeType;\n\t\t}\n\t}\n\n\treturn DEFAULT_DOCUMENT_MIME_TYPE;\n};\n","import { useEffect, useEffectEvent, useState } from \"react\";\n\nimport { logError } from \"../utils\";\n\nimport { binaryToBlob, detectMimeType } from \"./binaryToBlob\";\n\nexport function useBinaryFile(bin: string | undefined) {\n\tconst [entry, setEntry] = useState<{ blob: Blob; mime: string } | null>(null);\n\tconst [error, setError] = useState<string | null>(null);\n\n\tconst updateEntry = useEffectEvent((data: { blob: Blob; mime: string } | null) => setEntry(data));\n\tconst updateError = useEffectEvent((error: string | null) => setError(error));\n\n\tuseEffect(() => {\n\t\tif (bin) {\n\t\t\ttry {\n\t\t\t\tconst mime = detectMimeType(undefined, bin);\n\t\t\t\tconst blob = binaryToBlob(bin, mime, true);\n\n\t\t\t\tupdateEntry({ blob, mime });\n\t\t\t\tupdateError(null);\n\t\t\t} catch (e) {\n\t\t\t\tlogError(e);\n\n\t\t\t\tupdateError(String(e));\n\t\t\t\tupdateEntry(null);\n\t\t\t}\n\t\t} else {\n\t\t\tupdateEntry(null);\n\t\t\tupdateError(null);\n\t\t}\n\t}, [bin]);\n\n\treturn { data: entry, error };\n}\n"],"mappings":";;;AAAA,IAAM,IAAyB,4BACzB,IAA6B,mBAC7B,IAA0B,oCAE1B,IAAiD;CACtD,KAAK;CACL,KAAK;CACL,KAAK;CACL,MAAM;CACN,KAAK;CACL,MAAM;CACN,KAAK;CACL,MAAM;CACN,KAAK;CACL,KAAK;CACL,KAAK;CACL,MAAM;CACN,KAAK;CACL,KAAK;CACL,MAAM;CACN,KAAK;CACL,MAAM;CACN,KAAK;CACL,MAAM;CACN,KAAK;CACL,KAAK;AACN,GAEM,KAAmB,MAA0B;CAClD,IAAM,IAAa,EAAM,QAAQ,OAAO,EAAE,CAAC,CAAC,QAAQ,MAAM,GAAG,CAAC,CAAC,QAAQ,MAAM,GAAG,GAC1E,IAAc,EAAW,SAAS;CAExC,IAAI,MAAgB,KAAK,CAAC,yBAAyB,KAAK,CAAU,GACjE,MAAU,MAAM,4BAA4B;CAG7C,OAAO,MAAgB,IAAI,IAAa,GAAG,IAAa,IAAI,OAAO,IAAI,CAAW;AACnF,GAEM,KAAuB,MAAkE;CAC9F,IAAM,IAAe,EAAW,MAAM,CAAuB;CAE7D,IAAI,CAAC,GACJ,OAAO;EAAE,MAAM;EAAY,UAAU;CAAK;CAG3C,IAAM,GAAG,GAAa,KAAW;CAGjC,OAAO;EACN,MAAM;EACN,UAJgB,EAAY,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,KAIhC,KAAY;CACvB;AACD,GAEM,KAAoB,MAAkE;CAC3F,IAAM,IAAU,EAAoB,CAAU;CAE9C,OAAO;EACN,MAAM,EAAgB,EAAQ,IAAI;EAClC,UAAU,EAAQ;CACnB;AACD,GAEM,KAAsB,MAAsC;CACjE,IAAM,IAAe,EAAW,MAAM,CAAuB;CAQ7D,OANK,KAIY,EAAa,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,KAExC,KALC;AAMT,GAEM,KAAuB,MAAmC;CAC/D,IAAM,EAAE,YAAS,EAAiB,CAAU,GACtC,IAAe,KAAK,CAAI,GACxB,IAAY,IAAI,WAAW,EAAa,MAAM;CAEpD,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAa,QAAQ,KAChD,EAAU,KAAS,EAAa,WAAW,CAAK;CAGjD,OAAO;AACR,GAEM,KAAuB,MAAmC;CAC/D,IAAM,IAAY,IAAI,WAAW,EAAW,MAAM;CAElD,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAW,QAAQ,KAC9C,EAAU,KAAS,EAAW,WAAW,CAAK;CAG/C,OAAO;AACR,GAEM,KAA0B,MAAuC;CACtE,IAAM,IAAS,IAAI,YAAY,EAAU,UAAU;CAKnD,OAFA,IAFiB,WAAW,CAE5B,CAAA,CAAK,IAAI,CAAS,GAEX;AACR,GAEM,KAA0B,MAAsC;CACrE,IAAI;EACH,IAAM,EAAE,YAAS,EAAoB,CAAU,GACzC,IAAa,EAAK,MAAM,GAAG,GAAG;EAGpC,OAFqB,KAAK,EAAgB,CAAU,CAE7C;CACR,QAAQ;EACP,OAAO;CACR;AACD,GAEM,KAA6B,MAAsC;CACxE,IAAM,IAAS,EAAuB,CAAU;CAEhD,IAAI,CAAC,GACJ,OAAO;CAGR,IAAM,IAAQ,IAAI,WAAW,EAAO,MAAM;CAE1C,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAO,QAAQ,KAC1C,EAAM,KAAS,EAAO,WAAW,CAAK;CAGvC,IAAI,EAAM,OAAO,MAAQ,EAAM,OAAO,MAAQ,EAAM,OAAO,MAAQ,EAAM,OAAO,IAC/E,OAAO;CAGR,IAAI,EAAM,OAAO,OAAQ,EAAM,OAAO,OAAQ,EAAM,OAAO,KAC1D,OAAO;CAGR,IAAI,EAAM,OAAO,OAAQ,EAAM,OAAO,MAAQ,EAAM,OAAO,MAAQ,EAAM,OAAO,IAC/E,OAAO;CAGR,IAAI,EAAM,OAAO,MAAQ,EAAM,OAAO,MAAQ,EAAM,OAAO,IAC1D,OAAO;CAGR,IAAI,EAAM,OAAO,MAAQ,EAAM,OAAO,MAAQ,EAAM,OAAO,MAAQ,EAAM,OAAO,IAC/E,OAAO;CAGR,IAAI,EAAM,OAAO,MAAQ,EAAM,OAAO,IACrC,OAAO;CAGR,IAAM,IAAa,EACjB,QAAQ,WAAW,EAAE,CAAC,CACtB,UAAU,CAAC,CACX,MAAM,GAAG,EAAE;CAMb,OAJI,EAAW,WAAW,OAAO,KAAK,EAAW,WAAW,GAAG,IACvD,oBAGD;AACR,GAOa,KAAgB,GAAoB,IAAmB,GAAwB,IAAW,OAAe;CACrH,IAAI,CAAC,GACJ,MAAU,MAAM,6BAA6B;CAG9C,IAAI;EACH,IAAM,IAAY,IAAW,EAAoB,CAAU,IAAI,EAAoB,CAAU;EAE7F,IAAI,EAAU,WAAW,GACxB,MAAU,MAAM,yCAAyC;EAG1D,OAAO,IAAI,KAAK,CAAC,EAAuB,CAAS,CAAC,GAAG,EAAE,MAAM,EAAS,KAAK,KAAK,EAAuB,CAAC;CACzG,SAAS,GAAO;EAIf,MAHI,aAAiB,QACd,IAEG,MAAM,qCAAqC;CACtD;AACD,GAOa,KAAkB,GAAmB,MAAgC;CACjF,IAAI,GAAU;EACb,IAAM,IAAY,EAAS,YAAY,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI;EAExD,IAAI,KAAa,EAAuB,IACvC,OAAO,EAAuB;CAEhC;CAEA,IAAI,GAAY;EACf,IAAM,IAAkB,EAAmB,CAAU;EAErD,IAAI,GACH,OAAO;EAGR,IAAM,IAAoB,EAA0B,CAAU;EAE9D,IAAI,GACH,OAAO;CAET;CAEA,OAAO;AACR;;;ACzNA,SAAgB,EAAc,GAAyB;CACtD,IAAM,CAAC,GAAO,KAAY,EAA8C,IAAI,GACtE,CAAC,GAAO,KAAY,EAAwB,IAAI,GAEhD,IAAc,GAAgB,MAA8C,EAAS,CAAI,CAAC,GAC1F,IAAc,GAAgB,MAAyB,EAAS,CAAK,CAAC;CAsB5E,OApBA,QAAgB;EACf,IAAI,GACH,IAAI;GACH,IAAM,IAAO,EAAe,KAAA,GAAW,CAAG,GACpC,IAAO,EAAa,GAAK,GAAM,EAAI;GAGzC,AADA,EAAY;IAAE;IAAM;GAAK,CAAC,GAC1B,EAAY,IAAI;EACjB,SAAS,GAAG;GAIX,AAHA,EAAS,CAAC,GAEV,EAAY,OAAO,CAAC,CAAC,GACrB,EAAY,IAAI;EACjB;OAGA,AADA,EAAY,IAAI,GAChB,EAAY,IAAI;CAElB,GAAG,CAAC,CAAG,CAAC,GAED;EAAE,MAAM;EAAO;CAAM;AAC7B"}

package/dist/binary/useBinaryFile.d.ts

@@ -0,0 +1,8 @@
+export declare function useBinaryFile(bin: string | undefined): {
+    data: {
+        blob: Blob;
+        mime: string;
+    } | null;
+    error: string | null;
+};
+//# sourceMappingURL=useBinaryFile.d.ts.map

package/dist/binary/useBinaryFile.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"useBinaryFile.d.ts","sourceRoot":"","sources":["../../src/binary/useBinaryFile.ts"],"names":[],"mappings":"AAMA,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS;;cACT,IAAI;cAAQ,MAAM;;;EA2B7D"}

package/dist/bounded-copy-stack/boundedCopyStack.d.ts

@@ -0,0 +1,26 @@
+export declare const DEFAULT_BOUNDED_COPY_STACK_SIZE = 3;
+export type BoundedCopyStackItem<TPayload, TMeta = undefined> = {
+    id: string;
+    fingerprint: string;
+    payload: TPayload;
+    meta: TMeta;
+    copiedAt: number;
+};
+export type BoundedCopyStackPushInput<TPayload, TMeta = undefined> = {
+    id: string;
+    fingerprint: string;
+    payload: TPayload;
+    meta: TMeta;
+    copiedAt?: number;
+};
+export type BoundedCopyStackOptions = {
+    maxSize?: number;
+};
+export type BoundedCopyStackPushResult<TPayload, TMeta = undefined> = {
+    items: BoundedCopyStackItem<TPayload, TMeta>[];
+    addedItem: BoundedCopyStackItem<TPayload, TMeta>;
+    updatedExisting: boolean;
+};
+export declare function pushBoundedCopyStackItem<TPayload, TMeta = undefined>(items: readonly BoundedCopyStackItem<TPayload, TMeta>[], input: BoundedCopyStackPushInput<TPayload, TMeta>, options?: BoundedCopyStackOptions): BoundedCopyStackPushResult<TPayload, TMeta>;
+export declare function getBoundedCopyStackCandidates<TPayload, TMeta = undefined>(items: readonly BoundedCopyStackItem<TPayload, TMeta>[], predicate: (item: BoundedCopyStackItem<TPayload, TMeta>) => boolean): BoundedCopyStackItem<TPayload, TMeta>[];
+//# sourceMappingURL=boundedCopyStack.d.ts.map

package/dist/bounded-copy-stack/boundedCopyStack.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"boundedCopyStack.d.ts","sourceRoot":"","sources":["../../src/bounded-copy-stack/boundedCopyStack.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,+BAA+B,IAAI,CAAC;AAEjD,MAAM,MAAM,oBAAoB,CAAC,QAAQ,EAAE,KAAK,GAAG,SAAS,IAAI;IAC/D,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,QAAQ,CAAC;IAClB,IAAI,EAAE,KAAK,CAAC;IACZ,QAAQ,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF,MAAM,MAAM,yBAAyB,CAAC,QAAQ,EAAE,KAAK,GAAG,SAAS,IAAI;IACpE,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,QAAQ,CAAC;IAClB,IAAI,EAAE,KAAK,CAAC;IACZ,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB,CAAC;AAEF,MAAM,MAAM,uBAAuB,GAAG;IACrC,OAAO,CAAC,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF,MAAM,MAAM,0BAA0B,CAAC,QAAQ,EAAE,KAAK,GAAG,SAAS,IAAI;IACrE,KAAK,EAAE,oBAAoB,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;IAC/C,SAAS,EAAE,oBAAoB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACjD,eAAe,EAAE,OAAO,CAAC;CACzB,CAAC;AAOF,wBAAgB,wBAAwB,CAAC,QAAQ,EAAE,KAAK,GAAG,SAAS,EACnE,KAAK,EAAE,SAAS,oBAAoB,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,EACvD,KAAK,EAAE,yBAAyB,CAAC,QAAQ,EAAE,KAAK,CAAC,EACjD,OAAO,GAAE,uBAA4B,GACnC,0BAA0B,CAAC,QAAQ,EAAE,KAAK,CAAC,CAkB7C;AAED,wBAAgB,6BAA6B,CAAC,QAAQ,EAAE,KAAK,GAAG,SAAS,EACxE,KAAK,EAAE,SAAS,oBAAoB,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,EACvD,SAAS,EAAE,CAAC,IAAI,EAAE,oBAAoB,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,OAAO,GACjE,oBAAoB,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAEzC"}

package/dist/bounded-copy-stack/index.d.ts

@@ -0,0 +1,2 @@
+export * from "./boundedCopyStack";
+//# sourceMappingURL=index.d.ts.map

package/dist/bounded-copy-stack/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/bounded-copy-stack/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAC"}

package/dist/bounded-copy-stack/index.js

@@ -0,0 +1,26 @@
+//#region src/bounded-copy-stack/boundedCopyStack.ts
+var e = 3;
+function t(e) {
+	return Number.isFinite(e) ? Math.max(1, Math.trunc(e ?? 3)) : 3;
+}
+function n(e, n, r = {}) {
+	let i = n.copiedAt ?? Date.now(), a = {
+		id: n.id,
+		fingerprint: n.fingerprint,
+		payload: n.payload,
+		meta: n.meta,
+		copiedAt: i
+	}, o = e.findIndex((e) => e.fingerprint === n.fingerprint), s = o >= 0 ? e.filter((e) => e.fingerprint !== n.fingerprint) : e, c = t(r.maxSize);
+	return {
+		items: [a, ...s].slice(0, c),
+		addedItem: a,
+		updatedExisting: o >= 0
+	};
+}
+function r(e, t) {
+	return e.filter(t);
+}
+//#endregion
+export { e as DEFAULT_BOUNDED_COPY_STACK_SIZE, r as getBoundedCopyStackCandidates, n as pushBoundedCopyStackItem };
+
+//# sourceMappingURL=index.js.map

package/dist/bounded-copy-stack/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../src/bounded-copy-stack/boundedCopyStack.ts"],"sourcesContent":["export const DEFAULT_BOUNDED_COPY_STACK_SIZE = 3;\n\nexport type BoundedCopyStackItem<TPayload, TMeta = undefined> = {\n\tid: string;\n\tfingerprint: string;\n\tpayload: TPayload;\n\tmeta: TMeta;\n\tcopiedAt: number;\n};\n\nexport type BoundedCopyStackPushInput<TPayload, TMeta = undefined> = {\n\tid: string;\n\tfingerprint: string;\n\tpayload: TPayload;\n\tmeta: TMeta;\n\tcopiedAt?: number;\n};\n\nexport type BoundedCopyStackOptions = {\n\tmaxSize?: number;\n};\n\nexport type BoundedCopyStackPushResult<TPayload, TMeta = undefined> = {\n\titems: BoundedCopyStackItem<TPayload, TMeta>[];\n\taddedItem: BoundedCopyStackItem<TPayload, TMeta>;\n\tupdatedExisting: boolean;\n};\n\nfunction normalizeMaxSize(value: number | undefined): number {\n\tif (!Number.isFinite(value)) return DEFAULT_BOUNDED_COPY_STACK_SIZE;\n\treturn Math.max(1, Math.trunc(value ?? DEFAULT_BOUNDED_COPY_STACK_SIZE));\n}\n\nexport function pushBoundedCopyStackItem<TPayload, TMeta = undefined>(\n\titems: readonly BoundedCopyStackItem<TPayload, TMeta>[],\n\tinput: BoundedCopyStackPushInput<TPayload, TMeta>,\n\toptions: BoundedCopyStackOptions = {}\n): BoundedCopyStackPushResult<TPayload, TMeta> {\n\tconst copiedAt = input.copiedAt ?? Date.now();\n\tconst nextItem: BoundedCopyStackItem<TPayload, TMeta> = {\n\t\tid: input.id,\n\t\tfingerprint: input.fingerprint,\n\t\tpayload: input.payload,\n\t\tmeta: input.meta,\n\t\tcopiedAt\n\t};\n\tconst existingIndex = items.findIndex((item) => item.fingerprint === input.fingerprint);\n\tconst withoutDuplicate = existingIndex >= 0 ? items.filter((item) => item.fingerprint !== input.fingerprint) : items;\n\tconst maxSize = normalizeMaxSize(options.maxSize);\n\n\treturn {\n\t\titems: [nextItem, ...withoutDuplicate].slice(0, maxSize),\n\t\taddedItem: nextItem,\n\t\tupdatedExisting: existingIndex >= 0\n\t};\n}\n\nexport function getBoundedCopyStackCandidates<TPayload, TMeta = undefined>(\n\titems: readonly BoundedCopyStackItem<TPayload, TMeta>[],\n\tpredicate: (item: BoundedCopyStackItem<TPayload, TMeta>) => boolean\n): BoundedCopyStackItem<TPayload, TMeta>[] {\n\treturn items.filter(predicate);\n}\n"],"mappings":";AAAA,IAAa,IAAkC;AA4B/C,SAAS,EAAiB,GAAmC;CAE5D,OADK,OAAO,SAAS,CAAK,IACnB,KAAK,IAAI,GAAG,KAAK,MAAM,KAAA,CAAwC,CAAC,IAD1C;AAE9B;AAEA,SAAgB,EACf,GACA,GACA,IAAmC,CAAC,GACU;CAC9C,IAAM,IAAW,EAAM,YAAY,KAAK,IAAI,GACtC,IAAkD;EACvD,IAAI,EAAM;EACV,aAAa,EAAM;EACnB,SAAS,EAAM;EACf,MAAM,EAAM;EACZ;CACD,GACM,IAAgB,EAAM,WAAW,MAAS,EAAK,gBAAgB,EAAM,WAAW,GAChF,IAAmB,KAAiB,IAAI,EAAM,QAAQ,MAAS,EAAK,gBAAgB,EAAM,WAAW,IAAI,GACzG,IAAU,EAAiB,EAAQ,OAAO;CAEhD,OAAO;EACN,OAAO,CAAC,GAAU,GAAG,CAAgB,CAAC,CAAC,MAAM,GAAG,CAAO;EACvD,WAAW;EACX,iBAAiB,KAAiB;CACnC;AACD;AAEA,SAAgB,EACf,GACA,GAC0C;CAC1C,OAAO,EAAM,OAAO,CAAS;AAC9B"}

package/dist/chunks/array-BBSjoTRy.js

@@ -0,0 +1,146 @@
+//#region src/formatters/strings/normalizeText.ts
+function e(e) {
+	if (typeof e != "string") return;
+	let t = e.trim();
+	return t.length > 0 ? t : void 0;
+}
+function t(t, n = "") {
+	return e(t) ?? n;
+}
+function n(e) {
+	return t(e);
+}
+function r(t) {
+	let n = e(t);
+	return n ? n.toLowerCase() : "";
+}
+function i(e) {
+	return e == null ? "" : String(e);
+}
+var a = /[\s\u00a0\u202f]+/gu;
+function o(e) {
+	return n(e).replace(a, " ");
+}
+//#endregion
+//#region src/array/array.ts
+function s(e, t) {
+	return e.reduce((e, n) => {
+		let r = String(n[t]);
+		return (e[r] ||= []).push(n), e;
+	}, {});
+}
+function c(e, t) {
+	return e.reduce((e, n) => {
+		let r = String(n[t]);
+		return e[r] || (e[r] = n), e;
+	}, {});
+}
+function l(e, t) {
+	let n = e.reduce((e, n) => {
+		let r = String(n[t]);
+		return (e[r] ||= []).push(n), e;
+	}, {});
+	return Object.entries(n).map(([e, t]) => ({
+		key: e,
+		items: t
+	}));
+}
+function u(e, t) {
+	let n = /* @__PURE__ */ new Set();
+	return e.filter((e) => {
+		let r = String(e[t]);
+		return n.has(r) ? !1 : (n.add(r), !0);
+	});
+}
+function d(e) {
+	let t = [], n = /* @__PURE__ */ new Set();
+	for (let r of e) n.has(r) || (n.add(r), t.push(r));
+	return t;
+}
+function f(e, t) {
+	let n = new Map(t.map((e) => [e, e])), r = [], i = /* @__PURE__ */ new Set();
+	for (let t of e ?? []) {
+		if (!t || i.has(t)) continue;
+		let e = n.get(t);
+		e && (i.add(t), r.push(e));
+	}
+	return r;
+}
+function p(e, t) {
+	let n = [...e], r = new Set(e);
+	for (let e of t) !e || r.has(e) || (r.add(e), n.push(e));
+	return n;
+}
+function m(e, t) {
+	let n = [];
+	for (let r of e) {
+		let e = t.get(r);
+		e !== void 0 && n.push(e);
+	}
+	return n;
+}
+function h(e, t) {
+	if (e.length !== t.length) return !1;
+	for (let n = 0; n < e.length; n++) if (e[n] !== t[n]) return !1;
+	return !0;
+}
+function g(e, t, n) {
+	if (t === n || t < 0 || n < 0 || t >= e.length || n >= e.length) return [...e];
+	let r = [...e], [i] = r.splice(t, 1);
+	return i === void 0 ? [...e] : (r.splice(n, 0, i), r);
+}
+function _(t, n, r) {
+	if (!t) return;
+	let i = [], a = /* @__PURE__ */ new Set(), o = typeof r == "boolean" && r === !1 ? (e) => e : typeof r == "function" ? r : (e) => ({ ...e });
+	for (let r of t) {
+		let t = e(r[n]);
+		!t || a.has(t) || (a.add(t), i.push(o(r, t)));
+	}
+	return i.length ? i : void 0;
+}
+function v(e) {
+	if (!e?.length) return;
+	let t = [], n = /* @__PURE__ */ new Set();
+	for (let r of e) {
+		let e = r.trim();
+		!e || n.has(e) || (n.add(e), t.push(e));
+	}
+	return t.length ? t : void 0;
+}
+function y(e, t, n) {
+	let r = n?.trim();
+	!r || t.has(r) || (t.add(r), e.push(r));
+}
+//#endregion
+//#region src/array/reorder.ts
+function b(e) {
+	let { index: t, size: n, action: r } = e;
+	switch (r) {
+		case "start": return 0;
+		case "end": return n - 1;
+		case "up": return t - 1;
+		case "down": return t + 1;
+	}
+}
+function x(e, t, n) {
+	let r = [...e];
+	if (t < 0 || t >= r.length) return r;
+	let i = b({
+		index: t,
+		size: r.length,
+		action: n
+	});
+	if (i < 0 || i >= r.length || i === t) return r;
+	let [a] = r.splice(t, 1);
+	return a === void 0 || r.splice(i, 0, a), r;
+}
+function S(e, t, n) {
+	let r = [...e];
+	if (t < 0 || t >= r.length || n < 0 || n >= r.length || t === n) return r;
+	let [i] = r.splice(t, 1);
+	return i === void 0 || r.splice(n, 0, i), r;
+}
+//#endregion
+export { e as _, d as a, t as b, c, f as d, g as f, n as g, m as h, p as i, u as l, v as m, x as n, s as o, _ as p, y as r, l as s, S as t, h as u, o as v, i as x, r as y };
+
+//# sourceMappingURL=array-BBSjoTRy.js.map

package/dist/chunks/array-BBSjoTRy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-BBSjoTRy.js","names":[],"sources":["../../src/formatters/strings/normalizeText.ts","../../src/array/array.ts","../../src/array/reorder.ts"],"sourcesContent":["export function normalizeText(value: unknown): string | undefined {\n\tif (typeof value !== \"string\") return undefined;\n\n\tconst normalized = value.trim();\n\treturn normalized.length > 0 ? normalized : undefined;\n}\n\nexport function normalizeTextWithFallback(value: unknown, fallback = \"\") {\n\treturn normalizeText(value) ?? fallback;\n}\n\nexport function normalizeRequiredText(value: unknown) {\n\treturn normalizeTextWithFallback(value);\n}\n\nexport function normalizeTextToLower(value: unknown): string {\n\tconst normalized = normalizeText(value);\n\treturn normalized ? normalized.toLowerCase() : \"\";\n}\n\nexport function toSafeString(value: unknown): string {\n\treturn value == null ? \"\" : String(value);\n}\n\nconst STRING_SPACES_PATTERN = /[\\s\\u00a0\\u202f]+/gu;\n\n/**\n * Нормализует пользовательский текст: убирает пробелы по краям\n * и сворачивает любые подряд идущие пробельные символы в один обычный пробел.\n */\nexport function normalizeTextSpaces(value: unknown): string {\n\treturn normalizeRequiredText(value).replace(STRING_SPACES_PATTERN, \" \");\n}\n","import { normalizeText } from \"../formatters/strings\";\n\nexport function arrayGroupBy<T>(array: readonly T[], key: keyof T): Record<string, T[]> {\n\treturn array.reduce<Record<string, T[]>>((acc, item) => {\n\t\tconst groupKey = String(item[key]);\n\t\t(acc[groupKey] ||= []).push(item);\n\t\treturn acc;\n\t}, {});\n}\n\nexport function arrayToMap<T>(array: readonly T[], key: keyof T): Record<string, T> {\n\treturn array.reduce<Record<string, T>>((acc, item) => {\n\t\tconst groupKey = String(item[key]);\n\t\tif (!acc[groupKey]) {\n\t\t\tacc[groupKey] = item;\n\t\t}\n\t\treturn acc;\n\t}, {});\n}\n\nexport function arrayGroupByToArray<T>(array: readonly T[], key: keyof T): Array<{ key: string; items: T[] }> {\n\tconst grouped = array.reduce<Record<string, T[]>>((acc, item) => {\n\t\tconst groupKey = String(item[key]);\n\t\t(acc[groupKey] ||= []).push(item);\n\t\treturn acc;\n\t}, {});\n\n\treturn Object.entries(grouped).map(([key, items]) => ({\n\t\tkey,\n\t\titems\n\t}));\n}\n\nexport function arrayUniqueBy<T>(array: readonly T[], key: keyof T): T[] {\n\tconst seen = new Set<string>();\n\treturn array.filter((item) => {\n\t\tconst value = String(item[key]);\n\t\tif (seen.has(value)) return false;\n\t\tseen.add(value);\n\t\treturn true;\n\t});\n}\n\n/**\n * Удаляет дубликаты из массива с сохранением первого вхождения.\n *\n * Нужна для нормализации списков примитивных значений перед передачей\n * в кеш-ключи, SQL-запросы и другие слои, где повторные элементы не несут смысла.\n */\nexport function arrayDeduplicate<T>(array: readonly T[]): T[] {\n\tconst out: T[] = [];\n\tconst seen = new Set<T>();\n\n\tfor (const item of array) {\n\t\tif (seen.has(item)) continue;\n\n\t\tseen.add(item);\n\t\tout.push(item);\n\t}\n\n\treturn out;\n}\n\n/**\n * Фильтрует массив идентификаторов: оставляет только присутствующие в `allowedIds`,\n * удаляет дубликаты, исключает пустые строки.\n *\n * Зачем: унификация нормализации пользовательских списков ID\n * (grouped columns, locked visible columns и т.п.) перед вычислением layout.\n */\nexport function filterAndDeduplicateIds<TId extends string>(ids: readonly string[] | undefined, allowedIds: readonly TId[]): TId[] {\n\tconst known = new Map<string, TId>(allowedIds.map((id) => [id, id]));\n\tconst out: TId[] = [];\n\tconst seen = new Set<string>();\n\n\tfor (const id of ids ?? []) {\n\t\tif (!id || seen.has(id)) continue;\n\t\tconst knownId = known.get(id);\n\t\tif (!knownId) continue;\n\t\tseen.add(id);\n\t\tout.push(knownId);\n\t}\n\n\treturn out;\n}\n\nexport function appendMissingIds<TId extends string>(baseIds: readonly TId[], idsToAppend: readonly TId[]): TId[] {\n\tconst out = [...baseIds];\n\tconst seen = new Set(baseIds);\n\n\tfor (const id of idsToAppend) {\n\t\tif (!id || seen.has(id)) continue;\n\t\tseen.add(id);\n\t\tout.push(id);\n\t}\n\n\treturn out;\n}\n\nexport function pickExistingMapValues<TKey, TValue>(keys: readonly TKey[], valuesByKey: ReadonlyMap<TKey, TValue>): TValue[] {\n\tconst out: TValue[] = [];\n\n\tfor (const key of keys) {\n\t\tconst value = valuesByKey.get(key);\n\n\t\tif (value !== undefined) {\n\t\t\tout.push(value);\n\t\t}\n\t}\n\n\treturn out;\n}\n\nexport function arraysEqual<T>(left: readonly T[], right: readonly T[]): boolean {\n\tif (left.length !== right.length) return false;\n\n\tfor (let index = 0; index < left.length; index++) {\n\t\tif (left[index] !== right[index]) return false;\n\t}\n\n\treturn true;\n}\n\nexport function moveItem<T>(items: readonly T[], from: number, to: number): T[] {\n\tif (from === to) return [...items];\n\tif (from < 0 || to < 0 || from >= items.length || to >= items.length) return [...items];\n\n\tconst next = [...items];\n\tconst [item] = next.splice(from, 1);\n\tif (item === undefined) return [...items];\n\tnext.splice(to, 0, item);\n\n\treturn next;\n}\n\nexport function normalizeObjects<T, K extends keyof T, O = T>(\n\titems: readonly T[] | undefined,\n\tkey: K,\n\tcopyist?: ((item: T, key: T[K]) => O) | false\n): O[] | undefined {\n\tif (!items) return undefined;\n\n\tconst out: O[] = [];\n\tconst seen = new Set<T[K]>();\n\tconst copyFn = (() => {\n\t\tif (typeof copyist === \"boolean\" && copyist === false) {\n\t\t\treturn (item: T): O => item as unknown as O;\n\t\t}\n\t\tif (typeof copyist === \"function\") {\n\t\t\treturn copyist;\n\t\t}\n\t\treturn (item: T): O => ({ ...item }) as unknown as O;\n\t})();\n\n\tfor (const item of items) {\n\t\tconst normalizedKey = normalizeText(item[key]) as T[K];\n\t\tif (!normalizedKey || seen.has(normalizedKey)) continue;\n\t\tseen.add(normalizedKey);\n\t\tout.push(copyFn(item, normalizedKey));\n\t}\n\n\treturn out.length ? out : undefined;\n}\n\nexport function normalizeStringArray(items: readonly string[] | undefined): string[] | undefined {\n\tif (!items?.length) return undefined;\n\n\tconst out: string[] = [];\n\tconst seen = new Set<string>();\n\n\tfor (const item of items) {\n\t\tconst value = item.trim();\n\t\tif (!value || seen.has(value)) continue;\n\n\t\tseen.add(value);\n\t\tout.push(value);\n\t}\n\n\treturn out.length ? out : undefined;\n}\n\nexport function addUnique(target: string[], seen: Set<string>, fieldId: string | undefined): void {\n\tconst normalizedId = fieldId?.trim();\n\tif (!normalizedId || seen.has(normalizedId)) return;\n\tseen.add(normalizedId);\n\ttarget.push(normalizedId);\n}\n","export type ReorderAction = \"start\" | \"end\" | \"up\" | \"down\";\n\nfunction resolveTargetIndex(args: { index: number; size: number; action: ReorderAction }): number {\n\tconst { index, size, action } = args;\n\n\tswitch (action) {\n\t\tcase \"start\":\n\t\t\treturn 0;\n\t\tcase \"end\":\n\t\t\treturn size - 1;\n\t\tcase \"up\":\n\t\t\treturn index - 1;\n\t\tcase \"down\":\n\t\t\treturn index + 1;\n\t}\n}\n\n/**\n * Перемещает элемент списка по одному из предопределённых действий.\n */\nexport function moveArrayItemByIndex<T>(items: readonly T[], index: number, action: ReorderAction): T[] {\n\tconst nextItems = [...items];\n\tif (index < 0 || index >= nextItems.length) return nextItems;\n\n\tconst targetIndex = resolveTargetIndex({\n\t\tindex,\n\t\tsize: nextItems.length,\n\t\taction\n\t});\n\tif (targetIndex < 0 || targetIndex >= nextItems.length || targetIndex === index) return nextItems;\n\n\tconst [item] = nextItems.splice(index, 1);\n\n\tif (item === undefined) return nextItems;\n\n\tnextItems.splice(targetIndex, 0, item);\n\treturn nextItems;\n}\n\n/**\n * Перемещает элемент списка из одного индекса в другой.\n */\nexport function moveArrayItem<T>(items: readonly T[], fromIndex: number, toIndex: number): T[] {\n\tconst nextItems = [...items];\n\n\tif (fromIndex < 0 || fromIndex >= nextItems.length || toIndex < 0 || toIndex >= nextItems.length || fromIndex === toIndex) {\n\t\treturn nextItems;\n\t}\n\n\tconst [item] = nextItems.splice(fromIndex, 1);\n\n\tif (item === undefined) {\n\t\treturn nextItems;\n\t}\n\n\tnextItems.splice(toIndex, 0, item);\n\treturn nextItems;\n}\n"],"mappings":";AAAA,SAAgB,EAAc,GAAoC;CACjE,IAAI,OAAO,KAAU,UAAU;CAE/B,IAAM,IAAa,EAAM,KAAK;CAC9B,OAAO,EAAW,SAAS,IAAI,IAAa,KAAA;AAC7C;AAEA,SAAgB,EAA0B,GAAgB,IAAW,IAAI;CACxE,OAAO,EAAc,CAAK,KAAK;AAChC;AAEA,SAAgB,EAAsB,GAAgB;CACrD,OAAO,EAA0B,CAAK;AACvC;AAEA,SAAgB,EAAqB,GAAwB;CAC5D,IAAM,IAAa,EAAc,CAAK;CACtC,OAAO,IAAa,EAAW,YAAY,IAAI;AAChD;AAEA,SAAgB,EAAa,GAAwB;CACpD,OAAO,KAAS,OAAO,KAAK,OAAO,CAAK;AACzC;AAEA,IAAM,IAAwB;AAM9B,SAAgB,EAAoB,GAAwB;CAC3D,OAAO,EAAsB,CAAK,CAAC,CAAC,QAAQ,GAAuB,GAAG;AACvE;;;AC9BA,SAAgB,EAAgB,GAAqB,GAAmC;CACvF,OAAO,EAAM,QAA6B,GAAK,MAAS;EACvD,IAAM,IAAW,OAAO,EAAK,EAAI;EAEjC,QADC,EAAI,OAAc,CAAC,EAAA,CAAG,KAAK,CAAI,GACzB;CACR,GAAG,CAAC,CAAC;AACN;AAEA,SAAgB,EAAc,GAAqB,GAAiC;CACnF,OAAO,EAAM,QAA2B,GAAK,MAAS;EACrD,IAAM,IAAW,OAAO,EAAK,EAAI;EAIjC,OAHK,EAAI,OACR,EAAI,KAAY,IAEV;CACR,GAAG,CAAC,CAAC;AACN;AAEA,SAAgB,EAAuB,GAAqB,GAAkD;CAC7G,IAAM,IAAU,EAAM,QAA6B,GAAK,MAAS;EAChE,IAAM,IAAW,OAAO,EAAK,EAAI;EAEjC,QADC,EAAI,OAAc,CAAC,EAAA,CAAG,KAAK,CAAI,GACzB;CACR,GAAG,CAAC,CAAC;CAEL,OAAO,OAAO,QAAQ,CAAO,CAAC,CAAC,KAAK,CAAC,GAAK,QAAY;EACrD;EACA;CACD,EAAE;AACH;AAEA,SAAgB,EAAiB,GAAqB,GAAmB;CACxE,IAAM,oBAAO,IAAI,IAAY;CAC7B,OAAO,EAAM,QAAQ,MAAS;EAC7B,IAAM,IAAQ,OAAO,EAAK,EAAI;EAG9B,OAFI,EAAK,IAAI,CAAK,IAAU,MAC5B,EAAK,IAAI,CAAK,GACP;CACR,CAAC;AACF;AAQA,SAAgB,EAAoB,GAA0B;CAC7D,IAAM,IAAW,CAAC,GACZ,oBAAO,IAAI,IAAO;CAExB,KAAK,IAAM,KAAQ,GACd,EAAK,IAAI,CAAI,MAEjB,EAAK,IAAI,CAAI,GACb,EAAI,KAAK,CAAI;CAGd,OAAO;AACR;AASA,SAAgB,EAA4C,GAAoC,GAAmC;CAClI,IAAM,IAAQ,IAAI,IAAiB,EAAW,KAAK,MAAO,CAAC,GAAI,CAAE,CAAC,CAAC,GAC7D,IAAa,CAAC,GACd,oBAAO,IAAI,IAAY;CAE7B,KAAK,IAAM,KAAM,KAAO,CAAC,GAAG;EAC3B,IAAI,CAAC,KAAM,EAAK,IAAI,CAAE,GAAG;EACzB,IAAM,IAAU,EAAM,IAAI,CAAE;EACvB,MACL,EAAK,IAAI,CAAE,GACX,EAAI,KAAK,CAAO;CACjB;CAEA,OAAO;AACR;AAEA,SAAgB,EAAqC,GAAyB,GAAoC;CACjH,IAAM,IAAM,CAAC,GAAG,CAAO,GACjB,IAAO,IAAI,IAAI,CAAO;CAE5B,KAAK,IAAM,KAAM,GACZ,CAAC,KAAM,EAAK,IAAI,CAAE,MACtB,EAAK,IAAI,CAAE,GACX,EAAI,KAAK,CAAE;CAGZ,OAAO;AACR;AAEA,SAAgB,EAAoC,GAAuB,GAAkD;CAC5H,IAAM,IAAgB,CAAC;CAEvB,KAAK,IAAM,KAAO,GAAM;EACvB,IAAM,IAAQ,EAAY,IAAI,CAAG;EAEjC,AAAI,MAAU,KAAA,KACb,EAAI,KAAK,CAAK;CAEhB;CAEA,OAAO;AACR;AAEA,SAAgB,EAAe,GAAoB,GAA8B;CAChF,IAAI,EAAK,WAAW,EAAM,QAAQ,OAAO;CAEzC,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAK,QAAQ,KACxC,IAAI,EAAK,OAAW,EAAM,IAAQ,OAAO;CAG1C,OAAO;AACR;AAEA,SAAgB,EAAY,GAAqB,GAAc,GAAiB;CAE/E,IADI,MAAS,KACT,IAAO,KAAK,IAAK,KAAK,KAAQ,EAAM,UAAU,KAAM,EAAM,QAAQ,OAAO,CAAC,GAAG,CAAK;CAEtF,IAAM,IAAO,CAAC,GAAG,CAAK,GAChB,CAAC,KAAQ,EAAK,OAAO,GAAM,CAAC;CAIlC,OAHI,MAAS,KAAA,IAAkB,CAAC,GAAG,CAAK,KACxC,EAAK,OAAO,GAAI,GAAG,CAAI,GAEhB;AACR;AAEA,SAAgB,EACf,GACA,GACA,GACkB;CAClB,IAAI,CAAC,GAAO;CAEZ,IAAM,IAAW,CAAC,GACZ,oBAAO,IAAI,IAAU,GACrB,IACD,OAAO,KAAY,aAAa,MAAY,MACvC,MAAe,IAEpB,OAAO,KAAY,aACf,KAEA,OAAgB,EAAE,GAAG,EAAK;CAGnC,KAAK,IAAM,KAAQ,GAAO;EACzB,IAAM,IAAgB,EAAc,EAAK,EAAI;EACzC,CAAC,KAAiB,EAAK,IAAI,CAAa,MAC5C,EAAK,IAAI,CAAa,GACtB,EAAI,KAAK,EAAO,GAAM,CAAa,CAAC;CACrC;CAEA,OAAO,EAAI,SAAS,IAAM,KAAA;AAC3B;AAEA,SAAgB,EAAqB,GAA4D;CAChG,IAAI,CAAC,GAAO,QAAQ;CAEpB,IAAM,IAAgB,CAAC,GACjB,oBAAO,IAAI,IAAY;CAE7B,KAAK,IAAM,KAAQ,GAAO;EACzB,IAAM,IAAQ,EAAK,KAAK;EACpB,CAAC,KAAS,EAAK,IAAI,CAAK,MAE5B,EAAK,IAAI,CAAK,GACd,EAAI,KAAK,CAAK;CACf;CAEA,OAAO,EAAI,SAAS,IAAM,KAAA;AAC3B;AAEA,SAAgB,EAAU,GAAkB,GAAmB,GAAmC;CACjG,IAAM,IAAe,GAAS,KAAK;CAC/B,CAAC,KAAgB,EAAK,IAAI,CAAY,MAC1C,EAAK,IAAI,CAAY,GACrB,EAAO,KAAK,CAAY;AACzB;;;ACxLA,SAAS,EAAmB,GAAsE;CACjG,IAAM,EAAE,UAAO,SAAM,cAAW;CAEhC,QAAQ,GAAR;EACC,KAAK,SACJ,OAAO;EACR,KAAK,OACJ,OAAO,IAAO;EACf,KAAK,MACJ,OAAO,IAAQ;EAChB,KAAK,QACJ,OAAO,IAAQ;CACjB;AACD;AAKA,SAAgB,EAAwB,GAAqB,GAAe,GAA4B;CACvG,IAAM,IAAY,CAAC,GAAG,CAAK;CAC3B,IAAI,IAAQ,KAAK,KAAS,EAAU,QAAQ,OAAO;CAEnD,IAAM,IAAc,EAAmB;EACtC;EACA,MAAM,EAAU;EAChB;CACD,CAAC;CACD,IAAI,IAAc,KAAK,KAAe,EAAU,UAAU,MAAgB,GAAO,OAAO;CAExF,IAAM,CAAC,KAAQ,EAAU,OAAO,GAAO,CAAC;CAKxC,OAHI,MAAS,KAAA,KAEb,EAAU,OAAO,GAAa,GAAG,CAAI,GAFN;AAIhC;AAKA,SAAgB,EAAiB,GAAqB,GAAmB,GAAsB;CAC9F,IAAM,IAAY,CAAC,GAAG,CAAK;CAE3B,IAAI,IAAY,KAAK,KAAa,EAAU,UAAU,IAAU,KAAK,KAAW,EAAU,UAAU,MAAc,GACjH,OAAO;CAGR,IAAM,CAAC,KAAQ,EAAU,OAAO,GAAW,CAAC;CAO5C,OALI,MAAS,KAAA,KAIb,EAAU,OAAO,GAAS,GAAG,CAAI,GAHzB;AAKT"}