@prisma/orm-framework 8.0.0-rc.18-dev.42 → 8.0.0-rc.18-dev.43

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.
Files changed (102) hide show
  1. package/dist/{authoring-BKO7sRLw.d.mts → authoring-C8sYYHu7.d.mts} +3 -3
  2. package/dist/{authoring-BKO7sRLw.d.mts.map → authoring-C8sYYHu7.d.mts.map} +1 -1
  3. package/dist/{authoring-so3aBYD8.mjs → authoring-qO6idK5H.mjs} +24 -3
  4. package/dist/authoring-qO6idK5H.mjs.map +1 -0
  5. package/dist/{binder-WS9-1Mu9-MJi8x3Gm.d.mts → binder-63ozT0D8-BixamO0l.d.mts} +12 -10
  6. package/dist/binder-63ozT0D8-BixamO0l.d.mts.map +1 -0
  7. package/dist/{components-D-8GZwNo.d.mts → components-B3SnaxMU.d.mts} +2 -2
  8. package/dist/{components-D-8GZwNo.d.mts.map → components-B3SnaxMU.d.mts.map} +1 -1
  9. package/dist/components.d.mts +10 -10
  10. package/dist/components.mjs +4 -4
  11. package/dist/components__authoring.d.mts +4 -4
  12. package/dist/components__authoring.mjs +3 -3
  13. package/dist/components__components.d.mts +2 -2
  14. package/dist/components__control.d.mts +3 -3
  15. package/dist/components__control.mjs +3 -3
  16. package/dist/components__execution.d.mts +1 -1
  17. package/dist/components__psl-ast.d.mts +3 -3
  18. package/dist/{config-types-CfdMN7t-.d.mts → config-types-0fY7fbd7.d.mts} +6 -6
  19. package/dist/{config-types-CfdMN7t-.d.mts.map → config-types-0fY7fbd7.d.mts.map} +1 -1
  20. package/dist/config.d.mts +1 -1
  21. package/dist/config__config-types.d.mts +1 -1
  22. package/dist/contract-authoring.d.mts +34 -14
  23. package/dist/contract-authoring.d.mts.map +1 -1
  24. package/dist/contract-authoring.mjs +3 -3
  25. package/dist/{control-B5ezUWD2-BgUEggvd.d.mts → control-B5ezUWD2-D6knyncN.d.mts} +2 -2
  26. package/dist/{control-B5ezUWD2-BgUEggvd.d.mts.map → control-B5ezUWD2-D6knyncN.d.mts.map} +1 -1
  27. package/dist/control-D2ZpYj6i.d.mts +1 -0
  28. package/dist/{control-7DsPHRLi.d.mts → control-D9rb0OBR.d.mts} +18 -48
  29. package/dist/{control-7DsPHRLi.d.mts.map → control-D9rb0OBR.d.mts.map} +1 -1
  30. package/dist/{control-AlBtrJUn.mjs → control-DPasGnOD.mjs} +23 -124
  31. package/dist/control-DPasGnOD.mjs.map +1 -0
  32. package/dist/{control-KsXr4fYD-DJm_48Db.mjs → control-KsXr4fYD-B23ri5vh.mjs} +2 -2
  33. package/dist/{control-KsXr4fYD-DJm_48Db.mjs.map → control-KsXr4fYD-B23ri5vh.mjs.map} +1 -1
  34. package/dist/declarations-BgUAq1RG-ShewcVdd.mjs +459 -0
  35. package/dist/declarations-BgUAq1RG-ShewcVdd.mjs.map +1 -0
  36. package/dist/errors.d.mts +4 -4
  37. package/dist/errors.mjs +3 -3
  38. package/dist/errors__control.d.mts +2 -2
  39. package/dist/errors__control.mjs +1 -1
  40. package/dist/errors__execution.d.mts +1 -1
  41. package/dist/errors__execution.mjs +1 -1
  42. package/dist/errors__migration.d.mts +1 -1
  43. package/dist/errors__migration.mjs +1 -1
  44. package/dist/{execution-BkcXd7Tn.d.mts → execution-C00_IFA7.d.mts} +3 -3
  45. package/dist/{execution-BkcXd7Tn.d.mts.map → execution-C00_IFA7.d.mts.map} +1 -1
  46. package/dist/{execution-KLhn9sSn.mjs → execution-C_4ICly-.mjs} +2 -2
  47. package/dist/{execution-KLhn9sSn.mjs.map → execution-C_4ICly-.mjs.map} +1 -1
  48. package/dist/{execution-DXQQRCfR.d.mts → execution-CktUHYP0.d.mts} +2 -2
  49. package/dist/{execution-DXQQRCfR.d.mts.map → execution-CktUHYP0.d.mts.map} +1 -1
  50. package/dist/expressions-CMQzbnHk-fqYn-D3z.mjs +895 -0
  51. package/dist/expressions-CMQzbnHk-fqYn-D3z.mjs.map +1 -0
  52. package/dist/{framework-authoring-hZgq-M2K-Daz3kgWL.d.mts → framework-authoring-Du7xSUmg-D85Toszi.d.mts} +27 -10
  53. package/dist/framework-authoring-Du7xSUmg-D85Toszi.d.mts.map +1 -0
  54. package/dist/{framework-components-B-yaLbst-nZJUGMuf.d.mts → framework-components-DQFte83L-CIIcH8Bj.d.mts} +3 -3
  55. package/dist/{framework-components-B-yaLbst-nZJUGMuf.d.mts.map → framework-components-DQFte83L-CIIcH8Bj.d.mts.map} +1 -1
  56. package/dist/{migration-CZik9OxU.mjs → migration-Dy-tXHxh.mjs} +2 -2
  57. package/dist/{migration-CZik9OxU.mjs.map → migration-Dy-tXHxh.mjs.map} +1 -1
  58. package/dist/{migration-BVDJBmyi.d.mts → migration-K3Co0dba.d.mts} +2 -2
  59. package/dist/{migration-BVDJBmyi.d.mts.map → migration-K3Co0dba.d.mts.map} +1 -1
  60. package/dist/{parse-BxcaGLV1-BxEIfxh3.mjs → parse-bZgfjovA-Bd80h0ox.mjs} +4 -4
  61. package/dist/{parse-BxcaGLV1-BxEIfxh3.mjs.map → parse-bZgfjovA-Bd80h0ox.mjs.map} +1 -1
  62. package/dist/{parse-CJtBvEYy-BCae0181.d.mts → parse-djL5wker-DYTP4HGq.d.mts} +7 -7
  63. package/dist/{parse-CJtBvEYy-BCae0181.d.mts.map → parse-djL5wker-DYTP4HGq.d.mts.map} +1 -1
  64. package/dist/{psl-ast-BIJIW24G-B8ptjyuO.d.mts → psl-ast-B6X_rlhZ-DCrq7Zie.d.mts} +3 -3
  65. package/dist/{psl-ast-BIJIW24G-B8ptjyuO.d.mts.map → psl-ast-B6X_rlhZ-DCrq7Zie.d.mts.map} +1 -1
  66. package/dist/psl-ast-DlmFfwfZ.d.mts +2 -0
  67. package/dist/psl-parser.d.mts +22 -11
  68. package/dist/psl-parser.d.mts.map +1 -1
  69. package/dist/psl-parser.mjs +14 -110
  70. package/dist/psl-parser.mjs.map +1 -1
  71. package/dist/psl-parser__format.d.mts +1 -1
  72. package/dist/psl-parser__format.mjs +3 -3
  73. package/dist/psl-parser__format.mjs.map +1 -1
  74. package/dist/psl-parser__interpret.d.mts +16 -13
  75. package/dist/psl-parser__interpret.d.mts.map +1 -1
  76. package/dist/psl-parser__interpret.mjs +52 -48
  77. package/dist/psl-parser__interpret.mjs.map +1 -1
  78. package/dist/psl-parser__syntax.d.mts +1 -1
  79. package/dist/psl-parser__syntax.mjs +3 -3
  80. package/dist/psl-printer.d.mts +4 -4
  81. package/dist/psl-printer.mjs +1 -1
  82. package/dist/read-expression-as-Dhyvx51C-Bpn_1X05.mjs +239 -0
  83. package/dist/read-expression-as-Dhyvx51C-Bpn_1X05.mjs.map +1 -0
  84. package/dist/{temporal-presets-Cumws2z--DcYWooYJ.d.mts → temporal-presets-D_TQBbXU-DLIsE1k-.d.mts} +42 -4
  85. package/dist/temporal-presets-D_TQBbXU-DLIsE1k-.d.mts.map +1 -0
  86. package/dist/{temporal-presets-BcDyr_hK-CFplJNGz.mjs → temporal-presets-DmZDnaZV-aUZPt1LX.mjs} +189 -22
  87. package/dist/temporal-presets-DmZDnaZV-aUZPt1LX.mjs.map +1 -0
  88. package/package.json +15 -15
  89. package/dist/ast-helpers-CzydMPdh-Mi0SrZRa.mjs +0 -424
  90. package/dist/ast-helpers-CzydMPdh-Mi0SrZRa.mjs.map +0 -1
  91. package/dist/authoring-so3aBYD8.mjs.map +0 -1
  92. package/dist/binder-WS9-1Mu9-MJi8x3Gm.d.mts.map +0 -1
  93. package/dist/control-AlBtrJUn.mjs.map +0 -1
  94. package/dist/control-CIEbQ0bK.d.mts +0 -1
  95. package/dist/declarations-DuSbyF44-D-Q7-GRi.mjs +0 -930
  96. package/dist/declarations-DuSbyF44-D-Q7-GRi.mjs.map +0 -1
  97. package/dist/framework-authoring-hZgq-M2K-Daz3kgWL.d.mts.map +0 -1
  98. package/dist/psl-ast-rf0UoVty.d.mts +0 -2
  99. package/dist/resolve-C8PUf8zv-QAvnPhCt.mjs +0 -146
  100. package/dist/resolve-C8PUf8zv-QAvnPhCt.mjs.map +0 -1
  101. package/dist/temporal-presets-BcDyr_hK-CFplJNGz.mjs.map +0 -1
  102. package/dist/temporal-presets-Cumws2z--DcYWooYJ.d.mts.map +0 -1
