@noorm/marie-cli 0.1.17 → 0.1.25

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

@@ -1,22 +1,15 @@
-import { StringUtils } from "./StringUtils.js";
+import { levenshtein } from "./StringUtils.js";
+const MAX_CACHE_SIZE = 1000;
 /**
- * Prefix Tree (Trie) for efficient tag detection.
+ * Creates a Prefix Tree (Trie) for efficient tag detection.
  * Provides O(k) complexity for finding tags where k = input length.
  */
-export class PrefixTree {
-    root = { children: new Map(), isEndOfTag: false };
-    tags = [];
-    constructor(tags) {
-        this.tags = tags;
-        for (const tag of tags) {
-            this.insert(tag);
-        }
-    }
-    /**
-     * Insert a tag into the trie.
-     */
-    insert(tag) {
-        let node = this.root;
+export function createPrefixTree(tags) {
+    const root = { children: new Map(), isEndOfTag: false };
+    const editDistanceCache = new Map();
+    // Initialize
+    for (const tag of tags) {
+        let node = root;
         for (const char of tag) {
             if (!node.children.has(char)) {
                 node.children.set(char, { children: new Map(), isEndOfTag: false });
@@ -26,128 +19,82 @@ export class PrefixTree {
         node.isEndOfTag = true;
         node.tag = tag;
     }
-    /**
-     * Find the earliest complete tag in the text.
-     * Returns { index: number, tag: string } if found, null otherwise.
-     * Optimized with early-exit for O(k) performance.
-     */
-    findEarliestTag(text) {
-        let earliestIndex = Infinity;
-        let earliestTag = "";
-        // Try to match from each position in the text (with early-exit)
-        for (let startIdx = 0; startIdx < text.length; startIdx++) {
-            // Early-exit: if we already found a tag at an earlier position, stop
-            if (startIdx >= earliestIndex) {
-                break;
-            }
-            const result = this.matchFromPosition(text, startIdx);
-            if (result && result.index < earliestIndex) {
-                earliestIndex = result.index;
-                earliestTag = result.tag;
-            }
-        }
-        return earliestTag ? { index: earliestIndex, tag: earliestTag } : null;
-    }
-    /**
-     * Match a tag starting from a specific position.
-     * Returns the SHORTEST matching tag (to handle prefix overlaps correctly).
-     */
-    matchFromPosition(text, startIdx) {
-        let node = this.root;
+    function matchFromPosition(text, startIdx) {
+        let node = root;
         let firstMatch = null;
         for (let i = startIdx; i < text.length; i++) {
             const char = text[i];
-            if (!node.children.has(char)) {
-                // Can't continue matching
+            if (!node.children.has(char))
                 break;
-            }
             node = node.children.get(char);
             if (node.isEndOfTag && !firstMatch) {
-                // Found first complete tag at this position
                 firstMatch = node.tag;
-                // Return immediately to get the shortest match
                 return { index: startIdx, tag: firstMatch };
             }
         }
         return null;
     }
-    /**
-     * Find the longest partial tag at the end of the text.
-     * Returns the length of the partial match (0 if none).
-     */
-    findLongestPartialAtEnd(text) {
-        let maxPartialLength = 0;
-        // Try matching from each position toward the end
-        for (let startIdx = 0; startIdx < text.length; startIdx++) {
-            const partialLength = this.matchPartialFromPosition(text, startIdx);
-            if (partialLength > 0 && startIdx + partialLength === text.length) {
-                maxPartialLength = Math.max(maxPartialLength, partialLength);
-            }
-        }
-        return maxPartialLength;
-    }
-    /**
-     * Match a partial tag from a position, returns length of match.
-     */
-    matchPartialFromPosition(text, startIdx) {
-        let node = this.root;
+    function matchPartialFromPosition(text, startIdx) {
+        let node = root;
         let matchLength = 0;
         for (let i = startIdx; i < text.length; i++) {
             const char = text[i];
-            if (!node.children.has(char)) {
+            if (!node.children.has(char))
                 return matchLength;
-            }
             node = node.children.get(char);
             matchLength++;
-            if (node.isEndOfTag) {
-                // This is a complete tag, not a partial
+            if (node.isEndOfTag)
                 return 0;
-            }
         }
-        // We matched up to the end of text without completing a tag
         return matchLength;
     }
-    editDistanceCache = new Map();
-    static MAX_CACHE_SIZE = 1000;
-    /**
-     * Find similar tags using edit distance (Levenshtein).
-     * Returns tags with edit distance <= maxDistance.
-     * Uses caching with eviction for improved performance.
-     */
-    findSimilarTags(input, maxDistance = 2) {
-        const similar = [];
-        for (const tag of this.tags) {
-            const cacheKey = `${input}:${tag}`;
-            let distance = this.editDistanceCache.get(cacheKey);
-            if (distance === undefined) {
-                distance = this.editDistance(input, tag);
-                // Evict oldest half when cache exceeds max size
-                if (this.editDistanceCache.size >= PrefixTree.MAX_CACHE_SIZE) {
-                    const keysToDelete = Array.from(this.editDistanceCache.keys()).slice(0, PrefixTree.MAX_CACHE_SIZE / 2);
-                    for (const key of keysToDelete) {
-                        this.editDistanceCache.delete(key);
-                    }
+    return {
+        findEarliestTag(text) {
+            let earliestIndex = Infinity;
+            let earliestTag = "";
+            for (let startIdx = 0; startIdx < text.length; startIdx++) {
+                if (startIdx >= earliestIndex)
+                    break;
+                const result = matchFromPosition(text, startIdx);
+                if (result && result.index < earliestIndex) {
+                    earliestIndex = result.index;
+                    earliestTag = result.tag;
                 }
-                this.editDistanceCache.set(cacheKey, distance);
             }
-            if (distance <= maxDistance) {
-                similar.push(tag);
+            return earliestTag ? { index: earliestIndex, tag: earliestTag } : null;
+        },
+        findLongestPartialAtEnd(text) {
+            let maxPartialLength = 0;
+            for (let startIdx = 0; startIdx < text.length; startIdx++) {
+                const partialLength = matchPartialFromPosition(text, startIdx);
+                if (partialLength > 0 && startIdx + partialLength === text.length) {
+                    maxPartialLength = Math.max(maxPartialLength, partialLength);
+                }
             }
-        }
-        return similar;
-    }
-    /**
-     * Calculate Levenshtein edit distance between two strings.
-     * Delegates to StringUtils for the optimized 2-row implementation.
-     */
-    editDistance(a, b) {
-        return StringUtils.levenshtein(a, b);
-    }
-    /**
-     * Clear the edit distance cache to free memory.
-     */
-    clearCache() {
-        this.editDistanceCache.clear();
-    }
+            return maxPartialLength;
+        },
+        findSimilarTags(input, maxDistance = 2) {
+            const similar = [];
+            for (const tag of tags) {
+                const cacheKey = `${input}:${tag}`;
+                let distance = editDistanceCache.get(cacheKey);
+                if (distance === undefined) {
+                    distance = levenshtein(input, tag);
+                    if (editDistanceCache.size >= MAX_CACHE_SIZE) {
+                        const keysToDelete = Array.from(editDistanceCache.keys()).slice(0, MAX_CACHE_SIZE / 2);
+                        for (const key of keysToDelete)
+                            editDistanceCache.delete(key);
+                    }
+                    editDistanceCache.set(cacheKey, distance);
+                }
+                if (distance <= maxDistance)
+                    similar.push(tag);
+            }
+            return similar;
+        },
+        clearCache() {
+            editDistanceCache.clear();
+        },
+    };
 }
 //# sourceMappingURL=PrefixTree.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"PrefixTree.js","sourceRoot":"","sources":["../../../../src/monolith/plumbing/utils/PrefixTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAE/C;;;GAGG;AACH,MAAM,OAAO,UAAU;IACb,IAAI,GAAa,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAC5D,IAAI,GAAa,EAAE,CAAC;IAE5B,YAAY,IAAc;QACxB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,GAAW;QACxB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;YACtE,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,IAAY;QACjC,IAAI,aAAa,GAAG,QAAQ,CAAC;QAC7B,IAAI,WAAW,GAAG,EAAE,CAAC;QAErB,gEAAgE;QAChE,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC;YAC1D,qEAAqE;YACrE,IAAI,QAAQ,IAAI,aAAa,EAAE,CAAC;gBAC9B,MAAM;YACR,CAAC;YAED,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACtD,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,GAAG,aAAa,EAAE,CAAC;gBAC3C,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC;gBAC7B,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACzE,CAAC;IAED;;;OAGG;IACK,iBAAiB,CACvB,IAAY,EACZ,QAAgB;QAEhB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,UAAU,GAAkB,IAAI,CAAC;QAErC,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,0BAA0B;gBAC1B,MAAM;YACR,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YAChC,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,EAAE,CAAC;gBACnC,4CAA4C;gBAC5C,UAAU,GAAG,IAAI,CAAC,GAAI,CAAC;gBACvB,+CAA+C;gBAC/C,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,uBAAuB,CAAC,IAAY;QACzC,IAAI,gBAAgB,GAAG,CAAC,CAAC;QAEzB,iDAAiD;QACjD,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC;YAC1D,MAAM,aAAa,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACpE,IAAI,aAAa,GAAG,CAAC,IAAI,QAAQ,GAAG,aAAa,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAClE,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,aAAa,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;QAED,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,IAAY,EAAE,QAAgB;QAC7D,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,OAAO,WAAW,CAAC;YACrB,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YAChC,WAAW,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBACpB,wCAAwC;gBACxC,OAAO,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QAED,4DAA4D;QAC5D,OAAO,WAAW,CAAC;IACrB,CAAC;IAEO,iBAAiB,GAAwB,IAAI,GAAG,EAAE,CAAC;IACnD,MAAM,CAAU,cAAc,GAAG,IAAI,CAAC;IAE9C;;;;OAIG;IACI,eAAe,CAAC,KAAa,EAAE,cAAsB,CAAC;QAC3D,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,GAAG,KAAK,IAAI,GAAG,EAAE,CAAC;YACnC,IAAI,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAEpD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBAEzC,gDAAgD;gBAChD,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,IAAI,UAAU,CAAC,cAAc,EAAE,CAAC;oBAC7D,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAClE,CAAC,EACD,UAAU,CAAC,cAAc,GAAG,CAAC,CAC9B,CAAC;oBACF,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;wBAC/B,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBACrC,CAAC;gBACH,CAAC;gBAED,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACjD,CAAC;YAED,IAAI,QAAQ,IAAI,WAAW,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACK,YAAY,CAAC,CAAS,EAAE,CAAS;QACvC,OAAO,WAAW,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACI,UAAU;QACf,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC;IACjC,CAAC"}
+{"version":3,"file":"PrefixTree.js","sourceRoot":"","sources":["../../../../src/monolith/plumbing/utils/PrefixTree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAe/C,MAAM,cAAc,GAAG,IAAI,CAAC;AAE5B;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAc;IAC7C,MAAM,IAAI,GAAa,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAClE,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEpD,aAAa;IACb,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;YACtE,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;IAED,SAAS,iBAAiB,CACxB,IAAY,EACZ,QAAgB;QAEhB,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,IAAI,UAAU,GAAkB,IAAI,CAAC;QAErC,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,MAAM;YACpC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YAChC,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,EAAE,CAAC;gBACnC,UAAU,GAAG,IAAI,CAAC,GAAI,CAAC;gBACvB,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC;YAC9C,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,wBAAwB,CAAC,IAAY,EAAE,QAAgB;QAC9D,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAO,WAAW,CAAC;YACjD,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YAChC,WAAW,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,UAAU;gBAAE,OAAO,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,OAAO;QACL,eAAe,CAAC,IAAY;YAC1B,IAAI,aAAa,GAAG,QAAQ,CAAC;YAC7B,IAAI,WAAW,GAAG,EAAE,CAAC;YAErB,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC;gBAC1D,IAAI,QAAQ,IAAI,aAAa;oBAAE,MAAM;gBACrC,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBACjD,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,GAAG,aAAa,EAAE,CAAC;oBAC3C,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC;oBAC7B,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC;gBAC3B,CAAC;YACH,CAAC;YACD,OAAO,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACzE,CAAC;QAED,uBAAuB,CAAC,IAAY;YAClC,IAAI,gBAAgB,GAAG,CAAC,CAAC;YACzB,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC;gBAC1D,MAAM,aAAa,GAAG,wBAAwB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC/D,IAAI,aAAa,GAAG,CAAC,IAAI,QAAQ,GAAG,aAAa,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;oBAClE,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,aAAa,CAAC,CAAC;gBAC/D,CAAC;YACH,CAAC;YACD,OAAO,gBAAgB,CAAC;QAC1B,CAAC;QAED,eAAe,CAAC,KAAa,EAAE,cAAsB,CAAC;YACpD,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,QAAQ,GAAG,GAAG,KAAK,IAAI,GAAG,EAAE,CAAC;gBACnC,IAAI,QAAQ,GAAG,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAE/C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC3B,QAAQ,GAAG,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;oBACnC,IAAI,iBAAiB,CAAC,IAAI,IAAI,cAAc,EAAE,CAAC;wBAC7C,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAC7D,CAAC,EACD,cAAc,GAAG,CAAC,CACnB,CAAC;wBACF,KAAK,MAAM,GAAG,IAAI,YAAY;4BAAE,iBAAiB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBAChE,CAAC;oBACD,iBAAiB,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBAC5C,CAAC;gBAED,IAAI,QAAQ,IAAI,WAAW;oBAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjD,CAAC;YACD,OAAO,OAAO,CAAC;QACjB,CAAC;QAED,UAAU;YACR,iBAAiB,CAAC,KAAK,EAAE,CAAC;QAC5B,CAAC;KACF,CAAC;AACJ,CAAC"}

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

@@ -1,130 +1,92 @@
-import { PrefixTree } from "./PrefixTree.js";
-export class StreamTagDetector {
-    buffer = "";
-    static MAX_BUFFER_SIZE = 100000; // 100k chars safety limit
-    // Tags we want to detect.
-    // We strictly look for the start of a tool block or the end of one.
-    // Also includes Llama 3 variations and control tokens.
-    tags = [
-        "<|tool_call_begin|>",
-        "<|tool_call_end|>",
-        "<|tool_calls_section_begin|>", // Section begin marker
-        "<|tool_calls_section_end|>", // Section end marker
-        "<|tool_call_id|>", // Some models emit tool IDs separately
-        "<|tool_call_argument_begin|>",
-        "<|tool_call_arguments_begin|>", // Plural variant
-        "<tool>",
-        "</tool>",
-        "<function",
-        "</function>",
-        "<function_calls>",
-        "</function_calls>",
-        "<invoke",
-        "</invoke>",
-        "<thought>",
-        "</thought>",
-        "<tool_code>",
-        "</tool_code>",
-        "<tool_call>",
-        "</tool_call>",
-        "<|eot_id|>", // End of turn marker
-        "<|start_header_id|>", // Header start marker
-        "<|end_header_id|>", // Header end marker
-    ];
-    prefixTree;
-    constructor() {
-        this.prefixTree = new PrefixTree(this.tags);
-    }
-    /**
-     * Processes a chunk of text and returns a status indicating what happened.
-     *
-     * - 'tag': A full tag was found. The returned `text` is content BEFORE the tag. `tag` is the tag itself.
-     *          The buffer will contain any remainder AFTER the tag for the next call.
-     * - 'incomplete': A partial tag was found at the end. `text` is the safe content before it.
-     *                 The buffer holds the partial tag.
-     * - 'content': No tags found. `text` Is the full content. Buffer is empty.
-     */
-    process(chunk) {
-        this.buffer += chunk;
-        // --- Buffer Growth Safety ---
-        if (this.buffer.length > StreamTagDetector.MAX_BUFFER_SIZE) {
-            console.error("[Marie] StreamTagDetector buffer exceeded safety limit. Flushing.");
-            const flushed = this.buffer;
-            this.buffer = "";
-            return { type: "content", text: flushed };
-        }
-        // 1. Check if we have any FULL tags using prefix tree (O(k) complexity)
-        const tagMatch = this.prefixTree.findEarliestTag(this.buffer);
-        if (tagMatch) {
-            // Found a tag!
-            // Emit content up to tag
-            const content = this.buffer.substring(0, tagMatch.index);
-            // Remove content + tag from buffer, keep remainder
-            this.buffer = this.buffer.substring(tagMatch.index + tagMatch.tag.length);
-            console.log(`[Marie] Tag detected: ${tagMatch.tag} at index ${tagMatch.index}`);
-            return { type: "tag", text: content, tag: tagMatch.tag };
-        }
-        // 2. Check for dynamic/malformed tags using regex
-        const lookbackLength = Math.min(200, this.buffer.length);
-        const recentBuffer = this.buffer.substring(this.buffer.length - lookbackLength);
-        // IMPORTANT: Keep this strict to avoid treating normal HTML/text tags
-        // (e.g. <script>, </button>) as tool tags.
-        // We only accept:
-        // - LLM control tags like <|tool_call_begin|>
-        // - compact call markers like call:0>
-        // - bracketed tool markers like [Tool Use: name]
-        const dynamicTagPattern = /<\|[\w_]{3,}(?:\|>|>)?|(?:^|[^a-zA-Z0-9_])(call:\d+>)|(?:^|[\s,])(\[Tool (?:Use|Result):[^\]]+\])/g;
-        const matches = Array.from(recentBuffer.matchAll(dynamicTagPattern));
-        if (matches.length > 0) {
-            const lastMatch = matches[matches.length - 1];
-            // If we have a capture group (index 1 or 2), use it, otherwise use the full match
-            const potentialTag = lastMatch[2] || lastMatch[1] || lastMatch[0];
-            // If it's a perfect match for a known tag or matches our dynamic pattern
-            // If we used a capture group, we need to adjust the index to point to that group specifically
-            const matchIndex = this.buffer.length -
-                lookbackLength +
-                lastMatch.index +
-                (lastMatch[0].length - potentialTag.length);
-            // Check if this is a definite tag (ends with > or ] or is a known tag)
-            if (potentialTag.endsWith(">") ||
-                potentialTag.endsWith("]") ||
-                this.tags.includes(potentialTag)) {
-                const content = this.buffer.substring(0, matchIndex);
-                this.buffer = this.buffer.substring(matchIndex + potentialTag.length);
-                console.log(`[Marie] Dynamic tag detected: ${potentialTag}`);
-                return { type: "tag", text: content, tag: potentialTag };
+import { createPrefixTree } from "./PrefixTree.js";
+const MAX_BUFFER_SIZE = 100000; // 100k chars safety limit
+// Tags we want to detect.
+const DEFAULT_TAGS = [
+    "<|tool_call_begin|>",
+    "<|tool_call_end|>",
+    "<|tool_calls_section_begin|>", // Section begin marker
+    "<|tool_calls_section_end|>", // Section end marker
+    "<|tool_call_id|>", // Some models emit tool IDs separately
+    "<|tool_call_argument_begin|>",
+    "<|tool_call_arguments_begin|>", // Plural variant
+    "<tool>",
+    "</tool>",
+    "<function",
+    "</function>",
+    "<function_calls>",
+    "</function_calls>",
+    "<invoke",
+    "</invoke>",
+    "<thought>",
+    "</thought>",
+    "<tool_code>",
+    "</tool_code>",
+    "<tool_call>",
+    "</tool_call>",
+    "<|eot_id|>", // End of turn marker
+    "<|start_header_id|>", // Header start marker
+    "<|end_header_id|>", // Header end marker
+];
+export function createStreamTagDetector() {
+    let buffer = "";
+    const prefixTree = createPrefixTree(DEFAULT_TAGS);
+    return {
+        process(chunk) {
+            buffer += chunk;
+            if (buffer.length > MAX_BUFFER_SIZE) {
+                console.error("[Marie] StreamTagDetector buffer exceeded safety limit. Flushing.");
+                const flushed = buffer;
+                buffer = "";
+                return { type: "content", text: flushed };
             }
-        }
-        // 3. Check for partials (both prefix tree and dynamic)
-        const partialLength = this.prefixTree.findLongestPartialAtEnd(this.buffer);
-        // Dynamic partial check (strict): only hold potential control-tag prefixes,
-        // not generic trailing words/text.
-        const trailingControlTag = this.buffer.match(/<\|[\w_]*$/);
-        const trailingCallMarker = this.buffer.match(/call:\d*$/);
-        const dynamicPartialLength = Math.max(trailingControlTag ? trailingControlTag[0].length : 0, trailingCallMarker ? trailingCallMarker[0].length : 0);
-        const maxPartial = Math.max(partialLength, dynamicPartialLength);
-        if (maxPartial > 0) {
-            const unsafeStart = this.buffer.length - maxPartial;
-            const content = this.buffer.substring(0, unsafeStart);
-            this.buffer = this.buffer.substring(unsafeStart);
-            return { type: "incomplete", text: content };
-        }
-        // 4. No tags, no partials. Emit all.
-        const allContent = this.buffer;
-        this.buffer = "";
-        return { type: "content", text: allContent };
-    }
-    /**
-     * Resets the internal buffer. Useful for cleanup between sessions.
-     */
-    reset() {
-        this.buffer = "";
-    }
-    /**
-     * Returns the current buffer size for monitoring.
-     */
-    getBufferSize() {
-        return this.buffer.length;
-    }
+            const tagMatch = prefixTree.findEarliestTag(buffer);
+            if (tagMatch) {
+                const content = buffer.substring(0, tagMatch.index);
+                buffer = buffer.substring(tagMatch.index + tagMatch.tag.length);
+                console.log(`[Marie] Tag detected: ${tagMatch.tag} at index ${tagMatch.index}`);
+                return { type: "tag", text: content, tag: tagMatch.tag };
+            }
+            const lookbackLength = Math.min(200, buffer.length);
+            const recentBuffer = buffer.substring(buffer.length - lookbackLength);
+            const dynamicTagPattern = /<\|[\w_]{3,}(?:\|>|>)?|(?:^|[^a-zA-Z0-9_])(call:\d+>)|(?:^|[\s,])(\[Tool (?:Use|Result):[^\]]+\])/g;
+            const matches = Array.from(recentBuffer.matchAll(dynamicTagPattern));
+            if (matches.length > 0) {
+                const lastMatch = matches[matches.length - 1];
+                const potentialTag = lastMatch[2] || lastMatch[1] || lastMatch[0];
+                const matchIndex = buffer.length -
+                    lookbackLength +
+                    lastMatch.index +
+                    (lastMatch[0].length - potentialTag.length);
+                if (potentialTag.endsWith(">") ||
+                    potentialTag.endsWith("]") ||
+                    DEFAULT_TAGS.includes(potentialTag)) {
+                    const content = buffer.substring(0, matchIndex);
+                    buffer = buffer.substring(matchIndex + potentialTag.length);
+                    console.log(`[Marie] Dynamic tag detected: ${potentialTag}`);
+                    return { type: "tag", text: content, tag: potentialTag };
+                }
+            }
+            const partialLength = prefixTree.findLongestPartialAtEnd(buffer);
+            const trailingControlTag = buffer.match(/<\|[\w_]*$/);
+            const trailingCallMarker = buffer.match(/call:\d*$/);
+            const dynamicPartialLength = Math.max(trailingControlTag ? trailingControlTag[0].length : 0, trailingCallMarker ? trailingCallMarker[0].length : 0);
+            const maxPartial = Math.max(partialLength, dynamicPartialLength);
+            if (maxPartial > 0) {
+                const unsafeStart = buffer.length - maxPartial;
+                const content = buffer.substring(0, unsafeStart);
+                buffer = buffer.substring(unsafeStart);
+                return { type: "incomplete", text: content };
+            }
+            const allContent = buffer;
+            buffer = "";
+            return { type: "content", text: allContent };
+        },
+        reset() {
+            buffer = "";
+        },
+        getBufferSize() {
+            return buffer.length;
+        },
+    };
 }
 //# sourceMappingURL=StreamTagDetector.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"StreamTagDetector.js","sourceRoot":"","sources":["../../../../src/monolith/plumbing/utils/StreamTagDetector.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,MAAM,OAAO,iBAAiB;IACpB,MAAM,GAAW,EAAE,CAAC;IACpB,MAAM,CAAU,eAAe,GAAG,MAAM,CAAC,CAAC,0BAA0B;IAE5E,0BAA0B;IAC1B,oEAAoE;IACpE,uDAAuD;IAC/C,IAAI,GAAa;QACvB,qBAAqB;QACrB,mBAAmB;QACnB,8BAA8B,EAAE,uBAAuB;QACvD,4BAA4B,EAAE,qBAAqB;QACnD,kBAAkB,EAAE,uCAAuC;QAC3D,8BAA8B;QAC9B,+BAA+B,EAAE,iBAAiB;QAClD,QAAQ;QACR,SAAS;QACT,WAAW;QACX,aAAa;QACb,kBAAkB;QAClB,mBAAmB;QACnB,SAAS;QACT,WAAW;QACX,WAAW;QACX,YAAY;QACZ,aAAa;QACb,cAAc;QACd,aAAa;QACb,cAAc;QACd,YAAY,EAAE,qBAAqB;QACnC,qBAAqB,EAAE,sBAAsB;QAC7C,mBAAmB,EAAE,oBAAoB;KAC1C,CAAC;IAEM,UAAU,CAAa;IAE/B;QACE,IAAI,CAAC,UAAU,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;IAED;;;;;;;;OAQG;IACI,OAAO,CAAC,KAAa;QAM1B,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC;QAErB,+BAA+B;QAC/B,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,iBAAiB,CAAC,eAAe,EAAE,CAAC;YAC3D,OAAO,CAAC,KAAK,CACX,mEAAmE,CACpE,CAAC;YACF,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;YAC5B,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;YACjB,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAC5C,CAAC;QAED,wEAAwE;QACxE,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAE9D,IAAI,QAAQ,EAAE,CAAC;YACb,eAAe;YACf,yBAAyB;YACzB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YACzD,mDAAmD;YACnD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAE1E,OAAO,CAAC,GAAG,CACT,yBAAyB,QAAQ,CAAC,GAAG,aAAa,QAAQ,CAAC,KAAK,EAAE,CACnE,CAAC;YACF,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC;QAC3D,CAAC;QAED,kDAAkD;QAClD,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACzD,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CACxC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,cAAc,CACpC,CAAC;QAEF,sEAAsE;QACtE,2CAA2C;QAC3C,kBAAkB;QAClB,8CAA8C;QAC9C,sCAAsC;QACtC,iDAAiD;QACjD,MAAM,iBAAiB,GACrB,oGAAoG,CAAC;QACvG,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAErE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9C,kFAAkF;YAClF,MAAM,YAAY,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;YAElE,yEAAyE;YACzE,8FAA8F;YAC9F,MAAM,UAAU,GACd,IAAI,CAAC,MAAM,CAAC,MAAM;gBAClB,cAAc;gBACd,SAAS,CAAC,KAAM;gBAChB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;YAE9C,uEAAuE;YACvE,IACE,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAC1B,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,EAChC,CAAC;gBACD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;gBACrD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;gBACtE,OAAO,CAAC,GAAG,CAAC,iCAAiC,YAAY,EAAE,CAAC,CAAC;gBAC7D,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,EAAE,CAAC;YAC3D,CAAC;QACH,CAAC;QAED,uDAAuD;QACvD,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAE3E,4EAA4E;QAC5E,mCAAmC;QACnC,MAAM,kBAAkB,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAC3D,MAAM,kBAAkB,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC1D,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CACnC,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EACrD,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CACtD,CAAC;QAEF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,oBAAoB,CAAC,CAAC;QAEjE,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,UAAU,CAAC;YACpD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;YACtD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;YACjD,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAC/C,CAAC;QAED,qCAAqC;QACrC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;QAC/B,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;IAC/C,CAAC;IAED;;OAEG;IACI,KAAK;QACV,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;IACnB,CAAC;IAED;;OAEG;IACI,aAAa;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC"}
+{"version":3,"file":"StreamTagDetector.js","sourceRoot":"","sources":["../../../../src/monolith/plumbing/utils/StreamTagDetector.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAanD,MAAM,eAAe,GAAG,MAAM,CAAC,CAAC,0BAA0B;AAE1D,0BAA0B;AAC1B,MAAM,YAAY,GAAG;IACnB,qBAAqB;IACrB,mBAAmB;IACnB,8BAA8B,EAAE,uBAAuB;IACvD,4BAA4B,EAAE,qBAAqB;IACnD,kBAAkB,EAAE,uCAAuC;IAC3D,8BAA8B;IAC9B,+BAA+B,EAAE,iBAAiB;IAClD,QAAQ;IACR,SAAS;IACT,WAAW;IACX,aAAa;IACb,kBAAkB;IAClB,mBAAmB;IACnB,SAAS;IACT,WAAW;IACX,WAAW;IACX,YAAY;IACZ,aAAa;IACb,cAAc;IACd,aAAa;IACb,cAAc;IACd,YAAY,EAAE,qBAAqB;IACnC,qBAAqB,EAAE,sBAAsB;IAC7C,mBAAmB,EAAE,oBAAoB;CAC1C,CAAC;AAEF,MAAM,UAAU,uBAAuB;IACrC,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,MAAM,UAAU,GAAG,gBAAgB,CAAC,YAAY,CAAC,CAAC;IAElD,OAAO;QACL,OAAO,CAAC,KAAa;YACnB,MAAM,IAAI,KAAK,CAAC;YAEhB,IAAI,MAAM,CAAC,MAAM,GAAG,eAAe,EAAE,CAAC;gBACpC,OAAO,CAAC,KAAK,CACX,mEAAmE,CACpE,CAAC;gBACF,MAAM,OAAO,GAAG,MAAM,CAAC;gBACvB,MAAM,GAAG,EAAE,CAAC;gBACZ,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;YAC5C,CAAC;YAED,MAAM,QAAQ,GAAG,UAAU,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;YAEpD,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;gBACpD,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAEhE,OAAO,CAAC,GAAG,CACT,yBAAyB,QAAQ,CAAC,GAAG,aAAa,QAAQ,CAAC,KAAK,EAAE,CACnE,CAAC;gBACF,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC;YAC3D,CAAC;YAED,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;YACpD,MAAM,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,GAAG,cAAc,CAAC,CAAC;YAEtE,MAAM,iBAAiB,GACrB,oGAAoG,CAAC;YACvG,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC;YAErE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC9C,MAAM,YAAY,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;gBAElE,MAAM,UAAU,GACd,MAAM,CAAC,MAAM;oBACb,cAAc;oBACd,SAAS,CAAC,KAAM;oBAChB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;gBAE9C,IACE,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC;oBAC1B,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC;oBAC1B,YAAY,CAAC,QAAQ,CAAC,YAAY,CAAC,EACnC,CAAC;oBACD,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;oBAChD,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;oBAC5D,OAAO,CAAC,GAAG,CAAC,iCAAiC,YAAY,EAAE,CAAC,CAAC;oBAC7D,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,YAAY,EAAE,CAAC;gBAC3D,CAAC;YACH,CAAC;YAED,MAAM,aAAa,GAAG,UAAU,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC;YACjE,MAAM,kBAAkB,GAAG,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;YACtD,MAAM,kBAAkB,GAAG,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YACrD,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CACnC,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EACrD,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CACtD,CAAC;YAEF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,oBAAoB,CAAC,CAAC;YAEjE,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;gBACnB,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,GAAG,UAAU,CAAC;gBAC/C,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBACjD,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;gBACvC,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;YAC/C,CAAC;YAED,MAAM,UAAU,GAAG,MAAM,CAAC;YAC1B,MAAM,GAAG,EAAE,CAAC;YACZ,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;QAC/C,CAAC;QAED,KAAK;YACH,MAAM,GAAG,EAAE,CAAC;QACd,CAAC;QAED,aAAa;YACX,OAAO,MAAM,CAAC,MAAM,CAAC;QACvB,CAAC;KACF,CAAC;AACJ,CAAC"}