sof-mssql 2.1.0 → 2.3.0

package/dist/queryGenerator/index.js

@@ -3,17 +3,9 @@
  * Query generator components for building T-SQL from ViewDefinitions.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.ColumnExpressionGenerator = exports.WhereClauseBuilder = exports.SelectClauseBuilder = exports.RepeatProcessor = exports.ForEachProcessor = exports.SelectCombinationExpander = exports.PathParser = void 0;
+exports.ColumnExpressionGenerator = exports.WhereClauseBuilder = exports.PathParser = void 0;
 var PathParser_js_1 = require("./PathParser.js");
 Object.defineProperty(exports, "PathParser", { enumerable: true, get: function () { return PathParser_js_1.PathParser; } });
-var SelectCombinationExpander_js_1 = require("./SelectCombinationExpander.js");
-Object.defineProperty(exports, "SelectCombinationExpander", { enumerable: true, get: function () { return SelectCombinationExpander_js_1.SelectCombinationExpander; } });
-var ForEachProcessor_js_1 = require("./ForEachProcessor.js");
-Object.defineProperty(exports, "ForEachProcessor", { enumerable: true, get: function () { return ForEachProcessor_js_1.ForEachProcessor; } });
-var RepeatProcessor_js_1 = require("./RepeatProcessor.js");
-Object.defineProperty(exports, "RepeatProcessor", { enumerable: true, get: function () { return RepeatProcessor_js_1.RepeatProcessor; } });
-var SelectClauseBuilder_js_1 = require("./SelectClauseBuilder.js");
-Object.defineProperty(exports, "SelectClauseBuilder", { enumerable: true, get: function () { return SelectClauseBuilder_js_1.SelectClauseBuilder; } });
 var WhereClauseBuilder_js_1 = require("./WhereClauseBuilder.js");
 Object.defineProperty(exports, "WhereClauseBuilder", { enumerable: true, get: function () { return WhereClauseBuilder_js_1.WhereClauseBuilder; } });
 var ColumnExpressionGenerator_js_1 = require("./ColumnExpressionGenerator.js");

package/dist/queryGenerator/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/queryGenerator/index.ts"],"names":[],"mappings":";AAAA;;GAEG;;;AAEH,iDAA6C;AAApC,2GAAA,UAAU,OAAA;AACnB,+EAGwC;AADtC,yIAAA,yBAAyB,OAAA;AAE3B,6DAAyD;AAAhD,uHAAA,gBAAgB,OAAA;AACzB,2DAAsE;AAA7D,qHAAA,eAAe,OAAA;AACxB,mEAA+D;AAAtD,6HAAA,mBAAmB,OAAA;AAC5B,iEAA6D;AAApD,2HAAA,kBAAkB,OAAA;AAC3B,+EAA2E;AAAlE,yIAAA,yBAAyB,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/queryGenerator/index.ts"],"names":[],"mappings":";AAAA;;GAEG;;;AAEH,iDAA6C;AAApC,2GAAA,UAAU,OAAA;AACnB,iEAA6D;AAApD,2HAAA,kBAAkB,OAAA;AAC3B,+EAA2E;AAAlE,yIAAA,yBAAyB,OAAA"}

package/dist/queryGenerator/treeWalker/aliasGenerator.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Sole producer of all SQL aliases generated by the tree walker.
+ *
+ * Routing every alias through here guarantees uniqueness across the whole
+ * compile (the counter lives on Context.cteCounter and is shared by every
+ * recursive walk call).
+ */
+import type { Context } from "./types.js";
+/**
+ * Generates a globally unique SQL alias for the current compilation.
+ *
+ * Increments the shared `ctx.cteCounter` (a mutable reference threaded
+ * through every recursive walk call) and returns `"<prefix>_<n>"`.  Because
+ * the counter is shared, aliases produced across different branches and depths
+ * of the tree are guaranteed to be distinct within a single
+ * `compileViewDefinition` call.
+ *
+ * @param ctx - The current walker context; its `cteCounter.value` is
+ *   incremented as a side effect.
+ * @param prefix - A human-readable prefix that identifies the operator
+ *   creating the alias (e.g. `"forEach"`, `"repeat"`, `"ua"`).
+ * @returns A string of the form `"<prefix>_<n>"` that is unique within the
+ *   current compilation.
+ */
+export declare function freshAlias(ctx: Context, prefix: string): string;
+//# sourceMappingURL=aliasGenerator.d.ts.map

package/dist/queryGenerator/treeWalker/aliasGenerator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aliasGenerator.d.ts","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/aliasGenerator.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAE1C;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAG/D"}

package/dist/queryGenerator/treeWalker/aliasGenerator.js

