@j0hanz/filesystem-mcp 2.7.6 → 2.8.0

package/dist/tools/delete.js

@@ -91,20 +91,13 @@ async function planPath(inputPath, args, fs) {
             return { status: 'fail', failure: toDeleteFailure(inputPath, error) };
         }
     }
-    const pending = hasChildren;
-    return { status: 'plan', plan: { inputPath, validPath, itemType, firstStats, pending } };
-}
-async function performDeletion(validPath, args, isDirectory, fsOps) {
-    if (isDirectory && !args.recursive) {
-        await fsOps.rmdir(validPath);
-    }
-    else {
-        await fsOps.rm(validPath, {
-            recursive: args.recursive,
-            force: args.ignoreIfNotExists,
-        });
-    }
+    return {
+        status: 'plan',
+        plan: { inputPath, validPath, itemType, firstStats, pending: hasChildren },
+    };
 }
+/** Same filesystem object. birthtimeMs joins dev/ino, which read 0 on some non-POSIX drivers. */
+const sameIdentity = (a, b) => a.dev === b.dev && a.ino === b.ino && a.birthtimeMs === b.birthtimeMs;
 /**
  * Phase 2 (mutation): TOCTOU re-stat against the plan's first stat, then
  * delete. A type or identity change across the confirmation gap fails closed
@@ -127,9 +120,7 @@ async function finalizeDeletion(plan, args, ctx) {
     // the type but changes dev/ino/birthtimeMs. birthtimeMs is the primary
     // cross-platform signal — dev/ino can read 0 on some non-POSIX drivers — so
     // combine all three rather than trusting dev/ino alone.
-    const identityChanged = plan.firstStats.stats.dev !== currentStats.stats.dev ||
-        plan.firstStats.stats.ino !== currentStats.stats.ino ||
-        plan.firstStats.stats.birthtimeMs !== currentStats.stats.birthtimeMs;
+    const identityChanged = !sameIdentity(plan.firstStats.stats, currentStats.stats);
     if (plan.itemType !== 'other' && (currentItemType !== plan.itemType || identityChanged)) {
         return {
             failure: {
@@ -139,7 +130,10 @@ async function finalizeDeletion(plan, args, ctx) {
         };
     }
     try {
-        await performDeletion(plan.validPath, args, currentStats.stats.isDirectory(), ctx.fs);
+        if (currentStats.stats.isDirectory() && !args.recursive)
+            await ctx.fs.rmdir(plan.validPath);
+        else
+            await ctx.fs.rm(plan.validPath, { recursive: args.recursive, force: args.ignoreIfNotExists });
     }
     catch (error) {
         return { failure: toDeleteFailure(plan.inputPath, error) };
@@ -153,7 +147,7 @@ async function finalizeDeletion(plan, args, ctx) {
  * `CANCELLED` for that path (R3 proceed, R4/R5 cancelled). A non-pending path
  * deletes directly (R14: non-pending items proceed alongside accepted ones).
  */
-async function executePlan(plan, args, ctx, pendingSorted) {
+async function executePlan(plan, args, ctx, pendingSorted, confirmationState) {
     if (plan.pending) {
         const key = confirmKey(pendingSorted.indexOf(plan.validPath));
         const choice = readAcceptedChoice(ctx.inputResponses, key);
@@ -168,6 +162,15 @@ async function executePlan(plan, args, ctx, pendingSorted) {
                 },
             };
         }
+        const identity = confirmationState?.deleteIdentities?.find((entry) => entry.path === plan.validPath);
+        if (identity?.itemType !== plan.itemType || !sameIdentity(identity, plan.firstStats.stats)) {
+            return {
+                failure: {
+                    path: plan.validPath,
+                    error: Problem.invalidInput('Delete failed: item identity changed or is missing from the confirmation.', { path: plan.validPath }),
+                },
+            };
+        }
     }
     return finalizeDeletion(plan, args, ctx);
 }
