@j0hanz/filesystem-mcp 2.8.1 → 2.9.1

package/dist/tools/replace-text.js

@@ -51,19 +51,17 @@ var __disposeResources = (this && this.__disposeResources) || (function (Suppres
     return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
 });
 import { Buffer, isUtf8 } from 'node:buffer';
-import { dirname } from 'node:path';
 import * as z from 'zod/v4';
 import { processEntriesConcurrently } from "../core/concurrency.js";
 import { unifiedPatch } from "../core/diff.js";
-import { ErrorCode, FsError, Problem } from "../core/errors.js";
+import { ErrorCode, FsError, isFsError, isSkippableErrno, Problem } from "../core/errors.js";
 import { buildWrittenFileMeta } from "../core/file-uri.js";
 import { stoppedEarlyLine, truncateProgressPattern, zeroMatchHint } from "../core/fmt.js";
 import { globEntries } from "../core/glob.js";
-import { toPosixRelative } from "../core/path-utils.js";
 import { createTooLargeError, readFileBufferWithLimit } from "../core/read.js";
-import { defaultFalseBoolean, IncludeHidden, IncludeIgnored, MaxDepth, nonBlankString, OptionalPath, SafeGlobPattern, } from "../core/schema.js";
-import { compileRegex, createYielder, execMatches, freeRegex, RE2_MAX_INPUT_BYTES, } from "../core/search.js";
-import { DEFAULT_SEARCH_RESULTS, DEFAULT_SEARCH_TIMEOUT_MS, escapeRegExp, getMaxTextFileSize, MAX_SEARCH_RESULTS, PARALLEL_CONCURRENCY, } from "../core/util.js";
+import { defaultFalseBoolean, IncludeHidden, IncludeIgnored, mapOptionalPath, MaxDepth, nonBlankString, OptionalPath, SafeGlobPattern, } from "../core/schema.js";
+import { compileRegex, createYielder, execMatches, freeRegex, RE2_MAX_INPUT_BYTES, resolveSearchScope, } from "../core/search.js";
+import { DEFAULT_SEARCH_RESULTS, escapeRegExp, getMaxTextFileSize, MAX_SEARCH_RESULTS, PARALLEL_CONCURRENCY, } from "../core/util.js";
 import { isTotalFailure } from "./batch.js";
 import { defineTool } from "./define.js";
 const SearchAndReplaceInputSchema = z.strictObject({
@@ -111,12 +109,12 @@ function recordFailure(summary, entryPath, error) {
     if (summary.failures.length >= MAX_FAILURES)
         return;
     summary.failures.push({
-        path: toPosixRelative(summary.root, entryPath),
+        path: summary.paths.show(entryPath),
         error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, entryPath),
     });
 }
 function recordChangedFile(summary, plan, filePath) {
-    const relativePath = toPosixRelative(summary.root, filePath);
+    const relativePath = summary.paths.show(filePath);
     // The first changed file is the one the resource_link points at; keep what
     // was written so the link needs no read-back.
     summary.primary ??= { path: filePath, content: plan.updatedContent };
@@ -227,6 +225,9 @@ function createCaseSensitiveLiteralMatcher(searchPattern) {
 }
 async function processEntry(entryPath, ctx) {
     const { dryRun, returnDiff, signal, summary } = ctx;
+    // Discovery/read failures on a walked file are skipped silently; a failed
+    // write is the caller's edit not landing, so it is always reported.
+    const write = { started: false };
     try {
         // Lock the read→write per file so a concurrent writer is not lost; a dry
         // run never writes and skips the lock.
@@ -234,8 +235,10 @@ async function processEntry(entryPath, ctx) {
             ? await readReplacementPlan(entryPath, ctx)
             : await ctx.fs.lockForWrite(entryPath, async () => {
                 const planned = await readReplacementPlan(entryPath, ctx);
-                if (planned)
+                if (planned) {
+                    write.started = true;
                     await ctx.fs.writeFile(entryPath, planned.updatedContent, { signal });
+                }
                 return planned;
             });
         if (!plan) {
@@ -259,6 +262,16 @@ async function processEntry(entryPath, ctx) {
         // stoppedReason 'timeout' instead.
         if (signal?.aborted)
             return;
+        if (!ctx.singleFile &&
+            !write.started &&
+            ((isFsError(error) &&
+                (error.code === ErrorCode.ACCESS_DENIED ||
+                    error.code === ErrorCode.NOT_FOUND ||
+                    error.code === ErrorCode.SYMLINK_NOT_ALLOWED)) ||
+                isSkippableErrno(error))) {
+            summary.processedFiles--;
+            return;
+        }
         recordFailure(summary, entryPath, error);
     }
 }
@@ -307,7 +320,7 @@ function maybeAppendPatchDiff(summary, params) {
         summary.diffTruncated = true;
         return;
     }
-    const header = toPosixRelative(summary.root, params.filePath);
+    const header = summary.paths.show(params.filePath);
     const patch = unifiedPatch(header, params.originalContent, params.updatedContent);
     if (patch === undefined) {
         summary.diffTruncated = true;
@@ -319,9 +332,9 @@ function maybeAppendPatchDiff(summary, params) {
     }
     summary.diffTruncated = true;
 }
-function createReplaceSummary(root) {
+function createReplaceSummary(paths) {
     return {
-        root,
+        paths,
         totalMatches: 0,
         filesChanged: 0,
         failedFiles: 0,
@@ -334,24 +347,6 @@ function createReplaceSummary(root) {
         diffTruncated: false,
     };
 }
-async function resolveSearchRoot(pathValue, fs) {
-    if (!pathValue) {
-        return { root: fs.pathGuard.resolvePathOrRoot(undefined) };
-    }
-    const resolvedPath = await fs.pathGuard.validateExistingPath(pathValue);
-    const { stats: fileStats } = await fs.stat(resolvedPath);
-    if (fileStats.isFile()) {
-        // A single explicit file target bypasses the glob machinery entirely:
-        // routing it through globEntries with baseNameMatch would rewrite the
-        // escaped basename to `**/${basename}` and match every same-named file
-        // under the parent tree, not just this one.
-        return {
-            root: dirname(resolvedPath),
-            singleFile: resolvedPath,
-        };
-    }
-    return { root: resolvedPath };
-}
 function buildSearchPattern(args) {
     if (args.isRegex) {
         return args.wholeWord ? `\\b(?:${args.searchPattern})\\b` : args.searchPattern;
@@ -373,6 +368,7 @@ function buildSearchAndReplaceStructuredResult(summary, args) {
         ...summary.failures.map((f) => ({ path: f.path, error: f.error })),
     ];
     return {
+        root: summary.paths.root,
         results,
         // `failedFiles` counts every failure; `failures` itself is capped at
         // MAX_FAILURES, so the summary must not be derived from the array length.
@@ -396,7 +392,7 @@ function buildSearchAndReplaceStructuredResult(summary, args) {
 }
 async function handleSearchAndReplace(args, ctx) {
     const maxFileSize = getMaxTextFileSize();
-    const { root, singleFile } = await resolveSearchRoot(args.path, ctx.fs);
+    const { basePath: root, explicitFile: singleFile } = await resolveSearchScope(args.path, ctx.fs);
     const effectivePattern = args.pattern ?? '**/*';
     const ceiling = ctx.fs.pathGuard.allowedRootContaining(root);
     // An explicit single-file target bypasses baseNameMatch/exclude/hidden/
@@ -408,6 +404,7 @@ async function handleSearchAndReplace(args, ctx) {
             pattern: effectivePattern,
             includeHidden: args.includeHidden,
             skipIgnored: !args.includeIgnored,
+            pathGuard: ctx.fs.pathGuard,
             ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),
             signal: ctx.signal,
             baseNameMatch: true,
@@ -415,7 +412,9 @@ async function handleSearchAndReplace(args, ctx) {
             suppressErrors: true,
             ...(args.maxDepth !== undefined ? { maxDepth: args.maxDepth } : {}),
         });
-    const summary = createReplaceSummary(root);
+    // Relative to the root, not to the walked directory: `a.ts` from a run over
+    // `src` would name `<root>/a.ts` when passed back.
+    const summary = createReplaceSummary(ctx.fs.pathGuard.resultPaths(root));
     // The matcher may own a compiled RE2 pattern, whose wasm memory re2-wasm
     // never reclaims on its own. Nothing past the scan touches it, so free it the
     // moment the scan is done — success, failure, or abort alike.
@@ -480,6 +479,7 @@ async function handleSearchAndReplace(args, ctx) {
             content: summary.primary.content,
             dryRun: args.dryRun,
             lastModified: primaryModified,
+            transport: ctx.transport,
         }).resourceLink
         : undefined;
     return link ? { structured, link } : { structured };
@@ -492,7 +492,7 @@ export const REPLACE_TEXT = defineTool({
         'and ^ and $ anchor to file start and end. edit replaces one unique exact match.',
     input: SearchAndReplaceInputSchema,
     readOnlyHint: false,
-    timeoutMs: DEFAULT_SEARCH_TIMEOUT_MS,
+    deadline: true,
     progress: (args) => {
         const dryLabel = args.dryRun ? ' [dry run]' : '';
         return {
@@ -500,7 +500,7 @@ export const REPLACE_TEXT = defineTool({
             subject: `${truncateProgressPattern(args.searchPattern)} → ${truncateProgressPattern(args.replacement)}`,
         };
     },
-    accessPaths: (args) => (args.path ? [args.path] : []),
+    mapPaths: mapOptionalPath,
     run: async (args, ctx) => {
         const truncatedPattern = truncateProgressPattern(args.searchPattern);
         const { structured, link } = await handleSearchAndReplace(args, ctx);
@@ -516,8 +516,23 @@ export const REPLACE_TEXT = defineTool({
         // model, so the stop state and the diff preview must ride the text.
         const lines = [summaryText];
         const stop = structured.stoppedReason;
-        if (stop === 'timeout')
+        if (stop === 'timeout') {
             lines.push(stoppedEarlyLine(stop));
+            // A live run writes as it scans, so a timeout leaves the files it reached
+            // rewritten. The paths ship under `_meta`, which the model does not see; name
+            // them here, or a re-run of a self-matching replacement applies it twice.
+            if (!args.dryRun && structured.summary.succeeded > 0) {
+                const total = structured.summary.succeeded;
+                const shown = structured.results
+                    .filter((x) => !('error' in x))
+                    .slice(0, 5)
+                    .map((x) => x.path)
+                    .join(', ');
+                const more = total > 5 ? `, and ${String(total - 5)} more` : '';
+                lines.push(`// ${String(total)} file(s) were already rewritten and stay changed: ${shown}${more}. ` +
+                    'Re-running the same replacement applies it to them again; exclude them, or use dryRun first.');
+            }
+        }
         else if (stop !== undefined) {
             // maxResults/maxFiles here are the caller's own caps, so raising one is
             // what reaches the rest; the search engine's advice to narrow is not.

package/dist/tools/replace-text.js.map

@@ -1 +1 @@
-{"version":3,"file":"replace-text.js","sourceRoot":"","sources":["../../src/tools/replace-text.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAG5B,OAAO,EAAE,0BAA0B,EAAE,MAAM,wBAAwB,CAAC;AACpE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAC3D,OAAO,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAE1F,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iBAAiB,CAAC;AAC/E,OAAO,EACL,mBAAmB,EACnB,aAAa,EACb,cAAc,EACd,QAAQ,EACR,cAAc,EACd,YAAY,EACZ,eAAe,GAChB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,YAAY,EACZ,aAAa,EACb,WAAW,EACX,SAAS,EACT,mBAAmB,GACpB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,sBAAsB,EACtB,yBAAyB,EACzB,YAAY,EACZ,kBAAkB,EAClB,kBAAkB,EAClB,oBAAoB,GACrB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAoB,cAAc,EAAE,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,UAAU,EAAgB,MAAM,aAAa,CAAC;AAEvD,MAAM,2BAA2B,GAAG,CAAC,CAAC,YAAY,CAAC;IACjD,IAAI,EAAE,YAAY,CAAC,QAAQ,CACzB,sGAAsG;QACpG,qEAAqE,CACxE;IACD,OAAO,EAAE,eAAe,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAC1C,8FAA8F,CAC/F;IACD,aAAa,EAAE,cAAc,CAAC,eAAe,CAAC;SAC3C,GAAG,CAAC,KAAK,CAAC;SACV,QAAQ,CACP,4LAA4L,CAC7L;IACH,WAAW,EAAE,CAAC;SACX,MAAM,EAAE;SACR,GAAG,CAAC,KAAK,CAAC;SACV,QAAQ,CACP,6HAA6H,CAC9H;SACA,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC;IACtD,OAAO,EAAE,mBAAmB,CAAC,kEAAkE,CAAC;IAChG,aAAa,EAAE,aAAa;IAC5B,cAAc,EAAE,cAAc;IAC9B,aAAa,EAAE,mBAAmB,CAAC,4DAA4D,CAAC;IAChG,SAAS,EAAE,mBAAmB,CAAC,kDAAkD,CAAC;IAClF,MAAM,EAAE,mBAAmB,CACzB,+EAA+E,CAChF;IACD,UAAU,EAAE,mBAAmB,CAAC,uDAAuD,CAAC;IACxF,UAAU,EAAE,CAAC;SACV,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,kBAAkB,CAAC;SACvB,QAAQ,EAAE;SACV,OAAO,CAAC,sBAAsB,CAAC;SAC/B,QAAQ,CAAC,4DAA4D,CAAC;IACzE,QAAQ,EAAE,CAAC;SACR,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,kBAAkB,CAAC;SACvB,QAAQ,EAAE;SACV,QAAQ,CAAC,oCAAoC,CAAC;IACjD,QAAQ,EAAE,QAAQ;CACnB,CAAC,CAAC;AAYH,MAAM,YAAY,GAAG,EAAE,CAAC;AACxB,MAAM,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;AAC9D,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAC9B,MAAM,aAAa,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,6BAA6B;AAC9D,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAOhC,iFAAiF;AACjF,SAAS,aAAa,CAAC,OAAuB,EAAE,SAAiB,EAAE,KAAc;IAC/E,OAAO,CAAC,WAAW,EAAE,CAAC;IACtB,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,IAAI,YAAY;QAAE,OAAO;IACpD,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;QACpB,IAAI,EAAE,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC;QAC9C,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC;KAChE,CAAC,CAAC;AACL,CAAC;AAED,SAAS,iBAAiB,CAAC,OAAuB,EAAE,IAAqB,EAAE,QAAgB;IACzF,MAAM,YAAY,GAAG,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC7D,2EAA2E;IAC3E,8CAA8C;IAC9C,OAAO,CAAC,OAAO,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC;IACrE,IAAI,OAAO,CAAC,YAAY,CAAC,MAAM,GAAG,iBAAiB,EAAE,CAAC;QACpD,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QAC5E,OAAO;IACT,CAAC;IACD,OAAO,CAAC,qBAAqB,GAAG,IAAI,CAAC;AACvC,CAAC;AAcD,MAAM,YAAY,GAAG,iCAAiC,CAAC;AAEvD;;;;;;;;;GASG;AACH,SAAS,kBAAkB,CACzB,QAAgB,EAChB,KAAa,EACb,MAA8B,EAC9B,MAAc,EACd,KAAa,EACb,KAAyC;IAEzC,OAAO,QAAQ,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC,KAAa,EAAE,IAAY,EAAE,IAAa,EAAE,EAAE;QACnF,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,GAAG,CAAC;QAC7B,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC;QAC/B,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAChD,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QAC5D,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAClE,OAAO,KAAK,CAAC;QACf,CAAC;QACD,2EAA2E;QAC3E,wEAAwE;QACxE,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC,MAAM;YAAE,OAAO,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QACxF,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClD,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YACrC,OAAO,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,6BAA6B,CACpC,KAAY,EACZ,iBAA0B;IAE1B,OAAO;QACL,UAAU,CAAC,MAAc;YACvB,IAAI,MAAM,CAAC,MAAM,GAAG,mBAAmB,EAAE,CAAC;gBACxC,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,SAAS,EACnB,uCAAuC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,MAAM,CAAC,mBAAmB,CAAC,oKAAoK,CAClQ,CAAC;YACJ,CAAC;YACD,sEAAsE;YACtE,oEAAoE;YACpE,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YACpB,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM;YACxC,yEAAyE;YACzE,oEAAoE;YACpE,yEAAyE;YACzE,wEAAwE;YACxE,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,OAAO,GAAG,EAAE,CAAC;YACjB,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;YACnC,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;gBAChD,UAAU,EAAE,CAAC;gBACb,mEAAmE;gBACnE,uEAAuE;gBACvE,+DAA+D;gBAC/D,OAAO;oBACL,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC;wBAClC,CAAC,iBAAiB;4BAChB,CAAC,CAAC,kBAAkB,CAChB,WAAW,EACX,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,MAAM,EACZ,KAAK,CAAC,KAAK,EACX,OAAO,EACP,KAAK,CAAC,KAAK,CACZ;4BACH,CAAC,CAAC,WAAW,CAAC,CAAC;gBACnB,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC;gBACnB,IAAI,MAAM,IAAI,EAAE;oBAAE,MAAM,EAAE,cAAc,EAAE,CAAC;YAC7C,CAAC;YACD,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC;QAClE,CAAC;QACD,OAAO;YACL,SAAS,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,iCAAiC,CAAC,aAAqB;IAC9D,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;IAExD,OAAO;QACL,UAAU,CAAC,MAAc;YACvB,OAAO,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,8CAA8C;QAC9C,OAAO,CAAC,OAAO,EAAE,WAAW;YAC1B,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,MAAM,OAAO,GAAG,OAAO,CAAC,UAAU,CAAC,aAAa,EAAE,GAAG,EAAE;gBACrD,UAAU,EAAE,CAAC;gBACb,OAAO,WAAW,CAAC;YACrB,CAAC,CAAC,CAAC;YACH,OAAO,OAAO,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO;YACL,iCAAiC;QACnC,CAAC;KACF,CAAC;AACJ,CAAC;AAsBD,KAAK,UAAU,YAAY,CAAC,SAAiB,EAAE,GAAmB;IAChE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,GAAG,CAAC;IAEpD,IAAI,CAAC;QACH,yEAAyE;QACzE,uCAAuC;QACvC,MAAM,IAAI,GAAG,MAAM;YACjB,CAAC,CAAC,MAAM,mBAAmB,CAAC,SAAS,EAAE,GAAG,CAAC;YAC3C,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE;gBAC9C,MAAM,OAAO,GAAG,MAAM,mBAAmB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;gBAC1D,IAAI,OAAO;oBAAE,MAAM,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,EAAE,OAAO,CAAC,cAAc,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;gBACnF,OAAO,OAAO,CAAC;YACjB,CAAC,CAAC,CAAC;QACP,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO;QACT,CAAC;QAED,0EAA0E;QAC1E,6DAA6D;QAC7D,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,UAAU,CAAC;QACxC,OAAO,CAAC,YAAY,EAAE,CAAC;QAEvB,iBAAiB,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QAE5C,oBAAoB,CAAC,OAAO,EAAE;YAC5B,QAAQ,EAAE,SAAS;YACnB,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,WAAW,EAAE,MAAM,IAAI,UAAU;SAClC,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,2EAA2E;QAC3E,0EAA0E;QAC1E,mCAAmC;QACnC,IAAI,MAAM,EAAE,OAAO;YAAE,OAAO;QAC5B,aAAa,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAC3C,CAAC;AACH,CAAC;AAED,KAAK,UAAU,mBAAmB,CAChC,SAAiB,EACjB,GAAmB;;;QAEnB,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;QAC1D,MAAY,UAAU,kCAAG,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAA,CAAC;QACtD,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,CAAC;QACtC,IAAI,KAAK,CAAC,IAAI,GAAG,WAAW,EAAE,CAAC;YAC7B,MAAM,mBAAmB,CAAC,KAAK,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAChE,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,uBAAuB,CAAC,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACzF,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC;YAAE,OAAO,SAAS,CAAC;QAClD,4EAA4E;QAC5E,8EAA8E;QAC9E,qEAAqE;QACrE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;gBACnB,MAAM,IAAI,OAAO,CAAC,SAAS,CAAC,aAAa,EAAE,oCAAoC,EAAE,SAAS,CAAC,CAAC;YAC9F,CAAC;YACD,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;YAC5B,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACjD,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,GAAG,MAAM,OAAO,CAAC,OAAO,CACnE,eAAe,EACf,WAAW,EACX,MAAM,CACP,CAAC;QACF,OAAO,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,eAAe,EAAE,cAAc,EAAE,CAAC;;;;;;;;;;;CACvF;AAED,SAAS,oBAAoB,CAC3B,OAAuB,EACvB,MAKC;IAED,IAAI,CAAC,MAAM,CAAC,WAAW;QAAE,OAAO;IAEhC,6EAA6E;IAC7E,wEAAwE;IACxE,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,aAAa,EAAE,CAAC;QACzC,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;QAC7B,OAAO;IACT,CAAC;IACD,MAAM,MAAM,GAAG,eAAe,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC9D,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,cAAc,CAAC,CAAC;IAClF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;QAC7B,OAAO;IACT,CAAC;IACD,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,aAAa,GAAG,kBAAkB,EAAE,CAAC;QAC7E,OAAO,CAAC,IAAI,IAAI,KAAK,CAAC;QACtB,OAAO;IACT,CAAC;IACD,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;AAC/B,CAAC;AAmBD,SAAS,oBAAoB,CAAC,IAAY;IACxC,OAAO;QACL,IAAI;QACJ,YAAY,EAAE,CAAC;QACf,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,CAAC;QACd,cAAc,EAAE,CAAC;QACjB,aAAa,EAAE,CAAC;QAChB,QAAQ,EAAE,EAAE;QACZ,YAAY,EAAE,EAAE;QAChB,qBAAqB,EAAE,KAAK;QAC5B,IAAI,EAAE,EAAE;QACR,aAAa,EAAE,KAAK;KACrB,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,iBAAiB,CAC9B,SAA6B,EAC7B,EAAqB;IAErB,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC;IAC7D,CAAC;IACD,MAAM,YAAY,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;IACxE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACzD,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;QACvB,sEAAsE;QACtE,sEAAsE;QACtE,uEAAuE;QACvE,4CAA4C;QAC5C,OAAO;YACL,IAAI,EAAE,OAAO,CAAC,YAAY,CAAC;YAC3B,UAAU,EAAE,YAAY;SACzB,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC;AAChC,CAAC;AAED,SAAS,kBAAkB,CAAC,IAA0B;IACpD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,aAAa,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;IACjF,CAAC;IACD,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACjD,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,OAAO,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;AAC3D,CAAC;AAED,SAAS,wBAAwB,CAAC,IAA0B;IAC1D,2EAA2E;IAC3E,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;QAC1D,MAAM,KAAK,GAAG,YAAY,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QAC5F,OAAO,6BAA6B,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,iCAAiC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,qCAAqC,CAC5C,OAAuB,EACvB,IAA0B;IAE1B,MAAM,OAAO,GAAG;QACd,GAAG,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACrF,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;KACnE,CAAC;IACF,OAAO;QACL,OAAO;QACP,qEAAqE;QACrE,0EAA0E;QAC1E,OAAO,EAAE;YACP,KAAK,EAAE,OAAO,CAAC,YAAY,GAAG,OAAO,CAAC,WAAW;YACjD,SAAS,EAAE,OAAO,CAAC,YAAY;YAC/B,MAAM,EAAE,OAAO,CAAC,WAAW;SAC5B;QACD,YAAY,EAAE,OAAO,CAAC,YAAY;QAClC,YAAY,EAAE,OAAO,CAAC,cAAc;QACpC,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,wEAAwE;QACxE,uEAAuE;QACvE,GAAG,CAAC,OAAO,CAAC,qBAAqB,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,GAAG,OAAO,CAAC,WAAW;YAChF,CAAC,CAAC,EAAE,gBAAgB,EAAE,IAAI,EAAE;YAC5B,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnF,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzD,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC3E,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,sBAAsB,CACnC,IAA0B,EAC1B,GAAY;IAKZ,MAAM,WAAW,GAAG,kBAAkB,EAAE,CAAC;IACzC,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,MAAM,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;IACxE,MAAM,gBAAgB,GAAG,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC;IAChD,MAAM,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAE7D,wEAAwE;IACxE,6EAA6E;IAC7E,MAAM,OAAO,GAAiE,UAAU;QACtF,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;QACxB,CAAC,CAAC,WAAW,CAAC;YACV,GAAG,EAAE,IAAI;YACT,OAAO,EAAE,gBAAgB;YACzB,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,WAAW,EAAE,CAAC,IAAI,CAAC,cAAc;YACjC,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,aAAa,EAAE,IAAI;YACnB,SAAS,EAAE,IAAI;YACf,cAAc,EAAE,IAAI;YACpB,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpE,CAAC,CAAC;IAEP,MAAM,OAAO,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;IAE3C,yEAAyE;IACzE,8EAA8E;IAC9E,8DAA8D;IAC9D,MAAM,OAAO,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,aAAwC,CAAC;IAC7C,IAAI,CAAC;QACH,MAAM,OAAO,GAAmB;YAC9B,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,OAAO;YACP,WAAW;YACX,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,OAAO;YACP,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,UAAU,EAAE,UAAU,KAAK,SAAS;SACrC,CAAC;QAEF,aAAa,GAAG,MAAM,0BAA0B,CAAC,OAAO,EAAE;YACxD,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,WAAW,EAAE,mBAAmB;YAChC,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrE,UAAU,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,UAAU;YACzD,OAAO,EAAE,GAAG,EAAE;gBACZ,OAAO,CAAC,cAAc,EAAE,CAAC;gBACzB,GAAG,CAAC,UAAU,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;YACtD,CAAC;YACD,OAAO,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE;gBAC1B,aAAa,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;YACzC,CAAC;YACD,QAAQ,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC;SAC1D,CAAC,CAAC;IACL,CAAC;YAAS,CAAC;QACT,OAAO,CAAC,OAAO,EAAE,CAAC;IACpB,CAAC;IACD,IAAI,aAAa,KAAK,SAAS;QAAE,OAAO,CAAC,aAAa,GAAG,aAAa,CAAC;IACvE,4EAA4E;IAC5E,6EAA6E;IAC7E,+EAA+E;IAC/E,0EAA0E;IAC1E,mEAAmE;SAC9D,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO;QAAE,OAAO,CAAC,aAAa,GAAG,SAAS,CAAC;IAE/D,GAAG,CAAC,UAAU,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;IAEpD,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;QAC7C,GAAG,CAAC,GAAG,CACL,MAAM,EACN,GAAG,OAAO,CAAC,YAAY,qBAAqB,OAAO,CAAC,YAAY,YAAY,EAC5E,cAAc,CACf,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,qCAAqC,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAExE,IAAI,eAAmC,CAAC;IACxC,IAAI,OAAO,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,CAAC;YACH,eAAe,GAAG,CAChB,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAChE,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAC9B,CAAC;QAAC,MAAM,CAAC;YACP,uDAAuD;QACzD,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO;QAC1B,CAAC,CAAC,oBAAoB,CAAC;YACnB,SAAS,EAAE,OAAO,CAAC,OAAO,CAAC,IAAI;YAC/B,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,OAAO;YAChC,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,YAAY,EAAE,eAAe;SAC9B,CAAC,CAAC,YAAY;QACjB,CAAC,CAAC,SAAS,CAAC;IACd,OAAO,IAAI,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC;AACtD,CAAC;AAED,MAAM,CAAC,MAAM,YAAY,GAAG,UAAU,CAA6D;IACjG,IAAI,EAAE,cAAc;IACpB,KAAK,EAAE,oBAAoB;IAC3B,WAAW,EACT,2GAA2G;QAC3G,2GAA2G;QAC3G,iFAAiF;IACnF,KAAK,EAAE,2BAA2B;IAClC,YAAY,EAAE,KAAK;IACnB,SAAS,EAAE,yBAAyB;IACpC,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;QACjB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,OAAO;YACL,KAAK,EAAE,UAAU,QAAQ,EAAE;YAC3B,OAAO,EAAE,GAAG,uBAAuB,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,uBAAuB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE;SACzG,CAAC;IACJ,CAAC;IACD,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACrD,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,gBAAgB,GAAG,uBAAuB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACrE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,MAAM,sBAAsB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACrE,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,MAAM,WAAW,GACf,kBAAkB,gBAAgB,IAAI,QAAQ,EAAE;YAChD,WAAW,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,YAAY;YACtD,OAAO,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,UAAU;YACrD,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5F,CAAC,UAAU,CAAC,aAAa;gBACvB,CAAC,CAAC,WAAW,MAAM,CAAC,UAAU,CAAC,aAAa,CAAC,iBAAiB;gBAC9D,CAAC,CAAC,EAAE,CAAC,CAAC;QACV,yEAAyE;QACzE,oEAAoE;QACpE,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,UAAU,CAAC,aAAa,CAAC;QACtC,IAAI,IAAI,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;aACtD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5B,wEAAwE;YACxE,sEAAsE;YACtE,KAAK,CAAC,IAAI,CACR,kCAAkC,IAAI,kDAAkD,IAAI,gBAAgB,CAC7G,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GACR,UAAU,CAAC,YAAY,KAAK,CAAC;YAC3B,CAAC,CAAC,aAAa,CAAC;gBACZ,GAAG,IAAI;gBACP,YAAY,EAAE,UAAU,CAAC,YAAY;gBACrC,kEAAkE;gBAClE,8CAA8C;gBAC9C,UAAU,EACR,IAAI,KAAK,SAAS;oBAClB,UAAU,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;oBAC7B,OAAO,CAAC,UAAU,CAAC,aAAa,CAAC;aACpC,CAAC;YACJ,CAAC,CAAC,SAAS,CAAC;QAChB,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,wEAAwE;QACxE,wEAAwE;QACxE,uEAAuE;QACvE,0BAA0B;QAC1B,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC3E,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,UAAU,CAAC,aAAa,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CACR,kBAAkB,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC,yCAAyC,CACxF,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAClF,OAAO;YACL,UAAU;YACV,IAAI;YACJ,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;YAC7B,OAAO,EAAE,cAAc,CAAC,UAAU,CAAC,OAAO,CAAC;SAC5C,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { ContentBlock } from '@modelcontextprotocol/server';\n\nimport { Buffer, isUtf8 } from 'node:buffer';\nimport { dirname } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport type { StoppedReason } from '../core/concurrency.ts';\nimport { processEntriesConcurrently } from '../core/concurrency.ts';\nimport { unifiedPatch } from '../core/diff.ts';\nimport { ErrorCode, FsError, Problem } from '../core/errors.ts';\nimport { buildWrittenFileMeta } from '../core/file-uri.ts';\nimport { stoppedEarlyLine, truncateProgressPattern, zeroMatchHint } from '../core/fmt.ts';\nimport type { GuardedFileSystem } from '../core/fs.ts';\nimport { globEntries } from '../core/glob.ts';\nimport { toPosixRelative } from '../core/path-utils.ts';\nimport { createTooLargeError, readFileBufferWithLimit } from '../core/read.ts';\nimport {\n  defaultFalseBoolean,\n  IncludeHidden,\n  IncludeIgnored,\n  MaxDepth,\n  nonBlankString,\n  OptionalPath,\n  SafeGlobPattern,\n} from '../core/schema.ts';\nimport type { Regex } from '../core/search.ts';\nimport {\n  compileRegex,\n  createYielder,\n  execMatches,\n  freeRegex,\n  RE2_MAX_INPUT_BYTES,\n} from '../core/search.ts';\nimport {\n  DEFAULT_SEARCH_RESULTS,\n  DEFAULT_SEARCH_TIMEOUT_MS,\n  escapeRegExp,\n  getMaxTextFileSize,\n  MAX_SEARCH_RESULTS,\n  PARALLEL_CONCURRENCY,\n} from '../core/util.ts';\nimport { type BatchResult, isTotalFailure } from './batch.ts';\nimport { defineTool, type ToolCtx } from './define.ts';\n\nconst SearchAndReplaceInputSchema = z.strictObject({\n  path: OptionalPath.describe(\n    'File to rewrite, or directory to rewrite under. Omitting it targets the ENTIRE first allowed root — ' +\n      'scope it deliberately, and pair a wide scope with dryRun=true first',\n  ),\n  pattern: SafeGlobPattern.optional().describe(\n    'Glob to restrict replacements to specific file types (e.g. **/*.ts); default: all text files',\n  ),\n  searchPattern: nonBlankString('searchPattern')\n    .max(10000)\n    .describe(\n      'Exact literal text or RE2 regex pattern to search for. When isRegex=true, uses RE2 syntax (no lookahead, lookbehind, or backreferences are supported). Cannot be empty or whitespace-only.',\n    ),\n  replacement: z\n    .string()\n    .max(10000)\n    .describe(\n      'Replacement text. Use capture group references ($1, $2, etc.) when isRegex=true. Use an empty string to delete all matches.',\n    )\n    .meta({ examples: ['$1_renamed', '', 'TODO: fix'] }),\n  isRegex: defaultFalseBoolean('Treat searchPattern as a RE2 regex (default: literal text match)'),\n  includeHidden: IncludeHidden,\n  includeIgnored: IncludeIgnored,\n  caseSensitive: defaultFalseBoolean('Enable case-sensitive matching (default: case-insensitive)'),\n  wholeWord: defaultFalseBoolean('Match whole words only (word boundary anchoring)'),\n  dryRun: defaultFalseBoolean(\n    'Preview replacements without writing to disk (default: false = apply changes)',\n  ),\n  returnDiff: defaultFalseBoolean('Include a unified diff of all changes in the response'),\n  maxResults: z\n    .uint32()\n    .min(1)\n    .max(MAX_SEARCH_RESULTS)\n    .optional()\n    .default(DEFAULT_SEARCH_RESULTS)\n    .describe('Maximum total match count across all files before stopping'),\n  maxFiles: z\n    .uint32()\n    .min(1)\n    .max(MAX_SEARCH_RESULTS)\n    .optional()\n    .describe('Maximum number of files to process'),\n  maxDepth: MaxDepth,\n});\n\ntype SearchAndReplaceOutput = BatchResult<{ matches: number }> & {\n  totalMatches: number;\n  filesScanned: number;\n  skippedBinary?: number;\n  resultsTruncated?: boolean;\n  diff?: string;\n  diffTruncated?: boolean;\n  stoppedReason?: StoppedReason;\n};\n\nconst MAX_FAILURES = 20;\nconst REPLACE_CONCURRENCY = Math.min(PARALLEL_CONCURRENCY, 8);\nconst MAX_CHANGED_FILES = 100;\nconst MAX_DIFF_SIZE = 20 * 1024; // 20KB limit for diff output\nconst DIFF_APPEND_BUFFER = 1024;\n\ninterface Failure {\n  path: string;\n  error: Problem;\n}\n\n/** Counts every failure; keeps the first MAX_FAILURES of them for the result. */\nfunction recordFailure(summary: ReplaceSummary, entryPath: string, error: unknown): void {\n  summary.failedFiles++;\n  if (summary.failures.length >= MAX_FAILURES) return;\n  summary.failures.push({\n    path: toPosixRelative(summary.root, entryPath),\n    error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, entryPath),\n  });\n}\n\nfunction recordChangedFile(summary: ReplaceSummary, plan: ReplacementPlan, filePath: string): void {\n  const relativePath = toPosixRelative(summary.root, filePath);\n  // The first changed file is the one the resource_link points at; keep what\n  // was written so the link needs no read-back.\n  summary.primary ??= { path: filePath, content: plan.updatedContent };\n  if (summary.changedFiles.length < MAX_CHANGED_FILES) {\n    summary.changedFiles.push({ path: relativePath, matches: plan.matchCount });\n    return;\n  }\n  summary.changedFilesTruncated = true;\n}\n\ninterface ReplacementMatcher {\n  /** Yields periodically and throws on abort: a partial splice must never be written. */\n  replace(\n    content: string,\n    replacement: string,\n    signal: AbortSignal | undefined,\n  ): Promise<{ content: string; matchCount: number }>;\n  testBuffer(buffer: Buffer): boolean;\n  /** Releases any compiled pattern this matcher owns. Idempotent. */\n  dispose(): void;\n}\n\nconst DOLLAR_TOKEN = /\\$(\\$|&|`|'|<([^>]*)>|\\d{1,2})/g;\n\n/**\n * Expand `$`-substitutions in a replacement template the way `RegExp` does.\n *\n * We cannot hand the template to RE2's own string replacer: it throws\n * `Invalid replacement string` on any `$` not followed by a substitution it\n * recognises (so a replacement of `$100` or a trailing `$` fails outright,\n * where `RegExp` inserts the `$` literally), and it renders an out-of-range\n * `$5` as `$4`. The matcher splices matches itself, so this is the single owner\n * of the syntax.\n */\nfunction expandDollarTokens(\n  template: string,\n  match: string,\n  groups: (string | undefined)[],\n  offset: number,\n  input: string,\n  named: Record<string, string> | undefined,\n): string {\n  return template.replace(DOLLAR_TOKEN, (token: string, kind: string, name?: string) => {\n    if (kind === '$') return '$';\n    if (kind === '&') return match;\n    if (kind === '`') return input.slice(0, offset);\n    if (kind === \"'\") return input.slice(offset + match.length);\n    if (name !== undefined) {\n      if (named && Object.hasOwn(named, name)) return named[name] ?? '';\n      return token;\n    }\n    // `$12` prefers group 12, then falls back to group 1 followed by a literal\n    // `2`, and stays literal when neither exists — RegExp's own precedence.\n    const two = Number.parseInt(kind, 10);\n    if (kind.length === 2 && two >= 1 && two <= groups.length) return groups[two - 1] ?? '';\n    const one = Number.parseInt(kind.slice(0, 1), 10);\n    if (one >= 1 && one <= groups.length) {\n      return (groups[one - 1] ?? '') + (kind.length === 2 ? kind.slice(1) : '');\n    }\n    return token;\n  });\n}\n\nfunction createRegexReplacementMatcher(\n  regex: Regex,\n  expandReplacement: boolean,\n): ReplacementMatcher {\n  return {\n    testBuffer(buffer: Buffer): boolean {\n      if (buffer.length > RE2_MAX_INPUT_BYTES) {\n        throw new FsError(\n          ErrorCode.TOO_LARGE,\n          `File too large for a regex replace (${String(buffer.length)} > ${String(RE2_MAX_INPUT_BYTES)} bytes). Regex mode is used for isRegex, wholeWord, or the default caseSensitive: false; pass caseSensitive: true with a literal searchPattern, or split the file.`,\n        );\n      }\n      // The regex is global and shared across every file in the batch, so a\n      // previous file's match would otherwise start this scan mid-string.\n      regex.lastIndex = 0;\n      return regex.test(buffer.toString('utf-8'));\n    },\n    async replace(content, replacement, signal) {\n      // Splicing by hand rather than through `String.replace(regex, …)`: RE2's\n      // own replacer indexes the JS string with the code-point offsets it\n      // reports, which lands the replacement short by one per astral character\n      // (most emoji) earlier in the file. execMatches reports UTF-16 offsets.\n      let matchCount = 0;\n      let updated = '';\n      let cursor = 0;\n      const tick = createYielder(signal);\n      for (const match of execMatches(regex, content)) {\n        matchCount++;\n        // Only isRegex=true opts into $1/$& substitution. A literal search\n        // reaches this matcher too (case-insensitive and wholeWord both need a\n        // regex), and there the replacement must be inserted verbatim.\n        updated +=\n          content.slice(cursor, match.start) +\n          (expandReplacement\n            ? expandDollarTokens(\n                replacement,\n                match.text,\n                match.groups,\n                match.start,\n                content,\n                match.named,\n              )\n            : replacement);\n        cursor = match.end;\n        if (await tick()) signal?.throwIfAborted();\n      }\n      return { content: updated + content.slice(cursor), matchCount };\n    },\n    dispose(): void {\n      freeRegex(regex);\n    },\n  };\n}\n\nfunction createCaseSensitiveLiteralMatcher(searchPattern: string): ReplacementMatcher {\n  const searchBuffer = Buffer.from(searchPattern, 'utf8');\n\n  return {\n    testBuffer(buffer: Buffer): boolean {\n      return buffer.indexOf(searchBuffer) !== -1;\n    },\n    // One native O(n) pass; nothing to yield for.\n    replace(content, replacement) {\n      let matchCount = 0;\n      const updated = content.replaceAll(searchPattern, () => {\n        matchCount++;\n        return replacement;\n      });\n      return Promise.resolve({ content: updated, matchCount });\n    },\n    dispose(): void {\n      // no compiled pattern to release\n    },\n  };\n}\n\ntype SearchAndReplaceArgs = z.infer<typeof SearchAndReplaceInputSchema>;\n\ninterface ReplaceContext {\n  dryRun: boolean;\n  returnDiff: boolean;\n  replacement: string;\n  matcher: ReplacementMatcher;\n  maxFileSize: number;\n  signal: AbortSignal | undefined;\n  summary: ReplaceSummary;\n  fs: GuardedFileSystem;\n  singleFile: boolean;\n}\n\ninterface ReplacementPlan {\n  matchCount: number;\n  originalContent: string;\n  updatedContent: string;\n}\n\nasync function processEntry(entryPath: string, ctx: ReplaceContext): Promise<void> {\n  const { dryRun, returnDiff, signal, summary } = ctx;\n\n  try {\n    // Lock the read→write per file so a concurrent writer is not lost; a dry\n    // run never writes and skips the lock.\n    const plan = dryRun\n      ? await readReplacementPlan(entryPath, ctx)\n      : await ctx.fs.lockForWrite(entryPath, async () => {\n          const planned = await readReplacementPlan(entryPath, ctx);\n          if (planned) await ctx.fs.writeFile(entryPath, planned.updatedContent, { signal });\n          return planned;\n        });\n    if (!plan) {\n      return;\n    }\n\n    // Bookkeep only after the write succeeds (or in dryRun, where there is no\n    // write): a failed write must not count the file as changed.\n    summary.totalMatches += plan.matchCount;\n    summary.filesChanged++;\n\n    recordChangedFile(summary, plan, entryPath);\n\n    maybeAppendPatchDiff(summary, {\n      filePath: entryPath,\n      originalContent: plan.originalContent,\n      updatedContent: plan.updatedContent,\n      includeDiff: dryRun || returnDiff,\n    });\n  } catch (error) {\n    // A timeout/cancel aborts the whole scan, not just this file: don't record\n    // it as a per-file failure. processEntriesConcurrently reports the run as\n    // stoppedReason 'timeout' instead.\n    if (signal?.aborted) return;\n    recordFailure(summary, entryPath, error);\n  }\n}\n\nasync function readReplacementPlan(\n  validPath: string,\n  ctx: ReplaceContext,\n): Promise<ReplacementPlan | undefined> {\n  const { matcher, replacement, maxFileSize, signal } = ctx;\n  await using fileHandle = await ctx.fs.open(validPath);\n  const stats = await fileHandle.stat();\n  if (stats.size > maxFileSize) {\n    throw createTooLargeError(stats.size, maxFileSize, validPath);\n  }\n\n  const buffer = await readFileBufferWithLimit(fileHandle, maxFileSize, validPath, signal);\n  if (!matcher.testBuffer(buffer)) return undefined;\n  // Only bytes that decode to UTF-8 losslessly survive the string round trip;\n  // anything else would be written back with U+FFFD in place of every bad byte.\n  // NUL is valid UTF-8 but marks a binary file, as it does for `read`.\n  if (!isUtf8(buffer) || buffer.includes(0)) {\n    if (ctx.singleFile) {\n      throw new FsError(ErrorCode.INVALID_INPUT, 'Binary or non-UTF-8 file detected.', validPath);\n    }\n    ctx.summary.skippedBinary++;\n    return undefined;\n  }\n\n  const originalContent = buffer.toString('utf-8');\n  const { content: updatedContent, matchCount } = await matcher.replace(\n    originalContent,\n    replacement,\n    signal,\n  );\n  return matchCount === 0 ? undefined : { matchCount, originalContent, updatedContent };\n}\n\nfunction maybeAppendPatchDiff(\n  summary: ReplaceSummary,\n  params: {\n    filePath: string;\n    originalContent: string;\n    updatedContent: string;\n    includeDiff: boolean;\n  },\n): void {\n  if (!params.includeDiff) return;\n\n  // Budget first: a full budget must not pay for a diff it will discard, and a\n  // diff past its deadline counts as truncated output, not a failed file.\n  if (summary.diff.length >= MAX_DIFF_SIZE) {\n    summary.diffTruncated = true;\n    return;\n  }\n  const header = toPosixRelative(summary.root, params.filePath);\n  const patch = unifiedPatch(header, params.originalContent, params.updatedContent);\n  if (patch === undefined) {\n    summary.diffTruncated = true;\n    return;\n  }\n  if (summary.diff.length + patch.length <= MAX_DIFF_SIZE + DIFF_APPEND_BUFFER) {\n    summary.diff += patch;\n    return;\n  }\n  summary.diffTruncated = true;\n}\n\ninterface ReplaceSummary {\n  root: string;\n  totalMatches: number;\n  filesChanged: number;\n  failedFiles: number;\n  processedFiles: number;\n  skippedBinary: number;\n  failures: Failure[];\n  changedFiles: { path: string; matches: number }[];\n  changedFilesTruncated: boolean;\n  /** First file changed, as written. */\n  primary?: { path: string; content: string };\n  diff: string;\n  diffTruncated: boolean;\n  stoppedReason?: StoppedReason;\n}\n\nfunction createReplaceSummary(root: string): ReplaceSummary {\n  return {\n    root,\n    totalMatches: 0,\n    filesChanged: 0,\n    failedFiles: 0,\n    processedFiles: 0,\n    skippedBinary: 0,\n    failures: [],\n    changedFiles: [],\n    changedFilesTruncated: false,\n    diff: '',\n    diffTruncated: false,\n  };\n}\n\nasync function resolveSearchRoot(\n  pathValue: string | undefined,\n  fs: GuardedFileSystem,\n): Promise<{ root: string; singleFile?: string }> {\n  if (!pathValue) {\n    return { root: fs.pathGuard.resolvePathOrRoot(undefined) };\n  }\n  const resolvedPath = await fs.pathGuard.validateExistingPath(pathValue);\n  const { stats: fileStats } = await fs.stat(resolvedPath);\n  if (fileStats.isFile()) {\n    // A single explicit file target bypasses the glob machinery entirely:\n    // routing it through globEntries with baseNameMatch would rewrite the\n    // escaped basename to `**/${basename}` and match every same-named file\n    // under the parent tree, not just this one.\n    return {\n      root: dirname(resolvedPath),\n      singleFile: resolvedPath,\n    };\n  }\n  return { root: resolvedPath };\n}\n\nfunction buildSearchPattern(args: SearchAndReplaceArgs): string {\n  if (args.isRegex) {\n    return args.wholeWord ? `\\\\b(?:${args.searchPattern})\\\\b` : args.searchPattern;\n  }\n  const escaped = escapeRegExp(args.searchPattern);\n  return args.wholeWord ? `\\\\b(?:${escaped})\\\\b` : escaped;\n}\n\nfunction createReplacementMatcher(args: SearchAndReplaceArgs): ReplacementMatcher {\n  // Use regex when isRegex, wholeWord, or case-insensitive (all require RE2)\n  if (args.isRegex || args.wholeWord || !args.caseSensitive) {\n    const regex = compileRegex(buildSearchPattern(args), { caseSensitive: args.caseSensitive });\n    return createRegexReplacementMatcher(regex, args.isRegex);\n  }\n  return createCaseSensitiveLiteralMatcher(args.searchPattern);\n}\n\nfunction buildSearchAndReplaceStructuredResult(\n  summary: ReplaceSummary,\n  args: SearchAndReplaceArgs,\n): SearchAndReplaceOutput {\n  const results = [\n    ...summary.changedFiles.map((f) => ({ path: f.path, value: { matches: f.matches } })),\n    ...summary.failures.map((f) => ({ path: f.path, error: f.error })),\n  ];\n  return {\n    results,\n    // `failedFiles` counts every failure; `failures` itself is capped at\n    // MAX_FAILURES, so the summary must not be derived from the array length.\n    summary: {\n      total: summary.filesChanged + summary.failedFiles,\n      succeeded: summary.filesChanged,\n      failed: summary.failedFiles,\n    },\n    totalMatches: summary.totalMatches,\n    filesScanned: summary.processedFiles,\n    ...(summary.skippedBinary ? { skippedBinary: summary.skippedBinary } : {}),\n    // Failures are capped at MAX_FAILURES independently of the changed-file\n    // cap, so either cap can leave `results` shorter than `summary.total`.\n    ...(summary.changedFilesTruncated || summary.failures.length < summary.failedFiles\n      ? { resultsTruncated: true }\n      : {}),\n    ...((args.dryRun || args.returnDiff) && summary.diff ? { diff: summary.diff } : {}),\n    ...(summary.diffTruncated ? { diffTruncated: true } : {}),\n    ...(summary.stoppedReason ? { stoppedReason: summary.stoppedReason } : {}),\n  };\n}\n\nasync function handleSearchAndReplace(\n  args: SearchAndReplaceArgs,\n  ctx: ToolCtx,\n): Promise<{\n  structured: SearchAndReplaceOutput;\n  link?: ContentBlock;\n}> {\n  const maxFileSize = getMaxTextFileSize();\n  const { root, singleFile } = await resolveSearchRoot(args.path, ctx.fs);\n  const effectivePattern = args.pattern ?? '**/*';\n  const ceiling = ctx.fs.pathGuard.allowedRootContaining(root);\n\n  // An explicit single-file target bypasses baseNameMatch/exclude/hidden/\n  // gitignore filtering — it should always be processed as the one file named.\n  const entries: AsyncIterable<{ path: string }> | Iterable<{ path: string }> = singleFile\n    ? [{ path: singleFile }]\n    : globEntries({\n        cwd: root,\n        pattern: effectivePattern,\n        includeHidden: args.includeHidden,\n        skipIgnored: !args.includeIgnored,\n        ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),\n        signal: ctx.signal,\n        baseNameMatch: true,\n        onlyFiles: true,\n        suppressErrors: true,\n        ...(args.maxDepth !== undefined ? { maxDepth: args.maxDepth } : {}),\n      });\n\n  const summary = createReplaceSummary(root);\n\n  // The matcher may own a compiled RE2 pattern, whose wasm memory re2-wasm\n  // never reclaims on its own. Nothing past the scan touches it, so free it the\n  // moment the scan is done — success, failure, or abort alike.\n  const matcher = createReplacementMatcher(args);\n  let stoppedReason: StoppedReason | undefined;\n  try {\n    const context: ReplaceContext = {\n      dryRun: args.dryRun,\n      returnDiff: args.returnDiff,\n      replacement: args.replacement,\n      matcher,\n      maxFileSize,\n      signal: ctx.signal,\n      summary,\n      fs: ctx.fs,\n      singleFile: singleFile !== undefined,\n    };\n\n    stoppedReason = await processEntriesConcurrently(entries, {\n      signal: ctx.signal,\n      concurrency: REPLACE_CONCURRENCY,\n      ...(args.maxFiles !== undefined ? { maxEntries: args.maxFiles } : {}),\n      shouldStop: () => summary.totalMatches >= args.maxResults,\n      onEntry: () => {\n        summary.processedFiles++;\n        ctx.onProgress({ current: summary.processedFiles });\n      },\n      onError: (entryPath, err) => {\n        recordFailure(summary, entryPath, err);\n      },\n      runEntry: (entryPath) => processEntry(entryPath, context),\n    });\n  } finally {\n    matcher.dispose();\n  }\n  if (stoppedReason !== undefined) summary.stoppedReason = stoppedReason;\n  // A single file that aborts mid-scan throws inside processEntry (caught and\n  // swallowed as a timeout) and leaves the dispatch loop with no more entries,\n  // so processEntriesConcurrently returns undefined; surface the timeout here so\n  // the result is not reported as a clean \"0 matches\". search_text's engine\n  // checks the signal directly, so only replace needs this fallback.\n  else if (ctx.signal.aborted) summary.stoppedReason = 'timeout';\n\n  ctx.onProgress({ current: summary.processedFiles });\n\n  if (!args.dryRun && summary.totalMatches > 0) {\n    ctx.log(\n      'info',\n      `${summary.filesChanged} file(s) changed, ${summary.totalMatches} match(es)`,\n      'replace_text',\n    );\n  }\n\n  const structured = buildSearchAndReplaceStructuredResult(summary, args);\n\n  let primaryModified: string | undefined;\n  if (summary.primary && !args.dryRun) {\n    try {\n      primaryModified = (\n        await ctx.fs.stat(summary.primary.path, { signal: ctx.signal })\n      ).stats.mtime.toISOString();\n    } catch {\n      /* result metadata only; the write already succeeded */\n    }\n  }\n  const link = summary.primary\n    ? buildWrittenFileMeta({\n        validPath: summary.primary.path,\n        content: summary.primary.content,\n        dryRun: args.dryRun,\n        lastModified: primaryModified,\n      }).resourceLink\n    : undefined;\n  return link ? { structured, link } : { structured };\n}\n\nexport const REPLACE_TEXT = defineTool<typeof SearchAndReplaceInputSchema, SearchAndReplaceOutput>({\n  name: 'replace_text',\n  title: 'Search and Replace',\n  description:\n    'Find and replace every occurrence of literal text or an RE2 regex, like sed -i, in one file or all files ' +\n    'under a directory, optionally filtered by glob. The pattern runs over the whole file: it can span lines, ' +\n    'and ^ and $ anchor to file start and end. edit replaces one unique exact match.',\n  input: SearchAndReplaceInputSchema,\n  readOnlyHint: false,\n  timeoutMs: DEFAULT_SEARCH_TIMEOUT_MS,\n  progress: (args) => {\n    const dryLabel = args.dryRun ? ' [dry run]' : '';\n    return {\n      label: `Replace${dryLabel}`,\n      subject: `${truncateProgressPattern(args.searchPattern)} → ${truncateProgressPattern(args.replacement)}`,\n    };\n  },\n  accessPaths: (args) => (args.path ? [args.path] : []),\n  run: async (args, ctx) => {\n    const truncatedPattern = truncateProgressPattern(args.searchPattern);\n    const { structured, link } = await handleSearchAndReplace(args, ctx);\n    const dryLabel = args.dryRun ? ' [dry run]' : '';\n    const summaryText =\n      `replace_text: '${truncatedPattern}'${dryLabel}` +\n      ` \\u00b7 ${String(structured.totalMatches)} match(es)` +\n      ` in ${String(structured.summary.succeeded)} file(s)` +\n      (structured.summary.failed > 0 ? ` \\u00b7 ${String(structured.summary.failed)} failed` : '') +\n      (structured.skippedBinary\n        ? ` \\u00b7 ${String(structured.skippedBinary)} binary skipped`\n        : '');\n    // The structured half ships under `_meta`, which clients do not show the\n    // model, so the stop state and the diff preview must ride the text.\n    const lines = [summaryText];\n    const stop = structured.stoppedReason;\n    if (stop === 'timeout') lines.push(stoppedEarlyLine(stop));\n    else if (stop !== undefined) {\n      // maxResults/maxFiles here are the caller's own caps, so raising one is\n      // what reaches the rest; the search engine's advice to narrow is not.\n      lines.push(\n        `// scan stopped early: hit the ${stop} limit; later files were not scanned. A higher ${stop} reaches them.`,\n      );\n    }\n    const hint =\n      structured.totalMatches === 0\n        ? zeroMatchHint({\n            ...args,\n            filesScanned: structured.filesScanned,\n            // A failed file, or a binary one the needle did hit, explains the\n            // zero better than a guess about the pattern.\n            incomplete:\n              stop !== undefined ||\n              structured.summary.failed > 0 ||\n              Boolean(structured.skippedBinary),\n          })\n        : undefined;\n    if (hint) lines.push(hint);\n    // A failure's reason lives in `results`, which ships under `_meta`. The\n    // full relative path, not the basename: the error message may not carry\n    // the path, and two same-named files in different directories must not\n    // render as the same row.\n    for (const r of structured.results.filter((x) => 'error' in x).slice(0, 3)) {\n      lines.push(`// ${r.path}: ${r.error.code} ${r.error.message}`);\n    }\n    if (structured.diffTruncated) {\n      lines.push(\n        `// diff cut at ${String(MAX_DIFF_SIZE / 1024)} KB: some files' changes are not shown.`,\n      );\n    }\n    const text = lines.join('\\n') + (structured.diff ? `\\n\\n${structured.diff}` : '');\n    return {\n      structured,\n      text,\n      resources: link ? [link] : [],\n      isError: isTotalFailure(structured.summary),\n    };\n  },\n});\n"]}
+{"version":3,"file":"replace-text.js","sourceRoot":"","sources":["../../src/tools/replace-text.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAE7C,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAG5B,OAAO,EAAE,0BAA0B,EAAE,MAAM,wBAAwB,CAAC;AACpE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAC7F,OAAO,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAC3D,OAAO,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAE1F,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAE9C,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iBAAiB,CAAC;AAC/E,OAAO,EACL,mBAAmB,EACnB,aAAa,EACb,cAAc,EACd,eAAe,EACf,QAAQ,EACR,cAAc,EACd,YAAY,EACZ,eAAe,GAChB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,YAAY,EACZ,aAAa,EACb,WAAW,EACX,SAAS,EACT,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,sBAAsB,EACtB,YAAY,EACZ,kBAAkB,EAClB,kBAAkB,EAClB,oBAAoB,GACrB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAoB,cAAc,EAAE,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,UAAU,EAAgB,MAAM,aAAa,CAAC;AAEvD,MAAM,2BAA2B,GAAG,CAAC,CAAC,YAAY,CAAC;IACjD,IAAI,EAAE,YAAY,CAAC,QAAQ,CACzB,sGAAsG;QACpG,qEAAqE,CACxE;IACD,OAAO,EAAE,eAAe,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAC1C,8FAA8F,CAC/F;IACD,aAAa,EAAE,cAAc,CAAC,eAAe,CAAC;SAC3C,GAAG,CAAC,KAAK,CAAC;SACV,QAAQ,CACP,4LAA4L,CAC7L;IACH,WAAW,EAAE,CAAC;SACX,MAAM,EAAE;SACR,GAAG,CAAC,KAAK,CAAC;SACV,QAAQ,CACP,6HAA6H,CAC9H;SACA,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC;IACtD,OAAO,EAAE,mBAAmB,CAAC,kEAAkE,CAAC;IAChG,aAAa,EAAE,aAAa;IAC5B,cAAc,EAAE,cAAc;IAC9B,aAAa,EAAE,mBAAmB,CAAC,4DAA4D,CAAC;IAChG,SAAS,EAAE,mBAAmB,CAAC,kDAAkD,CAAC;IAClF,MAAM,EAAE,mBAAmB,CACzB,+EAA+E,CAChF;IACD,UAAU,EAAE,mBAAmB,CAAC,uDAAuD,CAAC;IACxF,UAAU,EAAE,CAAC;SACV,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,kBAAkB,CAAC;SACvB,QAAQ,EAAE;SACV,OAAO,CAAC,sBAAsB,CAAC;SAC/B,QAAQ,CAAC,4DAA4D,CAAC;IACzE,QAAQ,EAAE,CAAC;SACR,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,kBAAkB,CAAC;SACvB,QAAQ,EAAE;SACV,QAAQ,CAAC,oCAAoC,CAAC;IACjD,QAAQ,EAAE,QAAQ;CACnB,CAAC,CAAC;AAcH,MAAM,YAAY,GAAG,EAAE,CAAC;AACxB,MAAM,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;AAC9D,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAC9B,MAAM,aAAa,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,6BAA6B;AAC9D,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAOhC,iFAAiF;AACjF,SAAS,aAAa,CAAC,OAAuB,EAAE,SAAiB,EAAE,KAAc;IAC/E,OAAO,CAAC,WAAW,EAAE,CAAC;IACtB,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,IAAI,YAAY;QAAE,OAAO;IACpD,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;QACpB,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;QACnC,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC;KAChE,CAAC,CAAC;AACL,CAAC;AAED,SAAS,iBAAiB,CAAC,OAAuB,EAAE,IAAqB,EAAE,QAAgB;IACzF,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClD,2EAA2E;IAC3E,8CAA8C;IAC9C,OAAO,CAAC,OAAO,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC;IACrE,IAAI,OAAO,CAAC,YAAY,CAAC,MAAM,GAAG,iBAAiB,EAAE,CAAC;QACpD,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QAC5E,OAAO;IACT,CAAC;IACD,OAAO,CAAC,qBAAqB,GAAG,IAAI,CAAC;AACvC,CAAC;AAcD,MAAM,YAAY,GAAG,iCAAiC,CAAC;AAEvD;;;;;;;;;GASG;AACH,SAAS,kBAAkB,CACzB,QAAgB,EAChB,KAAa,EACb,MAA8B,EAC9B,MAAc,EACd,KAAa,EACb,KAAyC;IAEzC,OAAO,QAAQ,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC,KAAa,EAAE,IAAY,EAAE,IAAa,EAAE,EAAE;QACnF,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,GAAG,CAAC;QAC7B,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC;QAC/B,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAChD,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QAC5D,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAClE,OAAO,KAAK,CAAC;QACf,CAAC;QACD,2EAA2E;QAC3E,wEAAwE;QACxE,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC,MAAM;YAAE,OAAO,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QACxF,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClD,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YACrC,OAAO,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,6BAA6B,CACpC,KAAY,EACZ,iBAA0B;IAE1B,OAAO;QACL,UAAU,CAAC,MAAc;YACvB,IAAI,MAAM,CAAC,MAAM,GAAG,mBAAmB,EAAE,CAAC;gBACxC,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,SAAS,EACnB,uCAAuC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,MAAM,CAAC,mBAAmB,CAAC,oKAAoK,CAClQ,CAAC;YACJ,CAAC;YACD,sEAAsE;YACtE,oEAAoE;YACpE,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YACpB,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM;YACxC,yEAAyE;YACzE,oEAAoE;YACpE,yEAAyE;YACzE,wEAAwE;YACxE,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,OAAO,GAAG,EAAE,CAAC;YACjB,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;YACnC,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;gBAChD,UAAU,EAAE,CAAC;gBACb,mEAAmE;gBACnE,uEAAuE;gBACvE,+DAA+D;gBAC/D,OAAO;oBACL,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC;wBAClC,CAAC,iBAAiB;4BAChB,CAAC,CAAC,kBAAkB,CAChB,WAAW,EACX,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,MAAM,EACZ,KAAK,CAAC,KAAK,EACX,OAAO,EACP,KAAK,CAAC,KAAK,CACZ;4BACH,CAAC,CAAC,WAAW,CAAC,CAAC;gBACnB,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC;gBACnB,IAAI,MAAM,IAAI,EAAE;oBAAE,MAAM,EAAE,cAAc,EAAE,CAAC;YAC7C,CAAC;YACD,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC;QAClE,CAAC;QACD,OAAO;YACL,SAAS,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,iCAAiC,CAAC,aAAqB;IAC9D,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;IAExD,OAAO;QACL,UAAU,CAAC,MAAc;YACvB,OAAO,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,8CAA8C;QAC9C,OAAO,CAAC,OAAO,EAAE,WAAW;YAC1B,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,MAAM,OAAO,GAAG,OAAO,CAAC,UAAU,CAAC,aAAa,EAAE,GAAG,EAAE;gBACrD,UAAU,EAAE,CAAC;gBACb,OAAO,WAAW,CAAC;YACrB,CAAC,CAAC,CAAC;YACH,OAAO,OAAO,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO;YACL,iCAAiC;QACnC,CAAC;KACF,CAAC;AACJ,CAAC;AAsBD,KAAK,UAAU,YAAY,CAAC,SAAiB,EAAE,GAAmB;IAChE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,GAAG,CAAC;IACpD,0EAA0E;IAC1E,oEAAoE;IACpE,MAAM,KAAK,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAEjC,IAAI,CAAC;QACH,yEAAyE;QACzE,uCAAuC;QACvC,MAAM,IAAI,GAAG,MAAM;YACjB,CAAC,CAAC,MAAM,mBAAmB,CAAC,SAAS,EAAE,GAAG,CAAC;YAC3C,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE;gBAC9C,MAAM,OAAO,GAAG,MAAM,mBAAmB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;gBAC1D,IAAI,OAAO,EAAE,CAAC;oBACZ,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC;oBACrB,MAAM,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,EAAE,OAAO,CAAC,cAAc,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;gBACxE,CAAC;gBACD,OAAO,OAAO,CAAC;YACjB,CAAC,CAAC,CAAC;QACP,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO;QACT,CAAC;QAED,0EAA0E;QAC1E,6DAA6D;QAC7D,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,UAAU,CAAC;QACxC,OAAO,CAAC,YAAY,EAAE,CAAC;QAEvB,iBAAiB,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QAE5C,oBAAoB,CAAC,OAAO,EAAE;YAC5B,QAAQ,EAAE,SAAS;YACnB,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,WAAW,EAAE,MAAM,IAAI,UAAU;SAClC,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,2EAA2E;QAC3E,0EAA0E;QAC1E,mCAAmC;QACnC,IAAI,MAAM,EAAE,OAAO;YAAE,OAAO;QAC5B,IACE,CAAC,GAAG,CAAC,UAAU;YACf,CAAC,KAAK,CAAC,OAAO;YACd,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;gBAChB,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,aAAa;oBACrC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,SAAS;oBAClC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,mBAAmB,CAAC,CAAC;gBAChD,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAC1B,CAAC;YACD,OAAO,CAAC,cAAc,EAAE,CAAC;YACzB,OAAO;QACT,CAAC;QACD,aAAa,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAC3C,CAAC;AACH,CAAC;AAED,KAAK,UAAU,mBAAmB,CAChC,SAAiB,EACjB,GAAmB;;;QAEnB,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;QAC1D,MAAY,UAAU,kCAAG,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAA,CAAC;QACtD,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,CAAC;QACtC,IAAI,KAAK,CAAC,IAAI,GAAG,WAAW,EAAE,CAAC;YAC7B,MAAM,mBAAmB,CAAC,KAAK,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAChE,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,uBAAuB,CAAC,UAAU,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACzF,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC;YAAE,OAAO,SAAS,CAAC;QAClD,4EAA4E;QAC5E,8EAA8E;QAC9E,qEAAqE;QACrE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;gBACnB,MAAM,IAAI,OAAO,CAAC,SAAS,CAAC,aAAa,EAAE,oCAAoC,EAAE,SAAS,CAAC,CAAC;YAC9F,CAAC;YACD,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;YAC5B,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACjD,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,GAAG,MAAM,OAAO,CAAC,OAAO,CACnE,eAAe,EACf,WAAW,EACX,MAAM,CACP,CAAC;QACF,OAAO,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,eAAe,EAAE,cAAc,EAAE,CAAC;;;;;;;;;;;CACvF;AAED,SAAS,oBAAoB,CAC3B,OAAuB,EACvB,MAKC;IAED,IAAI,CAAC,MAAM,CAAC,WAAW;QAAE,OAAO;IAEhC,6EAA6E;IAC7E,wEAAwE;IACxE,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,aAAa,EAAE,CAAC;QACzC,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;QAC7B,OAAO;IACT,CAAC;IACD,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,cAAc,CAAC,CAAC;IAClF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;QAC7B,OAAO;IACT,CAAC;IACD,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,aAAa,GAAG,kBAAkB,EAAE,CAAC;QAC7E,OAAO,CAAC,IAAI,IAAI,KAAK,CAAC;QACtB,OAAO;IACT,CAAC;IACD,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;AAC/B,CAAC;AAoBD,SAAS,oBAAoB,CAAC,KAAkB;IAC9C,OAAO;QACL,KAAK;QACL,YAAY,EAAE,CAAC;QACf,YAAY,EAAE,CAAC;QACf,WAAW,EAAE,CAAC;QACd,cAAc,EAAE,CAAC;QACjB,aAAa,EAAE,CAAC;QAChB,QAAQ,EAAE,EAAE;QACZ,YAAY,EAAE,EAAE;QAChB,qBAAqB,EAAE,KAAK;QAC5B,IAAI,EAAE,EAAE;QACR,aAAa,EAAE,KAAK;KACrB,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CAAC,IAA0B;IACpD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,aAAa,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;IACjF,CAAC;IACD,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACjD,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,OAAO,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;AAC3D,CAAC;AAED,SAAS,wBAAwB,CAAC,IAA0B;IAC1D,2EAA2E;IAC3E,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;QAC1D,MAAM,KAAK,GAAG,YAAY,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QAC5F,OAAO,6BAA6B,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,iCAAiC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,qCAAqC,CAC5C,OAAuB,EACvB,IAA0B;IAE1B,MAAM,OAAO,GAAG;QACd,GAAG,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACrF,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;KACnE,CAAC;IACF,OAAO;QACL,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI;QACxB,OAAO;QACP,qEAAqE;QACrE,0EAA0E;QAC1E,OAAO,EAAE;YACP,KAAK,EAAE,OAAO,CAAC,YAAY,GAAG,OAAO,CAAC,WAAW;YACjD,SAAS,EAAE,OAAO,CAAC,YAAY;YAC/B,MAAM,EAAE,OAAO,CAAC,WAAW;SAC5B;QACD,YAAY,EAAE,OAAO,CAAC,YAAY;QAClC,YAAY,EAAE,OAAO,CAAC,cAAc;QACpC,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,wEAAwE;QACxE,uEAAuE;QACvE,GAAG,CAAC,OAAO,CAAC,qBAAqB,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,GAAG,OAAO,CAAC,WAAW;YAChF,CAAC,CAAC,EAAE,gBAAgB,EAAE,IAAI,EAAE;YAC5B,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnF,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzD,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC3E,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,sBAAsB,CACnC,IAA0B,EAC1B,GAAY;IAKZ,MAAM,WAAW,GAAG,kBAAkB,EAAE,CAAC;IACzC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,MAAM,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;IACjG,MAAM,gBAAgB,GAAG,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC;IAChD,MAAM,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAE7D,wEAAwE;IACxE,6EAA6E;IAC7E,MAAM,OAAO,GAAiE,UAAU;QACtF,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;QACxB,CAAC,CAAC,WAAW,CAAC;YACV,GAAG,EAAE,IAAI;YACT,OAAO,EAAE,gBAAgB;YACzB,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,WAAW,EAAE,CAAC,IAAI,CAAC,cAAc;YACjC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,SAAS;YAC3B,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,aAAa,EAAE,IAAI;YACnB,SAAS,EAAE,IAAI;YACf,cAAc,EAAE,IAAI;YACpB,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpE,CAAC,CAAC;IAEP,4EAA4E;IAC5E,mDAAmD;IACnD,MAAM,OAAO,GAAG,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;IAEzE,yEAAyE;IACzE,8EAA8E;IAC9E,8DAA8D;IAC9D,MAAM,OAAO,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,aAAwC,CAAC;IAC7C,IAAI,CAAC;QACH,MAAM,OAAO,GAAmB;YAC9B,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,OAAO;YACP,WAAW;YACX,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,OAAO;YACP,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,UAAU,EAAE,UAAU,KAAK,SAAS;SACrC,CAAC;QAEF,aAAa,GAAG,MAAM,0BAA0B,CAAC,OAAO,EAAE;YACxD,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,WAAW,EAAE,mBAAmB;YAChC,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrE,UAAU,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,UAAU;YACzD,OAAO,EAAE,GAAG,EAAE;gBACZ,OAAO,CAAC,cAAc,EAAE,CAAC;gBACzB,GAAG,CAAC,UAAU,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;YACtD,CAAC;YACD,OAAO,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE;gBAC1B,aAAa,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;YACzC,CAAC;YACD,QAAQ,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC;SAC1D,CAAC,CAAC;IACL,CAAC;YAAS,CAAC;QACT,OAAO,CAAC,OAAO,EAAE,CAAC;IACpB,CAAC;IACD,IAAI,aAAa,KAAK,SAAS;QAAE,OAAO,CAAC,aAAa,GAAG,aAAa,CAAC;IACvE,4EAA4E;IAC5E,6EAA6E;IAC7E,+EAA+E;IAC/E,0EAA0E;IAC1E,mEAAmE;SAC9D,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO;QAAE,OAAO,CAAC,aAAa,GAAG,SAAS,CAAC;IAE/D,GAAG,CAAC,UAAU,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;IAEpD,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;QAC7C,GAAG,CAAC,GAAG,CACL,MAAM,EACN,GAAG,OAAO,CAAC,YAAY,qBAAqB,OAAO,CAAC,YAAY,YAAY,EAC5E,cAAc,CACf,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,qCAAqC,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAExE,IAAI,eAAmC,CAAC;IACxC,IAAI,OAAO,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,CAAC;YACH,eAAe,GAAG,CAChB,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAChE,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAC9B,CAAC;QAAC,MAAM,CAAC;YACP,uDAAuD;QACzD,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO;QAC1B,CAAC,CAAC,oBAAoB,CAAC;YACnB,SAAS,EAAE,OAAO,CAAC,OAAO,CAAC,IAAI;YAC/B,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,OAAO;YAChC,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,YAAY,EAAE,eAAe;YAC7B,SAAS,EAAE,GAAG,CAAC,SAAS;SACzB,CAAC,CAAC,YAAY;QACjB,CAAC,CAAC,SAAS,CAAC;IACd,OAAO,IAAI,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC;AACtD,CAAC;AAED,MAAM,CAAC,MAAM,YAAY,GAAG,UAAU,CAA6D;IACjG,IAAI,EAAE,cAAc;IACpB,KAAK,EAAE,oBAAoB;IAC3B,WAAW,EACT,2GAA2G;QAC3G,2GAA2G;QAC3G,iFAAiF;IACnF,KAAK,EAAE,2BAA2B;IAClC,YAAY,EAAE,KAAK;IACnB,QAAQ,EAAE,IAAI;IACd,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;QACjB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,OAAO;YACL,KAAK,EAAE,UAAU,QAAQ,EAAE;YAC3B,OAAO,EAAE,GAAG,uBAAuB,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,uBAAuB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE;SACzG,CAAC;IACJ,CAAC;IACD,QAAQ,EAAE,eAAe;IACzB,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,gBAAgB,GAAG,uBAAuB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACrE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,MAAM,sBAAsB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACrE,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,MAAM,WAAW,GACf,kBAAkB,gBAAgB,IAAI,QAAQ,EAAE;YAChD,WAAW,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,YAAY;YACtD,OAAO,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,UAAU;YACrD,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5F,CAAC,UAAU,CAAC,aAAa;gBACvB,CAAC,CAAC,WAAW,MAAM,CAAC,UAAU,CAAC,aAAa,CAAC,iBAAiB;gBAC9D,CAAC,CAAC,EAAE,CAAC,CAAC;QACV,yEAAyE;QACzE,oEAAoE;QACpE,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,UAAU,CAAC,aAAa,CAAC;QACtC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC;YACnC,0EAA0E;YAC1E,8EAA8E;YAC9E,0EAA0E;YAC1E,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC,OAAO,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;gBACrD,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC;gBAC3C,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO;qBAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;qBAC9B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;qBACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;qBAClB,IAAI,CAAC,IAAI,CAAC,CAAC;gBACd,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChE,KAAK,CAAC,IAAI,CACR,MAAM,MAAM,CAAC,KAAK,CAAC,qDAAqD,KAAK,GAAG,IAAI,IAAI;oBACtF,8FAA8F,CACjG,CAAC;YACJ,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YAC9B,wEAAwE;YACxE,sEAAsE;YACtE,KAAK,CAAC,IAAI,CACR,kCAAkC,IAAI,kDAAkD,IAAI,gBAAgB,CAC7G,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GACR,UAAU,CAAC,YAAY,KAAK,CAAC;YAC3B,CAAC,CAAC,aAAa,CAAC;gBACZ,GAAG,IAAI;gBACP,YAAY,EAAE,UAAU,CAAC,YAAY;gBACrC,kEAAkE;gBAClE,8CAA8C;gBAC9C,UAAU,EACR,IAAI,KAAK,SAAS;oBAClB,UAAU,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;oBAC7B,OAAO,CAAC,UAAU,CAAC,aAAa,CAAC;aACpC,CAAC;YACJ,CAAC,CAAC,SAAS,CAAC;QAChB,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,wEAAwE;QACxE,wEAAwE;QACxE,uEAAuE;QACvE,0BAA0B;QAC1B,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC3E,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,UAAU,CAAC,aAAa,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CACR,kBAAkB,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC,yCAAyC,CACxF,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAClF,OAAO;YACL,UAAU;YACV,IAAI;YACJ,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;YAC7B,OAAO,EAAE,cAAc,CAAC,UAAU,CAAC,OAAO,CAAC;SAC5C,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { ContentBlock } from '@modelcontextprotocol/server';\n\nimport { Buffer, isUtf8 } from 'node:buffer';\n\nimport * as z from 'zod/v4';\n\nimport type { StoppedReason } from '../core/concurrency.ts';\nimport { processEntriesConcurrently } from '../core/concurrency.ts';\nimport { unifiedPatch } from '../core/diff.ts';\nimport { ErrorCode, FsError, isFsError, isSkippableErrno, Problem } from '../core/errors.ts';\nimport { buildWrittenFileMeta } from '../core/file-uri.ts';\nimport { stoppedEarlyLine, truncateProgressPattern, zeroMatchHint } from '../core/fmt.ts';\nimport type { GuardedFileSystem } from '../core/fs.ts';\nimport { globEntries } from '../core/glob.ts';\nimport type { ResultPaths } from '../core/path.ts';\nimport { createTooLargeError, readFileBufferWithLimit } from '../core/read.ts';\nimport {\n  defaultFalseBoolean,\n  IncludeHidden,\n  IncludeIgnored,\n  mapOptionalPath,\n  MaxDepth,\n  nonBlankString,\n  OptionalPath,\n  SafeGlobPattern,\n} from '../core/schema.ts';\nimport type { Regex } from '../core/search.ts';\nimport {\n  compileRegex,\n  createYielder,\n  execMatches,\n  freeRegex,\n  RE2_MAX_INPUT_BYTES,\n  resolveSearchScope,\n} from '../core/search.ts';\nimport {\n  DEFAULT_SEARCH_RESULTS,\n  escapeRegExp,\n  getMaxTextFileSize,\n  MAX_SEARCH_RESULTS,\n  PARALLEL_CONCURRENCY,\n} from '../core/util.ts';\nimport { type BatchResult, isTotalFailure } from './batch.ts';\nimport { defineTool, type ToolCtx } from './define.ts';\n\nconst SearchAndReplaceInputSchema = z.strictObject({\n  path: OptionalPath.describe(\n    'File to rewrite, or directory to rewrite under. Omitting it targets the ENTIRE first allowed root — ' +\n      'scope it deliberately, and pair a wide scope with dryRun=true first',\n  ),\n  pattern: SafeGlobPattern.optional().describe(\n    'Glob to restrict replacements to specific file types (e.g. **/*.ts); default: all text files',\n  ),\n  searchPattern: nonBlankString('searchPattern')\n    .max(10000)\n    .describe(\n      'Exact literal text or RE2 regex pattern to search for. When isRegex=true, uses RE2 syntax (no lookahead, lookbehind, or backreferences are supported). Cannot be empty or whitespace-only.',\n    ),\n  replacement: z\n    .string()\n    .max(10000)\n    .describe(\n      'Replacement text. Use capture group references ($1, $2, etc.) when isRegex=true. Use an empty string to delete all matches.',\n    )\n    .meta({ examples: ['$1_renamed', '', 'TODO: fix'] }),\n  isRegex: defaultFalseBoolean('Treat searchPattern as a RE2 regex (default: literal text match)'),\n  includeHidden: IncludeHidden,\n  includeIgnored: IncludeIgnored,\n  caseSensitive: defaultFalseBoolean('Enable case-sensitive matching (default: case-insensitive)'),\n  wholeWord: defaultFalseBoolean('Match whole words only (word boundary anchoring)'),\n  dryRun: defaultFalseBoolean(\n    'Preview replacements without writing to disk (default: false = apply changes)',\n  ),\n  returnDiff: defaultFalseBoolean('Include a unified diff of all changes in the response'),\n  maxResults: z\n    .uint32()\n    .min(1)\n    .max(MAX_SEARCH_RESULTS)\n    .optional()\n    .default(DEFAULT_SEARCH_RESULTS)\n    .describe('Maximum total match count across all files before stopping'),\n  maxFiles: z\n    .uint32()\n    .min(1)\n    .max(MAX_SEARCH_RESULTS)\n    .optional()\n    .describe('Maximum number of files to process'),\n  maxDepth: MaxDepth,\n});\n\ntype SearchAndReplaceOutput = BatchResult<{ matches: number }> & {\n  /** The root `results[].path` is relative to; a path that would not read back from it is absolute. */\n  root: string;\n  totalMatches: number;\n  filesScanned: number;\n  skippedBinary?: number;\n  resultsTruncated?: boolean;\n  diff?: string;\n  diffTruncated?: boolean;\n  stoppedReason?: StoppedReason;\n};\n\nconst MAX_FAILURES = 20;\nconst REPLACE_CONCURRENCY = Math.min(PARALLEL_CONCURRENCY, 8);\nconst MAX_CHANGED_FILES = 100;\nconst MAX_DIFF_SIZE = 20 * 1024; // 20KB limit for diff output\nconst DIFF_APPEND_BUFFER = 1024;\n\ninterface Failure {\n  path: string;\n  error: Problem;\n}\n\n/** Counts every failure; keeps the first MAX_FAILURES of them for the result. */\nfunction recordFailure(summary: ReplaceSummary, entryPath: string, error: unknown): void {\n  summary.failedFiles++;\n  if (summary.failures.length >= MAX_FAILURES) return;\n  summary.failures.push({\n    path: summary.paths.show(entryPath),\n    error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, entryPath),\n  });\n}\n\nfunction recordChangedFile(summary: ReplaceSummary, plan: ReplacementPlan, filePath: string): void {\n  const relativePath = summary.paths.show(filePath);\n  // The first changed file is the one the resource_link points at; keep what\n  // was written so the link needs no read-back.\n  summary.primary ??= { path: filePath, content: plan.updatedContent };\n  if (summary.changedFiles.length < MAX_CHANGED_FILES) {\n    summary.changedFiles.push({ path: relativePath, matches: plan.matchCount });\n    return;\n  }\n  summary.changedFilesTruncated = true;\n}\n\ninterface ReplacementMatcher {\n  /** Yields periodically and throws on abort: a partial splice must never be written. */\n  replace(\n    content: string,\n    replacement: string,\n    signal: AbortSignal | undefined,\n  ): Promise<{ content: string; matchCount: number }>;\n  testBuffer(buffer: Buffer): boolean;\n  /** Releases any compiled pattern this matcher owns. Idempotent. */\n  dispose(): void;\n}\n\nconst DOLLAR_TOKEN = /\\$(\\$|&|`|'|<([^>]*)>|\\d{1,2})/g;\n\n/**\n * Expand `$`-substitutions in a replacement template the way `RegExp` does.\n *\n * We cannot hand the template to RE2's own string replacer: it throws\n * `Invalid replacement string` on any `$` not followed by a substitution it\n * recognises (so a replacement of `$100` or a trailing `$` fails outright,\n * where `RegExp` inserts the `$` literally), and it renders an out-of-range\n * `$5` as `$4`. The matcher splices matches itself, so this is the single owner\n * of the syntax.\n */\nfunction expandDollarTokens(\n  template: string,\n  match: string,\n  groups: (string | undefined)[],\n  offset: number,\n  input: string,\n  named: Record<string, string> | undefined,\n): string {\n  return template.replace(DOLLAR_TOKEN, (token: string, kind: string, name?: string) => {\n    if (kind === '$') return '$';\n    if (kind === '&') return match;\n    if (kind === '`') return input.slice(0, offset);\n    if (kind === \"'\") return input.slice(offset + match.length);\n    if (name !== undefined) {\n      if (named && Object.hasOwn(named, name)) return named[name] ?? '';\n      return token;\n    }\n    // `$12` prefers group 12, then falls back to group 1 followed by a literal\n    // `2`, and stays literal when neither exists — RegExp's own precedence.\n    const two = Number.parseInt(kind, 10);\n    if (kind.length === 2 && two >= 1 && two <= groups.length) return groups[two - 1] ?? '';\n    const one = Number.parseInt(kind.slice(0, 1), 10);\n    if (one >= 1 && one <= groups.length) {\n      return (groups[one - 1] ?? '') + (kind.length === 2 ? kind.slice(1) : '');\n    }\n    return token;\n  });\n}\n\nfunction createRegexReplacementMatcher(\n  regex: Regex,\n  expandReplacement: boolean,\n): ReplacementMatcher {\n  return {\n    testBuffer(buffer: Buffer): boolean {\n      if (buffer.length > RE2_MAX_INPUT_BYTES) {\n        throw new FsError(\n          ErrorCode.TOO_LARGE,\n          `File too large for a regex replace (${String(buffer.length)} > ${String(RE2_MAX_INPUT_BYTES)} bytes). Regex mode is used for isRegex, wholeWord, or the default caseSensitive: false; pass caseSensitive: true with a literal searchPattern, or split the file.`,\n        );\n      }\n      // The regex is global and shared across every file in the batch, so a\n      // previous file's match would otherwise start this scan mid-string.\n      regex.lastIndex = 0;\n      return regex.test(buffer.toString('utf-8'));\n    },\n    async replace(content, replacement, signal) {\n      // Splicing by hand rather than through `String.replace(regex, …)`: RE2's\n      // own replacer indexes the JS string with the code-point offsets it\n      // reports, which lands the replacement short by one per astral character\n      // (most emoji) earlier in the file. execMatches reports UTF-16 offsets.\n      let matchCount = 0;\n      let updated = '';\n      let cursor = 0;\n      const tick = createYielder(signal);\n      for (const match of execMatches(regex, content)) {\n        matchCount++;\n        // Only isRegex=true opts into $1/$& substitution. A literal search\n        // reaches this matcher too (case-insensitive and wholeWord both need a\n        // regex), and there the replacement must be inserted verbatim.\n        updated +=\n          content.slice(cursor, match.start) +\n          (expandReplacement\n            ? expandDollarTokens(\n                replacement,\n                match.text,\n                match.groups,\n                match.start,\n                content,\n                match.named,\n              )\n            : replacement);\n        cursor = match.end;\n        if (await tick()) signal?.throwIfAborted();\n      }\n      return { content: updated + content.slice(cursor), matchCount };\n    },\n    dispose(): void {\n      freeRegex(regex);\n    },\n  };\n}\n\nfunction createCaseSensitiveLiteralMatcher(searchPattern: string): ReplacementMatcher {\n  const searchBuffer = Buffer.from(searchPattern, 'utf8');\n\n  return {\n    testBuffer(buffer: Buffer): boolean {\n      return buffer.indexOf(searchBuffer) !== -1;\n    },\n    // One native O(n) pass; nothing to yield for.\n    replace(content, replacement) {\n      let matchCount = 0;\n      const updated = content.replaceAll(searchPattern, () => {\n        matchCount++;\n        return replacement;\n      });\n      return Promise.resolve({ content: updated, matchCount });\n    },\n    dispose(): void {\n      // no compiled pattern to release\n    },\n  };\n}\n\ntype SearchAndReplaceArgs = z.infer<typeof SearchAndReplaceInputSchema>;\n\ninterface ReplaceContext {\n  dryRun: boolean;\n  returnDiff: boolean;\n  replacement: string;\n  matcher: ReplacementMatcher;\n  maxFileSize: number;\n  signal: AbortSignal | undefined;\n  summary: ReplaceSummary;\n  fs: GuardedFileSystem;\n  singleFile: boolean;\n}\n\ninterface ReplacementPlan {\n  matchCount: number;\n  originalContent: string;\n  updatedContent: string;\n}\n\nasync function processEntry(entryPath: string, ctx: ReplaceContext): Promise<void> {\n  const { dryRun, returnDiff, signal, summary } = ctx;\n  // Discovery/read failures on a walked file are skipped silently; a failed\n  // write is the caller's edit not landing, so it is always reported.\n  const write = { started: false };\n\n  try {\n    // Lock the read→write per file so a concurrent writer is not lost; a dry\n    // run never writes and skips the lock.\n    const plan = dryRun\n      ? await readReplacementPlan(entryPath, ctx)\n      : await ctx.fs.lockForWrite(entryPath, async () => {\n          const planned = await readReplacementPlan(entryPath, ctx);\n          if (planned) {\n            write.started = true;\n            await ctx.fs.writeFile(entryPath, planned.updatedContent, { signal });\n          }\n          return planned;\n        });\n    if (!plan) {\n      return;\n    }\n\n    // Bookkeep only after the write succeeds (or in dryRun, where there is no\n    // write): a failed write must not count the file as changed.\n    summary.totalMatches += plan.matchCount;\n    summary.filesChanged++;\n\n    recordChangedFile(summary, plan, entryPath);\n\n    maybeAppendPatchDiff(summary, {\n      filePath: entryPath,\n      originalContent: plan.originalContent,\n      updatedContent: plan.updatedContent,\n      includeDiff: dryRun || returnDiff,\n    });\n  } catch (error) {\n    // A timeout/cancel aborts the whole scan, not just this file: don't record\n    // it as a per-file failure. processEntriesConcurrently reports the run as\n    // stoppedReason 'timeout' instead.\n    if (signal?.aborted) return;\n    if (\n      !ctx.singleFile &&\n      !write.started &&\n      ((isFsError(error) &&\n        (error.code === ErrorCode.ACCESS_DENIED ||\n          error.code === ErrorCode.NOT_FOUND ||\n          error.code === ErrorCode.SYMLINK_NOT_ALLOWED)) ||\n        isSkippableErrno(error))\n    ) {\n      summary.processedFiles--;\n      return;\n    }\n    recordFailure(summary, entryPath, error);\n  }\n}\n\nasync function readReplacementPlan(\n  validPath: string,\n  ctx: ReplaceContext,\n): Promise<ReplacementPlan | undefined> {\n  const { matcher, replacement, maxFileSize, signal } = ctx;\n  await using fileHandle = await ctx.fs.open(validPath);\n  const stats = await fileHandle.stat();\n  if (stats.size > maxFileSize) {\n    throw createTooLargeError(stats.size, maxFileSize, validPath);\n  }\n\n  const buffer = await readFileBufferWithLimit(fileHandle, maxFileSize, validPath, signal);\n  if (!matcher.testBuffer(buffer)) return undefined;\n  // Only bytes that decode to UTF-8 losslessly survive the string round trip;\n  // anything else would be written back with U+FFFD in place of every bad byte.\n  // NUL is valid UTF-8 but marks a binary file, as it does for `read`.\n  if (!isUtf8(buffer) || buffer.includes(0)) {\n    if (ctx.singleFile) {\n      throw new FsError(ErrorCode.INVALID_INPUT, 'Binary or non-UTF-8 file detected.', validPath);\n    }\n    ctx.summary.skippedBinary++;\n    return undefined;\n  }\n\n  const originalContent = buffer.toString('utf-8');\n  const { content: updatedContent, matchCount } = await matcher.replace(\n    originalContent,\n    replacement,\n    signal,\n  );\n  return matchCount === 0 ? undefined : { matchCount, originalContent, updatedContent };\n}\n\nfunction maybeAppendPatchDiff(\n  summary: ReplaceSummary,\n  params: {\n    filePath: string;\n    originalContent: string;\n    updatedContent: string;\n    includeDiff: boolean;\n  },\n): void {\n  if (!params.includeDiff) return;\n\n  // Budget first: a full budget must not pay for a diff it will discard, and a\n  // diff past its deadline counts as truncated output, not a failed file.\n  if (summary.diff.length >= MAX_DIFF_SIZE) {\n    summary.diffTruncated = true;\n    return;\n  }\n  const header = summary.paths.show(params.filePath);\n  const patch = unifiedPatch(header, params.originalContent, params.updatedContent);\n  if (patch === undefined) {\n    summary.diffTruncated = true;\n    return;\n  }\n  if (summary.diff.length + patch.length <= MAX_DIFF_SIZE + DIFF_APPEND_BUFFER) {\n    summary.diff += patch;\n    return;\n  }\n  summary.diffTruncated = true;\n}\n\ninterface ReplaceSummary {\n  /** How changed files, failures and diff headers name a path: relative to the root. */\n  paths: ResultPaths;\n  totalMatches: number;\n  filesChanged: number;\n  failedFiles: number;\n  processedFiles: number;\n  skippedBinary: number;\n  failures: Failure[];\n  changedFiles: { path: string; matches: number }[];\n  changedFilesTruncated: boolean;\n  /** First file changed, as written. */\n  primary?: { path: string; content: string };\n  diff: string;\n  diffTruncated: boolean;\n  stoppedReason?: StoppedReason;\n}\n\nfunction createReplaceSummary(paths: ResultPaths): ReplaceSummary {\n  return {\n    paths,\n    totalMatches: 0,\n    filesChanged: 0,\n    failedFiles: 0,\n    processedFiles: 0,\n    skippedBinary: 0,\n    failures: [],\n    changedFiles: [],\n    changedFilesTruncated: false,\n    diff: '',\n    diffTruncated: false,\n  };\n}\n\nfunction buildSearchPattern(args: SearchAndReplaceArgs): string {\n  if (args.isRegex) {\n    return args.wholeWord ? `\\\\b(?:${args.searchPattern})\\\\b` : args.searchPattern;\n  }\n  const escaped = escapeRegExp(args.searchPattern);\n  return args.wholeWord ? `\\\\b(?:${escaped})\\\\b` : escaped;\n}\n\nfunction createReplacementMatcher(args: SearchAndReplaceArgs): ReplacementMatcher {\n  // Use regex when isRegex, wholeWord, or case-insensitive (all require RE2)\n  if (args.isRegex || args.wholeWord || !args.caseSensitive) {\n    const regex = compileRegex(buildSearchPattern(args), { caseSensitive: args.caseSensitive });\n    return createRegexReplacementMatcher(regex, args.isRegex);\n  }\n  return createCaseSensitiveLiteralMatcher(args.searchPattern);\n}\n\nfunction buildSearchAndReplaceStructuredResult(\n  summary: ReplaceSummary,\n  args: SearchAndReplaceArgs,\n): SearchAndReplaceOutput {\n  const results = [\n    ...summary.changedFiles.map((f) => ({ path: f.path, value: { matches: f.matches } })),\n    ...summary.failures.map((f) => ({ path: f.path, error: f.error })),\n  ];\n  return {\n    root: summary.paths.root,\n    results,\n    // `failedFiles` counts every failure; `failures` itself is capped at\n    // MAX_FAILURES, so the summary must not be derived from the array length.\n    summary: {\n      total: summary.filesChanged + summary.failedFiles,\n      succeeded: summary.filesChanged,\n      failed: summary.failedFiles,\n    },\n    totalMatches: summary.totalMatches,\n    filesScanned: summary.processedFiles,\n    ...(summary.skippedBinary ? { skippedBinary: summary.skippedBinary } : {}),\n    // Failures are capped at MAX_FAILURES independently of the changed-file\n    // cap, so either cap can leave `results` shorter than `summary.total`.\n    ...(summary.changedFilesTruncated || summary.failures.length < summary.failedFiles\n      ? { resultsTruncated: true }\n      : {}),\n    ...((args.dryRun || args.returnDiff) && summary.diff ? { diff: summary.diff } : {}),\n    ...(summary.diffTruncated ? { diffTruncated: true } : {}),\n    ...(summary.stoppedReason ? { stoppedReason: summary.stoppedReason } : {}),\n  };\n}\n\nasync function handleSearchAndReplace(\n  args: SearchAndReplaceArgs,\n  ctx: ToolCtx,\n): Promise<{\n  structured: SearchAndReplaceOutput;\n  link?: ContentBlock;\n}> {\n  const maxFileSize = getMaxTextFileSize();\n  const { basePath: root, explicitFile: singleFile } = await resolveSearchScope(args.path, ctx.fs);\n  const effectivePattern = args.pattern ?? '**/*';\n  const ceiling = ctx.fs.pathGuard.allowedRootContaining(root);\n\n  // An explicit single-file target bypasses baseNameMatch/exclude/hidden/\n  // gitignore filtering — it should always be processed as the one file named.\n  const entries: AsyncIterable<{ path: string }> | Iterable<{ path: string }> = singleFile\n    ? [{ path: singleFile }]\n    : globEntries({\n        cwd: root,\n        pattern: effectivePattern,\n        includeHidden: args.includeHidden,\n        skipIgnored: !args.includeIgnored,\n        pathGuard: ctx.fs.pathGuard,\n        ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),\n        signal: ctx.signal,\n        baseNameMatch: true,\n        onlyFiles: true,\n        suppressErrors: true,\n        ...(args.maxDepth !== undefined ? { maxDepth: args.maxDepth } : {}),\n      });\n\n  // Relative to the root, not to the walked directory: `a.ts` from a run over\n  // `src` would name `<root>/a.ts` when passed back.\n  const summary = createReplaceSummary(ctx.fs.pathGuard.resultPaths(root));\n\n  // The matcher may own a compiled RE2 pattern, whose wasm memory re2-wasm\n  // never reclaims on its own. Nothing past the scan touches it, so free it the\n  // moment the scan is done — success, failure, or abort alike.\n  const matcher = createReplacementMatcher(args);\n  let stoppedReason: StoppedReason | undefined;\n  try {\n    const context: ReplaceContext = {\n      dryRun: args.dryRun,\n      returnDiff: args.returnDiff,\n      replacement: args.replacement,\n      matcher,\n      maxFileSize,\n      signal: ctx.signal,\n      summary,\n      fs: ctx.fs,\n      singleFile: singleFile !== undefined,\n    };\n\n    stoppedReason = await processEntriesConcurrently(entries, {\n      signal: ctx.signal,\n      concurrency: REPLACE_CONCURRENCY,\n      ...(args.maxFiles !== undefined ? { maxEntries: args.maxFiles } : {}),\n      shouldStop: () => summary.totalMatches >= args.maxResults,\n      onEntry: () => {\n        summary.processedFiles++;\n        ctx.onProgress({ current: summary.processedFiles });\n      },\n      onError: (entryPath, err) => {\n        recordFailure(summary, entryPath, err);\n      },\n      runEntry: (entryPath) => processEntry(entryPath, context),\n    });\n  } finally {\n    matcher.dispose();\n  }\n  if (stoppedReason !== undefined) summary.stoppedReason = stoppedReason;\n  // A single file that aborts mid-scan throws inside processEntry (caught and\n  // swallowed as a timeout) and leaves the dispatch loop with no more entries,\n  // so processEntriesConcurrently returns undefined; surface the timeout here so\n  // the result is not reported as a clean \"0 matches\". search_text's engine\n  // checks the signal directly, so only replace needs this fallback.\n  else if (ctx.signal.aborted) summary.stoppedReason = 'timeout';\n\n  ctx.onProgress({ current: summary.processedFiles });\n\n  if (!args.dryRun && summary.totalMatches > 0) {\n    ctx.log(\n      'info',\n      `${summary.filesChanged} file(s) changed, ${summary.totalMatches} match(es)`,\n      'replace_text',\n    );\n  }\n\n  const structured = buildSearchAndReplaceStructuredResult(summary, args);\n\n  let primaryModified: string | undefined;\n  if (summary.primary && !args.dryRun) {\n    try {\n      primaryModified = (\n        await ctx.fs.stat(summary.primary.path, { signal: ctx.signal })\n      ).stats.mtime.toISOString();\n    } catch {\n      /* result metadata only; the write already succeeded */\n    }\n  }\n  const link = summary.primary\n    ? buildWrittenFileMeta({\n        validPath: summary.primary.path,\n        content: summary.primary.content,\n        dryRun: args.dryRun,\n        lastModified: primaryModified,\n        transport: ctx.transport,\n      }).resourceLink\n    : undefined;\n  return link ? { structured, link } : { structured };\n}\n\nexport const REPLACE_TEXT = defineTool<typeof SearchAndReplaceInputSchema, SearchAndReplaceOutput>({\n  name: 'replace_text',\n  title: 'Search and Replace',\n  description:\n    'Find and replace every occurrence of literal text or an RE2 regex, like sed -i, in one file or all files ' +\n    'under a directory, optionally filtered by glob. The pattern runs over the whole file: it can span lines, ' +\n    'and ^ and $ anchor to file start and end. edit replaces one unique exact match.',\n  input: SearchAndReplaceInputSchema,\n  readOnlyHint: false,\n  deadline: true,\n  progress: (args) => {\n    const dryLabel = args.dryRun ? ' [dry run]' : '';\n    return {\n      label: `Replace${dryLabel}`,\n      subject: `${truncateProgressPattern(args.searchPattern)} → ${truncateProgressPattern(args.replacement)}`,\n    };\n  },\n  mapPaths: mapOptionalPath,\n  run: async (args, ctx) => {\n    const truncatedPattern = truncateProgressPattern(args.searchPattern);\n    const { structured, link } = await handleSearchAndReplace(args, ctx);\n    const dryLabel = args.dryRun ? ' [dry run]' : '';\n    const summaryText =\n      `replace_text: '${truncatedPattern}'${dryLabel}` +\n      ` \\u00b7 ${String(structured.totalMatches)} match(es)` +\n      ` in ${String(structured.summary.succeeded)} file(s)` +\n      (structured.summary.failed > 0 ? ` \\u00b7 ${String(structured.summary.failed)} failed` : '') +\n      (structured.skippedBinary\n        ? ` \\u00b7 ${String(structured.skippedBinary)} binary skipped`\n        : '');\n    // The structured half ships under `_meta`, which clients do not show the\n    // model, so the stop state and the diff preview must ride the text.\n    const lines = [summaryText];\n    const stop = structured.stoppedReason;\n    if (stop === 'timeout') {\n      lines.push(stoppedEarlyLine(stop));\n      // A live run writes as it scans, so a timeout leaves the files it reached\n      // rewritten. The paths ship under `_meta`, which the model does not see; name\n      // them here, or a re-run of a self-matching replacement applies it twice.\n      if (!args.dryRun && structured.summary.succeeded > 0) {\n        const total = structured.summary.succeeded;\n        const shown = structured.results\n          .filter((x) => !('error' in x))\n          .slice(0, 5)\n          .map((x) => x.path)\n          .join(', ');\n        const more = total > 5 ? `, and ${String(total - 5)} more` : '';\n        lines.push(\n          `// ${String(total)} file(s) were already rewritten and stay changed: ${shown}${more}. ` +\n            'Re-running the same replacement applies it to them again; exclude them, or use dryRun first.',\n        );\n      }\n    } else if (stop !== undefined) {\n      // maxResults/maxFiles here are the caller's own caps, so raising one is\n      // what reaches the rest; the search engine's advice to narrow is not.\n      lines.push(\n        `// scan stopped early: hit the ${stop} limit; later files were not scanned. A higher ${stop} reaches them.`,\n      );\n    }\n    const hint =\n      structured.totalMatches === 0\n        ? zeroMatchHint({\n            ...args,\n            filesScanned: structured.filesScanned,\n            // A failed file, or a binary one the needle did hit, explains the\n            // zero better than a guess about the pattern.\n            incomplete:\n              stop !== undefined ||\n              structured.summary.failed > 0 ||\n              Boolean(structured.skippedBinary),\n          })\n        : undefined;\n    if (hint) lines.push(hint);\n    // A failure's reason lives in `results`, which ships under `_meta`. The\n    // full relative path, not the basename: the error message may not carry\n    // the path, and two same-named files in different directories must not\n    // render as the same row.\n    for (const r of structured.results.filter((x) => 'error' in x).slice(0, 3)) {\n      lines.push(`// ${r.path}: ${r.error.code} ${r.error.message}`);\n    }\n    if (structured.diffTruncated) {\n      lines.push(\n        `// diff cut at ${String(MAX_DIFF_SIZE / 1024)} KB: some files' changes are not shown.`,\n      );\n    }\n    const text = lines.join('\\n') + (structured.diff ? `\\n\\n${structured.diff}` : '');\n    return {\n      structured,\n      text,\n      resources: link ? [link] : [],\n      isError: isTotalFailure(structured.summary),\n    };\n  },\n});\n"]}

package/dist/tools/search-text.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"search-text.d.ts","sourceRoot":"","sources":["../../src/tools/search-text.ts"],"names":[],"mappings":"AA0MA,eAAO,MAAM,WAAW,mCAsGtB,CAAC"}
+{"version":3,"file":"search-text.d.ts","sourceRoot":"","sources":["../../src/tools/search-text.ts"],"names":[],"mappings":"AAgLA,eAAO,MAAM,WAAW,mCA6GtB,CAAC"}

package/dist/tools/search-text.js

@@ -1,13 +1,10 @@
-import { dirname } from 'node:path';
 import * as z from 'zod/v4';
 import { pageQueryKey, paginate } from "../core/cursor.js";
-import { ErrorCode, FsError } from "../core/errors.js";
 import { formatCount, pageTrailer, truncateProgressPattern, zeroMatchHint } from "../core/fmt.js";
-import { toPosixRelative } from "../core/path-utils.js";
-import { CursorSchema, defaultFalseBoolean, IncludeHidden, IncludeIgnored, MaxDepth, nonBlankString, OptionalPath, SafeGlobPattern, } from "../core/schema.js";
-import { searchContent } from "../core/search.js";
+import { CursorSchema, defaultFalseBoolean, IncludeHidden, IncludeIgnored, mapOptionalPath, MaxDepth, nonBlankString, OptionalPath, SafeGlobPattern, } from "../core/schema.js";
+import { resolveSearchScope, searchContent } from "../core/search.js";
 import { putJsonResource } from "../core/store.js";
-import { DEFAULT_SEARCH_CONTENT_RESULTS, DEFAULT_SEARCH_TIMEOUT_MS, MAX_SEARCH_RESULTS, } from "../core/util.js";
+import { DEFAULT_SEARCH_CONTENT_RESULTS, MAX_SEARCH_RESULTS } from "../core/util.js";
 import { defineTool } from "./define.js";
 const GrepInputSchema = z.strictObject({
     path: OptionalPath.describe('File to search, or directory to search under (default: the whole first allowed root). Naming a file searches that file alone: pattern is ignored and hidden/ignored filtering does not apply.'),
@@ -87,6 +84,7 @@ function buildSearchMatchDetail(totalMatches, filesMatched) {
 }
 function searchContentOutput(matches, metadata, nextCursor, resourceUri) {
     return {
+        root: metadata.root,
         matches: [...matches],
         totalMatches: metadata.matchingLines,
         filesScanned: metadata.filesScanned,
@@ -100,13 +98,13 @@ function searchContentOutput(matches, metadata, nextCursor, resourceUri) {
         ...(nextCursor !== undefined ? { nextCursor } : {}),
     };
 }
-function buildSortedPayloads(result) {
+function buildSortedPayloads(result, paths) {
     const relativeByFile = new Map();
     const getRelativeFile = (file) => {
         const cached = relativeByFile.get(file);
         if (cached !== undefined)
             return cached;
-        const rel = toPosixRelative(result.basePath, file);
+        const rel = paths.show(file);
         relativeByFile.set(file, rel);
         return rel;
     };
@@ -122,33 +120,14 @@ function buildSortedPayloads(result) {
     payloads.sort((l, r) => l.file.localeCompare(r.file) || l.line - r.line);
     return payloads;
 }
-/** Explicit files bypass glob filtering; their parent anchors the relative result paths. */
-async function resolveSearchScope(path, ctx) {
-    const requested = ctx.fs.pathGuard.resolvePathOrRoot(path);
-    // One resolution, one stat: validateExistingDirectory would redo both.
-    const { stats, validPath: resolved } = await ctx.fs.stat(requested, { signal: ctx.signal });
-    if (!stats.isFile()) {
-        if (!stats.isDirectory()) {
-            throw new FsError(ErrorCode.NOT_DIRECTORY, 'Not a directory', requested);
-        }
-        return { basePath: resolved };
-    }
-    return {
-        basePath: dirname(resolved),
-        // The name is NOT turned into a glob: `[slug].tsx` would read as a
-        // character class. searchContent scans exactly this file instead, and
-        // hidden/ignored filtering is moot for a file the caller named.
-        explicitFile: resolved,
-    };
-}
 export const SEARCH_TEXT = defineTool({
     name: 'search_text',
     title: 'Search Content',
     description: 'Search file contents for literal text or an RE2 regex, like grep; returns matching lines with line numbers ' +
-        'and paths relative to the searched directory. Patterns match within one line. find_files matches file names.',
+        'and paths relative to the root, ready to pass to read or edit. Patterns match within one line. find_files matches file names.',
     input: GrepInputSchema,
     readOnlyHint: true,
-    timeoutMs: DEFAULT_SEARCH_TIMEOUT_MS,
+    deadline: true,
     progress: (args) => ({
         label: 'Search',
         subject: truncateProgressPattern(args.searchPattern),
@@ -156,7 +135,7 @@ export const SEARCH_TEXT = defineTool({
     progressDone: (_args, result) => ({
         detail: buildSearchMatchDetail(result.totalMatches ?? 0, result.filesMatched ?? 0),
     }),
-    accessPaths: (args) => (args.path ? [args.path] : []),
+    mapPaths: mapOptionalPath,
     run: async (args, ctx) => {
         const requestedPath = ctx.fs.pathGuard.resolvePathOrRoot(args.path);
         const paged = await paginate({
@@ -168,7 +147,7 @@ export const SEARCH_TEXT = defineTool({
             cursor: args.cursor,
             pageSize: args.maxResults,
             produce: async () => {
-                const { basePath, explicitFile } = await resolveSearchScope(args.path, ctx);
+                const { basePath, explicitFile } = await resolveSearchScope(args.path, ctx.fs, ctx.signal);
                 const result = await searchContent(basePath, args.searchPattern, {
                     includeHidden: args.includeHidden,
                     filePattern: args.pattern ?? '**/*',
@@ -181,9 +160,12 @@ export const SEARCH_TEXT = defineTool({
                     ...(args.maxDepth !== undefined ? { maxDepth: args.maxDepth } : {}),
                     signal: ctx.signal,
                 }, ctx.fs.pathGuard);
+                // Relative to the root, not to basePath: `a.ts` from a search of
+                // `src` would name `<root>/a.ts` when passed back.
+                const paths = ctx.fs.pathGuard.resultPaths(basePath);
                 return {
-                    items: buildSortedPayloads(result),
-                    metadata: result.summary,
+                    items: buildSortedPayloads(result, paths),
+                    metadata: { ...result.summary, root: paths.root },
                     truncated: result.summary.truncated,
                 };
             },