@@ -0,0 +1,31 @@
+"use strict";
+/**
+ * Sole producer of all SQL aliases generated by the tree walker.
+ *
+ * Routing every alias through here guarantees uniqueness across the whole
+ * compile (the counter lives on Context.cteCounter and is shared by every
+ * recursive walk call).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.freshAlias = freshAlias;
+/**
+ * Generates a globally unique SQL alias for the current compilation.
+ *
+ * Increments the shared `ctx.cteCounter` (a mutable reference threaded
+ * through every recursive walk call) and returns `"<prefix>_<n>"`.  Because
+ * the counter is shared, aliases produced across different branches and depths
+ * of the tree are guaranteed to be distinct within a single
+ * `compileViewDefinition` call.
+ *
+ * @param ctx - The current walker context; its `cteCounter.value` is
+ *   incremented as a side effect.
+ * @param prefix - A human-readable prefix that identifies the operator
+ *   creating the alias (e.g. `"forEach"`, `"repeat"`, `"ua"`).
+ * @returns A string of the form `"<prefix>_<n>"` that is unique within the
+ *   current compilation.
+ */
+function freshAlias(ctx, prefix) {
+    const id = ctx.cteCounter.value++;
+    return `${prefix}_${id}`;
+}
+//# sourceMappingURL=aliasGenerator.js.map

package/dist/queryGenerator/treeWalker/aliasGenerator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aliasGenerator.js","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/aliasGenerator.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;AAoBH,gCAGC;AAnBD;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,UAAU,CAAC,GAAY,EAAE,MAAc;IACrD,MAAM,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAClC,OAAO,GAAG,MAAM,IAAI,EAAE,EAAE,CAAC;AAC3B,CAAC"}

package/dist/queryGenerator/treeWalker/classify.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Classifies a ViewDefinition select node into one of the walker's NodeKinds.
+ */
+import type { ViewDefinitionSelect } from "../../types.js";
+import type { NodeKind } from "./types.js";
+/**
+ * Classifies a ViewDefinition select node into one of the walker's NodeKinds.
+ *
+ * Operators are tested outer-to-inner: `forEachOrNull` first, then `forEach`,
+ * `repeat`, `unionAll`, `select` (Group), and finally `ColumnsOnly` as the
+ * base case. A node that carries multiple operator fields is classified as the
+ * outermost one; inner operators surface when the walker descends.
+ *
+ * @param node - The select node to classify.
+ * @returns The `NodeKind` string discriminant that determines which operator
+ *   walker handles this node.
+ */
+export declare function classifyNode(node: ViewDefinitionSelect): NodeKind;
+//# sourceMappingURL=classify.d.ts.map

package/dist/queryGenerator/treeWalker/classify.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"classify.d.ts","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/classify.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAC3D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAE3C;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,oBAAoB,GAAG,QAAQ,CAWjE"}

package/dist/queryGenerator/treeWalker/classify.js

@@ -0,0 +1,36 @@
+"use strict";
+/**
+ * Classifies a ViewDefinition select node into one of the walker's NodeKinds.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.classifyNode = classifyNode;
+/**
+ * Classifies a ViewDefinition select node into one of the walker's NodeKinds.
+ *
+ * Operators are tested outer-to-inner: `forEachOrNull` first, then `forEach`,
+ * `repeat`, `unionAll`, `select` (Group), and finally `ColumnsOnly` as the
+ * base case. A node that carries multiple operator fields is classified as the
+ * outermost one; inner operators surface when the walker descends.
+ *
+ * @param node - The select node to classify.
+ * @returns The `NodeKind` string discriminant that determines which operator
+ *   walker handles this node.
+ */
+function classifyNode(node) {
+    // Operators are ordered outer-to-inner. A node with multiple operators
+    // (e.g. `{forEach, unionAll}`) is processed as the outer one; the inner
+    // operator surfaces when the walker descends into the node's
+    // `{column, select, unionAll}` sub-node.
+    if (node.forEachOrNull !== undefined)
+        return "ForEachOrNull";
+    if (node.forEach !== undefined)
+        return "ForEach";
+    if (node.repeat && node.repeat.length > 0)
+        return "Repeat";
+    if (node.unionAll && node.unionAll.length > 0)
+        return "UnionAll";
+    if (node.select && node.select.length > 0)
+        return "Group";
+    return "ColumnsOnly";
+}
+//# sourceMappingURL=classify.js.map

package/dist/queryGenerator/treeWalker/classify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"classify.js","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/classify.ts"],"names":[],"mappings":";AAAA;;GAEG;;AAiBH,oCAWC;AAvBD;;;;;;;;;;;GAWG;AACH,SAAgB,YAAY,CAAC,IAA0B;IACrD,uEAAuE;IACvE,wEAAwE;IACxE,6DAA6D;IAC7D,yCAAyC;IACzC,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS;QAAE,OAAO,eAAe,CAAC;IAC7D,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACjD,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC;IAC3D,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,UAAU,CAAC;IACjE,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,OAAO,CAAC;IAC1D,OAAO,aAAa,CAAC;AACvB,CAAC"}

