@j0hanz/filesystem-mcp 2.1.4 → 2.1.6

package/dist/tools/index.js

@@ -27,7 +27,6 @@ export const ALL_TOOLS = [
     GET_FILE_INFO,
 ];
 export const MUTATING_TOOL_NAMES = new Set(ALL_TOOLS.filter((t) => !t.annotations.readOnlyHint).map((t) => t.name));
-export const ALL_REGISTERED_TOOL_NAMES = ALL_TOOLS.map((t) => t.name);
 /** The tools a server registers at this setting — the one owner of the `--read-only` gate. */
 export function registeredTools(readOnly) {
     return readOnly ? ALL_TOOLS.filter((t) => !MUTATING_TOOL_NAMES.has(t.name)) : ALL_TOOLS;

package/dist/tools/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/tools/index.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,EAAE,wBAAwB,EAAE,MAAM,YAAY,CAAC;AACtD,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAE1C,MAAM,CAAC,MAAM,SAAS,GAAG;IACvB,MAAM;IACN,WAAW;IACX,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,SAAS;IACT,kBAAkB;IAClB,wBAAwB;IACxB,cAAc;IACd,YAAY;IACZ,aAAa;CACL,CAAC;AAEX,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,GAAG,CACxC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACxE,CAAC;AAEF,MAAM,CAAC,MAAM,yBAAyB,GAAsB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAEzF,8FAA8F;AAC9F,MAAM,UAAU,eAAe,CAAC,QAAiB;IAC/C,OAAO,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC1F,CAAC;AAED,gFAAgF;AAChF,6EAA6E;AAC7E,2EAA2E;AAC3E,uEAAuE;AACvE,6CAA6C;AAC7C,OAAO,EAAE,IAAI,EAAE,wBAAwB,EAAE,SAAS,EAAE,cAAc,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC;AAUlG,MAAM,UAAU,aAAa,CAAC,IAAuB;IACnD,MAAM,QAAQ,GAAG;QACf,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,aAAa,EAAE,IAAI,CAAC,aAAa;KAClC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,EAAE,CAAC;QAC3D,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC","sourcesContent":["import type { McpServer } from '@modelcontextprotocol/server';\n\nimport type { PageSnapshotStore } from '../core/page-store.js';\nimport type { PathGuard } from '../core/path.js';\nimport type { ResourceStore } from '../core/store.js';\nimport { CREATE } from './create.js';\nimport type { DefinedTool } from './define.js';\nimport { DELETE_FILE } from './delete-file.js';\nimport { DIFF } from './diff.js';\nimport { EDIT } from './edit.js';\nimport { LIST } from './list.js';\nimport { MOVE } from './move.js';\nimport { PATCH } from './patch.js';\nimport { READ_FILE } from './read.js';\nimport { SEARCH_AND_REPLACE } from './replace-in-files.js';\nimport { LIST_ALLOWED_DIRECTORIES } from './roots.js';\nimport { SEARCH_CONTENT } from './search-content.js';\nimport { SEARCH_FILES } from './search-files.js';\nimport { GET_FILE_INFO } from './stat.js';\n\nexport const ALL_TOOLS = [\n  CREATE,\n  DELETE_FILE,\n  DIFF,\n  EDIT,\n  LIST,\n  MOVE,\n  PATCH,\n  READ_FILE,\n  SEARCH_AND_REPLACE,\n  LIST_ALLOWED_DIRECTORIES,\n  SEARCH_CONTENT,\n  SEARCH_FILES,\n  GET_FILE_INFO,\n] as const;\n\nexport const MUTATING_TOOL_NAMES = new Set(\n  ALL_TOOLS.filter((t) => !t.annotations.readOnlyHint).map((t) => t.name),\n);\n\nexport const ALL_REGISTERED_TOOL_NAMES: readonly string[] = ALL_TOOLS.map((t) => t.name);\n\n/** The tools a server registers at this setting — the one owner of the `--read-only` gate. */\nexport function registeredTools(readOnly: boolean): readonly DefinedTool[] {\n  return readOnly ? ALL_TOOLS.filter((t) => !MUTATING_TOOL_NAMES.has(t.name)) : ALL_TOOLS;\n}\n\n// Re-exported so documentation surfaces quote `.name` off the definition rather\n// than repeating the string. This module is the only owner of the inventory.\n// Only the read-only tools are named individually: the mutating six are no\n// longer listed by hand anywhere, so their names reach callers through\n// MUTATING_TOOL_NAMES and ALL_TOOLS instead.\nexport { LIST, LIST_ALLOWED_DIRECTORIES, READ_FILE, SEARCH_CONTENT, SEARCH_FILES, GET_FILE_INFO };\n\ninterface ToolRegistrarDeps {\n  readonly server: McpServer;\n  readonly pathGuard: PathGuard;\n  readonly pageStore: PageSnapshotStore;\n  readonly resourceStore: ResourceStore;\n  readonly readOnly?: boolean;\n}\n\nexport function registerTools(deps: ToolRegistrarDeps): void {\n  const toolDeps = {\n    server: deps.server,\n    pathGuard: deps.pathGuard,\n    pageStore: deps.pageStore,\n    resourceStore: deps.resourceStore,\n  };\n  for (const tool of registeredTools(deps.readOnly ?? false)) {\n    tool.register(toolDeps);\n  }\n}\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/tools/index.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,EAAE,wBAAwB,EAAE,MAAM,YAAY,CAAC;AACtD,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAE1C,MAAM,CAAC,MAAM,SAAS,GAAG;IACvB,MAAM;IACN,WAAW;IACX,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,SAAS;IACT,kBAAkB;IAClB,wBAAwB;IACxB,cAAc;IACd,YAAY;IACZ,aAAa;CACL,CAAC;AAEX,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,GAAG,CACxC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACxE,CAAC;AAEF,8FAA8F;AAC9F,MAAM,UAAU,eAAe,CAAC,QAAiB;IAC/C,OAAO,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC1F,CAAC;AAED,gFAAgF;AAChF,6EAA6E;AAC7E,2EAA2E;AAC3E,uEAAuE;AACvE,6CAA6C;AAC7C,OAAO,EAAE,IAAI,EAAE,wBAAwB,EAAE,SAAS,EAAE,cAAc,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC;AAUlG,MAAM,UAAU,aAAa,CAAC,IAAuB;IACnD,MAAM,QAAQ,GAAG;QACf,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,aAAa,EAAE,IAAI,CAAC,aAAa;KAClC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,EAAE,CAAC;QAC3D,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC","sourcesContent":["import type { McpServer } from '@modelcontextprotocol/server';\n\nimport type { PageSnapshotStore } from '../core/page-store.js';\nimport type { PathGuard } from '../core/path.js';\nimport type { ResourceStore } from '../core/store.js';\nimport { CREATE } from './create.js';\nimport type { DefinedTool } from './define.js';\nimport { DELETE_FILE } from './delete-file.js';\nimport { DIFF } from './diff.js';\nimport { EDIT } from './edit.js';\nimport { LIST } from './list.js';\nimport { MOVE } from './move.js';\nimport { PATCH } from './patch.js';\nimport { READ_FILE } from './read.js';\nimport { SEARCH_AND_REPLACE } from './replace-in-files.js';\nimport { LIST_ALLOWED_DIRECTORIES } from './roots.js';\nimport { SEARCH_CONTENT } from './search-content.js';\nimport { SEARCH_FILES } from './search-files.js';\nimport { GET_FILE_INFO } from './stat.js';\n\nexport const ALL_TOOLS = [\n  CREATE,\n  DELETE_FILE,\n  DIFF,\n  EDIT,\n  LIST,\n  MOVE,\n  PATCH,\n  READ_FILE,\n  SEARCH_AND_REPLACE,\n  LIST_ALLOWED_DIRECTORIES,\n  SEARCH_CONTENT,\n  SEARCH_FILES,\n  GET_FILE_INFO,\n] as const;\n\nexport const MUTATING_TOOL_NAMES = new Set(\n  ALL_TOOLS.filter((t) => !t.annotations.readOnlyHint).map((t) => t.name),\n);\n\n/** The tools a server registers at this setting — the one owner of the `--read-only` gate. */\nexport function registeredTools(readOnly: boolean): readonly DefinedTool[] {\n  return readOnly ? ALL_TOOLS.filter((t) => !MUTATING_TOOL_NAMES.has(t.name)) : ALL_TOOLS;\n}\n\n// Re-exported so documentation surfaces quote `.name` off the definition rather\n// than repeating the string. This module is the only owner of the inventory.\n// Only the read-only tools are named individually: the mutating six are no\n// longer listed by hand anywhere, so their names reach callers through\n// MUTATING_TOOL_NAMES and ALL_TOOLS instead.\nexport { LIST, LIST_ALLOWED_DIRECTORIES, READ_FILE, SEARCH_CONTENT, SEARCH_FILES, GET_FILE_INFO };\n\ninterface ToolRegistrarDeps {\n  readonly server: McpServer;\n  readonly pathGuard: PathGuard;\n  readonly pageStore: PageSnapshotStore;\n  readonly resourceStore: ResourceStore;\n  readonly readOnly?: boolean;\n}\n\nexport function registerTools(deps: ToolRegistrarDeps): void {\n  const toolDeps = {\n    server: deps.server,\n    pathGuard: deps.pathGuard,\n    pageStore: deps.pageStore,\n    resourceStore: deps.resourceStore,\n  };\n  for (const tool of registeredTools(deps.readOnly ?? false)) {\n    tool.register(toolDeps);\n  }\n}\n"]}

package/dist/tools/list.js

@@ -3,8 +3,9 @@ import * as z from 'zod/v4';
 import { timedSignal } from '../core/concurrency.js';
 import { paginate } from '../core/cursor.js';
 import { ErrorCode } from '../core/errors.js';
-import { DEFAULT_EXCLUDE_PATTERNS, globEntries, isIgnoredByGitignore, loadRootGitignore, resolveEntryType, } from '../core/glob.js';
+import { DEFAULT_EXCLUDE_PATTERNS, globEntries, isIgnoredByGitignore, loadRootGitignore, } 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';
 import { putJsonResource } from '../core/store.js';
 import { DEFAULT_SEARCH_TIMEOUT_MS, DEFAULT_TREE_ENTRIES, MAX_LIST_ENTRIES, MAX_TREE_DEPTH, } from '../core/util.js';
@@ -62,7 +63,7 @@ async function collect(rootPath, options) {
             })) {
             continue;
         }
