@j0hanz/filesystem-mcp 2.1.7 → 2.2.0

package/dist/tools/list.js

@@ -1,9 +1,9 @@
 import { basename } from 'node:path';
 import * as z from 'zod/v4';
-import { timedSignal } from '../core/concurrency.js';
-import { paginate } from '../core/cursor.js';
+import { pageQueryKey, paginate } from '../core/cursor.js';
 import { ErrorCode } from '../core/errors.js';
-import { DEFAULT_EXCLUDE_PATTERNS, globEntries, isIgnoredByGitignore, loadRootGitignore, } from '../core/glob.js';
+import { pageTrailer } from '../core/fmt.js';
+import { globEntries } from '../core/glob.js';
 import { toPosixRelative } from '../core/path.js';
 import { resolveEntryType } from '../core/primitives.js';
 import { CursorSchema, FileType as FileTypeEnum, includeHiddenField, includeIgnoredField, NextCursorSchema, NonNegInt, OptionalPath, PositiveInt, } from '../core/schema.js';
@@ -30,9 +30,6 @@ function compareEntries(a, b) {
     return a.name.localeCompare(b.name);
 }
 async function collect(rootPath, options) {
-    const gitignoreMatcher = options.includeIgnored
-        ? null
-        : await loadRootGitignore(rootPath, options.signal);
     const entries = [];
     let scanned = 0;
     let totalEntries = 0;
@@ -41,7 +38,8 @@ async function collect(rootPath, options) {
     for await (const entry of globEntries({
         cwd: rootPath,
         pattern: '**/*',
-        excludePatterns: options.includeIgnored ? [] : DEFAULT_EXCLUDE_PATTERNS,
+        skipIgnored: !options.includeIgnored,
+        signal: options.signal,
         includeHidden: options.includeHidden,
         baseNameMatch: false,
         // ListInputSchema.maxDepth is 1-based (1 = top-level only); the shared
@@ -54,15 +52,8 @@ async function collect(rootPath, options) {
         scanned++;
         options.onProgress?.({ current: scanned });
         const entryType = resolveEntryType(entry.dirent);
-        const isDir = entryType === 'directory';
         const relPath = toPosixRelative(rootPath, entry.path);
         const name = basename(relPath);
-        if (gitignoreMatcher &&
-            isIgnoredByGitignore(gitignoreMatcher, rootPath, entry.path, {
-                isDirectory: isDir,
-            })) {
-            continue;
-        }
         const accessible = await options.pathGuard.isEntryAccessible(entry.path);
         if (!accessible)
             continue;
@@ -168,15 +159,6 @@ const ListOutputSchema = z.strictObject({
         'bounded by that cap and marked truncated if exceeded.'),
     nextCursor: NextCursorSchema,
 });
-function listQueryKey(args, path) {
-    return JSON.stringify({
-        method: 'list',
-        path,
-        maxDepth: args.maxDepth,
-        includeHidden: args.includeHidden,
-        includeIgnored: args.includeIgnored,
-    });
-}
 function listOutput(entries, metadata, nextCursor, resourceUri) {
     return {
         path: metadata.path,
@@ -192,7 +174,13 @@ function listOutput(entries, metadata, nextCursor, resourceUri) {
 async function handleList(args, ctx) {
     const path = args.path;
     const resolvedPath = ctx.fs.pathGuard.resolvePathOrRoot(path);
-    const queryKey = listQueryKey(args, resolvedPath);
+    const queryKey = pageQueryKey({
+        method: 'list',
+        path: resolvedPath,
+        maxDepth: args.maxDepth,
+        includeHidden: args.includeHidden,
+        includeIgnored: args.includeIgnored,
+    });
     const { resourceStore } = ctx;
     const paged = await paginate({
         store: ctx.pageStore,
@@ -205,7 +193,7 @@ async function handleList(args, ctx) {
                 maxDepth: args.maxDepth,
                 includeHidden: args.includeHidden,
                 includeIgnored: args.includeIgnored,
-                signal: timedSignal(ctx.signal, DEFAULT_SEARCH_TIMEOUT_MS),
+                signal: AbortSignal.any([ctx.signal, AbortSignal.timeout(DEFAULT_SEARCH_TIMEOUT_MS)]),
                 pathGuard: ctx.fs.pathGuard,
                 entryCap: MAX_LIST_ENTRIES,
                 ...(ctx.onProgress ? { onProgress: ctx.onProgress } : {}),
@@ -241,6 +229,7 @@ async function handleList(args, ctx) {
     return {
         structured: listOutput(paged.page, paged.metadata, paged.nextCursor, paged.resource?.entry.uri),
         markdown: renderMarkdown(basename(paged.metadata.path), [...paged.page]),
+        offset: paged.offset,
         ...(paged.resource ? { link: paged.resource.link } : {}),
     };
 }
@@ -269,20 +258,23 @@ export const LIST = defineTool({
     }),
     accessPaths: (args) => (args.path ? [args.path] : []),
     run: async (args, ctx) => {
-        const { structured, markdown, link } = await handleList(args, ctx);
-        // The tree is what the model reads; nextCursor and the full-list URI used
-        // to reach it only through the structured half, which now ships as _meta.
-        // Both ride the text so paging needs no second lookup.
-        const trailer = [];
-        if (structured.nextCursor !== undefined) {
-            trailer.push(`nextCursor: ${structured.nextCursor}`);
-        }
-        if (structured.resourceUri !== undefined) {
-            trailer.push(`${String(structured.entryCount)} of ${String(structured.totalEntries)} entries shown; full tree at ${structured.resourceUri}`);
-        }
+        const { structured, markdown, offset, link } = await handleList(args, ctx);
+        // The tree is what the model reads, so position and the full-list URI ride
+        // the text too — paging needs no second lookup. `pageTrailer` is the one
+        // owner of that line, and it owes it on the last page as much as the first.
+        const text = markdown +
+            pageTrailer({
+                offset,
+                shown: structured.entryCount,
+                total: structured.totalEntries,
+                noun: 'entries',
+                tool: 'list',
+                nextCursor: structured.nextCursor,
+            }) +
+            (structured.resourceUri !== undefined ? `\nfull tree at ${structured.resourceUri}` : '');
         return {
             structured,
-            text: trailer.length > 0 ? `${markdown}\n\n${trailer.join('\n')}` : markdown,
+            text,
             ...(link ? { resources: [link] } : {}),
         };
     },

package/dist/tools/list.js.map

@@ -1 +1 @@
-{"version":3,"file":"list.js","sourceRoot":"","sources":["../../src/tools/list.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAE9C,OAAO,EACL,wBAAwB,EACxB,WAAW,EACX,oBAAoB,EACpB,iBAAiB,GAClB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EACL,YAAY,EACZ,QAAQ,IAAI,YAAY,EACxB,kBAAkB,EAClB,mBAAmB,EACnB,gBAAgB,EAChB,SAAS,EACT,YAAY,EACZ,WAAW,GACZ,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EACL,yBAAyB,EACzB,oBAAoB,EACpB,gBAAgB,EAChB,cAAc,GACf,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,UAAU,EAAgB,MAAM,aAAa,CAAC;AA0BvD,SAAS,aAAa,CAAC,IAAe;IACpC,IAAI,IAAI,KAAK,WAAW;QAAE,OAAO,CAAC,CAAC;IACnC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,cAAc,CAAC,CAAiB,EAAE,CAAiB;IAC1D,2DAA2D;IAC3D,MAAM,MAAM,GAAG,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACrE,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAErE,IAAI,OAAO,KAAK,OAAO;QAAE,OAAO,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAE/D,oDAAoD;IACpD,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/D,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IACpC,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC;AAED,KAAK,UAAU,OAAO,CAAC,QAAgB,EAAE,OAAuB;IAC9D,MAAM,gBAAgB,GAAG,OAAO,CAAC,cAAc;QAC7C,CAAC,CAAC,IAAI;QACN,CAAC,CAAC,MAAM,iBAAiB,CAAC,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAEtD,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,gBAAgB,GAAG,CAAC,CAAC;IAEzB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,WAAW,CAAC;QACpC,GAAG,EAAE,QAAQ;QACb,OAAO,EAAE,MAAM;QACf,eAAe,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,wBAAwB;QACvE,aAAa,EAAE,OAAO,CAAC,aAAa;QACpC,aAAa,EAAE,KAAK;QACpB,uEAAuE;QACvE,+EAA+E;QAC/E,0EAA0E;QAC1E,QAAQ,EAAE,OAAO,CAAC,QAAQ,GAAG,CAAC;QAC9B,SAAS,EAAE,KAAK;KACjB,CAAC,EAAE,CAAC;QACH,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;QAChC,OAAO,EAAE,CAAC;QACV,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;QAE3C,MAAM,SAAS,GAAc,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC5D,MAAM,KAAK,GAAG,SAAS,KAAK,WAAW,CAAC;QACxC,MAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAE/B,IACE,gBAAgB;YAChB,oBAAoB,CAAC,gBAAgB,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE;gBAC3D,WAAW,EAAE,KAAK;aACnB,CAAC,EACF,CAAC;YACD,SAAS;QACX,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,SAAS,CAAC,iBAAiB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACzE,IAAI,CAAC,UAAU;YAAE,SAAS;QAE1B,YAAY,EAAE,CAAC;QACf,IAAI,SAAS,KAAK,WAAW,EAAE,CAAC;YAC9B,gBAAgB,EAAE,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,UAAU,EAAE,CAAC;QACf,CAAC;QAED,MAAM,cAAc,GAAmB;YACrC,IAAI;YACJ,YAAY,EAAE,OAAO;YACrB,IAAI,EAAE,SAAS;SAChB,CAAC;QAEF,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YACtC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAE7B,OAAO;QACL,OAAO;QACP,YAAY;QACZ,UAAU;QACV,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED,MAAM,GAAG,GAAG,MAAM,CAAC;AACnB,MAAM,KAAK,GAAG,MAAM,CAAC;AACrB,MAAM,IAAI,GAAG,MAAM,CAAC;AACpB,MAAM,MAAM,GAAG,MAAM,CAAC;AAEtB,SAAS,cAAc,CAAC,QAAgB,EAAE,OAAkC;IAC1E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAE1C,+BAA+B;IAC/B,MAAM,UAAU,GAAG,IAAI,GAAG,EAA4B,CAAC;IACvD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAClD,MAAM,SAAS,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACzE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,QAAQ;YAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,KAAK,GAAa,CAAC,QAAQ,CAAC,CAAC;IAEnC,SAAS,cAAc,CAAC,SAAiB,EAAE,MAAc;QACvD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,MAAM,MAAM,GAAG,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YACzC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YAE5C,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;YACpC,MAAM,UAAU,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACrD,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,cAAc,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACvB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAC7B,MAAM,oBAAoB,GAAG,oBAAoB,CAAC;AAElD,MAAM,eAAe,GAAG,CAAC,CAAC,YAAY,CAAC;IACrC,IAAI,EAAE,YAAY,CAAC,QAAQ,CAAC,iDAAiD,CAAC;IAC9E,QAAQ,EAAE,WAAW,CAAC,GAAG,CAAC,cAAc,CAAC;SACtC,OAAO,CAAC,kBAAkB,CAAC;SAC3B,QAAQ,CACP,6CAA6C,MAAM,CAAC,kBAAkB,CAAC,gDAAgD,CACxH;IACH,UAAU,EAAE,WAAW,CAAC,GAAG,CAAC,gBAAgB,CAAC;SAC1C,OAAO,CAAC,oBAAoB,CAAC;SAC7B,QAAQ,CACP,uBAAuB,MAAM,CAAC,oBAAoB,CAAC,oGAAoG,CACxJ;IACH,aAAa,EAAE,kBAAkB,EAAE;IACnC,cAAc,EAAE,mBAAmB,EAAE;IACrC,MAAM,EAAE,YAAY;CACrB,CAAC,CAAC;AAEH,MAAM,gBAAgB,GAAG,CAAC,CAAC,YAAY,CAAC;IACtC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,gDAAgD,CAAC;IACtF,OAAO,EAAE,CAAC;SACP,KAAK,CACJ,CAAC,CAAC,YAAY,CAAC;QACb,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gBAAgB,CAAC;QAC3C,YAAY,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,6CAA6C,CAAC;QAChF,IAAI,EAAE,YAAY,CAAC,QAAQ,CAAC,gDAAgD,CAAC;KAC9E,CAAC,CACH;SACA,QAAQ,CAAC,+EAA+E,CAAC;IAC5F,8EAA8E;IAC9E,2EAA2E;IAC3E,6EAA6E;IAC7E,iEAAiE;IACjE,UAAU,EAAE,SAAS,CAAC,QAAQ,CAAC,6CAA6C,CAAC;IAC7E,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,2DAA2D,CAAC;IAC7F,UAAU,EAAE,SAAS,CAAC,QAAQ,CAAC,6BAA6B,CAAC;IAC7D,gBAAgB,EAAE,SAAS,CAAC,QAAQ,CAAC,mCAAmC,CAAC;IACzE,WAAW,EAAE,CAAC;SACX,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,8FAA8F;QAC5F,6FAA6F;QAC7F,uDAAuD,CAC1D;IACH,UAAU,EAAE,gBAAgB;CAC7B,CAAC,CAAC;AASH,SAAS,YAAY,CAAC,IAAqC,EAAE,IAAY;IACvE,OAAO,IAAI,CAAC,SAAS,CAAC;QACpB,MAAM,EAAE,MAAM;QACd,IAAI;QACJ,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,aAAa,EAAE,IAAI,CAAC,aAAa;QACjC,cAAc,EAAE,IAAI,CAAC,cAAc;KACpC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,UAAU,CACjB,OAAkC,EAClC,QAA0B,EAC1B,UAA8B,EAC9B,WAA+B;IAE/B,OAAO;QACL,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;QACrB,UAAU,EAAE,OAAO,CAAC,MAAM;QAC1B,YAAY,EAAE,QAAQ,CAAC,YAAY;QACnC,UAAU,EAAE,QAAQ,CAAC,UAAU;QAC/B,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB;QAC3C,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,GAAG,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpD,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,UAAU,CACvB,IAAqC,EACrC,GAAY;IAMZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,MAAM,YAAY,GAAG,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAC9D,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAClD,MAAM,EAAE,aAAa,EAAE,GAAG,GAAG,CAAC;IAE9B,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAuD;QACjF,KAAK,EAAE,GAAG,CAAC,SAAS;QACpB,QAAQ;QACR,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,UAAU;QACzB,OAAO,EAAE,KAAK,IAAI,EAAE;YAClB,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,yBAAyB,CAAC,YAAY,CAAC,CAAC;YAChF,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE;gBACrC,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,aAAa,EAAE,IAAI,CAAC,aAAa;gBACjC,cAAc,EAAE,IAAI,CAAC,cAAc;gBACnC,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,yBAAyB,CAAC;gBAC1D,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,SAAS;gBAC3B,QAAQ,EAAE,gBAAgB;gBAC1B,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC1D,CAAC,CAAC;YACH,OAAO;gBACL,KAAK,EAAE,MAAM,CAAC,OAAO;gBACrB,QAAQ,EAAE;oBACR,IAAI,EAAE,QAAQ;oBACd,YAAY,EAAE,MAAM,CAAC,YAAY;oBACjC,UAAU,EAAE,MAAM,CAAC,UAAU;oBAC7B,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;iBAC1C;gBACD,SAAS,EAAE,MAAM,CAAC,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM;aACvD,CAAC;QACJ,CAAC;QACD,WAAW,EAAE,aAAa;YACxB,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE;gBACpB,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACrC,qEAAqE;gBACrE,4CAA4C;gBAC5C,MAAM,UAAU,GAAG;oBACjB,OAAO;oBACP,QAAQ,EAAE,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC;oBACvC,YAAY,EAAE,QAAQ,CAAC,YAAY;oBACnC,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB;oBAC3C,GAAG,CAAC,QAAQ,CAAC,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACvE,CAAC;gBACF,OAAO,eAAe,CAAC,aAAa,EAAE,GAAG,IAAI,OAAO,EAAE,UAAU,CAAC,CAAC;YACpE,CAAC;YACH,CAAC,CAAC,SAAS;KACd,CAAC,CAAC;IAEH,OAAO;QACL,UAAU,EAAE,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC;QAC/F,QAAQ,EAAE,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxE,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACzD,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,UAAU,CAAC;IAC7B,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,MAAM;IACb,WAAW,EACT,4EAA4E;QAC5E,4HAA4H;IAC9H,KAAK,EAAE,eAAe;IACtB,MAAM,EAAE,gBAAgB;IACxB,sEAAsE;IACtE,wEAAwE;IACxE,6EAA6E;IAC7E,0DAA0D;IAC1D,WAAW,EAAE;QACX,YAAY,EAAE,IAAI;QAClB,cAAc,EAAE,IAAI;QACpB,eAAe,EAAE,KAAK;QACtB,aAAa,EAAE,KAAK;KACrB;IACD,SAAS,EAAE,yBAAyB;IACpC,gBAAgB,EAAE,SAAS,CAAC,aAAa;IACzC,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnB,KAAK,EAAE,MAAM;QACb,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG;KAC/C,CAAC;IACF,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACrD,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACnE,0EAA0E;QAC1E,0EAA0E;QAC1E,uDAAuD;QACvD,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,UAAU,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CAAC,eAAe,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,UAAU,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CACV,GAAG,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,OAAO,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,gCAAgC,UAAU,CAAC,WAAW,EAAE,CAC/H,CAAC;QACJ,CAAC;QACD,OAAO;YACL,UAAU;YACV,IAAI,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,OAAO,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ;YAC5E,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACvC,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 { timedSignal } from '../core/concurrency.js';\nimport { paginate } from '../core/cursor.js';\nimport { ErrorCode } from '../core/errors.js';\nimport type { EntryType } from '../core/glob.js';\nimport {\n  DEFAULT_EXCLUDE_PATTERNS,\n  globEntries,\n  isIgnoredByGitignore,\n  loadRootGitignore,\n} from '../core/glob.js';\nimport type { PathGuard } from '../core/path.js';\nimport { toPosixRelative } from '../core/path.js';\nimport { resolveEntryType } from '../core/primitives.js';\nimport {\n  CursorSchema,\n  FileType as FileTypeEnum,\n  includeHiddenField,\n  includeIgnoredField,\n  NextCursorSchema,\n  NonNegInt,\n  OptionalPath,\n  PositiveInt,\n} from '../core/schema.js';\nimport type { JsonResourceResult } from '../core/store.js';\nimport { putJsonResource } from '../core/store.js';\nimport {\n  DEFAULT_SEARCH_TIMEOUT_MS,\n  DEFAULT_TREE_ENTRIES,\n  MAX_LIST_ENTRIES,\n  MAX_TREE_DEPTH,\n} from '../core/util.js';\nimport { defineTool, type ToolCtx } from './define.js';\n\ninterface CollectedEntry {\n  name: string;\n  relativePath: string; // POSIX\n  type: EntryType;\n}\n\ninterface CollectOptions {\n  maxDepth: number;\n  includeHidden: boolean;\n  includeIgnored: boolean;\n  signal: AbortSignal;\n  pathGuard: PathGuard;\n  /** Upper bound on the stored, paginable entry array. */\n  entryCap: number;\n  onProgress?: (progress: { current: number; total?: number }) => void;\n}\n\ninterface CollectResult {\n  entries: CollectedEntry[];\n  totalEntries: number;\n  totalFiles: number;\n  totalDirectories: number;\n}\n\nfunction entryTypeRank(type: EntryType): number {\n  if (type === 'directory') return 0;\n  return 1;\n}\n\nfunction compareEntries(a: CollectedEntry, b: CollectedEntry): number {\n  // Compare by parent directory first (depth-level grouping)\n  const slashA = a.relativePath.lastIndexOf('/');\n  const slashB = b.relativePath.lastIndexOf('/');\n  const parentA = slashA === -1 ? '' : a.relativePath.slice(0, slashA);\n  const parentB = slashB === -1 ? '' : b.relativePath.slice(0, slashB);\n\n  if (parentA !== parentB) return parentA.localeCompare(parentB);\n\n  // Within same parent: dirs first, then alphabetical\n  const rankDiff = entryTypeRank(a.type) - entryTypeRank(b.type);\n  if (rankDiff !== 0) return rankDiff;\n  return a.name.localeCompare(b.name);\n}\n\nasync function collect(rootPath: string, options: CollectOptions): Promise<CollectResult> {\n  const gitignoreMatcher = options.includeIgnored\n    ? null\n    : await loadRootGitignore(rootPath, options.signal);\n\n  const entries: CollectedEntry[] = [];\n  let scanned = 0;\n  let totalEntries = 0;\n  let totalFiles = 0;\n  let totalDirectories = 0;\n\n  for await (const entry of globEntries({\n    cwd: rootPath,\n    pattern: '**/*',\n    excludePatterns: options.includeIgnored ? [] : DEFAULT_EXCLUDE_PATTERNS,\n    includeHidden: options.includeHidden,\n    baseNameMatch: false,\n    // ListInputSchema.maxDepth is 1-based (1 = top-level only); the shared\n    // globEntries primitive is now 0-based, so subtract one here. options.maxDepth\n    // is guaranteed >= 1 by its PositiveInt schema, so this never underflows.\n    maxDepth: options.maxDepth - 1,\n    onlyFiles: false,\n  })) {\n    options.signal.throwIfAborted();\n    scanned++;\n    options.onProgress?.({ current: scanned });\n\n    const entryType: EntryType = resolveEntryType(entry.dirent);\n    const isDir = entryType === 'directory';\n    const relPath = toPosixRelative(rootPath, entry.path);\n    const name = basename(relPath);\n\n    if (\n      gitignoreMatcher &&\n      isIgnoredByGitignore(gitignoreMatcher, rootPath, entry.path, {\n        isDirectory: isDir,\n      })\n    ) {\n      continue;\n    }\n    const accessible = await options.pathGuard.isEntryAccessible(entry.path);\n    if (!accessible) continue;\n\n    totalEntries++;\n    if (entryType === 'directory') {\n      totalDirectories++;\n    } else {\n      totalFiles++;\n    }\n\n    const collectedEntry: CollectedEntry = {\n      name,\n      relativePath: relPath,\n      type: entryType,\n    };\n\n    if (entries.length < options.entryCap) {\n      entries.push(collectedEntry);\n    }\n  }\n\n  options.signal.throwIfAborted();\n  entries.sort(compareEntries);\n\n  return {\n    entries,\n    totalEntries,\n    totalFiles,\n    totalDirectories,\n  };\n}\n\nconst TEE = '├── ';\nconst ELBOW = '└── ';\nconst PIPE = '│   ';\nconst INDENT = '    ';\n\nfunction renderMarkdown(rootName: string, entries: readonly CollectedEntry[]): string {\n  if (entries.length === 0) return rootName;\n\n  // Group entries by parent path\n  const childrenOf = new Map<string, CollectedEntry[]>();\n  for (const entry of entries) {\n    const slash = entry.relativePath.lastIndexOf('/');\n    const parentKey = slash === -1 ? '' : entry.relativePath.slice(0, slash);\n    if (!childrenOf.has(parentKey)) childrenOf.set(parentKey, []);\n    const children = childrenOf.get(parentKey);\n    if (children) children.push(entry);\n  }\n\n  const lines: string[] = [rootName];\n\n  function renderChildren(parentKey: string, prefix: string): void {\n    const children = childrenOf.get(parentKey);\n    if (!children) return;\n\n    for (let i = 0; i < children.length; i++) {\n      const child = children[i];\n      if (!child) continue;\n      const isLast = i === children.length - 1;\n      const connector = isLast ? ELBOW : TEE;\n      lines.push(prefix + connector + child.name);\n\n      const childKey = child.relativePath;\n      const nextPrefix = prefix + (isLast ? INDENT : PIPE);\n      renderChildren(childKey, nextPrefix);\n    }\n  }\n\n  renderChildren('', '');\n  return lines.join('\\n');\n}\n\nconst DEFAULT_LIST_DEPTH = 1;\nconst DEFAULT_LIST_ENTRIES = DEFAULT_TREE_ENTRIES;\n\nconst ListInputSchema = z.strictObject({\n  path: OptionalPath.describe('Directory to list (default: first allowed root)'),\n  maxDepth: PositiveInt.max(MAX_TREE_DEPTH)\n    .default(DEFAULT_LIST_DEPTH)\n    .describe(\n      `Max directory depth to traverse (default: ${String(DEFAULT_LIST_DEPTH)} = top-level only; increase to recurse deeper)`,\n    ),\n  maxEntries: PositiveInt.max(MAX_LIST_ENTRIES)\n    .default(DEFAULT_LIST_ENTRIES)\n    .describe(\n      `Page size (default: ${String(DEFAULT_LIST_ENTRIES)}). Continue with nextCursor; an incomplete first page also carries resourceUri for the whole list.`,\n    ),\n  includeHidden: includeHiddenField(),\n  includeIgnored: includeIgnoredField(),\n  cursor: CursorSchema,\n});\n\nconst ListOutputSchema = z.strictObject({\n  path: z.string().optional().describe('Resolved absolute path of the listed directory'),\n  entries: z\n    .array(\n      z.strictObject({\n        name: z.string().describe('Entry basename'),\n        relativePath: z.string().describe('POSIX path relative to the listed directory'),\n        type: FileTypeEnum.describe('Entry type: file, directory, symlink, or other'),\n      }),\n    )\n    .describe('Inline directory entries sorted directories-first then alphabetically by name'),\n  // No `markdown` field: the ASCII tree is the call's text content already, and\n  // carrying it here too doubled every list response for a string the client\n  // has in hand. The stored full-tree resource still holds its own copy — that\n  // one is a *different* (uncapped) tree and is never sent inline.\n  entryCount: NonNegInt.describe('Number of entries included in this response'),\n  totalEntries: NonNegInt.describe('Total entries found before the maxEntries cap was applied'),\n  totalFiles: NonNegInt.describe('Total number of files found'),\n  totalDirectories: NonNegInt.describe('Total number of directories found'),\n  resourceUri: z\n    .string()\n    .optional()\n    .describe(\n      'URI to the full entry list in the resource store; first page only, whenever the response is ' +\n        'incomplete — more pages follow, or the hard cap cut the listing. The stored list is itself ' +\n        'bounded by that cap and marked truncated if exceeded.',\n    ),\n  nextCursor: NextCursorSchema,\n});\n\ninterface ListPageMetadata {\n  readonly path: string;\n  readonly totalEntries: number;\n  readonly totalFiles: number;\n  readonly totalDirectories: number;\n}\n\nfunction listQueryKey(args: z.infer<typeof ListInputSchema>, path: string): string {\n  return JSON.stringify({\n    method: 'list',\n    path,\n    maxDepth: args.maxDepth,\n    includeHidden: args.includeHidden,\n    includeIgnored: args.includeIgnored,\n  });\n}\n\nfunction listOutput(\n  entries: readonly CollectedEntry[],\n  metadata: ListPageMetadata,\n  nextCursor: string | undefined,\n  resourceUri: string | undefined,\n): z.infer<typeof ListOutputSchema> {\n  return {\n    path: metadata.path,\n    entries: [...entries],\n    entryCount: entries.length,\n    totalEntries: metadata.totalEntries,\n    totalFiles: metadata.totalFiles,\n    totalDirectories: metadata.totalDirectories,\n    ...(resourceUri !== undefined ? { resourceUri } : {}),\n    ...(nextCursor !== undefined ? { nextCursor } : {}),\n  };\n}\n\nasync function handleList(\n  args: z.infer<typeof ListInputSchema>,\n  ctx: ToolCtx,\n): Promise<{\n  structured: z.infer<typeof ListOutputSchema>;\n  markdown: string;\n  link?: ContentBlock;\n}> {\n  const path = args.path;\n  const resolvedPath = ctx.fs.pathGuard.resolvePathOrRoot(path);\n  const queryKey = listQueryKey(args, resolvedPath);\n  const { resourceStore } = ctx;\n\n  const paged = await paginate<CollectedEntry, ListPageMetadata, JsonResourceResult>({\n    store: ctx.pageStore,\n    queryKey,\n    cursor: args.cursor,\n    pageSize: args.maxEntries,\n    produce: async () => {\n      const validDir = await ctx.fs.pathGuard.validateExistingDirectory(resolvedPath);\n      const result = await collect(validDir, {\n        maxDepth: args.maxDepth,\n        includeHidden: args.includeHidden,\n        includeIgnored: args.includeIgnored,\n        signal: timedSignal(ctx.signal, DEFAULT_SEARCH_TIMEOUT_MS),\n        pathGuard: ctx.fs.pathGuard,\n        entryCap: MAX_LIST_ENTRIES,\n        ...(ctx.onProgress ? { onProgress: ctx.onProgress } : {}),\n      });\n      return {\n        items: result.entries,\n        metadata: {\n          path: validDir,\n          totalEntries: result.totalEntries,\n          totalFiles: result.totalFiles,\n          totalDirectories: result.totalDirectories,\n        },\n        truncated: result.totalEntries > result.entries.length,\n      };\n    },\n    externalize: resourceStore\n      ? (entries, metadata) => {\n          const name = basename(metadata.path);\n          // The stored tree is the whole collected set — itself bounded by the\n          // hard cap, and marked when the cap cut it.\n          const fullOutput = {\n            entries,\n            markdown: renderMarkdown(name, entries),\n            totalEntries: metadata.totalEntries,\n            totalFiles: metadata.totalFiles,\n            totalDirectories: metadata.totalDirectories,\n            ...(metadata.totalEntries > entries.length ? { truncated: true } : {}),\n          };\n          return putJsonResource(resourceStore, `${name} tree`, fullOutput);\n        }\n      : undefined,\n  });\n\n  return {\n    structured: listOutput(paged.page, paged.metadata, paged.nextCursor, paged.resource?.entry.uri),\n    markdown: renderMarkdown(basename(paged.metadata.path), [...paged.page]),\n    ...(paged.resource ? { link: paged.resource.link } : {}),\n  };\n}\n\nexport const LIST = defineTool({\n  name: 'list',\n  title: 'List',\n  description:\n    'List sorted directory entries and an ASCII tree. maxDepth=1 is top-level. ' +\n    'maxEntries sets page size; continue with nextCursor. An incomplete first page also carries resourceUri for the whole list.',\n  input: ListInputSchema,\n  output: ListOutputSchema,\n  // Not published: every field is a plainly-named scalar (`entryCount`,\n  // `totalFiles`, `nextCursor`) that one sample response teaches, and the\n  // schema costs 1599 chars of every session start. Publishing is reserved for\n  // the value-XOR-error union shape a sample cannot convey.\n  annotations: {\n    readOnlyHint: true,\n    idempotentHint: true,\n    destructiveHint: false,\n    openWorldHint: false,\n  },\n  timeoutMs: DEFAULT_SEARCH_TIMEOUT_MS,\n  defaultErrorCode: ErrorCode.NOT_DIRECTORY,\n  progress: (args) => ({\n    label: 'List',\n    subject: args.path ? basename(args.path) : '.',\n  }),\n  accessPaths: (args) => (args.path ? [args.path] : []),\n  run: async (args, ctx) => {\n    const { structured, markdown, link } = await handleList(args, ctx);\n    // The tree is what the model reads; nextCursor and the full-list URI used\n    // to reach it only through the structured half, which now ships as _meta.\n    // Both ride the text so paging needs no second lookup.\n    const trailer: string[] = [];\n    if (structured.nextCursor !== undefined) {\n      trailer.push(`nextCursor: ${structured.nextCursor}`);\n    }\n    if (structured.resourceUri !== undefined) {\n      trailer.push(\n        `${String(structured.entryCount)} of ${String(structured.totalEntries)} entries shown; full tree at ${structured.resourceUri}`,\n      );\n    }\n    return {\n      structured,\n      text: trailer.length > 0 ? `${markdown}\\n\\n${trailer.join('\\n')}` : markdown,\n      ...(link ? { resources: [link] } : {}),\n    };\n  },\n});\n"]}
+{"version":3,"file":"list.js","sourceRoot":"","sources":["../../src/tools/list.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC3D,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAE7C,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAE9C,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EACL,YAAY,EACZ,QAAQ,IAAI,YAAY,EACxB,kBAAkB,EAClB,mBAAmB,EACnB,gBAAgB,EAChB,SAAS,EACT,YAAY,EACZ,WAAW,GACZ,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EACL,yBAAyB,EACzB,oBAAoB,EACpB,gBAAgB,EAChB,cAAc,GACf,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,UAAU,EAAgB,MAAM,aAAa,CAAC;AA0BvD,SAAS,aAAa,CAAC,IAAe;IACpC,IAAI,IAAI,KAAK,WAAW;QAAE,OAAO,CAAC,CAAC;IACnC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,cAAc,CAAC,CAAiB,EAAE,CAAiB;IAC1D,2DAA2D;IAC3D,MAAM,MAAM,GAAG,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACrE,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAErE,IAAI,OAAO,KAAK,OAAO;QAAE,OAAO,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAE/D,oDAAoD;IACpD,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/D,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IACpC,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC;AAED,KAAK,UAAU,OAAO,CAAC,QAAgB,EAAE,OAAuB;IAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,gBAAgB,GAAG,CAAC,CAAC;IAEzB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,WAAW,CAAC;QACpC,GAAG,EAAE,QAAQ;QACb,OAAO,EAAE,MAAM;QACf,WAAW,EAAE,CAAC,OAAO,CAAC,cAAc;QACpC,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,aAAa,EAAE,OAAO,CAAC,aAAa;QACpC,aAAa,EAAE,KAAK;QACpB,uEAAuE;QACvE,+EAA+E;QAC/E,0EAA0E;QAC1E,QAAQ,EAAE,OAAO,CAAC,QAAQ,GAAG,CAAC;QAC9B,SAAS,EAAE,KAAK;KACjB,CAAC,EAAE,CAAC;QACH,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;QAChC,OAAO,EAAE,CAAC;QACV,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;QAE3C,MAAM,SAAS,GAAc,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAE/B,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,SAAS,CAAC,iBAAiB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACzE,IAAI,CAAC,UAAU;YAAE,SAAS;QAE1B,YAAY,EAAE,CAAC;QACf,IAAI,SAAS,KAAK,WAAW,EAAE,CAAC;YAC9B,gBAAgB,EAAE,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,UAAU,EAAE,CAAC;QACf,CAAC;QAED,MAAM,cAAc,GAAmB;YACrC,IAAI;YACJ,YAAY,EAAE,OAAO;YACrB,IAAI,EAAE,SAAS;SAChB,CAAC;QAEF,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YACtC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAE7B,OAAO;QACL,OAAO;QACP,YAAY;QACZ,UAAU;QACV,gBAAgB;KACjB,CAAC;AACJ,CAAC;AAED,MAAM,GAAG,GAAG,MAAM,CAAC;AACnB,MAAM,KAAK,GAAG,MAAM,CAAC;AACrB,MAAM,IAAI,GAAG,MAAM,CAAC;AACpB,MAAM,MAAM,GAAG,MAAM,CAAC;AAEtB,SAAS,cAAc,CAAC,QAAgB,EAAE,OAAkC;IAC1E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAE1C,+BAA+B;IAC/B,MAAM,UAAU,GAAG,IAAI,GAAG,EAA4B,CAAC;IACvD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAClD,MAAM,SAAS,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACzE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,QAAQ;YAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,KAAK,GAAa,CAAC,QAAQ,CAAC,CAAC;IAEnC,SAAS,cAAc,CAAC,SAAiB,EAAE,MAAc;QACvD,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,MAAM,MAAM,GAAG,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YACzC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YAE5C,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;YACpC,MAAM,UAAU,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACrD,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,cAAc,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACvB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAC7B,MAAM,oBAAoB,GAAG,oBAAoB,CAAC;AAElD,MAAM,eAAe,GAAG,CAAC,CAAC,YAAY,CAAC;IACrC,IAAI,EAAE,YAAY,CAAC,QAAQ,CAAC,iDAAiD,CAAC;IAC9E,QAAQ,EAAE,WAAW,CAAC,GAAG,CAAC,cAAc,CAAC;SACtC,OAAO,CAAC,kBAAkB,CAAC;SAC3B,QAAQ,CACP,6CAA6C,MAAM,CAAC,kBAAkB,CAAC,gDAAgD,CACxH;IACH,UAAU,EAAE,WAAW,CAAC,GAAG,CAAC,gBAAgB,CAAC;SAC1C,OAAO,CAAC,oBAAoB,CAAC;SAC7B,QAAQ,CACP,uBAAuB,MAAM,CAAC,oBAAoB,CAAC,oGAAoG,CACxJ;IACH,aAAa,EAAE,kBAAkB,EAAE;IACnC,cAAc,EAAE,mBAAmB,EAAE;IACrC,MAAM,EAAE,YAAY;CACrB,CAAC,CAAC;AAEH,MAAM,gBAAgB,GAAG,CAAC,CAAC,YAAY,CAAC;IACtC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,gDAAgD,CAAC;IACtF,OAAO,EAAE,CAAC;SACP,KAAK,CACJ,CAAC,CAAC,YAAY,CAAC;QACb,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gBAAgB,CAAC;QAC3C,YAAY,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,6CAA6C,CAAC;QAChF,IAAI,EAAE,YAAY,CAAC,QAAQ,CAAC,gDAAgD,CAAC;KAC9E,CAAC,CACH;SACA,QAAQ,CAAC,+EAA+E,CAAC;IAC5F,8EAA8E;IAC9E,2EAA2E;IAC3E,6EAA6E;IAC7E,iEAAiE;IACjE,UAAU,EAAE,SAAS,CAAC,QAAQ,CAAC,6CAA6C,CAAC;IAC7E,YAAY,EAAE,SAAS,CAAC,QAAQ,CAAC,2DAA2D,CAAC;IAC7F,UAAU,EAAE,SAAS,CAAC,QAAQ,CAAC,6BAA6B,CAAC;IAC7D,gBAAgB,EAAE,SAAS,CAAC,QAAQ,CAAC,mCAAmC,CAAC;IACzE,WAAW,EAAE,CAAC;SACX,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,8FAA8F;QAC5F,6FAA6F;QAC7F,uDAAuD,CAC1D;IACH,UAAU,EAAE,gBAAgB;CAC7B,CAAC,CAAC;AASH,SAAS,UAAU,CACjB,OAAkC,EAClC,QAA0B,EAC1B,UAA8B,EAC9B,WAA+B;IAE/B,OAAO;QACL,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;QACrB,UAAU,EAAE,OAAO,CAAC,MAAM;QAC1B,YAAY,EAAE,QAAQ,CAAC,YAAY;QACnC,UAAU,EAAE,QAAQ,CAAC,UAAU;QAC/B,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB;QAC3C,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,GAAG,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpD,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,UAAU,CACvB,IAAqC,EACrC,GAAY;IAOZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,MAAM,YAAY,GAAG,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAC9D,MAAM,QAAQ,GAAG,YAAY,CAAC;QAC5B,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,YAAY;QAClB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,aAAa,EAAE,IAAI,CAAC,aAAa;QACjC,cAAc,EAAE,IAAI,CAAC,cAAc;KACpC,CAAC,CAAC;IACH,MAAM,EAAE,aAAa,EAAE,GAAG,GAAG,CAAC;IAE9B,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAuD;QACjF,KAAK,EAAE,GAAG,CAAC,SAAS;QACpB,QAAQ;QACR,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,UAAU;QACzB,OAAO,EAAE,KAAK,IAAI,EAAE;YAClB,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,yBAAyB,CAAC,YAAY,CAAC,CAAC;YAChF,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE;gBACrC,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,aAAa,EAAE,IAAI,CAAC,aAAa;gBACjC,cAAc,EAAE,IAAI,CAAC,cAAc;gBACnC,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC,CAAC;gBACrF,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,SAAS;gBAC3B,QAAQ,EAAE,gBAAgB;gBAC1B,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC1D,CAAC,CAAC;YACH,OAAO;gBACL,KAAK,EAAE,MAAM,CAAC,OAAO;gBACrB,QAAQ,EAAE;oBACR,IAAI,EAAE,QAAQ;oBACd,YAAY,EAAE,MAAM,CAAC,YAAY;oBACjC,UAAU,EAAE,MAAM,CAAC,UAAU;oBAC7B,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;iBAC1C;gBACD,SAAS,EAAE,MAAM,CAAC,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM;aACvD,CAAC;QACJ,CAAC;QACD,WAAW,EAAE,aAAa;YACxB,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE;gBACpB,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACrC,qEAAqE;gBACrE,4CAA4C;gBAC5C,MAAM,UAAU,GAAG;oBACjB,OAAO;oBACP,QAAQ,EAAE,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC;oBACvC,YAAY,EAAE,QAAQ,CAAC,YAAY;oBACnC,UAAU,EAAE,QAAQ,CAAC,UAAU;oBAC/B,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB;oBAC3C,GAAG,CAAC,QAAQ,CAAC,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACvE,CAAC;gBACF,OAAO,eAAe,CAAC,aAAa,EAAE,GAAG,IAAI,OAAO,EAAE,UAAU,CAAC,CAAC;YACpE,CAAC;YACH,CAAC,CAAC,SAAS;KACd,CAAC,CAAC;IAEH,OAAO;QACL,UAAU,EAAE,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC;QAC/F,QAAQ,EAAE,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxE,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACzD,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,UAAU,CAAC;IAC7B,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,MAAM;IACb,WAAW,EACT,4EAA4E;QAC5E,4HAA4H;IAC9H,KAAK,EAAE,eAAe;IACtB,MAAM,EAAE,gBAAgB;IACxB,sEAAsE;IACtE,wEAAwE;IACxE,6EAA6E;IAC7E,0DAA0D;IAC1D,WAAW,EAAE;QACX,YAAY,EAAE,IAAI;QAClB,cAAc,EAAE,IAAI;QACpB,eAAe,EAAE,KAAK;QACtB,aAAa,EAAE,KAAK;KACrB;IACD,SAAS,EAAE,yBAAyB;IACpC,gBAAgB,EAAE,SAAS,CAAC,aAAa;IACzC,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACnB,KAAK,EAAE,MAAM;QACb,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG;KAC/C,CAAC;IACF,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACrD,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC3E,2EAA2E;QAC3E,yEAAyE;QACzE,4EAA4E;QAC5E,MAAM,IAAI,GACR,QAAQ;YACR,WAAW,CAAC;gBACV,MAAM;gBACN,KAAK,EAAE,UAAU,CAAC,UAAU;gBAC5B,KAAK,EAAE,UAAU,CAAC,YAAY;gBAC9B,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,MAAM;gBACZ,UAAU,EAAE,UAAU,CAAC,UAAU;aAClC,CAAC;YACF,CAAC,UAAU,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,kBAAkB,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3F,OAAO;YACL,UAAU;YACV,IAAI;YACJ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACvC,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 { pageQueryKey, paginate } from '../core/cursor.js';\nimport { ErrorCode } from '../core/errors.js';\nimport { pageTrailer } from '../core/fmt.js';\nimport type { EntryType } from '../core/glob.js';\nimport { globEntries } from '../core/glob.js';\nimport type { PathGuard } from '../core/path.js';\nimport { toPosixRelative } from '../core/path.js';\nimport { resolveEntryType } from '../core/primitives.js';\nimport {\n  CursorSchema,\n  FileType as FileTypeEnum,\n  includeHiddenField,\n  includeIgnoredField,\n  NextCursorSchema,\n  NonNegInt,\n  OptionalPath,\n  PositiveInt,\n} from '../core/schema.js';\nimport type { JsonResourceResult } from '../core/store.js';\nimport { putJsonResource } from '../core/store.js';\nimport {\n  DEFAULT_SEARCH_TIMEOUT_MS,\n  DEFAULT_TREE_ENTRIES,\n  MAX_LIST_ENTRIES,\n  MAX_TREE_DEPTH,\n} from '../core/util.js';\nimport { defineTool, type ToolCtx } from './define.js';\n\ninterface CollectedEntry {\n  name: string;\n  relativePath: string; // POSIX\n  type: EntryType;\n}\n\ninterface CollectOptions {\n  maxDepth: number;\n  includeHidden: boolean;\n  includeIgnored: boolean;\n  signal: AbortSignal;\n  pathGuard: PathGuard;\n  /** Upper bound on the stored, paginable entry array. */\n  entryCap: number;\n  onProgress?: (progress: { current: number; total?: number }) => void;\n}\n\ninterface CollectResult {\n  entries: CollectedEntry[];\n  totalEntries: number;\n  totalFiles: number;\n  totalDirectories: number;\n}\n\nfunction entryTypeRank(type: EntryType): number {\n  if (type === 'directory') return 0;\n  return 1;\n}\n\nfunction compareEntries(a: CollectedEntry, b: CollectedEntry): number {\n  // Compare by parent directory first (depth-level grouping)\n  const slashA = a.relativePath.lastIndexOf('/');\n  const slashB = b.relativePath.lastIndexOf('/');\n  const parentA = slashA === -1 ? '' : a.relativePath.slice(0, slashA);\n  const parentB = slashB === -1 ? '' : b.relativePath.slice(0, slashB);\n\n  if (parentA !== parentB) return parentA.localeCompare(parentB);\n\n  // Within same parent: dirs first, then alphabetical\n  const rankDiff = entryTypeRank(a.type) - entryTypeRank(b.type);\n  if (rankDiff !== 0) return rankDiff;\n  return a.name.localeCompare(b.name);\n}\n\nasync function collect(rootPath: string, options: CollectOptions): Promise<CollectResult> {\n  const entries: CollectedEntry[] = [];\n  let scanned = 0;\n  let totalEntries = 0;\n  let totalFiles = 0;\n  let totalDirectories = 0;\n\n  for await (const entry of globEntries({\n    cwd: rootPath,\n    pattern: '**/*',\n    skipIgnored: !options.includeIgnored,\n    signal: options.signal,\n    includeHidden: options.includeHidden,\n    baseNameMatch: false,\n    // ListInputSchema.maxDepth is 1-based (1 = top-level only); the shared\n    // globEntries primitive is now 0-based, so subtract one here. options.maxDepth\n    // is guaranteed >= 1 by its PositiveInt schema, so this never underflows.\n    maxDepth: options.maxDepth - 1,\n    onlyFiles: false,\n  })) {\n    options.signal.throwIfAborted();\n    scanned++;\n    options.onProgress?.({ current: scanned });\n\n    const entryType: EntryType = resolveEntryType(entry.dirent);\n    const relPath = toPosixRelative(rootPath, entry.path);\n    const name = basename(relPath);\n\n    const accessible = await options.pathGuard.isEntryAccessible(entry.path);\n    if (!accessible) continue;\n\n    totalEntries++;\n    if (entryType === 'directory') {\n      totalDirectories++;\n    } else {\n      totalFiles++;\n    }\n\n    const collectedEntry: CollectedEntry = {\n      name,\n      relativePath: relPath,\n      type: entryType,\n    };\n\n    if (entries.length < options.entryCap) {\n      entries.push(collectedEntry);\n    }\n  }\n\n  options.signal.throwIfAborted();\n  entries.sort(compareEntries);\n\n  return {\n    entries,\n    totalEntries,\n    totalFiles,\n    totalDirectories,\n  };\n}\n\nconst TEE = '├── ';\nconst ELBOW = '└── ';\nconst PIPE = '│   ';\nconst INDENT = '    ';\n\nfunction renderMarkdown(rootName: string, entries: readonly CollectedEntry[]): string {\n  if (entries.length === 0) return rootName;\n\n  // Group entries by parent path\n  const childrenOf = new Map<string, CollectedEntry[]>();\n  for (const entry of entries) {\n    const slash = entry.relativePath.lastIndexOf('/');\n    const parentKey = slash === -1 ? '' : entry.relativePath.slice(0, slash);\n    if (!childrenOf.has(parentKey)) childrenOf.set(parentKey, []);\n    const children = childrenOf.get(parentKey);\n    if (children) children.push(entry);\n  }\n\n  const lines: string[] = [rootName];\n\n  function renderChildren(parentKey: string, prefix: string): void {\n    const children = childrenOf.get(parentKey);\n    if (!children) return;\n\n    for (let i = 0; i < children.length; i++) {\n      const child = children[i];\n      if (!child) continue;\n      const isLast = i === children.length - 1;\n      const connector = isLast ? ELBOW : TEE;\n      lines.push(prefix + connector + child.name);\n\n      const childKey = child.relativePath;\n      const nextPrefix = prefix + (isLast ? INDENT : PIPE);\n      renderChildren(childKey, nextPrefix);\n    }\n  }\n\n  renderChildren('', '');\n  return lines.join('\\n');\n}\n\nconst DEFAULT_LIST_DEPTH = 1;\nconst DEFAULT_LIST_ENTRIES = DEFAULT_TREE_ENTRIES;\n\nconst ListInputSchema = z.strictObject({\n  path: OptionalPath.describe('Directory to list (default: first allowed root)'),\n  maxDepth: PositiveInt.max(MAX_TREE_DEPTH)\n    .default(DEFAULT_LIST_DEPTH)\n    .describe(\n      `Max directory depth to traverse (default: ${String(DEFAULT_LIST_DEPTH)} = top-level only; increase to recurse deeper)`,\n    ),\n  maxEntries: PositiveInt.max(MAX_LIST_ENTRIES)\n    .default(DEFAULT_LIST_ENTRIES)\n    .describe(\n      `Page size (default: ${String(DEFAULT_LIST_ENTRIES)}). Continue with nextCursor; an incomplete first page also carries resourceUri for the whole list.`,\n    ),\n  includeHidden: includeHiddenField(),\n  includeIgnored: includeIgnoredField(),\n  cursor: CursorSchema,\n});\n\nconst ListOutputSchema = z.strictObject({\n  path: z.string().optional().describe('Resolved absolute path of the listed directory'),\n  entries: z\n    .array(\n      z.strictObject({\n        name: z.string().describe('Entry basename'),\n        relativePath: z.string().describe('POSIX path relative to the listed directory'),\n        type: FileTypeEnum.describe('Entry type: file, directory, symlink, or other'),\n      }),\n    )\n    .describe('Inline directory entries sorted directories-first then alphabetically by name'),\n  // No `markdown` field: the ASCII tree is the call's text content already, and\n  // carrying it here too doubled every list response for a string the client\n  // has in hand. The stored full-tree resource still holds its own copy — that\n  // one is a *different* (uncapped) tree and is never sent inline.\n  entryCount: NonNegInt.describe('Number of entries included in this response'),\n  totalEntries: NonNegInt.describe('Total entries found before the maxEntries cap was applied'),\n  totalFiles: NonNegInt.describe('Total number of files found'),\n  totalDirectories: NonNegInt.describe('Total number of directories found'),\n  resourceUri: z\n    .string()\n    .optional()\n    .describe(\n      'URI to the full entry list in the resource store; first page only, whenever the response is ' +\n        'incomplete — more pages follow, or the hard cap cut the listing. The stored list is itself ' +\n        'bounded by that cap and marked truncated if exceeded.',\n    ),\n  nextCursor: NextCursorSchema,\n});\n\ninterface ListPageMetadata {\n  readonly path: string;\n  readonly totalEntries: number;\n  readonly totalFiles: number;\n  readonly totalDirectories: number;\n}\n\nfunction listOutput(\n  entries: readonly CollectedEntry[],\n  metadata: ListPageMetadata,\n  nextCursor: string | undefined,\n  resourceUri: string | undefined,\n): z.infer<typeof ListOutputSchema> {\n  return {\n    path: metadata.path,\n    entries: [...entries],\n    entryCount: entries.length,\n    totalEntries: metadata.totalEntries,\n    totalFiles: metadata.totalFiles,\n    totalDirectories: metadata.totalDirectories,\n    ...(resourceUri !== undefined ? { resourceUri } : {}),\n    ...(nextCursor !== undefined ? { nextCursor } : {}),\n  };\n}\n\nasync function handleList(\n  args: z.infer<typeof ListInputSchema>,\n  ctx: ToolCtx,\n): Promise<{\n  structured: z.infer<typeof ListOutputSchema>;\n  markdown: string;\n  offset: number;\n  link?: ContentBlock;\n}> {\n  const path = args.path;\n  const resolvedPath = ctx.fs.pathGuard.resolvePathOrRoot(path);\n  const queryKey = pageQueryKey({\n    method: 'list',\n    path: resolvedPath,\n    maxDepth: args.maxDepth,\n    includeHidden: args.includeHidden,\n    includeIgnored: args.includeIgnored,\n  });\n  const { resourceStore } = ctx;\n\n  const paged = await paginate<CollectedEntry, ListPageMetadata, JsonResourceResult>({\n    store: ctx.pageStore,\n    queryKey,\n    cursor: args.cursor,\n    pageSize: args.maxEntries,\n    produce: async () => {\n      const validDir = await ctx.fs.pathGuard.validateExistingDirectory(resolvedPath);\n      const result = await collect(validDir, {\n        maxDepth: args.maxDepth,\n        includeHidden: args.includeHidden,\n        includeIgnored: args.includeIgnored,\n        signal: AbortSignal.any([ctx.signal, AbortSignal.timeout(DEFAULT_SEARCH_TIMEOUT_MS)]),\n        pathGuard: ctx.fs.pathGuard,\n        entryCap: MAX_LIST_ENTRIES,\n        ...(ctx.onProgress ? { onProgress: ctx.onProgress } : {}),\n      });\n      return {\n        items: result.entries,\n        metadata: {\n          path: validDir,\n          totalEntries: result.totalEntries,\n          totalFiles: result.totalFiles,\n          totalDirectories: result.totalDirectories,\n        },\n        truncated: result.totalEntries > result.entries.length,\n      };\n    },\n    externalize: resourceStore\n      ? (entries, metadata) => {\n          const name = basename(metadata.path);\n          // The stored tree is the whole collected set — itself bounded by the\n          // hard cap, and marked when the cap cut it.\n          const fullOutput = {\n            entries,\n            markdown: renderMarkdown(name, entries),\n            totalEntries: metadata.totalEntries,\n            totalFiles: metadata.totalFiles,\n            totalDirectories: metadata.totalDirectories,\n            ...(metadata.totalEntries > entries.length ? { truncated: true } : {}),\n          };\n          return putJsonResource(resourceStore, `${name} tree`, fullOutput);\n        }\n      : undefined,\n  });\n\n  return {\n    structured: listOutput(paged.page, paged.metadata, paged.nextCursor, paged.resource?.entry.uri),\n    markdown: renderMarkdown(basename(paged.metadata.path), [...paged.page]),\n    offset: paged.offset,\n    ...(paged.resource ? { link: paged.resource.link } : {}),\n  };\n}\n\nexport const LIST = defineTool({\n  name: 'list',\n  title: 'List',\n  description:\n    'List sorted directory entries and an ASCII tree. maxDepth=1 is top-level. ' +\n    'maxEntries sets page size; continue with nextCursor. An incomplete first page also carries resourceUri for the whole list.',\n  input: ListInputSchema,\n  output: ListOutputSchema,\n  // Not published: every field is a plainly-named scalar (`entryCount`,\n  // `totalFiles`, `nextCursor`) that one sample response teaches, and the\n  // schema costs 1599 chars of every session start. Publishing is reserved for\n  // the value-XOR-error union shape a sample cannot convey.\n  annotations: {\n    readOnlyHint: true,\n    idempotentHint: true,\n    destructiveHint: false,\n    openWorldHint: false,\n  },\n  timeoutMs: DEFAULT_SEARCH_TIMEOUT_MS,\n  defaultErrorCode: ErrorCode.NOT_DIRECTORY,\n  progress: (args) => ({\n    label: 'List',\n    subject: args.path ? basename(args.path) : '.',\n  }),\n  accessPaths: (args) => (args.path ? [args.path] : []),\n  run: async (args, ctx) => {\n    const { structured, markdown, offset, link } = await handleList(args, ctx);\n    // The tree is what the model reads, so position and the full-list URI ride\n    // the text too — paging needs no second lookup. `pageTrailer` is the one\n    // owner of that line, and it owes it on the last page as much as the first.\n    const text =\n      markdown +\n      pageTrailer({\n        offset,\n        shown: structured.entryCount,\n        total: structured.totalEntries,\n        noun: 'entries',\n        tool: 'list',\n        nextCursor: structured.nextCursor,\n      }) +\n      (structured.resourceUri !== undefined ? `\\nfull tree at ${structured.resourceUri}` : '');\n    return {\n      structured,\n      text,\n      ...(link ? { resources: [link] } : {}),\n    };\n  },\n});\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"move.d.ts","sourceRoot":"","sources":["../../src/tools/move.ts"],"names":[],"mappings":"AA8eA,eAAO,MAAM,IAAI,mCA8Cf,CAAC"}
+{"version":3,"file":"move.d.ts","sourceRoot":"","sources":["../../src/tools/move.ts"],"names":[],"mappings":"AAqfA,eAAO,MAAM,IAAI,mCA8Cf,CAAC"}

package/dist/tools/move.js

@@ -5,8 +5,8 @@ import { processInParallel } from '../core/concurrency.js';
 import { ErrorCode, FsError, isFsError, isNodeError, Problem, rethrowIfAborted, } from '../core/errors.js';
 import { joinRoster, pathLabel } from '../core/fmt.js';
 import { destExists } from '../core/fs.js';
-import { choiceInput, pendingRoundTrip, readAcceptedChoice } from '../core/input-required.js';
-import { IS_CASE_INSENSITIVE_FS, isPathInsideDirectory, isSamePath } from '../core/path-utils.js';
+import { choiceInput, confirmKey, pendingRoundTrip, readAcceptedChoice, } from '../core/input-required.js';
+import { isPathInsideDirectory, isSamePath, normalizeCaseForComparison, } from '../core/path-utils.js';
 import { defaultFalseBoolean, PerFileErrorSchema, RequiredPath } from '../core/schema.js';
 import { PARALLEL_CONCURRENCY } from '../core/util.js';
 import { defineTool } from './define.js';
@@ -95,7 +95,7 @@ async function planTransfer(op, pair, fs, overwrite) {
  */
 async function executeTransfer(op, plan, ctx, pendingSorted) {
     if (plan.pending) {
-        const key = `confirm_${pendingSorted.indexOf(plan.validDest)}`;
+        const key = confirmKey(pendingSorted.indexOf(plan.validDest));
         const choice = readAcceptedChoice(ctx.inputResponses, key);
         if (choice === 'skip') {
             return { skipped: plan.pair.destination };
@@ -164,9 +164,7 @@ async function runTransfers(items, ctx, op, overwrite) {
     const seenDest = new Set();
     const ready = [];
     for (const candidate of candidates) {
-        const destKey = IS_CASE_INSENSITIVE_FS
-            ? candidate.validDest.toLowerCase()
-            : candidate.validDest;
+        const destKey = normalizeCaseForComparison(candidate.validDest);
         if (seenDest.has(destKey)) {
             failures.push(pairFailure(candidate.pair, new FsError(ErrorCode.INVALID_INPUT, `${VERB[op]} cancelled: another entry in this batch already targets destination "${candidate.pair.destination}"`, candidate.pair.destination)));
             continue;
@@ -186,7 +184,7 @@ async function runTransfers(items, ctx, op, overwrite) {
             pending: pendingSorted,
             requestState: ctx.requestState,
             clientCapabilities: ctx.clientCapabilities,
-            buildInputs: (dests) => dests.map((dest, i) => choiceInput(`confirm_${i}`, op === 'move'
+            buildInputs: (dests) => dests.map((dest, i) => choiceInput(confirmKey(i), op === 'move'
                 ? `"${dest}" already exists. Overwrite it?`
                 : `Destination "${dest}" already exists. Overwrite it?`, [
                 { value: 'overwrite', title: 'Overwrite' },

package/dist/tools/move.js.map

@@ -1 +1 @@
-{"version":3,"file":"move.js","sourceRoot":"","sources":["../../src/tools/move.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAErE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEvD,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,OAAO,EACP,gBAAgB,GACjB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAE3C,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAC9F,OAAO,EAAE,sBAAsB,EAAE,qBAAqB,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAClG,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC1F,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAEvD,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,cAAc,GAAG,CAAC,CAAC,YAAY,CAAC;IACpC,MAAM,EAAE,YAAY,CAAC,QAAQ,CAAC,+CAA+C,CAAC;IAC9E,WAAW,EAAE,YAAY,CAAC,QAAQ,CAAC,kBAAkB,CAAC;CACvD,CAAC,CAAC;AAEH,MAAM,oBAAoB,GAAG,CAAC,CAAC,YAAY,CAAC;IAC1C,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+BAA+B,CAAC;IAC1D,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,oCAAoC,CAAC;CAC9D,CAAC,CAAC;AAEH,MAAM,eAAe,GAAG,CAAC,CAAC,YAAY,CAAC;IACrC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,iCAAiC,CAAC;IAC1F,IAAI,EAAE,mBAAmB,CAAC,iDAAiD,CAAC;IAC5E,SAAS,EAAE,mBAAmB,CAC5B,sEAAsE,CACvE;CACF,CAAC,CAAC;AAEH,MAAM,qBAAqB,GAAG,CAAC,CAAC,YAAY,CAAC;IAC3C,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,qCAAqC,CAAC;IAClE,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+CAA+C,CAAC;IACjF,KAAK,EAAE,kBAAkB;CAC1B,CAAC,CAAC;AAIH,MAAM,gBAAgB,GAAG,CAAC,CAAC,YAAY,CAAC;IACtC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,QAAQ,CAAC,mCAAmC,CAAC;IAClF,QAAQ,EAAE,CAAC;SACR,KAAK,CAAC,qBAAqB,CAAC;SAC5B,QAAQ,EAAE;SACV,QAAQ,CAAC,oDAAoD,CAAC;IACjE,OAAO,EAAE,CAAC;SACP,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SACjB,QAAQ,EAAE;SACV,QAAQ,CAAC,kDAAkD,CAAC;CAChE,CAAC,CAAC;AAMH,MAAM,IAAI,GAAqC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAyB9E;;;;;;;;;GASG;AACH,KAAK,UAAU,YAAY,CACzB,EAAU,EACV,IAA6C,EAC7C,EAAiB,EACjB,SAAkB;IAElB,IAAI,UAAkB,CAAC;IACvB,IAAI,QAAgB,CAAC;IACrB,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC;QACH,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,MAAM,sBAAsB,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/E,SAAS,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACxE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;IAC/D,CAAC;IAED,2EAA2E;IAC3E,4EAA4E;IAC5E,+DAA+D;IAC/D,MAAM,cAAc,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,YAAY,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IAExC,MAAM,MAAM,GAAG,cAAc,KAAK,YAAY,CAAC;IAC/C,MAAM,gBAAgB,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IAE7E,4EAA4E;IAC5E,kEAAkE;IAClE,IAAI,MAAM,IAAI,CAAC,gBAAgB,IAAI,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC;QAClD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED,IAAI,CAAC,gBAAgB,IAAI,qBAAqB,CAAC,cAAc,EAAE,YAAY,CAAC,EAAE,CAAC;QAC7E,OAAO;YACL,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,WAAW,CAClB,IAAI,EACJ,IAAI,OAAO,CACT,SAAS,CAAC,aAAa,EACvB,UAAU,EAAE,wCAAwC,EACpD,IAAI,CAAC,MAAM,CACZ,CACF;SACF,CAAC;IACJ,CAAC;IAED,MAAM,qBAAqB,GAAG,CAAC,gBAAgB,IAAI,CAAC,MAAM,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;IACzF,MAAM,OAAO,GAAG,qBAAqB,IAAI,CAAC,SAAS,CAAC;IAEpD,OAAO;QACL,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,OAAO,EAAE;KACtF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,eAAe,CAC5B,EAAU,EACV,IAAkB,EAClB,GAA8D,EAC9D,aAAgC;IAEhC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,WAAW,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;QAC/D,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QAC3D,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QAC5C,CAAC;QACD,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;YAC3B,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,SAAS,EACnB,GAAG,IAAI,CAAC,EAAE,CAAC,6BAA6B,IAAI,CAAC,IAAI,CAAC,WAAW,2BAA2B,EACxF,IAAI,CAAC,IAAI,CAAC,WAAW,CACtB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,kEAAkE;IAClE,IACE,CAAC,IAAI,CAAC,gBAAgB;QACtB,CAAC,IAAI,CAAC,qBAAqB;QAC3B,CAAC,MAAM,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,EAC9C,CAAC;QACD,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,SAAS,EACnB,GAAG,IAAI,CAAC,EAAE,CAAC,4BAA4B,IAAI,CAAC,IAAI,CAAC,WAAW,oCAAoC,EAChG,IAAI,CAAC,IAAI,CAAC,WAAW,CACtB,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAEjE,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC;QAClB,MAAM,yBAAyB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzF,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,CAAC;IACrF,CAAC;SAAM,CAAC;QACN,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE;YAC7C,SAAS,EAAE,IAAI;YACf,gBAAgB,EAAE,IAAI;YACtB,kBAAkB,EAAE,IAAI;YACxB,KAAK,EAAE,IAAI;SACZ,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;AAChE,CAAC;AAUD,SAAS,WAAW,CAClB,IAA6C,EAC7C,KAAc;IAEd,OAAO;QACL,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,WAAW,EAAE,IAAI,CAAC,WAAW;QAC7B,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC;KAClE,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,YAAY,CACzB,KAAgD,EAChD,GAAY,EACZ,EAAU,EACV,SAAkB;IAKlB,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,iBAAiB,CACtE,KAAK,EACL,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,EACnD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IACF,wEAAwE;IACxE,yEAAyE;IACzE,2EAA2E;IAC3E,MAAM,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,cAAc;QAAE,MAAM,cAAc,CAAC,KAAK,CAAC;IAE/C,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,MAAM,UAAU,GAAmB,EAAE,CAAC;IACtC,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;aACrD,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;YAAE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9D,sDAAsD;IACxD,CAAC;IAED,0EAA0E;IAC1E,wEAAwE;IACxE,yEAAyE;IACzE,yEAAyE;IACzE,uDAAuD;IACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,sBAAsB;YACpC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,WAAW,EAAE;YACnC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC;QACxB,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC1B,QAAQ,CAAC,IAAI,CACX,WAAW,CACT,SAAS,CAAC,IAAI,EACd,IAAI,OAAO,CACT,SAAS,CAAC,aAAa,EACvB,GAAG,IAAI,CAAC,EAAE,CAAC,wEAAwE,SAAS,CAAC,IAAI,CAAC,WAAW,GAAG,EAChH,SAAS,CAAC,IAAI,CAAC,WAAW,CAC3B,CACF,CACF,CAAC;YACF,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACtB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,aAAa,GAAG,KAAK;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;SACxB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;SACvB,IAAI,EAAE,CAAC;IACV,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,wEAAwE;QACxE,8DAA8D;QAC9D,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC;YACnC,EAAE;YACF,OAAO,EAAE,aAAa;YACtB,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,kBAAkB,EAAE,GAAG,CAAC,kBAAkB;YAC1C,WAAW,EAAE,CAAC,KAAK,EAAE,EAAE,CACrB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CACpB,WAAW,CACT,WAAW,CAAC,EAAE,EACd,EAAE,KAAK,MAAM;gBACX,CAAC,CAAC,IAAI,IAAI,iCAAiC;gBAC3C,CAAC,CAAC,gBAAgB,IAAI,iCAAiC,EACzD;gBACE,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE;gBAC1C,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE;aACjC,CACF,CACF;SACJ,CAAC,CAAC;QACH,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;IAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,IAAI,GAAG,GAAS,EAAE;QACtB,SAAS,IAAI,CAAC,CAAC;QACf,GAAG,CAAC,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC;IACF,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,iBAAiB,CAC1E,KAAK,EACL,KAAK,EAAE,SAAS,EAAE,EAAE;QAClB,IAAI,CAAC;YACH,OAAO,MAAM,eAAe,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;QAClE,CAAC;gBAAS,CAAC;YACT,IAAI,EAAE,CAAC;QACT,CAAC;IACH,CAAC,EACD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,UAAU,EAAE,CAAC;QAC1C,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,WAAW,EAAE,CAAC;QACpC,IAAI,SAAS,IAAI,KAAK;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;;YAC/C,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AACxC,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,UAAU,CACvB,IAAqC,EACrC,GAAY;IAEZ,MAAM,EAAE,GAAW,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;IAC/C,6DAA6D;IAC7D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC;IAC9C,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;IACnE,IAAI,qBAAqB,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAEnD,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;IAE/C,OAAO;QACL,KAAK,EAAE,OAAO;QACd,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC3C,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CACnB,IAAqB,EACrB,OAAkC,EAClC,QAAoC,EACpC,OAA0B;IAE1B,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC;IACpC,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC;IAClC,IAAI,SAAS,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QAClE,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,GAAG,IAAI,KAAK,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;QACxE,CAAC;IACH,CAAC;IACD,4EAA4E;IAC5E,uEAAuE;IACvE,2EAA2E;IAC3E,yDAAyD;IACzD,MAAM,MAAM,GAAG;QACb,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;QAClE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC;KACvD,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,KAAK,UAAU,CAAC,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;IAC9D,IAAI,SAAS,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IAC7D,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AASD;;;;;;;GAOG;AACH,KAAK,UAAU,sBAAsB,CACnC,EAAU,EACV,MAAc,EACd,EAAiB;IAEjB,IAAI,CAAC;QACH,MAAM,UAAU,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;QACnE,MAAM,QAAQ,GAAG,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC/F,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;IAClC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,SAAS,CAAC,KAAK,CAAC;YAAE,MAAM,KAAK,CAAC;QAClC,MAAM,IAAI,OAAO,CAAC,SAAS,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,eAAe,MAAM,EAAE,EAAE,MAAM,CAAC,CAAC;IACzF,CAAC;AACH,CAAC;AAED,KAAK,UAAU,yBAAyB,CACtC,WAAmB,EACnB,SAAiB,EACjB,KAAsD,EACtD,cAAsB;IAEtB,IAAI,CAAC;QACH,MAAM,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAExB,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAClD,MAAM,KAAK,CAAC;QACd,CAAC;QAED,wEAAwE;QACxE,iDAAiD;QACjD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,EAAE,CAAC,WAAW,EAAE,SAAS,EAAE;gBACrC,SAAS,EAAE,IAAI;gBACf,gBAAgB,EAAE,IAAI;gBACtB,kBAAkB,EAAE,IAAI;aACzB,CAAC,CAAC;YACH,MAAM,GAAG,IAAI,CAAC;YACd,MAAM,KAAK,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;QAAC,OAAO,iBAAiB,EAAE,CAAC;YAC3B,gBAAgB,CAAC,iBAAiB,CAAC,CAAC;YACpC,IAAI,MAAM,EAAE,CAAC;gBACX,uEAAuE;gBACvE,wEAAwE;gBACxE,0EAA0E;gBAC1E,6CAA6C;gBAC7C,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CACrC,iBAAiB,EACjB,SAAS,CAAC,OAAO,EACjB,cAAc,CACf,CAAC;gBACF,MAAM,IAAI,OAAO,CACf,WAAW,CAAC,IAAI,EAChB,wBAAwB,cAAc,0EAA0E,WAAW,CAAC,OAAO,EAAE,EACrI,cAAc,EACd,iBAAiB,CAClB,CAAC;YACJ,CAAC;YACD,MAAM,iBAAiB,CAAC;QAC1B,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,UAAU,CAAC;IAC7B,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,oBAAoB;IAC3B,WAAW,EACT,2GAA2G;QAC3G,wEAAwE;QACxE,0GAA0G;QAC1G,wGAAwG;QACxG,2GAA2G;QAC3G,+CAA+C;IACjD,KAAK,EAAE,eAAe;IACtB,MAAM,EAAE,gBAAgB;IACxB,WAAW,EAAE;QACX,YAAY,EAAE,KAAK;QACnB,cAAc,EAAE,KAAK;QACrB,eAAe,EAAE,IAAI;QACrB,aAAa,EAAE,KAAK;KACrB;IACD,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;QAC1C,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,OAAO;gBACL,KAAK;gBACL,OAAO,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,IAAI,EAAE,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,WAAW,IAAI,EAAE,CAAC,EAAE;aAClF,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;IAClE,CAAC;IACD,gBAAgB,EAAE,SAAS,CAAC,OAAO;IACnC,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;IAC3E,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC3C,qEAAqE;QACrE,4EAA4E;QAC5E,IAAI,qBAAqB,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;QACjD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;QACrC,OAAO;YACL,UAAU,EAAE,MAAM;YAClB,IAAI,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC;YAChF,2EAA2E;YAC3E,uEAAuE;YACvE,OAAO,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC;SAC3E,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { InputRequiredResult } from '@modelcontextprotocol/server';\nimport { isInputRequiredResult } from '@modelcontextprotocol/server';\n\nimport { basename, dirname, resolve } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { processInParallel } from '../core/concurrency.js';\nimport {\n  ErrorCode,\n  FsError,\n  isFsError,\n  isNodeError,\n  Problem,\n  rethrowIfAborted,\n} from '../core/errors.js';\nimport { joinRoster, pathLabel } from '../core/fmt.js';\nimport { destExists } from '../core/fs.js';\nimport type { GuardedFileSystem } from '../core/fs.js';\nimport { choiceInput, pendingRoundTrip, readAcceptedChoice } from '../core/input-required.js';\nimport { IS_CASE_INSENSITIVE_FS, isPathInsideDirectory, isSamePath } from '../core/path-utils.js';\nimport { defaultFalseBoolean, PerFileErrorSchema, RequiredPath } from '../core/schema.js';\nimport { PARALLEL_CONCURRENCY } from '../core/util.js';\nimport type { ToolCtx } from './define.js';\nimport { defineTool } from './define.js';\n\nconst MoveItemSchema = z.strictObject({\n  source: RequiredPath.describe('Path of the file or directory to move or copy'),\n  destination: RequiredPath.describe('Destination path'),\n});\n\nconst MoveItemResultSchema = z.strictObject({\n  from: z.string().describe('Resolved absolute source path'),\n  to: z.string().describe('Resolved absolute destination path'),\n});\n\nconst MoveInputSchema = z.strictObject({\n  moves: z.array(MoveItemSchema).min(1).max(100).describe('Operations to perform (max 100)'),\n  copy: defaultFalseBoolean('Copy instead of move; sources are left in place'),\n  overwrite: defaultFalseBoolean(\n    'Copy mode only: overwrite existing destinations without confirmation',\n  ),\n});\n\nconst MoveFailureItemSchema = z.strictObject({\n  source: z.string().describe('Source path that could not be moved'),\n  destination: z.string().describe('Intended destination path for the failed move'),\n  error: PerFileErrorSchema,\n});\n\ntype MoveFailureItem = z.infer<typeof MoveFailureItemSchema>;\n\nconst MoveOutputSchema = z.strictObject({\n  moves: z.array(MoveItemResultSchema).describe('Successfully completed operations'),\n  failures: z\n    .array(MoveFailureItemSchema)\n    .optional()\n    .describe('Operations that failed with per-item error details'),\n  skipped: z\n    .array(z.string())\n    .optional()\n    .describe('Destinations skipped because the user chose Skip'),\n});\n\ntype MoveItemResult = z.infer<typeof MoveItemResultSchema>;\n\ntype PairOp = 'move' | 'copy';\n\nconst VERB: Readonly<Record<PairOp, string>> = { move: 'Move', copy: 'Copy' };\n\n/** A move or copy pre-checked up to the point a confirmation decision is needed. */\ninterface TransferPlan {\n  pair: { source: string; destination: string };\n  /**\n   * The path the mutation runs on: the link itself for a move, the resolved\n   * target for a copy. Every collision check uses the resolved source instead\n   * — see {@link validateTransferSource}.\n   */\n  opSource: string;\n  validDest: string;\n  /**\n   * A rename that only changes the destination's case. Move must perform it —\n   * it is real work — so it is exempt from the destination-exists checks that\n   * would otherwise read the source itself as an existing destination. Never\n   * true for a copy, which treats a case-only target as a self-copy and skips.\n   */\n  isCaseOnlyRename: boolean;\n  /** Whether the destination existed when planned (drives the TOCTOU guard). */\n  destExistedOriginally: boolean;\n  /** Destination exists and is not a self/case-only target → needs overwrite confirmation. */\n  pending: boolean;\n}\n\n/**\n * Phase 1 (no mutation): validate source and destination, reject self-targets\n * and transfers into a subdirectory of the source, and stat the destination to\n * decide whether this pair needs an overwrite confirmation. No `mkdir` happens\n * here — the old flow created the destination's parent before asking, which\n * mutated the filesystem before a confirmation; that now waits for phase 2 (R14).\n *\n * `overwrite` is copy-only — move has no confirmation bypass — so a move always\n * passes false.\n */\nasync function planTransfer(\n  op: PairOp,\n  pair: { source: string; destination: string },\n  fs: ToolCtx['fs'],\n  overwrite: boolean,\n): Promise<TransferPlanResult> {\n  let realSource: string;\n  let opSource: string;\n  let validDest: string;\n  try {\n    ({ realSource, opSource } = await validateTransferSource(op, pair.source, fs));\n    validDest = await fs.pathGuard.validatePathForWrite(pair.destination);\n  } catch (error) {\n    return { status: 'fail', failure: pairFailure(pair, error) };\n  }\n\n  // Comparisons run on the resolved source; only the fs call in phase 2 uses\n  // opSource. validatePathForWrite resolves the destination through a symlink\n  // too, so both sides of every check must be resolved to match.\n  const resolvedSource = resolve(realSource);\n  const resolvedDest = resolve(validDest);\n\n  const isSelf = resolvedSource === resolvedDest;\n  const isCaseOnlyRename = !isSelf && isSamePath(resolvedSource, resolvedDest);\n\n  // A copy onto a case-only variant of its own source is the same file, so it\n  // is a no-op; the same rename is real work for move and proceeds.\n  if (isSelf || (isCaseOnlyRename && op === 'copy')) {\n    return { status: 'noop' };\n  }\n\n  if (!isCaseOnlyRename && isPathInsideDirectory(resolvedSource, resolvedDest)) {\n    return {\n      status: 'fail',\n      failure: pairFailure(\n        pair,\n        new FsError(\n          ErrorCode.INVALID_INPUT,\n          `Cannot ${op} a directory into its own subdirectory`,\n          pair.source,\n        ),\n      ),\n    };\n  }\n\n  const destExistedOriginally = !isCaseOnlyRename && (await destExists(fs, validDest, op));\n  const pending = destExistedOriginally && !overwrite;\n\n  return {\n    status: 'plan',\n    plan: { pair, opSource, validDest, isCaseOnlyRename, destExistedOriginally, pending },\n  };\n}\n\n/**\n * Phase 2 (mutation): confirm an overwrite if needed, TOCTOU-check the\n * destination, create its parent, then rename (with cross-device fallback) or\n * copy. A declined/missing confirmation throws `CANCELLED`, collected as a\n * per-pair failure by the caller. A destination that appeared between plan and\n * mutation (created during the confirmation gap) also fails closed.\n */\nasync function executeTransfer(\n  op: PairOp,\n  plan: TransferPlan,\n  ctx: Pick<ToolCtx, 'fs' | 'signal' | 'inputResponses' | 'log'>,\n  pendingSorted: readonly string[],\n): Promise<TransferExecResult> {\n  if (plan.pending) {\n    const key = `confirm_${pendingSorted.indexOf(plan.validDest)}`;\n    const choice = readAcceptedChoice(ctx.inputResponses, key);\n    if (choice === 'skip') {\n      return { skipped: plan.pair.destination };\n    }\n    if (choice !== 'overwrite') {\n      throw new FsError(\n        ErrorCode.CANCELLED,\n        `${VERB[op]} cancelled: overwrite of \"${plan.pair.destination}\" was declined or missing`,\n        plan.pair.destination,\n      );\n    }\n  }\n\n  // TOCTOU check before any mutation: a destination that did not exist when\n  // planned but exists now was created during the confirmation gap.\n  if (\n    !plan.isCaseOnlyRename &&\n    !plan.destExistedOriginally &&\n    (await destExists(ctx.fs, plan.validDest, op))\n  ) {\n    throw new FsError(\n      ErrorCode.CANCELLED,\n      `${VERB[op]} cancelled: destination \"${plan.pair.destination}\" was created during confirmation.`,\n      plan.pair.destination,\n    );\n  }\n\n  await ctx.fs.mkdir(dirname(plan.validDest), { recursive: true });\n\n  if (op === 'move') {\n    await performRenameWithFallback(plan.opSource, plan.validDest, ctx.fs, plan.pair.source);\n    ctx.log?.('info', `move: ${plan.pair.source} -> ${plan.pair.destination}`, 'move');\n  } else {\n    await ctx.fs.cp(plan.opSource, plan.validDest, {\n      recursive: true,\n      verbatimSymlinks: true,\n      preserveTimestamps: true,\n      force: true,\n    });\n  }\n  return { value: { from: plan.opSource, to: plan.validDest } };\n}\n\ntype TransferPlanResult =\n  | { status: 'fail'; failure: MoveFailureItem }\n  | { status: 'noop' }\n  | { status: 'plan'; plan: TransferPlan };\n\n/** A discriminated union, so the fold below narrows without a generic cast. */\ntype TransferExecResult = { readonly skipped: string } | { readonly value: MoveItemResult };\n\nfunction pairFailure(\n  pair: { source: string; destination: string },\n  error: unknown,\n): MoveFailureItem {\n  return {\n    source: pair.source,\n    destination: pair.destination,\n    error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, pair.source),\n  };\n}\n\n/**\n * The source→destination sibling of `runOverPaths`: plan every pair, fail closed\n * on a duplicated destination, round-trip the overwrite confirmations as one\n * set, then execute what survived in parallel. `copy` and `move` differ only in\n * their `plan` and `execute` callbacks.\n */\nasync function runTransfers(\n  items: readonly z.infer<typeof MoveItemSchema>[],\n  ctx: ToolCtx,\n  op: PairOp,\n  overwrite: boolean,\n): Promise<\n  | { results: MoveItemResult[]; skipped: string[]; failures: MoveFailureItem[] }\n  | InputRequiredResult\n> {\n  const { results: planned, errors: planErrors } = await processInParallel(\n    items,\n    (pair) => planTransfer(op, pair, ctx.fs, overwrite),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n  // plan callbacks are fail-closed (they return { status: 'fail' }, never\n  // throw), so planErrors should always be empty. Surface the first rather\n  // than silently dropping the item if a future plan callback violates that.\n  const firstPlanError = planErrors[0];\n  if (firstPlanError) throw firstPlanError.error;\n\n  const failures: MoveFailureItem[] = [];\n  const candidates: TransferPlan[] = [];\n  for (const { value } of planned) {\n    if (value.status === 'fail') failures.push(value.failure);\n    else if (value.status === 'plan') candidates.push(value.plan);\n    // 'noop' (self-copy / self-move) is silently skipped.\n  }\n\n  // Two sources targeting the same destination in one batch would otherwise\n  // collapse to a single shared overwrite confirmation and let the second\n  // one silently clobber the first's freshly-written content. Fail closed:\n  // only the first plan per destination proceeds; later ones targeting the\n  // same destination are reported as a per-item failure.\n  const seenDest = new Set<string>();\n  const ready: TransferPlan[] = [];\n  for (const candidate of candidates) {\n    const destKey = IS_CASE_INSENSITIVE_FS\n      ? candidate.validDest.toLowerCase()\n      : candidate.validDest;\n    if (seenDest.has(destKey)) {\n      failures.push(\n        pairFailure(\n          candidate.pair,\n          new FsError(\n            ErrorCode.INVALID_INPUT,\n            `${VERB[op]} cancelled: another entry in this batch already targets destination \"${candidate.pair.destination}\"`,\n            candidate.pair.destination,\n          ),\n        ),\n      );\n      continue;\n    }\n    seenDest.add(destKey);\n    ready.push(candidate);\n  }\n\n  const pendingSorted = ready\n    .filter((p) => p.pending)\n    .map((p) => p.validDest)\n    .sort();\n  if (pendingSorted.length > 0) {\n    // Round 1 returns input_required; a retry whose verified state does not\n    // bind this overwrite set throws (R9) via `pendingRoundTrip`.\n    const round = await pendingRoundTrip({\n      op,\n      pending: pendingSorted,\n      requestState: ctx.requestState,\n      clientCapabilities: ctx.clientCapabilities,\n      buildInputs: (dests) =>\n        dests.map((dest, i) =>\n          choiceInput(\n            `confirm_${i}`,\n            op === 'move'\n              ? `\"${dest}\" already exists. Overwrite it?`\n              : `Destination \"${dest}\" already exists. Overwrite it?`,\n            [\n              { value: 'overwrite', title: 'Overwrite' },\n              { value: 'skip', title: 'Skip' },\n            ],\n          ),\n        ),\n    });\n    if (round !== undefined) return round;\n  }\n\n  const total = ready.length;\n  let completed = 0;\n  const tick = (): void => {\n    completed += 1;\n    ctx.onProgress?.({ current: completed, total });\n  };\n  const { results: execResults, errors: execErrors } = await processInParallel(\n    ready,\n    async (readyPlan) => {\n      try {\n        return await executeTransfer(op, readyPlan, ctx, pendingSorted);\n      } finally {\n        tick();\n      }\n    },\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  for (const { error, index } of execErrors) {\n    rethrowIfAborted(error);\n    const failed = ready[index];\n    if (failed) failures.push(pairFailure(failed.pair, error));\n  }\n\n  const results: MoveItemResult[] = [];\n  const skipped: string[] = [];\n  for (const { value } of execResults) {\n    if ('skipped' in value) skipped.push(value.skipped);\n    else results.push(value.value);\n  }\n\n  return { results, skipped, failures };\n}\n\n/**\n * Two-phase move: pre-check every move (no mutation) to build the overwrite\n * pending set; if any move is pending and the round carries no verified\n * `requestState`, return `input_required` moving nothing (R14). On retry, R9\n * checks the state binds this move set, then each pending move proceeds only on\n * an accepted overwrite. Non-pending moves proceed alongside them.\n */\nasync function handleMove(\n  args: z.infer<typeof MoveInputSchema>,\n  ctx: ToolCtx,\n): Promise<z.infer<typeof MoveOutputSchema> | InputRequiredResult> {\n  const op: PairOp = args.copy ? 'copy' : 'move';\n  // `overwrite` is copy-only; move has no confirmation bypass.\n  const overwrite = args.copy && args.overwrite;\n  const outcome = await runTransfers(args.moves, ctx, op, overwrite);\n  if (isInputRequiredResult(outcome)) return outcome;\n\n  const { results, skipped, failures } = outcome;\n\n  return {\n    moves: results,\n    ...(failures.length > 0 ? { failures } : {}),\n    ...(skipped.length > 0 ? { skipped } : {}),\n  };\n}\n\nfunction buildSummary(\n  verb: 'move' | 'copy',\n  results: readonly MoveItemResult[],\n  failures: readonly MoveFailureItem[],\n  skipped: readonly string[],\n): string {\n  const successCount = results.length;\n  const failCount = failures.length;\n  if (failCount === 0 && skipped.length === 0 && successCount === 1) {\n    const result = results[0];\n    if (result) {\n      return `${verb}: ${pathLabel(result.from)} → ${pathLabel(result.to)}`;\n    }\n  }\n  // Name each pair. \"move: 2 items\" left the caller to open structuredContent\n  // to learn which two, and a partial failure was unreadable without it.\n  // Skipped destinations are an outcome the user chose, not a failure — name\n  // them, or an all-skipped call reads as \"copy: nothing\".\n  const tokens = [\n    ...results.map((r) => `${pathLabel(r.from)} → ${pathLabel(r.to)}`),\n    ...skipped.map((dest) => `${pathLabel(dest)} SKIPPED`),\n  ];\n  const parts = [`${verb}: ${joinRoster(tokens) || 'nothing'}`];\n  if (failCount > 0) parts.push(`${String(failCount)} failed`);\n  return parts.join(' · ');\n}\n\ninterface TransferSource {\n  /** Symlink resolved — the identity used for every same-target comparison. */\n  realSource: string;\n  /** The path the mutation runs on: symlink preserved for move, resolved for copy. */\n  opSource: string;\n}\n\n/**\n * A move needs two views of its source. Renaming must operate on the link\n * itself, or moving a symlink would rename the file it points at and leave the\n * link dangling. Every collision check must instead compare the resolved\n * target, or a link moved onto itself (or onto its own target) reads as a real\n * move and renames the link over that target, destroying it. A copy reads\n * through the link, so both views are the resolved one.\n */\nasync function validateTransferSource(\n  op: PairOp,\n  source: string,\n  fs: ToolCtx['fs'],\n): Promise<TransferSource> {\n  try {\n    const realSource = await fs.pathGuard.validateExistingPath(source);\n    const opSource = op === 'move' ? await fs.pathGuard.validatePathForDelete(source) : realSource;\n    return { realSource, opSource };\n  } catch (error) {\n    if (isFsError(error)) throw error;\n    throw new FsError(ErrorCode.ACCESS_DENIED, `${VERB[op]} failed for ${source}`, source);\n  }\n}\n\nasync function performRenameWithFallback(\n  validSource: string,\n  validDest: string,\n  fsOps: Pick<GuardedFileSystem, 'rename' | 'cp' | 'rm'>,\n  originalSource: string,\n): Promise<void> {\n  try {\n    await fsOps.rename(validSource, validDest);\n  } catch (error: unknown) {\n    rethrowIfAborted(error);\n\n    if (!isNodeError(error) || error.code !== 'EXDEV') {\n      throw error;\n    }\n\n    // EXDEV: cross-device rename. Copy then remove, preserving symlinks and\n    // timestamps so link semantics survive the move.\n    let copied = false;\n    try {\n      await fsOps.cp(validSource, validDest, {\n        recursive: true,\n        verbatimSymlinks: true,\n        preserveTimestamps: true,\n      });\n      copied = true;\n      await fsOps.rm(validSource, { recursive: true, force: true });\n    } catch (copyOrRemoveError) {\n      rethrowIfAborted(copyOrRemoveError);\n      if (copied) {\n        // cp succeeded but rm failed: the destination already holds a complete\n        // copy and the source remains. Surface the rm error as the cause so the\n        // caller can recover (clean up the duplicate) instead of a silent generic\n        // failure that hides the partial completion.\n        const baseProblem = Problem.fromUnknown(\n          copyOrRemoveError,\n          ErrorCode.UNKNOWN,\n          originalSource,\n        );\n        throw new FsError(\n          baseProblem.code,\n          `Cross-device move of ${originalSource}: copy succeeded but source removal failed (destination holds a copy): ${baseProblem.message}`,\n          originalSource,\n          copyOrRemoveError,\n        );\n      }\n      throw copyOrRemoveError;\n    }\n  }\n}\n\nexport const MOVE = defineTool({\n  name: 'move',\n  title: 'Move or Copy Files',\n  description:\n    'Move, rename, or copy files and directories to explicit destination paths (max 100 operations per call). ' +\n    'Pass moves: [{ source, destination }] — there is no single-pair form. ' +\n    'Parent directories are created automatically. Set copy=true to copy instead of move (sources are kept). ' +\n    'An existing destination prompts the user to confirm the overwrite, so the call returns without moving ' +\n    'anything until that confirmation comes back; copy=true with overwrite=true skips the prompt, move has no ' +\n    'such bypass. Self-moves are silently skipped.',\n  input: MoveInputSchema,\n  output: MoveOutputSchema,\n  annotations: {\n    readOnlyHint: false,\n    idempotentHint: false,\n    destructiveHint: true,\n    openWorldHint: false,\n  },\n  progress: (args) => {\n    const label = args.copy ? 'Copy' : 'Move';\n    if (args.moves.length === 1) {\n      const move = args.moves[0];\n      return {\n        label,\n        subject: `${basename(move?.source ?? '')} → ${basename(move?.destination ?? '')}`,\n      };\n    }\n    return { label, subject: `${String(args.moves.length)} files` };\n  },\n  defaultErrorCode: ErrorCode.UNKNOWN,\n  accessPaths: (args) => args.moves.flatMap((m) => [m.source, m.destination]),\n  run: async (args, ctx) => {\n    const output = await handleMove(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(output)) return output;\n    const failures = output.failures ?? [];\n    const skipped = output.skipped ?? [];\n    return {\n      structured: output,\n      text: buildSummary(args.copy ? 'copy' : 'move', output.moves, failures, skipped),\n      // Every requested pair failed: no move, no copy, no user-chosen skip - the\n      // call did nothing. A skip is work the caller asked for, so it counts.\n      isError: failures.length > 0 && output.moves.length + skipped.length === 0,\n    };\n  },\n});\n"]}
+{"version":3,"file":"move.js","sourceRoot":"","sources":["../../src/tools/move.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAErE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEvD,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,OAAO,EACP,gBAAgB,GACjB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAE3C,OAAO,EACL,WAAW,EACX,UAAU,EACV,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,qBAAqB,EACrB,UAAU,EACV,0BAA0B,GAC3B,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC1F,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAEvD,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,cAAc,GAAG,CAAC,CAAC,YAAY,CAAC;IACpC,MAAM,EAAE,YAAY,CAAC,QAAQ,CAAC,+CAA+C,CAAC;IAC9E,WAAW,EAAE,YAAY,CAAC,QAAQ,CAAC,kBAAkB,CAAC;CACvD,CAAC,CAAC;AAEH,MAAM,oBAAoB,GAAG,CAAC,CAAC,YAAY,CAAC;IAC1C,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+BAA+B,CAAC;IAC1D,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,oCAAoC,CAAC;CAC9D,CAAC,CAAC;AAEH,MAAM,eAAe,GAAG,CAAC,CAAC,YAAY,CAAC;IACrC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,iCAAiC,CAAC;IAC1F,IAAI,EAAE,mBAAmB,CAAC,iDAAiD,CAAC;IAC5E,SAAS,EAAE,mBAAmB,CAC5B,sEAAsE,CACvE;CACF,CAAC,CAAC;AAEH,MAAM,qBAAqB,GAAG,CAAC,CAAC,YAAY,CAAC;IAC3C,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,qCAAqC,CAAC;IAClE,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+CAA+C,CAAC;IACjF,KAAK,EAAE,kBAAkB;CAC1B,CAAC,CAAC;AAIH,MAAM,gBAAgB,GAAG,CAAC,CAAC,YAAY,CAAC;IACtC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,QAAQ,CAAC,mCAAmC,CAAC;IAClF,QAAQ,EAAE,CAAC;SACR,KAAK,CAAC,qBAAqB,CAAC;SAC5B,QAAQ,EAAE;SACV,QAAQ,CAAC,oDAAoD,CAAC;IACjE,OAAO,EAAE,CAAC;SACP,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SACjB,QAAQ,EAAE;SACV,QAAQ,CAAC,kDAAkD,CAAC;CAChE,CAAC,CAAC;AAMH,MAAM,IAAI,GAAqC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAyB9E;;;;;;;;;GASG;AACH,KAAK,UAAU,YAAY,CACzB,EAAU,EACV,IAA6C,EAC7C,EAAiB,EACjB,SAAkB;IAElB,IAAI,UAAkB,CAAC;IACvB,IAAI,QAAgB,CAAC;IACrB,IAAI,SAAiB,CAAC;IACtB,IAAI,CAAC;QACH,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,MAAM,sBAAsB,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/E,SAAS,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACxE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;IAC/D,CAAC;IAED,2EAA2E;IAC3E,4EAA4E;IAC5E,+DAA+D;IAC/D,MAAM,cAAc,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,YAAY,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IAExC,MAAM,MAAM,GAAG,cAAc,KAAK,YAAY,CAAC;IAC/C,MAAM,gBAAgB,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IAE7E,4EAA4E;IAC5E,kEAAkE;IAClE,IAAI,MAAM,IAAI,CAAC,gBAAgB,IAAI,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC;QAClD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED,IAAI,CAAC,gBAAgB,IAAI,qBAAqB,CAAC,cAAc,EAAE,YAAY,CAAC,EAAE,CAAC;QAC7E,OAAO;YACL,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,WAAW,CAClB,IAAI,EACJ,IAAI,OAAO,CACT,SAAS,CAAC,aAAa,EACvB,UAAU,EAAE,wCAAwC,EACpD,IAAI,CAAC,MAAM,CACZ,CACF;SACF,CAAC;IACJ,CAAC;IAED,MAAM,qBAAqB,GAAG,CAAC,gBAAgB,IAAI,CAAC,MAAM,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;IACzF,MAAM,OAAO,GAAG,qBAAqB,IAAI,CAAC,SAAS,CAAC;IAEpD,OAAO;QACL,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,OAAO,EAAE;KACtF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,eAAe,CAC5B,EAAU,EACV,IAAkB,EAClB,GAA8D,EAC9D,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,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QAC5C,CAAC;QACD,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;YAC3B,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,SAAS,EACnB,GAAG,IAAI,CAAC,EAAE,CAAC,6BAA6B,IAAI,CAAC,IAAI,CAAC,WAAW,2BAA2B,EACxF,IAAI,CAAC,IAAI,CAAC,WAAW,CACtB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,kEAAkE;IAClE,IACE,CAAC,IAAI,CAAC,gBAAgB;QACtB,CAAC,IAAI,CAAC,qBAAqB;QAC3B,CAAC,MAAM,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,EAC9C,CAAC;QACD,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,SAAS,EACnB,GAAG,IAAI,CAAC,EAAE,CAAC,4BAA4B,IAAI,CAAC,IAAI,CAAC,WAAW,oCAAoC,EAChG,IAAI,CAAC,IAAI,CAAC,WAAW,CACtB,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAEjE,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC;QAClB,MAAM,yBAAyB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzF,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,CAAC;IACrF,CAAC;SAAM,CAAC;QACN,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE;YAC7C,SAAS,EAAE,IAAI;YACf,gBAAgB,EAAE,IAAI;YACtB,kBAAkB,EAAE,IAAI;YACxB,KAAK,EAAE,IAAI;SACZ,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;AAChE,CAAC;AAUD,SAAS,WAAW,CAClB,IAA6C,EAC7C,KAAc;IAEd,OAAO;QACL,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,WAAW,EAAE,IAAI,CAAC,WAAW;QAC7B,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC;KAClE,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,YAAY,CACzB,KAAgD,EAChD,GAAY,EACZ,EAAU,EACV,SAAkB;IAKlB,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,iBAAiB,CACtE,KAAK,EACL,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,EACnD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IACF,wEAAwE;IACxE,yEAAyE;IACzE,2EAA2E;IAC3E,MAAM,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,cAAc;QAAE,MAAM,cAAc,CAAC,KAAK,CAAC;IAE/C,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,MAAM,UAAU,GAAmB,EAAE,CAAC;IACtC,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;aACrD,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM;YAAE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9D,sDAAsD;IACxD,CAAC;IAED,0EAA0E;IAC1E,wEAAwE;IACxE,yEAAyE;IACzE,yEAAyE;IACzE,uDAAuD;IACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,0BAA0B,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC1B,QAAQ,CAAC,IAAI,CACX,WAAW,CACT,SAAS,CAAC,IAAI,EACd,IAAI,OAAO,CACT,SAAS,CAAC,aAAa,EACvB,GAAG,IAAI,CAAC,EAAE,CAAC,wEAAwE,SAAS,CAAC,IAAI,CAAC,WAAW,GAAG,EAChH,SAAS,CAAC,IAAI,CAAC,WAAW,CAC3B,CACF,CACF,CAAC;YACF,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACtB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,aAAa,GAAG,KAAK;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;SACxB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;SACvB,IAAI,EAAE,CAAC;IACV,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,wEAAwE;QACxE,8DAA8D;QAC9D,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC;YACnC,EAAE;YACF,OAAO,EAAE,aAAa;YACtB,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,kBAAkB,EAAE,GAAG,CAAC,kBAAkB;YAC1C,WAAW,EAAE,CAAC,KAAK,EAAE,EAAE,CACrB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CACpB,WAAW,CACT,UAAU,CAAC,CAAC,CAAC,EACb,EAAE,KAAK,MAAM;gBACX,CAAC,CAAC,IAAI,IAAI,iCAAiC;gBAC3C,CAAC,CAAC,gBAAgB,IAAI,iCAAiC,EACzD;gBACE,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE;gBAC1C,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE;aACjC,CACF,CACF;SACJ,CAAC,CAAC;QACH,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;IAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,IAAI,GAAG,GAAS,EAAE;QACtB,SAAS,IAAI,CAAC,CAAC;QACf,GAAG,CAAC,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC;IACF,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,iBAAiB,CAC1E,KAAK,EACL,KAAK,EAAE,SAAS,EAAE,EAAE;QAClB,IAAI,CAAC;YACH,OAAO,MAAM,eAAe,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;QAClE,CAAC;gBAAS,CAAC;YACT,IAAI,EAAE,CAAC;QACT,CAAC;IACH,CAAC,EACD,oBAAoB,EACpB,GAAG,CAAC,MAAM,CACX,CAAC;IAEF,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,UAAU,EAAE,CAAC;QAC1C,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,WAAW,EAAE,CAAC;QACpC,IAAI,SAAS,IAAI,KAAK;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;;YAC/C,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AACxC,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,UAAU,CACvB,IAAqC,EACrC,GAAY;IAEZ,MAAM,EAAE,GAAW,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;IAC/C,6DAA6D;IAC7D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC;IAC9C,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;IACnE,IAAI,qBAAqB,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAEnD,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;IAE/C,OAAO;QACL,KAAK,EAAE,OAAO;QACd,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC3C,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CACnB,IAAqB,EACrB,OAAkC,EAClC,QAAoC,EACpC,OAA0B;IAE1B,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC;IACpC,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC;IAClC,IAAI,SAAS,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QAClE,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,GAAG,IAAI,KAAK,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;QACxE,CAAC;IACH,CAAC;IACD,4EAA4E;IAC5E,uEAAuE;IACvE,2EAA2E;IAC3E,yDAAyD;IACzD,MAAM,MAAM,GAAG;QACb,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;QAClE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC;KACvD,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,KAAK,UAAU,CAAC,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;IAC9D,IAAI,SAAS,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IAC7D,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AASD;;;;;;;GAOG;AACH,KAAK,UAAU,sBAAsB,CACnC,EAAU,EACV,MAAc,EACd,EAAiB;IAEjB,IAAI,CAAC;QACH,MAAM,UAAU,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;QACnE,MAAM,QAAQ,GAAG,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC/F,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;IAClC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,SAAS,CAAC,KAAK,CAAC;YAAE,MAAM,KAAK,CAAC;QAClC,MAAM,IAAI,OAAO,CAAC,SAAS,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,eAAe,MAAM,EAAE,EAAE,MAAM,CAAC,CAAC;IACzF,CAAC;AACH,CAAC;AAED,KAAK,UAAU,yBAAyB,CACtC,WAAmB,EACnB,SAAiB,EACjB,KAAsD,EACtD,cAAsB;IAEtB,IAAI,CAAC;QACH,MAAM,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAExB,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAClD,MAAM,KAAK,CAAC;QACd,CAAC;QAED,wEAAwE;QACxE,iDAAiD;QACjD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,EAAE,CAAC,WAAW,EAAE,SAAS,EAAE;gBACrC,SAAS,EAAE,IAAI;gBACf,gBAAgB,EAAE,IAAI;gBACtB,kBAAkB,EAAE,IAAI;aACzB,CAAC,CAAC;YACH,MAAM,GAAG,IAAI,CAAC;YACd,MAAM,KAAK,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;QAAC,OAAO,iBAAiB,EAAE,CAAC;YAC3B,gBAAgB,CAAC,iBAAiB,CAAC,CAAC;YACpC,IAAI,MAAM,EAAE,CAAC;gBACX,uEAAuE;gBACvE,wEAAwE;gBACxE,0EAA0E;gBAC1E,6CAA6C;gBAC7C,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CACrC,iBAAiB,EACjB,SAAS,CAAC,OAAO,EACjB,cAAc,CACf,CAAC;gBACF,MAAM,IAAI,OAAO,CACf,WAAW,CAAC,IAAI,EAChB,wBAAwB,cAAc,0EAA0E,WAAW,CAAC,OAAO,EAAE,EACrI,cAAc,EACd,iBAAiB,CAClB,CAAC;YACJ,CAAC;YACD,MAAM,iBAAiB,CAAC;QAC1B,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAG,UAAU,CAAC;IAC7B,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,oBAAoB;IAC3B,WAAW,EACT,2GAA2G;QAC3G,wEAAwE;QACxE,0GAA0G;QAC1G,wGAAwG;QACxG,2GAA2G;QAC3G,+CAA+C;IACjD,KAAK,EAAE,eAAe;IACtB,MAAM,EAAE,gBAAgB;IACxB,WAAW,EAAE;QACX,YAAY,EAAE,KAAK;QACnB,cAAc,EAAE,KAAK;QACrB,eAAe,EAAE,IAAI;QACrB,aAAa,EAAE,KAAK;KACrB;IACD,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;QAC1C,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,OAAO;gBACL,KAAK;gBACL,OAAO,EAAE,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,IAAI,EAAE,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,WAAW,IAAI,EAAE,CAAC,EAAE;aAClF,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;IAClE,CAAC;IACD,gBAAgB,EAAE,SAAS,CAAC,OAAO;IACnC,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;IAC3E,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;QACvB,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC3C,qEAAqE;QACrE,4EAA4E;QAC5E,IAAI,qBAAqB,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;QACjD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;QACrC,OAAO;YACL,UAAU,EAAE,MAAM;YAClB,IAAI,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC;YAChF,2EAA2E;YAC3E,uEAAuE;YACvE,OAAO,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC;SAC3E,CAAC;IACJ,CAAC;CACF,CAAC,CAAC","sourcesContent":["import type { InputRequiredResult } from '@modelcontextprotocol/server';\nimport { isInputRequiredResult } from '@modelcontextprotocol/server';\n\nimport { basename, dirname, resolve } from 'node:path';\n\nimport * as z from 'zod/v4';\n\nimport { processInParallel } from '../core/concurrency.js';\nimport {\n  ErrorCode,\n  FsError,\n  isFsError,\n  isNodeError,\n  Problem,\n  rethrowIfAborted,\n} from '../core/errors.js';\nimport { joinRoster, pathLabel } from '../core/fmt.js';\nimport { destExists } from '../core/fs.js';\nimport type { GuardedFileSystem } from '../core/fs.js';\nimport {\n  choiceInput,\n  confirmKey,\n  pendingRoundTrip,\n  readAcceptedChoice,\n} from '../core/input-required.js';\nimport {\n  isPathInsideDirectory,\n  isSamePath,\n  normalizeCaseForComparison,\n} from '../core/path-utils.js';\nimport { defaultFalseBoolean, PerFileErrorSchema, RequiredPath } from '../core/schema.js';\nimport { PARALLEL_CONCURRENCY } from '../core/util.js';\nimport type { ToolCtx } from './define.js';\nimport { defineTool } from './define.js';\n\nconst MoveItemSchema = z.strictObject({\n  source: RequiredPath.describe('Path of the file or directory to move or copy'),\n  destination: RequiredPath.describe('Destination path'),\n});\n\nconst MoveItemResultSchema = z.strictObject({\n  from: z.string().describe('Resolved absolute source path'),\n  to: z.string().describe('Resolved absolute destination path'),\n});\n\nconst MoveInputSchema = z.strictObject({\n  moves: z.array(MoveItemSchema).min(1).max(100).describe('Operations to perform (max 100)'),\n  copy: defaultFalseBoolean('Copy instead of move; sources are left in place'),\n  overwrite: defaultFalseBoolean(\n    'Copy mode only: overwrite existing destinations without confirmation',\n  ),\n});\n\nconst MoveFailureItemSchema = z.strictObject({\n  source: z.string().describe('Source path that could not be moved'),\n  destination: z.string().describe('Intended destination path for the failed move'),\n  error: PerFileErrorSchema,\n});\n\ntype MoveFailureItem = z.infer<typeof MoveFailureItemSchema>;\n\nconst MoveOutputSchema = z.strictObject({\n  moves: z.array(MoveItemResultSchema).describe('Successfully completed operations'),\n  failures: z\n    .array(MoveFailureItemSchema)\n    .optional()\n    .describe('Operations that failed with per-item error details'),\n  skipped: z\n    .array(z.string())\n    .optional()\n    .describe('Destinations skipped because the user chose Skip'),\n});\n\ntype MoveItemResult = z.infer<typeof MoveItemResultSchema>;\n\ntype PairOp = 'move' | 'copy';\n\nconst VERB: Readonly<Record<PairOp, string>> = { move: 'Move', copy: 'Copy' };\n\n/** A move or copy pre-checked up to the point a confirmation decision is needed. */\ninterface TransferPlan {\n  pair: { source: string; destination: string };\n  /**\n   * The path the mutation runs on: the link itself for a move, the resolved\n   * target for a copy. Every collision check uses the resolved source instead\n   * — see {@link validateTransferSource}.\n   */\n  opSource: string;\n  validDest: string;\n  /**\n   * A rename that only changes the destination's case. Move must perform it —\n   * it is real work — so it is exempt from the destination-exists checks that\n   * would otherwise read the source itself as an existing destination. Never\n   * true for a copy, which treats a case-only target as a self-copy and skips.\n   */\n  isCaseOnlyRename: boolean;\n  /** Whether the destination existed when planned (drives the TOCTOU guard). */\n  destExistedOriginally: boolean;\n  /** Destination exists and is not a self/case-only target → needs overwrite confirmation. */\n  pending: boolean;\n}\n\n/**\n * Phase 1 (no mutation): validate source and destination, reject self-targets\n * and transfers into a subdirectory of the source, and stat the destination to\n * decide whether this pair needs an overwrite confirmation. No `mkdir` happens\n * here — the old flow created the destination's parent before asking, which\n * mutated the filesystem before a confirmation; that now waits for phase 2 (R14).\n *\n * `overwrite` is copy-only — move has no confirmation bypass — so a move always\n * passes false.\n */\nasync function planTransfer(\n  op: PairOp,\n  pair: { source: string; destination: string },\n  fs: ToolCtx['fs'],\n  overwrite: boolean,\n): Promise<TransferPlanResult> {\n  let realSource: string;\n  let opSource: string;\n  let validDest: string;\n  try {\n    ({ realSource, opSource } = await validateTransferSource(op, pair.source, fs));\n    validDest = await fs.pathGuard.validatePathForWrite(pair.destination);\n  } catch (error) {\n    return { status: 'fail', failure: pairFailure(pair, error) };\n  }\n\n  // Comparisons run on the resolved source; only the fs call in phase 2 uses\n  // opSource. validatePathForWrite resolves the destination through a symlink\n  // too, so both sides of every check must be resolved to match.\n  const resolvedSource = resolve(realSource);\n  const resolvedDest = resolve(validDest);\n\n  const isSelf = resolvedSource === resolvedDest;\n  const isCaseOnlyRename = !isSelf && isSamePath(resolvedSource, resolvedDest);\n\n  // A copy onto a case-only variant of its own source is the same file, so it\n  // is a no-op; the same rename is real work for move and proceeds.\n  if (isSelf || (isCaseOnlyRename && op === 'copy')) {\n    return { status: 'noop' };\n  }\n\n  if (!isCaseOnlyRename && isPathInsideDirectory(resolvedSource, resolvedDest)) {\n    return {\n      status: 'fail',\n      failure: pairFailure(\n        pair,\n        new FsError(\n          ErrorCode.INVALID_INPUT,\n          `Cannot ${op} a directory into its own subdirectory`,\n          pair.source,\n        ),\n      ),\n    };\n  }\n\n  const destExistedOriginally = !isCaseOnlyRename && (await destExists(fs, validDest, op));\n  const pending = destExistedOriginally && !overwrite;\n\n  return {\n    status: 'plan',\n    plan: { pair, opSource, validDest, isCaseOnlyRename, destExistedOriginally, pending },\n  };\n}\n\n/**\n * Phase 2 (mutation): confirm an overwrite if needed, TOCTOU-check the\n * destination, create its parent, then rename (with cross-device fallback) or\n * copy. A declined/missing confirmation throws `CANCELLED`, collected as a\n * per-pair failure by the caller. A destination that appeared between plan and\n * mutation (created during the confirmation gap) also fails closed.\n */\nasync function executeTransfer(\n  op: PairOp,\n  plan: TransferPlan,\n  ctx: Pick<ToolCtx, 'fs' | 'signal' | 'inputResponses' | 'log'>,\n  pendingSorted: readonly string[],\n): Promise<TransferExecResult> {\n  if (plan.pending) {\n    const key = confirmKey(pendingSorted.indexOf(plan.validDest));\n    const choice = readAcceptedChoice(ctx.inputResponses, key);\n    if (choice === 'skip') {\n      return { skipped: plan.pair.destination };\n    }\n    if (choice !== 'overwrite') {\n      throw new FsError(\n        ErrorCode.CANCELLED,\n        `${VERB[op]} cancelled: overwrite of \"${plan.pair.destination}\" was declined or missing`,\n        plan.pair.destination,\n      );\n    }\n  }\n\n  // TOCTOU check before any mutation: a destination that did not exist when\n  // planned but exists now was created during the confirmation gap.\n  if (\n    !plan.isCaseOnlyRename &&\n    !plan.destExistedOriginally &&\n    (await destExists(ctx.fs, plan.validDest, op))\n  ) {\n    throw new FsError(\n      ErrorCode.CANCELLED,\n      `${VERB[op]} cancelled: destination \"${plan.pair.destination}\" was created during confirmation.`,\n      plan.pair.destination,\n    );\n  }\n\n  await ctx.fs.mkdir(dirname(plan.validDest), { recursive: true });\n\n  if (op === 'move') {\n    await performRenameWithFallback(plan.opSource, plan.validDest, ctx.fs, plan.pair.source);\n    ctx.log?.('info', `move: ${plan.pair.source} -> ${plan.pair.destination}`, 'move');\n  } else {\n    await ctx.fs.cp(plan.opSource, plan.validDest, {\n      recursive: true,\n      verbatimSymlinks: true,\n      preserveTimestamps: true,\n      force: true,\n    });\n  }\n  return { value: { from: plan.opSource, to: plan.validDest } };\n}\n\ntype TransferPlanResult =\n  | { status: 'fail'; failure: MoveFailureItem }\n  | { status: 'noop' }\n  | { status: 'plan'; plan: TransferPlan };\n\n/** A discriminated union, so the fold below narrows without a generic cast. */\ntype TransferExecResult = { readonly skipped: string } | { readonly value: MoveItemResult };\n\nfunction pairFailure(\n  pair: { source: string; destination: string },\n  error: unknown,\n): MoveFailureItem {\n  return {\n    source: pair.source,\n    destination: pair.destination,\n    error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, pair.source),\n  };\n}\n\n/**\n * The source→destination sibling of `runOverPaths`: plan every pair, fail closed\n * on a duplicated destination, round-trip the overwrite confirmations as one\n * set, then execute what survived in parallel. `copy` and `move` differ only in\n * their `plan` and `execute` callbacks.\n */\nasync function runTransfers(\n  items: readonly z.infer<typeof MoveItemSchema>[],\n  ctx: ToolCtx,\n  op: PairOp,\n  overwrite: boolean,\n): Promise<\n  | { results: MoveItemResult[]; skipped: string[]; failures: MoveFailureItem[] }\n  | InputRequiredResult\n> {\n  const { results: planned, errors: planErrors } = await processInParallel(\n    items,\n    (pair) => planTransfer(op, pair, ctx.fs, overwrite),\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n  // plan callbacks are fail-closed (they return { status: 'fail' }, never\n  // throw), so planErrors should always be empty. Surface the first rather\n  // than silently dropping the item if a future plan callback violates that.\n  const firstPlanError = planErrors[0];\n  if (firstPlanError) throw firstPlanError.error;\n\n  const failures: MoveFailureItem[] = [];\n  const candidates: TransferPlan[] = [];\n  for (const { value } of planned) {\n    if (value.status === 'fail') failures.push(value.failure);\n    else if (value.status === 'plan') candidates.push(value.plan);\n    // 'noop' (self-copy / self-move) is silently skipped.\n  }\n\n  // Two sources targeting the same destination in one batch would otherwise\n  // collapse to a single shared overwrite confirmation and let the second\n  // one silently clobber the first's freshly-written content. Fail closed:\n  // only the first plan per destination proceeds; later ones targeting the\n  // same destination are reported as a per-item failure.\n  const seenDest = new Set<string>();\n  const ready: TransferPlan[] = [];\n  for (const candidate of candidates) {\n    const destKey = normalizeCaseForComparison(candidate.validDest);\n    if (seenDest.has(destKey)) {\n      failures.push(\n        pairFailure(\n          candidate.pair,\n          new FsError(\n            ErrorCode.INVALID_INPUT,\n            `${VERB[op]} cancelled: another entry in this batch already targets destination \"${candidate.pair.destination}\"`,\n            candidate.pair.destination,\n          ),\n        ),\n      );\n      continue;\n    }\n    seenDest.add(destKey);\n    ready.push(candidate);\n  }\n\n  const pendingSorted = ready\n    .filter((p) => p.pending)\n    .map((p) => p.validDest)\n    .sort();\n  if (pendingSorted.length > 0) {\n    // Round 1 returns input_required; a retry whose verified state does not\n    // bind this overwrite set throws (R9) via `pendingRoundTrip`.\n    const round = await pendingRoundTrip({\n      op,\n      pending: pendingSorted,\n      requestState: ctx.requestState,\n      clientCapabilities: ctx.clientCapabilities,\n      buildInputs: (dests) =>\n        dests.map((dest, i) =>\n          choiceInput(\n            confirmKey(i),\n            op === 'move'\n              ? `\"${dest}\" already exists. Overwrite it?`\n              : `Destination \"${dest}\" already exists. Overwrite it?`,\n            [\n              { value: 'overwrite', title: 'Overwrite' },\n              { value: 'skip', title: 'Skip' },\n            ],\n          ),\n        ),\n    });\n    if (round !== undefined) return round;\n  }\n\n  const total = ready.length;\n  let completed = 0;\n  const tick = (): void => {\n    completed += 1;\n    ctx.onProgress?.({ current: completed, total });\n  };\n  const { results: execResults, errors: execErrors } = await processInParallel(\n    ready,\n    async (readyPlan) => {\n      try {\n        return await executeTransfer(op, readyPlan, ctx, pendingSorted);\n      } finally {\n        tick();\n      }\n    },\n    PARALLEL_CONCURRENCY,\n    ctx.signal,\n  );\n\n  for (const { error, index } of execErrors) {\n    rethrowIfAborted(error);\n    const failed = ready[index];\n    if (failed) failures.push(pairFailure(failed.pair, error));\n  }\n\n  const results: MoveItemResult[] = [];\n  const skipped: string[] = [];\n  for (const { value } of execResults) {\n    if ('skipped' in value) skipped.push(value.skipped);\n    else results.push(value.value);\n  }\n\n  return { results, skipped, failures };\n}\n\n/**\n * Two-phase move: pre-check every move (no mutation) to build the overwrite\n * pending set; if any move is pending and the round carries no verified\n * `requestState`, return `input_required` moving nothing (R14). On retry, R9\n * checks the state binds this move set, then each pending move proceeds only on\n * an accepted overwrite. Non-pending moves proceed alongside them.\n */\nasync function handleMove(\n  args: z.infer<typeof MoveInputSchema>,\n  ctx: ToolCtx,\n): Promise<z.infer<typeof MoveOutputSchema> | InputRequiredResult> {\n  const op: PairOp = args.copy ? 'copy' : 'move';\n  // `overwrite` is copy-only; move has no confirmation bypass.\n  const overwrite = args.copy && args.overwrite;\n  const outcome = await runTransfers(args.moves, ctx, op, overwrite);\n  if (isInputRequiredResult(outcome)) return outcome;\n\n  const { results, skipped, failures } = outcome;\n\n  return {\n    moves: results,\n    ...(failures.length > 0 ? { failures } : {}),\n    ...(skipped.length > 0 ? { skipped } : {}),\n  };\n}\n\nfunction buildSummary(\n  verb: 'move' | 'copy',\n  results: readonly MoveItemResult[],\n  failures: readonly MoveFailureItem[],\n  skipped: readonly string[],\n): string {\n  const successCount = results.length;\n  const failCount = failures.length;\n  if (failCount === 0 && skipped.length === 0 && successCount === 1) {\n    const result = results[0];\n    if (result) {\n      return `${verb}: ${pathLabel(result.from)} → ${pathLabel(result.to)}`;\n    }\n  }\n  // Name each pair. \"move: 2 items\" left the caller to open structuredContent\n  // to learn which two, and a partial failure was unreadable without it.\n  // Skipped destinations are an outcome the user chose, not a failure — name\n  // them, or an all-skipped call reads as \"copy: nothing\".\n  const tokens = [\n    ...results.map((r) => `${pathLabel(r.from)} → ${pathLabel(r.to)}`),\n    ...skipped.map((dest) => `${pathLabel(dest)} SKIPPED`),\n  ];\n  const parts = [`${verb}: ${joinRoster(tokens) || 'nothing'}`];\n  if (failCount > 0) parts.push(`${String(failCount)} failed`);\n  return parts.join(' · ');\n}\n\ninterface TransferSource {\n  /** Symlink resolved — the identity used for every same-target comparison. */\n  realSource: string;\n  /** The path the mutation runs on: symlink preserved for move, resolved for copy. */\n  opSource: string;\n}\n\n/**\n * A move needs two views of its source. Renaming must operate on the link\n * itself, or moving a symlink would rename the file it points at and leave the\n * link dangling. Every collision check must instead compare the resolved\n * target, or a link moved onto itself (or onto its own target) reads as a real\n * move and renames the link over that target, destroying it. A copy reads\n * through the link, so both views are the resolved one.\n */\nasync function validateTransferSource(\n  op: PairOp,\n  source: string,\n  fs: ToolCtx['fs'],\n): Promise<TransferSource> {\n  try {\n    const realSource = await fs.pathGuard.validateExistingPath(source);\n    const opSource = op === 'move' ? await fs.pathGuard.validatePathForDelete(source) : realSource;\n    return { realSource, opSource };\n  } catch (error) {\n    if (isFsError(error)) throw error;\n    throw new FsError(ErrorCode.ACCESS_DENIED, `${VERB[op]} failed for ${source}`, source);\n  }\n}\n\nasync function performRenameWithFallback(\n  validSource: string,\n  validDest: string,\n  fsOps: Pick<GuardedFileSystem, 'rename' | 'cp' | 'rm'>,\n  originalSource: string,\n): Promise<void> {\n  try {\n    await fsOps.rename(validSource, validDest);\n  } catch (error: unknown) {\n    rethrowIfAborted(error);\n\n    if (!isNodeError(error) || error.code !== 'EXDEV') {\n      throw error;\n    }\n\n    // EXDEV: cross-device rename. Copy then remove, preserving symlinks and\n    // timestamps so link semantics survive the move.\n    let copied = false;\n    try {\n      await fsOps.cp(validSource, validDest, {\n        recursive: true,\n        verbatimSymlinks: true,\n        preserveTimestamps: true,\n      });\n      copied = true;\n      await fsOps.rm(validSource, { recursive: true, force: true });\n    } catch (copyOrRemoveError) {\n      rethrowIfAborted(copyOrRemoveError);\n      if (copied) {\n        // cp succeeded but rm failed: the destination already holds a complete\n        // copy and the source remains. Surface the rm error as the cause so the\n        // caller can recover (clean up the duplicate) instead of a silent generic\n        // failure that hides the partial completion.\n        const baseProblem = Problem.fromUnknown(\n          copyOrRemoveError,\n          ErrorCode.UNKNOWN,\n          originalSource,\n        );\n        throw new FsError(\n          baseProblem.code,\n          `Cross-device move of ${originalSource}: copy succeeded but source removal failed (destination holds a copy): ${baseProblem.message}`,\n          originalSource,\n          copyOrRemoveError,\n        );\n      }\n      throw copyOrRemoveError;\n    }\n  }\n}\n\nexport const MOVE = defineTool({\n  name: 'move',\n  title: 'Move or Copy Files',\n  description:\n    'Move, rename, or copy files and directories to explicit destination paths (max 100 operations per call). ' +\n    'Pass moves: [{ source, destination }] — there is no single-pair form. ' +\n    'Parent directories are created automatically. Set copy=true to copy instead of move (sources are kept). ' +\n    'An existing destination prompts the user to confirm the overwrite, so the call returns without moving ' +\n    'anything until that confirmation comes back; copy=true with overwrite=true skips the prompt, move has no ' +\n    'such bypass. Self-moves are silently skipped.',\n  input: MoveInputSchema,\n  output: MoveOutputSchema,\n  annotations: {\n    readOnlyHint: false,\n    idempotentHint: false,\n    destructiveHint: true,\n    openWorldHint: false,\n  },\n  progress: (args) => {\n    const label = args.copy ? 'Copy' : 'Move';\n    if (args.moves.length === 1) {\n      const move = args.moves[0];\n      return {\n        label,\n        subject: `${basename(move?.source ?? '')} → ${basename(move?.destination ?? '')}`,\n      };\n    }\n    return { label, subject: `${String(args.moves.length)} files` };\n  },\n  defaultErrorCode: ErrorCode.UNKNOWN,\n  accessPaths: (args) => args.moves.flatMap((m) => [m.source, m.destination]),\n  run: async (args, ctx) => {\n    const output = await handleMove(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(output)) return output;\n    const failures = output.failures ?? [];\n    const skipped = output.skipped ?? [];\n    return {\n      structured: output,\n      text: buildSummary(args.copy ? 'copy' : 'move', output.moves, failures, skipped),\n      // Every requested pair failed: no move, no copy, no user-chosen skip - the\n      // call did nothing. A skip is work the caller asked for, so it counts.\n      isError: failures.length > 0 && output.moves.length + skipped.length === 0,\n    };\n  },\n});\n"]}

package/dist/tools/progress.d.ts

@@ -1,5 +1,5 @@
 import type { Notification } from '@modelcontextprotocol/server';
-export type ProgressEvent = {
+type ProgressEvent = {
     kind: 'tick';
     current: number;
     total?: number;

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

@@ -1 +1 @@
-{"version":3,"file":"progress.d.ts","sourceRoot":"","sources":["../../src/tools/progress.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAA8B,MAAM,8BAA8B,CAAC;AAU7F,MAAM,MAAM,aAAa,GACrB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GAClE;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACtE;IACE,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,OAAO,CAAC;CAChB,CAAC;AAEN,UAAU,sBAAsB;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,eAAe,CAAC;IACvB,qDAAqD;IACrD,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAID,qBAAa,eAAe;;gBAUd,IAAI,EAAE,sBAAsB;IAiBxC,GAAG,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI;IAevE,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAU/B,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI;CAyC7C;AAED,qBAAa,eAAe;;IAC1B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAkB;IACxC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAqC;gBAK1D,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,GAAG,MAAM,EACtB,MAAM,EAAE,CAAC,CAAC,EAAE,YAAY,KAAK,OAAO,CAAC,IAAI,CAAC;IAO5C,IAAI,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI;IAsC1B,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAK7B"}
+{"version":3,"file":"progress.d.ts","sourceRoot":"","sources":["../../src/tools/progress.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAA8B,MAAM,8BAA8B,CAAC;AAU7F,KAAK,aAAa,GACd;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GAClE;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACtE;IACE,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,OAAO,CAAC;CAChB,CAAC;AAEN,UAAU,sBAAsB;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,eAAe,CAAC;IACvB,qDAAqD;IACrD,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAID,qBAAa,eAAe;;gBAUd,IAAI,EAAE,sBAAsB;IAiBxC,GAAG,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI;IAevE,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAU/B,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI;CAyC7C;AAED,qBAAa,eAAe;;IAC1B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAkB;IACxC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAqC;gBAK1D,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,GAAG,MAAM,EACtB,MAAM,EAAE,CAAC,CAAC,EAAE,YAAY,KAAK,OAAO,CAAC,IAAI,CAAC;IAO5C,IAAI,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI;IAsC1B,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAK7B"}

package/dist/tools/progress.js.map

@@ -1 +1 @@
-{"version":3,"file":"progress.js","sourceRoot":"","sources":["../../src/tools/progress.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAC9D,OAAO,EAAE,MAAM,EAAE,MAAM,0BAA0B,CAAC;AAElD,SAAS,mBAAmB,CAAC,QAAgB,EAAE,OAAe,EAAE,KAAc;IAC5E,MAAM,OAAO,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,QAAQ,KAAK,OAAO,YAAY,OAAO,EAAE,CAAC,CAAC;AACvE,CAAC;AAoBD,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAEjC,MAAM,OAAO,eAAe;IACjB,MAAM,CAAS;IACf,KAAK,CAA8B;IACnC,YAAY,CAAS;IACrB,UAAU,CAAS;IAE5B,OAAO,GAAG,CAAC,CAAC;IACZ,WAAW,GAAG,CAAC,CAAC;IAChB,KAAK,GAAG,KAAK,CAAC;IAEd,YAAY,IAA4B;QACtC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,IAAI,qBAAqB,CAAC;QAE9D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC;QAE3C,uFAAuF;QACvF,IAAI,CAAC,SAAS,CAAC;YACb,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,IAAI,CAAC,MAAM;SACrB,CAAC,CAAC;IACL,CAAC;IAED,GAAG,CAAC,KAA4D;QAC9D,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO;QACvB,0EAA0E;QAC1E,yEAAyE;QACzE,qDAAqD;QACrD,IAAI,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO;QAC1C,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;QAC7B,IAAI,CAAC,SAAS,CAAC;YACb,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,OAAO,EAAE,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM;SACtC,CAAC,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,OAAe;QACtB,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,SAAS,CAAC;YACb,IAAI,EAAE,UAAU;YAChB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,OAAO;SACR,CAAC,CAAC;IACL,CAAC;IAED,IAAI,CAAC,KAAc,EAAE,OAAgB;QACnC,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,SAAS,CAAC;YACb,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,OAAO,EAAE,OAAO,IAAI,IAAI,CAAC,MAAM;YAC/B,KAAK;SACN,CAAC,CAAC;IACL,CAAC;IAED,SAAS,CAAC,KAAoB;QAC5B,IAAI,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;YACjC,OAAO;QACT,CAAC;QAED,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE9B,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO;QACxB,IAAI,CAAC;YACH,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,mEAAmE;YACnE,MAAM,CAAC,IAAI,CAAC,2BAA2B,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IAED,gBAAgB,CAAC,KAAoB;QACnC,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC1B,OAAO,KAAK,CAAC;QACf,CAAC;QAED,6EAA6E;QAC7E,0DAA0D;QAC1D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,kBAAkB,GACtB,GAAG,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;QAEtF,MAAM,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QACvC,OAAO,OAAO,GAAG,kBAAkB,CAAC;IACtC,CAAC;CACF;AAED,MAAM,OAAO,eAAe;IACT,QAAQ,CAAS;IACjB,KAAK,CAAkB;IACvB,MAAM,CAAqC;IACnD,QAAQ,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC7C,aAAa,GAAG,CAAC,CAAC,CAAC;IAEnB,YACE,QAAgB,EAChB,KAAsB,EACtB,MAA0C;QAE1C,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,IAAI,CAAC,KAAoB;QACvB,IAAI,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;QAC5B,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACxB,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC9B,OAAO,GAAG,KAAK,IAAI,OAAO,CAAC;YAC3B,KAAK,GAAG,OAAO,CAAC;QAClB,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC1B,qEAAqE;YACrE,yEAAyE;YACzE,kEAAkE;YAClE,0EAA0E;YAC1E,aAAa;YACb,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;YACpD,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,OAAO;gBAAE,KAAK,GAAG,OAAO,CAAC;QAC9D,CAAC;QACD,yEAAyE;QACzE,IAAI,OAAO,IAAI,IAAI,CAAC,aAAa;YAAE,OAAO;QAC1C,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;QAC7B,MAAM,kBAAkB,GAA+B;YACrD,aAAa,EAAE,IAAI,CAAC,KAAK;YACzB,QAAQ,EAAE,OAAO;YACjB,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzC,OAAO,EAAE,KAAK,CAAC,OAAO;SACvB,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;YAC1B,MAAM,EAAE,wBAAwB;YAChC,MAAM,EAAE,kBAAkB;SAC3B,CAAC;aACC,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;YACxB,mBAAmB,CAAC,IAAI,CAAC,QAAQ,EAAE,sBAAsB,EAAE,KAAK,CAAC,CAAC;QACpE,CAAC,CAAC;aACD,OAAO,CAAC,GAAG,EAAE;YACZ,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;CACF","sourcesContent":["import type { Notification, ProgressNotificationParams } from '@modelcontextprotocol/server';\n\nimport { formatUnknownErrorMessage } from '../core/errors.js';\nimport { Logger } from '../core/observability.js';\n\nfunction reportDetachedError(toolName: string, context: string, error: unknown): void {\n  const message = formatUnknownErrorMessage(error);\n  Logger.emit('warning', `${toolName}: ${context} failed: ${message}`);\n}\n\nexport type ProgressEvent =\n  | { kind: 'tick'; current: number; total?: number; message: string }\n  | { kind: 'complete'; current: number; total?: number; message: string }\n  | {\n      kind: 'fail';\n      current: number;\n      total?: number;\n      message: string;\n      error: unknown;\n    };\n\ninterface ProgressSessionOptions {\n  label: string;\n  sink?: McpProgressSink;\n  /** Override the rate limit window. Default: 50ms. */\n  rateLimitMs?: number;\n}\n\nconst DEFAULT_RATE_LIMIT_MS = 50;\n\nexport class ProgressSession {\n  readonly #label: string;\n  readonly #sink: McpProgressSink | undefined;\n  readonly #rateLimitMs: number;\n  readonly #startTime: number;\n\n  #cursor = 0;\n  #lastSentMs = 0;\n  #done = false;\n\n  constructor(opts: ProgressSessionOptions) {\n    this.#label = opts.label;\n    this.#sink = opts.sink;\n    this.#rateLimitMs = opts.rateLimitMs ?? DEFAULT_RATE_LIMIT_MS;\n\n    const now = Date.now();\n    this.#startTime = now;\n    this.#lastSentMs = now - this.#rateLimitMs;\n\n    // Synthetic start tick — preserves today's \"fire 0 at session creation\" wire behavior.\n    this.#dispatch({\n      kind: 'tick',\n      current: 0,\n      message: this.#label,\n    });\n  }\n\n  set(input: { current: number; total?: number; message?: string }): void {\n    if (this.#done) return;\n    // The spec requires `progress` to increase on every notification, and the\n    // constructor already dispatched current: 0. A repeated or backward tick\n    // would put a duplicate value on the wire — drop it.\n    if (input.current <= this.#cursor) return;\n    this.#cursor = input.current;\n    this.#dispatch({\n      kind: 'tick',\n      current: this.#cursor,\n      ...(input.total !== undefined ? { total: input.total } : {}),\n      message: input.message ?? this.#label,\n    });\n  }\n\n  complete(message: string): void {\n    if (this.#done) return;\n    this.#done = true;\n    this.#dispatch({\n      kind: 'complete',\n      current: this.#cursor,\n      message,\n    });\n  }\n\n  fail(error: unknown, message?: string): void {\n    if (this.#done) return;\n    this.#done = true;\n    this.#dispatch({\n      kind: 'fail',\n      current: this.#cursor,\n      message: message ?? this.#label,\n      error,\n    });\n  }\n\n  #dispatch(event: ProgressEvent): void {\n    if (this.#shouldRateLimit(event)) {\n      return;\n    }\n\n    this.#lastSentMs = Date.now();\n\n    if (!this.#sink) return;\n    try {\n      this.#sink.emit(event);\n    } catch (err) {\n      // A sink failure must never fail the tool call it is reporting on.\n      Logger.warn('progress sink emit failed', { eventKind: event.kind, err });\n    }\n  }\n\n  #shouldRateLimit(event: ProgressEvent): boolean {\n    if (event.kind !== 'tick') {\n      return false;\n    }\n\n    // Widen the window after 5s of execution; a rateLimitMs of 0 (tests) stays 0\n    // only inside the first 5s, which every test run fits in.\n    const now = Date.now();\n    const effectiveRateLimit =\n      now - this.#startTime > 5000 ? Math.max(this.#rateLimitMs, 250) : this.#rateLimitMs;\n\n    const elapsed = now - this.#lastSentMs;\n    return elapsed < effectiveRateLimit;\n  }\n}\n\nexport class McpProgressSink {\n  private readonly toolName: string;\n  private readonly token: string | number;\n  private readonly notify: (n: Notification) => Promise<void>;\n  readonly #pending = new Set<Promise<void>>();\n  #lastProgress = -1;\n\n  constructor(\n    toolName: string,\n    token: string | number,\n    notify: (n: Notification) => Promise<void>,\n  ) {\n    this.toolName = toolName;\n    this.token = token;\n    this.notify = notify;\n  }\n\n  emit(event: ProgressEvent): void {\n    let current = event.current;\n    let total = event.total;\n    if (event.kind === 'complete') {\n      current = total ?? current;\n      total = current;\n    }\n    if (event.kind !== 'tick') {\n      // A terminal frame carries the outcome message, so it must reach the\n      // wire. It repeats the cursor whenever the session has no `total` (there\n      // is nothing higher to report), and the spec requires progress to\n      // increase per token — so advance past the last value instead of dropping\n      // the frame.\n      current = Math.max(current, this.#lastProgress + 1);\n      if (total !== undefined && total < current) total = current;\n    }\n    // Spec: progress must increase on every notification for the same token.\n    if (current <= this.#lastProgress) return;\n    this.#lastProgress = current;\n    const notificationParams: ProgressNotificationParams = {\n      progressToken: this.token,\n      progress: current,\n      ...(total !== undefined ? { total } : {}),\n      message: event.message,\n    };\n    const promise = this.notify({\n      method: 'notifications/progress',\n      params: notificationParams,\n    })\n      .catch((error: unknown) => {\n        reportDetachedError(this.toolName, 'progressNotification', error);\n      })\n      .finally(() => {\n        this.#pending.delete(promise);\n      });\n    this.#pending.add(promise);\n  }\n\n  async flush(): Promise<void> {\n    if (this.#pending.size > 0) {\n      await Promise.allSettled([...this.#pending]);\n    }\n  }\n}\n"]}
+{"version":3,"file":"progress.js","sourceRoot":"","sources":["../../src/tools/progress.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAC9D,OAAO,EAAE,MAAM,EAAE,MAAM,0BAA0B,CAAC;AAElD,SAAS,mBAAmB,CAAC,QAAgB,EAAE,OAAe,EAAE,KAAc;IAC5E,MAAM,OAAO,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,QAAQ,KAAK,OAAO,YAAY,OAAO,EAAE,CAAC,CAAC;AACvE,CAAC;AAoBD,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAEjC,MAAM,OAAO,eAAe;IACjB,MAAM,CAAS;IACf,KAAK,CAA8B;IACnC,YAAY,CAAS;IACrB,UAAU,CAAS;IAE5B,OAAO,GAAG,CAAC,CAAC;IACZ,WAAW,GAAG,CAAC,CAAC;IAChB,KAAK,GAAG,KAAK,CAAC;IAEd,YAAY,IAA4B;QACtC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,IAAI,qBAAqB,CAAC;QAE9D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC;QAE3C,uFAAuF;QACvF,IAAI,CAAC,SAAS,CAAC;YACb,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,IAAI,CAAC,MAAM;SACrB,CAAC,CAAC;IACL,CAAC;IAED,GAAG,CAAC,KAA4D;QAC9D,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO;QACvB,0EAA0E;QAC1E,yEAAyE;QACzE,qDAAqD;QACrD,IAAI,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO;QAC1C,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;QAC7B,IAAI,CAAC,SAAS,CAAC;YACb,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,OAAO,EAAE,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM;SACtC,CAAC,CAAC;IACL,CAAC;IAED,QAAQ,CAAC,OAAe;QACtB,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,SAAS,CAAC;YACb,IAAI,EAAE,UAAU;YAChB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,OAAO;SACR,CAAC,CAAC;IACL,CAAC;IAED,IAAI,CAAC,KAAc,EAAE,OAAgB;QACnC,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,SAAS,CAAC;YACb,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,OAAO,EAAE,OAAO,IAAI,IAAI,CAAC,MAAM;YAC/B,KAAK;SACN,CAAC,CAAC;IACL,CAAC;IAED,SAAS,CAAC,KAAoB;QAC5B,IAAI,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;YACjC,OAAO;QACT,CAAC;QAED,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE9B,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO;QACxB,IAAI,CAAC;YACH,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,mEAAmE;YACnE,MAAM,CAAC,IAAI,CAAC,2BAA2B,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IAED,gBAAgB,CAAC,KAAoB;QACnC,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC1B,OAAO,KAAK,CAAC;QACf,CAAC;QAED,6EAA6E;QAC7E,0DAA0D;QAC1D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,kBAAkB,GACtB,GAAG,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;QAEtF,MAAM,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QACvC,OAAO,OAAO,GAAG,kBAAkB,CAAC;IACtC,CAAC;CACF;AAED,MAAM,OAAO,eAAe;IACT,QAAQ,CAAS;IACjB,KAAK,CAAkB;IACvB,MAAM,CAAqC;IACnD,QAAQ,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC7C,aAAa,GAAG,CAAC,CAAC,CAAC;IAEnB,YACE,QAAgB,EAChB,KAAsB,EACtB,MAA0C;QAE1C,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,IAAI,CAAC,KAAoB;QACvB,IAAI,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;QAC5B,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACxB,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC9B,OAAO,GAAG,KAAK,IAAI,OAAO,CAAC;YAC3B,KAAK,GAAG,OAAO,CAAC;QAClB,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC1B,qEAAqE;YACrE,yEAAyE;YACzE,kEAAkE;YAClE,0EAA0E;YAC1E,aAAa;YACb,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;YACpD,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,OAAO;gBAAE,KAAK,GAAG,OAAO,CAAC;QAC9D,CAAC;QACD,yEAAyE;QACzE,IAAI,OAAO,IAAI,IAAI,CAAC,aAAa;YAAE,OAAO;QAC1C,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;QAC7B,MAAM,kBAAkB,GAA+B;YACrD,aAAa,EAAE,IAAI,CAAC,KAAK;YACzB,QAAQ,EAAE,OAAO;YACjB,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzC,OAAO,EAAE,KAAK,CAAC,OAAO;SACvB,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;YAC1B,MAAM,EAAE,wBAAwB;YAChC,MAAM,EAAE,kBAAkB;SAC3B,CAAC;aACC,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;YACxB,mBAAmB,CAAC,IAAI,CAAC,QAAQ,EAAE,sBAAsB,EAAE,KAAK,CAAC,CAAC;QACpE,CAAC,CAAC;aACD,OAAO,CAAC,GAAG,EAAE;YACZ,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;CACF","sourcesContent":["import type { Notification, ProgressNotificationParams } from '@modelcontextprotocol/server';\n\nimport { formatUnknownErrorMessage } from '../core/errors.js';\nimport { Logger } from '../core/observability.js';\n\nfunction reportDetachedError(toolName: string, context: string, error: unknown): void {\n  const message = formatUnknownErrorMessage(error);\n  Logger.emit('warning', `${toolName}: ${context} failed: ${message}`);\n}\n\ntype ProgressEvent =\n  | { kind: 'tick'; current: number; total?: number; message: string }\n  | { kind: 'complete'; current: number; total?: number; message: string }\n  | {\n      kind: 'fail';\n      current: number;\n      total?: number;\n      message: string;\n      error: unknown;\n    };\n\ninterface ProgressSessionOptions {\n  label: string;\n  sink?: McpProgressSink;\n  /** Override the rate limit window. Default: 50ms. */\n  rateLimitMs?: number;\n}\n\nconst DEFAULT_RATE_LIMIT_MS = 50;\n\nexport class ProgressSession {\n  readonly #label: string;\n  readonly #sink: McpProgressSink | undefined;\n  readonly #rateLimitMs: number;\n  readonly #startTime: number;\n\n  #cursor = 0;\n  #lastSentMs = 0;\n  #done = false;\n\n  constructor(opts: ProgressSessionOptions) {\n    this.#label = opts.label;\n    this.#sink = opts.sink;\n    this.#rateLimitMs = opts.rateLimitMs ?? DEFAULT_RATE_LIMIT_MS;\n\n    const now = Date.now();\n    this.#startTime = now;\n    this.#lastSentMs = now - this.#rateLimitMs;\n\n    // Synthetic start tick — preserves today's \"fire 0 at session creation\" wire behavior.\n    this.#dispatch({\n      kind: 'tick',\n      current: 0,\n      message: this.#label,\n    });\n  }\n\n  set(input: { current: number; total?: number; message?: string }): void {\n    if (this.#done) return;\n    // The spec requires `progress` to increase on every notification, and the\n    // constructor already dispatched current: 0. A repeated or backward tick\n    // would put a duplicate value on the wire — drop it.\n    if (input.current <= this.#cursor) return;\n    this.#cursor = input.current;\n    this.#dispatch({\n      kind: 'tick',\n      current: this.#cursor,\n      ...(input.total !== undefined ? { total: input.total } : {}),\n      message: input.message ?? this.#label,\n    });\n  }\n\n  complete(message: string): void {\n    if (this.#done) return;\n    this.#done = true;\n    this.#dispatch({\n      kind: 'complete',\n      current: this.#cursor,\n      message,\n    });\n  }\n\n  fail(error: unknown, message?: string): void {\n    if (this.#done) return;\n    this.#done = true;\n    this.#dispatch({\n      kind: 'fail',\n      current: this.#cursor,\n      message: message ?? this.#label,\n      error,\n    });\n  }\n\n  #dispatch(event: ProgressEvent): void {\n    if (this.#shouldRateLimit(event)) {\n      return;\n    }\n\n    this.#lastSentMs = Date.now();\n\n    if (!this.#sink) return;\n    try {\n      this.#sink.emit(event);\n    } catch (err) {\n      // A sink failure must never fail the tool call it is reporting on.\n      Logger.warn('progress sink emit failed', { eventKind: event.kind, err });\n    }\n  }\n\n  #shouldRateLimit(event: ProgressEvent): boolean {\n    if (event.kind !== 'tick') {\n      return false;\n    }\n\n    // Widen the window after 5s of execution; a rateLimitMs of 0 (tests) stays 0\n    // only inside the first 5s, which every test run fits in.\n    const now = Date.now();\n    const effectiveRateLimit =\n      now - this.#startTime > 5000 ? Math.max(this.#rateLimitMs, 250) : this.#rateLimitMs;\n\n    const elapsed = now - this.#lastSentMs;\n    return elapsed < effectiveRateLimit;\n  }\n}\n\nexport class McpProgressSink {\n  private readonly toolName: string;\n  private readonly token: string | number;\n  private readonly notify: (n: Notification) => Promise<void>;\n  readonly #pending = new Set<Promise<void>>();\n  #lastProgress = -1;\n\n  constructor(\n    toolName: string,\n    token: string | number,\n    notify: (n: Notification) => Promise<void>,\n  ) {\n    this.toolName = toolName;\n    this.token = token;\n    this.notify = notify;\n  }\n\n  emit(event: ProgressEvent): void {\n    let current = event.current;\n    let total = event.total;\n    if (event.kind === 'complete') {\n      current = total ?? current;\n      total = current;\n    }\n    if (event.kind !== 'tick') {\n      // A terminal frame carries the outcome message, so it must reach the\n      // wire. It repeats the cursor whenever the session has no `total` (there\n      // is nothing higher to report), and the spec requires progress to\n      // increase per token — so advance past the last value instead of dropping\n      // the frame.\n      current = Math.max(current, this.#lastProgress + 1);\n      if (total !== undefined && total < current) total = current;\n    }\n    // Spec: progress must increase on every notification for the same token.\n    if (current <= this.#lastProgress) return;\n    this.#lastProgress = current;\n    const notificationParams: ProgressNotificationParams = {\n      progressToken: this.token,\n      progress: current,\n      ...(total !== undefined ? { total } : {}),\n      message: event.message,\n    };\n    const promise = this.notify({\n      method: 'notifications/progress',\n      params: notificationParams,\n    })\n      .catch((error: unknown) => {\n        reportDetachedError(this.toolName, 'progressNotification', error);\n      })\n      .finally(() => {\n        this.#pending.delete(promise);\n      });\n    this.#pending.add(promise);\n  }\n\n  async flush(): Promise<void> {\n    if (this.#pending.size > 0) {\n      await Promise.allSettled([...this.#pending]);\n    }\n  }\n}\n"]}

package/dist/tools/read.d.ts

@@ -1,2 +1,2 @@
-export declare const READ_FILE: import("./define.js").DefinedTool;
+export declare const READ: import("./define.js").DefinedTool;
 //# sourceMappingURL=read.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"read.d.ts","sourceRoot":"","sources":["../../src/tools/read.ts"],"names":[],"mappings":"AA8YA,eAAO,MAAM,SAAS,mCAoKpB,CAAC"}
+{"version":3,"file":"read.d.ts","sourceRoot":"","sources":["../../src/tools/read.ts"],"names":[],"mappings":"AAkYA,eAAO,MAAM,IAAI,mCAgKf,CAAC"}