@j0hanz/filesystem-mcp 2.8.1 → 2.9.0

package/dist/core/schema.d.ts

@@ -25,18 +25,21 @@ export type SingleOrBatchShape<TExtra extends z.ZodRawShape> = TExtra & {
 };
 export declare function singleOrBatchPathsInput<TExtra extends z.ZodRawShape>(extra: TExtra): z.ZodObject<SingleOrBatchShape<TExtra>>;
 /**
- * Extract the filesystem paths from a {@link singleOrBatchPathsInput} shape
- * (`{ path?, paths?, files?[{path}] }`) for the executor's access-grant
- * pre-check. Exactly one of the three is set (enforced by the schema's
- * superRefine), so they are checked in priority order.
+ * `ToolDef.mapPaths` for a {@link singleOrBatchPathsInput} shape
+ * (`{ path?, paths?, files?[{path}] }`). The schema's superRefine lets exactly
+ * one of the three through; each present one is mapped.
  */
-export declare function singleOrBatchAccessPaths(args: {
+export declare function mapSingleOrBatchPaths<T extends {
     path?: string | undefined;
     paths?: string[] | undefined;
     files?: readonly {
         path: string;
     }[] | undefined;
-}): string[];
+}>(args: T, fn: (path: string) => string): T;
+/** `ToolDef.mapPaths` for a tool whose one `path` is optional (omitted = the root). */
+export declare function mapOptionalPath<T extends {
+    path?: string | undefined;
+}>(args: T, fn: (path: string) => string): T;
 export declare const CursorSchema: z.ZodOptional<z.ZodString>;
 /**
  * Wraps a tool's input schema so a stringified-then-spread payload (see

package/dist/core/schema.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../../src/core/schema.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAK5B,eAAO,MAAM,WAAW,UAEe,CAAC;AAQxC;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC,SAAS,CAMzD;AAyBD,eAAO,MAAM,YAAY,aAS8C,CAAC;AAExE,eAAO,MAAM,YAAY,4BAA0B,CAAC;AAEpD,eAAO,MAAM,eAAe,aAYsC,CAAC;AAEnE,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE;IACL,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/B,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAC9B,EACD,GAAG,EAAE,CAAC,CAAC,aAAa,GACnB,IAAI,CAyCN;AAED,wBAAgB,mBAAmB,CAAC,WAAW,EAAE,MAAM,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAEnF;AAED,eAAO,MAAM,aAAa,4BAAgE,CAAC;AAC3F,eAAO,MAAM,cAAc,4BAE1B,CAAC;AACF,eAAO,MAAM,QAAQ,4BAKkE,CAAC;AAIxF,MAAM,MAAM,kBAAkB,CAAC,MAAM,SAAS,CAAC,CAAC,WAAW,IAAI,MAAM,GAAG;IACtE,IAAI,EAAE,CAAC,CAAC,WAAW,CAAC,OAAO,YAAY,CAAC,CAAC;IACzC,KAAK,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,YAAY,CAAC,CAAC,CAAC;CACvD,CAAC;AAEF,wBAAgB,uBAAuB,CAAC,MAAM,SAAS,CAAC,CAAC,WAAW,EAClE,KAAK,EAAE,MAAM,GACZ,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CA0CzC;AAED;;;;;GAKG;AACH,wBAAgB,wBAAwB,CAAC,IAAI,EAAE;IAC7C,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;IAC7B,KAAK,CAAC,EAAE,SAAS;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,GAAG,SAAS,CAAC;CACjD,GAAG,MAAM,EAAE,CAKX;AAQD,eAAO,MAAM,YAAY,4BAKtB,CAAC;AAqBJ;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAoBxF"}
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../../src/core/schema.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAU5B,eAAO,MAAM,WAAW,UAEe,CAAC;AAQxC;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC,SAAS,CAMzD;AAyBD,eAAO,MAAM,YAAY,aAS8C,CAAC;AAExE,eAAO,MAAM,YAAY,4BAA0B,CAAC;AAEpD,eAAO,MAAM,eAAe,aAYsC,CAAC;AAEnE,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE;IACL,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/B,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAC9B,EACD,GAAG,EAAE,CAAC,CAAC,aAAa,GACnB,IAAI,CAyCN;AAED,wBAAgB,mBAAmB,CAAC,WAAW,EAAE,MAAM,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAEnF;AAED,eAAO,MAAM,aAAa,4BAAgE,CAAC;AAC3F,eAAO,MAAM,cAAc,4BAE1B,CAAC;AACF,eAAO,MAAM,QAAQ,4BAKkE,CAAC;AAIxF,MAAM,MAAM,kBAAkB,CAAC,MAAM,SAAS,CAAC,CAAC,WAAW,IAAI,MAAM,GAAG;IACtE,IAAI,EAAE,CAAC,CAAC,WAAW,CAAC,OAAO,YAAY,CAAC,CAAC;IACzC,KAAK,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,YAAY,CAAC,CAAC,CAAC;CACvD,CAAC;AAEF,wBAAgB,uBAAuB,CAAC,MAAM,SAAS,CAAC,CAAC,WAAW,EAClE,KAAK,EAAE,MAAM,GACZ,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAyCzC;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,CAAC,SAAS;IACR,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC;IAC7B,KAAK,CAAC,EAAE,SAAS;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,GAAG,SAAS,CAAC;CACjD,EACD,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,GAAG,CAAC,CAS1C;AAED,uFAAuF;AACvF,wBAAgB,eAAe,CAAC,CAAC,SAAS;IAAE,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,EACrE,IAAI,EAAE,CAAC,EACP,EAAE,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,GAC3B,CAAC,CAEH;AAQD,eAAO,MAAM,YAAY,4BAKtB,CAAC;AAqBJ;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAoBxF"}

package/dist/core/schema.js

@@ -1,5 +1,5 @@
 import * as z from 'zod/v4';
-import { isSafeGlobSyntax, MAX_BRACE_ALTERNATIVES, MAX_DOTDOT_CHECK_CHARS } from "./glob.js";
+import { isSafeGlobSyntax, MAX_BRACE_ALTERNATIVES, MAX_DOTDOT_CHECK_CHARS, MAX_SEGMENT_WILDCARDS, } from "./glob.js";
 import { MAX_SEARCH_DEPTH } from "./util.js";
 export const PositiveInt = z
     .int({ message: 'Must be integer' })
@@ -51,7 +51,7 @@ export const SafeGlobPattern = z
     .max(1000, { message: 'Max 1000 chars' })
     .superRefine(refineSafeText('Pattern', (val) => isSafeGlobSyntax(val)
     ? undefined
-    : `Invalid glob or unsafe path (absolute/.. forbidden, at most ${String(MAX_BRACE_ALTERNATIVES)} brace alternatives and ${String(MAX_DOTDOT_CHECK_CHARS)} traversal-check characters)`))
+    : `Invalid glob or unsafe path (absolute/.. forbidden, at most ${String(MAX_BRACE_ALTERNATIVES)} brace alternatives, ${String(MAX_DOTDOT_CHECK_CHARS)} traversal-check characters, and ${String(MAX_SEGMENT_WILDCARDS)} * runs and extglob groups together per path segment; no |, * or nested group inside *(…) or +(…))`))
     .describe('Relative glob pattern under the search root (e.g. "**/*.ts", "src/**/*.js").')
     .meta({ examples: ['**/*.ts', 'src/**/*.js', '**/*.{ts,tsx}'] });
 export function validateReadRange(value, ctx) {
@@ -137,26 +137,29 @@ export function singleOrBatchPathsInput(extra) {
             });
         }
     });