@@ -1,424 +0,0 @@
1
- //#region ../../../1-framework/2-authoring/psl-parser/dist/ast-helpers-CzydMPdh.mjs
2
- /**
3
- * A token in the red tree. Unlike the green-layer {@link Token} (kind + text
4
- * only), a red token also carries its absolute `offset` within the source and a
5
- * link back to its `parent` {@link SyntaxNode}, so a cursor anchored on a token
6
- * can walk outward (parent, previous/next token, siblings) without re-scanning
7
- * from the document root.
8
- */
9
- var SyntaxToken = class {
10
- green;
11
- kind;
12
- text;
13
- offset;
14
- parent;
15
- /** Position within the parent's children, enabling O(1) sibling navigation without rescanning the green layer. */
16
- index;
17
- constructor(green, offset, parent, index) {
18
- this.green = green;
19
- this.kind = green.kind;
20
- this.text = green.text;
21
- this.offset = offset;
22
- this.parent = parent;
23
- this.index = index;
24
- }
25
- get textLength() {
26
- return this.text.length;
27
- }
28
- get endOffset() {
29
- return this.offset + this.textLength;
30
- }
31
- /** Whether `offset` falls within this token, inclusive of both ends. */
32
- isInside(offset) {
33
- return offset >= this.offset && offset <= this.endOffset;
34
- }
35
- isOutside(offset) {
36
- return !this.isInside(offset);
37
- }
38
- /** The sibling element immediately after this token within its parent. */
39
- get nextSiblingOrToken() {
40
- return this.parent.childAt(this.index + 1);
41
- }
42
- /** The sibling element immediately before this token within its parent. */
43
- get prevSiblingOrToken() {
44
- return this.parent.childAt(this.index - 1);
45
- }
46
- /** The next token in document order, crossing node boundaries. */
47
- get nextToken() {
48
- for (let el = climbingNext(this); el !== void 0; el = climbingNext(el)) {
49
- const token = firstToken(el);
50
- if (token !== void 0) return token;
51
- }
52
- }
53
- /** The previous token in document order, crossing node boundaries. */
54
- get prevToken() {
55
- for (let el = climbingPrev(this); el !== void 0; el = climbingPrev(el)) {
56
- const token = lastToken(el);
57
- if (token !== void 0) return token;
58
- }
59
- }
60
- };
61
- var TokenAtOffset = class TokenAtOffset {
62
- #state;
63
- constructor(state) {
64
- this.#state = state;
65
- }
66
- static none() {
67
- return new TokenAtOffset({ kind: "none" });
68
- }
69
- static single(token) {
70
- return new TokenAtOffset({
71
- kind: "single",
72
- token
73
- });
74
- }
75
- static between(left, right) {
76
- return new TokenAtOffset({
77
- kind: "between",
78
- left,
79
- right
80
- });
81
- }
82
- get isEmpty() {
83
- return this.#state.kind === "none";
84
- }
85
- get isBetween() {
86
- return this.#state.kind === "between";
87
- }
88
- leftBiased() {
89
- switch (this.#state.kind) {
90
- case "none": return;
91
- case "single": return this.#state.token;
92
- case "between": return this.#state.left;
93
- }
94
- }
95
- rightBiased() {
96
- switch (this.#state.kind) {
97
- case "none": return;
98
- case "single": return this.#state.token;
99
- case "between": return this.#state.right;
100
- }
101
- }
102
- };
103
- var SyntaxNode = class SyntaxNode {
104
- green;
105
- offset;
106
- parent;
107
- /** Position within the parent's children, enabling O(1) sibling navigation without rescanning the green layer. */
108
- index;
109
- #childSlots;
110
- #childOffsets;
111
- constructor(green, offset, parent, index) {
112
- this.green = green;
113
- this.offset = offset;
114
- this.parent = parent;
115
- this.index = index;
116
- }
117
- #slots() {
118
- let slots = this.#childSlots;
119
- if (slots === void 0) {
120
- slots = new Array(this.green.children.length).fill(void 0);
121
- this.#childSlots = slots;
122
- }
123
- return slots;
124
- }
125
- #childOffset(index) {
126
- let offsets = this.#childOffsets;
127
- if (offsets === void 0) {
128
- offsets = [];
129
- this.#childOffsets = offsets;
130
- }
131
- for (let known = offsets.length; known <= index; known++) {
132
- const previousOffset = offsets[known - 1];
133
- const previousChild = this.green.children[known - 1];
134
- offsets.push(previousOffset === void 0 || previousChild === void 0 ? this.offset : previousOffset + elementTextLength(previousChild));
135
- }
136
- return offsets[index] ?? this.offset;
137
- }
138
- childAt(index) {
139
- const green = this.green.children[index];
140
- if (green === void 0) return void 0;
141
- const slots = this.#slots();
142
- const cached = slots[index];
143
- if (cached !== void 0) return cached;
144
- const created = wrapElement(green, this.#childOffset(index), this, index);
145
- slots[index] = created;
146
- return created;
147
- }
148
- get kind() {
149
- return this.green.kind;
150
- }
151
- get textLength() {
152
- return this.green.textLength;
153
- }
154
- get endOffset() {
155
- return this.offset + this.textLength;
156
- }
157
- /** Whether `offset` falls within this node, inclusive of both ends. */
158
- isInside(offset) {
159
- return offset >= this.offset && offset <= this.endOffset;
160
- }
161
- isOutside(offset) {
162
- return !this.isInside(offset);
163
- }
164
- get firstChild() {
165
- return this.childAt(0);
166
- }
167
- get lastChild() {
168
- return this.childAt(this.green.children.length - 1);
169
- }
170
- get nextSibling() {
171
- return this.parent?.childAt(this.index + 1);
172
- }
173
- get prevSibling() {
174
- return this.parent?.childAt(this.index - 1);
175
- }
176
- /** The sibling element immediately after this node within its parent. */
177
- get nextSiblingOrToken() {
178
- return this.nextSibling;
179
- }
180
- /** The sibling element immediately before this node within its parent. */
181
- get prevSiblingOrToken() {
182
- return this.prevSibling;
183
- }
184
- /** The first token in this subtree (depth-first), or `undefined` if empty. */
185
- get firstToken() {
186
- return firstToken(this);
187
- }
188
- /** The last token in this subtree (depth-first), or `undefined` if empty. */
189
- get lastToken() {
190
- return lastToken(this);
191
- }
192
- *children() {
193
- const count = this.green.children.length;
194
- for (let index = 0; index < count; index++) {
195
- const child = this.childAt(index);
196
- if (child !== void 0) yield child;
197
- }
198
- }
199
- *childNodes() {
200
- for (const child of this.children()) if (child instanceof SyntaxNode) yield child;
201
- }
202
- root() {
203
- let current = this;
204
- for (const parent of this.ancestors()) current = parent;
205
- return current;
206
- }
207
- *ancestors() {
208
- let current = this.parent;
209
- while (current) {
210
- yield current;
211
- current = current.parent;
212
- }
213
- }
214
- /** The nearest match, testing this node itself before walking its ancestors. */
215
- findAncestor(cast) {
216
- const self = cast(this);
217
- if (self !== void 0) return self;
218
- for (const ancestor of this.ancestors()) {
219
- const result = cast(ancestor);
220
- if (result !== void 0) return result;
221
- }
222
- }
223
- *descendants() {
224
- const stack = [this];
225
- for (let el = stack.pop(); el !== void 0; el = stack.pop()) {
226
- yield el;
227
- if (el instanceof SyntaxNode) {
228
- const children = Array.from(el.children());
229
- for (let i = children.length - 1; i >= 0; i--) {
230
- const child = children[i];
231
- if (child !== void 0) stack.push(child);
232
- }
233
- }
234
- }
235
- }
236
- *tokens() {
237
- for (const el of this.descendants()) if (el instanceof SyntaxToken) yield el;
238
- }
239
- /**
240
- * The token(s) at `offset`. The between-two-tokens case (offset exactly on a
241
- * token seam) is represented explicitly so callers can left/right bias.
242
- */
243
- tokenAtOffset(offset) {
244
- return tokenAtOffsetOf(this, offset);
245
- }
246
- /**
247
- * The smallest element fully containing the range `[start, end]`. At a seam
248
- * (and for empty ranges) the left-hand element is preferred, matching
249
- * {@link containsOffset}'s inclusive span.
250
- */
251
- coveringElement(start, end) {
252
- let result = this;
253
- for (;;) {
254
- if (result instanceof SyntaxToken) return result;
255
- let next;
256
- for (const child of result.children()) if (containsRange(child, start, end)) {
257
- next = child;
258
- break;
259
- }
260
- if (next === void 0) return result;
261
- result = next;
262
- }
263
- }
264
- };
265
- function elementTextLength(el) {
266
- return el.type === "token" ? el.text.length : el.textLength;
267
- }
268
- function elementLength(el) {
269
- return el instanceof SyntaxToken ? el.text.length : el.textLength;
270
- }
271
- /**
272
- * Whether `el` contains `offset`. The span is inclusive on both ends so a seam
273
- * offset touches both neighbours.
274
- */
275
- function containsOffset(el, offset) {
276
- const start = el.offset;
277
- const len = elementLength(el);
278
- return offset >= start && offset <= start + len;
279
- }
280
- function containsRange(el, start, end) {
281
- const elStart = el.offset;
282
- const len = elementLength(el);
283
- return elStart <= start && end <= elStart + len;
284
- }
285
- function tokenAtOffsetOf(el, offset) {
286
- if (el instanceof SyntaxToken) return TokenAtOffset.single(el);
287
- let left;
288
- let right;
289
- for (const child of el.children()) {
290
- if (!containsOffset(child, offset)) continue;
291
- if (left === void 0) left = child;
292
- else {
293
- right = child;
294
- break;
295
- }
296
- }
297
- if (left === void 0) return TokenAtOffset.none();
298
- if (right === void 0) return tokenAtOffsetOf(left, offset);
299
- const leftToken = tokenAtOffsetOf(left, offset).rightBiased();
300
- const rightToken = tokenAtOffsetOf(right, offset).leftBiased();
301
- if (leftToken !== void 0 && rightToken !== void 0) return TokenAtOffset.between(leftToken, rightToken);
302
- if (leftToken !== void 0) return TokenAtOffset.single(leftToken);
303
- if (rightToken !== void 0) return TokenAtOffset.single(rightToken);
304
- return TokenAtOffset.none();
305
- }
306
- function firstToken(el) {
307
- if (el instanceof SyntaxToken) return el;
308
- for (const child of el.children()) {
309
- const token = firstToken(child);
310
- if (token !== void 0) return token;
311
- }
312
- }
313
- function lastToken(el) {
314
- if (el instanceof SyntaxToken) return el;
315
- const children = Array.from(el.children());
316
- for (let i = children.length - 1; i >= 0; i--) {
317
- const child = children[i];
318
- if (child !== void 0) {
319
- const token = lastToken(child);
320
- if (token !== void 0) return token;
321
- }
322
- }
323
- }
324
- function climbingNext(el) {
325
- let current = el;
326
- for (;;) {
327
- const parent = current.parent;
328
- if (parent === void 0) return void 0;
329
- const sibling = parent.childAt(current.index + 1);
330
- if (sibling !== void 0) return sibling;
331
- current = parent;
332
- }
333
- }
334
- function climbingPrev(el) {
335
- let current = el;
336
- for (;;) {
337
- const parent = current.parent;
338
- if (parent === void 0) return void 0;
339
- const sibling = parent.childAt(current.index - 1);
340
- if (sibling !== void 0) return sibling;
341
- current = parent;
342
- }
343
- }
344
- function wrapElement(green, offset, parent, index) {
345
- if (green.type === "token") return new SyntaxToken(green, offset, parent, index);
346
- return new SyntaxNode(green, offset, parent, index);
347
- }
348
- function createSyntaxTree(green) {
349
- return new SyntaxNode(green, 0, void 0, 0);
350
- }
351
- /**
352
- * Walks back through `node`'s preceding sibling tokens collecting a
353
- * contiguous `///` run: only whitespace and single newlines may sit between
354
- * consecutive `///` lines. Stops at a blank line, a non-`///` comment, or any
355
- * other non-trivia element. Each line has its `///` marker and one following
356
- * space stripped; the lines join with `\n`.
357
- */
358
- function readDocComment(node) {
359
- const lines = [];
360
- let current = node;
361
- let newlinesSinceComment = 0;
362
- for (;;) {
363
- const sibling = current.prevSiblingOrToken;
364
- if (!(sibling instanceof SyntaxToken)) break;
365
- if (sibling.kind === "Whitespace") {
366
- current = sibling;
367
- continue;
368
- }
369
- if (sibling.kind === "Newline") {
370
- newlinesSinceComment += 1;
371
- if (newlinesSinceComment > 1) break;
372
- current = sibling;
373
- continue;
374
- }
375
- if (sibling.kind === "Comment" && sibling.text.startsWith("///")) {
376
- lines.push(stripDocCommentMarker(sibling.text));
377
- newlinesSinceComment = 0;
378
- current = sibling;
379
- continue;
380
- }
381
- break;
382
- }
383
- return lines.length === 0 ? void 0 : lines.reverse().join("\n");
384
- }
385
- function stripDocCommentMarker(text) {
386
- const withoutMarker = text.slice(3);
387
- return withoutMarker.startsWith(" ") ? withoutMarker.slice(1) : withoutMarker;
388
- }
389
- function findChildToken(node, kind) {
390
- for (const child of node.children()) if (!(child instanceof SyntaxNode) && child.kind === kind) return child;
391
- }
392
- function findFirstChild(node, cast) {
393
- for (const child of node.childNodes()) {
394
- const result = cast(child);
395
- if (result !== void 0) return result;
396
- }
397
- }
398
- function* filterChildren(node, cast) {
399
- for (const child of node.childNodes()) {
400
- const result = cast(child);
401
- if (result !== void 0) yield result;
402
- }
403
- }
404
- function any(...casts) {
405
- return (node) => {
406
- for (const cast of casts) {
407
- const result = cast(node);
408
- if (result !== void 0) return result;
409
- }
410
- };
411
- }
412
- /**
413
- * Raw source text of a CST node, verbatim (quotes and brackets preserved). For
414
- * the decoded value of a string literal, decode it instead.
415
- */
416
- function printSyntax(node) {
417
- let text = "";
418
- for (const token of node.tokens()) text += token.text;
419
- return text;
420
- }
421
- //#endregion
422
- export { createSyntaxTree as a, findFirstChild as c, any as i, printSyntax as l, SyntaxToken as n, filterChildren as o, TokenAtOffset as r, findChildToken as s, SyntaxNode as t, readDocComment as u };
423
-
424
- //# sourceMappingURL=ast-helpers-CzydMPdh-Mi0SrZRa.mjs.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"ast-helpers-CzydMPdh-Mi0SrZRa.mjs","names":["#state","#childSlots","#childOffsets","#slots","#childOffset"],"sources":["../../../../1-framework/2-authoring/psl-parser/dist/ast-helpers-CzydMPdh.mjs"],"sourcesContent":["//#region src/syntax/red.ts\n/**\n* A token in the red tree. Unlike the green-layer {@link Token} (kind + text\n* only), a red token also carries its absolute `offset` within the source and a\n* link back to its `parent` {@link SyntaxNode}, so a cursor anchored on a token\n* can walk outward (parent, previous/next token, siblings) without re-scanning\n* from the document root.\n*/\nvar SyntaxToken = class {\n\tgreen;\n\tkind;\n\ttext;\n\toffset;\n\tparent;\n\t/** Position within the parent's children, enabling O(1) sibling navigation without rescanning the green layer. */\n\tindex;\n\tconstructor(green, offset, parent, index) {\n\t\tthis.green = green;\n\t\tthis.kind = green.kind;\n\t\tthis.text = green.text;\n\t\tthis.offset = offset;\n\t\tthis.parent = parent;\n\t\tthis.index = index;\n\t}\n\tget textLength() {\n\t\treturn this.text.length;\n\t}\n\tget endOffset() {\n\t\treturn this.offset + this.textLength;\n\t}\n\t/** Whether `offset` falls within this token, inclusive of both ends. */\n\tisInside(offset) {\n\t\treturn offset >= this.offset && offset <= this.endOffset;\n\t}\n\tisOutside(offset) {\n\t\treturn !this.isInside(offset);\n\t}\n\t/** The sibling element immediately after this token within its parent. */\n\tget nextSiblingOrToken() {\n\t\treturn this.parent.childAt(this.index + 1);\n\t}\n\t/** The sibling element immediately before this token within its parent. */\n\tget prevSiblingOrToken() {\n\t\treturn this.parent.childAt(this.index - 1);\n\t}\n\t/** The next token in document order, crossing node boundaries. */\n\tget nextToken() {\n\t\tfor (let el = climbingNext(this); el !== void 0; el = climbingNext(el)) {\n\t\t\tconst token = firstToken(el);\n\t\t\tif (token !== void 0) return token;\n\t\t}\n\t}\n\t/** The previous token in document order, crossing node boundaries. */\n\tget prevToken() {\n\t\tfor (let el = climbingPrev(this); el !== void 0; el = climbingPrev(el)) {\n\t\t\tconst token = lastToken(el);\n\t\t\tif (token !== void 0) return token;\n\t\t}\n\t}\n};\nvar TokenAtOffset = class TokenAtOffset {\n\t#state;\n\tconstructor(state) {\n\t\tthis.#state = state;\n\t}\n\tstatic none() {\n\t\treturn new TokenAtOffset({ kind: \"none\" });\n\t}\n\tstatic single(token) {\n\t\treturn new TokenAtOffset({\n\t\t\tkind: \"single\",\n\t\t\ttoken\n\t\t});\n\t}\n\tstatic between(left, right) {\n\t\treturn new TokenAtOffset({\n\t\t\tkind: \"between\",\n\t\t\tleft,\n\t\t\tright\n\t\t});\n\t}\n\tget isEmpty() {\n\t\treturn this.#state.kind === \"none\";\n\t}\n\tget isBetween() {\n\t\treturn this.#state.kind === \"between\";\n\t}\n\tleftBiased() {\n\t\tswitch (this.#state.kind) {\n\t\t\tcase \"none\": return;\n\t\t\tcase \"single\": return this.#state.token;\n\t\t\tcase \"between\": return this.#state.left;\n\t\t}\n\t}\n\trightBiased() {\n\t\tswitch (this.#state.kind) {\n\t\t\tcase \"none\": return;\n\t\t\tcase \"single\": return this.#state.token;\n\t\t\tcase \"between\": return this.#state.right;\n\t\t}\n\t}\n};\nvar SyntaxNode = class SyntaxNode {\n\tgreen;\n\toffset;\n\tparent;\n\t/** Position within the parent's children, enabling O(1) sibling navigation without rescanning the green layer. */\n\tindex;\n\t#childSlots;\n\t#childOffsets;\n\tconstructor(green, offset, parent, index) {\n\t\tthis.green = green;\n\t\tthis.offset = offset;\n\t\tthis.parent = parent;\n\t\tthis.index = index;\n\t}\n\t#slots() {\n\t\tlet slots = this.#childSlots;\n\t\tif (slots === void 0) {\n\t\t\tslots = new Array(this.green.children.length).fill(void 0);\n\t\t\tthis.#childSlots = slots;\n\t\t}\n\t\treturn slots;\n\t}\n\t#childOffset(index) {\n\t\tlet offsets = this.#childOffsets;\n\t\tif (offsets === void 0) {\n\t\t\toffsets = [];\n\t\t\tthis.#childOffsets = offsets;\n\t\t}\n\t\tfor (let known = offsets.length; known <= index; known++) {\n\t\t\tconst previousOffset = offsets[known - 1];\n\t\t\tconst previousChild = this.green.children[known - 1];\n\t\t\toffsets.push(previousOffset === void 0 || previousChild === void 0 ? this.offset : previousOffset + elementTextLength(previousChild));\n\t\t}\n\t\treturn offsets[index] ?? this.offset;\n\t}\n\tchildAt(index) {\n\t\tconst green = this.green.children[index];\n\t\tif (green === void 0) return void 0;\n\t\tconst slots = this.#slots();\n\t\tconst cached = slots[index];\n\t\tif (cached !== void 0) return cached;\n\t\tconst created = wrapElement(green, this.#childOffset(index), this, index);\n\t\tslots[index] = created;\n\t\treturn created;\n\t}\n\tget kind() {\n\t\treturn this.green.kind;\n\t}\n\tget textLength() {\n\t\treturn this.green.textLength;\n\t}\n\tget endOffset() {\n\t\treturn this.offset + this.textLength;\n\t}\n\t/** Whether `offset` falls within this node, inclusive of both ends. */\n\tisInside(offset) {\n\t\treturn offset >= this.offset && offset <= this.endOffset;\n\t}\n\tisOutside(offset) {\n\t\treturn !this.isInside(offset);\n\t}\n\tget firstChild() {\n\t\treturn this.childAt(0);\n\t}\n\tget lastChild() {\n\t\treturn this.childAt(this.green.children.length - 1);\n\t}\n\tget nextSibling() {\n\t\treturn this.parent?.childAt(this.index + 1);\n\t}\n\tget prevSibling() {\n\t\treturn this.parent?.childAt(this.index - 1);\n\t}\n\t/** The sibling element immediately after this node within its parent. */\n\tget nextSiblingOrToken() {\n\t\treturn this.nextSibling;\n\t}\n\t/** The sibling element immediately before this node within its parent. */\n\tget prevSiblingOrToken() {\n\t\treturn this.prevSibling;\n\t}\n\t/** The first token in this subtree (depth-first), or `undefined` if empty. */\n\tget firstToken() {\n\t\treturn firstToken(this);\n\t}\n\t/** The last token in this subtree (depth-first), or `undefined` if empty. */\n\tget lastToken() {\n\t\treturn lastToken(this);\n\t}\n\t*children() {\n\t\tconst count = this.green.children.length;\n\t\tfor (let index = 0; index < count; index++) {\n\t\t\tconst child = this.childAt(index);\n\t\t\tif (child !== void 0) yield child;\n\t\t}\n\t}\n\t*childNodes() {\n\t\tfor (const child of this.children()) if (child instanceof SyntaxNode) yield child;\n\t}\n\troot() {\n\t\tlet current = this;\n\t\tfor (const parent of this.ancestors()) current = parent;\n\t\treturn current;\n\t}\n\t*ancestors() {\n\t\tlet current = this.parent;\n\t\twhile (current) {\n\t\t\tyield current;\n\t\t\tcurrent = current.parent;\n\t\t}\n\t}\n\t/** The nearest match, testing this node itself before walking its ancestors. */\n\tfindAncestor(cast) {\n\t\tconst self = cast(this);\n\t\tif (self !== void 0) return self;\n\t\tfor (const ancestor of this.ancestors()) {\n\t\t\tconst result = cast(ancestor);\n\t\t\tif (result !== void 0) return result;\n\t\t}\n\t}\n\t*descendants() {\n\t\tconst stack = [this];\n\t\tfor (let el = stack.pop(); el !== void 0; el = stack.pop()) {\n\t\t\tyield el;\n\t\t\tif (el instanceof SyntaxNode) {\n\t\t\t\tconst children = Array.from(el.children());\n\t\t\t\tfor (let i = children.length - 1; i >= 0; i--) {\n\t\t\t\t\tconst child = children[i];\n\t\t\t\t\tif (child !== void 0) stack.push(child);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t*tokens() {\n\t\tfor (const el of this.descendants()) if (el instanceof SyntaxToken) yield el;\n\t}\n\t/**\n\t* The token(s) at `offset`. The between-two-tokens case (offset exactly on a\n\t* token seam) is represented explicitly so callers can left/right bias.\n\t*/\n\ttokenAtOffset(offset) {\n\t\treturn tokenAtOffsetOf(this, offset);\n\t}\n\t/**\n\t* The smallest element fully containing the range `[start, end]`. At a seam\n\t* (and for empty ranges) the left-hand element is preferred, matching\n\t* {@link containsOffset}'s inclusive span.\n\t*/\n\tcoveringElement(start, end) {\n\t\tlet result = this;\n\t\tfor (;;) {\n\t\t\tif (result instanceof SyntaxToken) return result;\n\t\t\tlet next;\n\t\t\tfor (const child of result.children()) if (containsRange(child, start, end)) {\n\t\t\t\tnext = child;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (next === void 0) return result;\n\t\t\tresult = next;\n\t\t}\n\t}\n};\nfunction elementTextLength(el) {\n\treturn el.type === \"token\" ? el.text.length : el.textLength;\n}\nfunction elementLength(el) {\n\treturn el instanceof SyntaxToken ? el.text.length : el.textLength;\n}\n/**\n* Whether `el` contains `offset`. The span is inclusive on both ends so a seam\n* offset touches both neighbours.\n*/\nfunction containsOffset(el, offset) {\n\tconst start = el.offset;\n\tconst len = elementLength(el);\n\treturn offset >= start && offset <= start + len;\n}\nfunction containsRange(el, start, end) {\n\tconst elStart = el.offset;\n\tconst len = elementLength(el);\n\treturn elStart <= start && end <= elStart + len;\n}\nfunction tokenAtOffsetOf(el, offset) {\n\tif (el instanceof SyntaxToken) return TokenAtOffset.single(el);\n\tlet left;\n\tlet right;\n\tfor (const child of el.children()) {\n\t\tif (!containsOffset(child, offset)) continue;\n\t\tif (left === void 0) left = child;\n\t\telse {\n\t\t\tright = child;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (left === void 0) return TokenAtOffset.none();\n\tif (right === void 0) return tokenAtOffsetOf(left, offset);\n\tconst leftToken = tokenAtOffsetOf(left, offset).rightBiased();\n\tconst rightToken = tokenAtOffsetOf(right, offset).leftBiased();\n\tif (leftToken !== void 0 && rightToken !== void 0) return TokenAtOffset.between(leftToken, rightToken);\n\tif (leftToken !== void 0) return TokenAtOffset.single(leftToken);\n\tif (rightToken !== void 0) return TokenAtOffset.single(rightToken);\n\treturn TokenAtOffset.none();\n}\nfunction firstToken(el) {\n\tif (el instanceof SyntaxToken) return el;\n\tfor (const child of el.children()) {\n\t\tconst token = firstToken(child);\n\t\tif (token !== void 0) return token;\n\t}\n}\nfunction lastToken(el) {\n\tif (el instanceof SyntaxToken) return el;\n\tconst children = Array.from(el.children());\n\tfor (let i = children.length - 1; i >= 0; i--) {\n\t\tconst child = children[i];\n\t\tif (child !== void 0) {\n\t\t\tconst token = lastToken(child);\n\t\t\tif (token !== void 0) return token;\n\t\t}\n\t}\n}\nfunction climbingNext(el) {\n\tlet current = el;\n\tfor (;;) {\n\t\tconst parent = current.parent;\n\t\tif (parent === void 0) return void 0;\n\t\tconst sibling = parent.childAt(current.index + 1);\n\t\tif (sibling !== void 0) return sibling;\n\t\tcurrent = parent;\n\t}\n}\nfunction climbingPrev(el) {\n\tlet current = el;\n\tfor (;;) {\n\t\tconst parent = current.parent;\n\t\tif (parent === void 0) return void 0;\n\t\tconst sibling = parent.childAt(current.index - 1);\n\t\tif (sibling !== void 0) return sibling;\n\t\tcurrent = parent;\n\t}\n}\nfunction wrapElement(green, offset, parent, index) {\n\tif (green.type === \"token\") return new SyntaxToken(green, offset, parent, index);\n\treturn new SyntaxNode(green, offset, parent, index);\n}\nfunction createSyntaxTree(green) {\n\treturn new SyntaxNode(green, 0, void 0, 0);\n}\n//#endregion\n//#region src/syntax/ast-helpers.ts\n/**\n* Walks back through `node`'s preceding sibling tokens collecting a\n* contiguous `///` run: only whitespace and single newlines may sit between\n* consecutive `///` lines. Stops at a blank line, a non-`///` comment, or any\n* other non-trivia element. Each line has its `///` marker and one following\n* space stripped; the lines join with `\\n`.\n*/\nfunction readDocComment(node) {\n\tconst lines = [];\n\tlet current = node;\n\tlet newlinesSinceComment = 0;\n\tfor (;;) {\n\t\tconst sibling = current.prevSiblingOrToken;\n\t\tif (!(sibling instanceof SyntaxToken)) break;\n\t\tif (sibling.kind === \"Whitespace\") {\n\t\t\tcurrent = sibling;\n\t\t\tcontinue;\n\t\t}\n\t\tif (sibling.kind === \"Newline\") {\n\t\t\tnewlinesSinceComment += 1;\n\t\t\tif (newlinesSinceComment > 1) break;\n\t\t\tcurrent = sibling;\n\t\t\tcontinue;\n\t\t}\n\t\tif (sibling.kind === \"Comment\" && sibling.text.startsWith(\"///\")) {\n\t\t\tlines.push(stripDocCommentMarker(sibling.text));\n\t\t\tnewlinesSinceComment = 0;\n\t\t\tcurrent = sibling;\n\t\t\tcontinue;\n\t\t}\n\t\tbreak;\n\t}\n\treturn lines.length === 0 ? void 0 : lines.reverse().join(\"\\n\");\n}\nfunction stripDocCommentMarker(text) {\n\tconst withoutMarker = text.slice(3);\n\treturn withoutMarker.startsWith(\" \") ? withoutMarker.slice(1) : withoutMarker;\n}\nfunction findChildToken(node, kind) {\n\tfor (const child of node.children()) if (!(child instanceof SyntaxNode) && child.kind === kind) return child;\n}\nfunction findFirstChild(node, cast) {\n\tfor (const child of node.childNodes()) {\n\t\tconst result = cast(child);\n\t\tif (result !== void 0) return result;\n\t}\n}\nfunction* filterChildren(node, cast) {\n\tfor (const child of node.childNodes()) {\n\t\tconst result = cast(child);\n\t\tif (result !== void 0) yield result;\n\t}\n}\nfunction any(...casts) {\n\treturn (node) => {\n\t\tfor (const cast of casts) {\n\t\t\tconst result = cast(node);\n\t\t\tif (result !== void 0) return result;\n\t\t}\n\t};\n}\n/**\n* Raw source text of a CST node, verbatim (quotes and brackets preserved). For\n* the decoded value of a string literal, decode it instead.\n*/\nfunction printSyntax(node) {\n\tlet text = \"\";\n\tfor (const token of node.tokens()) text += token.text;\n\treturn text;\n}\n//#endregion\nexport { printSyntax as a, SyntaxToken as c, findFirstChild as i, TokenAtOffset as l, filterChildren as n, readDocComment as o, findChildToken as r, SyntaxNode as s, any as t, createSyntaxTree as u };\n\n//# sourceMappingURL=ast-helpers-CzydMPdh.mjs.map"],"mappings":";;;;;;;;AAQA,IAAI,cAAc,MAAM;CACvB;CACA;CACA;CACA;CACA;;CAEA;CACA,YAAY,OAAO,QAAQ,QAAQ,OAAO;EACzC,KAAK,QAAQ;EACb,KAAK,OAAO,MAAM;EAClB,KAAK,OAAO,MAAM;EAClB,KAAK,SAAS;EACd,KAAK,SAAS;EACd,KAAK,QAAQ;CACd;CACA,IAAI,aAAa;EAChB,OAAO,KAAK,KAAK;CAClB;CACA,IAAI,YAAY;EACf,OAAO,KAAK,SAAS,KAAK;CAC3B;;CAEA,SAAS,QAAQ;EAChB,OAAO,UAAU,KAAK,UAAU,UAAU,KAAK;CAChD;CACA,UAAU,QAAQ;EACjB,OAAO,CAAC,KAAK,SAAS,MAAM;CAC7B;;CAEA,IAAI,qBAAqB;EACxB,OAAO,KAAK,OAAO,QAAQ,KAAK,QAAQ,CAAC;CAC1C;;CAEA,IAAI,qBAAqB;EACxB,OAAO,KAAK,OAAO,QAAQ,KAAK,QAAQ,CAAC;CAC1C;;CAEA,IAAI,YAAY;EACf,KAAK,IAAI,KAAK,aAAa,IAAI,GAAG,OAAO,KAAK,GAAG,KAAK,aAAa,EAAE,GAAG;GACvE,MAAM,QAAQ,WAAW,EAAE;GAC3B,IAAI,UAAU,KAAK,GAAG,OAAO;EAC9B;CACD;;CAEA,IAAI,YAAY;EACf,KAAK,IAAI,KAAK,aAAa,IAAI,GAAG,OAAO,KAAK,GAAG,KAAK,aAAa,EAAE,GAAG;GACvE,MAAM,QAAQ,UAAU,EAAE;GAC1B,IAAI,UAAU,KAAK,GAAG,OAAO;EAC9B;CACD;AACD;AACA,IAAI,gBAAgB,MAAM,cAAc;CACvC;CACA,YAAY,OAAO;EAClB,KAAKA,SAAS;CACf;CACA,OAAO,OAAO;EACb,OAAO,IAAI,cAAc,EAAE,MAAM,OAAO,CAAC;CAC1C;CACA,OAAO,OAAO,OAAO;EACpB,OAAO,IAAI,cAAc;GACxB,MAAM;GACN;EACD,CAAC;CACF;CACA,OAAO,QAAQ,MAAM,OAAO;EAC3B,OAAO,IAAI,cAAc;GACxB,MAAM;GACN;GACA;EACD,CAAC;CACF;CACA,IAAI,UAAU;EACb,OAAO,KAAKA,OAAO,SAAS;CAC7B;CACA,IAAI,YAAY;EACf,OAAO,KAAKA,OAAO,SAAS;CAC7B;CACA,aAAa;EACZ,QAAQ,KAAKA,OAAO,MAApB;GACC,KAAK,QAAQ;GACb,KAAK,UAAU,OAAO,KAAKA,OAAO;GAClC,KAAK,WAAW,OAAO,KAAKA,OAAO;EACpC;CACD;CACA,cAAc;EACb,QAAQ,KAAKA,OAAO,MAApB;GACC,KAAK,QAAQ;GACb,KAAK,UAAU,OAAO,KAAKA,OAAO;GAClC,KAAK,WAAW,OAAO,KAAKA,OAAO;EACpC;CACD;AACD;AACA,IAAI,aAAa,MAAM,WAAW;CACjC;CACA;CACA;;CAEA;CACA;CACA;CACA,YAAY,OAAO,QAAQ,QAAQ,OAAO;EACzC,KAAK,QAAQ;EACb,KAAK,SAAS;EACd,KAAK,SAAS;EACd,KAAK,QAAQ;CACd;CACA,SAAS;EACR,IAAI,QAAQ,KAAKC;EACjB,IAAI,UAAU,KAAK,GAAG;GACrB,QAAQ,IAAI,MAAM,KAAK,MAAM,SAAS,MAAM,CAAC,CAAC,KAAK,KAAK,CAAC;GACzD,KAAKA,cAAc;EACpB;EACA,OAAO;CACR;CACA,aAAa,OAAO;EACnB,IAAI,UAAU,KAAKC;EACnB,IAAI,YAAY,KAAK,GAAG;GACvB,UAAU,CAAC;GACX,KAAKA,gBAAgB;EACtB;EACA,KAAK,IAAI,QAAQ,QAAQ,QAAQ,SAAS,OAAO,SAAS;GACzD,MAAM,iBAAiB,QAAQ,QAAQ;GACvC,MAAM,gBAAgB,KAAK,MAAM,SAAS,QAAQ;GAClD,QAAQ,KAAK,mBAAmB,KAAK,KAAK,kBAAkB,KAAK,IAAI,KAAK,SAAS,iBAAiB,kBAAkB,aAAa,CAAC;EACrI;EACA,OAAO,QAAQ,UAAU,KAAK;CAC/B;CACA,QAAQ,OAAO;EACd,MAAM,QAAQ,KAAK,MAAM,SAAS;EAClC,IAAI,UAAU,KAAK,GAAG,OAAO,KAAK;EAClC,MAAM,QAAQ,KAAKC,OAAO;EAC1B,MAAM,SAAS,MAAM;EACrB,IAAI,WAAW,KAAK,GAAG,OAAO;EAC9B,MAAM,UAAU,YAAY,OAAO,KAAKC,aAAa,KAAK,GAAG,MAAM,KAAK;EACxE,MAAM,SAAS;EACf,OAAO;CACR;CACA,IAAI,OAAO;EACV,OAAO,KAAK,MAAM;CACnB;CACA,IAAI,aAAa;EAChB,OAAO,KAAK,MAAM;CACnB;CACA,IAAI,YAAY;EACf,OAAO,KAAK,SAAS,KAAK;CAC3B;;CAEA,SAAS,QAAQ;EAChB,OAAO,UAAU,KAAK,UAAU,UAAU,KAAK;CAChD;CACA,UAAU,QAAQ;EACjB,OAAO,CAAC,KAAK,SAAS,MAAM;CAC7B;CACA,IAAI,aAAa;EAChB,OAAO,KAAK,QAAQ,CAAC;CACtB;CACA,IAAI,YAAY;EACf,OAAO,KAAK,QAAQ,KAAK,MAAM,SAAS,SAAS,CAAC;CACnD;CACA,IAAI,cAAc;EACjB,OAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,CAAC;CAC3C;CACA,IAAI,cAAc;EACjB,OAAO,KAAK,QAAQ,QAAQ,KAAK,QAAQ,CAAC;CAC3C;;CAEA,IAAI,qBAAqB;EACxB,OAAO,KAAK;CACb;;CAEA,IAAI,qBAAqB;EACxB,OAAO,KAAK;CACb;;CAEA,IAAI,aAAa;EAChB,OAAO,WAAW,IAAI;CACvB;;CAEA,IAAI,YAAY;EACf,OAAO,UAAU,IAAI;CACtB;CACA,CAAC,WAAW;EACX,MAAM,QAAQ,KAAK,MAAM,SAAS;EAClC,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,SAAS;GAC3C,MAAM,QAAQ,KAAK,QAAQ,KAAK;GAChC,IAAI,UAAU,KAAK,GAAG,MAAM;EAC7B;CACD;CACA,CAAC,aAAa;EACb,KAAK,MAAM,SAAS,KAAK,SAAS,GAAG,IAAI,iBAAiB,YAAY,MAAM;CAC7E;CACA,OAAO;EACN,IAAI,UAAU;EACd,KAAK,MAAM,UAAU,KAAK,UAAU,GAAG,UAAU;EACjD,OAAO;CACR;CACA,CAAC,YAAY;EACZ,IAAI,UAAU,KAAK;EACnB,OAAO,SAAS;GACf,MAAM;GACN,UAAU,QAAQ;EACnB;CACD;;CAEA,aAAa,MAAM;EAClB,MAAM,OAAO,KAAK,IAAI;EACtB,IAAI,SAAS,KAAK,GAAG,OAAO;EAC5B,KAAK,MAAM,YAAY,KAAK,UAAU,GAAG;GACxC,MAAM,SAAS,KAAK,QAAQ;GAC5B,IAAI,WAAW,KAAK,GAAG,OAAO;EAC/B;CACD;CACA,CAAC,cAAc;EACd,MAAM,QAAQ,CAAC,IAAI;EACnB,KAAK,IAAI,KAAK,MAAM,IAAI,GAAG,OAAO,KAAK,GAAG,KAAK,MAAM,IAAI,GAAG;GAC3D,MAAM;GACN,IAAI,cAAc,YAAY;IAC7B,MAAM,WAAW,MAAM,KAAK,GAAG,SAAS,CAAC;IACzC,KAAK,IAAI,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;KAC9C,MAAM,QAAQ,SAAS;KACvB,IAAI,UAAU,KAAK,GAAG,MAAM,KAAK,KAAK;IACvC;GACD;EACD;CACD;CACA,CAAC,SAAS;EACT,KAAK,MAAM,MAAM,KAAK,YAAY,GAAG,IAAI,cAAc,aAAa,MAAM;CAC3E;;;;;CAKA,cAAc,QAAQ;EACrB,OAAO,gBAAgB,MAAM,MAAM;CACpC;;;;;;CAMA,gBAAgB,OAAO,KAAK;EAC3B,IAAI,SAAS;EACb,SAAS;GACR,IAAI,kBAAkB,aAAa,OAAO;GAC1C,IAAI;GACJ,KAAK,MAAM,SAAS,OAAO,SAAS,GAAG,IAAI,cAAc,OAAO,OAAO,GAAG,GAAG;IAC5E,OAAO;IACP;GACD;GACA,IAAI,SAAS,KAAK,GAAG,OAAO;GAC5B,SAAS;EACV;CACD;AACD;AACA,SAAS,kBAAkB,IAAI;CAC9B,OAAO,GAAG,SAAS,UAAU,GAAG,KAAK,SAAS,GAAG;AAClD;AACA,SAAS,cAAc,IAAI;CAC1B,OAAO,cAAc,cAAc,GAAG,KAAK,SAAS,GAAG;AACxD;;;;;AAKA,SAAS,eAAe,IAAI,QAAQ;CACnC,MAAM,QAAQ,GAAG;CACjB,MAAM,MAAM,cAAc,EAAE;CAC5B,OAAO,UAAU,SAAS,UAAU,QAAQ;AAC7C;AACA,SAAS,cAAc,IAAI,OAAO,KAAK;CACtC,MAAM,UAAU,GAAG;CACnB,MAAM,MAAM,cAAc,EAAE;CAC5B,OAAO,WAAW,SAAS,OAAO,UAAU;AAC7C;AACA,SAAS,gBAAgB,IAAI,QAAQ;CACpC,IAAI,cAAc,aAAa,OAAO,cAAc,OAAO,EAAE;CAC7D,IAAI;CACJ,IAAI;CACJ,KAAK,MAAM,SAAS,GAAG,SAAS,GAAG;EAClC,IAAI,CAAC,eAAe,OAAO,MAAM,GAAG;EACpC,IAAI,SAAS,KAAK,GAAG,OAAO;OACvB;GACJ,QAAQ;GACR;EACD;CACD;CACA,IAAI,SAAS,KAAK,GAAG,OAAO,cAAc,KAAK;CAC/C,IAAI,UAAU,KAAK,GAAG,OAAO,gBAAgB,MAAM,MAAM;CACzD,MAAM,YAAY,gBAAgB,MAAM,MAAM,CAAC,CAAC,YAAY;CAC5D,MAAM,aAAa,gBAAgB,OAAO,MAAM,CAAC,CAAC,WAAW;CAC7D,IAAI,cAAc,KAAK,KAAK,eAAe,KAAK,GAAG,OAAO,cAAc,QAAQ,WAAW,UAAU;CACrG,IAAI,cAAc,KAAK,GAAG,OAAO,cAAc,OAAO,SAAS;CAC/D,IAAI,eAAe,KAAK,GAAG,OAAO,cAAc,OAAO,UAAU;CACjE,OAAO,cAAc,KAAK;AAC3B;AACA,SAAS,WAAW,IAAI;CACvB,IAAI,cAAc,aAAa,OAAO;CACtC,KAAK,MAAM,SAAS,GAAG,SAAS,GAAG;EAClC,MAAM,QAAQ,WAAW,KAAK;EAC9B,IAAI,UAAU,KAAK,GAAG,OAAO;CAC9B;AACD;AACA,SAAS,UAAU,IAAI;CACtB,IAAI,cAAc,aAAa,OAAO;CACtC,MAAM,WAAW,MAAM,KAAK,GAAG,SAAS,CAAC;CACzC,KAAK,IAAI,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;EAC9C,MAAM,QAAQ,SAAS;EACvB,IAAI,UAAU,KAAK,GAAG;GACrB,MAAM,QAAQ,UAAU,KAAK;GAC7B,IAAI,UAAU,KAAK,GAAG,OAAO;EAC9B;CACD;AACD;AACA,SAAS,aAAa,IAAI;CACzB,IAAI,UAAU;CACd,SAAS;EACR,MAAM,SAAS,QAAQ;EACvB,IAAI,WAAW,KAAK,GAAG,OAAO,KAAK;EACnC,MAAM,UAAU,OAAO,QAAQ,QAAQ,QAAQ,CAAC;EAChD,IAAI,YAAY,KAAK,GAAG,OAAO;EAC/B,UAAU;CACX;AACD;AACA,SAAS,aAAa,IAAI;CACzB,IAAI,UAAU;CACd,SAAS;EACR,MAAM,SAAS,QAAQ;EACvB,IAAI,WAAW,KAAK,GAAG,OAAO,KAAK;EACnC,MAAM,UAAU,OAAO,QAAQ,QAAQ,QAAQ,CAAC;EAChD,IAAI,YAAY,KAAK,GAAG,OAAO;EAC/B,UAAU;CACX;AACD;AACA,SAAS,YAAY,OAAO,QAAQ,QAAQ,OAAO;CAClD,IAAI,MAAM,SAAS,SAAS,OAAO,IAAI,YAAY,OAAO,QAAQ,QAAQ,KAAK;CAC/E,OAAO,IAAI,WAAW,OAAO,QAAQ,QAAQ,KAAK;AACnD;AACA,SAAS,iBAAiB,OAAO;CAChC,OAAO,IAAI,WAAW,OAAO,GAAG,KAAK,GAAG,CAAC;AAC1C;;;;;;;;AAUA,SAAS,eAAe,MAAM;CAC7B,MAAM,QAAQ,CAAC;CACf,IAAI,UAAU;CACd,IAAI,uBAAuB;CAC3B,SAAS;EACR,MAAM,UAAU,QAAQ;EACxB,IAAI,EAAE,mBAAmB,cAAc;EACvC,IAAI,QAAQ,SAAS,cAAc;GAClC,UAAU;GACV;EACD;EACA,IAAI,QAAQ,SAAS,WAAW;GAC/B,wBAAwB;GACxB,IAAI,uBAAuB,GAAG;GAC9B,UAAU;GACV;EACD;EACA,IAAI,QAAQ,SAAS,aAAa,QAAQ,KAAK,WAAW,KAAK,GAAG;GACjE,MAAM,KAAK,sBAAsB,QAAQ,IAAI,CAAC;GAC9C,uBAAuB;GACvB,UAAU;GACV;EACD;EACA;CACD;CACA,OAAO,MAAM,WAAW,IAAI,KAAK,IAAI,MAAM,QAAQ,CAAC,CAAC,KAAK,IAAI;AAC/D;AACA,SAAS,sBAAsB,MAAM;CACpC,MAAM,gBAAgB,KAAK,MAAM,CAAC;CAClC,OAAO,cAAc,WAAW,GAAG,IAAI,cAAc,MAAM,CAAC,IAAI;AACjE;AACA,SAAS,eAAe,MAAM,MAAM;CACnC,KAAK,MAAM,SAAS,KAAK,SAAS,GAAG,IAAI,EAAE,iBAAiB,eAAe,MAAM,SAAS,MAAM,OAAO;AACxG;AACA,SAAS,eAAe,MAAM,MAAM;CACnC,KAAK,MAAM,SAAS,KAAK,WAAW,GAAG;EACtC,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI,WAAW,KAAK,GAAG,OAAO;CAC/B;AACD;AACA,UAAU,eAAe,MAAM,MAAM;CACpC,KAAK,MAAM,SAAS,KAAK,WAAW,GAAG;EACtC,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI,WAAW,KAAK,GAAG,MAAM;CAC9B;AACD;AACA,SAAS,IAAI,GAAG,OAAO;CACtB,QAAQ,SAAS;EAChB,KAAK,MAAM,QAAQ,OAAO;GACzB,MAAM,SAAS,KAAK,IAAI;GACxB,IAAI,WAAW,KAAK,GAAG,OAAO;EAC/B;CACD;AACD;;;;;AAKA,SAAS,YAAY,MAAM;CAC1B,IAAI,OAAO;CACX,KAAK,MAAM,SAAS,KAAK,OAAO,GAAG,QAAQ,MAAM;CACjD,OAAO;AACR"}
@@ -1 +0,0 @@
1
- {"version":3,"file":"authoring-so3aBYD8.mjs","names":[],"sources":["../../../../1-framework/1-core/framework-components/dist/authoring.mjs"],"sourcesContent":["import { t as canonicalizeJson } from \"./canonicalize-json-ZPawceQR.mjs\";\nimport { a as dataTypeId } from \"./data-type-CVNHtd6y.mjs\";\nimport { a as readContractValue, r as enumRefusalOf } from \"./codec-descriptor-V2-N5Qmm.mjs\";\nimport { A as isAuthoringModelAttributeDescriptor, C as getAuthoringTypeConstructor, D as isAuthoringArgRef, E as instantiateAuthoringTypeConstructor, F as mergeAuthoringNamespaces, I as resolveAuthoringTemplateValue, L as resolveEnumCodecId, M as isAuthoringSelectRef, N as isAuthoringTypeConstructorDescriptor, O as isAuthoringEntityTypeDescriptor, R as validateAuthoringHelperArguments, S as flushAuthoringWarnings, T as instantiateAuthoringFieldPreset, _ as assertNoCrossRegistryCollisions, a as temporalCodecPreset, d as describeTaggedLiteralFailure, f as printTaggedLiteral, g as tsTaggedTemplateSource, h as resolveTemplateTagEscapes, i as temporalAuthoringPresets, j as isAuthoringPslBlockDescriptor, k as isAuthoringFieldPresetDescriptor, n as TEMPORAL_ON_UPDATE_ARG, o as temporalPhaseTemplate, p as printedTaggedLiteralReadsBack, r as TIMESTAMP_NOW_GENERATOR_ID, s as temporalPhaseTemplateWithParams, t as TEMPORAL_ON_CREATE_ARG, u as canonicalizeTaggedLiteralBody, v as assertResolvableTypeConstructorTemplates, w as instantiateAuthoringEntityType, x as collectScalarTypeConstructors, y as classifyEnumMemberType, z as validateAuthoringTypeParams } from \"./temporal-presets-BcDyr_hK.mjs\";\nimport { InternalError, isInternalError } from \"@internal/utils/internal-error\";\nimport { canonicalStringify } from \"@internal/utils/canonical-stringify\";\nimport { notOk, ok } from \"@internal/utils/result\";\n//#region src/shared/authoring-type-constructor-call.ts\n/** Every type constructor of `namespace`, with its path, in namespace order. */\nfunction* authoringTypeConstructors(namespace, path = []) {\n\tfor (const [name, value] of Object.entries(namespace)) if (isAuthoringTypeConstructorDescriptor(value)) yield {\n\t\tpath: [...path, name],\n\t\tdescriptor: value\n\t};\n\telse yield* authoringTypeConstructors(value, [...path, name]);\n}\nfunction produces(produced, wanted) {\n\tconst wantedFields = {\n\t\t...wanted,\n\t\ttypeParams: wanted.typeParams ?? {}\n\t};\n\treturn Object.entries({\n\t\t...produced,\n\t\ttypeParams: produced.typeParams ?? {}\n\t}).every(([key, value]) => canonicalizeJson(value) === canonicalizeJson(wantedFields[key]));\n}\n/**\n* The arguments that make `descriptor` produce exactly `output`, when each of its type parameters\n* comes straight from one argument; `undefined` when it cannot produce `output`, including when\n* `output` has no value for an argument the constructor requires.\n*/\nfunction authoringTypeConstructorArguments(descriptor, output) {\n\tif (descriptor.entityRefArg !== void 0 || descriptor.output.codecId !== output.codecId) return;\n\tconst args = [];\n\tfor (const [key, template] of Object.entries(descriptor.output.typeParams ?? {})) {\n\t\tconst value = output.typeParams?.[key];\n\t\tif (value !== void 0 && isAuthoringArgRef(template) && template.path === void 0) args[template.index] = value;\n\t}\n\tconst requiredArgs = (descriptor.args ?? []).filter((arg) => arg.optional !== true).length;\n\tif (args.length < requiredArgs || Array.from(args).includes(void 0)) return void 0;\n\ttry {\n\t\treturn produces(instantiateAuthoringTypeConstructor(descriptor, args), output) ? args : void 0;\n\t} catch {\n\t\treturn;\n\t}\n}\n/**\n* The first call, in namespace order, to a type constructor in `namespace` that produces exactly\n* `output`. The inverse of {@link instantiateAuthoringTypeConstructor} for constructors whose type\n* parameters each come straight from one argument. A constructor whose argument names another\n* entity is never chosen. `undefined` when no call produces `output`.\n*/\nfunction findAuthoringTypeConstructorCall(namespace, output) {\n\tfor (const { path, descriptor } of authoringTypeConstructors(namespace)) {\n\t\tconst args = authoringTypeConstructorArguments(descriptor, output);\n\t\tif (args !== void 0) return {\n\t\t\tpath,\n\t\t\targs\n\t\t};\n\t}\n}\n//#endregion\n//#region src/shared/enum-stored-members.ts\n/**\n* Each enum member whose stored form equals an earlier member's, paired with the first such member. Stored forms are compared as `contract.json` holds them, so negative zero is zero, and by `canonicalStringify`, so two objects with the same entries in a different order are equal; or, when the enum's data type declares an `equalityKey`, by that key, so `0.5` and `0.50` are one `numeric` value. Every enum authoring surface refuses the members this returns.\n*/\nfunction duplicateStoredMembers(members, equalityKey) {\n\tconst storedFormOf = (stored) => canonicalStringify(JSON.parse(JSON.stringify(stored)));\n\tconst memberByKey = /* @__PURE__ */ new Map();\n\tconst duplicates = [];\n\tfor (const member of members) {\n\t\tconst { name, stored } = member;\n\t\tconst key = equalityKey?.(stored) ?? storedFormOf(stored);\n\t\tconst earlier = memberByKey.get(key);\n\t\tif (earlier === void 0) memberByKey.set(key, member);\n\t\telse if (storedFormOf(earlier.stored) === storedFormOf(stored)) duplicates.push({\n\t\t\tearlier: earlier.name,\n\t\t\tlater: name,\n\t\t\tstored\n\t\t});\n\t\telse duplicates.push({\n\t\t\tearlier: earlier.name,\n\t\t\tlater: name,\n\t\t\tstored,\n\t\t\tearlierStored: earlier.stored\n\t\t});\n\t}\n\treturn duplicates;\n}\n//#endregion\n//#region src/shared/enum-block-members.ts\n/**\n* A problem with an enum's members as a diagnostic at the member, or at the block when the problem is the enum's codec.\n*/\nfunction enumMemberProblemDiagnostic(problem, site) {\n\tconst { enumName, codecId, sourceId } = site;\n\tconst at = (member) => ({\n\t\tsourceId,\n\t\tspan: site.memberSpans[member] ?? site.span\n\t});\n\tswitch (problem.kind) {\n\t\tcase \"codec-not-for-enums\": return {\n\t\t\tcode: \"PSL_EXTENSION_INVALID_VALUE\",\n\t\t\tmessage: `enum \"${enumName}\" cannot use the codec \"${codecId}\". ${problem.refusal}`,\n\t\t\tsourceId,\n\t\t\tspan: site.span\n\t\t};\n\t\tcase \"codec-missing\": return {\n\t\t\tcode: \"PSL_EXTENSION_INVALID_VALUE\",\n\t\t\tmessage: `enum \"${enumName}\" uses codec \"${codecId}\", which no pack in the contract provides`,\n\t\t\tsourceId,\n\t\t\tspan: site.span\n\t\t};\n\t\tcase \"codec-refused-member\": return {\n\t\t\tcode: \"PSL_EXTENSION_INVALID_VALUE\",\n\t\t\tmessage: `enum \"${enumName}\" member \"${problem.member}\" was rejected by codec \"${codecId}\": ${problem.reason}`,\n\t\t\t...at(problem.member)\n\t\t};\n\t\tcase \"member-not-stored-as-written\": return {\n\t\t\tcode: \"PSL_EXTENSION_INVALID_VALUE\",\n\t\t\tmessage: `enum \"${enumName}\" member \"${problem.member}\" is written ${problem.written}, but its codec stores ${JSON.stringify(problem.stored)}. Write the member as ${problem.writeAs}.`,\n\t\t\t...at(problem.member)\n\t\t};\n\t\tcase \"duplicate-member-value\": return {\n\t\t\tcode: \"PSL_ENUM_DUPLICATE_MEMBER_VALUE\",\n\t\t\tmessage: problem.earlierStored === void 0 ? `enum \"${enumName}\": members \"${problem.earlier}\" and \"${problem.later}\" both store ${JSON.stringify(problem.stored)}` : `enum \"${enumName}\": members \"${problem.earlier}\" and \"${problem.later}\" store ${JSON.stringify(problem.earlierStored)} and ${JSON.stringify(problem.stored)}, which the database holds equal`,\n\t\t\t...at(problem.later)\n\t\t};\n\t}\n}\n/**\n* Reads the members of an `enum` block through its codec. When the family gives a reader for written values (`ctx.readWrittenValueForCodec`), each member is read as a column default is read: its syntax gives it a data type, the codec's data type takes it directly or through a cast, and the codec checks it, so a number keeps every digit and a quoted value is text. A bare member is read from its own name, as text. Without that reader, a member is read as JSON by the codec's data type and then the codec.\n* Pushes a diagnostic and returns `undefined` when a member is refused, when two members\n* store the same value, or when the block has no members. Shared by every family's enum factory.\n*/\nfunction readEnumBlockMembers(block, codecId, codec, ctx) {\n\tconst sourceId = ctx.sourceId ?? \"unknown\";\n\tconst diagnostics = ctx.diagnostics;\n\tconst site = {\n\t\tenumName: block.name,\n\t\tcodecId,\n\t\tsourceId,\n\t\tspan: block.span,\n\t\tmemberSpans: block.parameterSpans\n\t};\n\tconst members = [];\n\tconst storedMembers = [];\n\tlet memberError = false;\n\tfor (const [memberName, memberValue] of Object.entries(block.values)) {\n\t\tconst span = block.parameterSpans[memberName] ?? block.span;\n\t\tconst bareMemberRefused = () => ({\n\t\t\tcode: \"PSL_ENUM_BARE_MEMBER_NON_STRING_CODEC\",\n\t\t\tmessage: `enum \"${block.name}\" member \"${memberName}\" has no value and codec \"${codecId}\" does not accept a bare name as input`,\n\t\t\tsourceId,\n\t\t\tspan\n\t\t});\n\t\tconst written = block.writtenValues?.[memberName] ?? (memberValue === void 0 ? {\n\t\t\tkind: \"string\",\n\t\t\ttext: memberName\n\t\t} : void 0);\n\t\tconst reading = written === void 0 ? void 0 : ctx.readWrittenValueForCodec?.({\n\t\t\twritten,\n\t\t\tcodecId,\n\t\t\tsubject: `enum \"${block.name}\" member \"${memberName}\"`\n\t\t});\n\t\tif (reading !== void 0 && !reading.ok) {\n\t\t\tdiagnostics?.push(memberValue === void 0 ? bareMemberRefused() : {\n\t\t\t\tcode: reading.code,\n\t\t\t\tmessage: reading.message,\n\t\t\t\tsourceId,\n\t\t\t\tspan\n\t\t\t});\n\t\t\tmemberError = true;\n\t\t\tcontinue;\n\t\t}\n\t\tconst stored = reading?.ok ? reading.value : memberValue === void 0 ? memberName : memberValue;\n\t\tlet read;\n\t\ttry {\n\t\t\tread = readContractValue(codec, stored, void 0);\n\t\t} catch (err) {\n\t\t\tif (isInternalError(err)) throw err;\n\t\t\tdiagnostics?.push(memberValue === void 0 ? bareMemberRefused() : {\n\t\t\t\tcode: \"PSL_EXTENSION_INVALID_VALUE\",\n\t\t\t\tmessage: `enum \"${block.name}\" member \"${memberName}\" was rejected by codec \"${codecId}\": ${err instanceof Error ? err.message : String(err)}`,\n\t\t\t\tsourceId,\n\t\t\t\tspan\n\t\t\t});\n\t\t\tmemberError = true;\n\t\t\tcontinue;\n\t\t}\n\t\tmembers.push({\n\t\t\tname: memberName,\n\t\t\tvalue: read\n\t\t});\n\t\tstoredMembers.push({\n\t\t\tname: memberName,\n\t\t\tstored: codec.dataType.toContract(codec.toDataTypeValue(read))\n\t\t});\n\t}\n\tfor (const duplicate of duplicateStoredMembers(storedMembers, codec.dataType.equalityKey)) {\n\t\tdiagnostics?.push(enumMemberProblemDiagnostic({\n\t\t\tkind: \"duplicate-member-value\",\n\t\t\t...duplicate\n\t\t}, site));\n\t\tmemberError = true;\n\t}\n\tif (memberError) return void 0;\n\tif (members.length === 0) {\n\t\tdiagnostics?.push({\n\t\t\tcode: \"PSL_ENUM_MISSING_TYPE\",\n\t\t\tmessage: `enum \"${block.name}\" must have at least one member`,\n\t\t\tsourceId,\n\t\t\tspan: block.span\n\t\t});\n\t\treturn;\n\t}\n\treturn members;\n}\n//#endregion\n//#region src/shared/enum-members.ts\n/** Whether TypeScript gives the value a literal type: a primitive, or an array or plain object of them. */\nfunction hasLiteralType(value) {\n\tif ([\n\t\t\"string\",\n\t\t\"number\",\n\t\t\"boolean\",\n\t\t\"bigint\"\n\t].includes(typeof value)) return true;\n\tif (Array.isArray(value)) return value.every(hasLiteralType);\n\tif (typeof value !== \"object\" || value === null) return false;\n\tconst prototype = Object.getPrototypeOf(value);\n\treturn (prototype === Object.prototype || prototype === null) && Object.values(value).every(hasLiteralType);\n}\n/**\n* A member's value in the form its codec stores it, and that form read back by the codec. A codec that throws on either is a refusal naming the member; an internal error is not the member's fault and propagates.\n*/\nfunction encodeEnumMember(member, codec) {\n\ttry {\n\t\tconst stored = codec.dataType.toContract(codec.toDataTypeValue(member.value));\n\t\treturn ok({\n\t\t\tstored,\n\t\t\treadBack: readContractValue(codec, stored, void 0)\n\t\t});\n\t} catch (cause) {\n\t\tif (isInternalError(cause)) throw cause;\n\t\treturn notOk({\n\t\t\tkind: \"codec-refused-member\",\n\t\t\tmember: member.name,\n\t\t\treason: cause instanceof Error ? cause.message : String(cause),\n\t\t\tcause\n\t\t});\n\t}\n}\n/**\n* Refuses a member its codec reads back as a different value from the one written. A member with no literal type has nothing to compare.\n*/\nfunction notStoredAsWritten(member, stored, readBack) {\n\tif (!hasLiteralType(member.value)) return void 0;\n\tif (hasLiteralType(readBack) && canonicalStringify(readBack) === canonicalStringify(member.value)) return void 0;\n\treturn {\n\t\tkind: \"member-not-stored-as-written\",\n\t\tmember: member.name,\n\t\twritten: canonicalStringify(member.value),\n\t\tstored,\n\t\twriteAs: hasLiteralType(readBack) ? canonicalStringify(readBack) : JSON.stringify(stored)\n\t};\n}\n/**\n* Each member of an enum in the form its codec stores it. Refuses a codec an enum cannot use, a codec the lookup does not have, a member the codec refuses, a member the codec reads back as another value, and two members stored as the same value. Every family's contract build calls this, and reports the problems in its own terms.\n*/\nfunction encodeEnumMembers(decodedEnum, codecLookup) {\n\tconst descriptor = codecLookup.descriptorFor(decodedEnum.codecId);\n\tconst refusal = descriptor === void 0 ? void 0 : enumRefusalOf(descriptor);\n\tif (refusal !== void 0) return notOk([{\n\t\tkind: \"codec-not-for-enums\",\n\t\trefusal\n\t}]);\n\tconst codec = codecLookup.get(decodedEnum.codecId);\n\tif (codec === void 0) return notOk([{ kind: \"codec-missing\" }]);\n\tconst problems = [];\n\tconst members = [];\n\tfor (const member of decodedEnum.enumMembers) {\n\t\tconst encoded = encodeEnumMember(member, codec);\n\t\tif (!encoded.ok) {\n\t\t\tproblems.push(encoded.failure);\n\t\t\tcontinue;\n\t\t}\n\t\tconst { stored, readBack } = encoded.value;\n\t\tconst mismatch = notStoredAsWritten(member, stored, readBack);\n\t\tif (mismatch !== void 0) problems.push(mismatch);\n\t\tmembers.push({\n\t\t\tname: member.name,\n\t\t\tvalue: stored\n\t\t});\n\t}\n\tfor (const duplicate of duplicateStoredMembers(members.map(({ name, value }) => ({\n\t\tname,\n\t\tstored: value\n\t})), codec.dataType.equalityKey)) problems.push({\n\t\tkind: \"duplicate-member-value\",\n\t\t...duplicate\n\t});\n\treturn problems.length > 0 ? notOk(problems) : ok(members);\n}\n//#endregion\n//#region src/shared/field-preset-resolution.ts\nfunction presetSpellingsUnder(members, prefix) {\n\treturn Object.entries(members).flatMap(([name, member]) => isAuthoringFieldPresetDescriptor(member) ? [`${prefix}.${name}(${(member.args ?? []).map((arg, index) => arg.name ?? `argument${index + 1}`).join(\", \")})`] : presetSpellingsUnder(member, `${prefix}.${name}`));\n}\n/**\n* How each field preset registered under `namespace`, at any depth, is written, with the names of its arguments: `temporal.timestamp(onCreate, onUpdate)`.\n*/\nfunction fieldPresetSpellings(contributions, namespace) {\n\tconst members = contributions?.field?.[namespace];\n\tif (members === void 0 || isAuthoringFieldPresetDescriptor(members)) return [];\n\treturn presetSpellingsUnder(members, namespace);\n}\n/**\n* Walks `authoringContributions.field` segment by segment and returns the field-preset descriptor at the path, or `undefined` when none is registered there.\n*/\nfunction getAuthoringFieldPreset(contributions, path) {\n\tlet current = contributions?.field;\n\tfor (const segment of path) {\n\t\tif (typeof current !== \"object\" || current === null || \"kind\" in current) return;\n\t\tcurrent = current[segment];\n\t}\n\treturn current !== void 0 && isAuthoringFieldPresetDescriptor(current) ? current : void 0;\n}\n//#endregion\n//#region src/shared/written-value.ts\n/**\n* Words a refusal of the cast rule. The message leads with what to write; the types are named only when the value has a form the position admits and its type is still refused, such as a number too large for the receiving type.\n*/\nfunction describeRefusal(refusal, support, guidance) {\n\tswitch (refusal.kind) {\n\t\tcase \"unknown-tag\": return {\n\t\t\tcode: \"PSL_UNKNOWN_LITERAL_TAG\",\n\t\t\tmessage: `Unknown literal tag \"${refusal.tag}\". Known tags: ${refusal.known.join(\", \")}.`\n\t\t};\n\t\tcase \"unwritable\": return {\n\t\t\tcode: \"PSL_VALUE_TYPE_INCOMPATIBLE\",\n\t\t\tmessage: `${describeExpected(guidance.forms)}; this target has no data type for a ${refusal.syntax} value`\n\t\t};\n\t\tcase \"unreadable\":\n\t\tcase \"refused-by-type\": return {\n\t\t\tcode: \"PSL_INVALID_LITERAL\",\n\t\t\tmessage: refusal.message\n\t\t};\n\t\tcase \"no-cast\": return {\n\t\t\tcode: \"PSL_VALUE_TYPE_INCOMPATIBLE\",\n\t\t\tmessage: describeRefusedValueType(refusal, support, guidance)\n\t\t};\n\t}\n}\n/** `Expected <forms>`, the forms joined with `or`: the start of every refusal that says what to write. */\nfunction describeExpected(forms) {\n\treturn `Expected ${joinForms(forms)}`;\n}\n/**\n* Words a value of type `valueType` that `receivingType` refuses, where `guidance.forms` may be written. The types are named only when the value has one of those forms.\n*/\nfunction describeRefusedValueType(refused, support, guidance) {\n\tconst expected = describeExpected(guidance.forms);\n\tconst valueForm = writtenForm(support, refused.valueType);\n\tif (valueForm !== void 0 && guidance.forms.some((form) => isSameForm(form, valueForm))) return `${expected} that ${refused.receivingType} can hold; got ${refused.valueType}`;\n\treturn guidance.rewrite === void 0 ? expected : `${expected}; write ${guidance.rewrite}`;\n}\nfunction isSameForm(a, b) {\n\treturn a.kind === \"tag\" && b.kind === \"tag\" ? a.tag === b.tag : a.kind === b.kind;\n}\n/** Text a contract source reads as a number literal. */\nconst NUMBER_TEXT = /^[+-]?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:[eE][+-]?\\d+)?$|^[+-]?(?:NaN|Infinity)$/;\n/**\n* The literal to write in place of a quoted string that `receivingType` refuses under `receivingParams`: the string as a literal of the first tag the type admits, or else the string's text unquoted, as a number or a boolean. `undefined` when the value is not a quoted string, no such literal reads back as the same text, or the type would refuse each of them too.\n*/\nfunction exactRewrite(support, receiving, written) {\n\tif (written.kind !== \"string\") return void 0;\n\tconst admits = (candidate) => {\n\t\tconst read = readWrittenValue(support, candidate);\n\t\treturn read.ok && castTypedValue(support, receiving.receivingType, receiving.receivingParams, read.value).ok;\n\t};\n\tconst [tag] = admittedTags(support, receiving.receivingType);\n\tif (tag !== void 0 && printedTaggedLiteralReadsBack(written.text) && admits({\n\t\tkind: \"tag\",\n\t\ttag,\n\t\ttext: written.text\n\t})) return printTaggedLiteral(tag, written.text);\n\tif (NUMBER_TEXT.test(written.text) && admits({\n\t\tkind: \"number\",\n\t\ttext: written.text\n\t})) return written.text;\n\tif ((written.text === \"true\" || written.text === \"false\") && admits({\n\t\tkind: \"boolean\",\n\t\tvalue: written.text === \"true\"\n\t})) return written.text;\n}\nfunction findEntry(support, matches) {\n\tfor (const [key, entry] of Object.entries(support.entries)) if (matches(entry)) return {\n\t\tkey,\n\t\tentry\n\t};\n}\n/** The entry a tag names, or `undefined` when no pack registered that tag. */\nfunction entryForTag(support, tag) {\n\treturn findEntry(support, ({ written }) => written.kind === \"tag\" && written.tag === tag);\n}\n/** The entry that reads a plain string, boolean or number, or `undefined` when none does. */\nfunction entryForPlain(support, syntax) {\n\treturn findEntry(support, ({ written }) => written.kind === \"plain\" && written.syntax === syntax);\n}\n/** Every tag a stack registers, in the order the entries were merged. */\nfunction knownTags(support) {\n\treturn Object.values(support.entries).flatMap((entry) => entry.written.kind === \"tag\" ? [entry.written.tag] : []);\n}\nfunction textOf(written) {\n\treturn written.kind === \"boolean\" ? String(written.value) : written.text;\n}\nfunction messageOf(error) {\n\treturn error instanceof Error ? error.message : String(error);\n}\n/** The value of `type` that `json` gives under `params`, constructed by that type; a refusal is worded for a diagnostic. */\nfunction valueOfType(support, type, json, params, refuse) {\n\tconst declaration = support.lookup.get(type);\n\tif (declaration === void 0) throw new InternalError(`A value of \"${type}\" was written, and this stack does not register it.`);\n\ttry {\n\t\treturn ok(declaration.valueFrom(json(), params));\n\t} catch (error) {\n\t\tif (isInternalError(error)) throw error;\n\t\treturn notOk(refuse(messageOf(error)));\n\t}\n}\n/** Read one written value through the authoring entry for its syntax, as a value its type constructs. */\nfunction readWrittenValue(support, written) {\n\tconst found = written.kind === \"tag\" ? entryForTag(support, written.tag) : entryForPlain(support, written.kind);\n\tif (found === void 0) return written.kind === \"tag\" ? notOk({\n\t\tkind: \"unknown-tag\",\n\t\ttag: written.tag,\n\t\tknown: knownTags(support)\n\t}) : notOk({\n\t\tkind: \"unwritable\",\n\t\tsyntax: written.kind\n\t});\n\tconst text = textOf(written);\n\tconst form = found.entry.written;\n\tconst unreadable = (message) => ({\n\t\tkind: \"unreadable\",\n\t\tmessage\n\t});\n\tif (form.kind === \"plain\" && form.syntax === \"number\") {\n\t\tconst classified = form.classify(text);\n\t\treturn classified === void 0 ? notOk(unreadable(`no data type of this target holds the number ${text}`)) : valueOfType(support, classified.type, () => classified.value, {}, unreadable);\n\t}\n\treturn valueOfType(support, dataTypeId(found.key), () => form.parse(text), {}, unreadable);\n}\n/** Take a value into the receiving type, directly or through the cast that type declares; the receiving type constructs the result under `receivingParams`, the parameters of the position that receives it. */\nfunction castTypedValue(support, receivingType, receivingParams, value) {\n\tconst refusedByType = (message) => ({\n\t\tkind: \"refused-by-type\",\n\t\treceivingType,\n\t\tmessage\n\t});\n\tif (value.type === receivingType) return valueOfType(support, receivingType, () => value.value, receivingParams, refusedByType);\n\tconst declaration = support.lookup.get(receivingType);\n\tconst cast = declaration?.casts[value.type];\n\tif (cast === void 0) return notOk({\n\t\tkind: \"no-cast\",\n\t\treceivingType,\n\t\treceivingParams,\n\t\tvalueType: value.type,\n\t\tcasts: Object.keys(declaration?.casts ?? {})\n\t});\n\tconst source = support.lookup.get(value.type);\n\tif (source === void 0) throw new InternalError(`A value of \"${value.type}\" was cast, and this stack does not register it.`);\n\tlet json;\n\ttry {\n\t\tjson = cast(source.toContract(value));\n\t} catch (error) {\n\t\tif (isInternalError(error)) throw error;\n\t\treturn notOk({\n\t\t\tkind: \"unreadable\",\n\t\t\tmessage: messageOf(error)\n\t\t});\n\t}\n\treturn valueOfType(support, receivingType, () => json, receivingParams, refusedByType);\n}\n/** The type itself, then each type it casts from, in key order. */\nfunction admittedTypes(support, dataType) {\n\treturn [dataType, ...Object.keys(support.lookup.get(dataType)?.casts ?? {})];\n}\n/** The tags a position of `dataType` admits: its own tag, then the tags of the types it casts from. */\nfunction admittedTags(support, dataType) {\n\tconst tags = admittedTypes(support, dataType).flatMap((type) => {\n\t\tconst written = support.entries[type]?.written;\n\t\treturn written?.kind === \"tag\" ? [written.tag] : [];\n\t});\n\treturn [...new Set(tags)];\n}\n/** The form a value of a tagged literal's type is written in. */\nfunction tagForm(tag) {\n\treturn {\n\t\tkind: \"tag\",\n\t\ttag,\n\t\tphrase: `${tag}\\`...\\``\n\t};\n}\nconst PLAIN_PHRASES = {\n\tstring: \"a quoted string\",\n\tboolean: \"true or false\",\n\tnumber: \"a number\"\n};\nfunction writtenForm(support, type) {\n\tconst written = support.entries[type]?.written;\n\tif (written?.kind === \"tag\") return tagForm(written.tag);\n\tif (written?.kind === \"plain\" && written.syntax !== \"number\") return {\n\t\tkind: written.syntax,\n\t\tphrase: PLAIN_PHRASES[written.syntax]\n\t};\n\treturn Object.entries(support.entries).some(([key, entry]) => entry.written.kind === \"plain\" && entry.written.syntax === \"number\" && (key === type || entry.written.types.some((listed) => listed === type))) ? {\n\t\tkind: \"number\",\n\t\tphrase: PLAIN_PHRASES.number\n\t} : void 0;\n}\n/** What {@link describeAdmittedForms} returns for a type that nothing writes. */\nconst NO_WRITTEN_FORM = \"no written form\";\n/** Each form a position receiving every one of `receivingTypes` admits, once, in order: ``sql`...` ``, `true or false`. */\nfunction admittedForms(support, receivingTypes) {\n\tconst forms = [];\n\tfor (const type of receivingTypes.flatMap((receiving) => admittedTypes(support, receiving))) {\n\t\tconst form = writtenForm(support, type);\n\t\tif (form !== void 0 && !forms.some((listed) => isSameForm(listed, form))) forms.push(form);\n\t}\n\treturn forms;\n}\nfunction joinForms(forms) {\n\treturn forms.length === 0 ? NO_WRITTEN_FORM : forms.map((form) => form.phrase).join(\" or \");\n}\n/** How a position of `dataType` can be written, for a diagnostic: ``sql`...` ``, `true or false`. */\nfunction describeAdmittedForms(support, dataType) {\n\treturn joinForms(admittedForms(support, [dataType]));\n}\n//#endregion\nexport { TEMPORAL_ON_CREATE_ARG, TEMPORAL_ON_UPDATE_ARG, TIMESTAMP_NOW_GENERATOR_ID, admittedForms, admittedTags, assertNoCrossRegistryCollisions, assertResolvableTypeConstructorTemplates, authoringTypeConstructorArguments, authoringTypeConstructors, canonicalizeTaggedLiteralBody, castTypedValue, classifyEnumMemberType, collectScalarTypeConstructors, describeAdmittedForms, describeExpected, describeRefusal, describeRefusedValueType, describeTaggedLiteralFailure, duplicateStoredMembers, encodeEnumMembers, entryForPlain, entryForTag, enumMemberProblemDiagnostic, exactRewrite, fieldPresetSpellings, findAuthoringTypeConstructorCall, flushAuthoringWarnings, getAuthoringFieldPreset, getAuthoringTypeConstructor, instantiateAuthoringEntityType, instantiateAuthoringFieldPreset, instantiateAuthoringTypeConstructor, isAuthoringArgRef, isAuthoringEntityTypeDescriptor, isAuthoringFieldPresetDescriptor, isAuthoringModelAttributeDescriptor, isAuthoringPslBlockDescriptor, isAuthoringSelectRef, isAuthoringTypeConstructorDescriptor, knownTags, mergeAuthoringNamespaces, printTaggedLiteral, printedTaggedLiteralReadsBack, readEnumBlockMembers, readWrittenValue, resolveAuthoringTemplateValue, resolveEnumCodecId, resolveTemplateTagEscapes, tagForm, temporalAuthoringPresets, temporalCodecPreset, temporalPhaseTemplate, temporalPhaseTemplateWithParams, tsTaggedTemplateSource, validateAuthoringHelperArguments, validateAuthoringTypeParams };\n\n//# sourceMappingURL=authoring.mjs.map"],"mappings":";;;;;;;;;AASA,UAAU,0BAA0B,WAAW,OAAO,CAAC,GAAG;CACzD,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,SAAS,GAAG,IAAI,qCAAqC,KAAK,GAAG,MAAM;EAC7G,MAAM,CAAC,GAAG,MAAM,IAAI;EACpB,YAAY;CACb;MACK,OAAO,0BAA0B,OAAO,CAAC,GAAG,MAAM,IAAI,CAAC;AAC7D;AACA,SAAS,SAAS,UAAU,QAAQ;CACnC,MAAM,eAAe;EACpB,GAAG;EACH,YAAY,OAAO,cAAc,CAAC;CACnC;CACA,OAAO,OAAO,QAAQ;EACrB,GAAG;EACH,YAAY,SAAS,cAAc,CAAC;CACrC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,WAAW,iBAAiB,KAAK,MAAM,iBAAiB,aAAa,IAAI,CAAC;AAC3F;;;;;;AAMA,SAAS,kCAAkC,YAAY,QAAQ;CAC9D,IAAI,WAAW,iBAAiB,KAAK,KAAK,WAAW,OAAO,YAAY,OAAO,SAAS;CACxF,MAAM,OAAO,CAAC;CACd,KAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,WAAW,OAAO,cAAc,CAAC,CAAC,GAAG;EACjF,MAAM,QAAQ,OAAO,aAAa;EAClC,IAAI,UAAU,KAAK,KAAK,kBAAkB,QAAQ,KAAK,SAAS,SAAS,KAAK,GAAG,KAAK,SAAS,SAAS;CACzG;CACA,MAAM,gBAAgB,WAAW,QAAQ,CAAC,EAAA,CAAG,QAAQ,QAAQ,IAAI,aAAa,IAAI,CAAC,CAAC;CACpF,IAAI,KAAK,SAAS,gBAAgB,MAAM,KAAK,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,GAAG,OAAO,KAAK;CACjF,IAAI;EACH,OAAO,SAAS,oCAAoC,YAAY,IAAI,GAAG,MAAM,IAAI,OAAO,KAAK;CAC9F,QAAQ;EACP;CACD;AACD;;;;;;;AAOA,SAAS,iCAAiC,WAAW,QAAQ;CAC5D,KAAK,MAAM,EAAE,MAAM,gBAAgB,0BAA0B,SAAS,GAAG;EACxE,MAAM,OAAO,kCAAkC,YAAY,MAAM;EACjE,IAAI,SAAS,KAAK,GAAG,OAAO;GAC3B;GACA;EACD;CACD;AACD;;;;AAMA,SAAS,uBAAuB,SAAS,aAAa;CACrD,MAAM,gBAAgB,WAAW,mBAAmB,KAAK,MAAM,KAAK,UAAU,MAAM,CAAC,CAAC;CACtF,MAAM,8BAA8B,IAAI,IAAI;CAC5C,MAAM,aAAa,CAAC;CACpB,KAAK,MAAM,UAAU,SAAS;EAC7B,MAAM,EAAE,MAAM,WAAW;EACzB,MAAM,MAAM,cAAc,MAAM,KAAK,aAAa,MAAM;EACxD,MAAM,UAAU,YAAY,IAAI,GAAG;EACnC,IAAI,YAAY,KAAK,GAAG,YAAY,IAAI,KAAK,MAAM;OAC9C,IAAI,aAAa,QAAQ,MAAM,MAAM,aAAa,MAAM,GAAG,WAAW,KAAK;GAC/E,SAAS,QAAQ;GACjB,OAAO;GACP;EACD,CAAC;OACI,WAAW,KAAK;GACpB,SAAS,QAAQ;GACjB,OAAO;GACP;GACA,eAAe,QAAQ;EACxB,CAAC;CACF;CACA,OAAO;AACR;;;;AAMA,SAAS,4BAA4B,SAAS,MAAM;CACnD,MAAM,EAAE,UAAU,SAAS,aAAa;CACxC,MAAM,MAAM,YAAY;EACvB;EACA,MAAM,KAAK,YAAY,WAAW,KAAK;CACxC;CACA,QAAQ,QAAQ,MAAhB;EACC,KAAK,uBAAuB,OAAO;GAClC,MAAM;GACN,SAAS,SAAS,SAAS,0BAA0B,QAAQ,KAAK,QAAQ;GAC1E;GACA,MAAM,KAAK;EACZ;EACA,KAAK,iBAAiB,OAAO;GAC5B,MAAM;GACN,SAAS,SAAS,SAAS,gBAAgB,QAAQ;GACnD;GACA,MAAM,KAAK;EACZ;EACA,KAAK,wBAAwB,OAAO;GACnC,MAAM;GACN,SAAS,SAAS,SAAS,YAAY,QAAQ,OAAO,2BAA2B,QAAQ,KAAK,QAAQ;GACtG,GAAG,GAAG,QAAQ,MAAM;EACrB;EACA,KAAK,gCAAgC,OAAO;GAC3C,MAAM;GACN,SAAS,SAAS,SAAS,YAAY,QAAQ,OAAO,eAAe,QAAQ,QAAQ,yBAAyB,KAAK,UAAU,QAAQ,MAAM,EAAE,wBAAwB,QAAQ,QAAQ;GACrL,GAAG,GAAG,QAAQ,MAAM;EACrB;EACA,KAAK,0BAA0B,OAAO;GACrC,MAAM;GACN,SAAS,QAAQ,kBAAkB,KAAK,IAAI,SAAS,SAAS,cAAc,QAAQ,QAAQ,SAAS,QAAQ,MAAM,eAAe,KAAK,UAAU,QAAQ,MAAM,MAAM,SAAS,SAAS,cAAc,QAAQ,QAAQ,SAAS,QAAQ,MAAM,UAAU,KAAK,UAAU,QAAQ,aAAa,EAAE,OAAO,KAAK,UAAU,QAAQ,MAAM,EAAE;GAClU,GAAG,GAAG,QAAQ,KAAK;EACpB;CACD;AACD;;;;;;AAMA,SAAS,qBAAqB,OAAO,SAAS,OAAO,KAAK;CACzD,MAAM,WAAW,IAAI,YAAY;CACjC,MAAM,cAAc,IAAI;CACxB,MAAM,OAAO;EACZ,UAAU,MAAM;EAChB;EACA;EACA,MAAM,MAAM;EACZ,aAAa,MAAM;CACpB;CACA,MAAM,UAAU,CAAC;CACjB,MAAM,gBAAgB,CAAC;CACvB,IAAI,cAAc;CAClB,KAAK,MAAM,CAAC,YAAY,gBAAgB,OAAO,QAAQ,MAAM,MAAM,GAAG;EACrE,MAAM,OAAO,MAAM,eAAe,eAAe,MAAM;EACvD,MAAM,2BAA2B;GAChC,MAAM;GACN,SAAS,SAAS,MAAM,KAAK,YAAY,WAAW,4BAA4B,QAAQ;GACxF;GACA;EACD;EACA,MAAM,UAAU,MAAM,gBAAgB,gBAAgB,gBAAgB,KAAK,IAAI;GAC9E,MAAM;GACN,MAAM;EACP,IAAI,KAAK;EACT,MAAM,UAAU,YAAY,KAAK,IAAI,KAAK,IAAI,IAAI,2BAA2B;GAC5E;GACA;GACA,SAAS,SAAS,MAAM,KAAK,YAAY,WAAW;EACrD,CAAC;EACD,IAAI,YAAY,KAAK,KAAK,CAAC,QAAQ,IAAI;GACtC,aAAa,KAAK,gBAAgB,KAAK,IAAI,kBAAkB,IAAI;IAChE,MAAM,QAAQ;IACd,SAAS,QAAQ;IACjB;IACA;GACD,CAAC;GACD,cAAc;GACd;EACD;EACA,MAAM,SAAS,SAAS,KAAK,QAAQ,QAAQ,gBAAgB,KAAK,IAAI,aAAa;EACnF,IAAI;EACJ,IAAI;GACH,OAAO,kBAAkB,OAAO,QAAQ,KAAK,CAAC;EAC/C,SAAS,KAAK;GACb,IAAI,gBAAgB,GAAG,GAAG,MAAM;GAChC,aAAa,KAAK,gBAAgB,KAAK,IAAI,kBAAkB,IAAI;IAChE,MAAM;IACN,SAAS,SAAS,MAAM,KAAK,YAAY,WAAW,2BAA2B,QAAQ,KAAK,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;IAC3I;IACA;GACD,CAAC;GACD,cAAc;GACd;EACD;EACA,QAAQ,KAAK;GACZ,MAAM;GACN,OAAO;EACR,CAAC;EACD,cAAc,KAAK;GAClB,MAAM;GACN,QAAQ,MAAM,SAAS,WAAW,MAAM,gBAAgB,IAAI,CAAC;EAC9D,CAAC;CACF;CACA,KAAK,MAAM,aAAa,uBAAuB,eAAe,MAAM,SAAS,WAAW,GAAG;EAC1F,aAAa,KAAK,4BAA4B;GAC7C,MAAM;GACN,GAAG;EACJ,GAAG,IAAI,CAAC;EACR,cAAc;CACf;CACA,IAAI,aAAa,OAAO,KAAK;CAC7B,IAAI,QAAQ,WAAW,GAAG;EACzB,aAAa,KAAK;GACjB,MAAM;GACN,SAAS,SAAS,MAAM,KAAK;GAC7B;GACA,MAAM,MAAM;EACb,CAAC;EACD;CACD;CACA,OAAO;AACR;;AAIA,SAAS,eAAe,OAAO;CAC9B,IAAI;EACH;EACA;EACA;EACA;CACD,CAAC,CAAC,SAAS,OAAO,KAAK,GAAG,OAAO;CACjC,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,MAAM,cAAc;CAC3D,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,MAAM,YAAY,OAAO,eAAe,KAAK;CAC7C,QAAQ,cAAc,OAAO,aAAa,cAAc,SAAS,OAAO,OAAO,KAAK,CAAC,CAAC,MAAM,cAAc;AAC3G;;;;AAIA,SAAS,iBAAiB,QAAQ,OAAO;CACxC,IAAI;EACH,MAAM,SAAS,MAAM,SAAS,WAAW,MAAM,gBAAgB,OAAO,KAAK,CAAC;EAC5E,OAAO,GAAG;GACT;GACA,UAAU,kBAAkB,OAAO,QAAQ,KAAK,CAAC;EAClD,CAAC;CACF,SAAS,OAAO;EACf,IAAI,gBAAgB,KAAK,GAAG,MAAM;EAClC,OAAO,MAAM;GACZ,MAAM;GACN,QAAQ,OAAO;GACf,QAAQ,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;GAC7D;EACD,CAAC;CACF;AACD;;;;AAIA,SAAS,mBAAmB,QAAQ,QAAQ,UAAU;CACrD,IAAI,CAAC,eAAe,OAAO,KAAK,GAAG,OAAO,KAAK;CAC/C,IAAI,eAAe,QAAQ,KAAK,mBAAmB,QAAQ,MAAM,mBAAmB,OAAO,KAAK,GAAG,OAAO,KAAK;CAC/G,OAAO;EACN,MAAM;EACN,QAAQ,OAAO;EACf,SAAS,mBAAmB,OAAO,KAAK;EACxC;EACA,SAAS,eAAe,QAAQ,IAAI,mBAAmB,QAAQ,IAAI,KAAK,UAAU,MAAM;CACzF;AACD;;;;AAIA,SAAS,kBAAkB,aAAa,aAAa;CACpD,MAAM,aAAa,YAAY,cAAc,YAAY,OAAO;CAChE,MAAM,UAAU,eAAe,KAAK,IAAI,KAAK,IAAI,cAAc,UAAU;CACzE,IAAI,YAAY,KAAK,GAAG,OAAO,MAAM,CAAC;EACrC,MAAM;EACN;CACD,CAAC,CAAC;CACF,MAAM,QAAQ,YAAY,IAAI,YAAY,OAAO;CACjD,IAAI,UAAU,KAAK,GAAG,OAAO,MAAM,CAAC,EAAE,MAAM,gBAAgB,CAAC,CAAC;CAC9D,MAAM,WAAW,CAAC;CAClB,MAAM,UAAU,CAAC;CACjB,KAAK,MAAM,UAAU,YAAY,aAAa;EAC7C,MAAM,UAAU,iBAAiB,QAAQ,KAAK;EAC9C,IAAI,CAAC,QAAQ,IAAI;GAChB,SAAS,KAAK,QAAQ,OAAO;GAC7B;EACD;EACA,MAAM,EAAE,QAAQ,aAAa,QAAQ;EACrC,MAAM,WAAW,mBAAmB,QAAQ,QAAQ,QAAQ;EAC5D,IAAI,aAAa,KAAK,GAAG,SAAS,KAAK,QAAQ;EAC/C,QAAQ,KAAK;GACZ,MAAM,OAAO;GACb,OAAO;EACR,CAAC;CACF;CACA,KAAK,MAAM,aAAa,uBAAuB,QAAQ,KAAK,EAAE,MAAM,aAAa;EAChF;EACA,QAAQ;CACT,EAAE,GAAG,MAAM,SAAS,WAAW,GAAG,SAAS,KAAK;EAC/C,MAAM;EACN,GAAG;CACJ,CAAC;CACD,OAAO,SAAS,SAAS,IAAI,MAAM,QAAQ,IAAI,GAAG,OAAO;AAC1D;AAGA,SAAS,qBAAqB,SAAS,QAAQ;CAC9C,OAAO,OAAO,QAAQ,OAAO,CAAC,CAAC,SAAS,CAAC,MAAM,YAAY,iCAAiC,MAAM,IAAI,CAAC,GAAG,OAAO,GAAG,KAAK,IAAI,OAAO,QAAQ,CAAC,EAAA,CAAG,KAAK,KAAK,UAAU,IAAI,QAAQ,WAAW,QAAQ,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,EAAE,IAAI,qBAAqB,QAAQ,GAAG,OAAO,GAAG,MAAM,CAAC;AAC3Q;;;;AAIA,SAAS,qBAAqB,eAAe,WAAW;CACvD,MAAM,UAAU,eAAe,QAAQ;CACvC,IAAI,YAAY,KAAK,KAAK,iCAAiC,OAAO,GAAG,OAAO,CAAC;CAC7E,OAAO,qBAAqB,SAAS,SAAS;AAC/C;;;;AAIA,SAAS,wBAAwB,eAAe,MAAM;CACrD,IAAI,UAAU,eAAe;CAC7B,KAAK,MAAM,WAAW,MAAM;EAC3B,IAAI,OAAO,YAAY,YAAY,YAAY,QAAQ,UAAU,SAAS;EAC1E,UAAU,QAAQ;CACnB;CACA,OAAO,YAAY,KAAK,KAAK,iCAAiC,OAAO,IAAI,UAAU,KAAK;AACzF;;;;AAMA,SAAS,gBAAgB,SAAS,SAAS,UAAU;CACpD,QAAQ,QAAQ,MAAhB;EACC,KAAK,eAAe,OAAO;GAC1B,MAAM;GACN,SAAS,wBAAwB,QAAQ,IAAI,iBAAiB,QAAQ,MAAM,KAAK,IAAI,EAAE;EACxF;EACA,KAAK,cAAc,OAAO;GACzB,MAAM;GACN,SAAS,GAAG,iBAAiB,SAAS,KAAK,EAAE,uCAAuC,QAAQ,OAAO;EACpG;EACA,KAAK;EACL,KAAK,mBAAmB,OAAO;GAC9B,MAAM;GACN,SAAS,QAAQ;EAClB;EACA,KAAK,WAAW,OAAO;GACtB,MAAM;GACN,SAAS,yBAAyB,SAAS,SAAS,QAAQ;EAC7D;CACD;AACD;;AAEA,SAAS,iBAAiB,OAAO;CAChC,OAAO,YAAY,UAAU,KAAK;AACnC;;;;AAIA,SAAS,yBAAyB,SAAS,SAAS,UAAU;CAC7D,MAAM,WAAW,iBAAiB,SAAS,KAAK;CAChD,MAAM,YAAY,YAAY,SAAS,QAAQ,SAAS;CACxD,IAAI,cAAc,KAAK,KAAK,SAAS,MAAM,MAAM,SAAS,WAAW,MAAM,SAAS,CAAC,GAAG,OAAO,GAAG,SAAS,QAAQ,QAAQ,cAAc,iBAAiB,QAAQ;CAClK,OAAO,SAAS,YAAY,KAAK,IAAI,WAAW,GAAG,SAAS,UAAU,SAAS;AAChF;AACA,SAAS,WAAW,GAAG,GAAG;CACzB,OAAO,EAAE,SAAS,SAAS,EAAE,SAAS,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE;AAC9E;;AAEA,MAAM,cAAc;;;;AAIpB,SAAS,aAAa,SAAS,WAAW,SAAS;CAClD,IAAI,QAAQ,SAAS,UAAU,OAAO,KAAK;CAC3C,MAAM,UAAU,cAAc;EAC7B,MAAM,OAAO,iBAAiB,SAAS,SAAS;EAChD,OAAO,KAAK,MAAM,eAAe,SAAS,UAAU,eAAe,UAAU,iBAAiB,KAAK,KAAK,CAAC,CAAC;CAC3G;CACA,MAAM,CAAC,OAAO,aAAa,SAAS,UAAU,aAAa;CAC3D,IAAI,QAAQ,KAAK,KAAK,8BAA8B,QAAQ,IAAI,KAAK,OAAO;EAC3E,MAAM;EACN;EACA,MAAM,QAAQ;CACf,CAAC,GAAG,OAAO,mBAAmB,KAAK,QAAQ,IAAI;CAC/C,IAAI,YAAY,KAAK,QAAQ,IAAI,KAAK,OAAO;EAC5C,MAAM;EACN,MAAM,QAAQ;CACf,CAAC,GAAG,OAAO,QAAQ;CACnB,KAAK,QAAQ,SAAS,UAAU,QAAQ,SAAS,YAAY,OAAO;EACnE,MAAM;EACN,OAAO,QAAQ,SAAS;CACzB,CAAC,GAAG,OAAO,QAAQ;AACpB;AACA,SAAS,UAAU,SAAS,SAAS;CACpC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,QAAQ,OAAO,GAAG,IAAI,QAAQ,KAAK,GAAG,OAAO;EACtF;EACA;CACD;AACD;;AAEA,SAAS,YAAY,SAAS,KAAK;CAClC,OAAO,UAAU,UAAU,EAAE,cAAc,QAAQ,SAAS,SAAS,QAAQ,QAAQ,GAAG;AACzF;;AAEA,SAAS,cAAc,SAAS,QAAQ;CACvC,OAAO,UAAU,UAAU,EAAE,cAAc,QAAQ,SAAS,WAAW,QAAQ,WAAW,MAAM;AACjG;;AAEA,SAAS,UAAU,SAAS;CAC3B,OAAO,OAAO,OAAO,QAAQ,OAAO,CAAC,CAAC,SAAS,UAAU,MAAM,QAAQ,SAAS,QAAQ,CAAC,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC;AACjH;AACA,SAAS,OAAO,SAAS;CACxB,OAAO,QAAQ,SAAS,YAAY,OAAO,QAAQ,KAAK,IAAI,QAAQ;AACrE;AACA,SAAS,UAAU,OAAO;CACzB,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;;AAEA,SAAS,YAAY,SAAS,MAAM,MAAM,QAAQ,QAAQ;CACzD,MAAM,cAAc,QAAQ,OAAO,IAAI,IAAI;CAC3C,IAAI,gBAAgB,KAAK,GAAG,MAAM,IAAI,cAAc,eAAe,KAAK,oDAAoD;CAC5H,IAAI;EACH,OAAO,GAAG,YAAY,UAAU,KAAK,GAAG,MAAM,CAAC;CAChD,SAAS,OAAO;EACf,IAAI,gBAAgB,KAAK,GAAG,MAAM;EAClC,OAAO,MAAM,OAAO,UAAU,KAAK,CAAC,CAAC;CACtC;AACD;;AAEA,SAAS,iBAAiB,SAAS,SAAS;CAC3C,MAAM,QAAQ,QAAQ,SAAS,QAAQ,YAAY,SAAS,QAAQ,GAAG,IAAI,cAAc,SAAS,QAAQ,IAAI;CAC9G,IAAI,UAAU,KAAK,GAAG,OAAO,QAAQ,SAAS,QAAQ,MAAM;EAC3D,MAAM;EACN,KAAK,QAAQ;EACb,OAAO,UAAU,OAAO;CACzB,CAAC,IAAI,MAAM;EACV,MAAM;EACN,QAAQ,QAAQ;CACjB,CAAC;CACD,MAAM,OAAO,OAAO,OAAO;CAC3B,MAAM,OAAO,MAAM,MAAM;CACzB,MAAM,cAAc,aAAa;EAChC,MAAM;EACN;CACD;CACA,IAAI,KAAK,SAAS,WAAW,KAAK,WAAW,UAAU;EACtD,MAAM,aAAa,KAAK,SAAS,IAAI;EACrC,OAAO,eAAe,KAAK,IAAI,MAAM,WAAW,gDAAgD,MAAM,CAAC,IAAI,YAAY,SAAS,WAAW,YAAY,WAAW,OAAO,CAAC,GAAG,UAAU;CACxL;CACA,OAAO,YAAY,SAAS,WAAW,MAAM,GAAG,SAAS,KAAK,MAAM,IAAI,GAAG,CAAC,GAAG,UAAU;AAC1F;;AAEA,SAAS,eAAe,SAAS,eAAe,iBAAiB,OAAO;CACvE,MAAM,iBAAiB,aAAa;EACnC,MAAM;EACN;EACA;CACD;CACA,IAAI,MAAM,SAAS,eAAe,OAAO,YAAY,SAAS,qBAAqB,MAAM,OAAO,iBAAiB,aAAa;CAC9H,MAAM,cAAc,QAAQ,OAAO,IAAI,aAAa;CACpD,MAAM,OAAO,aAAa,MAAM,MAAM;CACtC,IAAI,SAAS,KAAK,GAAG,OAAO,MAAM;EACjC,MAAM;EACN;EACA;EACA,WAAW,MAAM;EACjB,OAAO,OAAO,KAAK,aAAa,SAAS,CAAC,CAAC;CAC5C,CAAC;CACD,MAAM,SAAS,QAAQ,OAAO,IAAI,MAAM,IAAI;CAC5C,IAAI,WAAW,KAAK,GAAG,MAAM,IAAI,cAAc,eAAe,MAAM,KAAK,iDAAiD;CAC1H,IAAI;CACJ,IAAI;EACH,OAAO,KAAK,OAAO,WAAW,KAAK,CAAC;CACrC,SAAS,OAAO;EACf,IAAI,gBAAgB,KAAK,GAAG,MAAM;EAClC,OAAO,MAAM;GACZ,MAAM;GACN,SAAS,UAAU,KAAK;EACzB,CAAC;CACF;CACA,OAAO,YAAY,SAAS,qBAAqB,MAAM,iBAAiB,aAAa;AACtF;;AAEA,SAAS,cAAc,SAAS,UAAU;CACzC,OAAO,CAAC,UAAU,GAAG,OAAO,KAAK,QAAQ,OAAO,IAAI,QAAQ,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;AAC5E;;AAEA,SAAS,aAAa,SAAS,UAAU;CACxC,MAAM,OAAO,cAAc,SAAS,QAAQ,CAAC,CAAC,SAAS,SAAS;EAC/D,MAAM,UAAU,QAAQ,QAAQ,KAAK,EAAE;EACvC,OAAO,SAAS,SAAS,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC;CACnD,CAAC;CACD,OAAO,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC;AACzB;;AAEA,SAAS,QAAQ,KAAK;CACrB,OAAO;EACN,MAAM;EACN;EACA,QAAQ,GAAG,IAAI;CAChB;AACD;AACA,MAAM,gBAAgB;CACrB,QAAQ;CACR,SAAS;CACT,QAAQ;AACT;AACA,SAAS,YAAY,SAAS,MAAM;CACnC,MAAM,UAAU,QAAQ,QAAQ,KAAK,EAAE;CACvC,IAAI,SAAS,SAAS,OAAO,OAAO,QAAQ,QAAQ,GAAG;CACvD,IAAI,SAAS,SAAS,WAAW,QAAQ,WAAW,UAAU,OAAO;EACpE,MAAM,QAAQ;EACd,QAAQ,cAAc,QAAQ;CAC/B;CACA,OAAO,OAAO,QAAQ,QAAQ,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,WAAW,MAAM,QAAQ,SAAS,WAAW,MAAM,QAAQ,WAAW,aAAa,QAAQ,QAAQ,MAAM,QAAQ,MAAM,MAAM,WAAW,WAAW,IAAI,EAAE,IAAI;EAC/M,MAAM;EACN,QAAQ,cAAc;CACvB,IAAI,KAAK;AACV;;AAEA,MAAM,kBAAkB;;AAExB,SAAS,cAAc,SAAS,gBAAgB;CAC/C,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,QAAQ,eAAe,SAAS,cAAc,cAAc,SAAS,SAAS,CAAC,GAAG;EAC5F,MAAM,OAAO,YAAY,SAAS,IAAI;EACtC,IAAI,SAAS,KAAK,KAAK,CAAC,MAAM,MAAM,WAAW,WAAW,QAAQ,IAAI,CAAC,GAAG,MAAM,KAAK,IAAI;CAC1F;CACA,OAAO;AACR;AACA,SAAS,UAAU,OAAO;CACzB,OAAO,MAAM,WAAW,IAAI,kBAAkB,MAAM,KAAK,SAAS,KAAK,MAAM,CAAC,CAAC,KAAK,MAAM;AAC3F;;AAEA,SAAS,sBAAsB,SAAS,UAAU;CACjD,OAAO,UAAU,cAAc,SAAS,CAAC,QAAQ,CAAC,CAAC;AACpD"}
@@ -1 +0,0 @@
1
- {"version":3,"file":"binder-WS9-1Mu9-MJi8x3Gm.d.mts","names":[],"sources":["../../../../1-framework/2-authoring/psl-parser/dist/binder-WS9-1Mu9.d.mts"],"mappings":";;;;;;;;;;;;;;;;UAWU;WACC;WACA;WACA;WACA,aAAa;WACb,MAAM;;UAEP,kBAAkB,cAAc,oBAAoB,oBAAoB,oBAAoB;WAC3F;WACA,eAAe;WACf,MAAM;WACN,MAAM;;UAEP;WACC;WACA,eAAe;WACf,MAAM;;iBAEA,sBAAsB,cAAc,oBAAoB,mBAAmB,WAAW,OAAO,SAAS,aAAa,kBAAkB;iBACrI,uBAAuB,cAAc,oBAAoB,mBAAmB,YAAY,SAAS,QAAQ,SAAS,sBAAsB,kBAAkB;iBAC1J,4BAA4B,YAAY,+BAA+B,SAAS,aAAa;iBAC7F,YAAY,MAAM,YAAY,SAAS,aAAa;;iBAEpD,eAAe,MAAM,YAAY,iBAAiB,SAAS,aAAa;;;UAG/E;WACC,kBAAkB;WAClB,YAAY,eAAe;WAC3B,YAAY,eAAe;;UAE5B;WACC,MAAM;WACN,MAAM;;UAEP;WACC;WACA;WACA;WACA,uBAAuB;WACvB,QAAQ,eAAe;WACvB,gBAAgB,eAAe;WAC/B,QAAQ,eAAe;WACvB,QAAQ,eAAe;;UAExB;WACC;WACA;WACA,MAAM;WACN,MAAM;EACf,QAAQ,eAAe;EACvB,qBAAqB,kBAAkB;;UAE/B;WACC;WACA;WACA,MAAM;WACN,MAAM;EACf,QAAQ,eAAe;EACvB,qBAAqB,kBAAkB;;UAE/B;WACC;WACA;WACA;WACA,MAAM;WACN,MAAM;EACf,kBAAkB;EAClB,qBAAqB,kBAAkB;;UAE/B;WACC;WACA;WACA;WACA,MAAM;WACN,MAAM;WACN,QAAQ,eAAe;WACvB,kBAAkB;WAClB,qBAAqB,kBAAkB;;UAExC;WACC;WACA,kBAAkB;WAClB;WACA,qBAAqB,kBAAkB;;;;;;;UAOxC,wBAAwB;WACvB;WACA;WACA,MAAM;WACN,MAAM;;UAEP;WACC;WACA;WACA,MAAM;WACN,MAAM;WACN;WACA;WACA;WACA;WACA;;WAEA;WACA,kBAAkB;WAClB,qBAAqB,kBAAkB;;WAEvC;;UAED;WACC,oBAAoB;WACpB,SAAS;WACT;;UAED;WACC,aAAa;WACb,sBAAsB;;;;;;iBAMhB,iBAAiB,SAAS,0BAA0B;;;KAGhE;WACM;;WAEA;;WAEA;;WAEA;WACA;;KAEN,oBAAoB,cAAc,sBAAsB,kBAAkB;KAC1E,eAAe,UAAU,kBAAkB,QAAQ;EACtD,MAAM;;KAEH,uBAAuB,UAAU,qBAAqB,UAAU,8BAA8B;UACzF,wBAAwB,UAAU,oBAAoB;WACrD,aAAa;WACb,WAAW,uBAAuB;;iBAE5B,gBAAgB,YAAY,aAAa;iBACzC,gBAAgB,UAAU,gBAAgB,WAAW,yBAAyB,UAAU,IAAI,aAAa,wBAAwB,eAAe;;;KAG5J;UACK;WACC,SAAS;WACT,SAAS;WACT,QAAQ;;UAET,0BAA0B;WACzB,WAAW;;UAEZ,0BAA0B;WACzB,WAAW;;UAEZ,0BAA0B;WACzB,OAAO;;KAEb;KACA;UACK,cAAc,GAAG,YAAY,sBAAsB,wBAAwB;WAC1E;;WAEA,UAAU,KAAK;WACf,QAAQ,KAAK,eAAe,KAAK,QAAQ,OAAO,YAAY;;UAE7D,YAAY,YAAY,eAAe,sBAAsB,uBAAuB;WACnF;;UAED,iBAAiB,UAAU,oBAAoB,mBAAmB,YAAY,eAAe,sBAAsB,cAAc,wBAAwB,IAAI;WAC5J;WACA,UAAU;;UAEX,gBAAgB,YAAY,oBAAoB,2BAA2B,sBAAsB;WAChG;;UAED,0BAA0B,YAAY,oBAAoB,2BAA2B,sBAAsB;WAC1G;;UAED,YAAY,YAAY,eAAe;WACtC;WACA,sBAAsB,yBAAyB;WAC/C,QAAQ,SAAS,eAAe,eAAe;;UAEhD;WACC;WACA,MAAM;WACN,MAAM,SAAS;;UAEhB,gBAAgB,8BAA8B,YAAY,eAAe,cAAc,kBAAkB,qBAAqB,YAAY,cAAc,cAAc,eAAe;WACpL;WACA,MAAM;WACN,WAAW;WACX,SAAS,KAAK;;UAEf,uBAAuB,8BAA8B,YAAY,eAAe,sBAAsB,cAAc,MAAM;WACzH;WACA,MAAM;WACN;;UAED,8BAA8B,YAAY,eAAe,sBAAsB,sBAAsB;WACpG;WACA;;KAEN,kBAAkB,8BAA8B,YAAY,eAAe,gBAAgB,uBAAuB,MAAM,OAAO,8BAA8B;UACxJ,WAAW,YAAY,eAAe,sBAAsB,sBAAsB;WACjF;WACA;WACA;;UAED,YAAY,YAAY,eAAe,sBAAsB,cAAc,yBAAyB;WACnG;;UAED,iBAAiB,YAAY,eAAe,sBAAsB,cAAc,WAAW;WAC1F;WACA,wBAAwB,uBAAuB,MAAM,uBAAuB,MAAM,YAAY,MAAM,YAAY,MAAM,YAAY,WAAW,MAAM,cAAc,WAAW;;UAE7K,YAAY,YAAY,eAAe,sBAAsB,oBAAoB;WAChF;;UAED,YAAY,aAAa,YAAY,eAAe,sBAAsB,cAAc,KAAK;WAC5F;WACA,IAAI,QAAQ,GAAG;WACf;WACA;;UAED,uBAAuB,YAAY,eAAe,sBAAsB,sBAAsB;WAC7F;WACA;;UAED,gBAAgB,2BAA2B,YAAY,eAAe,sBAAsB,cAAc,GAAG;WAC5G;WACA,OAAO;;UAER;WACC;;UAED,kBAAkB,YAAY,eAAe,sBAAsB,cAAc,YAAY;WAC5F;WACA;;UAED,aAAa,uBAAuB,eAAe,eAAe,YAAY,eAAe,sBAAsB,mBAAmB,MAAM,yBAAyB,cAAc,MAAM,eAAe,MAAM;WAC7M,cAAc;;UAEf;WACC;WACA,wBAAwB,eAAe;;UAExC,cAAc,aAAa,YAAY,eAAe,sBAAsB,cAAc,eAAe,IAAI;WAC5G;WACA,IAAI,QAAQ,GAAG;;UAEhB,iBAAiB,WAAW,YAAY,eAAe,sBAAsB,cAAc,GAAG;WAC7F;WACA;;UAED,uBAAuB,YAAY,eAAe,sBAAsB,sBAAsB;WAC7F;WACA;;UAED,gBAAgB,2BAA2B,YAAY,eAAe,sBAAsB,cAAc,GAAG;WAC5G;WACA,OAAO;;;;;;UAMR;WACC;WACA,kBAAkB;WAClB,MAAM;;UAEP,qBAAqB,YAAY,eAAe,sBAAsB,cAAc,qBAAqB;WACxG;WACA;WACA;;;UAGD;WACC,OAAO;WACP,MAAM;;UAEP,qBAAqB,YAAY,eAAe,sBAAsB,cAAc,kBAAkB;WACrG;WACA,UAAU;;WAEV;;WAEA;;WAEA;;KAEN,gBAAgB,QAAQ,sBAAsB,KAAK,YAAY;KAC/D,QAAQ,GAAG,YAAY,gBAAgB,cAAc,GAAG,OAAO,gBAAgB,eAAe;KAC9F,aAAa,iBAAiB,gBAAgB,iBAAiB,qBAAqB,iBAAiB;KACrG,MAAM,KAAK,UAAU,6BAA6B,OAAO;KACzD,mBAAmB,YAAY,iBAAiB,QAAQ,KAAK,uCAAuC,QAAQ,KAAK;KACjH,sBAAsB,YAAY,kBAAkB,sBAAsB,oBAAoB,sBAAsB,oBAAoB;KACxI,mBAAmB,YAAY,gBAAgB,iBAAiB;KAChE,eAAe,YAAY,gBAAgB,YAAY,OAAO,qBAAqB,OAAO,iBAAiB,mBAAmB,OAAO,gBAAgB,oBAAoB,OAAO,wBAAwB,OAAO,0BAA0B,OAAO,WAAW,OAAO,YAAY,OAAO,YAAY,OAAO,qBAAqB,OAAO,wBAAwB,OAAO,uBAAuB,OAAO,kBAAkB,OAAO,gBAAgB,uBAAuB,OAAO,0BAA0B,oBAAoB,OAAO,wBAAwB,OAAO,wBAAwB,OAAO,uBAAuB,OAAO,qBAAqB;KAC9mB,gBAAgB,GAAG,YAAY,cAAc,sBAAsB,QAAQ,GAAG,MAAM,wCAAwC,OAAO,sBAAsB,GAAG;;UAEvJ,sBAAsB,GAAG,oCAAoC;WAC5D,YAAY;WACZ,eAAe;;UAEhB,MAAM,GAAG,YAAY;WACpB,MAAM,QAAQ,GAAG;WACjB;;UAED,gBAAgB,GAAG,YAAY,sBAAsB,MAAM,GAAG;WAC7D;;UAED,cAAc,KAAK,YAAY;WAC9B;WACA,OAAO;WACP;WACA,qBAAqB,yBAAyB;WAC9C,OAAO,SAAS,eAAe,eAAe;;;;;;WAM9C,UAAU,QAAQ,KAAK,KAAK,KAAK,eAAe,qBAAqB;;KAE3E,MAAM,KAAK,UAAU,8BAA8B,KAAK;KACxD,iBAAiB;KACjB,SAAS,UAAU,eAAe,0BAA0B,YAAY,WAAW,KAAK,EAAE,mBAAmB,yBAAyB,IAAI,MAAM,EAAE,oBAAoB,WAAW,KAAK,EAAE,mBAAmB,iBAAiB,aAAa,MAAM,EAAE;KACjP,eAAe,UAAU,mCAAmC,kBAAkB,oBAAoB,KAAK,YAAY,MAAM,mBAAmB,KAAK,WAAW,MAAM;KAClK,OAAO,qBAAqB,qCAAqC,SAAS,uBAAuB,WAAW,MAAM,eAAe,IAAI;KACrI,aAAa,qBAAqB,mCAAmC,cAAc,eAAe,0BAA0B,SAAS,OAAO,OAAO,SAAS;KAC5J,UAAU,KAAK,UAAU,oBAAoB,cAAc;;;KAG3D,4BAA4B,qCAAqC;KACjE;YACO,eAAe,4BAA4B;;UAE7C;WACC;WACA;WACA;WACA,YAAY;;UAEb;WACC;WACA;WACA;WACA,SAAS,oBAAoB;;KAEnC,oBAAoB,wBAAwB;UACvC;EACR,OAAO,eAAe;EACtB,WAAW,2BAA2B;;;;KAInC;WACM;WACA,QAAQ;WACR,WAAW;;WAEX;WACA,QAAQ;WACR,WAAW;;WAEX;WACA,QAAQ;WACR,YAAY;;WAEZ;WACA,QAAQ;WACR,WAAW;;WAEX;WACA,QAAQ;WACR,YAAY;;WAEZ;WACA,QAAQ;;WAER;WACA,QAAQ;;WAER;WACA,QAAQ;;uBAEI;qBACF,QAAQ;EAC3B,YAAY,QAAQ;WACX,OAAO,eAAe;qBACZ,YAAY;EAC/B,WAAW,2BAA2B;;iBAEvB,gBAAgB,YAAY,kBAAkB,cAAc,QAAQ;EACnF;;iBAEe,cAAc,WAAW,QAAQ;EAChD;KACG,2BAA2B;;;cAGlB;KACT,YAAY,qBAAqB,qBAAqB,qBAAqB,qBAAqB,qBAAqB;UAChH;WACC;WACA;WACA;WACA,MAAM;;UAEP;WACC;WACA;WACA,OAAO;;UAER;WACC;WACA;WACA,WAAW;;UAEZ;WACC;WACA;WACA;;KAEN,YAAY,cAAc,sBAAsB,kBAAkB,cAAc,kBAAkB,cAAc;KAChH,aAAa,cAAc,sBAAsB;KACjD,aAAa;WACP;WACA,QAAQ;;WAER;WACA,QAAQ;;WAER;WACA,QAAQ;;WAER;WACA,QAAQ;;WAER;WACA,QAAQ;;WAER;;WAEA;WACA;;UAED;EACR,eAAe,MAAM,aAAa;EAClC,cAAc,MAAM,aAAa;EACjC,QAAQ,MAAM,aAAa;;UAEnB;WACC,WAAW;WACX;WACA,OAAO;WACP,OAAO;;KAEb,gCAAgC,aAAa,yBAAyB;UACjE;WACC,OAAO;WACP,OAAO;WACP;;KAEN,0BAA0B,YAAY;UACjC,sBAAsB,KAAK;WAC1B,yBAAyB,KAAK;;UAE/B;WACC,SAAS;WACT,aAAa;WACb,SAAS;;UAEV;WACC,QAAQ;WACR,sBAAsB;;iBAEhB,kBAAkB,QAAQ,cAAc,kBAAkB;iBAC1D,kBAAkB,YAAY,wBAAwB,QAAQ,SAAS;iBACvE,aAAa,OAAO,oBAAoB"}