parseman 0.42.1 → 0.44.0

package/dist/cst/walk.d.ts

@@ -1,72 +1,37 @@
 /**
- * Tree traversal for the CST/AST a grammar produces. Parséman hands back a plain
- * object tree, so you *can* recurse it yourself — these helpers save you from
- * re-writing the same recursion for diagnostics, folding, or lowering a tree.
- *
- * Two entry points:
- *   - `walk`          — imperative depth-first traversal with enter/leave hooks.
- *   - `createVisitor` — Chevrotain-style dispatch keyed on each node's `type`.
- *
- * Both default to the built-in CST shape (`CSTChild` — the `node()` / leaf / error
- * union), so with no annotation you get precise typing out of the box. Parsing to
- * a custom AST? Pass your node type as a generic: `walk<MyNode>(root, …)`.
- */
-import type { CSTChild } from './types.ts';
-/**
- * The minimal shape these helpers traverse: a `_tag`, an optional rule `type`,
- * and optional structural `children`. The built-in `CSTChild` satisfies it, and
- * so does any custom AST node (that's what the generic override targets).
+ * Grammar-aware CST traversal. `createVisitor(grammar, handlers)` consumes the
+ * reflection stamped on interpreted `rules()` maps and macro/compiled grammar
+ * maps, precomputes tag dispatch once, and returns a reusable `visit(root)` fn.
  */
+import type { CSTChild, CSTNode } from './types.ts';
+import { type GrammarWithReflection } from './reflection.ts';
 export type Walkable = {
     readonly _tag: string;
     readonly type?: string;
     readonly children?: ReadonlyArray<Walkable>;
 };
