@n8n/utils 1.16.0 → 1.18.0

package/dist/retry.cjs

@@ -1,31 +1,40 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// src/retry.ts
+
+//#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 {
-      const result = await fn();
-      if (result) {
-        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;
+	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
 exports.retry = retry;
 //# sourceMappingURL=retry.cjs.map

package/dist/retry.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/retry.cjs","../src/retry.ts"],"names":[],"mappings":"AAAA;ACcA,MAAA,SAAsB,KAAA,CACrB,EAAA,EACA,SAAA,EAAmB,GAAA,EACnB,WAAA,EAAqB,CAAA,EACrB,QAAA,EAA2C,QAAA,EACxB;AACnB,EAAA,IAAI,QAAA,EAAU,CAAA;AAEd,EAAA,MAAA,CAAO,QAAA,EAAU,UAAA,EAAY;AAC5B,IAAA,OAAA,EAAA;AACA,IAAA,IAAI;AACH,MAAA,MAAM,OAAA,EAAS,MAAM,EAAA,CAAG,CAAA;AACxB,MAAA,GAAA,CAAI,MAAA,EAAQ;AACX,QAAA,OAAO,IAAA;AAAA,MACR;AAAA,IACD,EAAA,MAAA,CAAS,KAAA,EAAO;AACf,MAAA,OAAA,CAAQ,KAAA,CAAM,qBAAA,EAAuB,KAAK,CAAA;AAC1C,MAAA,MAAM,KAAA;AAAA,IACP;AAGA,IAAA,GAAA,CAAI,QAAA,EAAU,UAAA,EAAY;AACzB,MAAA,IAAI,iBAAA,EAAmB,QAAA;AAEvB,MAAA,GAAA,CAAI,QAAA,IAAY,QAAA,EAAU;AACzB,QAAA,iBAAA,EAAmB,SAAA,EAAW,OAAA;AAAA,MAC/B,EAAA,KAAA,GAAA,CAAW,QAAA,IAAY,aAAA,EAAe;AACrC,QAAA,iBAAA,EAAmB,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,QAAA,EAAU,CAAC,EAAA,EAAI,QAAA;AAC9C,QAAA,iBAAA,EAAmB,IAAA,CAAK,GAAA,CAAI,gBAAA,EAAkB,GAAK,CAAA;AAAA,MACpD;AAEA,MAAA,MAAM,IAAI,OAAA,CAAc,CAAC,OAAA,EAAA,GAAY,UAAA,CAAW,OAAA,EAAS,gBAAgB,CAAC,CAAA;AAAA,IAC3E;AAAA,EACD;AAEA,EAAA,OAAO,KAAA;AACR;ADvBA;AACE;AACF,sBAAC","file":"/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/retry.cjs","sourcesContent":[null,"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"]}
+{"version":3,"file":"retry.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/retry.d.cts

@@ -1,4 +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 };
+//# sourceMappingURL=retry.d.cts.map

package/dist/retry.d.ts

@@ -1,4 +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 };
+//# sourceMappingURL=retry.d.ts.map

package/dist/retry.js

@@ -1,31 +1,39 @@
-// src/retry.ts
+//#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 {
-      const result = await fn();
-      if (result) {
-        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;
+	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;
 }
-export {
-  retry
-};
+
+//#endregion
+export { retry };
 //# sourceMappingURL=retry.js.map

package/dist/retry.js.map

