@j0hanz/filesystem-mcp 2.7.0 → 2.7.1

package/README.md

@@ -321,7 +321,7 @@ result store, while file-resource links point directly to guarded reads from dis
 | `src/core/path.ts`    | `PathGuard` — validates every path against allowed roots                        |
 | `src/core/fs.ts`      | `GuardedFileSystem` — guarded filesystem facade                                 |
 | `src/tools/define.ts` | Tool registration and execution framework                                       |
-| `src/tools/batch.ts`  | Batch helpers (runOverPaths, isTotalFailure)                                    |
+| `src/tools/batch.ts`  | Batch helpers (runOverPaths, summarize, isTotalFailure)                         |
 | `src/server.ts`       | Builds shared dependencies and invokes the three registrars                     |
 | `src/transport/`      | stdio (`stdio.ts`), Streamable HTTP (`http.ts`), HTTP policy (`http-policy.ts`) |
 

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

@@ -1 +1 @@
-{"version":3,"file":"concurrency.d.ts","sourceRoot":"","sources":["../../src/core/concurrency.ts"],"names":[],"mappings":"AAGA,MAAM,MAAM,aAAa,GAAG,YAAY,GAAG,UAAU,GAAG,SAAS,CAAC;AAElE,4GAA4G;AAC5G,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,OAAO,GACf,YAAY,GAAG,SAAS,GAAG,SAAS,CAEtC;AAED,UAAU,cAAc,CAAC,CAAC;IACxB,OAAO,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,EAAE,CAAC;IACvC,MAAM,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,EAAE,CAAC;CAC3C;AAED,wBAAsB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAC1C,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,EACjD,WAAW,GAAE,MAA6B,EAC1C,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAgE5B;AAED;;;;;;;;;;GAUG;AACH,wBAAsB,0BAA0B,CAC9C,OAAO,EAAE,aAAa,CAAC;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,QAAQ,CAAC;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,EACrE,OAAO,EAAE;IACP,MAAM,EAAE,WAAW,GAAG,SAAS,CAAC;IAChC,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,OAAO,CAAC;IAC3B,OAAO,EAAE,MAAM,IAAI,CAAC;IACpB,OAAO,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,KAAK,IAAI,CAAC;IACpD,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;CAChD,GACA,OAAO,CAAC,aAAa,GAAG,SAAS,CAAC,CA0DpC;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAmBlF"}
+{"version":3,"file":"concurrency.d.ts","sourceRoot":"","sources":["../../src/core/concurrency.ts"],"names":[],"mappings":"AAGA,MAAM,MAAM,aAAa,GAAG,YAAY,GAAG,UAAU,GAAG,SAAS,CAAC;AAElE,4GAA4G;AAC5G,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,OAAO,GACf,YAAY,GAAG,SAAS,GAAG,SAAS,CAEtC;AAED,UAAU,cAAc,CAAC,CAAC;IACxB,OAAO,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,EAAE,CAAC;IACvC,MAAM,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,EAAE,CAAC;CAC3C;AAED,wBAAsB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAC1C,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,EACjD,WAAW,GAAE,MAA6B,EAC1C,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAgE5B;AAED;;;;;;;;;;GAUG;AACH,wBAAsB,0BAA0B,CAC9C,OAAO,EAAE,aAAa,CAAC;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,QAAQ,CAAC;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,EACrE,OAAO,EAAE;IACP,MAAM,EAAE,WAAW,GAAG,SAAS,CAAC;IAChC,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,OAAO,CAAC;IAC3B,OAAO,EAAE,MAAM,IAAI,CAAC;IACpB,OAAO,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,KAAK,IAAI,CAAC;IACpD,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;CAChD,GACA,OAAO,CAAC,aAAa,GAAG,SAAS,CAAC,CAuEpC;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAmBlF"}

package/dist/core/concurrency.js

@@ -84,49 +84,65 @@ export async function processEntriesConcurrently(entries, options) {
             return;
         await Promise.race(pending);
     };