-export interface WalkVisitor<N extends Walkable = CSTChild, C = undefined> {
-    /**
-     * Called on entering a node, before its children. Return `false` to skip
-     * descending into this node's children (`leave` still runs).
-     */
+type GrammarNodeType<G> = G extends GrammarWithReflection<infer NodeType, string> ? NodeType : G extends Record<string, unknown> ? Extract<keyof G, string> : string;
+type GrammarNodeTag<G> = G extends GrammarWithReflection<string, infer NodeTag> ? NodeTag : never;
+type NodeForType<N extends Walkable, Type extends string> = Extract<N, {
+    readonly _tag: 'node';
+}> extends never ? CSTNode & {
+    readonly type: Type;
+} : Extract<N, {
+    readonly _tag: 'node';
+}> & {
+    readonly type: Type;
+};
+export type VisitorHandler<N extends Walkable, Root extends Walkable = CSTChild, C = undefined> = (node: N, parent: Root | null, ctx: C) => void;
+export type VisitorSpec<G, N extends Walkable = CSTChild, C = undefined> = {
     enter?(node: N, parent: N | null, ctx: C): boolean | void;
-    /** Called on leaving a node, after its children. */
     leave?(node: N, parent: N | null, ctx: C): void;
-}
-/**
- * Depth-first traversal. Visits `root`, then each structural child in order.
- * `ctx` is threaded to both hooks unchanged (use it as an accumulator).
- *
- * Defaults to the CST shape; override with `walk<MyNode>(root, …)`:
- *
- *   const idents: string[] = []
- *   walk(tree, {
- *     enter(node) {
- *       if (node._tag === 'leaf') idents.push(node.value)
- *     },
- *   })
- */
-export declare function walk<N extends Walkable = CSTChild, C = undefined>(root: N, visitor: WalkVisitor<N, C>, ctx?: C): void;
-export interface VisitApi<R, N extends Walkable = CSTChild> {
-    /** Dispatch a node to its handler (by `type`); returns the handler's result. */
-    visit(node: N): R | undefined;
-    /** Visit every structural child, collecting the defined results in order. */
-    visitChildren(node: N): R[];
-}
-export type VisitorHandlers<R, N extends Walkable = CSTChild> = Record<string, (node: N, api: VisitApi<R, N>) => R>;
-/**
- * Build a visitor that dispatches on each node's `type` — the direct analog of a
- * generated CST-visitor base class. Handlers are keyed by rule name and receive
- * an `api` with `visit` / `visitChildren` to recurse:
- *
- *   const evalExpr = createVisitor<number>({
- *     Num: (n) => Number((n as NumNode).value),
- *     Add: (n, api) => api.visitChildren(n).reduce((a, b) => a + b, 0),
- *   })
- *   const total = evalExpr(tree)
- *
- * Defaults to the CST shape; override the return type and node type together with
- * `createVisitor<number, MyNode>({ … })`. A node whose `type` has no handler
- * falls through to visiting its children (results discarded), so partial visitors
- * work without listing every rule.
- */
-export declare function createVisitor<R = void, N extends Walkable = CSTChild>(handlers: VisitorHandlers<R, N>): (node: N) => R | undefined;
+    type?: {
+        [K in GrammarNodeType<G>]?: VisitorHandler<NodeForType<N, K>, N, C>;
+    };
+    tag?: {
+        [K in GrammarNodeTag<G>]?: VisitorHandler<NodeForType<N, GrammarNodeType<G>>, N, C>;
+    };
+};
+export declare function createVisitor<G extends object, N extends Walkable = CSTChild, C = undefined>(grammar: G, spec: VisitorSpec<G, N, C>): (root: N, ctx?: C) => void;
+export {};
 //# sourceMappingURL=walk.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"walk.d.ts","sourceRoot":"","sources":["../../src/cst/walk.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAA;AAE1C;;;;GAIG;AACH,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,QAAQ,CAAC,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAA;CAC5C,CAAA;AAED,MAAM,WAAW,WAAW,CAAC,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAAE,CAAC,GAAG,SAAS;IACvE;;;OAGG;IACH,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,GAAG,OAAO,GAAG,IAAI,CAAA;IACzD,oDAAoD;IACpD,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAA;CAChD;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAAE,CAAC,GAAG,SAAS,EAC/D,IAAI,EAAE,CAAC,EACP,OAAO,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,GAAG,GAAE,CAAkB,GACtB,IAAI,CAUN;AAED,MAAM,WAAW,QAAQ,CAAC,CAAC,EAAE,CAAC,SAAS,QAAQ,GAAG,QAAQ;IACxD,gFAAgF;IAChF,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAA;IAC7B,6EAA6E;IAC7E,aAAa,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAA;CAC5B;AAED,MAAM,MAAM,eAAe,CAAC,CAAC,EAAE,CAAC,SAAS,QAAQ,GAAG,QAAQ,IAAI,MAAM,CACpE,MAAM,EACN,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CACpC,CAAA;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,aAAa,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,SAAS,QAAQ,GAAG,QAAQ,EACnE,QAAQ,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,GAC9B,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,CAqB5B"}
