@prisma/orm-framework 8.0.0-rc.24-dev.27 → 8.0.0-rc.24-dev.29

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 (119) hide show
  1. package/README.md +2 -0
  2. package/dist/{authoring-DnYn5EZT.mjs → authoring-BoRTq-7r.mjs} +2 -2
  3. package/dist/{authoring-DnYn5EZT.mjs.map → authoring-BoRTq-7r.mjs.map} +1 -1
  4. package/dist/{binder-CMy3WM5A-gjYNJqla.d.mts → binder-CMy3WM5A-BjkRdpH6.d.mts} +4 -4
  5. package/dist/{binder-CMy3WM5A-gjYNJqla.d.mts.map → binder-CMy3WM5A-BjkRdpH6.d.mts.map} +1 -1
  6. package/dist/boolean-C37kSXDF.mjs +14 -0
  7. package/dist/boolean-C37kSXDF.mjs.map +1 -0
  8. package/dist/boolean-CcUSuhCU.d.mts +9 -0
  9. package/dist/boolean-CcUSuhCU.d.mts.map +1 -0
  10. package/dist/{codec-yFwW7XRh.mjs → codec-CBJNOQS4.mjs} +2 -2
  11. package/dist/{codec-yFwW7XRh.mjs.map → codec-CBJNOQS4.mjs.map} +1 -1
  12. package/dist/{components-BaV9iCkq.mjs → components-Bx7dm2HO.mjs} +2 -2
  13. package/dist/{components-BaV9iCkq.mjs.map → components-Bx7dm2HO.mjs.map} +1 -1
  14. package/dist/components.d.mts +5 -5
  15. package/dist/components.mjs +7 -8
  16. package/dist/components__authoring.mjs +2 -2
  17. package/dist/components__codec.mjs +1 -1
  18. package/dist/components__components.mjs +2 -2
  19. package/dist/components__control.d.mts +1 -1
  20. package/dist/components__control.mjs +2 -2
  21. package/dist/components__emission.d.mts +3 -3
  22. package/dist/components__emission.mjs +1 -2
  23. package/dist/{config-types-D0mYyP62.mjs → config-types-DlaG0ylV.mjs} +4 -2
  24. package/dist/config-types-DlaG0ylV.mjs.map +1 -0
  25. package/dist/{config-types-Ck3UXVIU.d.mts → config-types-DvM9eXG7.d.mts} +6 -2
  26. package/dist/{config-types-Ck3UXVIU.d.mts.map → config-types-DvM9eXG7.d.mts.map} +1 -1
  27. package/dist/config.d.mts +1 -1
  28. package/dist/config.mjs +1 -1
  29. package/dist/config__config-types.d.mts +1 -1
  30. package/dist/config__config-types.mjs +1 -1
  31. package/dist/contract-authoring.mjs +3 -3
  32. package/dist/{control-BeXOxtXA-CoPQgVyR.d.mts → control-BeXOxtXA-D1DDBvDL.d.mts} +2 -2
  33. package/dist/{control-BeXOxtXA-CoPQgVyR.d.mts.map → control-BeXOxtXA-D1DDBvDL.d.mts.map} +1 -1
  34. package/dist/control-DI1fnOUO.d.mts +1 -0
  35. package/dist/{control-B0KO727Y.mjs → control-DNwP6V2m.mjs} +3 -3
  36. package/dist/{control-B0KO727Y.mjs.map → control-DNwP6V2m.mjs.map} +1 -1
  37. package/dist/{control-MllEQmML-IlhSvGbE.mjs → control-MllEQmML-aKdJLwRB.mjs} +2 -2
  38. package/dist/{control-MllEQmML-IlhSvGbE.mjs.map → control-MllEQmML-aKdJLwRB.mjs.map} +1 -1
  39. package/dist/{control-B3QHYJcv.d.mts → control-rzZBO0wp.d.mts} +116 -121
  40. package/dist/control-rzZBO0wp.d.mts.map +1 -0
  41. package/dist/decimal-CetFpCr5.mjs +49 -0
  42. package/dist/decimal-CetFpCr5.mjs.map +1 -0
  43. package/dist/decimal-DpMh1SwW.d.mts +15 -0
  44. package/dist/decimal-DpMh1SwW.d.mts.map +1 -0
  45. package/dist/{declarations-8CRDqUTt-B0YG2lqY.mjs → declarations-8CRDqUTt-BZ6aspIz.mjs} +2 -2
  46. package/dist/{declarations-8CRDqUTt-B0YG2lqY.mjs.map → declarations-8CRDqUTt-BZ6aspIz.mjs.map} +1 -1
  47. package/dist/{dist-D1f6xr7F.mjs → dist-s8Mn2iIF.mjs} +7 -10
  48. package/dist/dist-s8Mn2iIF.mjs.map +1 -0
  49. package/dist/{emission-DGYCaKjl.d.mts → emission-ZgkI1aFl.d.mts} +1 -1
  50. package/dist/{emission-types-bX2HmNSC-vaRddb1_.d.mts → emission-types-BuZVDb1i-BnSb9rsQ.d.mts} +6 -42
  51. package/dist/emission-types-BuZVDb1i-BnSb9rsQ.d.mts.map +1 -0
  52. package/dist/errors.d.mts +4 -4
  53. package/dist/errors.mjs +3 -3
  54. package/dist/errors__control.d.mts +2 -2
  55. package/dist/errors__control.mjs +1 -1
  56. package/dist/errors__execution.d.mts +1 -1
  57. package/dist/errors__execution.mjs +1 -1
  58. package/dist/errors__migration.d.mts +1 -1
  59. package/dist/errors__migration.mjs +1 -1
  60. package/dist/{execution-DLAnWNAh.d.mts → execution-Bbc4v1Vn.d.mts} +2 -2
  61. package/dist/{execution-DLAnWNAh.d.mts.map → execution-Bbc4v1Vn.d.mts.map} +1 -1
  62. package/dist/{execution-DE_55Rj3.mjs → execution-DMqI5fFP.mjs} +2 -2
  63. package/dist/{execution-DE_55Rj3.mjs.map → execution-DMqI5fFP.mjs.map} +1 -1
  64. package/dist/{expressions-BlhT51Ib-CQCMuQD8.mjs → expressions-BlhT51Ib-DfkeWOwr.mjs} +2 -2
  65. package/dist/{expressions-BlhT51Ib-CQCMuQD8.mjs.map → expressions-BlhT51Ib-DfkeWOwr.mjs.map} +1 -1
  66. package/dist/{generator-functions-CXbQfvYu-BIFU1Ryx.mjs → generator-functions-VMolCOGa-xY11fV0Q.mjs} +4 -3
  67. package/dist/generator-functions-VMolCOGa-xY11fV0Q.mjs.map +1 -0
  68. package/dist/json-Cjj5_v0y.mjs +67 -0
  69. package/dist/json-Cjj5_v0y.mjs.map +1 -0
  70. package/dist/json-oOHvzn6v.d.mts +18 -0
  71. package/dist/json-oOHvzn6v.d.mts.map +1 -0
  72. package/dist/{migration-rWN1KSXH.mjs → migration-BfPqhbjG.mjs} +2 -2
  73. package/dist/{migration-rWN1KSXH.mjs.map → migration-BfPqhbjG.mjs.map} +1 -1
  74. package/dist/{migration-KEyQBpKF.d.mts → migration-BiqyI92H.d.mts} +2 -2
  75. package/dist/{migration-KEyQBpKF.d.mts.map → migration-BiqyI92H.d.mts.map} +1 -1
  76. package/dist/{parse-D-B_nrfC-FsqZwLif.mjs → parse-D-B_nrfC-agY84gQk.mjs} +3 -3
  77. package/dist/{parse-D-B_nrfC-FsqZwLif.mjs.map → parse-D-B_nrfC-agY84gQk.mjs.map} +1 -1
  78. package/dist/{parse-djL5wker-Bx0JH2c_.d.mts → parse-djL5wker-DNAOL0Cj.d.mts} +2 -2
  79. package/dist/{parse-djL5wker-Bx0JH2c_.d.mts.map → parse-djL5wker-DNAOL0Cj.d.mts.map} +1 -1
  80. package/dist/psl-parser.d.mts +3 -3
  81. package/dist/psl-parser.mjs +5 -5
  82. package/dist/psl-parser__format.d.mts +1 -1
  83. package/dist/psl-parser__format.mjs +3 -3
  84. package/dist/psl-parser__interpret.d.mts +3 -3
  85. package/dist/psl-parser__interpret.mjs +2 -2
  86. package/dist/psl-parser__syntax.d.mts +1 -1
  87. package/dist/psl-parser__syntax.mjs +3 -3
  88. package/dist/psl-printer.mjs +5 -2
  89. package/dist/psl-printer.mjs.map +1 -1
  90. package/dist/target-package-config.d.mts +2 -0
  91. package/dist/target-package-config.mjs +2 -0
  92. package/dist/target-package-config__type-declarations.d.mts +2 -0
  93. package/dist/target-package-config__type-declarations.mjs +2 -0
  94. package/dist/{temporal-type-aliases-CFh3BW2a-DOlmiuQn.mjs → temporal-type-aliases-CFh3BW2a-CeZV7A5h.mjs} +2 -2
  95. package/dist/{temporal-type-aliases-CFh3BW2a-DOlmiuQn.mjs.map → temporal-type-aliases-CFh3BW2a-CeZV7A5h.mjs.map} +1 -1
  96. package/dist/ts-render.mjs +1 -1
  97. package/dist/{type-constructor-calls-Bfg5ojed-Ld7LE20u.mjs → type-constructor-calls-Bfg5ojed-DlLeoRYW.mjs} +4 -4
  98. package/dist/{type-constructor-calls-Bfg5ojed-Ld7LE20u.mjs.map → type-constructor-calls-Bfg5ojed-DlLeoRYW.mjs.map} +1 -1
  99. package/dist/type-declarations-CPPGpPSj.mjs +58 -0
  100. package/dist/type-declarations-CPPGpPSj.mjs.map +1 -0
  101. package/dist/type-declarations-C_77eFnt.d.mts +11 -0
  102. package/dist/type-declarations-C_77eFnt.d.mts.map +1 -0
  103. package/dist/type-implementations.d.mts +4 -1
  104. package/dist/type-implementations.mjs +4 -1
  105. package/dist/type-implementations__boolean.d.mts +2 -0
  106. package/dist/type-implementations__boolean.mjs +2 -0
  107. package/dist/type-implementations__decimal.d.mts +2 -0
  108. package/dist/type-implementations__decimal.mjs +2 -0
  109. package/dist/type-implementations__json.d.mts +2 -0
  110. package/dist/type-implementations__json.mjs +2 -0
  111. package/package.json +22 -16
  112. package/dist/config-types-D0mYyP62.mjs.map +0 -1
  113. package/dist/control-B0WmeKXX.d.mts +0 -1
  114. package/dist/control-B3QHYJcv.d.mts.map +0 -1
  115. package/dist/dist-D1f6xr7F.mjs.map +0 -1
  116. package/dist/emission-CeoAV9mj.mjs +0 -26
  117. package/dist/emission-CeoAV9mj.mjs.map +0 -1
  118. package/dist/emission-types-bX2HmNSC-vaRddb1_.d.mts.map +0 -1
  119. package/dist/generator-functions-CXbQfvYu-BIFU1Ryx.mjs.map +0 -1