-        const accessible = await options.pathGuard.isEntryAccessible(entry.path, entryType, [rootPath]);
+        const accessible = await options.pathGuard.isEntryAccessible(entry.path);
         if (!accessible)
             continue;
         totalEntries++;

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,EACjB,gBAAgB,GACjB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,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,EAAE,SAAS,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;QAChG,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  resolveEntryType,\n} from '../core/glob.js';\nimport type { PathGuard } from '../core/path.js';\nimport { toPosixRelative } from '../core/path.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, entryType, [rootPath]);\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,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"]}

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

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

package/dist/tools/move.js

@@ -1,13 +1,14 @@
 import { isInputRequiredResult } from '@modelcontextprotocol/server';
-import { basename, dirname, resolve, sep } from 'node:path';
+import { basename, dirname, resolve } from 'node:path';
 import * as z from 'zod/v4';
+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 { readAcceptedChoice } from '../core/input-required.js';
+import { choiceInput, pendingRoundTrip, readAcceptedChoice } from '../core/input-required.js';
 import { IS_CASE_INSENSITIVE_FS, isPathInsideDirectory, isSamePath } from '../core/path-utils.js';
-import { defaultFalseBoolean, pairFailureSchema, RequiredPath } from '../core/schema.js';
-import { isTotalFailure, pairFailure, runOverPairs } from './batch.js';
+import { defaultFalseBoolean, PerFileErrorSchema, RequiredPath } from '../core/schema.js';
+import { PARALLEL_CONCURRENCY } from '../core/util.js';
 import { defineTool } from './define.js';
 const MoveItemSchema = z.strictObject({
     source: RequiredPath.describe('Path of the file or directory to move or copy'),
@@ -22,7 +23,11 @@ const MoveInputSchema = z.strictObject({
     copy: defaultFalseBoolean('Copy instead of move; sources are left in place'),
     overwrite: defaultFalseBoolean('Copy mode only: overwrite existing destinations without confirmation'),
 });
-const MoveFailureItemSchema = pairFailureSchema('moved', 'move');
+const MoveFailureItemSchema = z.strictObject({
+    source: z.string().describe('Source path that could not be moved'),
+    destination: z.string().describe('Intended destination path for the failed move'),
+    error: PerFileErrorSchema,
+});
 const MoveOutputSchema = z.strictObject({
     moves: z.array(MoveItemResultSchema).describe('Successfully completed operations'),
     failures: z
@@ -34,64 +39,61 @@ const MoveOutputSchema = z.strictObject({
         .optional()
         .describe('Destinations skipped because the user chose Skip'),
 });
+const VERB = { move: 'Move', copy: 'Copy' };
 /**
- * Phase 1 (no mutation): validate source and destination, reject self-moves and
- * moves into a subdirectory of the source, and stat the destination to decide
- * whether this move needs an overwrite confirmation. No `mkdir` happens here —
- * the old flow created the destination's parent before asking, which mutated
- * the filesystem before a confirmation; that now waits for phase 2 (R14).
+ * Phase 1 (no mutation): validate source and destination, reject self-targets
+ * and transfers into a subdirectory of the source, and stat the destination to
+ * decide whether this pair needs an overwrite confirmation. No `mkdir` happens
+ * here — the old flow created the destination's parent before asking, which
+ * mutated the filesystem before a confirmation; that now waits for phase 2 (R14).
+ *
+ * `overwrite` is copy-only — move has no confirmation bypass — so a move always
+ * passes false.
  */
-async function planMove(move, fs) {
-    let renamePath;
-    let realPath;
-    try {
-        ({ renamePath, realPath } = await validateMoveSource(move.source, fs));
-    }
-    catch (error) {
-        return { status: 'fail', failure: pairFailure(move, error) };
-    }
+async function planTransfer(op, pair, fs, overwrite) {
+    let realSource;
+    let opSource;
     let validDest;
     try {
-        validDest = await fs.pathGuard.validatePathForWrite(move.destination);
+        ({ realSource, opSource } = await validateTransferSource(op, pair.source, fs));
+        validDest = await fs.pathGuard.validatePathForWrite(pair.destination);
     }
     catch (error) {
-        return { status: 'fail', failure: pairFailure(move, error) };
+        return { status: 'fail', failure: pairFailure(pair, error) };
     }
-    // Comparisons run on the resolved source; only the fs call below uses
-    // renamePath. validatePathForWrite resolves the destination through a
-    // symlink too, so both sides of every check must be resolved to match.
-    const resolvedSource = resolve(realPath);
+    // Comparisons run on the resolved source; only the fs call in phase 2 uses
+    // opSource. validatePathForWrite resolves the destination through a symlink
+    // too, so both sides of every check must be resolved to match.
+    const resolvedSource = resolve(realSource);
     const resolvedDest = resolve(validDest);
-    if (resolvedSource === resolvedDest) {
-        // Self-move — silently skip.
+    const isSelf = resolvedSource === resolvedDest;
+    const isCaseOnlyRename = !isSelf && isSamePath(resolvedSource, resolvedDest);
+    // A copy onto a case-only variant of its own source is the same file, so it
+    // is a no-op; the same rename is real work for move and proceeds.
+    if (isSelf || (isCaseOnlyRename && op === 'copy')) {
         return { status: 'noop' };
     }
-    const normalizedDest = IS_CASE_INSENSITIVE_FS ? resolvedDest.toLowerCase() : resolvedDest;
-    const normalizedSource = IS_CASE_INSENSITIVE_FS
-        ? (resolvedSource + sep).toLowerCase()
-        : resolvedSource + sep;
-    if (normalizedDest.startsWith(normalizedSource)) {
+    if (!isCaseOnlyRename && isPathInsideDirectory(resolvedSource, resolvedDest)) {
         return {
             status: 'fail',
-            failure: pairFailure(move, new FsError(ErrorCode.INVALID_INPUT, 'Cannot move a directory into its own subdirectory', move.source)),
+            failure: pairFailure(pair, new FsError(ErrorCode.INVALID_INPUT, `Cannot ${op} a directory into its own subdirectory`, pair.source)),
         };
     }
-    const isCaseOnlyRename = isSamePath(resolvedSource, resolvedDest);
-    const destExistedOriginally = !isCaseOnlyRename && (await destExists(fs, validDest, 'move'));
-    const pending = !isCaseOnlyRename && destExistedOriginally;
+    const destExistedOriginally = !isCaseOnlyRename && (await destExists(fs, validDest, op));
+    const pending = destExistedOriginally && !overwrite;
     return {
         status: 'plan',
-        plan: { pair: move, renamePath, validDest, isCaseOnlyRename, destExistedOriginally, pending },
+        plan: { pair, opSource, validDest, isCaseOnlyRename, destExistedOriginally, pending },
     };
 }
 /**
- * Phase 2 (mutation): confirm an overwrite if needed, create the destination's
- * parent, TOCTOU-check the destination, then rename (with cross-device fallback).
- * A declined/missing confirmation throws `CANCELLED`, collected as a per-move
- * failure by the caller. A destination that appeared between plan and rename
- * (created during the confirmation gap) also fails closed.
+ * Phase 2 (mutation): confirm an overwrite if needed, TOCTOU-check the
+ * destination, create its parent, then rename (with cross-device fallback) or
+ * copy. A declined/missing confirmation throws `CANCELLED`, collected as a
+ * per-pair failure by the caller. A destination that appeared between plan and
+ * mutation (created during the confirmation gap) also fails closed.
  */
-async function executeMove(plan, ctx, pendingSorted) {
+async function executeTransfer(op, plan, ctx, pendingSorted) {
     if (plan.pending) {
         const key = `confirm_${pendingSorted.indexOf(plan.validDest)}`;
         const choice = readAcceptedChoice(ctx.inputResponses, key);
@@ -99,78 +101,130 @@ async function executeMove(plan, ctx, pendingSorted) {
             return { skipped: plan.pair.destination };
         }
         if (choice !== 'overwrite') {
-            throw new FsError(ErrorCode.CANCELLED, `Move cancelled: overwrite of "${plan.pair.destination}" was declined or missing`, plan.pair.destination);
+            throw new FsError(ErrorCode.CANCELLED, `${VERB[op]} cancelled: overwrite of "${plan.pair.destination}" was declined or missing`, plan.pair.destination);
         }
     }
     // TOCTOU check before any mutation: a destination that did not exist when
     // planned but exists now was created during the confirmation gap.
-    if (!plan.isCaseOnlyRename) {
-        const existsNow = await destExists(ctx.fs, plan.validDest, 'move');
-        if (existsNow && !plan.destExistedOriginally) {
-            throw new FsError(ErrorCode.CANCELLED, `Move cancelled: destination "${plan.pair.destination}" was created during confirmation.`, plan.pair.destination);
-        }
+    if (!plan.isCaseOnlyRename &&
+        !plan.destExistedOriginally &&
+        (await destExists(ctx.fs, plan.validDest, op))) {
+        throw new FsError(ErrorCode.CANCELLED, `${VERB[op]} cancelled: destination "${plan.pair.destination}" was created during confirmation.`, plan.pair.destination);
     }
     await ctx.fs.mkdir(dirname(plan.validDest), { recursive: true });
-    await performRenameWithFallback(plan.renamePath, plan.validDest, ctx.fs, plan.pair.source);
-    ctx.log?.('info', `move: ${plan.pair.source} -> ${plan.pair.destination}`, 'move');
-    return { value: { from: plan.renamePath, to: plan.validDest } };
-}
-async function planCopy(copy, fs, overwrite) {
-    let realSource;
-    try {
-        realSource = await fs.pathGuard.validateExistingPath(copy.source);
+    if (op === 'move') {
+        await performRenameWithFallback(plan.opSource, plan.validDest, ctx.fs, plan.pair.source);
+        ctx.log?.('info', `move: ${plan.pair.source} -> ${plan.pair.destination}`, 'move');
     }
-    catch (error) {
-        return { status: 'fail', failure: pairFailure(copy, error) };
-    }
-    let validDest;
-    try {
-        validDest = await fs.pathGuard.validatePathForWrite(copy.destination);
+    else {
+        await ctx.fs.cp(plan.opSource, plan.validDest, {
+            recursive: true,
+            verbatimSymlinks: true,
+            preserveTimestamps: true,
+            force: true,
+        });
     }
-    catch (error) {
-        return { status: 'fail', failure: pairFailure(copy, error) };
+    return { value: { from: plan.opSource, to: plan.validDest } };
+}
+function pairFailure(pair, error) {
+    return {
+        source: pair.source,
+        destination: pair.destination,
+        error: Problem.fromUnknown(error, ErrorCode.UNKNOWN, pair.source),
+    };
+}
+/**
+ * The source→destination sibling of `runOverPaths`: plan every pair, fail closed
+ * on a duplicated destination, round-trip the overwrite confirmations as one
+ * set, then execute what survived in parallel. `copy` and `move` differ only in
+ * their `plan` and `execute` callbacks.
+ */
+async function runTransfers(items, ctx, op, overwrite) {
+    const { results: planned, errors: planErrors } = await processInParallel(items, (pair) => planTransfer(op, pair, ctx.fs, overwrite), PARALLEL_CONCURRENCY, ctx.signal);
+    // plan callbacks are fail-closed (they return { status: 'fail' }, never
+    // throw), so planErrors should always be empty. Surface the first rather
+    // than silently dropping the item if a future plan callback violates that.
+    const firstPlanError = planErrors[0];
+    if (firstPlanError)
+        throw firstPlanError.error;
+    const failures = [];
+    const candidates = [];
+    for (const { value } of planned) {
+        if (value.status === 'fail')
+            failures.push(value.failure);
+        else if (value.status === 'plan')
+            candidates.push(value.plan);
+        // 'noop' (self-copy / self-move) is silently skipped.
     }
-    if (isSamePath(realSource, validDest)) {
-        // Self-copy — noop
-        return { status: 'noop' };
+    // Two sources targeting the same destination in one batch would otherwise
+    // collapse to a single shared overwrite confirmation and let the second
+    // one silently clobber the first's freshly-written content. Fail closed:
+    // only the first plan per destination proceeds; later ones targeting the
+    // same destination are reported as a per-item failure.
+    const seenDest = new Set();
+    const ready = [];
+    for (const candidate of candidates) {
+        const destKey = IS_CASE_INSENSITIVE_FS
+            ? candidate.validDest.toLowerCase()
+            : 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;
+        }
+        seenDest.add(destKey);
+        ready.push(candidate);
     }
-    if (isPathInsideDirectory(realSource, validDest)) {
-        return {
-            status: 'fail',
-            failure: pairFailure(copy, new FsError(ErrorCode.INVALID_INPUT, 'Cannot copy a directory into its own subdirectory', copy.source)),
-        };
+    const pendingSorted = ready
+        .filter((p) => p.pending)
+        .map((p) => p.validDest)
+        .sort();
+    if (pendingSorted.length > 0) {
+        // Round 1 returns input_required; a retry whose verified state does not
+        // bind this overwrite set throws (R9) via `pendingRoundTrip`.
+        const round = await pendingRoundTrip({
+            op,
+            pending: pendingSorted,
+            requestState: ctx.requestState,
+            clientCapabilities: ctx.clientCapabilities,
+            buildInputs: (dests) => dests.map((dest, i) => choiceInput(`confirm_${i}`, op === 'move'
+                ? `"${dest}" already exists. Overwrite it?`
+                : `Destination "${dest}" already exists. Overwrite it?`, [
+                { value: 'overwrite', title: 'Overwrite' },
+                { value: 'skip', title: 'Skip' },
+            ])),
+        });
+        if (round !== undefined)
+            return round;
     }
-    const destExistedOriginally = await destExists(fs, validDest, 'copy');
-    const pending = destExistedOriginally && !overwrite;
-    return {
-        status: 'plan',
-        plan: { pair: copy, realSource, validDest, destExistedOriginally, pending },
+    const total = ready.length;
+    let completed = 0;
+    const tick = () => {
+        completed += 1;
+        ctx.onProgress?.({ current: completed, total });
     };
-}
-async function executeCopy(plan, ctx, pendingSorted, overwrite) {
-    if (plan.pending && !overwrite) {
-        const key = `confirm_${pendingSorted.indexOf(plan.validDest)}`;
-        const choice = readAcceptedChoice(ctx.inputResponses, key);
-        if (choice === 'skip') {
-            return { skipped: plan.pair.destination };
+    const { results: execResults, errors: execErrors } = await processInParallel(ready, async (readyPlan) => {
+        try {
+            return await executeTransfer(op, readyPlan, ctx, pendingSorted);
         }
-        if (choice !== 'overwrite') {
-            throw new FsError(ErrorCode.CANCELLED, `Copy cancelled: overwrite of "${plan.pair.destination}" was declined or missing`, plan.pair.destination);
+        finally {
+            tick();
         }
+    }, PARALLEL_CONCURRENCY, ctx.signal);
+    for (const { error, index } of execErrors) {
+        rethrowIfAborted(error);
+        const failed = ready[index];
+        if (failed)
+            failures.push(pairFailure(failed.pair, error));
     }
-    // TOCTOU check before any mutation: a destination that did not exist when
-    // planned but exists now was created during the confirmation gap.
-    if ((await destExists(ctx.fs, plan.validDest, 'copy')) && !plan.destExistedOriginally) {
-        throw new FsError(ErrorCode.CANCELLED, `Copy cancelled: destination "${plan.pair.destination}" was created during confirmation.`, plan.pair.destination);
+    const results = [];
+    const skipped = [];
+    for (const { value } of execResults) {
+        if ('skipped' in value)
+            skipped.push(value.skipped);
+        else
+            results.push(value.value);
     }
-    await ctx.fs.mkdir(dirname(plan.validDest), { recursive: true });
-    await ctx.fs.cp(plan.realSource, plan.validDest, {
-        recursive: true,
-        verbatimSymlinks: true,
-        preserveTimestamps: true,
-        force: true,
-    });
-    return { value: { from: plan.realSource, to: plan.validDest } };
+    return { results, skipped, failures };
 }
 /**
  * Two-phase move: pre-check every move (no mutation) to build the overwrite
@@ -180,17 +234,10 @@ async function executeCopy(plan, ctx, pendingSorted, overwrite) {
  * an accepted overwrite. Non-pending moves proceed alongside them.
  */
 async function handleMove(args, ctx) {
-    const outcome = args.copy
-        ? await runOverPairs(args.moves, ctx, {
-            op: 'copy',
-            plan: (pair) => planCopy(pair, ctx.fs, args.overwrite),
-            execute: (plan, pendingSorted) => executeCopy(plan, ctx, pendingSorted, args.overwrite),
-        })
-        : await runOverPairs(args.moves, ctx, {
-            op: 'move',
-            plan: (move) => planMove(move, ctx.fs),
-            execute: (plan, pendingSorted) => executeMove(plan, ctx, pendingSorted),
-        });
+    const op = args.copy ? 'copy' : 'move';
+    // `overwrite` is copy-only; move has no confirmation bypass.
+    const overwrite = args.copy && args.overwrite;
+    const outcome = await runTransfers(args.moves, ctx, op, overwrite);
     if (isInputRequiredResult(outcome))
         return outcome;
     const { results, skipped, failures } = outcome;
@@ -200,7 +247,7 @@ async function handleMove(args, ctx) {
         ...(skipped.length > 0 ? { skipped } : {}),
     };
 }
-function buildSummary(verb, results, failures, skipped = []) {
+function buildSummary(verb, results, failures, skipped) {
     const successCount = results.length;
     const failCount = failures.length;
     if (failCount === 0 && skipped.length === 0 && successCount === 1) {
@@ -227,18 +274,19 @@ function buildSummary(verb, results, failures, skipped = []) {
  * itself, or moving a symlink would rename the file it points at and leave the
  * link dangling. Every collision check must instead compare the resolved
  * target, or a link moved onto itself (or onto its own target) reads as a real
- * move and renames the link over that target, destroying it.
+ * move and renames the link over that target, destroying it. A copy reads
+ * through the link, so both views are the resolved one.
  */
-async function validateMoveSource(source, fs) {
+async function validateTransferSource(op, source, fs) {
     try {
-        const realPath = await fs.pathGuard.validateExistingPath(source);
-        const renamePath = await fs.pathGuard.validatePathForDelete(source);
-        return { renamePath, realPath };
+        const realSource = await fs.pathGuard.validateExistingPath(source);
+        const opSource = op === 'move' ? await fs.pathGuard.validatePathForDelete(source) : realSource;
+        return { realSource, opSource };
     }
     catch (error) {
         if (isFsError(error))
             throw error;
-        throw new FsError(ErrorCode.ACCESS_DENIED, `Move failed for ${source}`, source);
+        throw new FsError(ErrorCode.ACCESS_DENIED, `${VERB[op]} failed for ${source}`, source);
     }
 }
 async function performRenameWithFallback(validSource, validDest, fsOps, originalSource) {
@@ -270,7 +318,7 @@ async function performRenameWithFallback(validSource, validDest, fsOps, original
                 // caller can recover (clean up the duplicate) instead of a silent generic
                 // failure that hides the partial completion.
                 const baseProblem = Problem.fromUnknown(copyOrRemoveError, ErrorCode.UNKNOWN, originalSource);
-                throw new FsError(baseProblem.code, `Cross-device move of ${originalSource}: copy succeeded but source removal failed (destination holds a copy): ${baseProblem.message}`, originalSource, undefined, copyOrRemoveError);
+                throw new FsError(baseProblem.code, `Cross-device move of ${originalSource}: copy succeeded but source removal failed (destination holds a copy): ${baseProblem.message}`, originalSource, copyOrRemoveError);
             }
             throw copyOrRemoveError;
         }
@@ -317,7 +365,9 @@ export const MOVE = defineTool({
         return {
             structured: output,
             text: buildSummary(args.copy ? 'copy' : 'move', output.moves, failures, skipped),
-            isError: isTotalFailure({ results: output.moves, skipped, failures }),
+            // Every requested pair failed: no move, no copy, no user-chosen skip - the
+            // call did nothing. A skip is work the caller asked for, so it counts.
+            isError: failures.length > 0 && output.moves.length + skipped.length === 0,
         };
     },
 });