@atom8n/utils 1.21.0

package/dist/retry2.cjs

@@ -0,0 +1,45 @@
+
+//#region src/retry.ts
+/**
+* A utility that retries a function every `interval` milliseconds
+* until the function returns true or the maximum number of retries is reached.
+*
+* @param fn - A function that returns a boolean or a Promise resolving to a boolean.
+* @param interval - The time interval (in milliseconds) between each retry. Defaults to 1000.
+* @param maxRetries - The maximum number of retry attempts. Defaults to 3.
+* @param backoff - The backoff strategy to use: 'linear', 'exponential', or null.
+* @returns {Promise<boolean>} - A promise that resolves to:
+*   - true: If the function returns true before reaching maxRetries.
+*   - false: If the function never returns true or if an error occurs.
+*/
+async function retry(fn, interval = 1e3, maxRetries = 3, backoff = "linear") {
+	let attempt = 0;
+	while (attempt < maxRetries) {
+		attempt++;
+		try {
+			if (await fn()) return true;
+		} catch (error) {
+			console.error("Error during retry:", error);
+			throw error;
+		}
+		if (attempt < maxRetries) {
+			let computedInterval = interval;
+			if (backoff === "linear") computedInterval = interval * attempt;
+			else if (backoff === "exponential") {
+				computedInterval = Math.pow(2, attempt - 1) * interval;
+				computedInterval = Math.min(computedInterval, 3e4);
+			}
+			await new Promise((resolve) => setTimeout(resolve, computedInterval));
+		}
+	}
+	return false;
+}
+
+//#endregion
+Object.defineProperty(exports, 'retry', {
+  enumerable: true,
+  get: function () {
+    return retry;
+  }
+});
+//# sourceMappingURL=retry2.cjs.map

package/dist/retry2.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"retry2.cjs","names":[],"sources":["../src/retry.ts"],"sourcesContent":["type RetryFn = () => boolean | Promise<boolean>;\n\n/**\n * A utility that retries a function every `interval` milliseconds\n * until the function returns true or the maximum number of retries is reached.\n *\n * @param fn - A function that returns a boolean or a Promise resolving to a boolean.\n * @param interval - The time interval (in milliseconds) between each retry. Defaults to 1000.\n * @param maxRetries - The maximum number of retry attempts. Defaults to 3.\n * @param backoff - The backoff strategy to use: 'linear', 'exponential', or null.\n * @returns {Promise<boolean>} - A promise that resolves to:\n *   - true: If the function returns true before reaching maxRetries.\n *   - false: If the function never returns true or if an error occurs.\n */\nexport async function retry(\n\tfn: RetryFn,\n\tinterval: number = 1000,\n\tmaxRetries: number = 3,\n\tbackoff: 'exponential' | 'linear' | null = 'linear',\n): Promise<boolean> {\n\tlet attempt = 0;\n\n\twhile (attempt < maxRetries) {\n\t\tattempt++;\n\t\ttry {\n\t\t\tconst result = await fn();\n\t\t\tif (result) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t} catch (error) {\n\t\t\tconsole.error('Error during retry:', error);\n\t\t\tthrow error;\n\t\t}\n\n\t\t// Wait for the specified interval before the next attempt, if any attempts remain.\n\t\tif (attempt < maxRetries) {\n\t\t\tlet computedInterval = interval;\n\n\t\t\tif (backoff === 'linear') {\n\t\t\t\tcomputedInterval = interval * attempt;\n\t\t\t} else if (backoff === 'exponential') {\n\t\t\t\tcomputedInterval = Math.pow(2, attempt - 1) * interval;\n\t\t\t\tcomputedInterval = Math.min(computedInterval, 30000); // Cap the maximum interval to 30 seconds\n\t\t\t}\n\n\t\t\tawait new Promise<void>((resolve) => setTimeout(resolve, computedInterval));\n\t\t}\n\t}\n\n\treturn false;\n}\n"],"mappings":";;;;;;;;;;;;;;AAcA,eAAsB,MACrB,IACA,WAAmB,KACnB,aAAqB,GACrB,UAA2C,UACxB;CACnB,IAAI,UAAU;AAEd,QAAO,UAAU,YAAY;AAC5B;AACA,MAAI;AAEH,OADe,MAAM,IAAI,CAExB,QAAO;WAEA,OAAO;AACf,WAAQ,MAAM,uBAAuB,MAAM;AAC3C,SAAM;;AAIP,MAAI,UAAU,YAAY;GACzB,IAAI,mBAAmB;AAEvB,OAAI,YAAY,SACf,oBAAmB,WAAW;YACpB,YAAY,eAAe;AACrC,uBAAmB,KAAK,IAAI,GAAG,UAAU,EAAE,GAAG;AAC9C,uBAAmB,KAAK,IAAI,kBAAkB,IAAM;;AAGrD,SAAM,IAAI,SAAe,YAAY,WAAW,SAAS,iBAAiB,CAAC;;;AAI7E,QAAO"}

package/dist/retry2.d.cts

@@ -0,0 +1,6 @@
+//#region src/retry.d.ts
+type RetryFn = () => boolean | Promise<boolean>;
+declare function retry(fn: RetryFn, interval?: number, maxRetries?: number, backoff?: 'exponential' | 'linear' | null): Promise<boolean>;
+//#endregion
+export { retry as t };
+//# sourceMappingURL=retry2.d.cts.map

package/dist/retry2.d.mts