@@ -179,13 +182,19 @@ async function handleDelete(args, ctx) {
     const planned = await processInParallel(paths, (inputPath) => planPath(inputPath, args, ctx.fs), PARALLEL_CONCURRENCY, ctx.signal);
     const out = new Array(paths.length).fill(undefined);
     const plans = [];
+    const confirmationState = ctx.requestState?.();
+    const previouslyPendingPaths = new Set(confirmationState?.op === 'delete' ? confirmationState.paths : []);
     for (const { index, value: r } of planned.results) {
         if (r.status === 'fail')
             out[index] = { path: r.failure.path, error: r.failure.error };
         else if (r.status === 'noop')
             out[index] = { path: r.deleted, value: { deleted: true } };
-        else
+        else {
+            // Emptying a directory while its prompt is open must not discard the
+            // answer. Keep that path pending so the verified retry still honors skip.
+            r.plan.pending ||= previouslyPendingPaths.has(r.plan.validPath);
             plans.push({ plan: r.plan, index });
+        }
     }
     for (const { index, error } of planned.errors) {
         out[index] = {
@@ -201,13 +210,22 @@ async function handleDelete(args, ctx) {
     const pendingSorted = [
         ...new Set(plans.filter((p) => p.plan.pending).map((p) => p.plan.validPath)),
     ].sort();
-    if (pendingSorted.length > 0) {
+    // With no actionable plans, preserve per-path NOT_FOUND / ignoreIfNotExists
+    // results. Otherwise even an empty pending set must be checked before an
+    // unrelated non-pending batch entry can mutate.
+    if (pendingSorted.length > 0 || (confirmationState?.op === 'delete' && plans.length > 0)) {
         // Round 1 returns input_required (atomic — R14: nothing deleted yet, not
         // even the non-pending items in the same call); a retry whose verified
         // state does not bind this pending set throws (R9) via `pendingRoundTrip`.
         const round = await pendingRoundTrip(ctx, {
             op: 'delete',
             pending: pendingSorted,
+            deleteIdentities: plans
+                .filter(({ plan }) => plan.pending)
+                .map(({ plan }) => {
+                const { dev, ino, birthtimeMs } = plan.firstStats.stats;
+                return { path: plan.validPath, itemType: plan.itemType, dev, ino, birthtimeMs };
+            }),
             buildInputs: (ps) => ps.map((p, i) => ({
                 key: confirmKey(i),
                 message: `Permanently delete "${p}" and all its contents? This cannot be undone.`,
@@ -218,7 +236,7 @@ async function handleDelete(args, ctx) {
             return round;
     }
     // Phase 2 (mutation): execute deletions for every planned path.
-    const executed = await processInParallel(plans, ({ plan }) => executePlan(plan, args, ctx, pendingSorted), PARALLEL_CONCURRENCY, ctx.signal);
+    const executed = await processInParallel(plans, ({ plan }) => executePlan(plan, args, ctx, pendingSorted, confirmationState), PARALLEL_CONCURRENCY, ctx.signal);
     for (const { index, value: r } of executed.results) {
         const slot = plans[index]?.index;
         if (slot === undefined)

package/dist/tools/delete.js.map

@@ -1 +1 @@
-{"version":3,"file":"delete.js","sourceRoot":"","sources":["../../src/tools/delete.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAErE,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EACL,SAAS,EACT,OAAO,EACP,SAAS,EACT,WAAW,EACX,eAAe,EACf,OAAO,GACR,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAEvD,OAAO,EACL,UAAU,EACV,eAAe,EACf,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtE,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAoB,cAAc,EAAsB,SAAS,EAAE,MAAM,YAAY,CAAC;AAE7F,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,iBAAiB,GAAG,CAAC,CAAC,YAAY,CAAC;IACvC,KAAK,EAAE,CAAC;SACL,KAAK,CAAC,YAAY,CAAC;SACnB,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,IAAI,CAAC;SACT,QAAQ,CAAC,qEAAqE,CAAC;IAClF,SAAS,EAAE,mBAAmB,CAC5B,4EAA4E,CAC7E;IACD,iBAAiB,EAAE,mBAAmB,CACpC,yEAAyE,CAC1E;CACF,CAAC,CAAC;AAYH,MAAM,aAAa,GAAG,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;AAE7E,SAAS,eAAe,CAAC,IAAY,EAAE,KAAc;IACnD,8EAA8E;IAC9E,2EAA2E;IAC3E,4EAA4E;IAC5E,gBAAgB;IAChB,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO;YACL,IAAI;YACJ,KAAK,EAAE,OAAO,CAAC,WAAW,CACxB,IAAI,OAAO,CAAC,SAAS,CAAC,SAAS,EAAE,gBAAgB,EAAE,IAAI,CAAC,EACxD,SAAS,CAAC,SAAS,EACnB,IAAI,CACL;SACF,CAAC;IACJ,CAAC;IACD,IACE,WAAW,CAAC,KAAK,CAAC;QAClB,CAAC,KAAK,CAAC,IAAI,KAAK,WAAW,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,EAClF,CAAC;QACD,OAAO;YACL,IAAI;YACJ,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC;SACzE,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;AAC9E,CAAC;AAmBD;;;;GAIG;AACH,KAAK,UAAU,QAAQ,CACrB,SAAiB,EACjB,IAA0D,EAC1D,EAA2E;IAE3E,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC;QACH,SAAS,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAClE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IACE,IAAI,CAAC,iBAAiB;YACtB,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,SAAS,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,EACpF,CAAC;YACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;QAChD,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,IAAI,EAAE,CAAC,SAAS,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC;QAC1C,OAAO;YACL,MAAM,EAAE,MAAM;YACd,2EAA2E;YAC3E,0EAA0E;YAC1E,sBAAsB;YACtB,OAAO,EAAE;gBACP,IAAI,EAAE,SAAS;gBACf,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,oDAAoD,EAAE;oBAChF,IAAI,EAAE,SAAS;iBAChB,CAAC;aACH;SACF,CAAC;IACJ,CAAC;IAED,IAAI,UAAuB,CAAC;IAC5B,IAAI,CAAC;QACH,UAAU,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACzC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,eAAe,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACrD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;QAChD,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,MAAM,QAAQ,GAAG,gBAAgB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACpD,IAAI,WAAW,GAAG,KAAK,CAAC;IACxB,IAAI,IAAI,CAAC,SAAS,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,WAAW,GAAG,MAAM,EAAE,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QACzD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;QACxE,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,WAAW,CAAC;IAC5B,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;AAC3F,CAAC;AAED,KAAK,UAAU,eAAe,CAC5B,SAAiB,EACjB,IAA0D,EAC1D,WAAoB,EACpB,KAA8C;IAE9C,IAAI,WAAW,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;QACnC,MAAM,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAC/B,CAAC;SAAM,CAAC;QACN,MAAM,KAAK,CAAC,EAAE,CAAC,SAAS,EAAE;YACxB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,KAAK,EAAE,IAAI,CAAC,iBAAiB;SAC9B,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,gBAAgB,CAC7B,IAAgB,EAChB,IAA0D,EAC1D,GAAgC;IAEhC,IAAI,YAAyB,CAAC;IAC9B,IAAI,CAAC;QACH,YAAY,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,eAAe,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACrD,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;QACrC,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IAC7D,CAAC;IAED,MAAM,eAAe,GAAG,gBAAgB,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAC7D,uEAAuE;IACvE,4EAA4E;IAC5E,uEAAuE;IACvE,4EAA4E;IAC5E,wDAAwD;IACxD,MAAM,eAAe,GACnB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,KAAK,YAAY,CAAC,KAAK,CAAC,GAAG;QACpD,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,KAAK,YAAY,CAAC,KAAK,CAAC,GAAG;QACpD,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,WAAW,KAAK,YAAY,CAAC,KAAK,CAAC,WAAW,CAAC;IACvE,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC,QAAQ,IAAI,eAAe,CAAC,EAAE,CAAC;QACxF,OAAO;YACL,OAAO,EAAE;gBACP,IAAI,EAAE,IAAI,CAAC,SAAS;gBACpB,KAAK,EAAE,OAAO,CAAC,YAAY,CACzB,yCAAyC,IAAI,CAAC,QAAQ,OAAO,eAAe,uBAAuB,EACnG,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CACzB;aACF;SACF,CAAC;IACJ,CAAC;IAED,IAAI,CAAC;QACH,MAAM,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,YAAY,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;IACxF,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,OAAO,EAAE,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IAC7D,CAAC;IAED,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,SAAS,EAAE,EAAE,QAAQ,CAAC,CAAC;IACnD,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;AACrC,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,WAAW,CACxB,IAAgB,EAChB,IAA0D,EAC1D,GAAgF,EAChF,aAAgC;IAEhC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,UAAU,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QAC3D,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,OAAO,EAAE,OAAO,EAAE,IAAa,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;YACxB,OAAO;gBACL,OAAO,EAAE;oBACP,IAAI,EAAE,IAAI,CAAC,SAAS;oBACpB,KAAK,EAAE,OAAO,CAAC,SAAS,CACtB,sCAAsC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EACjE,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CACzB;iBACF;aACF,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAC3C,CAAC;AAED,KAAK,UAAU,YAAY,CACzB,IAAiB,EACjB,GAAY;IAEZ,2EAA2E;IAC3E,oEAAoE;IACpE,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEvC,0CAA0C;IAC1C,MAAM,OAAO,GAAG,MAAM,iBAAiB,CACrC,KAAK,EACL,CAAC,SAAS,EAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,EAChD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,MAAM,GAAG,GAAG,IAAI,KAAK,CAAkC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACrF,MAAM,KAAK,GAA0C,EAAE,CAAC;IACxD,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QAClD,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;aAClF,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;;YACpF,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IAC3C,CAAC;IACD,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9C,GAAG,CAAC,KAAK,CAAC,GAAG;YACX,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,WAAW;YACjC,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE;SAC3D,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,6EAA6E;IAC7E,4EAA4E;IAC5E,6EAA6E;IAC7E,0DAA0D;IAC1D,MAAM,aAAa,GAAG;QACpB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;KAC7E,CAAC,IAAI,EAAE,CAAC;IAET,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,yEAAyE;QACzE,uEAAuE;QACvE,2EAA2E;QAC3E,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC,GAAG,EAAE;YACxC,EAAE,EAAE,QAAQ;YACZ,OAAO,EAAE,aAAa;YACtB,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,CAClB,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBAChB,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;gBAClB,OAAO,EAAE,uBAAuB,CAAC,gDAAgD;gBACjF,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC;aAC5B,CAAC,CAAC;SACN,CAAC,CAAC;QACH,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IAED,gEAAgE;IAChE,MAAM,QAAQ,GAAG,MAAM,iBAAiB,CACtC,KAAK,EACL,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,CAAC,EACzD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACnD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1D,CAAC;aAAM,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YAC1B,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QAC/D,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;QAC5D,CAAC;IACH,CAAC;IACD,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,GAAG,CAAC,IAAI,CAAC,GAAG;YACV,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,WAAW;YAChC,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE;SAC3D,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,+BAA+B;IAC/B,MAAM,OAAO,GAA0B,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;QAChE,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,CACL,KAAK,IAAI;YACP,IAAI,EAAE,SAAS;YACf,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,wBAAwB,EAAE;SACtE,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;AAClD,CAAC;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,UAAU,CAAyC;IACvE,IAAI,EAAE,QAAQ;IACd,KAAK,EAAE,aAAa;IACpB,WAAW,EACT,gHAAgH;IAClH,KAAK,EAAE,iBAAiB;IACxB,YAAY,EAAE,KAAK;IACnB,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnB,KAAK,EAAE,QAAQ;QACf,OAAO,EACL,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YACrB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC/B,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ;KAC3C,CAAC;IACF,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;IACtC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,UAAU,GAAG,MAAM,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACjD,qEAAqE;QACrE,4EAA4E;QAC5E,IAAI,qBAAqB,CAAC,UAAU,CAAC;YAAE,OAAO,UAAU,CAAC;QACzD,uEAAuE;QACvE,wEAAwE;QACxE,+BAA+B;QAC/B,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC;QAC7C,MAAM,OAAO,GAAG,cAAc,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACnD,6EAA6E;QAC7E,0EAA0E;QAC1E,mEAAmE;QACnE,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,OAAO;gBACL,UAAU;gBACV,IAAI,EAAE,WAAW,IAAI,EAAE,IAAI,IAAI,EAAE,aAAa,IAAI,IAAI,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,EAAE;gBAC9G,OAAO;aACR,CAAC;QACJ,CAAC;QACD,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,OAAO,IAAI,CAAC;gBAAE,OAAO,GAAG,KAAK,SAAS,CAAC;YAC3C,OAAO,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,UAAU,CAAC;QACtD,CAAC,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QACnF,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,UAAU,CAAC,MAAM,CAAC,GAAG,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC;IAChF,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { InputRequiredResult } from '@modelcontextprotocol/server';\nimport { isInputRequiredResult } from '@modelcontextprotocol/server';\n\nimport { basename } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { processInParallel } from '../core/concurrency.ts';\nimport {\n  ErrorCode,\n  FsError,\n  isFsError,\n  isNodeError,\n  isNotFoundErrno,\n  Problem,\n} from '../core/errors.ts';\nimport { joinRoster, pathLabel } from '../core/fmt.ts';\nimport type { FileType, GuardedFileSystem } from '../core/fs.ts';\nimport {\n  confirmKey,\n  describeRefusal,\n  pendingRoundTrip,\n  readAcceptedChoice,\n} from '../core/input-required.ts';\nimport { resolveEntryType } from '../core/path-utils.ts';\nimport { defaultFalseBoolean, RequiredPath } from '../core/schema.ts';\nimport { PARALLEL_CONCURRENCY } from '../core/util.ts';\nimport { type BatchResult, isTotalFailure, type PerPathResult, summarize } from './batch.ts';\nimport type { ToolCtx } from './define.ts';\nimport { defineTool } from './define.ts';\n\nconst DeleteInputSchema = z.strictObject({\n  paths: z\n    .array(RequiredPath)\n    .min(1)\n    .max(1000)\n    .describe('Paths to delete (max 1000); accepts files, directories, or symlinks'),\n  recursive: defaultFalseBoolean(\n    'Delete directory contents recursively (required for non-empty directories)',\n  ),\n  ignoreIfNotExists: defaultFalseBoolean(\n    'Silently succeed if a path does not exist instead of returning an error',\n  ),\n});\n\ntype DeleteInput = z.infer<typeof DeleteInputSchema>;\ntype DeleteOutput = BatchResult<{ deleted: boolean }>;\ntype DeletePerPathResult = PerPathResult<{ deleted: boolean }>;\n\n// Internal types for error handling\ninterface DeleteFailure {\n  path: string;\n  error: Problem;\n}\n\nconst ERR_NOT_EMPTY = new Error('Directory not empty. Set recursive: true.');\n\nfunction toDeleteFailure(path: string, error: unknown): DeleteFailure {\n  // A missing path reached here as the raw errno text (\"ENOENT: no such file or\n  // directory, lstat 'c:\\...'\"), while `stat` reported the same condition as\n  // \"Path not found\". One condition, one message — and the syscall name stays\n  // off the wire.\n  if (isNotFoundErrno(error)) {\n    return {\n      path,\n      error: Problem.fromUnknown(\n        new FsError(ErrorCode.NOT_FOUND, 'Path not found', path),\n        ErrorCode.NOT_FOUND,\n        path,\n      ),\n    };\n  }\n  if (\n    isNodeError(error) &&\n    (error.code === 'ENOTEMPTY' || error.code === 'EISDIR' || error.code === 'EEXIST')\n  ) {\n    return {\n      path,\n      error: Problem.fromUnknown(ERR_NOT_EMPTY, ErrorCode.INVALID_INPUT, path),\n    };\n  }\n  return { path, error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, path) };\n}\n\ntype LstatResult = Awaited<ReturnType<GuardedFileSystem['lstat']>>;\n\n/** A path's pre-checked plan: validated, statted, and flagged if it needs confirmation. */\ninterface DeletePlan {\n  inputPath: string;\n  validPath: string;\n  itemType: FileType;\n  firstStats: LstatResult;\n  /** Recursive + non-empty directory: needs a round-trip confirmation. */\n  pending: boolean;\n}\n\ntype PlanResult =\n  | { status: 'fail'; failure: DeleteFailure }\n  | { status: 'noop'; deleted: string }\n  | { status: 'plan'; plan: DeletePlan };\n\n/**\n * Phase 1 (no mutation): validate, stat, and decide whether a path needs a\n * confirmation before anything is deleted. A pending path is a recursive\n * non-empty directory; everything else is ready to delete directly.\n */\nasync function planPath(\n  inputPath: string,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  fs: Pick<GuardedFileSystem, 'pathGuard' | 'lstat' | 'hasChildrenUnchecked'>,\n): Promise<PlanResult> {\n  let validPath: string;\n  try {\n    validPath = await fs.pathGuard.validatePathForDelete(inputPath);\n  } catch (error) {\n    if (\n      args.ignoreIfNotExists &&\n      ((isFsError(error) && error.code === ErrorCode.NOT_FOUND) || isNotFoundErrno(error))\n    ) {\n      return { status: 'noop', deleted: inputPath };\n    }\n    return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n  }\n\n  if (fs.pathGuard.isAllowedRoot(validPath)) {\n    return {\n      status: 'fail',\n      // Keyed by the REQUESTED path, like every other failure here: handleDelete\n      // orders results by input path, and a resolved key would not be found for\n      // a relative request.\n      failure: {\n        path: inputPath,\n        error: Problem.accessDenied('Deleting a workspace root directory is not allowed', {\n          path: validPath,\n        }),\n      },\n    };\n  }\n\n  let firstStats: LstatResult;\n  try {\n    firstStats = await fs.lstat(validPath);\n  } catch (error) {\n    if (isNotFoundErrno(error) && args.ignoreIfNotExists) {\n      return { status: 'noop', deleted: inputPath };\n    }\n    return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n  }\n\n  const itemType = resolveEntryType(firstStats.stats);\n  let hasChildren = false;\n  if (args.recursive && itemType === 'directory') {\n    try {\n      hasChildren = await fs.hasChildrenUnchecked(validPath);\n    } catch (error) {\n      return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n    }\n  }\n  const pending = hasChildren;\n  return { status: 'plan', plan: { inputPath, validPath, itemType, firstStats, pending } };\n}\n\nasync function performDeletion(\n  validPath: string,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  isDirectory: boolean,\n  fsOps: Pick<GuardedFileSystem, 'rm' | 'rmdir'>,\n): Promise<void> {\n  if (isDirectory && !args.recursive) {\n    await fsOps.rmdir(validPath);\n  } else {\n    await fsOps.rm(validPath, {\n      recursive: args.recursive,\n      force: args.ignoreIfNotExists,\n    });\n  }\n}\n\n/**\n * Phase 2 (mutation): TOCTOU re-stat against the plan's first stat, then\n * delete. A type or identity change across the confirmation gap fails closed\n * rather than deleting a replacement object the user never confirmed.\n */\nasync function finalizeDeletion(\n  plan: DeletePlan,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  ctx: Pick<ToolCtx, 'fs' | 'log'>,\n): Promise<{ deleted: string } | { failure: DeleteFailure }> {\n  let currentStats: LstatResult;\n  try {\n    currentStats = await ctx.fs.lstat(plan.validPath);\n  } catch (error) {\n    if (isNotFoundErrno(error) && args.ignoreIfNotExists) {\n      return { deleted: plan.validPath };\n    }\n    return { failure: toDeleteFailure(plan.inputPath, error) };\n  }\n\n  const currentItemType = resolveEntryType(currentStats.stats);\n  // Identity comparison, not just the coarse category: a swap during the\n  // confirmation gap (delete original, create a same-named replacement) keeps\n  // the type but changes dev/ino/birthtimeMs. birthtimeMs is the primary\n  // cross-platform signal — dev/ino can read 0 on some non-POSIX drivers — so\n  // combine all three rather than trusting dev/ino alone.\n  const identityChanged =\n    plan.firstStats.stats.dev !== currentStats.stats.dev ||\n    plan.firstStats.stats.ino !== currentStats.stats.ino ||\n    plan.firstStats.stats.birthtimeMs !== currentStats.stats.birthtimeMs;\n  if (plan.itemType !== 'other' && (currentItemType !== plan.itemType || identityChanged)) {\n    return {\n      failure: {\n        path: plan.validPath,\n        error: Problem.invalidInput(\n          `Delete failed: item type changed from ${plan.itemType} to ${currentItemType} during confirmation.`,\n          { path: plan.validPath },\n        ),\n      },\n    };\n  }\n\n  try {\n    await performDeletion(plan.validPath, args, currentStats.stats.isDirectory(), ctx.fs);\n  } catch (error) {\n    return { failure: toDeleteFailure(plan.inputPath, error) };\n  }\n\n  ctx.log('info', `rm: ${plan.inputPath}`, 'delete');\n  return { deleted: plan.validPath };\n}\n\n/**\n * Execute one planned path on the retry round. A pending path deletes only on\n * an accepted `confirm: true`; decline, cancel, or a missing key report\n * `CANCELLED` for that path (R3 proceed, R4/R5 cancelled). A non-pending path\n * deletes directly (R14: non-pending items proceed alongside accepted ones).\n */\nasync function executePlan(\n  plan: DeletePlan,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  ctx: Pick<ToolCtx, 'fs' | 'inputResponses' | 'droppedInputResponseKeys' | 'log'>,\n  pendingSorted: readonly string[],\n): Promise<{ deleted: string } | { failure: DeleteFailure } | { skipped: true; path: string }> {\n  if (plan.pending) {\n    const key = confirmKey(pendingSorted.indexOf(plan.validPath));\n    const choice = readAcceptedChoice(ctx.inputResponses, key);\n    if (choice === 'skip') {\n      return { skipped: true as const, path: plan.validPath };\n    }\n    if (choice !== 'delete') {\n      return {\n        failure: {\n          path: plan.validPath,\n          error: Problem.cancelled(\n            `Delete cancelled: confirmation was ${describeRefusal(ctx, key)}`,\n            { path: plan.validPath },\n          ),\n        },\n      };\n    }\n  }\n  return finalizeDeletion(plan, args, ctx);\n}\n\nasync function handleDelete(\n  args: DeleteInput,\n  ctx: ToolCtx,\n): Promise<DeleteOutput | InputRequiredResult> {\n  // Duplicate paths collapse: results are keyed by path, so a repeated entry\n  // would emit two rows for one deletion and inflate `summary.total`.\n  const paths = [...new Set(args.paths)];\n\n  // Phase 1 (no mutation): plan every path.\n  const planned = await processInParallel(\n    paths,\n    (inputPath) => planPath(inputPath, args, ctx.fs),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  const out = new Array<DeletePerPathResult | undefined>(paths.length).fill(undefined);\n  const plans: { plan: DeletePlan; index: number }[] = [];\n  for (const { index, value: r } of planned.results) {\n    if (r.status === 'fail') out[index] = { path: r.failure.path, error: r.failure.error };\n    else if (r.status === 'noop') out[index] = { path: r.deleted, value: { deleted: true } };\n    else plans.push({ plan: r.plan, index });\n  }\n  for (const { index, error } of planned.errors) {\n    out[index] = {\n      path: paths[index] ?? '(unknown)',\n      error: { code: ErrorCode.UNKNOWN, message: error.message },\n    };\n  }\n\n  // Pending set: recursive + non-empty directories, sorted and de-duplicated.\n  // `buildInputRequired` seals exactly this set into the requestState, and the\n  // retried round recomputes it from the same args so a swapped retry (accept\n  // for X, retry with Y) is rejected — the codec only proves the state was not\n  // tampered, not that it matches the current request (R9).\n  const pendingSorted = [\n    ...new Set(plans.filter((p) => p.plan.pending).map((p) => p.plan.validPath)),\n  ].sort();\n\n  if (pendingSorted.length > 0) {\n    // Round 1 returns input_required (atomic — R14: nothing deleted yet, not\n    // even the non-pending items in the same call); a retry whose verified\n    // state does not bind this pending set throws (R9) via `pendingRoundTrip`.\n    const round = await pendingRoundTrip(ctx, {\n      op: 'delete',\n      pending: pendingSorted,\n      buildInputs: (ps) =>\n        ps.map((p, i) => ({\n          key: confirmKey(i),\n          message: `Permanently delete \"${p}\" and all its contents? This cannot be undone.`,\n          choices: ['delete', 'skip'],\n        })),\n    });\n    if (round !== undefined) return round;\n  }\n\n  // Phase 2 (mutation): execute deletions for every planned path.\n  const executed = await processInParallel(\n    plans,\n    ({ plan }) => executePlan(plan, args, ctx, pendingSorted),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  for (const { index, value: r } of executed.results) {\n    const slot = plans[index]?.index;\n    if (slot === undefined) continue;\n    if ('skipped' in r) {\n      out[slot] = { path: r.path, value: { deleted: false } };\n    } else if ('failure' in r) {\n      out[slot] = { path: r.failure.path, error: r.failure.error };\n    } else {\n      out[slot] = { path: r.deleted, value: { deleted: true } };\n    }\n  }\n  for (const { index, error } of executed.errors) {\n    const slot = plans[index]?.index;\n    if (slot === undefined) continue;\n    out[slot] = {\n      path: paths[slot] ?? '(unknown)',\n      error: { code: ErrorCode.UNKNOWN, message: error.message },\n    };\n  }\n\n  // Emit in the caller's input order so `results[i]` lines up with `paths[i]`\n  // the way read/stat guarantee.\n  const results: DeletePerPathResult[] = paths.map((requested, i) => {\n    const entry = out[i];\n    return (\n      entry ?? {\n        path: requested,\n        error: { code: ErrorCode.UNKNOWN, message: 'Unknown delete failure' },\n      }\n    );\n  });\n\n  return { results, summary: summarize(results) };\n}\n\nexport const DELETE = defineTool<typeof DeleteInputSchema, DeleteOutput>({\n  name: 'delete',\n  title: 'Delete File',\n  description:\n    'Permanently delete files, directories, or symlinks, like rm or rm -r. Paths are exact; globs are not expanded.',\n  input: DeleteInputSchema,\n  readOnlyHint: false,\n  progress: (args) => ({\n    label: 'Delete',\n    subject:\n      args.paths.length === 1\n        ? basename(args.paths[0] ?? '')\n        : `${String(args.paths.length)} paths`,\n  }),\n  accessPaths: (args) => [...args.paths],\n  run: async (args, ctx) => {\n    const structured = await handleDelete(args, ctx);\n    // input_required is a return value, not a completed call: surface it\n    // verbatim so the executor short-circuits before building a CallToolResult.\n    if (isInputRequiredResult(structured)) return structured;\n    // Name every path and its outcome. The old text said \"deleted 2 paths\"\n    // without saying which two, so a partial failure was unreadable without\n    // parsing the structured half.\n    const { failed, total } = structured.summary;\n    const isError = isTotalFailure(structured.summary);\n    // A lone failure carries its reason in the text. \"delete: . FAILED (0/1 ok)\"\n    // made the model re-read structuredContent to learn it was ACCESS_DENIED;\n    // with one path there is no ambiguity about which message applies.\n    if (total === 1 && failed === 1) {\n      const only = structured.results[0];\n      return {\n        structured,\n        text: `delete: ${only?.path ?? ''} FAILED — ${only && 'error' in only ? only.error.message : 'unknown error'}`,\n        isError,\n      };\n    }\n    const tokens = structured.results.map((r) => {\n      const label = pathLabel(r.path);\n      if ('error' in r) return `${label} FAILED`;\n      return r.value.deleted ? label : `${label} SKIPPED`;\n    });\n    const ratio = failed > 0 ? ` (${String(total - failed)}/${String(total)} ok)` : '';\n    return { structured, text: `delete: ${joinRoster(tokens)}${ratio}`, isError };\n  },\n});\n"]}
+{"version":3,"file":"delete.js","sourceRoot":"","sources":["../../src/tools/delete.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAErE,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EACL,SAAS,EACT,OAAO,EACP,SAAS,EACT,WAAW,EACX,eAAe,EACf,OAAO,GACR,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAEvD,OAAO,EACL,UAAU,EACV,eAAe,EAEf,gBAAgB,EAEhB,kBAAkB,GACnB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtE,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAoB,cAAc,EAAsB,SAAS,EAAE,MAAM,YAAY,CAAC;AAE7F,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,iBAAiB,GAAG,CAAC,CAAC,YAAY,CAAC;IACvC,KAAK,EAAE,CAAC;SACL,KAAK,CAAC,YAAY,CAAC;SACnB,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,IAAI,CAAC;SACT,QAAQ,CAAC,qEAAqE,CAAC;IAClF,SAAS,EAAE,mBAAmB,CAC5B,4EAA4E,CAC7E;IACD,iBAAiB,EAAE,mBAAmB,CACpC,yEAAyE,CAC1E;CACF,CAAC,CAAC;AAYH,MAAM,aAAa,GAAG,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;AAE7E,SAAS,eAAe,CAAC,IAAY,EAAE,KAAc;IACnD,8EAA8E;IAC9E,2EAA2E;IAC3E,4EAA4E;IAC5E,gBAAgB;IAChB,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO;YACL,IAAI;YACJ,KAAK,EAAE,OAAO,CAAC,WAAW,CACxB,IAAI,OAAO,CAAC,SAAS,CAAC,SAAS,EAAE,gBAAgB,EAAE,IAAI,CAAC,EACxD,SAAS,CAAC,SAAS,EACnB,IAAI,CACL;SACF,CAAC;IACJ,CAAC;IACD,IACE,WAAW,CAAC,KAAK,CAAC;QAClB,CAAC,KAAK,CAAC,IAAI,KAAK,WAAW,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,EAClF,CAAC;QACD,OAAO;YACL,IAAI;YACJ,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC;SACzE,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;AAC9E,CAAC;AAmBD;;;;GAIG;AACH,KAAK,UAAU,QAAQ,CACrB,SAAiB,EACjB,IAA0D,EAC1D,EAA2E;IAE3E,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC;QACH,SAAS,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAClE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IACE,IAAI,CAAC,iBAAiB;YACtB,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,SAAS,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,EACpF,CAAC;YACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;QAChD,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,IAAI,EAAE,CAAC,SAAS,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,CAAC;QAC1C,OAAO;YACL,MAAM,EAAE,MAAM;YACd,2EAA2E;YAC3E,0EAA0E;YAC1E,sBAAsB;YACtB,OAAO,EAAE;gBACP,IAAI,EAAE,SAAS;gBACf,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,oDAAoD,EAAE;oBAChF,IAAI,EAAE,SAAS;iBAChB,CAAC;aACH;SACF,CAAC;IACJ,CAAC;IAED,IAAI,UAAuB,CAAC;IAC5B,IAAI,CAAC;QACH,UAAU,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACzC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,eAAe,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACrD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;QAChD,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,MAAM,QAAQ,GAAG,gBAAgB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACpD,IAAI,WAAW,GAAG,KAAK,CAAC;IACxB,IAAI,IAAI,CAAC,SAAS,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,WAAW,GAAG,MAAM,EAAE,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QACzD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;QACxE,CAAC;IACH,CAAC;IACD,OAAO;QACL,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,WAAW,EAAE;KAC3E,CAAC;AACJ,CAAC;AAID,iGAAiG;AACjG,MAAM,YAAY,GAAG,CAAC,CAAW,EAAE,CAAW,EAAW,EAAE,CACzD,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW,CAAC;AAExE;;;;GAIG;AACH,KAAK,UAAU,gBAAgB,CAC7B,IAAgB,EAChB,IAA0D,EAC1D,GAAgC;IAEhC,IAAI,YAAyB,CAAC;IAC9B,IAAI,CAAC;QACH,YAAY,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,eAAe,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACrD,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;QACrC,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IAC7D,CAAC;IAED,MAAM,eAAe,GAAG,gBAAgB,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAC7D,uEAAuE;IACvE,4EAA4E;IAC5E,uEAAuE;IACvE,4EAA4E;IAC5E,wDAAwD;IACxD,MAAM,eAAe,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC;IACjF,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC,QAAQ,IAAI,eAAe,CAAC,EAAE,CAAC;QACxF,OAAO;YACL,OAAO,EAAE;gBACP,IAAI,EAAE,IAAI,CAAC,SAAS;gBACpB,KAAK,EAAE,OAAO,CAAC,YAAY,CACzB,yCAAyC,IAAI,CAAC,QAAQ,OAAO,eAAe,uBAAuB,EACnG,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CACzB;aACF;SACF,CAAC;IACJ,CAAC;IAED,IAAI,CAAC;QACH,IAAI,YAAY,CAAC,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS;YAAE,MAAM,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;;YAE1F,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC;IAClG,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,OAAO,EAAE,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;IAC7D,CAAC;IAED,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,SAAS,EAAE,EAAE,QAAQ,CAAC,CAAC;IACnD,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;AACrC,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,WAAW,CACxB,IAAgB,EAChB,IAA0D,EAC1D,GAAgF,EAChF,aAAgC,EAChC,iBAA2C;IAE3C,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,UAAU,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QAC3D,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,OAAO,EAAE,OAAO,EAAE,IAAa,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;YACxB,OAAO;gBACL,OAAO,EAAE;oBACP,IAAI,EAAE,IAAI,CAAC,SAAS;oBACpB,KAAK,EAAE,OAAO,CAAC,SAAS,CACtB,sCAAsC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EACjE,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CACzB;iBACF;aACF,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,iBAAiB,EAAE,gBAAgB,EAAE,IAAI,CACxD,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,SAAS,CACzC,CAAC;QACF,IAAI,QAAQ,EAAE,QAAQ,KAAK,IAAI,CAAC,QAAQ,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3F,OAAO;gBACL,OAAO,EAAE;oBACP,IAAI,EAAE,IAAI,CAAC,SAAS;oBACpB,KAAK,EAAE,OAAO,CAAC,YAAY,CACzB,2EAA2E,EAC3E,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CACzB;iBACF;aACF,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAC3C,CAAC;AAED,KAAK,UAAU,YAAY,CACzB,IAAiB,EACjB,GAAY;IAEZ,2EAA2E;IAC3E,oEAAoE;IACpE,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEvC,0CAA0C;IAC1C,MAAM,OAAO,GAAG,MAAM,iBAAiB,CACrC,KAAK,EACL,CAAC,SAAS,EAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,EAChD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,MAAM,GAAG,GAAG,IAAI,KAAK,CAAkC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACrF,MAAM,KAAK,GAA0C,EAAE,CAAC;IACxD,MAAM,iBAAiB,GAAG,GAAG,CAAC,YAAY,EAAE,EAAgB,CAAC;IAC7D,MAAM,sBAAsB,GAAG,IAAI,GAAG,CACpC,iBAAiB,EAAE,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAClE,CAAC;IACF,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QAClD,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;aAClF,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;aACpF,CAAC;YACJ,qEAAqE;YACrE,0EAA0E;YAC1E,CAAC,CAAC,IAAI,CAAC,OAAO,KAAK,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAChE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9C,GAAG,CAAC,KAAK,CAAC,GAAG;YACX,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,WAAW;YACjC,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE;SAC3D,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,6EAA6E;IAC7E,4EAA4E;IAC5E,6EAA6E;IAC7E,0DAA0D;IAC1D,MAAM,aAAa,GAAG;QACpB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;KAC7E,CAAC,IAAI,EAAE,CAAC;IAET,4EAA4E;IAC5E,yEAAyE;IACzE,gDAAgD;IAChD,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,iBAAiB,EAAE,EAAE,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;QACzF,yEAAyE;QACzE,uEAAuE;QACvE,2EAA2E;QAC3E,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC,GAAG,EAAE;YACxC,EAAE,EAAE,QAAQ;YACZ,OAAO,EAAE,aAAa;YACtB,gBAAgB,EAAE,KAAK;iBACpB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC;iBAClC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAyB,EAAE;gBACvC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;gBACxD,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC;YAClF,CAAC,CAAC;YACJ,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,CAClB,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBAChB,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;gBAClB,OAAO,EAAE,uBAAuB,CAAC,gDAAgD;gBACjF,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC;aAC5B,CAAC,CAAC;SACN,CAAC,CAAC;QACH,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IAED,gEAAgE;IAChE,MAAM,QAAQ,GAAG,MAAM,iBAAiB,CACtC,KAAK,EACL,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,iBAAiB,CAAC,EAC5E,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACnD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YACnB,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1D,CAAC;aAAM,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;YAC1B,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QAC/D,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;QAC5D,CAAC;IACH,CAAC;IACD,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,GAAG,CAAC,IAAI,CAAC,GAAG;YACV,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,WAAW;YAChC,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE;SAC3D,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,+BAA+B;IAC/B,MAAM,OAAO,GAA0B,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;QAChE,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,CACL,KAAK,IAAI;YACP,IAAI,EAAE,SAAS;YACf,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,wBAAwB,EAAE;SACtE,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;AAClD,CAAC;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,UAAU,CAAyC;IACvE,IAAI,EAAE,QAAQ;IACd,KAAK,EAAE,aAAa;IACpB,WAAW,EACT,gHAAgH;IAClH,KAAK,EAAE,iBAAiB;IACxB,YAAY,EAAE,KAAK;IACnB,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnB,KAAK,EAAE,QAAQ;QACf,OAAO,EACL,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YACrB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC/B,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ;KAC3C,CAAC;IACF,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;IACtC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,UAAU,GAAG,MAAM,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACjD,qEAAqE;QACrE,4EAA4E;QAC5E,IAAI,qBAAqB,CAAC,UAAU,CAAC;YAAE,OAAO,UAAU,CAAC;QACzD,uEAAuE;QACvE,wEAAwE;QACxE,+BAA+B;QAC/B,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC;QAC7C,MAAM,OAAO,GAAG,cAAc,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACnD,6EAA6E;QAC7E,0EAA0E;QAC1E,mEAAmE;QACnE,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,OAAO;gBACL,UAAU;gBACV,IAAI,EAAE,WAAW,IAAI,EAAE,IAAI,IAAI,EAAE,aAAa,IAAI,IAAI,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,EAAE;gBAC9G,OAAO;aACR,CAAC;QACJ,CAAC;QACD,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,OAAO,IAAI,CAAC;gBAAE,OAAO,GAAG,KAAK,SAAS,CAAC;YAC3C,OAAO,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,UAAU,CAAC;QACtD,CAAC,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QACnF,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,UAAU,CAAC,MAAM,CAAC,GAAG,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC;IAChF,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { InputRequiredResult } from '@modelcontextprotocol/server';\nimport { isInputRequiredResult } from '@modelcontextprotocol/server';\n\nimport { basename } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { processInParallel } from '../core/concurrency.ts';\nimport {\n  ErrorCode,\n  FsError,\n  isFsError,\n  isNodeError,\n  isNotFoundErrno,\n  Problem,\n} from '../core/errors.ts';\nimport { joinRoster, pathLabel } from '../core/fmt.ts';\nimport type { FileType, GuardedFileSystem } from '../core/fs.ts';\nimport {\n  confirmKey,\n  describeRefusal,\n  type PendingDeleteIdentity,\n  pendingRoundTrip,\n  type PendingState,\n  readAcceptedChoice,\n} from '../core/input-required.ts';\nimport { resolveEntryType } from '../core/path-utils.ts';\nimport { defaultFalseBoolean, RequiredPath } from '../core/schema.ts';\nimport { PARALLEL_CONCURRENCY } from '../core/util.ts';\nimport { type BatchResult, isTotalFailure, type PerPathResult, summarize } from './batch.ts';\nimport type { ToolCtx } from './define.ts';\nimport { defineTool } from './define.ts';\n\nconst DeleteInputSchema = z.strictObject({\n  paths: z\n    .array(RequiredPath)\n    .min(1)\n    .max(1000)\n    .describe('Paths to delete (max 1000); accepts files, directories, or symlinks'),\n  recursive: defaultFalseBoolean(\n    'Delete directory contents recursively (required for non-empty directories)',\n  ),\n  ignoreIfNotExists: defaultFalseBoolean(\n    'Silently succeed if a path does not exist instead of returning an error',\n  ),\n});\n\ntype DeleteInput = z.infer<typeof DeleteInputSchema>;\ntype DeleteOutput = BatchResult<{ deleted: boolean }>;\ntype DeletePerPathResult = PerPathResult<{ deleted: boolean }>;\n\n// Internal types for error handling\ninterface DeleteFailure {\n  path: string;\n  error: Problem;\n}\n\nconst ERR_NOT_EMPTY = new Error('Directory not empty. Set recursive: true.');\n\nfunction toDeleteFailure(path: string, error: unknown): DeleteFailure {\n  // A missing path reached here as the raw errno text (\"ENOENT: no such file or\n  // directory, lstat 'c:\\...'\"), while `stat` reported the same condition as\n  // \"Path not found\". One condition, one message — and the syscall name stays\n  // off the wire.\n  if (isNotFoundErrno(error)) {\n    return {\n      path,\n      error: Problem.fromUnknown(\n        new FsError(ErrorCode.NOT_FOUND, 'Path not found', path),\n        ErrorCode.NOT_FOUND,\n        path,\n      ),\n    };\n  }\n  if (\n    isNodeError(error) &&\n    (error.code === 'ENOTEMPTY' || error.code === 'EISDIR' || error.code === 'EEXIST')\n  ) {\n    return {\n      path,\n      error: Problem.fromUnknown(ERR_NOT_EMPTY, ErrorCode.INVALID_INPUT, path),\n    };\n  }\n  return { path, error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, path) };\n}\n\ntype LstatResult = Awaited<ReturnType<GuardedFileSystem['lstat']>>;\n\n/** A path's pre-checked plan: validated, statted, and flagged if it needs confirmation. */\ninterface DeletePlan {\n  inputPath: string;\n  validPath: string;\n  itemType: FileType;\n  firstStats: LstatResult;\n  /** Recursive + non-empty directory: needs a round-trip confirmation. */\n  pending: boolean;\n}\n\ntype PlanResult =\n  | { status: 'fail'; failure: DeleteFailure }\n  | { status: 'noop'; deleted: string }\n  | { status: 'plan'; plan: DeletePlan };\n\n/**\n * Phase 1 (no mutation): validate, stat, and decide whether a path needs a\n * confirmation before anything is deleted. A pending path is a recursive\n * non-empty directory; everything else is ready to delete directly.\n */\nasync function planPath(\n  inputPath: string,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  fs: Pick<GuardedFileSystem, 'pathGuard' | 'lstat' | 'hasChildrenUnchecked'>,\n): Promise<PlanResult> {\n  let validPath: string;\n  try {\n    validPath = await fs.pathGuard.validatePathForDelete(inputPath);\n  } catch (error) {\n    if (\n      args.ignoreIfNotExists &&\n      ((isFsError(error) && error.code === ErrorCode.NOT_FOUND) || isNotFoundErrno(error))\n    ) {\n      return { status: 'noop', deleted: inputPath };\n    }\n    return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n  }\n\n  if (fs.pathGuard.isAllowedRoot(validPath)) {\n    return {\n      status: 'fail',\n      // Keyed by the REQUESTED path, like every other failure here: handleDelete\n      // orders results by input path, and a resolved key would not be found for\n      // a relative request.\n      failure: {\n        path: inputPath,\n        error: Problem.accessDenied('Deleting a workspace root directory is not allowed', {\n          path: validPath,\n        }),\n      },\n    };\n  }\n\n  let firstStats: LstatResult;\n  try {\n    firstStats = await fs.lstat(validPath);\n  } catch (error) {\n    if (isNotFoundErrno(error) && args.ignoreIfNotExists) {\n      return { status: 'noop', deleted: inputPath };\n    }\n    return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n  }\n\n  const itemType = resolveEntryType(firstStats.stats);\n  let hasChildren = false;\n  if (args.recursive && itemType === 'directory') {\n    try {\n      hasChildren = await fs.hasChildrenUnchecked(validPath);\n    } catch (error) {\n      return { status: 'fail', failure: toDeleteFailure(inputPath, error) };\n    }\n  }\n  return {\n    status: 'plan',\n    plan: { inputPath, validPath, itemType, firstStats, pending: hasChildren },\n  };\n}\n\ntype Identity = Pick<LstatResult['stats'], 'dev' | 'ino' | 'birthtimeMs'>;\n\n/** Same filesystem object. birthtimeMs joins dev/ino, which read 0 on some non-POSIX drivers. */\nconst sameIdentity = (a: Identity, b: Identity): boolean =>\n  a.dev === b.dev && a.ino === b.ino && a.birthtimeMs === b.birthtimeMs;\n\n/**\n * Phase 2 (mutation): TOCTOU re-stat against the plan's first stat, then\n * delete. A type or identity change across the confirmation gap fails closed\n * rather than deleting a replacement object the user never confirmed.\n */\nasync function finalizeDeletion(\n  plan: DeletePlan,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  ctx: Pick<ToolCtx, 'fs' | 'log'>,\n): Promise<{ deleted: string } | { failure: DeleteFailure }> {\n  let currentStats: LstatResult;\n  try {\n    currentStats = await ctx.fs.lstat(plan.validPath);\n  } catch (error) {\n    if (isNotFoundErrno(error) && args.ignoreIfNotExists) {\n      return { deleted: plan.validPath };\n    }\n    return { failure: toDeleteFailure(plan.inputPath, error) };\n  }\n\n  const currentItemType = resolveEntryType(currentStats.stats);\n  // Identity comparison, not just the coarse category: a swap during the\n  // confirmation gap (delete original, create a same-named replacement) keeps\n  // the type but changes dev/ino/birthtimeMs. birthtimeMs is the primary\n  // cross-platform signal — dev/ino can read 0 on some non-POSIX drivers — so\n  // combine all three rather than trusting dev/ino alone.\n  const identityChanged = !sameIdentity(plan.firstStats.stats, currentStats.stats);\n  if (plan.itemType !== 'other' && (currentItemType !== plan.itemType || identityChanged)) {\n    return {\n      failure: {\n        path: plan.validPath,\n        error: Problem.invalidInput(\n          `Delete failed: item type changed from ${plan.itemType} to ${currentItemType} during confirmation.`,\n          { path: plan.validPath },\n        ),\n      },\n    };\n  }\n\n  try {\n    if (currentStats.stats.isDirectory() && !args.recursive) await ctx.fs.rmdir(plan.validPath);\n    else\n      await ctx.fs.rm(plan.validPath, { recursive: args.recursive, force: args.ignoreIfNotExists });\n  } catch (error) {\n    return { failure: toDeleteFailure(plan.inputPath, error) };\n  }\n\n  ctx.log('info', `rm: ${plan.inputPath}`, 'delete');\n  return { deleted: plan.validPath };\n}\n\n/**\n * Execute one planned path on the retry round. A pending path deletes only on\n * an accepted `confirm: true`; decline, cancel, or a missing key report\n * `CANCELLED` for that path (R3 proceed, R4/R5 cancelled). A non-pending path\n * deletes directly (R14: non-pending items proceed alongside accepted ones).\n */\nasync function executePlan(\n  plan: DeletePlan,\n  args: Pick<DeleteInput, 'recursive' | 'ignoreIfNotExists'>,\n  ctx: Pick<ToolCtx, 'fs' | 'inputResponses' | 'droppedInputResponseKeys' | 'log'>,\n  pendingSorted: readonly string[],\n  confirmationState: PendingState | undefined,\n): Promise<{ deleted: string } | { failure: DeleteFailure } | { skipped: true; path: string }> {\n  if (plan.pending) {\n    const key = confirmKey(pendingSorted.indexOf(plan.validPath));\n    const choice = readAcceptedChoice(ctx.inputResponses, key);\n    if (choice === 'skip') {\n      return { skipped: true as const, path: plan.validPath };\n    }\n    if (choice !== 'delete') {\n      return {\n        failure: {\n          path: plan.validPath,\n          error: Problem.cancelled(\n            `Delete cancelled: confirmation was ${describeRefusal(ctx, key)}`,\n            { path: plan.validPath },\n          ),\n        },\n      };\n    }\n    const identity = confirmationState?.deleteIdentities?.find(\n      (entry) => entry.path === plan.validPath,\n    );\n    if (identity?.itemType !== plan.itemType || !sameIdentity(identity, plan.firstStats.stats)) {\n      return {\n        failure: {\n          path: plan.validPath,\n          error: Problem.invalidInput(\n            'Delete failed: item identity changed or is missing from the confirmation.',\n            { path: plan.validPath },\n          ),\n        },\n      };\n    }\n  }\n  return finalizeDeletion(plan, args, ctx);\n}\n\nasync function handleDelete(\n  args: DeleteInput,\n  ctx: ToolCtx,\n): Promise<DeleteOutput | InputRequiredResult> {\n  // Duplicate paths collapse: results are keyed by path, so a repeated entry\n  // would emit two rows for one deletion and inflate `summary.total`.\n  const paths = [...new Set(args.paths)];\n\n  // Phase 1 (no mutation): plan every path.\n  const planned = await processInParallel(\n    paths,\n    (inputPath) => planPath(inputPath, args, ctx.fs),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  const out = new Array<DeletePerPathResult | undefined>(paths.length).fill(undefined);\n  const plans: { plan: DeletePlan; index: number }[] = [];\n  const confirmationState = ctx.requestState?.<PendingState>();\n  const previouslyPendingPaths = new Set(\n    confirmationState?.op === 'delete' ? confirmationState.paths : [],\n  );\n  for (const { index, value: r } of planned.results) {\n    if (r.status === 'fail') out[index] = { path: r.failure.path, error: r.failure.error };\n    else if (r.status === 'noop') out[index] = { path: r.deleted, value: { deleted: true } };\n    else {\n      // Emptying a directory while its prompt is open must not discard the\n      // answer. Keep that path pending so the verified retry still honors skip.\n      r.plan.pending ||= previouslyPendingPaths.has(r.plan.validPath);\n      plans.push({ plan: r.plan, index });\n    }\n  }\n  for (const { index, error } of planned.errors) {\n    out[index] = {\n      path: paths[index] ?? '(unknown)',\n      error: { code: ErrorCode.UNKNOWN, message: error.message },\n    };\n  }\n\n  // Pending set: recursive + non-empty directories, sorted and de-duplicated.\n  // `buildInputRequired` seals exactly this set into the requestState, and the\n  // retried round recomputes it from the same args so a swapped retry (accept\n  // for X, retry with Y) is rejected — the codec only proves the state was not\n  // tampered, not that it matches the current request (R9).\n  const pendingSorted = [\n    ...new Set(plans.filter((p) => p.plan.pending).map((p) => p.plan.validPath)),\n  ].sort();\n\n  // With no actionable plans, preserve per-path NOT_FOUND / ignoreIfNotExists\n  // results. Otherwise even an empty pending set must be checked before an\n  // unrelated non-pending batch entry can mutate.\n  if (pendingSorted.length > 0 || (confirmationState?.op === 'delete' && plans.length > 0)) {\n    // Round 1 returns input_required (atomic — R14: nothing deleted yet, not\n    // even the non-pending items in the same call); a retry whose verified\n    // state does not bind this pending set throws (R9) via `pendingRoundTrip`.\n    const round = await pendingRoundTrip(ctx, {\n      op: 'delete',\n      pending: pendingSorted,\n      deleteIdentities: plans\n        .filter(({ plan }) => plan.pending)\n        .map(({ plan }): PendingDeleteIdentity => {\n          const { dev, ino, birthtimeMs } = plan.firstStats.stats;\n          return { path: plan.validPath, itemType: plan.itemType, dev, ino, birthtimeMs };\n        }),\n      buildInputs: (ps) =>\n        ps.map((p, i) => ({\n          key: confirmKey(i),\n          message: `Permanently delete \"${p}\" and all its contents? This cannot be undone.`,\n          choices: ['delete', 'skip'],\n        })),\n    });\n    if (round !== undefined) return round;\n  }\n\n  // Phase 2 (mutation): execute deletions for every planned path.\n  const executed = await processInParallel(\n    plans,\n    ({ plan }) => executePlan(plan, args, ctx, pendingSorted, confirmationState),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  for (const { index, value: r } of executed.results) {\n    const slot = plans[index]?.index;\n    if (slot === undefined) continue;\n    if ('skipped' in r) {\n      out[slot] = { path: r.path, value: { deleted: false } };\n    } else if ('failure' in r) {\n      out[slot] = { path: r.failure.path, error: r.failure.error };\n    } else {\n      out[slot] = { path: r.deleted, value: { deleted: true } };\n    }\n  }\n  for (const { index, error } of executed.errors) {\n    const slot = plans[index]?.index;\n    if (slot === undefined) continue;\n    out[slot] = {\n      path: paths[slot] ?? '(unknown)',\n      error: { code: ErrorCode.UNKNOWN, message: error.message },\n    };\n  }\n\n  // Emit in the caller's input order so `results[i]` lines up with `paths[i]`\n  // the way read/stat guarantee.\n  const results: DeletePerPathResult[] = paths.map((requested, i) => {\n    const entry = out[i];\n    return (\n      entry ?? {\n        path: requested,\n        error: { code: ErrorCode.UNKNOWN, message: 'Unknown delete failure' },\n      }\n    );\n  });\n\n  return { results, summary: summarize(results) };\n}\n\nexport const DELETE = defineTool<typeof DeleteInputSchema, DeleteOutput>({\n  name: 'delete',\n  title: 'Delete File',\n  description:\n    'Permanently delete files, directories, or symlinks, like rm or rm -r. Paths are exact; globs are not expanded.',\n  input: DeleteInputSchema,\n  readOnlyHint: false,\n  progress: (args) => ({\n    label: 'Delete',\n    subject:\n      args.paths.length === 1\n        ? basename(args.paths[0] ?? '')\n        : `${String(args.paths.length)} paths`,\n  }),\n  accessPaths: (args) => [...args.paths],\n  run: async (args, ctx) => {\n    const structured = await handleDelete(args, ctx);\n    // input_required is a return value, not a completed call: surface it\n    // verbatim so the executor short-circuits before building a CallToolResult.\n    if (isInputRequiredResult(structured)) return structured;\n    // Name every path and its outcome. The old text said \"deleted 2 paths\"\n    // without saying which two, so a partial failure was unreadable without\n    // parsing the structured half.\n    const { failed, total } = structured.summary;\n    const isError = isTotalFailure(structured.summary);\n    // A lone failure carries its reason in the text. \"delete: . FAILED (0/1 ok)\"\n    // made the model re-read structuredContent to learn it was ACCESS_DENIED;\n    // with one path there is no ambiguity about which message applies.\n    if (total === 1 && failed === 1) {\n      const only = structured.results[0];\n      return {\n        structured,\n        text: `delete: ${only?.path ?? ''} FAILED — ${only && 'error' in only ? only.error.message : 'unknown error'}`,\n        isError,\n      };\n    }\n    const tokens = structured.results.map((r) => {\n      const label = pathLabel(r.path);\n      if ('error' in r) return `${label} FAILED`;\n      return r.value.deleted ? label : `${label} SKIPPED`;\n    });\n    const ratio = failed > 0 ? ` (${String(total - failed)}/${String(total)} ok)` : '';\n    return { structured, text: `delete: ${joinRoster(tokens)}${ratio}`, isError };\n  },\n});\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"edit.d.ts","sourceRoot":"","sources":["../../src/tools/edit.ts"],"names":[],"mappings":"AAueA,eAAO,MAAM,IAAI,mCA0Df,CAAC"}
+{"version":3,"file":"edit.d.ts","sourceRoot":"","sources":["../../src/tools/edit.ts"],"names":[],"mappings":"AAucA,eAAO,MAAM,IAAI,mCAwDf,CAAC"}

package/dist/tools/edit.js

@@ -5,18 +5,13 @@ import { ErrorCode, FsError } from "../core/errors.js";
 import { buildWrittenFileMeta } from "../core/file-uri.js";
 import { joinRoster, truncateProgressPattern } from "../core/fmt.js";
 import { isSamePath } from "../core/path-utils.js";
-import { defaultFalseBoolean, isBlank, RequiredPath, singleOrBatchAccessPaths, } from "../core/schema.js";
+import { defaultFalseBoolean, nonBlankString, RequiredPath, singleOrBatchAccessPaths, } from "../core/schema.js";
 import { compileRegex, execMatches, freeRegex } from "../core/search.js";
 import { escapeRegExp } from "../core/util.js";
 import { isTotalFailure, runOverPaths } from "./batch.js";
 import { defineTool } from "./define.js";
 const EditSpecSchema = z.strictObject({
-    oldText: z
-        .string()
-        .min(1, 'oldText required')
-        .refine((val) => !isBlank(val), {
-        message: 'oldText cannot be empty or whitespace-only',
-    })
+    oldText: nonBlankString('oldText')
         .describe('Exact literal text to locate in the file; it must match exactly once. Include 3-5 lines of context so it does — an oldText found in several places fails with their line numbers.')
         .meta({ examples: ['const x = 1;', 'function oldName('] }),
     newText: z
@@ -233,25 +228,6 @@ function ambiguousEditError(content, found, editIndex, shifted) {
     return new FsError(ErrorCode.INVALID_INPUT, `edits[${String(editIndex)}]: oldText matches ${count} places${where} ` +
         `(${label} ${lines.join(', ')}${more}). Add surrounding lines so it matches once.`);
 }
-function buildEditFileValue(validPath, meta, modified, result) {
-    return {
-        path: validPath,
-        size: meta.size,
-        lineCount: meta.lineCount,
-        mimeType: meta.mimeType,
-        kind: meta.kind,
-        ...(meta.resourceUri !== undefined ? { resourceUri: meta.resourceUri } : {}),
-        modified,
-        appliedEdits: result.appliedEdits,
-        ...(result.appliedEdits > 0 &&
-            result.linesAdded !== undefined &&
-            result.linesRemoved !== undefined
-            ? { linesAdded: result.linesAdded, linesRemoved: result.linesRemoved }
-            : {}),
-        ...(result.unmatchedEdits.length > 0 ? { unmatchedEdits: result.unmatchedEdits } : {}),
-        ...(result.diff ? { diff: result.diff } : {}),
-    };
-}
 // A file whose every newline is CRLF gets LF-only edit text converted to match
 // — the rule jsdiff's autoConvertLineEndings applies for `patch`. Range, head
 // and tail reads strip `\r`, so the oldText a model sends is LF-only; text that
@@ -289,12 +265,6 @@ function applyEdits(content, edits, ignoreWhitespace) {
     }
     return { content: newContent, appliedEdits, unmatchedEdits };
 }
-async function handleEditFile(filePath, edits, options, ctx) {
-    // A dry run never writes, so it needs no lock.
-    if (options.dryRun)
-        return editOnce(filePath, edits, options, ctx);
-    return ctx.fs.lockForWrite(filePath, () => editOnce(filePath, edits, options, ctx));
-}
 async function editOnce(filePath, edits, options, ctx) {
     const { validPath, content } = await ctx.fs.readEditableText(filePath, {
         signal: ctx.signal,
@@ -334,9 +304,24 @@ async function editOnce(filePath, edits, options, ctx) {
         dryRun: options.dryRun,
         lastModified: modified,
     });
+    const { resourceLink, ...fileMeta } = meta;
     return {
-        file: buildEditFileValue(validPath, meta, modified, editResult),
-        ...(meta.resourceLink ? { resourceLink: meta.resourceLink } : {}),
+        file: {
+            path: validPath,
+            ...fileMeta,
+            modified,
+            appliedEdits: editResult.appliedEdits,
+            ...(editResult.appliedEdits > 0 &&
+                editResult.linesAdded !== undefined &&
+                editResult.linesRemoved !== undefined
+                ? { linesAdded: editResult.linesAdded, linesRemoved: editResult.linesRemoved }
+                : {}),
+            ...(editResult.unmatchedEdits.length > 0
+                ? { unmatchedEdits: editResult.unmatchedEdits }
+                : {}),
+            ...(editResult.diff ? { diff: editResult.diff } : {}),
+        },
+        ...(resourceLink ? { resourceLink } : {}),
     };
 }
 function formatEditSummary(results, dryRun) {
@@ -398,11 +383,11 @@ export const EDIT = defineTool({
     accessPaths: singleOrBatchAccessPaths,
     run: async (args, ctx) => {
         const items = args.path !== undefined ? [{ path: args.path, edits: args.edits ?? [] }] : (args.files ?? []);
-        const options = {
-            dryRun: args.dryRun,
-            ignoreWhitespace: args.ignoreWhitespace,
-        };
-        const batch = await runOverPaths(items, ctx, ErrorCode.UNKNOWN, ({ path, edits }) => handleEditFile(path, edits, options, ctx));
+        const batch = await runOverPaths(items, ctx, ErrorCode.UNKNOWN, ({ path, edits }) => 
+        // A dry run never writes, so it needs no lock.
+        args.dryRun
+            ? editOnce(path, edits, args, ctx)
+            : ctx.fs.lockForWrite(path, () => editOnce(path, edits, args, ctx)));
         const perPathResults = [];
         const resourceLinks = [];
         for (const r of batch.results) {

package/dist/tools/edit.js.map

@@ -1 +1 @@
-{"version":3,"file":"edit.js","sourceRoot":"","sources":["../../src/tools/edit.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACnE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAE,oBAAoB,EAAwB,MAAM,qBAAqB,CAAC;AACjF,OAAO,EAAE,UAAU,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AACrE,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EACL,mBAAmB,EACnB,OAAO,EACP,YAAY,EACZ,wBAAwB,GACzB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AACzE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAoB,cAAc,EAAsB,YAAY,EAAE,MAAM,YAAY,CAAC;AAChG,OAAO,EAAE,UAAU,EAAgB,MAAM,aAAa,CAAC;AAEvD,MAAM,cAAc,GAAG,CAAC,CAAC,YAAY,CAAC;IACpC,OAAO,EAAE,CAAC;SACP,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,EAAE,kBAAkB,CAAC;SAC1B,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QAC9B,OAAO,EAAE,4CAA4C;KACtD,CAAC;SACD,QAAQ,CACP,mLAAmL,CACpL;SACA,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,cAAc,EAAE,mBAAmB,CAAC,EAAE,CAAC;IAC5D,OAAO,EAAE,CAAC;SACP,MAAM,EAAE;SACR,QAAQ,CAAC,sEAAsE,CAAC;SAChF,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,cAAc,EAAE,mBAAmB,EAAE,EAAE,CAAC,EAAE,CAAC;CACjE,CAAC,CAAC;AACH,+EAA+E;AAC/E,uEAAuE;AACvE,2EAA2E;AAC3E,0EAA0E;AAE1E,MAAM,eAAe,GAAG,CAAC,CAAC;AAC1B,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAE/B,MAAM,mBAAmB,GAAG,CAAC;KAC1B,YAAY,CAAC;IACZ,IAAI,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,iDAAiD,CAAC;IACzF,KAAK,EAAE,CAAC;SACL,KAAK,CAAC,cAAc,CAAC;SACrB,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,kBAAkB,CAAC;SACvB,QAAQ,EAAE;SACV,QAAQ,CAAC,4DAA4D,CAAC;IACzE,KAAK,EAAE,CAAC;SACL,KAAK,CACJ,CAAC,CAAC,YAAY,CAAC;QACb,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,CAAC;aACL,KAAK,CAAC,cAAc,CAAC;aACrB,GAAG,CAAC,CAAC,CAAC;aACN,GAAG,CAAC,kBAAkB,CAAC;aACvB,QAAQ,CAAC,6CAA6C,CAAC;KAC3D,CAAC,CACH;SACA,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,eAAe,CAAC;SACpB,QAAQ,EAAE;SACV,QAAQ,CAAC,+BAA+B,CAAC;IAC5C,MAAM,EAAE,mBAAmB,CACzB,sEAAsE,CACvE;IACD,gBAAgB,EAAE,mBAAmB,CACnC,sEAAsE,CACvE;CACF,CAAC;KACD,WAAW,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;IAC1B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;IACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC;IAC3C,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;QACzB,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EAAE,0CAA0C;YACnD,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QACzC,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,OAAO,CAAC;YACf,OAAO,EAAE,oCAAoC;YAC7C,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,QAAQ,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC1C,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,OAAO,CAAC;YACf,OAAO,EAAE,mEAAmE;YAC5E,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,yEAAyE;IACzE,2EAA2E;IAC3E,sDAAsD;IACtD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5E,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;YAClB,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC;gBAC9B,OAAO,EAAE,sBAAsB,MAAM,CAAC,KAAK,CAAC,uDAAuD;gBACnG,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC,CAAC;IACF,8EAA8E;IAC9E,gFAAgF;IAChF,wEAAwE;IACxE,qDAAqD;KACpD,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AA2B/E,MAAM,wBAAwB,GAAG,CAAC,CAAC;AAWnC;;;;;;;;GAQG;AACH,SAAS,iBAAiB,CAAC,KAAa,EAAE,IAA6C;IACrF,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ;QAAE,OAAO,8BAA8B,CAAC;IAC3E,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,qBAAqB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC;IACpD,6EAA6E;IAC7E,OAAO,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,YAAY,CAAC;AAC9E,CAAC;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,OAAe,EAAE,OAAe,EAAE,gBAAyB;IAClF,MAAM,KAAK,GAAgB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IACxF,wEAAwE;IACxE,wEAAwE;IACxE,iEAAiE;IACjE,MAAM,GAAG,GAAG,CAAC,UAAkB,EAAE,MAAc,EAAW,EAAE;QAC1D,KAAK,CAAC,KAAK,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;QACvC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;QACjB,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,wBAAwB;YAAE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAClF,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,GAAG,wBAAwB,CAAC;QACzD,OAAO,KAAK,CAAC,SAAS,CAAC;IACzB,CAAC,CAAC;IAEF,IAAI,gBAAgB,EAAE,CAAC;QACrB,sEAAsE;QACtE,2EAA2E;QAC3E,wEAAwE;QACxE,2EAA2E;QAC3E,yEAAyE;QACzE,wEAAwE;QACxE,wEAAwE;QACxE,uEAAuE;QACvE,gDAAgD;QAChD,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,KAAK,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChB,OAAO,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC;iBAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,OAAO,IAAI,iBAAiB,CAAC,KAAK,EAAE;oBAClC,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE;oBACpC,QAAQ,EAAE,CAAC,KAAK,IAAI,GAAG,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE;iBAChD,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;gBAC9E,OAAO,IAAI,YAAY,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,YAAY,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QAC7D,IAAI,CAAC;YACH,uEAAuE;YACvE,kEAAkE;YAClE,MAAM,IAAI,GAAG,CAAC,IAAY,EAAQ,EAAE;gBAClC,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,KAAK,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;oBACnF,qEAAqE;oBACrE,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;wBAAE,OAAO;oBAChF,IAAI,IAAI,GAAG,CAAC;wBAAE,OAAO;gBACvB,CAAC;YACH,CAAC,CAAC;YACF,IAAI,CAAC,CAAC,CAAC,CAAC;YACR,yEAAyE;YACzE,mEAAmE;YACnE,yEAAyE;YACzE,2EAA2E;YAC3E,yEAAyE;YACzE,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBACrC,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC1E,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,uEAAuE;YACvE,wCAAwC;YACxC,SAAS,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2EAA2E;IAC3E,gFAAgF;IAChF,KACE,IAAI,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAChC,CAAC,KAAK,CAAC,CAAC,EACR,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,EAChD,CAAC;QACD,IAAI,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC;YAAE,MAAM;IACpC,CAAC;IACD,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;QAC1F,IAAI,OAAO,KAAK,CAAC,CAAC;YAAE,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iGAAiG;AACjG,SAAS,cAAc,CAAC,OAAe,EAAE,KAAa;IACpD,OAAO,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,kBAAkB,CACzB,OAAe,EACf,KAAkB,EAClB,SAAiB,EACjB,OAAgB;IAEhB,MAAM,KAAK,GAAG;QACZ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC;KACpF,CAAC;IACF,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;IACpD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9D,6EAA6E;IAC7E,gEAAgE;IAChE,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,EAAE,CAAC;IACpD,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACxF,OAAO,IAAI,OAAO,CAChB,SAAS,CAAC,aAAa,EACvB,SAAS,MAAM,CAAC,SAAS,CAAC,sBAAsB,KAAK,UAAU,KAAK,GAAG;QACrE,IAAI,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,8CAA8C,CACrF,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CACzB,SAAiB,EACjB,IAAqB,EACrB,QAAgB,EAChB,MAAkB;IAElB,OAAO;QACL,IAAI,EAAE,SAAS;QACf,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,GAAG,CAAC,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5E,QAAQ;QACR,YAAY,EAAE,MAAM,CAAC,YAAY;QACjC,GAAG,CAAC,MAAM,CAAC,YAAY,GAAG,CAAC;YAC3B,MAAM,CAAC,UAAU,KAAK,SAAS;YAC/B,MAAM,CAAC,YAAY,KAAK,SAAS;YAC/B,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,YAAY,EAAE,MAAM,CAAC,YAAY,EAAE;YACtE,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,MAAM,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACtF,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC9C,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,8EAA8E;AAC9E,gFAAgF;AAChF,yEAAyE;AACzE,mDAAmD;AACnD,SAAS,QAAQ,CAAC,OAAe;IAC/B,OAAO,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,MAAM,CAAC,IAAY;IAC1B,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AACpE,CAAC;AAED,SAAS,UAAU,CACjB,OAAe,EACf,KAAuC,EACvC,gBAAyB;IAEzB,IAAI,UAAU,GAAG,OAAO,CAAC;IACzB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;IAE/B,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QAC3D,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QAC3D,MAAM,KAAK,GAAG,eAAe,CAAC,UAAU,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC;QAErE,0EAA0E;QAC1E,uEAAuE;QACvE,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC;YAAE,MAAM,kBAAkB,CAAC,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;QAE1F,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACjB,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClC,SAAS;QACX,CAAC;QAED,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAC1B,UAAU;YACR,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC;gBACrC,OAAO;gBACP,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QACpD,YAAY,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC;AAC/D,CAAC;AAOD,KAAK,UAAU,cAAc,CAC3B,QAAgB,EAChB,KAAuC,EACvC,OAAwB,EACxB,GAAY;IAEZ,+CAA+C;IAC/C,IAAI,OAAO,CAAC,MAAM;QAAE,OAAO,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IACnE,OAAO,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;AACtF,CAAC;AAED,KAAK,UAAU,QAAQ,CACrB,QAAgB,EAChB,KAAuC,EACvC,OAAwB,EACxB,GAAY;IAEZ,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,gBAAgB,CAAC,QAAQ,EAAE;QACrE,MAAM,EAAE,GAAG,CAAC,MAAM;KACnB,CAAC,CAAC;IACH,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC;IACxE,sEAAsE;IACtE,MAAM,KAAK,GACT,UAAU,CAAC,YAAY,GAAG,CAAC;QACzB,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC;QAChE,CAAC,CAAC,SAAS,CAAC;IAChB,IAAI,KAAK,KAAK,SAAS;QAAE,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC;IAE9E,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QACnB,IAAI,KAAK,KAAK,SAAS;YAAE,UAAU,CAAC,IAAI,GAAG,KAAK,CAAC;IACnD,CAAC;SAAM,CAAC;QACN,IAAI,UAAU,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,wBAAwB,UAAU,CAChC,UAAU,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC,EAChF,IAAI,CACL,kCAAkC,EACnC,QAAQ,CACT,CAAC;QACJ,CAAC;QAED,IAAI,UAAU,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC,OAAO,EAAE;gBACnD,MAAM,EAAE,GAAG,CAAC,MAAM;aACnB,CAAC,CAAC;YACH,GAAG,CAAC,GAAG,CACL,MAAM,EACN,SAAS,QAAQ,KAAK,UAAU,CAAC,YAAY,YAAY,MAAM,CAAC,UAAU,CAAC,UAAU,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC,GAAG,EACvI,MAAM,CACP,CAAC;QACJ,CAAC;IACH,CAAC;IAED,gFAAgF;IAChF,iFAAiF;IACjF,gFAAgF;IAChF,4DAA4D;IAC5D,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM;QAC7B,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QAC1B,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;IACpF,MAAM,IAAI,GAAG,oBAAoB,CAAC;QAChC,SAAS;QACT,OAAO,EAAE,UAAU,CAAC,OAAO;QAC3B,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,YAAY,EAAE,QAAQ;KACvB,CAAC,CAAC;IACH,OAAO;QACL,IAAI,EAAE,kBAAkB,CAAC,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,CAAC;QAC/D,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAClE,CAAC;AACJ,CAAC;AAED,SAAS,iBAAiB,CACxB,OAAgD,EAChD,MAAe;IAEf,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;IACvC,uEAAuE;IACvE,wDAAwD;IACxD,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;IACvB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;QACpD,OAAO,SAAS,IAAI,CAAC,IAAI,aAAa,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC;IACnE,CAAC;IACD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/B,IAAI,OAAO,IAAI,CAAC;YAAE,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;QACtD,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;QAClB,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpD,MAAM,MAAM,GAAG,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvF,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;QACpE,CAAC;QACD,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC;QACpC,IAAI,KAAK,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC;YAAE,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QAC3E,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,KAAK,CAAC,KAAK,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IAC1D,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;IACnC,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;IAChF,6EAA6E;IAC7E,iFAAiF;IACjF,qEAAqE;IACrE,MAAM,KAAK,GAAG,OAAO;SAClB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACtD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;SACjC,IAAI,CAAC,EAAE,CAAC,CAAC;IACZ,OAAO,SAAS,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;AACnF,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,UAAU,CAAyD;IACrF,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,YAAY;IACnB,WAAW,EACT,sFAAsF;QACtF,2FAA2F;QAC3F,sDAAsD;IACxD,KAAK,EAAE,mBAAmB;IAC1B,YAAY,EAAE,KAAK;IACnB,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;QACjB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,IAAI,OAAe,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5B,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;aAAM,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACpC,OAAO,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC;QACzC,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,OAAO,CAAC;QACpB,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,OAAO,QAAQ,EAAE,EAAE,OAAO,EAAE,CAAC;IAC/C,CAAC;IACD,WAAW,EAAE,wBAAwB;IACrC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,KAAK,GACT,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QAEhG,MAAM,OAAO,GAAoB;YAC/B,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,gBAAgB,EAAE,IAAI,CAAC,gBAAgB;SACxC,CAAC;QAEF,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAClF,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAC1C,CAAC;QAEF,MAAM,cAAc,GAAmC,EAAE,CAAC;QAC1D,MAAM,aAAa,GAAmB,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAC9B,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;gBACjB,cAAc,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;gBACtD,SAAS;YACX,CAAC;YACD,cAAc,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3D,IAAI,CAAC,CAAC,KAAK,CAAC,YAAY;gBAAE,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACrE,CAAC;QAED,MAAM,WAAW,GAAG,iBAAiB,CAAC,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAEnE,OAAO;YACL,UAAU,EAAE;gBACV,OAAO,EAAE,cAAc;gBACvB,OAAO,EAAE,KAAK,CAAC,OAAO;aACvB;YACD,IAAI,EAAE,WAAW;YACjB,OAAO,EAAE,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC;YACtC,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAClE,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { ContentBlock } from '@modelcontextprotocol/server';\n\nimport { basename } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { diffStatsFromPatch, unifiedPatch } from '../core/diff.ts';\nimport { ErrorCode, FsError } from '../core/errors.ts';\nimport { buildWrittenFileMeta, type WrittenFileMeta } from '../core/file-uri.ts';\nimport { joinRoster, truncateProgressPattern } from '../core/fmt.ts';\nimport { isSamePath } from '../core/path-utils.ts';\nimport {\n  defaultFalseBoolean,\n  isBlank,\n  RequiredPath,\n  singleOrBatchAccessPaths,\n} from '../core/schema.ts';\nimport { compileRegex, execMatches, freeRegex } from '../core/search.ts';\nimport { escapeRegExp } from '../core/util.ts';\nimport { type BatchResult, isTotalFailure, type PerPathResult, runOverPaths } from './batch.ts';\nimport { defineTool, type ToolCtx } from './define.ts';\n\nconst EditSpecSchema = z.strictObject({\n  oldText: z\n    .string()\n    .min(1, 'oldText required')\n    .refine((val) => !isBlank(val), {\n      message: 'oldText cannot be empty or whitespace-only',\n    })\n    .describe(\n      'Exact literal text to locate in the file; it must match exactly once. Include 3-5 lines of context so it does — an oldText found in several places fails with their line numbers.',\n    )\n    .meta({ examples: ['const x = 1;', 'function oldName('] }),\n  newText: z\n    .string()\n    .describe('Replacement text. Use an empty string to delete the matched oldText.')\n    .meta({ examples: ['const x = 2;', 'function newName(', ''] }),\n});\n// No `id`, so no `$defs`/`$ref`: this subschema is inlined at both `edits` and\n// `files[].edits`. Hoisting it saved ~1.3 kB, but clients whose schema\n// converter cannot follow a `$ref` fell back to an opaque pass-through for\n// `edit` alone and sent its arguments as a serialized string (issue #51).\n\nconst MAX_MULTI_FILES = 5;\nconst MAX_EDITS_PER_FILE = 100;\n\nconst EditFileInputSchema = z\n  .strictObject({\n    path: RequiredPath.optional().describe('Single file path; mutually exclusive with files'),\n    edits: z\n      .array(EditSpecSchema)\n      .min(1)\n      .max(MAX_EDITS_PER_FILE)\n      .optional()\n      .describe('Replacements applied to path; not allowed when using files'),\n    files: z\n      .array(\n        z.strictObject({\n          path: RequiredPath,\n          edits: z\n            .array(EditSpecSchema)\n            .min(1)\n            .max(MAX_EDITS_PER_FILE)\n            .describe('Replacements to apply to this specific file'),\n        }),\n      )\n      .min(1)\n      .max(MAX_MULTI_FILES)\n      .optional()\n      .describe('Per-file entries (batch mode)'),\n    dryRun: defaultFalseBoolean(\n      'Preview diffs without writing to disk (default: false = apply edits)',\n    ),\n    ignoreWhitespace: defaultFalseBoolean(\n      'Ignore leading/trailing whitespace differences when matching oldText',\n    ),\n  })\n  .superRefine((value, ctx) => {\n    const hasPath = value.path !== undefined;\n    const hasFiles = value.files !== undefined;\n    if (hasPath === hasFiles) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['path'],\n        message: \"Provide exactly one of 'path' or 'files'\",\n        input: value,\n      });\n    }\n    if (hasPath && value.edits === undefined) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['edits'],\n        message: \"'edits' required when using 'path'\",\n        input: value,\n      });\n    }\n    if (hasFiles && value.edits !== undefined) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['edits'],\n        message: \"'edits' not allowed with 'files'; each file carries its own edits\",\n        input: value,\n      });\n    }\n    // Batch entries run in parallel and each rewrites its file whole, so two\n    // entries for one file race: the last write wins and the other's edits are\n    // lost while both report success. One entry per file.\n    const files = value.files ?? [];\n    for (const [index, file] of files.entries()) {\n      const first = files.findIndex((other) => isSamePath(other.path, file.path));\n      if (first < index) {\n        ctx.addIssue({\n          code: 'custom',\n          path: ['files', index, 'path'],\n          message: `duplicate of files[${String(first)}].path; put every edit for one file in a single entry`,\n          input: value,\n        });\n      }\n    }\n  })\n  // Mirror the superRefine on the wire: exactly one input mode, and single-file\n  // mode carries its own `edits`. Without `edits` in the first branch, `{ path }`\n  // alone validated against the published schema and was then rejected at\n  // runtime — the model had no way to see that coming.\n  .meta({ oneOf: [{ required: ['path', 'edits'] }, { required: ['files'] }] });\n\ntype EditFileValue = Omit<WrittenFileMeta, 'resourceUri' | 'resourceLink'> & {\n  path: string;\n  resourceUri?: string;\n  modified: string;\n  appliedEdits: number;\n  linesAdded?: number;\n  linesRemoved?: number;\n  diff?: string;\n  unmatchedEdits?: string[];\n};\n\ninterface TextRange {\n  startIndex: number;\n  length: number;\n}\n\ninterface EditResult {\n  content: string;\n  appliedEdits: number;\n  unmatchedEdits: string[];\n  linesAdded?: number;\n  linesRemoved?: number;\n  diff?: string;\n}\n\nconst MAX_REPORTED_MATCH_LINES = 5;\n\ninterface EditMatches {\n  /** The first match; undefined when oldText matches nothing. */\n  first: TextRange | undefined;\n  count: number;\n  /** UTF-16 start offsets of the first {@link MAX_REPORTED_MATCH_LINES} matches. */\n  starts: number[];\n  truncated: boolean;\n}\n\n/**\n * Pattern for a whitespace run of oldText that contains a newline. Between two\n * pieces of text it stays flexible — at least one newline, as many as the file\n * has. At either edge of oldText it matches exactly the newlines written: a\n * flexible edge swallows the blank lines around the match and, at the trailing\n * edge, the next line's indentation, all of which newText then replaces. Each\n * newline may carry horizontal whitespace before it, which covers the `\\r` of\n * a CRLF file and a blank line with stray spaces.\n */\nfunction newlineRunPattern(token: string, edge: { leading: boolean; trailing: boolean }): string {\n  if (!edge.leading && !edge.trailing) return '(?:[^\\\\S\\\\n]*\\\\n)+[^\\\\S\\\\n]*';\n  const count = token.split('\\n').length - 1;\n  const lines = `(?:[^\\\\S\\\\n]*\\\\n){${String(count)}}`;\n  // Nothing after the final newline unless the caller wrote indentation there.\n  return edge.trailing && token.endsWith('\\n') ? lines : `${lines}[^\\\\S\\\\n]*`;\n}\n\n/**\n * Where `oldText` matches. `count` is non-overlapping occurrences, except that a\n * lone match with a second one overlapping it counts two (`abab` in `ababab`),\n * since either is a span the caller could have meant — the count is exact only\n * when it answers \"once or not\". Only the count and the first few starts are\n * kept: a short oldText in a large file can match millions of times.\n */\nfunction findEditMatches(content: string, oldText: string, ignoreWhitespace: boolean): EditMatches {\n  const found: EditMatches = { first: undefined, count: 0, starts: [], truncated: false };\n  // Returns true once the match is known ambiguous: applyEdits only needs\n  // 0 / 1 / >1 and a few starts, and counting every occurrence of a short\n  // oldText in a big file is wasted work (seconds under re2-wasm).\n  const add = (startIndex: number, length: number): boolean => {\n    found.first ??= { startIndex, length };\n    found.count += 1;\n    if (found.starts.length < MAX_REPORTED_MATCH_LINES) found.starts.push(startIndex);\n    found.truncated = found.count > MAX_REPORTED_MATCH_LINES;\n    return found.truncated;\n  };\n\n  if (ignoreWhitespace) {\n    // Make whitespace flexible (tolerate indentation/spacing differences)\n    // without letting it cross line boundaries: a whitespace run that contains\n    // a newline keeps at least one newline, so a single-line oldText cannot\n    // match across a newline and a multi-line oldText cannot collapse onto one\n    // line. Horizontal whitespace stays mandatory between word characters so\n    // adjacent identifiers are not merged. Built token by token: `split` on\n    // whitespace puts text at even indices and whitespace runs at odd ones.\n    // A newline run at either edge of oldText matches exactly, so the edit\n    // cannot reach past the lines the caller named.\n    const tokens = oldText.split(/(\\s+)/u);\n    const last = tokens.length - 1;\n    let pattern = '';\n    for (const [i, token] of tokens.entries()) {\n      if (i % 2 === 0) {\n        pattern += escapeRegExp(token);\n      } else if (token.includes('\\n')) {\n        pattern += newlineRunPattern(token, {\n          leading: i === 1 && tokens[0] === '',\n          trailing: i === last - 1 && tokens[last] === '',\n        });\n      } else if (/\\w$/.test(tokens[i - 1] ?? '') && /^\\w/.test(tokens[i + 1] ?? '')) {\n        pattern += '[^\\\\S\\\\n]+';\n      } else {\n        pattern += '[^\\\\S\\\\n]*';\n      }\n    }\n    const regex = compileRegex(pattern, { caseSensitive: true });\n    try {\n      // execMatches resets lastIndex and reports UTF-16 offsets; the raw RE2\n      // index counts code points and would splice off-by-one per emoji.\n      const scan = (from: number): void => {\n        for (const match of execMatches(regex, from === 0 ? content : content.slice(from))) {\n          // A zero-length match names an empty span, which cannot be replaced.\n          if (match.text.length > 0 && add(from + match.start, match.text.length)) return;\n          if (from > 0) return;\n        }\n      };\n      scan(0);\n      // execMatches resumes past each match, so a second match overlapping the\n      // first is never reported; look once more from just past its first\n      // non-whitespace character. Starting inside the leading whitespace would\n      // re-find the same occurrence, since the pattern's leading run is `*`. The\n      // pattern carries no anchors, so matching a suffix finds the same spans.\n      if (found.count === 1 && found.first) {\n        const { startIndex, length } = found.first;\n        const lead = content.slice(startIndex, startIndex + length).search(/\\S/u);\n        scan(afterCodePoint(content, startIndex + lead));\n      }\n    } finally {\n      // The compiled pattern owns wasm memory re2-wasm never reclaims on its\n      // own; its lifetime is this one search.\n      freeRegex(regex);\n    }\n    return found;\n  }\n\n  // Non-overlapping, so the scan stays linear on repetitive content; the one\n  // overlap that matters — a second match inside the only one — is checked after.\n  for (\n    let i = content.indexOf(oldText);\n    i !== -1;\n    i = content.indexOf(oldText, i + oldText.length)\n  ) {\n    if (add(i, oldText.length)) break;\n  }\n  if (found.count === 1 && found.first) {\n    const overlap = content.indexOf(oldText, afterCodePoint(content, found.first.startIndex));\n    if (overlap !== -1) add(overlap, oldText.length);\n  }\n  return found;\n}\n\n/** The UTF-16 offset just past the code point at `index`, so a surrogate pair is never split. */\nfunction afterCodePoint(content: string, index: number): number {\n  return index + ((content.codePointAt(index) ?? 0) > 0xffff ? 2 : 1);\n}\n\nfunction ambiguousEditError(\n  content: string,\n  found: EditMatches,\n  editIndex: number,\n  shifted: boolean,\n): FsError {\n  const lines = [\n    ...new Set(found.starts.map((start) => content.slice(0, start).split('\\n').length)),\n  ];\n  const label = lines.length === 1 ? 'line' : 'lines';\n  const more = found.count > found.starts.length ? ', ...' : '';\n  // Offsets come from the content as earlier edits in this call left it, which\n  // is not the file the caller read once one of them has applied.\n  const where = shifted ? ' after earlier edits' : '';\n  const count = found.truncated ? `at least ${String(found.count)}` : String(found.count);\n  return new FsError(\n    ErrorCode.INVALID_INPUT,\n    `edits[${String(editIndex)}]: oldText matches ${count} places${where} ` +\n      `(${label} ${lines.join(', ')}${more}). Add surrounding lines so it matches once.`,\n  );\n}\n\nfunction buildEditFileValue(\n  validPath: string,\n  meta: WrittenFileMeta,\n  modified: string,\n  result: EditResult,\n): EditFileValue {\n  return {\n    path: validPath,\n    size: meta.size,\n    lineCount: meta.lineCount,\n    mimeType: meta.mimeType,\n    kind: meta.kind,\n    ...(meta.resourceUri !== undefined ? { resourceUri: meta.resourceUri } : {}),\n    modified,\n    appliedEdits: result.appliedEdits,\n    ...(result.appliedEdits > 0 &&\n    result.linesAdded !== undefined &&\n    result.linesRemoved !== undefined\n      ? { linesAdded: result.linesAdded, linesRemoved: result.linesRemoved }\n      : {}),\n    ...(result.unmatchedEdits.length > 0 ? { unmatchedEdits: result.unmatchedEdits } : {}),\n    ...(result.diff ? { diff: result.diff } : {}),\n  };\n}\n\n// A file whose every newline is CRLF gets LF-only edit text converted to match\n// — the rule jsdiff's autoConvertLineEndings applies for `patch`. Range, head\n// and tail reads strip `\\r`, so the oldText a model sends is LF-only; text that\n// already carries a `\\r` is taken as written. Mixed-ending files are not\n// converted: there is no one ending to convert to.\nfunction usesCrlf(content: string): boolean {\n  return content.includes('\\r\\n') && !/(?<!\\r)\\n/u.test(content);\n}\n\nfunction toCrlf(text: string): string {\n  return text.includes('\\r') ? text : text.replaceAll('\\n', '\\r\\n');\n}\n\nfunction applyEdits(\n  content: string,\n  edits: z.infer<typeof EditSpecSchema>[],\n  ignoreWhitespace: boolean,\n): EditResult {\n  let newContent = content;\n  let appliedEdits = 0;\n  const unmatchedEdits: string[] = [];\n  const crlf = usesCrlf(content);\n\n  for (const [index, edit] of edits.entries()) {\n    const oldText = crlf ? toCrlf(edit.oldText) : edit.oldText;\n    const newText = crlf ? toCrlf(edit.newText) : edit.newText;\n    const found = findEditMatches(newContent, oldText, ignoreWhitespace);\n\n    // A second match is an error rather than a pick: splicing the first would\n    // edit a block the caller may not have meant and still report success.\n    if (found.count > 1) throw ambiguousEditError(newContent, found, index, appliedEdits > 0);\n\n    if (!found.first) {\n      unmatchedEdits.push(edit.oldText);\n      continue;\n    }\n\n    const first = found.first;\n    newContent =\n      newContent.slice(0, first.startIndex) +\n      newText +\n      newContent.slice(first.startIndex + first.length);\n    appliedEdits += 1;\n  }\n\n  return { content: newContent, appliedEdits, unmatchedEdits };\n}\n\ninterface EditFileOptions {\n  dryRun: boolean;\n  ignoreWhitespace: boolean;\n}\n\nasync function handleEditFile(\n  filePath: string,\n  edits: z.infer<typeof EditSpecSchema>[],\n  options: EditFileOptions,\n  ctx: ToolCtx,\n): Promise<{ file: EditFileValue; resourceLink?: ContentBlock }> {\n  // A dry run never writes, so it needs no lock.\n  if (options.dryRun) return editOnce(filePath, edits, options, ctx);\n  return ctx.fs.lockForWrite(filePath, () => editOnce(filePath, edits, options, ctx));\n}\n\nasync function editOnce(\n  filePath: string,\n  edits: z.infer<typeof EditSpecSchema>[],\n  options: EditFileOptions,\n  ctx: ToolCtx,\n): Promise<{ file: EditFileValue; resourceLink?: ContentBlock }> {\n  const { validPath, content } = await ctx.fs.readEditableText(filePath, {\n    signal: ctx.signal,\n  });\n  const editResult = applyEdits(content, edits, options.ignoreWhitespace);\n  // One Myers pass serves both the dry-run preview and the line counts.\n  const patch =\n    editResult.appliedEdits > 0\n      ? unifiedPatch(basename(validPath), content, editResult.content)\n      : undefined;\n  if (patch !== undefined) Object.assign(editResult, diffStatsFromPatch(patch));\n\n  if (options.dryRun) {\n    if (patch !== undefined) editResult.diff = patch;\n  } else {\n    if (editResult.unmatchedEdits.length > 0) {\n      throw new FsError(\n        ErrorCode.INVALID_INPUT,\n        `no match for oldText ${joinRoster(\n          editResult.unmatchedEdits.map((t) => JSON.stringify(truncateProgressPattern(t))),\n          ', ',\n        )}; it must match the file exactly`,\n        filePath,\n      );\n    }\n\n    if (editResult.appliedEdits > 0) {\n      await ctx.fs.writeFile(filePath, editResult.content, {\n        signal: ctx.signal,\n      });\n      ctx.log(\n        'info',\n        `edit: ${filePath} (${editResult.appliedEdits} edits, +${String(editResult.linesAdded ?? 0)}/-${String(editResult.linesRemoved ?? 0)})`,\n        'edit',\n      );\n    }\n  }\n\n  // `modified` is read from a post-write stat and is advisory: under a concurrent\n  // writer it may reflect that writer's mtime while `size`/content below come from\n  // this edit's atomic write. The file content itself is always consistent. A dry\n  // run wrote nothing, so it reports the time of the preview.\n  const modified = options.dryRun\n    ? new Date().toISOString()\n    : (await ctx.fs.stat(filePath, { signal: ctx.signal })).stats.mtime.toISOString();\n  const meta = buildWrittenFileMeta({\n    validPath,\n    content: editResult.content,\n    dryRun: options.dryRun,\n    lastModified: modified,\n  });\n  return {\n    file: buildEditFileValue(validPath, meta, modified, editResult),\n    ...(meta.resourceLink ? { resourceLink: meta.resourceLink } : {}),\n  };\n}\n\nfunction formatEditSummary(\n  results: readonly PerPathResult<EditFileValue>[],\n  dryRun: boolean,\n): string {\n  const tag = dryRun ? ' [dry run]' : '';\n  // Single-file failure: say why here rather than making the caller read\n  // structuredContent for the one message that can apply.\n  const [only] = results;\n  if (results.length === 1 && only && 'error' in only) {\n    return `edit: ${only.path} FAILED — ${only.error.message}${tag}`;\n  }\n  const tokens = results.map((r) => {\n    if ('error' in r) return `${basename(r.path)} FAILED`;\n    const v = r.value;\n    if (v.unmatchedEdits && v.unmatchedEdits.length > 0) {\n      const quoted = v.unmatchedEdits.map((t) => JSON.stringify(truncateProgressPattern(t)));\n      return `${basename(v.path)} NO MATCH ${joinRoster(quoted, ', ')}`;\n    }\n    const added = v.linesAdded ?? 0;\n    const removed = v.linesRemoved ?? 0;\n    if (added === 0 && removed === 0) return `${basename(v.path)} (no change)`;\n    return `${basename(v.path)} +${String(added)} -${String(removed)}`;\n  });\n\n  const failed = results.filter((r) => 'error' in r).length;\n  const ok = results.length - failed;\n  const ratio = failed > 0 ? ` (${String(ok)}/${String(results.length)} ok)` : '';\n  // Only a dry run carries a diff, and it is the preview the caller asked for:\n  // the structured value ships under `_meta`, which clients do not show the model.\n  // A no-op edit still yields a header-only diff; it previews nothing.\n  const diffs = results\n    .map((r) => ('value' in r ? (r.value.diff ?? '') : ''))\n    .filter((d) => d.includes('\\n@@'))\n    .join('');\n  return `edit: ${tokens.join(' · ')}${ratio}${tag}${diffs ? `\\n\\n${diffs}` : ''}`;\n}\n\nexport const EDIT = defineTool<typeof EditFileInputSchema, BatchResult<EditFileValue>>({\n  name: 'edit',\n  title: 'Edit Files',\n  description:\n    'Edit text files in place by replacing exact oldText with newText, like str_replace. ' +\n    'Each oldText must match exactly once, and a file is written only if all its edits match. ' +\n    'replace_text replaces every occurrence across files.',\n  input: EditFileInputSchema,\n  readOnlyHint: false,\n  progress: (args) => {\n    const dryLabel = args.dryRun ? ' [dry run]' : '';\n    let subject: string;\n    if (args.path !== undefined) {\n      subject = basename(args.path);\n    } else if (args.files !== undefined) {\n      subject = `${args.files.length} files`;\n    } else {\n      subject = 'files';\n    }\n    return { label: `Edit${dryLabel}`, subject };\n  },\n  accessPaths: singleOrBatchAccessPaths,\n  run: async (args, ctx) => {\n    const items =\n      args.path !== undefined ? [{ path: args.path, edits: args.edits ?? [] }] : (args.files ?? []);\n\n    const options: EditFileOptions = {\n      dryRun: args.dryRun,\n      ignoreWhitespace: args.ignoreWhitespace,\n    };\n\n    const batch = await runOverPaths(items, ctx, ErrorCode.UNKNOWN, ({ path, edits }) =>\n      handleEditFile(path, edits, options, ctx),\n    );\n\n    const perPathResults: PerPathResult<EditFileValue>[] = [];\n    const resourceLinks: ContentBlock[] = [];\n    for (const r of batch.results) {\n      if ('error' in r) {\n        perPathResults.push({ path: r.path, error: r.error });\n        continue;\n      }\n      perPathResults.push({ path: r.path, value: r.value.file });\n      if (r.value.resourceLink) resourceLinks.push(r.value.resourceLink);\n    }\n\n    const summaryText = formatEditSummary(perPathResults, args.dryRun);\n\n    return {\n      structured: {\n        results: perPathResults,\n        summary: batch.summary,\n      },\n      text: summaryText,\n      isError: isTotalFailure(batch.summary),\n      ...(resourceLinks.length > 0 ? { resources: resourceLinks } : {}),\n    };\n  },\n});\n"]}
+{"version":3,"file":"edit.js","sourceRoot":"","sources":["../../src/tools/edit.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACnE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAE,oBAAoB,EAAwB,MAAM,qBAAqB,CAAC;AACjF,OAAO,EAAE,UAAU,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AACrE,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EACL,mBAAmB,EACnB,cAAc,EACd,YAAY,EACZ,wBAAwB,GACzB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AACzE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAoB,cAAc,EAAsB,YAAY,EAAE,MAAM,YAAY,CAAC;AAChG,OAAO,EAAE,UAAU,EAAgB,MAAM,aAAa,CAAC;AAEvD,MAAM,cAAc,GAAG,CAAC,CAAC,YAAY,CAAC;IACpC,OAAO,EAAE,cAAc,CAAC,SAAS,CAAC;SAC/B,QAAQ,CACP,mLAAmL,CACpL;SACA,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,cAAc,EAAE,mBAAmB,CAAC,EAAE,CAAC;IAC5D,OAAO,EAAE,CAAC;SACP,MAAM,EAAE;SACR,QAAQ,CAAC,sEAAsE,CAAC;SAChF,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,cAAc,EAAE,mBAAmB,EAAE,EAAE,CAAC,EAAE,CAAC;CACjE,CAAC,CAAC;AACH,+EAA+E;AAC/E,uEAAuE;AACvE,2EAA2E;AAC3E,0EAA0E;AAE1E,MAAM,eAAe,GAAG,CAAC,CAAC;AAC1B,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAE/B,MAAM,mBAAmB,GAAG,CAAC;KAC1B,YAAY,CAAC;IACZ,IAAI,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,iDAAiD,CAAC;IACzF,KAAK,EAAE,CAAC;SACL,KAAK,CAAC,cAAc,CAAC;SACrB,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,kBAAkB,CAAC;SACvB,QAAQ,EAAE;SACV,QAAQ,CAAC,4DAA4D,CAAC;IACzE,KAAK,EAAE,CAAC;SACL,KAAK,CACJ,CAAC,CAAC,YAAY,CAAC;QACb,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,CAAC;aACL,KAAK,CAAC,cAAc,CAAC;aACrB,GAAG,CAAC,CAAC,CAAC;aACN,GAAG,CAAC,kBAAkB,CAAC;aACvB,QAAQ,CAAC,6CAA6C,CAAC;KAC3D,CAAC,CACH;SACA,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,eAAe,CAAC;SACpB,QAAQ,EAAE;SACV,QAAQ,CAAC,+BAA+B,CAAC;IAC5C,MAAM,EAAE,mBAAmB,CACzB,sEAAsE,CACvE;IACD,gBAAgB,EAAE,mBAAmB,CACnC,sEAAsE,CACvE;CACF,CAAC;KACD,WAAW,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;IAC1B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;IACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC;IAC3C,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;QACzB,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EAAE,0CAA0C;YACnD,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QACzC,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,OAAO,CAAC;YACf,OAAO,EAAE,oCAAoC;YAC7C,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,QAAQ,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC1C,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,OAAO,CAAC;YACf,OAAO,EAAE,mEAAmE;YAC5E,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,yEAAyE;IACzE,2EAA2E;IAC3E,sDAAsD;IACtD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5E,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;YAClB,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC;gBAC9B,OAAO,EAAE,sBAAsB,MAAM,CAAC,KAAK,CAAC,uDAAuD;gBACnG,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC,CAAC;IACF,8EAA8E;IAC9E,gFAAgF;IAChF,wEAAwE;IACxE,qDAAqD;KACpD,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AA0B/E,MAAM,wBAAwB,GAAG,CAAC,CAAC;AAWnC;;;;;;;;GAQG;AACH,SAAS,iBAAiB,CAAC,KAAa,EAAE,IAA6C;IACrF,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ;QAAE,OAAO,8BAA8B,CAAC;IAC3E,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,qBAAqB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC;IACpD,6EAA6E;IAC7E,OAAO,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,YAAY,CAAC;AAC9E,CAAC;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,OAAe,EAAE,OAAe,EAAE,gBAAyB;IAClF,MAAM,KAAK,GAAgB,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IACxF,wEAAwE;IACxE,wEAAwE;IACxE,iEAAiE;IACjE,MAAM,GAAG,GAAG,CAAC,UAAkB,EAAE,MAAc,EAAW,EAAE;QAC1D,KAAK,CAAC,KAAK,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;QACvC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;QACjB,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,wBAAwB;YAAE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAClF,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,GAAG,wBAAwB,CAAC;QACzD,OAAO,KAAK,CAAC,SAAS,CAAC;IACzB,CAAC,CAAC;IAEF,IAAI,gBAAgB,EAAE,CAAC;QACrB,sEAAsE;QACtE,2EAA2E;QAC3E,wEAAwE;QACxE,2EAA2E;QAC3E,yEAAyE;QACzE,wEAAwE;QACxE,wEAAwE;QACxE,uEAAuE;QACvE,gDAAgD;QAChD,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,KAAK,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChB,OAAO,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC;iBAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,OAAO,IAAI,iBAAiB,CAAC,KAAK,EAAE;oBAClC,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE;oBACpC,QAAQ,EAAE,CAAC,KAAK,IAAI,GAAG,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE;iBAChD,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;gBAC9E,OAAO,IAAI,YAAY,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,YAAY,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QAC7D,IAAI,CAAC;YACH,uEAAuE;YACvE,kEAAkE;YAClE,MAAM,IAAI,GAAG,CAAC,IAAY,EAAQ,EAAE;gBAClC,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,KAAK,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;oBACnF,qEAAqE;oBACrE,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;wBAAE,OAAO;oBAChF,IAAI,IAAI,GAAG,CAAC;wBAAE,OAAO;gBACvB,CAAC;YACH,CAAC,CAAC;YACF,IAAI,CAAC,CAAC,CAAC,CAAC;YACR,yEAAyE;YACzE,mEAAmE;YACnE,yEAAyE;YACzE,2EAA2E;YAC3E,yEAAyE;YACzE,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBACrC,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC1E,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,uEAAuE;YACvE,wCAAwC;YACxC,SAAS,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2EAA2E;IAC3E,gFAAgF;IAChF,KACE,IAAI,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAChC,CAAC,KAAK,CAAC,CAAC,EACR,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,EAChD,CAAC;QACD,IAAI,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC;YAAE,MAAM;IACpC,CAAC;IACD,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;QAC1F,IAAI,OAAO,KAAK,CAAC,CAAC;YAAE,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iGAAiG;AACjG,SAAS,cAAc,CAAC,OAAe,EAAE,KAAa;IACpD,OAAO,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,kBAAkB,CACzB,OAAe,EACf,KAAkB,EAClB,SAAiB,EACjB,OAAgB;IAEhB,MAAM,KAAK,GAAG;QACZ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC;KACpF,CAAC;IACF,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;IACpD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9D,6EAA6E;IAC7E,gEAAgE;IAChE,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,EAAE,CAAC;IACpD,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACxF,OAAO,IAAI,OAAO,CAChB,SAAS,CAAC,aAAa,EACvB,SAAS,MAAM,CAAC,SAAS,CAAC,sBAAsB,KAAK,UAAU,KAAK,GAAG;QACrE,IAAI,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,8CAA8C,CACrF,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,8EAA8E;AAC9E,gFAAgF;AAChF,yEAAyE;AACzE,mDAAmD;AACnD,SAAS,QAAQ,CAAC,OAAe;IAC/B,OAAO,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,MAAM,CAAC,IAAY;IAC1B,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AACpE,CAAC;AAED,SAAS,UAAU,CACjB,OAAe,EACf,KAAuC,EACvC,gBAAyB;IAEzB,IAAI,UAAU,GAAG,OAAO,CAAC;IACzB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;IAE/B,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QAC3D,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QAC3D,MAAM,KAAK,GAAG,eAAe,CAAC,UAAU,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC;QAErE,0EAA0E;QAC1E,uEAAuE;QACvE,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC;YAAE,MAAM,kBAAkB,CAAC,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;QAE1F,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACjB,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClC,SAAS;QACX,CAAC;QAED,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAC1B,UAAU;YACR,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC;gBACrC,OAAO;gBACP,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QACpD,YAAY,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC;AAC/D,CAAC;AAED,KAAK,UAAU,QAAQ,CACrB,QAAgB,EAChB,KAAuC,EACvC,OAAuD,EACvD,GAAY;IAEZ,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,gBAAgB,CAAC,QAAQ,EAAE;QACrE,MAAM,EAAE,GAAG,CAAC,MAAM;KACnB,CAAC,CAAC;IACH,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC;IACxE,sEAAsE;IACtE,MAAM,KAAK,GACT,UAAU,CAAC,YAAY,GAAG,CAAC;QACzB,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC;QAChE,CAAC,CAAC,SAAS,CAAC;IAChB,IAAI,KAAK,KAAK,SAAS;QAAE,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC;IAE9E,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QACnB,IAAI,KAAK,KAAK,SAAS;YAAE,UAAU,CAAC,IAAI,GAAG,KAAK,CAAC;IACnD,CAAC;SAAM,CAAC;QACN,IAAI,UAAU,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,wBAAwB,UAAU,CAChC,UAAU,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC,EAChF,IAAI,CACL,kCAAkC,EACnC,QAAQ,CACT,CAAC;QACJ,CAAC;QAED,IAAI,UAAU,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC,OAAO,EAAE;gBACnD,MAAM,EAAE,GAAG,CAAC,MAAM;aACnB,CAAC,CAAC;YACH,GAAG,CAAC,GAAG,CACL,MAAM,EACN,SAAS,QAAQ,KAAK,UAAU,CAAC,YAAY,YAAY,MAAM,CAAC,UAAU,CAAC,UAAU,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC,GAAG,EACvI,MAAM,CACP,CAAC;QACJ,CAAC;IACH,CAAC;IAED,gFAAgF;IAChF,iFAAiF;IACjF,gFAAgF;IAChF,4DAA4D;IAC5D,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM;QAC7B,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QAC1B,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;IACpF,MAAM,IAAI,GAAG,oBAAoB,CAAC;QAChC,SAAS;QACT,OAAO,EAAE,UAAU,CAAC,OAAO;QAC3B,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,YAAY,EAAE,QAAQ;KACvB,CAAC,CAAC;IACH,MAAM,EAAE,YAAY,EAAE,GAAG,QAAQ,EAAE,GAAG,IAAI,CAAC;IAC3C,OAAO;QACL,IAAI,EAAE;YACJ,IAAI,EAAE,SAAS;YACf,GAAG,QAAQ;YACX,QAAQ;YACR,YAAY,EAAE,UAAU,CAAC,YAAY;YACrC,GAAG,CAAC,UAAU,CAAC,YAAY,GAAG,CAAC;gBAC/B,UAAU,CAAC,UAAU,KAAK,SAAS;gBACnC,UAAU,CAAC,YAAY,KAAK,SAAS;gBACnC,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,UAAU,EAAE,YAAY,EAAE,UAAU,CAAC,YAAY,EAAE;gBAC9E,CAAC,CAAC,EAAE,CAAC;YACP,GAAG,CAAC,UAAU,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC;gBACtC,CAAC,CAAC,EAAE,cAAc,EAAE,UAAU,CAAC,cAAc,EAAE;gBAC/C,CAAC,CAAC,EAAE,CAAC;YACP,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtD;QACD,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1C,CAAC;AACJ,CAAC;AAED,SAAS,iBAAiB,CACxB,OAAgD,EAChD,MAAe;IAEf,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;IACvC,uEAAuE;IACvE,wDAAwD;IACxD,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;IACvB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;QACpD,OAAO,SAAS,IAAI,CAAC,IAAI,aAAa,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC;IACnE,CAAC;IACD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/B,IAAI,OAAO,IAAI,CAAC;YAAE,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;QACtD,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;QAClB,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpD,MAAM,MAAM,GAAG,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvF,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;QACpE,CAAC;QACD,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC;QACpC,IAAI,KAAK,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC;YAAE,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC;QAC3E,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC,KAAK,CAAC,KAAK,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IAC1D,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;IACnC,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;IAChF,6EAA6E;IAC7E,iFAAiF;IACjF,qEAAqE;IACrE,MAAM,KAAK,GAAG,OAAO;SAClB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACtD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;SACjC,IAAI,CAAC,EAAE,CAAC,CAAC;IACZ,OAAO,SAAS,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;AACnF,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,UAAU,CAAyD;IACrF,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,YAAY;IACnB,WAAW,EACT,sFAAsF;QACtF,2FAA2F;QAC3F,sDAAsD;IACxD,KAAK,EAAE,mBAAmB;IAC1B,YAAY,EAAE,KAAK;IACnB,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;QACjB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,IAAI,OAAe,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5B,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;aAAM,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACpC,OAAO,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC;QACzC,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,OAAO,CAAC;QACpB,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,OAAO,QAAQ,EAAE,EAAE,OAAO,EAAE,CAAC;IAC/C,CAAC;IACD,WAAW,EAAE,wBAAwB;IACrC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,KAAK,GACT,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QAEhG,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE;QAClF,+CAA+C;QAC/C,IAAI,CAAC,MAAM;YACT,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC;YAClC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CACtE,CAAC;QAEF,MAAM,cAAc,GAAmC,EAAE,CAAC;QAC1D,MAAM,aAAa,GAAmB,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAC9B,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;gBACjB,cAAc,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;gBACtD,SAAS;YACX,CAAC;YACD,cAAc,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3D,IAAI,CAAC,CAAC,KAAK,CAAC,YAAY;gBAAE,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACrE,CAAC;QAED,MAAM,WAAW,GAAG,iBAAiB,CAAC,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAEnE,OAAO;YACL,UAAU,EAAE;gBACV,OAAO,EAAE,cAAc;gBACvB,OAAO,EAAE,KAAK,CAAC,OAAO;aACvB;YACD,IAAI,EAAE,WAAW;YACjB,OAAO,EAAE,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC;YACtC,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAClE,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { ContentBlock } from '@modelcontextprotocol/server';\n\nimport { basename } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { diffStatsFromPatch, unifiedPatch } from '../core/diff.ts';\nimport { ErrorCode, FsError } from '../core/errors.ts';\nimport { buildWrittenFileMeta, type WrittenFileMeta } from '../core/file-uri.ts';\nimport { joinRoster, truncateProgressPattern } from '../core/fmt.ts';\nimport { isSamePath } from '../core/path-utils.ts';\nimport {\n  defaultFalseBoolean,\n  nonBlankString,\n  RequiredPath,\n  singleOrBatchAccessPaths,\n} from '../core/schema.ts';\nimport { compileRegex, execMatches, freeRegex } from '../core/search.ts';\nimport { escapeRegExp } from '../core/util.ts';\nimport { type BatchResult, isTotalFailure, type PerPathResult, runOverPaths } from './batch.ts';\nimport { defineTool, type ToolCtx } from './define.ts';\n\nconst EditSpecSchema = z.strictObject({\n  oldText: nonBlankString('oldText')\n    .describe(\n      'Exact literal text to locate in the file; it must match exactly once. Include 3-5 lines of context so it does — an oldText found in several places fails with their line numbers.',\n    )\n    .meta({ examples: ['const x = 1;', 'function oldName('] }),\n  newText: z\n    .string()\n    .describe('Replacement text. Use an empty string to delete the matched oldText.')\n    .meta({ examples: ['const x = 2;', 'function newName(', ''] }),\n});\n// No `id`, so no `$defs`/`$ref`: this subschema is inlined at both `edits` and\n// `files[].edits`. Hoisting it saved ~1.3 kB, but clients whose schema\n// converter cannot follow a `$ref` fell back to an opaque pass-through for\n// `edit` alone and sent its arguments as a serialized string (issue #51).\n\nconst MAX_MULTI_FILES = 5;\nconst MAX_EDITS_PER_FILE = 100;\n\nconst EditFileInputSchema = z\n  .strictObject({\n    path: RequiredPath.optional().describe('Single file path; mutually exclusive with files'),\n    edits: z\n      .array(EditSpecSchema)\n      .min(1)\n      .max(MAX_EDITS_PER_FILE)\n      .optional()\n      .describe('Replacements applied to path; not allowed when using files'),\n    files: z\n      .array(\n        z.strictObject({\n          path: RequiredPath,\n          edits: z\n            .array(EditSpecSchema)\n            .min(1)\n            .max(MAX_EDITS_PER_FILE)\n            .describe('Replacements to apply to this specific file'),\n        }),\n      )\n      .min(1)\n      .max(MAX_MULTI_FILES)\n      .optional()\n      .describe('Per-file entries (batch mode)'),\n    dryRun: defaultFalseBoolean(\n      'Preview diffs without writing to disk (default: false = apply edits)',\n    ),\n    ignoreWhitespace: defaultFalseBoolean(\n      'Ignore leading/trailing whitespace differences when matching oldText',\n    ),\n  })\n  .superRefine((value, ctx) => {\n    const hasPath = value.path !== undefined;\n    const hasFiles = value.files !== undefined;\n    if (hasPath === hasFiles) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['path'],\n        message: \"Provide exactly one of 'path' or 'files'\",\n        input: value,\n      });\n    }\n    if (hasPath && value.edits === undefined) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['edits'],\n        message: \"'edits' required when using 'path'\",\n        input: value,\n      });\n    }\n    if (hasFiles && value.edits !== undefined) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['edits'],\n        message: \"'edits' not allowed with 'files'; each file carries its own edits\",\n        input: value,\n      });\n    }\n    // Batch entries run in parallel and each rewrites its file whole, so two\n    // entries for one file race: the last write wins and the other's edits are\n    // lost while both report success. One entry per file.\n    const files = value.files ?? [];\n    for (const [index, file] of files.entries()) {\n      const first = files.findIndex((other) => isSamePath(other.path, file.path));\n      if (first < index) {\n        ctx.addIssue({\n          code: 'custom',\n          path: ['files', index, 'path'],\n          message: `duplicate of files[${String(first)}].path; put every edit for one file in a single entry`,\n          input: value,\n        });\n      }\n    }\n  })\n  // Mirror the superRefine on the wire: exactly one input mode, and single-file\n  // mode carries its own `edits`. Without `edits` in the first branch, `{ path }`\n  // alone validated against the published schema and was then rejected at\n  // runtime — the model had no way to see that coming.\n  .meta({ oneOf: [{ required: ['path', 'edits'] }, { required: ['files'] }] });\n\ntype EditFileValue = Omit<WrittenFileMeta, 'resourceLink'> & {\n  path: string;\n  modified: string;\n  appliedEdits: number;\n  linesAdded?: number;\n  linesRemoved?: number;\n  diff?: string;\n  unmatchedEdits?: string[];\n};\n\ninterface TextRange {\n  startIndex: number;\n  length: number;\n}\n\ninterface EditResult {\n  content: string;\n  appliedEdits: number;\n  unmatchedEdits: string[];\n  linesAdded?: number;\n  linesRemoved?: number;\n  diff?: string;\n}\n\nconst MAX_REPORTED_MATCH_LINES = 5;\n\ninterface EditMatches {\n  /** The first match; undefined when oldText matches nothing. */\n  first: TextRange | undefined;\n  count: number;\n  /** UTF-16 start offsets of the first {@link MAX_REPORTED_MATCH_LINES} matches. */\n  starts: number[];\n  truncated: boolean;\n}\n\n/**\n * Pattern for a whitespace run of oldText that contains a newline. Between two\n * pieces of text it stays flexible — at least one newline, as many as the file\n * has. At either edge of oldText it matches exactly the newlines written: a\n * flexible edge swallows the blank lines around the match and, at the trailing\n * edge, the next line's indentation, all of which newText then replaces. Each\n * newline may carry horizontal whitespace before it, which covers the `\\r` of\n * a CRLF file and a blank line with stray spaces.\n */\nfunction newlineRunPattern(token: string, edge: { leading: boolean; trailing: boolean }): string {\n  if (!edge.leading && !edge.trailing) return '(?:[^\\\\S\\\\n]*\\\\n)+[^\\\\S\\\\n]*';\n  const count = token.split('\\n').length - 1;\n  const lines = `(?:[^\\\\S\\\\n]*\\\\n){${String(count)}}`;\n  // Nothing after the final newline unless the caller wrote indentation there.\n  return edge.trailing && token.endsWith('\\n') ? lines : `${lines}[^\\\\S\\\\n]*`;\n}\n\n/**\n * Where `oldText` matches. `count` is non-overlapping occurrences, except that a\n * lone match with a second one overlapping it counts two (`abab` in `ababab`),\n * since either is a span the caller could have meant — the count is exact only\n * when it answers \"once or not\". Only the count and the first few starts are\n * kept: a short oldText in a large file can match millions of times.\n */\nfunction findEditMatches(content: string, oldText: string, ignoreWhitespace: boolean): EditMatches {\n  const found: EditMatches = { first: undefined, count: 0, starts: [], truncated: false };\n  // Returns true once the match is known ambiguous: applyEdits only needs\n  // 0 / 1 / >1 and a few starts, and counting every occurrence of a short\n  // oldText in a big file is wasted work (seconds under re2-wasm).\n  const add = (startIndex: number, length: number): boolean => {\n    found.first ??= { startIndex, length };\n    found.count += 1;\n    if (found.starts.length < MAX_REPORTED_MATCH_LINES) found.starts.push(startIndex);\n    found.truncated = found.count > MAX_REPORTED_MATCH_LINES;\n    return found.truncated;\n  };\n\n  if (ignoreWhitespace) {\n    // Make whitespace flexible (tolerate indentation/spacing differences)\n    // without letting it cross line boundaries: a whitespace run that contains\n    // a newline keeps at least one newline, so a single-line oldText cannot\n    // match across a newline and a multi-line oldText cannot collapse onto one\n    // line. Horizontal whitespace stays mandatory between word characters so\n    // adjacent identifiers are not merged. Built token by token: `split` on\n    // whitespace puts text at even indices and whitespace runs at odd ones.\n    // A newline run at either edge of oldText matches exactly, so the edit\n    // cannot reach past the lines the caller named.\n    const tokens = oldText.split(/(\\s+)/u);\n    const last = tokens.length - 1;\n    let pattern = '';\n    for (const [i, token] of tokens.entries()) {\n      if (i % 2 === 0) {\n        pattern += escapeRegExp(token);\n      } else if (token.includes('\\n')) {\n        pattern += newlineRunPattern(token, {\n          leading: i === 1 && tokens[0] === '',\n          trailing: i === last - 1 && tokens[last] === '',\n        });\n      } else if (/\\w$/.test(tokens[i - 1] ?? '') && /^\\w/.test(tokens[i + 1] ?? '')) {\n        pattern += '[^\\\\S\\\\n]+';\n      } else {\n        pattern += '[^\\\\S\\\\n]*';\n      }\n    }\n    const regex = compileRegex(pattern, { caseSensitive: true });\n    try {\n      // execMatches resets lastIndex and reports UTF-16 offsets; the raw RE2\n      // index counts code points and would splice off-by-one per emoji.\n      const scan = (from: number): void => {\n        for (const match of execMatches(regex, from === 0 ? content : content.slice(from))) {\n          // A zero-length match names an empty span, which cannot be replaced.\n          if (match.text.length > 0 && add(from + match.start, match.text.length)) return;\n          if (from > 0) return;\n        }\n      };\n      scan(0);\n      // execMatches resumes past each match, so a second match overlapping the\n      // first is never reported; look once more from just past its first\n      // non-whitespace character. Starting inside the leading whitespace would\n      // re-find the same occurrence, since the pattern's leading run is `*`. The\n      // pattern carries no anchors, so matching a suffix finds the same spans.\n      if (found.count === 1 && found.first) {\n        const { startIndex, length } = found.first;\n        const lead = content.slice(startIndex, startIndex + length).search(/\\S/u);\n        scan(afterCodePoint(content, startIndex + lead));\n      }\n    } finally {\n      // The compiled pattern owns wasm memory re2-wasm never reclaims on its\n      // own; its lifetime is this one search.\n      freeRegex(regex);\n    }\n    return found;\n  }\n\n  // Non-overlapping, so the scan stays linear on repetitive content; the one\n  // overlap that matters — a second match inside the only one — is checked after.\n  for (\n    let i = content.indexOf(oldText);\n    i !== -1;\n    i = content.indexOf(oldText, i + oldText.length)\n  ) {\n    if (add(i, oldText.length)) break;\n  }\n  if (found.count === 1 && found.first) {\n    const overlap = content.indexOf(oldText, afterCodePoint(content, found.first.startIndex));\n    if (overlap !== -1) add(overlap, oldText.length);\n  }\n  return found;\n}\n\n/** The UTF-16 offset just past the code point at `index`, so a surrogate pair is never split. */\nfunction afterCodePoint(content: string, index: number): number {\n  return index + ((content.codePointAt(index) ?? 0) > 0xffff ? 2 : 1);\n}\n\nfunction ambiguousEditError(\n  content: string,\n  found: EditMatches,\n  editIndex: number,\n  shifted: boolean,\n): FsError {\n  const lines = [\n    ...new Set(found.starts.map((start) => content.slice(0, start).split('\\n').length)),\n  ];\n  const label = lines.length === 1 ? 'line' : 'lines';\n  const more = found.count > found.starts.length ? ', ...' : '';\n  // Offsets come from the content as earlier edits in this call left it, which\n  // is not the file the caller read once one of them has applied.\n  const where = shifted ? ' after earlier edits' : '';\n  const count = found.truncated ? `at least ${String(found.count)}` : String(found.count);\n  return new FsError(\n    ErrorCode.INVALID_INPUT,\n    `edits[${String(editIndex)}]: oldText matches ${count} places${where} ` +\n      `(${label} ${lines.join(', ')}${more}). Add surrounding lines so it matches once.`,\n  );\n}\n\n// A file whose every newline is CRLF gets LF-only edit text converted to match\n// — the rule jsdiff's autoConvertLineEndings applies for `patch`. Range, head\n// and tail reads strip `\\r`, so the oldText a model sends is LF-only; text that\n// already carries a `\\r` is taken as written. Mixed-ending files are not\n// converted: there is no one ending to convert to.\nfunction usesCrlf(content: string): boolean {\n  return content.includes('\\r\\n') && !/(?<!\\r)\\n/u.test(content);\n}\n\nfunction toCrlf(text: string): string {\n  return text.includes('\\r') ? text : text.replaceAll('\\n', '\\r\\n');\n}\n\nfunction applyEdits(\n  content: string,\n  edits: z.infer<typeof EditSpecSchema>[],\n  ignoreWhitespace: boolean,\n): EditResult {\n  let newContent = content;\n  let appliedEdits = 0;\n  const unmatchedEdits: string[] = [];\n  const crlf = usesCrlf(content);\n\n  for (const [index, edit] of edits.entries()) {\n    const oldText = crlf ? toCrlf(edit.oldText) : edit.oldText;\n    const newText = crlf ? toCrlf(edit.newText) : edit.newText;\n    const found = findEditMatches(newContent, oldText, ignoreWhitespace);\n\n    // A second match is an error rather than a pick: splicing the first would\n    // edit a block the caller may not have meant and still report success.\n    if (found.count > 1) throw ambiguousEditError(newContent, found, index, appliedEdits > 0);\n\n    if (!found.first) {\n      unmatchedEdits.push(edit.oldText);\n      continue;\n    }\n\n    const first = found.first;\n    newContent =\n      newContent.slice(0, first.startIndex) +\n      newText +\n      newContent.slice(first.startIndex + first.length);\n    appliedEdits += 1;\n  }\n\n  return { content: newContent, appliedEdits, unmatchedEdits };\n}\n\nasync function editOnce(\n  filePath: string,\n  edits: z.infer<typeof EditSpecSchema>[],\n  options: { dryRun: boolean; ignoreWhitespace: boolean },\n  ctx: ToolCtx,\n): Promise<{ file: EditFileValue; resourceLink?: ContentBlock }> {\n  const { validPath, content } = await ctx.fs.readEditableText(filePath, {\n    signal: ctx.signal,\n  });\n  const editResult = applyEdits(content, edits, options.ignoreWhitespace);\n  // One Myers pass serves both the dry-run preview and the line counts.\n  const patch =\n    editResult.appliedEdits > 0\n      ? unifiedPatch(basename(validPath), content, editResult.content)\n      : undefined;\n  if (patch !== undefined) Object.assign(editResult, diffStatsFromPatch(patch));\n\n  if (options.dryRun) {\n    if (patch !== undefined) editResult.diff = patch;\n  } else {\n    if (editResult.unmatchedEdits.length > 0) {\n      throw new FsError(\n        ErrorCode.INVALID_INPUT,\n        `no match for oldText ${joinRoster(\n          editResult.unmatchedEdits.map((t) => JSON.stringify(truncateProgressPattern(t))),\n          ', ',\n        )}; it must match the file exactly`,\n        filePath,\n      );\n    }\n\n    if (editResult.appliedEdits > 0) {\n      await ctx.fs.writeFile(filePath, editResult.content, {\n        signal: ctx.signal,\n      });\n      ctx.log(\n        'info',\n        `edit: ${filePath} (${editResult.appliedEdits} edits, +${String(editResult.linesAdded ?? 0)}/-${String(editResult.linesRemoved ?? 0)})`,\n        'edit',\n      );\n    }\n  }\n\n  // `modified` is read from a post-write stat and is advisory: under a concurrent\n  // writer it may reflect that writer's mtime while `size`/content below come from\n  // this edit's atomic write. The file content itself is always consistent. A dry\n  // run wrote nothing, so it reports the time of the preview.\n  const modified = options.dryRun\n    ? new Date().toISOString()\n    : (await ctx.fs.stat(filePath, { signal: ctx.signal })).stats.mtime.toISOString();\n  const meta = buildWrittenFileMeta({\n    validPath,\n    content: editResult.content,\n    dryRun: options.dryRun,\n    lastModified: modified,\n  });\n  const { resourceLink, ...fileMeta } = meta;\n  return {\n    file: {\n      path: validPath,\n      ...fileMeta,\n      modified,\n      appliedEdits: editResult.appliedEdits,\n      ...(editResult.appliedEdits > 0 &&\n      editResult.linesAdded !== undefined &&\n      editResult.linesRemoved !== undefined\n        ? { linesAdded: editResult.linesAdded, linesRemoved: editResult.linesRemoved }\n        : {}),\n      ...(editResult.unmatchedEdits.length > 0\n        ? { unmatchedEdits: editResult.unmatchedEdits }\n        : {}),\n      ...(editResult.diff ? { diff: editResult.diff } : {}),\n    },\n    ...(resourceLink ? { resourceLink } : {}),\n  };\n}\n\nfunction formatEditSummary(\n  results: readonly PerPathResult<EditFileValue>[],\n  dryRun: boolean,\n): string {\n  const tag = dryRun ? ' [dry run]' : '';\n  // Single-file failure: say why here rather than making the caller read\n  // structuredContent for the one message that can apply.\n  const [only] = results;\n  if (results.length === 1 && only && 'error' in only) {\n    return `edit: ${only.path} FAILED — ${only.error.message}${tag}`;\n  }\n  const tokens = results.map((r) => {\n    if ('error' in r) return `${basename(r.path)} FAILED`;\n    const v = r.value;\n    if (v.unmatchedEdits && v.unmatchedEdits.length > 0) {\n      const quoted = v.unmatchedEdits.map((t) => JSON.stringify(truncateProgressPattern(t)));\n      return `${basename(v.path)} NO MATCH ${joinRoster(quoted, ', ')}`;\n    }\n    const added = v.linesAdded ?? 0;\n    const removed = v.linesRemoved ?? 0;\n    if (added === 0 && removed === 0) return `${basename(v.path)} (no change)`;\n    return `${basename(v.path)} +${String(added)} -${String(removed)}`;\n  });\n\n  const failed = results.filter((r) => 'error' in r).length;\n  const ok = results.length - failed;\n  const ratio = failed > 0 ? ` (${String(ok)}/${String(results.length)} ok)` : '';\n  // Only a dry run carries a diff, and it is the preview the caller asked for:\n  // the structured value ships under `_meta`, which clients do not show the model.\n  // A no-op edit still yields a header-only diff; it previews nothing.\n  const diffs = results\n    .map((r) => ('value' in r ? (r.value.diff ?? '') : ''))\n    .filter((d) => d.includes('\\n@@'))\n    .join('');\n  return `edit: ${tokens.join(' · ')}${ratio}${tag}${diffs ? `\\n\\n${diffs}` : ''}`;\n}\n\nexport const EDIT = defineTool<typeof EditFileInputSchema, BatchResult<EditFileValue>>({\n  name: 'edit',\n  title: 'Edit Files',\n  description:\n    'Edit text files in place by replacing exact oldText with newText, like str_replace. ' +\n    'Each oldText must match exactly once, and a file is written only if all its edits match. ' +\n    'replace_text replaces every occurrence across files.',\n  input: EditFileInputSchema,\n  readOnlyHint: false,\n  progress: (args) => {\n    const dryLabel = args.dryRun ? ' [dry run]' : '';\n    let subject: string;\n    if (args.path !== undefined) {\n      subject = basename(args.path);\n    } else if (args.files !== undefined) {\n      subject = `${args.files.length} files`;\n    } else {\n      subject = 'files';\n    }\n    return { label: `Edit${dryLabel}`, subject };\n  },\n  accessPaths: singleOrBatchAccessPaths,\n  run: async (args, ctx) => {\n    const items =\n      args.path !== undefined ? [{ path: args.path, edits: args.edits ?? [] }] : (args.files ?? []);\n\n    const batch = await runOverPaths(items, ctx, ErrorCode.UNKNOWN, ({ path, edits }) =>\n      // A dry run never writes, so it needs no lock.\n      args.dryRun\n        ? editOnce(path, edits, args, ctx)\n        : ctx.fs.lockForWrite(path, () => editOnce(path, edits, args, ctx)),\n    );\n\n    const perPathResults: PerPathResult<EditFileValue>[] = [];\n    const resourceLinks: ContentBlock[] = [];\n    for (const r of batch.results) {\n      if ('error' in r) {\n        perPathResults.push({ path: r.path, error: r.error });\n        continue;\n      }\n      perPathResults.push({ path: r.path, value: r.value.file });\n      if (r.value.resourceLink) resourceLinks.push(r.value.resourceLink);\n    }\n\n    const summaryText = formatEditSummary(perPathResults, args.dryRun);\n\n    return {\n      structured: {\n        results: perPathResults,\n        summary: batch.summary,\n      },\n      text: summaryText,\n      isError: isTotalFailure(batch.summary),\n      ...(resourceLinks.length > 0 ? { resources: resourceLinks } : {}),\n    };\n  },\n});\n"]}

package/dist/tools/find-files.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"find-files.d.ts","sourceRoot":"","sources":["../../src/tools/find-files.ts"],"names":[],"mappings":"AA4IA,eAAO,MAAM,UAAU,mCAyCrB,CAAC"}
+{"version":3,"file":"find-files.d.ts","sourceRoot":"","sources":["../../src/tools/find-files.ts"],"names":[],"mappings":"AAiEA,eAAO,MAAM,UAAU,mCAsFrB,CAAC"}