-    // Mirror the superRefine above on the wire: exactly one input mode. `{}` and
-    // `path`+`paths` both fail this oneOf, matching the runtime rule.
-    return base.meta({
-        oneOf: [{ required: ['path'] }, { required: ['paths'] }],
-    });
+    // No top-level oneOf on the wire: OpenAI and Anthropic reject top-level
+    // oneOf/anyOf/allOf in function parameters. The superRefine enforces
+    // "exactly one of path/paths" at call time.
+    return base;
 }
 /**
- * Extract the filesystem paths from a {@link singleOrBatchPathsInput} shape
- * (`{ path?, paths?, files?[{path}] }`) for the executor's access-grant
- * pre-check. Exactly one of the three is set (enforced by the schema's
- * superRefine), so they are checked in priority order.
+ * `ToolDef.mapPaths` for a {@link singleOrBatchPathsInput} shape
+ * (`{ path?, paths?, files?[{path}] }`). The schema's superRefine lets exactly
+ * one of the three through; each present one is mapped.
  */
-export function singleOrBatchAccessPaths(args) {
-    if (args.path)
-        return [args.path];
-    if (args.paths)
-        return [...args.paths];
-    if (args.files)
-        return args.files.map((f) => f.path);
-    return [];
+export function mapSingleOrBatchPaths(args, fn) {
+    return {
+        ...args,
+        ...(args.path !== undefined ? { path: fn(args.path) } : {}),
+        ...(args.paths !== undefined ? { paths: args.paths.map(fn) } : {}),
+        ...(args.files !== undefined
+            ? { files: args.files.map((file) => ({ ...file, path: fn(file.path) })) }
+            : {}),
+    };
+}
+/** `ToolDef.mapPaths` for a tool whose one `path` is optional (omitted = the root). */
+export function mapOptionalPath(args, fn) {
+    return args.path === undefined ? args : { ...args, path: fn(args.path) };
 }
 // ponytail: charset regex, not z.base64url() — the SDK's AJV warns on the
 // unknown `base64url` format; the server's own decode (cursor.ts) is the real

package/dist/core/schema.js.map

@@ -1 +1 @@
-{"version":3,"file":"schema.js","sourceRoot":"","sources":["../../src/core/schema.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,MAAM,WAAW,CAAC;AAC7F,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAE7C,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC;KACzB,GAAG,CAAC,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC;KACnC,QAAQ,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC,CAAC;AAExC,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,MAAM,aAAa,GAAG,QAAQ,CAAC;AAE/B,MAAM,OAAO,GAAG,CAAC,GAAW,EAAW,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC;AAElE;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa;IAC1C,MAAM,OAAO,GAAG,GAAG,KAAK,qCAAqC,CAAC;IAC9D,OAAO,CAAC;SACL,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;SAChC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AACjD,CAAC;AAED,SAAS,cAAc,CACrB,KAAa,EACb,QAA6C;IAE7C,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;QAClB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC;YACxB,CAAC,CAAC,GAAG,KAAK,qCAAqC;YAC/C,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAClB,CAAC,CAAC,GAAG,KAAK,4BAA4B;gBACtC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;oBACd,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,6BAA6B,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QACrF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,GAAG,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,sEAAsE;AACtE,+CAA+C;AAC/C,MAAM,mBAAmB,GAAG,CAAC,GAAW,EAAW,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AAEzF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC;KAC1B,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;KACpC,GAAG,CAAC,eAAe,EAAE,EAAE,OAAO,EAAE,sBAAsB,eAAe,SAAS,EAAE,CAAC;KACjF,WAAW,CACV,cAAc,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CAC7B,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,oDAAoD,CAAC,CAAC,CAAC,SAAS,CAC5F,CACF;KACA,QAAQ,CAAC,0DAA0D,CAAC,CAAC;AAExE,MAAM,CAAC,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC;AAEpD,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC;KAC7B,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC;KACvC,GAAG,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC;KACxC,WAAW,CACV,cAAc,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,EAAE,CAChC,gBAAgB,CAAC,GAAG,CAAC;IACnB,CAAC,CAAC,SAAS;IACX,CAAC,CAAC,+DAA+D,MAAM,CAAC,sBAAsB,CAAC,2BAA2B,MAAM,CAAC,sBAAsB,CAAC,8BAA8B,CACzL,CACF;KACA,QAAQ,CAAC,8EAA8E,CAAC;KACxF,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,SAAS,EAAE,aAAa,EAAE,eAAe,CAAC,EAAE,CAAC,CAAC;AAEnE,MAAM,UAAU,iBAAiB,CAC/B,KAKC,EACD,GAAoB;IAEpB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;IACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,KAAK,SAAS,CAAC;IAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC;IAE3C,IAAI,OAAO,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC,EAAE,CAAC;QACpC,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EACL,0GAA0G;YAC5G,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,OAAO,IAAI,QAAQ,IAAI,MAAM,CAAC,EAAE,CAAC;QAC/C,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EACL,iHAAiH;YACnH,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACxB,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,SAAS,CAAC;YACjB,OAAO,EAAE,kEAAkE;YAC3E,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,MAAM,cAAc,GAAG,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;IAC5C,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,GAAG,cAAc,EAAE,CAAC;QAClE,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,SAAS,CAAC;YACjB,OAAO,EAAE,kCAAkC;YAC3C,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,WAAmB;IACrD,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AAC1D,CAAC;AAED,MAAM,CAAC,MAAM,aAAa,GAAG,mBAAmB,CAAC,wCAAwC,CAAC,CAAC;AAC3F,MAAM,CAAC,MAAM,cAAc,GAAG,mBAAmB,CAC/C,kDAAkD,CACnD,CAAC;AACF,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC;KACtB,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,CAAC;KACN,GAAG,CAAC,gBAAgB,CAAC;KACrB,QAAQ,EAAE;KACV,QAAQ,CAAC,0EAA0E,CAAC,CAAC;AAExF,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAO/B,MAAM,UAAU,uBAAuB,CACrC,KAAa;IAEb,MAAM,KAAK,GAAkB;QAC3B,GAAG,KAAK;QACR,IAAI,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,iDAAiD,CAAC;QACzF,KAAK,EAAE,CAAC;aACL,KAAK,CAAC,YAAY,CAAC;aACnB,GAAG,CAAC,CAAC,CAAC;aACN,GAAG,CAAC,iBAAiB,CAAC;aACtB,QAAQ,EAAE;aACV,QAAQ,CACP,2CAA2C,MAAM,CAAC,iBAAiB,CAAC,iCAAiC,CACtG;KACJ,CAAC;IAEF,MAAM,IAAI,GAAG,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QAC5D,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC;QAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;QAE9C,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1B,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,MAAM,CAAC;gBACd,OAAO,EAAE,2CAA2C;gBACpD,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QACD,IAAI,OAAO,IAAI,QAAQ,EAAE,CAAC;YACxB,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,OAAO,CAAC;gBACf,OAAO,EAAE,oCAAoC;gBAC7C,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,6EAA6E;IAC7E,kEAAkE;IAClE,OAAO,IAAI,CAAC,IAAI,CAAC;QACf,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;KACzD,CAA4C,CAAC;AAChD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,wBAAwB,CAAC,IAIxC;IACC,IAAI,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACrD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,0EAA0E;AAC1E,8EAA8E;AAC9E,6EAA6E;AAC7E,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;AAE7D,0EAA0E;AAC1E,MAAM,CAAC,MAAM,YAAY,GAAG,eAAe;KACxC,QAAQ,EAAE;KACV,QAAQ,CACP,uFAAuF;IACrF,2FAA2F,CAC9F,CAAC;AAEJ;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,KAAc;IACrC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC1F,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3C,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACrD,IAAI,GAAG,KAAK,MAAM,CAAC,KAAK,CAAC,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7F,IAAI,IAAI,IAAI,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAsB,MAAS;IAClE,OAAO,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QACjC,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACrC,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,GAAG,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;QAC3F,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,OAAO,EACL,qDAAqD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa;gBACrF,qGAAqG;YACvG,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;QACH,OAAO,CAAC,CAAC,KAAK,CAAC;IACjB,CAAC,EAAE,MAAM,CAAC,CAAC;AACb,CAAC","sourcesContent":["import * as z from 'zod/v4';\n\nimport { isSafeGlobSyntax, MAX_BRACE_ALTERNATIVES, MAX_DOTDOT_CHECK_CHARS } from './glob.ts';\nimport { MAX_SEARCH_DEPTH } from './util.ts';\n\nexport const PositiveInt = z\n  .int({ message: 'Must be integer' })\n  .positive({ message: 'Must be > 0' });\n\nconst MAX_PATH_LENGTH = 4096;\n\nconst LINE_BREAK_RE = /[\\n\\r]/;\n\nconst isBlank = (val: string): boolean => val.trim().length === 0;\n\n/**\n * Text that must carry non-blank content. `min(1)` stays so `minLength: 1`\n * still publishes on the wire; it aborts so an empty value reports one\n * message, not the same one twice.\n */\nexport function nonBlankString(label: string): z.ZodString {\n  const message = `${label} cannot be empty or whitespace-only`;\n  return z\n    .string()\n    .min(1, { message, abort: true })\n    .refine((val) => !isBlank(val), { message });\n}\n\nfunction refineSafeText(\n  label: string,\n  specific: (val: string) => string | undefined,\n): (val: string, ctx: z.RefinementCtx) => void {\n  return (val, ctx) => {\n    if (val.length === 0) return;\n    const issue = isBlank(val)\n      ? `${label} cannot be empty or whitespace-only`\n      : val.includes('\\0')\n        ? `${label} cannot contain null bytes`\n        : (specific(val) ??\n          (LINE_BREAK_RE.test(val) ? `${label} cannot contain line breaks` : undefined));\n    if (issue !== undefined) {\n      ctx.addIssue({ code: 'custom', message: issue, fatal: true });\n    }\n  };\n}\n\n// Only a whole `..` segment is traversal. `..` inside a segment\n// (`[...slug]`, `v1..2.md`) is a plain file name; PathGuard re-checks\n// containment on the resolved path regardless.\nconst hasTraversalSegment = (val: string): boolean => val.split(/[\\\\/]/u).includes('..');\n\nexport const RequiredPath = z\n  .string()\n  .min(1, { message: 'Path required' })\n  .max(MAX_PATH_LENGTH, { message: `Path too long (max ${MAX_PATH_LENGTH} chars)` })\n  .superRefine(\n    refineSafeText('Path', (val) =>\n      hasTraversalSegment(val) ? 'Directory traversal sequences (\"..\") are forbidden' : undefined,\n    ),\n  )\n  .describe('File or directory path inside an allowed workspace root.');\n\nexport const OptionalPath = RequiredPath.optional();\n\nexport const SafeGlobPattern = z\n  .string()\n  .min(1, { message: 'Pattern required' })\n  .max(1000, { message: 'Max 1000 chars' })\n  .superRefine(\n    refineSafeText('Pattern', (val) =>\n      isSafeGlobSyntax(val)\n        ? undefined\n        : `Invalid glob or unsafe path (absolute/.. forbidden, at most ${String(MAX_BRACE_ALTERNATIVES)} brace alternatives and ${String(MAX_DOTDOT_CHECK_CHARS)} traversal-check characters)`,\n    ),\n  )\n  .describe('Relative glob pattern under the search root (e.g. \"**/*.ts\", \"src/**/*.js\").')\n  .meta({ examples: ['**/*.ts', 'src/**/*.js', '**/*.{ts,tsx}'] });\n\nexport function validateReadRange(\n  value: {\n    head?: number | undefined;\n    tail?: number | undefined;\n    startLine?: number | undefined;\n    endLine?: number | undefined;\n  },\n  ctx: z.RefinementCtx,\n): void {\n  const hasHead = value.head !== undefined;\n  const hasTail = value.tail !== undefined;\n  const hasStart = value.startLine !== undefined;\n  const hasEnd = value.endLine !== undefined;\n\n  if (hasHead && (hasStart || hasEnd)) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['head'],\n      message:\n        \"Cannot use 'head' with 'startLine'/'endLine'. Use either 'head' alone or 'startLine'/'endLine' together.\",\n      input: value,\n    });\n  }\n  if (hasTail && (hasHead || hasStart || hasEnd)) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['tail'],\n      message:\n        \"Cannot use 'tail' with 'head'/'startLine'/'endLine'. Use 'tail' alone, or 'startLine'/'endLine' without 'tail'.\",\n      input: value,\n    });\n  }\n  if (hasEnd && !hasStart) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['endLine'],\n      message: \"'endLine' requires 'startLine' to be set. Provide both together.\",\n      input: value,\n    });\n  }\n  const effectiveStart = value.startLine ?? 1;\n  if (value.endLine !== undefined && value.endLine < effectiveStart) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['endLine'],\n      message: \"'endLine' must be >= 'startLine'\",\n      input: value,\n    });\n  }\n}\n\nexport function defaultFalseBoolean(description: string): z.ZodDefault<z.ZodBoolean> {\n  return z.boolean().default(false).describe(description);\n}\n\nexport const IncludeHidden = defaultFalseBoolean('Include hidden items (starting with .)');\nexport const IncludeIgnored = defaultFalseBoolean(\n  'Include ignored items (node_modules, .git, etc).',\n);\nexport const MaxDepth = z\n  .uint32()\n  .min(0)\n  .max(MAX_SEARCH_DEPTH)\n  .optional()\n  .describe('Max directory depth to scan; 0 = base directory only, omit for unlimited');\n\nconst DEFAULT_MAX_BATCH = 1000;\n\nexport type SingleOrBatchShape<TExtra extends z.ZodRawShape> = TExtra & {\n  path: z.ZodOptional<typeof RequiredPath>;\n  paths: z.ZodOptional<z.ZodArray<typeof RequiredPath>>;\n};\n\nexport function singleOrBatchPathsInput<TExtra extends z.ZodRawShape>(\n  extra: TExtra,\n): z.ZodObject<SingleOrBatchShape<TExtra>> {\n  const shape: z.ZodRawShape = {\n    ...extra,\n    path: RequiredPath.optional().describe('Single file path; mutually exclusive with paths'),\n    paths: z\n      .array(RequiredPath)\n      .min(1)\n      .max(DEFAULT_MAX_BATCH)\n      .optional()\n      .describe(\n        `Array of file paths for batch mode (max ${String(DEFAULT_MAX_BATCH)}); mutually exclusive with path`,\n      ),\n  };\n\n  const base = z.strictObject(shape).superRefine((value, ctx) => {\n    const hasPath = value['path'] !== undefined;\n    const hasPaths = value['paths'] !== undefined;\n\n    if (!hasPath && !hasPaths) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['path'],\n        message: \"Either 'path' or 'paths' must be provided\",\n        input: value,\n      });\n      return;\n    }\n    if (hasPath && hasPaths) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['paths'],\n        message: \"Cannot use both 'path' and 'paths'\",\n        input: value,\n      });\n    }\n  });\n\n  // Mirror the superRefine above on the wire: exactly one input mode. `{}` and\n  // `path`+`paths` both fail this oneOf, matching the runtime rule.\n  return base.meta({\n    oneOf: [{ required: ['path'] }, { required: ['paths'] }],\n  }) as z.ZodObject<SingleOrBatchShape<TExtra>>;\n}\n\n/**\n * Extract the filesystem paths from a {@link singleOrBatchPathsInput} shape\n * (`{ path?, paths?, files?[{path}] }`) for the executor's access-grant\n * pre-check. Exactly one of the three is set (enforced by the schema's\n * superRefine), so they are checked in priority order.\n */\nexport function singleOrBatchAccessPaths(args: {\n  path?: string | undefined;\n  paths?: string[] | undefined;\n  files?: readonly { path: string }[] | undefined;\n}): string[] {\n  if (args.path) return [args.path];\n  if (args.paths) return [...args.paths];\n  if (args.files) return args.files.map((f) => f.path);\n  return [];\n}\n\n// ponytail: charset regex, not z.base64url() — the SDK's AJV warns on the\n// unknown `base64url` format; the server's own decode (cursor.ts) is the real\n// validation, so loosening the client-facing schema to the alphabet is safe.\nconst base64urlCursor = z.string().regex(/^[A-Za-z0-9_-]+$/);\n\n// Ships once per paginated tool — wording is budgeted (TOOL-SURFACE-002).\nexport const CursorSchema = base64urlCursor\n  .optional()\n  .describe(\n    'Opaque pagination cursor; pass unchanged for the next page. Pages slice one snapshot ' +\n      'taken on the first call; it expires after ~60s — re-request without a cursor if rejected.',\n  );\n\n/**\n * Reassembles tool arguments that a client JSON-serialized and then spread\n * into an object: `{ path }` arrives as `{ \"0\": \"{\", \"1\": \"\\\"\", … }`, one key\n * per UTF-16 code unit. Returns `undefined` for anything else. Integer keys\n * enumerate first in ascending order, so matching each key to its position\n * also proves the keys are exactly `\"0\"…\"n-1\"` with nothing else alongside.\n */\nfunction joinSplitString(value: unknown): string | undefined {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) return undefined;\n  const entries = Object.entries(value);\n  if (entries.length === 0) return undefined;\n  let text = '';\n  for (const [index, [key, char]] of entries.entries()) {\n    if (key !== String(index) || typeof char !== 'string' || char.length !== 1) return undefined;\n    text += char;\n  }\n  return text;\n}\n\n/**\n * Wraps a tool's input schema so a stringified-then-spread payload (see\n * {@link joinSplitString}) is parsed back into the object it encodes, and one\n * that does not encode an object fails with a message naming the cause rather\n * than `Unrecognized keys: \"0\", \"1\", …`. The published JSON Schema is the\n * wrapped schema's own: a preprocess step converts to its output side.\n */\nexport function withSplitArgsRecovery<T extends z.ZodType>(schema: T): z.ZodPreprocess<T> {\n  return z.preprocess((value, ctx) => {\n    const text = joinSplitString(value);\n    if (text === undefined) return value;\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(text);\n    } catch {\n      parsed = undefined;\n    }\n    if (typeof parsed === 'object' && parsed !== null && !Array.isArray(parsed)) return parsed;\n    ctx.addIssue({\n      code: 'custom',\n      message:\n        `arguments must be a JSON object, but arrived as a ${String(text.length)}-character ` +\n        'string split into indexed keys (the client serialized the payload); send the arguments as an object',\n      input: value,\n    });\n    return z.NEVER;\n  }, schema);\n}\n"]}
+{"version":3,"file":"schema.js","sourceRoot":"","sources":["../../src/core/schema.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EACL,gBAAgB,EAChB,sBAAsB,EACtB,sBAAsB,EACtB,qBAAqB,GACtB,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAE7C,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC;KACzB,GAAG,CAAC,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC;KACnC,QAAQ,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC,CAAC;AAExC,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,MAAM,aAAa,GAAG,QAAQ,CAAC;AAE/B,MAAM,OAAO,GAAG,CAAC,GAAW,EAAW,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC;AAElE;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa;IAC1C,MAAM,OAAO,GAAG,GAAG,KAAK,qCAAqC,CAAC;IAC9D,OAAO,CAAC;SACL,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;SAChC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AACjD,CAAC;AAED,SAAS,cAAc,CACrB,KAAa,EACb,QAA6C;IAE7C,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;QAClB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC;YACxB,CAAC,CAAC,GAAG,KAAK,qCAAqC;YAC/C,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAClB,CAAC,CAAC,GAAG,KAAK,4BAA4B;gBACtC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;oBACd,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,6BAA6B,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QACrF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,GAAG,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,sEAAsE;AACtE,+CAA+C;AAC/C,MAAM,mBAAmB,GAAG,CAAC,GAAW,EAAW,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AAEzF,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC;KAC1B,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;KACpC,GAAG,CAAC,eAAe,EAAE,EAAE,OAAO,EAAE,sBAAsB,eAAe,SAAS,EAAE,CAAC;KACjF,WAAW,CACV,cAAc,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CAC7B,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,oDAAoD,CAAC,CAAC,CAAC,SAAS,CAC5F,CACF;KACA,QAAQ,CAAC,0DAA0D,CAAC,CAAC;AAExE,MAAM,CAAC,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC;AAEpD,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC;KAC7B,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,kBAAkB,EAAE,CAAC;KACvC,GAAG,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC;KACxC,WAAW,CACV,cAAc,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,EAAE,CAChC,gBAAgB,CAAC,GAAG,CAAC;IACnB,CAAC,CAAC,SAAS;IACX,CAAC,CAAC,+DAA+D,MAAM,CAAC,sBAAsB,CAAC,wBAAwB,MAAM,CAAC,sBAAsB,CAAC,oCAAoC,MAAM,CAAC,qBAAqB,CAAC,oGAAoG,CAC7T,CACF;KACA,QAAQ,CAAC,8EAA8E,CAAC;KACxF,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,SAAS,EAAE,aAAa,EAAE,eAAe,CAAC,EAAE,CAAC,CAAC;AAEnE,MAAM,UAAU,iBAAiB,CAC/B,KAKC,EACD,GAAoB;IAEpB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;IACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,KAAK,SAAS,CAAC;IAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC;IAE3C,IAAI,OAAO,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC,EAAE,CAAC;QACpC,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EACL,0GAA0G;YAC5G,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,OAAO,IAAI,QAAQ,IAAI,MAAM,CAAC,EAAE,CAAC;QAC/C,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,OAAO,EACL,iHAAiH;YACnH,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,IAAI,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACxB,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,SAAS,CAAC;YACjB,OAAO,EAAE,kEAAkE;YAC3E,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;IACD,MAAM,cAAc,GAAG,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;IAC5C,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,GAAG,cAAc,EAAE,CAAC;QAClE,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,CAAC,SAAS,CAAC;YACjB,OAAO,EAAE,kCAAkC;YAC3C,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,WAAmB;IACrD,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AAC1D,CAAC;AAED,MAAM,CAAC,MAAM,aAAa,GAAG,mBAAmB,CAAC,wCAAwC,CAAC,CAAC;AAC3F,MAAM,CAAC,MAAM,cAAc,GAAG,mBAAmB,CAC/C,kDAAkD,CACnD,CAAC;AACF,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC;KACtB,MAAM,EAAE;KACR,GAAG,CAAC,CAAC,CAAC;KACN,GAAG,CAAC,gBAAgB,CAAC;KACrB,QAAQ,EAAE;KACV,QAAQ,CAAC,0EAA0E,CAAC,CAAC;AAExF,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAO/B,MAAM,UAAU,uBAAuB,CACrC,KAAa;IAEb,MAAM,KAAK,GAAkB;QAC3B,GAAG,KAAK;QACR,IAAI,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,iDAAiD,CAAC;QACzF,KAAK,EAAE,CAAC;aACL,KAAK,CAAC,YAAY,CAAC;aACnB,GAAG,CAAC,CAAC,CAAC;aACN,GAAG,CAAC,iBAAiB,CAAC;aACtB,QAAQ,EAAE;aACV,QAAQ,CACP,2CAA2C,MAAM,CAAC,iBAAiB,CAAC,iCAAiC,CACtG;KACJ,CAAC;IAEF,MAAM,IAAI,GAAG,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QAC5D,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC;QAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;QAE9C,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1B,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,MAAM,CAAC;gBACd,OAAO,EAAE,2CAA2C;gBACpD,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QACD,IAAI,OAAO,IAAI,QAAQ,EAAE,CAAC;YACxB,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,OAAO,CAAC;gBACf,OAAO,EAAE,oCAAoC;gBAC7C,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,wEAAwE;IACxE,qEAAqE;IACrE,4CAA4C;IAC5C,OAAO,IAA+C,CAAC;AACzD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CAMnC,IAAO,EAAE,EAA4B;IACrC,OAAO;QACL,GAAG,IAAI;QACP,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3D,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAClE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE;YACzE,CAAC,CAAC,EAAE,CAAC;KACR,CAAC;AACJ,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,eAAe,CAC7B,IAAO,EACP,EAA4B;IAE5B,OAAO,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AAC3E,CAAC;AAED,0EAA0E;AAC1E,8EAA8E;AAC9E,6EAA6E;AAC7E,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;AAE7D,0EAA0E;AAC1E,MAAM,CAAC,MAAM,YAAY,GAAG,eAAe;KACxC,QAAQ,EAAE;KACV,QAAQ,CACP,uFAAuF;IACrF,2FAA2F,CAC9F,CAAC;AAEJ;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,KAAc;IACrC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC1F,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3C,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACrD,IAAI,GAAG,KAAK,MAAM,CAAC,KAAK,CAAC,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7F,IAAI,IAAI,IAAI,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAsB,MAAS;IAClE,OAAO,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;QACjC,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACrC,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,GAAG,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;QAC3F,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,OAAO,EACL,qDAAqD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa;gBACrF,qGAAqG;YACvG,KAAK,EAAE,KAAK;SACb,CAAC,CAAC;QACH,OAAO,CAAC,CAAC,KAAK,CAAC;IACjB,CAAC,EAAE,MAAM,CAAC,CAAC;AACb,CAAC","sourcesContent":["import * as z from 'zod/v4';\n\nimport {\n  isSafeGlobSyntax,\n  MAX_BRACE_ALTERNATIVES,\n  MAX_DOTDOT_CHECK_CHARS,\n  MAX_SEGMENT_WILDCARDS,\n} from './glob.ts';\nimport { MAX_SEARCH_DEPTH } from './util.ts';\n\nexport const PositiveInt = z\n  .int({ message: 'Must be integer' })\n  .positive({ message: 'Must be > 0' });\n\nconst MAX_PATH_LENGTH = 4096;\n\nconst LINE_BREAK_RE = /[\\n\\r]/;\n\nconst isBlank = (val: string): boolean => val.trim().length === 0;\n\n/**\n * Text that must carry non-blank content. `min(1)` stays so `minLength: 1`\n * still publishes on the wire; it aborts so an empty value reports one\n * message, not the same one twice.\n */\nexport function nonBlankString(label: string): z.ZodString {\n  const message = `${label} cannot be empty or whitespace-only`;\n  return z\n    .string()\n    .min(1, { message, abort: true })\n    .refine((val) => !isBlank(val), { message });\n}\n\nfunction refineSafeText(\n  label: string,\n  specific: (val: string) => string | undefined,\n): (val: string, ctx: z.RefinementCtx) => void {\n  return (val, ctx) => {\n    if (val.length === 0) return;\n    const issue = isBlank(val)\n      ? `${label} cannot be empty or whitespace-only`\n      : val.includes('\\0')\n        ? `${label} cannot contain null bytes`\n        : (specific(val) ??\n          (LINE_BREAK_RE.test(val) ? `${label} cannot contain line breaks` : undefined));\n    if (issue !== undefined) {\n      ctx.addIssue({ code: 'custom', message: issue, fatal: true });\n    }\n  };\n}\n\n// Only a whole `..` segment is traversal. `..` inside a segment\n// (`[...slug]`, `v1..2.md`) is a plain file name; PathGuard re-checks\n// containment on the resolved path regardless.\nconst hasTraversalSegment = (val: string): boolean => val.split(/[\\\\/]/u).includes('..');\n\nexport const RequiredPath = z\n  .string()\n  .min(1, { message: 'Path required' })\n  .max(MAX_PATH_LENGTH, { message: `Path too long (max ${MAX_PATH_LENGTH} chars)` })\n  .superRefine(\n    refineSafeText('Path', (val) =>\n      hasTraversalSegment(val) ? 'Directory traversal sequences (\"..\") are forbidden' : undefined,\n    ),\n  )\n  .describe('File or directory path inside an allowed workspace root.');\n\nexport const OptionalPath = RequiredPath.optional();\n\nexport const SafeGlobPattern = z\n  .string()\n  .min(1, { message: 'Pattern required' })\n  .max(1000, { message: 'Max 1000 chars' })\n  .superRefine(\n    refineSafeText('Pattern', (val) =>\n      isSafeGlobSyntax(val)\n        ? undefined\n        : `Invalid glob or unsafe path (absolute/.. forbidden, at most ${String(MAX_BRACE_ALTERNATIVES)} brace alternatives, ${String(MAX_DOTDOT_CHECK_CHARS)} traversal-check characters, and ${String(MAX_SEGMENT_WILDCARDS)} * runs and extglob groups together per path segment; no |, * or nested group inside *(…) or +(…))`,\n    ),\n  )\n  .describe('Relative glob pattern under the search root (e.g. \"**/*.ts\", \"src/**/*.js\").')\n  .meta({ examples: ['**/*.ts', 'src/**/*.js', '**/*.{ts,tsx}'] });\n\nexport function validateReadRange(\n  value: {\n    head?: number | undefined;\n    tail?: number | undefined;\n    startLine?: number | undefined;\n    endLine?: number | undefined;\n  },\n  ctx: z.RefinementCtx,\n): void {\n  const hasHead = value.head !== undefined;\n  const hasTail = value.tail !== undefined;\n  const hasStart = value.startLine !== undefined;\n  const hasEnd = value.endLine !== undefined;\n\n  if (hasHead && (hasStart || hasEnd)) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['head'],\n      message:\n        \"Cannot use 'head' with 'startLine'/'endLine'. Use either 'head' alone or 'startLine'/'endLine' together.\",\n      input: value,\n    });\n  }\n  if (hasTail && (hasHead || hasStart || hasEnd)) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['tail'],\n      message:\n        \"Cannot use 'tail' with 'head'/'startLine'/'endLine'. Use 'tail' alone, or 'startLine'/'endLine' without 'tail'.\",\n      input: value,\n    });\n  }\n  if (hasEnd && !hasStart) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['endLine'],\n      message: \"'endLine' requires 'startLine' to be set. Provide both together.\",\n      input: value,\n    });\n  }\n  const effectiveStart = value.startLine ?? 1;\n  if (value.endLine !== undefined && value.endLine < effectiveStart) {\n    ctx.addIssue({\n      code: 'custom',\n      path: ['endLine'],\n      message: \"'endLine' must be >= 'startLine'\",\n      input: value,\n    });\n  }\n}\n\nexport function defaultFalseBoolean(description: string): z.ZodDefault<z.ZodBoolean> {\n  return z.boolean().default(false).describe(description);\n}\n\nexport const IncludeHidden = defaultFalseBoolean('Include hidden items (starting with .)');\nexport const IncludeIgnored = defaultFalseBoolean(\n  'Include ignored items (node_modules, .git, etc).',\n);\nexport const MaxDepth = z\n  .uint32()\n  .min(0)\n  .max(MAX_SEARCH_DEPTH)\n  .optional()\n  .describe('Max directory depth to scan; 0 = base directory only, omit for unlimited');\n\nconst DEFAULT_MAX_BATCH = 1000;\n\nexport type SingleOrBatchShape<TExtra extends z.ZodRawShape> = TExtra & {\n  path: z.ZodOptional<typeof RequiredPath>;\n  paths: z.ZodOptional<z.ZodArray<typeof RequiredPath>>;\n};\n\nexport function singleOrBatchPathsInput<TExtra extends z.ZodRawShape>(\n  extra: TExtra,\n): z.ZodObject<SingleOrBatchShape<TExtra>> {\n  const shape: z.ZodRawShape = {\n    ...extra,\n    path: RequiredPath.optional().describe('Single file path; mutually exclusive with paths'),\n    paths: z\n      .array(RequiredPath)\n      .min(1)\n      .max(DEFAULT_MAX_BATCH)\n      .optional()\n      .describe(\n        `Array of file paths for batch mode (max ${String(DEFAULT_MAX_BATCH)}); mutually exclusive with path`,\n      ),\n  };\n\n  const base = z.strictObject(shape).superRefine((value, ctx) => {\n    const hasPath = value['path'] !== undefined;\n    const hasPaths = value['paths'] !== undefined;\n\n    if (!hasPath && !hasPaths) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['path'],\n        message: \"Either 'path' or 'paths' must be provided\",\n        input: value,\n      });\n      return;\n    }\n    if (hasPath && hasPaths) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['paths'],\n        message: \"Cannot use both 'path' and 'paths'\",\n        input: value,\n      });\n    }\n  });\n\n  // No top-level oneOf on the wire: OpenAI and Anthropic reject top-level\n  // oneOf/anyOf/allOf in function parameters. The superRefine enforces\n  // \"exactly one of path/paths\" at call time.\n  return base as z.ZodObject<SingleOrBatchShape<TExtra>>;\n}\n\n/**\n * `ToolDef.mapPaths` for a {@link singleOrBatchPathsInput} shape\n * (`{ path?, paths?, files?[{path}] }`). The schema's superRefine lets exactly\n * one of the three through; each present one is mapped.\n */\nexport function mapSingleOrBatchPaths<\n  T extends {\n    path?: string | undefined;\n    paths?: string[] | undefined;\n    files?: readonly { path: string }[] | undefined;\n  },\n>(args: T, fn: (path: string) => string): T {\n  return {\n    ...args,\n    ...(args.path !== undefined ? { path: fn(args.path) } : {}),\n    ...(args.paths !== undefined ? { paths: args.paths.map(fn) } : {}),\n    ...(args.files !== undefined\n      ? { files: args.files.map((file) => ({ ...file, path: fn(file.path) })) }\n      : {}),\n  };\n}\n\n/** `ToolDef.mapPaths` for a tool whose one `path` is optional (omitted = the root). */\nexport function mapOptionalPath<T extends { path?: string | undefined }>(\n  args: T,\n  fn: (path: string) => string,\n): T {\n  return args.path === undefined ? args : { ...args, path: fn(args.path) };\n}\n\n// ponytail: charset regex, not z.base64url() — the SDK's AJV warns on the\n// unknown `base64url` format; the server's own decode (cursor.ts) is the real\n// validation, so loosening the client-facing schema to the alphabet is safe.\nconst base64urlCursor = z.string().regex(/^[A-Za-z0-9_-]+$/);\n\n// Ships once per paginated tool — wording is budgeted (TOOL-SURFACE-002).\nexport const CursorSchema = base64urlCursor\n  .optional()\n  .describe(\n    'Opaque pagination cursor; pass unchanged for the next page. Pages slice one snapshot ' +\n      'taken on the first call; it expires after ~60s — re-request without a cursor if rejected.',\n  );\n\n/**\n * Reassembles tool arguments that a client JSON-serialized and then spread\n * into an object: `{ path }` arrives as `{ \"0\": \"{\", \"1\": \"\\\"\", … }`, one key\n * per UTF-16 code unit. Returns `undefined` for anything else. Integer keys\n * enumerate first in ascending order, so matching each key to its position\n * also proves the keys are exactly `\"0\"…\"n-1\"` with nothing else alongside.\n */\nfunction joinSplitString(value: unknown): string | undefined {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) return undefined;\n  const entries = Object.entries(value);\n  if (entries.length === 0) return undefined;\n  let text = '';\n  for (const [index, [key, char]] of entries.entries()) {\n    if (key !== String(index) || typeof char !== 'string' || char.length !== 1) return undefined;\n    text += char;\n  }\n  return text;\n}\n\n/**\n * Wraps a tool's input schema so a stringified-then-spread payload (see\n * {@link joinSplitString}) is parsed back into the object it encodes, and one\n * that does not encode an object fails with a message naming the cause rather\n * than `Unrecognized keys: \"0\", \"1\", …`. The published JSON Schema is the\n * wrapped schema's own: a preprocess step converts to its output side.\n */\nexport function withSplitArgsRecovery<T extends z.ZodType>(schema: T): z.ZodPreprocess<T> {\n  return z.preprocess((value, ctx) => {\n    const text = joinSplitString(value);\n    if (text === undefined) return value;\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(text);\n    } catch {\n      parsed = undefined;\n    }\n    if (typeof parsed === 'object' && parsed !== null && !Array.isArray(parsed)) return parsed;\n    ctx.addIssue({\n      code: 'custom',\n      message:\n        `arguments must be a JSON object, but arrived as a ${String(text.length)}-character ` +\n        'string split into indexed keys (the client serialized the payload); send the arguments as an object',\n      input: value,\n    });\n    return z.NEVER;\n  }, schema);\n}\n"]}

package/dist/core/search.d.ts

@@ -1,4 +1,5 @@
 import { RE2 } from '@adguard/re2-wasm';
+import { GuardedFileSystem } from './fs.ts';
 import type { PathGuard } from './path.ts';
 interface SearchResult {
     file: string;
@@ -155,5 +156,10 @@ export declare function searchFiles(directory: string, pattern: string, options:
         stoppedReason?: 'maxResults' | 'timeout';
     };
 }>;
+/** Explicit files bypass glob filtering; their parent is the directory walked. */
+export declare function resolveSearchScope(path: string | undefined, fs: GuardedFileSystem, signal?: AbortSignal): Promise<{
+    basePath: string;
+    explicitFile?: string;
+}>;
 export {};
 //# sourceMappingURL=search.d.ts.map

package/dist/core/search.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../src/core/search.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AAKxC,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAU3C,UAAU,YAAY;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,4DAA4D;IAC5D,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,gFAAgF;IAChF,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,MAAM,KAAK,GAAG,GAAG,CAAC;AAKxB;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,WAAW,GAAG,SAAS,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,CAWrF;AAED;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,QAAU,CAAC;AAO3C;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,YAAY,CAC1B,OAAO,EAAE,MAAM,EACf,OAAO,GAAE;IAAE,aAAa,CAAC,EAAE,OAAO,CAAC;IAAC,SAAS,CAAC,EAAE,OAAO,CAAA;CAAO,GAC7D,KAAK,CAWP;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,SAAS,GAAG,IAAI,CAOxD;AAED,MAAM,WAAW,UAAU;IACzB,wBAAwB;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,gEAAgE;IAChE,MAAM,EAAE,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC;IAC/B,2DAA2D;IAC3D,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAAC;IAC1C,gFAAgF;IAChF,KAAK,EAAE,MAAM,CAAC;IACd,uCAAuC;IACvC,GAAG,EAAE,MAAM,CAAC;CACb;AAOD;;;;;;;;;;;;;;;GAeG;AACH,wBAAiB,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,UAAU,EAAE,SAAS,CAAC,CA2BzF;AAuBD,MAAM,WAAW,oBAAoB;IACnC,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,qFAAqF;IACrF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,OAAO,EAAE;QACP;;;;WAIG;QACH,aAAa,EAAE,MAAM,CAAC;QACtB,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,MAAM,CAAC;QACrB,SAAS,EAAE,OAAO,CAAC;QACnB,4DAA4D;QAC5D,mBAAmB,EAAE,MAAM,CAAC;QAC5B,4DAA4D;QAC5D,eAAe,EAAE,MAAM,CAAC;QACxB,8DAA8D;QAC9D,aAAa,EAAE,MAAM,CAAC;QACtB;;;;WAIG;QACH,aAAa,CAAC,EAAE,YAAY,GAAG,SAAS,CAAC;KAC1C,CAAC;CACH;AAwFD,wBAAsB,aAAa,CACjC,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,oBAAoB,EAC7B,SAAS,EAAE,SAAS,GACnB,OAAO,CAAC,oBAAoB,CAAC,CA6H/B;AAWD,wBAAsB,WAAW,CAC/B,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE;IACP,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACzB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB,EACD,SAAS,EAAE,SAAS,GACnB,OAAO,CAAC;IACT,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC5B,OAAO,EAAE;QACP,OAAO,EAAE,MAAM,CAAC;QAChB,YAAY,EAAE,MAAM,CAAC;QACrB,SAAS,EAAE,OAAO,CAAC;QACnB,mBAAmB,EAAE,MAAM,CAAC;QAC5B,qEAAqE;QACrE,aAAa,CAAC,EAAE,YAAY,GAAG,SAAS,CAAC;KAC1C,CAAC;CACH,CAAC,CAkED"}
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../src/core/search.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AAIxC,OAAO,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAE5C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAU3C,UAAU,YAAY;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,4DAA4D;IAC5D,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,gFAAgF;IAChF,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,MAAM,KAAK,GAAG,GAAG,CAAC;AAKxB;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,WAAW,GAAG,SAAS,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,CAWrF;AAED;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,QAAU,CAAC;AAuF3C;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,YAAY,CAC1B,OAAO,EAAE,MAAM,EACf,OAAO,GAAE;IAAE,aAAa,CAAC,EAAE,OAAO,CAAC;IAAC,SAAS,CAAC,EAAE,OAAO,CAAA;CAAO,GAC7D,KAAK,CAWP;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,SAAS,GAAG,IAAI,CAOxD;AAED,MAAM,WAAW,UAAU;IACzB,wBAAwB;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,gEAAgE;IAChE,MAAM,EAAE,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC;IAC/B,2DAA2D;IAC3D,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAAC;IAC1C,gFAAgF;IAChF,KAAK,EAAE,MAAM,CAAC;IACd,uCAAuC;IACvC,GAAG,EAAE,MAAM,CAAC;CACb;AAOD;;;;;;;;;;;;;;;GAeG;AACH,wBAAiB,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC,UAAU,EAAE,SAAS,CAAC,CA2BzF;AAuBD,MAAM,WAAW,oBAAoB;IACnC,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,qFAAqF;IACrF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,OAAO,EAAE;QACP;;;;WAIG;QACH,aAAa,EAAE,MAAM,CAAC;QACtB,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,MAAM,CAAC;QACrB,SAAS,EAAE,OAAO,CAAC;QACnB,4DAA4D;QAC5D,mBAAmB,EAAE,MAAM,CAAC;QAC5B,4DAA4D;QAC5D,eAAe,EAAE,MAAM,CAAC;QACxB,8DAA8D;QAC9D,aAAa,EAAE,MAAM,CAAC;QACtB;;;;WAIG;QACH,aAAa,CAAC,EAAE,YAAY,GAAG,SAAS,CAAC;KAC1C,CAAC;CACH;AA2HD,wBAAsB,aAAa,CACjC,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,oBAAoB,EAC7B,SAAS,EAAE,SAAS,GACnB,OAAO,CAAC,oBAAoB,CAAC,CAkI/B;AAWD,wBAAsB,WAAW,CAC/B,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE;IACP,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACzB,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB,EACD,SAAS,EAAE,SAAS,GACnB,OAAO,CAAC;IACT,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC5B,OAAO,EAAE;QACP,OAAO,EAAE,MAAM,CAAC;QAChB,YAAY,EAAE,MAAM,CAAC;QACrB,SAAS,EAAE,OAAO,CAAC;QACnB,mBAAmB,EAAE,MAAM,CAAC;QAC5B,qEAAqE;QACrE,aAAa,CAAC,EAAE,YAAY,GAAG,SAAS,CAAC;KAC1C,CAAC;CACH,CAAC,CAoFD;AAED,kFAAkF;AAClF,wBAAsB,kBAAkB,CACtC,IAAI,EAAE,MAAM,GAAG,SAAS,EACxB,EAAE,EAAE,iBAAiB,EACrB,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC,CAiBtD"}

package/dist/core/search.js

@@ -50,9 +50,10 @@ var __disposeResources = (this && this.__disposeResources) || (function (Suppres
     var e = new Error(message);
     return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
 });
-import { basename } from 'node:path';
+import { basename, dirname } from 'node:path';
 import { RE2 } from '@adguard/re2-wasm';
 import { processEntriesConcurrently, resolveStopReason } from "./concurrency.js";
+import { ErrorCode, FsError, isFsError } from "./errors.js";
 import { GuardedFileSystem } from "./fs.js";
 import { globEntries } from "./glob.js";
 import { escapeRegExp, getMaxTextFileSize, MIB, PARALLEL_CONCURRENCY } from "./util.js";
@@ -88,6 +89,60 @@ export function createYielder(signal) {
  * aborts the module. 4 MiB leaves room for the copy and the pattern set.
  */
 export const RE2_MAX_INPUT_BYTES = 4 * MIB;
+/** The chunk `FileHandle#readFile` reads in, and checks its signal between. */
+const READ_CHUNK_BYTES = 512 * 1024;
+/** The only non-ASCII characters RE2's case folding maps onto ASCII letters. */
+const KELVIN_SIGN_UTF8 = Buffer.from('\u212A', 'utf8'); // folds onto k
+const LONG_S_UTF8 = Buffer.from('\u017F', 'utf8'); // folds onto s
+const ASCII_UPPER_RE = /[A-Z]+/gu;
+/** Non-overlapping occurrences, left to right, as a global RE2 exec walks them. */
+function countOccurrences(line, needle) {
+    const column = line.indexOf(needle);
+    if (column === -1)
+        return undefined;
+    let count = 0;
+    let at = column;
+    while (at !== -1 && count < MAX_MATCHES_PER_LINE) {
+        count++;
+        at = line.indexOf(needle, at + needle.length);
+    }
+    return { count, column };
+}
+/** `undefined` when RE2 must judge the needle: these shortcuts are exact only for the needles they take. */
+function createLiteralMatcher(needle, caseSensitive) {
+    // The file is decoded with U+FFFD for every invalid byte, and a lone
+    // surrogate reaches RE2 as U+FFFD, so a needle holding either can match
+    // decoded text that the raw bytes, or indexOf, do not.
+    if (needle.includes('\uFFFD') || Buffer.from(needle, 'utf8').toString('utf8') !== needle) {
+        return undefined;
+    }
+    if (caseSensitive) {
+        const bytes = Buffer.from(needle, 'utf8');
+        return {
+            needsRe2: () => false,
+            mayMatch: (buffer) => buffer.includes(bytes),
+            matchLine: (line) => countOccurrences(line, needle),
+        };
+    }
+    // Every non-ASCII character takes more than one UTF-8 byte per UTF-16 unit.
+    if (Buffer.byteLength(needle, 'utf8') !== needle.length)
+        return undefined;
+    const lower = needle.toLowerCase();
+    const folds = [
+        ...(lower.includes('k') ? [KELVIN_SIGN_UTF8] : []),
+        ...(lower.includes('s') ? [LONG_S_UTF8] : []),
+    ];
+    return {
+        needsRe2: (buffer) => folds.some((fold) => buffer.includes(fold)),
+        // Latin-1 decoding keeps one char per byte, and lowercasing it maps A-Z
+        // onto a-z and every other byte onto a non-ASCII char, so an ASCII needle
+        // is found exactly where the bytes spell it in either case.
+        mayMatch: (buffer) => buffer.toString('latin1').toLowerCase().includes(lower),
+        // ASCII letters only: String#toLowerCase turns U+0130 into two code units,
+        // which shifts every later column and spells an `i` RE2 does not match.
+        matchLine: (line) => countOccurrences(line.replace(ASCII_UPPER_RE, (upper) => upper.toLowerCase()), lower),
+    };
+}
 const BUFFER_ANCHOR_RE = /\\[AzZ]/u;
 /** `(?i)`, `(?-m)`, `(?s:…)`: inline flags can undo the `m` the prefilter relies on. */
 const INLINE_FLAGS_RE = /\(\?[a-zA-Z-]+[:)]/u;
@@ -215,10 +270,34 @@ async function scanFile(entryPath, scanCtx) {
             // re-checks the descriptor's real path (H4), so these bytes are the
             // validated file's, not whatever the name points at by now.
             const handle = __addDisposableResource(env_1, await scanCtx.fs.open(entryPath), true);
-            const stats = await handle.stat();
-            if (stats.size > scanCtx.maxFileSize)
+            const { size } = await handle.stat();
+            if (size > scanCtx.maxFileSize)
                 return { kind: 'tooLarge' };
-            buffer = await handle.readFile({ signal: scanCtx.signal });
+            // Read the size fstat reported: handle.readFile would fstat again and then
+            // read once more to find EOF, two extra round trips on every file a walk
+            // touches. A file that grows meanwhile is searched as it was at the fstat.
+            // A size of 0 is also what procfs and other virtual files report while
+            // holding text, so those still read to EOF.
+            if (size === 0) {
+                buffer = await handle.readFile({ signal: scanCtx.signal });
+                if (buffer.length > scanCtx.maxFileSize)
+                    return { kind: 'tooLarge' };
+            }
+            else {
+                buffer = Buffer.allocUnsafe(size);
+                let filled = 0;
+                while (filled < size) {
+                    // In readFile's own chunks, with its check of the signal before each,
+                    // so a deadline on a slow filesystem lands as soon as it did there.
+                    scanCtx.signal?.throwIfAborted();
+                    const length = Math.min(size - filled, READ_CHUNK_BYTES);
+                    const { bytesRead } = await handle.read(buffer, filled, length, filled);
+                    if (bytesRead === 0)
+                        break;
+                    filled += bytesRead;
+                }
+                buffer = buffer.subarray(0, filled);
+            }
         }
         catch (e_1) {
             env_1.error = e_1;
@@ -233,6 +312,10 @@ async function scanFile(entryPath, scanCtx) {
     catch (error) {
         if (scanCtx.signal?.aborted)
             throw error;
+        if (scanCtx.fs.pathGuard.isSensitive(entryPath) ||
+            (isFsError(error) && error.message.startsWith('Sensitive file'))) {
+            return { kind: 'sensitive' };
+        }
         return { kind: 'inaccessible' };
     }
     // A NUL byte marks a binary file, as it does for `read` and `grep -I`.
@@ -240,8 +323,11 @@ async function scanFile(entryPath, scanCtx) {
     // bytes a pattern could not have matched anyway.
     if (buffer.includes(0))
         return { kind: 'binary' };
+    const literal = scanCtx.literal?.needsRe2(buffer) ? undefined : scanCtx.literal;
+    if (literal && !literal.mayMatch(buffer))
+        return { kind: 'scanned', matches: [] };
     const content = buffer.toString('utf-8');
-    if (canPrefilter(scanCtx.source, buffer)) {
+    if (!literal && canPrefilter(scanCtx.source, buffer)) {
         scanCtx.prefilter.lastIndex = 0;
         if (scanCtx.prefilter.exec(content) === null)
             return { kind: 'scanned', matches: [] };
@@ -253,8 +339,9 @@ async function scanFile(entryPath, scanCtx) {
     const lineCount = content.length === 0 ? 0 : content.endsWith('\n') ? lines.length - 1 : lines.length;
     // A single line past RE2_MAX_INPUT_BYTES OOMs the wasm module for the rest of
     // the process; report the file tooLarge instead. Only a buffer over the bound
-    // can hold such a line, so ordinary files skip the per-line measure.
-    const checkLineSize = buffer.length > RE2_MAX_INPUT_BYTES;
+    // can hold such a line, so ordinary files skip the per-line measure, and a
+    // literal match never hands a line to RE2.
+    const checkLineSize = !literal && buffer.length > RE2_MAX_INPUT_BYTES;
     const matches = [];
     const tick = createYielder(scanCtx.signal);
     for (let i = 0; i < lineCount; i++) {
@@ -269,7 +356,9 @@ async function scanFile(entryPath, scanCtx) {
             break;
         // One scan per line: the helper resets lastIndex itself, so it
         // doubles as the "does this line match" test.
-        const found = await findLineMatches(scanCtx.regex, line, tick);
+        const found = literal
+            ? literal.matchLine(line)
+            : await findLineMatches(scanCtx.regex, line, tick);
         if (found) {
             matches.push({
                 file: entryPath,
@@ -341,6 +430,9 @@ export async function searchContent(directory, pattern, options, pathGuard) {
             maxResults,
             regex,
             prefilter,
+            literal: options.isRegex
+                ? undefined
+                : createLiteralMatcher(pattern, Boolean(options.caseSensitive)),
             source,
             context,
         };
@@ -369,6 +461,8 @@ export async function searchContent(directory, pattern, options, pathGuard) {
             if (!scan)
                 continue;
             switch (scan.kind) {
+                case 'sensitive':
+                    break;
                 case 'inaccessible':
                     skippedInaccessible++;
                     break;
@@ -442,34 +536,47 @@ export async function searchFiles(directory, pattern, options, pathGuard) {
     const results = [];
     let filesScanned = 0;
     let skippedInaccessible = 0;
-    let stoppedByAbort = false;
-    // The signal carries both client cancellation and the tool's search timeout,
-    // so an abort means "return what we have, marked incomplete" rather than
-    // throw — but it must never be reported as a finished scan. The walk itself
-    // throws when the signal stops it before a single entry is yielded.
-    try {
-        for await (const entry of entries) {
-            if (options.signal?.aborted) {
-                stoppedByAbort = true;
-                break;
-            }
+    const perFile = new Map();
+    let dispatched = 0;
+    let collected = 0;
+    const stopped = await processEntriesConcurrently(entries, {
+        signal: options.signal,
+        concurrency: PARALLEL_CONCURRENCY,
+        shouldStop: () => collected >= maxResults,
+        onEntry: () => {
+            dispatched++;
+        },
+        onError: () => undefined,
+        runEntry: async (entryPath) => {
+            const index = dispatched - 1;
             try {
-                await pathGuard.validateExistingPath(entry.path);
+                await pathGuard.validateExistingPath(entryPath);
+                perFile.set(index, { path: entryPath });
+                collected++;
             }
-            catch {
-                skippedInaccessible++;
-                continue;
+            catch (error) {
+                if (pathGuard.isSensitive(entryPath) ||
+                    (isFsError(error) && error.message.startsWith('Sensitive file'))) {
+                    perFile.set(index, 'sensitive');
+                }
+                else {
+                    perFile.set(index, 'inaccessible');
+                }
             }
-            if (results.length >= maxResults)
-                break;
-            filesScanned++;
-            results.push({ path: entry.path });
+        },
+    });
+    for (let i = 0; i < dispatched; i++) {
+        const item = perFile.get(i);
+        if (!item || item === 'sensitive')
+            continue;
+        if (item === 'inaccessible') {
+            skippedInaccessible++;
+            continue;
         }
-    }
-    catch (error) {
-        if (!options.signal?.aborted)
-            throw error;
-        stoppedByAbort = true;
+        if (results.length >= maxResults)
+            break;
+        filesScanned++;
+        results.push(item);
     }
     // Sorting — only name / path are supported; size / modified were removed
     // (the glob never collected stats, so they were always undefined).
@@ -480,7 +587,7 @@ export async function searchFiles(directory, pattern, options, pathGuard) {
         results.sort((a, b) => a.path.localeCompare(b.path));
     }
     // Same precedence as above: the result cap wins over a same-iteration abort.
-    const stoppedReason = resolveStopReason(results.length >= maxResults, stoppedByAbort);
+    const stoppedReason = resolveStopReason(results.length >= maxResults, stopped === 'timeout' || Boolean(options.signal?.aborted));
     return {
         basePath: directory,
         results,
@@ -493,4 +600,23 @@ export async function searchFiles(directory, pattern, options, pathGuard) {
         },
     };
 }
+/** Explicit files bypass glob filtering; their parent is the directory walked. */
+export async function resolveSearchScope(path, fs, signal) {
+    const requested = fs.pathGuard.resolvePathOrRoot(path);
+    // One resolution, one stat: validateExistingDirectory would redo both.
+    const { stats, validPath: resolved } = await fs.stat(requested, { signal });
+    if (!stats.isFile()) {
+        if (!stats.isDirectory()) {
+            throw new FsError(ErrorCode.NOT_DIRECTORY, 'Not a directory', requested);
+        }
+        return { basePath: resolved };
+    }
+    return {
+        basePath: dirname(resolved),
+        // The name is NOT turned into a glob: `[slug].tsx` would read as a
+        // character class. searchContent scans exactly this file instead, and
+        // hidden/ignored filtering is moot for a file the caller named.
+        explicitFile: resolved,
+    };
+}
 //# sourceMappingURL=search.js.map