@@ -1 +1 @@
1
- {"version":3,"file":"expressions-BlhT51Ib-CQCMuQD8.mjs","names":["#state","#childSlots","#childOffsets","#slots","#childOffset","#segmentBefore","#segmentAfter","#separatorCount"],"sources":["../../../../1-framework/2-authoring/psl-parser/dist/expressions-BlhT51Ib.mjs"],"sourcesContent":["import { r as isTerminatedStringLiteral } from \"./tokenizer-Dz9ZnxyT.mjs\";\nimport { canonicalizeTaggedLiteralBody } from \"@internal/framework-components/authoring\";\nimport { resolvePslBacktickEscapes } from \"@internal/framework-components/control\";\n//#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\n//#region src/syntax/ast/identifier.ts\nvar IdentifierAst = class IdentifierAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\ttoken() {\n\t\treturn findChildToken(this.syntax, \"Ident\");\n\t}\n\tname() {\n\t\treturn this.token()?.text;\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"Identifier\" ? new IdentifierAst(node) : void 0;\n\t}\n};\n//#endregion\n//#region src/syntax/ast/qualified-name.ts\n/** A namespace-qualified name, e.g. `pgvector.Vector` or `supabase:auth.User`. */\nvar QualifiedNameAst = class QualifiedNameAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\t#segmentBefore(boundary) {\n\t\tlet found;\n\t\tfor (const segment of filterChildren(this.syntax, IdentifierAst.cast)) {\n\t\t\tif (segment.syntax.offset >= boundary) break;\n\t\t\tfound = segment;\n\t\t}\n\t\treturn found;\n\t}\n\t#segmentAfter(boundary) {\n\t\tfor (const segment of filterChildren(this.syntax, IdentifierAst.cast)) if (segment.syntax.offset > boundary) return segment;\n\t}\n\t#separatorCount(kind) {\n\t\tlet count = 0;\n\t\tfor (const child of this.syntax.children()) if (!(child instanceof SyntaxNode) && child.kind === kind) count++;\n\t\treturn count;\n\t}\n\tcolon() {\n\t\treturn findChildToken(this.syntax, \"Colon\");\n\t}\n\tdot() {\n\t\treturn findChildToken(this.syntax, \"Dot\");\n\t}\n\tspace() {\n\t\tconst colon = this.colon();\n\t\tif (!colon) return void 0;\n\t\treturn this.#segmentBefore(colon.offset);\n\t}\n\tnamespace() {\n\t\tconst dot = this.dot();\n\t\tif (!dot) return void 0;\n\t\treturn this.#segmentBefore(dot.offset);\n\t}\n\tidentifier() {\n\t\tconst dot = this.dot();\n\t\tif (dot) return this.#segmentAfter(dot.offset);\n\t\tconst colon = this.colon();\n\t\tif (colon) return this.#segmentAfter(colon.offset);\n\t\treturn findFirstChild(this.syntax, IdentifierAst.cast);\n\t}\n\tsegments() {\n\t\treturn filterChildren(this.syntax, IdentifierAst.cast);\n\t}\n\t/**\n\t* Every identifier segment, in source order. A bare `Vector` yields\n\t* `['Vector']`; a qualified `pgvector.Vector` yields `['pgvector', 'Vector']`.\n\t*/\n\tpath() {\n\t\tconst segments = [];\n\t\tfor (const segment of this.segments()) {\n\t\t\tconst text = segment.token()?.text;\n\t\t\tif (text !== void 0) segments.push(text);\n\t\t}\n\t\treturn segments;\n\t}\n\t/** True iff this is a single unqualified identifier whose text equals `name`. */\n\tisSimpleName(name) {\n\t\tif (this.dot() !== void 0 || this.colon() !== void 0) return false;\n\t\treturn this.identifier()?.token()?.text === name;\n\t}\n\t/**\n\t* Flags a malformed name with more qualifier segments than allowed (a second\n\t* `:`-space or a second `.`-namespace).\n\t*/\n\tisOverQualified() {\n\t\treturn this.#separatorCount(\"Dot\") > 1 || this.#separatorCount(\"Colon\") > 1;\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"QualifiedName\" ? new QualifiedNameAst(node) : void 0;\n\t}\n};\n//#endregion\n//#region src/syntax/ast/expressions.ts\nvar FunctionCallAst = class FunctionCallAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\t/** The callee when it is a bare name, such as `now` in `now()`; `undefined` when the callee is dotted. */\n\tname() {\n\t\treturn findFirstChild(this.syntax, QualifiedNameAst.cast);\n\t}\n\t/**\n\t* The callee's segments, in source order. A bare `Vector(…)` yields\n\t* `['Vector']`; `pgvector.Vector(…)` yields `['pgvector', 'Vector']`;\n\t* `address.geo.lat(…)` yields `['address', 'geo', 'lat']`. Empty when the\n\t* call carries no identifier.\n\t*/\n\tpath() {\n\t\treturn segmentNames((this.name() ?? this.memberPath())?.syntax ?? this.syntax);\n\t}\n\t/** The callee when it is dotted, such as `address.city` in `address.city(sort: Asc)`; `undefined` for a bare callee. */\n\tmemberPath() {\n\t\treturn findFirstChild(this.syntax, PathExprAst.cast);\n\t}\n\tlparen() {\n\t\treturn findChildToken(this.syntax, \"LParen\");\n\t}\n\trparen() {\n\t\treturn findChildToken(this.syntax, \"RParen\");\n\t}\n\t*args() {\n\t\tyield* filterChildren(this.syntax, AttributeArgAst.cast);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"FunctionCall\" ? new FunctionCallAst(node) : void 0;\n\t}\n};\nfunction segmentNames(node) {\n\tconst segments = [];\n\tfor (const segment of filterChildren(node, IdentifierAst.cast)) {\n\t\tconst text = segment.token()?.text;\n\t\tif (text !== void 0) segments.push(text);\n\t}\n\treturn segments;\n}\n/** A dotted member path in expression position, such as `address.city` in `@@index([address.city])`. */\nvar PathExprAst = class PathExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\t*segments() {\n\t\tyield* filterChildren(this.syntax, IdentifierAst.cast);\n\t}\n\t/**\n\t* The segment names, in source order: `['address', 'city']` for `address.city`. A path that ends\n\t* in a `.` with no name after it, as in `address.`, ends in an empty name.\n\t*/\n\tpath() {\n\t\tconst segments = segmentNames(this.syntax);\n\t\treturn this.syntax.lastToken?.kind === \"Dot\" ? [...segments, \"\"] : segments;\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"PathExpr\" ? new PathExprAst(node) : void 0;\n\t}\n};\nvar ArrayLiteralAst = class ArrayLiteralAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\tlbracket() {\n\t\treturn findChildToken(this.syntax, \"LBracket\");\n\t}\n\trbracket() {\n\t\treturn findChildToken(this.syntax, \"RBracket\");\n\t}\n\t*elements() {\n\t\tyield* filterChildren(this.syntax, castExpression);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"ArrayLiteral\" ? new ArrayLiteralAst(node) : void 0;\n\t}\n};\nconst HEX = /^[0-9a-fA-F]+$/;\nfunction decodeFixedHex(raw, start, width) {\n\tif (start + width > raw.length) return void 0;\n\tconst hex = raw.slice(start, start + width);\n\tif (!HEX.test(hex)) return void 0;\n\treturn String.fromCharCode(Number.parseInt(hex, 16));\n}\nfunction decodeStringLiteral(raw) {\n\tlet out = \"\";\n\tlet i = 0;\n\twhile (i < raw.length) {\n\t\tconst ch = raw.charAt(i);\n\t\tif (ch !== \"\\\\\" || i + 1 >= raw.length) {\n\t\t\tout += ch;\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\t\tconst next = raw.charAt(i + 1);\n\t\tswitch (next) {\n\t\t\tcase \"/\":\n\t\t\t\tout += \"/\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"b\":\n\t\t\t\tout += \"\\b\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"f\":\n\t\t\t\tout += \"\\f\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"n\":\n\t\t\t\tout += \"\\n\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"r\":\n\t\t\t\tout += \"\\r\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"t\":\n\t\t\t\tout += \"\t\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"\\\"\":\n\t\t\t\tout += \"\\\"\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"'\":\n\t\t\t\tout += \"'\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"\\\\\":\n\t\t\t\tout += \"\\\\\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"x\": {\n\t\t\t\tconst decoded = decodeFixedHex(raw, i + 2, 2);\n\t\t\t\tif (decoded === void 0) {\n\t\t\t\t\tout += \"\\\\x\";\n\t\t\t\t\ti += 2;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tout += decoded;\n\t\t\t\ti += 4;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tcase \"u\": {\n\t\t\t\tconst decoded = decodeFixedHex(raw, i + 2, 4);\n\t\t\t\tif (decoded === void 0) {\n\t\t\t\t\tout += \"\\\\u\";\n\t\t\t\t\ti += 2;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tout += decoded;\n\t\t\t\ti += 6;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\tout += `\\\\${next}`;\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t}\n\t}\n\treturn out;\n}\nvar StringLiteralExprAst = class StringLiteralExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\ttoken() {\n\t\treturn findChildToken(this.syntax, \"StringLiteral\");\n\t}\n\tquote() {\n\t\tconst quote = this.token()?.text.charAt(0);\n\t\treturn quote === \"\\\"\" || quote === \"'\" || quote === \"`\" ? quote : void 0;\n\t}\n\t/**\n\t* The decoded string. A `\"` or `'` string resolves the usual escapes; a backtick string resolves\n\t* only `` \\` `` and `\\\\`, keeping every other backslash sequence as written.\n\t*/\n\tvalue() {\n\t\tconst tok = this.token();\n\t\tif (!tok) return void 0;\n\t\tconst raw = isTerminatedStringLiteral(tok.text) ? tok.text.slice(1, -1) : tok.text.slice(1);\n\t\treturn this.quote() === \"`\" ? resolvePslBacktickEscapes(raw) : decodeStringLiteral(raw);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"StringLiteralExpr\" ? new StringLiteralExprAst(node) : void 0;\n\t}\n};\n/** `` tag`body` ``, `tag\"body\"`, or `tag'body'`: a qualified-name tag followed by a string literal. */\nvar TaggedLiteralExprAst = class TaggedLiteralExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\ttag() {\n\t\treturn findFirstChild(this.syntax, QualifiedNameAst.cast);\n\t}\n\t/** The tag without trivia, e.g. `postgis.geometry`. */\n\ttagName() {\n\t\tconst tag = this.tag();\n\t\tconst space = tag?.space()?.name();\n\t\tconst namespace = tag?.namespace()?.name();\n\t\treturn (space === void 0 ? \"\" : `${space}:`) + (namespace === void 0 ? \"\" : `${namespace}.`) + (tag?.identifier()?.name() ?? \"\");\n\t}\n\tliteral() {\n\t\treturn findFirstChild(this.syntax, StringLiteralExprAst.cast);\n\t}\n\tcanonicalization() {\n\t\treturn canonicalizeTaggedLiteralBody(this.literal()?.value() ?? \"\");\n\t}\n\t/** The canonical text shared with the TypeScript `sql` tag, or `undefined` when canonicalization fails. */\n\ttext() {\n\t\tconst result = this.canonicalization();\n\t\treturn result.ok ? result.text : void 0;\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"TaggedLiteral\" ? new TaggedLiteralExprAst(node) : void 0;\n\t}\n};\nvar NumberLiteralExprAst = class NumberLiteralExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\ttoken() {\n\t\treturn findChildToken(this.syntax, \"NumberLiteral\");\n\t}\n\tvalue() {\n\t\tconst tok = this.token();\n\t\tif (!tok) return void 0;\n\t\treturn Number(tok.text);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"NumberLiteralExpr\" ? new NumberLiteralExprAst(node) : void 0;\n\t}\n};\nvar BooleanLiteralExprAst = class BooleanLiteralExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\ttoken() {\n\t\treturn findChildToken(this.syntax, \"Ident\");\n\t}\n\tvalue() {\n\t\tconst tok = this.token();\n\t\tif (!tok) return void 0;\n\t\tif (tok.text === \"true\") return true;\n\t\tif (tok.text === \"false\") return false;\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"BooleanLiteralExpr\" ? new BooleanLiteralExprAst(node) : void 0;\n\t}\n};\nvar ObjectLiteralExprAst = class ObjectLiteralExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\tlbrace() {\n\t\treturn findChildToken(this.syntax, \"LBrace\");\n\t}\n\trbrace() {\n\t\treturn findChildToken(this.syntax, \"RBrace\");\n\t}\n\t*fields() {\n\t\tyield* filterChildren(this.syntax, ObjectFieldAst.cast);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"ObjectLiteralExpr\" ? new ObjectLiteralExprAst(node) : void 0;\n\t}\n};\nvar ObjectFieldAst = class ObjectFieldAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\tkey() {\n\t\tfor (const child of this.syntax.children()) {\n\t\t\tif (!(child instanceof SyntaxNode)) {\n\t\t\t\tif (child.kind === \"Colon\") break;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\treturn IdentifierAst.cast(child);\n\t\t}\n\t}\n\t/**\n\t* The field's logical key name, unquoted. An identifier key (`length:`) yields\n\t* its text; a string-literal key (`\"length\":`) yields the decoded string.\n\t* `undefined` when the field carries no key node.\n\t*/\n\tkeyName() {\n\t\tfor (const child of this.syntax.children()) {\n\t\t\tif (!(child instanceof SyntaxNode)) {\n\t\t\t\tif (child.kind === \"Colon\") break;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst identifier = IdentifierAst.cast(child);\n\t\t\tif (identifier) return identifier.token()?.text;\n\t\t\tconst stringKey = StringLiteralExprAst.cast(child);\n\t\t\tif (stringKey) return stringKey.value();\n\t\t\treturn;\n\t\t}\n\t}\n\tcolon() {\n\t\treturn findChildToken(this.syntax, \"Colon\");\n\t}\n\tvalue() {\n\t\tif (this.colon()) {\n\t\t\tlet pastColon = false;\n\t\t\tfor (const child of this.syntax.children()) {\n\t\t\t\tif (!(child instanceof SyntaxNode)) {\n\t\t\t\t\tif (child.kind === \"Colon\") pastColon = true;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (pastColon) {\n\t\t\t\t\tconst expr = castExpression(child);\n\t\t\t\t\tif (expr) return expr;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\treturn findFirstChild(this.syntax, castExpression);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"ObjectField\" ? new ObjectFieldAst(node) : void 0;\n\t}\n};\n/** Every dotted path in an expression: the expression itself, a dotted callee, or a path inside a list, record or call argument. */\nfunction dottedPathsIn(expression) {\n\tconst paths = [];\n\tfor (const element of expression.syntax.descendants()) {\n\t\tconst path = element instanceof SyntaxNode ? PathExprAst.cast(element) : void 0;\n\t\tif (path !== void 0) paths.push(path);\n\t}\n\treturn paths;\n}\nfunction castExpression(node) {\n\treturn FunctionCallAst.cast(node) ?? ArrayLiteralAst.cast(node) ?? StringLiteralExprAst.cast(node) ?? TaggedLiteralExprAst.cast(node) ?? NumberLiteralExprAst.cast(node) ?? BooleanLiteralExprAst.cast(node) ?? ObjectLiteralExprAst.cast(node) ?? PathExprAst.cast(node) ?? IdentifierAst.cast(node);\n}\nvar AttributeArgAst = class AttributeArgAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\tname() {\n\t\tif (!this.colon()) return void 0;\n\t\treturn findFirstChild(this.syntax, IdentifierAst.cast);\n\t}\n\tcolon() {\n\t\treturn findChildToken(this.syntax, \"Colon\");\n\t}\n\tvalue() {\n\t\tif (this.colon()) {\n\t\t\tlet pastColon = false;\n\t\t\tfor (const child of this.syntax.children()) {\n\t\t\t\tif (!(child instanceof SyntaxNode)) {\n\t\t\t\t\tif (child.kind === \"Colon\") pastColon = true;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (pastColon) {\n\t\t\t\t\tconst expr = castExpression(child);\n\t\t\t\t\tif (expr) return expr;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\treturn findFirstChild(this.syntax, castExpression);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"AttributeArg\" ? new AttributeArgAst(node) : void 0;\n\t}\n};\n//#endregion\nexport { TokenAtOffset as C, SyntaxToken as S, findChildToken as _, NumberLiteralExprAst as a, readDocComment as b, PathExprAst as c, castExpression as d, dottedPathsIn as f, filterChildren as g, any as h, FunctionCallAst as i, StringLiteralExprAst as l, IdentifierAst as m, AttributeArgAst as n, ObjectFieldAst as o, QualifiedNameAst as p, BooleanLiteralExprAst as r, ObjectLiteralExprAst as s, ArrayLiteralAst as t, TaggedLiteralExprAst as u, findFirstChild as v, createSyntaxTree as w, SyntaxNode as x, printSyntax as y };\n\n//# sourceMappingURL=expressions-BlhT51Ib.mjs.map"],"mappings":";;;;;;;;;;AAWA,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;AAGA,IAAI,gBAAgB,MAAM,cAAc;CACvC;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC3C;CACA,OAAO;EACN,OAAO,KAAK,MAAM,CAAC,EAAE;CACtB;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,eAAe,IAAI,cAAc,IAAI,IAAI,KAAK;CACpE;AACD;;AAIA,IAAI,mBAAmB,MAAM,iBAAiB;CAC7C;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,eAAe,UAAU;EACxB,IAAI;EACJ,KAAK,MAAM,WAAW,eAAe,KAAK,QAAQ,cAAc,IAAI,GAAG;GACtE,IAAI,QAAQ,OAAO,UAAU,UAAU;GACvC,QAAQ;EACT;EACA,OAAO;CACR;CACA,cAAc,UAAU;EACvB,KAAK,MAAM,WAAW,eAAe,KAAK,QAAQ,cAAc,IAAI,GAAG,IAAI,QAAQ,OAAO,SAAS,UAAU,OAAO;CACrH;CACA,gBAAgB,MAAM;EACrB,IAAI,QAAQ;EACZ,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG,IAAI,EAAE,iBAAiB,eAAe,MAAM,SAAS,MAAM;EACvG,OAAO;CACR;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC3C;CACA,MAAM;EACL,OAAO,eAAe,KAAK,QAAQ,KAAK;CACzC;CACA,QAAQ;EACP,MAAM,QAAQ,KAAK,MAAM;EACzB,IAAI,CAAC,OAAO,OAAO,KAAK;EACxB,OAAO,KAAKC,eAAe,MAAM,MAAM;CACxC;CACA,YAAY;EACX,MAAM,MAAM,KAAK,IAAI;EACrB,IAAI,CAAC,KAAK,OAAO,KAAK;EACtB,OAAO,KAAKA,eAAe,IAAI,MAAM;CACtC;CACA,aAAa;EACZ,MAAM,MAAM,KAAK,IAAI;EACrB,IAAI,KAAK,OAAO,KAAKC,cAAc,IAAI,MAAM;EAC7C,MAAM,QAAQ,KAAK,MAAM;EACzB,IAAI,OAAO,OAAO,KAAKA,cAAc,MAAM,MAAM;EACjD,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACtD;CACA,WAAW;EACV,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACtD;;;;;CAKA,OAAO;EACN,MAAM,WAAW,CAAC;EAClB,KAAK,MAAM,WAAW,KAAK,SAAS,GAAG;GACtC,MAAM,OAAO,QAAQ,MAAM,CAAC,EAAE;GAC9B,IAAI,SAAS,KAAK,GAAG,SAAS,KAAK,IAAI;EACxC;EACA,OAAO;CACR;;CAEA,aAAa,MAAM;EAClB,IAAI,KAAK,IAAI,MAAM,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,GAAG,OAAO;EAC7D,OAAO,KAAK,WAAW,CAAC,EAAE,MAAM,CAAC,EAAE,SAAS;CAC7C;;;;;CAKA,kBAAkB;EACjB,OAAO,KAAKC,gBAAgB,KAAK,IAAI,KAAK,KAAKA,gBAAgB,OAAO,IAAI;CAC3E;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,kBAAkB,IAAI,iBAAiB,IAAI,IAAI,KAAK;CAC1E;AACD;AAGA,IAAI,kBAAkB,MAAM,gBAAgB;CAC3C;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;;CAEA,OAAO;EACN,OAAO,eAAe,KAAK,QAAQ,iBAAiB,IAAI;CACzD;;;;;;;CAOA,OAAO;EACN,OAAO,cAAc,KAAK,KAAK,KAAK,KAAK,WAAW,EAAA,EAAI,UAAU,KAAK,MAAM;CAC9E;;CAEA,aAAa;EACZ,OAAO,eAAe,KAAK,QAAQ,YAAY,IAAI;CACpD;CACA,SAAS;EACR,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC5C;CACA,SAAS;EACR,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC5C;CACA,CAAC,OAAO;EACP,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACxD;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAK;CACxE;AACD;AACA,SAAS,aAAa,MAAM;CAC3B,MAAM,WAAW,CAAC;CAClB,KAAK,MAAM,WAAW,eAAe,MAAM,cAAc,IAAI,GAAG;EAC/D,MAAM,OAAO,QAAQ,MAAM,CAAC,EAAE;EAC9B,IAAI,SAAS,KAAK,GAAG,SAAS,KAAK,IAAI;CACxC;CACA,OAAO;AACR;;AAEA,IAAI,cAAc,MAAM,YAAY;CACnC;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,CAAC,WAAW;EACX,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACtD;;;;;CAKA,OAAO;EACN,MAAM,WAAW,aAAa,KAAK,MAAM;EACzC,OAAO,KAAK,OAAO,WAAW,SAAS,QAAQ,CAAC,GAAG,UAAU,EAAE,IAAI;CACpE;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,aAAa,IAAI,YAAY,IAAI,IAAI,KAAK;CAChE;AACD;AACA,IAAI,kBAAkB,MAAM,gBAAgB;CAC3C;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,WAAW;EACV,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC9C;CACA,WAAW;EACV,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC9C;CACA,CAAC,WAAW;EACX,OAAO,eAAe,KAAK,QAAQ,cAAc;CAClD;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAK;CACxE;AACD;AACA,MAAM,MAAM;AACZ,SAAS,eAAe,KAAK,OAAO,OAAO;CAC1C,IAAI,QAAQ,QAAQ,IAAI,QAAQ,OAAO,KAAK;CAC5C,MAAM,MAAM,IAAI,MAAM,OAAO,QAAQ,KAAK;CAC1C,IAAI,CAAC,IAAI,KAAK,GAAG,GAAG,OAAO,KAAK;CAChC,OAAO,OAAO,aAAa,OAAO,SAAS,KAAK,EAAE,CAAC;AACpD;AACA,SAAS,oBAAoB,KAAK;CACjC,IAAI,MAAM;CACV,IAAI,IAAI;CACR,OAAO,IAAI,IAAI,QAAQ;EACtB,MAAM,KAAK,IAAI,OAAO,CAAC;EACvB,IAAI,OAAO,QAAQ,IAAI,KAAK,IAAI,QAAQ;GACvC,OAAO;GACP;GACA;EACD;EACA,MAAM,OAAO,IAAI,OAAO,IAAI,CAAC;EAC7B,QAAQ,MAAR;GACC,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK,KAAK;IACT,MAAM,UAAU,eAAe,KAAK,IAAI,GAAG,CAAC;IAC5C,IAAI,YAAY,KAAK,GAAG;KACvB,OAAO;KACP,KAAK;KACL;IACD;IACA,OAAO;IACP,KAAK;IACL;GACD;GACA,KAAK,KAAK;IACT,MAAM,UAAU,eAAe,KAAK,IAAI,GAAG,CAAC;IAC5C,IAAI,YAAY,KAAK,GAAG;KACvB,OAAO;KACP,KAAK;KACL;IACD;IACA,OAAO;IACP,KAAK;IACL;GACD;GACA;IACC,OAAO,KAAK;IACZ,KAAK;IACL;EACF;CACD;CACA,OAAO;AACR;AACA,IAAI,uBAAuB,MAAM,qBAAqB;CACrD;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,eAAe;CACnD;CACA,QAAQ;EACP,MAAM,QAAQ,KAAK,MAAM,CAAC,EAAE,KAAK,OAAO,CAAC;EACzC,OAAO,UAAU,QAAQ,UAAU,OAAO,UAAU,MAAM,QAAQ,KAAK;CACxE;;;;;CAKA,QAAQ;EACP,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAK;EACtB,MAAM,MAAM,0BAA0B,IAAI,IAAI,IAAI,IAAI,KAAK,MAAM,GAAG,EAAE,IAAI,IAAI,KAAK,MAAM,CAAC;EAC1F,OAAO,KAAK,MAAM,MAAM,MAAM,0BAA0B,GAAG,IAAI,oBAAoB,GAAG;CACvF;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAK;CAClF;AACD;;AAEA,IAAI,uBAAuB,MAAM,qBAAqB;CACrD;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,MAAM;EACL,OAAO,eAAe,KAAK,QAAQ,iBAAiB,IAAI;CACzD;;CAEA,UAAU;EACT,MAAM,MAAM,KAAK,IAAI;EACrB,MAAM,QAAQ,KAAK,MAAM,CAAC,EAAE,KAAK;EACjC,MAAM,YAAY,KAAK,UAAU,CAAC,EAAE,KAAK;EACzC,QAAQ,UAAU,KAAK,IAAI,KAAK,GAAG,MAAM,OAAO,cAAc,KAAK,IAAI,KAAK,GAAG,UAAU,OAAO,KAAK,WAAW,CAAC,EAAE,KAAK,KAAK;CAC9H;CACA,UAAU;EACT,OAAO,eAAe,KAAK,QAAQ,qBAAqB,IAAI;CAC7D;CACA,mBAAmB;EAClB,OAAO,8BAA8B,KAAK,QAAQ,CAAC,EAAE,MAAM,KAAK,EAAE;CACnE;;CAEA,OAAO;EACN,MAAM,SAAS,KAAK,iBAAiB;EACrC,OAAO,OAAO,KAAK,OAAO,OAAO,KAAK;CACvC;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,kBAAkB,IAAI,qBAAqB,IAAI,IAAI,KAAK;CAC9E;AACD;AACA,IAAI,uBAAuB,MAAM,qBAAqB;CACrD;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,eAAe;CACnD;CACA,QAAQ;EACP,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAK;EACtB,OAAO,OAAO,IAAI,IAAI;CACvB;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAK;CAClF;AACD;AACA,IAAI,wBAAwB,MAAM,sBAAsB;CACvD;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC3C;CACA,QAAQ;EACP,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAK;EACtB,IAAI,IAAI,SAAS,QAAQ,OAAO;EAChC,IAAI,IAAI,SAAS,SAAS,OAAO;CAClC;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,uBAAuB,IAAI,sBAAsB,IAAI,IAAI,KAAK;CACpF;AACD;AACA,IAAI,uBAAuB,MAAM,qBAAqB;CACrD;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,SAAS;EACR,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC5C;CACA,SAAS;EACR,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC5C;CACA,CAAC,SAAS;EACT,OAAO,eAAe,KAAK,QAAQ,eAAe,IAAI;CACvD;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAK;CAClF;AACD;AACA,IAAI,iBAAiB,MAAM,eAAe;CACzC;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,MAAM;EACL,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;GAC3C,IAAI,EAAE,iBAAiB,aAAa;IACnC,IAAI,MAAM,SAAS,SAAS;IAC5B;GACD;GACA,OAAO,cAAc,KAAK,KAAK;EAChC;CACD;;;;;;CAMA,UAAU;EACT,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;GAC3C,IAAI,EAAE,iBAAiB,aAAa;IACnC,IAAI,MAAM,SAAS,SAAS;IAC5B;GACD;GACA,MAAM,aAAa,cAAc,KAAK,KAAK;GAC3C,IAAI,YAAY,OAAO,WAAW,MAAM,CAAC,EAAE;GAC3C,MAAM,YAAY,qBAAqB,KAAK,KAAK;GACjD,IAAI,WAAW,OAAO,UAAU,MAAM;GACtC;EACD;CACD;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC3C;CACA,QAAQ;EACP,IAAI,KAAK,MAAM,GAAG;GACjB,IAAI,YAAY;GAChB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;IAC3C,IAAI,EAAE,iBAAiB,aAAa;KACnC,IAAI,MAAM,SAAS,SAAS,YAAY;KACxC;IACD;IACA,IAAI,WAAW;KACd,MAAM,OAAO,eAAe,KAAK;KACjC,IAAI,MAAM,OAAO;IAClB;GACD;GACA;EACD;EACA,OAAO,eAAe,KAAK,QAAQ,cAAc;CAClD;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,gBAAgB,IAAI,eAAe,IAAI,IAAI,KAAK;CACtE;AACD;;AAEA,SAAS,cAAc,YAAY;CAClC,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,WAAW,WAAW,OAAO,YAAY,GAAG;EACtD,MAAM,OAAO,mBAAmB,aAAa,YAAY,KAAK,OAAO,IAAI,KAAK;EAC9E,IAAI,SAAS,KAAK,GAAG,MAAM,KAAK,IAAI;CACrC;CACA,OAAO;AACR;AACA,SAAS,eAAe,MAAM;CAC7B,OAAO,gBAAgB,KAAK,IAAI,KAAK,gBAAgB,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI,KAAK,sBAAsB,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,cAAc,KAAK,IAAI;AACrS;AACA,IAAI,kBAAkB,MAAM,gBAAgB;CAC3C;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,OAAO;EACN,IAAI,CAAC,KAAK,MAAM,GAAG,OAAO,KAAK;EAC/B,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACtD;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC3C;CACA,QAAQ;EACP,IAAI,KAAK,MAAM,GAAG;GACjB,IAAI,YAAY;GAChB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;IAC3C,IAAI,EAAE,iBAAiB,aAAa;KACnC,IAAI,MAAM,SAAS,SAAS,YAAY;KACxC;IACD;IACA,IAAI,WAAW;KACd,MAAM,OAAO,eAAe,KAAK;KACjC,IAAI,MAAM,OAAO;IAClB;GACD;GACA;EACD;EACA,OAAO,eAAe,KAAK,QAAQ,cAAc;CAClD;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAK;CACxE;AACD"}
1
+ {"version":3,"file":"expressions-BlhT51Ib-DfkeWOwr.mjs","names":["#state","#childSlots","#childOffsets","#slots","#childOffset","#segmentBefore","#segmentAfter","#separatorCount"],"sources":["../../../../1-framework/2-authoring/psl-parser/dist/expressions-BlhT51Ib.mjs"],"sourcesContent":["import { r as isTerminatedStringLiteral } from \"./tokenizer-Dz9ZnxyT.mjs\";\nimport { canonicalizeTaggedLiteralBody } from \"@internal/framework-components/authoring\";\nimport { resolvePslBacktickEscapes } from \"@internal/framework-components/control\";\n//#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\n//#region src/syntax/ast/identifier.ts\nvar IdentifierAst = class IdentifierAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\ttoken() {\n\t\treturn findChildToken(this.syntax, \"Ident\");\n\t}\n\tname() {\n\t\treturn this.token()?.text;\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"Identifier\" ? new IdentifierAst(node) : void 0;\n\t}\n};\n//#endregion\n//#region src/syntax/ast/qualified-name.ts\n/** A namespace-qualified name, e.g. `pgvector.Vector` or `supabase:auth.User`. */\nvar QualifiedNameAst = class QualifiedNameAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\t#segmentBefore(boundary) {\n\t\tlet found;\n\t\tfor (const segment of filterChildren(this.syntax, IdentifierAst.cast)) {\n\t\t\tif (segment.syntax.offset >= boundary) break;\n\t\t\tfound = segment;\n\t\t}\n\t\treturn found;\n\t}\n\t#segmentAfter(boundary) {\n\t\tfor (const segment of filterChildren(this.syntax, IdentifierAst.cast)) if (segment.syntax.offset > boundary) return segment;\n\t}\n\t#separatorCount(kind) {\n\t\tlet count = 0;\n\t\tfor (const child of this.syntax.children()) if (!(child instanceof SyntaxNode) && child.kind === kind) count++;\n\t\treturn count;\n\t}\n\tcolon() {\n\t\treturn findChildToken(this.syntax, \"Colon\");\n\t}\n\tdot() {\n\t\treturn findChildToken(this.syntax, \"Dot\");\n\t}\n\tspace() {\n\t\tconst colon = this.colon();\n\t\tif (!colon) return void 0;\n\t\treturn this.#segmentBefore(colon.offset);\n\t}\n\tnamespace() {\n\t\tconst dot = this.dot();\n\t\tif (!dot) return void 0;\n\t\treturn this.#segmentBefore(dot.offset);\n\t}\n\tidentifier() {\n\t\tconst dot = this.dot();\n\t\tif (dot) return this.#segmentAfter(dot.offset);\n\t\tconst colon = this.colon();\n\t\tif (colon) return this.#segmentAfter(colon.offset);\n\t\treturn findFirstChild(this.syntax, IdentifierAst.cast);\n\t}\n\tsegments() {\n\t\treturn filterChildren(this.syntax, IdentifierAst.cast);\n\t}\n\t/**\n\t* Every identifier segment, in source order. A bare `Vector` yields\n\t* `['Vector']`; a qualified `pgvector.Vector` yields `['pgvector', 'Vector']`.\n\t*/\n\tpath() {\n\t\tconst segments = [];\n\t\tfor (const segment of this.segments()) {\n\t\t\tconst text = segment.token()?.text;\n\t\t\tif (text !== void 0) segments.push(text);\n\t\t}\n\t\treturn segments;\n\t}\n\t/** True iff this is a single unqualified identifier whose text equals `name`. */\n\tisSimpleName(name) {\n\t\tif (this.dot() !== void 0 || this.colon() !== void 0) return false;\n\t\treturn this.identifier()?.token()?.text === name;\n\t}\n\t/**\n\t* Flags a malformed name with more qualifier segments than allowed (a second\n\t* `:`-space or a second `.`-namespace).\n\t*/\n\tisOverQualified() {\n\t\treturn this.#separatorCount(\"Dot\") > 1 || this.#separatorCount(\"Colon\") > 1;\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"QualifiedName\" ? new QualifiedNameAst(node) : void 0;\n\t}\n};\n//#endregion\n//#region src/syntax/ast/expressions.ts\nvar FunctionCallAst = class FunctionCallAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\t/** The callee when it is a bare name, such as `now` in `now()`; `undefined` when the callee is dotted. */\n\tname() {\n\t\treturn findFirstChild(this.syntax, QualifiedNameAst.cast);\n\t}\n\t/**\n\t* The callee's segments, in source order. A bare `Vector(…)` yields\n\t* `['Vector']`; `pgvector.Vector(…)` yields `['pgvector', 'Vector']`;\n\t* `address.geo.lat(…)` yields `['address', 'geo', 'lat']`. Empty when the\n\t* call carries no identifier.\n\t*/\n\tpath() {\n\t\treturn segmentNames((this.name() ?? this.memberPath())?.syntax ?? this.syntax);\n\t}\n\t/** The callee when it is dotted, such as `address.city` in `address.city(sort: Asc)`; `undefined` for a bare callee. */\n\tmemberPath() {\n\t\treturn findFirstChild(this.syntax, PathExprAst.cast);\n\t}\n\tlparen() {\n\t\treturn findChildToken(this.syntax, \"LParen\");\n\t}\n\trparen() {\n\t\treturn findChildToken(this.syntax, \"RParen\");\n\t}\n\t*args() {\n\t\tyield* filterChildren(this.syntax, AttributeArgAst.cast);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"FunctionCall\" ? new FunctionCallAst(node) : void 0;\n\t}\n};\nfunction segmentNames(node) {\n\tconst segments = [];\n\tfor (const segment of filterChildren(node, IdentifierAst.cast)) {\n\t\tconst text = segment.token()?.text;\n\t\tif (text !== void 0) segments.push(text);\n\t}\n\treturn segments;\n}\n/** A dotted member path in expression position, such as `address.city` in `@@index([address.city])`. */\nvar PathExprAst = class PathExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\t*segments() {\n\t\tyield* filterChildren(this.syntax, IdentifierAst.cast);\n\t}\n\t/**\n\t* The segment names, in source order: `['address', 'city']` for `address.city`. A path that ends\n\t* in a `.` with no name after it, as in `address.`, ends in an empty name.\n\t*/\n\tpath() {\n\t\tconst segments = segmentNames(this.syntax);\n\t\treturn this.syntax.lastToken?.kind === \"Dot\" ? [...segments, \"\"] : segments;\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"PathExpr\" ? new PathExprAst(node) : void 0;\n\t}\n};\nvar ArrayLiteralAst = class ArrayLiteralAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\tlbracket() {\n\t\treturn findChildToken(this.syntax, \"LBracket\");\n\t}\n\trbracket() {\n\t\treturn findChildToken(this.syntax, \"RBracket\");\n\t}\n\t*elements() {\n\t\tyield* filterChildren(this.syntax, castExpression);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"ArrayLiteral\" ? new ArrayLiteralAst(node) : void 0;\n\t}\n};\nconst HEX = /^[0-9a-fA-F]+$/;\nfunction decodeFixedHex(raw, start, width) {\n\tif (start + width > raw.length) return void 0;\n\tconst hex = raw.slice(start, start + width);\n\tif (!HEX.test(hex)) return void 0;\n\treturn String.fromCharCode(Number.parseInt(hex, 16));\n}\nfunction decodeStringLiteral(raw) {\n\tlet out = \"\";\n\tlet i = 0;\n\twhile (i < raw.length) {\n\t\tconst ch = raw.charAt(i);\n\t\tif (ch !== \"\\\\\" || i + 1 >= raw.length) {\n\t\t\tout += ch;\n\t\t\ti++;\n\t\t\tcontinue;\n\t\t}\n\t\tconst next = raw.charAt(i + 1);\n\t\tswitch (next) {\n\t\t\tcase \"/\":\n\t\t\t\tout += \"/\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"b\":\n\t\t\t\tout += \"\\b\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"f\":\n\t\t\t\tout += \"\\f\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"n\":\n\t\t\t\tout += \"\\n\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"r\":\n\t\t\t\tout += \"\\r\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"t\":\n\t\t\t\tout += \"\t\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"\\\"\":\n\t\t\t\tout += \"\\\"\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"'\":\n\t\t\t\tout += \"'\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"\\\\\":\n\t\t\t\tout += \"\\\\\";\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t\tcase \"x\": {\n\t\t\t\tconst decoded = decodeFixedHex(raw, i + 2, 2);\n\t\t\t\tif (decoded === void 0) {\n\t\t\t\t\tout += \"\\\\x\";\n\t\t\t\t\ti += 2;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tout += decoded;\n\t\t\t\ti += 4;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tcase \"u\": {\n\t\t\t\tconst decoded = decodeFixedHex(raw, i + 2, 4);\n\t\t\t\tif (decoded === void 0) {\n\t\t\t\t\tout += \"\\\\u\";\n\t\t\t\t\ti += 2;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tout += decoded;\n\t\t\t\ti += 6;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\tout += `\\\\${next}`;\n\t\t\t\ti += 2;\n\t\t\t\tcontinue;\n\t\t}\n\t}\n\treturn out;\n}\nvar StringLiteralExprAst = class StringLiteralExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\ttoken() {\n\t\treturn findChildToken(this.syntax, \"StringLiteral\");\n\t}\n\tquote() {\n\t\tconst quote = this.token()?.text.charAt(0);\n\t\treturn quote === \"\\\"\" || quote === \"'\" || quote === \"`\" ? quote : void 0;\n\t}\n\t/**\n\t* The decoded string. A `\"` or `'` string resolves the usual escapes; a backtick string resolves\n\t* only `` \\` `` and `\\\\`, keeping every other backslash sequence as written.\n\t*/\n\tvalue() {\n\t\tconst tok = this.token();\n\t\tif (!tok) return void 0;\n\t\tconst raw = isTerminatedStringLiteral(tok.text) ? tok.text.slice(1, -1) : tok.text.slice(1);\n\t\treturn this.quote() === \"`\" ? resolvePslBacktickEscapes(raw) : decodeStringLiteral(raw);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"StringLiteralExpr\" ? new StringLiteralExprAst(node) : void 0;\n\t}\n};\n/** `` tag`body` ``, `tag\"body\"`, or `tag'body'`: a qualified-name tag followed by a string literal. */\nvar TaggedLiteralExprAst = class TaggedLiteralExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\ttag() {\n\t\treturn findFirstChild(this.syntax, QualifiedNameAst.cast);\n\t}\n\t/** The tag without trivia, e.g. `postgis.geometry`. */\n\ttagName() {\n\t\tconst tag = this.tag();\n\t\tconst space = tag?.space()?.name();\n\t\tconst namespace = tag?.namespace()?.name();\n\t\treturn (space === void 0 ? \"\" : `${space}:`) + (namespace === void 0 ? \"\" : `${namespace}.`) + (tag?.identifier()?.name() ?? \"\");\n\t}\n\tliteral() {\n\t\treturn findFirstChild(this.syntax, StringLiteralExprAst.cast);\n\t}\n\tcanonicalization() {\n\t\treturn canonicalizeTaggedLiteralBody(this.literal()?.value() ?? \"\");\n\t}\n\t/** The canonical text shared with the TypeScript `sql` tag, or `undefined` when canonicalization fails. */\n\ttext() {\n\t\tconst result = this.canonicalization();\n\t\treturn result.ok ? result.text : void 0;\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"TaggedLiteral\" ? new TaggedLiteralExprAst(node) : void 0;\n\t}\n};\nvar NumberLiteralExprAst = class NumberLiteralExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\ttoken() {\n\t\treturn findChildToken(this.syntax, \"NumberLiteral\");\n\t}\n\tvalue() {\n\t\tconst tok = this.token();\n\t\tif (!tok) return void 0;\n\t\treturn Number(tok.text);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"NumberLiteralExpr\" ? new NumberLiteralExprAst(node) : void 0;\n\t}\n};\nvar BooleanLiteralExprAst = class BooleanLiteralExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\ttoken() {\n\t\treturn findChildToken(this.syntax, \"Ident\");\n\t}\n\tvalue() {\n\t\tconst tok = this.token();\n\t\tif (!tok) return void 0;\n\t\tif (tok.text === \"true\") return true;\n\t\tif (tok.text === \"false\") return false;\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"BooleanLiteralExpr\" ? new BooleanLiteralExprAst(node) : void 0;\n\t}\n};\nvar ObjectLiteralExprAst = class ObjectLiteralExprAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\tlbrace() {\n\t\treturn findChildToken(this.syntax, \"LBrace\");\n\t}\n\trbrace() {\n\t\treturn findChildToken(this.syntax, \"RBrace\");\n\t}\n\t*fields() {\n\t\tyield* filterChildren(this.syntax, ObjectFieldAst.cast);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"ObjectLiteralExpr\" ? new ObjectLiteralExprAst(node) : void 0;\n\t}\n};\nvar ObjectFieldAst = class ObjectFieldAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\tkey() {\n\t\tfor (const child of this.syntax.children()) {\n\t\t\tif (!(child instanceof SyntaxNode)) {\n\t\t\t\tif (child.kind === \"Colon\") break;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\treturn IdentifierAst.cast(child);\n\t\t}\n\t}\n\t/**\n\t* The field's logical key name, unquoted. An identifier key (`length:`) yields\n\t* its text; a string-literal key (`\"length\":`) yields the decoded string.\n\t* `undefined` when the field carries no key node.\n\t*/\n\tkeyName() {\n\t\tfor (const child of this.syntax.children()) {\n\t\t\tif (!(child instanceof SyntaxNode)) {\n\t\t\t\tif (child.kind === \"Colon\") break;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst identifier = IdentifierAst.cast(child);\n\t\t\tif (identifier) return identifier.token()?.text;\n\t\t\tconst stringKey = StringLiteralExprAst.cast(child);\n\t\t\tif (stringKey) return stringKey.value();\n\t\t\treturn;\n\t\t}\n\t}\n\tcolon() {\n\t\treturn findChildToken(this.syntax, \"Colon\");\n\t}\n\tvalue() {\n\t\tif (this.colon()) {\n\t\t\tlet pastColon = false;\n\t\t\tfor (const child of this.syntax.children()) {\n\t\t\t\tif (!(child instanceof SyntaxNode)) {\n\t\t\t\t\tif (child.kind === \"Colon\") pastColon = true;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (pastColon) {\n\t\t\t\t\tconst expr = castExpression(child);\n\t\t\t\t\tif (expr) return expr;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\treturn findFirstChild(this.syntax, castExpression);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"ObjectField\" ? new ObjectFieldAst(node) : void 0;\n\t}\n};\n/** Every dotted path in an expression: the expression itself, a dotted callee, or a path inside a list, record or call argument. */\nfunction dottedPathsIn(expression) {\n\tconst paths = [];\n\tfor (const element of expression.syntax.descendants()) {\n\t\tconst path = element instanceof SyntaxNode ? PathExprAst.cast(element) : void 0;\n\t\tif (path !== void 0) paths.push(path);\n\t}\n\treturn paths;\n}\nfunction castExpression(node) {\n\treturn FunctionCallAst.cast(node) ?? ArrayLiteralAst.cast(node) ?? StringLiteralExprAst.cast(node) ?? TaggedLiteralExprAst.cast(node) ?? NumberLiteralExprAst.cast(node) ?? BooleanLiteralExprAst.cast(node) ?? ObjectLiteralExprAst.cast(node) ?? PathExprAst.cast(node) ?? IdentifierAst.cast(node);\n}\nvar AttributeArgAst = class AttributeArgAst {\n\tsyntax;\n\tconstructor(syntax) {\n\t\tthis.syntax = syntax;\n\t}\n\tname() {\n\t\tif (!this.colon()) return void 0;\n\t\treturn findFirstChild(this.syntax, IdentifierAst.cast);\n\t}\n\tcolon() {\n\t\treturn findChildToken(this.syntax, \"Colon\");\n\t}\n\tvalue() {\n\t\tif (this.colon()) {\n\t\t\tlet pastColon = false;\n\t\t\tfor (const child of this.syntax.children()) {\n\t\t\t\tif (!(child instanceof SyntaxNode)) {\n\t\t\t\t\tif (child.kind === \"Colon\") pastColon = true;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (pastColon) {\n\t\t\t\t\tconst expr = castExpression(child);\n\t\t\t\t\tif (expr) return expr;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\treturn findFirstChild(this.syntax, castExpression);\n\t}\n\tstatic cast(node) {\n\t\treturn node.kind === \"AttributeArg\" ? new AttributeArgAst(node) : void 0;\n\t}\n};\n//#endregion\nexport { TokenAtOffset as C, SyntaxToken as S, findChildToken as _, NumberLiteralExprAst as a, readDocComment as b, PathExprAst as c, castExpression as d, dottedPathsIn as f, filterChildren as g, any as h, FunctionCallAst as i, StringLiteralExprAst as l, IdentifierAst as m, AttributeArgAst as n, ObjectFieldAst as o, QualifiedNameAst as p, BooleanLiteralExprAst as r, ObjectLiteralExprAst as s, ArrayLiteralAst as t, TaggedLiteralExprAst as u, findFirstChild as v, createSyntaxTree as w, SyntaxNode as x, printSyntax as y };\n\n//# sourceMappingURL=expressions-BlhT51Ib.mjs.map"],"mappings":";;;;;;;;;;AAWA,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;AAGA,IAAI,gBAAgB,MAAM,cAAc;CACvC;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC3C;CACA,OAAO;EACN,OAAO,KAAK,MAAM,CAAC,EAAE;CACtB;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,eAAe,IAAI,cAAc,IAAI,IAAI,KAAK;CACpE;AACD;;AAIA,IAAI,mBAAmB,MAAM,iBAAiB;CAC7C;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,eAAe,UAAU;EACxB,IAAI;EACJ,KAAK,MAAM,WAAW,eAAe,KAAK,QAAQ,cAAc,IAAI,GAAG;GACtE,IAAI,QAAQ,OAAO,UAAU,UAAU;GACvC,QAAQ;EACT;EACA,OAAO;CACR;CACA,cAAc,UAAU;EACvB,KAAK,MAAM,WAAW,eAAe,KAAK,QAAQ,cAAc,IAAI,GAAG,IAAI,QAAQ,OAAO,SAAS,UAAU,OAAO;CACrH;CACA,gBAAgB,MAAM;EACrB,IAAI,QAAQ;EACZ,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG,IAAI,EAAE,iBAAiB,eAAe,MAAM,SAAS,MAAM;EACvG,OAAO;CACR;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC3C;CACA,MAAM;EACL,OAAO,eAAe,KAAK,QAAQ,KAAK;CACzC;CACA,QAAQ;EACP,MAAM,QAAQ,KAAK,MAAM;EACzB,IAAI,CAAC,OAAO,OAAO,KAAK;EACxB,OAAO,KAAKC,eAAe,MAAM,MAAM;CACxC;CACA,YAAY;EACX,MAAM,MAAM,KAAK,IAAI;EACrB,IAAI,CAAC,KAAK,OAAO,KAAK;EACtB,OAAO,KAAKA,eAAe,IAAI,MAAM;CACtC;CACA,aAAa;EACZ,MAAM,MAAM,KAAK,IAAI;EACrB,IAAI,KAAK,OAAO,KAAKC,cAAc,IAAI,MAAM;EAC7C,MAAM,QAAQ,KAAK,MAAM;EACzB,IAAI,OAAO,OAAO,KAAKA,cAAc,MAAM,MAAM;EACjD,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACtD;CACA,WAAW;EACV,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACtD;;;;;CAKA,OAAO;EACN,MAAM,WAAW,CAAC;EAClB,KAAK,MAAM,WAAW,KAAK,SAAS,GAAG;GACtC,MAAM,OAAO,QAAQ,MAAM,CAAC,EAAE;GAC9B,IAAI,SAAS,KAAK,GAAG,SAAS,KAAK,IAAI;EACxC;EACA,OAAO;CACR;;CAEA,aAAa,MAAM;EAClB,IAAI,KAAK,IAAI,MAAM,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,GAAG,OAAO;EAC7D,OAAO,KAAK,WAAW,CAAC,EAAE,MAAM,CAAC,EAAE,SAAS;CAC7C;;;;;CAKA,kBAAkB;EACjB,OAAO,KAAKC,gBAAgB,KAAK,IAAI,KAAK,KAAKA,gBAAgB,OAAO,IAAI;CAC3E;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,kBAAkB,IAAI,iBAAiB,IAAI,IAAI,KAAK;CAC1E;AACD;AAGA,IAAI,kBAAkB,MAAM,gBAAgB;CAC3C;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;;CAEA,OAAO;EACN,OAAO,eAAe,KAAK,QAAQ,iBAAiB,IAAI;CACzD;;;;;;;CAOA,OAAO;EACN,OAAO,cAAc,KAAK,KAAK,KAAK,KAAK,WAAW,EAAA,EAAI,UAAU,KAAK,MAAM;CAC9E;;CAEA,aAAa;EACZ,OAAO,eAAe,KAAK,QAAQ,YAAY,IAAI;CACpD;CACA,SAAS;EACR,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC5C;CACA,SAAS;EACR,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC5C;CACA,CAAC,OAAO;EACP,OAAO,eAAe,KAAK,QAAQ,gBAAgB,IAAI;CACxD;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAK;CACxE;AACD;AACA,SAAS,aAAa,MAAM;CAC3B,MAAM,WAAW,CAAC;CAClB,KAAK,MAAM,WAAW,eAAe,MAAM,cAAc,IAAI,GAAG;EAC/D,MAAM,OAAO,QAAQ,MAAM,CAAC,EAAE;EAC9B,IAAI,SAAS,KAAK,GAAG,SAAS,KAAK,IAAI;CACxC;CACA,OAAO;AACR;;AAEA,IAAI,cAAc,MAAM,YAAY;CACnC;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,CAAC,WAAW;EACX,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACtD;;;;;CAKA,OAAO;EACN,MAAM,WAAW,aAAa,KAAK,MAAM;EACzC,OAAO,KAAK,OAAO,WAAW,SAAS,QAAQ,CAAC,GAAG,UAAU,EAAE,IAAI;CACpE;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,aAAa,IAAI,YAAY,IAAI,IAAI,KAAK;CAChE;AACD;AACA,IAAI,kBAAkB,MAAM,gBAAgB;CAC3C;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,WAAW;EACV,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC9C;CACA,WAAW;EACV,OAAO,eAAe,KAAK,QAAQ,UAAU;CAC9C;CACA,CAAC,WAAW;EACX,OAAO,eAAe,KAAK,QAAQ,cAAc;CAClD;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAK;CACxE;AACD;AACA,MAAM,MAAM;AACZ,SAAS,eAAe,KAAK,OAAO,OAAO;CAC1C,IAAI,QAAQ,QAAQ,IAAI,QAAQ,OAAO,KAAK;CAC5C,MAAM,MAAM,IAAI,MAAM,OAAO,QAAQ,KAAK;CAC1C,IAAI,CAAC,IAAI,KAAK,GAAG,GAAG,OAAO,KAAK;CAChC,OAAO,OAAO,aAAa,OAAO,SAAS,KAAK,EAAE,CAAC;AACpD;AACA,SAAS,oBAAoB,KAAK;CACjC,IAAI,MAAM;CACV,IAAI,IAAI;CACR,OAAO,IAAI,IAAI,QAAQ;EACtB,MAAM,KAAK,IAAI,OAAO,CAAC;EACvB,IAAI,OAAO,QAAQ,IAAI,KAAK,IAAI,QAAQ;GACvC,OAAO;GACP;GACA;EACD;EACA,MAAM,OAAO,IAAI,OAAO,IAAI,CAAC;EAC7B,QAAQ,MAAR;GACC,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK;IACJ,OAAO;IACP,KAAK;IACL;GACD,KAAK,KAAK;IACT,MAAM,UAAU,eAAe,KAAK,IAAI,GAAG,CAAC;IAC5C,IAAI,YAAY,KAAK,GAAG;KACvB,OAAO;KACP,KAAK;KACL;IACD;IACA,OAAO;IACP,KAAK;IACL;GACD;GACA,KAAK,KAAK;IACT,MAAM,UAAU,eAAe,KAAK,IAAI,GAAG,CAAC;IAC5C,IAAI,YAAY,KAAK,GAAG;KACvB,OAAO;KACP,KAAK;KACL;IACD;IACA,OAAO;IACP,KAAK;IACL;GACD;GACA;IACC,OAAO,KAAK;IACZ,KAAK;IACL;EACF;CACD;CACA,OAAO;AACR;AACA,IAAI,uBAAuB,MAAM,qBAAqB;CACrD;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,eAAe;CACnD;CACA,QAAQ;EACP,MAAM,QAAQ,KAAK,MAAM,CAAC,EAAE,KAAK,OAAO,CAAC;EACzC,OAAO,UAAU,QAAQ,UAAU,OAAO,UAAU,MAAM,QAAQ,KAAK;CACxE;;;;;CAKA,QAAQ;EACP,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAK;EACtB,MAAM,MAAM,0BAA0B,IAAI,IAAI,IAAI,IAAI,KAAK,MAAM,GAAG,EAAE,IAAI,IAAI,KAAK,MAAM,CAAC;EAC1F,OAAO,KAAK,MAAM,MAAM,MAAM,0BAA0B,GAAG,IAAI,oBAAoB,GAAG;CACvF;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAK;CAClF;AACD;;AAEA,IAAI,uBAAuB,MAAM,qBAAqB;CACrD;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,MAAM;EACL,OAAO,eAAe,KAAK,QAAQ,iBAAiB,IAAI;CACzD;;CAEA,UAAU;EACT,MAAM,MAAM,KAAK,IAAI;EACrB,MAAM,QAAQ,KAAK,MAAM,CAAC,EAAE,KAAK;EACjC,MAAM,YAAY,KAAK,UAAU,CAAC,EAAE,KAAK;EACzC,QAAQ,UAAU,KAAK,IAAI,KAAK,GAAG,MAAM,OAAO,cAAc,KAAK,IAAI,KAAK,GAAG,UAAU,OAAO,KAAK,WAAW,CAAC,EAAE,KAAK,KAAK;CAC9H;CACA,UAAU;EACT,OAAO,eAAe,KAAK,QAAQ,qBAAqB,IAAI;CAC7D;CACA,mBAAmB;EAClB,OAAO,8BAA8B,KAAK,QAAQ,CAAC,EAAE,MAAM,KAAK,EAAE;CACnE;;CAEA,OAAO;EACN,MAAM,SAAS,KAAK,iBAAiB;EACrC,OAAO,OAAO,KAAK,OAAO,OAAO,KAAK;CACvC;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,kBAAkB,IAAI,qBAAqB,IAAI,IAAI,KAAK;CAC9E;AACD;AACA,IAAI,uBAAuB,MAAM,qBAAqB;CACrD;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,eAAe;CACnD;CACA,QAAQ;EACP,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAK;EACtB,OAAO,OAAO,IAAI,IAAI;CACvB;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAK;CAClF;AACD;AACA,IAAI,wBAAwB,MAAM,sBAAsB;CACvD;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC3C;CACA,QAAQ;EACP,MAAM,MAAM,KAAK,MAAM;EACvB,IAAI,CAAC,KAAK,OAAO,KAAK;EACtB,IAAI,IAAI,SAAS,QAAQ,OAAO;EAChC,IAAI,IAAI,SAAS,SAAS,OAAO;CAClC;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,uBAAuB,IAAI,sBAAsB,IAAI,IAAI,KAAK;CACpF;AACD;AACA,IAAI,uBAAuB,MAAM,qBAAqB;CACrD;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,SAAS;EACR,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC5C;CACA,SAAS;EACR,OAAO,eAAe,KAAK,QAAQ,QAAQ;CAC5C;CACA,CAAC,SAAS;EACT,OAAO,eAAe,KAAK,QAAQ,eAAe,IAAI;CACvD;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,sBAAsB,IAAI,qBAAqB,IAAI,IAAI,KAAK;CAClF;AACD;AACA,IAAI,iBAAiB,MAAM,eAAe;CACzC;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,MAAM;EACL,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;GAC3C,IAAI,EAAE,iBAAiB,aAAa;IACnC,IAAI,MAAM,SAAS,SAAS;IAC5B;GACD;GACA,OAAO,cAAc,KAAK,KAAK;EAChC;CACD;;;;;;CAMA,UAAU;EACT,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;GAC3C,IAAI,EAAE,iBAAiB,aAAa;IACnC,IAAI,MAAM,SAAS,SAAS;IAC5B;GACD;GACA,MAAM,aAAa,cAAc,KAAK,KAAK;GAC3C,IAAI,YAAY,OAAO,WAAW,MAAM,CAAC,EAAE;GAC3C,MAAM,YAAY,qBAAqB,KAAK,KAAK;GACjD,IAAI,WAAW,OAAO,UAAU,MAAM;GACtC;EACD;CACD;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC3C;CACA,QAAQ;EACP,IAAI,KAAK,MAAM,GAAG;GACjB,IAAI,YAAY;GAChB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;IAC3C,IAAI,EAAE,iBAAiB,aAAa;KACnC,IAAI,MAAM,SAAS,SAAS,YAAY;KACxC;IACD;IACA,IAAI,WAAW;KACd,MAAM,OAAO,eAAe,KAAK;KACjC,IAAI,MAAM,OAAO;IAClB;GACD;GACA;EACD;EACA,OAAO,eAAe,KAAK,QAAQ,cAAc;CAClD;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,gBAAgB,IAAI,eAAe,IAAI,IAAI,KAAK;CACtE;AACD;;AAEA,SAAS,cAAc,YAAY;CAClC,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,WAAW,WAAW,OAAO,YAAY,GAAG;EACtD,MAAM,OAAO,mBAAmB,aAAa,YAAY,KAAK,OAAO,IAAI,KAAK;EAC9E,IAAI,SAAS,KAAK,GAAG,MAAM,KAAK,IAAI;CACrC;CACA,OAAO;AACR;AACA,SAAS,eAAe,MAAM;CAC7B,OAAO,gBAAgB,KAAK,IAAI,KAAK,gBAAgB,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI,KAAK,sBAAsB,KAAK,IAAI,KAAK,qBAAqB,KAAK,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,cAAc,KAAK,IAAI;AACrS;AACA,IAAI,kBAAkB,MAAM,gBAAgB;CAC3C;CACA,YAAY,QAAQ;EACnB,KAAK,SAAS;CACf;CACA,OAAO;EACN,IAAI,CAAC,KAAK,MAAM,GAAG,OAAO,KAAK;EAC/B,OAAO,eAAe,KAAK,QAAQ,cAAc,IAAI;CACtD;CACA,QAAQ;EACP,OAAO,eAAe,KAAK,QAAQ,OAAO;CAC3C;CACA,QAAQ;EACP,IAAI,KAAK,MAAM,GAAG;GACjB,IAAI,YAAY;GAChB,KAAK,MAAM,SAAS,KAAK,OAAO,SAAS,GAAG;IAC3C,IAAI,EAAE,iBAAiB,aAAa;KACnC,IAAI,MAAM,SAAS,SAAS,YAAY;KACxC;IACD;IACA,IAAI,WAAW;KACd,MAAM,OAAO,eAAe,KAAK;KACjC,IAAI,MAAM,OAAO;IAClB;GACD;GACA;EACD;EACA,OAAO,eAAe,KAAK,QAAQ,cAAc;CAClD;CACA,OAAO,KAAK,MAAM;EACjB,OAAO,KAAK,SAAS,iBAAiB,IAAI,gBAAgB,IAAI,IAAI,KAAK;CACxE;AACD"}
@@ -1,8 +1,9 @@
1
1
  import { t as blindCast } from "./casts-DpaahrlC-Bd5n2coI.mjs";
