parseman 0.7.1 → 0.9.0

package/dist/combinators/expect.d.ts

@@ -0,0 +1,36 @@
+import type { Combinator, ParseError } from '../types.ts';
+export type { ParseError };
+/**
+ * Statically derive the "expected" token set from a combinator's structure,
+ * so a failure can name what it wanted without running anything:
+ *
+ *   literal('}')        -> ['"}"']
+ *   keywords(['a','b']) -> ['"a"', '"b"']
+ *   choice(x, y)        -> expected(x) ++ expected(y)   (all alternatives)
+ *   sequence(a, b, …)   -> expected(a)                  (only the first term can fail first)
+ *   label('s', x)       -> ['s']                        (an explicit name wins)
+ *
+ * This is what lets expect() report a meaningful, IDENTICAL expectation in both
+ * the interpreter and the compiled output (the compiled path does not rebuild the
+ * runtime `expected` array, so it reads this precomputed set instead).
+ */
+export declare function staticExpected(c: Combinator<unknown>): string[];
+/**
+ * Required-token combinator. Tries `combinator`; on success returns it verbatim.
+ * On failure it does NOT fail — it records a {@link ParseError} (the statically
+ * derived expected set, or `label` when given) into `ctx._errors` and RECOVERS IN
+ * PLACE, returning a zero-width success so the enclosing sequence continues as if
+ * the token were present.
+ *
+ * Use it to mark required delimiters/terminators (`}` `)` `;`, a selector before a
+ * block) so a missing one is reported with position + expectation rather than
+ * aborting the whole parse or being silently swallowed by a catch-all.
+ *
+ *   sequence(literal('{'), declList, expect(literal('}'), '}'))
+ *
+ * Errors are only collected when the parse runs with `{ recover: true }`; without
+ * it, expect() still recovers in place but records nothing (zero overhead beyond
+ * the inner attempt).
+ */
+export declare function expect<T>(combinator: Combinator<T>, label?: string): Combinator<T | ParseError>;
+//# sourceMappingURL=expect.d.ts.map

package/dist/combinators/expect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expect.d.ts","sourceRoot":"","sources":["../../src/combinators/expect.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAyC,UAAU,EAAE,MAAM,aAAa,CAAA;AAEhG,YAAY,EAAE,UAAU,EAAE,CAAA;AAE1B;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,MAAM,EAAE,CAoB/D;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAmB/F"}