+{"version":3,"file":"walk.d.ts","sourceRoot":"","sources":["../../src/cst/walk.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,YAAY,CAAA;AAEnD,OAAO,EAGL,KAAK,qBAAqB,EAC3B,MAAM,iBAAiB,CAAA;AAExB,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,QAAQ,CAAC,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAA;CAC5C,CAAA;AAED,KAAK,eAAe,CAAC,CAAC,IACpB,CAAC,SAAS,qBAAqB,CAAC,MAAM,QAAQ,EAAE,MAAM,CAAC,GACnD,QAAQ,GACR,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC/B,OAAO,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,GACxB,MAAM,CAAA;AAEd,KAAK,cAAc,CAAC,CAAC,IACnB,CAAC,SAAS,qBAAqB,CAAC,MAAM,EAAE,MAAM,OAAO,CAAC,GAAG,OAAO,GAAG,KAAK,CAAA;AAE1E,KAAK,WAAW,CAAC,CAAC,SAAS,QAAQ,EAAE,IAAI,SAAS,MAAM,IACtD,OAAO,CAAC,CAAC,EAAE;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,SAAS,KAAK,GAC/C,OAAO,GAAG;IAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;CAAE,GACjC,OAAO,CAAC,CAAC,EAAE;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG;IAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;CAAE,CAAA;AAErE,MAAM,MAAM,cAAc,CAAC,CAAC,SAAS,QAAQ,EAAE,IAAI,SAAS,QAAQ,GAAG,QAAQ,EAAE,CAAC,GAAG,SAAS,IAC5F,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,IAAI,CAAA;AAEhD,MAAM,MAAM,WAAW,CAAC,CAAC,EAAE,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAAE,CAAC,GAAG,SAAS,IAAI;IACzE,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,GAAG,OAAO,GAAG,IAAI,CAAA;IACzD,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAA;IAC/C,IAAI,CAAC,EAAE;SACJ,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;KACpE,CAAA;IACD,GAAG,CAAC,EAAE;SACH,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,WAAW,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;KACpF,CAAA;CACF,CAAA;AAgBD,wBAAgB,aAAa,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,QAAQ,GAAG,QAAQ,EAAE,CAAC,GAAG,SAAS,EAC1F,OAAO,EAAE,CAAC,EACV,IAAI,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GACzB,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,CAmC5B"}

package/dist/functional/run.d.ts

@@ -50,10 +50,18 @@ export type RunOptions = {
      * to these trivia kinds — a bitmask over the grammar's `triviaKindLabels`
      * indices (build it with `triviaKindMask(labels, ['comment', …])`). Unlisted
      * kinds (e.g. whitespace) are skipped over but not recorded per node, so a host
-     * that only reads comments doesn't pay to log every whitespace run. The global
-     * `triviaLog` returned by `run()` is unaffected. Omit to capture every kind.
+     * that only reads comments doesn't pay to log every whitespace run. Omit to
+     * capture every kind.
      */
     triviaCaptureMask?: number;
+    /**
+     * Opt into sparse root trivia capture. `run()` retains no root trivia unless
+     * this is supplied. Capture records only the named labels, each with the one
+     * complete authored gap that owns it; ordinary whitespace has no root entry.
+     */
+    rootTrivia?: {
+        readonly select: readonly string[];
+    };
     /**
      * Activate automatic list recovery. When true, `many`/`sepBy`/`oneOrMore` recover
      * from a failed element — skip to a sync point (a resume token inferred from the
@@ -75,6 +83,14 @@ export type RunOptions = {
      */
     profile?: boolean;
 };
+export type RootTriviaCapture = {
+    /** Packed `[gapStart, gapEnd, markerStart, markerEnd, selectedKindIndex]` rows. */
+    readonly rows: readonly number[];
+    /** Labels requested by this caller; row kind indices refer to this array. */
+    readonly select: readonly string[];
+    /** Lazy lookup over `rows`; no tokens or strings are materialized. */
+    readonly index: RootTriviaIndex;
+};
 export type RunProfilePass = {
     ms: number;
     nodes: number;
@@ -106,21 +122,11 @@ export type RunResult = {
     /** Recovery diagnostics (tolerant lists / `expect()`) collected during the parse (in order). */
     errors: ParseError[];
     /**
-     * Flat trivia log for building a trivia map. Entry width depends on whether the
-     * grammar uses labeled trivia: 2 numbers per entry (`start, end`) for plain
-     * trivia, 3 numbers per entry (`start, end, kindIndex`) for labeled trivia
-     * (grammars with `label()` arms in their trivia choice). Use `triviaMap` /
-     * `triviaEntries` to consume it format-agnostically rather than iterating raw.
-     */
-    triviaLog: number[];
-    /** Trivia kind labels for `triviaLog` stride/kind decoding, when known. */
-    triviaKindLabels?: readonly string[];
-    /**
-     * Lazy sparse root trivia index over `triviaLog`. It groups contiguous labeled
-     * chunks into one gap and returns entry indices, so consumers can query
-     * before/after offsets without materializing trivia token objects or strings.
+     * Sparse selected root trivia. This is present only when at least one requested
+     * category was actually retained; omitted means the parse retained no root
+     * trivia at all.
      */
-    triviaMap: RootTriviaIndex;
+    rootTrivia?: RootTriviaCapture;
     /** Offset where unparsed input begins — the first non-trivia character the parse
      * left unconsumed (trailing trivia skipped when `trivia` is given), or null if
      * the whole input was consumed. This is how you detect "the grammar stopped short,

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

@@ -1 +1 @@
-{"version":3,"file":"run.d.ts","sourceRoot":"","sources":["../../src/functional/run.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAEpF,OAAO,EAAwB,KAAK,eAAe,EAAE,MAAM,0BAA0B,CAAA;AAMrF;;;;;;;;;;;;GAYG;AAEH,+EAA+E;AAC/E,MAAM,MAAM,QAAQ,GAChB,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,KAAK,WAAW,CAAC,OAAO,CAAC,CAAC,GACzE,UAAU,CAAC,OAAO,CAAC,CAAA;AAEvB,MAAM,MAAM,UAAU,GAAG;IACvB;kFAC8E;IAC9E,eAAe,CAAC,EAAE;QAChB,gBAAgB,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,IAAI,CAAA;QACvC,aAAa,CAAC,EAAE;YAAE,KAAK,CAAC,KAAK,EAAE;gBAAE,EAAE,EAAE,MAAM,CAAC;gBAAC,KAAK,EAAE,OAAO,GAAG,SAAS,GAAG,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,UAAU,CAAC;gBAAC,MAAM,EAAE,MAAM,CAAC;gBAAC,GAAG,CAAC,EAAE,MAAM,CAAA;aAAE,GAAG,IAAI,CAAA;SAAE,CAAA;KACjL,CAAA;IACD;qFACiF;IACjF,KAAK,CAAC,EAAE,YAAY,CAAC,OAAO,CAAC,CAAA;IAC7B,uDAAuD;IACvD,KAAK,CAAC,EAAE,OAAO,CAAA;IACf;;;;;;;;;OASG;IACH,MAAM,CAAC,EAAE,QAAQ,CAAA;IACjB;;;;;;;OAOG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B;;;;;;;;;OASG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB;;;;;;;OAOG;IACH,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,cAAc,GAAG;IAC3B,EAAE,EAAE,MAAM,CAAA;IACV,KAAK,EAAE,MAAM,CAAA;IACb,UAAU,EAAE,MAAM,CAAA;IAClB,QAAQ,EAAE,MAAM,CAAA;IAChB,WAAW,EAAE,MAAM,CAAA;IACnB,UAAU,EAAE,MAAM,CAAA;IAClB,SAAS,EAAE,MAAM,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,UAAU,GAAG;IACvB;kFAC8E;IAC9E,UAAU,EAAE,cAAc,CAAA;IAC1B,4EAA4E;IAC5E,iBAAiB,EAAE,cAAc,CAAA;IACjC,mEAAmE;IACnE,gBAAgB,EAAE,cAAc,CAAA;CACjC,CAAA;AAED,MAAM,MAAM,SAAS,GAAG;IACtB,EAAE,EAAE,OAAO,CAAA;IACX,0DAA0D;IAC1D,KAAK,EAAE,OAAO,CAAA;IACd,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAA;IACpC,6EAA6E;IAC7E,QAAQ,EAAE,MAAM,EAAE,CAAA;IAClB,gGAAgG;IAChG,MAAM,EAAE,UAAU,EAAE,CAAA;IACpB;;;;;;OAMG;IACH,SAAS,EAAE,MAAM,EAAE,CAAA;IACnB,2EAA2E;IAC3E,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;IACpC;;;;OAIG;IACH,SAAS,EAAE,eAAe,CAAA;IAC1B;;;;4BAIwB;IACxB,cAAc,EAAE,MAAM,GAAG,IAAI,CAAA;IAC7B,sDAAsD;IACtD,OAAO,CAAC,EAAE,UAAU,CAAA;CACrB,CAAA;AA4HD,wBAAgB,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,UAAe,GAAG,SAAS,CAsBvF"}
+{"version":3,"file":"run.d.ts","sourceRoot":"","sources":["../../src/functional/run.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAEpF,OAAO,EAAwB,KAAK,eAAe,EAAE,MAAM,0BAA0B,CAAA;AAMrF;;;;;;;;;;;;GAYG;AAEH,+EAA+E;AAC/E,MAAM,MAAM,QAAQ,GAChB,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,KAAK,WAAW,CAAC,OAAO,CAAC,CAAC,GACzE,UAAU,CAAC,OAAO,CAAC,CAAA;AAEvB,MAAM,MAAM,UAAU,GAAG;IACvB;kFAC8E;IAC9E,eAAe,CAAC,EAAE;QAChB,gBAAgB,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,IAAI,CAAA;QACvC,aAAa,CAAC,EAAE;YAAE,KAAK,CAAC,KAAK,EAAE;gBAAE,EAAE,EAAE,MAAM,CAAC;gBAAC,KAAK,EAAE,OAAO,GAAG,SAAS,GAAG,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,UAAU,CAAC;gBAAC,MAAM,EAAE,MAAM,CAAC;gBAAC,GAAG,CAAC,EAAE,MAAM,CAAA;aAAE,GAAG,IAAI,CAAA;SAAE,CAAA;KACjL,CAAA;IACD;qFACiF;IACjF,KAAK,CAAC,EAAE,YAAY,CAAC,OAAO,CAAC,CAAA;IAC7B,uDAAuD;IACvD,KAAK,CAAC,EAAE,OAAO,CAAA;IACf;;;;;;;;;OASG;IACH,MAAM,CAAC,EAAE,QAAQ,CAAA;IACjB;;;;;;;OAOG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B;;;;OAIG;IACH,UAAU,CAAC,EAAE;QACX,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;KACnC,CAAA;IACD;;;;;;;;;OASG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB;;;;;;;OAOG;IACH,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,iBAAiB,GAAG;IAC9B,mFAAmF;IACnF,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAA;IAChC,6EAA6E;IAC7E,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;IAClC,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,eAAe,CAAA;CAChC,CAAA;AAED,MAAM,MAAM,cAAc,GAAG;IAC3B,EAAE,EAAE,MAAM,CAAA;IACV,KAAK,EAAE,MAAM,CAAA;IACb,UAAU,EAAE,MAAM,CAAA;IAClB,QAAQ,EAAE,MAAM,CAAA;IAChB,WAAW,EAAE,MAAM,CAAA;IACnB,UAAU,EAAE,MAAM,CAAA;IAClB,SAAS,EAAE,MAAM,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,UAAU,GAAG;IACvB;kFAC8E;IAC9E,UAAU,EAAE,cAAc,CAAA;IAC1B,4EAA4E;IAC5E,iBAAiB,EAAE,cAAc,CAAA;IACjC,mEAAmE;IACnE,gBAAgB,EAAE,cAAc,CAAA;CACjC,CAAA;AAED,MAAM,MAAM,SAAS,GAAG;IACtB,EAAE,EAAE,OAAO,CAAA;IACX,0DAA0D;IAC1D,KAAK,EAAE,OAAO,CAAA;IACd,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAA;IACpC,6EAA6E;IAC7E,QAAQ,EAAE,MAAM,EAAE,CAAA;IAClB,gGAAgG;IAChG,MAAM,EAAE,UAAU,EAAE,CAAA;IACpB;;;;OAIG;IACH,UAAU,CAAC,EAAE,iBAAiB,CAAA;IAC9B;;;;4BAIwB;IACxB,cAAc,EAAE,MAAM,GAAG,IAAI,CAAA;IAC7B,sDAAsD;IACtD,OAAO,CAAC,EAAE,UAAU,CAAA;CACrB,CAAA;AAuLD,wBAAgB,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,UAAe,GAAG,SAAS,CAsBvF"}