parseman 0.12.0 → 0.13.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/compiler/codegen.d.ts.map +1 -1
- package/dist/compiler/scannable-run.d.ts +80 -2
- package/dist/compiler/scannable-run.d.ts.map +1 -1
- package/dist/cst/types.d.ts +1 -1
- package/dist/functional/doc.d.ts +6 -6
- package/dist/functional/doc.d.ts.map +1 -1
- package/dist/index.cjs +727 -52
- package/dist/index.cjs.map +3 -3
- package/dist/index.d.ts +2 -2
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +727 -52
- package/dist/index.js.map +3 -3
- package/dist/plugin/evaluator.d.ts +28 -2
- package/dist/plugin/evaluator.d.ts.map +1 -1
- package/dist/plugin/index.cjs +974 -101
- package/dist/plugin/index.cjs.map +3 -3
- package/dist/plugin/index.d.ts.map +1 -1
- package/dist/plugin/index.js +974 -101
- package/dist/plugin/index.js.map +3 -3
- package/package.json +5 -4
- package/dist/combinators/lazy.d.ts +0 -14
- package/dist/combinators/lazy.d.ts.map +0 -1
|
@@ -1 +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;
|
|
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;AAqbzH,wBAAgB,oBAAoB,CAAC,EAAE,EAAE,OAAO,GAAG,IAAI,CAA0B;AAohDjF,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,CA8GhG;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,CAiFhD"}
|
|
@@ -7,6 +7,13 @@
|
|
|
7
7
|
* [X]+ / [X]* → run while the char ∈ X (chars)
|
|
8
8
|
* <lit>[^X]* → consume <lit>, run until char ∈ X (until)
|
|
9
9
|
* <open>(?:…)*<close> → consume <open>, run to <close> literal (delimited)
|
|
10
|
+
* x?<lit><[X]*>… → a general linear chain of lit/run (seq)
|
|
11
|
+
*
|
|
12
|
+
* `seq` is the CATEGORY generalization: any chain of literal segments (required
|
|
13
|
+
* or optional `x?`) and char-class runs (positive/negated, `?`/`*`/`+`). It
|
|
14
|
+
* subsumes CSS/Less `-?ident`, `--custom`, `@-?keyword`, `[^…]+`, `::?`, etc.
|
|
15
|
+
* without hardcoding a single byte — lowered only when a greedy one-pass scan
|
|
16
|
+
* provably equals the engine's backtracking (see `seqIsUnambiguous`).
|
|
10
17
|
*
|
|
11
18
|
* A `oneOrMore(choice(a, b, …))` where every arm is one of these compiles to a
|
|
12
19
|
* single char-dispatch loop with one branch per arm — any count/order, because
|
|
@@ -14,6 +21,40 @@
|
|
|
14
21
|
* (whitespace + comments) is just the value-discarded instance of this; nothing
|
|
15
22
|
* here is trivia-specific.
|
|
16
23
|
*/
|
|
24
|
+
/**
|
|
25
|
+
* One segment of a `seq` shape. A `seq` is the general category "a fixed linear
|
|
26
|
+
* chain of literals and char-class runs" — no alternation, no groups, no
|
|
27
|
+
* backtracking. It subsumes every CSS/Less token that is "(optional prefix)?
|
|
28
|
+
* literal* char-run* …" without hardcoding any particular byte:
|
|
29
|
+
*
|
|
30
|
+
* lit — a run of fixed code points, optionally present (`x?`) or required.
|
|
31
|
+
* run — a char-class run: positive/negated ranges, min 0/1, bounded to one
|
|
32
|
+
* char (`[x]`, `[x]?`) or unbounded (`[x]*`, `[x]+`).
|
|
33
|
+
* group — a non-capturing sub-pattern `(?:…)` (§8f), quantified the same way
|
|
34
|
+
* as `run` (`min`/`unbounded`). `inner` is any already-recognized
|
|
35
|
+
* `ScanShape` for the group's body (so a group can itself contain
|
|
36
|
+
* `seq`/`chars`/`alt`/… — including a nested alternation via §8e).
|
|
37
|
+
* Only used when `groupInnerSafe(inner)` holds (see that function).
|
|
38
|
+
*
|
|
39
|
+
* We only lower a `seq` when greedy left-to-right scanning provably equals the
|
|
40
|
+
* regex engine's backtracking match (see `seqIsUnambiguous`).
|
|
41
|
+
*/
|
|
42
|
+
export type SeqPart = {
|
|
43
|
+
part: 'lit';
|
|
44
|
+
cps: number[];
|
|
45
|
+
optional: boolean;
|
|
46
|
+
} | {
|
|
47
|
+
part: 'run';
|
|
48
|
+
ranges: Array<[number, number]>;
|
|
49
|
+
negated: boolean;
|
|
50
|
+
min: 0 | 1;
|
|
51
|
+
unbounded: boolean;
|
|
52
|
+
} | {
|
|
53
|
+
part: 'group';
|
|
54
|
+
inner: ScanShape;
|
|
55
|
+
min: 0 | 1;
|
|
56
|
+
unbounded: boolean;
|
|
57
|
+
};
|
|
17
58
|
export type ScanShape = {
|
|
18
59
|
kind: 'chars';
|
|
19
60
|
ranges: Array<[number, number]>;
|
|
@@ -35,13 +76,49 @@ export type ScanShape = {
|
|
|
35
76
|
quote: number;
|
|
36
77
|
excluded: Array<[number, number]>;
|
|
37
78
|
escLineTerm: boolean;
|
|
79
|
+
} | {
|
|
80
|
+
kind: 'seq';
|
|
81
|
+
parts: SeqPart[];
|
|
82
|
+
} | {
|
|
83
|
+
kind: 'litFold';
|
|
84
|
+
open: number[];
|
|
85
|
+
} | {
|
|
86
|
+
kind: 'lookahead';
|
|
87
|
+
inner: ScanShape;
|
|
88
|
+
ranges: Array<[number, number]>;
|
|
89
|
+
classNegated: boolean;
|
|
90
|
+
negative: boolean;
|
|
91
|
+
} | {
|
|
92
|
+
kind: 'alt';
|
|
93
|
+
arms: ScanShape[];
|
|
94
|
+
disjoint: boolean;
|
|
95
|
+
firsts: Array<CharSet | null>;
|
|
38
96
|
};
|
|
39
97
|
/** Backslash (`\`) code point — the escape lead char in string shapes. */
|
|
40
98
|
export declare const BACKSLASH = 92;
|
|
99
|
+
/**
|
|
100
|
+
* `\s`'s code-point set per the spec's `WhiteSpace` + `LineTerminator`
|
|
101
|
+
* productions — TAB/LF/VT/FF/CR, SPACE, NBSP, and the Unicode `Zs` space
|
|
102
|
+
* separators. This set is fixed regardless of the `u` flag (unlike `\d`/`\w`,
|
|
103
|
+
* which are ASCII-only without `u` but widen with it), so it's always safe to
|
|
104
|
+
* lower to a fixed range scan.
|
|
105
|
+
*/
|
|
106
|
+
export declare const SPACE_RANGES: Array<[number, number]>;
|
|
107
|
+
export declare function parseClassRanges(body: string): Array<[number, number]> | null;
|
|
108
|
+
type CharSet = {
|
|
109
|
+
ranges: Array<[number, number]>;
|
|
110
|
+
negated: boolean;
|
|
111
|
+
};
|
|
41
112
|
/**
|
|
42
113
|
* Recognize one scannable arm from its regex source, or null if it isn't one of
|
|
43
|
-
* the structural shapes.
|
|
44
|
-
*
|
|
114
|
+
* the structural shapes. Top-level alternation (§8e) is tried FIRST — `|` has
|
|
115
|
+
* the lowest precedence in regex, so splitting on it happens before anything
|
|
116
|
+
* else, with each arm then recursively re-entering this same function (so an
|
|
117
|
+
* arm's own trailing lookahead, or its own nested `(?:…)`-wrapped alternation,
|
|
118
|
+
* is still recognized). Failing that: char-class run, ident, string, then
|
|
119
|
+
* open-until-terminator, delimited, and finally the general linear `seq` chain.
|
|
120
|
+
* A trailing `(?!class)`/`(?=class)` is peeled off next (§8b) and re-wraps
|
|
121
|
+
* whatever shape the remaining base recognizes as.
|
|
45
122
|
*/
|
|
46
123
|
export declare function parseScanShape(source: string): ScanShape | null;
|
|
47
124
|
/**
|
|
@@ -95,4 +172,5 @@ export declare function scanBranch(shape: ScanShape, mint: Mint): string;
|
|
|
95
172
|
* kindIndex] trivia chunk. Same completion semantics as scanBranch.
|
|
96
173
|
*/
|
|
97
174
|
export declare function scanBranchLabeled(shape: ScanShape, kindIndex: number, mint: Mint): string;
|
|
175
|
+
export {};
|
|
98
176
|
//# sourceMappingURL=scannable-run.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"scannable-run.d.ts","sourceRoot":"","sources":["../../src/compiler/scannable-run.ts"],"names":[],"mappings":"AAAA
|
|
1
|
+
{"version":3,"file":"scannable-run.d.ts","sourceRoot":"","sources":["../../src/compiler/scannable-run.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,MAAM,OAAO,GACf;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,GAAG,EAAE,MAAM,EAAE,CAAC;IAAC,QAAQ,EAAE,OAAO,CAAA;CAAE,GACjD;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAAC,OAAO,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAAC,SAAS,EAAE,OAAO,CAAA;CAAE,GAClG;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAAC,SAAS,EAAE,OAAO,CAAA;CAAE,CAAA;AAEvE,MAAM,MAAM,SAAS,GACjB;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAAC,MAAM,EAAE,OAAO,CAAA;CAAE,GACnE;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAAC,IAAI,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CAAE,GAC/E;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,GAKtD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAAC,WAAW,EAAE,OAAO,CAAA;CAAE,GAG1F;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,OAAO,EAAE,CAAA;CAAE,GAGjC;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,MAAM,EAAE,CAAA;CAAE,GAKnC;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,KAAK,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAAC,YAAY,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,OAAO,CAAA;CAAE,GASlH;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,SAAS,EAAE,CAAC;IAAC,QAAQ,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,CAAA;CAAE,CAAA;AAExF,0EAA0E;AAC1E,eAAO,MAAM,SAAS,KAAK,CAAA;AAK3B;;;;;;GAMG;AACH,eAAO,MAAM,YAAY,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAGhD,CAAA;AA2BD,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,CAyC7E;AAqRD,KAAK,OAAO,GAAG;IAAE,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CAAA;AA+VpE;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAY/D;AAkDD;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAOlF;AAED,eAAO,MAAM,SAAS,SAAU,MAAM,UAAU,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAG,MAGzD,CAAA;AAEjB,8FAA8F;AAC9F,eAAO,MAAM,OAAO,SAAU,MAAM,OAAO,MAAM,EAAE,aAAa,MAAM,KAAG,MAOxD,CAAA;AAEjB,8EAA8E;AAC9E,eAAO,MAAM,gBAAgB,YAAI,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAU,CAAA;AAE7D,0FAA0F;AAC1F,wBAAgB,cAAc,CAC5B,KAAK,EAAE,OAAO,CAAC,SAAS,EAAE;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,CAAC,GAC5C,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAIzB;AAED,sEAAsE;AACtE,MAAM,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,MAAM,KAAK,MAAM,CAAA;AAE9C;;;;;;;;;;;;;;GAcG;AACH,MAAM,MAAM,UAAU,GAAG;IAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CAAA;AAKrE,wBAAgB,cAAc,CAC5B,KAAK,EAAE,SAAS,EAChB,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,IAAI,EACV,GAAG,EAAE,MAAM,EACX,SAAS,CAAC,EAAE,MAAM,GACjB,UAAU,CA6PZ;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM,CAG/D;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM,CAazF"}
|
package/dist/cst/types.d.ts
CHANGED
|
@@ -5,7 +5,7 @@ import type { Span } from '../types.ts';
|
|
|
5
5
|
* and `children` works — whether from `node()` build callbacks or custom ASTs.
|
|
6
6
|
*
|
|
7
7
|
* `children` only needs items with `_tag` so traversal can distinguish sub-nodes
|
|
8
|
-
* from leaves. `
|
|
8
|
+
* from leaves. `parseDoc` uses an optional `rebuild` callback (or a
|
|
9
9
|
* shallow spread) when grafting a re-parsed subtree.
|
|
10
10
|
*/
|
|
11
11
|
export type NodeLike = {
|
package/dist/functional/doc.d.ts
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
/**
|
|
2
|
-
*
|
|
2
|
+
* Incremental parse document — incremental re-parse over a rules() registry.
|
|
3
3
|
*/
|
|
4
4
|
import type { ParseContext, ParseFail, ParseResult } from '../types.ts';
|
|
5
5
|
import type { NodeLike, CSTLeaf, CSTError } from '../cst/types.ts';
|
|
@@ -7,7 +7,7 @@ import type { NodeLike, CSTLeaf, CSTError } from '../cst/types.ts';
|
|
|
7
7
|
export type RuleFn<N> = (input: string, pos: number, ctx: ParseContext) => ParseResult<N>;
|
|
8
8
|
/** Rule name → parser function. This is exactly the shape `rules()` returns. */
|
|
9
9
|
export type Registry<N> = Record<string, RuleFn<N>>;
|
|
10
|
-
export type
|
|
10
|
+
export type ParseDocOptions<N extends NodeLike> = {
|
|
11
11
|
/** Initial grammar state threaded into ctx.state for the root parse. */
|
|
12
12
|
state?: unknown;
|
|
13
13
|
/**
|
|
@@ -17,7 +17,7 @@ export type FunctionalDocOptions<N extends NodeLike> = {
|
|
|
17
17
|
*/
|
|
18
18
|
rebuild?: (node: N, children: ReadonlyArray<N | CSTLeaf | CSTError>) => N;
|
|
19
19
|
};
|
|
20
|
-
export interface
|
|
20
|
+
export interface ParseDoc<N extends NodeLike> {
|
|
21
21
|
readonly tree: N | null;
|
|
22
22
|
readonly errors: ParseFail[];
|
|
23
23
|
readonly input: string;
|
|
@@ -25,11 +25,11 @@ export interface FunctionalDoc<N extends NodeLike> {
|
|
|
25
25
|
* Incrementally re-parse after a text change. `from`/`to` are byte offsets in
|
|
26
26
|
* the OLD input; `replacement` fills that range (editor change-event shape).
|
|
27
27
|
*/
|
|
28
|
-
edit(from: number, to: number, replacement: string):
|
|
28
|
+
edit(from: number, to: number, replacement: string): ParseDoc<N>;
|
|
29
29
|
}
|
|
30
30
|
/**
|
|
31
|
-
* Parse `input` from `rootRule` and wrap the result in a
|
|
31
|
+
* Parse `input` from `rootRule` and wrap the result in a ParseDoc that can
|
|
32
32
|
* be incrementally re-parsed via `.edit()`.
|
|
33
33
|
*/
|
|
34
|
-
export declare function
|
|
34
|
+
export declare function parseDoc<N extends NodeLike>(registry: Registry<N>, rootRule: string, input: string, opts?: ParseDocOptions<N>): ParseDoc<N>;
|
|
35
35
|
//# sourceMappingURL=doc.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"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,
|
|
1
|
+
{"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,eAAe,CAAC,CAAC,SAAS,QAAQ,IAAI;IAChD,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,QAAQ,CAAC,CAAC,SAAS,QAAQ;IAC1C,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,QAAQ,CAAC,CAAC,CAAC,CAAA;CACjE;AA0KD;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,QAAQ,EACzC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,eAAe,CAAC,CAAC,CAAM,GAC5B,QAAQ,CAAC,CAAC,CAAC,CASb"}
|