package/dist/queryGenerator/treeWalker/compile.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Public entry point for the tree-walker query generator.
+ *
+ * Wraps viewDef.select as a synthetic Group node, walks it, and renders
+ * the resulting Fragment as a single T-SQL statement.
+ */
+import { TranspilerContext } from "../../fhirpath/transpiler.js";
+import type { TranspilationResult, ViewDefinition } from "../../types.js";
+export interface CompileOptions {
+    tableName: string;
+    schemaName: string;
+    testId?: string;
+    transpilerCtx: TranspilerContext;
+}
+/**
+ * Compiles a ViewDefinition into a T-SQL query string and column metadata.
+ *
+ * Wraps `viewDef.select` as a synthetic root Group node, walks the entire
+ * select tree to produce a Fragment, then renders that Fragment into a
+ * complete T-SQL statement (WITH … SELECT … FROM … WHERE).
+ *
+ * @param viewDef - The parsed ViewDefinition whose `select` tree is compiled.
+ * @param options - Compilation options including table/schema names, an
+ *   optional test-isolation ID, and the FHIRPath transpiler context.
+ * @returns A `TranspilationResult` containing the generated SQL string and
+ *   an ordered array of column metadata matching the view's output shape.
+ */
+export declare function compileViewDefinition(viewDef: ViewDefinition, options: CompileOptions): TranspilationResult;
+//# sourceMappingURL=compile.d.ts.map

package/dist/queryGenerator/treeWalker/compile.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compile.d.ts","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/compile.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAc,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AAC7E,OAAO,KAAK,EAEV,mBAAmB,EACnB,cAAc,EAEf,MAAM,gBAAgB,CAAC;AAYxB,MAAM,WAAW,cAAc;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,aAAa,EAAE,iBAAiB,CAAC;CAClC;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,cAAc,EACvB,OAAO,EAAE,cAAc,GACtB,mBAAmB,CAuBrB"}

package/dist/queryGenerator/treeWalker/compile.js

@@ -0,0 +1,97 @@
+"use strict";
+/**
+ * Public entry point for the tree-walker query generator.
+ *
+ * Wraps viewDef.select as a synthetic Group node, walks it, and renders
+ * the resulting Fragment as a single T-SQL statement.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.compileViewDefinition = compileViewDefinition;
+const transpiler_js_1 = require("../../fhirpath/transpiler.js");
+const ColumnExpressionGenerator_js_1 = require("../ColumnExpressionGenerator.js");
+const PathParser_js_1 = require("../PathParser.js");
+const WhereClauseBuilder_js_1 = require("../WhereClauseBuilder.js");
+const render_js_1 = require("./render.js");
+const types_js_1 = require("./types.js");
+const walker_js_1 = require("./walker.js");
+const columnGenerator = new ColumnExpressionGenerator_js_1.ColumnExpressionGenerator();
+const pathParser = new PathParser_js_1.PathParser();
+const whereClauseBuilder = new WhereClauseBuilder_js_1.WhereClauseBuilder();
+/**
+ * Compiles a ViewDefinition into a T-SQL query string and column metadata.
+ *
+ * Wraps `viewDef.select` as a synthetic root Group node, walks the entire
+ * select tree to produce a Fragment, then renders that Fragment into a
+ * complete T-SQL statement (WITH … SELECT … FROM … WHERE).
+ *
+ * @param viewDef - The parsed ViewDefinition whose `select` tree is compiled.
+ * @param options - Compilation options including table/schema names, an
+ *   optional test-isolation ID, and the FHIRPath transpiler context.
+ * @returns A `TranspilationResult` containing the generated SQL string and
+ *   an ordered array of column metadata matching the view's output shape.
+ */
+function compileViewDefinition(viewDef, options) {
+    const resourceAlias = options.transpilerCtx.resourceAlias;
+    const ctx = buildRootContext(resourceAlias, options.transpilerCtx);
+    const rootNode = { select: viewDef.select };
+    const walk = (0, walker_js_1.makeWalker)({
+        columnGenerator,
+        pathParser,
+        schemaName: options.schemaName,
+        tableName: options.tableName,
+    });
+    const fragment = walk(rootNode, ctx);
+    const sql = (0, render_js_1.renderRoot)(fragment, viewDef, {
+        resourceAlias,
+        schemaName: options.schemaName,
+        tableName: options.tableName,
+        testId: options.testId,
+        whereClauseBuilder,
+        transpilerCtx: options.transpilerCtx,
+    });
+    return { sql, columns: collectColumnMetadata(viewDef.select) };
+}
+function buildRootContext(resourceAlias, transpilerCtx) {
+    const idKey = {
+        name: "id",
+        sqlExpr: `[${resourceAlias}].[id]`,
+        sqlType: types_js_1.SQL_INT,
+    };
+    return {
+        resourceAlias,
+        // Use unbracketed `r.json` for the JSON source: matches the FHIRPath
+        // transpiler's expectations (see visitor.ts handleJsonQueryMember which
+        // pattern-matches on the source string).
+        source: `${resourceAlias}.json`,
+        partitionKeys: [idKey],
+        ancestorApplies: "",
+        cteCounter: { value: 0 },
+        transpilerCtx,
+    };
+}
+/**
+ * Walk the select tree and collect ColumnInfo metadata in lexical order.
+ * Mirrors the behaviour of QueryGenerator.collectAllColumns so the public
+ * TranspilationResult.columns shape is unchanged.
+ */
+function collectColumnMetadata(selects) {
+    const out = [];
+    for (const select of selects) {
+        if (select.column) {
+            for (const column of select.column) {
+                out.push({
+                    name: column.name,
+                    type: transpiler_js_1.Transpiler.inferSqlType(column.type, column.tag),
+                    nullable: true,
+                    description: column.description,
+                });
+            }
+        }
+        if (select.select)
+            out.push(...collectColumnMetadata(select.select));
+        if (select.unionAll)
+            out.push(...collectColumnMetadata(select.unionAll));
+    }
+    return out;
+}
+//# sourceMappingURL=compile.js.map

