sh-ast 0.6.1 → 0.8.0

package/dist/errors.d.ts

@@ -50,41 +50,28 @@ export declare class ShAnalyzeMaxDepthError extends ShAstError {
     constructor(maxDepth: number);
 }
 /**
- * Thrown by {@link parseSync} when `text`'s conservatively estimated
- * structural nesting depth (subshells, command/process substitutions,
- * `if`/`case`/loop/function bodies, `{ }` blocks, backtick or `$(...)`
- * command substitution, `$((...))` arithmetic — see
- * `parse-depth-guard.ts`'s module doc for the exact heuristic) exceeds the
- * limit `parseSync` accepts. Thrown *before* `text` is ever handed to the
- * WASM shim: mvdan/sh's own recursive-descent parser has no recovery path
- * for exhausting its call stack on pathologically deep input (a stack
- * overflow deep inside the shared WASM instance is not a normal, catchable
- * JS error the way a parse syntax error is), so this bridge estimates the
- * risk up front and fails closed with a typed error instead of ever making
- * that call — the shared WASM instance is therefore never put at risk of
- * wedging on this class of input; a `parseSync` call right after catching
- * this error works exactly as it would if this input had never been
- * attempted.
+ * A whole-file parse operation exceeded the binding's native node-nesting budget.
+ * The maintained parser counts statement, word, and expression work, including
+ * iterative construction of deep operator trees. A refusal returns no partial
+ * File or position snapshot and leaves subsequent parse calls available.
  *
- * Like {@link ShAnalyzeMaxDepthError}, this is pathological-input
- * protection, not a normal-usage ceiling: a legitimately deep (but
- * realistic) script parses fine. The estimate can *over*-count relative to
- * mvdan/sh's real grammar (rejecting some legitimate-but-unusually-deep
- * input) but is designed to never *under*-count relative to it — see
- * `parse-depth-guard.ts` for the documented false-positive sources this
- * trades off against ever letting a genuinely crash-inducing input
- * through.
+ * This is a binding resource constraint, not an upstream grammar restriction.
+ * The fixed 128-unit policy can refuse valid deeply nested input. Units describe
+ * native node work, not actual Go/JavaScript frames or necessarily final AST
+ * depth. The empirical margin assumes an ordinary caller stack; arbitrary
+ * pre-existing JavaScript recursion can exhaust it. This does not establish
+ * safety for arbitrary caller-constructed trees or other recursive operations.
  *
  * @public
  */
 export declare class ShParseMaxDepthError extends ShAstError {
     readonly code = "SH_AST_PARSE_MAX_DEPTH";
-    /** The maximum structural nesting depth `parseSync` accepts; the same value every time (not caller-configurable). */
+    /** Fixed maximum native node-nesting units; not caller-configurable. */
     readonly maxDepth: number;
     /**
-     * The conservatively estimated nesting depth that tripped the guard.
-     * Not necessarily `text`'s "true" nesting depth under a real parse — see
-     * {@link ShParseMaxDepthError}'s doc comment — only ever `> maxDepth`.
+     * Native node work at the rejected entry, greater than {@link ShParseMaxDepthError.maxDepth}.
+     * The historical field name is retained for compatibility; the value is no
+     * longer a lexical estimate and is not a count of runtime stack frames.
      */
     readonly estimatedDepth: number;
     constructor(maxDepth: number, estimatedDepth: number);

package/dist/errors.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"errors.d.ts","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAE9F;;;;;GAKG;AACH,8BAAsB,UAAW,SAAQ,KAAK;IAC5C,qEAAqE;IACrE,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CAChC;AAED;;;;;;;;;GASG;AACH,qBAAa,eAAgB,SAAQ,UAAU;IAC7C,QAAQ,CAAC,IAAI,qBAAqB;gBAEtB,OAAO,EAAE,MAAM;CAI5B;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,qBAAa,sBAAuB,SAAQ,UAAU;IACpD,QAAQ,CAAC,IAAI,8BAA8B;IAC3C,mHAAmH;IACnH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;gBAEd,QAAQ,EAAE,MAAM;CAO7B;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,qBAAa,oBAAqB,SAAQ,UAAU;IAClD,QAAQ,CAAC,IAAI,4BAA4B;IACzC,qHAAqH;IACrH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;gBAEpB,QAAQ,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM;CAQrD;AAED;;;;;;;;;;GAUG;AACH,qBAAa,gCAAiC,SAAQ,UAAU;IAC9D,QAAQ,CAAC,IAAI,yCAAyC;gBAE1C,OAAO,EAAE,MAAM;CAI5B"}
+{"version":3,"file":"errors.d.ts","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAE9F;;;;;GAKG;AACH,8BAAsB,UAAW,SAAQ,KAAK;IAC5C,qEAAqE;IACrE,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CAChC;AAED;;;;;;;;;GASG;AACH,qBAAa,eAAgB,SAAQ,UAAU;IAC7C,QAAQ,CAAC,IAAI,qBAAqB;gBAEtB,OAAO,EAAE,MAAM;CAI5B;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,qBAAa,sBAAuB,SAAQ,UAAU;IACpD,QAAQ,CAAC,IAAI,8BAA8B;IAC3C,mHAAmH;IACnH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;gBAEd,QAAQ,EAAE,MAAM;CAO7B;AAED;;;;;;;;;;;;;;GAcG;AACH,qBAAa,oBAAqB,SAAQ,UAAU;IAClD,QAAQ,CAAC,IAAI,4BAA4B;IACzC,wEAAwE;IACxE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;gBAEpB,QAAQ,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM;CAQrD;AAED;;;;;;;;;;GAUG;AACH,qBAAa,gCAAiC,SAAQ,UAAU;IAC9D,QAAQ,CAAC,IAAI,yCAAyC;gBAE1C,OAAO,EAAE,MAAM;CAI5B"}

package/dist/errors.js

