@j0hanz/filesystem-mcp 2.6.3 → 2.7.0

package/dist/core/search.js

@@ -1,9 +1,9 @@
 import { stat as fsStat, readFile } from 'node:fs/promises';
 import { basename } from 'node:path';
 import { RE2 } from '@adguard/re2-wasm';
-import { resolveStopReason } from "./concurrency.js";
+import { processEntriesConcurrently, resolveStopReason } from "./concurrency.js";
 import { globEntries } from "./glob.js";
-import { escapeRegExp, getMaxTextFileSize, MIB } from "./util.js";
+import { escapeRegExp, getMaxTextFileSize, MIB, PARALLEL_CONCURRENCY } from "./util.js";
 /**
  * A fresh, flat copy of `s`. V8 keeps a substring of a long string as a slice
  * that references its parent, so a kept line would otherwise pin the whole
@@ -18,6 +18,10 @@ const MAX_MATCHES_PER_LINE = 100_000;
  * aborts the module. 4 MiB leaves room for the copy and the pattern set.
  */
 export const RE2_MAX_INPUT_BYTES = 4 * MIB;
+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;
+const CR = 13;
 /**
  * Compile a pattern on RE2 rather than on V8's irregexp.
  *
@@ -40,7 +44,7 @@ export const RE2_MAX_INPUT_BYTES = 4 * MIB;
  * {@link freeRegex} when it is done with it.
  */
 export function compileRegex(pattern, options = {}) {
-    const flags = options.caseSensitive ? 'gu' : 'giu';
+    const flags = `g${options.multiline ? 'm' : ''}${options.caseSensitive ? '' : 'i'}u`;
     try {
         return new RE2(pattern, flags);
     }
@@ -130,110 +134,173 @@ function findLineMatches(regex, line) {
     }
     return count > 0 ? { count, column } : undefined;
 }