package/dist/queryGenerator/treeWalker/compile.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compile.js","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/compile.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AAwCH,sDA0BC;AAhED,gEAA6E;AAO7E,kFAA4E;AAC5E,oDAA8C;AAC9C,oEAA8D;AAC9D,2CAAyC;AACzC,yCAAsE;AACtE,2CAAyC;AAEzC,MAAM,eAAe,GAAG,IAAI,wDAAyB,EAAE,CAAC;AACxD,MAAM,UAAU,GAAG,IAAI,0BAAU,EAAE,CAAC;AACpC,MAAM,kBAAkB,GAAG,IAAI,0CAAkB,EAAE,CAAC;AASpD;;;;;;;;;;;;GAYG;AACH,SAAgB,qBAAqB,CACnC,OAAuB,EACvB,OAAuB;IAEvB,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC,aAAa,CAAC;IAC1D,MAAM,GAAG,GAAG,gBAAgB,CAAC,aAAa,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;IAEnE,MAAM,QAAQ,GAAyB,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;IAClE,MAAM,IAAI,GAAG,IAAA,sBAAU,EAAC;QACtB,eAAe;QACf,UAAU;QACV,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,SAAS,EAAE,OAAO,CAAC,SAAS;KAC7B,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IAErC,MAAM,GAAG,GAAG,IAAA,sBAAU,EAAC,QAAQ,EAAE,OAAO,EAAE;QACxC,aAAa;QACb,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,SAAS,EAAE,OAAO,CAAC,SAAS;QAC5B,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,kBAAkB;QAClB,aAAa,EAAE,OAAO,CAAC,aAAa;KACrC,CAAC,CAAC;IAEH,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,qBAAqB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;AACjE,CAAC;AAED,SAAS,gBAAgB,CACvB,aAAqB,EACrB,aAAgC;IAEhC,MAAM,KAAK,GAAiB;QAC1B,IAAI,EAAE,IAAI;QACV,OAAO,EAAE,IAAI,aAAa,QAAQ;QAClC,OAAO,EAAE,kBAAO;KACjB,CAAC;IACF,OAAO;QACL,aAAa;QACb,qEAAqE;QACrE,wEAAwE;QACxE,yCAAyC;QACzC,MAAM,EAAE,GAAG,aAAa,OAAO;QAC/B,aAAa,EAAE,CAAC,KAAK,CAAC;QACtB,eAAe,EAAE,EAAE;QACnB,UAAU,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE;QACxB,aAAa;KACd,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,OAA+B;IAC5D,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAClB,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;gBACnC,GAAG,CAAC,IAAI,CAAC;oBACP,IAAI,EAAE,MAAM,CAAC,IAAI;oBACjB,IAAI,EAAE,0BAAU,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC;oBACtD,QAAQ,EAAE,IAAI;oBACd,WAAW,EAAE,MAAM,CAAC,WAAW;iBAChC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QACD,IAAI,MAAM,CAAC,MAAM;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,qBAAqB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QACrE,IAAI,MAAM,CAAC,QAAQ;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,qBAAqB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/queryGenerator/treeWalker/cteTemplates.d.ts

