@truto/truto-jsonata 1.0.46 → 1.0.48

package/dist/cjs/index.cjs

@@ -50683,18 +50683,88 @@ var digest = async (text, algorithm = "SHA-256", stringType = "hex") => {
 };
 var digest_default = digest;
 
+// node_modules/n-gram/index.js
+var bigram = nGram(2);
+var trigram = nGram(3);
+function nGram(n2) {
+  if (typeof n2 !== "number" || Number.isNaN(n2) || n2 < 1 || n2 === Number.POSITIVE_INFINITY) {
+    throw new Error("`" + n2 + "` is not a valid argument for `n-gram`");
+  }
+  return grams;
+  function grams(value) {
+    const nGrams = [];
+    if (value === null || value === undefined) {
+      return nGrams;
+    }
+    const source = typeof value.slice === "function" ? value : String(value);
+    let index = source.length - n2 + 1;
+    if (index < 1) {
+      return nGrams;
+    }
+    while (index--) {
+      nGrams[index] = source.slice(index, index + n2);
+    }
+    return nGrams;
+  }
+}
+
+// node_modules/dice-coefficient/index.js
+function diceCoefficient(value, other2) {
+  const left = toPairs(value);
+  const right = toPairs(other2);
+  let index = -1;
+  let intersections = 0;
+  while (++index < left.length) {
+    const leftPair = left[index];
+    let offset2 = -1;
+    while (++offset2 < right.length) {
+      const rightPair = right[offset2];
+      if (leftPair === rightPair) {
+        intersections++;
+        right[offset2] = "";
+        break;
+      }
+    }
+  }
+  return 2 * intersections / (left.length + right.length);
+}
+function toPairs(value) {
+  if (Array.isArray(value)) {
+    return value.map((bigram2) => normalize(bigram2));
+  }
+  const normal = normalize(value);
+  return normal.length === 1 ? [normal] : bigram(normal);
+}
+function normalize(value) {
+  return String(value).toLowerCase();
+}
+
+// src/functions/diceCoefficient.ts
+function getNormalizedString(value) {
+  return value.toLowerCase().replace(/[^a-z0-9]/g, "");
+}
+function _diceCoefficient(value, value2) {
+  if (value === value2) {
+    return 1;
+  }
+  const normalizedValue = getNormalizedString(value);
+  const normalizedValue2 = getNormalizedString(value2);
+  return diceCoefficient(normalizedValue, normalizedValue2);
+}
+var diceCoefficient_default = _diceCoefficient;
+
 // src/functions/dtFromFormat.ts
-function dtFromFormat(date, format) {
+function dtFromFormat(date, format, options3) {
   if (format === "RFC2822") {
-    return DateTime.fromRFC2822(date);
+    return DateTime.fromRFC2822(date, options3);
   }
   if (format === "ISO") {
-    return DateTime.fromISO(date);
+    return DateTime.fromISO(date, options3);
   }
   if (format === "fromSeconds") {
-    return DateTime.fromSeconds(parseInt(date));
+    return DateTime.fromSeconds(parseInt(date), options3);
   }
-  return DateTime.fromFormat(date, format);
+  return DateTime.fromFormat(date, format, options3);
 }
 var dtFromFormat_default = dtFromFormat;
 
@@ -51490,70 +51560,14 @@ function jsToXml_default(json, options3 = { compact: true, spaces: 4 }) {
   return import_xml_js.js2xml(json, options3);
 }
 
-// node_modules/n-gram/index.js
-var bigram = nGram(2);
-var trigram = nGram(3);
-function nGram(n2) {
-  if (typeof n2 !== "number" || Number.isNaN(n2) || n2 < 1 || n2 === Number.POSITIVE_INFINITY) {
-    throw new Error("`" + n2 + "` is not a valid argument for `n-gram`");
-  }
-  return grams;
-  function grams(value) {
-    const nGrams = [];
-    if (value === null || value === undefined) {
-      return nGrams;
-    }
-    const source = typeof value.slice === "function" ? value : String(value);
-    let index = source.length - n2 + 1;
-    if (index < 1) {
-      return nGrams;
-    }
-    while (index--) {
-      nGrams[index] = source.slice(index, index + n2);
-    }
-    return nGrams;
-  }
-}
-
-// node_modules/dice-coefficient/index.js
-function diceCoefficient(value, other2) {
-  const left = toPairs(value);
-  const right = toPairs(other2);
-  let index = -1;
-  let intersections = 0;
-  while (++index < left.length) {
-    const leftPair = left[index];
-    let offset2 = -1;
-    while (++offset2 < right.length) {
-      const rightPair = right[offset2];
-      if (leftPair === rightPair) {
-        intersections++;
-        right[offset2] = "";
-        break;
-      }
-    }
-  }
-  return 2 * intersections / (left.length + right.length);
-}
-function toPairs(value) {
-  if (Array.isArray(value)) {
-    return value.map((bigram2) => normalize(bigram2));
-  }
-  const normal = normalize(value);
-  return normal.length === 1 ? [normal] : bigram(normal);
-}
-function normalize(value) {
-  return String(value).toLowerCase();
-}
-
 // src/functions/mostSimilar.ts
-function getNormalizedString(value) {
+function getNormalizedString2(value) {
   return value.toLowerCase().replace(/[^a-z0-9]/g, "");
 }
 function mostSimilar(value, possibleValues, threshold = 0.8) {
-  const normalizedValue = getNormalizedString(value);
+  const normalizedValue = getNormalizedString2(value);
   const result = reduce_default(possibleValues, (acc, possibleValue) => {
-    const normalizedPossibleValue = getNormalizedString(possibleValue);
+    const normalizedPossibleValue = getNormalizedString2(possibleValue);
     const similarity = diceCoefficient(normalizedValue, normalizedPossibleValue);
     if (similarity > acc.similarity) {
       return { similarity, value: possibleValue };
@@ -67919,6 +67933,7 @@ function registerJsonataExtensions(expression) {
   expression.registerFunction("uuid", uuid_default);
   expression.registerFunction("getArrayBuffer", getArrayBuffer_default);
   expression.registerFunction("mostSimilar", mostSimilar_default);
+  expression.registerFunction("diceCoefficient", diceCoefficient_default);
   expression.registerFunction("sortNodes", sortNodes_default);
   expression.registerFunction("blob", blob_default);
   expression.registerFunction("convertHtmlToMarkdown", convertHtmlToMarkdown_default);
@@ -67989,4 +68004,4 @@ function trutoJsonata(expression) {
   return registerJsonataExtensions(import_jsonata.default(expression));
 }
 
-//# debugId=2B39BDF338CBF36564756E2164756E21
+//# debugId=D940E4B7DB5FCE8864756E2164756E21