@hansjm10/volt-coding-agent 0.0.0-bootstrap.0 → 0.1.0

package/dist/core/tools/edit-diff.js

@@ -0,0 +1,506 @@
+/**
+ * Shared diff computation utilities for the edit tool.
+ * Used by both edit.ts (for execution) and tool-execution.ts (for preview rendering).
+ */
+import * as Diff from "diff";
+import { constants } from "fs";
+import { access, readFile } from "fs/promises";
+import { resolveToCwd } from "./path-utils.js";
+export function detectLineEnding(content) {
+    const crlfIdx = content.indexOf("\r\n");
+    const lfIdx = content.indexOf("\n");
+    if (lfIdx === -1)
+        return "\n";
+    if (crlfIdx === -1)
+        return "\n";
+    return crlfIdx < lfIdx ? "\r\n" : "\n";
+}
+export function normalizeToLF(text) {
+    return text.replace(/\r\n/g, "\n").replace(/\r/g, "\n");
+}
+export function restoreLineEndings(text, ending) {
+    return ending === "\r\n" ? text.replace(/\n/g, "\r\n") : text;
+}
+function normalizeFuzzySegment(segment) {
+    return (segment
+        .normalize("NFKC")
+        // Smart single quotes → '
+        .replace(/[\u2018\u2019\u201A\u201B]/g, "'")
+        // Smart double quotes → "
+        .replace(/[\u201C\u201D\u201E\u201F]/g, '"')
+        // Various dashes/hyphens → -
+        // U+2010 hyphen, U+2011 non-breaking hyphen, U+2012 figure dash,
+        // U+2013 en-dash, U+2014 em-dash, U+2015 horizontal bar, U+2212 minus
+        .replace(/[\u2010\u2011\u2012\u2013\u2014\u2015\u2212]/g, "-")
+        // Special spaces → regular space
+        // U+00A0 NBSP, U+2002-U+200A various spaces, U+202F narrow NBSP,
+        // U+205F medium math space, U+3000 ideographic space
+        .replace(/[\u00A0\u2002-\u200A\u202F\u205F\u3000]/g, " "));
+}
+function getCodePointEnd(text, index) {
+    const codePoint = text.codePointAt(index);
+    return index + (codePoint !== undefined && codePoint > 0xffff ? 2 : 1);
+}
+function isCombiningMark(segment) {
+    return /^\p{Mark}$/u.test(segment);
+}
+function getFuzzySegmentEnd(text, index) {
+    let end = getCodePointEnd(text, index);
+    while (end < text.length) {
+        const nextEnd = getCodePointEnd(text, end);
+        if (!isCombiningMark(text.slice(end, nextEnd))) {
+            break;
+        }
+        end = nextEnd;
+    }
+    return end;
+}
+function pushNormalizedCharacter(characters, ranges, character, range) {
+    characters.push(character);
+    for (let index = 0; index < character.length; index++) {
+        ranges.push(range);
+    }
+}
+function pushNormalizedSegment(characters, ranges, segment, start, end) {
+    for (const character of Array.from(normalizeFuzzySegment(segment))) {
+        pushNormalizedCharacter(characters, ranges, character, { start, end });
+    }
+}
+function isTrailingFuzzyWhitespace(character) {
+    return character !== undefined && character.trimEnd() === "";
+}
+function trimTrailingFuzzyWhitespace(characters, ranges, lineStart) {
+    while (characters.length > lineStart && isTrailingFuzzyWhitespace(characters.at(-1))) {
+        const removed = characters.pop();
+        ranges.splice(ranges.length - removed.length, removed.length);
+    }
+}
+function normalizeForFuzzyMatchWithMap(text) {
+    const characters = [];
+    const ranges = [];
+    let lineStart = 0;
+    let index = 0;
+    while (index < text.length) {
+        if (text[index] === "\n") {
+            trimTrailingFuzzyWhitespace(characters, ranges, lineStart);
+            pushNormalizedCharacter(characters, ranges, "\n", { start: index, end: index + 1 });
+            index++;
+            lineStart = characters.length;
+            continue;
+        }
+        const end = getFuzzySegmentEnd(text, index);
+        pushNormalizedSegment(characters, ranges, text.slice(index, end), index, end);
+        index = end;
+    }
+    trimTrailingFuzzyWhitespace(characters, ranges, lineStart);
+    return { text: characters.join(""), ranges };
+}
+/**
+ * Normalize text for fuzzy matching. Applies progressive transformations:
+ * - Strip trailing whitespace from each line
+ * - Normalize smart quotes to ASCII equivalents
+ * - Normalize Unicode dashes/hyphens to ASCII hyphen
+ * - Normalize special Unicode spaces to regular space
+ */
+export function normalizeForFuzzyMatch(text) {
+    return normalizeForFuzzyMatchWithMap(text).text;
+}
+/** Strip UTF-8 BOM if present, return both the BOM (if any) and the text without it */
+export function stripBom(content) {
+    return content.startsWith("\uFEFF") ? { bom: "\uFEFF", text: content.slice(1) } : { bom: "", text: content };
+}
+/** Find all non-overlapping occurrences of needle in haystack. */
+function findOccurrences(haystack, needle) {
+    const indices = [];
+    let index = haystack.indexOf(needle);
+    while (index !== -1) {
+        indices.push(index);
+        index = haystack.indexOf(needle, index + needle.length);
+    }
+    return indices;
+}
+/** Convert character indices into 1-based line numbers. */
+function lineNumbersFor(content, indices) {
+    const sorted = [...indices].sort((a, b) => a - b);
+    const lines = [];
+    let line = 1;
+    let pos = 0;
+    for (const index of sorted) {
+        for (; pos < index && pos < content.length; pos++) {
+            if (content.charCodeAt(pos) === 10)
+                line++;
+        }
+        lines.push(line);
+    }
+    return lines;
+}
+function formatOccurrenceLines(lines, max = 6) {
+    const unique = [...new Set(lines)];
+    const shown = unique.slice(0, max).join(", ");
+    const suffix = unique.length > max ? ", …" : "";
+    const label = unique.length === 1 ? "line" : "lines";
+    return `${label} ${shown}${suffix}`;
+}
+const CLOSEST_MATCH_MIN_SCORE = 0.5;
+const CLOSEST_MATCH_MAX_TOKENS = 500_000;
+const CLOSEST_MATCH_MAX_SNIPPET_LINES = 20;
+/** Split text into whitespace-delimited tokens, recording each token's 1-based line. */
+function tokenizeWithLines(text) {
+    const tokens = [];
+    const lines = [];
+    let line = 1;
+    let current = "";
+    for (let i = 0; i < text.length; i++) {
+        const ch = text[i];
+        if (ch === "\n" || ch === " " || ch === "\t" || ch === "\r") {
+            if (current) {
+                tokens.push(current);
+                lines.push(line);
+                current = "";
+            }
+            if (ch === "\n")
+                line++;
+        }
+        else {
+            current += ch;
+        }
+    }
+    if (current) {
+        tokens.push(current);
+        lines.push(line);
+    }
+    return { tokens, lines };
+}
+/**
+ * Find the region of content that most closely resembles oldText, so a failed
+ * edit can report what the file actually contains. Uses a sliding token-bag
+ * window with Dice similarity, which tolerates re-indentation and line wrapping
+ * (e.g. a formatter splitting one line across several).
+ */
+export function findClosestMatch(content, oldText) {
+    const target = tokenizeWithLines(normalizeForFuzzyMatch(oldText)).tokens;
+    if (target.length === 0) {
+        return undefined;
+    }
+    // Line numbers are stable across fuzzy normalization: it never adds or removes newlines.
+    const { tokens, lines } = tokenizeWithLines(normalizeForFuzzyMatch(content));
+    if (tokens.length === 0 || tokens.length > CLOSEST_MATCH_MAX_TOKENS) {
+        return undefined;
+    }
+    const targetCounts = new Map();
+    for (const token of target) {
+        targetCounts.set(token, (targetCounts.get(token) ?? 0) + 1);
+    }
+    // Slide a fixed-size token window across the content, tracking the multiset
+    // overlap with the target incrementally so the scan is O(tokens).
+    const windowSize = Math.min(target.length, tokens.length);
+    const windowCounts = new Map();
+    let overlap = 0;
+    const add = (token) => {
+        const count = (windowCounts.get(token) ?? 0) + 1;
+        windowCounts.set(token, count);
+        if (count <= (targetCounts.get(token) ?? 0))
+            overlap++;
+    };
+    const remove = (token) => {
+        const count = (windowCounts.get(token) ?? 0) - 1;
+        windowCounts.set(token, count);
+        if (count < (targetCounts.get(token) ?? 0))
+            overlap--;
+    };
+    for (let i = 0; i < windowSize; i++) {
+        add(tokens[i]);
+    }
+    let bestOverlap = overlap;
+    let bestStart = 0;
+    for (let start = 1; start + windowSize <= tokens.length; start++) {
+        remove(tokens[start - 1]);
+        add(tokens[start + windowSize - 1]);
+        if (overlap > bestOverlap) {
+            bestOverlap = overlap;
+            bestStart = start;
+        }
+    }
+    const score = (2 * bestOverlap) / (target.length + windowSize);
+    if (score < CLOSEST_MATCH_MIN_SCORE) {
+        return undefined;
+    }
+    // Include one line of context on each side so wrapped constructs are shown whole.
+    const contentLines = content.split("\n");
+    const startLine = Math.max(1, lines[bestStart] - 1);
+    const endLine = Math.min(Math.min(lines[bestStart + windowSize - 1] + 1, contentLines.length), startLine + CLOSEST_MATCH_MAX_SNIPPET_LINES - 1);
+    return { startLine, snippet: contentLines.slice(startLine - 1, endLine).join("\n") };
+}
+const RE_READ_HINT = "If the file has changed since you last read it (e.g. it was reformatted), re-read it and base oldText on the current content.";
+function getNotFoundError(path, editIndex, totalEdits, closest) {
+    const base = totalEdits === 1
+        ? `Could not find the exact text in ${path}. The old text must match exactly including all whitespace and newlines.`
+        : `Could not find edits[${editIndex}] in ${path}. The oldText must match exactly including all whitespace and newlines.`;
+    if (!closest) {
+        return new Error(`${base} ${RE_READ_HINT}`);
+    }
+    return new Error(`${base}\n\nThe closest match in the file starts at line ${closest.startLine} and differs from your oldText:\n${closest.snippet}\n\n${RE_READ_HINT}`);
+}
+function getDuplicateError(path, editIndex, totalEdits, occurrences, lines) {
+    const location = lines.length > 0 ? ` (${formatOccurrenceLines(lines)})` : "";
+    if (totalEdits === 1) {
+        return new Error(`Found ${occurrences} occurrences of the text in ${path}${location}. The text must be unique. Add more surrounding lines to oldText to disambiguate which occurrence to replace.`);
+    }
+    return new Error(`Found ${occurrences} occurrences of edits[${editIndex}] in ${path}${location}. Each oldText must be unique. Add more surrounding lines to oldText to disambiguate which occurrence to replace.`);
+}
+function getEmptyOldTextError(path, editIndex, totalEdits) {
+    if (totalEdits === 1) {
+        return new Error(`oldText must not be empty in ${path}.`);
+    }
+    return new Error(`edits[${editIndex}].oldText must not be empty in ${path}.`);
+}
+function getNoChangeError(path, totalEdits) {
+    if (totalEdits === 1) {
+        return new Error(`No changes made to ${path}. The replacement produced identical content. This might indicate an issue with special characters or the text not existing as expected.`);
+    }
+    return new Error(`No changes made to ${path}. The replacements produced identical content.`);
+}
+/**
+ * Apply one or more exact-text replacements to LF-normalized content.
+ *
+ * All edits are matched against the same original content. Replacements are
+ * then applied in reverse order so offsets remain stable. Fuzzy matching may
+ * tolerate small whitespace/Unicode differences in the targeted text, but only
+ * the matched original ranges are replaced.
+ */
+export function applyEditsToNormalizedContent(normalizedContent, edits, path) {
+    const normalizedEdits = edits.map((edit) => ({
+        oldText: normalizeToLF(edit.oldText),
+        newText: normalizeToLF(edit.newText),
+    }));
+    for (let i = 0; i < normalizedEdits.length; i++) {
+        if (normalizedEdits[i].oldText.length === 0) {
+            throw getEmptyOldTextError(path, i, normalizedEdits.length);
+        }
+    }
+    const baseContent = normalizedContent;
+    let fuzzyContent;
+    const matchedEdits = [];
+    for (let i = 0; i < normalizedEdits.length; i++) {
+        const edit = normalizedEdits[i];
+        // Exact matching first: a unique exact match always wins, even when fuzzy
+        // normalization would make additional regions look identical.
+        const exactIndices = findOccurrences(baseContent, edit.oldText);
+        if (exactIndices.length > 1) {
+            throw getDuplicateError(path, i, normalizedEdits.length, exactIndices.length, lineNumbersFor(baseContent, exactIndices));
+        }
+        if (exactIndices.length === 1) {
+            matchedEdits.push({
+                editIndex: i,
+                matchIndex: exactIndices[0],
+                matchLength: edit.oldText.length,
+                newText: edit.newText,
+            });
+            continue;
+        }
+        // No exact match: fall back to fuzzy matching in normalized space.
+        fuzzyContent ??= normalizeForFuzzyMatchWithMap(baseContent);
+        const fuzzyOldText = normalizeForFuzzyMatch(edit.oldText);
+        const fuzzyIndices = fuzzyOldText.length === 0 ? [] : findOccurrences(fuzzyContent.text, fuzzyOldText);
+        if (fuzzyIndices.length === 0) {
+            throw getNotFoundError(path, i, normalizedEdits.length, findClosestMatch(baseContent, edit.oldText));
+        }
+        if (fuzzyIndices.length > 1) {
+            const originalIndices = fuzzyIndices
+                .map((index) => fuzzyContent.ranges[index]?.start)
+                .filter((start) => start !== undefined);
+            throw getDuplicateError(path, i, normalizedEdits.length, fuzzyIndices.length, lineNumbersFor(baseContent, originalIndices));
+        }
+        const fuzzyIndex = fuzzyIndices[0];
+        const start = fuzzyContent.ranges[fuzzyIndex];
+        const end = fuzzyContent.ranges[fuzzyIndex + fuzzyOldText.length - 1];
+        if (!start || !end) {
+            throw getNotFoundError(path, i, normalizedEdits.length, findClosestMatch(baseContent, edit.oldText));
+        }
+        matchedEdits.push({
+            editIndex: i,
+            matchIndex: start.start,
+            matchLength: end.end - start.start,
+            newText: edit.newText,
+        });
+    }
+    matchedEdits.sort((a, b) => a.matchIndex - b.matchIndex);
+    for (let i = 1; i < matchedEdits.length; i++) {
+        const previous = matchedEdits[i - 1];
+        const current = matchedEdits[i];
+        if (previous.matchIndex + previous.matchLength > current.matchIndex) {
+            throw new Error(`edits[${previous.editIndex}] and edits[${current.editIndex}] overlap in ${path}. Merge them into one edit or target disjoint regions.`);
+        }
+    }
+    let newContent = baseContent;
+    for (let i = matchedEdits.length - 1; i >= 0; i--) {
+        const edit = matchedEdits[i];
+        newContent =
+            newContent.substring(0, edit.matchIndex) +
+                edit.newText +
+                newContent.substring(edit.matchIndex + edit.matchLength);
+    }
+    if (baseContent === newContent) {
+        throw getNoChangeError(path, normalizedEdits.length);
+    }
+    return { baseContent, newContent };
+}
+/** Generate a standard unified patch. */
+export function generateUnifiedPatch(path, oldContent, newContent, contextLines = 4) {
+    return Diff.createTwoFilesPatch(path, path, oldContent, newContent, undefined, undefined, {
+        context: contextLines,
+        headerOptions: Diff.FILE_HEADERS_ONLY,
+    });
+}
+/**
+ * Generate a display-oriented diff string with line numbers and context.
+ * Returns both the diff string and the first changed line number (in the new file).
+ */
+export function generateDiffString(oldContent, newContent, contextLines = 4) {
+    const parts = Diff.diffLines(oldContent, newContent);
+    const output = [];
+    const oldLines = oldContent.split("\n");
+    const newLines = newContent.split("\n");
+    const maxLineNum = Math.max(oldLines.length, newLines.length);
+    const lineNumWidth = String(maxLineNum).length;
+    let oldLineNum = 1;
+    let newLineNum = 1;
+    let lastWasChange = false;
+    let firstChangedLine;
+    for (let i = 0; i < parts.length; i++) {
+        const part = parts[i];
+        const raw = part.value.split("\n");
+        if (raw[raw.length - 1] === "") {
+            raw.pop();
+        }
+        if (part.added || part.removed) {
+            // Capture the first changed line (in the new file)
+            if (firstChangedLine === undefined) {
+                firstChangedLine = newLineNum;
+            }
+            // Show the change
+            for (const line of raw) {
+                if (part.added) {
+                    const lineNum = String(newLineNum).padStart(lineNumWidth, " ");
+                    output.push(`+${lineNum} ${line}`);
+                    newLineNum++;
+                }
+                else {
+                    // removed
+                    const lineNum = String(oldLineNum).padStart(lineNumWidth, " ");
+                    output.push(`-${lineNum} ${line}`);
+                    oldLineNum++;
+                }
+            }
+            lastWasChange = true;
+        }
+        else {
+            // Context lines - only show a few before/after changes
+            const nextPartIsChange = i < parts.length - 1 && (parts[i + 1].added || parts[i + 1].removed);
+            const hasLeadingChange = lastWasChange;
+            const hasTrailingChange = nextPartIsChange;
+            if (hasLeadingChange && hasTrailingChange) {
+                if (raw.length <= contextLines * 2) {
+                    for (const line of raw) {
+                        const lineNum = String(oldLineNum).padStart(lineNumWidth, " ");
+                        output.push(` ${lineNum} ${line}`);
+                        oldLineNum++;
+                        newLineNum++;
+                    }
+                }
+                else {
+                    const leadingLines = raw.slice(0, contextLines);
+                    const trailingLines = raw.slice(raw.length - contextLines);
+                    const skippedLines = raw.length - leadingLines.length - trailingLines.length;
+                    for (const line of leadingLines) {
+                        const lineNum = String(oldLineNum).padStart(lineNumWidth, " ");
+                        output.push(` ${lineNum} ${line}`);
+                        oldLineNum++;
+                        newLineNum++;
+                    }
+                    output.push(` ${"".padStart(lineNumWidth, " ")} ...`);
+                    oldLineNum += skippedLines;
+                    newLineNum += skippedLines;
+                    for (const line of trailingLines) {
+                        const lineNum = String(oldLineNum).padStart(lineNumWidth, " ");
+                        output.push(` ${lineNum} ${line}`);
+                        oldLineNum++;
+                        newLineNum++;
+                    }
+                }
+            }
+            else if (hasLeadingChange) {
+                const shownLines = raw.slice(0, contextLines);
+                const skippedLines = raw.length - shownLines.length;
+                for (const line of shownLines) {
+                    const lineNum = String(oldLineNum).padStart(lineNumWidth, " ");
+                    output.push(` ${lineNum} ${line}`);
+                    oldLineNum++;
+                    newLineNum++;
+                }
+                if (skippedLines > 0) {
+                    output.push(` ${"".padStart(lineNumWidth, " ")} ...`);
+                    oldLineNum += skippedLines;
+                    newLineNum += skippedLines;
+                }
+            }
+            else if (hasTrailingChange) {
+                const skippedLines = Math.max(0, raw.length - contextLines);
+                if (skippedLines > 0) {
+                    output.push(` ${"".padStart(lineNumWidth, " ")} ...`);
+                    oldLineNum += skippedLines;
+                    newLineNum += skippedLines;
+                }
+                for (const line of raw.slice(skippedLines)) {
+                    const lineNum = String(oldLineNum).padStart(lineNumWidth, " ");
+                    output.push(` ${lineNum} ${line}`);
+                    oldLineNum++;
+                    newLineNum++;
+                }
+            }
+            else {
+                // Skip these context lines entirely
+                oldLineNum += raw.length;
+                newLineNum += raw.length;
+            }
+            lastWasChange = false;
+        }
+    }
+    return { diff: output.join("\n"), firstChangedLine };
+}
+/**
+ * Compute the diff for one or more edit operations without applying them.
+ * Used for preview rendering in the TUI before the tool executes.
+ */
+export async function computeEditsDiff(path, edits, cwd) {
+    const absolutePath = resolveToCwd(path, cwd);
+    try {
+        // Check if file exists and is readable
+        try {
+            await access(absolutePath, constants.R_OK);
+        }
+        catch (error) {
+            const errorMessage = error instanceof Error && "code" in error ? `Error code: ${error.code}` : String(error);
+            return { error: `Could not edit file: ${path}. ${errorMessage}.` };
+        }
+        // Read the file
+        const rawContent = await readFile(absolutePath, "utf-8");
+        // Strip BOM before matching (LLM won't include invisible BOM in oldText)
+        const { text: content } = stripBom(rawContent);
+        const normalizedContent = normalizeToLF(content);
+        const { baseContent, newContent } = applyEditsToNormalizedContent(normalizedContent, edits, path);
+        // Generate the diff
+        return generateDiffString(baseContent, newContent);
+    }
+    catch (err) {
+        return { error: err instanceof Error ? err.message : String(err) };
+    }
+}
+/**
+ * Compute the diff for a single edit operation without applying it.
+ * Kept as a convenience wrapper for single-edit callers.
+ */
+export async function computeEditDiff(path, oldText, newText, cwd) {
+    return computeEditsDiff(path, [{ oldText, newText }], cwd);
+}
+//# sourceMappingURL=edit-diff.js.map