@@ -0,0 +1,58 @@
+/**
+ * SQL string templates for the recursive CTE produced by `repeat`.
+ *
+ * Builds the anchor + recursive members, propagating partition keys and
+ * baked scalar columns through both. Multi-segment paths chain CROSS APPLY
+ * OPENJSON per segment.
+ *
+ * Note: `__path` is built by string-concatenating each child's `[key]`.
+ * If a JSON object key contains a literal `.`, two distinct nodes could
+ * theoretically produce equal `__path` strings. FHIR JSON keys do not
+ * contain dots in practice; not a blocker.
+ *
+ * @author John Grimes
+ */
+import { type CteDefinition, type PartitionKey } from "./types.js";
+export interface BuildRepeatCteArgs {
+    cteAlias: string;
+    /** FHIRPath strings — first is the anchor path; all are recursive paths. */
+    paths: string[];
+    /** JSON source expression for the anchor (e.g. "r.json", "forEach_0.value"). */
+    source: string;
+    /** "FROM <table> AS [r]" — the resource table reference for the anchor. */
+    fromClause: string;
+    /** CROSS/OUTER APPLY chain inherited from ancestors (each starts with "\n"). */
+    ancestorApplies: string;
+    /** Partition keys propagated through anchor and recursive members. */
+    partitionKeys: PartitionKey[];
+    /** Resource-level WHERE applied to the anchor (or null to omit). */
+    resourcePredicate: string | null;
+}
+/**
+ * Builds the SQL body of the recursive CTE used by the Repeat operator.
+ *
+ * Produces a `CteDefinition` whose body is an anchor SELECT followed by one
+ * `UNION ALL` recursive SELECT per path in `args.paths`.  The anchor starts
+ * at the resource root and expands each array element via `OPENJSON`; each
+ * recursive member re-expands from the CTE's own `item_json` column,
+ * appending `.[key]` to the `__path` accumulator for stable per-element
+ * identity.  Multi-segment paths (e.g. `"a.b.c"`) produce a chain of nested
+ * `CROSS APPLY OPENJSON` calls.
+ *
+ * @param args - Parameters controlling CTE generation: the CTE alias, the
+ *   FHIRPath repeat paths, the JSON source expression for the anchor, the
+ *   resource table FROM clause, any ancestor APPLY chain, the partition keys
+ *   to propagate, and an optional resource-level WHERE predicate for the
+ *   anchor.
+ * @returns A `CteDefinition` with `alias` set to `args.cteAlias` and `body`
+ *   containing the full anchor + recursive SQL (without the outer
+ *   `alias AS (...)` wrapper, which `renderRoot` adds).
+ */
+export declare function buildRepeatCte(args: BuildRepeatCteArgs): CteDefinition;
+/**
+ * Renders the partition keys as a comma-separated list of bracket-quoted
+ * columns qualified by `alias` (e.g. `cte.[id], cte.[fe_0_key]`). Shared by the
+ * recursive-member projection and the repeat `%rowIndex` window's PARTITION BY.
+ */
+export declare function qualifiedKeyCols(alias: string, keys: PartitionKey[]): string;
+//# sourceMappingURL=cteTemplates.d.ts.map

package/dist/queryGenerator/treeWalker/cteTemplates.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cteTemplates.d.ts","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/cteTemplates.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EACL,KAAK,aAAa,EAClB,KAAK,YAAY,EAGlB,MAAM,YAAY,CAAC;AAOpB,MAAM,WAAW,kBAAkB;IACjC,QAAQ,EAAE,MAAM,CAAC;IACjB,4EAA4E;IAC5E,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,gFAAgF;IAChF,MAAM,EAAE,MAAM,CAAC;IACf,2EAA2E;IAC3E,UAAU,EAAE,MAAM,CAAC;IACnB,gFAAgF;IAChF,eAAe,EAAE,MAAM,CAAC;IACxB,sEAAsE;IACtE,aAAa,EAAE,YAAY,EAAE,CAAC;IAC9B,oEAAoE;IACpE,iBAAiB,EAAE,MAAM,GAAG,IAAI,CAAC;CAClC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,kBAAkB,GAAG,aAAa,CAOtE;AAqED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,MAAM,CAE5E"}

package/dist/queryGenerator/treeWalker/cteTemplates.js