@@ -1 +1 @@
-{"version":3,"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;AACnB,MAAI,UAAU;AAEd,SAAO,UAAU,YAAY;AAC5B;AACA,QAAI;AACH,YAAM,SAAS,MAAM,GAAG;AACxB,UAAI,QAAQ;AACX,eAAO;AAAA,MACR;AAAA,IACD,SAAS,OAAO;AACf,cAAQ,MAAM,uBAAuB,KAAK;AAC1C,YAAM;AAAA,IACP;AAGA,QAAI,UAAU,YAAY;AACzB,UAAI,mBAAmB;AAEvB,UAAI,YAAY,UAAU;AACzB,2BAAmB,WAAW;AAAA,MAC/B,WAAW,YAAY,eAAe;AACrC,2BAAmB,KAAK,IAAI,GAAG,UAAU,CAAC,IAAI;AAC9C,2BAAmB,KAAK,IAAI,kBAAkB,GAAK;AAAA,MACpD;AAEA,YAAM,IAAI,QAAc,CAAC,YAAY,WAAW,SAAS,gBAAgB,CAAC;AAAA,IAC3E;AAAA,EACD;AAEA,SAAO;AACR;","names":[]}
+{"version":3,"file":"retry.js","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/search/reRankSearchResults.cjs

@@ -1,22 +1,20 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// src/search/reRankSearchResults.ts
+
+//#region src/search/reRankSearchResults.ts
 function reRankSearchResults(searchResults, additionalFactors) {
-  return searchResults.map(({ score, item }) => {
-    const additionalScore = Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {
-      const factorScore = factorScores[item.key];
-      if (factorScore) {
-        return acc + factorScore;
-      }
-      return acc;
-    }, 0);
-    return {
-      score: score + additionalScore,
-      item
-    };
-  }).sort((a, b) => {
-    return b.score - a.score;
-  });
+	return searchResults.map(({ score, item }) => {
+		return {
+			score: score + Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {
+				const factorScore = factorScores[item.key];
+				if (factorScore) return acc + factorScore;
+				return acc;
+			}, 0),
+			item
+		};
+	}).sort((a, b) => {
+		return b.score - a.score;
+	});
 }
 
-
+//#endregion
 exports.reRankSearchResults = reRankSearchResults;
 //# sourceMappingURL=reRankSearchResults.cjs.map