@@ -0,0 +1,6 @@
+//#region src/retry.d.ts
+type RetryFn = () => boolean | Promise<boolean>;
+declare function retry(fn: RetryFn, interval?: number, maxRetries?: number, backoff?: 'exponential' | 'linear' | null): Promise<boolean>;
+//#endregion
+export { retry as t };
+//# sourceMappingURL=retry2.d.mts.map

package/dist/retry2.mjs

@@ -0,0 +1,39 @@
+//#region src/retry.ts
+/**
+* A utility that retries a function every `interval` milliseconds
+* until the function returns true or the maximum number of retries is reached.
+*
+* @param fn - A function that returns a boolean or a Promise resolving to a boolean.
+* @param interval - The time interval (in milliseconds) between each retry. Defaults to 1000.
+* @param maxRetries - The maximum number of retry attempts. Defaults to 3.
+* @param backoff - The backoff strategy to use: 'linear', 'exponential', or null.
+* @returns {Promise<boolean>} - A promise that resolves to:
+*   - true: If the function returns true before reaching maxRetries.
+*   - false: If the function never returns true or if an error occurs.
+*/
+async function retry(fn, interval = 1e3, maxRetries = 3, backoff = "linear") {
+	let attempt = 0;
+	while (attempt < maxRetries) {
+		attempt++;
+		try {
+			if (await fn()) return true;
+		} catch (error) {
+			console.error("Error during retry:", error);
+			throw error;
+		}
+		if (attempt < maxRetries) {
+			let computedInterval = interval;
+			if (backoff === "linear") computedInterval = interval * attempt;
+			else if (backoff === "exponential") {
+				computedInterval = Math.pow(2, attempt - 1) * interval;
+				computedInterval = Math.min(computedInterval, 3e4);
+			}
+			await new Promise((resolve) => setTimeout(resolve, computedInterval));
+		}
+	}
+	return false;
+}
+
+//#endregion
+export { retry as t };
+//# sourceMappingURL=retry2.mjs.map

package/dist/retry2.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"retry2.mjs","names":[],"sources":["../src/retry.ts"],"sourcesContent":["type RetryFn = () => boolean | Promise<boolean>;\n\n/**\n * A utility that retries a function every `interval` milliseconds\n * until the function returns true or the maximum number of retries is reached.\n *\n * @param fn - A function that returns a boolean or a Promise resolving to a boolean.\n * @param interval - The time interval (in milliseconds) between each retry. Defaults to 1000.\n * @param maxRetries - The maximum number of retry attempts. Defaults to 3.\n * @param backoff - The backoff strategy to use: 'linear', 'exponential', or null.\n * @returns {Promise<boolean>} - A promise that resolves to:\n *   - true: If the function returns true before reaching maxRetries.\n *   - false: If the function never returns true or if an error occurs.\n */\nexport async function retry(\n\tfn: RetryFn,\n\tinterval: number = 1000,\n\tmaxRetries: number = 3,\n\tbackoff: 'exponential' | 'linear' | null = 'linear',\n): Promise<boolean> {\n\tlet attempt = 0;\n\n\twhile (attempt < maxRetries) {\n\t\tattempt++;\n\t\ttry {\n\t\t\tconst result = await fn();\n\t\t\tif (result) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t} catch (error) {\n\t\t\tconsole.error('Error during retry:', error);\n\t\t\tthrow error;\n\t\t}\n\n\t\t// Wait for the specified interval before the next attempt, if any attempts remain.\n\t\tif (attempt < maxRetries) {\n\t\t\tlet computedInterval = interval;\n\n\t\t\tif (backoff === 'linear') {\n\t\t\t\tcomputedInterval = interval * attempt;\n\t\t\t} else if (backoff === 'exponential') {\n\t\t\t\tcomputedInterval = Math.pow(2, attempt - 1) * interval;\n\t\t\t\tcomputedInterval = Math.min(computedInterval, 30000); // Cap the maximum interval to 30 seconds\n\t\t\t}\n\n\t\t\tawait new Promise<void>((resolve) => setTimeout(resolve, computedInterval));\n\t\t}\n\t}\n\n\treturn false;\n}\n"],"mappings":";;;;;;;;;;;;;AAcA,eAAsB,MACrB,IACA,WAAmB,KACnB,aAAqB,GACrB,UAA2C,UACxB;CACnB,IAAI,UAAU;AAEd,QAAO,UAAU,YAAY;AAC5B;AACA,MAAI;AAEH,OADe,MAAM,IAAI,CAExB,QAAO;WAEA,OAAO;AACf,WAAQ,MAAM,uBAAuB,MAAM;AAC3C,SAAM;;AAIP,MAAI,UAAU,YAAY;GACzB,IAAI,mBAAmB;AAEvB,OAAI,YAAY,SACf,oBAAmB,WAAW;YACpB,YAAY,eAAe;AACrC,uBAAmB,KAAK,IAAI,GAAG,UAAU,EAAE,GAAG;AAC9C,uBAAmB,KAAK,IAAI,kBAAkB,IAAM;;AAGrD,SAAM,IAAI,SAAe,YAAY,WAAW,SAAS,iBAAiB,CAAC;;;AAI7E,QAAO"}

package/dist/sanitize.cjs