package/dist/combinators/grammar.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"grammar.d.ts","sourceRoot":"","sources":["../../src/combinators/grammar.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAGxE,MAAM,MAAM,YAAY,GAAG;IACzB,UAAU,CAAC,EAAE,OAAO,CAAA;IACpB;;;;;;OAMG;IACH,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,aAAa,GAAG,YAAY,GAAG;IACzC;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,IAAI,CAAA;IACnC,gFAAgF;IAChF,aAAa,CAAC,EAAE,OAAO,CAAA;CACxB,CAAA;AAED,MAAM,WAAW,cAAc,CAAC,CAAC,CAAE,SAAQ,UAAU,CAAC,CAAC,CAAC;IACtD,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IACpC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;CACrE;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAwCrF;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAElE;AAED,wBAAgB,KAAK,CAAC,CAAC,EACrB,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,EACzB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,YAAiB,GACtB,WAAW,CAAC,CAAC,CAAC,CAehB"}
+{"version":3,"file":"grammar.d.ts","sourceRoot":"","sources":["../../src/combinators/grammar.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,WAAW,EAAa,MAAM,aAAa,CAAA;AAGnF,MAAM,MAAM,YAAY,GAAG;IACzB,UAAU,CAAC,EAAE,OAAO,CAAA;IACpB;;;;;;OAMG;IACH,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,aAAa,GAAG,YAAY,GAAG;IACzC;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,IAAI,CAAA;IACnC,gFAAgF;IAChF,aAAa,CAAC,EAAE,OAAO,CAAA;CACxB,CAAA;AAED,MAAM,WAAW,cAAc,CAAC,CAAC,CAAE,SAAQ,UAAU,CAAC,CAAC,CAAC;IACtD,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IACpC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;CACrE;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAwCrF;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAElE;AAED,wBAAgB,KAAK,CAAC,CAAC,EACrB,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,EACzB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,YAAiB,GACtB,WAAW,CAAC,CAAC,CAAC,CAuBhB"}

package/dist/combinators/scanTo.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"scanTo.d.ts","sourceRoot":"","sources":["../../src/combinators/scanTo.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAyC,MAAM,aAAa,CAAA;AAQpF,MAAM,MAAM,aAAa,GAAG;IAC1B,uGAAuG;IACvG,IAAI,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,CAAA;IAC5B;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;CAChB,CAAA;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,CACpB,QAAQ,EAAE,UAAU,CAAC,OAAO,CAAC,EAC7B,EAAE,IAAS,EAAE,KAAa,EAAE,GAAE,aAAkB,GAC/C,UAAU,CAAC,MAAM,CAAC,CA8DpB;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CACtB,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,aAAkB,GAC1B,UAAU,CAAC,MAAM,CAAC,CAqBpB"}
+{"version":3,"file":"scanTo.d.ts","sourceRoot":"","sources":["../../src/combinators/scanTo.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAyC,MAAM,aAAa,CAAA;AAYpF,MAAM,MAAM,aAAa,GAAG;IAC1B,uGAAuG;IACvG,IAAI,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,CAAA;IAC5B;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;CAChB,CAAA;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,CACpB,QAAQ,EAAE,UAAU,CAAC,OAAO,CAAC,EAC7B,EAAE,IAAS,EAAE,KAAa,EAAE,GAAE,aAAkB,GAC/C,UAAU,CAAC,MAAM,CAAC,CAoEpB;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CACtB,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,aAAkB,GAC1B,UAAU,CAAC,MAAM,CAAC,CA0CpB"}

package/dist/compiler/codegen.d.ts

@@ -40,4 +40,37 @@ export type CompiledParser<T> = {
  * @see https://www.greadme.com/blog/security/what-is-content-security-policy-complete-guide
  */
 export declare function compile<T>(combinator: Combinator<T>, mapFnSources?: string[]): CompiledParser<T>;
+/**
+ * Compile every entry of a `rules(factory)` map's returned object using ONE
+ * shared codegen Ctx (regexes, named functions, map/build-fn arrays) instead
+ * of running `compile()` independently per entry.
+ *
+ * Why this exists: `compile()` per entry gives each entry its own namedParsers
+ * cache, so a sub-rule reachable from N different top-level entries (e.g.
+ * `valueList` reachable from `Declaration`, `CustomDeclaration`, `Guard`, …)
+ * gets fully re-compiled N times — on a richly cross-referential grammar
+ * (Less: ~125 rule-map entries, deep mutual reference) this multiplies total
+ * compiled size far past what the source grammar actually needs, independent
+ * of the per-ref single-use inlining `analyzeLazyUsage` already handles
+ * within one compile() call. Sharing one Ctx here means a sub-rule compiles
+ * exactly once for the WHOLE rule map, however many entries reach it.
+ *
+ * Returns a single `replacement` — ONE shared IIFE, evaluated once, whose
+ * result is the `{ key: fn, ... }` map — meant to replace the entire
+ * `rules(factory)` call-expression (not one expression per key; splicing a
+ * separate self-contained expression per key would either re-run the shared
+ * prelude once per entry or duplicate its text per entry, undoing the win).
+ * `keys` lists every entry compileRuleMap() saw, for the caller to validate
+ * against the source's own key list.
+ *
+ * Returns null (same all-or-nothing contract the per-entry `compile()` +
+ * `inlineExpression === null` check gave the plugin before) when the map
+ * contains anything that can't be inlined — a runtime-fallback parser, or an
+ * uncaptured transform/build closure source. The plugin's existing "warn and
+ * leave this rules() call interpreted" fallback covers this case unchanged.
+ */
+export declare function compileRuleMap(ruleMap: ReadonlyArray<readonly [string, Combinator<unknown>]>): {
+    keys: string[];
+    replacement: string;
+} | null;
 //# sourceMappingURL=codegen.d.ts.map

package/dist/compiler/codegen.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"codegen.d.ts","sourceRoot":"","sources":["../../src/compiler/codegen.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,KAAK,EAAE,UAAU,EAAuB,WAAW,EAAE,YAAY,EAAE,UAAU,EAAkB,MAAM,aAAa,CAAA;AAm1CzH,MAAM,MAAM,cAAc,CAAC,CAAC,IAAI;IAC9B,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IAClD,kGAAkG;IAClG,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IAChF;;;;OAIG;IACH,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG;QAAE,MAAM,EAAE,UAAU,EAAE,CAAA;KAAE,CAAA;IACvF,iEAAiE;IACjE,MAAM,EAAE,MAAM,CAAA;IACd;;;;;;OAMG;IACH,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAA;CAChC,CAAA;AAiCD;;;;;;;;GAQG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAgGhG"}
+{"version":3,"file":"codegen.d.ts","sourceRoot":"","sources":["../../src/compiler/codegen.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,KAAK,EAAE,UAAU,EAAuB,WAAW,EAAE,YAAY,EAAE,UAAU,EAAkB,MAAM,aAAa,CAAA;AAoiDzH,MAAM,MAAM,cAAc,CAAC,CAAC,IAAI;IAC9B,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IAClD,kGAAkG;IAClG,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IAChF;;;;OAIG;IACH,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,GAAG;QAAE,MAAM,EAAE,UAAU,EAAE,CAAA;KAAE,CAAA;IACvF,iEAAiE;IACjE,MAAM,EAAE,MAAM,CAAA;IACd;;;;;;OAMG;IACH,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAA;CAChC,CAAA;AAoJD;;;;;;;;GAQG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAsGhG;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAC7D;IAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAAC,WAAW,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CA4EhD"}

package/dist/compiler/scannable-run.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Structural recognition of "scannable" parser arms — regex shapes that lower to
+ * a tight character-scan loop instead of `regex.exec` / combinator dispatch. Each
+ * shape is derived from the regex STRUCTURE, not from any hardcoded knowledge
+ * that a given regex "is whitespace" or "is a comment":
+ *
+ *   [X]+ / [X]*            → run while the char ∈ X                (chars)
+ *   <lit>[^X]*             → consume <lit>, run until char ∈ X     (until)
+ *   <open>(?:…)*<close>    → consume <open>, run to <close> literal (delimited)
+ *
+ * A `oneOrMore(choice(a, b, …))` where every arm is one of these compiles to a
+ * single char-dispatch loop with one branch per arm — any count/order, because
+ * the shapes dispatch on their first 1–2 chars and are checked in turn. Trivia
+ * (whitespace + comments) is just the value-discarded instance of this; nothing
+ * here is trivia-specific.
+ */
+export type ScanShape = {
+    kind: 'chars';
+    ranges: Array<[number, number]>;
+} | {
+    kind: 'until';
+    open: number[];
+    stop: Array<[number, number]>;
+} | {
+    kind: 'delimited';
+    open: number[];
+    close: number[];
+};
+/**
+ * Recognize one scannable arm from its regex source, or null if it isn't one of
+ * the three structural shapes. Order matters: char-class run, then
+ * open-until-terminator, then delimited.
+ */
+export declare function parseScanShape(source: string): ScanShape | null;
+/**
+ * One loop branch for a shape, dispatched on the current char `c` (= charCodeAt(_e)).
+ * Each branch advances `_e` past the matched token and `continue`s the scan loop.
+ */
+export declare function scanBranch(shape: ScanShape): string;
+/**
+ * A labeled branch: consume the shape's full token and log one [start, end,
+ * kindIndex] trivia chunk. Unlike scanBranch this always consumes the whole run
+ * (a chunk must span the entire token) and captures inline per-chunk.
+ */
+export declare function scanBranchLabeled(shape: ScanShape, kindIndex: number): string;
+//# sourceMappingURL=scannable-run.d.ts.map

package/dist/compiler/scannable-run.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scannable-run.d.ts","sourceRoot":"","sources":["../../src/compiler/scannable-run.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,MAAM,MAAM,SAAS,GACjB;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,EAAE,CAAC;IAAC,IAAI,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CAAE,GAChE;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,IAAI,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,MAAM,EAAE,CAAA;CAAE,CAAA;AAwD1D;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CA4B/D;AAuDD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,CAQnD;AAYD;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAM7E"}

package/dist/compiler/trivia-fast-path.d.ts

@@ -1,23 +1,36 @@
 import type { Combinator } from '../types.ts';
 import type { LabeledTriviaSpec } from '../cst/trivia-kinds.ts';
-export type TriviaFastKind = 'wsComments' | 'wsOnly';
+import { type ScanShape } from './scannable-run.ts';
 /**
- * Detect trivia shapes safe to lower to a hand-rolled scan loop in compiled output.
- * Matches CSS `rw` (`oneOrMore(choice(ws, blockComment))`) and ASCII ws-only grammars.
- * Single alternation regexes are excluded — one regex exec matches only one arm per call.
+ * A trivia parser that lowers to a hand-rolled char-scan loop: `oneOrMore(choice(
+ * …))` (or `many`, min≥1) where EVERY arm is a scannable shape (a `[X]+` run, a
+ * `<lit>[^X]*` open-until-terminator, or a `<open>(?:…)*<close>` delimited token
+ * — see scannable-run.ts). Returns the per-arm shapes, or a single-element list
+ * for a bare scannable regex, or null (→ caller falls back to the regex/generic
+ * trivia path). A single alternation regex is NOT scannable (one exec matches one
+ * arm per call, defeating the loop).
  */
-export declare function analyzeTriviaFastPath(trivia: Combinator<unknown>): TriviaFastKind | null;
-/** Emit a specialized `_tfN` that skips trivia without regex / combinator dispatch. */
-export declare function buildFastTriviaFnDecl(fnName: string, kind: TriviaFastKind, kindIndices?: {
-    ws: number;
-    comment: number;
-}): string;
+export declare function analyzeTriviaFastPath(trivia: Combinator<unknown>): ScanShape[] | null;
+/** Emit a specialized `_tfN` that skips (unlabeled) trivia via a char-scan loop. */
+export declare function buildFastTriviaFnDecl(fnName: string, shapes: ScanShape[]): string;
+/**
+ * A LABELED trivia parser whose every arm is scannable → per-arm shape + kind
+ * index, or null. Same recognition as analyzeTriviaFastPath, but keyed by the
+ * labeled arm kinds so the fast loop can log each chunk's kind. Generalizes what
+ * used to be a hardcoded ws-run + block-comment special case to any scannable
+ * shape set / arm count.
+ */
+export declare function analyzeLabeledScannableRun(trivia: Combinator<unknown>): Array<{
+    shape: ScanShape;
+    kindIndex: number;
+}> | null;
+/** Emit a labeled scannable trivia `_tfN`: char-scan loop with per-chunk kind capture. */
+export declare function buildLabeledScannableTriviaFnDecl(fnName: string, arms: ReadonlyArray<{
+    shape: ScanShape;
+    kindIndex: number;
+}>): string;
 /** Labeled trivia with regex arms — per-chunk kind capture in compiled output. */
 export declare function buildLabeledRegexTriviaFnDecl(fnName: string, spec: LabeledTriviaSpec, reNames: string[]): string;
-export declare function labeledTriviaKindIndices(trivia: Combinator<unknown>): {
-    ws: number;
-    comment: number;
-} | null;
 export declare function labeledTriviaRegexArms(trivia: Combinator<unknown>): LabeledTriviaSpec | null;
 /** Labeled trivia via per-arm runtime parsers (non-regex or mixed arms). */
 export declare function buildLabeledRuntimeTriviaFnDecl(fnName: string, spec: LabeledTriviaSpec, rpStartIndex: number): string;

package/dist/compiler/trivia-fast-path.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"trivia-fast-path.d.ts","sourceRoot":"","sources":["../../src/compiler/trivia-fast-path.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAE7C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAA;AAG/D,MAAM,MAAM,cAAc,GAAG,YAAY,GAAG,QAAQ,CAAA;AAsCpD;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,cAAc,GAAG,IAAI,CA6BxF;AAmED,uFAAuF;AACvF,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,cAAc,EACpB,WAAW,CAAC,EAAE;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GAC5C,MAAM,CAeR;AAYD,kFAAkF;AAClF,wBAAgB,6BAA6B,CAC3C,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,iBAAiB,EACvB,OAAO,EAAE,MAAM,EAAE,GAChB,MAAM,CA+BR;AAED,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAO5G;AAED,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,iBAAiB,GAAG,IAAI,CAO5F;AAED,4EAA4E;AAC5E,wBAAgB,+BAA+B,CAC7C,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,iBAAiB,EACvB,YAAY,EAAE,MAAM,GACnB,MAAM,CA8BR"}
+{"version":3,"file":"trivia-fast-path.d.ts","sourceRoot":"","sources":["../../src/compiler/trivia-fast-path.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAE7C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAA;AAE/D,OAAO,EAAE,KAAK,SAAS,EAAiD,MAAM,oBAAoB,CAAA;AA0BlG;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,SAAS,EAAE,GAAG,IAAI,CAyBrF;AAoBD,oFAAoF;AACpF,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,CASjF;AAED;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CACxC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAC1B,KAAK,CAAC;IAAE,KAAK,EAAE,SAAS,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,IAAI,CAWvD;AAED,0FAA0F;AAC1F,wBAAgB,iCAAiC,CAC/C,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,aAAa,CAAC;IAAE,KAAK,EAAE,SAAS,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC,GAC3D,MAAM,CAYR;AAED,kFAAkF;AAClF,wBAAgB,6BAA6B,CAC3C,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,iBAAiB,EACvB,OAAO,EAAE,MAAM,EAAE,GAChB,MAAM,CA+BR;AAED,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,iBAAiB,GAAG,IAAI,CAO5F;AAED,4EAA4E;AAC5E,wBAAgB,+BAA+B,CAC7C,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,iBAAiB,EACvB,YAAY,EAAE,MAAM,GACnB,MAAM,CA8BR"}