-    for await (const entry of entries) {
-        // The signal is cancellation OR the caller's timeout: stop dispatching and
-        // let the caller report the run as incomplete rather than as a full sweep.
-        if (signal?.aborted) {
-            stoppedReason = 'timeout';
-            break;
-        }
-        if (maxEntries !== undefined && dispatched >= maxEntries) {
-            stoppedReason = 'maxFiles';
-            break;
-        }
-        // Check the result cap before waiting for a slot so an in-flight task that
-        // already crossed the cap stops dispatch without an extra wait...
-        if (shouldStop?.()) {
-            stoppedReason = 'maxResults';
-            break;
+    let walkFailed = false;
+    let walkError;
+    try {
+        for await (const entry of entries) {
+            // The signal is cancellation OR the caller's timeout: stop dispatching and
+            // let the caller report the run as incomplete rather than as a full sweep.
+            if (signal?.aborted) {
+                stoppedReason = 'timeout';
+                break;
+            }
+            if (maxEntries !== undefined && dispatched >= maxEntries) {
+                stoppedReason = 'maxFiles';
+                break;
+            }
+            // Check the result cap before waiting for a slot so an in-flight task that
+            // already crossed the cap stops dispatch without an extra wait...
+            if (shouldStop?.()) {
+                stoppedReason = 'maxResults';
+                break;
+            }
+            await waitForSlot();
+            // ...and again after the slot frees, since tasks settle concurrently. The
+            // cap can still be exceeded by at most `concurrency - 1` already-dispatched
+            // tasks that are mid-flight; that overrun is inherent to concurrent dispatch.
+            if (shouldStop?.()) {
+                stoppedReason = 'maxResults';
+                break;
+            }
+            onEntry();
+            dispatched++;
+            // Track a non-rejecting wrapper so a rejected task can never propagate out of
+            // Promise.race(pending) in waitForSlot() and abort the loop before the final
+            // drain below (which would silently abandon other in-flight tasks).
+            // runEntry is expected to catch its own errors; if it unexpectedly throws,
+            // record it as a failure rather than silently dropping it.
+            const tracked = runEntry(entry.path).catch((err) => {
+                onError?.(entry.path, err);
+            });
+            pending.add(tracked);
+            void tracked.finally(() => {
+                pending.delete(tracked);
+            });
         }
-        await waitForSlot();
-        // ...and again after the slot frees, since tasks settle concurrently. The
-        // cap can still be exceeded by at most `concurrency - 1` already-dispatched
-        // tasks that are mid-flight; that overrun is inherent to concurrent dispatch.
-        if (shouldStop?.()) {
-            stoppedReason = 'maxResults';
-            break;
+    }
+    catch (error) {
+        // A walk the signal cut short throws its reason (see globEntries): that is
+        // the same timeout as the check above, not a failed walk.
+        if (signal?.aborted)
+            stoppedReason = 'timeout';
+        else {
+            walkFailed = true;
+            walkError = error;
         }
-        onEntry();
-        dispatched++;
-        // Track a non-rejecting wrapper so a rejected task can never propagate out of
-        // Promise.race(pending) in waitForSlot() and abort the loop before the final
-        // drain below (which would silently abandon other in-flight tasks).
-        // runEntry is expected to catch its own errors; if it unexpectedly throws,
-        // record it as a failure rather than silently dropping it.
-        const tracked = runEntry(entry.path).catch((err) => {
-            onError?.(entry.path, err);
-        });
-        pending.add(tracked);
-        void tracked.finally(() => {
-            pending.delete(tracked);
-        });
     }
     if (pending.size > 0) {
         await Promise.allSettled([...pending]);
     }
+    if (walkFailed)
+        throw walkError;
     return stoppedReason;
 }
 export function withAbort(promise, signal) {

package/dist/core/concurrency.js.map

@@ -1 +1 @@
-{"version":3,"file":"concurrency.js","sourceRoot":"","sources":["../../src/core/concurrency.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AACpD,OAAO,EAAE,oBAAoB,EAAE,MAAM,WAAW,CAAC;AAIjD,4GAA4G;AAC5G,MAAM,UAAU,iBAAiB,CAC/B,MAAe,EACf,OAAgB;IAEhB,OAAO,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;AACjE,CAAC;AAOD,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,KAAmB,EACnB,SAAiD,EACjD,cAAsB,oBAAoB,EAC1C,MAAoB;IAEpB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAC/B,IAAI,SAAS,KAAK,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAExD,MAAM,OAAO,GAAkC,EAAE,CAAC;IAClD,MAAM,MAAM,GAAsC,EAAE,CAAC;IAErD,MAAM,EAAE,cAAc,EAAE,CAAC;IAEzB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,sEAAsE;IACtE,mEAAmE;IACnE,wEAAwE;IACxE,8DAA8D;IAC9D,IAAI,SAAS,GAAG,KAAgB,CAAC;IAEjC,MAAM,IAAI,GAAG,KAAK,IAAmB,EAAE;QACrC,OAAO,SAAS,GAAG,SAAS,EAAE,CAAC;YAC7B,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;gBACpB,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM,CAAC,cAAc,EAAE,CAAC;YAC1B,CAAC;YAED,MAAM,KAAK,GAAG,SAAS,CAAC;YACxB,SAAS,IAAI,CAAC,CAAC;YACf,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAC1B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,SAAS;YACX,CAAC;YAED,IAAI,CAAC;gBACH,gEAAgE;gBAChE,gEAAgE;gBAChE,6DAA6D;gBAC7D,iDAAiD;gBACjD,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBAC3C,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;YACjC,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC;oBACV,KAAK;oBACL,KAAK,EAAE,qBAAqB,CAAC,KAAK,CAAC;iBACpC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACrD,MAAM,OAAO,GAAoB,IAAI,KAAK,CAAgB,WAAW,CAAC,CAAC;IACvE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,WAAW,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACpD,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,EAAE,CAAC;IAC1B,CAAC;IAED,MAAM,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAClC,uEAAuE;IACvE,sEAAsE;IACtE,uEAAuE;IACvE,iEAAiE;IACjE,uEAAuE;IACvE,qEAAqE;IACrE,2BAA2B;IAC3B,IAAI,SAAS;QAAE,MAAM,EAAE,cAAc,EAAE,CAAC;IAExC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IACxD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAC7B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,0BAA0B,CAC9C,OAAqE,EACrE,OAQC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAC;IACzC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;IAC5F,IAAI,aAAwC,CAAC;IAC7C,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,MAAM,WAAW,GAAG,KAAK,IAAmB,EAAE;QAC5C,IAAI,OAAO,CAAC,IAAI,GAAG,WAAW;YAAE,OAAO;QACvC,MAAM,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC,CAAC;IAEF,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAClC,2EAA2E;QAC3E,2EAA2E;QAC3E,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;YACpB,aAAa,GAAG,SAAS,CAAC;YAC1B,MAAM;QACR,CAAC;QACD,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;YACzD,aAAa,GAAG,UAAU,CAAC;YAC3B,MAAM;QACR,CAAC;QACD,2EAA2E;QAC3E,kEAAkE;QAClE,IAAI,UAAU,EAAE,EAAE,EAAE,CAAC;YACnB,aAAa,GAAG,YAAY,CAAC;YAC7B,MAAM;QACR,CAAC;QACD,MAAM,WAAW,EAAE,CAAC;QACpB,0EAA0E;QAC1E,4EAA4E;QAC5E,8EAA8E;QAC9E,IAAI,UAAU,EAAE,EAAE,EAAE,CAAC;YACnB,aAAa,GAAG,YAAY,CAAC;YAC7B,MAAM;QACR,CAAC;QACD,OAAO,EAAE,CAAC;QACV,UAAU,EAAE,CAAC;QAEb,8EAA8E;QAC9E,6EAA6E;QAC7E,oEAAoE;QACpE,2EAA2E;QAC3E,2DAA2D;QAC3D,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,GAAY,EAAE,EAAE;YAC1D,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACrB,KAAK,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE;YACxB,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,aAAa,CAAC;AACvB,CAAC;AAED,MAAM,UAAU,SAAS,CAAI,OAAmB,EAAE,MAAoB;IACpE,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,MAAM,CAAC,cAAc,EAAE,CAAC;IACxB,IAAI,OAAiC,CAAC;IACtC,OAAO,OAAO,CAAC,IAAI,CAAC;QAClB,OAAO;QACP,IAAI,OAAO,CAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;YAC/B,OAAO,GAAG,GAAG,EAAE;gBACb,MAAM,CAAC,MAAM,CAAC,MAAM,YAAY,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC,CAAC;YAC1F,CAAC,CAAC;YACF,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5D,CAAC,CAAC;KACH,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;QACd,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["import { normalizeUnknownError } from './errors.ts';\nimport { PARALLEL_CONCURRENCY } from './util.ts';\n\nexport type StoppedReason = 'maxResults' | 'maxFiles' | 'timeout';\n\n/** The one precedence both scans share: the result cap wins over an abort that fired the same iteration. */\nexport function resolveStopReason(\n  hitCap: boolean,\n  aborted: boolean,\n): 'maxResults' | 'timeout' | undefined {\n  return hitCap ? 'maxResults' : aborted ? 'timeout' : undefined;\n}\n\ninterface ParallelResult<R> {\n  results: { index: number; value: R }[];\n  errors: { index: number; error: Error }[];\n}\n\nexport async function processInParallel<T, R>(\n  items: readonly T[],\n  processor: (item: T, index: number) => Promise<R>,\n  concurrency: number = PARALLEL_CONCURRENCY,\n  signal?: AbortSignal,\n): Promise<ParallelResult<R>> {\n  const itemCount = items.length;\n  if (itemCount === 0) return { results: [], errors: [] };\n\n  const results: { index: number; value: R }[] = [];\n  const errors: { index: number; error: Error }[] = [];\n\n  signal?.throwIfAborted();\n\n  let nextIndex = 0;\n  // Set when a worker saw the signal fire before an item ran — the only\n  // shape in which the batch is genuinely incomplete. The annotation\n  // matters: without it control-flow analysis keeps the `false` narrowing\n  // from the initializer and cannot see the closure assignment.\n  let truncated = false as boolean;\n\n  const next = async (): Promise<void> => {\n    while (nextIndex < itemCount) {\n      if (signal?.aborted) {\n        truncated = true;\n        signal.throwIfAborted();\n      }\n\n      const index = nextIndex;\n      nextIndex += 1;\n      const item = items[index];\n      if (item === undefined) {\n        continue;\n      }\n\n      try {\n        // No abort check after the processor: once an item has run, its\n        // result is real work that a write caller may have committed to\n        // disk. Discarding it here would report a finished append as\n        // failed, and a client retry would append twice.\n        const value = await processor(item, index);\n        results.push({ index, value });\n      } catch (error) {\n        errors.push({\n          index,\n          error: normalizeUnknownError(error),\n        });\n      }\n    }\n  };\n\n  const workerCount = Math.min(itemCount, concurrency);\n  const workers: Promise<void>[] = new Array<Promise<void>>(workerCount);\n  for (let index = 0; index < workerCount; index += 1) {\n    workers[index] = next();\n  }\n\n  await Promise.allSettled(workers);\n  // A deadline (AbortSignal.timeout) hit during the run surfaces here as\n  // signal.reason — a TimeoutError — rather than a fresh AbortError, so\n  // callers see TIMEOUT, not CANCELLED. Only a run that actually skipped\n  // items reports the abort: a deadline firing after the last item\n  // finished leaves a complete batch, and returning it beats telling the\n  // caller that committed writes failed. The per-item throws above are\n  // swallowed by allSettled.\n  if (truncated) signal?.throwIfAborted();\n\n  results.sort((left, right) => left.index - right.index);\n  return { results, errors };\n}\n\n/**\n * The streaming sibling of {@link processInParallel}: bounded-concurrency\n * dispatch over an AsyncIterable that may be far larger than the caller wants\n * to walk, so it stops early and reports why.\n *\n * `maxEntries` caps how many entries are dispatched (maxFiles); `shouldStop`\n * lets the caller stop on its own accumulating result count (maxResults). Both\n * are checked before dispatch, so the returned reason is exactly one — the\n * loop breaks on the first that fires. `undefined` means every entry was\n * dispatched.\n */\nexport async function processEntriesConcurrently(\n  entries: AsyncIterable<{ path: string }> | Iterable<{ path: string }>,\n  options: {\n    signal: AbortSignal | undefined;\n    concurrency: number;\n    maxEntries?: number;\n    shouldStop?: () => boolean;\n    onEntry: () => void;\n    onError?: (entryPath: string, err: unknown) => void;\n    runEntry: (entryPath: string) => Promise<void>;\n  },\n): Promise<StoppedReason | undefined> {\n  const pending = new Set<Promise<void>>();\n  const { signal, concurrency, maxEntries, shouldStop, onEntry, onError, runEntry } = options;\n  let stoppedReason: StoppedReason | undefined;\n  let dispatched = 0;\n\n  const waitForSlot = async (): Promise<void> => {\n    if (pending.size < concurrency) return;\n    await Promise.race(pending);\n  };\n\n  for await (const entry of entries) {\n    // The signal is cancellation OR the caller's timeout: stop dispatching and\n    // let the caller report the run as incomplete rather than as a full sweep.\n    if (signal?.aborted) {\n      stoppedReason = 'timeout';\n      break;\n    }\n    if (maxEntries !== undefined && dispatched >= maxEntries) {\n      stoppedReason = 'maxFiles';\n      break;\n    }\n    // Check the result cap before waiting for a slot so an in-flight task that\n    // already crossed the cap stops dispatch without an extra wait...\n    if (shouldStop?.()) {\n      stoppedReason = 'maxResults';\n      break;\n    }\n    await waitForSlot();\n    // ...and again after the slot frees, since tasks settle concurrently. The\n    // cap can still be exceeded by at most `concurrency - 1` already-dispatched\n    // tasks that are mid-flight; that overrun is inherent to concurrent dispatch.\n    if (shouldStop?.()) {\n      stoppedReason = 'maxResults';\n      break;\n    }\n    onEntry();\n    dispatched++;\n\n    // Track a non-rejecting wrapper so a rejected task can never propagate out of\n    // Promise.race(pending) in waitForSlot() and abort the loop before the final\n    // drain below (which would silently abandon other in-flight tasks).\n    // runEntry is expected to catch its own errors; if it unexpectedly throws,\n    // record it as a failure rather than silently dropping it.\n    const tracked = runEntry(entry.path).catch((err: unknown) => {\n      onError?.(entry.path, err);\n    });\n    pending.add(tracked);\n    void tracked.finally(() => {\n      pending.delete(tracked);\n    });\n  }\n\n  if (pending.size > 0) {\n    await Promise.allSettled([...pending]);\n  }\n\n  return stoppedReason;\n}\n\nexport function withAbort<T>(promise: Promise<T>, signal?: AbortSignal): Promise<T> {\n  if (!signal) {\n    return promise;\n  }\n  signal.throwIfAborted();\n  let onAbort: (() => void) | undefined;\n  return Promise.race([\n    promise,\n    new Promise<never>((_, reject) => {\n      onAbort = () => {\n        reject(signal.reason instanceof Error ? signal.reason : new Error('Operation aborted'));\n      };\n      signal.addEventListener('abort', onAbort, { once: true });\n    }),\n  ]).finally(() => {\n    if (onAbort) {\n      signal.removeEventListener('abort', onAbort);\n    }\n  });\n}\n"]}
+{"version":3,"file":"concurrency.js","sourceRoot":"","sources":["../../src/core/concurrency.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AACpD,OAAO,EAAE,oBAAoB,EAAE,MAAM,WAAW,CAAC;AAIjD,4GAA4G;AAC5G,MAAM,UAAU,iBAAiB,CAC/B,MAAe,EACf,OAAgB;IAEhB,OAAO,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;AACjE,CAAC;AAOD,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,KAAmB,EACnB,SAAiD,EACjD,cAAsB,oBAAoB,EAC1C,MAAoB;IAEpB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAC/B,IAAI,SAAS,KAAK,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAExD,MAAM,OAAO,GAAkC,EAAE,CAAC;IAClD,MAAM,MAAM,GAAsC,EAAE,CAAC;IAErD,MAAM,EAAE,cAAc,EAAE,CAAC;IAEzB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,sEAAsE;IACtE,mEAAmE;IACnE,wEAAwE;IACxE,8DAA8D;IAC9D,IAAI,SAAS,GAAG,KAAgB,CAAC;IAEjC,MAAM,IAAI,GAAG,KAAK,IAAmB,EAAE;QACrC,OAAO,SAAS,GAAG,SAAS,EAAE,CAAC;YAC7B,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;gBACpB,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM,CAAC,cAAc,EAAE,CAAC;YAC1B,CAAC;YAED,MAAM,KAAK,GAAG,SAAS,CAAC;YACxB,SAAS,IAAI,CAAC,CAAC;YACf,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAC1B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,SAAS;YACX,CAAC;YAED,IAAI,CAAC;gBACH,gEAAgE;gBAChE,gEAAgE;gBAChE,6DAA6D;gBAC7D,iDAAiD;gBACjD,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBAC3C,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;YACjC,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC;oBACV,KAAK;oBACL,KAAK,EAAE,qBAAqB,CAAC,KAAK,CAAC;iBACpC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACrD,MAAM,OAAO,GAAoB,IAAI,KAAK,CAAgB,WAAW,CAAC,CAAC;IACvE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,WAAW,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACpD,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,EAAE,CAAC;IAC1B,CAAC;IAED,MAAM,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAClC,uEAAuE;IACvE,sEAAsE;IACtE,uEAAuE;IACvE,iEAAiE;IACjE,uEAAuE;IACvE,qEAAqE;IACrE,2BAA2B;IAC3B,IAAI,SAAS;QAAE,MAAM,EAAE,cAAc,EAAE,CAAC;IAExC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IACxD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAC7B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,0BAA0B,CAC9C,OAAqE,EACrE,OAQC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAC;IACzC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;IAC5F,IAAI,aAAwC,CAAC;IAC7C,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,MAAM,WAAW,GAAG,KAAK,IAAmB,EAAE;QAC5C,IAAI,OAAO,CAAC,IAAI,GAAG,WAAW;YAAE,OAAO;QACvC,MAAM,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC,CAAC;IAEF,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,IAAI,SAAkB,CAAC;IACvB,IAAI,CAAC;QACH,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAClC,2EAA2E;YAC3E,2EAA2E;YAC3E,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;gBACpB,aAAa,GAAG,SAAS,CAAC;gBAC1B,MAAM;YACR,CAAC;YACD,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;gBACzD,aAAa,GAAG,UAAU,CAAC;gBAC3B,MAAM;YACR,CAAC;YACD,2EAA2E;YAC3E,kEAAkE;YAClE,IAAI,UAAU,EAAE,EAAE,EAAE,CAAC;gBACnB,aAAa,GAAG,YAAY,CAAC;gBAC7B,MAAM;YACR,CAAC;YACD,MAAM,WAAW,EAAE,CAAC;YACpB,0EAA0E;YAC1E,4EAA4E;YAC5E,8EAA8E;YAC9E,IAAI,UAAU,EAAE,EAAE,EAAE,CAAC;gBACnB,aAAa,GAAG,YAAY,CAAC;gBAC7B,MAAM;YACR,CAAC;YACD,OAAO,EAAE,CAAC;YACV,UAAU,EAAE,CAAC;YAEb,8EAA8E;YAC9E,6EAA6E;YAC7E,oEAAoE;YACpE,2EAA2E;YAC3E,2DAA2D;YAC3D,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,GAAY,EAAE,EAAE;gBAC1D,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7B,CAAC,CAAC,CAAC;YACH,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrB,KAAK,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE;gBACxB,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC1B,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,2EAA2E;QAC3E,0DAA0D;QAC1D,IAAI,MAAM,EAAE,OAAO;YAAE,aAAa,GAAG,SAAS,CAAC;aAC1C,CAAC;YACJ,UAAU,GAAG,IAAI,CAAC;YAClB,SAAS,GAAG,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,IAAI,UAAU;QAAE,MAAM,SAAS,CAAC;IAChC,OAAO,aAAa,CAAC;AACvB,CAAC;AAED,MAAM,UAAU,SAAS,CAAI,OAAmB,EAAE,MAAoB;IACpE,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,MAAM,CAAC,cAAc,EAAE,CAAC;IACxB,IAAI,OAAiC,CAAC;IACtC,OAAO,OAAO,CAAC,IAAI,CAAC;QAClB,OAAO;QACP,IAAI,OAAO,CAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;YAC/B,OAAO,GAAG,GAAG,EAAE;gBACb,MAAM,CAAC,MAAM,CAAC,MAAM,YAAY,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC,CAAC;YAC1F,CAAC,CAAC;YACF,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5D,CAAC,CAAC;KACH,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;QACd,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["import { normalizeUnknownError } from './errors.ts';\nimport { PARALLEL_CONCURRENCY } from './util.ts';\n\nexport type StoppedReason = 'maxResults' | 'maxFiles' | 'timeout';\n\n/** The one precedence both scans share: the result cap wins over an abort that fired the same iteration. */\nexport function resolveStopReason(\n  hitCap: boolean,\n  aborted: boolean,\n): 'maxResults' | 'timeout' | undefined {\n  return hitCap ? 'maxResults' : aborted ? 'timeout' : undefined;\n}\n\ninterface ParallelResult<R> {\n  results: { index: number; value: R }[];\n  errors: { index: number; error: Error }[];\n}\n\nexport async function processInParallel<T, R>(\n  items: readonly T[],\n  processor: (item: T, index: number) => Promise<R>,\n  concurrency: number = PARALLEL_CONCURRENCY,\n  signal?: AbortSignal,\n): Promise<ParallelResult<R>> {\n  const itemCount = items.length;\n  if (itemCount === 0) return { results: [], errors: [] };\n\n  const results: { index: number; value: R }[] = [];\n  const errors: { index: number; error: Error }[] = [];\n\n  signal?.throwIfAborted();\n\n  let nextIndex = 0;\n  // Set when a worker saw the signal fire before an item ran — the only\n  // shape in which the batch is genuinely incomplete. The annotation\n  // matters: without it control-flow analysis keeps the `false` narrowing\n  // from the initializer and cannot see the closure assignment.\n  let truncated = false as boolean;\n\n  const next = async (): Promise<void> => {\n    while (nextIndex < itemCount) {\n      if (signal?.aborted) {\n        truncated = true;\n        signal.throwIfAborted();\n      }\n\n      const index = nextIndex;\n      nextIndex += 1;\n      const item = items[index];\n      if (item === undefined) {\n        continue;\n      }\n\n      try {\n        // No abort check after the processor: once an item has run, its\n        // result is real work that a write caller may have committed to\n        // disk. Discarding it here would report a finished append as\n        // failed, and a client retry would append twice.\n        const value = await processor(item, index);\n        results.push({ index, value });\n      } catch (error) {\n        errors.push({\n          index,\n          error: normalizeUnknownError(error),\n        });\n      }\n    }\n  };\n\n  const workerCount = Math.min(itemCount, concurrency);\n  const workers: Promise<void>[] = new Array<Promise<void>>(workerCount);\n  for (let index = 0; index < workerCount; index += 1) {\n    workers[index] = next();\n  }\n\n  await Promise.allSettled(workers);\n  // A deadline (AbortSignal.timeout) hit during the run surfaces here as\n  // signal.reason — a TimeoutError — rather than a fresh AbortError, so\n  // callers see TIMEOUT, not CANCELLED. Only a run that actually skipped\n  // items reports the abort: a deadline firing after the last item\n  // finished leaves a complete batch, and returning it beats telling the\n  // caller that committed writes failed. The per-item throws above are\n  // swallowed by allSettled.\n  if (truncated) signal?.throwIfAborted();\n\n  results.sort((left, right) => left.index - right.index);\n  return { results, errors };\n}\n\n/**\n * The streaming sibling of {@link processInParallel}: bounded-concurrency\n * dispatch over an AsyncIterable that may be far larger than the caller wants\n * to walk, so it stops early and reports why.\n *\n * `maxEntries` caps how many entries are dispatched (maxFiles); `shouldStop`\n * lets the caller stop on its own accumulating result count (maxResults). Both\n * are checked before dispatch, so the returned reason is exactly one — the\n * loop breaks on the first that fires. `undefined` means every entry was\n * dispatched.\n */\nexport async function processEntriesConcurrently(\n  entries: AsyncIterable<{ path: string }> | Iterable<{ path: string }>,\n  options: {\n    signal: AbortSignal | undefined;\n    concurrency: number;\n    maxEntries?: number;\n    shouldStop?: () => boolean;\n    onEntry: () => void;\n    onError?: (entryPath: string, err: unknown) => void;\n    runEntry: (entryPath: string) => Promise<void>;\n  },\n): Promise<StoppedReason | undefined> {\n  const pending = new Set<Promise<void>>();\n  const { signal, concurrency, maxEntries, shouldStop, onEntry, onError, runEntry } = options;\n  let stoppedReason: StoppedReason | undefined;\n  let dispatched = 0;\n\n  const waitForSlot = async (): Promise<void> => {\n    if (pending.size < concurrency) return;\n    await Promise.race(pending);\n  };\n\n  let walkFailed = false;\n  let walkError: unknown;\n  try {\n    for await (const entry of entries) {\n      // The signal is cancellation OR the caller's timeout: stop dispatching and\n      // let the caller report the run as incomplete rather than as a full sweep.\n      if (signal?.aborted) {\n        stoppedReason = 'timeout';\n        break;\n      }\n      if (maxEntries !== undefined && dispatched >= maxEntries) {\n        stoppedReason = 'maxFiles';\n        break;\n      }\n      // Check the result cap before waiting for a slot so an in-flight task that\n      // already crossed the cap stops dispatch without an extra wait...\n      if (shouldStop?.()) {\n        stoppedReason = 'maxResults';\n        break;\n      }\n      await waitForSlot();\n      // ...and again after the slot frees, since tasks settle concurrently. The\n      // cap can still be exceeded by at most `concurrency - 1` already-dispatched\n      // tasks that are mid-flight; that overrun is inherent to concurrent dispatch.\n      if (shouldStop?.()) {\n        stoppedReason = 'maxResults';\n        break;\n      }\n      onEntry();\n      dispatched++;\n\n      // Track a non-rejecting wrapper so a rejected task can never propagate out of\n      // Promise.race(pending) in waitForSlot() and abort the loop before the final\n      // drain below (which would silently abandon other in-flight tasks).\n      // runEntry is expected to catch its own errors; if it unexpectedly throws,\n      // record it as a failure rather than silently dropping it.\n      const tracked = runEntry(entry.path).catch((err: unknown) => {\n        onError?.(entry.path, err);\n      });\n      pending.add(tracked);\n      void tracked.finally(() => {\n        pending.delete(tracked);\n      });\n    }\n  } catch (error) {\n    // A walk the signal cut short throws its reason (see globEntries): that is\n    // the same timeout as the check above, not a failed walk.\n    if (signal?.aborted) stoppedReason = 'timeout';\n    else {\n      walkFailed = true;\n      walkError = error;\n    }\n  }\n\n  if (pending.size > 0) {\n    await Promise.allSettled([...pending]);\n  }\n\n  if (walkFailed) throw walkError;\n  return stoppedReason;\n}\n\nexport function withAbort<T>(promise: Promise<T>, signal?: AbortSignal): Promise<T> {\n  if (!signal) {\n    return promise;\n  }\n  signal.throwIfAborted();\n  let onAbort: (() => void) | undefined;\n  return Promise.race([\n    promise,\n    new Promise<never>((_, reject) => {\n      onAbort = () => {\n        reject(signal.reason instanceof Error ? signal.reason : new Error('Operation aborted'));\n      };\n      signal.addEventListener('abort', onAbort, { once: true });\n    }),\n  ]).finally(() => {\n    if (onAbort) {\n      signal.removeEventListener('abort', onAbort);\n    }\n  });\n}\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"glob.d.ts","sourceRoot":"","sources":["../../src/core/glob.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAOlD,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAkBzD;AA6MD,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,UAAU,CAAC;CACpB;AAED,MAAM,WAAW,kBAAkB;IACjC,GAAG,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,MAAM,CAAC;IAChB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,kFAAkF;IAClF,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,4EAA4E;IAC5E,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAoND,wBAAuB,WAAW,CAAC,OAAO,EAAE,kBAAkB,GAAG,cAAc,CAAC,SAAS,CAAC,CAuBzF"}
+{"version":3,"file":"glob.d.ts","sourceRoot":"","sources":["../../src/core/glob.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAOlD,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAkBzD;AA8MD,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,UAAU,CAAC;CACpB;AAED,MAAM,WAAW,kBAAkB;IACjC,GAAG,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,MAAM,CAAC;IAChB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,kFAAkF;IAClF,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,4EAA4E;IAC5E,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AA6ND,wBAAuB,WAAW,CAAC,OAAO,EAAE,kBAAkB,GAAG,cAAc,CAAC,SAAS,CAAC,CAwBzF"}

package/dist/core/glob.js

@@ -110,6 +110,8 @@ class GitignoreManager {
                 // Skip what the walk itself skips, and stop one level past its depth
                 // bound: a .gitignore at depth d only affects entries at depth >= d.
                 exclude: (entry) => {
+                    if (signal?.aborted)
+                        return true;
                     const name = basename(entry);
                     if (name === '.hg' || name === '.svn' || DEFAULT_EXCLUDED_NAMES.has(name))
                         return true;
@@ -302,8 +304,8 @@ function* processDirentMatch(match, cwd, maxDepth, seen, onlyFiles) {
         return;
     yield { path: absolutePath, dirent: match };
 }
-function createWalkFilter(cwd, skipIgnored, gitignoreMatcher, maxDepth) {
-    if (!skipIgnored && maxDepth === undefined)
+function createWalkFilter(cwd, skipIgnored, gitignoreMatcher, maxDepth, signal) {
+    if (!skipIgnored && maxDepth === undefined && signal === undefined)
         return undefined;
     // fs.glob can hand the predicate a dirent whose parentPath is "." — the walk
     // root, not the process cwd — when it re-visits a directory under `**` whose
@@ -317,6 +319,10 @@ function createWalkFilter(cwd, skipIgnored, gitignoreMatcher, maxDepth) {
             (gitignoreMatcher?.isIgnored(posixRel, isDir) ?? false));
     return {
         prune: (match) => {
+            // fs.glob takes no signal and calls this for every entry it visits, so
+            // pruning everything is the only way to stop a walk that yields nothing.
+            if (signal?.aborted)
+                return true;
             const posixRel = relativeOf(match);
             const isDir = match.isDirectory();
             if (excluded(posixRel, isDir))
@@ -331,7 +337,7 @@ function createWalkFilter(cwd, skipIgnored, gitignoreMatcher, maxDepth) {
         isExcluded: (match) => excluded(relativeOf(match), match.isDirectory()),
     };
 }
-async function* processGlobPattern(pattern, plan, seen, onlyFiles, filter) {
+async function* processGlobPattern(pattern, plan, seen, onlyFiles, filter, signal) {
     const { cwd, maxDepth, suppressErrors } = plan;
     let iterable;
     try {
@@ -348,6 +354,8 @@ async function* processGlobPattern(pattern, plan, seen, onlyFiles, filter) {
     }
     try {
         for await (const match of iterable) {
+            if (signal?.aborted)
+                break;
             // A function `exclude` only prunes descent in fs.glob — it still yields
             // the rejected dirent itself, and any rejected entry below the top level.
             // Re-apply the ignore rules (not the depth bound) to drop those.
@@ -361,6 +369,9 @@ async function* processGlobPattern(pattern, plan, seen, onlyFiles, filter) {
             throw error;
         Logger.warn(`globEntries: suppressed mid-walk error for pattern "${pattern}": ${formatUnknownErrorMessage(error)}`);
     }
+    // A pruned walk ends like a finished one. Say it was cut short, so no caller
+    // reads "the walk ended" as "the whole tree was seen".
+    signal?.throwIfAborted();
 }
 export async function* globEntries(options) {
     const gitignoreMatcher = options.skipIgnored
@@ -369,9 +380,9 @@ export async function* globEntries(options) {
     const plan = normalizeGlobOptions(options);
     const seen = new Set();
     const onlyFiles = options.onlyFiles ?? true;
-    const filter = createWalkFilter(plan.cwd, options.skipIgnored ?? false, gitignoreMatcher, plan.maxDepth);
+    const filter = createWalkFilter(plan.cwd, options.skipIgnored ?? false, gitignoreMatcher, plan.maxDepth, options.signal);
     for (const pattern of plan.patterns) {
-        yield* processGlobPattern(pattern, plan, seen, onlyFiles, filter);
+        yield* processGlobPattern(pattern, plan, seen, onlyFiles, filter, options.signal);
     }
 }
 /** Names a `skipIgnored` walk never enters or yields, at any depth. */

package/dist/core/glob.js.map

@@ -1 +1 @@
-{"version":3,"file":"glob.js","sourceRoot":"","sources":["../../src/core/glob.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,IAAI,MAAM,EAAE,QAAQ,IAAI,UAAU,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACjF,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAGnF,OAAO,MAAM,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAE,yBAAyB,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAE5C,OAAO,EAAE,qBAAqB,EAAE,0BAA0B,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AACjG,OAAO,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAEhC,yFAAyF;AACzF,MAAM,mBAAmB,GAAG,iCAAiC,CAAC;AAE9D,MAAM,UAAU,gBAAgB,CAAC,OAAe;IAC9C,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,0BAA0B,CAAC,OAAO,CAAC,EAAE,CAAC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,uEAAuE;IACvE,4EAA4E;IAC5E,0EAA0E;IAC1E,kDAAkD;IAClD,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QACtC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,oFAAoF;AACpF,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC,KAAK,UAAU,kBAAkB,CAC/B,IAAY,EACZ,cAAiC,EACjC,OAAyB,EACzB,MAAoB;IAEpB,MAAM,iBAAiB,CACrB,cAAc,EACd,KAAK,EAAE,OAAO,EAAE,EAAE;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACpC,IAAI,CAAC;YACH,mEAAmE;YACnE,sEAAsE;YACtE,0BAA0B;YAC1B,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,IAAI,GAAG,mBAAmB;gBAAE,OAAO;YAC9D,MAAM,QAAQ,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;YAC1E,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtB,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;YAC1C,OAAO,CAAC,UAAU,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACtD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY;gBAAE,MAAM,KAAK,CAAC;YACvE,MAAM,CAAC,IAAI,CAAC,gCAAgC,OAAO,KAAK,yBAAyB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC9F,CAAC;IACH,CAAC,EACD,sBAAsB,EACtB,MAAM,CACP,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,sBAAsB,CACnC,IAAY,EACZ,OAAe,EACf,OAAyB,EACzB,MAAoB;IAEpB,MAAM,iBAAiB,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAI,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5D,IAAI,CAAC,qBAAqB,CAAC,iBAAiB,EAAE,GAAG,CAAC;YAAE,MAAM;QAC1D,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,IACE,CAAC,qBAAqB,CAAC,GAAG,EAAE,iBAAiB,CAAC;YAC5C,qBAAqB,CAAC,iBAAiB,EAAE,GAAG,CAAC,CAAC;YAChD,OAAO,CAAC,GAAG,CAAC,KAAK,GAAG,EACpB,CAAC;YACD,MAAM;QACR,CAAC;IACH,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAClC,MAAM,EAAE,cAAc,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QACrC,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,IAAI,GAAG,mBAAmB;gBAAE,SAAS;YAChE,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YACpF,MAAM,MAAM,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;YAChD,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,OAAO;gBAAE,SAAS;YACjD,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC9C,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY;gBAAE,MAAM,KAAK,CAAC;YACvE,yGAAyG;QAC3G,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,gBAAgB;IACZ,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,4HAA4H;IACpH,SAAS,GAA0C,EAAE,CAAC;IAE9D,UAAU,CAAC,GAAW,EAAE,OAAe;QACrC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAClC,CAAC;IAED,kBAAkB,CAAC,MAAc,EAAE,OAAe;QAChD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED,kFAAkF;IAClF,MAAM,CAAC,KAAK,CAAC,IAAI,CACf,IAAY,EACZ,MAAoB,EACpB,QAAiB,EACjB,aAAsB;QAEtB,MAAM,OAAO,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACvC,IAAI,CAAC;YACH,MAAM,cAAc,GAAa,EAAE,CAAC;YACpC,MAAM,gBAAgB,GAAG,MAAM,CAAC,eAAe,EAAE;gBAC/C,GAAG,EAAE,IAAI;gBACT,qEAAqE;gBACrE,qEAAqE;gBACrE,OAAO,EAAE,CAAC,KAAa,EAAE,EAAE;oBACzB,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAC7B,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,MAAM,IAAI,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,OAAO,IAAI,CAAC;oBACvF,OAAO,QAAQ,KAAK,SAAS,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC;gBACvF,CAAC;aACF,CAAC,CAAC;YACH,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,IAAI,MAAM,EAAE,OAAO;oBAAE,MAAM;gBAC3B,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;YAED,MAAM,kBAAkB,CAAC,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;YAChE,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBAChC,MAAM,sBAAsB,CAAC,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY;gBAAE,MAAM,KAAK,CAAC;YACvE,MAAM,CAAC,IAAI,CACT,8CAA8C,IAAI,KAAK,yBAAyB,CAAC,KAAK,CAAC,EAAE,CAC1F,CAAC;QACJ,CAAC;QACD,OAAO,OAAO,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;IACxF,CAAC;IAED,SAAS,CAAC,YAAoB,EAAE,WAAoB;QAClD,MAAM,UAAU,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;QAC7C,IAAI,UAAU,KAAK,EAAE,IAAI,UAAU,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC;QAC1D,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEpC,oCAAoC;QACpC,IAAI,UAAU,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAEzD,IAAI,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,EAAE,CAAC;gBACrC,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;IACjD,CAAC;IAEO,SAAS,CAAC,SAAiB,EAAE,WAAoB;QACvD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,WAAW,GAAG,WAAW;YAC7B,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC;gBACvB,CAAC,CAAC,SAAS;gBACX,CAAC,CAAC,GAAG,SAAS,GAAG;YACnB,CAAC,CAAC,SAAS,CAAC;QAEd,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,KAAK,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACjD,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,WAAW,EAAE,CAAC,CAAC;YACrD,IAAI,GAAG,CAAC,OAAO;gBAAE,OAAO,GAAG,IAAI,CAAC;YAChC,IAAI,GAAG,CAAC,SAAS;gBAAE,OAAO,GAAG,KAAK,CAAC;QACrC,CAAC;QAED,mBAAmB;QACnB,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC1C,IAAI,GAAG,CAAC,OAAO;gBAAE,OAAO,GAAG,IAAI,CAAC;YAChC,IAAI,GAAG,CAAC,SAAS;gBAAE,OAAO,GAAG,KAAK,CAAC;QACrC,CAAC;QAED,uBAAuB;QACvB,IAAI,UAAU,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAEzD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC9C,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpC,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACnC,MAAM,cAAc,GAAG,WAAW;oBAChC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC;wBACrB,CAAC,CAAC,OAAO;wBACT,CAAC,CAAC,GAAG,OAAO,GAAG;oBACjB,CAAC,CAAC,OAAO,CAAC;gBAEZ,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACzC,IAAI,GAAG,CAAC,OAAO;oBAAE,OAAO,GAAG,IAAI,CAAC;gBAChC,IAAI,GAAG,CAAC,SAAS;oBAAE,OAAO,GAAG,KAAK,CAAC;YACrC,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAuCD,MAAM,aAAa,GAAG,aAAa,CAAC;AACpC,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAClC,MAAM,GAAG,GAAG,GAAG,CAAC;AAChB,MAAM,aAAa,GAAG,EAAE,CAAC;AACzB,SAAS,gBAAgB,CAAC,OAAe,EAAE,aAAsB;IAC/D,MAAM,UAAU,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IAExC,IAAI,CAAC,aAAa;QAAE,OAAO,UAAU,CAAC;IACtC,IAAI,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,UAAU,CAAC;IAChD,OAAO,MAAM,UAAU,EAAE,CAAC;AAC5B,CAAC;AAED,SAAS,kBAAkB,CAAC,iBAAyB;IAInD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAC3C,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,iBAAiB,EAAE,CAAC;IACtD,CAAC;IAED,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC9C,MAAM,UAAU,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAExE,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;QACpB,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,iBAAiB,EAAE,CAAC;IACtD,CAAC;IAED,OAAO;QACL,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG;QACrD,SAAS,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;KAChD,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CAAC,QAAqB,EAAE,MAAc,EAAE,SAAiB;IAClF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IACnC,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACtC,MAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAExE,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;QACf,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,QAAQ,IAAI,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,CAAC;YACzD,MAAM,WAAW,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;YAClC,WAAW,CAAC,GAAG,CAAC,GAAG,IAAI,QAAQ,EAAE,CAAC;YAClC,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAAC,QAAqB,EAAE,MAAc,EAAE,SAAiB;IACrF,yEAAyE;IACzE,uEAAuE;IACvE,wEAAwE;IACxE,qEAAqE;IACrE,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;QACvB,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC;QAC/B,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,UAAU,CAAC,CAAC;QAClC,OAAO;IACT,CAAC;IAED,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,KAAK,CAAC;QAAE,OAAO;IAEzC,MAAM,aAAa,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACzC,4EAA4E;IAC5E,+EAA+E;IAC/E,2EAA2E;IAC3E,yEAAyE;IACzE,YAAY;IACZ,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,YAAY,aAAa,EAAE,CAAC,CAAC;IACnD,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,aAAa,CAAC;IAC7F,IAAI,UAAU;QAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,OAAO,aAAa,EAAE,CAAC,CAAC;AAChE,CAAC;AAED,SAAS,mBAAmB,CAAC,iBAAyB;IACpD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC;IACtD,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,CAAC;IAEpE,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IAChD,qBAAqB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IAEnD,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,oBAAoB,CAAC,OAA2B;IACvD,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACjC,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,aAAa,IAAI,KAAK,CAAC,CAAC;IAE5F,MAAM,QAAQ,GAAG,OAAO,CAAC,aAAa;QACpC,CAAC,CAAC,mBAAmB,CAAC,iBAAiB,CAAC;QACxC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC;IAExB,MAAM,UAAU,GAAmB;QACjC,GAAG;QACH,QAAQ;QACR,cAAc,EAAE,OAAO,CAAC,cAAc,IAAI,KAAK;KAChD,CAAC;IAEF,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QACnC,UAAU,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;IACzC,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,QAAQ,CAAC,CAAC,kBAAkB,CAC1B,KAAqB,EACrB,GAAW,EACX,QAA4B,EAC5B,IAAiB,EACjB,SAAkB;IAElB,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAEhE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QACxC,IAAI,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,QAAQ;YAAE,OAAO;IACxD,CAAC;IAED,IAAI,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC;QAAE,OAAO;IACnC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAEvB,IAAI,SAAS,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;QAAE,OAAO;IACzC,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AAC9C,CAAC;AASD,SAAS,gBAAgB,CACvB,GAAW,EACX,WAAoB,EACpB,gBAAyC,EACzC,QAA4B;IAE5B,IAAI,CAAC,WAAW,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAE7D,6EAA6E;IAC7E,6EAA6E;IAC7E,yEAAyE;IACzE,2EAA2E;IAC3E,MAAM,UAAU,GAAG,CAAC,KAAqB,EAAU,EAAE,CACnD,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzE,2EAA2E;IAC3E,mEAAmE;IACnE,MAAM,QAAQ,GAAG,CAAC,QAAgB,EAAE,KAAc,EAAW,EAAE,CAC7D,WAAW;QACX,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACzE,CAAC,gBAAgB,EAAE,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;IAE7D,OAAO;QACL,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;YACf,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,IAAI,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3C,wEAAwE;YACxE,yEAAyE;YACzE,mEAAmE;YACnE,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;YACnD,OAAO,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC;QACnD,CAAC;QACD,UAAU,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC;KACxE,CAAC;AACJ,CAAC;AAED,KAAK,SAAS,CAAC,CAAC,kBAAkB,CAChC,OAAe,EACf,IAAoB,EACpB,IAAiB,EACjB,SAAkB,EAClB,MAA8B;IAE9B,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,cAAc,EAAE,GAAG,IAAI,CAAC;IAC/C,IAAI,QAAuC,CAAC;IAC5C,IAAI,CAAC;QACH,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE;YACzB,GAAG;YACH,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5C,aAAa,EAAE,IAAI;SACpB,CAAkC,CAAC;IACtC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,cAAc;YAAE,OAAO;QAC3B,MAAM,KAAK,CAAC;IACd,CAAC;IAED,IAAI,CAAC;QACH,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YACnC,wEAAwE;YACxE,0EAA0E;YAC1E,iEAAiE;YACjE,IAAI,MAAM,EAAE,UAAU,CAAC,KAAK,CAAC;gBAAE,SAAS;YACxC,KAAK,CAAC,CAAC,kBAAkB,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,cAAc;YAAE,MAAM,KAAK,CAAC;QACjC,MAAM,CAAC,IAAI,CACT,uDAAuD,OAAO,MAAM,yBAAyB,CAAC,KAAK,CAAC,EAAE,CACvG,CAAC;IACJ,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,WAAW,CAAC,OAA2B;IAC5D,MAAM,gBAAgB,GAAG,OAAO,CAAC,WAAW;QAC1C,CAAC,CAAC,MAAM,gBAAgB,CAAC,IAAI,CACzB,OAAO,CAAC,GAAG,EACX,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,aAAa,CACtB;QACH,CAAC,CAAC,IAAI,CAAC;IAET,MAAM,IAAI,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;IAC5C,MAAM,MAAM,GAAG,gBAAgB,CAC7B,IAAI,CAAC,GAAG,EACR,OAAO,CAAC,WAAW,IAAI,KAAK,EAC5B,gBAAgB,EAChB,IAAI,CAAC,QAAQ,CACd,CAAC;IAEF,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QACpC,KAAK,CAAC,CAAC,kBAAkB,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;AACH,CAAC;AAED,uEAAuE;AACvE,MAAM,sBAAsB,GAAwB,IAAI,GAAG,CAAC;IAC1D,cAAc;IACd,MAAM;IACN,OAAO;IACP,UAAU;IACV,MAAM;IACN,SAAS;IACT,OAAO;IACP,WAAW;IACX,OAAO;IACP,OAAO;IACP,SAAS;IACT,aAAa;IACb,QAAQ;IACR,OAAO;IACP,eAAe;IACf,kBAAkB;IAClB,KAAK;IACL,KAAK;IACL,OAAO;IACP,eAAe;IACf,gBAAgB;IAChB,gBAAgB;IAChB,WAAW;CACZ,CAAC,CAAC","sourcesContent":["import { glob as fsGlob, readFile as fsReadFile, lstat } from 'node:fs/promises';\nimport { basename, dirname, isAbsolute, join, relative, resolve } from 'node:path';\n\nimport type { Ignore } from 'ignore';\nimport ignore from 'ignore';\n\nimport { processInParallel } from './concurrency.ts';\nimport { formatUnknownErrorMessage } from './errors.ts';\nimport { Logger } from './observability.ts';\nimport type { DirentLike } from './path-utils.ts';\nimport { isPathInsideDirectory, isWindowsDriveRelativePath, toPosixPath } from './path-utils.ts';\nimport { MIB } from './util.ts';\n\n/** `..` bounded on both sides by a separator, a brace delimiter, or the pattern edge. */\nconst TRAVERSAL_DOTDOT_RE = /(?:^|[/\\\\{,])\\.\\.(?=[/\\\\},]|$)/u;\n\nexport function isSafeGlobSyntax(pattern: string): boolean {\n  if (!pattern || pattern.trim().length === 0) {\n    return false;\n  }\n  if (isAbsolute(pattern)) {\n    return false;\n  }\n  if (isWindowsDriveRelativePath(pattern)) {\n    return false;\n  }\n  // Only a whole `..` — a path segment, or one alternative of a `{a,..}`\n  // brace set — can traverse. `..` inside a segment (`[...slug]`, `v1..2.md`,\n  // `[..]`) is a literal name or a character class, and PathGuard re-checks\n  // containment on every resolved entry regardless.\n  if (TRAVERSAL_DOTDOT_RE.test(pattern)) {\n    return false;\n  }\n  return true;\n}\n\n/** A .gitignore past this size is not a .gitignore; skip it rather than read it. */\nconst MAX_GITIGNORE_BYTES = MIB;\n\nasync function loadGitignoreFiles(\n  root: string,\n  gitignorePaths: readonly string[],\n  manager: GitignoreManager,\n  signal?: AbortSignal,\n): Promise<void> {\n  await processInParallel(\n    gitignorePaths,\n    async (relPath) => {\n      const absPath = join(root, relPath);\n      try {\n        // lstat, not stat: a symlinked .gitignore may point at a device, a\n        // FIFO or a huge file outside the root. Only a plain, small file is a\n        // rule set worth reading.\n        const info = await lstat(absPath);\n        if (!info.isFile() || info.size > MAX_GITIGNORE_BYTES) return;\n        const contents = await fsReadFile(absPath, { encoding: 'utf-8', signal });\n        const matcher = ignore();\n        matcher.add(contents);\n        const dir = toPosixPath(dirname(relPath));\n        manager.addMatcher(dir === '.' ? '' : dir, matcher);\n      } catch (error) {\n        if (error instanceof Error && error.name === 'AbortError') throw error;\n        Logger.warn(`Failed to read .gitignore at ${absPath}: ${formatUnknownErrorMessage(error)}`);\n      }\n    },\n    GLOB_BATCH_CONCURRENCY,\n    signal,\n  );\n}\n\n/**\n * Load `.gitignore` from each ancestor of `root` up to and including `ceiling`,\n * farthest first. A rule set that ignores `root` itself is skipped: the caller\n * named that directory on purpose, and applying the rule would empty the walk.\n */\nasync function loadAncestorGitignores(\n  root: string,\n  ceiling: string,\n  manager: GitignoreManager,\n  signal?: AbortSignal,\n): Promise<void> {\n  const normalizedCeiling = resolve(ceiling);\n  const chain: string[] = [];\n  for (let dir = dirname(resolve(root)); ; dir = dirname(dir)) {\n    if (!isPathInsideDirectory(normalizedCeiling, dir)) break;\n    chain.push(dir);\n    if (\n      (isPathInsideDirectory(dir, normalizedCeiling) &&\n        isPathInsideDirectory(normalizedCeiling, dir)) ||\n      dirname(dir) === dir\n    ) {\n      break;\n    }\n  }\n  for (const dir of chain.reverse()) {\n    signal?.throwIfAborted();\n    const file = join(dir, '.gitignore');\n    try {\n      const info = await lstat(file);\n      if (!info.isFile() || info.size > MAX_GITIGNORE_BYTES) continue;\n      const matcher = ignore().add(await fsReadFile(file, { encoding: 'utf-8', signal }));\n      const prefix = toPosixPath(relative(dir, root));\n      if (matcher.test(`${prefix}/`).ignored) continue;\n      manager.addAncestorMatcher(prefix, matcher);\n    } catch (error) {\n      if (error instanceof Error && error.name === 'AbortError') throw error;\n      // ENOENT is the normal case (no .gitignore at this level); anything else is not worth a warning per walk\n    }\n  }\n}\n\nclass GitignoreManager {\n  private matchers = new Map<string, Ignore>();\n  /** Rules from directories above the walk root, farthest first; `prefix` re-bases a walk-relative path to that directory. */\n  private ancestors: { prefix: string; matcher: Ignore }[] = [];\n\n  addMatcher(dir: string, matcher: Ignore): void {\n    this.matchers.set(dir, matcher);\n  }\n\n  addAncestorMatcher(prefix: string, matcher: Ignore): void {\n    this.ancestors.push({ prefix, matcher });\n  }\n\n  /** `null` when no `.gitignore` was found, so callers skip the filter entirely. */\n  static async load(\n    root: string,\n    signal?: AbortSignal,\n    maxDepth?: number,\n    ignoreCeiling?: string,\n  ): Promise<GitignoreManager | null> {\n    const manager = new GitignoreManager();\n    try {\n      const gitignorePaths: string[] = [];\n      const gitignoreEntries = fsGlob('**/.gitignore', {\n        cwd: root,\n        // Skip what the walk itself skips, and stop one level past its depth\n        // bound: a .gitignore at depth d only affects entries at depth >= d.\n        exclude: (entry: string) => {\n          const name = basename(entry);\n          if (name === '.hg' || name === '.svn' || DEFAULT_EXCLUDED_NAMES.has(name)) return true;\n          return maxDepth !== undefined && toPosixPath(entry).split('/').length - 1 > maxDepth;\n        },\n      });\n      for await (const match of gitignoreEntries) {\n        if (signal?.aborted) break;\n        gitignorePaths.push(match);\n      }\n\n      await loadGitignoreFiles(root, gitignorePaths, manager, signal);\n      if (ignoreCeiling !== undefined) {\n        await loadAncestorGitignores(root, ignoreCeiling, manager, signal);\n      }\n    } catch (error) {\n      if (error instanceof Error && error.name === 'AbortError') throw error;\n      Logger.warn(\n        `Failed to enumerate .gitignore files under ${root}: ${formatUnknownErrorMessage(error)}`,\n      );\n    }\n    return manager.matchers.size === 0 && manager.ancestors.length === 0 ? null : manager;\n  }\n\n  isIgnored(relativePath: string, isDirectory: boolean): boolean {\n    const normalized = toPosixPath(relativePath);\n    if (normalized === '' || normalized === '.') return false;\n    const parts = normalized.split('/');\n\n    // 1. Check parent directories first\n    let currentDir = '';\n    for (let i = 0; i < parts.length - 1; i++) {\n      const part = parts[i];\n      if (!part) continue;\n      currentDir = currentDir ? `${currentDir}/${part}` : part;\n\n      if (this.checkPath(currentDir, true)) {\n        return true;\n      }\n    }\n\n    // 2. Check the file/directory itself\n    return this.checkPath(normalized, isDirectory);\n  }\n\n  private checkPath(posixPath: string, isDirectory: boolean): boolean {\n    const parts = posixPath.split('/');\n    const pathToCheck = isDirectory\n      ? posixPath.endsWith('/')\n        ? posixPath\n        : `${posixPath}/`\n      : posixPath;\n\n    let ignored = false;\n\n    for (const { prefix, matcher } of this.ancestors) {\n      const res = matcher.test(`${prefix}/${pathToCheck}`);\n      if (res.ignored) ignored = true;\n      if (res.unignored) ignored = false;\n    }\n\n    // Check root level\n    const rootMatcher = this.matchers.get('');\n    if (rootMatcher) {\n      const res = rootMatcher.test(pathToCheck);\n      if (res.ignored) ignored = true;\n      if (res.unignored) ignored = false;\n    }\n\n    // Check subdirectories\n    let currentDir = '';\n    for (let i = 0; i < parts.length - 1; i++) {\n      const part = parts[i];\n      if (!part) continue;\n      currentDir = currentDir ? `${currentDir}/${part}` : part;\n\n      const matcher = this.matchers.get(currentDir);\n      if (matcher) {\n        const relParts = parts.slice(i + 1);\n        const relPath = relParts.join('/');\n        const relPathToCheck = isDirectory\n          ? relPath.endsWith('/')\n            ? relPath\n            : `${relPath}/`\n          : relPath;\n\n        const res = matcher.test(relPathToCheck);\n        if (res.ignored) ignored = true;\n        if (res.unignored) ignored = false;\n      }\n    }\n\n    return ignored;\n  }\n}\n\ninterface GlobDirentLike extends DirentLike {\n  name: string;\n  parentPath: string;\n}\n\nexport interface GlobEntry {\n  path: string;\n  dirent: DirentLike;\n}\n\nexport interface GlobEntriesOptions {\n  cwd: string;\n  pattern: string;\n  includeHidden?: boolean;\n  baseNameMatch?: boolean;\n  maxDepth?: number;\n  onlyFiles?: boolean;\n  suppressErrors?: boolean;\n  /** Skip what a walk should not surface: DEFAULT_EXCLUDED_NAMES and .gitignore. */\n  skipIgnored?: boolean;\n  /**\n   * Topmost directory whose `.gitignore` may apply to this walk — the allowed\n   * root containing `cwd`. Ancestors of `cwd` up to and including it are\n   * consulted; nothing above it is ever read. Ignored without `skipIgnored`.\n   */\n  ignoreCeiling?: string;\n  /** Bounds the `.gitignore` discovery `skipIgnored` runs before the walk. */\n  signal?: AbortSignal;\n}\n\ninterface NormalizedGlob {\n  cwd: string;\n  patterns: readonly string[];\n  suppressErrors: boolean;\n  maxDepth?: number;\n}\n\nconst GLOB_MAGIC_RE = /[*?[\\]{}!]/u;\nconst GLOB_BATCH_CONCURRENCY = 64;\nconst SEP = '/';\nconst DOT_CHAR_CODE = 46;\nfunction normalizePattern(pattern: string, baseNameMatch: boolean): string {\n  const normalized = toPosixPath(pattern);\n\n  if (!baseNameMatch) return normalized;\n  if (normalized.includes(SEP)) return normalized;\n  return `**/${normalized}`;\n}\n\nfunction splitPatternPrefix(normalizedPattern: string): {\n  prefix: string;\n  remainder: string;\n} {\n  if (!GLOB_MAGIC_RE.test(normalizedPattern)) {\n    return { prefix: '', remainder: normalizedPattern };\n  }\n\n  const segments = normalizedPattern.split(SEP);\n  const splitIndex = segments.findIndex((seg) => GLOB_MAGIC_RE.test(seg));\n\n  if (splitIndex <= 0) {\n    return { prefix: '', remainder: normalizedPattern };\n  }\n\n  return {\n    prefix: segments.slice(0, splitIndex).join(SEP) + SEP,\n    remainder: segments.slice(splitIndex).join(SEP),\n  };\n}\n\nfunction addFirstDotSegment(patterns: Set<string>, prefix: string, remainder: string): void {\n  if (remainder.length === 0) return;\n  const segments = remainder.split(SEP);\n  const idx = segments.findIndex((seg) => seg !== '**' && seg.length > 0);\n\n  if (idx !== -1) {\n    const original = segments[idx];\n    if (original && original.charCodeAt(0) !== DOT_CHAR_CODE) {\n      const newSegments = [...segments];\n      newSegments[idx] = `.${original}`;\n      patterns.add(`${prefix}${newSegments.join(SEP)}`);\n    }\n  }\n}\n\nfunction expandHiddenGlobstars(patterns: Set<string>, prefix: string, remainder: string): void {\n  // Trailing bare globstar — `src/**`, `**` (remainder is exactly `**`, no\n  // following segment). The pattern itself already matches every non-dot\n  // entry under the prefix; add the two hidden complements fs.glob skips:\n  // dotfiles/dot-dirs anywhere, and the contents of dot-dirs anywhere.\n  if (remainder === '**') {\n    patterns.add(`${prefix}**/.*`);\n    patterns.add(`${prefix}**/.*/**`);\n    return;\n  }\n\n  if (!remainder.startsWith('**/')) return;\n\n  const afterGlobstar = remainder.slice(3);\n  // Node fs.glob skips leading-dot entries unless the matching segment itself\n  // starts with '.', and its `dot` option is not honored. So `**/*` alone misses\n  // hidden files. Two depth-agnostic patterns cover everything the per-depth\n  // unroll did: contents of dot-directories anywhere, and dotfiles/dotdirs\n  // anywhere.\n  patterns.add(`${prefix}**/.*/**/${afterGlobstar}`);\n  const addDotFile = afterGlobstar.length > 0 && afterGlobstar.charCodeAt(0) !== DOT_CHAR_CODE;\n  if (addDotFile) patterns.add(`${prefix}**/.${afterGlobstar}`);\n}\n\nfunction buildHiddenPatterns(normalizedPattern: string): readonly string[] {\n  const patterns = new Set<string>([normalizedPattern]);\n  const { prefix, remainder } = splitPatternPrefix(normalizedPattern);\n\n  addFirstDotSegment(patterns, prefix, remainder);\n  expandHiddenGlobstars(patterns, prefix, remainder);\n\n  return Array.from(patterns);\n}\n\nfunction normalizeGlobOptions(options: GlobEntriesOptions): NormalizedGlob {\n  const cwd = resolve(options.cwd);\n  const normalizedPattern = normalizePattern(options.pattern, options.baseNameMatch ?? false);\n\n  const patterns = options.includeHidden\n    ? buildHiddenPatterns(normalizedPattern)\n    : [normalizedPattern];\n\n  const normalized: NormalizedGlob = {\n    cwd,\n    patterns,\n    suppressErrors: options.suppressErrors ?? false,\n  };\n\n  if (options.maxDepth !== undefined) {\n    normalized.maxDepth = options.maxDepth;\n  }\n\n  return normalized;\n}\n\nfunction* processDirentMatch(\n  match: GlobDirentLike,\n  cwd: string,\n  maxDepth: number | undefined,\n  seen: Set<string>,\n  onlyFiles: boolean,\n): Generator<GlobEntry> {\n  const absolutePath = resolve(cwd, match.parentPath, match.name);\n\n  if (maxDepth !== undefined) {\n    const rel = relative(cwd, absolutePath);\n    if (rel.split(/[/\\\\]/u).length - 1 > maxDepth) return;\n  }\n\n  if (seen.has(absolutePath)) return;\n  seen.add(absolutePath);\n\n  if (onlyFiles && !match.isFile()) return;\n  yield { path: absolutePath, dirent: match };\n}\n\ninterface WalkFilter {\n  /** Given to fs.glob: true stops descent into a directory. */\n  prune: (match: GlobDirentLike) => boolean;\n  /** Re-applied to yielded entries: the ignore rules only, never the depth bound. */\n  isExcluded: (match: GlobDirentLike) => boolean;\n}\n\nfunction createWalkFilter(\n  cwd: string,\n  skipIgnored: boolean,\n  gitignoreMatcher: GitignoreManager | null,\n  maxDepth: number | undefined,\n): WalkFilter | undefined {\n  if (!skipIgnored && maxDepth === undefined) return undefined;\n\n  // fs.glob can hand the predicate a dirent whose parentPath is \".\" — the walk\n  // root, not the process cwd — when it re-visits a directory under `**` whose\n  // name also exists in the process cwd. Resolving against `cwd` names the\n  // entry the dirent describes; `join` would resolve it against the process.\n  const relativeOf = (match: GlobDirentLike): string =>\n    toPosixPath(relative(cwd, resolve(cwd, match.parentPath, match.name)));\n  // Every default exclude is a bare name that applies at any depth, so a Set\n  // lookup per segment replaces compiling dozens of globs per entry.\n  const excluded = (posixRel: string, isDir: boolean): boolean =>\n    skipIgnored &&\n    (posixRel.split('/').some((segment) => DEFAULT_EXCLUDED_NAMES.has(segment)) ||\n      (gitignoreMatcher?.isIgnored(posixRel, isDir) ?? false));\n\n  return {\n    prune: (match) => {\n      const posixRel = relativeOf(match);\n      const isDir = match.isDirectory();\n      if (excluded(posixRel, isDir)) return true;\n      // Stop descent one level past the depth bound. Pruning a directory *at*\n      // the bound would drop it where fs.glob treats it as top-level, so prune\n      // its children instead; processDirentMatch drops that extra level.\n      if (maxDepth === undefined || !isDir) return false;\n      return posixRel.split('/').length - 1 > maxDepth;\n    },\n    isExcluded: (match) => excluded(relativeOf(match), match.isDirectory()),\n  };\n}\n\nasync function* processGlobPattern(\n  pattern: string,\n  plan: NormalizedGlob,\n  seen: Set<string>,\n  onlyFiles: boolean,\n  filter: WalkFilter | undefined,\n): AsyncGenerator<GlobEntry> {\n  const { cwd, maxDepth, suppressErrors } = plan;\n  let iterable: AsyncIterable<GlobDirentLike>;\n  try {\n    iterable = fsGlob(pattern, {\n      cwd,\n      ...(filter ? { exclude: filter.prune } : {}),\n      withFileTypes: true,\n    }) as AsyncIterable<GlobDirentLike>;\n  } catch (error) {\n    if (suppressErrors) return;\n    throw error;\n  }\n\n  try {\n    for await (const match of iterable) {\n      // A function `exclude` only prunes descent in fs.glob — it still yields\n      // the rejected dirent itself, and any rejected entry below the top level.\n      // Re-apply the ignore rules (not the depth bound) to drop those.\n      if (filter?.isExcluded(match)) continue;\n      yield* processDirentMatch(match, cwd, maxDepth, seen, onlyFiles);\n    }\n  } catch (error) {\n    if (!suppressErrors) throw error;\n    Logger.warn(\n      `globEntries: suppressed mid-walk error for pattern \"${pattern}\": ${formatUnknownErrorMessage(error)}`,\n    );\n  }\n}\n\nexport async function* globEntries(options: GlobEntriesOptions): AsyncGenerator<GlobEntry> {\n  const gitignoreMatcher = options.skipIgnored\n    ? await GitignoreManager.load(\n        options.cwd,\n        options.signal,\n        options.maxDepth,\n        options.ignoreCeiling,\n      )\n    : null;\n\n  const plan = normalizeGlobOptions(options);\n  const seen = new Set<string>();\n  const onlyFiles = options.onlyFiles ?? true;\n  const filter = createWalkFilter(\n    plan.cwd,\n    options.skipIgnored ?? false,\n    gitignoreMatcher,\n    plan.maxDepth,\n  );\n\n  for (const pattern of plan.patterns) {\n    yield* processGlobPattern(pattern, plan, seen, onlyFiles, filter);\n  }\n}\n\n/** Names a `skipIgnored` walk never enters or yields, at any depth. */\nconst DEFAULT_EXCLUDED_NAMES: ReadonlySet<string> = new Set([\n  'node_modules',\n  'dist',\n  'build',\n  'coverage',\n  '.git',\n  '.vscode',\n  '.idea',\n  '.DS_Store',\n  '.next',\n  '.nuxt',\n  '.output',\n  '.svelte-kit',\n  '.cache',\n  '.yarn',\n  'jspm_packages',\n  'bower_components',\n  'out',\n  'tmp',\n  '.temp',\n  'npm-debug.log',\n  'yarn-debug.log',\n  'yarn-error.log',\n  'Thumbs.db',\n]);\n"]}
+{"version":3,"file":"glob.js","sourceRoot":"","sources":["../../src/core/glob.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,IAAI,MAAM,EAAE,QAAQ,IAAI,UAAU,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACjF,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAGnF,OAAO,MAAM,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAE,yBAAyB,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAE5C,OAAO,EAAE,qBAAqB,EAAE,0BAA0B,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AACjG,OAAO,EAAE,GAAG,EAAE,MAAM,WAAW,CAAC;AAEhC,yFAAyF;AACzF,MAAM,mBAAmB,GAAG,iCAAiC,CAAC;AAE9D,MAAM,UAAU,gBAAgB,CAAC,OAAe;IAC9C,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,0BAA0B,CAAC,OAAO,CAAC,EAAE,CAAC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,uEAAuE;IACvE,4EAA4E;IAC5E,0EAA0E;IAC1E,kDAAkD;IAClD,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QACtC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,oFAAoF;AACpF,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC,KAAK,UAAU,kBAAkB,CAC/B,IAAY,EACZ,cAAiC,EACjC,OAAyB,EACzB,MAAoB;IAEpB,MAAM,iBAAiB,CACrB,cAAc,EACd,KAAK,EAAE,OAAO,EAAE,EAAE;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACpC,IAAI,CAAC;YACH,mEAAmE;YACnE,sEAAsE;YACtE,0BAA0B;YAC1B,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,IAAI,GAAG,mBAAmB;gBAAE,OAAO;YAC9D,MAAM,QAAQ,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;YAC1E,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtB,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;YAC1C,OAAO,CAAC,UAAU,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACtD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY;gBAAE,MAAM,KAAK,CAAC;YACvE,MAAM,CAAC,IAAI,CAAC,gCAAgC,OAAO,KAAK,yBAAyB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC9F,CAAC;IACH,CAAC,EACD,sBAAsB,EACtB,MAAM,CACP,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,sBAAsB,CACnC,IAAY,EACZ,OAAe,EACf,OAAyB,EACzB,MAAoB;IAEpB,MAAM,iBAAiB,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAI,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5D,IAAI,CAAC,qBAAqB,CAAC,iBAAiB,EAAE,GAAG,CAAC;YAAE,MAAM;QAC1D,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,IACE,CAAC,qBAAqB,CAAC,GAAG,EAAE,iBAAiB,CAAC;YAC5C,qBAAqB,CAAC,iBAAiB,EAAE,GAAG,CAAC,CAAC;YAChD,OAAO,CAAC,GAAG,CAAC,KAAK,GAAG,EACpB,CAAC;YACD,MAAM;QACR,CAAC;IACH,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAClC,MAAM,EAAE,cAAc,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QACrC,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,IAAI,GAAG,mBAAmB;gBAAE,SAAS;YAChE,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,UAAU,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YACpF,MAAM,MAAM,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;YAChD,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,OAAO;gBAAE,SAAS;YACjD,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC9C,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY;gBAAE,MAAM,KAAK,CAAC;YACvE,yGAAyG;QAC3G,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,gBAAgB;IACZ,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,4HAA4H;IACpH,SAAS,GAA0C,EAAE,CAAC;IAE9D,UAAU,CAAC,GAAW,EAAE,OAAe;QACrC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAClC,CAAC;IAED,kBAAkB,CAAC,MAAc,EAAE,OAAe;QAChD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED,kFAAkF;IAClF,MAAM,CAAC,KAAK,CAAC,IAAI,CACf,IAAY,EACZ,MAAoB,EACpB,QAAiB,EACjB,aAAsB;QAEtB,MAAM,OAAO,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACvC,IAAI,CAAC;YACH,MAAM,cAAc,GAAa,EAAE,CAAC;YACpC,MAAM,gBAAgB,GAAG,MAAM,CAAC,eAAe,EAAE;gBAC/C,GAAG,EAAE,IAAI;gBACT,qEAAqE;gBACrE,qEAAqE;gBACrE,OAAO,EAAE,CAAC,KAAa,EAAE,EAAE;oBACzB,IAAI,MAAM,EAAE,OAAO;wBAAE,OAAO,IAAI,CAAC;oBACjC,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAC7B,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,MAAM,IAAI,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,OAAO,IAAI,CAAC;oBACvF,OAAO,QAAQ,KAAK,SAAS,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC;gBACvF,CAAC;aACF,CAAC,CAAC;YACH,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,IAAI,MAAM,EAAE,OAAO;oBAAE,MAAM;gBAC3B,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;YAED,MAAM,kBAAkB,CAAC,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;YAChE,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBAChC,MAAM,sBAAsB,CAAC,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY;gBAAE,MAAM,KAAK,CAAC;YACvE,MAAM,CAAC,IAAI,CACT,8CAA8C,IAAI,KAAK,yBAAyB,CAAC,KAAK,CAAC,EAAE,CAC1F,CAAC;QACJ,CAAC;QACD,OAAO,OAAO,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;IACxF,CAAC;IAED,SAAS,CAAC,YAAoB,EAAE,WAAoB;QAClD,MAAM,UAAU,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;QAC7C,IAAI,UAAU,KAAK,EAAE,IAAI,UAAU,KAAK,GAAG;YAAE,OAAO,KAAK,CAAC;QAC1D,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEpC,oCAAoC;QACpC,IAAI,UAAU,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAEzD,IAAI,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,EAAE,CAAC;gBACrC,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;IACjD,CAAC;IAEO,SAAS,CAAC,SAAiB,EAAE,WAAoB;QACvD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,WAAW,GAAG,WAAW;YAC7B,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC;gBACvB,CAAC,CAAC,SAAS;gBACX,CAAC,CAAC,GAAG,SAAS,GAAG;YACnB,CAAC,CAAC,SAAS,CAAC;QAEd,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,KAAK,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACjD,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,WAAW,EAAE,CAAC,CAAC;YACrD,IAAI,GAAG,CAAC,OAAO;gBAAE,OAAO,GAAG,IAAI,CAAC;YAChC,IAAI,GAAG,CAAC,SAAS;gBAAE,OAAO,GAAG,KAAK,CAAC;QACrC,CAAC;QAED,mBAAmB;QACnB,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC1C,IAAI,GAAG,CAAC,OAAO;gBAAE,OAAO,GAAG,IAAI,CAAC;YAChC,IAAI,GAAG,CAAC,SAAS;gBAAE,OAAO,GAAG,KAAK,CAAC;QACrC,CAAC;QAED,uBAAuB;QACvB,IAAI,UAAU,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAEzD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC9C,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpC,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACnC,MAAM,cAAc,GAAG,WAAW;oBAChC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC;wBACrB,CAAC,CAAC,OAAO;wBACT,CAAC,CAAC,GAAG,OAAO,GAAG;oBACjB,CAAC,CAAC,OAAO,CAAC;gBAEZ,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBACzC,IAAI,GAAG,CAAC,OAAO;oBAAE,OAAO,GAAG,IAAI,CAAC;gBAChC,IAAI,GAAG,CAAC,SAAS;oBAAE,OAAO,GAAG,KAAK,CAAC;YACrC,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAuCD,MAAM,aAAa,GAAG,aAAa,CAAC;AACpC,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAClC,MAAM,GAAG,GAAG,GAAG,CAAC;AAChB,MAAM,aAAa,GAAG,EAAE,CAAC;AACzB,SAAS,gBAAgB,CAAC,OAAe,EAAE,aAAsB;IAC/D,MAAM,UAAU,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IAExC,IAAI,CAAC,aAAa;QAAE,OAAO,UAAU,CAAC;IACtC,IAAI,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,UAAU,CAAC;IAChD,OAAO,MAAM,UAAU,EAAE,CAAC;AAC5B,CAAC;AAED,SAAS,kBAAkB,CAAC,iBAAyB;IAInD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAC3C,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,iBAAiB,EAAE,CAAC;IACtD,CAAC;IAED,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC9C,MAAM,UAAU,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAExE,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;QACpB,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,iBAAiB,EAAE,CAAC;IACtD,CAAC;IAED,OAAO;QACL,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG;QACrD,SAAS,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;KAChD,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CAAC,QAAqB,EAAE,MAAc,EAAE,SAAiB;IAClF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IACnC,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACtC,MAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAExE,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;QACf,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,QAAQ,IAAI,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,CAAC;YACzD,MAAM,WAAW,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;YAClC,WAAW,CAAC,GAAG,CAAC,GAAG,IAAI,QAAQ,EAAE,CAAC;YAClC,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAAC,QAAqB,EAAE,MAAc,EAAE,SAAiB;IACrF,yEAAyE;IACzE,uEAAuE;IACvE,wEAAwE;IACxE,qEAAqE;IACrE,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;QACvB,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC;QAC/B,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,UAAU,CAAC,CAAC;QAClC,OAAO;IACT,CAAC;IAED,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,KAAK,CAAC;QAAE,OAAO;IAEzC,MAAM,aAAa,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACzC,4EAA4E;IAC5E,+EAA+E;IAC/E,2EAA2E;IAC3E,yEAAyE;IACzE,YAAY;IACZ,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,YAAY,aAAa,EAAE,CAAC,CAAC;IACnD,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,aAAa,CAAC;IAC7F,IAAI,UAAU;QAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,OAAO,aAAa,EAAE,CAAC,CAAC;AAChE,CAAC;AAED,SAAS,mBAAmB,CAAC,iBAAyB;IACpD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC;IACtD,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,CAAC;IAEpE,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IAChD,qBAAqB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IAEnD,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,oBAAoB,CAAC,OAA2B;IACvD,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACjC,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,aAAa,IAAI,KAAK,CAAC,CAAC;IAE5F,MAAM,QAAQ,GAAG,OAAO,CAAC,aAAa;QACpC,CAAC,CAAC,mBAAmB,CAAC,iBAAiB,CAAC;QACxC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC;IAExB,MAAM,UAAU,GAAmB;QACjC,GAAG;QACH,QAAQ;QACR,cAAc,EAAE,OAAO,CAAC,cAAc,IAAI,KAAK;KAChD,CAAC;IAEF,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QACnC,UAAU,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;IACzC,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,QAAQ,CAAC,CAAC,kBAAkB,CAC1B,KAAqB,EACrB,GAAW,EACX,QAA4B,EAC5B,IAAiB,EACjB,SAAkB;IAElB,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAEhE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QACxC,IAAI,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,QAAQ;YAAE,OAAO;IACxD,CAAC;IAED,IAAI,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC;QAAE,OAAO;IACnC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAEvB,IAAI,SAAS,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;QAAE,OAAO;IACzC,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AAC9C,CAAC;AASD,SAAS,gBAAgB,CACvB,GAAW,EACX,WAAoB,EACpB,gBAAyC,EACzC,QAA4B,EAC5B,MAA+B;IAE/B,IAAI,CAAC,WAAW,IAAI,QAAQ,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAErF,6EAA6E;IAC7E,6EAA6E;IAC7E,yEAAyE;IACzE,2EAA2E;IAC3E,MAAM,UAAU,GAAG,CAAC,KAAqB,EAAU,EAAE,CACnD,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzE,2EAA2E;IAC3E,mEAAmE;IACnE,MAAM,QAAQ,GAAG,CAAC,QAAgB,EAAE,KAAc,EAAW,EAAE,CAC7D,WAAW;QACX,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACzE,CAAC,gBAAgB,EAAE,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;IAE7D,OAAO;QACL,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;YACf,uEAAuE;YACvE,yEAAyE;YACzE,IAAI,MAAM,EAAE,OAAO;gBAAE,OAAO,IAAI,CAAC;YACjC,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,IAAI,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3C,wEAAwE;YACxE,yEAAyE;YACzE,mEAAmE;YACnE,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;YACnD,OAAO,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC;QACnD,CAAC;QACD,UAAU,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC;KACxE,CAAC;AACJ,CAAC;AAED,KAAK,SAAS,CAAC,CAAC,kBAAkB,CAChC,OAAe,EACf,IAAoB,EACpB,IAAiB,EACjB,SAAkB,EAClB,MAA8B,EAC9B,MAA+B;IAE/B,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,cAAc,EAAE,GAAG,IAAI,CAAC;IAC/C,IAAI,QAAuC,CAAC;IAC5C,IAAI,CAAC;QACH,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE;YACzB,GAAG;YACH,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5C,aAAa,EAAE,IAAI;SACpB,CAAkC,CAAC;IACtC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,cAAc;YAAE,OAAO;QAC3B,MAAM,KAAK,CAAC;IACd,CAAC;IAED,IAAI,CAAC;QACH,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YACnC,IAAI,MAAM,EAAE,OAAO;gBAAE,MAAM;YAC3B,wEAAwE;YACxE,0EAA0E;YAC1E,iEAAiE;YACjE,IAAI,MAAM,EAAE,UAAU,CAAC,KAAK,CAAC;gBAAE,SAAS;YACxC,KAAK,CAAC,CAAC,kBAAkB,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,cAAc;YAAE,MAAM,KAAK,CAAC;QACjC,MAAM,CAAC,IAAI,CACT,uDAAuD,OAAO,MAAM,yBAAyB,CAAC,KAAK,CAAC,EAAE,CACvG,CAAC;IACJ,CAAC;IACD,6EAA6E;IAC7E,uDAAuD;IACvD,MAAM,EAAE,cAAc,EAAE,CAAC;AAC3B,CAAC;AAED,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,WAAW,CAAC,OAA2B;IAC5D,MAAM,gBAAgB,GAAG,OAAO,CAAC,WAAW;QAC1C,CAAC,CAAC,MAAM,gBAAgB,CAAC,IAAI,CACzB,OAAO,CAAC,GAAG,EACX,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,aAAa,CACtB;QACH,CAAC,CAAC,IAAI,CAAC;IAET,MAAM,IAAI,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;IAC5C,MAAM,MAAM,GAAG,gBAAgB,CAC7B,IAAI,CAAC,GAAG,EACR,OAAO,CAAC,WAAW,IAAI,KAAK,EAC5B,gBAAgB,EAChB,IAAI,CAAC,QAAQ,EACb,OAAO,CAAC,MAAM,CACf,CAAC;IAEF,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QACpC,KAAK,CAAC,CAAC,kBAAkB,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IACpF,CAAC;AACH,CAAC;AAED,uEAAuE;AACvE,MAAM,sBAAsB,GAAwB,IAAI,GAAG,CAAC;IAC1D,cAAc;IACd,MAAM;IACN,OAAO;IACP,UAAU;IACV,MAAM;IACN,SAAS;IACT,OAAO;IACP,WAAW;IACX,OAAO;IACP,OAAO;IACP,SAAS;IACT,aAAa;IACb,QAAQ;IACR,OAAO;IACP,eAAe;IACf,kBAAkB;IAClB,KAAK;IACL,KAAK;IACL,OAAO;IACP,eAAe;IACf,gBAAgB;IAChB,gBAAgB;IAChB,WAAW;CACZ,CAAC,CAAC","sourcesContent":["import { glob as fsGlob, readFile as fsReadFile, lstat } from 'node:fs/promises';\nimport { basename, dirname, isAbsolute, join, relative, resolve } from 'node:path';\n\nimport type { Ignore } from 'ignore';\nimport ignore from 'ignore';\n\nimport { processInParallel } from './concurrency.ts';\nimport { formatUnknownErrorMessage } from './errors.ts';\nimport { Logger } from './observability.ts';\nimport type { DirentLike } from './path-utils.ts';\nimport { isPathInsideDirectory, isWindowsDriveRelativePath, toPosixPath } from './path-utils.ts';\nimport { MIB } from './util.ts';\n\n/** `..` bounded on both sides by a separator, a brace delimiter, or the pattern edge. */\nconst TRAVERSAL_DOTDOT_RE = /(?:^|[/\\\\{,])\\.\\.(?=[/\\\\},]|$)/u;\n\nexport function isSafeGlobSyntax(pattern: string): boolean {\n  if (!pattern || pattern.trim().length === 0) {\n    return false;\n  }\n  if (isAbsolute(pattern)) {\n    return false;\n  }\n  if (isWindowsDriveRelativePath(pattern)) {\n    return false;\n  }\n  // Only a whole `..` — a path segment, or one alternative of a `{a,..}`\n  // brace set — can traverse. `..` inside a segment (`[...slug]`, `v1..2.md`,\n  // `[..]`) is a literal name or a character class, and PathGuard re-checks\n  // containment on every resolved entry regardless.\n  if (TRAVERSAL_DOTDOT_RE.test(pattern)) {\n    return false;\n  }\n  return true;\n}\n\n/** A .gitignore past this size is not a .gitignore; skip it rather than read it. */\nconst MAX_GITIGNORE_BYTES = MIB;\n\nasync function loadGitignoreFiles(\n  root: string,\n  gitignorePaths: readonly string[],\n  manager: GitignoreManager,\n  signal?: AbortSignal,\n): Promise<void> {\n  await processInParallel(\n    gitignorePaths,\n    async (relPath) => {\n      const absPath = join(root, relPath);\n      try {\n        // lstat, not stat: a symlinked .gitignore may point at a device, a\n        // FIFO or a huge file outside the root. Only a plain, small file is a\n        // rule set worth reading.\n        const info = await lstat(absPath);\n        if (!info.isFile() || info.size > MAX_GITIGNORE_BYTES) return;\n        const contents = await fsReadFile(absPath, { encoding: 'utf-8', signal });\n        const matcher = ignore();\n        matcher.add(contents);\n        const dir = toPosixPath(dirname(relPath));\n        manager.addMatcher(dir === '.' ? '' : dir, matcher);\n      } catch (error) {\n        if (error instanceof Error && error.name === 'AbortError') throw error;\n        Logger.warn(`Failed to read .gitignore at ${absPath}: ${formatUnknownErrorMessage(error)}`);\n      }\n    },\n    GLOB_BATCH_CONCURRENCY,\n    signal,\n  );\n}\n\n/**\n * Load `.gitignore` from each ancestor of `root` up to and including `ceiling`,\n * farthest first. A rule set that ignores `root` itself is skipped: the caller\n * named that directory on purpose, and applying the rule would empty the walk.\n */\nasync function loadAncestorGitignores(\n  root: string,\n  ceiling: string,\n  manager: GitignoreManager,\n  signal?: AbortSignal,\n): Promise<void> {\n  const normalizedCeiling = resolve(ceiling);\n  const chain: string[] = [];\n  for (let dir = dirname(resolve(root)); ; dir = dirname(dir)) {\n    if (!isPathInsideDirectory(normalizedCeiling, dir)) break;\n    chain.push(dir);\n    if (\n      (isPathInsideDirectory(dir, normalizedCeiling) &&\n        isPathInsideDirectory(normalizedCeiling, dir)) ||\n      dirname(dir) === dir\n    ) {\n      break;\n    }\n  }\n  for (const dir of chain.reverse()) {\n    signal?.throwIfAborted();\n    const file = join(dir, '.gitignore');\n    try {\n      const info = await lstat(file);\n      if (!info.isFile() || info.size > MAX_GITIGNORE_BYTES) continue;\n      const matcher = ignore().add(await fsReadFile(file, { encoding: 'utf-8', signal }));\n      const prefix = toPosixPath(relative(dir, root));\n      if (matcher.test(`${prefix}/`).ignored) continue;\n      manager.addAncestorMatcher(prefix, matcher);\n    } catch (error) {\n      if (error instanceof Error && error.name === 'AbortError') throw error;\n      // ENOENT is the normal case (no .gitignore at this level); anything else is not worth a warning per walk\n    }\n  }\n}\n\nclass GitignoreManager {\n  private matchers = new Map<string, Ignore>();\n  /** Rules from directories above the walk root, farthest first; `prefix` re-bases a walk-relative path to that directory. */\n  private ancestors: { prefix: string; matcher: Ignore }[] = [];\n\n  addMatcher(dir: string, matcher: Ignore): void {\n    this.matchers.set(dir, matcher);\n  }\n\n  addAncestorMatcher(prefix: string, matcher: Ignore): void {\n    this.ancestors.push({ prefix, matcher });\n  }\n\n  /** `null` when no `.gitignore` was found, so callers skip the filter entirely. */\n  static async load(\n    root: string,\n    signal?: AbortSignal,\n    maxDepth?: number,\n    ignoreCeiling?: string,\n  ): Promise<GitignoreManager | null> {\n    const manager = new GitignoreManager();\n    try {\n      const gitignorePaths: string[] = [];\n      const gitignoreEntries = fsGlob('**/.gitignore', {\n        cwd: root,\n        // Skip what the walk itself skips, and stop one level past its depth\n        // bound: a .gitignore at depth d only affects entries at depth >= d.\n        exclude: (entry: string) => {\n          if (signal?.aborted) return true;\n          const name = basename(entry);\n          if (name === '.hg' || name === '.svn' || DEFAULT_EXCLUDED_NAMES.has(name)) return true;\n          return maxDepth !== undefined && toPosixPath(entry).split('/').length - 1 > maxDepth;\n        },\n      });\n      for await (const match of gitignoreEntries) {\n        if (signal?.aborted) break;\n        gitignorePaths.push(match);\n      }\n\n      await loadGitignoreFiles(root, gitignorePaths, manager, signal);\n      if (ignoreCeiling !== undefined) {\n        await loadAncestorGitignores(root, ignoreCeiling, manager, signal);\n      }\n    } catch (error) {\n      if (error instanceof Error && error.name === 'AbortError') throw error;\n      Logger.warn(\n        `Failed to enumerate .gitignore files under ${root}: ${formatUnknownErrorMessage(error)}`,\n      );\n    }\n    return manager.matchers.size === 0 && manager.ancestors.length === 0 ? null : manager;\n  }\n\n  isIgnored(relativePath: string, isDirectory: boolean): boolean {\n    const normalized = toPosixPath(relativePath);\n    if (normalized === '' || normalized === '.') return false;\n    const parts = normalized.split('/');\n\n    // 1. Check parent directories first\n    let currentDir = '';\n    for (let i = 0; i < parts.length - 1; i++) {\n      const part = parts[i];\n      if (!part) continue;\n      currentDir = currentDir ? `${currentDir}/${part}` : part;\n\n      if (this.checkPath(currentDir, true)) {\n        return true;\n      }\n    }\n\n    // 2. Check the file/directory itself\n    return this.checkPath(normalized, isDirectory);\n  }\n\n  private checkPath(posixPath: string, isDirectory: boolean): boolean {\n    const parts = posixPath.split('/');\n    const pathToCheck = isDirectory\n      ? posixPath.endsWith('/')\n        ? posixPath\n        : `${posixPath}/`\n      : posixPath;\n\n    let ignored = false;\n\n    for (const { prefix, matcher } of this.ancestors) {\n      const res = matcher.test(`${prefix}/${pathToCheck}`);\n      if (res.ignored) ignored = true;\n      if (res.unignored) ignored = false;\n    }\n\n    // Check root level\n    const rootMatcher = this.matchers.get('');\n    if (rootMatcher) {\n      const res = rootMatcher.test(pathToCheck);\n      if (res.ignored) ignored = true;\n      if (res.unignored) ignored = false;\n    }\n\n    // Check subdirectories\n    let currentDir = '';\n    for (let i = 0; i < parts.length - 1; i++) {\n      const part = parts[i];\n      if (!part) continue;\n      currentDir = currentDir ? `${currentDir}/${part}` : part;\n\n      const matcher = this.matchers.get(currentDir);\n      if (matcher) {\n        const relParts = parts.slice(i + 1);\n        const relPath = relParts.join('/');\n        const relPathToCheck = isDirectory\n          ? relPath.endsWith('/')\n            ? relPath\n            : `${relPath}/`\n          : relPath;\n\n        const res = matcher.test(relPathToCheck);\n        if (res.ignored) ignored = true;\n        if (res.unignored) ignored = false;\n      }\n    }\n\n    return ignored;\n  }\n}\n\ninterface GlobDirentLike extends DirentLike {\n  name: string;\n  parentPath: string;\n}\n\nexport interface GlobEntry {\n  path: string;\n  dirent: DirentLike;\n}\n\nexport interface GlobEntriesOptions {\n  cwd: string;\n  pattern: string;\n  includeHidden?: boolean;\n  baseNameMatch?: boolean;\n  maxDepth?: number;\n  onlyFiles?: boolean;\n  suppressErrors?: boolean;\n  /** Skip what a walk should not surface: DEFAULT_EXCLUDED_NAMES and .gitignore. */\n  skipIgnored?: boolean;\n  /**\n   * Topmost directory whose `.gitignore` may apply to this walk — the allowed\n   * root containing `cwd`. Ancestors of `cwd` up to and including it are\n   * consulted; nothing above it is ever read. Ignored without `skipIgnored`.\n   */\n  ignoreCeiling?: string;\n  /** Bounds the `.gitignore` discovery `skipIgnored` runs before the walk. */\n  signal?: AbortSignal;\n}\n\ninterface NormalizedGlob {\n  cwd: string;\n  patterns: readonly string[];\n  suppressErrors: boolean;\n  maxDepth?: number;\n}\n\nconst GLOB_MAGIC_RE = /[*?[\\]{}!]/u;\nconst GLOB_BATCH_CONCURRENCY = 64;\nconst SEP = '/';\nconst DOT_CHAR_CODE = 46;\nfunction normalizePattern(pattern: string, baseNameMatch: boolean): string {\n  const normalized = toPosixPath(pattern);\n\n  if (!baseNameMatch) return normalized;\n  if (normalized.includes(SEP)) return normalized;\n  return `**/${normalized}`;\n}\n\nfunction splitPatternPrefix(normalizedPattern: string): {\n  prefix: string;\n  remainder: string;\n} {\n  if (!GLOB_MAGIC_RE.test(normalizedPattern)) {\n    return { prefix: '', remainder: normalizedPattern };\n  }\n\n  const segments = normalizedPattern.split(SEP);\n  const splitIndex = segments.findIndex((seg) => GLOB_MAGIC_RE.test(seg));\n\n  if (splitIndex <= 0) {\n    return { prefix: '', remainder: normalizedPattern };\n  }\n\n  return {\n    prefix: segments.slice(0, splitIndex).join(SEP) + SEP,\n    remainder: segments.slice(splitIndex).join(SEP),\n  };\n}\n\nfunction addFirstDotSegment(patterns: Set<string>, prefix: string, remainder: string): void {\n  if (remainder.length === 0) return;\n  const segments = remainder.split(SEP);\n  const idx = segments.findIndex((seg) => seg !== '**' && seg.length > 0);\n\n  if (idx !== -1) {\n    const original = segments[idx];\n    if (original && original.charCodeAt(0) !== DOT_CHAR_CODE) {\n      const newSegments = [...segments];\n      newSegments[idx] = `.${original}`;\n      patterns.add(`${prefix}${newSegments.join(SEP)}`);\n    }\n  }\n}\n\nfunction expandHiddenGlobstars(patterns: Set<string>, prefix: string, remainder: string): void {\n  // Trailing bare globstar — `src/**`, `**` (remainder is exactly `**`, no\n  // following segment). The pattern itself already matches every non-dot\n  // entry under the prefix; add the two hidden complements fs.glob skips:\n  // dotfiles/dot-dirs anywhere, and the contents of dot-dirs anywhere.\n  if (remainder === '**') {\n    patterns.add(`${prefix}**/.*`);\n    patterns.add(`${prefix}**/.*/**`);\n    return;\n  }\n\n  if (!remainder.startsWith('**/')) return;\n\n  const afterGlobstar = remainder.slice(3);\n  // Node fs.glob skips leading-dot entries unless the matching segment itself\n  // starts with '.', and its `dot` option is not honored. So `**/*` alone misses\n  // hidden files. Two depth-agnostic patterns cover everything the per-depth\n  // unroll did: contents of dot-directories anywhere, and dotfiles/dotdirs\n  // anywhere.\n  patterns.add(`${prefix}**/.*/**/${afterGlobstar}`);\n  const addDotFile = afterGlobstar.length > 0 && afterGlobstar.charCodeAt(0) !== DOT_CHAR_CODE;\n  if (addDotFile) patterns.add(`${prefix}**/.${afterGlobstar}`);\n}\n\nfunction buildHiddenPatterns(normalizedPattern: string): readonly string[] {\n  const patterns = new Set<string>([normalizedPattern]);\n  const { prefix, remainder } = splitPatternPrefix(normalizedPattern);\n\n  addFirstDotSegment(patterns, prefix, remainder);\n  expandHiddenGlobstars(patterns, prefix, remainder);\n\n  return Array.from(patterns);\n}\n\nfunction normalizeGlobOptions(options: GlobEntriesOptions): NormalizedGlob {\n  const cwd = resolve(options.cwd);\n  const normalizedPattern = normalizePattern(options.pattern, options.baseNameMatch ?? false);\n\n  const patterns = options.includeHidden\n    ? buildHiddenPatterns(normalizedPattern)\n    : [normalizedPattern];\n\n  const normalized: NormalizedGlob = {\n    cwd,\n    patterns,\n    suppressErrors: options.suppressErrors ?? false,\n  };\n\n  if (options.maxDepth !== undefined) {\n    normalized.maxDepth = options.maxDepth;\n  }\n\n  return normalized;\n}\n\nfunction* processDirentMatch(\n  match: GlobDirentLike,\n  cwd: string,\n  maxDepth: number | undefined,\n  seen: Set<string>,\n  onlyFiles: boolean,\n): Generator<GlobEntry> {\n  const absolutePath = resolve(cwd, match.parentPath, match.name);\n\n  if (maxDepth !== undefined) {\n    const rel = relative(cwd, absolutePath);\n    if (rel.split(/[/\\\\]/u).length - 1 > maxDepth) return;\n  }\n\n  if (seen.has(absolutePath)) return;\n  seen.add(absolutePath);\n\n  if (onlyFiles && !match.isFile()) return;\n  yield { path: absolutePath, dirent: match };\n}\n\ninterface WalkFilter {\n  /** Given to fs.glob: true stops descent into a directory. */\n  prune: (match: GlobDirentLike) => boolean;\n  /** Re-applied to yielded entries: the ignore rules only, never the depth bound. */\n  isExcluded: (match: GlobDirentLike) => boolean;\n}\n\nfunction createWalkFilter(\n  cwd: string,\n  skipIgnored: boolean,\n  gitignoreMatcher: GitignoreManager | null,\n  maxDepth: number | undefined,\n  signal: AbortSignal | undefined,\n): WalkFilter | undefined {\n  if (!skipIgnored && maxDepth === undefined && signal === undefined) return undefined;\n\n  // fs.glob can hand the predicate a dirent whose parentPath is \".\" — the walk\n  // root, not the process cwd — when it re-visits a directory under `**` whose\n  // name also exists in the process cwd. Resolving against `cwd` names the\n  // entry the dirent describes; `join` would resolve it against the process.\n  const relativeOf = (match: GlobDirentLike): string =>\n    toPosixPath(relative(cwd, resolve(cwd, match.parentPath, match.name)));\n  // Every default exclude is a bare name that applies at any depth, so a Set\n  // lookup per segment replaces compiling dozens of globs per entry.\n  const excluded = (posixRel: string, isDir: boolean): boolean =>\n    skipIgnored &&\n    (posixRel.split('/').some((segment) => DEFAULT_EXCLUDED_NAMES.has(segment)) ||\n      (gitignoreMatcher?.isIgnored(posixRel, isDir) ?? false));\n\n  return {\n    prune: (match) => {\n      // fs.glob takes no signal and calls this for every entry it visits, so\n      // pruning everything is the only way to stop a walk that yields nothing.\n      if (signal?.aborted) return true;\n      const posixRel = relativeOf(match);\n      const isDir = match.isDirectory();\n      if (excluded(posixRel, isDir)) return true;\n      // Stop descent one level past the depth bound. Pruning a directory *at*\n      // the bound would drop it where fs.glob treats it as top-level, so prune\n      // its children instead; processDirentMatch drops that extra level.\n      if (maxDepth === undefined || !isDir) return false;\n      return posixRel.split('/').length - 1 > maxDepth;\n    },\n    isExcluded: (match) => excluded(relativeOf(match), match.isDirectory()),\n  };\n}\n\nasync function* processGlobPattern(\n  pattern: string,\n  plan: NormalizedGlob,\n  seen: Set<string>,\n  onlyFiles: boolean,\n  filter: WalkFilter | undefined,\n  signal: AbortSignal | undefined,\n): AsyncGenerator<GlobEntry> {\n  const { cwd, maxDepth, suppressErrors } = plan;\n  let iterable: AsyncIterable<GlobDirentLike>;\n  try {\n    iterable = fsGlob(pattern, {\n      cwd,\n      ...(filter ? { exclude: filter.prune } : {}),\n      withFileTypes: true,\n    }) as AsyncIterable<GlobDirentLike>;\n  } catch (error) {\n    if (suppressErrors) return;\n    throw error;\n  }\n\n  try {\n    for await (const match of iterable) {\n      if (signal?.aborted) break;\n      // A function `exclude` only prunes descent in fs.glob — it still yields\n      // the rejected dirent itself, and any rejected entry below the top level.\n      // Re-apply the ignore rules (not the depth bound) to drop those.\n      if (filter?.isExcluded(match)) continue;\n      yield* processDirentMatch(match, cwd, maxDepth, seen, onlyFiles);\n    }\n  } catch (error) {\n    if (!suppressErrors) throw error;\n    Logger.warn(\n      `globEntries: suppressed mid-walk error for pattern \"${pattern}\": ${formatUnknownErrorMessage(error)}`,\n    );\n  }\n  // A pruned walk ends like a finished one. Say it was cut short, so no caller\n  // reads \"the walk ended\" as \"the whole tree was seen\".\n  signal?.throwIfAborted();\n}\n\nexport async function* globEntries(options: GlobEntriesOptions): AsyncGenerator<GlobEntry> {\n  const gitignoreMatcher = options.skipIgnored\n    ? await GitignoreManager.load(\n        options.cwd,\n        options.signal,\n        options.maxDepth,\n        options.ignoreCeiling,\n      )\n    : null;\n\n  const plan = normalizeGlobOptions(options);\n  const seen = new Set<string>();\n  const onlyFiles = options.onlyFiles ?? true;\n  const filter = createWalkFilter(\n    plan.cwd,\n    options.skipIgnored ?? false,\n    gitignoreMatcher,\n    plan.maxDepth,\n    options.signal,\n  );\n\n  for (const pattern of plan.patterns) {\n    yield* processGlobPattern(pattern, plan, seen, onlyFiles, filter, options.signal);\n  }\n}\n\n/** Names a `skipIgnored` walk never enters or yields, at any depth. */\nconst DEFAULT_EXCLUDED_NAMES: ReadonlySet<string> = new Set([\n  'node_modules',\n  'dist',\n  'build',\n  'coverage',\n  '.git',\n  '.vscode',\n  '.idea',\n  '.DS_Store',\n  '.next',\n  '.nuxt',\n  '.output',\n  '.svelte-kit',\n  '.cache',\n  '.yarn',\n  'jspm_packages',\n  'bower_components',\n  'out',\n  'tmp',\n  '.temp',\n  'npm-debug.log',\n  'yarn-debug.log',\n  'yarn-error.log',\n  'Thumbs.db',\n]);\n"]}

package/dist/core/input-required.d.ts

@@ -17,6 +17,21 @@ export interface PendingState {
      */
     readonly reissued?: true;
 }
+/** The per-round confirmation context; `ToolCtx` satisfies it structurally. */
+export interface PendingCtx {
+    readonly requestState?: (() => PendingState | undefined) | undefined;
+    /**
+     * What the client declared it can do, or `undefined` when this connection
+     * cannot say. Only positively-absent form support short-circuits; see
+     * {@link assertCanElicit}.
+     */
+    readonly clientCapabilities?: ClientCapabilities | undefined;
+    /** `ctx.mcpReq.droppedInputResponseKeys` for this round; see `ToolCtx`. */
+    readonly droppedInputResponseKeys?: readonly string[] | undefined;
+    readonly inputResponses?: Record<string, unknown> | undefined;
+    /** The live handler context; the codec binds the minted state to its method and caller. */
+    readonly serverCtx: ServerContext;
+}
 /** One embedded form-mode confirmation, keyed within the call. */
 export interface PendingInput {
     /** Server-assigned key, unique within the `tools/call`. */
@@ -60,25 +75,15 @@ export declare function buildInputRequired(pending: PendingState, inputs: readon
  * matching same-op retry so the caller proceeds.
  *
  * One home for the R9 binding check means a future fix cannot miss two of three
- * sites. The caller supplies `buildInputs` so only the prompt text varies.
+ * sites. The caller passes the round's `PendingCtx` and supplies `buildInputs`
+ * so only the prompt text varies.
  */
 interface PendingRoundTripOpts {
     readonly op: PendingOp;
     readonly pending: readonly string[];
-    readonly requestState: (() => PendingState | undefined) | undefined;
-    /**
-     * What the client declared it can do, or `undefined` when this connection
-     * cannot say. Only positively-absent form support short-circuits; see
-     * {@link assertCanElicit}.
-     */
-    readonly clientCapabilities?: ClientCapabilities | undefined;
-    /** `ctx.mcpReq.droppedInputResponseKeys` for this round; see `ToolCtx`. */
-    readonly droppedInputResponseKeys?: readonly string[] | undefined;
     readonly buildInputs: (pending: readonly string[]) => readonly PendingInput[];
-    /** The live handler context; the codec binds the minted state to its method and caller. */
-    readonly serverCtx: ServerContext;
 }
-export declare function pendingRoundTrip(opts: PendingRoundTripOpts): Promise<InputRequiredResult | undefined>;
+export declare function pendingRoundTrip(ctx: PendingCtx, opts: PendingRoundTripOpts): Promise<InputRequiredResult | undefined>;
 /**
  * Round-trip key for `pendingSorted[index]` — the single home of the
  * `confirm_${i}` convention. The build side mints it with the map index; the
@@ -124,9 +129,9 @@ export declare function readAcceptedChoice(responses: Record<string, unknown> |
 export declare function readAcceptedMultiChoice(responses: Record<string, unknown> | undefined, key: string): string[] | undefined;
 /**
  * Refusal wording for the `CANCELLED` error; call after a `readAccepted*` reader
- * returned nothing. Pass the round's `droppedInputResponseKeys` so a dropped
- * answer is named as such rather than as 'not answered'.
+ * returned nothing. Pass the round's ctx so a dropped answer is named as such
+ * rather than as 'not answered'.
  */
-export declare function describeRefusal(responses: Record<string, unknown> | undefined, key: string, droppedKeys?: readonly string[]): string;
+export declare function describeRefusal(ctx: Pick<PendingCtx, 'inputResponses' | 'droppedInputResponseKeys'>, key: string): string;
 export {};
 //# sourceMappingURL=input-required.d.ts.map

package/dist/core/input-required.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"input-required.d.ts","sourceRoot":"","sources":["../../src/core/input-required.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EACV,kBAAkB,EAElB,mBAAmB,EACnB,iBAAiB,EACjB,aAAa,EACd,MAAM,8BAA8B,CAAC;AAetC,mEAAmE;AACnE,KAAK,SAAS,GAAG,QAAQ,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,GAAG,OAAO,CAAC;AAEjE;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC;CAC1B;AAED,kEAAkE;AAClE,MAAM,WAAW,YAAY;IAC3B,2DAA2D;IAC3D,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,2CAA2C;IAC3C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB;;;OAGG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC;;;;OAIG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;CAC1B;AAiCD;;;;;GAKG;AACH,eAAO,MAAM,iBAAiB,EAAE,iBAAiB,CAAC,YAAY,CAI1D,CAAC;AA6BL;;;;GAIG;AACH,wBAAsB,kBAAkB,CACtC,OAAO,EAAE,YAAY,EACrB,MAAM,EAAE,SAAS,YAAY,EAAE,EAC/B,GAAG,EAAE,aAAa,GACjB,OAAO,CAAC,mBAAmB,CAAC,CAiB9B;AAED;;;;;;;;;;;;;GAaG;AACH,UAAU,oBAAoB;IAC5B,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,YAAY,EAAE,CAAC,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC;IACpE;;;;OAIG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,kBAAkB,GAAG,SAAS,CAAC;IAC7D,2EAA2E;IAC3E,QAAQ,CAAC,wBAAwB,CAAC,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,CAAC;IAClE,QAAQ,CAAC,WAAW,EAAE,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,KAAK,SAAS,YAAY,EAAE,CAAC;IAC9E,2FAA2F;IAC3F,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC;CACnC;AAiDD,wBAAsB,gBAAgB,CACpC,IAAI,EAAE,oBAAoB,GACzB,OAAO,CAAC,mBAAmB,GAAG,SAAS,CAAC,CAwC1C;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEhD;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,EAC9C,GAAG,EAAE,MAAM,GACV,OAAO,CAET;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,kBAAkB,CAChC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,EAC9C,GAAG,EAAE,MAAM,GACV,MAAM,GAAG,SAAS,CAEpB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,uBAAuB,CACrC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,EAC9C,GAAG,EAAE,MAAM,GACV,MAAM,EAAE,GAAG,SAAS,CAEtB;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,EAC9C,GAAG,EAAE,MAAM,EACX,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,GAC9B,MAAM,CASR"}
+{"version":3,"file":"input-required.d.ts","sourceRoot":"","sources":["../../src/core/input-required.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EACV,kBAAkB,EAElB,mBAAmB,EACnB,iBAAiB,EACjB,aAAa,EACd,MAAM,8BAA8B,CAAC;AAetC,mEAAmE;AACnE,KAAK,SAAS,GAAG,QAAQ,GAAG,MAAM,GAAG,MAAM,GAAG,QAAQ,GAAG,OAAO,CAAC;AAEjE;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC;CAC1B;AAED,+EAA+E;AAC/E,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC;IACrE;;;;OAIG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,kBAAkB,GAAG,SAAS,CAAC;IAC7D,2EAA2E;IAC3E,QAAQ,CAAC,wBAAwB,CAAC,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,CAAC;IAClE,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;IAC9D,2FAA2F;IAC3F,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC;CACnC;AAED,kEAAkE;AAClE,MAAM,WAAW,YAAY;IAC3B,2DAA2D;IAC3D,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,2CAA2C;IAC3C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB;;;OAGG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC;;;;OAIG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;CAC1B;AAiCD;;;;;GAKG;AACH,eAAO,MAAM,iBAAiB,EAAE,iBAAiB,CAAC,YAAY,CAI1D,CAAC;AA6BL;;;;GAIG;AACH,wBAAsB,kBAAkB,CACtC,OAAO,EAAE,YAAY,EACrB,MAAM,EAAE,SAAS,YAAY,EAAE,EAC/B,GAAG,EAAE,aAAa,GACjB,OAAO,CAAC,mBAAmB,CAAC,CAiB9B;AAED;;;;;;;;;;;;;;GAcG;AACH,UAAU,oBAAoB;IAC5B,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,WAAW,EAAE,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,KAAK,SAAS,YAAY,EAAE,CAAC;CAC/E;AAiDD,wBAAsB,gBAAgB,CACpC,GAAG,EAAE,UAAU,EACf,IAAI,EAAE,oBAAoB,GACzB,OAAO,CAAC,mBAAmB,GAAG,SAAS,CAAC,CAwC1C;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEhD;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,EAC9C,GAAG,EAAE,MAAM,GACV,OAAO,CAET;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,kBAAkB,CAChC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,EAC9C,GAAG,EAAE,MAAM,GACV,MAAM,GAAG,SAAS,CAEpB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,uBAAuB,CACrC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,EAC9C,GAAG,EAAE,MAAM,GACV,MAAM,EAAE,GAAG,SAAS,CAEtB;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,IAAI,CAAC,UAAU,EAAE,gBAAgB,GAAG,0BAA0B,CAAC,EACpE,GAAG,EAAE,MAAM,GACV,MAAM,CASR"}

package/dist/core/input-required.js

@@ -126,8 +126,8 @@ function assertCanElicit(op, capabilities) {
     }
     throw new FsError(ErrorCode.INVALID_INPUT, `${op}: ${NO_ELICITATION_HINT[op]}`);
 }
-export async function pendingRoundTrip(opts) {
-    const state = opts.requestState?.();
+export async function pendingRoundTrip(ctx, opts) {
+    const state = ctx.requestState?.();
     // No verified state yet, OR the verified state belongs to a different
     // flow (e.g. an access-grant round's state is still the retried request's
     // requestState after the grant was applied, and this call is now the
@@ -136,8 +136,8 @@ export async function pendingRoundTrip(opts) {
     // input_required rather than treating a foreign-but-valid state as a
     // tamper/mismatch error.
     if (state?.op !== opts.op) {
-        assertCanElicit(opts.op, opts.clientCapabilities);
-        return buildInputRequired({ op: opts.op, paths: opts.pending }, opts.buildInputs(opts.pending), opts.serverCtx);
+        assertCanElicit(opts.op, ctx.clientCapabilities);
+        return buildInputRequired({ op: opts.op, paths: opts.pending }, opts.buildInputs(opts.pending), ctx.serverCtx);
     }
     // Retry for THIS op (R9): the verified state must bind the same pending set.
     if (!pathsEqual(state.paths, opts.pending)) {
@@ -147,11 +147,11 @@ export async function pendingRoundTrip(opts) {
     // runs (`{ method, result }` around the bare result). Ask the same question
     // once more rather than report a refusal the user never made; the sealed
     // `reissued` flag stops a second retry from looping.
-    if (state.reissued !== true && opts.droppedInputResponseKeys?.length) {
-        const dropped = new Set(opts.droppedInputResponseKeys);
+    if (state.reissued !== true && ctx.droppedInputResponseKeys?.length) {
+        const dropped = new Set(ctx.droppedInputResponseKeys);
         const inputs = opts.buildInputs(opts.pending);
         if (inputs.some((input) => dropped.has(input.key))) {
-            return buildInputRequired({ op: opts.op, paths: opts.pending, reissued: true }, inputs, opts.serverCtx);
+            return buildInputRequired({ op: opts.op, paths: opts.pending, reissued: true }, inputs, ctx.serverCtx);
         }
     }
     return undefined;
@@ -209,14 +209,14 @@ export function readAcceptedMultiChoice(responses, key) {
 }
 /**
  * Refusal wording for the `CANCELLED` error; call after a `readAccepted*` reader
- * returned nothing. Pass the round's `droppedInputResponseKeys` so a dropped
- * answer is named as such rather than as 'not answered'.
+ * returned nothing. Pass the round's ctx so a dropped answer is named as such
+ * rather than as 'not answered'.
  */
-export function describeRefusal(responses, key, droppedKeys) {
-    if (droppedKeys?.includes(key)) {
+export function describeRefusal(ctx, key) {
+    if (ctx.droppedInputResponseKeys?.includes(key)) {
         return 'answered in a shape this server cannot read (a wrapped result instead of the bare elicitation result), twice';
     }
-    const view = inputResponse(responses, key);
+    const view = inputResponse(ctx.inputResponses, key);
     if (view.kind !== 'elicit')
         return 'not answered';
     if (view.action === 'decline')