@@ -0,0 +1,67 @@
+
+//#region src/files/sanitize.ts
+const INVALID_CHARS_REGEX = /[<>:"/\\|?*\u0000-\u001F\u007F-\u009F]/g;
+const ZERO_WIDTH_CHARS_REGEX = /[\u200B-\u200D\u2060\uFEFF]/g;
+const UNICODE_SPACES_REGEX = /[\u00A0\u2000-\u200A]/g;
+const LEADING_TRAILING_DOTS_SPACES_REGEX = /^[\s.]+|[\s.]+$/g;
+const WINDOWS_RESERVED_NAMES = new Set([
+	"CON",
+	"PRN",
+	"AUX",
+	"NUL",
+	"COM1",
+	"COM2",
+	"COM3",
+	"COM4",
+	"COM5",
+	"COM6",
+	"COM7",
+	"COM8",
+	"COM9",
+	"LPT1",
+	"LPT2",
+	"LPT3",
+	"LPT4",
+	"LPT5",
+	"LPT6",
+	"LPT7",
+	"LPT8",
+	"LPT9"
+]);
+const DEFAULT_FALLBACK_NAME = "untitled";
+const MAX_FILENAME_LENGTH = 200;
+/**
+* Sanitizes a filename to be compatible with Mac, Linux, and Windows file systems
+*
+* Main features:
+* - Replace invalid characters (e.g. ":" in hello:world)
+* - Handle Windows reserved names
+* - Limit filename length
+* - Normalize Unicode characters
+*
+* @param filename - The filename to sanitize (without extension)
+* @param maxLength - Maximum filename length (default: 200)
+* @returns A sanitized filename (without extension)
+*
+* @example
+* sanitizeFilename('hello:world') // returns 'hello_world'
+* sanitizeFilename('CON') // returns '_CON'
+* sanitizeFilename('') // returns 'untitled'
+*/
+const sanitizeFilename = (filename, maxLength = MAX_FILENAME_LENGTH) => {
+	if (!filename) return DEFAULT_FALLBACK_NAME;
+	let baseName = filename.trim().replace(INVALID_CHARS_REGEX, "_").replace(ZERO_WIDTH_CHARS_REGEX, "").replace(UNICODE_SPACES_REGEX, " ").replace(LEADING_TRAILING_DOTS_SPACES_REGEX, "");
+	if (!baseName) baseName = DEFAULT_FALLBACK_NAME;
+	if (WINDOWS_RESERVED_NAMES.has(baseName.toUpperCase())) baseName = `_${baseName}`;
+	if (baseName.length > maxLength) baseName = baseName.slice(0, maxLength);
+	return baseName;
+};
+
+//#endregion
+Object.defineProperty(exports, 'sanitizeFilename', {
+  enumerable: true,
+  get: function () {
+    return sanitizeFilename;
+  }
+});
+//# sourceMappingURL=sanitize.cjs.map

package/dist/sanitize.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sanitize.cjs","names":[],"sources":["../src/files/sanitize.ts"],"sourcesContent":["// Constants definition\n/* eslint-disable no-control-regex */\nconst INVALID_CHARS_REGEX = /[<>:\"/\\\\|?*\\u0000-\\u001F\\u007F-\\u009F]/g;\nconst ZERO_WIDTH_CHARS_REGEX = /[\\u200B-\\u200D\\u2060\\uFEFF]/g;\nconst UNICODE_SPACES_REGEX = /[\\u00A0\\u2000-\\u200A]/g;\nconst LEADING_TRAILING_DOTS_SPACES_REGEX = /^[\\s.]+|[\\s.]+$/g;\n/* eslint-enable no-control-regex */\n\nconst WINDOWS_RESERVED_NAMES = new Set([\n\t'CON',\n\t'PRN',\n\t'AUX',\n\t'NUL',\n\t'COM1',\n\t'COM2',\n\t'COM3',\n\t'COM4',\n\t'COM5',\n\t'COM6',\n\t'COM7',\n\t'COM8',\n\t'COM9',\n\t'LPT1',\n\t'LPT2',\n\t'LPT3',\n\t'LPT4',\n\t'LPT5',\n\t'LPT6',\n\t'LPT7',\n\t'LPT8',\n\t'LPT9',\n]);\n\nconst DEFAULT_FALLBACK_NAME = 'untitled';\nconst MAX_FILENAME_LENGTH = 200;\n\n/**\n * Sanitizes a filename to be compatible with Mac, Linux, and Windows file systems\n *\n * Main features:\n * - Replace invalid characters (e.g. \":\" in hello:world)\n * - Handle Windows reserved names\n * - Limit filename length\n * - Normalize Unicode characters\n *\n * @param filename - The filename to sanitize (without extension)\n * @param maxLength - Maximum filename length (default: 200)\n * @returns A sanitized filename (without extension)\n *\n * @example\n * sanitizeFilename('hello:world') // returns 'hello_world'\n * sanitizeFilename('CON') // returns '_CON'\n * sanitizeFilename('') // returns 'untitled'\n */\nexport const sanitizeFilename = (\n\tfilename: string,\n\tmaxLength: number = MAX_FILENAME_LENGTH,\n): string => {\n\t// Input validation\n\tif (!filename) {\n\t\treturn DEFAULT_FALLBACK_NAME;\n\t}\n\n\tlet baseName = filename\n\t\t.trim()\n\t\t.replace(INVALID_CHARS_REGEX, '_')\n\t\t.replace(ZERO_WIDTH_CHARS_REGEX, '')\n\t\t.replace(UNICODE_SPACES_REGEX, ' ')\n\t\t.replace(LEADING_TRAILING_DOTS_SPACES_REGEX, '');\n\n\t// Handle empty or invalid filenames after cleaning\n\tif (!baseName) {\n\t\tbaseName = DEFAULT_FALLBACK_NAME;\n\t}\n\n\t// Handle Windows reserved names\n\tif (WINDOWS_RESERVED_NAMES.has(baseName.toUpperCase())) {\n\t\tbaseName = `_${baseName}`;\n\t}\n\n\t// Truncate if too long\n\tif (baseName.length > maxLength) {\n\t\tbaseName = baseName.slice(0, maxLength);\n\t}\n\n\treturn baseName;\n};\n"],"mappings":";;AAEA,MAAM,sBAAsB;AAC5B,MAAM,yBAAyB;AAC/B,MAAM,uBAAuB;AAC7B,MAAM,qCAAqC;AAG3C,MAAM,yBAAyB,IAAI,IAAI;CACtC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,CAAC;AAEF,MAAM,wBAAwB;AAC9B,MAAM,sBAAsB;;;;;;;;;;;;;;;;;;;AAoB5B,MAAa,oBACZ,UACA,YAAoB,wBACR;AAEZ,KAAI,CAAC,SACJ,QAAO;CAGR,IAAI,WAAW,SACb,MAAM,CACN,QAAQ,qBAAqB,IAAI,CACjC,QAAQ,wBAAwB,GAAG,CACnC,QAAQ,sBAAsB,IAAI,CAClC,QAAQ,oCAAoC,GAAG;AAGjD,KAAI,CAAC,SACJ,YAAW;AAIZ,KAAI,uBAAuB,IAAI,SAAS,aAAa,CAAC,CACrD,YAAW,IAAI;AAIhB,KAAI,SAAS,SAAS,UACrB,YAAW,SAAS,MAAM,GAAG,UAAU;AAGxC,QAAO"}

package/dist/sanitize.d.cts

@@ -0,0 +1,5 @@
+//#region src/files/sanitize.d.ts
+declare const sanitizeFilename: (filename: string, maxLength?: number) => string;
+//#endregion
+export { sanitizeFilename as t };
+//# sourceMappingURL=sanitize.d.cts.map

package/dist/sanitize.d.mts

@@ -0,0 +1,5 @@
+//#region src/files/sanitize.d.ts
+declare const sanitizeFilename: (filename: string, maxLength?: number) => string;
+//#endregion
+export { sanitizeFilename as t };
+//# sourceMappingURL=sanitize.d.mts.map

package/dist/sanitize.mjs

@@ -0,0 +1,61 @@
+//#region src/files/sanitize.ts
+const INVALID_CHARS_REGEX = /[<>:"/\\|?*\u0000-\u001F\u007F-\u009F]/g;
+const ZERO_WIDTH_CHARS_REGEX = /[\u200B-\u200D\u2060\uFEFF]/g;
+const UNICODE_SPACES_REGEX = /[\u00A0\u2000-\u200A]/g;
+const LEADING_TRAILING_DOTS_SPACES_REGEX = /^[\s.]+|[\s.]+$/g;
+const WINDOWS_RESERVED_NAMES = new Set([
+	"CON",
+	"PRN",
+	"AUX",
+	"NUL",
+	"COM1",
+	"COM2",
+	"COM3",
+	"COM4",
+	"COM5",
+	"COM6",
+	"COM7",
+	"COM8",
+	"COM9",
+	"LPT1",
+	"LPT2",
+	"LPT3",
+	"LPT4",
+	"LPT5",
+	"LPT6",
+	"LPT7",
+	"LPT8",
+	"LPT9"
+]);
+const DEFAULT_FALLBACK_NAME = "untitled";
+const MAX_FILENAME_LENGTH = 200;
+/**
+* Sanitizes a filename to be compatible with Mac, Linux, and Windows file systems
+*
+* Main features:
+* - Replace invalid characters (e.g. ":" in hello:world)
+* - Handle Windows reserved names
+* - Limit filename length
+* - Normalize Unicode characters
+*
+* @param filename - The filename to sanitize (without extension)
+* @param maxLength - Maximum filename length (default: 200)
+* @returns A sanitized filename (without extension)
+*
+* @example
+* sanitizeFilename('hello:world') // returns 'hello_world'
+* sanitizeFilename('CON') // returns '_CON'
+* sanitizeFilename('') // returns 'untitled'
+*/
+const sanitizeFilename = (filename, maxLength = MAX_FILENAME_LENGTH) => {
+	if (!filename) return DEFAULT_FALLBACK_NAME;
+	let baseName = filename.trim().replace(INVALID_CHARS_REGEX, "_").replace(ZERO_WIDTH_CHARS_REGEX, "").replace(UNICODE_SPACES_REGEX, " ").replace(LEADING_TRAILING_DOTS_SPACES_REGEX, "");
+	if (!baseName) baseName = DEFAULT_FALLBACK_NAME;
+	if (WINDOWS_RESERVED_NAMES.has(baseName.toUpperCase())) baseName = `_${baseName}`;
+	if (baseName.length > maxLength) baseName = baseName.slice(0, maxLength);
+	return baseName;
+};
+
+//#endregion
+export { sanitizeFilename as t };
+//# sourceMappingURL=sanitize.mjs.map

package/dist/sanitize.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sanitize.mjs","names":[],"sources":["../src/files/sanitize.ts"],"sourcesContent":["// Constants definition\n/* eslint-disable no-control-regex */\nconst INVALID_CHARS_REGEX = /[<>:\"/\\\\|?*\\u0000-\\u001F\\u007F-\\u009F]/g;\nconst ZERO_WIDTH_CHARS_REGEX = /[\\u200B-\\u200D\\u2060\\uFEFF]/g;\nconst UNICODE_SPACES_REGEX = /[\\u00A0\\u2000-\\u200A]/g;\nconst LEADING_TRAILING_DOTS_SPACES_REGEX = /^[\\s.]+|[\\s.]+$/g;\n/* eslint-enable no-control-regex */\n\nconst WINDOWS_RESERVED_NAMES = new Set([\n\t'CON',\n\t'PRN',\n\t'AUX',\n\t'NUL',\n\t'COM1',\n\t'COM2',\n\t'COM3',\n\t'COM4',\n\t'COM5',\n\t'COM6',\n\t'COM7',\n\t'COM8',\n\t'COM9',\n\t'LPT1',\n\t'LPT2',\n\t'LPT3',\n\t'LPT4',\n\t'LPT5',\n\t'LPT6',\n\t'LPT7',\n\t'LPT8',\n\t'LPT9',\n]);\n\nconst DEFAULT_FALLBACK_NAME = 'untitled';\nconst MAX_FILENAME_LENGTH = 200;\n\n/**\n * Sanitizes a filename to be compatible with Mac, Linux, and Windows file systems\n *\n * Main features:\n * - Replace invalid characters (e.g. \":\" in hello:world)\n * - Handle Windows reserved names\n * - Limit filename length\n * - Normalize Unicode characters\n *\n * @param filename - The filename to sanitize (without extension)\n * @param maxLength - Maximum filename length (default: 200)\n * @returns A sanitized filename (without extension)\n *\n * @example\n * sanitizeFilename('hello:world') // returns 'hello_world'\n * sanitizeFilename('CON') // returns '_CON'\n * sanitizeFilename('') // returns 'untitled'\n */\nexport const sanitizeFilename = (\n\tfilename: string,\n\tmaxLength: number = MAX_FILENAME_LENGTH,\n): string => {\n\t// Input validation\n\tif (!filename) {\n\t\treturn DEFAULT_FALLBACK_NAME;\n\t}\n\n\tlet baseName = filename\n\t\t.trim()\n\t\t.replace(INVALID_CHARS_REGEX, '_')\n\t\t.replace(ZERO_WIDTH_CHARS_REGEX, '')\n\t\t.replace(UNICODE_SPACES_REGEX, ' ')\n\t\t.replace(LEADING_TRAILING_DOTS_SPACES_REGEX, '');\n\n\t// Handle empty or invalid filenames after cleaning\n\tif (!baseName) {\n\t\tbaseName = DEFAULT_FALLBACK_NAME;\n\t}\n\n\t// Handle Windows reserved names\n\tif (WINDOWS_RESERVED_NAMES.has(baseName.toUpperCase())) {\n\t\tbaseName = `_${baseName}`;\n\t}\n\n\t// Truncate if too long\n\tif (baseName.length > maxLength) {\n\t\tbaseName = baseName.slice(0, maxLength);\n\t}\n\n\treturn baseName;\n};\n"],"mappings":";AAEA,MAAM,sBAAsB;AAC5B,MAAM,yBAAyB;AAC/B,MAAM,uBAAuB;AAC7B,MAAM,qCAAqC;AAG3C,MAAM,yBAAyB,IAAI,IAAI;CACtC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,CAAC;AAEF,MAAM,wBAAwB;AAC9B,MAAM,sBAAsB;;;;;;;;;;;;;;;;;;;AAoB5B,MAAa,oBACZ,UACA,YAAoB,wBACR;AAEZ,KAAI,CAAC,SACJ,QAAO;CAGR,IAAI,WAAW,SACb,MAAM,CACN,QAAQ,qBAAqB,IAAI,CACjC,QAAQ,wBAAwB,GAAG,CACnC,QAAQ,sBAAsB,IAAI,CAClC,QAAQ,oCAAoC,GAAG;AAGjD,KAAI,CAAC,SACJ,YAAW;AAIZ,KAAI,uBAAuB,IAAI,SAAS,aAAa,CAAC,CACrD,YAAW,IAAI;AAIhB,KAAI,SAAS,SAAS,UACrB,YAAW,SAAS,MAAM,GAAG,UAAU;AAGxC,QAAO"}

package/dist/search/reRankSearchResults.cjs

@@ -0,0 +1,3 @@
+const require_reRankSearchResults = require('../reRankSearchResults.cjs');
+
+exports.reRankSearchResults = require_reRankSearchResults.reRankSearchResults;

package/dist/search/reRankSearchResults.d.cts

@@ -0,0 +1,2 @@
+import { t as reRankSearchResults } from "../reRankSearchResults.cjs";
+export { reRankSearchResults };

package/dist/search/reRankSearchResults.d.mts

@@ -0,0 +1,2 @@
+import { t as reRankSearchResults } from "../reRankSearchResults.mjs";
+export { reRankSearchResults };

package/dist/search/reRankSearchResults.mjs

@@ -0,0 +1,3 @@
+import { t as reRankSearchResults } from "../reRankSearchResults.mjs";
+
+export { reRankSearchResults };

package/dist/search/sublimeSearch.cjs

@@ -0,0 +1,4 @@
+const require_sublimeSearch = require('../sublimeSearch.cjs');
+
+exports.DEFAULT_KEYS = require_sublimeSearch.DEFAULT_KEYS;
+exports.sublimeSearch = require_sublimeSearch.sublimeSearch;

package/dist/search/sublimeSearch.d.cts

@@ -0,0 +1,2 @@
+import { n as sublimeSearch, t as DEFAULT_KEYS } from "../sublimeSearch.cjs";
+export { DEFAULT_KEYS, sublimeSearch };

package/dist/search/sublimeSearch.d.mts

@@ -0,0 +1,2 @@
+import { n as sublimeSearch, t as DEFAULT_KEYS } from "../sublimeSearch.mjs";
+export { DEFAULT_KEYS, sublimeSearch };

package/dist/search/sublimeSearch.mjs

@@ -0,0 +1,3 @@
+import { n as sublimeSearch, t as DEFAULT_KEYS } from "../sublimeSearch.mjs";
+
+export { DEFAULT_KEYS, sublimeSearch };

package/dist/smartDecimal.cjs

@@ -0,0 +1,16 @@
+
+//#region src/number/smartDecimal.ts
+const smartDecimal = (value, decimals = 2) => {
+	if (Number.isInteger(value)) return value;
+	if (value.toString().split(".")[1].length <= decimals) return value;
+	return Number(value.toFixed(decimals));
+};
+
+//#endregion
+Object.defineProperty(exports, 'smartDecimal', {
+  enumerable: true,
+  get: function () {
+    return smartDecimal;
+  }
+});
+//# sourceMappingURL=smartDecimal.cjs.map

package/dist/smartDecimal.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"smartDecimal.cjs","names":[],"sources":["../src/number/smartDecimal.ts"],"sourcesContent":["export const smartDecimal = (value: number, decimals = 2): number => {\n\t// Check if integer\n\tif (Number.isInteger(value)) {\n\t\treturn value;\n\t}\n\n\t// Check if it has only one decimal place\n\tif (value.toString().split('.')[1].length <= decimals) {\n\t\treturn value;\n\t}\n\n\treturn Number(value.toFixed(decimals));\n};\n"],"mappings":";;AAAA,MAAa,gBAAgB,OAAe,WAAW,MAAc;AAEpE,KAAI,OAAO,UAAU,MAAM,CAC1B,QAAO;AAIR,KAAI,MAAM,UAAU,CAAC,MAAM,IAAI,CAAC,GAAG,UAAU,SAC5C,QAAO;AAGR,QAAO,OAAO,MAAM,QAAQ,SAAS,CAAC"}

package/dist/smartDecimal.d.cts

@@ -0,0 +1,5 @@
+//#region src/number/smartDecimal.d.ts
+declare const smartDecimal: (value: number, decimals?: number) => number;
+//#endregion
+export { smartDecimal as t };
+//# sourceMappingURL=smartDecimal.d.cts.map

package/dist/smartDecimal.d.mts

@@ -0,0 +1,5 @@
+//#region src/number/smartDecimal.d.ts
+declare const smartDecimal: (value: number, decimals?: number) => number;
+//#endregion
+export { smartDecimal as t };
+//# sourceMappingURL=smartDecimal.d.mts.map

package/dist/smartDecimal.mjs

@@ -0,0 +1,10 @@
+//#region src/number/smartDecimal.ts
+const smartDecimal = (value, decimals = 2) => {
+	if (Number.isInteger(value)) return value;
+	if (value.toString().split(".")[1].length <= decimals) return value;
+	return Number(value.toFixed(decimals));
+};
+
+//#endregion
+export { smartDecimal as t };
+//# sourceMappingURL=smartDecimal.mjs.map

package/dist/smartDecimal.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"smartDecimal.mjs","names":[],"sources":["../src/number/smartDecimal.ts"],"sourcesContent":["export const smartDecimal = (value: number, decimals = 2): number => {\n\t// Check if integer\n\tif (Number.isInteger(value)) {\n\t\treturn value;\n\t}\n\n\t// Check if it has only one decimal place\n\tif (value.toString().split('.')[1].length <= decimals) {\n\t\treturn value;\n\t}\n\n\treturn Number(value.toFixed(decimals));\n};\n"],"mappings":";AAAA,MAAa,gBAAgB,OAAe,WAAW,MAAc;AAEpE,KAAI,OAAO,UAAU,MAAM,CAC1B,QAAO;AAIR,KAAI,MAAM,UAAU,CAAC,MAAM,IAAI,CAAC,GAAG,UAAU,SAC5C,QAAO;AAGR,QAAO,OAAO,MAAM,QAAQ,SAAS,CAAC"}