@@ -55,45 +55,32 @@ export class ShAnalyzeMaxDepthError extends ShAstError {
     }
 }
 /**
- * Thrown by {@link parseSync} when `text`'s conservatively estimated
- * structural nesting depth (subshells, command/process substitutions,
- * `if`/`case`/loop/function bodies, `{ }` blocks, backtick or `$(...)`
- * command substitution, `$((...))` arithmetic — see
- * `parse-depth-guard.ts`'s module doc for the exact heuristic) exceeds the
- * limit `parseSync` accepts. Thrown *before* `text` is ever handed to the
- * WASM shim: mvdan/sh's own recursive-descent parser has no recovery path
- * for exhausting its call stack on pathologically deep input (a stack
- * overflow deep inside the shared WASM instance is not a normal, catchable
- * JS error the way a parse syntax error is), so this bridge estimates the
- * risk up front and fails closed with a typed error instead of ever making
- * that call — the shared WASM instance is therefore never put at risk of
- * wedging on this class of input; a `parseSync` call right after catching
- * this error works exactly as it would if this input had never been
- * attempted.
+ * A whole-file parse operation exceeded the binding's native node-nesting budget.
+ * The maintained parser counts statement, word, and expression work, including
+ * iterative construction of deep operator trees. A refusal returns no partial
+ * File or position snapshot and leaves subsequent parse calls available.
  *
- * Like {@link ShAnalyzeMaxDepthError}, this is pathological-input
- * protection, not a normal-usage ceiling: a legitimately deep (but
- * realistic) script parses fine. The estimate can *over*-count relative to
- * mvdan/sh's real grammar (rejecting some legitimate-but-unusually-deep
- * input) but is designed to never *under*-count relative to it — see
- * `parse-depth-guard.ts` for the documented false-positive sources this
- * trades off against ever letting a genuinely crash-inducing input
- * through.
+ * This is a binding resource constraint, not an upstream grammar restriction.
+ * The fixed 128-unit policy can refuse valid deeply nested input. Units describe
+ * native node work, not actual Go/JavaScript frames or necessarily final AST
+ * depth. The empirical margin assumes an ordinary caller stack; arbitrary
+ * pre-existing JavaScript recursion can exhaust it. This does not establish
+ * safety for arbitrary caller-constructed trees or other recursive operations.
  *
  * @public
  */
 export class ShParseMaxDepthError extends ShAstError {
     code = 'SH_AST_PARSE_MAX_DEPTH';
-    /** The maximum structural nesting depth `parseSync` accepts; the same value every time (not caller-configurable). */
+    /** Fixed maximum native node-nesting units; not caller-configurable. */
     maxDepth;
     /**
-     * The conservatively estimated nesting depth that tripped the guard.
-     * Not necessarily `text`'s "true" nesting depth under a real parse — see
-     * {@link ShParseMaxDepthError}'s doc comment — only ever `> maxDepth`.
+     * Native node work at the rejected entry, greater than {@link ShParseMaxDepthError.maxDepth}.
+     * The historical field name is retained for compatibility; the value is no
+     * longer a lexical estimate and is not a count of runtime stack frames.
      */
     estimatedDepth;
     constructor(maxDepth, estimatedDepth) {
-        super(`parseSync: input's estimated structural nesting depth (${String(estimatedDepth)}+ frames) exceeds the maximum this bridge accepts (${String(maxDepth)}) — refusing to hand this input to the WASM parser, which would risk exhausting its call stack uncatchably. Treat this as a deny signal, not "input looks fine".`);
+        super(`parseSync: native parser node work (${String(estimatedDepth)} units) exceeds the maximum this bridge accepts (${String(maxDepth)}) — refusing this input without a partial result.`);
         this.name = 'ShParseMaxDepthError';
         this.maxDepth = maxDepth;
         this.estimatedDepth = estimatedDepth;

package/dist/errors.js.map

@@ -1 +1 @@
-{"version":3,"file":"errors.js","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAE9F;;;;;GAKG;AACH,MAAM,OAAgB,UAAW,SAAQ,KAAK;CAG7C;AAED;;;;;;;;;GASG;AACH,MAAM,OAAO,eAAgB,SAAQ,UAAU;IACpC,IAAI,GAAG,iBAAiB,CAAC;IAElC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;IAChC,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,sBAAuB,SAAQ,UAAU;IAC3C,IAAI,GAAG,0BAA0B,CAAC;IAC3C,mHAAmH;IAC1G,QAAQ,CAAS;IAE1B,YAAY,QAAgB;QAC1B,KAAK,CACH,+EAA+E,MAAM,CAAC,QAAQ,CAAC,uGAAuG,CACvM,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,wBAAwB,CAAC;QACrC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,OAAO,oBAAqB,SAAQ,UAAU;IACzC,IAAI,GAAG,wBAAwB,CAAC;IACzC,qHAAqH;IAC5G,QAAQ,CAAS;IAC1B;;;;OAIG;IACM,cAAc,CAAS;IAEhC,YAAY,QAAgB,EAAE,cAAsB;QAClD,KAAK,CACH,0DAA0D,MAAM,CAAC,cAAc,CAAC,sDAAsD,MAAM,CAAC,QAAQ,CAAC,kKAAkK,CACzT,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACvC,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,gCAAiC,SAAQ,UAAU;IACrD,IAAI,GAAG,qCAAqC,CAAC;IAEtD,YAAY,OAAe;QACzB,KAAK,CAAC,qDAAqD,OAAO,EAAE,CAAC,CAAC;QACtE,IAAI,CAAC,IAAI,GAAG,kCAAkC,CAAC;IACjD,CAAC;CACF"}
+{"version":3,"file":"errors.js","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAE9F;;;;;GAKG;AACH,MAAM,OAAgB,UAAW,SAAQ,KAAK;CAG7C;AAED;;;;;;;;;GASG;AACH,MAAM,OAAO,eAAgB,SAAQ,UAAU;IACpC,IAAI,GAAG,iBAAiB,CAAC;IAElC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;IAChC,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,sBAAuB,SAAQ,UAAU;IAC3C,IAAI,GAAG,0BAA0B,CAAC;IAC3C,mHAAmH;IAC1G,QAAQ,CAAS;IAE1B,YAAY,QAAgB;QAC1B,KAAK,CACH,+EAA+E,MAAM,CAAC,QAAQ,CAAC,uGAAuG,CACvM,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,wBAAwB,CAAC;QACrC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;CACF;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,oBAAqB,SAAQ,UAAU;IACzC,IAAI,GAAG,wBAAwB,CAAC;IACzC,wEAAwE;IAC/D,QAAQ,CAAS;IAC1B;;;;OAIG;IACM,cAAc,CAAS;IAEhC,YAAY,QAAgB,EAAE,cAAsB;QAClD,KAAK,CACH,uCAAuC,MAAM,CAAC,cAAc,CAAC,oDAAoD,MAAM,CAAC,QAAQ,CAAC,mDAAmD,CACrL,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACvC,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,gCAAiC,SAAQ,UAAU;IACrD,IAAI,GAAG,qCAAqC,CAAC;IAEtD,YAAY,OAAe;QACzB,KAAK,CAAC,qDAAqD,OAAO,EAAE,CAAC,CAAC;QACtE,IAAI,CAAC,IAAI,GAAG,kCAAkC,CAAC;IACjD,CAAC;CACF"}

package/dist/sh-ast.d.ts

@@ -2263,8 +2263,12 @@ export declare interface ParseOptions {
 
 /**
  * Parses exact source bytes, or well-formed Unicode text encoded as UTF-8. First
- * use synchronously initializes WASM. The existing conservative nesting guard is
- * an explicit binding resource limit, not an upstream grammar restriction.
+ * use synchronously initializes WASM. Native node-nesting work has a fixed binding
+ * resource budget; exceeding it throws {@link ShParseMaxDepthError}. Subsequent
+ * parse calls remain usable after that refusal.
+ * The returned File and its Node subtrees are plain syntax data: ordinary
+ * structuredClone(node), without transfers, makes an independent editable copy
+ * while retaining position values, byte strings, typed nils and internal aliases.
  * @public
  */
 export declare function parseSync(source: string | Uint8Array, options?: ParseOptions): File_2;
@@ -2307,7 +2311,10 @@ export declare const Plus: 81;
 
 /**
  * Identity-based lookup of the original parse's bounds. A new or copied node has
- * no observation. The index never calls WASM or recalculates edited node bounds.
+ * no observation, including every node in a structuredClone of the syntax tree.
+ * Clone File or a Node subtree, not this function-bearing lookup. Copied position
+ * fields retain their values but do not transfer snapshot identity.
+ * The index never calls WASM or recalculates edited node bounds.
  * @public
  */
 export declare interface PositionSnapshot {
@@ -2398,7 +2405,9 @@ export declare class PrintPanicError extends ShAstError {
 /**
  * Formats the current tree with a fresh upstream printer and collects all output.
  * Supported roots are File, Stmt, Word, Assign, Command and WordPart; other Nodes
- * produce PrintError. Only File output has upstream's trailing-newline behavior.
+ * produce PrintError. An ordinary structuredClone of a supported syntax subtree
+ * is accepted under the same input and failure rules; copying does not make nil
+ * or unsupported roots printable. Only File output has upstream's trailing-newline behavior.
  * Invalid UTF-8 output remains bytes. Upstream formatting can itself consume
  * input bytes, including its tabwriter escape byte, so this is not source replay.
  *
@@ -2827,41 +2836,28 @@ export declare const Shl: 71;
 export declare const ShlAssgn: 57;
 
 /**
- * Thrown by {@link parseSync} when `text`'s conservatively estimated
- * structural nesting depth (subshells, command/process substitutions,
- * `if`/`case`/loop/function bodies, `{ }` blocks, backtick or `$(...)`
- * command substitution, `$((...))` arithmetic — see
- * `parse-depth-guard.ts`'s module doc for the exact heuristic) exceeds the
- * limit `parseSync` accepts. Thrown *before* `text` is ever handed to the
- * WASM shim: mvdan/sh's own recursive-descent parser has no recovery path
- * for exhausting its call stack on pathologically deep input (a stack
- * overflow deep inside the shared WASM instance is not a normal, catchable
- * JS error the way a parse syntax error is), so this bridge estimates the
- * risk up front and fails closed with a typed error instead of ever making
- * that call — the shared WASM instance is therefore never put at risk of
- * wedging on this class of input; a `parseSync` call right after catching
- * this error works exactly as it would if this input had never been
- * attempted.
- *
- * Like {@link ShAnalyzeMaxDepthError}, this is pathological-input
- * protection, not a normal-usage ceiling: a legitimately deep (but
- * realistic) script parses fine. The estimate can *over*-count relative to
- * mvdan/sh's real grammar (rejecting some legitimate-but-unusually-deep
- * input) but is designed to never *under*-count relative to it — see
- * `parse-depth-guard.ts` for the documented false-positive sources this
- * trades off against ever letting a genuinely crash-inducing input
- * through.
+ * A whole-file parse operation exceeded the binding's native node-nesting budget.
+ * The maintained parser counts statement, word, and expression work, including
+ * iterative construction of deep operator trees. A refusal returns no partial
+ * File or position snapshot and leaves subsequent parse calls available.
+ *
+ * This is a binding resource constraint, not an upstream grammar restriction.
+ * The fixed 128-unit policy can refuse valid deeply nested input. Units describe
+ * native node work, not actual Go/JavaScript frames or necessarily final AST
+ * depth. The empirical margin assumes an ordinary caller stack; arbitrary
+ * pre-existing JavaScript recursion can exhaust it. This does not establish
+ * safety for arbitrary caller-constructed trees or other recursive operations.
  *
  * @public
  */
 export declare class ShParseMaxDepthError extends ShAstError {
     readonly code = "SH_AST_PARSE_MAX_DEPTH";
-    /** The maximum structural nesting depth `parseSync` accepts; the same value every time (not caller-configurable). */
+    /** Fixed maximum native node-nesting units; not caller-configurable. */
     readonly maxDepth: number;
     /**
-     * The conservatively estimated nesting depth that tripped the guard.
-     * Not necessarily `text`'s "true" nesting depth under a real parse — see
-     * {@link ShParseMaxDepthError}'s doc comment — only ever `> maxDepth`.
+     * Native node work at the rejected entry, greater than {@link ShParseMaxDepthError.maxDepth}.
+     * The historical field name is retained for compatibility; the value is no
+     * longer a lexical estimate and is not a count of runtime stack frames.
      */
     readonly estimatedDepth: number;
     constructor(maxDepth: number, estimatedDepth: number);

package/dist/syntax-operator.d.ts

@@ -0,0 +1,9 @@
+import type { OperatorFamily, RawOperator } from '../generated/syntax-constants.js';
+/**
+ * Represents an unnamed value in an upstream uint32 operator family. Named
+ * constants remain precise literal unions; this explicit path preserves other Go
+ * values without claiming an operation such as Print accepts them.
+ * @public
+ */
+export declare function rawOperator<Family extends OperatorFamily>(family: Family, value: number): RawOperator<Family>;
+//# sourceMappingURL=syntax-operator.d.ts.map

package/dist/syntax-operator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"syntax-operator.d.ts","sourceRoot":"","sources":["../src/syntax-operator.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAGpF;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,MAAM,SAAS,cAAc,EACvD,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,GACZ,WAAW,CAAC,MAAM,CAAC,CAarB"}

package/dist/syntax-operator.js

@@ -0,0 +1,22 @@
+/**
+ * Validates unnamed operator values against the faithful field domains. This
+ * shared constructor owns numeric branding only; it does not parse syntax or
+ * promise that an upstream operation accepts every representable operator.
+ */
+import { SYNTAX_SCHEMA } from '../generated/syntax-schema.js';
+import { InputError } from './syntax-errors.js';
+/**
+ * Represents an unnamed value in an upstream uint32 operator family. Named
+ * constants remain precise literal unions; this explicit path preserves other Go
+ * values without claiming an operation such as Print accepts them.
+ * @public
+ */
+export function rawOperator(family, value) {
+    const knownFamily = Object.values(SYNTAX_SCHEMA).some((record) => Object.values(record.fields).some((field) => field.kind === 'operator' && field.type === family));
+    if (!knownFamily || !Number.isInteger(value) || value < 0 || value > 0xffff_ffff) {
+        throw new InputError('An operator value must belong to a known family and be an integral uint32');
+    }
+    // The runtime check establishes the opaque numeric brand; no value is changed.
+    return value;
+}
+//# sourceMappingURL=syntax-operator.js.map

package/dist/syntax-operator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"syntax-operator.js","sourceRoot":"","sources":["../src/syntax-operator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,aAAa,EAAE,MAAM,+BAA+B,CAAC;AAE9D,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAEhD;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,MAAc,EACd,KAAa;IAEb,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAC/D,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAC/B,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,CAC9D,CACF,CAAC;IACF,IAAI,CAAC,WAAW,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,WAAW,EAAE,CAAC;QACjF,MAAM,IAAI,UAAU,CAClB,2EAA2E,CAC5E,CAAC;IACJ,CAAC;IACD,+EAA+E;IAC/E,OAAO,KAA4B,CAAC;AACtC,CAAC"}

package/dist/syntax-print.d.ts

@@ -34,7 +34,9 @@ export interface PrintOptions {
 /**
  * Formats the current tree with a fresh upstream printer and collects all output.
  * Supported roots are File, Stmt, Word, Assign, Command and WordPart; other Nodes
- * produce PrintError. Only File output has upstream's trailing-newline behavior.
+ * produce PrintError. An ordinary structuredClone of a supported syntax subtree
+ * is accepted under the same input and failure rules; copying does not make nil
+ * or unsupported roots printable. Only File output has upstream's trailing-newline behavior.
  * Invalid UTF-8 output remains bytes. Upstream formatting can itself consume
  * input bytes, including its tabwriter escape byte, so this is not source replay.
  *

package/dist/syntax-print.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"syntax-print.d.ts","sourceRoot":"","sources":["../src/syntax-print.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,8BAA8B,CAAC;AAOnE;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B,qFAAqF;IACrF,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACzB,wFAAwF;IACxF,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,wFAAwF;IACxF,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,+EAA+E;IAC/E,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB;;;OAGG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,yFAAyF;IACzF,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,oFAAoF;IACpF,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,0DAA0D;IAC1D,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC5B;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,GAAE,YAAiB,GAAG,QAAQ,CAoC1E"}
+{"version":3,"file":"syntax-print.d.ts","sourceRoot":"","sources":["../src/syntax-print.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,8BAA8B,CAAC;AAOnE;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B,qFAAqF;IACrF,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACzB,wFAAwF;IACxF,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,wFAAwF;IACxF,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,+EAA+E;IAC/E,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB;;;OAGG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,yFAAyF;IACzF,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,oFAAoF;IACpF,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,0DAA0D;IAC1D,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC5B;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,GAAE,YAAiB,GAAG,QAAQ,CAoC1E"}

package/dist/syntax-print.js

@@ -6,7 +6,9 @@ import { callSyntax } from './wasm-instance.js';
 /**
  * Formats the current tree with a fresh upstream printer and collects all output.
  * Supported roots are File, Stmt, Word, Assign, Command and WordPart; other Nodes
- * produce PrintError. Only File output has upstream's trailing-newline behavior.
+ * produce PrintError. An ordinary structuredClone of a supported syntax subtree
+ * is accepted under the same input and failure rules; copying does not make nil
+ * or unsupported roots printable. Only File output has upstream's trailing-newline behavior.
  * Invalid UTF-8 output remains bytes. Upstream formatting can itself consume
  * input bytes, including its tabwriter escape byte, so this is not source replay.
  *

package/dist/syntax-print.js.map

@@ -1 +1 @@
-{"version":3,"file":"syntax-print.js","sourceRoot":"","sources":["../src/syntax-print.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAC9F,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AA8BhD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,SAAS,CAAC,IAAU,EAAE,UAAwB,EAAE;IAC9D,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,UAAU,CAAC,mDAAmD,CAAC,CAAC;IAC5E,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,UAAU,CAAC,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC7E,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,eAAe,CAAC,mDAAmD,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,eAAe,CAAC,+CAA+C,CAAC,CAAC;QAC7E,CAAC;QACD,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,YAAY;gBACf,MAAM,IAAI,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACtC,KAAK,iBAAiB;gBACpB,MAAM,IAAI,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC3C,KAAK,YAAY;gBACf,MAAM,IAAI,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACtC,KAAK,eAAe;gBAClB,MAAM,IAAI,eAAe,CACvB,OAAO,KAAK,CAAC,OAAO,KAAK,QAAQ;oBAC/B,CAAC,CAAC,KAAK,CAAC,OAAO;oBACf,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAC5C,CAAC;YACJ;gBACE,MAAM,IAAI,eAAe,CAAC,mDAAmD,CAAC,CAAC;QACnF,CAAC;IACH,CAAC;IACD,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,eAAe,CAAC,qDAAqD,CAAC,CAAC;IACnF,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC;AACvB,CAAC;AAED,0FAA0F;AAC1F,SAAS,oBAAoB,CAAC,OAAqB;IACjD,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,UAAU,CAAC,uCAAuC,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC;QACpB,gBAAgB;QAChB,kBAAkB;QAClB,gBAAgB;QAChB,aAAa;QACb,QAAQ;QACR,YAAY;QACZ,kBAAkB;KACnB,CAAC,CAAC;IACH,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACpD,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;YACtB,MAAM,KAAK,GACT,OAAO,KAAK,KAAK,QAAQ;gBACvB,CAAC,CAAC,KAAK,IAAI,EAAE,IAAI,KAAK,IAAI,mBAAsB;gBAChD,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;YAC7E,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,MAAM,IAAI,UAAU,CAAC,4DAA4D,CAAC,CAAC;YACrF,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,UAAU,CAAC,2BAA2B,IAAI,EAAE,CAAC,CAAC;QAC1D,CAAC;aAAM,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE,CAAC;YACtC,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,kBAAkB,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;AACH,CAAC"}
+{"version":3,"file":"syntax-print.js","sourceRoot":"","sources":["../src/syntax-print.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAC9F,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AA8BhD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,SAAS,CAAC,IAAU,EAAE,UAAwB,EAAE;IAC9D,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,UAAU,CAAC,mDAAmD,CAAC,CAAC;IAC5E,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,UAAU,CAAC,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC7E,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,eAAe,CAAC,mDAAmD,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,eAAe,CAAC,+CAA+C,CAAC,CAAC;QAC7E,CAAC;QACD,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,YAAY;gBACf,MAAM,IAAI,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACtC,KAAK,iBAAiB;gBACpB,MAAM,IAAI,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC3C,KAAK,YAAY;gBACf,MAAM,IAAI,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACtC,KAAK,eAAe;gBAClB,MAAM,IAAI,eAAe,CACvB,OAAO,KAAK,CAAC,OAAO,KAAK,QAAQ;oBAC/B,CAAC,CAAC,KAAK,CAAC,OAAO;oBACf,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAC5C,CAAC;YACJ;gBACE,MAAM,IAAI,eAAe,CAAC,mDAAmD,CAAC,CAAC;QACnF,CAAC;IACH,CAAC;IACD,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,eAAe,CAAC,qDAAqD,CAAC,CAAC;IACnF,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC;AACvB,CAAC;AAED,0FAA0F;AAC1F,SAAS,oBAAoB,CAAC,OAAqB;IACjD,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,UAAU,CAAC,uCAAuC,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC;QACpB,gBAAgB;QAChB,kBAAkB;QAClB,gBAAgB;QAChB,aAAa;QACb,QAAQ;QACR,YAAY;QACZ,kBAAkB;KACnB,CAAC,CAAC;IACH,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACpD,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;YACtB,MAAM,KAAK,GACT,OAAO,KAAK,KAAK,QAAQ;gBACvB,CAAC,CAAC,KAAK,IAAI,EAAE,IAAI,KAAK,IAAI,mBAAsB;gBAChD,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;YAC7E,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,MAAM,IAAI,UAAU,CAAC,4DAA4D,CAAC,CAAC;YACrF,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,UAAU,CAAC,2BAA2B,IAAI,EAAE,CAAC,CAAC;QAC1D,CAAC;aAAM,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE,CAAC;YACtC,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,kBAAkB,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/syntax-snapshot.d.ts

@@ -12,7 +12,10 @@ export interface NodePositions {
 }
 /**
  * Identity-based lookup of the original parse's bounds. A new or copied node has
- * no observation. The index never calls WASM or recalculates edited node bounds.
+ * no observation, including every node in a structuredClone of the syntax tree.
+ * Clone File or a Node subtree, not this function-bearing lookup. Copied position
+ * fields retain their values but do not transfer snapshot identity.
+ * The index never calls WASM or recalculates edited node bounds.
  * @public
  */
 export interface PositionSnapshot {

package/dist/syntax-snapshot.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"syntax-snapshot.d.ts","sourceRoot":"","sources":["../src/syntax-snapshot.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,IAAI,EAAY,IAAI,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AAKpF;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC5B,oEAAoE;IACpE,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClC,4EAA4E;IAC5E,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;CACnC;AAED;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;;;OAKG;IACH,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,aAAa,GAAG,SAAS,CAAC;CAC5C;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,kFAAkF;IAClF,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,6EAA6E;IAC7E,QAAQ,CAAC,SAAS,EAAE,gBAAgB,CAAC;CACtC;AAuED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,IAAI,EACV,GAAG,EAAE,OAAO,EACZ,SAAS,EAAE,OAAO,GACjB,gBAAgB,CA4DlB"}
+{"version":3,"file":"syntax-snapshot.d.ts","sourceRoot":"","sources":["../src/syntax-snapshot.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,IAAI,EAAY,IAAI,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AAKpF;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC5B,oEAAoE;IACpE,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClC,4EAA4E;IAC5E,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;CACnC;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;;;OAKG;IACH,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,aAAa,GAAG,SAAS,CAAC;CAC5C;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,kFAAkF;IAClF,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,6EAA6E;IAC7E,QAAQ,CAAC,SAAS,EAAE,gBAAgB,CAAC;CACtC;AAyFD;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,IAAI,EACV,GAAG,EAAE,OAAO,EACZ,SAAS,EAAE,OAAO,GACjB,gBAAgB,CA4DlB"}

package/dist/syntax-snapshot.js

@@ -31,9 +31,7 @@ function visitNodes(file, observe) {
             observe(value);
         if (!Object.hasOwn(SYNTAX_SCHEMA, value.Type))
             return;
-        for (const [name, field] of Object.entries(SYNTAX_SCHEMA[value.Type].fields)) {
-            if (field.kind !== 'struct' && field.kind !== 'interface')
-                continue;
+        for (const name of childFields(value.Type)) {
             const child = value[name];
             if (Array.isArray(child))
                 child.forEach(visit);
@@ -43,6 +41,23 @@ function visitNodes(file, observe) {
     };
     visit(file);
 }
+/**
+ * Child-bearing (struct or interface) field names per record type, in schema
+ * order. The generated schema is immutable, so each list is derived once rather
+ * than re-filtering every field of every visited record.
+ */
+const CHILD_FIELDS = new Map();
+/** Returns the cached child field names for a type known to be in the schema. */
+function childFields(type) {
+    let names = CHILD_FIELDS.get(type);
+    if (names === undefined) {
+        names = Object.entries(SYNTAX_SCHEMA[type].fields)
+            .filter(([, field]) => field.kind === 'struct' || field.kind === 'interface')
+            .map(([name]) => name);
+        CHILD_FIELDS.set(type, names);
+    }
+    return names;
+}
 /** Own byte-bearing failures so neither transport holders nor catchers can alter captures. */
 function copyError(error) {
     return typeof error === 'string' ? error : error.slice();

package/dist/syntax-snapshot.js.map

@@ -1 +1 @@
-{"version":3,"file":"syntax-snapshot.js","sourceRoot":"","sources":["../src/syntax-snapshot.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,+BAA+B,CAAC;AAEjF,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AA+CrE;;;GAGG;AACH,SAAS,cAAc,CAAC,KAA8B;IACpD,OAAO,CACL,CAAC,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/E,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU;YACxB,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ;YAC9B,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAC/C,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,IAAU,EAAE,OAA6B;IAC3D,MAAM,KAAK,GAAG,CAAC,KAAc,EAAQ,EAAE;QACrC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO;QAC/D,IAAI,cAAc,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC;YAAE,OAAO;QACtD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7E,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW;gBAAE,SAAS;YACpE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;;gBAC1C,KAAK,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC,CAAC;IACF,KAAK,CAAC,IAAI,CAAC,CAAC;AACd,CAAC;AAED,8FAA8F;AAC9F,SAAS,SAAS,CAAC,KAAe;IAChC,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;AAC3D,CAAC;AAED,0FAA0F;AAC1F,SAAS,SAAS,CAAC,GAAuB,EAAE,MAAc,EAAE,MAAe;IACzE,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7B,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC9B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACpF,MAAM,IAAI,eAAe,CAAC,qDAAqD,CAAC,CAAC;IACnF,CAAC;IACD,MAAM,QAAQ,GAAG;QACf,MAAM;QACN,IAAI;QACJ,GAAG;QACH,OAAO,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAC1B,WAAW,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAC9B,cAAc,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;KAClC,CAAC;IACF,IACE,CAAC,WAAW,CAAC,QAAQ,CAAC;QACtB,CAAC,MAAM,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,EACpE,CAAC;QACD,MAAM,IAAI,eAAe,CAAC,8DAA8D,CAAC,CAAC;IAC5F,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CACpC,IAAU,EACV,GAAY,EACZ,SAAkB;IAElB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7E,MAAM,IAAI,eAAe,CAAC,kDAAkD,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAChD,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5C,MAAM,IAAI,eAAe,CAAC,qDAAqD,CAAC,CAAC;QACnF,CAAC;QACD,MAAM,MAAM,GAAuB,GAAG,CAAC;QACvC,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;QACjC,IACE,OAAO,KAAK,KAAK,QAAQ;YACzB,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC;YACxB,KAAK,GAAG,CAAC;YACT,KAAK,IAAI,KAAK;YACd,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;YACnB,CAAC,CAAC,GAAG,KAAK,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;YAClC,CAAC,CAAC,GAAG,KAAK,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;YAClC,CAAC,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,CAAC,EAC9B,CAAC;YACD,MAAM,IAAI,eAAe,CAAC,6DAA6D,CAAC,CAAC;QAC3F,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE;YAClB,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC;YACpC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC;SACrC,CAAC,CAAC;IACL,CAAC;IACD,MAAM,YAAY,GAAG,IAAI,OAAO,EAA2B,CAAC;IAC5D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,UAAU,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QACxB,IAAI,KAAK,IAAI,KAAK;YAAE,MAAM,IAAI,eAAe,CAAC,0CAA0C,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACrC,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACrC,+EAA+E;QAC/E,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,KAAK,IAAI,CAAC,CAAC;QACzD,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,QAAQ,KAAK,IAAI,CAAC,CAAC;QAC7D,MAAM,KAAK,GAAG,QAAQ,IAAI,QAAQ,CAAC;QACnC,YAAY,CAAC,GAAG,CACd,IAAI,EACJ,KAAK,KAAK,IAAI;YACZ,CAAC,CAAC,EAAE,KAAK,EAAE;YACX,CAAC,CAAC;gBACE,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;aAC/E,CACN,CAAC;QACF,KAAK,EAAE,CAAC;IACV,CAAC,CAAC,CAAC;IACH,IAAI,KAAK,KAAK,KAAK;QACjB,MAAM,IAAI,eAAe,CAAC,kDAAkD,CAAC,CAAC;IAChF,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,GAAG,CAAC,IAAU;YACZ,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAI,WAAW,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YAChD,IAAI,OAAO,IAAI,WAAW;gBAAE,MAAM,IAAI,UAAU,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;YAC/E,OAAO,WAAW,CAAC,SAAS,CAAC;QAC/B,CAAC;KACF,CAAC,CAAC;AACL,CAAC"}
+{"version":3,"file":"syntax-snapshot.js","sourceRoot":"","sources":["../src/syntax-snapshot.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,+BAA+B,CAAC;AAEjF,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAkDrE;;;GAGG;AACH,SAAS,cAAc,CAAC,KAA8B;IACpD,OAAO,CACL,CAAC,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/E,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU;YACxB,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ;YAC9B,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAC/C,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,IAAU,EAAE,OAA6B;IAC3D,MAAM,KAAK,GAAG,CAAC,KAAc,EAAQ,EAAE;QACrC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO;QAC/D,IAAI,cAAc,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC;YAAE,OAAO;QACtD,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;;gBAC1C,KAAK,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC,CAAC;IACF,KAAK,CAAC,IAAI,CAAC,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,YAAY,GAAG,IAAI,GAAG,EAA6B,CAAC;AAE1D,iFAAiF;AACjF,SAAS,WAAW,CAAC,IAAY;IAC/B,IAAI,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;aAC/C,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,CAAC;aAC5E,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACzB,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8FAA8F;AAC9F,SAAS,SAAS,CAAC,KAAe;IAChC,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;AAC3D,CAAC;AAED,0FAA0F;AAC1F,SAAS,SAAS,CAAC,GAAuB,EAAE,MAAc,EAAE,MAAe;IACzE,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7B,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC9B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACpF,MAAM,IAAI,eAAe,CAAC,qDAAqD,CAAC,CAAC;IACnF,CAAC;IACD,MAAM,QAAQ,GAAG;QACf,MAAM;QACN,IAAI;QACJ,GAAG;QACH,OAAO,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAC1B,WAAW,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAC9B,cAAc,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;KAClC,CAAC;IACF,IACE,CAAC,WAAW,CAAC,QAAQ,CAAC;QACtB,CAAC,MAAM,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,EACpE,CAAC;QACD,MAAM,IAAI,eAAe,CAAC,8DAA8D,CAAC,CAAC;IAC5F,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CACpC,IAAU,EACV,GAAY,EACZ,SAAkB;IAElB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7E,MAAM,IAAI,eAAe,CAAC,kDAAkD,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAChD,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5C,MAAM,IAAI,eAAe,CAAC,qDAAqD,CAAC,CAAC;QACnF,CAAC;QACD,MAAM,MAAM,GAAuB,GAAG,CAAC;QACvC,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;QACjC,IACE,OAAO,KAAK,KAAK,QAAQ;YACzB,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC;YACxB,KAAK,GAAG,CAAC;YACT,KAAK,IAAI,KAAK;YACd,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;YACnB,CAAC,CAAC,GAAG,KAAK,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;YAClC,CAAC,CAAC,GAAG,KAAK,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;YAClC,CAAC,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,CAAC,EAC9B,CAAC;YACD,MAAM,IAAI,eAAe,CAAC,6DAA6D,CAAC,CAAC;QAC3F,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE;YAClB,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC;YACpC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC;SACrC,CAAC,CAAC;IACL,CAAC;IACD,MAAM,YAAY,GAAG,IAAI,OAAO,EAA2B,CAAC;IAC5D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,UAAU,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;QACxB,IAAI,KAAK,IAAI,KAAK;YAAE,MAAM,IAAI,eAAe,CAAC,0CAA0C,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACrC,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACrC,+EAA+E;QAC/E,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,KAAK,IAAI,CAAC,CAAC;QACzD,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,EAAE,QAAQ,KAAK,IAAI,CAAC,CAAC;QAC7D,MAAM,KAAK,GAAG,QAAQ,IAAI,QAAQ,CAAC;QACnC,YAAY,CAAC,GAAG,CACd,IAAI,EACJ,KAAK,KAAK,IAAI;YACZ,CAAC,CAAC,EAAE,KAAK,EAAE;YACX,CAAC,CAAC;gBACE,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;aAC/E,CACN,CAAC;QACF,KAAK,EAAE,CAAC;IACV,CAAC,CAAC,CAAC;IACH,IAAI,KAAK,KAAK,KAAK;QACjB,MAAM,IAAI,eAAe,CAAC,kDAAkD,CAAC,CAAC;IAChF,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,GAAG,CAAC,IAAU;YACZ,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAI,WAAW,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YAChD,IAAI,OAAO,IAAI,WAAW;gBAAE,MAAM,IAAI,UAAU,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;YAC/E,OAAO,WAAW,CAAC,SAAS,CAAC;QAC/B,CAAC;KACF,CAAC,CAAC;AACL,CAAC"}

package/dist/syntax-wire.d.ts

@@ -30,4 +30,16 @@ export declare function isSyntaxPos(value: unknown): value is SyntaxPos;
 export declare function isSyntaxNode(value: unknown): value is Node;
 /** The public parser's root is the precise upstream File representation. @internal */
 export declare function isSyntaxFile(value: unknown): value is File;
+/**
+ * Validates a parse response's File exactly as isSyntaxFile does while rebuilding
+ * its positions. The bridge spells each File position as a compact
+ * [Offset, Line, Col, Flags] tuple (flags: bit 0 IsValid, bit 1 IsRecovered,
+ * bit 2 OffsetOverflow) because positions are most of a parse response. Each
+ * tuple is replaced in place by the identical six-member SyntaxPos record, in
+ * its usual member order, and then checked like any other position. Only a
+ * freshly decoded response may be passed: the graph is mutated, and a false
+ * result can leave it partly restored, so callers must discard it.
+ * @internal
+ */
+export declare function restoreSyntaxFile(value: unknown): value is File;
 //# sourceMappingURL=syntax-wire.d.ts.map

package/dist/syntax-wire.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"syntax-wire.d.ts","sourceRoot":"","sources":["../src/syntax-wire.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AAEpF,kFAAkF;AAClF,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAEzE;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CASvD;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAgCjD;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAyChD;AAED,kFAAkF;AAClF,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,QAAQ,CAE5D;AAED,6FAA6F;AAC7F,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,SAAS,CAwB9D;AA4ED,sGAAsG;AACtG,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,IAAI,CAS1D;AAED,sFAAsF;AACtF,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,IAAI,CAE1D"}
+{"version":3,"file":"syntax-wire.d.ts","sourceRoot":"","sources":["../src/syntax-wire.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AAEpF,kFAAkF;AAClF,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAEzE;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CASvD;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAgCjD;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CA0ChD;AAsCD,kFAAkF;AAClF,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,QAAQ,CAE5D;AAED,6FAA6F;AAC7F,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,SAAS,CAwB9D;AA+GD,sGAAsG;AACtG,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,IAAI,CAS1D;AAED,sFAAsF;AACtF,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,IAAI,CAE1D;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,IAAI,CAE/D"}

package/dist/syntax-wire.js

@@ -80,6 +80,8 @@ export function decodeWire(text) {
     catch (cause) {
         throw new ShInternalError(`Invalid syntax bridge JSON: ${String(cause)}`);
     }
+    if (!mayContainBytesTag(text))
+        return parsed;
     const visit = (item) => {
         if (Array.isArray(item)) {
             for (let index = 0; index < item.length; index++) {
@@ -117,6 +119,39 @@ export function decodeWire(text) {
     };
     return visit(parsed);
 }
+/**
+ * Reports whether bridge JSON can contain a Bytes member. The Go producer spells
+ * every ASCII key literally (encoding/json escapes only quotes, backslashes,
+ * controls, HTML metacharacters and line separators), so a Bytes key always
+ * appears as the exact characters `"Bytes"`. Their absence therefore proves no
+ * record needs byte restoration. Their presence, including an ordinary string
+ * value spelled Bytes, only selects the complete restoration walk.
+ */
+function mayContainBytesTag(text) {
+    return text.includes('"Bytes"');
+}
+/** Decodes one compact position tuple, or returns undefined when it is malformed. */
+function positionFromTuple(tuple) {
+    if (tuple.length !== 4)
+        return undefined;
+    const [Offset, Line, Col, flags] = tuple;
+    if (typeof Offset !== 'number' ||
+        typeof Line !== 'number' ||
+        typeof Col !== 'number' ||
+        typeof flags !== 'number' ||
+        !Number.isInteger(flags) ||
+        flags < 0 ||
+        flags > 7)
+        return undefined;
+    return {
+        Offset,
+        Line,
+        Col,
+        IsValid: (flags & 1) !== 0,
+        IsRecovered: (flags & 2) !== 0,
+        OffsetOverflow: (flags & 4) !== 0,
+    };
+}
 /** A Go string is text only when every original byte is valid UTF-8. @internal */
 export function isGoString(value) {
     return typeof value === 'string' || value instanceof Uint8Array;
@@ -161,34 +196,67 @@ function isTypedNil(value, implementers) {
  * Validates complete records against the pinned schema, including nil-bearing
  * boundaries. This is a boundary check, not a semantic shell interpretation.
  */
-function matchesRecord(value, active) {
-    if (!isRecord(value) || typeof value.Type !== 'string' || active.has(value))
+function matchesRecord(value, check) {
+    if (!isRecord(value) || typeof value.Type !== 'string' || check.active?.has(value))
         return false;
     if (!Object.hasOwn(SYNTAX_SCHEMA, value.Type))
         return false;
-    const descriptor = SYNTAX_SCHEMA[value.Type];
-    if (Object.keys(value).length !== Object.keys(descriptor.fields).length + 1)
+    const fields = fieldEntries(value.Type);
+    if (Object.keys(value).length !== fields.length + 1)
         return false;
-    active.add(value);
+    check.active?.add(value);
     try {
-        return Object.entries(descriptor.fields).every(([name, field]) => Object.hasOwn(value, name) && matchesField(value[name], field, active));
+        for (const [name, field] of fields) {
+            if (!Object.hasOwn(value, name))
+                return false;
+            let child = value[name];
+            if (check.restore && field.kind === 'position' && Array.isArray(child)) {
+                const position = positionFromTuple(child);
+                if (position === undefined)
+                    return false;
+                value[name] = child = position;
+            }
+            if (!matchesField(child, field, check))
+                return false;
+        }
+        return true;
     }
     finally {
-        active.delete(value);
+        check.active?.delete(value);
+    }
+}
+/**
+ * Field descriptors in schema order for each record type. The generated schema
+ * is immutable, so listing its entries once per type avoids rebuilding the same
+ * arrays for every record a large File contains.
+ */
+const FIELD_ENTRIES = new Map();
+/** Returns the cached field list for a type already known to be in the schema. */
+function fieldEntries(type) {
+    let entries = FIELD_ENTRIES.get(type);
+    if (entries === undefined) {
+        entries = Object.entries(SYNTAX_SCHEMA[type].fields);
+        FIELD_ENTRIES.set(type, entries);
     }
+    return entries;
 }
 /** Checks one upstream field without conflating a nil slice with an empty one. */
-function matchesField(value, field, active) {
+function matchesField(value, field, check) {
     if (value === null)
         return field.nullable;
     if (field.slice) {
-        return (Array.isArray(value) &&
-            value.every((item) => item === null ? field.elementNullable : matchesScalar(item, field, active)));
+        if (!Array.isArray(value))
+            return false;
+        for (const item of value) {
+            if (item === null ? !field.elementNullable : !matchesScalar(item, field, check))
+                return false;
+        }
+        return true;
     }
-    return matchesScalar(value, field, active);
+    return matchesScalar(value, field, check);
 }
 /** Each scalar category retains its upstream domain rather than JS coercions. */
-function matchesScalar(value, field, active) {
+function matchesScalar(value, field, check) {
     switch (field.kind) {
         case 'boolean':
             return typeof value === 'boolean';
@@ -199,14 +267,14 @@ function matchesScalar(value, field, active) {
         case 'operator':
             return (typeof value === 'number' && Number.isInteger(value) && value >= 0 && value <= 0xffff_ffff);
         case 'struct':
-            return isRecord(value) && value.Type === field.type && matchesRecord(value, active);
+            return isRecord(value) && value.Type === field.type && matchesRecord(value, check);
         case 'interface':
             return (isRecord(value) &&
                 typeof value.Type === 'string' &&
                 field.type !== null &&
                 Object.hasOwn(SYNTAX_INTERFACES, field.type) &&
                 (isTypedNil(value, SYNTAX_INTERFACES[field.type]) ||
-                    (SYNTAX_INTERFACES[field.type].includes(value.Type) && matchesRecord(value, active))));
+                    (SYNTAX_INTERFACES[field.type].includes(value.Type) && matchesRecord(value, check))));
     }
 }
 /** Narrows complete syntax.Nodes or typed nil Node interfaces; auxiliaries are excluded. @internal */
@@ -217,10 +285,26 @@ export function isSyntaxNode(value) {
         typeof value.Type === 'string' &&
         Object.hasOwn(SYNTAX_SCHEMA, value.Type) &&
         SYNTAX_SCHEMA[value.Type].node &&
-        matchesRecord(value, new Set()));
+        matchesRecord(value, { active: new Set(), restore: false }));
 }
 /** The public parser's root is the precise upstream File representation. @internal */
 export function isSyntaxFile(value) {
     return isSyntaxNode(value) && value.Type === 'File';
 }
+/**
+ * Validates a parse response's File exactly as isSyntaxFile does while rebuilding
+ * its positions. The bridge spells each File position as a compact
+ * [Offset, Line, Col, Flags] tuple (flags: bit 0 IsValid, bit 1 IsRecovered,
+ * bit 2 OffsetOverflow) because positions are most of a parse response. Each
+ * tuple is replaced in place by the identical six-member SyntaxPos record, in
+ * its usual member order, and then checked like any other position. Only a
+ * freshly decoded response may be passed: the graph is mutated, and a false
+ * result can leave it partly restored, so callers must discard it.
+ * @internal
+ */
+export function restoreSyntaxFile(value) {
+    return isRecord(value) && value.Type === 'File' && matchesRecord(value, RESTORING);
+}
+/** Restoring validation state; it carries no per-call data and is shared. */
+const RESTORING = { active: null, restore: true };
 //# sourceMappingURL=syntax-wire.js.map