@n8n/utils 1.17.0 → 1.19.0

package/dist/reRankSearchResults.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"reRankSearchResults.mjs","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/retry.cjs

@@ -1,31 +1,3 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// src/retry.ts
-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;
-}
+const require_retry = require('./retry2.cjs');
 
-
-exports.retry = retry;
-//# sourceMappingURL=retry.cjs.map
+exports.retry = require_retry.retry;

package/dist/retry.d.cts

@@ -1,4 +1,2 @@
-type RetryFn = () => boolean | Promise<boolean>;
-declare function retry(fn: RetryFn, interval?: number, maxRetries?: number, backoff?: 'exponential' | 'linear' | null): Promise<boolean>;
-
-export { retry };
+import { t as retry } from "./retry2.cjs";
+export { retry };

package/dist/retry.d.mts

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

package/dist/retry.mjs

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

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/{retry.d.ts → retry2.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>;
-
-export { retry };
+//#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/search/reRankSearchResults.cjs

@@ -1,22 +1,3 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// 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;
-  });
-}
+const require_reRankSearchResults = require('../reRankSearchResults.cjs');
 
-
-exports.reRankSearchResults = reRankSearchResults;
-//# sourceMappingURL=reRankSearchResults.cjs.map
+exports.reRankSearchResults = require_reRankSearchResults.reRankSearchResults;

package/dist/search/reRankSearchResults.d.cts

@@ -1,11 +1,2 @@
-declare function reRankSearchResults<T extends {
-    key: string;
-}>(searchResults: Array<{
-    score: number;
-    item: T;
-}>, additionalFactors: Record<string, Record<string, number>>): Array<{
-    score: number;
-    item: T;
-}>;
-
-export { reRankSearchResults };
+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

@@ -1,198 +1,4 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// src/search/sublimeSearch.ts
-var SEQUENTIAL_BONUS = 60;
-var SEPARATOR_BONUS = 38;
-var CAMEL_BONUS = 30;
-var FIRST_LETTER_BONUS = 15;
-var LEADING_LETTER_PENALTY = -20;
-var MAX_LEADING_LETTER_PENALTY = -200;
-var UNMATCHED_LETTER_PENALTY = -5;
-var DEFAULT_KEYS = [
-  { key: "properties.displayName", weight: 1.3 },
-  { key: "properties.codex.alias", weight: 1 }
-];
-function fuzzyMatchSimple(pattern, target) {
-  let patternIdx = 0;
-  let strIdx = 0;
-  while (patternIdx < pattern.length && strIdx < target.length) {
-    const patternChar = pattern.charAt(patternIdx).toLowerCase();
-    const targetChar = target.charAt(strIdx).toLowerCase();
-    if (patternChar === targetChar) {
-      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) {
-        const prevIdx = matches[i - 1];
-        if (currIdx === prevIdx + 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;
-        }
-        const isNeighbourSeparator = neighbor === "_" || neighbor === " ";
-        if (isNeighbourSeparator) {
-          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 };
-}
-function fuzzyMatch(pattern, target) {
-  const recursionCount = 0;
-  const recursionLimit = 5;
-  const matches = [];
-  const maxMatches = 256;
-  return fuzzyMatchRecursive(
-    pattern,
-    target,
-    0,
-    0,
-    null,
-    matches,
-    maxMatches,
-    0,
-    recursionCount,
-    recursionLimit
-  );
-}
-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;
-}
+const require_sublimeSearch = require('../sublimeSearch.cjs');
 
-
-
-exports.DEFAULT_KEYS = DEFAULT_KEYS; exports.sublimeSearch = sublimeSearch;
-//# sourceMappingURL=sublimeSearch.cjs.map
+exports.DEFAULT_KEYS = require_sublimeSearch.DEFAULT_KEYS;
+exports.sublimeSearch = require_sublimeSearch.sublimeSearch;

package/dist/search/sublimeSearch.d.cts

@@ -1,13 +1,2 @@
-declare const DEFAULT_KEYS: {
-    key: string;
-    weight: number;
-}[];
-declare function sublimeSearch<T extends object>(filter: string, data: readonly T[], keys?: Array<{
-    key: string;
-    weight: number;
-}>): Array<{
-    score: number;
-    item: T;
-}>;
-
-export { DEFAULT_KEYS, sublimeSearch };
+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

@@ -1,12 +1,3 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// src/sort/sortByProperty.ts
-var 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;
-});
+const require_sortByProperty = require('../sortByProperty.cjs');
 
-
-exports.sortByProperty = sortByProperty;
-//# sourceMappingURL=sortByProperty.cjs.map
+exports.sortByProperty = require_sortByProperty.sortByProperty;

package/dist/sort/sortByProperty.d.cts

@@ -1,3 +1,2 @@
-declare const sortByProperty: <T>(property: keyof T, arr: T[], order?: "asc" | "desc") => T[];
-
-export { sortByProperty };
+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

@@ -1,31 +1,4 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});// src/string/truncate.ts
-var truncate = (text, length = 30) => text.length > length ? text.slice(0, length) + "..." : text;
-function truncateBeforeLast(text, maxLength) {
-  const chars = [];
-  const segmenter = new Intl.Segmenter(void 0, { granularity: "grapheme" });
-  for (const { segment } of segmenter.segment(text)) {
-    chars.push(segment);
-  }
-  if (chars.length <= maxLength) {
-    return text;
-  }
-  const lastWhitespaceIndex = chars.findLastIndex((ch) => ch.match(/^\s+$/));
-  const lastWordIndex = lastWhitespaceIndex + 1;
-  const lastWord = chars.slice(lastWordIndex);
-  const ellipsis = "\u2026";
-  const ellipsisLength = ellipsis.length;
-  if (lastWord.length < 15) {
-    const charsToRemove = chars.length - maxLength + ellipsisLength;
-    const indexBeforeLastWord = lastWordIndex;
-    const keepLength = indexBeforeLastWord - charsToRemove;
-    if (keepLength > 0) {
-      return chars.slice(0, keepLength).join("") + ellipsis + chars.slice(indexBeforeLastWord).join("");
-    }
-  }
-  return chars.slice(0, maxLength - 5 - ellipsisLength).join("") + ellipsis + chars.slice(-5).join("");
-}
+const require_truncate = require('../truncate.cjs');
 
-
-
-exports.truncate = truncate; exports.truncateBeforeLast = truncateBeforeLast;
-//# sourceMappingURL=truncate.cjs.map
+exports.truncate = require_truncate.truncate;
+exports.truncateBeforeLast = require_truncate.truncateBeforeLast;

package/dist/string/truncate.d.cts

@@ -1,4 +1,2 @@
-declare const truncate: (text: string, length?: number) => string;
-declare function truncateBeforeLast(text: string, maxLength: number): string;
-
-export { truncate, truncateBeforeLast };
+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 };