package/dist/sort/sortByProperty.cjs

@@ -0,0 +1,3 @@
+const require_sortByProperty = require('../sortByProperty.cjs');
+
+exports.sortByProperty = require_sortByProperty.sortByProperty;

package/dist/sort/sortByProperty.d.cts

@@ -0,0 +1,2 @@
+import { t as sortByProperty } from "../sortByProperty.cjs";
+export { sortByProperty };

package/dist/sort/sortByProperty.d.mts

@@ -0,0 +1,2 @@
+import { t as sortByProperty } from "../sortByProperty.mjs";
+export { sortByProperty };

package/dist/sort/sortByProperty.mjs

@@ -0,0 +1,3 @@
+import { t as sortByProperty } from "../sortByProperty.mjs";
+
+export { sortByProperty };

package/dist/sortByProperty.cjs

@@ -0,0 +1,18 @@
+
+//#region src/sort/sortByProperty.ts
+const sortByProperty = (property, arr, order = "asc") => arr.sort((a, b) => {
+	const result = String(a[property]).localeCompare(String(b[property]), void 0, {
+		numeric: true,
+		sensitivity: "base"
+	});
+	return order === "asc" ? result : -result;
+});
+
+//#endregion
+Object.defineProperty(exports, 'sortByProperty', {
+  enumerable: true,
+  get: function () {
+    return sortByProperty;
+  }
+});
+//# sourceMappingURL=sortByProperty.cjs.map