@@ -0,0 +1,131 @@
+"use strict";
+/**
+ * SQL string templates for the recursive CTE produced by `repeat`.
+ *
+ * Builds the anchor + recursive members, propagating partition keys and
+ * baked scalar columns through both. Multi-segment paths chain CROSS APPLY
+ * OPENJSON per segment.
+ *
+ * Note: `__path` is built by string-concatenating each child's `[key]`.
+ * If a JSON object key contains a literal `.`, two distinct nodes could
+ * theoretically produce equal `__path` strings. FHIR JSON keys do not
+ * contain dots in practice; not a blocker.
+ *
+ * @author John Grimes
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildRepeatCte = buildRepeatCte;
+exports.qualifiedKeyCols = qualifiedKeyCols;
+const types_js_1 = require("./types.js");
+/**
+ * Builds the SQL body of the recursive CTE used by the Repeat operator.
+ *
+ * Produces a `CteDefinition` whose body is an anchor SELECT followed by one
+ * `UNION ALL` recursive SELECT per path in `args.paths`.  The anchor starts
+ * at the resource root and expands each array element via `OPENJSON`; each
+ * recursive member re-expands from the CTE's own `item_json` column,
+ * appending `.[key]` to the `__path` accumulator for stable per-element
+ * identity.  Multi-segment paths (e.g. `"a.b.c"`) produce a chain of nested
+ * `CROSS APPLY OPENJSON` calls.
+ *
+ * @param args - Parameters controlling CTE generation: the CTE alias, the
+ *   FHIRPath repeat paths, the JSON source expression for the anchor, the
+ *   resource table FROM clause, any ancestor APPLY chain, the partition keys
+ *   to propagate, and an optional resource-level WHERE predicate for the
+ *   anchor.
+ * @returns A `CteDefinition` with `alias` set to `args.cteAlias` and `body`
+ *   containing the full anchor + recursive SQL (without the outer
+ *   `alias AS (...)` wrapper, which `renderRoot` adds).
+ */
+function buildRepeatCte(args) {
+    const anchor = buildAnchorMember(args);
+    const recBlocks = args.paths.map((p, i) => buildRecursiveMember(args, p, i));
+    const body = `${anchor}
+  UNION ALL
+${recBlocks.join("\n  UNION ALL\n")}`;
+    return { alias: args.cteAlias, body };
+}
+function buildAnchorMember(args) {
+    const { paths, source, fromClause, ancestorApplies, partitionKeys, resourcePredicate, } = args;
+    const projLines = partitionKeys
+        .map((k) => `${k.sqlExpr} AS [${k.name}]`)
+        .join(",\n    ");
+    const chain = buildOpenJsonChain(source, paths[0], "anchor");
+    const wherePart = resourcePredicate ? `\n  ${resourcePredicate}` : "";
+    return `  SELECT
+    ${projLines},
+    CAST(${chain.lastAlias}.[key] AS ${types_js_1.SQL_NVARCHAR_MAX}) AS __path,
+    CAST(${orderSegment(chain.lastAlias)} AS ${types_js_1.SQL_NVARCHAR_MAX}) AS __order,
+    ${chain.lastAlias}.value AS item_json,
+    0 AS depth
+  ${fromClause}${ancestorApplies}
+  ${chain.applyClauses}${wherePart}`;
+}
+function buildRecursiveMember(args, path, index) {
+    const { cteAlias, partitionKeys } = args;
+    const head = qualifiedKeyCols("cte", partitionKeys);
+    const chain = buildOpenJsonChain("cte.item_json", path, `child_${index}`);
+    return `  SELECT
+    ${head},
+    cte.__path + '.' + CAST(${chain.lastAlias}.[key] AS ${types_js_1.SQL_NVARCHAR_4000}) AS __path,
+    cte.__order + '.' + ${orderSegment(chain.lastAlias)} AS __order,
+    ${chain.lastAlias}.value AS item_json,
+    cte.depth + 1
+  FROM ${cteAlias} AS cte
+  ${chain.applyClauses}`;
+}
+/**
+ * Width, in characters, that each `__order` segment is zero-padded to. A level
+ * with up to 10^ORDER_SEGMENT_WIDTH elements still sorts correctly; ten digits
+ * assume no single level exceeds 10^10 elements.
+ */
+const ORDER_SEGMENT_WIDTH = 10;
+/**
+ * Builds one segment of the `__order` accumulator: the element's `[key]`
+ * zero-padded to a fixed width so that lexical ordering of the `.`-joined
+ * order string is equivalent to numeric depth-first (pre-order) traversal.
+ * Without padding, lexical order would break once a level has ten or more
+ * elements (e.g. `"10" < "2"`). This is what `%rowIndex` orders by inside a
+ * `repeat`.
+ *
+ * `__order` is emitted by every repeat CTE unconditionally: the walker builds
+ * the CTE before descending into the inner subtree, so whether `%rowIndex` is
+ * actually referenced is not yet known when the column list is generated.
+ */
+function orderSegment(alias) {
+    const pad = "0".repeat(ORDER_SEGMENT_WIDTH);
+    return `RIGHT('${pad}' + CAST(${alias}.[key] AS NVARCHAR(${ORDER_SEGMENT_WIDTH})), ${ORDER_SEGMENT_WIDTH})`;
+}
+/**
+ * Renders the partition keys as a comma-separated list of bracket-quoted
+ * columns qualified by `alias` (e.g. `cte.[id], cte.[fe_0_key]`). Shared by the
+ * recursive-member projection and the repeat `%rowIndex` window's PARTITION BY.
+ */
+function qualifiedKeyCols(alias, keys) {
+    return keys.map((k) => `${alias}.[${k.name}]`).join(", ");
+}
+/**
+ * Builds the CROSS APPLY OPENJSON chain for a (possibly multi-segment) path.
+ * For "a.b.c" produces three chained APPLYs; the last alias is `finalAlias`.
+ */
+function buildOpenJsonChain(source, path, finalAlias) {
+    const segments = path.split(".");
+    if (segments.length === 1) {
+        return {
+            applyClauses: `CROSS APPLY OPENJSON(${source}, '$.${segments[0]}') AS ${finalAlias}`,
+            lastAlias: finalAlias,
+        };
+    }
+    let chain = "";
+    let currentSource = source;
+    for (let i = 0; i < segments.length; i++) {
+        const isLast = i === segments.length - 1;
+        const alias = isLast ? finalAlias : `${finalAlias}_${i}`;
+        if (i > 0)
+            chain += "\n  ";
+        chain += `CROSS APPLY OPENJSON(${currentSource}, '$.${segments[i]}') AS ${alias}`;
+        currentSource = `${alias}.value`;
+    }
+    return { applyClauses: chain, lastAlias: finalAlias };
+}
+//# sourceMappingURL=cteTemplates.js.map

