@noorm/marie-cli 0.1.0

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

@@ -0,0 +1,153 @@
+import { StringUtils } from "./StringUtils.js";
+/**
+ * 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;
+        for (const char of tag) {
+            if (!node.children.has(char)) {
+                node.children.set(char, { children: new Map(), isEndOfTag: false });
+            }
+            node = node.children.get(char);
+        }
+        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;
+        let firstMatch = null;
+        for (let i = startIdx; i < text.length; i++) {
+            const char = text[i];
+            if (!node.children.has(char)) {
+                // Can't continue matching
+                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;
+        let matchLength = 0;
+        for (let i = startIdx; i < text.length; i++) {
+            const char = text[i];
+            if (!node.children.has(char)) {
+                return matchLength;
+            }
+            node = node.children.get(char);
+            matchLength++;
+            if (node.isEndOfTag) {
+                // This is a complete tag, not a partial
+                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);
+                    }
+                }
+                this.editDistanceCache.set(cacheKey, distance);
+            }
+            if (distance <= maxDistance) {
+                similar.push(tag);
+            }
+        }
+        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();
+    }
+}
+//# sourceMappingURL=PrefixTree.js.map

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

@@ -0,0 +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"}

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

@@ -0,0 +1,141 @@
+/**
+ * Error category classification for retry behavior.
+ */
+export var ErrorCategory;
+(function (ErrorCategory) {
+    ErrorCategory["TRANSIENT"] = "TRANSIENT";
+    ErrorCategory["PERMANENT"] = "PERMANENT";
+    ErrorCategory["UNKNOWN"] = "UNKNOWN";
+})(ErrorCategory || (ErrorCategory = {}));
+/**
+ * Retry configuration and utilities for handling transient errors.
+ */
+export class RetryConfig {
+    maxRetries = 3;
+    baseDelayMs = 100;
+    maxDelayMs = 5000;
+    // Errors that are definitely retryable (transient)
+    transientErrors = [
+        "ECONNRESET",
+        "ETIMEDOUT",
+        "ENOTFOUND",
+        "ECONNREFUSED",
+        "timeout",
+        "throttle",
+        "rate limit",
+        "too many requests",
+        "429",
+        "503",
+        "504",
+    ];
+    // Errors that are definitely NOT retryable (permanent)
+    permanentErrors = [
+        "EACCES",
+        "EPERM",
+        "permission denied",
+        "unauthorized",
+        "forbidden",
+        "401",
+        "403",
+        "invalid",
+        "validation",
+        "not found",
+        "404",
+    ];
+    /**
+     * Categorize an error based on its message.
+     */
+    categorizeError(errorMessage) {
+        const lowerMessage = errorMessage.toLowerCase();
+        // Check if it's a known transient error
+        if (this.transientErrors.some((err) => lowerMessage.includes(err.toLowerCase()))) {
+            return ErrorCategory.TRANSIENT;
+        }
+        // Check if it's a known permanent error
+        if (this.permanentErrors.some((err) => lowerMessage.includes(err.toLowerCase()))) {
+            return ErrorCategory.PERMANENT;
+        }
+        return ErrorCategory.UNKNOWN;
+    }
+    /**
+     * Check if an error message indicates a retryable error.
+     */
+    isRetryable(errorMessage) {
+        const category = this.categorizeError(errorMessage);
+        // Only retry transient errors, not permanent or unknown
+        return category === ErrorCategory.TRANSIENT;
+    }
+    /**
+     * Calculate exponential backoff delay.
+     */
+    getBackoffDelay(attemptNumber) {
+        const delay = this.baseDelayMs * Math.pow(2, attemptNumber);
+        // Add jitter (randomness) to prevent thundering herd
+        const jitter = Math.random() * 0.3 * delay;
+        return Math.min(delay + jitter, this.maxDelayMs);
+    }
+}
+/**
+ * Execute a function with retry logic, respecting an AbortSignal.
+ */
+export async function withRetry(fn, config, context, signal) {
+    let lastError = null;
+    for (let attempt = 0; attempt <= config.maxRetries; attempt++) {
+        if (signal?.aborted) {
+            throw new Error(`${context}: Aborted by user.`);
+        }
+        try {
+            return await fn();
+        }
+        catch (error) {
+            lastError = error;
+            const errorMessage = error?.message || String(error);
+            const category = config.categorizeError(errorMessage);
+            // Log error category for debugging
+            if (attempt === 0) {
+                console.log(`[Marie] ${context}: Error category: ${category}`);
+            }
+            // Don't retry if error is permanent
+            if (category === ErrorCategory.PERMANENT) {
+                console.log(`[Marie] ${context}: Permanent error, failing immediately.`);
+                throw error;
+            }
+            // Don't retry if error is unknown (conservative approach)
+            if (category === ErrorCategory.UNKNOWN) {
+                console.log(`[Marie] ${context}: Unknown error type, failing without retry.`);
+                throw error;
+            }
+            // Don't retry if we've exhausted attempts
+            if (attempt >= config.maxRetries) {
+                console.error(`[Marie] ${context}: Max retries (${config.maxRetries}) exceeded.`);
+                throw error;
+            }
+            // Calculate backoff and retry (only for TRANSIENT errors)
+            const delay = config.getBackoffDelay(attempt);
+            console.warn(`[Marie] ${context}: Attempt ${attempt + 1} failed (${category}), retrying in ${Math.round(delay)}ms... Error: ${errorMessage}`);
+            await sleep(delay, signal);
+        }
+    }
+    // Should never reach here, but TypeScript needs it
+    throw lastError || new Error(`${context}: Retry loop failed unexpectedly`);
+}
+/**
+ * Sleep for a specified number of milliseconds, optionally cancellable.
+ */
+function sleep(ms, signal) {
+    return new Promise((resolve, reject) => {
+        const timeout = setTimeout(() => {
+            if (signal)
+                signal.removeEventListener("abort", abortHandler);
+            resolve();
+        }, ms);
+        const abortHandler = () => {
+            clearTimeout(timeout);
+            reject(new Error("Operation aborted."));
+        };
+        if (signal) {
+            signal.addEventListener("abort", abortHandler, { once: true });
+        }
+    });
+}
+//# sourceMappingURL=RetryUtils.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"RetryUtils.js","sourceRoot":"","sources":["../../../../src/monolith/plumbing/utils/RetryUtils.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,CAAN,IAAY,aAIX;AAJD,WAAY,aAAa;IACvB,wCAAuB,CAAA;IACvB,wCAAuB,CAAA;IACvB,oCAAmB,CAAA;AACrB,CAAC,EAJW,aAAa,KAAb,aAAa,QAIxB;AAED;;GAEG;AACH,MAAM,OAAO,WAAW;IACf,UAAU,GAAW,CAAC,CAAC;IACvB,WAAW,GAAW,GAAG,CAAC;IAC1B,UAAU,GAAW,IAAI,CAAC;IAEjC,mDAAmD;IAC5C,eAAe,GAAa;QACjC,YAAY;QACZ,WAAW;QACX,WAAW;QACX,cAAc;QACd,SAAS;QACT,UAAU;QACV,YAAY;QACZ,mBAAmB;QACnB,KAAK;QACL,KAAK;QACL,KAAK;KACN,CAAC;IAEF,uDAAuD;IAChD,eAAe,GAAa;QACjC,QAAQ;QACR,OAAO;QACP,mBAAmB;QACnB,cAAc;QACd,WAAW;QACX,KAAK;QACL,KAAK;QACL,SAAS;QACT,YAAY;QACZ,WAAW;QACX,KAAK;KACN,CAAC;IAEF;;OAEG;IACI,eAAe,CAAC,YAAoB;QACzC,MAAM,YAAY,GAAG,YAAY,CAAC,WAAW,EAAE,CAAC;QAEhD,wCAAwC;QACxC,IACE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAChC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CACzC,EACD,CAAC;YACD,OAAO,aAAa,CAAC,SAAS,CAAC;QACjC,CAAC;QAED,wCAAwC;QACxC,IACE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAChC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CACzC,EACD,CAAC;YACD,OAAO,aAAa,CAAC,SAAS,CAAC;QACjC,CAAC;QAED,OAAO,aAAa,CAAC,OAAO,CAAC;IAC/B,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,YAAoB;QACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;QACpD,wDAAwD;QACxD,OAAO,QAAQ,KAAK,aAAa,CAAC,SAAS,CAAC;IAC9C,CAAC;IAED;;OAEG;IACI,eAAe,CAAC,aAAqB;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;QAC5D,qDAAqD;QACrD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,KAAK,CAAC;QAC3C,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IACnD,CAAC;CACF;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,EAAoB,EACpB,MAAmB,EACnB,OAAe,EACf,MAAoB;IAEpB,IAAI,SAAS,GAAiB,IAAI,CAAC;IAEnC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;QAC9D,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,GAAG,OAAO,oBAAoB,CAAC,CAAC;QAClD,CAAC;QAED,IAAI,CAAC;YACH,OAAO,MAAM,EAAE,EAAE,CAAC;QACpB,CAAC;QAAC,OAAO,KAAU,EAAE,CAAC;YACpB,SAAS,GAAG,KAAK,CAAC;YAClB,MAAM,YAAY,GAAG,KAAK,EAAE,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,MAAM,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;YAEtD,mCAAmC;YACnC,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;gBAClB,OAAO,CAAC,GAAG,CAAC,WAAW,OAAO,qBAAqB,QAAQ,EAAE,CAAC,CAAC;YACjE,CAAC;YAED,oCAAoC;YACpC,IAAI,QAAQ,KAAK,aAAa,CAAC,SAAS,EAAE,CAAC;gBACzC,OAAO,CAAC,GAAG,CACT,WAAW,OAAO,yCAAyC,CAC5D,CAAC;gBACF,MAAM,KAAK,CAAC;YACd,CAAC;YAED,0DAA0D;YAC1D,IAAI,QAAQ,KAAK,aAAa,CAAC,OAAO,EAAE,CAAC;gBACvC,OAAO,CAAC,GAAG,CACT,WAAW,OAAO,8CAA8C,CACjE,CAAC;gBACF,MAAM,KAAK,CAAC;YACd,CAAC;YAED,0CAA0C;YAC1C,IAAI,OAAO,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;gBACjC,OAAO,CAAC,KAAK,CACX,WAAW,OAAO,kBAAkB,MAAM,CAAC,UAAU,aAAa,CACnE,CAAC;gBACF,MAAM,KAAK,CAAC;YACd,CAAC;YAED,0DAA0D;YAC1D,MAAM,KAAK,GAAG,MAAM,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;YAC9C,OAAO,CAAC,IAAI,CACV,WAAW,OAAO,aAAa,OAAO,GAAG,CAAC,YAAY,QAAQ,kBAAkB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,gBAAgB,YAAY,EAAE,CAChI,CAAC;YAEF,MAAM,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,MAAM,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG,OAAO,kCAAkC,CAAC,CAAC;AAC7E,CAAC;AAED;;GAEG;AACH,SAAS,KAAK,CAAC,EAAU,EAAE,MAAoB;IAC7C,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACrC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,EAAE;YAC9B,IAAI,MAAM;gBAAE,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YAC9D,OAAO,EAAE,CAAC;QACZ,CAAC,EAAE,EAAE,CAAC,CAAC;QAEP,MAAM,YAAY,GAAG,GAAG,EAAE;YACxB,YAAY,CAAC,OAAO,CAAC,CAAC;YACtB,MAAM,CAAC,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC;QAEF,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QACjE,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC"}

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