package/dist/sortByProperty.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sortByProperty.cjs","names":[],"sources":["../src/sort/sortByProperty.ts"],"sourcesContent":["export const sortByProperty = <T>(\n\tproperty: keyof T,\n\tarr: T[],\n\torder: 'asc' | 'desc' = 'asc',\n): T[] =>\n\tarr.sort((a, b) => {\n\t\tconst result = String(a[property]).localeCompare(String(b[property]), undefined, {\n\t\t\tnumeric: true,\n\t\t\tsensitivity: 'base',\n\t\t});\n\t\treturn order === 'asc' ? result : -result;\n\t});\n"],"mappings":";;AAAA,MAAa,kBACZ,UACA,KACA,QAAwB,UAExB,IAAI,MAAM,GAAG,MAAM;CAClB,MAAM,SAAS,OAAO,EAAE,UAAU,CAAC,cAAc,OAAO,EAAE,UAAU,EAAE,QAAW;EAChF,SAAS;EACT,aAAa;EACb,CAAC;AACF,QAAO,UAAU,QAAQ,SAAS,CAAC;EAClC"}

package/dist/sortByProperty.d.cts

@@ -0,0 +1,5 @@
+//#region src/sort/sortByProperty.d.ts
+declare const sortByProperty: <T>(property: keyof T, arr: T[], order?: "asc" | "desc") => T[];
+//#endregion
+export { sortByProperty as t };
+//# sourceMappingURL=sortByProperty.d.cts.map