package/dist/core/tools/edit-diff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edit-diff.js","sourceRoot":"","sources":["../../../src/core/tools/edit-diff.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAC7B,OAAO,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AAC/B,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,MAAM,UAAU,gBAAgB,CAAC,OAAe,EAAiB;IAChE,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,KAAK,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,OAAO,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAChC,OAAO,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;AAAA,CACvC;AAED,MAAM,UAAU,aAAa,CAAC,IAAY,EAAU;IACnD,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AAAA,CACxD;AAED,MAAM,UAAU,kBAAkB,CAAC,IAAY,EAAE,MAAqB,EAAU;IAC/E,OAAO,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAAA,CAC9D;AAYD,SAAS,qBAAqB,CAAC,OAAe,EAAU;IACvD,OAAO,CACN,OAAO;SACL,SAAS,CAAC,MAAM,CAAC;QAClB,4BAA0B;SACzB,OAAO,CAAC,6BAA6B,EAAE,GAAG,CAAC;QAC5C,4BAA0B;SACzB,OAAO,CAAC,6BAA6B,EAAE,GAAG,CAAC;QAC5C,+BAA6B;QAC7B,iEAAiE;QACjE,sEAAsE;SACrE,OAAO,CAAC,+CAA+C,EAAE,GAAG,CAAC;QAC9D,mCAAiC;QACjC,iEAAiE;QACjE,qDAAqD;SACpD,OAAO,CAAC,0CAA0C,EAAE,GAAG,CAAC,CAC1D,CAAC;AAAA,CACF;AAED,SAAS,eAAe,CAAC,IAAY,EAAE,KAAa,EAAU;IAC7D,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;IAC1C,OAAO,KAAK,GAAG,CAAC,SAAS,KAAK,SAAS,IAAI,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,CACvE;AAED,SAAS,eAAe,CAAC,OAAe,EAAW;IAClD,OAAO,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAAA,CACnC;AAED,SAAS,kBAAkB,CAAC,IAAY,EAAE,KAAa,EAAU;IAChE,IAAI,GAAG,GAAG,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACvC,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,eAAe,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;YAChD,MAAM;QACP,CAAC;QACD,GAAG,GAAG,OAAO,CAAC;IACf,CAAC;IACD,OAAO,GAAG,CAAC;AAAA,CACX;AAED,SAAS,uBAAuB,CAC/B,UAAoB,EACpB,MAAkC,EAClC,SAAiB,EACjB,KAA+B,EACxB;IACP,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC3B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACvD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpB,CAAC;AAAA,CACD;AAED,SAAS,qBAAqB,CAC7B,UAAoB,EACpB,MAAkC,EAClC,OAAe,EACf,KAAa,EACb,GAAW,EACJ;IACP,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC;QACpE,uBAAuB,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;IACxE,CAAC;AAAA,CACD;AAED,SAAS,yBAAyB,CAAC,SAA6B,EAAW;IAC1E,OAAO,SAAS,KAAK,SAAS,IAAI,SAAS,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC;AAAA,CAC7D;AAED,SAAS,2BAA2B,CACnC,UAAoB,EACpB,MAAkC,EAClC,SAAiB,EACV;IACP,OAAO,UAAU,CAAC,MAAM,GAAG,SAAS,IAAI,yBAAyB,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtF,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,EAAG,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAC/D,CAAC;AAAA,CACD;AAED,SAAS,6BAA6B,CAAC,IAAY,EAAuB;IACzE,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,MAAM,MAAM,GAA+B,EAAE,CAAC;IAC9C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;YAC1B,2BAA2B,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;YAC3D,uBAAuB,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YACpF,KAAK,EAAE,CAAC;YACR,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC;YAC9B,SAAS;QACV,CAAC;QAED,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC5C,qBAAqB,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAC9E,KAAK,GAAG,GAAG,CAAC;IACb,CAAC;IAED,2BAA2B,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IAC3D,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;AAAA,CAC7C;AAED;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAAC,IAAY,EAAU;IAC5D,OAAO,6BAA6B,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;AAAA,CAChD;AAmBD,uFAAuF;AACvF,MAAM,UAAU,QAAQ,CAAC,OAAe,EAAiC;IACxE,OAAO,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAAA,CAC7G;AAED,kEAAkE;AAClE,SAAS,eAAe,CAAC,QAAgB,EAAE,MAAc,EAAY;IACpE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACrC,OAAO,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;QACrB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,OAAO,CAAC;AAAA,CACf;AAED,2DAA2D;AAC3D,SAAS,cAAc,CAAC,OAAe,EAAE,OAAiB,EAAY;IACrE,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC5B,OAAO,GAAG,GAAG,KAAK,IAAI,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;YACnD,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE;gBAAE,IAAI,EAAE,CAAC;QAC5C,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,KAAK,CAAC;AAAA,CACb;AAED,SAAS,qBAAqB,CAAC,KAAe,EAAE,GAAG,GAAG,CAAC,EAAU;IAChE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,OAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IAChD,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;IACrD,OAAO,GAAG,KAAK,IAAI,KAAK,GAAG,MAAM,EAAE,CAAC;AAAA,CACpC;AAED,MAAM,uBAAuB,GAAG,GAAG,CAAC;AACpC,MAAM,wBAAwB,GAAG,OAAO,CAAC;AACzC,MAAM,+BAA+B,GAAG,EAAE,CAAC;AAE3C,wFAAwF;AACxF,SAAS,iBAAiB,CAAC,IAAY,EAAyC;IAC/E,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;YAC7D,IAAI,OAAO,EAAE,CAAC;gBACb,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,OAAO,GAAG,EAAE,CAAC;YACd,CAAC;YACD,IAAI,EAAE,KAAK,IAAI;gBAAE,IAAI,EAAE,CAAC;QACzB,CAAC;aAAM,CAAC;YACP,OAAO,IAAI,EAAE,CAAC;QACf,CAAC;IACF,CAAC;IACD,IAAI,OAAO,EAAE,CAAC;QACb,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AAAA,CACzB;AAOD;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe,EAAE,OAAe,EAA4B;IAC5F,MAAM,MAAM,GAAG,iBAAiB,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;IACzE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,SAAS,CAAC;IAClB,CAAC;IACD,yFAAyF;IACzF,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,iBAAiB,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC,CAAC;IAC7E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,wBAAwB,EAAE,CAAC;QACrE,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC5B,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,4EAA4E;IAC5E,kEAAkE;IAClE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IAC1D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,GAAG,GAAG,CAAC,KAAa,EAAQ,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,IAAI,KAAK,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,EAAE,CAAC;IAAA,CACvD,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,KAAa,EAAQ,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,IAAI,KAAK,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,EAAE,CAAC;IAAA,CACtD,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,IAAI,WAAW,GAAG,OAAO,CAAC;IAC1B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,IAAI,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QAClE,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1B,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,OAAO,GAAG,WAAW,EAAE,CAAC;YAC3B,WAAW,GAAG,OAAO,CAAC;YACtB,SAAS,GAAG,KAAK,CAAC;QACnB,CAAC;IACF,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC;IAC/D,IAAI,KAAK,GAAG,uBAAuB,EAAE,CAAC;QACrC,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,kFAAkF;IAClF,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IACpD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CACvB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,EACpE,SAAS,GAAG,+BAA+B,GAAG,CAAC,CAC/C,CAAC;IACF,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AAAA,CACrF;AAED,MAAM,YAAY,GACjB,+HAA+H,CAAC;AAEjI,SAAS,gBAAgB,CAAC,IAAY,EAAE,SAAiB,EAAE,UAAkB,EAAE,OAAsB,EAAS;IAC7G,MAAM,IAAI,GACT,UAAU,KAAK,CAAC;QACf,CAAC,CAAC,oCAAoC,IAAI,0EAA0E;QACpH,CAAC,CAAC,wBAAwB,SAAS,QAAQ,IAAI,yEAAyE,CAAC;IAC3H,IAAI,CAAC,OAAO,EAAE,CAAC;QACd,OAAO,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,YAAY,EAAE,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,IAAI,KAAK,CACf,GAAG,IAAI,oDAAoD,OAAO,CAAC,SAAS,oCAAoC,OAAO,CAAC,OAAO,OAAO,YAAY,EAAE,CACpJ,CAAC;AAAA,CACF;AAED,SAAS,iBAAiB,CACzB,IAAY,EACZ,SAAiB,EACjB,UAAkB,EAClB,WAAmB,EACnB,KAAe,EACP;IACR,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,qBAAqB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9E,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,IAAI,KAAK,CACf,SAAS,WAAW,+BAA+B,IAAI,GAAG,QAAQ,+GAA+G,CACjL,CAAC;IACH,CAAC;IACD,OAAO,IAAI,KAAK,CACf,SAAS,WAAW,yBAAyB,SAAS,QAAQ,IAAI,GAAG,QAAQ,mHAAmH,CAChM,CAAC;AAAA,CACF;AAED,SAAS,oBAAoB,CAAC,IAAY,EAAE,SAAiB,EAAE,UAAkB,EAAS;IACzF,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,IAAI,KAAK,CAAC,gCAAgC,IAAI,GAAG,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,SAAS,SAAS,kCAAkC,IAAI,GAAG,CAAC,CAAC;AAAA,CAC9E;AAED,SAAS,gBAAgB,CAAC,IAAY,EAAE,UAAkB,EAAS;IAClE,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,IAAI,KAAK,CACf,sBAAsB,IAAI,0IAA0I,CACpK,CAAC;IACH,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,sBAAsB,IAAI,gDAAgD,CAAC,CAAC;AAAA,CAC7F;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,6BAA6B,CAC5C,iBAAyB,EACzB,KAAa,EACb,IAAY,EACS;IACrB,MAAM,eAAe,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC5C,OAAO,EAAE,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC;QACpC,OAAO,EAAE,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC;KACpC,CAAC,CAAC,CAAC;IAEJ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7C,MAAM,oBAAoB,CAAC,IAAI,EAAE,CAAC,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC;QAC7D,CAAC;IACF,CAAC;IAED,MAAM,WAAW,GAAG,iBAAiB,CAAC;IACtC,IAAI,YAA6C,CAAC;IAClD,MAAM,YAAY,GAAkB,EAAE,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAEhC,0EAA0E;QAC1E,8DAA8D;QAC9D,MAAM,YAAY,GAAG,eAAe,CAAC,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAChE,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,MAAM,iBAAiB,CACtB,IAAI,EACJ,CAAC,EACD,eAAe,CAAC,MAAM,EACtB,YAAY,CAAC,MAAM,EACnB,cAAc,CAAC,WAAW,EAAE,YAAY,CAAC,CACzC,CAAC;QACH,CAAC;QACD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,YAAY,CAAC,IAAI,CAAC;gBACjB,SAAS,EAAE,CAAC;gBACZ,UAAU,EAAE,YAAY,CAAC,CAAC,CAAC;gBAC3B,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM;gBAChC,OAAO,EAAE,IAAI,CAAC,OAAO;aACrB,CAAC,CAAC;YACH,SAAS;QACV,CAAC;QAED,mEAAmE;QACnE,YAAY,KAAK,6BAA6B,CAAC,WAAW,CAAC,CAAC;QAC5D,MAAM,YAAY,GAAG,sBAAsB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1D,MAAM,YAAY,GAAG,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QACvG,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,MAAM,gBAAgB,CAAC,IAAI,EAAE,CAAC,EAAE,eAAe,CAAC,MAAM,EAAE,gBAAgB,CAAC,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QACtG,CAAC;QACD,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,MAAM,eAAe,GAAG,YAAY;iBAClC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAa,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;iBAClD,MAAM,CAAC,CAAC,KAAK,EAAmB,EAAE,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;YAC1D,MAAM,iBAAiB,CACtB,IAAI,EACJ,CAAC,EACD,eAAe,CAAC,MAAM,EACtB,YAAY,CAAC,MAAM,EACnB,cAAc,CAAC,WAAW,EAAE,eAAe,CAAC,CAC5C,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC9C,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,CAAC,UAAU,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtE,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;YACpB,MAAM,gBAAgB,CAAC,IAAI,EAAE,CAAC,EAAE,eAAe,CAAC,MAAM,EAAE,gBAAgB,CAAC,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QACtG,CAAC;QACD,YAAY,CAAC,IAAI,CAAC;YACjB,SAAS,EAAE,CAAC;YACZ,UAAU,EAAE,KAAK,CAAC,KAAK;YACvB,WAAW,EAAE,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK;YAClC,OAAO,EAAE,IAAI,CAAC,OAAO;SACrB,CAAC,CAAC;IACJ,CAAC;IAED,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,QAAQ,CAAC,UAAU,GAAG,QAAQ,CAAC,WAAW,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACrE,MAAM,IAAI,KAAK,CACd,SAAS,QAAQ,CAAC,SAAS,eAAe,OAAO,CAAC,SAAS,gBAAgB,IAAI,wDAAwD,CACvI,CAAC;QACH,CAAC;IACF,CAAC;IAED,IAAI,UAAU,GAAG,WAAW,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnD,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7B,UAAU;YACT,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC;gBACxC,IAAI,CAAC,OAAO;gBACZ,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;IAC3D,CAAC;IAED,IAAI,WAAW,KAAK,UAAU,EAAE,CAAC;QAChC,MAAM,gBAAgB,CAAC,IAAI,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC;IACtD,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC;AAAA,CACnC;AAED,yCAAyC;AACzC,MAAM,UAAU,oBAAoB,CAAC,IAAY,EAAE,UAAkB,EAAE,UAAkB,EAAE,YAAY,GAAG,CAAC,EAAU;IACpH,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE;QACzF,OAAO,EAAE,YAAY;QACrB,aAAa,EAAE,IAAI,CAAC,iBAAiB;KACrC,CAAC,CAAC;AAAA,CACH;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CACjC,UAAkB,EAClB,UAAkB,EAClB,YAAY,GAAG,CAAC,EACyC;IACzD,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACrD,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC9D,MAAM,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;IAE/C,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,IAAI,gBAAoC,CAAC;IAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;YAChC,GAAG,CAAC,GAAG,EAAE,CAAC;QACX,CAAC;QAED,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,mDAAmD;YACnD,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;gBACpC,gBAAgB,GAAG,UAAU,CAAC;YAC/B,CAAC;YAED,kBAAkB;YAClB,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;gBACxB,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAChB,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;oBAC/D,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC,CAAC;oBACnC,UAAU,EAAE,CAAC;gBACd,CAAC;qBAAM,CAAC;oBACP,UAAU;oBACV,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;oBAC/D,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC,CAAC;oBACnC,UAAU,EAAE,CAAC;gBACd,CAAC;YACF,CAAC;YACD,aAAa,GAAG,IAAI,CAAC;QACtB,CAAC;aAAM,CAAC;YACP,uDAAuD;YACvD,MAAM,gBAAgB,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YAC9F,MAAM,gBAAgB,GAAG,aAAa,CAAC;YACvC,MAAM,iBAAiB,GAAG,gBAAgB,CAAC;YAE3C,IAAI,gBAAgB,IAAI,iBAAiB,EAAE,CAAC;gBAC3C,IAAI,GAAG,CAAC,MAAM,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;oBACpC,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;wBACxB,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;wBAC/D,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC,CAAC;wBACnC,UAAU,EAAE,CAAC;wBACb,UAAU,EAAE,CAAC;oBACd,CAAC;gBACF,CAAC;qBAAM,CAAC;oBACP,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;oBAChD,MAAM,aAAa,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;oBAC3D,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC;oBAE7E,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;wBACjC,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;wBAC/D,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC,CAAC;wBACnC,UAAU,EAAE,CAAC;wBACb,UAAU,EAAE,CAAC;oBACd,CAAC;oBAED,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;oBACtD,UAAU,IAAI,YAAY,CAAC;oBAC3B,UAAU,IAAI,YAAY,CAAC;oBAE3B,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;wBAClC,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;wBAC/D,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC,CAAC;wBACnC,UAAU,EAAE,CAAC;wBACb,UAAU,EAAE,CAAC;oBACd,CAAC;gBACF,CAAC;YACF,CAAC;iBAAM,IAAI,gBAAgB,EAAE,CAAC;gBAC7B,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;gBAC9C,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;gBAEpD,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;oBAC/B,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;oBAC/D,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC,CAAC;oBACnC,UAAU,EAAE,CAAC;oBACb,UAAU,EAAE,CAAC;gBACd,CAAC;gBAED,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;oBACtB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;oBACtD,UAAU,IAAI,YAAY,CAAC;oBAC3B,UAAU,IAAI,YAAY,CAAC;gBAC5B,CAAC;YACF,CAAC;iBAAM,IAAI,iBAAiB,EAAE,CAAC;gBAC9B,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;gBAC5D,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;oBACtB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;oBACtD,UAAU,IAAI,YAAY,CAAC;oBAC3B,UAAU,IAAI,YAAY,CAAC;gBAC5B,CAAC;gBAED,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC;oBAC5C,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;oBAC/D,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC,CAAC;oBACnC,UAAU,EAAE,CAAC;oBACb,UAAU,EAAE,CAAC;gBACd,CAAC;YACF,CAAC;iBAAM,CAAC;gBACP,oCAAoC;gBACpC,UAAU,IAAI,GAAG,CAAC,MAAM,CAAC;gBACzB,UAAU,IAAI,GAAG,CAAC,MAAM,CAAC;YAC1B,CAAC;YAED,aAAa,GAAG,KAAK,CAAC;QACvB,CAAC;IACF,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,gBAAgB,EAAE,CAAC;AAAA,CACrD;AAWD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACrC,IAAY,EACZ,KAAa,EACb,GAAW,EAC+B;IAC1C,MAAM,YAAY,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAE7C,IAAI,CAAC;QACJ,uCAAuC;QACvC,IAAI,CAAC;YACJ,MAAM,MAAM,CAAC,YAAY,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;QAAC,OAAO,KAAc,EAAE,CAAC;YACzB,MAAM,YAAY,GAAG,KAAK,YAAY,KAAK,IAAI,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,eAAe,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC7G,OAAO,EAAE,KAAK,EAAE,wBAAwB,IAAI,KAAK,YAAY,GAAG,EAAE,CAAC;QACpE,CAAC;QAED,gBAAgB;QAChB,MAAM,UAAU,GAAG,MAAM,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QAEzD,yEAAyE;QACzE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,iBAAiB,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QACjD,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,GAAG,6BAA6B,CAAC,iBAAiB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAElG,oBAAoB;QACpB,OAAO,kBAAkB,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;IACpD,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACd,OAAO,EAAE,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;IACpE,CAAC;AAAA,CACD;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACpC,IAAY,EACZ,OAAe,EACf,OAAe,EACf,GAAW,EAC+B;IAC1C,OAAO,gBAAgB,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;AAAA,CAC3D","sourcesContent":["/**\n * Shared diff computation utilities for the edit tool.\n * Used by both edit.ts (for execution) and tool-execution.ts (for preview rendering).\n */\n\nimport * as Diff from \"diff\";\nimport { constants } from \"fs\";\nimport { access, readFile } from \"fs/promises\";\nimport { resolveToCwd } from \"./path-utils.ts\";\n\nexport function detectLineEnding(content: string): \"\\r\\n\" | \"\\n\" {\n\tconst crlfIdx = content.indexOf(\"\\r\\n\");\n\tconst lfIdx = content.indexOf(\"\\n\");\n\tif (lfIdx === -1) return \"\\n\";\n\tif (crlfIdx === -1) return \"\\n\";\n\treturn crlfIdx < lfIdx ? \"\\r\\n\" : \"\\n\";\n}\n\nexport function normalizeToLF(text: string): string {\n\treturn text.replace(/\\r\\n/g, \"\\n\").replace(/\\r/g, \"\\n\");\n}\n\nexport function restoreLineEndings(text: string, ending: \"\\r\\n\" | \"\\n\"): string {\n\treturn ending === \"\\r\\n\" ? text.replace(/\\n/g, \"\\r\\n\") : text;\n}\n\ninterface NormalizedCharacterRange {\n\tstart: number;\n\tend: number;\n}\n\ninterface FuzzyNormalizedText {\n\ttext: string;\n\tranges: NormalizedCharacterRange[];\n}\n\nfunction normalizeFuzzySegment(segment: string): string {\n\treturn (\n\t\tsegment\n\t\t\t.normalize(\"NFKC\")\n\t\t\t// Smart single quotes → '\n\t\t\t.replace(/[\\u2018\\u2019\\u201A\\u201B]/g, \"'\")\n\t\t\t// Smart double quotes → \"\n\t\t\t.replace(/[\\u201C\\u201D\\u201E\\u201F]/g, '\"')\n\t\t\t// Various dashes/hyphens → -\n\t\t\t// U+2010 hyphen, U+2011 non-breaking hyphen, U+2012 figure dash,\n\t\t\t// U+2013 en-dash, U+2014 em-dash, U+2015 horizontal bar, U+2212 minus\n\t\t\t.replace(/[\\u2010\\u2011\\u2012\\u2013\\u2014\\u2015\\u2212]/g, \"-\")\n\t\t\t// Special spaces → regular space\n\t\t\t// U+00A0 NBSP, U+2002-U+200A various spaces, U+202F narrow NBSP,\n\t\t\t// U+205F medium math space, U+3000 ideographic space\n\t\t\t.replace(/[\\u00A0\\u2002-\\u200A\\u202F\\u205F\\u3000]/g, \" \")\n\t);\n}\n\nfunction getCodePointEnd(text: string, index: number): number {\n\tconst codePoint = text.codePointAt(index);\n\treturn index + (codePoint !== undefined && codePoint > 0xffff ? 2 : 1);\n}\n\nfunction isCombiningMark(segment: string): boolean {\n\treturn /^\\p{Mark}$/u.test(segment);\n}\n\nfunction getFuzzySegmentEnd(text: string, index: number): number {\n\tlet end = getCodePointEnd(text, index);\n\twhile (end < text.length) {\n\t\tconst nextEnd = getCodePointEnd(text, end);\n\t\tif (!isCombiningMark(text.slice(end, nextEnd))) {\n\t\t\tbreak;\n\t\t}\n\t\tend = nextEnd;\n\t}\n\treturn end;\n}\n\nfunction pushNormalizedCharacter(\n\tcharacters: string[],\n\tranges: NormalizedCharacterRange[],\n\tcharacter: string,\n\trange: NormalizedCharacterRange,\n): void {\n\tcharacters.push(character);\n\tfor (let index = 0; index < character.length; index++) {\n\t\tranges.push(range);\n\t}\n}\n\nfunction pushNormalizedSegment(\n\tcharacters: string[],\n\tranges: NormalizedCharacterRange[],\n\tsegment: string,\n\tstart: number,\n\tend: number,\n): void {\n\tfor (const character of Array.from(normalizeFuzzySegment(segment))) {\n\t\tpushNormalizedCharacter(characters, ranges, character, { start, end });\n\t}\n}\n\nfunction isTrailingFuzzyWhitespace(character: string | undefined): boolean {\n\treturn character !== undefined && character.trimEnd() === \"\";\n}\n\nfunction trimTrailingFuzzyWhitespace(\n\tcharacters: string[],\n\tranges: NormalizedCharacterRange[],\n\tlineStart: number,\n): void {\n\twhile (characters.length > lineStart && isTrailingFuzzyWhitespace(characters.at(-1))) {\n\t\tconst removed = characters.pop()!;\n\t\tranges.splice(ranges.length - removed.length, removed.length);\n\t}\n}\n\nfunction normalizeForFuzzyMatchWithMap(text: string): FuzzyNormalizedText {\n\tconst characters: string[] = [];\n\tconst ranges: NormalizedCharacterRange[] = [];\n\tlet lineStart = 0;\n\tlet index = 0;\n\n\twhile (index < text.length) {\n\t\tif (text[index] === \"\\n\") {\n\t\t\ttrimTrailingFuzzyWhitespace(characters, ranges, lineStart);\n\t\t\tpushNormalizedCharacter(characters, ranges, \"\\n\", { start: index, end: index + 1 });\n\t\t\tindex++;\n\t\t\tlineStart = characters.length;\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst end = getFuzzySegmentEnd(text, index);\n\t\tpushNormalizedSegment(characters, ranges, text.slice(index, end), index, end);\n\t\tindex = end;\n\t}\n\n\ttrimTrailingFuzzyWhitespace(characters, ranges, lineStart);\n\treturn { text: characters.join(\"\"), ranges };\n}\n\n/**\n * Normalize text for fuzzy matching. Applies progressive transformations:\n * - Strip trailing whitespace from each line\n * - Normalize smart quotes to ASCII equivalents\n * - Normalize Unicode dashes/hyphens to ASCII hyphen\n * - Normalize special Unicode spaces to regular space\n */\nexport function normalizeForFuzzyMatch(text: string): string {\n\treturn normalizeForFuzzyMatchWithMap(text).text;\n}\n\nexport interface Edit {\n\toldText: string;\n\tnewText: string;\n}\n\ninterface MatchedEdit {\n\teditIndex: number;\n\tmatchIndex: number;\n\tmatchLength: number;\n\tnewText: string;\n}\n\nexport interface AppliedEditsResult {\n\tbaseContent: string;\n\tnewContent: string;\n}\n\n/** Strip UTF-8 BOM if present, return both the BOM (if any) and the text without it */\nexport function stripBom(content: string): { bom: string; text: string } {\n\treturn content.startsWith(\"\\uFEFF\") ? { bom: \"\\uFEFF\", text: content.slice(1) } : { bom: \"\", text: content };\n}\n\n/** Find all non-overlapping occurrences of needle in haystack. */\nfunction findOccurrences(haystack: string, needle: string): number[] {\n\tconst indices: number[] = [];\n\tlet index = haystack.indexOf(needle);\n\twhile (index !== -1) {\n\t\tindices.push(index);\n\t\tindex = haystack.indexOf(needle, index + needle.length);\n\t}\n\treturn indices;\n}\n\n/** Convert character indices into 1-based line numbers. */\nfunction lineNumbersFor(content: string, indices: number[]): number[] {\n\tconst sorted = [...indices].sort((a, b) => a - b);\n\tconst lines: number[] = [];\n\tlet line = 1;\n\tlet pos = 0;\n\tfor (const index of sorted) {\n\t\tfor (; pos < index && pos < content.length; pos++) {\n\t\t\tif (content.charCodeAt(pos) === 10) line++;\n\t\t}\n\t\tlines.push(line);\n\t}\n\treturn lines;\n}\n\nfunction formatOccurrenceLines(lines: number[], max = 6): string {\n\tconst unique = [...new Set(lines)];\n\tconst shown = unique.slice(0, max).join(\", \");\n\tconst suffix = unique.length > max ? \", …\" : \"\";\n\tconst label = unique.length === 1 ? \"line\" : \"lines\";\n\treturn `${label} ${shown}${suffix}`;\n}\n\nconst CLOSEST_MATCH_MIN_SCORE = 0.5;\nconst CLOSEST_MATCH_MAX_TOKENS = 500_000;\nconst CLOSEST_MATCH_MAX_SNIPPET_LINES = 20;\n\n/** Split text into whitespace-delimited tokens, recording each token's 1-based line. */\nfunction tokenizeWithLines(text: string): { tokens: string[]; lines: number[] } {\n\tconst tokens: string[] = [];\n\tconst lines: number[] = [];\n\tlet line = 1;\n\tlet current = \"\";\n\tfor (let i = 0; i < text.length; i++) {\n\t\tconst ch = text[i];\n\t\tif (ch === \"\\n\" || ch === \" \" || ch === \"\\t\" || ch === \"\\r\") {\n\t\t\tif (current) {\n\t\t\t\ttokens.push(current);\n\t\t\t\tlines.push(line);\n\t\t\t\tcurrent = \"\";\n\t\t\t}\n\t\t\tif (ch === \"\\n\") line++;\n\t\t} else {\n\t\t\tcurrent += ch;\n\t\t}\n\t}\n\tif (current) {\n\t\ttokens.push(current);\n\t\tlines.push(line);\n\t}\n\treturn { tokens, lines };\n}\n\ninterface ClosestMatch {\n\tstartLine: number;\n\tsnippet: string;\n}\n\n/**\n * Find the region of content that most closely resembles oldText, so a failed\n * edit can report what the file actually contains. Uses a sliding token-bag\n * window with Dice similarity, which tolerates re-indentation and line wrapping\n * (e.g. a formatter splitting one line across several).\n */\nexport function findClosestMatch(content: string, oldText: string): ClosestMatch | undefined {\n\tconst target = tokenizeWithLines(normalizeForFuzzyMatch(oldText)).tokens;\n\tif (target.length === 0) {\n\t\treturn undefined;\n\t}\n\t// Line numbers are stable across fuzzy normalization: it never adds or removes newlines.\n\tconst { tokens, lines } = tokenizeWithLines(normalizeForFuzzyMatch(content));\n\tif (tokens.length === 0 || tokens.length > CLOSEST_MATCH_MAX_TOKENS) {\n\t\treturn undefined;\n\t}\n\n\tconst targetCounts = new Map<string, number>();\n\tfor (const token of target) {\n\t\ttargetCounts.set(token, (targetCounts.get(token) ?? 0) + 1);\n\t}\n\n\t// Slide a fixed-size token window across the content, tracking the multiset\n\t// overlap with the target incrementally so the scan is O(tokens).\n\tconst windowSize = Math.min(target.length, tokens.length);\n\tconst windowCounts = new Map<string, number>();\n\tlet overlap = 0;\n\tconst add = (token: string): void => {\n\t\tconst count = (windowCounts.get(token) ?? 0) + 1;\n\t\twindowCounts.set(token, count);\n\t\tif (count <= (targetCounts.get(token) ?? 0)) overlap++;\n\t};\n\tconst remove = (token: string): void => {\n\t\tconst count = (windowCounts.get(token) ?? 0) - 1;\n\t\twindowCounts.set(token, count);\n\t\tif (count < (targetCounts.get(token) ?? 0)) overlap--;\n\t};\n\n\tfor (let i = 0; i < windowSize; i++) {\n\t\tadd(tokens[i]);\n\t}\n\tlet bestOverlap = overlap;\n\tlet bestStart = 0;\n\tfor (let start = 1; start + windowSize <= tokens.length; start++) {\n\t\tremove(tokens[start - 1]);\n\t\tadd(tokens[start + windowSize - 1]);\n\t\tif (overlap > bestOverlap) {\n\t\t\tbestOverlap = overlap;\n\t\t\tbestStart = start;\n\t\t}\n\t}\n\n\tconst score = (2 * bestOverlap) / (target.length + windowSize);\n\tif (score < CLOSEST_MATCH_MIN_SCORE) {\n\t\treturn undefined;\n\t}\n\n\t// Include one line of context on each side so wrapped constructs are shown whole.\n\tconst contentLines = content.split(\"\\n\");\n\tconst startLine = Math.max(1, lines[bestStart] - 1);\n\tconst endLine = Math.min(\n\t\tMath.min(lines[bestStart + windowSize - 1] + 1, contentLines.length),\n\t\tstartLine + CLOSEST_MATCH_MAX_SNIPPET_LINES - 1,\n\t);\n\treturn { startLine, snippet: contentLines.slice(startLine - 1, endLine).join(\"\\n\") };\n}\n\nconst RE_READ_HINT =\n\t\"If the file has changed since you last read it (e.g. it was reformatted), re-read it and base oldText on the current content.\";\n\nfunction getNotFoundError(path: string, editIndex: number, totalEdits: number, closest?: ClosestMatch): Error {\n\tconst base =\n\t\ttotalEdits === 1\n\t\t\t? `Could not find the exact text in ${path}. The old text must match exactly including all whitespace and newlines.`\n\t\t\t: `Could not find edits[${editIndex}] in ${path}. The oldText must match exactly including all whitespace and newlines.`;\n\tif (!closest) {\n\t\treturn new Error(`${base} ${RE_READ_HINT}`);\n\t}\n\treturn new Error(\n\t\t`${base}\\n\\nThe closest match in the file starts at line ${closest.startLine} and differs from your oldText:\\n${closest.snippet}\\n\\n${RE_READ_HINT}`,\n\t);\n}\n\nfunction getDuplicateError(\n\tpath: string,\n\teditIndex: number,\n\ttotalEdits: number,\n\toccurrences: number,\n\tlines: number[],\n): Error {\n\tconst location = lines.length > 0 ? ` (${formatOccurrenceLines(lines)})` : \"\";\n\tif (totalEdits === 1) {\n\t\treturn new Error(\n\t\t\t`Found ${occurrences} occurrences of the text in ${path}${location}. The text must be unique. Add more surrounding lines to oldText to disambiguate which occurrence to replace.`,\n\t\t);\n\t}\n\treturn new Error(\n\t\t`Found ${occurrences} occurrences of edits[${editIndex}] in ${path}${location}. Each oldText must be unique. Add more surrounding lines to oldText to disambiguate which occurrence to replace.`,\n\t);\n}\n\nfunction getEmptyOldTextError(path: string, editIndex: number, totalEdits: number): Error {\n\tif (totalEdits === 1) {\n\t\treturn new Error(`oldText must not be empty in ${path}.`);\n\t}\n\treturn new Error(`edits[${editIndex}].oldText must not be empty in ${path}.`);\n}\n\nfunction getNoChangeError(path: string, totalEdits: number): Error {\n\tif (totalEdits === 1) {\n\t\treturn new Error(\n\t\t\t`No changes made to ${path}. The replacement produced identical content. This might indicate an issue with special characters or the text not existing as expected.`,\n\t\t);\n\t}\n\treturn new Error(`No changes made to ${path}. The replacements produced identical content.`);\n}\n\n/**\n * Apply one or more exact-text replacements to LF-normalized content.\n *\n * All edits are matched against the same original content. Replacements are\n * then applied in reverse order so offsets remain stable. Fuzzy matching may\n * tolerate small whitespace/Unicode differences in the targeted text, but only\n * the matched original ranges are replaced.\n */\nexport function applyEditsToNormalizedContent(\n\tnormalizedContent: string,\n\tedits: Edit[],\n\tpath: string,\n): AppliedEditsResult {\n\tconst normalizedEdits = edits.map((edit) => ({\n\t\toldText: normalizeToLF(edit.oldText),\n\t\tnewText: normalizeToLF(edit.newText),\n\t}));\n\n\tfor (let i = 0; i < normalizedEdits.length; i++) {\n\t\tif (normalizedEdits[i].oldText.length === 0) {\n\t\t\tthrow getEmptyOldTextError(path, i, normalizedEdits.length);\n\t\t}\n\t}\n\n\tconst baseContent = normalizedContent;\n\tlet fuzzyContent: FuzzyNormalizedText | undefined;\n\tconst matchedEdits: MatchedEdit[] = [];\n\tfor (let i = 0; i < normalizedEdits.length; i++) {\n\t\tconst edit = normalizedEdits[i];\n\n\t\t// Exact matching first: a unique exact match always wins, even when fuzzy\n\t\t// normalization would make additional regions look identical.\n\t\tconst exactIndices = findOccurrences(baseContent, edit.oldText);\n\t\tif (exactIndices.length > 1) {\n\t\t\tthrow getDuplicateError(\n\t\t\t\tpath,\n\t\t\t\ti,\n\t\t\t\tnormalizedEdits.length,\n\t\t\t\texactIndices.length,\n\t\t\t\tlineNumbersFor(baseContent, exactIndices),\n\t\t\t);\n\t\t}\n\t\tif (exactIndices.length === 1) {\n\t\t\tmatchedEdits.push({\n\t\t\t\teditIndex: i,\n\t\t\t\tmatchIndex: exactIndices[0],\n\t\t\t\tmatchLength: edit.oldText.length,\n\t\t\t\tnewText: edit.newText,\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\n\t\t// No exact match: fall back to fuzzy matching in normalized space.\n\t\tfuzzyContent ??= normalizeForFuzzyMatchWithMap(baseContent);\n\t\tconst fuzzyOldText = normalizeForFuzzyMatch(edit.oldText);\n\t\tconst fuzzyIndices = fuzzyOldText.length === 0 ? [] : findOccurrences(fuzzyContent.text, fuzzyOldText);\n\t\tif (fuzzyIndices.length === 0) {\n\t\t\tthrow getNotFoundError(path, i, normalizedEdits.length, findClosestMatch(baseContent, edit.oldText));\n\t\t}\n\t\tif (fuzzyIndices.length > 1) {\n\t\t\tconst originalIndices = fuzzyIndices\n\t\t\t\t.map((index) => fuzzyContent!.ranges[index]?.start)\n\t\t\t\t.filter((start): start is number => start !== undefined);\n\t\t\tthrow getDuplicateError(\n\t\t\t\tpath,\n\t\t\t\ti,\n\t\t\t\tnormalizedEdits.length,\n\t\t\t\tfuzzyIndices.length,\n\t\t\t\tlineNumbersFor(baseContent, originalIndices),\n\t\t\t);\n\t\t}\n\n\t\tconst fuzzyIndex = fuzzyIndices[0];\n\t\tconst start = fuzzyContent.ranges[fuzzyIndex];\n\t\tconst end = fuzzyContent.ranges[fuzzyIndex + fuzzyOldText.length - 1];\n\t\tif (!start || !end) {\n\t\t\tthrow getNotFoundError(path, i, normalizedEdits.length, findClosestMatch(baseContent, edit.oldText));\n\t\t}\n\t\tmatchedEdits.push({\n\t\t\teditIndex: i,\n\t\t\tmatchIndex: start.start,\n\t\t\tmatchLength: end.end - start.start,\n\t\t\tnewText: edit.newText,\n\t\t});\n\t}\n\n\tmatchedEdits.sort((a, b) => a.matchIndex - b.matchIndex);\n\tfor (let i = 1; i < matchedEdits.length; i++) {\n\t\tconst previous = matchedEdits[i - 1];\n\t\tconst current = matchedEdits[i];\n\t\tif (previous.matchIndex + previous.matchLength > current.matchIndex) {\n\t\t\tthrow new Error(\n\t\t\t\t`edits[${previous.editIndex}] and edits[${current.editIndex}] overlap in ${path}. Merge them into one edit or target disjoint regions.`,\n\t\t\t);\n\t\t}\n\t}\n\n\tlet newContent = baseContent;\n\tfor (let i = matchedEdits.length - 1; i >= 0; i--) {\n\t\tconst edit = matchedEdits[i];\n\t\tnewContent =\n\t\t\tnewContent.substring(0, edit.matchIndex) +\n\t\t\tedit.newText +\n\t\t\tnewContent.substring(edit.matchIndex + edit.matchLength);\n\t}\n\n\tif (baseContent === newContent) {\n\t\tthrow getNoChangeError(path, normalizedEdits.length);\n\t}\n\n\treturn { baseContent, newContent };\n}\n\n/** Generate a standard unified patch. */\nexport function generateUnifiedPatch(path: string, oldContent: string, newContent: string, contextLines = 4): string {\n\treturn Diff.createTwoFilesPatch(path, path, oldContent, newContent, undefined, undefined, {\n\t\tcontext: contextLines,\n\t\theaderOptions: Diff.FILE_HEADERS_ONLY,\n\t});\n}\n\n/**\n * Generate a display-oriented diff string with line numbers and context.\n * Returns both the diff string and the first changed line number (in the new file).\n */\nexport function generateDiffString(\n\toldContent: string,\n\tnewContent: string,\n\tcontextLines = 4,\n): { diff: string; firstChangedLine: number | undefined } {\n\tconst parts = Diff.diffLines(oldContent, newContent);\n\tconst output: string[] = [];\n\n\tconst oldLines = oldContent.split(\"\\n\");\n\tconst newLines = newContent.split(\"\\n\");\n\tconst maxLineNum = Math.max(oldLines.length, newLines.length);\n\tconst lineNumWidth = String(maxLineNum).length;\n\n\tlet oldLineNum = 1;\n\tlet newLineNum = 1;\n\tlet lastWasChange = false;\n\tlet firstChangedLine: number | undefined;\n\n\tfor (let i = 0; i < parts.length; i++) {\n\t\tconst part = parts[i];\n\t\tconst raw = part.value.split(\"\\n\");\n\t\tif (raw[raw.length - 1] === \"\") {\n\t\t\traw.pop();\n\t\t}\n\n\t\tif (part.added || part.removed) {\n\t\t\t// Capture the first changed line (in the new file)\n\t\t\tif (firstChangedLine === undefined) {\n\t\t\t\tfirstChangedLine = newLineNum;\n\t\t\t}\n\n\t\t\t// Show the change\n\t\t\tfor (const line of raw) {\n\t\t\t\tif (part.added) {\n\t\t\t\t\tconst lineNum = String(newLineNum).padStart(lineNumWidth, \" \");\n\t\t\t\t\toutput.push(`+${lineNum} ${line}`);\n\t\t\t\t\tnewLineNum++;\n\t\t\t\t} else {\n\t\t\t\t\t// removed\n\t\t\t\t\tconst lineNum = String(oldLineNum).padStart(lineNumWidth, \" \");\n\t\t\t\t\toutput.push(`-${lineNum} ${line}`);\n\t\t\t\t\toldLineNum++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlastWasChange = true;\n\t\t} else {\n\t\t\t// Context lines - only show a few before/after changes\n\t\t\tconst nextPartIsChange = i < parts.length - 1 && (parts[i + 1].added || parts[i + 1].removed);\n\t\t\tconst hasLeadingChange = lastWasChange;\n\t\t\tconst hasTrailingChange = nextPartIsChange;\n\n\t\t\tif (hasLeadingChange && hasTrailingChange) {\n\t\t\t\tif (raw.length <= contextLines * 2) {\n\t\t\t\t\tfor (const line of raw) {\n\t\t\t\t\t\tconst lineNum = String(oldLineNum).padStart(lineNumWidth, \" \");\n\t\t\t\t\t\toutput.push(` ${lineNum} ${line}`);\n\t\t\t\t\t\toldLineNum++;\n\t\t\t\t\t\tnewLineNum++;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tconst leadingLines = raw.slice(0, contextLines);\n\t\t\t\t\tconst trailingLines = raw.slice(raw.length - contextLines);\n\t\t\t\t\tconst skippedLines = raw.length - leadingLines.length - trailingLines.length;\n\n\t\t\t\t\tfor (const line of leadingLines) {\n\t\t\t\t\t\tconst lineNum = String(oldLineNum).padStart(lineNumWidth, \" \");\n\t\t\t\t\t\toutput.push(` ${lineNum} ${line}`);\n\t\t\t\t\t\toldLineNum++;\n\t\t\t\t\t\tnewLineNum++;\n\t\t\t\t\t}\n\n\t\t\t\t\toutput.push(` ${\"\".padStart(lineNumWidth, \" \")} ...`);\n\t\t\t\t\toldLineNum += skippedLines;\n\t\t\t\t\tnewLineNum += skippedLines;\n\n\t\t\t\t\tfor (const line of trailingLines) {\n\t\t\t\t\t\tconst lineNum = String(oldLineNum).padStart(lineNumWidth, \" \");\n\t\t\t\t\t\toutput.push(` ${lineNum} ${line}`);\n\t\t\t\t\t\toldLineNum++;\n\t\t\t\t\t\tnewLineNum++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (hasLeadingChange) {\n\t\t\t\tconst shownLines = raw.slice(0, contextLines);\n\t\t\t\tconst skippedLines = raw.length - shownLines.length;\n\n\t\t\t\tfor (const line of shownLines) {\n\t\t\t\t\tconst lineNum = String(oldLineNum).padStart(lineNumWidth, \" \");\n\t\t\t\t\toutput.push(` ${lineNum} ${line}`);\n\t\t\t\t\toldLineNum++;\n\t\t\t\t\tnewLineNum++;\n\t\t\t\t}\n\n\t\t\t\tif (skippedLines > 0) {\n\t\t\t\t\toutput.push(` ${\"\".padStart(lineNumWidth, \" \")} ...`);\n\t\t\t\t\toldLineNum += skippedLines;\n\t\t\t\t\tnewLineNum += skippedLines;\n\t\t\t\t}\n\t\t\t} else if (hasTrailingChange) {\n\t\t\t\tconst skippedLines = Math.max(0, raw.length - contextLines);\n\t\t\t\tif (skippedLines > 0) {\n\t\t\t\t\toutput.push(` ${\"\".padStart(lineNumWidth, \" \")} ...`);\n\t\t\t\t\toldLineNum += skippedLines;\n\t\t\t\t\tnewLineNum += skippedLines;\n\t\t\t\t}\n\n\t\t\t\tfor (const line of raw.slice(skippedLines)) {\n\t\t\t\t\tconst lineNum = String(oldLineNum).padStart(lineNumWidth, \" \");\n\t\t\t\t\toutput.push(` ${lineNum} ${line}`);\n\t\t\t\t\toldLineNum++;\n\t\t\t\t\tnewLineNum++;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Skip these context lines entirely\n\t\t\t\toldLineNum += raw.length;\n\t\t\t\tnewLineNum += raw.length;\n\t\t\t}\n\n\t\t\tlastWasChange = false;\n\t\t}\n\t}\n\n\treturn { diff: output.join(\"\\n\"), firstChangedLine };\n}\n\nexport interface EditDiffResult {\n\tdiff: string;\n\tfirstChangedLine: number | undefined;\n}\n\nexport interface EditDiffError {\n\terror: string;\n}\n\n/**\n * Compute the diff for one or more edit operations without applying them.\n * Used for preview rendering in the TUI before the tool executes.\n */\nexport async function computeEditsDiff(\n\tpath: string,\n\tedits: Edit[],\n\tcwd: string,\n): Promise<EditDiffResult | EditDiffError> {\n\tconst absolutePath = resolveToCwd(path, cwd);\n\n\ttry {\n\t\t// Check if file exists and is readable\n\t\ttry {\n\t\t\tawait access(absolutePath, constants.R_OK);\n\t\t} catch (error: unknown) {\n\t\t\tconst errorMessage = error instanceof Error && \"code\" in error ? `Error code: ${error.code}` : String(error);\n\t\t\treturn { error: `Could not edit file: ${path}. ${errorMessage}.` };\n\t\t}\n\n\t\t// Read the file\n\t\tconst rawContent = await readFile(absolutePath, \"utf-8\");\n\n\t\t// Strip BOM before matching (LLM won't include invisible BOM in oldText)\n\t\tconst { text: content } = stripBom(rawContent);\n\t\tconst normalizedContent = normalizeToLF(content);\n\t\tconst { baseContent, newContent } = applyEditsToNormalizedContent(normalizedContent, edits, path);\n\n\t\t// Generate the diff\n\t\treturn generateDiffString(baseContent, newContent);\n\t} catch (err) {\n\t\treturn { error: err instanceof Error ? err.message : String(err) };\n\t}\n}\n\n/**\n * Compute the diff for a single edit operation without applying it.\n * Kept as a convenience wrapper for single-edit callers.\n */\nexport async function computeEditDiff(\n\tpath: string,\n\toldText: string,\n\tnewText: string,\n\tcwd: string,\n): Promise<EditDiffResult | EditDiffError> {\n\treturn computeEditsDiff(path, [{ oldText, newText }], cwd);\n}\n"]}