@@ -0,0 +1,128 @@
+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 };
+            }
+        }
+        // 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;
+    }
+}
+//# sourceMappingURL=StreamTagDetector.js.map

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

@@ -0,0 +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,IAAI,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;gBACjG,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"}

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

@@ -0,0 +1,97 @@
+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 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;
+    }
+    /**
+     * 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(" ");
+        }
+        return "";
+    }
+    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;
+    }
+    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;
+    }
+}
+//# sourceMappingURL=StringUtils.js.map

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

@@ -0,0 +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"}

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

@@ -0,0 +1,21 @@
+/**
+ * Executes a promise with a timeout.
+ */
+export async function withTimeout(promise, ms, label) {
+    let timeoutId;
+    const timeoutPromise = new Promise((_, reject) => {
+        timeoutId = setTimeout(() => {
+            reject(new Error(`TimeoutError: ${label} timed out after ${ms}ms`));
+        }, ms);
+    });
+    try {
+        const result = await Promise.race([promise, timeoutPromise]);
+        clearTimeout(timeoutId);
+        return result;
+    }
+    catch (e) {
+        clearTimeout(timeoutId);
+        throw e;
+    }
+}
+//# sourceMappingURL=TimeoutUtils.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"TimeoutUtils.js","sourceRoot":"","sources":["../../../../src/monolith/plumbing/utils/TimeoutUtils.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,OAAmB,EACnB,EAAU,EACV,KAAa;IAEb,IAAI,SAAyB,CAAC;IAC9B,MAAM,cAAc,GAAG,IAAI,OAAO,CAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;QACtD,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE;YAC1B,MAAM,CAAC,IAAI,KAAK,CAAC,iBAAiB,KAAK,oBAAoB,EAAE,IAAI,CAAC,CAAC,CAAC;QACtE,CAAC,EAAE,EAAE,CAAC,CAAC;IACT,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC;QAC7D,YAAY,CAAC,SAAU,CAAC,CAAC;QACzB,OAAO,MAAM,CAAC;IAChB,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,YAAY,CAAC,SAAU,CAAC,CAAC;QACzB,MAAM,CAAC,CAAC;IACV,CAAC;AACH,CAAC"}