package/dist/sortByProperty.d.mts

@@ -0,0 +1,5 @@
+//#region src/sort/sortByProperty.d.ts
+declare const sortByProperty: <T>(property: keyof T, arr: T[], order?: "asc" | "desc") => T[];
+//#endregion
+export { sortByProperty as t };
+//# sourceMappingURL=sortByProperty.d.mts.map

package/dist/sortByProperty.mjs

@@ -0,0 +1,12 @@
+//#region src/sort/sortByProperty.ts
+const sortByProperty = (property, arr, order = "asc") => arr.sort((a, b) => {
+	const result = String(a[property]).localeCompare(String(b[property]), void 0, {
+		numeric: true,
+		sensitivity: "base"
+	});
+	return order === "asc" ? result : -result;
+});
+
+//#endregion
+export { sortByProperty as t };
+//# sourceMappingURL=sortByProperty.mjs.map

package/dist/sortByProperty.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sortByProperty.mjs","names":[],"sources":["../src/sort/sortByProperty.ts"],"sourcesContent":["export const sortByProperty = <T>(\n\tproperty: keyof T,\n\tarr: T[],\n\torder: 'asc' | 'desc' = 'asc',\n): T[] =>\n\tarr.sort((a, b) => {\n\t\tconst result = String(a[property]).localeCompare(String(b[property]), undefined, {\n\t\t\tnumeric: true,\n\t\t\tsensitivity: 'base',\n\t\t});\n\t\treturn order === 'asc' ? result : -result;\n\t});\n"],"mappings":";AAAA,MAAa,kBACZ,UACA,KACA,QAAwB,UAExB,IAAI,MAAM,GAAG,MAAM;CAClB,MAAM,SAAS,OAAO,EAAE,UAAU,CAAC,cAAc,OAAO,EAAE,UAAU,EAAE,QAAW;EAChF,SAAS;EACT,aAAa;EACb,CAAC;AACF,QAAO,UAAU,QAAQ,SAAS,CAAC;EAClC"}