package/dist/queryGenerator/treeWalker/cteTemplates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cteTemplates.js","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/cteTemplates.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;GAaG;;AAkDH,wCAOC;AA0ED,4CAEC;AAnID,yCAKoB;AAuBpB;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAgB,cAAc,CAAC,IAAwB;IACrD,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACvC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,IAAI,GAAG,GAAG,MAAM;;EAEtB,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC;IACpC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC;AACxC,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAwB;IACjD,MAAM,EACJ,KAAK,EACL,MAAM,EACN,UAAU,EACV,eAAe,EACf,aAAa,EACb,iBAAiB,GAClB,GAAG,IAAI,CAAC;IACT,MAAM,SAAS,GAAG,aAAa;SAC5B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO,QAAQ,CAAC,CAAC,IAAI,GAAG,CAAC;SACzC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnB,MAAM,KAAK,GAAG,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC7D,MAAM,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,OAAO,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAEtE,OAAO;MACH,SAAS;WACJ,KAAK,CAAC,SAAS,aAAa,2BAAgB;WAC5C,YAAY,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,2BAAgB;MACzD,KAAK,CAAC,SAAS;;IAEjB,UAAU,GAAG,eAAe;IAC5B,KAAK,CAAC,YAAY,GAAG,SAAS,EAAE,CAAC;AACrC,CAAC;AAED,SAAS,oBAAoB,CAC3B,IAAwB,EACxB,IAAY,EACZ,KAAa;IAEb,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC;IACzC,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;IACpD,MAAM,KAAK,GAAG,kBAAkB,CAAC,eAAe,EAAE,IAAI,EAAE,SAAS,KAAK,EAAE,CAAC,CAAC;IAC1E,OAAO;MACH,IAAI;8BACoB,KAAK,CAAC,SAAS,aAAa,4BAAiB;0BACjD,YAAY,CAAC,KAAK,CAAC,SAAS,CAAC;MACjD,KAAK,CAAC,SAAS;;SAEZ,QAAQ;IACb,KAAK,CAAC,YAAY,EAAE,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAE/B;;;;;;;;;;;GAWG;AACH,SAAS,YAAY,CAAC,KAAa;IACjC,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;IAC5C,OAAO,UAAU,GAAG,YAAY,KAAK,sBAAsB,mBAAmB,OAAO,mBAAmB,GAAG,CAAC;AAC9G,CAAC;AAED;;;;GAIG;AACH,SAAgB,gBAAgB,CAAC,KAAa,EAAE,IAAoB;IAClE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC5D,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CACzB,MAAc,EACd,IAAY,EACZ,UAAkB;IAElB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO;YACL,YAAY,EAAE,wBAAwB,MAAM,QAAQ,QAAQ,CAAC,CAAC,CAAC,SAAS,UAAU,EAAE;YACpF,SAAS,EAAE,UAAU;SACtB,CAAC;IACJ,CAAC;IAED,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,IAAI,aAAa,GAAG,MAAM,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,IAAI,CAAC,EAAE,CAAC;QACzD,IAAI,CAAC,GAAG,CAAC;YAAE,KAAK,IAAI,MAAM,CAAC;QAC3B,KAAK,IAAI,wBAAwB,aAAa,QAAQ,QAAQ,CAAC,CAAC,CAAC,SAAS,KAAK,EAAE,CAAC;QAClF,aAAa,GAAG,GAAG,KAAK,QAAQ,CAAC;IACnC,CAAC;IACD,OAAO,EAAE,YAAY,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;AACxD,CAAC"}

package/dist/queryGenerator/treeWalker/index.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Tree-walker query generator.
+ */
+export { compileViewDefinition } from "./compile.js";
+export type { CompileOptions } from "./compile.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/queryGenerator/treeWalker/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AACrD,YAAY,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC"}

package/dist/queryGenerator/treeWalker/index.js