package/dist/core/tools/edit.d.ts

@@ -0,0 +1,56 @@
+import type { AgentTool } from "@hansjm10/volt-agent-core";
+import { Box } from "@hansjm10/volt-tui";
+import { type Static, Type } from "typebox";
+import type { ToolDefinition } from "../extensions/types.ts";
+import type { ToolDiagnosticsProvider } from "./diagnostics-provider.ts";
+import { type EditDiffError, type EditDiffResult } from "./edit-diff.ts";
+type EditPreview = EditDiffResult | EditDiffError;
+type EditRenderState = {
+    callComponent?: EditCallRenderComponent;
+};
+declare const editSchema: Type.TObject<{
+    path: Type.TString;
+    edits: Type.TArray<Type.TObject<{
+        oldText: Type.TString;
+        newText: Type.TString;
+    }>>;
+}>;
+export type EditToolInput = Static<typeof editSchema>;
+export interface EditToolDetails {
+    /** Display-oriented diff of the changes made */
+    diff: string;
+    /** Standard unified patch of the changes made */
+    patch: string;
+    /** Line number of the first change in the new file (for editor navigation) */
+    firstChangedLine?: number;
+    /** Formatted diagnostics collected after the edit (e.g. from LSP) */
+    diagnostics?: string;
+}
+/**
+ * Pluggable operations for the edit tool.
+ * Override these to delegate file editing to remote systems (for example SSH).
+ */
+export interface EditOperations {
+    /** Read file contents as a Buffer */
+    readFile: (absolutePath: string) => Promise<Buffer>;
+    /** Write content to a file */
+    writeFile: (absolutePath: string, content: string) => Promise<void>;
+    /** Check if file is readable and writable (throw if not) */
+    access: (absolutePath: string) => Promise<void>;
+}
+export interface EditToolOptions {
+    /** Custom operations for file editing. Default: local filesystem */
+    operations?: EditOperations;
+    /** Optional post-edit diagnostics provider (e.g. LSP). Failures are ignored. */
+    diagnosticsProvider?: ToolDiagnosticsProvider;
+}
+type EditCallRenderComponent = Box & {
+    preview?: EditPreview;
+    previewArgsKey?: string;
+    previewPending?: boolean;
+    settledError?: boolean;
+};
+export declare function createEditToolDefinition(cwd: string, options?: EditToolOptions): ToolDefinition<typeof editSchema, EditToolDetails | undefined, EditRenderState>;
+export declare function createEditTool(cwd: string, options?: EditToolOptions): AgentTool<typeof editSchema>;
+export {};
+//# sourceMappingURL=edit.d.ts.map