parseman 0.4.0 → 0.6.0

package/dist/cst/trivia-index.d.ts

@@ -5,13 +5,14 @@ export type TriviaToken = {
     readonly span: Span;
 };
 /**
- * Before/after offset index of captured trivia. Built from a tree's rawChildren
- * (trivia is only present there when the grammar enables `_captureTrivia`).
+ * Before/after offset index of captured trivia. Built from a tree whose nodes
+ * carry a `triviaLog` property (the flat `[start, end, insertIdx, ...]` array
+ * produced by parseman when `parser({ captureTrivia: true })` wraps a `node()` grammar).
  *
  *   index.before.get(node.span.start)  // trivia immediately before a node
  *   index.after.get(node.span.end)     // trivia immediately after a node
  *
- * A given trivia run is registered under BOTH the following item's start
+ * A given trivia entry is registered under BOTH the following item's start
  * (`before`) and the preceding item's end (`after`), so either lookup finds it.
  */
 export type TriviaIndex = {
@@ -22,12 +23,10 @@ export type TriviaIndex = {
  * Options for trailing/leading trivia at the document boundary. A repeating root
  * (e.g. `many()`) rolls back the trivia after its last item — it's "trailing" and
  * belongs to the enclosing context, which at the document root is the document
- * itself. Pass `{ input, trivia }` to re-scan and register that boundary trivia,
+ * itself. Pass `{ trivia }` to re-scan and register that boundary trivia,
  * so a round-trippable trivia map isn't missing the run before EOF.
  */
 export type TriviaIndexOptions = {
-    /** The full source string. */
-    input: string;
     /**
      * A regex matching ONE trivia token (a whitespace run or a comment). Applied
      * repeatedly to tokenize the boundary trivia. Each match becomes one token, so
@@ -37,14 +36,15 @@ export type TriviaIndexOptions = {
     trivia: RegExp;
 };
 /**
- * Walk a CST/AST node tree (anything exposing `children` whose items carry
- * `_tag`/`span`, with trivia items tagged `'trivia'`) and build a before/after
- * trivia index. Generic over the node type — formatters, LSPs, and codemods all
- * need this, and Parseman already owns trivia capture.
+ * Walk a tree whose nodes carry `triviaLog` (from `node()` + `captureTrivia`)
+ * and build a before/after trivia index. Each node must have
+ * `triviaLog: readonly number[]` (flat `[start, end, insertIdx, …]` —
+ * three numbers per entry) and `rawChildren` (structural items with `.span`).
+ * `input` is the source string used to materialize trivia values.
  *
  * With `opts`, also captures leading trivia (before the root's content) and
  * trailing trivia (after it, up to EOF) — the document boundaries a repeating
  * root rolls back.
  */
-export declare function buildTriviaIndex(root: unknown, opts?: TriviaIndexOptions): TriviaIndex;
+export declare function buildTriviaIndex(root: unknown, input?: string, opts?: TriviaIndexOptions): TriviaIndex;
 //# sourceMappingURL=trivia-index.d.ts.map

package/dist/cst/trivia-index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"trivia-index.d.ts","sourceRoot":"","sources":["../../src/cst/trivia-index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAEvC,sFAAsF;AACtF,MAAM,MAAM,WAAW,GAAG;IAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;CAAE,CAAA;AAEzE;;;;;;;;;GASG;AACH,MAAM,MAAM,WAAW,GAAG;IACxB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAA;IAC3C,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAA;CAC3C,CAAA;AAiBD;;;;;;GAMG;AACH,MAAM,MAAM,kBAAkB,GAAG;IAC/B,8BAA8B;IAC9B,KAAK,EAAE,MAAM,CAAA;IACb;;;;;OAKG;IACH,MAAM,EAAE,MAAM,CAAA;CACf,CAAA;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,kBAAkB,GAAG,WAAW,CAqEtF"}
+{"version":3,"file":"trivia-index.d.ts","sourceRoot":"","sources":["../../src/cst/trivia-index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAEvC,sFAAsF;AACtF,MAAM,MAAM,WAAW,GAAG;IAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;CAAE,CAAA;AAEzE;;;;;;;;;;GAUG;AACH,MAAM,MAAM,WAAW,GAAG;IACxB,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAA;IAC3C,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAA;CAC3C,CAAA;AAiBD;;;;;;GAMG;AACH,MAAM,MAAM,kBAAkB,GAAG;IAC/B;;;;;OAKG;IACH,MAAM,EAAE,MAAM,CAAA;CACf,CAAA;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,SAAK,EAAE,IAAI,CAAC,EAAE,kBAAkB,GAAG,WAAW,CAkElG"}

package/dist/cst/trivia-kinds.d.ts

@@ -0,0 +1,47 @@
+import type { Combinator, ParseContext } from '../types.ts';
+export type TriviaChunk = {
+    start: number;
+    end: number;
+    kindIndex: number;
+};
+export type LabeledTriviaSpec = {
+    readonly labels: readonly string[];
+    readonly arms: ReadonlyArray<{
+        label: string;
+        kindIndex: number;
+        parser: Combinator<unknown>;
+    }>;
+    readonly minRepeats: number;
+};
+/** Strip `label()` wrapper; returns inner parser for matching. */
+export declare function peelLabel(p: Combinator<unknown>): {
+    label: string;
+    parser: Combinator<unknown>;
+} | null;
+/**
+ * When every trivia arm is `label(name, parser)` inside `oneOrMore(choice(…))`
+ * (or a single labeled arm), return the label table and matchers.
+ */
+export declare function analyzeLabeledTrivia(trivia: Combinator<unknown>): LabeledTriviaSpec | null;
+/** Label table on a `trivia()` combinator, if all arms are labeled. */
+export declare function triviaKindLabels(trivia: Combinator<unknown> | undefined): readonly string[] | undefined;
+/**
+ * Scan maximal labeled trivia chunks (PEG `oneOrMore(choice(…))` semantics).
+ * Each successful arm match becomes one entry with that arm's kind index.
+ */
+export declare function scanLabeledTriviaChunks(input: string, cur: number, spec: LabeledTriviaSpec): {
+    end: number;
+    chunks: TriviaChunk[];
+};
+/** Hand-rolled ws / block-comment scan with per-chunk kind indices (interpreter). */
+export declare function scanFastWsCommentsChunks(input: string, cur: number, wsKind: number, commentKind: number): {
+    end: number;
+    chunks: TriviaChunk[];
+};
+/** Fast scan when trivia is labeled ws + block-comment (CSS `rw`). */
+export declare function tryFastLabeledScan(input: string, cur: number, trivia: Combinator<unknown>): {
+    end: number;
+    chunks: TriviaChunk[];
+} | null;
+export declare function recordTriviaChunks(ctx: ParseContext, chunks: readonly TriviaChunk[]): void;
+//# sourceMappingURL=trivia-kinds.d.ts.map

package/dist/cst/trivia-kinds.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"trivia-kinds.d.ts","sourceRoot":"","sources":["../../src/cst/trivia-kinds.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,aAAa,CAAA;AAI3D,MAAM,MAAM,WAAW,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAA;AAE3E,MAAM,MAAM,iBAAiB,GAAG;IAC9B,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;IAClC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;KAAE,CAAC,CAAA;IAC/F,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;CAC5B,CAAA;AAQD,kEAAkE;AAClE,wBAAgB,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAAG,IAAI,CAGvG;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,iBAAiB,GAAG,IAAI,CA2B1F;AAED,uEAAuE;AACvE,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,SAAS,GAAG,SAAS,MAAM,EAAE,GAAG,SAAS,CAKvG;AAYD;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,iBAAiB,GACtB;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,WAAW,EAAE,CAAA;CAAE,CAsBxC;AAED,qFAAqF;AACrF,wBAAgB,wBAAwB,CACtC,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,MAAM,GAClB;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,WAAW,EAAE,CAAA;CAAE,CA6BxC;AAED,sEAAsE;AACtE,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAC1B;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,WAAW,EAAE,CAAA;CAAE,GAAG,IAAI,CAiB/C;AAED,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,WAAW,EAAE,GAAG,IAAI,CAQ1F"}

package/dist/cst/types.d.ts

@@ -1,13 +1,12 @@
 import type { Span } from '../types.ts';
 /**
- * Minimal interface a node must satisfy for IncrementalParser to navigate and
- * re-parse the tree. Satisfying this is all that's required for a custom AST
- * produced by overriding GrammarParser.buildNode().
+ * Minimal interface a node must satisfy for incremental re-parse to navigate and
+ * re-parse the tree. Any object with `_tag: 'node'`, `type`, `span`, `state`,
+ * and `children` works — whether from `node()` build callbacks or custom ASTs.
  *
- * `children` only needs to be iterable with items that have `_tag` so the
- * traversal code can distinguish sub-nodes from leaves. For incremental
- * replacement, `rebuild()` on the Parser calls `buildNode()` rather than
- * object-spreading, so overriding `buildNode` handles class instances correctly.
+ * `children` only needs items with `_tag` so traversal can distinguish sub-nodes
+ * from leaves. `makeFunctionalDoc` uses an optional `rebuild` callback (or a
+ * shallow spread) when grafting a re-parsed subtree.
  */
 export type NodeLike = {
     readonly _tag: 'node';
@@ -19,9 +18,8 @@ export type NodeLike = {
     }>;
 };
 /**
- * A named CST node produced by a capital-letter rule method in GrammarParser.
- * Children are in parse order: CSTNode children from named sub-parser interspersed
- * with CSTLeaf terminals from literal() / regex() calls inside lowercase helpers.
+ * A named CST node from a `node()` rule (or equivalent build callback).
+ * Children are in parse order: sub-nodes interspersed with CSTLeaf terminals.
  */
 export type CSTNode = {
     readonly _tag: 'node';
@@ -37,9 +35,7 @@ export type CSTNode = {
     readonly state: unknown;
 };
 /**
- * A terminal token — the result of a literal() or regex() match inside a CST rule.
- * Lowercase helpers are transparent: their terminals surface as leaves of the
- * nearest enclosing capital-letter rule.
+ * A terminal token — the result of a literal() or regex() match inside a node rule.
  */
 export type CSTLeaf = {
     readonly _tag: 'leaf';

package/dist/cst/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/cst/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAEvC;;;;;;;;;GASG;AACH,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;IACvB,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAC5D,CAAA;AAED;;;;GAIG;AACH,MAAM,MAAM,OAAO,GAAG;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,2DAA2D;IAC3D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAA;IAC7B;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CACxB,CAAA;AAED;;;;GAIG;AACH,MAAM,MAAM,OAAO,GAAG;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;CACpB,CAAA;AAED;;;;GAIG;AACH,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;IAC3B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAA;IAC7B,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CACxB,CAAA;AAED,MAAM,MAAM,QAAQ,GAAG,OAAO,GAAG,OAAO,GAAG,QAAQ,CAAA;AAEnD;;;GAGG;AACH,MAAM,MAAM,SAAS,GAAG;IACtB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;CACpB,CAAA;AAED,wFAAwF;AACxF,MAAM,MAAM,WAAW,GAAG,OAAO,GAAG,OAAO,GAAG,SAAS,GAAG,QAAQ,CAAA"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/cst/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAEvC;;;;;;;;GAQG;AACH,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;IACvB,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAC5D,CAAA;AAED;;;GAGG;AACH,MAAM,MAAM,OAAO,GAAG;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,2DAA2D;IAC3D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAA;IAC7B;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CACxB,CAAA;AAED;;GAEG;AACH,MAAM,MAAM,OAAO,GAAG;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;CACpB,CAAA;AAED;;;;GAIG;AACH,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;IAC3B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAA;IAC7B,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CACxB,CAAA;AAED,MAAM,MAAM,QAAQ,GAAG,OAAO,GAAG,OAAO,GAAG,QAAQ,CAAA;AAEnD;;;GAGG;AACH,MAAM,MAAM,SAAS,GAAG;IACtB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;CACpB,CAAA;AAED,wFAAwF;AACxF,MAAM,MAAM,WAAW,GAAG,OAAO,GAAG,OAAO,GAAG,SAAS,GAAG,QAAQ,CAAA"}

package/dist/functional/doc.d.ts

@@ -1,22 +1,5 @@
 /**
- * Functional incremental document — a class-free counterpart to ParseDoc.
- *
- * The class-based Parser bakes a rule registry (method name → combinator) and
- * a `rebuild()` hook into the grammar object. A *functional* grammar produces
- * the same two ingredients without a class:
- *
- *   - the registry is the object returned by `rules()` (rule name → parser fn),
- *     which the macro compiles to a map of independently-callable functions;
- *   - `rebuild` is supplied by the caller (or defaults to a shallow spread),
- *     since functional nodes are whatever the `transform()` callbacks produced.
- *
- * Given those, incremental re-parsing is identical in spirit to the class path:
- * locate the smallest node containing the edit, re-parse that single rule from
- * its start offset, and graft the result back into the tree if its end lands
- * where the edit's delta predicts.
- *
- * This module has no dependency on the `Parser` class — it is what lets the
- * class be removed once grammars move to the functional shape.
+ * Functional incremental document — incremental re-parse over a rules() registry.
  */
 import type { ParseContext, ParseFail, ParseResult } from '../types.ts';
 import type { NodeLike, CSTLeaf, CSTError } from '../cst/types.ts';
@@ -40,8 +23,7 @@ export interface FunctionalDoc<N extends NodeLike> {
     readonly input: string;
     /**
      * Incrementally re-parse after a text change. `from`/`to` are byte offsets in
-     * the OLD input; `replacement` fills that range. Mirrors editor change events
-     * (see ParseDoc.edit for the mapping).
+     * the OLD input; `replacement` fills that range (editor change-event shape).
      */
     edit(from: number, to: number, replacement: string): FunctionalDoc<N>;
 }

package/dist/functional/doc.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"doc.d.ts","sourceRoot":"","sources":["../../src/functional/doc.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AACvE,OAAO,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAA;AAElE,qFAAqF;AACrF,MAAM,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,KAAK,WAAW,CAAC,CAAC,CAAC,CAAA;AAEzF,gFAAgF;AAChF,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;AAEnD,MAAM,MAAM,oBAAoB,CAAC,CAAC,SAAS,QAAQ,IAAI;IACrD,wEAAwE;IACxE,KAAK,CAAC,EAAE,OAAO,CAAA;IACf;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,GAAG,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;CAC1E,CAAA;AAED,MAAM,WAAW,aAAa,CAAC,CAAC,SAAS,QAAQ;IAC/C,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAA;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,EAAE,CAAA;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB;;;;OAIG;IACH,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAA;CACtE;AAuHD;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,QAAQ,EAClD,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,oBAAoB,CAAC,CAAC,CAAM,GACjC,aAAa,CAAC,CAAC,CAAC,CASlB"}
+{"version":3,"file":"doc.d.ts","sourceRoot":"","sources":["../../src/functional/doc.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AACvE,OAAO,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAA;AAElE,qFAAqF;AACrF,MAAM,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,KAAK,WAAW,CAAC,CAAC,CAAC,CAAA;AAEzF,gFAAgF;AAChF,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;AAEnD,MAAM,MAAM,oBAAoB,CAAC,CAAC,SAAS,QAAQ,IAAI;IACrD,wEAAwE;IACxE,KAAK,CAAC,EAAE,OAAO,CAAA;IACf;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,GAAG,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;CAC1E,CAAA;AAED,MAAM,WAAW,aAAa,CAAC,CAAC,SAAS,QAAQ;IAC/C,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAA;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,EAAE,CAAA;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB;;;OAGG;IACH,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAA;CACtE;AAuHD;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,QAAQ,EAClD,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,oBAAoB,CAAC,CAAC,CAAM,GACjC,aAAa,CAAC,CAAC,CAAC,CASlB"}