package/dist/search/reRankSearchResults.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/search/reRankSearchResults.cjs","../../src/search/reRankSearchResults.ts"],"names":[],"mappings":"AAAA;ACAO,SAAS,mBAAA,CACf,aAAA,EACA,iBAAA,EACoC;AACpC,EAAA,OAAO,aAAA,CACL,GAAA,CAAI,CAAC,EAAE,KAAA,EAAO,KAAK,CAAA,EAAA,GAAM;AAGzB,IAAA,MAAM,gBAAA,EAAkB,MAAA,CAAO,OAAA,CAAQ,iBAAiB,CAAA,CAAE,MAAA,CAAO,CAAC,GAAA,EAAK,CAAC,CAAA,EAAG,YAAY,CAAA,EAAA,GAAM;AAC5F,MAAA,MAAM,YAAA,EAAc,YAAA,CAAa,IAAA,CAAK,GAAG,CAAA;AACzC,MAAA,GAAA,CAAI,WAAA,EAAa;AAChB,QAAA,OAAO,IAAA,EAAM,WAAA;AAAA,MACd;AAEA,MAAA,OAAO,GAAA;AAAA,IACR,CAAA,EAAG,CAAC,CAAA;AAEJ,IAAA,OAAO;AAAA,MACN,KAAA,EAAO,MAAA,EAAQ,eAAA;AAAA,MACf;AAAA,IACD,CAAA;AAAA,EACD,CAAC,CAAA,CACA,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,EAAA,GAAM;AACf,IAAA,OAAO,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,KAAA;AAAA,EACpB,CAAC,CAAA;AACH;ADPA;AACE;AACF,kDAAC","file":"/home/runner/work/n8n/n8n/packages/@n8n/utils/dist/search/reRankSearchResults.cjs","sourcesContent":[null,"export function reRankSearchResults<T extends { key: string }>(\n\tsearchResults: Array<{ score: number; item: T }>,\n\tadditionalFactors: Record<string, Record<string, number>>,\n): Array<{ score: number; item: T }> {\n\treturn searchResults\n\t\t.map(({ score, item }) => {\n\t\t\t// For each additional factor, we check if it exists for the item and type,\n\t\t\t// and if so, we add the score to the item's score.\n\t\t\tconst additionalScore = Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {\n\t\t\t\tconst factorScore = factorScores[item.key];\n\t\t\t\tif (factorScore) {\n\t\t\t\t\treturn acc + factorScore;\n\t\t\t\t}\n\n\t\t\t\treturn acc;\n\t\t\t}, 0);\n\n\t\t\treturn {\n\t\t\t\tscore: score + additionalScore,\n\t\t\t\titem,\n\t\t\t};\n\t\t})\n\t\t.sort((a, b) => {\n\t\t\treturn b.score - a.score;\n\t\t});\n}\n"]}
+{"version":3,"file":"reRankSearchResults.cjs","names":[],"sources":["../../src/search/reRankSearchResults.ts"],"sourcesContent":["export function reRankSearchResults<T extends { key: string }>(\n\tsearchResults: Array<{ score: number; item: T }>,\n\tadditionalFactors: Record<string, Record<string, number>>,\n): Array<{ score: number; item: T }> {\n\treturn searchResults\n\t\t.map(({ score, item }) => {\n\t\t\t// For each additional factor, we check if it exists for the item and type,\n\t\t\t// and if so, we add the score to the item's score.\n\t\t\tconst additionalScore = Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {\n\t\t\t\tconst factorScore = factorScores[item.key];\n\t\t\t\tif (factorScore) {\n\t\t\t\t\treturn acc + factorScore;\n\t\t\t\t}\n\n\t\t\t\treturn acc;\n\t\t\t}, 0);\n\n\t\t\treturn {\n\t\t\t\tscore: score + additionalScore,\n\t\t\t\titem,\n\t\t\t};\n\t\t})\n\t\t.sort((a, b) => {\n\t\t\treturn b.score - a.score;\n\t\t});\n}\n"],"mappings":";;AAAA,SAAgB,oBACf,eACA,mBACoC;AACpC,QAAO,cACL,KAAK,EAAE,OAAO,WAAW;AAYzB,SAAO;GACN,OAAO,QAVgB,OAAO,QAAQ,kBAAkB,CAAC,QAAQ,KAAK,CAAC,GAAG,kBAAkB;IAC5F,MAAM,cAAc,aAAa,KAAK;AACtC,QAAI,YACH,QAAO,MAAM;AAGd,WAAO;MACL,EAAE;GAIJ;GACA;GACA,CACD,MAAM,GAAG,MAAM;AACf,SAAO,EAAE,QAAQ,EAAE;GAClB"}

package/dist/search/reRankSearchResults.d.cts

@@ -1,11 +1,13 @@
+//#region src/search/reRankSearchResults.d.ts
 declare function reRankSearchResults<T extends {
-    key: string;
+  key: string;
 }>(searchResults: Array<{
-    score: number;
-    item: T;
+  score: number;
+  item: T;
 }>, additionalFactors: Record<string, Record<string, number>>): Array<{
-    score: number;
-    item: T;
+  score: number;
+  item: T;
 }>;
-
+//#endregion
 export { reRankSearchResults };
+//# sourceMappingURL=reRankSearchResults.d.cts.map

package/dist/search/reRankSearchResults.d.ts

@@ -1,11 +1,13 @@
+//#region src/search/reRankSearchResults.d.ts
 declare function reRankSearchResults<T extends {
-    key: string;
+  key: string;
 }>(searchResults: Array<{
-    score: number;
-    item: T;
+  score: number;
+  item: T;
 }>, additionalFactors: Record<string, Record<string, number>>): Array<{
-    score: number;
-    item: T;
+  score: number;
+  item: T;
 }>;
-
+//#endregion
 export { reRankSearchResults };
+//# sourceMappingURL=reRankSearchResults.d.ts.map

package/dist/search/reRankSearchResults.js

@@ -1,22 +1,19 @@
-// src/search/reRankSearchResults.ts
+//#region src/search/reRankSearchResults.ts
 function reRankSearchResults(searchResults, additionalFactors) {
-  return searchResults.map(({ score, item }) => {
-    const additionalScore = Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {
-      const factorScore = factorScores[item.key];
-      if (factorScore) {
-        return acc + factorScore;
-      }
-      return acc;
-    }, 0);
-    return {
-      score: score + additionalScore,
-      item
-    };
-  }).sort((a, b) => {
-    return b.score - a.score;
-  });
+	return searchResults.map(({ score, item }) => {
+		return {
+			score: score + Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {
+				const factorScore = factorScores[item.key];
+				if (factorScore) return acc + factorScore;
+				return acc;
+			}, 0),
+			item
+		};
+	}).sort((a, b) => {
+		return b.score - a.score;
+	});
 }
-export {
-  reRankSearchResults
-};
+
+//#endregion
+export { reRankSearchResults };
 //# sourceMappingURL=reRankSearchResults.js.map

package/dist/search/reRankSearchResults.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/search/reRankSearchResults.ts"],"sourcesContent":["export function reRankSearchResults<T extends { key: string }>(\n\tsearchResults: Array<{ score: number; item: T }>,\n\tadditionalFactors: Record<string, Record<string, number>>,\n): Array<{ score: number; item: T }> {\n\treturn searchResults\n\t\t.map(({ score, item }) => {\n\t\t\t// For each additional factor, we check if it exists for the item and type,\n\t\t\t// and if so, we add the score to the item's score.\n\t\t\tconst additionalScore = Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {\n\t\t\t\tconst factorScore = factorScores[item.key];\n\t\t\t\tif (factorScore) {\n\t\t\t\t\treturn acc + factorScore;\n\t\t\t\t}\n\n\t\t\t\treturn acc;\n\t\t\t}, 0);\n\n\t\t\treturn {\n\t\t\t\tscore: score + additionalScore,\n\t\t\t\titem,\n\t\t\t};\n\t\t})\n\t\t.sort((a, b) => {\n\t\t\treturn b.score - a.score;\n\t\t});\n}\n"],"mappings":";AAAO,SAAS,oBACf,eACA,mBACoC;AACpC,SAAO,cACL,IAAI,CAAC,EAAE,OAAO,KAAK,MAAM;AAGzB,UAAM,kBAAkB,OAAO,QAAQ,iBAAiB,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,YAAY,MAAM;AAC5F,YAAM,cAAc,aAAa,KAAK,GAAG;AACzC,UAAI,aAAa;AAChB,eAAO,MAAM;AAAA,MACd;AAEA,aAAO;AAAA,IACR,GAAG,CAAC;AAEJ,WAAO;AAAA,MACN,OAAO,QAAQ;AAAA,MACf;AAAA,IACD;AAAA,EACD,CAAC,EACA,KAAK,CAAC,GAAG,MAAM;AACf,WAAO,EAAE,QAAQ,EAAE;AAAA,EACpB,CAAC;AACH;","names":[]}
+{"version":3,"file":"reRankSearchResults.js","names":[],"sources":["../../src/search/reRankSearchResults.ts"],"sourcesContent":["export function reRankSearchResults<T extends { key: string }>(\n\tsearchResults: Array<{ score: number; item: T }>,\n\tadditionalFactors: Record<string, Record<string, number>>,\n): Array<{ score: number; item: T }> {\n\treturn searchResults\n\t\t.map(({ score, item }) => {\n\t\t\t// For each additional factor, we check if it exists for the item and type,\n\t\t\t// and if so, we add the score to the item's score.\n\t\t\tconst additionalScore = Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {\n\t\t\t\tconst factorScore = factorScores[item.key];\n\t\t\t\tif (factorScore) {\n\t\t\t\t\treturn acc + factorScore;\n\t\t\t\t}\n\n\t\t\t\treturn acc;\n\t\t\t}, 0);\n\n\t\t\treturn {\n\t\t\t\tscore: score + additionalScore,\n\t\t\t\titem,\n\t\t\t};\n\t\t})\n\t\t.sort((a, b) => {\n\t\t\treturn b.score - a.score;\n\t\t});\n}\n"],"mappings":";AAAA,SAAgB,oBACf,eACA,mBACoC;AACpC,QAAO,cACL,KAAK,EAAE,OAAO,WAAW;AAYzB,SAAO;GACN,OAAO,QAVgB,OAAO,QAAQ,kBAAkB,CAAC,QAAQ,KAAK,CAAC,GAAG,kBAAkB;IAC5F,MAAM,cAAc,aAAa,KAAK;AACtC,QAAI,YACH,QAAO,MAAM;AAGd,WAAO;MACL,EAAE;GAIJ;GACA;GACA,CACD,MAAM,GAAG,MAAM;AACf,SAAO,EAAE,QAAQ,EAAE;GAClB"}