package/dist/string/truncate.cjs

@@ -0,0 +1,4 @@
+const require_truncate = require('../truncate.cjs');
+
+exports.truncate = require_truncate.truncate;
+exports.truncateBeforeLast = require_truncate.truncateBeforeLast;

package/dist/string/truncate.d.cts

@@ -0,0 +1,2 @@
+import { n as truncateBeforeLast, t as truncate } from "../truncate.cjs";
+export { truncate, truncateBeforeLast };

package/dist/string/truncate.d.mts

@@ -0,0 +1,2 @@
+import { n as truncateBeforeLast, t as truncate } from "../truncate.mjs";
+export { truncate, truncateBeforeLast };

package/dist/string/truncate.mjs

@@ -0,0 +1,3 @@
+import { n as truncateBeforeLast, t as truncate } from "../truncate.mjs";
+
+export { truncate, truncateBeforeLast };

package/dist/sublimeSearch.cjs

@@ -0,0 +1,183 @@
+
+//#region src/search/sublimeSearch.ts
+const SEQUENTIAL_BONUS = 60;
+const SEPARATOR_BONUS = 38;
+const CAMEL_BONUS = 30;
+const FIRST_LETTER_BONUS = 15;
+const LEADING_LETTER_PENALTY = -20;
+const MAX_LEADING_LETTER_PENALTY = -200;
+const UNMATCHED_LETTER_PENALTY = -5;
+const DEFAULT_KEYS = [{
+	key: "properties.displayName",
+	weight: 1.3
+}, {
+	key: "properties.codex.alias",
+	weight: 1
+}];
+/**
+* Returns true if each character in pattern is found sequentially within target
+* @param {*} pattern string
+* @param {*} target string
+*/
+function fuzzyMatchSimple(pattern, target) {
+	let patternIdx = 0;
+	let strIdx = 0;
+	while (patternIdx < pattern.length && strIdx < target.length) {
+		if (pattern.charAt(patternIdx).toLowerCase() === target.charAt(strIdx).toLowerCase()) patternIdx++;
+		++strIdx;
+	}
+	return pattern.length !== 0 && target.length !== 0 && patternIdx === pattern.length;
+}
+function fuzzyMatchRecursive(pattern, target, patternCurIndex, targetCurrIndex, targetMatches, matches, maxMatches, nextMatch, recursionCount, recursionLimit) {
+	let outScore = 0;
+	if (++recursionCount >= recursionLimit) return {
+		matched: false,
+		outScore
+	};
+	if (patternCurIndex === pattern.length || targetCurrIndex === target.length) return {
+		matched: false,
+		outScore
+	};
+	let recursiveMatch = false;
+	let bestRecursiveMatches = [];
+	let bestRecursiveScore = 0;
+	let firstMatch = true;
+	while (patternCurIndex < pattern.length && targetCurrIndex < target.length) {
+		if (pattern[patternCurIndex].toLowerCase() === target[targetCurrIndex].toLowerCase()) {
+			if (nextMatch >= maxMatches) return {
+				matched: false,
+				outScore
+			};
+			if (firstMatch && targetMatches) {
+				matches = [...targetMatches];
+				firstMatch = false;
+			}
+			const recursiveMatches = [];
+			const recursiveResult = fuzzyMatchRecursive(pattern, target, patternCurIndex, targetCurrIndex + 1, matches, recursiveMatches, maxMatches, nextMatch, recursionCount, recursionLimit);
+			const recursiveScore = recursiveResult.outScore;
+			if (recursiveResult.matched) {
+				if (!recursiveMatch || recursiveScore > bestRecursiveScore) {
+					bestRecursiveMatches = [...recursiveMatches];
+					bestRecursiveScore = recursiveScore;
+				}
+				recursiveMatch = true;
+			}
+			matches[nextMatch++] = targetCurrIndex;
+			++patternCurIndex;
+		}
+		++targetCurrIndex;
+	}
+	const matched = patternCurIndex === pattern.length;
+	if (matched) {
+		outScore = 100;
+		if (!target.toLowerCase().startsWith("n8n")) {
+			let penalty = LEADING_LETTER_PENALTY * matches[0];
+			penalty = penalty < MAX_LEADING_LETTER_PENALTY ? MAX_LEADING_LETTER_PENALTY : penalty;
+			outScore += penalty;
+		}
+		const unmatched = target.length - nextMatch;
+		outScore += UNMATCHED_LETTER_PENALTY * unmatched;
+		for (let i = 0; i < nextMatch; i++) {
+			const currIdx = matches[i];
+			if (i > 0) {
+				if (currIdx === matches[i - 1] + 1) outScore += SEQUENTIAL_BONUS;
+			}
+			if (currIdx > 0) {
+				const neighbor = target[currIdx - 1];
+				const curr = target[currIdx];
+				if (neighbor !== neighbor.toUpperCase() && curr !== curr.toLowerCase()) outScore += CAMEL_BONUS;
+				if (neighbor === "_" || neighbor === " ") outScore += SEPARATOR_BONUS;
+			} else outScore += FIRST_LETTER_BONUS;
+		}
+		if (recursiveMatch && (!matched || bestRecursiveScore > outScore)) {
+			matches = [...bestRecursiveMatches];
+			outScore = bestRecursiveScore;
+			return {
+				matched: true,
+				outScore
+			};
+		} else if (matched) return {
+			matched: true,
+			outScore
+		};
+		else return {
+			matched: false,
+			outScore
+		};
+	}
+	return {
+		matched: false,
+		outScore
+	};
+}
+/**
+* Does a fuzzy search to find pattern inside a string.
+* @param {*} pattern string        pattern to search for
+* @param {*} target     string        string which is being searched
+* @returns [boolean, number]       a boolean which tells if pattern was
+*                                  found or not and a search score
+*/
+function fuzzyMatch(pattern, target) {
+	return fuzzyMatchRecursive(pattern, target, 0, 0, null, [], 256, 0, 0, 5);
+}
+function getValue(obj, prop) {
+	if (obj.hasOwnProperty(prop)) return obj[prop];
+	const segments = prop.split(".");
+	let result = obj;
+	let i = 0;
+	while (result && i < segments.length) {
+		const key = segments[i];
+		result = result[key];
+		i++;
+	}
+	return result;
+}
+function sublimeSearch(filter, data, keys = DEFAULT_KEYS) {
+	const results = data.reduce((accu, item) => {
+		let values = [];
+		keys.forEach(({ key, weight }) => {
+			const value = getValue(item, key);
+			if (Array.isArray(value)) values = values.concat(value.map((v) => ({
+				value: v,
+				weight
+			})));
+			else if (typeof value === "string") values.push({
+				value,
+				weight
+			});
+		});
+		const itemMatch = values.reduce((result, { value, weight }) => {
+			if (!fuzzyMatchSimple(filter, value)) return result;
+			const match = fuzzyMatch(filter, value);
+			match.outScore *= weight;
+			const { matched, outScore } = match;
+			if (!result && matched) return match;
+			if (matched && result && outScore > result.outScore) return match;
+			return result;
+		}, null);
+		if (itemMatch) accu.push({
+			score: itemMatch.outScore,
+			item
+		});
+		return accu;
+	}, []);
+	results.sort((a, b) => {
+		return b.score - a.score;
+	});
+	return results;
+}
+
+//#endregion
+Object.defineProperty(exports, 'DEFAULT_KEYS', {
+  enumerable: true,
+  get: function () {
+    return DEFAULT_KEYS;
+  }
+});
+Object.defineProperty(exports, 'sublimeSearch', {
+  enumerable: true,
+  get: function () {
+    return sublimeSearch;
+  }
+});
+//# sourceMappingURL=sublimeSearch.cjs.map