@j0hanz/filesystem-mcp 2.2.0 → 2.4.0

package/dist/core/concurrency.js

@@ -1,6 +1,6 @@
 import * as z from 'zod/v4';
-import { normalizeUnknownError } from './errors.js';
-import { PARALLEL_CONCURRENCY } from './util.js';
+import { normalizeUnknownError } from "./errors.js";
+import { PARALLEL_CONCURRENCY } from "./util.js";
 export const StoppedReasonSchema = z.enum(['maxResults', 'maxFiles', 'timeout']).optional();
 /**
  * The subset `search_text` and `find_files` can actually emit. Their scans call
@@ -9,30 +9,6 @@ export const StoppedReasonSchema = z.enum(['maxResults', 'maxFiles', 'timeout'])
  * both tools' own descriptions.
  */
 export const SearchStoppedReasonSchema = z.enum(['maxResults', 'timeout']).optional();
-/**
- * Accumulates why an enumeration stopped early. maxResults wins over maxFiles
- * wins over timeout (the most specific cap is the definite cause even if the
- * abort also fired on the same iteration). Call `resolve()` once at the end.
- */
-export class StopReasonTracker {
-    #reason;
-    hitMaxResults() {
-        this.#reason = 'maxResults';
-    }
-    hitMaxFiles() {
-        if (this.#reason !== 'maxResults')
-            this.#reason = 'maxFiles';
-    }
-    hitAbort() {
-        this.#reason ??= 'timeout';
-    }
-    get truncated() {
-        return this.#reason !== undefined;
-    }
-    resolve() {
-        return this.#reason;
-    }
-}
 export async function processInParallel(items, processor, concurrency = PARALLEL_CONCURRENCY, signal) {
     const itemCount = items.length;
     if (itemCount === 0)
@@ -41,9 +17,17 @@ export async function processInParallel(items, processor, concurrency = PARALLEL
     const errors = [];
     signal?.throwIfAborted();
     let nextIndex = 0;
+    // Set when a worker saw the signal fire before an item ran — the only
+    // shape in which the batch is genuinely incomplete. The annotation
+    // matters: without it control-flow analysis keeps the `false` narrowing
+    // from the initializer and cannot see the closure assignment.
+    let truncated = false;
     const next = async () => {
         while (nextIndex < itemCount) {
-            signal?.throwIfAborted();
+            if (signal?.aborted) {
+                truncated = true;
+                signal.throwIfAborted();
+            }
             const index = nextIndex;
             nextIndex += 1;
             const item = items[index];
@@ -51,8 +35,11 @@ export async function processInParallel(items, processor, concurrency = PARALLEL
                 continue;
             }
             try {
+                // No abort check after the processor: once an item has run, its
+                // result is real work that a write caller may have committed to
+                // disk. Discarding it here would report a finished append as
+                // failed, and a client retry would append twice.
                 const value = await processor(item);
-                signal?.throwIfAborted();
                 results.push({ index, value });
             }
             catch (error) {
@@ -70,10 +57,14 @@ export async function processInParallel(items, processor, concurrency = PARALLEL
     }
     await Promise.allSettled(workers);
     // A deadline (AbortSignal.timeout) hit during the run surfaces here as
-    // signal.reason — a TimeoutError — rather than a fresh AbortError, so callers
-    // see TIMEOUT, not CANCELLED. The per-item throws above are swallowed by
-    // allSettled.
-    signal?.throwIfAborted();
+    // signal.reason — a TimeoutError — rather than a fresh AbortError, so
+    // callers see TIMEOUT, not CANCELLED. Only a run that actually skipped
+    // items reports the abort: a deadline firing after the last item
+    // finished leaves a complete batch, and returning it beats telling the
+    // caller that committed writes failed. The per-item throws above are
+    // swallowed by allSettled.
+    if (truncated)
+        signal?.throwIfAborted();
     results.sort((left, right) => left.index - right.index);
     return { results, errors };
 }
@@ -84,13 +75,14 @@ export async function processInParallel(items, processor, concurrency = PARALLEL
  *
  * `maxEntries` caps how many entries are dispatched (maxFiles); `shouldStop`
  * lets the caller stop on its own accumulating result count (maxResults). Both
- * are checked before dispatch, so the returned tracker names exactly one
- * reason — the loop breaks on the first that fires.
+ * are checked before dispatch, so the returned reason is exactly one — the
+ * loop breaks on the first that fires. `undefined` means every entry was
+ * dispatched.
  */
 export async function processEntriesConcurrently(entries, options) {
     const pending = new Set();
     const { signal, concurrency, maxEntries, shouldStop, onEntry, onError, runEntry } = options;
-    const tracker = new StopReasonTracker();
+    let stoppedReason;
     let dispatched = 0;
     const waitForSlot = async () => {
         if (pending.size < concurrency)
@@ -101,17 +93,17 @@ export async function processEntriesConcurrently(entries, options) {
         // 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) {
-            tracker.hitAbort();
+            stoppedReason = 'timeout';
             break;
         }
         if (maxEntries !== undefined && dispatched >= maxEntries) {
-            tracker.hitMaxFiles();
+            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?.()) {
-            tracker.hitMaxResults();
+            stoppedReason = 'maxResults';
             break;
         }
         await waitForSlot();
@@ -119,7 +111,7 @@ export async function processEntriesConcurrently(entries, options) {
         // 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?.()) {
-            tracker.hitMaxResults();
+            stoppedReason = 'maxResults';
             break;
         }
         onEntry();
@@ -140,7 +132,7 @@ export async function processEntriesConcurrently(entries, options) {
     if (pending.size > 0) {
         await Promise.allSettled([...pending]);
     }
-    return tracker;
+    return stoppedReason;
 }
 export function withAbort(promise, signal) {
     if (!signal) {

package/dist/core/concurrency.js.map

@@ -1 +1 @@
-{"version":3,"file":"concurrency.js","sourceRoot":"","sources":["../../src/core/concurrency.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AACpD,OAAO,EAAE,oBAAoB,EAAE,MAAM,WAAW,CAAC;AAIjD,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;AAE5F;;;;;GAKG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;AAEtF;;;;GAIG;AACH,MAAM,OAAO,iBAAiB;IAC5B,OAAO,CAAiB;IAExB,aAAa;QACX,IAAI,CAAC,OAAO,GAAG,YAAY,CAAC;IAC9B,CAAC;IAED,WAAW;QACT,IAAI,IAAI,CAAC,OAAO,KAAK,YAAY;YAAE,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC;IAC/D,CAAC;IAED,QAAQ;QACN,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC;IAC7B,CAAC;IAED,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC;IACpC,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;CACF;AAOD,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,KAAmB,EACnB,SAAkC,EAClC,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;IAElB,MAAM,IAAI,GAAG,KAAK,IAAmB,EAAE;QACrC,OAAO,SAAS,GAAG,SAAS,EAAE,CAAC;YAC7B,MAAM,EAAE,cAAc,EAAE,CAAC;YAEzB,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,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,CAAC;gBACpC,MAAM,EAAE,cAAc,EAAE,CAAC;gBACzB,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,8EAA8E;IAC9E,yEAAyE;IACzE,cAAc;IACd,MAAM,EAAE,cAAc,EAAE,CAAC;IAEzB,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;;;;;;;;;GASG;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,MAAM,OAAO,GAAG,IAAI,iBAAiB,EAAE,CAAC;IACxC,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,OAAO,CAAC,QAAQ,EAAE,CAAC;YACnB,MAAM;QACR,CAAC;QACD,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;YACzD,OAAO,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM;QACR,CAAC;QACD,2EAA2E;QAC3E,kEAAkE;QAClE,IAAI,UAAU,EAAE,EAAE,EAAE,CAAC;YACnB,OAAO,CAAC,aAAa,EAAE,CAAC;YACxB,MAAM;QACR,CAAC;QACD,MAAM,WAAW,EAAE,CAAC;QACpB,0EAA0E;QAC1E,4EAA4E;QAC5E,8EAA8E;QAC9E,IAAI,UAAU,EAAE,EAAE,EAAE,CAAC;YACnB,OAAO,CAAC,aAAa,EAAE,CAAC;YACxB,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,OAAO,CAAC;AACjB,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 * as z from 'zod/v4';\n\nimport { normalizeUnknownError } from './errors.js';\nimport { PARALLEL_CONCURRENCY } from './util.js';\n\nexport type StoppedReason = 'maxResults' | 'maxFiles' | 'timeout';\n\nexport const StoppedReasonSchema = z.enum(['maxResults', 'maxFiles', 'timeout']).optional();\n\n/**\n * The subset `search_text` and `find_files` can actually emit. Their scans call\n * only `hitMaxResults` and `hitAbort` (search.ts), never `hitMaxFiles`, so the\n * three-value enum published a value no response can carry and disagreed with\n * both tools' own descriptions.\n */\nexport const SearchStoppedReasonSchema = z.enum(['maxResults', 'timeout']).optional();\n\n/**\n * Accumulates why an enumeration stopped early. maxResults wins over maxFiles\n * wins over timeout (the most specific cap is the definite cause even if the\n * abort also fired on the same iteration). Call `resolve()` once at the end.\n */\nexport class StopReasonTracker {\n  #reason?: StoppedReason;\n\n  hitMaxResults(): void {\n    this.#reason = 'maxResults';\n  }\n\n  hitMaxFiles(): void {\n    if (this.#reason !== 'maxResults') this.#reason = 'maxFiles';\n  }\n\n  hitAbort(): void {\n    this.#reason ??= 'timeout';\n  }\n\n  get truncated(): boolean {\n    return this.#reason !== undefined;\n  }\n\n  resolve(): StoppedReason | undefined {\n    return this.#reason;\n  }\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) => 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\n  const next = async (): Promise<void> => {\n    while (nextIndex < itemCount) {\n      signal?.throwIfAborted();\n\n      const index = nextIndex;\n      nextIndex += 1;\n      const item = items[index];\n      if (item === undefined) {\n        continue;\n      }\n\n      try {\n        const value = await processor(item);\n        signal?.throwIfAborted();\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 callers\n  // see TIMEOUT, not CANCELLED. The per-item throws above are swallowed by\n  // allSettled.\n  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 tracker names exactly one\n * reason — the loop breaks on the first that fires.\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<StopReasonTracker> {\n  const pending = new Set<Promise<void>>();\n  const { signal, concurrency, maxEntries, shouldStop, onEntry, onError, runEntry } = options;\n  const tracker = new StopReasonTracker();\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      tracker.hitAbort();\n      break;\n    }\n    if (maxEntries !== undefined && dispatched >= maxEntries) {\n      tracker.hitMaxFiles();\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      tracker.hitMaxResults();\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      tracker.hitMaxResults();\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 tracker;\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,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AACpD,OAAO,EAAE,oBAAoB,EAAE,MAAM,WAAW,CAAC;AAIjD,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;AAE5F;;;;;GAKG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;AAOtF,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,KAAmB,EACnB,SAAkC,EAClC,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,CAAC,CAAC;gBACpC,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 * as z from 'zod/v4';\n\nimport { normalizeUnknownError } from './errors.ts';\nimport { PARALLEL_CONCURRENCY } from './util.ts';\n\nexport type StoppedReason = 'maxResults' | 'maxFiles' | 'timeout';\n\nexport const StoppedReasonSchema = z.enum(['maxResults', 'maxFiles', 'timeout']).optional();\n\n/**\n * The subset `search_text` and `find_files` can actually emit. Their scans call\n * only `hitMaxResults` and `hitAbort` (search.ts), never `hitMaxFiles`, so the\n * three-value enum published a value no response can carry and disagreed with\n * both tools' own descriptions.\n */\nexport const SearchStoppedReasonSchema = z.enum(['maxResults', 'timeout']).optional();\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) => 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);\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"]}

package/dist/core/config.d.ts

@@ -20,6 +20,8 @@ export interface CliOverrides {
     allowMissingRoots?: boolean;
     /** `--deny` entries (merged with DENYLIST by the reader) */
     denyPatterns?: readonly string[];
+    /** `--allow` entries (merged with FS_ALLOWLIST by the reader; relieve built-ins only) */
+    allowPatterns?: readonly string[];
 }
 /** Written once by cli.ts; an absent key means "not set on the command line". */
 export declare const cli: CliOverrides;

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

@@ -1 +1 @@
-{"version":3,"file":"config.d.ts","sourceRoot":"","sources":["../../src/core/config.ts"],"names":[],"mappings":"AASA;;;;;GAKG;AACH,eAAO,MAAM,4BAA4B,+NACqL,CAAC;AAE/N,MAAM,WAAW,YAAY;IAC3B,oBAAoB;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,+EAA+E;IAC/E,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,wBAAwB;IACxB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,0BAA0B;IAC1B,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,mBAAmB;IACnB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,8BAA8B;IAC9B,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,4DAA4D;IAC5D,YAAY,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CAClC;AAED,iFAAiF;AACjF,eAAO,MAAM,GAAG,EAAE,YAAiB,CAAC"}
+{"version":3,"file":"config.d.ts","sourceRoot":"","sources":["../../src/core/config.ts"],"names":[],"mappings":"AASA;;;;;GAKG;AACH,eAAO,MAAM,4BAA4B,+NACqL,CAAC;AAE/N,MAAM,WAAW,YAAY;IAC3B,oBAAoB;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,+EAA+E;IAC/E,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,wBAAwB;IACxB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,0BAA0B;IAC1B,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,mBAAmB;IACnB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,8BAA8B;IAC9B,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,4DAA4D;IAC5D,YAAY,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,yFAAyF;IACzF,aAAa,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAED,iFAAiF;AACjF,eAAO,MAAM,GAAG,EAAE,YAAiB,CAAC"}

package/dist/core/config.js.map

@@ -1 +1 @@
-{"version":3,"file":"config.js","sourceRoot":"","sources":["../../src/core/config.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,EAAE;AACF,4EAA4E;AAC5E,+EAA+E;AAC/E,yEAAyE;AACzE,gFAAgF;AAChF,gFAAgF;AAChF,kDAAkD;AAElD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,4BAA4B,GACvC,4NAA4N,CAAC;AAmB/N,iFAAiF;AACjF,MAAM,CAAC,MAAM,GAAG,GAAiB,EAAE,CAAC","sourcesContent":["// Resolved CLI-flag overrides — the one owner of the flag-beats-env rule.\n//\n// `parseArgs` (cli.ts) used to write flag values back into `process.env` so\n// deep core readers (path, sensitive, observability, util) would pick them up.\n// That made the environment a hidden mutable config bus. Instead, cli.ts\n// assigns onto `cli` once at startup and each reader consults it first, falling\n// back to the operator's environment. This module deliberately has zero imports\n// so any core module can read it without a cycle.\n\n/**\n * How an operator gives this server a root. Lives here rather than beside its\n * readers because both ends of the repo need it — `index.ts` prints it at\n * startup, `list_roots` returns it when it has nothing to list — and this\n * module is the one place either can import without a cycle.\n */\nexport const NO_POSITIONAL_ROOTS_GUIDANCE =\n  'No positional directories specified. Configure roots with directory arguments, FS_ALLOWED_DIRS, or --allow-cwd. Modern clients with elicitation can also call a tool with a concrete path and approve the requested grant.';\n\nexport interface CliOverrides {\n  /** `--log-level` */\n  logLevel?: string;\n  /** `--max-file-size` (raw string; validated by the reader like the env var) */\n  maxFileSize?: string;\n  /** `--root-boundary` */\n  rootBoundary?: string;\n  /** `--allow-sensitive` */\n  allowSensitive?: boolean;\n  /** `--walk-cwd` */\n  allowCwdWalk?: boolean;\n  /** `--allow-missing-roots` */\n  allowMissingRoots?: boolean;\n  /** `--deny` entries (merged with DENYLIST by the reader) */\n  denyPatterns?: readonly string[];\n}\n\n/** Written once by cli.ts; an absent key means \"not set on the command line\". */\nexport const cli: CliOverrides = {};\n"]}
+{"version":3,"file":"config.js","sourceRoot":"","sources":["../../src/core/config.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,EAAE;AACF,4EAA4E;AAC5E,+EAA+E;AAC/E,yEAAyE;AACzE,gFAAgF;AAChF,gFAAgF;AAChF,kDAAkD;AAElD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,4BAA4B,GACvC,4NAA4N,CAAC;AAqB/N,iFAAiF;AACjF,MAAM,CAAC,MAAM,GAAG,GAAiB,EAAE,CAAC","sourcesContent":["// Resolved CLI-flag overrides — the one owner of the flag-beats-env rule.\n//\n// `parseArgs` (cli.ts) used to write flag values back into `process.env` so\n// deep core readers (path, sensitive, observability, util) would pick them up.\n// That made the environment a hidden mutable config bus. Instead, cli.ts\n// assigns onto `cli` once at startup and each reader consults it first, falling\n// back to the operator's environment. This module deliberately has zero imports\n// so any core module can read it without a cycle.\n\n/**\n * How an operator gives this server a root. Lives here rather than beside its\n * readers because both ends of the repo need it — `index.ts` prints it at\n * startup, `list_roots` returns it when it has nothing to list — and this\n * module is the one place either can import without a cycle.\n */\nexport const NO_POSITIONAL_ROOTS_GUIDANCE =\n  'No positional directories specified. Configure roots with directory arguments, FS_ALLOWED_DIRS, or --allow-cwd. Modern clients with elicitation can also call a tool with a concrete path and approve the requested grant.';\n\nexport interface CliOverrides {\n  /** `--log-level` */\n  logLevel?: string;\n  /** `--max-file-size` (raw string; validated by the reader like the env var) */\n  maxFileSize?: string;\n  /** `--root-boundary` */\n  rootBoundary?: string;\n  /** `--allow-sensitive` */\n  allowSensitive?: boolean;\n  /** `--walk-cwd` */\n  allowCwdWalk?: boolean;\n  /** `--allow-missing-roots` */\n  allowMissingRoots?: boolean;\n  /** `--deny` entries (merged with DENYLIST by the reader) */\n  denyPatterns?: readonly string[];\n  /** `--allow` entries (merged with FS_ALLOWLIST by the reader; relieve built-ins only) */\n  allowPatterns?: readonly string[];\n}\n\n/** Written once by cli.ts; an absent key means \"not set on the command line\". */\nexport const cli: CliOverrides = {};\n"]}

package/dist/core/cursor.d.ts

@@ -1,4 +1,4 @@
-import type { PageSnapshotStore } from './page-store.js';
+import type { PageSnapshotStore } from './store.ts';
 /**
  * The full result set a paged tool produced, before slicing. `truncated` is the
  * engine's own stop state — the hard result cap or a timeout cut the set — and
@@ -24,17 +24,6 @@ export interface PaginatedPage<T, M, R> extends Page<T, M> {
     /** The externalized full set. First page only, and only when incomplete. */
     readonly resource?: R;
 }
-/**
- * The single home of the pagination cache-key rule: `JSON.stringify` of a
- * flat object whose `method` names the tool and whose remaining fields
- * identify the query. The literal's field order fixes key stability;
- * `method` keeps tool key spaces disjoint. Byte-identical to the three
- * hand-written tool builders it replaces.
- */
-export declare function pageQueryKey(query: {
-    readonly method: string;
-    readonly path: string;
-} & Record<string, unknown>): string;
 /**
  * The one replay-or-produce branch every paged tool runs. A cursor replays a
  * stored snapshot; without one, `produce` runs the query and its result is

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

@@ -1 +1 @@
-{"version":3,"file":"cursor.d.ts","sourceRoot":"","sources":["../../src/core/cursor.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAgB,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAgCvE;;;;GAIG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC,EAAE,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;IACrB,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;CAC7B;AAED,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC;IACjB,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;IACrB,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,SAAS,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAE,SAAQ,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;IACxD,4EAA4E;IAC5E,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;CACvB;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE;IAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAClF,MAAM,CAER;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE;IAC9C,KAAK,EAAE,iBAAiB,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,OAAO,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3C,WAAW,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC;CACrE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAwBlC"}
+{"version":3,"file":"cursor.d.ts","sourceRoot":"","sources":["../../src/core/cursor.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAgB,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAgClE;;;;GAIG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC,EAAE,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;IACrB,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;CAC7B;AAED,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC;IACjB,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;IACrB,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,SAAS,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAE,SAAQ,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;IACxD,4EAA4E;IAC5E,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;CACvB;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE;IAC9C,KAAK,EAAE,iBAAiB,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,OAAO,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3C,WAAW,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC;CACrE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAwBlC"}

package/dist/core/cursor.js

@@ -1,5 +1,5 @@
-import { ErrorCode, FsError } from './errors.js';
-import { invalidCursor } from './page-store.js';
+import { ErrorCode, FsError } from "./errors.js";
+import { invalidCursor } from "./store.js";
 function encodePageCursor(cursor) {
     return Buffer.from(JSON.stringify(cursor)).toString('base64url');
 }
@@ -17,16 +17,6 @@ function pageResult(snapshotId, offset, pageSize, snapshot) {
             : undefined,
     };
 }
-/**
- * The single home of the pagination cache-key rule: `JSON.stringify` of a
- * flat object whose `method` names the tool and whose remaining fields
- * identify the query. The literal's field order fixes key stability;
- * `method` keeps tool key spaces disjoint. Byte-identical to the three
- * hand-written tool builders it replaces.
- */
-export function pageQueryKey(query) {
-    return JSON.stringify(query);
-}
 /**
  * The one replay-or-produce branch every paged tool runs. A cursor replays a
  * stored snapshot; without one, `produce` runs the query and its result is

package/dist/core/cursor.js.map

@@ -1 +1 @@
-{"version":3,"file":"cursor.js","sourceRoot":"","sources":["../../src/core/cursor.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEjD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAOhD,SAAS,gBAAgB,CAAC,MAAkB;IAC1C,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AACnE,CAAC;AAED,SAAS,UAAU,CACjB,UAAkB,EAClB,MAAc,EACd,QAAgB,EAChB,QAA4B;IAE5B,IAAI,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM;QAAE,MAAM,aAAa,EAAE,CAAC;IAC3D,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC;IAC7D,MAAM,UAAU,GAAG,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACxC,OAAO;QACL,IAAI;QACJ,QAAQ,EAAE,QAAQ,CAAC,QAAQ;QAC3B,MAAM;QACN,UAAU,EACR,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM;YAChC,CAAC,CAAC,gBAAgB,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;YACtD,CAAC,CAAC,SAAS;KAChB,CAAC;AACJ,CAAC;AA8BD;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAmF;IAEnF,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAU,MAOvC;IACC,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAO,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC9E,OAAO,UAAU,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACnF,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,EAAE,CAAC;IACxC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAAC;IACrC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,IAAI,QAAQ,CAAC,SAAS,CAAC;IACxE,MAAM,KAAK,GACT,KAAK,CAAC,MAAM,IAAI,MAAM,CAAC,QAAQ;QAC7B,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,EAAE;QAC7D,CAAC,CAAC,UAAU,CACR,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;YAClB,QAAQ,EAAE,MAAM,CAAC,QAAQ;YACzB,KAAK;YACL,QAAQ;SACT,CAAC,EACF,CAAC,EACD,MAAM,CAAC,QAAQ,EACf,EAAE,KAAK,EAAE,QAAQ,EAAE,CACpB,CAAC;IACR,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,WAAW,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAClE,OAAO,EAAE,GAAG,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;AACvF,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAc;IACtC,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAA+C,CAAC;QAC9E,IACE,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ;YACrC,MAAM,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;YAC5B,OAAO,MAAM,CAAC,MAAM,KAAK,QAAQ;YACjC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC;YAC/B,MAAM,CAAC,MAAM,IAAI,CAAC,EAClB,CAAC;YACD,OAAO,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;QAClE,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;IACzC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,OAAO;YAAE,MAAM,KAAK,CAAC;QAC1C,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,aAAa,EAAE,CAAC,OAAO,EACvB,SAAS,EACT,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAC3C,CAAC;IACJ,CAAC;AACH,CAAC","sourcesContent":["import { ErrorCode, FsError } from './errors.js';\nimport type { PageSnapshot, PageSnapshotStore } from './page-store.js';\nimport { invalidCursor } from './page-store.js';\n\ninterface PageCursor {\n  readonly snapshotId: string;\n  readonly offset: number;\n}\n\nfunction encodePageCursor(cursor: PageCursor): string {\n  return Buffer.from(JSON.stringify(cursor)).toString('base64url');\n}\n\nfunction pageResult<T, M>(\n  snapshotId: string,\n  offset: number,\n  pageSize: number,\n  snapshot: PageSnapshot<T, M>,\n): Page<T, M> {\n  if (offset >= snapshot.items.length) throw invalidCursor();\n  const page = snapshot.items.slice(offset, offset + pageSize);\n  const nextOffset = offset + page.length;\n  return {\n    page,\n    metadata: snapshot.metadata,\n    offset,\n    nextCursor:\n      nextOffset < snapshot.items.length\n        ? encodePageCursor({ snapshotId, offset: nextOffset })\n        : undefined,\n  };\n}\n\n/**\n * The full result set a paged tool produced, before slicing. `truncated` is the\n * engine's own stop state — the hard result cap or a timeout cut the set — and\n * says nothing about page size.\n */\nexport interface ProducedPage<T, M> {\n  readonly items: readonly T[];\n  readonly metadata: M;\n  readonly truncated: boolean;\n}\n\ninterface Page<T, M> {\n  readonly page: readonly T[];\n  readonly metadata: M;\n  readonly nextCursor: string | undefined;\n  /**\n   * Index of this page's first item in the full set. A tool that reports\n   * progress in its text needs it: without it every page can only say how many\n   * rows it holds, which is the same number on page 1 and page 9.\n   */\n  readonly offset: number;\n}\n\nexport interface PaginatedPage<T, M, R> extends Page<T, M> {\n  /** The externalized full set. First page only, and only when incomplete. */\n  readonly resource?: R;\n}\n\n/**\n * The single home of the pagination cache-key rule: `JSON.stringify` of a\n * flat object whose `method` names the tool and whose remaining fields\n * identify the query. The literal's field order fixes key stability;\n * `method` keeps tool key spaces disjoint. Byte-identical to the three\n * hand-written tool builders it replaces.\n */\nexport function pageQueryKey(\n  query: { readonly method: string; readonly path: string } & Record<string, unknown>,\n): string {\n  return JSON.stringify(query);\n}\n\n/**\n * The one replay-or-produce branch every paged tool runs. A cursor replays a\n * stored snapshot; without one, `produce` runs the query and its result is\n * snapshotted for later pages.\n *\n * The response is incomplete when the set spans more than one page or the\n * engine truncated it. Then — and only on the first page — `externalize`\n * stores the full set and its handle rides back as `resource`. Replayed pages\n * never carry it: the stored entry expires on the resource store's own TTL and\n * LRU, not this snapshot's, so replaying its URI would hand back a dead\n * pointer. Nor do they mint a new one; the set was already stored whole.\n */\nexport async function paginate<T, M, R>(params: {\n  store: PageSnapshotStore;\n  queryKey: string;\n  cursor: string | undefined;\n  pageSize: number;\n  produce: () => Promise<ProducedPage<T, M>>;\n  externalize?: ((items: readonly T[], metadata: M) => R) | undefined;\n}): Promise<PaginatedPage<T, M, R>> {\n  if (params.cursor !== undefined) {\n    const decoded = decodePageCursor(params.cursor);\n    const snapshot = params.store.read<T, M>(decoded.snapshotId, params.queryKey);\n    return pageResult(decoded.snapshotId, decoded.offset, params.pageSize, snapshot);\n  }\n  const produced = await params.produce();\n  const { items, metadata } = produced;\n  const incomplete = items.length > params.pageSize || produced.truncated;\n  const first: Page<T, M> =\n    items.length <= params.pageSize\n      ? { page: items, metadata, nextCursor: undefined, offset: 0 }\n      : pageResult(\n          params.store.create({\n            queryKey: params.queryKey,\n            items,\n            metadata,\n          }),\n          0,\n          params.pageSize,\n          { items, metadata },\n        );\n  if (!incomplete || params.externalize === undefined) return first;\n  return { ...first, resource: params.externalize(produced.items, produced.metadata) };\n}\n\nfunction decodePageCursor(cursor: string): PageCursor {\n  try {\n    const text = Buffer.from(cursor, 'base64url').toString('utf-8');\n    const parsed = JSON.parse(text) as { snapshotId?: unknown; offset?: unknown };\n    if (\n      typeof parsed.snapshotId === 'string' &&\n      parsed.snapshotId.length > 0 &&\n      typeof parsed.offset === 'number' &&\n      Number.isInteger(parsed.offset) &&\n      parsed.offset >= 0\n    ) {\n      return { snapshotId: parsed.snapshotId, offset: parsed.offset };\n    }\n    throw new Error('Invalid page cursor');\n  } catch (error) {\n    if (error instanceof FsError) throw error;\n    throw new FsError(\n      ErrorCode.INVALID_INPUT,\n      invalidCursor().message,\n      undefined,\n      error instanceof Error ? error : undefined,\n    );\n  }\n}\n"]}
+{"version":3,"file":"cursor.js","sourceRoot":"","sources":["../../src/core/cursor.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEjD,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAO3C,SAAS,gBAAgB,CAAC,MAAkB;IAC1C,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AACnE,CAAC;AAED,SAAS,UAAU,CACjB,UAAkB,EAClB,MAAc,EACd,QAAgB,EAChB,QAA4B;IAE5B,IAAI,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM;QAAE,MAAM,aAAa,EAAE,CAAC;IAC3D,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC;IAC7D,MAAM,UAAU,GAAG,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACxC,OAAO;QACL,IAAI;QACJ,QAAQ,EAAE,QAAQ,CAAC,QAAQ;QAC3B,MAAM;QACN,UAAU,EACR,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM;YAChC,CAAC,CAAC,gBAAgB,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;YACtD,CAAC,CAAC,SAAS;KAChB,CAAC;AACJ,CAAC;AA8BD;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAU,MAOvC;IACC,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAO,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC9E,OAAO,UAAU,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACnF,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,EAAE,CAAC;IACxC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAAC;IACrC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,IAAI,QAAQ,CAAC,SAAS,CAAC;IACxE,MAAM,KAAK,GACT,KAAK,CAAC,MAAM,IAAI,MAAM,CAAC,QAAQ;QAC7B,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,EAAE;QAC7D,CAAC,CAAC,UAAU,CACR,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;YAClB,QAAQ,EAAE,MAAM,CAAC,QAAQ;YACzB,KAAK;YACL,QAAQ;SACT,CAAC,EACF,CAAC,EACD,MAAM,CAAC,QAAQ,EACf,EAAE,KAAK,EAAE,QAAQ,EAAE,CACpB,CAAC;IACR,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,WAAW,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAClE,OAAO,EAAE,GAAG,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;AACvF,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAc;IACtC,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAA+C,CAAC;QAC9E,IACE,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ;YACrC,MAAM,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;YAC5B,OAAO,MAAM,CAAC,MAAM,KAAK,QAAQ;YACjC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC;YAC/B,MAAM,CAAC,MAAM,IAAI,CAAC,EAClB,CAAC;YACD,OAAO,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;QAClE,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;IACzC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,OAAO;YAAE,MAAM,KAAK,CAAC;QAC1C,MAAM,IAAI,OAAO,CACf,SAAS,CAAC,aAAa,EACvB,aAAa,EAAE,CAAC,OAAO,EACvB,SAAS,EACT,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAC3C,CAAC;IACJ,CAAC;AACH,CAAC","sourcesContent":["import { ErrorCode, FsError } from './errors.ts';\nimport type { PageSnapshot, PageSnapshotStore } from './store.ts';\nimport { invalidCursor } from './store.ts';\n\ninterface PageCursor {\n  readonly snapshotId: string;\n  readonly offset: number;\n}\n\nfunction encodePageCursor(cursor: PageCursor): string {\n  return Buffer.from(JSON.stringify(cursor)).toString('base64url');\n}\n\nfunction pageResult<T, M>(\n  snapshotId: string,\n  offset: number,\n  pageSize: number,\n  snapshot: PageSnapshot<T, M>,\n): Page<T, M> {\n  if (offset >= snapshot.items.length) throw invalidCursor();\n  const page = snapshot.items.slice(offset, offset + pageSize);\n  const nextOffset = offset + page.length;\n  return {\n    page,\n    metadata: snapshot.metadata,\n    offset,\n    nextCursor:\n      nextOffset < snapshot.items.length\n        ? encodePageCursor({ snapshotId, offset: nextOffset })\n        : undefined,\n  };\n}\n\n/**\n * The full result set a paged tool produced, before slicing. `truncated` is the\n * engine's own stop state — the hard result cap or a timeout cut the set — and\n * says nothing about page size.\n */\nexport interface ProducedPage<T, M> {\n  readonly items: readonly T[];\n  readonly metadata: M;\n  readonly truncated: boolean;\n}\n\ninterface Page<T, M> {\n  readonly page: readonly T[];\n  readonly metadata: M;\n  readonly nextCursor: string | undefined;\n  /**\n   * Index of this page's first item in the full set. A tool that reports\n   * progress in its text needs it: without it every page can only say how many\n   * rows it holds, which is the same number on page 1 and page 9.\n   */\n  readonly offset: number;\n}\n\nexport interface PaginatedPage<T, M, R> extends Page<T, M> {\n  /** The externalized full set. First page only, and only when incomplete. */\n  readonly resource?: R;\n}\n\n/**\n * The one replay-or-produce branch every paged tool runs. A cursor replays a\n * stored snapshot; without one, `produce` runs the query and its result is\n * snapshotted for later pages.\n *\n * The response is incomplete when the set spans more than one page or the\n * engine truncated it. Then — and only on the first page — `externalize`\n * stores the full set and its handle rides back as `resource`. Replayed pages\n * never carry it: the stored entry expires on the resource store's own TTL and\n * LRU, not this snapshot's, so replaying its URI would hand back a dead\n * pointer. Nor do they mint a new one; the set was already stored whole.\n */\nexport async function paginate<T, M, R>(params: {\n  store: PageSnapshotStore;\n  queryKey: string;\n  cursor: string | undefined;\n  pageSize: number;\n  produce: () => Promise<ProducedPage<T, M>>;\n  externalize?: ((items: readonly T[], metadata: M) => R) | undefined;\n}): Promise<PaginatedPage<T, M, R>> {\n  if (params.cursor !== undefined) {\n    const decoded = decodePageCursor(params.cursor);\n    const snapshot = params.store.read<T, M>(decoded.snapshotId, params.queryKey);\n    return pageResult(decoded.snapshotId, decoded.offset, params.pageSize, snapshot);\n  }\n  const produced = await params.produce();\n  const { items, metadata } = produced;\n  const incomplete = items.length > params.pageSize || produced.truncated;\n  const first: Page<T, M> =\n    items.length <= params.pageSize\n      ? { page: items, metadata, nextCursor: undefined, offset: 0 }\n      : pageResult(\n          params.store.create({\n            queryKey: params.queryKey,\n            items,\n            metadata,\n          }),\n          0,\n          params.pageSize,\n          { items, metadata },\n        );\n  if (!incomplete || params.externalize === undefined) return first;\n  return { ...first, resource: params.externalize(produced.items, produced.metadata) };\n}\n\nfunction decodePageCursor(cursor: string): PageCursor {\n  try {\n    const text = Buffer.from(cursor, 'base64url').toString('utf-8');\n    const parsed = JSON.parse(text) as { snapshotId?: unknown; offset?: unknown };\n    if (\n      typeof parsed.snapshotId === 'string' &&\n      parsed.snapshotId.length > 0 &&\n      typeof parsed.offset === 'number' &&\n      Number.isInteger(parsed.offset) &&\n      parsed.offset >= 0\n    ) {\n      return { snapshotId: parsed.snapshotId, offset: parsed.offset };\n    }\n    throw new Error('Invalid page cursor');\n  } catch (error) {\n    if (error instanceof FsError) throw error;\n    throw new FsError(\n      ErrorCode.INVALID_INPUT,\n      invalidCursor().message,\n      undefined,\n      error instanceof Error ? error : undefined,\n    );\n  }\n}\n"]}

package/dist/core/errors.d.ts

@@ -28,9 +28,7 @@ interface ProblemFactoryOptions {
 export declare const Problem: {
     readonly invalidInput: (msg: string, o?: ProblemFactoryOptions) => Problem;
     readonly accessDenied: (msg: string, o?: ProblemFactoryOptions) => Problem;
-    readonly timeout: (msg: string, o?: ProblemFactoryOptions) => Problem;
     readonly cancelled: (msg: string, o?: ProblemFactoryOptions) => Problem;
-    readonly unknown: (msg: string, o?: ProblemFactoryOptions) => Problem;
     readonly fromUnknown: (error: unknown, defaultCode: ErrorCode, path?: string) => Problem;
     readonly toText: (error: unknown, defaultCode: ErrorCode) => {
         code: ErrorCode;
@@ -43,18 +41,15 @@ export declare const SKIPPABLE_ERRNOS: ReadonlySet<string>;
 export declare function isFsError(error: unknown): error is FsError;
 /** FsError traces to a caller-supplied argument; anything else is server-side. */
 export declare function fsErrorCode(error: unknown): ProtocolErrorCode;
-/**
- * Structural discriminator for SDK error classes (`ProtocolError`, `SdkError`).
- * Checks `name` + `code` properties rather than `instanceof` so discrimination
- * survives cross-realm / multi-SDK-copy conditions where the prototype chain
- * breaks. Mirrors the isFsError pattern.
- */
-export declare function hasErrorShape(error: unknown, name: string): error is Error & {
-    code: string | number;
-};
 export declare function isNodeError(error: unknown): error is NodeJS.ErrnoException;
 /** True when `error` is a Node errno error with code `ENOENT` (path not found). */
 export declare function isNotFoundErrno(error: unknown): error is NodeJS.ErrnoException;
+/**
+ * Rethrow when `error` reads as cancelled. Answers the question directly rather
+ * than through `classify`, which allocated a Problem — and ran
+ * `formatUnknownErrorMessage`, i.e. a `JSON.stringify` on a non-Error — for a
+ * boolean. This sits in eight catch blocks, several inside per-entry scan loops.
+ */
 export declare function rethrowIfAborted(error: unknown): void;
 export declare function formatUnknownErrorMessage(error: unknown): string;
 export declare function normalizeUnknownError(error: unknown): Error;

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

@@ -1 +1 @@
-{"version":3,"file":"errors.d.ts","sourceRoot":"","sources":["../../src/core/errors.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AAEjE,eAAO,MAAM,SAAS;;;;;;;;;;;;;;CAcZ,CAAC;AAEX,MAAM,MAAM,SAAS,GAAG,CAAC,OAAO,SAAS,CAAC,CAAC,MAAM,OAAO,SAAS,CAAC,CAAC;AAEnE,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED,UAAU,qBAAqB;IAC7B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAWD,eAAO,MAAM,OAAO;iCACE,MAAM,MAAM,qBAAqB,KAAG,OAAO;iCAE3C,MAAM,MAAM,qBAAqB,KAAG,OAAO;4BAEhD,MAAM,MAAM,qBAAqB,KAAG,OAAO;8BACzC,MAAM,MAAM,qBAAqB,KAAG,OAAO;4BAE7C,MAAM,MAAM,qBAAqB,KAAG,OAAO;kCACvC,OAAO,eAAe,SAAS,SAAS,MAAM,KAAG,OAAO;6BAe7D,OAAO,eAAe,SAAS,KAAG;QAAE,IAAI,EAAE,SAAS,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE;CAIzE,CAAC;AAcX,eAAO,MAAM,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAezD,CAAC;AAOF,eAAO,MAAM,kBAAkB,EAAE,WAAW,CAAC,SAAS,CAOpD,CAAC;AAEH,eAAO,MAAM,gBAAgB,EAAE,WAAW,CAAC,MAAM,CAA0C,CAAC;AA4F5F,wBAAgB,SAAS,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,OAAO,CAO1D;AAED,kFAAkF;AAClF,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,iBAAiB,CAE7D;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,OAAO,EACd,IAAI,EAAE,MAAM,GACX,KAAK,IAAI,KAAK,GAAG;IAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAAA;CAAE,CAI5C;AAoBD,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,MAAM,CAAC,cAAc,CAK1E;AAED,mFAAmF;AACnF,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,MAAM,CAAC,cAAc,CAE9E;AAMD,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAErD;AAED,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAQhE;AAED,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,CAE3D;AAeD,qBAAa,OAAQ,SAAQ,KAAK;IAChC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;gBAEd,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO;IAa5E,IAAI,IAAI,IAAI,SAAS,CAEpB;CACF"}
+{"version":3,"file":"errors.d.ts","sourceRoot":"","sources":["../../src/core/errors.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AAEjE,eAAO,MAAM,SAAS;;;;;;;;;;;;;;CAcZ,CAAC;AAEX,MAAM,MAAM,SAAS,GAAG,CAAC,OAAO,SAAS,CAAC,CAAC,MAAM,OAAO,SAAS,CAAC,CAAC;AAEnE,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED,UAAU,qBAAqB;IAC7B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAWD,eAAO,MAAM,OAAO;iCACE,MAAM,MAAM,qBAAqB,KAAG,OAAO;iCAE3C,MAAM,MAAM,qBAAqB,KAAG,OAAO;8BAE9C,MAAM,MAAM,qBAAqB,KAAG,OAAO;kCAEzC,OAAO,eAAe,SAAS,SAAS,MAAM,KAAG,OAAO;6BAe7D,OAAO,eAAe,SAAS,KAAG;QAAE,IAAI,EAAE,SAAS,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE;CAIzE,CAAC;AAcX,eAAO,MAAM,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAezD,CAAC;AAOF,eAAO,MAAM,kBAAkB,EAAE,WAAW,CAAC,SAAS,CAOpD,CAAC;AAEH,eAAO,MAAM,gBAAgB,EAAE,WAAW,CAAC,MAAM,CAA0C,CAAC;AA+C5F,wBAAgB,SAAS,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,OAAO,CAE1D;AAED,kFAAkF;AAClF,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,iBAAiB,CAE7D;AAmBD,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,MAAM,CAAC,cAAc,CAK1E;AAED,mFAAmF;AACnF,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,MAAM,CAAC,cAAc,CAE9E;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAiBrD;AAED,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAQhE;AAED,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,CAE3D;AAeD,qBAAa,OAAQ,SAAQ,KAAK;IAChC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;gBAEd,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO;IAY5E,IAAI,IAAI,IAAI,SAAS,CAEpB;CACF"}

package/dist/core/errors.js

@@ -25,9 +25,7 @@ function build(code, message, opts = {}) {
 export const Problem = {
     invalidInput: (msg, o) => build(ErrorCode.INVALID_INPUT, msg, o),
     accessDenied: (msg, o) => build(ErrorCode.ACCESS_DENIED, msg, o),
-    timeout: (msg, o) => build(ErrorCode.TIMEOUT, msg, o),
     cancelled: (msg, o) => build(ErrorCode.CANCELLED, msg, o),
-    unknown: (msg, o) => build(ErrorCode.UNKNOWN, msg, o),
     fromUnknown(error, defaultCode, path) {
         const problem = classify(error);
         const shouldOverride = problem.code === ErrorCode.UNKNOWN || problem.code === ErrorCode.IO_ERROR;
@@ -86,125 +84,59 @@ export const SKIPPABLE_FS_CODES = new Set([
     ErrorCode.SYMLINK_NOT_ALLOWED,
 ]);
 export const SKIPPABLE_ERRNOS = new Set(['ENOENT', 'EACCES', 'ELOOP']);
-function readErrnoCode(value) {
-    if (!(value instanceof Error))
-        return undefined;
-    const code = value.code;
-    if (typeof code !== 'string')
-        return undefined;
-    return code;
-}
-function isAbortSingle(value) {
-    if (!(value instanceof Error))
-        return false;
-    if (value.name === 'AbortError')
-        return true;
-    const code = readErrnoCode(value);
-    return code === 'ABORT_ERR';
-}
-function isTimeoutSingle(value) {
-    if (!(value instanceof Error))
-        return false;
-    if (value.name === 'TimeoutError')
-        return true;
-    return readErrnoCode(value) === 'ETIMEDOUT';
-}
-function readSignalSingle(value) {
-    if (isAbortSingle(value))
-        return { kind: 'abort' };
-    if (isTimeoutSingle(value))
-        return { kind: 'timeout' };
-    const code = readErrnoCode(value);
-    if (code !== undefined && ERRNO_RE.test(code)) {
-        const v = value;
-        return {
-            kind: 'errno',
-            errno: code,
-            ...(typeof v.syscall === 'string' ? { syscall: v.syscall } : {}),
-            ...(typeof v.path === 'string' ? { path: v.path } : {}),
-        };
-    }
-    return undefined;
-}
-function walkCauseChain(error) {
-    let current = error;
+/**
+ * Walk `error` and its `cause` chain for the one fact that decides the code: an
+ * abort anywhere wins, then a timeout anywhere, then the FIRST errno seen.
+ * `visited` guards a cyclic chain. Returns the Problem directly — the
+ * intermediate signal union this replaced existed only to be destructured back
+ * into a Problem two functions later, and carried a `syscall` nobody read.
+ */
+function classifyCauseChain(error) {
+    const message = formatUnknownErrorMessage(error);
     const visited = new Set();
-    let abortSeen = false;
-    let timeoutSeen = false;
-    let errnoSignal;
-    while (current !== undefined && current !== null && !visited.has(current)) {
-        const signal = readSignalSingle(current);
-        if (signal !== undefined) {
-            if (signal.kind === 'abort')
-                abortSeen = true;
-            else if (signal.kind === 'timeout')
-                timeoutSeen = true;
-            else if (signal.kind === 'errno' && errnoSignal === undefined) {
-                errnoSignal = signal;
-            }
-        }
+    let aborted = false;
+    let timedOut = false;
+    let errno;
+    for (let current = error; current !== undefined && current !== null && !visited.has(current); current = current.cause) {
         visited.add(current);
-        current = current.cause;
-    }
-    if (abortSeen)
-        return { kind: 'abort' };
-    if (timeoutSeen)
-        return { kind: 'timeout' };
-    if (errnoSignal !== undefined)
-        return errnoSignal;
-    return { kind: 'unknown' };
-}
-function buildProblemFromSignal(signal, error) {
-    const message = formatUnknownErrorMessage(error);
-    switch (signal.kind) {
-        case 'abort':
-            return Problem.cancelled(message);
-        case 'timeout':
-            return Problem.timeout(message);
-        case 'errno': {
-            const code = ERRNO_MAP[signal.errno] ?? ErrorCode.IO_ERROR;
-            return build(code, message, {
-                ...(signal.path !== undefined ? { path: signal.path } : {}),
-            });
+        if (!(current instanceof Error))
+            continue;
+        const raw = current.code;
+        const code = typeof raw === 'string' ? raw : undefined;
+        // Ordered like the per-error read it replaces: a node that reads as an
+        // abort or a timeout never also contributes its errno.
+        if (current.name === 'AbortError' || code === 'ABORT_ERR') {
+            aborted = true;
         }
-        case 'unknown':
-            return Problem.unknown(message);
-        default: {
-            const _exhaustive = signal;
-            return _exhaustive;
+        else if (current.name === 'TimeoutError' || code === 'ETIMEDOUT') {
+            timedOut = true;
+        }
+        else if (errno === undefined && code !== undefined && ERRNO_RE.test(code)) {
+            const { path } = current;
+            errno = { code, ...(typeof path === 'string' ? { path } : {}) };
         }
     }
+    if (aborted)
+        return Problem.cancelled(message);
+    if (timedOut)
+        return build(ErrorCode.TIMEOUT, message);
+    if (errno !== undefined) {
+        return build(ERRNO_MAP[errno.code] ?? ErrorCode.IO_ERROR, message, {
+            ...(errno.path !== undefined ? { path: errno.path } : {}),
+        });
+    }
+    return build(ErrorCode.UNKNOWN, message);
 }
 export function isFsError(error) {
-    if (!(error instanceof Error) || error.name !== 'FsError')
-        return false;
-    if (!('problem' in error))
-        return false;
-    const p = error.problem;
-    if (p === null || typeof p !== 'object')
-        return false;
-    const c = p;
-    return typeof c['code'] === 'string' && typeof c['message'] === 'string';
+    return error instanceof FsError;
 }
 /** FsError traces to a caller-supplied argument; anything else is server-side. */
 export function fsErrorCode(error) {
     return isFsError(error) ? ProtocolErrorCode.InvalidParams : ProtocolErrorCode.InternalError;
 }
-/**
- * Structural discriminator for SDK error classes (`ProtocolError`, `SdkError`).
- * Checks `name` + `code` properties rather than `instanceof` so discrimination
- * survives cross-realm / multi-SDK-copy conditions where the prototype chain
- * breaks. Mirrors the isFsError pattern.
- */
-export function hasErrorShape(error, name) {
-    if (!(error instanceof Error) || error.name !== name)
-        return false;
-    const c = error.code;
-    return typeof c === 'string' || typeof c === 'number';
-}
 function classify(error) {
     if (error === null || error === undefined) {
-        return Problem.unknown('Unknown error');
+        return build(ErrorCode.UNKNOWN, 'Unknown error');
     }
     if (isFsError(error))
         return error.problem;
@@ -212,13 +144,12 @@ function classify(error) {
     // `safeParse` inside the SDK's validator seam (tools/define.ts), which never
     // throws — it hands back `z.prettifyError`'s string — and nothing in `src/`
     // calls `.parse()`. A ZodError reaching here would fall through to
-    // `Problem.unknown` with Zod's raw JSON-dump `.message`, so if a `.parse()`
+    // UNKNOWN with Zod's raw JSON-dump `.message`, so if a `.parse()`
     // is ever added, add the branch back with it rather than discovering this.
     if (!(error instanceof Error)) {
-        return Problem.unknown(typeof error === 'string' ? error : '[non-Error thrown]');
+        return build(ErrorCode.UNKNOWN, typeof error === 'string' ? error : '[non-Error thrown]');
     }
-    const signal = walkCauseChain(error);
-    return buildProblemFromSignal(signal, error);
+    return classifyCauseChain(error);
 }
 export function isNodeError(error) {
     if (!(error instanceof Error))
@@ -232,12 +163,27 @@ export function isNodeError(error) {
 export function isNotFoundErrno(error) {
     return isNodeError(error) && error.code === 'ENOENT';
 }
-function isAbortError(error) {
-    return classify(error).code === ErrorCode.CANCELLED;
-}
+/**
+ * Rethrow when `error` reads as cancelled. Answers the question directly rather
+ * than through `classify`, which allocated a Problem — and ran
+ * `formatUnknownErrorMessage`, i.e. a `JSON.stringify` on a non-Error — for a
+ * boolean. This sits in eight catch blocks, several inside per-entry scan loops.
+ */
 export function rethrowIfAborted(error) {
-    if (isAbortError(error))
-        throw error;
+    if (isFsError(error)) {
+        if (error.code === ErrorCode.CANCELLED)
+            throw error;
+        return;
+    }
+    const visited = new Set();
+    for (let current = error; current !== undefined && current !== null && !visited.has(current); current = current.cause) {
+        visited.add(current);
+        if (!(current instanceof Error))
+            continue;
+        if (current.name === 'AbortError' || current.code === 'ABORT_ERR') {
+            throw error;
+        }
+    }
 }
 export function formatUnknownErrorMessage(error) {
     if (typeof error === 'string')
@@ -276,7 +222,6 @@ export class FsError extends Error {
             ...(suggestion !== undefined ? { suggestion } : {}),
         };
         this.name = 'FsError';
-        Object.setPrototypeOf(this, FsError.prototype);
     }
     get code() {
         return this.problem.code;