@@ -0,0 +1,9 @@
+"use strict";
+/**
+ * Tree-walker query generator.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.compileViewDefinition = void 0;
+var compile_js_1 = require("./compile.js");
+Object.defineProperty(exports, "compileViewDefinition", { enumerable: true, get: function () { return compile_js_1.compileViewDefinition; } });
+//# sourceMappingURL=index.js.map

package/dist/queryGenerator/treeWalker/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/index.ts"],"names":[],"mappings":";AAAA;;GAEG;;;AAEH,2CAAqD;AAA5C,mHAAA,qBAAqB,OAAA"}

package/dist/queryGenerator/treeWalker/mergeSiblings.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Merges sibling fragments produced by walking children of a Group.
+ *
+ * Flattens CTE lists, concatenates `fromExtensions` strings and `columns`
+ * arrays in order, and passes `partitionKeys` through unchanged from `ctx`.
+ */
+import type { Context, Fragment } from "./types.js";
+/**
+ * Merges sibling Fragments produced by walking children of a Group node.
+ *
+ * Flattens each fragment's `ctes` list, concatenates `fromExtensions` strings
+ * (preserving order so aliases are introduced before they are referenced), and
+ * concatenates `columns` arrays in lexical order.  `partitionKeys` are passed
+ * through unchanged from `ctx` — siblings share the same partition scope.
+ *
+ * Returns an empty Fragment (no CTEs, no extensions, no columns) when
+ * `fragments` is empty, and returns the sole fragment unchanged when only one
+ * is provided.
+ *
+ * @param fragments - Ordered array of sibling Fragments to merge.
+ * @param ctx - The context of the parent Group node, used to supply
+ *   `partitionKeys` for the merged result and as the base for the empty-array
+ *   case.
+ * @returns A single merged Fragment whose columns, CTEs, and FROM extensions
+ *   are the ordered union of all input fragments.
+ */
+export declare function mergeSiblings(fragments: Fragment[], ctx: Context): Fragment;
+//# sourceMappingURL=mergeSiblings.d.ts.map

package/dist/queryGenerator/treeWalker/mergeSiblings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mergeSiblings.d.ts","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/mergeSiblings.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEpD;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,GAAG,EAAE,OAAO,GAAG,QAAQ,CA0B3E"}

package/dist/queryGenerator/treeWalker/mergeSiblings.js

@@ -0,0 +1,54 @@
+"use strict";
+/**
+ * Merges sibling fragments produced by walking children of a Group.
+ *
+ * Flattens CTE lists, concatenates `fromExtensions` strings and `columns`
+ * arrays in order, and passes `partitionKeys` through unchanged from `ctx`.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mergeSiblings = mergeSiblings;
+/**
+ * Merges sibling Fragments produced by walking children of a Group node.
+ *
+ * Flattens each fragment's `ctes` list, concatenates `fromExtensions` strings
+ * (preserving order so aliases are introduced before they are referenced), and
+ * concatenates `columns` arrays in lexical order.  `partitionKeys` are passed
+ * through unchanged from `ctx` — siblings share the same partition scope.
+ *
+ * Returns an empty Fragment (no CTEs, no extensions, no columns) when
+ * `fragments` is empty, and returns the sole fragment unchanged when only one
+ * is provided.
+ *
+ * @param fragments - Ordered array of sibling Fragments to merge.
+ * @param ctx - The context of the parent Group node, used to supply
+ *   `partitionKeys` for the merged result and as the base for the empty-array
+ *   case.
+ * @returns A single merged Fragment whose columns, CTEs, and FROM extensions
+ *   are the ordered union of all input fragments.
+ */
+function mergeSiblings(fragments, ctx) {
+    if (fragments.length === 0) {
+        return {
+            ctes: [],
+            fromExtensions: "",
+            columns: [],
+            partitionKeys: ctx.partitionKeys,
+        };
+    }
+    if (fragments.length === 1)
+        return fragments[0];
+    const ctes = fragments.flatMap((f) => f.ctes);
+    const fromExtensions = fragments.map((f) => f.fromExtensions).join("");
+    const columns = fragments.flatMap((f) => f.columns);
+    // Row siblings + zero or more set siblings: each set fragment already carries
+    // its own INNER JOIN to its CTE, joined on the partition keys it inherited
+    // from `ctx`. The outer FROM stays as the resource table so row siblings can
+    // keep their references to `r` valid.
+    return {
+        ctes,
+        fromExtensions,
+        columns,
+        partitionKeys: ctx.partitionKeys,
+    };
+}
+//# sourceMappingURL=mergeSiblings.js.map

package/dist/queryGenerator/treeWalker/mergeSiblings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mergeSiblings.js","sourceRoot":"","sources":["../../../src/queryGenerator/treeWalker/mergeSiblings.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AAuBH,sCA0BC;AA7CD;;;;;;;;;;;;;;;;;;GAkBG;AACH,SAAgB,aAAa,CAAC,SAAqB,EAAE,GAAY;IAC/D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO;YACL,IAAI,EAAE,EAAE;YACR,cAAc,EAAE,EAAE;YAClB,OAAO,EAAE,EAAE;YACX,aAAa,EAAE,GAAG,CAAC,aAAa;SACjC,CAAC;IACJ,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;IAEhD,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC9C,MAAM,cAAc,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvE,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IAEpD,8EAA8E;IAC9E,2EAA2E;IAC3E,6EAA6E;IAC7E,sCAAsC;IACtC,OAAO;QACL,IAAI;QACJ,cAAc;QACd,OAAO;QACP,aAAa,EAAE,GAAG,CAAC,aAAa;KACjC,CAAC;AACJ,CAAC"}