+async function scanFile(entryPath, scanCtx) {
+    try {
+        await scanCtx.pathGuard.validateExistingPath(entryPath);
+    }
+    catch {
+        return { kind: 'inaccessible' };
+    }
+    try {
+        const stats = await fsStat(entryPath);
+        if (stats.size > scanCtx.maxFileSize)
+            return { kind: 'tooLarge' };
+    }
+    catch {
+        return { kind: 'inaccessible' };
+    }
+    let buffer;
+    try {
+        buffer = await readFile(entryPath, { signal: scanCtx.signal });
+    }
+    catch (error) {
+        if (scanCtx.signal?.aborted)
+            throw error;
+        return { kind: 'inaccessible' };
+    }
+    // A NUL byte marks a binary file, as it does for `read` and `grep -I`.
+    // Non-UTF-8 text is still searched: a lossy decode only affects the
+    // bytes a pattern could not have matched anyway.
+    if (buffer.includes(0))
+        return { kind: 'binary' };
+    const content = buffer.toString('utf-8');
+    if (canPrefilter(scanCtx.source, buffer)) {
+        scanCtx.prefilter.lastIndex = 0;
+        if (scanCtx.prefilter.exec(content) === null)
+            return { kind: 'scanned', matches: [] };
+    }
+    const lines = content.split(/\r?\n/u);
+    // A trailing newline splits into a phantom empty last element, and an
+    // empty file splits into one empty element: neither is a line the
+    // file has, for matching or for context.
+    const lineCount = content.length === 0 ? 0 : content.endsWith('\n') ? lines.length - 1 : lines.length;
+    const matches = [];
+    for (let i = 0; i < lineCount; i++) {
+        const line = lines[i];
+        if (line === undefined)
+            continue;
+        // One scan per line: the helper resets lastIndex itself, so it
+        // doubles as the "does this line match" test.
+        const found = findLineMatches(scanCtx.regex, line);
+        if (found) {
+            matches.push({
+                file: entryPath,
+                line: i + 1,
+                column: found.column,
+                content: own(line),
+                matchCount: found.count,
+                ...(scanCtx.context > 0
+                    ? {
+                        before: lines.slice(Math.max(0, i - scanCtx.context), i).map(own),
+                        after: lines.slice(i + 1, Math.min(lineCount, i + 1 + scanCtx.context)).map(own),
+                    }
+                    : {}),
+            });
+            if (matches.length >= scanCtx.maxResults)
+                break;
+        }
+    }
+    return { kind: 'scanned', matches };
+}
 export async function searchContent(directory, pattern, options, pathGuard) {
-    const regex = compileRegex(options.isRegex ? pattern || '' : escapeRegExp(pattern || ''), {
+    const source = options.isRegex ? pattern || '' : escapeRegExp(pattern || '');
+    const regex = compileRegex(source, {
         caseSensitive: Boolean(options.caseSensitive),
     });
+    // Whole-buffer test: `m` makes ^/$ line-relative so a per-line hit is always a
+    // buffer hit (the converse can be false — a false positive just falls through
+    // to the per-line scan). \A/\z/\Z are buffer-relative even under `m`, inline
+    // flag groups can undo `m`, and $ cannot see past a \r, so those inputs skip
+    // the prefilter (see canPrefilter).
+    const prefilter = compileRegex(source, {
+        caseSensitive: Boolean(options.caseSensitive),
+        multiline: true,
+    });
     try {
         const matches = [];
         const maxResults = options.maxResults ?? 100;
         const maxFileSize = getMaxTextFileSize();
         const context = options.context ?? 0;
-        const entries = globEntries({
-            cwd: directory,
-            pattern: options.filePattern ?? '**/*',
-            // Same rule as replace_text, so a search with the same glob previews the
-            // files a replace would touch: a slash-free glob matches at any depth.
-            baseNameMatch: true,
-            includeHidden: Boolean(options.includeHidden),
-            skipIgnored: Boolean(options.skipIgnored),
-            ...(options.signal ? { signal: options.signal } : {}),
-            maxDepth: options.maxDepth ?? 100,
-            suppressErrors: true,
-        });
+        const ceiling = pathGuard.allowedRootContaining(directory);
+        const entries = options.explicitFile
+            ? [{ path: options.explicitFile }]
+            : globEntries({
+                cwd: directory,
+                pattern: options.filePattern ?? '**/*',
+                // Same rule as replace_text, so a search with the same glob previews the
+                // files a replace would touch: a slash-free glob matches at any depth.
+                baseNameMatch: true,
+                includeHidden: Boolean(options.includeHidden),
+                skipIgnored: Boolean(options.skipIgnored),
+                ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),
+                ...(options.signal ? { signal: options.signal } : {}),
+                maxDepth: options.maxDepth ?? 100,
+                suppressErrors: true,
+            });
         let filesScanned = 0;
         let filesMatched = 0;
         let matchingLines = 0;
         let skippedTooLarge = 0;
         let skippedBinary = 0;
-        const counters = { skippedInaccessible: 0, stoppedByAbort: false };
-        for await (const entry of guardedEntries(entries, pathGuard, options.signal, counters)) {
-            if (matches.length >= maxResults)
-                break;
-            // Skip oversized files before reading to avoid unbounded memory use. Count
-            // them: "no matches" for a reason other than the pattern must be visible.
-            try {
-                const stats = await fsStat(entry.path);
-                if (stats.size > maxFileSize) {
-                    skippedTooLarge++;
-                    continue;
-                }
-            }
-            catch {
-                counters.skippedInaccessible++;
+        const scanCtx = {
+            pathGuard,
+            signal: options.signal,
+            maxFileSize,
+            maxResults,
+            regex,
+            prefilter,
+            source,
+            context,
+        };
+        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;
+                const scan = await scanFile(entryPath, scanCtx);
+                perFile.set(index, scan);
+                if (scan.kind === 'scanned')
+                    collected += scan.matches.length;
+            },
+        });
+        let skippedInaccessible = 0;
+        for (let i = 0; i < dispatched; i++) {
+            const scan = perFile.get(i);
+            if (!scan)
                 continue;
-            }
-            filesScanned++;
-            try {
-                const buffer = await readFile(entry.path, { signal: options.signal });
-                // A NUL byte marks a binary file, as it does for `read` and `grep -I`.
-                // Non-UTF-8 text is still searched: a lossy decode only affects the
-                // bytes a pattern could not have matched anyway.
-                if (buffer.includes(0)) {
+            switch (scan.kind) {
+                case 'inaccessible':
+                    skippedInaccessible++;
+                    break;
+                case 'tooLarge':
+                    skippedTooLarge++;
+                    break;
+                case 'binary':
+                    filesScanned++;
                     skippedBinary++;
-                    continue;
-                }
-                const content = buffer.toString('utf-8');
-                const lines = content.split(/\r?\n/u);
-                // A trailing newline splits into a phantom empty last element, and an
-                // empty file splits into one empty element: neither is a line the
-                // file has, for matching or for context.
-                const lineCount = content.length === 0 ? 0 : content.endsWith('\n') ? lines.length - 1 : lines.length;
-                let matchedFile = false;
-                for (let i = 0; i < lineCount; i++) {
-                    const line = lines[i];
-                    if (line === undefined)
-                        continue;
-                    // One scan per line: findLineMatches resets lastIndex itself, so it
-                    // doubles as the "does this line match" test.
-                    const found = findLineMatches(regex, line);
-                    if (found) {
-                        matchedFile = true;
-                        matchingLines++;
-                        matches.push({
-                            file: entry.path,
-                            line: i + 1,
-                            column: found.column,
-                            content: own(line),
-                            matchCount: found.count,
-                            ...(context > 0
-                                ? {
-                                    before: lines.slice(Math.max(0, i - context), i).map(own),
-                                    after: lines.slice(i + 1, Math.min(lineCount, i + 1 + context)).map(own),
-                                }
-                                : {}),
-                        });
+                    break;
+                case 'scanned':
+                    filesScanned++;
+                    if (scan.matches.length > 0)
+                        filesMatched++;
+                    for (const match of scan.matches) {
                         if (matches.length >= maxResults)
                             break;
+                        matches.push(match);
+                        matchingLines++;
                     }
-                }
-                if (matchedFile)
-                    filesMatched++;
-            }
-            catch {
-                // A read failure while the signal is aborted IS the abort, not an
-                // unreadable file — stop rather than spend another iteration and then
-                // report a cut-short scan as complete.
-                if (options.signal?.aborted) {
-                    counters.stoppedByAbort = true;
                     break;
-                }
-                // unreadable mid-scan (deleted, permission changed): skip the file
             }
         }
-        // The result cap is the definite cause even when the abort fired on the
-        // same iteration (see the summary type's narrowing note).
-        const stoppedReason = resolveStopReason(matches.length >= maxResults, counters.stoppedByAbort);
+        const stoppedReason = resolveStopReason(matches.length >= maxResults, stopped === 'timeout' || Boolean(options.signal?.aborted));
         return {
             basePath: directory,
             matches,
@@ -242,7 +309,7 @@ export async function searchContent(directory, pattern, options, pathGuard) {
                 filesScanned,
                 filesMatched,
                 truncated: stoppedReason !== undefined,
-                skippedInaccessible: counters.skippedInaccessible,
+                skippedInaccessible,
                 skippedTooLarge,
                 skippedBinary,
                 ...(stoppedReason ? { stoppedReason } : {}),
@@ -250,9 +317,22 @@ export async function searchContent(directory, pattern, options, pathGuard) {
         };
     }
     finally {
+        freeRegex(prefilter);
         freeRegex(regex);
     }
 }
+/** Whether one whole-buffer RE2 test is a sound "cannot match" check for this file. */
+function canPrefilter(source, buffer) {
+    if (buffer.length > RE2_MAX_INPUT_BYTES)
+        return false;
+    if (BUFFER_ANCHOR_RE.test(source))
+        return false;
+    if (INLINE_FLAGS_RE.test(source))
+        return false;
+    if (source.includes('$') && buffer.includes(CR))
+        return false;
+    return true;
+}
 async function* guardedEntries(entries, pathGuard, signal, counters) {
     // The signal carries both client cancellation and the tool's search timeout,
     // so an abort means "return what we have, marked incomplete" rather than
@@ -274,12 +354,14 @@ async function* guardedEntries(entries, pathGuard, signal, counters) {
 }
 export async function searchFiles(directory, pattern, options, pathGuard) {
     const maxResults = options.maxResults ?? 100;
+    const ceiling = pathGuard.allowedRootContaining(directory);
     const entries = globEntries({
         cwd: directory,
         pattern,
         baseNameMatch: true,
         includeHidden: Boolean(options.includeHidden),
         skipIgnored: Boolean(options.skipIgnored),
+        ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),
         ...(options.signal ? { signal: options.signal } : {}),
         maxDepth: options.maxDepth ?? 100,
         suppressErrors: true,

package/dist/core/search.js.map

@@ -1 +1 @@
-{"version":3,"file":"search.js","sourceRoot":"","sources":["../../src/core/search.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,IAAI,MAAM,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAGrC,OAAO,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AAExC,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAE,WAAW,EAAkB,MAAM,WAAW,CAAC;AAExD,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAElE;;;;GAIG;AACH,MAAM,GAAG,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;AAgB3E,+EAA+E;AAC/E,MAAM,oBAAoB,GAAG,OAAO,CAAC;AAErC;;;;GAIG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,GAAG,GAAG,CAAC;AAE3C;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,YAAY,CAAC,OAAe,EAAE,UAAuC,EAAE;IACrF,MAAM,KAAK,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;IACnD,IAAI,CAAC;QACH,OAAO,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,CAAC,KAAK,YAAY,WAAW,CAAC;YAAE,MAAM,KAAK,CAAC;QACjD,MAAM,IAAI,WAAW,CACnB,GAAG,KAAK,CAAC,OAAO,iEAAiE,EACjF,EAAE,KAAK,EAAE,KAAK,EAAE,CACjB,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,KAAwB;IAChD,MAAM,MAAM,GAAI,KAAsE,EAAE,OAAO,CAAC;IAChG,IAAI,CAAC;QACH,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACrB,CAAC;IAAC,MAAM,CAAC;QACP,+DAA+D;IACjE,CAAC;AACH,CAAC;AAeD,qFAAqF;AACrF,MAAM,eAAe,GAAG,CAAC,IAAY,EAAU,EAAE;AAC/C,0MAA0M;AAC1M,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC;AAEnB;;;;;;;;;;;;;;;GAeG;AACH,MAAM,SAAS,CAAC,CAAC,WAAW,CAAC,KAAY,EAAE,IAAY;IACrD,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;IACpB,0EAA0E;IAC1E,0EAA0E;IAC1E,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,KAA0B,CAAC;IAC/B,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC3C,OAAO,QAAQ,GAAG,KAAK,CAAC,KAAK,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzD,MAAM,MAAM,GACV,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM;gBAChD,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM,CAAC;YACvD,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,QAAQ,EAAE,CAAC;QACb,CAAC;QACD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,MAAM;YACJ,IAAI,EAAE,OAAO;YACb,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACtB,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,KAAK;YACL,GAAG,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM;SAC5B,CAAC;QACF,4EAA4E;QAC5E,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC;IACxF,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CACtB,KAAY,EACZ,IAAY;IAEZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;IAChB,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QAC7C,IAAI,MAAM,KAAK,CAAC,CAAC;YAAE,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QACxC,KAAK,EAAE,CAAC;QACR,IAAI,KAAK,IAAI,oBAAoB;YAAE,MAAM;IAC3C,CAAC;IACD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;AACnD,CAAC;AA2CD,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,SAAiB,EACjB,OAAe,EACf,OAA6B,EAC7B,SAAoB;IAEpB,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE;QACxF,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;KAC9C,CAAC,CAAC;IACH,IAAI,CAAC;QACH,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;QAC7C,MAAM,WAAW,GAAG,kBAAkB,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;QAErC,MAAM,OAAO,GAAG,WAAW,CAAC;YAC1B,GAAG,EAAE,SAAS;YACd,OAAO,EAAE,OAAO,CAAC,WAAW,IAAI,MAAM;YACtC,yEAAyE;YACzE,uEAAuE;YACvE,aAAa,EAAE,IAAI;YACnB,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;YAC7C,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC;YACzC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrD,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,GAAG;YACjC,cAAc,EAAE,IAAI;SACrB,CAAC,CAAC;QAEH,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,MAAM,QAAQ,GAAG,EAAE,mBAAmB,EAAE,CAAC,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC;QAEnE,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,cAAc,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;YACvF,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;gBAAE,MAAM;YAExC,2EAA2E;YAC3E,0EAA0E;YAC1E,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACvC,IAAI,KAAK,CAAC,IAAI,GAAG,WAAW,EAAE,CAAC;oBAC7B,eAAe,EAAE,CAAC;oBAClB,SAAS;gBACX,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,QAAQ,CAAC,mBAAmB,EAAE,CAAC;gBAC/B,SAAS;YACX,CAAC;YAED,YAAY,EAAE,CAAC;YAEf,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;gBACtE,uEAAuE;gBACvE,oEAAoE;gBACpE,iDAAiD;gBACjD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvB,aAAa,EAAE,CAAC;oBAChB,SAAS;gBACX,CAAC;gBACD,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;gBACzC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACtC,sEAAsE;gBACtE,kEAAkE;gBAClE,yCAAyC;gBACzC,MAAM,SAAS,GACb,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;gBACtF,IAAI,WAAW,GAAG,KAAK,CAAC;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACtB,IAAI,IAAI,KAAK,SAAS;wBAAE,SAAS;oBACjC,oEAAoE;oBACpE,8CAA8C;oBAC9C,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC3C,IAAI,KAAK,EAAE,CAAC;wBACV,WAAW,GAAG,IAAI,CAAC;wBACnB,aAAa,EAAE,CAAC;wBAChB,OAAO,CAAC,IAAI,CAAC;4BACX,IAAI,EAAE,KAAK,CAAC,IAAI;4BAChB,IAAI,EAAE,CAAC,GAAG,CAAC;4BACX,MAAM,EAAE,KAAK,CAAC,MAAM;4BACpB,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC;4BAClB,UAAU,EAAE,KAAK,CAAC,KAAK;4BACvB,GAAG,CAAC,OAAO,GAAG,CAAC;gCACb,CAAC,CAAC;oCACE,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;oCACzD,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;iCACzE;gCACH,CAAC,CAAC,EAAE,CAAC;yBACR,CAAC,CAAC;wBACH,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;4BAAE,MAAM;oBAC1C,CAAC;gBACH,CAAC;gBACD,IAAI,WAAW;oBAAE,YAAY,EAAE,CAAC;YAClC,CAAC;YAAC,MAAM,CAAC;gBACP,kEAAkE;gBAClE,sEAAsE;gBACtE,uCAAuC;gBACvC,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC;oBAC5B,QAAQ,CAAC,cAAc,GAAG,IAAI,CAAC;oBAC/B,MAAM;gBACR,CAAC;gBACD,mEAAmE;YACrE,CAAC;QACH,CAAC;QAED,wEAAwE;QACxE,0DAA0D;QAC1D,MAAM,aAAa,GAAG,iBAAiB,CAAC,OAAO,CAAC,MAAM,IAAI,UAAU,EAAE,QAAQ,CAAC,cAAc,CAAC,CAAC;QAE/F,OAAO;YACL,QAAQ,EAAE,SAAS;YACnB,OAAO;YACP,OAAO,EAAE;gBACP,aAAa;gBACb,YAAY;gBACZ,YAAY;gBACZ,SAAS,EAAE,aAAa,KAAK,SAAS;gBACtC,mBAAmB,EAAE,QAAQ,CAAC,mBAAmB;gBACjD,eAAe;gBACf,aAAa;gBACb,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC5C;SACF,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,SAAS,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED,KAAK,SAAS,CAAC,CAAC,cAAc,CAC5B,OAAiC,EACjC,SAAoB,EACpB,MAA+B,EAC/B,QAAkE;IAElE,6EAA6E;IAC7E,yEAAyE;IACzE,4DAA4D;IAC5D,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAClC,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;YACpB,QAAQ,CAAC,cAAc,GAAG,IAAI,CAAC;YAC/B,OAAO;QACT,CAAC;QACD,IAAI,CAAC;YACH,MAAM,SAAS,CAAC,oBAAoB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC;QAAC,MAAM,CAAC;YACP,QAAQ,CAAC,mBAAmB,EAAE,CAAC;YAC/B,SAAS;QACX,CAAC;QACD,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,SAAiB,EACjB,OAAe,EACf,OAOC,EACD,SAAoB;IAapB,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;IAC7C,MAAM,OAAO,GAAG,WAAW,CAAC;QAC1B,GAAG,EAAE,SAAS;QACd,OAAO;QACP,aAAa,EAAE,IAAI;QACnB,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;QAC7C,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC;QACzC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,GAAG;QACjC,cAAc,EAAE,IAAI;KACrB,CAAC,CAAC;IACH,MAAM,OAAO,GAAuB,EAAE,CAAC;IACvC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,QAAQ,GAAG,EAAE,mBAAmB,EAAE,CAAC,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC;IAEnE,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,cAAc,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;QACvF,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;YAAE,MAAM;QACxC,YAAY,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACrC,CAAC;IAED,yEAAyE;IACzE,mEAAmE;IACnE,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAC9B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,6EAA6E;IAC7E,MAAM,aAAa,GAAG,iBAAiB,CAAC,OAAO,CAAC,MAAM,IAAI,UAAU,EAAE,QAAQ,CAAC,cAAc,CAAC,CAAC;IAE/F,OAAO;QACL,QAAQ,EAAE,SAAS;QACnB,OAAO;QACP,OAAO,EAAE;YACP,OAAO,EAAE,OAAO,CAAC,MAAM;YACvB,YAAY;YACZ,SAAS,EAAE,aAAa,KAAK,SAAS;YACtC,mBAAmB,EAAE,QAAQ,CAAC,mBAAmB;YACjD,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC5C;KACF,CAAC;AACJ,CAAC","sourcesContent":["import { stat as fsStat, readFile } from 'node:fs/promises';\nimport { basename } from 'node:path';\n\nimport type { RE2ExecArray } from '@adguard/re2-wasm';\nimport { RE2 } from '@adguard/re2-wasm';\n\nimport { resolveStopReason } from './concurrency.ts';\nimport { globEntries, type GlobEntry } from './glob.ts';\nimport type { PathGuard } from './path.ts';\nimport { escapeRegExp, getMaxTextFileSize, MIB } from './util.ts';\n\n/**\n * A fresh, flat copy of `s`. V8 keeps a substring of a long string as a slice\n * that references its parent, so a kept line would otherwise pin the whole\n * file's text for as long as the match list lives (60 s in the page store).\n */\nconst own = (s: string): string => Buffer.from(s, 'utf8').toString('utf8');\n\ninterface SearchResult {\n  file: string;\n  line: number;\n  /** 0-indexed column of the first occurrence on the line. */\n  column: number;\n  content: string;\n  matchCount?: number;\n  /** Up to `context` lines either side of the match; absent when context is 0. */\n  before?: string[];\n  after?: string[];\n}\n\nexport type Regex = RE2;\n\n/** Occurrence-counting bound, so one pathological line cannot spin forever. */\nconst MAX_MATCHES_PER_LINE = 100_000;\n\n/**\n * Largest input one RE2 call may scan as a single string. The input is copied\n * into the same fixed 16 MB wasm heap as the patterns; about 10 MB of input\n * aborts the module. 4 MiB leaves room for the copy and the pattern set.\n */\nexport const RE2_MAX_INPUT_BYTES = 4 * MIB;\n\n/**\n * Compile a pattern on RE2 rather than on V8's irregexp.\n *\n * Patterns arrive from the MCP client, so a backtracking engine would let one\n * request pin the event loop with no way out: an abort signal cannot preempt a\n * synchronous `exec`, and on stdio that wedges the whole server. RE2 matches in\n * time linear in the input and cannot backtrack at all, so the hazard is gone\n * rather than bounded.\n *\n * RE2 rejects the constructs the tool schema documents as unsupported —\n * lookahead, lookbehind, backreferences — with its own {@link SyntaxError},\n * which the tool layer turns into a normal tool error. It always matches in\n * Unicode mode and requires the `u` flag to say so.\n *\n * Every compiled pattern owns memory in re2-wasm's fixed 16 MB heap, which\n * `ALLOW_MEMORY_GROWTH` is off for. re2-wasm never frees it and a\n * FinalizationRegistry does not keep up (V8 sees no pressure from the wasm\n * heap), so exhaustion is an emscripten `abort()` that kills regex search for\n * the rest of the process. Every caller MUST pass the result to\n * {@link freeRegex} when it is done with it.\n */\nexport function compileRegex(pattern: string, options: { caseSensitive?: boolean } = {}): Regex {\n  const flags = options.caseSensitive ? 'gu' : 'giu';\n  try {\n    return new RE2(pattern, flags);\n  } catch (error) {\n    if (!(error instanceof SyntaxError)) throw error;\n    throw new SyntaxError(\n      `${error.message} — lookahead, lookbehind, and backreferences are not supported.`,\n      { cause: error },\n    );\n  }\n}\n\n/**\n * Release a compiled pattern's wasm memory. re2-wasm exposes no disposal of its\n * own, so this reaches the embind handle it holds privately; a version that\n * renames the field degrades to the pre-existing leak rather than throwing.\n * Idempotent — a second call on an already-freed handle is swallowed. Using a\n * {@link Regex} after freeing it is undefined behaviour in the wasm heap, so\n * free only in a `finally` that owns the compile.\n */\nexport function freeRegex(regex: Regex | undefined): void {\n  const handle = (regex as unknown as { wrapper?: { delete?: () => void } } | undefined)?.wrapper;\n  try {\n    handle?.delete?.();\n  } catch {\n    // already deleted, or a re2-wasm build without embind disposal\n  }\n}\n\nexport interface RegexMatch {\n  /** The matched text. */\n  text: string;\n  /** Capture groups, 1-indexed in the pattern, 0-indexed here. */\n  groups: (string | undefined)[];\n  /** Named capture groups, when the pattern declares any. */\n  named: Record<string, string> | undefined;\n  /** Start offset in UTF-16 code units — usable with `String.prototype.slice`. */\n  start: number;\n  /** End offset in UTF-16 code units. */\n  end: number;\n}\n\n/** Code-point length of `text`, i.e. its UTF-16 length minus its surrogate pairs. */\nconst codePointLength = (text: string): number =>\n  // eslint-disable-next-line @typescript-eslint/no-misused-spread -- code points are the intended unit (re2-wasm offsets count code points); grapheme segmentation would change the count, not preserve it.\n  [...text].length;\n\n/**\n * Iterate a global pattern's non-overlapping matches with offsets JS can use.\n *\n * re2-wasm reports `index` and `lastIndex` in **code points**, while every JS\n * string operation indexes in UTF-16 code units. The two agree only until the\n * first astral character (most emoji), past which every offset is short by one\n * per surrogate pair — slicing on the raw index cuts into the middle of\n * neighbouring text. Its `lastIndex` bookkeeping is worse still: it adds the\n * match's UTF-16 length to a code-point index, so an astral character inside a\n * match can skip the next one. This is the single place that corrects both; no\n * caller should read `match.index` or `regex.lastIndex` directly.\n *\n * Zero-length matches (e.g. `a*`) advance by one code point so they cannot loop\n * forever. The regex is global and shared across calls, so `lastIndex` is reset\n * on entry.\n */\nexport function* execMatches(regex: Regex, text: string): Generator<RegexMatch, undefined> {\n  regex.lastIndex = 0;\n  // Cursor into `text`, carried forward across matches: RE2 reports them in\n  // ascending order, so the walk is O(text) in total rather than per match.\n  let cursorCp = 0;\n  let cursorU16 = 0;\n  let match: RE2ExecArray | null;\n  while ((match = regex.exec(text)) !== null) {\n    while (cursorCp < match.index && cursorU16 < text.length) {\n      const isPair =\n        (text.charCodeAt(cursorU16) & 0xfc00) === 0xd800 &&\n        (text.charCodeAt(cursorU16 + 1) & 0xfc00) === 0xdc00;\n      cursorU16 += isPair ? 2 : 1;\n      cursorCp++;\n    }\n    const matched = match[0] ?? '';\n    const start = cursorU16;\n    yield {\n      text: matched,\n      groups: match.slice(1),\n      named: match.groups,\n      start,\n      end: start + matched.length,\n    };\n    // Own the advance rather than trusting the wrapper's mixed-unit arithmetic.\n    regex.lastIndex = match.index + (matched.length === 0 ? 1 : codePointLength(matched));\n  }\n}\n\n/**\n * Find non-overlapping occurrences of a global regex in a single line, reporting\n * the first match's column alongside the count.\n */\nfunction findLineMatches(\n  regex: Regex,\n  line: string,\n): { count: number; column: number } | undefined {\n  let count = 0;\n  let column = -1;\n  for (const match of execMatches(regex, line)) {\n    if (column === -1) column = match.start;\n    count++;\n    if (count >= MAX_MATCHES_PER_LINE) break;\n  }\n  return count > 0 ? { count, column } : undefined;\n}\n\nexport interface SearchContentOptions {\n  caseSensitive?: boolean;\n  isRegex?: boolean;\n  maxResults?: number;\n  filePattern?: string;\n  skipIgnored?: boolean;\n  includeHidden?: boolean;\n  maxDepth?: number;\n  /** Lines of context to carry either side of each match; 0 (default) carries none. */\n  context?: number;\n  signal?: AbortSignal;\n}\n\nexport interface SearchContentOutcome {\n  basePath: string;\n  matches: SearchResult[];\n  summary: {\n    /**\n     * Matching *lines*, one per entry in `matches` — not pattern occurrences.\n     * A line with three occurrences counts once here and reports 3 in its own\n     * `SearchResult.matchCount`.\n     */\n    matchingLines: number;\n    filesScanned: number;\n    filesMatched: number;\n    truncated: boolean;\n    /** Files the guard rejected or that could not be stat'd. */\n    skippedInaccessible: number;\n    /** Files skipped unread because they exceed maxFileSize. */\n    skippedTooLarge: number;\n    /** Files skipped because they contain a NUL byte (binary). */\n    skippedBinary: number;\n    /**\n     * `StoppedReason` narrowed to the stops these scans can produce: both\n     * resolve the stop through `resolveStopReason` (concurrency.ts) — never\n     * `maxFiles`, which belongs to `replace_text`'s per-file cap.\n     */\n    stoppedReason?: 'maxResults' | 'timeout';\n  };\n}\n\nexport async function searchContent(\n  directory: string,\n  pattern: string,\n  options: SearchContentOptions,\n  pathGuard: PathGuard,\n): Promise<SearchContentOutcome> {\n  const regex = compileRegex(options.isRegex ? pattern || '' : escapeRegExp(pattern || ''), {\n    caseSensitive: Boolean(options.caseSensitive),\n  });\n  try {\n    const matches: SearchResult[] = [];\n    const maxResults = options.maxResults ?? 100;\n    const maxFileSize = getMaxTextFileSize();\n    const context = options.context ?? 0;\n\n    const entries = globEntries({\n      cwd: directory,\n      pattern: options.filePattern ?? '**/*',\n      // Same rule as replace_text, so a search with the same glob previews the\n      // files a replace would touch: a slash-free glob matches at any depth.\n      baseNameMatch: true,\n      includeHidden: Boolean(options.includeHidden),\n      skipIgnored: Boolean(options.skipIgnored),\n      ...(options.signal ? { signal: options.signal } : {}),\n      maxDepth: options.maxDepth ?? 100,\n      suppressErrors: true,\n    });\n\n    let filesScanned = 0;\n    let filesMatched = 0;\n    let matchingLines = 0;\n    let skippedTooLarge = 0;\n    let skippedBinary = 0;\n    const counters = { skippedInaccessible: 0, stoppedByAbort: false };\n\n    for await (const entry of guardedEntries(entries, pathGuard, options.signal, counters)) {\n      if (matches.length >= maxResults) break;\n\n      // Skip oversized files before reading to avoid unbounded memory use. Count\n      // them: \"no matches\" for a reason other than the pattern must be visible.\n      try {\n        const stats = await fsStat(entry.path);\n        if (stats.size > maxFileSize) {\n          skippedTooLarge++;\n          continue;\n        }\n      } catch {\n        counters.skippedInaccessible++;\n        continue;\n      }\n\n      filesScanned++;\n\n      try {\n        const buffer = await readFile(entry.path, { signal: options.signal });\n        // A NUL byte marks a binary file, as it does for `read` and `grep -I`.\n        // Non-UTF-8 text is still searched: a lossy decode only affects the\n        // bytes a pattern could not have matched anyway.\n        if (buffer.includes(0)) {\n          skippedBinary++;\n          continue;\n        }\n        const content = buffer.toString('utf-8');\n        const lines = content.split(/\\r?\\n/u);\n        // A trailing newline splits into a phantom empty last element, and an\n        // empty file splits into one empty element: neither is a line the\n        // file has, for matching or for context.\n        const lineCount =\n          content.length === 0 ? 0 : content.endsWith('\\n') ? lines.length - 1 : lines.length;\n        let matchedFile = false;\n        for (let i = 0; i < lineCount; i++) {\n          const line = lines[i];\n          if (line === undefined) continue;\n          // One scan per line: findLineMatches resets lastIndex itself, so it\n          // doubles as the \"does this line match\" test.\n          const found = findLineMatches(regex, line);\n          if (found) {\n            matchedFile = true;\n            matchingLines++;\n            matches.push({\n              file: entry.path,\n              line: i + 1,\n              column: found.column,\n              content: own(line),\n              matchCount: found.count,\n              ...(context > 0\n                ? {\n                    before: lines.slice(Math.max(0, i - context), i).map(own),\n                    after: lines.slice(i + 1, Math.min(lineCount, i + 1 + context)).map(own),\n                  }\n                : {}),\n            });\n            if (matches.length >= maxResults) break;\n          }\n        }\n        if (matchedFile) filesMatched++;\n      } catch {\n        // A read failure while the signal is aborted IS the abort, not an\n        // unreadable file — stop rather than spend another iteration and then\n        // report a cut-short scan as complete.\n        if (options.signal?.aborted) {\n          counters.stoppedByAbort = true;\n          break;\n        }\n        // unreadable mid-scan (deleted, permission changed): skip the file\n      }\n    }\n\n    // The result cap is the definite cause even when the abort fired on the\n    // same iteration (see the summary type's narrowing note).\n    const stoppedReason = resolveStopReason(matches.length >= maxResults, counters.stoppedByAbort);\n\n    return {\n      basePath: directory,\n      matches,\n      summary: {\n        matchingLines,\n        filesScanned,\n        filesMatched,\n        truncated: stoppedReason !== undefined,\n        skippedInaccessible: counters.skippedInaccessible,\n        skippedTooLarge,\n        skippedBinary,\n        ...(stoppedReason ? { stoppedReason } : {}),\n      },\n    };\n  } finally {\n    freeRegex(regex);\n  }\n}\n\nasync function* guardedEntries(\n  entries: AsyncIterable<GlobEntry>,\n  pathGuard: PathGuard,\n  signal: AbortSignal | undefined,\n  counters: { skippedInaccessible: number; stoppedByAbort: boolean },\n): AsyncGenerator<GlobEntry> {\n  // The signal carries both client cancellation and the tool's search timeout,\n  // so an abort means \"return what we have, marked incomplete\" rather than\n  // throw — but it must never be reported as a finished scan.\n  for await (const entry of entries) {\n    if (signal?.aborted) {\n      counters.stoppedByAbort = true;\n      return;\n    }\n    try {\n      await pathGuard.validateExistingPath(entry.path);\n    } catch {\n      counters.skippedInaccessible++;\n      continue;\n    }\n    yield entry;\n  }\n}\n\nexport async function searchFiles(\n  directory: string,\n  pattern: string,\n  options: {\n    maxResults?: number;\n    includeHidden?: boolean;\n    sortBy?: 'name' | 'path';\n    skipIgnored?: boolean;\n    maxDepth?: number;\n    signal?: AbortSignal;\n  },\n  pathGuard: PathGuard,\n): Promise<{\n  basePath: string;\n  results: { path: string }[];\n  summary: {\n    matched: number;\n    filesScanned: number;\n    truncated: boolean;\n    skippedInaccessible: number;\n    /** Narrowed like SearchContentOutcome's — scans never `maxFiles`. */\n    stoppedReason?: 'maxResults' | 'timeout';\n  };\n}> {\n  const maxResults = options.maxResults ?? 100;\n  const entries = globEntries({\n    cwd: directory,\n    pattern,\n    baseNameMatch: true,\n    includeHidden: Boolean(options.includeHidden),\n    skipIgnored: Boolean(options.skipIgnored),\n    ...(options.signal ? { signal: options.signal } : {}),\n    maxDepth: options.maxDepth ?? 100,\n    suppressErrors: true,\n  });\n  const results: { path: string }[] = [];\n  let filesScanned = 0;\n  const counters = { skippedInaccessible: 0, stoppedByAbort: false };\n\n  for await (const entry of guardedEntries(entries, pathGuard, options.signal, counters)) {\n    if (results.length >= maxResults) break;\n    filesScanned++;\n    results.push({ path: entry.path });\n  }\n\n  // Sorting — only name / path are supported; size / modified were removed\n  // (the glob never collected stats, so they were always undefined).\n  if (options.sortBy === 'name') {\n    results.sort((a, b) => basename(a.path).localeCompare(basename(b.path)));\n  } else {\n    results.sort((a, b) => a.path.localeCompare(b.path));\n  }\n\n  // Same precedence as above: the result cap wins over a same-iteration abort.\n  const stoppedReason = resolveStopReason(results.length >= maxResults, counters.stoppedByAbort);\n\n  return {\n    basePath: directory,\n    results,\n    summary: {\n      matched: results.length,\n      filesScanned,\n      truncated: stoppedReason !== undefined,\n      skippedInaccessible: counters.skippedInaccessible,\n      ...(stoppedReason ? { stoppedReason } : {}),\n    },\n  };\n}\n"]}
+{"version":3,"file":"search.js","sourceRoot":"","sources":["../../src/core/search.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,IAAI,MAAM,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAGrC,OAAO,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAC;AAExC,OAAO,EAAE,0BAA0B,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACjF,OAAO,EAAE,WAAW,EAAkB,MAAM,WAAW,CAAC;AAExD,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,GAAG,EAAE,oBAAoB,EAAE,MAAM,WAAW,CAAC;AAExF;;;;GAIG;AACH,MAAM,GAAG,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;AAgB3E,+EAA+E;AAC/E,MAAM,oBAAoB,GAAG,OAAO,CAAC;AAErC;;;;GAIG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,GAAG,GAAG,CAAC;AAE3C,MAAM,gBAAgB,GAAG,UAAU,CAAC;AACpC,wFAAwF;AACxF,MAAM,eAAe,GAAG,qBAAqB,CAAC;AAC9C,MAAM,EAAE,GAAG,EAAE,CAAC;AAEd;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,YAAY,CAC1B,OAAe,EACf,UAA4D,EAAE;IAE9D,MAAM,KAAK,GAAG,IAAI,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACrF,IAAI,CAAC;QACH,OAAO,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,CAAC,KAAK,YAAY,WAAW,CAAC;YAAE,MAAM,KAAK,CAAC;QACjD,MAAM,IAAI,WAAW,CACnB,GAAG,KAAK,CAAC,OAAO,iEAAiE,EACjF,EAAE,KAAK,EAAE,KAAK,EAAE,CACjB,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,KAAwB;IAChD,MAAM,MAAM,GAAI,KAAsE,EAAE,OAAO,CAAC;IAChG,IAAI,CAAC;QACH,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACrB,CAAC;IAAC,MAAM,CAAC;QACP,+DAA+D;IACjE,CAAC;AACH,CAAC;AAeD,qFAAqF;AACrF,MAAM,eAAe,GAAG,CAAC,IAAY,EAAU,EAAE;AAC/C,0MAA0M;AAC1M,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC;AAEnB;;;;;;;;;;;;;;;GAeG;AACH,MAAM,SAAS,CAAC,CAAC,WAAW,CAAC,KAAY,EAAE,IAAY;IACrD,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;IACpB,0EAA0E;IAC1E,0EAA0E;IAC1E,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,KAA0B,CAAC;IAC/B,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC3C,OAAO,QAAQ,GAAG,KAAK,CAAC,KAAK,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzD,MAAM,MAAM,GACV,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM;gBAChD,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM,CAAC;YACvD,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,QAAQ,EAAE,CAAC;QACb,CAAC;QACD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,SAAS,CAAC;QACxB,MAAM;YACJ,IAAI,EAAE,OAAO;YACb,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACtB,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,KAAK;YACL,GAAG,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM;SAC5B,CAAC;QACF,4EAA4E;QAC5E,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC;IACxF,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CACtB,KAAY,EACZ,IAAY;IAEZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;IAChB,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QAC7C,IAAI,MAAM,KAAK,CAAC,CAAC;YAAE,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;QACxC,KAAK,EAAE,CAAC;QACR,IAAI,KAAK,IAAI,oBAAoB;YAAE,MAAM;IAC3C,CAAC;IACD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;AACnD,CAAC;AAkED,KAAK,UAAU,QAAQ,CAAC,SAAiB,EAAE,OAAoB;IAC7D,IAAI,CAAC;QACH,MAAM,OAAO,CAAC,SAAS,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;IAC1D,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;IAClC,CAAC;IAED,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,KAAK,CAAC,IAAI,GAAG,OAAO,CAAC,WAAW;YAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;IACpE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;IAClC,CAAC;IAED,IAAI,MAAc,CAAC;IACnB,IAAI,CAAC;QACH,MAAM,GAAG,MAAM,QAAQ,CAAC,SAAS,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACjE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO;YAAE,MAAM,KAAK,CAAC;QACzC,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;IAClC,CAAC;IAED,uEAAuE;IACvE,oEAAoE;IACpE,iDAAiD;IACjD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;IAElD,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACzC,IAAI,YAAY,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;QACzC,OAAO,CAAC,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC;QAChC,IAAI,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI;YAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACxF,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACtC,sEAAsE;IACtE,kEAAkE;IAClE,yCAAyC;IACzC,MAAM,SAAS,GACb,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACtF,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,+DAA+D;QAC/D,8CAA8C;QAC9C,MAAM,KAAK,GAAG,eAAe,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACnD,IAAI,KAAK,EAAE,CAAC;YACV,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,CAAC,GAAG,CAAC;gBACX,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC;gBAClB,UAAU,EAAE,KAAK,CAAC,KAAK;gBACvB,GAAG,CAAC,OAAO,CAAC,OAAO,GAAG,CAAC;oBACrB,CAAC,CAAC;wBACE,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;wBACjE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;qBACjF;oBACH,CAAC,CAAC,EAAE,CAAC;aACR,CAAC,CAAC;YACH,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,UAAU;gBAAE,MAAM;QAClD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AACtC,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,SAAiB,EACjB,OAAe,EACf,OAA6B,EAC7B,SAAoB;IAEpB,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IAC7E,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,EAAE;QACjC,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;KAC9C,CAAC,CAAC;IACH,+EAA+E;IAC/E,8EAA8E;IAC9E,6EAA6E;IAC7E,6EAA6E;IAC7E,oCAAoC;IACpC,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,EAAE;QACrC,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;QAC7C,SAAS,EAAE,IAAI;KAChB,CAAC,CAAC;IACH,IAAI,CAAC;QACH,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;QAC7C,MAAM,WAAW,GAAG,kBAAkB,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;QAE3D,MAAM,OAAO,GAAG,OAAO,CAAC,YAAY;YAClC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC;YAClC,CAAC,CAAC,WAAW,CAAC;gBACV,GAAG,EAAE,SAAS;gBACd,OAAO,EAAE,OAAO,CAAC,WAAW,IAAI,MAAM;gBACtC,yEAAyE;gBACzE,uEAAuE;gBACvE,aAAa,EAAE,IAAI;gBACnB,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;gBAC7C,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC;gBACzC,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5D,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrD,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,GAAG;gBACjC,cAAc,EAAE,IAAI;aACrB,CAAC,CAAC;QAEP,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,MAAM,OAAO,GAAgB;YAC3B,SAAS;YACT,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,WAAW;YACX,UAAU;YACV,KAAK;YACL,SAAS;YACT,MAAM;YACN,OAAO;SACR,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC5C,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,MAAM,OAAO,GAAG,MAAM,0BAA0B,CAAC,OAAO,EAAE;YACxD,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,WAAW,EAAE,oBAAoB;YACjC,UAAU,EAAE,GAAG,EAAE,CAAC,SAAS,IAAI,UAAU;YACzC,OAAO,EAAE,GAAG,EAAE;gBACZ,UAAU,EAAE,CAAC;YACf,CAAC;YACD,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;YACxB,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE;gBAC5B,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;gBAC7B,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;gBAChD,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBACzB,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;oBAAE,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;YAChE,CAAC;SACF,CAAC,CAAC;QAEH,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBAClB,KAAK,cAAc;oBACjB,mBAAmB,EAAE,CAAC;oBACtB,MAAM;gBACR,KAAK,UAAU;oBACb,eAAe,EAAE,CAAC;oBAClB,MAAM;gBACR,KAAK,QAAQ;oBACX,YAAY,EAAE,CAAC;oBACf,aAAa,EAAE,CAAC;oBAChB,MAAM;gBACR,KAAK,SAAS;oBACZ,YAAY,EAAE,CAAC;oBACf,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;wBAAE,YAAY,EAAE,CAAC;oBAC5C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;wBACjC,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;4BAAE,MAAM;wBACxC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBACpB,aAAa,EAAE,CAAC;oBAClB,CAAC;oBACD,MAAM;YACV,CAAC;QACH,CAAC;QAED,MAAM,aAAa,GAAG,iBAAiB,CACrC,OAAO,CAAC,MAAM,IAAI,UAAU,EAC5B,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAC1D,CAAC;QAEF,OAAO;YACL,QAAQ,EAAE,SAAS;YACnB,OAAO;YACP,OAAO,EAAE;gBACP,aAAa;gBACb,YAAY;gBACZ,YAAY;gBACZ,SAAS,EAAE,aAAa,KAAK,SAAS;gBACtC,mBAAmB;gBACnB,eAAe;gBACf,aAAa;gBACb,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC5C;SACF,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,SAAS,CAAC,SAAS,CAAC,CAAC;QACrB,SAAS,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED,uFAAuF;AACvF,SAAS,YAAY,CAAC,MAAc,EAAE,MAAc;IAClD,IAAI,MAAM,CAAC,MAAM,GAAG,mBAAmB;QAAE,OAAO,KAAK,CAAC;IACtD,IAAI,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IAChD,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/C,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC;IAC9D,OAAO,IAAI,CAAC;AACd,CAAC;AAED,KAAK,SAAS,CAAC,CAAC,cAAc,CAC5B,OAAiC,EACjC,SAAoB,EACpB,MAA+B,EAC/B,QAAkE;IAElE,6EAA6E;IAC7E,yEAAyE;IACzE,4DAA4D;IAC5D,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAClC,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;YACpB,QAAQ,CAAC,cAAc,GAAG,IAAI,CAAC;YAC/B,OAAO;QACT,CAAC;QACD,IAAI,CAAC;YACH,MAAM,SAAS,CAAC,oBAAoB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC;QAAC,MAAM,CAAC;YACP,QAAQ,CAAC,mBAAmB,EAAE,CAAC;YAC/B,SAAS;QACX,CAAC;QACD,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,SAAiB,EACjB,OAAe,EACf,OAOC,EACD,SAAoB;IAapB,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;IAC7C,MAAM,OAAO,GAAG,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;IAC3D,MAAM,OAAO,GAAG,WAAW,CAAC;QAC1B,GAAG,EAAE,SAAS;QACd,OAAO;QACP,aAAa,EAAE,IAAI;QACnB,aAAa,EAAE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC;QAC7C,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC;QACzC,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5D,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,GAAG;QACjC,cAAc,EAAE,IAAI;KACrB,CAAC,CAAC;IACH,MAAM,OAAO,GAAuB,EAAE,CAAC;IACvC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,QAAQ,GAAG,EAAE,mBAAmB,EAAE,CAAC,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC;IAEnE,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,cAAc,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;QACvF,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;YAAE,MAAM;QACxC,YAAY,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACrC,CAAC;IAED,yEAAyE;IACzE,mEAAmE;IACnE,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAC9B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,6EAA6E;IAC7E,MAAM,aAAa,GAAG,iBAAiB,CAAC,OAAO,CAAC,MAAM,IAAI,UAAU,EAAE,QAAQ,CAAC,cAAc,CAAC,CAAC;IAE/F,OAAO;QACL,QAAQ,EAAE,SAAS;QACnB,OAAO;QACP,OAAO,EAAE;YACP,OAAO,EAAE,OAAO,CAAC,MAAM;YACvB,YAAY;YACZ,SAAS,EAAE,aAAa,KAAK,SAAS;YACtC,mBAAmB,EAAE,QAAQ,CAAC,mBAAmB;YACjD,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC5C;KACF,CAAC;AACJ,CAAC","sourcesContent":["import { stat as fsStat, readFile } from 'node:fs/promises';\nimport { basename } from 'node:path';\n\nimport type { RE2ExecArray } from '@adguard/re2-wasm';\nimport { RE2 } from '@adguard/re2-wasm';\n\nimport { processEntriesConcurrently, resolveStopReason } from './concurrency.ts';\nimport { globEntries, type GlobEntry } from './glob.ts';\nimport type { PathGuard } from './path.ts';\nimport { escapeRegExp, getMaxTextFileSize, MIB, PARALLEL_CONCURRENCY } from './util.ts';\n\n/**\n * A fresh, flat copy of `s`. V8 keeps a substring of a long string as a slice\n * that references its parent, so a kept line would otherwise pin the whole\n * file's text for as long as the match list lives (60 s in the page store).\n */\nconst own = (s: string): string => Buffer.from(s, 'utf8').toString('utf8');\n\ninterface SearchResult {\n  file: string;\n  line: number;\n  /** 0-indexed column of the first occurrence on the line. */\n  column: number;\n  content: string;\n  matchCount: number;\n  /** Up to `context` lines either side of the match; absent when context is 0. */\n  before?: string[];\n  after?: string[];\n}\n\nexport type Regex = RE2;\n\n/** Occurrence-counting bound, so one pathological line cannot spin forever. */\nconst MAX_MATCHES_PER_LINE = 100_000;\n\n/**\n * Largest input one RE2 call may scan as a single string. The input is copied\n * into the same fixed 16 MB wasm heap as the patterns; about 10 MB of input\n * aborts the module. 4 MiB leaves room for the copy and the pattern set.\n */\nexport const RE2_MAX_INPUT_BYTES = 4 * MIB;\n\nconst BUFFER_ANCHOR_RE = /\\\\[AzZ]/u;\n/** `(?i)`, `(?-m)`, `(?s:…)`: inline flags can undo the `m` the prefilter relies on. */\nconst INLINE_FLAGS_RE = /\\(\\?[a-zA-Z-]+[:)]/u;\nconst CR = 13;\n\n/**\n * Compile a pattern on RE2 rather than on V8's irregexp.\n *\n * Patterns arrive from the MCP client, so a backtracking engine would let one\n * request pin the event loop with no way out: an abort signal cannot preempt a\n * synchronous `exec`, and on stdio that wedges the whole server. RE2 matches in\n * time linear in the input and cannot backtrack at all, so the hazard is gone\n * rather than bounded.\n *\n * RE2 rejects the constructs the tool schema documents as unsupported —\n * lookahead, lookbehind, backreferences — with its own {@link SyntaxError},\n * which the tool layer turns into a normal tool error. It always matches in\n * Unicode mode and requires the `u` flag to say so.\n *\n * Every compiled pattern owns memory in re2-wasm's fixed 16 MB heap, which\n * `ALLOW_MEMORY_GROWTH` is off for. re2-wasm never frees it and a\n * FinalizationRegistry does not keep up (V8 sees no pressure from the wasm\n * heap), so exhaustion is an emscripten `abort()` that kills regex search for\n * the rest of the process. Every caller MUST pass the result to\n * {@link freeRegex} when it is done with it.\n */\nexport function compileRegex(\n  pattern: string,\n  options: { caseSensitive?: boolean; multiline?: boolean } = {},\n): Regex {\n  const flags = `g${options.multiline ? 'm' : ''}${options.caseSensitive ? '' : 'i'}u`;\n  try {\n    return new RE2(pattern, flags);\n  } catch (error) {\n    if (!(error instanceof SyntaxError)) throw error;\n    throw new SyntaxError(\n      `${error.message} — lookahead, lookbehind, and backreferences are not supported.`,\n      { cause: error },\n    );\n  }\n}\n\n/**\n * Release a compiled pattern's wasm memory. re2-wasm exposes no disposal of its\n * own, so this reaches the embind handle it holds privately; a version that\n * renames the field degrades to the pre-existing leak rather than throwing.\n * Idempotent — a second call on an already-freed handle is swallowed. Using a\n * {@link Regex} after freeing it is undefined behaviour in the wasm heap, so\n * free only in a `finally` that owns the compile.\n */\nexport function freeRegex(regex: Regex | undefined): void {\n  const handle = (regex as unknown as { wrapper?: { delete?: () => void } } | undefined)?.wrapper;\n  try {\n    handle?.delete?.();\n  } catch {\n    // already deleted, or a re2-wasm build without embind disposal\n  }\n}\n\nexport interface RegexMatch {\n  /** The matched text. */\n  text: string;\n  /** Capture groups, 1-indexed in the pattern, 0-indexed here. */\n  groups: (string | undefined)[];\n  /** Named capture groups, when the pattern declares any. */\n  named: Record<string, string> | undefined;\n  /** Start offset in UTF-16 code units — usable with `String.prototype.slice`. */\n  start: number;\n  /** End offset in UTF-16 code units. */\n  end: number;\n}\n\n/** Code-point length of `text`, i.e. its UTF-16 length minus its surrogate pairs. */\nconst codePointLength = (text: string): number =>\n  // eslint-disable-next-line @typescript-eslint/no-misused-spread -- code points are the intended unit (re2-wasm offsets count code points); grapheme segmentation would change the count, not preserve it.\n  [...text].length;\n\n/**\n * Iterate a global pattern's non-overlapping matches with offsets JS can use.\n *\n * re2-wasm reports `index` and `lastIndex` in **code points**, while every JS\n * string operation indexes in UTF-16 code units. The two agree only until the\n * first astral character (most emoji), past which every offset is short by one\n * per surrogate pair — slicing on the raw index cuts into the middle of\n * neighbouring text. Its `lastIndex` bookkeeping is worse still: it adds the\n * match's UTF-16 length to a code-point index, so an astral character inside a\n * match can skip the next one. This is the single place that corrects both; no\n * caller should read `match.index` or `regex.lastIndex` directly.\n *\n * Zero-length matches (e.g. `a*`) advance by one code point so they cannot loop\n * forever. The regex is global and shared across calls, so `lastIndex` is reset\n * on entry.\n */\nexport function* execMatches(regex: Regex, text: string): Generator<RegexMatch, undefined> {\n  regex.lastIndex = 0;\n  // Cursor into `text`, carried forward across matches: RE2 reports them in\n  // ascending order, so the walk is O(text) in total rather than per match.\n  let cursorCp = 0;\n  let cursorU16 = 0;\n  let match: RE2ExecArray | null;\n  while ((match = regex.exec(text)) !== null) {\n    while (cursorCp < match.index && cursorU16 < text.length) {\n      const isPair =\n        (text.charCodeAt(cursorU16) & 0xfc00) === 0xd800 &&\n        (text.charCodeAt(cursorU16 + 1) & 0xfc00) === 0xdc00;\n      cursorU16 += isPair ? 2 : 1;\n      cursorCp++;\n    }\n    const matched = match[0] ?? '';\n    const start = cursorU16;\n    yield {\n      text: matched,\n      groups: match.slice(1),\n      named: match.groups,\n      start,\n      end: start + matched.length,\n    };\n    // Own the advance rather than trusting the wrapper's mixed-unit arithmetic.\n    regex.lastIndex = match.index + (matched.length === 0 ? 1 : codePointLength(matched));\n  }\n}\n\n/**\n * Find non-overlapping occurrences of a global regex in a single line, reporting\n * the first match's column alongside the count.\n */\nfunction findLineMatches(\n  regex: Regex,\n  line: string,\n): { count: number; column: number } | undefined {\n  let count = 0;\n  let column = -1;\n  for (const match of execMatches(regex, line)) {\n    if (column === -1) column = match.start;\n    count++;\n    if (count >= MAX_MATCHES_PER_LINE) break;\n  }\n  return count > 0 ? { count, column } : undefined;\n}\n\nexport interface SearchContentOptions {\n  caseSensitive?: boolean;\n  isRegex?: boolean;\n  maxResults?: number;\n  filePattern?: string;\n  skipIgnored?: boolean;\n  includeHidden?: boolean;\n  maxDepth?: number;\n  /**\n   * Search exactly this file (absolute, already guard-validated) instead of\n   * walking `directory` with `filePattern`. Set when the caller named a file:\n   * its name must not be interpreted as a glob.\n   */\n  explicitFile?: string;\n  /** Lines of context to carry either side of each match; 0 (default) carries none. */\n  context?: number;\n  signal?: AbortSignal;\n}\n\nexport interface SearchContentOutcome {\n  basePath: string;\n  matches: SearchResult[];\n  summary: {\n    /**\n     * Matching *lines*, one per entry in `matches` — not pattern occurrences.\n     * A line with three occurrences counts once here and reports 3 in its own\n     * `SearchResult.matchCount`.\n     */\n    matchingLines: number;\n    filesScanned: number;\n    filesMatched: number;\n    truncated: boolean;\n    /** Files the guard rejected or that could not be stat'd. */\n    skippedInaccessible: number;\n    /** Files skipped unread because they exceed maxFileSize. */\n    skippedTooLarge: number;\n    /** Files skipped because they contain a NUL byte (binary). */\n    skippedBinary: number;\n    /**\n     * `StoppedReason` narrowed to the stops these scans can produce: both\n     * resolve the stop through `resolveStopReason` (concurrency.ts) — never\n     * `maxFiles`, which belongs to `replace_text`'s per-file cap.\n     */\n    stoppedReason?: 'maxResults' | 'timeout';\n  };\n}\n\ntype FileScan =\n  | { kind: 'inaccessible' }\n  | { kind: 'tooLarge' }\n  | { kind: 'binary' }\n  | { kind: 'scanned'; matches: SearchResult[] };\n\ninterface ScanContext {\n  pathGuard: PathGuard;\n  signal: AbortSignal | undefined;\n  maxFileSize: number;\n  maxResults: number;\n  regex: Regex;\n  prefilter: Regex;\n  source: string;\n  context: number;\n}\n\nasync function scanFile(entryPath: string, scanCtx: ScanContext): Promise<FileScan> {\n  try {\n    await scanCtx.pathGuard.validateExistingPath(entryPath);\n  } catch {\n    return { kind: 'inaccessible' };\n  }\n\n  try {\n    const stats = await fsStat(entryPath);\n    if (stats.size > scanCtx.maxFileSize) return { kind: 'tooLarge' };\n  } catch {\n    return { kind: 'inaccessible' };\n  }\n\n  let buffer: Buffer;\n  try {\n    buffer = await readFile(entryPath, { signal: scanCtx.signal });\n  } catch (error) {\n    if (scanCtx.signal?.aborted) throw error;\n    return { kind: 'inaccessible' };\n  }\n\n  // A NUL byte marks a binary file, as it does for `read` and `grep -I`.\n  // Non-UTF-8 text is still searched: a lossy decode only affects the\n  // bytes a pattern could not have matched anyway.\n  if (buffer.includes(0)) return { kind: 'binary' };\n\n  const content = buffer.toString('utf-8');\n  if (canPrefilter(scanCtx.source, buffer)) {\n    scanCtx.prefilter.lastIndex = 0;\n    if (scanCtx.prefilter.exec(content) === null) return { kind: 'scanned', matches: [] };\n  }\n\n  const lines = content.split(/\\r?\\n/u);\n  // A trailing newline splits into a phantom empty last element, and an\n  // empty file splits into one empty element: neither is a line the\n  // file has, for matching or for context.\n  const lineCount =\n    content.length === 0 ? 0 : content.endsWith('\\n') ? lines.length - 1 : lines.length;\n  const matches: SearchResult[] = [];\n  for (let i = 0; i < lineCount; i++) {\n    const line = lines[i];\n    if (line === undefined) continue;\n    // One scan per line: the helper resets lastIndex itself, so it\n    // doubles as the \"does this line match\" test.\n    const found = findLineMatches(scanCtx.regex, line);\n    if (found) {\n      matches.push({\n        file: entryPath,\n        line: i + 1,\n        column: found.column,\n        content: own(line),\n        matchCount: found.count,\n        ...(scanCtx.context > 0\n          ? {\n              before: lines.slice(Math.max(0, i - scanCtx.context), i).map(own),\n              after: lines.slice(i + 1, Math.min(lineCount, i + 1 + scanCtx.context)).map(own),\n            }\n          : {}),\n      });\n      if (matches.length >= scanCtx.maxResults) break;\n    }\n  }\n  return { kind: 'scanned', matches };\n}\n\nexport async function searchContent(\n  directory: string,\n  pattern: string,\n  options: SearchContentOptions,\n  pathGuard: PathGuard,\n): Promise<SearchContentOutcome> {\n  const source = options.isRegex ? pattern || '' : escapeRegExp(pattern || '');\n  const regex = compileRegex(source, {\n    caseSensitive: Boolean(options.caseSensitive),\n  });\n  // Whole-buffer test: `m` makes ^/$ line-relative so a per-line hit is always a\n  // buffer hit (the converse can be false — a false positive just falls through\n  // to the per-line scan). \\A/\\z/\\Z are buffer-relative even under `m`, inline\n  // flag groups can undo `m`, and $ cannot see past a \\r, so those inputs skip\n  // the prefilter (see canPrefilter).\n  const prefilter = compileRegex(source, {\n    caseSensitive: Boolean(options.caseSensitive),\n    multiline: true,\n  });\n  try {\n    const matches: SearchResult[] = [];\n    const maxResults = options.maxResults ?? 100;\n    const maxFileSize = getMaxTextFileSize();\n    const context = options.context ?? 0;\n    const ceiling = pathGuard.allowedRootContaining(directory);\n\n    const entries = options.explicitFile\n      ? [{ path: options.explicitFile }]\n      : globEntries({\n          cwd: directory,\n          pattern: options.filePattern ?? '**/*',\n          // Same rule as replace_text, so a search with the same glob previews the\n          // files a replace would touch: a slash-free glob matches at any depth.\n          baseNameMatch: true,\n          includeHidden: Boolean(options.includeHidden),\n          skipIgnored: Boolean(options.skipIgnored),\n          ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),\n          ...(options.signal ? { signal: options.signal } : {}),\n          maxDepth: options.maxDepth ?? 100,\n          suppressErrors: true,\n        });\n\n    let filesScanned = 0;\n    let filesMatched = 0;\n    let matchingLines = 0;\n    let skippedTooLarge = 0;\n    let skippedBinary = 0;\n    const scanCtx: ScanContext = {\n      pathGuard,\n      signal: options.signal,\n      maxFileSize,\n      maxResults,\n      regex,\n      prefilter,\n      source,\n      context,\n    };\n    const perFile = new Map<number, FileScan>();\n    let dispatched = 0;\n    let collected = 0;\n    const stopped = await processEntriesConcurrently(entries, {\n      signal: options.signal,\n      concurrency: PARALLEL_CONCURRENCY,\n      shouldStop: () => collected >= maxResults,\n      onEntry: () => {\n        dispatched++;\n      },\n      onError: () => undefined,\n      runEntry: async (entryPath) => {\n        const index = dispatched - 1;\n        const scan = await scanFile(entryPath, scanCtx);\n        perFile.set(index, scan);\n        if (scan.kind === 'scanned') collected += scan.matches.length;\n      },\n    });\n\n    let skippedInaccessible = 0;\n    for (let i = 0; i < dispatched; i++) {\n      const scan = perFile.get(i);\n      if (!scan) continue;\n      switch (scan.kind) {\n        case 'inaccessible':\n          skippedInaccessible++;\n          break;\n        case 'tooLarge':\n          skippedTooLarge++;\n          break;\n        case 'binary':\n          filesScanned++;\n          skippedBinary++;\n          break;\n        case 'scanned':\n          filesScanned++;\n          if (scan.matches.length > 0) filesMatched++;\n          for (const match of scan.matches) {\n            if (matches.length >= maxResults) break;\n            matches.push(match);\n            matchingLines++;\n          }\n          break;\n      }\n    }\n\n    const stoppedReason = resolveStopReason(\n      matches.length >= maxResults,\n      stopped === 'timeout' || Boolean(options.signal?.aborted),\n    );\n\n    return {\n      basePath: directory,\n      matches,\n      summary: {\n        matchingLines,\n        filesScanned,\n        filesMatched,\n        truncated: stoppedReason !== undefined,\n        skippedInaccessible,\n        skippedTooLarge,\n        skippedBinary,\n        ...(stoppedReason ? { stoppedReason } : {}),\n      },\n    };\n  } finally {\n    freeRegex(prefilter);\n    freeRegex(regex);\n  }\n}\n\n/** Whether one whole-buffer RE2 test is a sound \"cannot match\" check for this file. */\nfunction canPrefilter(source: string, buffer: Buffer): boolean {\n  if (buffer.length > RE2_MAX_INPUT_BYTES) return false;\n  if (BUFFER_ANCHOR_RE.test(source)) return false;\n  if (INLINE_FLAGS_RE.test(source)) return false;\n  if (source.includes('$') && buffer.includes(CR)) return false;\n  return true;\n}\n\nasync function* guardedEntries(\n  entries: AsyncIterable<GlobEntry>,\n  pathGuard: PathGuard,\n  signal: AbortSignal | undefined,\n  counters: { skippedInaccessible: number; stoppedByAbort: boolean },\n): AsyncGenerator<GlobEntry> {\n  // The signal carries both client cancellation and the tool's search timeout,\n  // so an abort means \"return what we have, marked incomplete\" rather than\n  // throw — but it must never be reported as a finished scan.\n  for await (const entry of entries) {\n    if (signal?.aborted) {\n      counters.stoppedByAbort = true;\n      return;\n    }\n    try {\n      await pathGuard.validateExistingPath(entry.path);\n    } catch {\n      counters.skippedInaccessible++;\n      continue;\n    }\n    yield entry;\n  }\n}\n\nexport async function searchFiles(\n  directory: string,\n  pattern: string,\n  options: {\n    maxResults?: number;\n    includeHidden?: boolean;\n    sortBy?: 'name' | 'path';\n    skipIgnored?: boolean;\n    maxDepth?: number;\n    signal?: AbortSignal;\n  },\n  pathGuard: PathGuard,\n): Promise<{\n  basePath: string;\n  results: { path: string }[];\n  summary: {\n    matched: number;\n    filesScanned: number;\n    truncated: boolean;\n    skippedInaccessible: number;\n    /** Narrowed like SearchContentOutcome's — scans never `maxFiles`. */\n    stoppedReason?: 'maxResults' | 'timeout';\n  };\n}> {\n  const maxResults = options.maxResults ?? 100;\n  const ceiling = pathGuard.allowedRootContaining(directory);\n  const entries = globEntries({\n    cwd: directory,\n    pattern,\n    baseNameMatch: true,\n    includeHidden: Boolean(options.includeHidden),\n    skipIgnored: Boolean(options.skipIgnored),\n    ...(ceiling !== undefined ? { ignoreCeiling: ceiling } : {}),\n    ...(options.signal ? { signal: options.signal } : {}),\n    maxDepth: options.maxDepth ?? 100,\n    suppressErrors: true,\n  });\n  const results: { path: string }[] = [];\n  let filesScanned = 0;\n  const counters = { skippedInaccessible: 0, stoppedByAbort: false };\n\n  for await (const entry of guardedEntries(entries, pathGuard, options.signal, counters)) {\n    if (results.length >= maxResults) break;\n    filesScanned++;\n    results.push({ path: entry.path });\n  }\n\n  // Sorting — only name / path are supported; size / modified were removed\n  // (the glob never collected stats, so they were always undefined).\n  if (options.sortBy === 'name') {\n    results.sort((a, b) => basename(a.path).localeCompare(basename(b.path)));\n  } else {\n    results.sort((a, b) => a.path.localeCompare(b.path));\n  }\n\n  // Same precedence as above: the result cap wins over a same-iteration abort.\n  const stoppedReason = resolveStopReason(results.length >= maxResults, counters.stoppedByAbort);\n\n  return {\n    basePath: directory,\n    results,\n    summary: {\n      matched: results.length,\n      filesScanned,\n      truncated: stoppedReason !== undefined,\n      skippedInaccessible: counters.skippedInaccessible,\n      ...(stoppedReason ? { stoppedReason } : {}),\n    },\n  };\n}\n"]}

package/dist/core/store.d.ts

@@ -5,6 +5,7 @@ interface ResourceEntry {
     name: string;
     mimeType: string;
     size: number;
+    createdAt: string;
     expiresAt: string;
     text: string;
 }
@@ -54,20 +55,15 @@ export declare function invalidCursor(): FsError;
  * Short-lived snapshots of a completed query's full result set, so later pages
  * slice a stored array instead of re-scanning and re-sorting the filesystem.
  *
- * ponytail: bounded by snapshot count and TTL, not by bytes — 32 x 20,000
- * `list` entries or 32 x 10,000 `search_text` matches, each match retaining up
- * to 20 more line strings at `context: 10`, order of a few hundred MB held for
- * 60s, and the HTTP leg shares one store so any caller can drive it. If that
- * shows up as memory pressure, pass a byte weight to `set` the way
- * `ResourceStore` does.
+ * ponytail: bounded by snapshot count and TTL, not by bytes — MAX_SNAPSHOTS x
+ * 20,000 `list` entries or MAX_SNAPSHOTS x 10,000 `search_text` matches, each
+ * match retaining up to 20 more line strings at `context: 10`, order of a few
+ * hundred MB held for 60s, and the HTTP leg shares one store so any caller can
+ * drive it. If that shows up as memory pressure, pass a byte weight to `set`
+ * the way `ResourceStore` does.
  */
 export declare class PageSnapshotStore {
     #private;
-    constructor(options?: {
-        maxSnapshots?: number;
-        ttlMs?: number;
-        now?: () => number;
-    });
     create(params: {
         queryKey: string;
         items: readonly unknown[];

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

@@ -1 +1 @@
-{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/core/store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAIjE,OAAO,EAAa,OAAO,EAAE,MAAM,aAAa,CAAC;AAqFjD,UAAU,aAAa;IACrB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;CACd;AAOD,qBAAa,aAAa;;gBAQZ,aAAa,CAAC,EAAE,MAAM,IAAI;IAItC,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,aAAa;IAYpC,OAAO,CAAC,MAAM,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,GAAG,aAAa;IAmBjF;;;;OAIG;IACH,IAAI,IAAI,MAAM,EAAE;CAGjB;AAED,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE;QACL,GAAG,EAAE,MAAM,CAAC;QACZ,IAAI,EAAE,MAAM,CAAC;QACb,QAAQ,EAAE,MAAM,CAAC;QACjB,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC;IACF,IAAI,EAAE,YAAY,CAAC;CACpB;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,MAAM,EAIZ,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,OAAO,EAAE,GAClD,kBAAkB,CAuBpB;AAID,MAAM,WAAW,YAAY,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,OAAO;IACpD,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;CACtB;AAED;;;;GAIG;AACH,wBAAgB,aAAa,IAAI,OAAO,CAKvC;AAED;;;;;;;;;;GAUG;AACH,qBAAa,iBAAiB;;gBAGhB,OAAO,GAAE;QAAE,YAAY,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,MAAM,CAAA;KAAO;IAQvF,MAAM,CAAC,MAAM,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,SAAS,OAAO,EAAE,CAAC;QAAC,QAAQ,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,MAAM;IAU3F,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC;IAMhF,KAAK,IAAI,IAAI;CAGd"}
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/core/store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAIjE,OAAO,EAAa,OAAO,EAAE,MAAM,aAAa,CAAC;AAmFjD,UAAU,aAAa;IACrB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;CACd;AAOD,qBAAa,aAAa;;gBAQZ,aAAa,CAAC,EAAE,MAAM,IAAI;IAItC,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,aAAa;IAYpC,OAAO,CAAC,MAAM,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,GAAG,aAAa;IAqBjF;;;;OAIG;IACH,IAAI,IAAI,MAAM,EAAE;CAGjB;AAED,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE;QACL,GAAG,EAAE,MAAM,CAAC;QACZ,IAAI,EAAE,MAAM,CAAC;QACb,QAAQ,EAAE,MAAM,CAAC;QACjB,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC;IACF,IAAI,EAAE,YAAY,CAAC;CACpB;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,MAAM,EAIZ,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,OAAO,EAAE,GAClD,kBAAkB,CAwBpB;AAID,MAAM,WAAW,YAAY,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,OAAO;IACpD,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;CACtB;AAED;;;;GAIG;AACH,wBAAgB,aAAa,IAAI,OAAO,CAKvC;AAID;;;;;;;;;;GAUG;AACH,qBAAa,iBAAiB;;IAM5B,MAAM,CAAC,MAAM,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,SAAS,OAAO,EAAE,CAAC;QAAC,QAAQ,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,MAAM;IAU3F,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC;IAMhF,KAAK,IAAI,IAAI;CAGd"}

package/dist/core/store.js

@@ -12,17 +12,15 @@ class TtlLru {
     #maxEntries;
     #maxWeight;
     #ttlMs;
-    #now;
     #weight = 0;
     constructor(opts) {
         this.#maxEntries = opts.maxEntries;
         this.#maxWeight = opts.maxWeight ?? Number.POSITIVE_INFINITY;
         this.#ttlMs = opts.ttlMs;
-        this.#now = opts.now ?? Date.now;
     }
     /** Drop every expired entry; true when at least one went. */
     prune() {
-        const now = this.#now();
+        const now = Date.now();
         const before = this.#byKey.size;
         for (const [key, entry] of this.#byKey) {
             if (entry.expiresAt <= now)
@@ -35,7 +33,7 @@ class TtlLru {
         const entry = this.#byKey.get(key);
         if (!entry)
             return undefined;
-        if (entry.expiresAt <= this.#now()) {
+        if (entry.expiresAt <= Date.now()) {
             this.delete(key);
             return undefined;
         }
@@ -47,7 +45,7 @@ class TtlLru {
     set(key, value, weight = 0) {
         this.prune();
         this.delete(key);
-        this.#byKey.set(key, { value, expiresAt: this.#now() + this.#ttlMs, weight });
+        this.#byKey.set(key, { value, expiresAt: Date.now() + this.#ttlMs, weight });
         this.#weight += weight;
         while (this.#byKey.size > 0 &&
             (this.#byKey.size > this.#maxEntries || this.#weight > this.#maxWeight)) {
@@ -105,12 +103,14 @@ export class ResourceStore {
                 this.#onListChanged?.();
             throw new FsError(ErrorCode.TOO_LARGE, `Resource too large to cache (${entryBytes} bytes).`);
         }
+        const now = Date.now();
         const entry = {
             uri: `filesystem-mcp://result/${randomUUID()}`,
             name: params.name,
             mimeType: params.mimeType ?? 'text/plain',
             size: entryBytes,
-            expiresAt: new Date(Date.now() + ENTRY_TTL_MS).toISOString(),
+            createdAt: new Date(now).toISOString(),
+            expiresAt: new Date(now + ENTRY_TTL_MS).toISOString(),
             text: params.text,
         };
         this.#entries.set(entry.uri, entry, entryBytes);
@@ -153,9 +153,10 @@ value) {
             type: 'resource_link',
             uri: entry.uri,
             name: entry.name,
+            description: `Cached tool result; expires ${entry.expiresAt}`,
             mimeType: entry.mimeType,
             size: entry.size,
-            annotations: { audience: ['user'] },
+            annotations: { audience: ['user'], lastModified: entry.createdAt },
         },
     };
 }
@@ -167,26 +168,23 @@ value) {
 export function invalidCursor() {
     return new FsError(ErrorCode.INVALID_INPUT, 'Invalid cursor. Request the first page without a cursor.');
 }
+const MAX_SNAPSHOTS = 32;
 /**
  * Short-lived snapshots of a completed query's full result set, so later pages
  * slice a stored array instead of re-scanning and re-sorting the filesystem.
  *
- * ponytail: bounded by snapshot count and TTL, not by bytes — 32 x 20,000
- * `list` entries or 32 x 10,000 `search_text` matches, each match retaining up
- * to 20 more line strings at `context: 10`, order of a few hundred MB held for
- * 60s, and the HTTP leg shares one store so any caller can drive it. If that
- * shows up as memory pressure, pass a byte weight to `set` the way
- * `ResourceStore` does.
+ * ponytail: bounded by snapshot count and TTL, not by bytes — MAX_SNAPSHOTS x
+ * 20,000 `list` entries or MAX_SNAPSHOTS x 10,000 `search_text` matches, each
+ * match retaining up to 20 more line strings at `context: 10`, order of a few
+ * hundred MB held for 60s, and the HTTP leg shares one store so any caller can
+ * drive it. If that shows up as memory pressure, pass a byte weight to `set`
+ * the way `ResourceStore` does.
  */
 export class PageSnapshotStore {
-    #byId;
-    constructor(options = {}) {
-        this.#byId = new TtlLru({
-            maxEntries: options.maxSnapshots ?? 32,
-            ttlMs: options.ttlMs ?? 60 * 1000,
-            ...(options.now ? { now: options.now } : {}),
-        });
-    }
+    #byId = new TtlLru({
+        maxEntries: MAX_SNAPSHOTS,
+        ttlMs: ENTRY_TTL_MS,
+    });
     create(params) {
         const snapshotId = randomUUID();
         this.#byId.set(snapshotId, {