2
2
  import { t as InternalError } from "./internal-error-ChGYPVpq-DhUD05u0.mjs";
3
+ import { n as compareCodeUnits } from "./canonicalization-path-match-D88xLEq6-BFQC39ZG.mjs";
3
4
  import { n as runtimeError } from "./runtime-error-BA9d7XjZ-BlT8t6LB.mjs";
4
5
  import { n as isCodecTrait } from "./codec-types-BXLUbk-Y-DpGfKGK0.mjs";
5
- //#region ../../../1-framework/1-core/framework-components/dist/generator-functions-CXbQfvYu.mjs
6
+ //#region ../../../1-framework/1-core/framework-components/dist/generator-functions-VMolCOGa.mjs
6
7
  /**
7
8
  * Ownership key of an `(operation, input)` pair. Two descriptors sharing a key are two contributors claiming one overload, which is a composition error.
8
9
  */
@@ -72,7 +73,7 @@ function isPlainObject(value) {
72
73
  function sortDeep(value) {
73
74
  if (Array.isArray(value)) return value.map(sortDeep);
74
75
  if (!isPlainObject(value)) return value;
75
- const entries = Object.entries(value).sort(([a], [b]) => a.localeCompare(b));
76
+ const entries = Object.entries(value).sort(([a], [b]) => compareCodeUnits(a, b));
76
77
  const next = {};
77
78
  for (const [key, child] of entries) next[key] = sortDeep(child);
78
79
  return next;
@@ -268,4 +269,4 @@ const EMPTY_GENERATOR_FUNCTIONS = assembleGeneratorFunctions([]);
268
269
  //#endregion
269
270
  export { isAggregateDescriptor as a, mergeCapabilityMatrices as c, assembleGeneratorRegistrations as i, singleGeneratorBinding as l, aggregateDescriptorKey as n, isAnyInputAggregateDescriptor as o, assembleGeneratorFunctions as r, isNoInputAggregateDescriptor as s, EMPTY_GENERATOR_FUNCTIONS as t };
270
271
 
271
- //# sourceMappingURL=generator-functions-CXbQfvYu-BIFU1Ryx.mjs.map
272
+ //# sourceMappingURL=generator-functions-VMolCOGa-xY11fV0Q.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"generator-functions-VMolCOGa-xY11fV0Q.mjs","names":[],"sources":["../../../../1-framework/1-core/framework-components/dist/generator-functions-VMolCOGa.mjs"],"sourcesContent":["import { n as runtimeError } from \"./runtime-error-BA9d7XjZ.mjs\";\nimport { n as isCodecTrait } from \"./codec-types-BXLUbk-Y.mjs\";\nimport { InternalError } from \"@internal/utils/internal-error\";\nimport { blindCast } from \"@internal/utils/casts\";\nimport { compareCodeUnits } from \"@internal/contract/hashing-utils\";\n//#region src/shared/aggregate-descriptor.ts\n/**\n* Ownership key of an `(operation, input)` pair. Two descriptors sharing a key are two contributors claiming one overload, which is a composition error.\n*/\nfunction aggregateDescriptorKey(descriptor) {\n\tswitch (descriptor.input.kind) {\n\t\tcase \"none\": return `${descriptor.operation}:none`;\n\t\tcase \"any\": return `${descriptor.operation}:any`;\n\t\tcase \"codec\": return `${descriptor.operation}:codec:${descriptor.input.codecId}`;\n\t\tcase \"trait\": return `${descriptor.operation}:trait:${descriptor.input.trait}`;\n\t}\n}\n/** Whether `descriptor` is the overload of an operation that consumes no value — the case whose result always names a codec outright. */\nfunction isNoInputAggregateDescriptor(descriptor) {\n\treturn descriptor.input.kind === \"none\";\n}\n/** Whether `descriptor` answers regardless of input — the fallback rung of resolution. */\nfunction isAnyInputAggregateDescriptor(descriptor) {\n\treturn descriptor.input.kind === \"any\";\n}\nfunction isObjectLike(value) {\n\treturn typeof value === \"object\" && value !== null;\n}\nfunction isNonEmptyString(value) {\n\treturn typeof value === \"string\" && value.length > 0;\n}\nfunction isAggregateInputMatch(value) {\n\tif (!isObjectLike(value) || !(\"kind\" in value)) return false;\n\tswitch (value.kind) {\n\t\tcase \"none\":\n\t\tcase \"any\": return true;\n\t\tcase \"codec\": return \"codecId\" in value && isNonEmptyString(value.codecId);\n\t\tcase \"trait\": return \"trait\" in value && isCodecTrait(value.trait);\n\t\tdefault: return false;\n\t}\n}\nfunction isAggregateOutputCodec(value) {\n\tif (!isObjectLike(value) || !(\"kind\" in value)) return false;\n\tswitch (value.kind) {\n\t\tcase \"self\": return true;\n\t\tcase \"codec\": return \"codecId\" in value && isNonEmptyString(value.codecId) && (!(\"typeParams\" in value) || value.typeParams === void 0 || typeof value.typeParams === \"function\");\n\t\tdefault: return false;\n\t}\n}\n/**\n* Structural validation of a contributed descriptor. Components assembled from JavaScript reach the contribution slot unchecked, so composition validates the shape once and every later read is a plain lookup.\n*/\nfunction isAggregateDescriptor(value) {\n\tif (!isObjectLike(value)) return false;\n\tif (!(\"operation\" in value) || !isNonEmptyString(value.operation)) return false;\n\tif (!(\"nullable\" in value) || typeof value.nullable !== \"boolean\") return false;\n\tif (value.nullable === false && (!(\"emptyResultWire\" in value) || value.emptyResultWire === void 0)) return false;\n\tif (!(\"input\" in value) || !isAggregateInputMatch(value.input)) return false;\n\tif (!(\"output\" in value) || !isAggregateOutputCodec(value.output)) return false;\n\treturn value.input.kind === \"codec\" || value.input.kind === \"trait\" || value.output.kind === \"codec\";\n}\n//#endregion\n//#region src/shared/capabilities.ts\n/**\n* Capability matrix merge primitive shared by emit-time and runtime stack composition.\n*\n* The CLI's `enrichContract` and the SQL runtime's `createExecutionContext` both need\n* to fold a stack of component descriptors' `capabilities` declarations into a single\n* matrix keyed by namespace. Keeping the primitive here lets both call sites stay\n* byte-for-byte consistent without one depending on the other.\n*/\nfunction isPlainObject(value) {\n\treturn typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\nfunction sortDeep(value) {\n\tif (Array.isArray(value)) return value.map(sortDeep);\n\tif (!isPlainObject(value)) return value;\n\tconst entries = Object.entries(value).sort(([a], [b]) => compareCodeUnits(a, b));\n\tconst next = {};\n\tfor (const [key, child] of entries) next[key] = sortDeep(child);\n\treturn next;\n}\nfunction extractCapabilityMatrix(value) {\n\tif (!isPlainObject(value)) return {};\n\tconst out = {};\n\tfor (const [namespace, maybeCaps] of Object.entries(value)) {\n\t\tif (!isPlainObject(maybeCaps)) continue;\n\t\tconst caps = {};\n\t\tfor (const [key, flag] of Object.entries(maybeCaps)) if (typeof flag === \"boolean\") caps[key] = flag;\n\t\tif (Object.keys(caps).length > 0) out[namespace] = caps;\n\t}\n\treturn out;\n}\n/**\n* Merge an ordered list of contributor capability declarations into a base matrix.\n*\n* Behaviour:\n* - `base` and each contributor's `capabilities` are filtered through the same\n* structural extraction: non-plain-object namespace blocks are dropped,\n* non-boolean leaves inside a namespace block are dropped, and a namespace\n* block that ends up with zero boolean leaves is omitted entirely (so a\n* later contributor with a malformed namespace cannot erase a namespace\n* already present in `base`).\n* - Non-plain-object `capabilities` on a contributor (including `undefined`,\n* `null`, arrays, primitives) are skipped silently — the contributor\n* contributes nothing.\n* - Later contributors win on `(namespace, key)` collisions.\n* - The returned object is fresh — neither `base` nor any contributor is mutated.\n* - Output keys are sorted lexicographically at every plain-object level.\n*/\nfunction mergeCapabilityMatrices(base, contributors) {\n\tconst merged = extractCapabilityMatrix(base);\n\tfor (const contributor of contributors) {\n\t\tconst extracted = extractCapabilityMatrix(contributor.capabilities);\n\t\tfor (const [namespace, capabilities] of Object.entries(extracted)) merged[namespace] = {\n\t\t\t...merged[namespace] ?? {},\n\t\t\t...capabilities\n\t\t};\n\t}\n\treturn blindCast(sortDeep(merged));\n}\n//#endregion\n//#region src/shared/generator-functions.ts\nfunction namedParametersOf(signature) {\n\tif (typeof signature !== \"object\" || signature === null || !(\"named\" in signature)) return [];\n\tconst named = signature.named;\n\treturn typeof named === \"object\" && named !== null ? Object.keys(named) : [];\n}\nfunction invalidContribution(message) {\n\treturn runtimeError(\"CONTRACT.PACK_CONTRIBUTION_INVALID\", message);\n}\n/**\n* The generators the components register, by id. A generator registered by two components is refused: the component that defines a generator registers it, once.\n*/\nfunction assembleGeneratorRegistrations(descriptors) {\n\tconst registered = /* @__PURE__ */ new Map();\n\tfor (const component of descriptors) for (const descriptor of component.controlMutationDefaults?.generatorDescriptors ?? []) {\n\t\tconst existing = registered.get(descriptor.id);\n\t\tif (existing !== void 0) throw invalidContribution(`Generator \"${descriptor.id}\" is registered by both \"${existing.componentId ?? \"<unknown>\"}\" and \"${component.id ?? \"<unknown>\"}\". Register each generator once, in the component that defines it.`);\n\t\tregistered.set(descriptor.id, {\n\t\t\tdescriptor,\n\t\t\tcomponentId: component.id\n\t\t});\n\t}\n\treturn registered;\n}\n/**\n* Assemble the generator functions of a composed stack: the control stack's components, or the pack refs of a TypeScript contract. Every generator a binding produces must be registered by a generator descriptor of one of the components.\n*/\nfunction assembleGeneratorFunctions(descriptors) {\n\tconst registered = assembleGeneratorRegistrations(descriptors);\n\tconst declared = /* @__PURE__ */ new Map();\n\tconst bindingsByCodec = /* @__PURE__ */ new Map();\n\tconst printersByCodecAndGenerator = /* @__PURE__ */ new Map();\n\tconst contributed = [];\n\tfor (const descriptor of descriptors) {\n\t\tconst contributedBy = descriptor.id ?? \"<unknown>\";\n\t\tfor (const contribution of descriptor.generatorFunctions ?? []) {\n\t\t\tif (contribution.signature !== void 0) {\n\t\t\t\tconst [namedParameter] = namedParametersOf(contribution.signature);\n\t\t\t\tif (namedParameter !== void 0) throw invalidContribution(`Generator function \"${contribution.name}\" from \"${contributedBy}\" declares the named parameter \"${namedParameter}\". A generator function takes positional parameters only, because a TypeScript gen call passes its arguments by position; declare it in positional.`);\n\t\t\t\tconst existing = declared.get(contribution.name);\n\t\t\t\tif (existing !== void 0) throw invalidContribution(`Generator function \"${contribution.name}\" is declared by both \"${existing.declaredBy}\" and \"${contributedBy}\".`);\n\t\t\t\tdeclared.set(contribution.name, {\n\t\t\t\t\tsignature: contribution.signature,\n\t\t\t\t\tdeclaredBy: contributedBy\n\t\t\t\t});\n\t\t\t}\n\t\t\tfor (const binding of contribution.bindings) contributed.push({\n\t\t\t\tname: contribution.name,\n\t\t\t\tbinding,\n\t\t\t\tcontributedBy\n\t\t\t});\n\t\t}\n\t}\n\tfor (const owned of contributed) {\n\t\tif (!declared.has(owned.name)) throw invalidContribution(`\"${owned.contributedBy}\" binds generator function \"${owned.name}\", which no component declares.`);\n\t\tfor (const codecId of owned.binding.codecIds) {\n\t\t\tconst forCodec = bindingsByCodec.get(codecId) ?? /* @__PURE__ */ new Map();\n\t\t\tconst existing = forCodec.get(owned.name);\n\t\t\tif (existing !== void 0) throw invalidContribution(`Generator function \"${owned.name}\" is bound to codec \"${codecId}\" by both \"${existing.contributedBy}\" and \"${owned.contributedBy}\".`);\n\t\t\tforCodec.set(owned.name, owned);\n\t\t\tbindingsByCodec.set(codecId, forCodec);\n\t\t\tfor (const generatorId of owned.binding.generatorIds) {\n\t\t\t\tconst key = `${codecId}\\u0000${generatorId}`;\n\t\t\t\tconst printer = printersByCodecAndGenerator.get(key);\n\t\t\t\tif (printer !== void 0 && printer.name !== owned.name) throw invalidContribution(`Generator \"${generatorId}\" on codec \"${codecId}\" is written by both function \"${printer.name}\" from \"${printer.contributedBy}\" and function \"${owned.name}\" from \"${owned.contributedBy}\".`);\n\t\t\t\tprintersByCodecAndGenerator.set(key, owned);\n\t\t\t}\n\t\t}\n\t\tfor (const generatorId of owned.binding.generatorIds) if (!registered.has(generatorId)) throw invalidContribution(`Generator function \"${owned.name}\" from \"${owned.contributedBy}\" produces generator \"${generatorId}\", which no generator descriptor in the stack registers.`);\n\t}\n\tfunction boundCodecIdsOf(name) {\n\t\treturn [...bindingsByCodec.entries()].filter(([, forCodec]) => forCodec.has(name)).map(([codecId]) => codecId).sort();\n\t}\n\treturn {\n\t\tfunctionsFor(codecId) {\n\t\t\treturn [...bindingsByCodec.get(codecId)?.keys() ?? []].sort().map((name) => ({\n\t\t\t\tname,\n\t\t\t\tsignature: declared.get(name)?.signature\n\t\t\t}));\n\t\t},\n\t\thas(name) {\n\t\t\treturn declared.has(name);\n\t\t},\n\t\tresolve({ name, args }, field) {\n\t\t\tif (!declared.has(name)) return {\n\t\t\t\tok: false,\n\t\t\t\treason: \"unknown-function\",\n\t\t\t\tboundCodecIds: []\n\t\t\t};\n\t\t\tconst owned = bindingsByCodec.get(field.codecId)?.get(name);\n\t\t\tif (owned === void 0) return {\n\t\t\t\tok: false,\n\t\t\t\treason: \"not-bound\",\n\t\t\t\tboundCodecIds: boundCodecIdsOf(name)\n\t\t\t};\n\t\t\tconst resolution = owned.binding.resolve({\n\t\t\t\targs,\n\t\t\t\tfield\n\t\t\t});\n\t\t\tif (!resolution.ok) return {\n\t\t\t\tok: false,\n\t\t\t\treason: \"refused\",\n\t\t\t\tmessage: resolution.message\n\t\t\t};\n\t\t\tif (!owned.binding.generatorIds.includes(resolution.generator.id)) throw new InternalError(`Generator function \"${name}\" from \"${owned.contributedBy}\" resolved to generator \"${resolution.generator.id}\", which its binding does not declare in generatorIds.`);\n\t\t\treturn resolution;\n\t\t},\n\t\tcallFor(generator, field) {\n\t\t\tconst owned = printersByCodecAndGenerator.get(`${field.codecId}\\u0000${generator.id}`);\n\t\t\tif (owned === void 0) return void 0;\n\t\t\tconst printed = owned.binding.printArguments(generator, field);\n\t\t\treturn printed === void 0 ? void 0 : {\n\t\t\t\tcall: {\n\t\t\t\t\tname: owned.name,\n\t\t\t\t\targs: printed.args\n\t\t\t\t},\n\t\t\t\ttext: `${owned.name}(${printed.text})`\n\t\t\t};\n\t\t}\n\t};\n}\n/**\n* A binding of a function that takes no arguments to one generator, with params read from the field's type params when `paramsFromField` gives any.\n*/\nfunction singleGeneratorBinding(input) {\n\treturn {\n\t\tcodecIds: input.codecIds,\n\t\tgeneratorIds: [input.generatorId],\n\t\tresolve: ({ field }) => {\n\t\t\tconst params = input.paramsFromField?.(field);\n\t\t\treturn {\n\t\t\t\tok: true,\n\t\t\t\tgenerator: params === void 0 ? {\n\t\t\t\t\tkind: \"generator\",\n\t\t\t\t\tid: input.generatorId\n\t\t\t\t} : {\n\t\t\t\t\tkind: \"generator\",\n\t\t\t\t\tid: input.generatorId,\n\t\t\t\t\tparams\n\t\t\t\t}\n\t\t\t};\n\t\t},\n\t\tprintArguments: (generator) => generator.id === input.generatorId ? {\n\t\t\targs: {},\n\t\t\ttext: \"\"\n\t\t} : void 0\n\t};\n}\n/** The generator functions of a stack that contributes none. */\nconst EMPTY_GENERATOR_FUNCTIONS = assembleGeneratorFunctions([]);\n//#endregion\nexport { mergeCapabilityMatrices as a, isAnyInputAggregateDescriptor as c, singleGeneratorBinding as i, isNoInputAggregateDescriptor as l, assembleGeneratorFunctions as n, aggregateDescriptorKey as o, assembleGeneratorRegistrations as r, isAggregateDescriptor as s, EMPTY_GENERATOR_FUNCTIONS as t };\n\n//# sourceMappingURL=generator-functions-VMolCOGa.mjs.map"],"mappings":";;;;;;;;;AASA,SAAS,uBAAuB,YAAY;CAC3C,QAAQ,WAAW,MAAM,MAAzB;EACC,KAAK,QAAQ,OAAO,GAAG,WAAW,UAAU;EAC5C,KAAK,OAAO,OAAO,GAAG,WAAW,UAAU;EAC3C,KAAK,SAAS,OAAO,GAAG,WAAW,UAAU,SAAS,WAAW,MAAM;EACvE,KAAK,SAAS,OAAO,GAAG,WAAW,UAAU,SAAS,WAAW,MAAM;CACxE;AACD;;AAEA,SAAS,6BAA6B,YAAY;CACjD,OAAO,WAAW,MAAM,SAAS;AAClC;;AAEA,SAAS,8BAA8B,YAAY;CAClD,OAAO,WAAW,MAAM,SAAS;AAClC;AACA,SAAS,aAAa,OAAO;CAC5B,OAAO,OAAO,UAAU,YAAY,UAAU;AAC/C;AACA,SAAS,iBAAiB,OAAO;CAChC,OAAO,OAAO,UAAU,YAAY,MAAM,SAAS;AACpD;AACA,SAAS,sBAAsB,OAAO;CACrC,IAAI,CAAC,aAAa,KAAK,KAAK,EAAE,UAAU,QAAQ,OAAO;CACvD,QAAQ,MAAM,MAAd;EACC,KAAK;EACL,KAAK,OAAO,OAAO;EACnB,KAAK,SAAS,OAAO,aAAa,SAAS,iBAAiB,MAAM,OAAO;EACzE,KAAK,SAAS,OAAO,WAAW,SAAS,aAAa,MAAM,KAAK;EACjE,SAAS,OAAO;CACjB;AACD;AACA,SAAS,uBAAuB,OAAO;CACtC,IAAI,CAAC,aAAa,KAAK,KAAK,EAAE,UAAU,QAAQ,OAAO;CACvD,QAAQ,MAAM,MAAd;EACC,KAAK,QAAQ,OAAO;EACpB,KAAK,SAAS,OAAO,aAAa,SAAS,iBAAiB,MAAM,OAAO,MAAM,EAAE,gBAAgB,UAAU,MAAM,eAAe,KAAK,KAAK,OAAO,MAAM,eAAe;EACtK,SAAS,OAAO;CACjB;AACD;;;;AAIA,SAAS,sBAAsB,OAAO;CACrC,IAAI,CAAC,aAAa,KAAK,GAAG,OAAO;CACjC,IAAI,EAAE,eAAe,UAAU,CAAC,iBAAiB,MAAM,SAAS,GAAG,OAAO;CAC1E,IAAI,EAAE,cAAc,UAAU,OAAO,MAAM,aAAa,WAAW,OAAO;CAC1E,IAAI,MAAM,aAAa,UAAU,EAAE,qBAAqB,UAAU,MAAM,oBAAoB,KAAK,IAAI,OAAO;CAC5G,IAAI,EAAE,WAAW,UAAU,CAAC,sBAAsB,MAAM,KAAK,GAAG,OAAO;CACvE,IAAI,EAAE,YAAY,UAAU,CAAC,uBAAuB,MAAM,MAAM,GAAG,OAAO;CAC1E,OAAO,MAAM,MAAM,SAAS,WAAW,MAAM,MAAM,SAAS,WAAW,MAAM,OAAO,SAAS;AAC9F;;;;;;;;;AAWA,SAAS,cAAc,OAAO;CAC7B,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC3E;AACA,SAAS,SAAS,OAAO;CACxB,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,IAAI,QAAQ;CACnD,IAAI,CAAC,cAAc,KAAK,GAAG,OAAO;CAClC,MAAM,UAAU,OAAO,QAAQ,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,iBAAiB,GAAG,CAAC,CAAC;CAC/E,MAAM,OAAO,CAAC;CACd,KAAK,MAAM,CAAC,KAAK,UAAU,SAAS,KAAK,OAAO,SAAS,KAAK;CAC9D,OAAO;AACR;AACA,SAAS,wBAAwB,OAAO;CACvC,IAAI,CAAC,cAAc,KAAK,GAAG,OAAO,CAAC;CACnC,MAAM,MAAM,CAAC;CACb,KAAK,MAAM,CAAC,WAAW,cAAc,OAAO,QAAQ,KAAK,GAAG;EAC3D,IAAI,CAAC,cAAc,SAAS,GAAG;EAC/B,MAAM,OAAO,CAAC;EACd,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,SAAS,GAAG,IAAI,OAAO,SAAS,WAAW,KAAK,OAAO;EAChG,IAAI,OAAO,KAAK,IAAI,CAAC,CAAC,SAAS,GAAG,IAAI,aAAa;CACpD;CACA,OAAO;AACR;;;;;;;;;;;;;;;;;;AAkBA,SAAS,wBAAwB,MAAM,cAAc;CACpD,MAAM,SAAS,wBAAwB,IAAI;CAC3C,KAAK,MAAM,eAAe,cAAc;EACvC,MAAM,YAAY,wBAAwB,YAAY,YAAY;EAClE,KAAK,MAAM,CAAC,WAAW,iBAAiB,OAAO,QAAQ,SAAS,GAAG,OAAO,aAAa;GACtF,GAAG,OAAO,cAAc,CAAC;GACzB,GAAG;EACJ;CACD;CACA,OAAO,UAAU,SAAS,MAAM,CAAC;AAClC;AAGA,SAAS,kBAAkB,WAAW;CACrC,IAAI,OAAO,cAAc,YAAY,cAAc,QAAQ,EAAE,WAAW,YAAY,OAAO,CAAC;CAC5F,MAAM,QAAQ,UAAU;CACxB,OAAO,OAAO,UAAU,YAAY,UAAU,OAAO,OAAO,KAAK,KAAK,IAAI,CAAC;AAC5E;AACA,SAAS,oBAAoB,SAAS;CACrC,OAAO,aAAa,sCAAsC,OAAO;AAClE;;;;AAIA,SAAS,+BAA+B,aAAa;CACpD,MAAM,6BAA6B,IAAI,IAAI;CAC3C,KAAK,MAAM,aAAa,aAAa,KAAK,MAAM,cAAc,UAAU,yBAAyB,wBAAwB,CAAC,GAAG;EAC5H,MAAM,WAAW,WAAW,IAAI,WAAW,EAAE;EAC7C,IAAI,aAAa,KAAK,GAAG,MAAM,oBAAoB,cAAc,WAAW,GAAG,2BAA2B,SAAS,eAAe,YAAY,SAAS,UAAU,MAAM,YAAY,mEAAmE;EACtP,WAAW,IAAI,WAAW,IAAI;GAC7B;GACA,aAAa,UAAU;EACxB,CAAC;CACF;CACA,OAAO;AACR;;;;AAIA,SAAS,2BAA2B,aAAa;CAChD,MAAM,aAAa,+BAA+B,WAAW;CAC7D,MAAM,2BAA2B,IAAI,IAAI;CACzC,MAAM,kCAAkC,IAAI,IAAI;CAChD,MAAM,8CAA8C,IAAI,IAAI;CAC5D,MAAM,cAAc,CAAC;CACrB,KAAK,MAAM,cAAc,aAAa;EACrC,MAAM,gBAAgB,WAAW,MAAM;EACvC,KAAK,MAAM,gBAAgB,WAAW,sBAAsB,CAAC,GAAG;GAC/D,IAAI,aAAa,cAAc,KAAK,GAAG;IACtC,MAAM,CAAC,kBAAkB,kBAAkB,aAAa,SAAS;IACjE,IAAI,mBAAmB,KAAK,GAAG,MAAM,oBAAoB,uBAAuB,aAAa,KAAK,UAAU,cAAc,kCAAkC,eAAe,oJAAoJ;IAC/T,MAAM,WAAW,SAAS,IAAI,aAAa,IAAI;IAC/C,IAAI,aAAa,KAAK,GAAG,MAAM,oBAAoB,uBAAuB,aAAa,KAAK,yBAAyB,SAAS,WAAW,SAAS,cAAc,GAAG;IACnK,SAAS,IAAI,aAAa,MAAM;KAC/B,WAAW,aAAa;KACxB,YAAY;IACb,CAAC;GACF;GACA,KAAK,MAAM,WAAW,aAAa,UAAU,YAAY,KAAK;IAC7D,MAAM,aAAa;IACnB;IACA;GACD,CAAC;EACF;CACD;CACA,KAAK,MAAM,SAAS,aAAa;EAChC,IAAI,CAAC,SAAS,IAAI,MAAM,IAAI,GAAG,MAAM,oBAAoB,IAAI,MAAM,cAAc,8BAA8B,MAAM,KAAK,gCAAgC;EAC1J,KAAK,MAAM,WAAW,MAAM,QAAQ,UAAU;GAC7C,MAAM,WAAW,gBAAgB,IAAI,OAAO,qBAAqB,IAAI,IAAI;GACzE,MAAM,WAAW,SAAS,IAAI,MAAM,IAAI;GACxC,IAAI,aAAa,KAAK,GAAG,MAAM,oBAAoB,uBAAuB,MAAM,KAAK,uBAAuB,QAAQ,aAAa,SAAS,cAAc,SAAS,MAAM,cAAc,GAAG;GACxL,SAAS,IAAI,MAAM,MAAM,KAAK;GAC9B,gBAAgB,IAAI,SAAS,QAAQ;GACrC,KAAK,MAAM,eAAe,MAAM,QAAQ,cAAc;IACrD,MAAM,MAAM,GAAG,QAAQ,QAAQ;IAC/B,MAAM,UAAU,4BAA4B,IAAI,GAAG;IACnD,IAAI,YAAY,KAAK,KAAK,QAAQ,SAAS,MAAM,MAAM,MAAM,oBAAoB,cAAc,YAAY,cAAc,QAAQ,iCAAiC,QAAQ,KAAK,UAAU,QAAQ,cAAc,kBAAkB,MAAM,KAAK,UAAU,MAAM,cAAc,GAAG;IAC7Q,4BAA4B,IAAI,KAAK,KAAK;GAC3C;EACD;EACA,KAAK,MAAM,eAAe,MAAM,QAAQ,cAAc,IAAI,CAAC,WAAW,IAAI,WAAW,GAAG,MAAM,oBAAoB,uBAAuB,MAAM,KAAK,UAAU,MAAM,cAAc,wBAAwB,YAAY,yDAAyD;CAChR;CACA,SAAS,gBAAgB,MAAM;EAC9B,OAAO,CAAC,GAAG,gBAAgB,QAAQ,CAAC,CAAC,CAAC,QAAQ,GAAG,cAAc,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,OAAO,CAAC,CAAC,KAAK;CACrH;CACA,OAAO;EACN,aAAa,SAAS;GACrB,OAAO,CAAC,GAAG,gBAAgB,IAAI,OAAO,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,UAAU;IAC5E;IACA,WAAW,SAAS,IAAI,IAAI,CAAC,EAAE;GAChC,EAAE;EACH;EACA,IAAI,MAAM;GACT,OAAO,SAAS,IAAI,IAAI;EACzB;EACA,QAAQ,EAAE,MAAM,QAAQ,OAAO;GAC9B,IAAI,CAAC,SAAS,IAAI,IAAI,GAAG,OAAO;IAC/B,IAAI;IACJ,QAAQ;IACR,eAAe,CAAC;GACjB;GACA,MAAM,QAAQ,gBAAgB,IAAI,MAAM,OAAO,CAAC,EAAE,IAAI,IAAI;GAC1D,IAAI,UAAU,KAAK,GAAG,OAAO;IAC5B,IAAI;IACJ,QAAQ;IACR,eAAe,gBAAgB,IAAI;GACpC;GACA,MAAM,aAAa,MAAM,QAAQ,QAAQ;IACxC;IACA;GACD,CAAC;GACD,IAAI,CAAC,WAAW,IAAI,OAAO;IAC1B,IAAI;IACJ,QAAQ;IACR,SAAS,WAAW;GACrB;GACA,IAAI,CAAC,MAAM,QAAQ,aAAa,SAAS,WAAW,UAAU,EAAE,GAAG,MAAM,IAAI,cAAc,uBAAuB,KAAK,UAAU,MAAM,cAAc,2BAA2B,WAAW,UAAU,GAAG,uDAAuD;GAC/P,OAAO;EACR;EACA,QAAQ,WAAW,OAAO;GACzB,MAAM,QAAQ,4BAA4B,IAAI,GAAG,MAAM,QAAQ,QAAQ,UAAU,IAAI;GACrF,IAAI,UAAU,KAAK,GAAG,OAAO,KAAK;GAClC,MAAM,UAAU,MAAM,QAAQ,eAAe,WAAW,KAAK;GAC7D,OAAO,YAAY,KAAK,IAAI,KAAK,IAAI;IACpC,MAAM;KACL,MAAM,MAAM;KACZ,MAAM,QAAQ;IACf;IACA,MAAM,GAAG,MAAM,KAAK,GAAG,QAAQ,KAAK;GACrC;EACD;CACD;AACD;;;;AAIA,SAAS,uBAAuB,OAAO;CACtC,OAAO;EACN,UAAU,MAAM;EAChB,cAAc,CAAC,MAAM,WAAW;EAChC,UAAU,EAAE,YAAY;GACvB,MAAM,SAAS,MAAM,kBAAkB,KAAK;GAC5C,OAAO;IACN,IAAI;IACJ,WAAW,WAAW,KAAK,IAAI;KAC9B,MAAM;KACN,IAAI,MAAM;IACX,IAAI;KACH,MAAM;KACN,IAAI,MAAM;KACV;IACD;GACD;EACD;EACA,iBAAiB,cAAc,UAAU,OAAO,MAAM,cAAc;GACnE,MAAM,CAAC;GACP,MAAM;EACP,IAAI,KAAK;CACV;AACD;;AAEA,MAAM,4BAA4B,2BAA2B,CAAC,CAAC"}
@@ -0,0 +1,67 @@
1
+ //#region ../../../3-targets/0-shared/type-implementations/dist/json.mjs
2
+ function childPath(path, key) {
3
+ return path === "" ? String(key) : `${path}.${key}`;
4
+ }
5
+ function isPlainObject(value) {
6
+ const prototype = Object.getPrototypeOf(value);
7
+ return prototype === Object.prototype || prototype === null;
8
+ }
9
+ function isPlainArray(value) {
10
+ return Array.isArray(value) && Object.getPrototypeOf(value) === Array.prototype;
11
+ }
12
+ function constructorName(value) {
13
+ const name = Reflect.get(value, "constructor")?.name;
14
+ return typeof name === "string" && name !== "" ? name : "object";
15
+ }
16
+ function describeNonJson(value, options) {
17
+ if (value === null || typeof value === "string" || typeof value === "boolean") return void 0;
18
+ if (typeof value === "number") return Number.isFinite(value) ? void 0 : String(value);
19
+ if (typeof value !== "object") return typeof value;
20
+ const tag = options.tagOf?.(value);
21
+ if (tag !== void 0) return tag;
22
+ if (value instanceof Date) return "Date";
23
+ if (isPlainArray(value)) return void 0;
24
+ return isPlainObject(value) ? void 0 : constructorName(value);
25
+ }
26
+ function find(value, path, ancestors, options) {
27
+ const received = describeNonJson(value, options);
28
+ if (received !== void 0) return {
29
+ received,
30
+ path
31
+ };
32
+ if (typeof value !== "object" || value === null) return void 0;
33
+ if (ancestors.has(value)) return {
34
+ received: "circular reference",
35
+ path
36
+ };
37
+ ancestors.add(value);
38
+ const found = Array.isArray(value) ? findInArray(value, path, ancestors, options) : findInEntries(Object.entries(value), path, ancestors, options);
39
+ ancestors.delete(value);
40
+ return found;
41
+ }
42
+ function findInArray(value, path, ancestors, options) {
43
+ for (let index = 0; index < value.length; index++) {
44
+ if (!(index in value)) return {
45
+ received: "sparse array hole",
46
+ path: childPath(path, index)
47
+ };
48
+ const found = find(value[index], childPath(path, index), ancestors, options);
49
+ if (found !== void 0) return found;
50
+ }
51
+ }
52
+ function findInEntries(entries, path, ancestors, options) {
53
+ for (const [key, entry] of entries) {
54
+ const found = find(entry, childPath(path, key), ancestors, options);
55
+ if (found !== void 0) return found;
56
+ }
57
+ }
58
+ /**
59
+ * The first value in `value`, depth first, that a plain JSON document cannot hold: `undefined`, a function, a symbol, a `bigint`, `NaN` or an infinity, an instance of a class such as `Date` or `Uint8Array`, a circular reference or a hole in a sparse array. `undefined` when `value` is plain JSON at every depth.
60
+ */
61
+ function findNonJsonValue(value, options = {}) {
62
+ return find(value, "", /* @__PURE__ */ new Set(), options);
63
+ }
64
+ //#endregion
65
+ export { findNonJsonValue as t };
66
+
67
+ //# sourceMappingURL=json-Cjj5_v0y.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"json-Cjj5_v0y.mjs","names":[],"sources":["../../../../3-targets/0-shared/type-implementations/dist/json.mjs"],"sourcesContent":["//#region src/json.ts\nfunction childPath(path, key) {\n\treturn path === \"\" ? String(key) : `${path}.${key}`;\n}\nfunction isPlainObject(value) {\n\tconst prototype = Object.getPrototypeOf(value);\n\treturn prototype === Object.prototype || prototype === null;\n}\nfunction isPlainArray(value) {\n\treturn Array.isArray(value) && Object.getPrototypeOf(value) === Array.prototype;\n}\nfunction constructorName(value) {\n\tconst name = Reflect.get(value, \"constructor\")?.name;\n\treturn typeof name === \"string\" && name !== \"\" ? name : \"object\";\n}\nfunction describeNonJson(value, options) {\n\tif (value === null || typeof value === \"string\" || typeof value === \"boolean\") return void 0;\n\tif (typeof value === \"number\") return Number.isFinite(value) ? void 0 : String(value);\n\tif (typeof value !== \"object\") return typeof value;\n\tconst tag = options.tagOf?.(value);\n\tif (tag !== void 0) return tag;\n\tif (value instanceof Date) return \"Date\";\n\tif (isPlainArray(value)) return void 0;\n\treturn isPlainObject(value) ? void 0 : constructorName(value);\n}\nfunction find(value, path, ancestors, options) {\n\tconst received = describeNonJson(value, options);\n\tif (received !== void 0) return {\n\t\treceived,\n\t\tpath\n\t};\n\tif (typeof value !== \"object\" || value === null) return void 0;\n\tif (ancestors.has(value)) return {\n\t\treceived: \"circular reference\",\n\t\tpath\n\t};\n\tancestors.add(value);\n\tconst found = Array.isArray(value) ? findInArray(value, path, ancestors, options) : findInEntries(Object.entries(value), path, ancestors, options);\n\tancestors.delete(value);\n\treturn found;\n}\nfunction findInArray(value, path, ancestors, options) {\n\tfor (let index = 0; index < value.length; index++) {\n\t\tif (!(index in value)) return {\n\t\t\treceived: \"sparse array hole\",\n\t\t\tpath: childPath(path, index)\n\t\t};\n\t\tconst found = find(value[index], childPath(path, index), ancestors, options);\n\t\tif (found !== void 0) return found;\n\t}\n}\nfunction findInEntries(entries, path, ancestors, options) {\n\tfor (const [key, entry] of entries) {\n\t\tconst found = find(entry, childPath(path, key), ancestors, options);\n\t\tif (found !== void 0) return found;\n\t}\n}\n/**\n* The first value in `value`, depth first, that a plain JSON document cannot hold: `undefined`, a function, a symbol, a `bigint`, `NaN` or an infinity, an instance of a class such as `Date` or `Uint8Array`, a circular reference or a hole in a sparse array. `undefined` when `value` is plain JSON at every depth.\n*/\nfunction findNonJsonValue(value, options = {}) {\n\treturn find(value, \"\", /* @__PURE__ */ new Set(), options);\n}\n//#endregion\nexport { findNonJsonValue };\n\n//# sourceMappingURL=json.mjs.map"],"mappings":";AACA,SAAS,UAAU,MAAM,KAAK;CAC7B,OAAO,SAAS,KAAK,OAAO,GAAG,IAAI,GAAG,KAAK,GAAG;AAC/C;AACA,SAAS,cAAc,OAAO;CAC7B,MAAM,YAAY,OAAO,eAAe,KAAK;CAC7C,OAAO,cAAc,OAAO,aAAa,cAAc;AACxD;AACA,SAAS,aAAa,OAAO;CAC5B,OAAO,MAAM,QAAQ,KAAK,KAAK,OAAO,eAAe,KAAK,MAAM,MAAM;AACvE;AACA,SAAS,gBAAgB,OAAO;CAC/B,MAAM,OAAO,QAAQ,IAAI,OAAO,aAAa,CAAC,EAAE;CAChD,OAAO,OAAO,SAAS,YAAY,SAAS,KAAK,OAAO;AACzD;AACA,SAAS,gBAAgB,OAAO,SAAS;CACxC,IAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW,OAAO,KAAK;CAC3F,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO,SAAS,KAAK,IAAI,KAAK,IAAI,OAAO,KAAK;CACpF,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO;CAC7C,MAAM,MAAM,QAAQ,QAAQ,KAAK;CACjC,IAAI,QAAQ,KAAK,GAAG,OAAO;CAC3B,IAAI,iBAAiB,MAAM,OAAO;CAClC,IAAI,aAAa,KAAK,GAAG,OAAO,KAAK;CACrC,OAAO,cAAc,KAAK,IAAI,KAAK,IAAI,gBAAgB,KAAK;AAC7D;AACA,SAAS,KAAK,OAAO,MAAM,WAAW,SAAS;CAC9C,MAAM,WAAW,gBAAgB,OAAO,OAAO;CAC/C,IAAI,aAAa,KAAK,GAAG,OAAO;EAC/B;EACA;CACD;CACA,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO,KAAK;CAC7D,IAAI,UAAU,IAAI,KAAK,GAAG,OAAO;EAChC,UAAU;EACV;CACD;CACA,UAAU,IAAI,KAAK;CACnB,MAAM,QAAQ,MAAM,QAAQ,KAAK,IAAI,YAAY,OAAO,MAAM,WAAW,OAAO,IAAI,cAAc,OAAO,QAAQ,KAAK,GAAG,MAAM,WAAW,OAAO;CACjJ,UAAU,OAAO,KAAK;CACtB,OAAO;AACR;AACA,SAAS,YAAY,OAAO,MAAM,WAAW,SAAS;CACrD,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;EAClD,IAAI,EAAE,SAAS,QAAQ,OAAO;GAC7B,UAAU;GACV,MAAM,UAAU,MAAM,KAAK;EAC5B;EACA,MAAM,QAAQ,KAAK,MAAM,QAAQ,UAAU,MAAM,KAAK,GAAG,WAAW,OAAO;EAC3E,IAAI,UAAU,KAAK,GAAG,OAAO;CAC9B;AACD;AACA,SAAS,cAAc,SAAS,MAAM,WAAW,SAAS;CACzD,KAAK,MAAM,CAAC,KAAK,UAAU,SAAS;EACnC,MAAM,QAAQ,KAAK,OAAO,UAAU,MAAM,GAAG,GAAG,WAAW,OAAO;EAClE,IAAI,UAAU,KAAK,GAAG,OAAO;CAC9B;AACD;;;;AAIA,SAAS,iBAAiB,OAAO,UAAU,CAAC,GAAG;CAC9C,OAAO,KAAK,OAAO,oBAAoB,IAAI,IAAI,GAAG,OAAO;AAC1D"}
@@ -0,0 +1,18 @@
1
+ //#region ../../../3-targets/0-shared/type-implementations/dist/json.d.mts
2
+ //#region src/json.d.ts
3
+ /** A value inside a document that JSON cannot hold: what it is, such as `undefined`, `NaN`, `bigint` or a class name, and its path of keys and indexes joined by dots, `''` for the document itself. */
4
+ interface NonJsonValue {
5
+ readonly received: string;
6
+ readonly path: string;
7
+ }
8
+ interface FindNonJsonValueOptions {
9
+ /** Names an object that is not JSON although its shape is, such as a driver's wrapper class; read before the object's prototype. */
10
+ readonly tagOf?: (value: object) => string | undefined;
11
+ }
12
+ /**
13
+ * The first value in `value`, depth first, that a plain JSON document cannot hold: `undefined`, a function, a symbol, a `bigint`, `NaN` or an infinity, an instance of a class such as `Date` or `Uint8Array`, a circular reference or a hole in a sparse array. `undefined` when `value` is plain JSON at every depth.
14
+ */
15
+ declare function findNonJsonValue(value: unknown, options?: FindNonJsonValueOptions): NonJsonValue | undefined;
16
+ //#endregion
17
+ export { NonJsonValue as n, findNonJsonValue as r, FindNonJsonValueOptions as t };
18
+ //# sourceMappingURL=json-oOHvzn6v.d.mts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"json-oOHvzn6v.d.mts","names":[],"sources":["../../../../3-targets/0-shared/type-implementations/dist/json.d.mts"],"mappings":";;;UAEU;WACC;WACA;;UAED;;WAEC,SAAS;;;;;iBAKH,iBAAiB,gBAAgB,UAAU,0BAA0B"}
@@ -1,4 +1,4 @@
1
- import { n as UPGRADE_GUIDES_URL, t as CliStructuredError } from "./control-MllEQmML-IlhSvGbE.mjs";
1
+ import { n as UPGRADE_GUIDES_URL, t as CliStructuredError } from "./control-MllEQmML-aKdJLwRB.mjs";
2
2
  //#region ../../../1-framework/1-core/errors/dist/migration.mjs
3
3
  /**
4
4
  * A scaffolded migration contains a placeholder slot that was never filled in.
@@ -150,4 +150,4 @@ function errorMigrationOperationOptionRemoved(options) {
150
150
  //#endregion
151
151
  export { errorMigrationPlanNotArray as a, placeholder as c, errorMigrationOperationOptionRemoved as i, unfilledPlaceholderOperation as l, errorMigrationFileMissing as n, errorMigrationTargetMismatch as o, errorMigrationInvalidDefaultExport as r, errorUnfilledPlaceholder as s, errorDataTransformContractMismatch as t };
152
152
 
153
- //# sourceMappingURL=migration-rWN1KSXH.mjs.map
153
+ //# sourceMappingURL=migration-BfPqhbjG.mjs.map
@@ -1 +1 @@
1
- {"version":3,"file":"migration-rWN1KSXH.mjs","names":[],"sources":["../../../../1-framework/1-core/errors/dist/migration.mjs"],"sourcesContent":["import { t as CliStructuredError, w as UPGRADE_GUIDES_URL } from \"./control-MllEQmML.mjs\";\n//#region src/migration.ts\n/**\n* A scaffolded migration contains a placeholder slot that was never filled in.\n*\n* Thrown at emit time (when `check.source()` or `run()` is invoked) via the\n* `placeholder(...)` utility. The `slot` identifies the exact location the\n* author still needs to edit, e.g. `\"backfill-product-status:check.source\"`.\n*/\nfunction errorUnfilledPlaceholder(slot) {\n\treturn new CliStructuredError(\"MIGRATION.UNFILLED_PLACEHOLDER\", \"Unfilled migration placeholder\", {\n\t\twhy: `The migration contains a placeholder that has not been filled in: ${slot}`,\n\t\tfix: \"Open migration.ts and replace the `placeholder(...)` call with your actual query.\",\n\t\tmeta: { slot }\n\t});\n}\n/**\n* The operation of a planner-stubbed data transform: a promise that rejects with\n* `MIGRATION.UNFILLED_PLACEHOLDER`. A plan's other operations stay readable beside it. The\n* rejection is marked handled, and so is any promise a target wraps it in, so reading a plan's\n* operations without awaiting each one does not raise an unhandled rejection.\n*/\nfunction unfilledPlaceholderOperation(slot) {\n\tconst operation = Promise.reject(errorUnfilledPlaceholder(slot));\n\toperation.catch(() => void 0);\n\treturn operation;\n}\n/**\n* Scaffolded `migration.ts` files call this wherever the scaffolder couldn't\n* emit a real query and the author is expected to fill one in. Always throws\n* a structured migration error (`MIGRATION.UNFILLED_PLACEHOLDER`).\n*\n* The return type `never` makes it assignable to any expected return type, so\n* a scaffolded `() => placeholder('...')` satisfies signatures like\n* `() => MongoQueryPlan` without polluting them with a sentinel union arm.\n*/\nfunction placeholder(slot) {\n\tthrow errorUnfilledPlaceholder(slot);\n}\n/**\n* A `dataTransform(endContract, …)` factory was handed a `SqlQueryPlan` whose\n* `meta.storageHash` does not match the `endContract.storage.storageHash` it\n* was configured with. This almost always means the user's query-builder\n* (`sql({ context: createExecutionContext({ contract: endContract, … }) })`)\n* was instantiated from a different contract reference than the one passed\n* to `dataTransform(endContract, …)`.\n*\n* Distinct from `errorHashMismatch` (`CONTRACT.MARKER_MISMATCH`) which\n* rejects a plan at runtime execution; this is an authoring-time rejection\n* so it lives in the `MIGRATION` namespace.\n*/\nfunction errorDataTransformContractMismatch(options) {\n\treturn new CliStructuredError(\"MIGRATION.DATA_TRANSFORM_CONTRACT_MISMATCH\", \"dataTransform query plan built against wrong contract\", {\n\t\twhy: `Data transform \"${options.dataTransformName}\" produced a query plan whose storage hash (${options.actual}) does not match the migration's contract (${options.expected}). The query builder was configured with a different contract than the one passed to dataTransform(endContract, ...).`,\n\t\tfix: \"Ensure the `endContract` imported at module scope (used for both `dataTransform(endContract, …)` and `sql({ context: createExecutionContext({ contract: endContract, … }) })`) is the same reference.\",\n\t\tmeta: {\n\t\t\tdataTransformName: options.dataTransformName,\n\t\t\texpected: options.expected,\n\t\t\tactual: options.actual\n\t\t}\n\t});\n}\n/**\n* `migration.ts` was expected at the given package directory but could not be\n* located. Thrown when consumers attempt to read a migration package that is\n* missing its source file.\n*/\nfunction errorMigrationFileMissing(dir) {\n\treturn new CliStructuredError(\"MIGRATION.FILE_MISSING\", \"migration.ts not found\", {\n\t\twhy: `No migration.ts file was found at \"${dir}\"`,\n\t\tfix: \"Scaffold one with `{bin} migration new` or `{bin} migration plan`.\",\n\t\tnextActions: [{\n\t\t\tkind: \"run-command\",\n\t\t\tlabel: \"Scaffold an empty migration\",\n\t\t\tcommand: \"{bin} migration new\"\n\t\t}, {\n\t\t\tkind: \"run-command\",\n\t\t\tlabel: \"Scaffold a migration from a contract diff\",\n\t\t\tcommand: \"{bin} migration plan\"\n\t\t}],\n\t\tmeta: { dir }\n\t});\n}\n/**\n* The `migration.ts` at the given package directory does not default-export a\n* valid migration shape. Two shapes are accepted: a `Migration` subclass, or a\n* factory function returning a `MigrationPlan`-shaped object (with at least\n* an `operations` array, plus `targetId` and `destination`). Thrown when the\n* default export is missing, is not a constructor/function, does not extend\n* `Migration`, or (for factory functions) returns a value that is not\n* `MigrationPlan`-shaped.\n*/\nfunction errorMigrationInvalidDefaultExport(dir, actualExportDescription) {\n\treturn new CliStructuredError(\"MIGRATION.INVALID_DEFAULT_EXPORT\", \"migration.ts default export is not a valid migration\", {\n\t\twhy: actualExportDescription !== void 0 ? `migration.ts at \"${dir}\" must default-export a Migration subclass or a factory function returning a MigrationPlan-shaped object; got ${actualExportDescription}` : `migration.ts at \"${dir}\" must default-export a Migration subclass or a factory function returning a MigrationPlan-shaped object.`,\n\t\tfix: \"Use `export default class extends Migration { ... }` or `export default () => ({ targetId, destination, operations })`.\",\n\t\tmeta: {\n\t\t\tdir,\n\t\t\t...actualExportDescription !== void 0 ? { actualExport: actualExportDescription } : {}\n\t\t}\n\t});\n}\n/**\n* The migration class declares one `targetId` but the loaded\n* `prisma.config.ts` declares another. Thrown by `MigrationCLI.run`\n* when a migration script is invoked against a config whose target\n* descriptor disagrees with the migration's own `targetId`. Distinct from generic\n* config-validation errors because the mismatch is between two valid\n* artifacts (the script and the config), not a malformed input.\n*/\nfunction errorMigrationTargetMismatch(options) {\n\treturn new CliStructuredError(\"MIGRATION.TARGET_MISMATCH\", \"Migration target does not match config target\", {\n\t\twhy: `This migration is for target \"${options.migrationTargetId}\" but the loaded prisma.config.ts declares target \"${options.configTargetId}\". The migration script can only be run against a config that targets the same database.`,\n\t\tfix: \"Switch to a config whose `target` matches the migration's target, or pass `--config <path>` to point at the right config file.\",\n\t\tmeta: {\n\t\t\tmigrationTargetId: options.migrationTargetId,\n\t\t\tconfigTargetId: options.configTargetId\n\t\t}\n\t});\n}\n/**\n* A `Migration.operations` getter returned a value that is not an array. Used\n* by emit capabilities after instantiating the authored migration.\n*/\nfunction errorMigrationPlanNotArray(dir, actualValueDescription) {\n\treturn new CliStructuredError(\"MIGRATION.PLAN_NOT_ARRAY\", \"Migration.operations must be an array of operations\", {\n\t\twhy: actualValueDescription !== void 0 ? `Migration.operations for migration.ts at \"${dir}\" was ${actualValueDescription}; an array of operations is required.` : `Migration.operations for migration.ts at \"${dir}\" is not an array of operations.`,\n\t\tfix: \"Ensure your `operations` getter returns an array of operations; see the data-migrations authoring guide.\",\n\t\tmeta: {\n\t\t\tdir,\n\t\t\t...actualValueDescription !== void 0 ? { actualValue: actualValueDescription } : {}\n\t\t}\n\t});\n}\n/**\n* A `migration.ts` passes an operation an option in the form an earlier version wrote, which this version no longer reads. `node migration.ts` strips types without checking them, so such a file runs; the operation refuses the option rather than leave out what it carries. `subject` names what the option was for, `rewrite` says how to write it now, and `upgradeEntry` is the id of the upgrade entry that shows the new form.\n*/\nfunction errorMigrationOperationOptionRemoved(options) {\n\tconst { operation, option, upgradeEntry } = options;\n\treturn new CliStructuredError(\"MIGRATION.OPERATION_OPTION_REMOVED\", `\\`${operation}\\` in migration.ts passes \\`${option}\\`, which this version no longer reads, for ${options.subject}`, {\n\t\twhy: \"An earlier version wrote this migration.ts. `node migration.ts` does not check its types, so the file runs, and this version would leave out what the option carries.\",\n\t\tfix: `${options.rewrite} Or, if the migration is not applied, delete its package and run \\`migration plan\\` again. The upgrade entry \\`${upgradeEntry}\\` shows the new shape: ${UPGRADE_GUIDES_URL}`,\n\t\tmeta: {\n\t\t\toperation,\n\t\t\toption,\n\t\t\tupgradeEntry\n\t\t}\n\t});\n}\n//#endregion\nexport { errorDataTransformContractMismatch, errorMigrationFileMissing, errorMigrationInvalidDefaultExport, errorMigrationOperationOptionRemoved, errorMigrationPlanNotArray, errorMigrationTargetMismatch, errorUnfilledPlaceholder, placeholder, unfilledPlaceholderOperation };\n\n//# sourceMappingURL=migration.mjs.map"],"mappings":";;;;;;;;;AASA,SAAS,yBAAyB,MAAM;CACvC,OAAO,IAAI,mBAAmB,kCAAkC,kCAAkC;EACjG,KAAK,qEAAqE;EAC1E,KAAK;EACL,MAAM,EAAE,KAAK;CACd,CAAC;AACF;;;;;;;AAOA,SAAS,6BAA6B,MAAM;CAC3C,MAAM,YAAY,QAAQ,OAAO,yBAAyB,IAAI,CAAC;CAC/D,UAAU,YAAY,KAAK,CAAC;CAC5B,OAAO;AACR;;;;;;;;;;AAUA,SAAS,YAAY,MAAM;CAC1B,MAAM,yBAAyB,IAAI;AACpC;;;;;;;;;;;;;AAaA,SAAS,mCAAmC,SAAS;CACpD,OAAO,IAAI,mBAAmB,8CAA8C,yDAAyD;EACpI,KAAK,mBAAmB,QAAQ,kBAAkB,8CAA8C,QAAQ,OAAO,6CAA6C,QAAQ,SAAS;EAC7K,KAAK;EACL,MAAM;GACL,mBAAmB,QAAQ;GAC3B,UAAU,QAAQ;GAClB,QAAQ,QAAQ;EACjB;CACD,CAAC;AACF;;;;;;AAMA,SAAS,0BAA0B,KAAK;CACvC,OAAO,IAAI,mBAAmB,0BAA0B,0BAA0B;EACjF,KAAK,sCAAsC,IAAI;EAC/C,KAAK;EACL,aAAa,CAAC;GACb,MAAM;GACN,OAAO;GACP,SAAS;EACV,GAAG;GACF,MAAM;GACN,OAAO;GACP,SAAS;EACV,CAAC;EACD,MAAM,EAAE,IAAI;CACb,CAAC;AACF;;;;;;;;;;AAUA,SAAS,mCAAmC,KAAK,yBAAyB;CACzE,OAAO,IAAI,mBAAmB,oCAAoC,wDAAwD;EACzH,KAAK,4BAA4B,KAAK,IAAI,oBAAoB,IAAI,gHAAgH,4BAA4B,oBAAoB,IAAI;EACtO,KAAK;EACL,MAAM;GACL;GACA,GAAG,4BAA4B,KAAK,IAAI,EAAE,cAAc,wBAAwB,IAAI,CAAC;EACtF;CACD,CAAC;AACF;;;;;;;;;AASA,SAAS,6BAA6B,SAAS;CAC9C,OAAO,IAAI,mBAAmB,6BAA6B,iDAAiD;EAC3G,KAAK,iCAAiC,QAAQ,kBAAkB,qDAAqD,QAAQ,eAAe;EAC5I,KAAK;EACL,MAAM;GACL,mBAAmB,QAAQ;GAC3B,gBAAgB,QAAQ;EACzB;CACD,CAAC;AACF;;;;;AAKA,SAAS,2BAA2B,KAAK,wBAAwB;CAChE,OAAO,IAAI,mBAAmB,4BAA4B,uDAAuD;EAChH,KAAK,2BAA2B,KAAK,IAAI,6CAA6C,IAAI,QAAQ,uBAAuB,yCAAyC,6CAA6C,IAAI;EACnN,KAAK;EACL,MAAM;GACL;GACA,GAAG,2BAA2B,KAAK,IAAI,EAAE,aAAa,uBAAuB,IAAI,CAAC;EACnF;CACD,CAAC;AACF;;;;AAIA,SAAS,qCAAqC,SAAS;CACtD,MAAM,EAAE,WAAW,QAAQ,iBAAiB;CAC5C,OAAO,IAAI,mBAAmB,sCAAsC,KAAK,UAAU,8BAA8B,OAAO,8CAA8C,QAAQ,WAAW;EACxL,KAAK;EACL,KAAK,GAAG,QAAQ,QAAQ,iHAAiH,aAAa,0BAA0B;EAChL,MAAM;GACL;GACA;GACA;EACD;CACD,CAAC;AACF"}
1
+ {"version":3,"file":"migration-BfPqhbjG.mjs","names":[],"sources":["../../../../1-framework/1-core/errors/dist/migration.mjs"],"sourcesContent":["import { t as CliStructuredError, w as UPGRADE_GUIDES_URL } from \"./control-MllEQmML.mjs\";\n//#region src/migration.ts\n/**\n* A scaffolded migration contains a placeholder slot that was never filled in.\n*\n* Thrown at emit time (when `check.source()` or `run()` is invoked) via the\n* `placeholder(...)` utility. The `slot` identifies the exact location the\n* author still needs to edit, e.g. `\"backfill-product-status:check.source\"`.\n*/\nfunction errorUnfilledPlaceholder(slot) {\n\treturn new CliStructuredError(\"MIGRATION.UNFILLED_PLACEHOLDER\", \"Unfilled migration placeholder\", {\n\t\twhy: `The migration contains a placeholder that has not been filled in: ${slot}`,\n\t\tfix: \"Open migration.ts and replace the `placeholder(...)` call with your actual query.\",\n\t\tmeta: { slot }\n\t});\n}\n/**\n* The operation of a planner-stubbed data transform: a promise that rejects with\n* `MIGRATION.UNFILLED_PLACEHOLDER`. A plan's other operations stay readable beside it. The\n* rejection is marked handled, and so is any promise a target wraps it in, so reading a plan's\n* operations without awaiting each one does not raise an unhandled rejection.\n*/\nfunction unfilledPlaceholderOperation(slot) {\n\tconst operation = Promise.reject(errorUnfilledPlaceholder(slot));\n\toperation.catch(() => void 0);\n\treturn operation;\n}\n/**\n* Scaffolded `migration.ts` files call this wherever the scaffolder couldn't\n* emit a real query and the author is expected to fill one in. Always throws\n* a structured migration error (`MIGRATION.UNFILLED_PLACEHOLDER`).\n*\n* The return type `never` makes it assignable to any expected return type, so\n* a scaffolded `() => placeholder('...')` satisfies signatures like\n* `() => MongoQueryPlan` without polluting them with a sentinel union arm.\n*/\nfunction placeholder(slot) {\n\tthrow errorUnfilledPlaceholder(slot);\n}\n/**\n* A `dataTransform(endContract, …)` factory was handed a `SqlQueryPlan` whose\n* `meta.storageHash` does not match the `endContract.storage.storageHash` it\n* was configured with. This almost always means the user's query-builder\n* (`sql({ context: createExecutionContext({ contract: endContract, … }) })`)\n* was instantiated from a different contract reference than the one passed\n* to `dataTransform(endContract, …)`.\n*\n* Distinct from `errorHashMismatch` (`CONTRACT.MARKER_MISMATCH`) which\n* rejects a plan at runtime execution; this is an authoring-time rejection\n* so it lives in the `MIGRATION` namespace.\n*/\nfunction errorDataTransformContractMismatch(options) {\n\treturn new CliStructuredError(\"MIGRATION.DATA_TRANSFORM_CONTRACT_MISMATCH\", \"dataTransform query plan built against wrong contract\", {\n\t\twhy: `Data transform \"${options.dataTransformName}\" produced a query plan whose storage hash (${options.actual}) does not match the migration's contract (${options.expected}). The query builder was configured with a different contract than the one passed to dataTransform(endContract, ...).`,\n\t\tfix: \"Ensure the `endContract` imported at module scope (used for both `dataTransform(endContract, …)` and `sql({ context: createExecutionContext({ contract: endContract, … }) })`) is the same reference.\",\n\t\tmeta: {\n\t\t\tdataTransformName: options.dataTransformName,\n\t\t\texpected: options.expected,\n\t\t\tactual: options.actual\n\t\t}\n\t});\n}\n/**\n* `migration.ts` was expected at the given package directory but could not be\n* located. Thrown when consumers attempt to read a migration package that is\n* missing its source file.\n*/\nfunction errorMigrationFileMissing(dir) {\n\treturn new CliStructuredError(\"MIGRATION.FILE_MISSING\", \"migration.ts not found\", {\n\t\twhy: `No migration.ts file was found at \"${dir}\"`,\n\t\tfix: \"Scaffold one with `{bin} migration new` or `{bin} migration plan`.\",\n\t\tnextActions: [{\n\t\t\tkind: \"run-command\",\n\t\t\tlabel: \"Scaffold an empty migration\",\n\t\t\tcommand: \"{bin} migration new\"\n\t\t}, {\n\t\t\tkind: \"run-command\",\n\t\t\tlabel: \"Scaffold a migration from a contract diff\",\n\t\t\tcommand: \"{bin} migration plan\"\n\t\t}],\n\t\tmeta: { dir }\n\t});\n}\n/**\n* The `migration.ts` at the given package directory does not default-export a\n* valid migration shape. Two shapes are accepted: a `Migration` subclass, or a\n* factory function returning a `MigrationPlan`-shaped object (with at least\n* an `operations` array, plus `targetId` and `destination`). Thrown when the\n* default export is missing, is not a constructor/function, does not extend\n* `Migration`, or (for factory functions) returns a value that is not\n* `MigrationPlan`-shaped.\n*/\nfunction errorMigrationInvalidDefaultExport(dir, actualExportDescription) {\n\treturn new CliStructuredError(\"MIGRATION.INVALID_DEFAULT_EXPORT\", \"migration.ts default export is not a valid migration\", {\n\t\twhy: actualExportDescription !== void 0 ? `migration.ts at \"${dir}\" must default-export a Migration subclass or a factory function returning a MigrationPlan-shaped object; got ${actualExportDescription}` : `migration.ts at \"${dir}\" must default-export a Migration subclass or a factory function returning a MigrationPlan-shaped object.`,\n\t\tfix: \"Use `export default class extends Migration { ... }` or `export default () => ({ targetId, destination, operations })`.\",\n\t\tmeta: {\n\t\t\tdir,\n\t\t\t...actualExportDescription !== void 0 ? { actualExport: actualExportDescription } : {}\n\t\t}\n\t});\n}\n/**\n* The migration class declares one `targetId` but the loaded\n* `prisma.config.ts` declares another. Thrown by `MigrationCLI.run`\n* when a migration script is invoked against a config whose target\n* descriptor disagrees with the migration's own `targetId`. Distinct from generic\n* config-validation errors because the mismatch is between two valid\n* artifacts (the script and the config), not a malformed input.\n*/\nfunction errorMigrationTargetMismatch(options) {\n\treturn new CliStructuredError(\"MIGRATION.TARGET_MISMATCH\", \"Migration target does not match config target\", {\n\t\twhy: `This migration is for target \"${options.migrationTargetId}\" but the loaded prisma.config.ts declares target \"${options.configTargetId}\". The migration script can only be run against a config that targets the same database.`,\n\t\tfix: \"Switch to a config whose `target` matches the migration's target, or pass `--config <path>` to point at the right config file.\",\n\t\tmeta: {\n\t\t\tmigrationTargetId: options.migrationTargetId,\n\t\t\tconfigTargetId: options.configTargetId\n\t\t}\n\t});\n}\n/**\n* A `Migration.operations` getter returned a value that is not an array. Used\n* by emit capabilities after instantiating the authored migration.\n*/\nfunction errorMigrationPlanNotArray(dir, actualValueDescription) {\n\treturn new CliStructuredError(\"MIGRATION.PLAN_NOT_ARRAY\", \"Migration.operations must be an array of operations\", {\n\t\twhy: actualValueDescription !== void 0 ? `Migration.operations for migration.ts at \"${dir}\" was ${actualValueDescription}; an array of operations is required.` : `Migration.operations for migration.ts at \"${dir}\" is not an array of operations.`,\n\t\tfix: \"Ensure your `operations` getter returns an array of operations; see the data-migrations authoring guide.\",\n\t\tmeta: {\n\t\t\tdir,\n\t\t\t...actualValueDescription !== void 0 ? { actualValue: actualValueDescription } : {}\n\t\t}\n\t});\n}\n/**\n* A `migration.ts` passes an operation an option in the form an earlier version wrote, which this version no longer reads. `node migration.ts` strips types without checking them, so such a file runs; the operation refuses the option rather than leave out what it carries. `subject` names what the option was for, `rewrite` says how to write it now, and `upgradeEntry` is the id of the upgrade entry that shows the new form.\n*/\nfunction errorMigrationOperationOptionRemoved(options) {\n\tconst { operation, option, upgradeEntry } = options;\n\treturn new CliStructuredError(\"MIGRATION.OPERATION_OPTION_REMOVED\", `\\`${operation}\\` in migration.ts passes \\`${option}\\`, which this version no longer reads, for ${options.subject}`, {\n\t\twhy: \"An earlier version wrote this migration.ts. `node migration.ts` does not check its types, so the file runs, and this version would leave out what the option carries.\",\n\t\tfix: `${options.rewrite} Or, if the migration is not applied, delete its package and run \\`migration plan\\` again. The upgrade entry \\`${upgradeEntry}\\` shows the new shape: ${UPGRADE_GUIDES_URL}`,\n\t\tmeta: {\n\t\t\toperation,\n\t\t\toption,\n\t\t\tupgradeEntry\n\t\t}\n\t});\n}\n//#endregion\nexport { errorDataTransformContractMismatch, errorMigrationFileMissing, errorMigrationInvalidDefaultExport, errorMigrationOperationOptionRemoved, errorMigrationPlanNotArray, errorMigrationTargetMismatch, errorUnfilledPlaceholder, placeholder, unfilledPlaceholderOperation };\n\n//# sourceMappingURL=migration.mjs.map"],"mappings":";;;;;;;;;AASA,SAAS,yBAAyB,MAAM;CACvC,OAAO,IAAI,mBAAmB,kCAAkC,kCAAkC;EACjG,KAAK,qEAAqE;EAC1E,KAAK;EACL,MAAM,EAAE,KAAK;CACd,CAAC;AACF;;;;;;;AAOA,SAAS,6BAA6B,MAAM;CAC3C,MAAM,YAAY,QAAQ,OAAO,yBAAyB,IAAI,CAAC;CAC/D,UAAU,YAAY,KAAK,CAAC;CAC5B,OAAO;AACR;;;;;;;;;;AAUA,SAAS,YAAY,MAAM;CAC1B,MAAM,yBAAyB,IAAI;AACpC;;;;;;;;;;;;;AAaA,SAAS,mCAAmC,SAAS;CACpD,OAAO,IAAI,mBAAmB,8CAA8C,yDAAyD;EACpI,KAAK,mBAAmB,QAAQ,kBAAkB,8CAA8C,QAAQ,OAAO,6CAA6C,QAAQ,SAAS;EAC7K,KAAK;EACL,MAAM;GACL,mBAAmB,QAAQ;GAC3B,UAAU,QAAQ;GAClB,QAAQ,QAAQ;EACjB;CACD,CAAC;AACF;;;;;;AAMA,SAAS,0BAA0B,KAAK;CACvC,OAAO,IAAI,mBAAmB,0BAA0B,0BAA0B;EACjF,KAAK,sCAAsC,IAAI;EAC/C,KAAK;EACL,aAAa,CAAC;GACb,MAAM;GACN,OAAO;GACP,SAAS;EACV,GAAG;GACF,MAAM;GACN,OAAO;GACP,SAAS;EACV,CAAC;EACD,MAAM,EAAE,IAAI;CACb,CAAC;AACF;;;;;;;;;;AAUA,SAAS,mCAAmC,KAAK,yBAAyB;CACzE,OAAO,IAAI,mBAAmB,oCAAoC,wDAAwD;EACzH,KAAK,4BAA4B,KAAK,IAAI,oBAAoB,IAAI,gHAAgH,4BAA4B,oBAAoB,IAAI;EACtO,KAAK;EACL,MAAM;GACL;GACA,GAAG,4BAA4B,KAAK,IAAI,EAAE,cAAc,wBAAwB,IAAI,CAAC;EACtF;CACD,CAAC;AACF;;;;;;;;;AASA,SAAS,6BAA6B,SAAS;CAC9C,OAAO,IAAI,mBAAmB,6BAA6B,iDAAiD;EAC3G,KAAK,iCAAiC,QAAQ,kBAAkB,qDAAqD,QAAQ,eAAe;EAC5I,KAAK;EACL,MAAM;GACL,mBAAmB,QAAQ;GAC3B,gBAAgB,QAAQ;EACzB;CACD,CAAC;AACF;;;;;AAKA,SAAS,2BAA2B,KAAK,wBAAwB;CAChE,OAAO,IAAI,mBAAmB,4BAA4B,uDAAuD;EAChH,KAAK,2BAA2B,KAAK,IAAI,6CAA6C,IAAI,QAAQ,uBAAuB,yCAAyC,6CAA6C,IAAI;EACnN,KAAK;EACL,MAAM;GACL;GACA,GAAG,2BAA2B,KAAK,IAAI,EAAE,aAAa,uBAAuB,IAAI,CAAC;EACnF;CACD,CAAC;AACF;;;;AAIA,SAAS,qCAAqC,SAAS;CACtD,MAAM,EAAE,WAAW,QAAQ,iBAAiB;CAC5C,OAAO,IAAI,mBAAmB,sCAAsC,KAAK,UAAU,8BAA8B,OAAO,8CAA8C,QAAQ,WAAW;EACxL,KAAK;EACL,KAAK,GAAG,QAAQ,QAAQ,iHAAiH,aAAa,0BAA0B;EAChL,MAAM;GACL;GACA;GACA;EACD;CACD,CAAC;AACF"}
@@ -1,4 +1,4 @@
1
- import { i as CliStructuredError } from "./control-BeXOxtXA-CoPQgVyR.mjs";
1
+ import { i as CliStructuredError } from "./control-BeXOxtXA-D1DDBvDL.mjs";
2
2
  //#region ../../../1-framework/1-core/errors/dist/migration.d.mts
3
3
  //#region src/migration.d.ts
4
4
  /**
@@ -88,4 +88,4 @@ declare function errorMigrationOperationOptionRemoved(options: {
88
88
  }): CliStructuredError;
89
89
  //#endregion
90
90
  export { errorMigrationPlanNotArray as a, placeholder as c, errorMigrationOperationOptionRemoved as i, unfilledPlaceholderOperation as l, errorMigrationFileMissing as n, errorMigrationTargetMismatch as o, errorMigrationInvalidDefaultExport as r, errorUnfilledPlaceholder as s, errorDataTransformContractMismatch as t };
91
- //# sourceMappingURL=migration-KEyQBpKF.d.mts.map
91
+ //# sourceMappingURL=migration-BiqyI92H.d.mts.map
@@ -1 +1 @@
1
- {"version":3,"file":"migration-KEyQBpKF.d.mts","names":[],"sources":["../../../../1-framework/1-core/errors/dist/migration.d.mts"],"mappings":";;;;;;;;;;iBASiB,yBAAyB,eAAe;;;;;;;iBAOxC,6BAA6B,eAAe;;;;;;;;;;iBAU5C,YAAY;;;;;;;;;;;;;iBAaZ,mCAAmC;WACzC;WACA;WACA;IACP;;;;;;iBAMa,0BAA0B,cAAc;;;;;;;;;;iBAUxC,mCAAmC,aAAa,mCAAmC;;;;;;;;;iBASnF,6BAA6B;WACnC;WACA;IACP;;;;;iBAKa,2BAA2B,aAAa,kCAAkC;;;;iBAI1E,qCAAqC;WAC3C;WACA;WACA;WACA;WACA;IACP"}
1
+ {"version":3,"file":"migration-BiqyI92H.d.mts","names":[],"sources":["../../../../1-framework/1-core/errors/dist/migration.d.mts"],"mappings":";;;;;;;;;;iBASiB,yBAAyB,eAAe;;;;;;;iBAOxC,6BAA6B,eAAe;;;;;;;;;;iBAU5C,YAAY;;;;;;;;;;;;;iBAaZ,mCAAmC;WACzC;WACA;WACA;IACP;;;;;;iBAMa,0BAA0B,cAAc;;;;;;;;;;iBAUxC,mCAAmC,aAAa,mCAAmC;;;;;;;;;iBASnF,6BAA6B;WACnC;WACA;IACP;;;;;iBAKa,2BAA2B,aAAa,kCAAkC;;;;iBAI1E,qCAAqC;WAC3C;WACA;WACA;WACA;WACA;IACP"}
@@ -1,8 +1,8 @@
1
1
  import { t as InternalError } from "./internal-error-ChGYPVpq-DhUD05u0.mjs";
2
2
  import { r as UNSPECIFIED_PSL_NAMESPACE_ID } from "./psl-ast-CyvE6CR-.mjs";
3
3
  import { r as isTerminatedStringLiteral, t as Tokenizer } from "./tokenizer-Dz9ZnxyT-C74mPv3k.mjs";
4
- import { v as createSyntaxTree } from "./expressions-BlhT51Ib-CQCMuQD8.mjs";
5
- import { r as DocumentAst } from "./declarations-8CRDqUTt-B0YG2lqY.mjs";
4
+ import { v as createSyntaxTree } from "./expressions-BlhT51Ib-DfkeWOwr.mjs";
5
+ import { r as DocumentAst } from "./declarations-8CRDqUTt-BZ6aspIz.mjs";
6
6
  //#region ../../../1-framework/2-authoring/psl-parser/dist/parse-D-B_nrfC.mjs
7
7
  const CARRIAGE_RETURN = 13;
8
8
  const LINE_FEED = 10;
@@ -874,4 +874,4 @@ function parseKeyValue(cursor, options = { memberAttributes: false }) {
874
874
  //#endregion
875
875
  export { greenToken as a, greenNode as i, PslSources as n, parse as o, SourceFile as r, GreenNodeBuilder as t };
876
876
 
877
- //# sourceMappingURL=parse-D-B_nrfC-FsqZwLif.mjs.map
877
+ //# sourceMappingURL=parse-D-B_nrfC-agY84gQk.mjs.map