@compass-ai/nova 1.0.74 → 1.0.76

package/dist/tools/edit-replacers.js

@@ -1,553 +0,0 @@
-/**
- * Edit Replacer Strategies
- *
- * Multiple fallback strategies for finding and replacing text in files.
- * These handle various whitespace, indentation, and formatting differences
- * that commonly occur when LLMs generate edit operations.
- *
- * Sourced from:
- * - https://github.com/cline/cline/blob/main/evals/diff-edits/diff-apply/diff-06-23-25.ts
- * - https://github.com/google-gemini/gemini-cli/blob/main/packages/core/src/utils/editCorrector.ts
- * - https://github.com/cline/cline/blob/main/evals/diff-edits/diff-apply/diff-06-26-25.ts
- */
-import { logger } from '../utils/logger.js';
-// Similarity thresholds for block anchor fallback matching
-const SINGLE_CANDIDATE_SIMILARITY_THRESHOLD = 0.0;
-const MULTIPLE_CANDIDATES_SIMILARITY_THRESHOLD = 0.3;
-/**
- * Levenshtein distance algorithm implementation
- * Used for fuzzy matching of text blocks
- */
-function levenshtein(a, b) {
-    if (a === '' || b === '') {
-        return Math.max(a.length, b.length);
-    }
-    const matrix = Array.from({ length: a.length + 1 }, (_, i) => Array.from({ length: b.length + 1 }, (_, j) => (i === 0 ? j : j === 0 ? i : 0)));
-    for (let i = 1; i <= a.length; i++) {
-        for (let j = 1; j <= b.length; j++) {
-            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
-            matrix[i][j] = Math.min(matrix[i - 1][j] + 1, matrix[i][j - 1] + 1, matrix[i - 1][j - 1] + cost);
-        }
-    }
-    return matrix[a.length][b.length];
-}
-/**
- * Strategy 1: Simple exact match
- * The most basic strategy - just returns the find string if it exists in content
- */
-export const SimpleReplacer = function* (_content, find) {
-    yield find;
-};
-/**
- * Strategy 2: Line-trimmed matching
- * Trims each line individually and compares trimmed versions.
- * Handles cases where file has different trailing/leading spaces per line.
- */
-export const LineTrimmedReplacer = function* (content, find) {
-    const originalLines = content.split('\n');
-    const searchLines = find.split('\n');
-    // Remove trailing empty line if present (common LLM artifact)
-    if (searchLines[searchLines.length - 1] === '') {
-        searchLines.pop();
-    }
-    for (let i = 0; i <= originalLines.length - searchLines.length; i++) {
-        let matches = true;
-        for (let j = 0; j < searchLines.length; j++) {
-            const originalTrimmed = originalLines[i + j].trim();
-            const searchTrimmed = searchLines[j].trim();
-            if (originalTrimmed !== searchTrimmed) {
-                matches = false;
-                break;
-            }
-        }
-        if (matches) {
-            let matchStartIndex = 0;
-            for (let k = 0; k < i; k++) {
-                matchStartIndex += originalLines[k].length + 1;
-            }
-            let matchEndIndex = matchStartIndex;
-            for (let k = 0; k < searchLines.length; k++) {
-                matchEndIndex += originalLines[i + k].length;
-                if (k < searchLines.length - 1) {
-                    matchEndIndex += 1; // Add newline character except for the last line
-                }
-            }
-            yield content.substring(matchStartIndex, matchEndIndex);
-        }
-    }
-};
-/**
- * Strategy 3: Block anchor matching with fuzzy middle content
- * Uses first and last lines as "anchors" and applies Levenshtein distance
- * for fuzzy matching of the middle content.
- */
-export const BlockAnchorReplacer = function* (content, find) {
-    const originalLines = content.split('\n');
-    const searchLines = find.split('\n');
-    // Need at least 3 lines for anchor-based matching
-    if (searchLines.length < 3) {
-        return;
-    }
-    // Remove trailing empty line if present
-    if (searchLines[searchLines.length - 1] === '') {
-        searchLines.pop();
-    }
-    const firstLineSearch = searchLines[0].trim();
-    const lastLineSearch = searchLines[searchLines.length - 1].trim();
-    const searchBlockSize = searchLines.length;
-    // Collect all candidate positions where both anchors match
-    const candidates = [];
-    for (let i = 0; i < originalLines.length; i++) {
-        if (originalLines[i].trim() !== firstLineSearch) {
-            continue;
-        }
-        // Look for the matching last line after this first line
-        for (let j = i + 2; j < originalLines.length; j++) {
-            if (originalLines[j].trim() === lastLineSearch) {
-                candidates.push({ startLine: i, endLine: j });
-                break; // Only match the first occurrence of the last line
-            }
-        }
-    }
-    // Return immediately if no candidates
-    if (candidates.length === 0) {
-        return;
-    }
-    // Handle single candidate scenario (using relaxed threshold)
-    if (candidates.length === 1) {
-        const { startLine, endLine } = candidates[0];
-        const actualBlockSize = endLine - startLine + 1;
-        let similarity = 0;
-        const linesToCheck = Math.min(searchBlockSize - 2, actualBlockSize - 2);
-        if (linesToCheck > 0) {
-            for (let j = 1; j < searchBlockSize - 1 && j < actualBlockSize - 1; j++) {
-                const originalLine = originalLines[startLine + j].trim();
-                const searchLine = searchLines[j].trim();
-                const maxLen = Math.max(originalLine.length, searchLine.length);
-                if (maxLen === 0) {
-                    continue;
-                }
-                const distance = levenshtein(originalLine, searchLine);
-                similarity += (1 - distance / maxLen) / linesToCheck;
-                // Exit early when threshold is reached
-                if (similarity >= SINGLE_CANDIDATE_SIMILARITY_THRESHOLD) {
-                    break;
-                }
-            }
-        }
-        else {
-            // No middle lines to compare, just accept based on anchors
-            similarity = 1.0;
-        }
-        if (similarity >= SINGLE_CANDIDATE_SIMILARITY_THRESHOLD) {
-            let matchStartIndex = 0;
-            for (let k = 0; k < startLine; k++) {
-                matchStartIndex += originalLines[k].length + 1;
-            }
-            let matchEndIndex = matchStartIndex;
-            for (let k = startLine; k <= endLine; k++) {
-                matchEndIndex += originalLines[k].length;
-                if (k < endLine) {
-                    matchEndIndex += 1;
-                }
-            }
-            yield content.substring(matchStartIndex, matchEndIndex);
-        }
-        return;
-    }
-    // Calculate similarity for multiple candidates
-    let bestMatch = null;
-    let maxSimilarity = -1;
-    for (const candidate of candidates) {
-        const { startLine, endLine } = candidate;
-        const actualBlockSize = endLine - startLine + 1;
-        let similarity = 0;
-        const linesToCheck = Math.min(searchBlockSize - 2, actualBlockSize - 2);
-        if (linesToCheck > 0) {
-            for (let j = 1; j < searchBlockSize - 1 && j < actualBlockSize - 1; j++) {
-                const originalLine = originalLines[startLine + j].trim();
-                const searchLine = searchLines[j].trim();
-                const maxLen = Math.max(originalLine.length, searchLine.length);
-                if (maxLen === 0) {
-                    continue;
-                }
-                const distance = levenshtein(originalLine, searchLine);
-                similarity += 1 - distance / maxLen;
-            }
-            similarity /= linesToCheck; // Average similarity
-        }
-        else {
-            // No middle lines to compare, just accept based on anchors
-            similarity = 1.0;
-        }
-        if (similarity > maxSimilarity) {
-            maxSimilarity = similarity;
-            bestMatch = candidate;
-        }
-    }
-    // Threshold judgment
-    if (maxSimilarity >= MULTIPLE_CANDIDATES_SIMILARITY_THRESHOLD && bestMatch) {
-        const { startLine, endLine } = bestMatch;
-        let matchStartIndex = 0;
-        for (let k = 0; k < startLine; k++) {
-            matchStartIndex += originalLines[k].length + 1;
-        }
-        let matchEndIndex = matchStartIndex;
-        for (let k = startLine; k <= endLine; k++) {
-            matchEndIndex += originalLines[k].length;
-            if (k < endLine) {
-                matchEndIndex += 1;
-            }
-        }
-        yield content.substring(matchStartIndex, matchEndIndex);
-    }
-};
-/**
- * Strategy 4: Whitespace normalized matching
- * Collapses all whitespace (spaces, tabs, newlines) to single spaces.
- * Handles internal whitespace differences like "foo  bar" vs "foo bar".
- */
-export const WhitespaceNormalizedReplacer = function* (content, find) {
-    const normalizeWhitespace = (text) => text.replace(/\s+/g, ' ').trim();
-    const normalizedFind = normalizeWhitespace(find);
-    // Handle single line matches
-    const lines = content.split('\n');
-    for (let i = 0; i < lines.length; i++) {
-        const line = lines[i];
-        if (normalizeWhitespace(line) === normalizedFind) {
-            yield line;
-        }
-        else {
-            // Only check for substring matches if the full line doesn't match
-            const normalizedLine = normalizeWhitespace(line);
-            if (normalizedLine.includes(normalizedFind)) {
-                // Find the actual substring in the original line that matches
-                const words = find.trim().split(/\s+/);
-                if (words.length > 0) {
-                    const pattern = words.map((word) => word.replace(/[.*+?^${}()|[\]\\]/g, '\\$&')).join('\\s+');
-                    try {
-                        const regex = new RegExp(pattern);
-                        const match = line.match(regex);
-                        if (match) {
-                            yield match[0];
-                        }
-                    }
-                    catch {
-                        // Invalid regex pattern, skip
-                    }
-                }
-            }
-        }
-    }
-    // Handle multi-line matches
-    const findLines = find.split('\n');
-    if (findLines.length > 1) {
-        for (let i = 0; i <= lines.length - findLines.length; i++) {
-            const block = lines.slice(i, i + findLines.length);
-            if (normalizeWhitespace(block.join('\n')) === normalizedFind) {
-                yield block.join('\n');
-            }
-        }
-    }
-};
-/**
- * Strategy 5: Indentation flexible matching
- * Removes the minimum indentation from all lines before comparing.
- * Handles cases where the LLM generated code with different base indentation.
- */
-export const IndentationFlexibleReplacer = function* (content, find) {
-    const removeIndentation = (text) => {
-        const lines = text.split('\n');
-        const nonEmptyLines = lines.filter((line) => line.trim().length > 0);
-        if (nonEmptyLines.length === 0)
-            return text;
-        const minIndent = Math.min(...nonEmptyLines.map((line) => {
-            const match = line.match(/^(\s*)/);
-            return match ? match[1].length : 0;
-        }));
-        return lines.map((line) => (line.trim().length === 0 ? line : line.slice(minIndent))).join('\n');
-    };
-    const normalizedFind = removeIndentation(find);
-    const contentLines = content.split('\n');
-    const findLines = find.split('\n');
-    for (let i = 0; i <= contentLines.length - findLines.length; i++) {
-        const block = contentLines.slice(i, i + findLines.length).join('\n');
-        if (removeIndentation(block) === normalizedFind) {
-            yield block;
-        }
-    }
-};
-/**
- * Strategy 6: Escape sequence normalized matching
- * Handles escape sequences that LLMs sometimes output differently.
- * Supports: \n, \t, \r, \', \", \`, \\, \$
- */
-export const EscapeNormalizedReplacer = function* (content, find) {
-    const unescapeString = (str) => {
-        return str.replace(/\\(n|t|r|'|"|`|\\|\n|\$)/g, (match, capturedChar) => {
-            switch (capturedChar) {
-                case 'n':
-                    return '\n';
-                case 't':
-                    return '\t';
-                case 'r':
-                    return '\r';
-                case "'":
-                    return "'";
-                case '"':
-                    return '"';
-                case '`':
-                    return '`';
-                case '\\':
-                    return '\\';
-                case '\n':
-                    return '\n';
-                case '$':
-                    return '$';
-                default:
-                    return match;
-            }
-        });
-    };
-    const unescapedFind = unescapeString(find);
-    // Try direct match with unescaped find string
-    if (content.includes(unescapedFind)) {
-        yield unescapedFind;
-    }
-    // Also try finding escaped versions in content that match unescaped find
-    const lines = content.split('\n');
-    const findLines = unescapedFind.split('\n');
-    for (let i = 0; i <= lines.length - findLines.length; i++) {
-        const block = lines.slice(i, i + findLines.length).join('\n');
-        const unescapedBlock = unescapeString(block);
-        if (unescapedBlock === unescapedFind) {
-            yield block;
-        }
-    }
-};
-/**
- * Strategy 7: Trimmed boundary matching
- * Trims leading and trailing whitespace from the entire search string.
- * Handles cases where the LLM added extra newlines or spaces at boundaries.
- */
-export const TrimmedBoundaryReplacer = function* (content, find) {
-    const trimmedFind = find.trim();
-    if (trimmedFind === find) {
-        // Already trimmed, no point in trying
-        return;
-    }
-    // Try to find the trimmed version
-    if (content.includes(trimmedFind)) {
-        yield trimmedFind;
-    }
-    // Also try finding blocks where trimmed content matches
-    const lines = content.split('\n');
-    const findLines = find.split('\n');
-    for (let i = 0; i <= lines.length - findLines.length; i++) {
-        const block = lines.slice(i, i + findLines.length).join('\n');
-        if (block.trim() === trimmedFind) {
-            yield block;
-        }
-    }
-};
-/**
- * Strategy 8: Context-aware matching
- * Uses first and last lines as context anchors with a 50% similarity threshold.
- * More lenient than BlockAnchorReplacer for middle content.
- */
-export const ContextAwareReplacer = function* (content, find) {
-    const findLines = find.split('\n');
-    if (findLines.length < 3) {
-        // Need at least 3 lines to have meaningful context
-        return;
-    }
-    // Remove trailing empty line if present
-    if (findLines[findLines.length - 1] === '') {
-        findLines.pop();
-    }
-    const contentLines = content.split('\n');
-    // Extract first and last lines as context anchors
-    const firstLine = findLines[0].trim();
-    const lastLine = findLines[findLines.length - 1].trim();
-    // Find blocks that start and end with the context anchors
-    for (let i = 0; i < contentLines.length; i++) {
-        if (contentLines[i].trim() !== firstLine)
-            continue;
-        // Look for the matching last line
-        for (let j = i + 2; j < contentLines.length; j++) {
-            if (contentLines[j].trim() === lastLine) {
-                // Found a potential context block
-                const blockLines = contentLines.slice(i, j + 1);
-                const block = blockLines.join('\n');
-                // Check if the middle content has reasonable similarity
-                // (simple heuristic: at least 50% of non-empty lines should match when trimmed)
-                if (blockLines.length === findLines.length) {
-                    let matchingLines = 0;
-                    let totalNonEmptyLines = 0;
-                    for (let k = 1; k < blockLines.length - 1; k++) {
-                        const blockLine = blockLines[k].trim();
-                        const findLine = findLines[k].trim();
-                        if (blockLine.length > 0 || findLine.length > 0) {
-                            totalNonEmptyLines++;
-                            if (blockLine === findLine) {
-                                matchingLines++;
-                            }
-                        }
-                    }
-                    if (totalNonEmptyLines === 0 || matchingLines / totalNonEmptyLines >= 0.5) {
-                        yield block;
-                        break; // Only match the first occurrence
-                    }
-                }
-                break;
-            }
-        }
-    }
-};
-/**
- * Strategy 9: Multi-occurrence matching
- * Yields all exact matches, allowing the replace function to handle
- * multiple occurrences based on replaceAll parameter.
- */
-export const MultiOccurrenceReplacer = function* (content, find) {
-    let startIndex = 0;
-    while (true) {
-        const index = content.indexOf(find, startIndex);
-        if (index === -1)
-            break;
-        yield find;
-        startIndex = index + find.length;
-    }
-};
-/**
- * All replacers in order of strictness (most strict to most lenient).
- * The replace function tries each in sequence until one succeeds.
- */
-export const REPLACERS = [
-    SimpleReplacer,
-    LineTrimmedReplacer,
-    BlockAnchorReplacer,
-    WhitespaceNormalizedReplacer,
-    IndentationFlexibleReplacer,
-    EscapeNormalizedReplacer,
-    TrimmedBoundaryReplacer,
-    ContextAwareReplacer,
-    MultiOccurrenceReplacer,
-];
-/**
- * Main replace function that tries all strategies in sequence.
- *
- * @param content - The file content to search in
- * @param oldString - The text to find and replace
- * @param newString - The replacement text
- * @param replaceAll - Whether to replace all occurrences (default: false)
- * @returns The modified content
- * @throws Error if oldString equals newString, or if no match is found, or if multiple matches found without replaceAll
- */
-/**
- * Detects the line ending style used in the content.
- * Returns 'crlf' if CRLF is predominant, 'lf' otherwise.
- */
-function detectLineEnding(content) {
-    const crlfCount = (content.match(/\r\n/g) || []).length;
-    const lfOnlyCount = (content.match(/(?<!\r)\n/g) || []).length;
-    return crlfCount > lfOnlyCount ? 'crlf' : 'lf';
-}
-/**
- * Converts line endings in the newString to match the original content's style.
- * This ensures consistent line endings after edits.
- */
-function matchLineEndings(newString, targetStyle) {
-    // First normalize to LF
-    const normalized = newString.replace(/\r\n/g, '\n').replace(/\r/g, '\n');
-    // Then convert to target style
-    if (targetStyle === 'crlf') {
-        return normalized.replace(/\n/g, '\r\n');
-    }
-    return normalized;
-}
-export function replaceWithStrategies(content, oldString, newString, replaceAll = false) {
-    // Detect line ending style to preserve it
-    const lineEndingStyle = detectLineEnding(content);
-    // Convert newString to match the original content's line endings
-    const adaptedNewString = matchLineEndings(newString, lineEndingStyle);
-    // Validate inputs to provide clear error messages
-    if (content === undefined || content === null) {
-        throw new Error('edit_file failed: file content is undefined or null');
-    }
-    if (oldString === undefined || oldString === null) {
-        throw new Error('edit_file failed: oldText is undefined or null - ensure the edit object has a valid "oldText" property');
-    }
-    if (newString === undefined || newString === null) {
-        throw new Error('edit_file failed: newText is undefined or null - ensure the edit object has a valid "newText" property');
-    }
-    // Compare normalized versions to ignore line ending differences
-    const normalizedOld = matchLineEndings(oldString, 'lf');
-    const normalizedNew = matchLineEndings(newString, 'lf');
-    if (normalizedOld === normalizedNew) {
-        // Provide more helpful diagnostic information
-        const preview = oldString.length > 100 ? oldString.slice(0, 100) + '...' : oldString;
-        const alreadyInFile = content.includes(newString) || content.includes(adaptedNewString);
-        // Log for debugging
-        logger.debug('Edit rejected: oldString === newString', {
-            length: oldString.length,
-            preview: preview.replace(/\n/g, '\\n'),
-            alreadyInFile,
-        });
-        let errorMsg = 'oldText and newText are identical - no change to make.';
-        if (alreadyInFile) {
-            errorMsg += ' The file already contains this text. The change may have already been applied.';
-        }
-        errorMsg += ` (text: "${preview.replace(/\n/g, '\\n')}")`;
-        throw new Error(errorMsg);
-    }
-    let notFound = true;
-    const strategyNames = [
-        'SimpleReplacer',
-        'LineTrimmedReplacer',
-        'BlockAnchorReplacer',
-        'WhitespaceNormalizedReplacer',
-        'IndentationFlexibleReplacer',
-        'EscapeNormalizedReplacer',
-        'TrimmedBoundaryReplacer',
-        'ContextAwareReplacer',
-        'MultiOccurrenceReplacer',
-    ];
-    for (let idx = 0; idx < REPLACERS.length; idx++) {
-        const replacer = REPLACERS[idx];
-        const strategyName = strategyNames[idx];
-        for (const search of replacer(content, oldString)) {
-            const index = content.indexOf(search);
-            if (index === -1)
-                continue;
-            notFound = false;
-            if (replaceAll) {
-                return {
-                    content: content.replaceAll(search, adaptedNewString),
-                    strategy: strategyName,
-                    matchedText: search,
-                };
-            }
-            const lastIndex = content.lastIndexOf(search);
-            if (index !== lastIndex)
-                continue; // Multiple occurrences, try next strategy
-            return {
-                content: content.substring(0, index) + adaptedNewString + content.substring(index + search.length),
-                strategy: strategyName,
-                matchedText: search,
-            };
-        }
-    }
-    if (notFound) {
-        throw new Error('oldString not found in content');
-    }
-    throw new Error('Found multiple matches for oldString. Provide more surrounding lines in oldString to identify the correct match.');
-}
-/**
- * Simple replace function (compatible with existing API).
- * Returns just the modified content string.
- */
-export function replace(content, oldString, newString, replaceAll = false) {
-    return replaceWithStrategies(content, oldString, newString, replaceAll).content;
-}
-//# sourceMappingURL=edit-replacers.js.map

