@noorm/marie-cli 0.1.18 → 0.1.25

package/dist/monolith/plumbing/utils/StringUtils.js

@@ -1,97 +1,95 @@
-export class StringUtils {
-    /**
-     * Calculates Levenshtein distance between two strings.
-     */
-    static levenshtein(a, b) {
-        // PERF: Prevent exhaustive comparison on massive strings (O(N^2) hazard)
-        const MAX_LEVEN_CHARS = 5000;
-        if (a.length > MAX_LEVEN_CHARS || b.length > MAX_LEVEN_CHARS) {
-            // Fallback to a fast length-based and prefix-based estimation for safety
-            const prefLen = this.getCommonPrefixLength(a, b);
-            const suffLen = this.getCommonSuffixLength(a, b);
-            const lenDiff = Math.abs(a.length - b.length);
-            return (lenDiff + (Math.max(a.length, b.length) - prefLen - suffLen - lenDiff));
-        }
-        // Ensure 'a' is the shorter string so we only allocate O(min(n,m)) space
-        if (a.length > b.length) {
-            const t = a;
-            a = b;
-            b = t;
-        }
-        const aLen = a.length;
-        const bLen = b.length;
-        if (aLen === 0)
-            return bLen;
-        let prev = new Array(aLen + 1);
-        let curr = new Array(aLen + 1);
-        for (let j = 0; j <= aLen; j++)
-            prev[j] = j;
-        for (let i = 1; i <= bLen; i++) {
-            curr[0] = i;
-            for (let j = 1; j <= aLen; j++) {
-                if (b[i - 1] === a[j - 1]) {
-                    curr[j] = prev[j - 1];
-                }
-                else {
-                    curr[j] = Math.min(prev[j - 1], curr[j - 1], prev[j]) + 1;
-                }
-            }
-            // Swap rows (reuse prev array on next iteration)
-            const tmp = prev;
-            prev = curr;
-            curr = tmp;
-        }
-        return prev[aLen];
+/**
+ * Calculates Levenshtein distance between two strings.
+ */
+export function levenshtein(a, b) {
+    // PERF: Prevent exhaustive comparison on massive strings (O(N^2) hazard)
+    const MAX_LEVEN_CHARS = 5000;
+    if (a.length > MAX_LEVEN_CHARS || b.length > MAX_LEVEN_CHARS) {
+        // Fallback to a fast length-based and prefix-based estimation for safety
+        const prefLen = getCommonPrefixLength(a, b);
+        const suffLen = getCommonSuffixLength(a, b);
+        const lenDiff = Math.abs(a.length - b.length);
+        return (lenDiff + (Math.max(a.length, b.length) - prefLen - suffLen - lenDiff));
     }
-    /**
-     * Calculates similarity (0-1) between two strings using Levenshtein distance.
-     * Optimized with early exit for significantly different lengths.
-     */
-    static similarity(a, b) {
-        const maxLength = Math.max(a.length, b.length);
-        const minLength = Math.min(a.length, b.length);
-        if (maxLength === 0)
-            return 1.0;
-        // Early exit: if strings differ by > 50% in length, similarity will be low
-        // This avoids expensive Levenshtein calculation for obviously dissimilar strings
-        const lengthRatio = minLength / maxLength;
-        if (lengthRatio < 0.5) {
-            // Still compute, but we know it won't be high similarity
-            // Could return 0 here for even faster processing, but let's be accurate
-        }
-        return (maxLength - this.levenshtein(a, b)) / maxLength;
+    // Ensure 'a' is the shorter string so we only allocate O(min(n,m)) space
+    if (a.length > b.length) {
+        const t = a;
+        a = b;
+        b = t;
     }
-    /**
-     * Safely extracts text from AI message content which can be a string or array of blocks.
-     */
-    static extractText(content) {
-        if (content === null || content === undefined)
-            return "";
-        if (typeof content === "string")
-            return content;
-        if (Array.isArray(content)) {
-            return content
-                .filter((block) => block && block.type === "text")
-                .map((block) => block.text || "")
-                .join(" ");
+    const aLen = a.length;
+    const bLen = b.length;
+    if (aLen === 0)
+        return bLen;
+    let prev = new Array(aLen + 1);
+    let curr = new Array(aLen + 1);
+    for (let j = 0; j <= aLen; j++)
+        prev[j] = j;
+    for (let i = 1; i <= bLen; i++) {
+        curr[0] = i;
+        for (let j = 1; j <= aLen; j++) {
+            if (b[i - 1] === a[j - 1]) {
+                curr[j] = prev[j - 1];
+            }
+            else {
+                curr[j] = Math.min(prev[j - 1], curr[j - 1], prev[j]) + 1;
+            }
         }
-        return "";
+        // Swap rows (reuse prev array on next iteration)
+        const tmp = prev;
+        prev = curr;
+        curr = tmp;
     }
-    static getCommonPrefixLength(a, b) {
-        let i = 0;
-        const min = Math.min(a.length, b.length);
-        while (i < min && a[i] === b[i])
-            i++;
-        return i;
+    return prev[aLen];
+}
+/**
+ * Calculates similarity (0-1) between two strings using Levenshtein distance.
+ * Optimized with early exit for significantly different lengths.
+ */
+export function similarity(a, b) {
+    const maxLength = Math.max(a.length, b.length);
+    const minLength = Math.min(a.length, b.length);
+    if (maxLength === 0)
+        return 1.0;
+    // Early exit: if strings differ by > 50% in length, similarity will be low
+    // This avoids expensive Levenshtein calculation for obviously dissimilar strings
+    const lengthRatio = minLength / maxLength;
+    if (lengthRatio < 0.5) {
+        // Still compute, but we know it won't be high similarity
+        // Could return 0 here for even faster processing, but let's be accurate
     }
-    static getCommonSuffixLength(a, b) {
-        let i = 0;
-        const aLen = a.length;
-        const bLen = b.length;
-        const min = Math.min(aLen, bLen);
-        while (i < min && a[aLen - 1 - i] === b[bLen - 1 - i])
-            i++;
-        return i;
+    return (maxLength - levenshtein(a, b)) / maxLength;
+}
+/**
+ * Safely extracts text from AI message content which can be a string or array of blocks.
+ */
+export function extractText(content) {
+    if (content === null || content === undefined)
+        return "";
+    if (typeof content === "string")
+        return content;
+    if (Array.isArray(content)) {
+        return content
+            .filter((block) => block && block.type === "text")
+            .map((block) => block.text || "")
+            .join(" ");
     }
+    return "";
+}
+function getCommonPrefixLength(a, b) {
+    let i = 0;
+    const min = Math.min(a.length, b.length);
+    while (i < min && a[i] === b[i])
+        i++;
+    return i;
+}
+function getCommonSuffixLength(a, b) {
+    let i = 0;
+    const aLen = a.length;
+    const bLen = b.length;
+    const min = Math.min(aLen, bLen);
+    while (i < min && a[aLen - 1 - i] === b[bLen - 1 - i])
+        i++;
+    return i;
 }
 //# sourceMappingURL=StringUtils.js.map

package/dist/monolith/plumbing/utils/StringUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"StringUtils.js","sourceRoot":"","sources":["../../../../src/monolith/plumbing/utils/StringUtils.ts"],"names":[],"mappings":"AAAA,MAAM,OAAO,WAAW;IACtB;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,CAAS,EAAE,CAAS;QACrC,yEAAyE;QACzE,MAAM,eAAe,GAAG,IAAI,CAAC;QAC7B,IAAI,CAAC,CAAC,MAAM,GAAG,eAAe,IAAI,CAAC,CAAC,MAAM,GAAG,eAAe,EAAE,CAAC;YAC7D,yEAAyE;YACzE,MAAM,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjD,MAAM,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;YAC9C,OAAO,CACL,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC,CACvE,CAAC;QACJ,CAAC;QAED,yEAAyE;QACzE,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,CAAC,CAAC;YACZ,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;QACR,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;QACtB,IAAI,IAAI,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAE5B,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,IAAI,GAAG,CAAC,CAAC,CAAC;QACvC,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,IAAI,GAAG,CAAC,CAAC,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAE5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;oBAC1B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxB,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC5D,CAAC;YACH,CAAC;YACD,iDAAiD;YACjD,MAAM,GAAG,GAAG,IAAI,CAAC;YACjB,IAAI,GAAG,IAAI,CAAC;YACZ,IAAI,GAAG,GAAG,CAAC;QACb,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,UAAU,CAAC,CAAS,EAAE,CAAS;QACpC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,SAAS,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAEhC,2EAA2E;QAC3E,iFAAiF;QACjF,MAAM,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;QAC1C,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;YACtB,yDAAyD;YACzD,wEAAwE;QAC1E,CAAC;QAED,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,OAAY;QAC7B,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,EAAE,CAAC;QACzD,IAAI,OAAO,OAAO,KAAK,QAAQ;YAAE,OAAO,OAAO,CAAC;QAChD,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3B,OAAO,OAAO;iBACX,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC;iBACjD,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;iBAChC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAEO,MAAM,CAAC,qBAAqB,CAAC,CAAS,EAAE,CAAS;QACvD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QACzC,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,CAAC,EAAE,CAAC;QACrC,OAAO,CAAC,CAAC;IACX,CAAC;IAEO,MAAM,CAAC,qBAAqB,CAAC,CAAS,EAAE,CAAS;QACvD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;QACtB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;YAAE,CAAC,EAAE,CAAC;QAC3D,OAAO,CAAC,CAAC;IACX,CAAC;CACF"}
+{"version":3,"file":"StringUtils.js","sourceRoot":"","sources":["../../../../src/monolith/plumbing/utils/StringUtils.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS;IAC9C,yEAAyE;IACzE,MAAM,eAAe,GAAG,IAAI,CAAC;IAC7B,IAAI,CAAC,CAAC,MAAM,GAAG,eAAe,IAAI,CAAC,CAAC,MAAM,GAAG,eAAe,EAAE,CAAC;QAC7D,yEAAyE;QACzE,MAAM,OAAO,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAC9C,OAAO,CACL,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC,CACvE,CAAC;IACJ,CAAC;IAED,yEAAyE;IACzE,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,CAAC;QACZ,CAAC,GAAG,CAAC,CAAC;QACN,CAAC,GAAG,CAAC,CAAC;IACR,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;IACtB,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5B,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,IAAI,GAAG,CAAC,CAAC,CAAC;IACvC,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,IAAI,GAAG,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;QACD,iDAAiD;QACjD,MAAM,GAAG,GAAG,IAAI,CAAC;QACjB,IAAI,GAAG,IAAI,CAAC;QACZ,IAAI,GAAG,GAAG,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,CAAS,EAAE,CAAS;IAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/C,IAAI,SAAS,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAEhC,2EAA2E;IAC3E,iFAAiF;IACjF,MAAM,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;IAC1C,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;QACtB,yDAAyD;QACzD,wEAAwE;IAC1E,CAAC;IAED,OAAO,CAAC,SAAS,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;AACrD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,OAAY;IACtC,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACzD,IAAI,OAAO,OAAO,KAAK,QAAQ;QAAE,OAAO,OAAO,CAAC;IAChD,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3B,OAAO,OAAO;aACX,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC;aACjD,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;aAChC,IAAI,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAS,qBAAqB,CAAC,CAAS,EAAE,CAAS;IACjD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IACzC,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAAE,CAAC,EAAE,CAAC;IACrC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,qBAAqB,CAAC,CAAS,EAAE,CAAS;IACjD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjC,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QAAE,CAAC,EAAE,CAAC;IAC3D,OAAO,CAAC,CAAC;AACX,CAAC"}