package/dist/tools/edit-replacers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"edit-replacers.js","sourceRoot":"","sources":["../../src/tools/edit-replacers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAQ5C,2DAA2D;AAC3D,MAAM,qCAAqC,GAAG,GAAG,CAAC;AAClD,MAAM,wCAAwC,GAAG,GAAG,CAAC;AAErD;;;GAGG;AACH,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS;IACvC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC3D,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAChF,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CACrB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EACpB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EACpB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAC5B,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACpC,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,cAAc,GAAa,QAAQ,CAAC,EAAE,QAAQ,EAAE,IAAI;IAC/D,MAAM,IAAI,CAAC;AACb,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IACnE,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAErC,8DAA8D;IAC9D,IAAI,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/C,WAAW,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,aAAa,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpE,IAAI,OAAO,GAAG,IAAI,CAAC;QAEnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,eAAe,GAAG,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACpD,MAAM,aAAa,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAE5C,IAAI,eAAe,KAAK,aAAa,EAAE,CAAC;gBACtC,OAAO,GAAG,KAAK,CAAC;gBAChB,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,eAAe,GAAG,CAAC,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,eAAe,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;YACjD,CAAC;YAED,IAAI,aAAa,GAAG,eAAe,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,aAAa,IAAI,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;gBAC7C,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC/B,aAAa,IAAI,CAAC,CAAC,CAAC,iDAAiD;gBACvE,CAAC;YACH,CAAC;YAED,MAAM,OAAO,CAAC,SAAS,CAAC,eAAe,EAAE,aAAa,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IACnE,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAErC,kDAAkD;IAClD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,OAAO;IACT,CAAC;IAED,wCAAwC;IACxC,IAAI,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/C,WAAW,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IAED,MAAM,eAAe,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9C,MAAM,cAAc,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAClE,MAAM,eAAe,GAAG,WAAW,CAAC,MAAM,CAAC;IAE3C,2DAA2D;IAC3D,MAAM,UAAU,GAAkD,EAAE,CAAC;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,eAAe,EAAE,CAAC;YAChD,SAAS;QACX,CAAC;QAED,wDAAwD;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,cAAc,EAAE,CAAC;gBAC/C,UAAU,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC9C,MAAM,CAAC,mDAAmD;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO;IACT,CAAC;IAED,6DAA6D;IAC7D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,eAAe,GAAG,OAAO,GAAG,SAAS,GAAG,CAAC,CAAC;QAEhD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,CAAC,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC;QAExE,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,GAAG,CAAC,IAAI,CAAC,GAAG,eAAe,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxE,MAAM,YAAY,GAAG,aAAa,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACzD,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACzC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;gBAChE,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;oBACjB,SAAS;gBACX,CAAC;gBACD,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;gBACvD,UAAU,IAAI,CAAC,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC,GAAG,YAAY,CAAC;gBAErD,uCAAuC;gBACvC,IAAI,UAAU,IAAI,qCAAqC,EAAE,CAAC;oBACxD,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,2DAA2D;YAC3D,UAAU,GAAG,GAAG,CAAC;QACnB,CAAC;QAED,IAAI,UAAU,IAAI,qCAAqC,EAAE,CAAC;YACxD,IAAI,eAAe,GAAG,CAAC,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,eAAe,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;YACjD,CAAC;YACD,IAAI,aAAa,GAAG,eAAe,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,aAAa,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACzC,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;oBAChB,aAAa,IAAI,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;YACD,MAAM,OAAO,CAAC,SAAS,CAAC,eAAe,EAAE,aAAa,CAAC,CAAC;QAC1D,CAAC;QACD,OAAO;IACT,CAAC;IAED,+CAA+C;IAC/C,IAAI,SAAS,GAAkD,IAAI,CAAC;IACpE,IAAI,aAAa,GAAG,CAAC,CAAC,CAAC;IAEvB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,SAAS,CAAC;QACzC,MAAM,eAAe,GAAG,OAAO,GAAG,SAAS,GAAG,CAAC,CAAC;QAEhD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,CAAC,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC;QAExE,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,GAAG,CAAC,IAAI,CAAC,GAAG,eAAe,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxE,MAAM,YAAY,GAAG,aAAa,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACzD,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACzC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;gBAChE,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;oBACjB,SAAS;gBACX,CAAC;gBACD,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;gBACvD,UAAU,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;YACtC,CAAC;YACD,UAAU,IAAI,YAAY,CAAC,CAAC,qBAAqB;QACnD,CAAC;aAAM,CAAC;YACN,2DAA2D;YAC3D,UAAU,GAAG,GAAG,CAAC;QACnB,CAAC;QAED,IAAI,UAAU,GAAG,aAAa,EAAE,CAAC;YAC/B,aAAa,GAAG,UAAU,CAAC;YAC3B,SAAS,GAAG,SAAS,CAAC;QACxB,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,IAAI,aAAa,IAAI,wCAAwC,IAAI,SAAS,EAAE,CAAC;QAC3E,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,SAAS,CAAC;QACzC,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,eAAe,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;QACjD,CAAC;QACD,IAAI,aAAa,GAAG,eAAe,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,aAAa,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACzC,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;gBAChB,aAAa,IAAI,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,MAAM,OAAO,CAAC,SAAS,CAAC,eAAe,EAAE,aAAa,CAAC,CAAC;IAC1D,CAAC;AACH,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IAC5E,MAAM,mBAAmB,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/E,MAAM,cAAc,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAEjD,6BAA6B;IAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,mBAAmB,CAAC,IAAI,CAAC,KAAK,cAAc,EAAE,CAAC;YACjD,MAAM,IAAI,CAAC;QACb,CAAC;aAAM,CAAC;YACN,kEAAkE;YAClE,MAAM,cAAc,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;YACjD,IAAI,cAAc,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC5C,8DAA8D;gBAC9D,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBACvC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACrB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC9F,IAAI,CAAC;wBACH,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;wBAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;wBAChC,IAAI,KAAK,EAAE,CAAC;4BACV,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;wBACjB,CAAC;oBACH,CAAC;oBAAC,MAAM,CAAC;wBACP,8BAA8B;oBAChC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,4BAA4B;IAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1D,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;YACnD,IAAI,mBAAmB,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,cAAc,EAAE,CAAC;gBAC7D,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IAC3E,MAAM,iBAAiB,GAAG,CAAC,IAAY,EAAE,EAAE;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrE,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAE5C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CACxB,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACnC,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CACH,CAAC;QAEF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnG,CAAC,CAAC;IAEF,MAAM,cAAc,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjE,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,IAAI,iBAAiB,CAAC,KAAK,CAAC,KAAK,cAAc,EAAE,CAAC;YAChD,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IACxE,MAAM,cAAc,GAAG,CAAC,GAAW,EAAU,EAAE;QAC7C,OAAO,GAAG,CAAC,OAAO,CAAC,2BAA2B,EAAE,CAAC,KAAK,EAAE,YAAY,EAAE,EAAE;YACtE,QAAQ,YAAY,EAAE,CAAC;gBACrB,KAAK,GAAG;oBACN,OAAO,IAAI,CAAC;gBACd,KAAK,GAAG;oBACN,OAAO,IAAI,CAAC;gBACd,KAAK,GAAG;oBACN,OAAO,IAAI,CAAC;gBACd,KAAK,GAAG;oBACN,OAAO,GAAG,CAAC;gBACb,KAAK,GAAG;oBACN,OAAO,GAAG,CAAC;gBACb,KAAK,GAAG;oBACN,OAAO,GAAG,CAAC;gBACb,KAAK,IAAI;oBACP,OAAO,IAAI,CAAC;gBACd,KAAK,IAAI;oBACP,OAAO,IAAI,CAAC;gBACd,KAAK,GAAG;oBACN,OAAO,GAAG,CAAC;gBACb;oBACE,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,MAAM,aAAa,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IAE3C,8CAA8C;IAC9C,IAAI,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;QACpC,MAAM,aAAa,CAAC;IACtB,CAAC;IAED,yEAAyE;IACzE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,SAAS,GAAG,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAE5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1D,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,MAAM,cAAc,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QAE7C,IAAI,cAAc,KAAK,aAAa,EAAE,CAAC;YACrC,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IACvE,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAEhC,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;QACzB,sCAAsC;QACtC,OAAO;IACT,CAAC;IAED,kCAAkC;IAClC,IAAI,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QAClC,MAAM,WAAW,CAAC;IACpB,CAAC;IAED,wDAAwD;IACxD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1D,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE9D,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,WAAW,EAAE,CAAC;YACjC,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IACpE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,mDAAmD;QACnD,OAAO;IACT,CAAC;IAED,wCAAwC;IACxC,IAAI,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC3C,SAAS,CAAC,GAAG,EAAE,CAAC;IAClB,CAAC;IAED,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEzC,kDAAkD;IAClD,MAAM,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAExD,0DAA0D;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,SAAS;YAAE,SAAS;QAEnD,kCAAkC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,QAAQ,EAAE,CAAC;gBACxC,kCAAkC;gBAClC,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChD,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAEpC,wDAAwD;gBACxD,gFAAgF;gBAChF,IAAI,UAAU,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;oBAC3C,IAAI,aAAa,GAAG,CAAC,CAAC;oBACtB,IAAI,kBAAkB,GAAG,CAAC,CAAC;oBAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC/C,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;wBACvC,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;wBAErC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BAChD,kBAAkB,EAAE,CAAC;4BACrB,IAAI,SAAS,KAAK,QAAQ,EAAE,CAAC;gCAC3B,aAAa,EAAE,CAAC;4BAClB,CAAC;wBACH,CAAC;oBACH,CAAC;oBAED,IAAI,kBAAkB,KAAK,CAAC,IAAI,aAAa,GAAG,kBAAkB,IAAI,GAAG,EAAE,CAAC;wBAC1E,MAAM,KAAK,CAAC;wBACZ,MAAM,CAAC,kCAAkC;oBAC3C,CAAC;gBACH,CAAC;gBACD,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAa,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI;IACvE,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,MAAM;QAExB,MAAM,IAAI,CAAC;QACX,UAAU,GAAG,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;IACnC,CAAC;AACH,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,SAAS,GAAe;IACnC,cAAc;IACd,mBAAmB;IACnB,mBAAmB;IACnB,4BAA4B;IAC5B,2BAA2B;IAC3B,wBAAwB;IACxB,uBAAuB;IACvB,oBAAoB;IACpB,uBAAuB;CACxB,CAAC;AAWF;;;;;;;;;GASG;AACH;;;GAGG;AACH,SAAS,gBAAgB,CAAC,OAAe;IACvC,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;IACxD,MAAM,WAAW,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;IAC/D,OAAO,SAAS,GAAG,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;AACjD,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CAAC,SAAiB,EAAE,WAA0B;IACrE,wBAAwB;IACxB,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACzE,+BAA+B;IAC/B,IAAI,WAAW,KAAK,MAAM,EAAE,CAAC;QAC3B,OAAO,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,MAAM,UAAU,qBAAqB,CACnC,OAAe,EACf,SAAiB,EACjB,SAAiB,EACjB,UAAU,GAAG,KAAK;IAElB,0CAA0C;IAC1C,MAAM,eAAe,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IAElD,iEAAiE;IACjE,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC;IAEtE,kDAAkD;IAClD,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;QAC9C,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;IACzE,CAAC;IACD,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;QAClD,MAAM,IAAI,KAAK,CACb,wGAAwG,CACzG,CAAC;IACJ,CAAC;IACD,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;QAClD,MAAM,IAAI,KAAK,CACb,wGAAwG,CACzG,CAAC;IACJ,CAAC;IAED,gEAAgE;IAChE,MAAM,aAAa,GAAG,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IACxD,MAAM,aAAa,GAAG,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IAExD,IAAI,aAAa,KAAK,aAAa,EAAE,CAAC;QACpC,8CAA8C;QAC9C,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;QACrF,MAAM,aAAa,GAAG,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC;QAExF,oBAAoB;QACpB,MAAM,CAAC,KAAK,CAAC,wCAAwC,EAAE;YACrD,MAAM,EAAE,SAAS,CAAC,MAAM;YACxB,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC;YACtC,aAAa;SACd,CAAC,CAAC;QAEH,IAAI,QAAQ,GAAG,wDAAwD,CAAC;QACxE,IAAI,aAAa,EAAE,CAAC;YAClB,QAAQ,IAAI,iFAAiF,CAAC;QAChG,CAAC;QACD,QAAQ,IAAI,YAAY,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC;QAE1D,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC5B,CAAC;IAED,IAAI,QAAQ,GAAG,IAAI,CAAC;IACpB,MAAM,aAAa,GAAG;QACpB,gBAAgB;QAChB,qBAAqB;QACrB,qBAAqB;QACrB,8BAA8B;QAC9B,6BAA6B;QAC7B,0BAA0B;QAC1B,yBAAyB;QACzB,sBAAsB;QACtB,yBAAyB;KAC1B,CAAC;IAEF,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QAExC,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC;YAClD,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,KAAK,KAAK,CAAC,CAAC;gBAAE,SAAS;YAE3B,QAAQ,GAAG,KAAK,CAAC;YAEjB,IAAI,UAAU,EAAE,CAAC;gBACf,OAAO;oBACL,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,gBAAgB,CAAC;oBACrD,QAAQ,EAAE,YAAY;oBACtB,WAAW,EAAE,MAAM;iBACpB,CAAC;YACJ,CAAC;YAED,MAAM,SAAS,GAAG,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS,CAAC,0CAA0C;YAE7E,OAAO;gBACL,OAAO,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,gBAAgB,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;gBAClG,QAAQ,EAAE,YAAY;gBACtB,WAAW,EAAE,MAAM;aACpB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,IAAI,KAAK,CACb,kHAAkH,CACnH,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,OAAO,CACrB,OAAe,EACf,SAAiB,EACjB,SAAiB,EACjB,UAAU,GAAG,KAAK;IAElB,OAAO,qBAAqB,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC;AAClF,CAAC"}

package/dist/tools/file-tools.d.ts

@@ -1,13 +0,0 @@
-/**
- * File operation tools
- *
- * Tools for reading, writing, and manipulating files and directories.
- * Extracted from the monolithic built-in-tools.ts for better maintainability.
- */
-import type { ToolRegistry } from '../services/tool-registry.js';
-/**
- * Clears the entire turn cache (call on new conversation turns if needed)
- */
-export declare function clearTurnFileCache(): void;
-export declare function registerFileTools(registry: ToolRegistry): void;
-//# sourceMappingURL=file-tools.d.ts.map

package/dist/tools/file-tools.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"file-tools.d.ts","sourceRoot":"","sources":["../../src/tools/file-tools.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AA2FjE;;GAEG;AACH,wBAAgB,kBAAkB,IAAI,IAAI,CAEzC;AAED,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,YAAY,GAAG,IAAI,CAyjC9D"}