typhex 0.1.0-alpha.0

package/dist/orm/helpers/insert-graph/insert-graph-planner.js

@@ -0,0 +1,258 @@
+import { getPkColumnsFromSchema, } from "../../../entity/entity.js";
+import { getEntityByTableName } from "../../../entity/global-driver.js";
+import { isRecord, toArray } from "../../../utils.js";
+import { InsertGraphBatchExecutor } from "./insert-graph-batch-executor.js";
+import { InsertGraphSequentialExecutor } from "./insert-graph-sequential-executor.js";
+export class InsertGraphPlanner {
+    state;
+    input;
+    constructor(state, input) {
+        this.state = state;
+        this.input = input;
+    }
+    async execute() {
+        const graphs = toArray(this.input);
+        if (graphs.length === 0)
+            return [];
+        const capabilities = this.state.qe.dialect.insertCapabilities;
+        const plan = this.buildInsertGraphPlan(graphs, capabilities);
+        await selectExecutor(plan).execute();
+        const roots = await this.materializeRootRows(plan);
+        return Array.isArray(this.input)
+            ? roots
+            : roots[0];
+    }
+    buildInsertGraphPlan(graphs, capabilities) {
+        const plan = {
+            qe: this.state.qe,
+            nodes: [],
+            rootNodeIds: [],
+        };
+        const rootInfo = createEntityInfo(this.state.entity);
+        for (const graph of graphs) {
+            const rootNode = this.planGraphNode(plan, capabilities, rootInfo, graph);
+            plan.rootNodeIds.push(rootNode.id);
+        }
+        return plan;
+    }
+    planGraphNode(plan, capabilities, entityInfo, graph) {
+        const { scalarData, relationData } = splitGraphPayload(entityInfo, graph);
+        const node = registerPlannedNode(plan, {
+            tableName: entityInfo.tableName,
+            entity: entityInfo.entity,
+            scalarData,
+            pkColumns: entityInfo.pkColumns,
+            idResolution: resolveIdResolution(scalarData, entityInfo.pkColumns, capabilities),
+        });
+        for (const [relKey, relValue] of Object.entries(relationData)) {
+            const relDef = assertKnownRelation(relKey, entityInfo);
+            switch (relDef._relType) {
+                case "one-to-one":
+                case "many-to-one":
+                    assertRelationIsRecord(relKey, relDef._relType, relValue);
+                    this.planOwningToOneRelation(plan, capabilities, node, relDef, relValue);
+                    break;
+                case "one-to-many":
+                    assertRelationIsArray(relKey, relDef._relType, relValue);
+                    this.planOneToManyChildren(plan, capabilities, node, relKey, relDef, relValue);
+                    break;
+                case "many-to-many":
+                    assertRelationIsArray(relKey, relDef._relType, relValue);
+                    this.planManyToManyRelations(plan, capabilities, node, relKey, relDef, relValue);
+                    break;
+            }
+        }
+        return node;
+    }
+    planOwningToOneRelation(plan, capabilities, node, relDef, relValue) {
+        const options = relDef._options;
+        const info = resolveTargetInfo(relDef);
+        const parentNode = this.planGraphNode(plan, capabilities, info, relValue);
+        addDependency(node, parentNode.id, getReferenceColumns(info, options), toArray(options.foreignKey));
+    }
+    planOneToManyChildren(plan, capabilities, node, relKey, relDef, relValue) {
+        const options = relDef._options;
+        const info = resolveTargetInfo(relDef);
+        const fkColumns = toArray(options.foreignKey);
+        for (const item of relValue) {
+            assertChildIsRecord(relKey, item);
+            const childNode = this.planGraphNode(plan, capabilities, info, item);
+            addDependency(childNode, node.id, node.pkColumns, fkColumns);
+        }
+    }
+    planManyToManyRelations(plan, capabilities, node, relKey, relDef, relValue) {
+        const info = resolveTargetInfo(relDef);
+        const junction = resolveJunctionInfo(relDef);
+        for (const item of relValue) {
+            assertChildIsRecord(relKey, item);
+            const relatedNode = this.resolveManyToManyTargetNode(plan, capabilities, info, relKey, item);
+            const junctionNode = this.createJunctionNode(plan, junction);
+            addDependency(junctionNode, node.id, node.pkColumns, junction.fkColumns);
+            addDependency(junctionNode, relatedNode.id, info.pkColumns, junction.refColumns);
+        }
+    }
+    resolveManyToManyTargetNode(plan, capabilities, info, relKey, item) {
+        const referenceRow = parseManyToManyReference(relKey, info.pkColumns, item);
+        if (referenceRow) {
+            return this.createReferenceNode(plan, info.entity, info.pkColumns, referenceRow);
+        }
+        return this.planGraphNode(plan, capabilities, info, item);
+    }
+    createJunctionNode(plan, junction) {
+        return registerPlannedNode(plan, {
+            tableName: junction.table,
+            entity: junction.entity,
+            scalarData: {},
+            pkColumns: [],
+            idResolution: "provided",
+        });
+    }
+    createReferenceNode(plan, targetEntity, pkColumns, referenceRow) {
+        return registerPlannedNode(plan, {
+            tableName: targetEntity.table._table,
+            entity: targetEntity,
+            scalarData: { ...referenceRow },
+            pkColumns,
+            idResolution: "provided",
+            insertedRow: { ...referenceRow },
+            materializedRow: { ...referenceRow },
+        });
+    }
+    async materializeRootRows(plan) {
+        const roots = [];
+        for (const nodeId of plan.rootNodeIds) {
+            roots.push(await materializeRoot(plan, plan.nodes[nodeId]));
+        }
+        return roots;
+    }
+}
+async function materializeRoot(plan, node) {
+    if (node.materializedRow)
+        return node.materializedRow;
+    if (!node.insertedRow) {
+        throw new Error("insertGraph: root row was not inserted");
+    }
+    const refetched = await node.entity.query(plan.qe).findById(node.insertedRow);
+    if (refetched == null) {
+        throw new Error("insertGraph: insert succeeded but root row could not be fetched back");
+    }
+    node.materializedRow = refetched;
+    return node.materializedRow;
+}
+function selectExecutor(plan) {
+    const canBatch = plan.nodes.every((node) => node.idResolution !== "unresolvableInBatch");
+    return canBatch ? new InsertGraphBatchExecutor(plan) : new InsertGraphSequentialExecutor(plan);
+}
+function createEntityInfo(entity) {
+    return {
+        tableName: entity.table._table,
+        columnSet: new Set(Object.keys(entity.table._schema)),
+        rels: entity.table._relations,
+        pkColumns: getPkColumnsFromSchema(entity.table._schema),
+        entity,
+    };
+}
+function assertKnownRelation(relKey, entityInfo) {
+    const relDef = entityInfo.rels?.[relKey];
+    if (!relDef) {
+        throw new Error(`insertGraph: unknown relation "${relKey}" on entity "${entityInfo.tableName}"`);
+    }
+    return relDef;
+}
+function assertRelationIsRecord(relKey, relType, value) {
+    if (!isRecord(value)) {
+        throw new Error(`insertGraph: relation "${relKey}" (${relType}) expects an object`);
+    }
+}
+function assertRelationIsArray(relKey, relType, value) {
+    if (!Array.isArray(value)) {
+        throw new Error(`insertGraph: relation "${relKey}" (${relType}) expects an array`);
+    }
+}
+function assertChildIsRecord(relKey, item) {
+    if (!isRecord(item)) {
+        throw new Error(`insertGraph: relation "${relKey}" array items must be objects`);
+    }
+}
+function splitGraphPayload(entityInfo, graph) {
+    const scalarData = {};
+    const relationData = {};
+    const { columnSet, rels, tableName } = entityInfo;
+    for (const [key, value] of Object.entries(graph)) {
+        if (value === undefined)
+            continue;
+        if (rels && key in rels) {
+            relationData[key] = value;
+        }
+        else if (columnSet.has(key)) {
+            scalarData[key] = value;
+        }
+        else {
+            throw new Error(`insertGraph: unknown key "${key}" on entity "${tableName}"`);
+        }
+    }
+    return { scalarData, relationData };
+}
+function resolveIdResolution(scalarData, pkColumns, capabilities) {
+    if (pkColumns.every((column) => scalarData[column] !== undefined))
+        return "provided";
+    if (capabilities.supportsReturning)
+        return "needsReturning";
+    if (capabilities.supportsSequences && pkColumns.length === 1)
+        return "needsSequence";
+    return "unresolvableInBatch";
+}
+function parseManyToManyReference(relKey, targetPkColumns, data) {
+    const pkSet = new Set(targetPkColumns);
+    const pkKeys = [];
+    const extraKeys = [];
+    for (const key of Object.keys(data)) {
+        if (data[key] === undefined)
+            continue;
+        if (pkSet.has(key))
+            pkKeys.push(key);
+        else
+            extraKeys.push(key);
+    }
+    if (pkKeys.length === 0)
+        return null;
+    if (pkKeys.length < targetPkColumns.length) {
+        throw new Error(`insertGraph: relation "${relKey}" expects either all target primary key fields or none`);
+    }
+    if (extraKeys.length > 0) {
+        throw new Error(`insertGraph: relation "${relKey}" reference objects may only contain primary key fields`);
+    }
+    return data;
+}
+function getReferenceColumns(info, options) {
+    if (options.references == null)
+        return info.pkColumns;
+    return toArray(options.references);
+}
+function resolveTargetInfo(relDef) {
+    return createEntityInfo(relDef._target());
+}
+function resolveJunctionInfo(relDef) {
+    const options = relDef._options;
+    return {
+        table: options.junction,
+        entity: getEntityByTableName(options.junction),
+        fkColumns: toArray(options.foreignKey),
+        refColumns: toArray(options.referenceKey),
+    };
+}
+function addDependency(node, sourceNodeId, sourceColumns, targetColumns) {
+    node.dependencyIds.push(sourceNodeId);
+    node.pendingCopies.push({ sourceNodeId, sourceColumns, targetColumns });
+}
+function registerPlannedNode(plan, fields) {
+    const node = {
+        id: plan.nodes.length,
+        dependencyIds: [],
+        pendingCopies: [],
+        ...fields,
+    };
+    plan.nodes.push(node);
+    return node;
+}
+//# sourceMappingURL=insert-graph-planner.js.map

package/dist/orm/helpers/insert-graph/insert-graph-planner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"insert-graph-planner.js","sourceRoot":"","sources":["../../../../src/orm/helpers/insert-graph/insert-graph-planner.ts"],"names":[],"mappings":"AACA,OAAO,EACL,sBAAsB,GAGvB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,oBAAoB,EAAE,MAAM,kCAAkC,CAAC;AAQxE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAGtD,OAAO,EAAE,wBAAwB,EAAE,MAAM,kCAAkC,CAAC;AAE5E,OAAO,EAAE,6BAA6B,EAAE,MAAM,uCAAuC,CAAC;AA8CtF,MAAM,OAAO,kBAAkB;IAEV;IACA;IAFnB,YACmB,KAAoC,EACpC,KAAuB;QADvB,UAAK,GAAL,KAAK,CAA+B;QACpC,UAAK,GAAL,KAAK,CAAkB;IACvC,CAAC;IAEJ,KAAK,CAAC,OAAO;QACX,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAyB,CAAC;QAE1D,MAAM,YAAY,GAAI,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,OAAmB,CAAC,kBAAkB,CAAC;QAC3E,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QAE7D,MAAM,cAAc,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACnD,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAC9B,CAAC,CAAE,KAA6B;YAChC,CAAC,CAAE,KAAK,CAAC,CAAC,CAAuB,CAAC;IACtC,CAAC;IAEO,oBAAoB,CAC1B,MAAiC,EACjC,YAAuC;QAEvC,MAAM,IAAI,GAAoB;YAC5B,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE;YACjB,KAAK,EAAE,EAAE;YACT,WAAW,EAAE,EAAE;SAChB,CAAC;QAEF,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,MAAO,CAAC,CAAC;QACtD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YACzE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,aAAa,CACnB,IAAqB,EACrB,YAAuC,EACvC,UAA4B,EAC5B,KAA8B;QAE9B,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,GAAG,iBAAiB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC1E,MAAM,IAAI,GAAG,mBAAmB,CAAC,IAAI,EAAE;YACrC,SAAS,EAAE,UAAU,CAAC,SAAS;YAC/B,MAAM,EAAE,UAAU,CAAC,MAAM;YACzB,UAAU;YACV,SAAS,EAAE,UAAU,CAAC,SAAS;YAC/B,YAAY,EAAE,mBAAmB,CAAC,UAAU,EAAE,UAAU,CAAC,SAAS,EAAE,YAAY,CAAC;SAClF,CAAC,CAAC;QAEH,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;YAC9D,MAAM,MAAM,GAAG,mBAAmB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;YACvD,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACxB,KAAK,YAAY,CAAC;gBAClB,KAAK,aAAa;oBAChB,sBAAsB,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oBAC1D,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;oBACzE,MAAM;gBACR,KAAK,aAAa;oBAChB,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oBACzD,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;oBAC/E,MAAM;gBACR,KAAK,cAAc;oBACjB,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oBACzD,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;oBACjF,MAAM;YACV,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,uBAAuB,CAC7B,IAAqB,EACrB,YAAuC,EACvC,IAAiB,EACjB,MAAmB,EACnB,QAAiC;QAEjC,MAAM,OAAO,GAAG,MAAM,CAAC,QAA2B,CAAC;QACnD,MAAM,IAAI,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC1E,aAAa,CACX,IAAI,EACJ,UAAU,CAAC,EAAE,EACb,mBAAmB,CAAC,IAAI,EAAE,OAAO,CAAC,EAClC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAC5B,CAAC;IACJ,CAAC;IAEO,qBAAqB,CAC3B,IAAqB,EACrB,YAAuC,EACvC,IAAiB,EACjB,MAAc,EACd,MAAmB,EACnB,QAAmB;QAEnB,MAAM,OAAO,GAAG,MAAM,CAAC,QAA2B,CAAC;QACnD,MAAM,IAAI,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,mBAAmB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAClC,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACrE,aAAa,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAEO,uBAAuB,CAC7B,IAAqB,EACrB,YAAuC,EACvC,IAAiB,EACjB,MAAc,EACd,MAAmB,EACnB,QAAmB;QAEnB,MAAM,IAAI,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAE7C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,mBAAmB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAClC,MAAM,WAAW,GAAG,IAAI,CAAC,2BAA2B,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YAC7F,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC7D,aAAa,CAAC,YAAY,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;YACzE,aAAa,CAAC,YAAY,EAAE,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC;QACnF,CAAC;IACH,CAAC;IAEO,2BAA2B,CACjC,IAAqB,EACrB,YAAuC,EACvC,IAAsB,EACtB,MAAc,EACd,IAA6B;QAE7B,MAAM,YAAY,GAAG,wBAAwB,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAC5E,IAAI,YAAY,EAAE,CAAC;YACjB,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QACnF,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC5D,CAAC;IAEO,kBAAkB,CAAC,IAAqB,EAAE,QAAsB;QACtE,OAAO,mBAAmB,CAAC,IAAI,EAAE;YAC/B,SAAS,EAAE,QAAQ,CAAC,KAAK;YACzB,MAAM,EAAE,QAAQ,CAAC,MAAM;YACvB,UAAU,EAAE,EAAE;YACd,SAAS,EAAE,EAAE;YACb,YAAY,EAAE,UAAU;SACzB,CAAC,CAAC;IACL,CAAC;IAEO,mBAAmB,CACzB,IAAqB,EACrB,YAA4B,EAC5B,SAAmB,EACnB,YAAqC;QAErC,OAAO,mBAAmB,CAAC,IAAI,EAAE;YAC/B,SAAS,EAAE,YAAY,CAAC,KAAK,CAAC,MAAM;YACpC,MAAM,EAAE,YAAY;YACpB,UAAU,EAAE,EAAE,GAAG,YAAY,EAAE;YAC/B,SAAS;YACT,YAAY,EAAE,UAAU;YACxB,WAAW,EAAE,EAAE,GAAG,YAAY,EAAE;YAChC,eAAe,EAAE,EAAE,GAAG,YAAY,EAAE;SACrC,CAAC,CAAC;IACL,CAAC;IAEO,KAAK,CAAC,mBAAmB,CAAC,IAAqB;QACrD,MAAM,KAAK,GAA8B,EAAE,CAAC;QAC5C,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,MAAM,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED,KAAK,UAAU,eAAe,CAC5B,IAAqB,EACrB,IAAiB;IAEjB,IAAI,IAAI,CAAC,eAAe;QAAE,OAAO,IAAI,CAAC,eAAe,CAAC;IACtD,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC9E,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,sEAAsE,CAAC,CAAC;IAC1F,CAAC;IACD,IAAI,CAAC,eAAe,GAAG,SAAoC,CAAC;IAC5D,OAAO,IAAI,CAAC,eAAe,CAAC;AAC9B,CAAC;AAED,SAAS,cAAc,CAAC,IAAqB;IAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,KAAK,qBAAqB,CAAC,CAAC;IACzF,OAAO,QAAQ,CAAC,CAAC,CAAC,IAAI,wBAAwB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,6BAA6B,CAAC,IAAI,CAAC,CAAC;AACjG,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAsB;IAC9C,OAAO;QACL,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;QAC9B,SAAS,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACrD,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,UAAU;QAC7B,SAAS,EAAE,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC;QACvD,MAAM;KACP,CAAC;AACJ,CAAC;AAED,SAAS,mBAAmB,CAAC,MAAc,EAAE,UAA4B;IACvE,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC;IACzC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CACb,kCAAkC,MAAM,gBAAgB,UAAU,CAAC,SAAS,GAAG,CAChF,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,sBAAsB,CAC7B,MAAc,EACd,OAAqB,EACrB,KAAc;IAEd,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACrB,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,MAAM,OAAO,qBAAqB,CAAC,CAAC;IACtF,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAC5B,MAAc,EACd,OAAqB,EACrB,KAAc;IAEd,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,MAAM,OAAO,oBAAoB,CAAC,CAAC;IACrF,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAC1B,MAAc,EACd,IAAa;IAEb,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,+BAA+B,CAAC,CAAC;IACnF,CAAC;AACH,CAAC;AAED,SAAS,iBAAiB,CACxB,UAA4B,EAC5B,KAA8B;IAE9B,MAAM,UAAU,GAA4B,EAAE,CAAC;IAC/C,MAAM,YAAY,GAA4B,EAAE,CAAC;IACjD,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,UAAU,CAAC;IAElD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;YACxB,YAAY,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QAC5B,CAAC;aAAM,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9B,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,6BAA6B,GAAG,gBAAgB,SAAS,GAAG,CAAC,CAAC;QAChF,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC;AACtC,CAAC;AAED,SAAS,mBAAmB,CAC1B,UAAmC,EACnC,SAAmB,EACnB,YAAuC;IAEvC,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC;QAAE,OAAO,UAAU,CAAC;IACrF,IAAI,YAAY,CAAC,iBAAiB;QAAE,OAAO,gBAAgB,CAAC;IAC5D,IAAI,YAAY,CAAC,iBAAiB,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,eAAe,CAAC;IACrF,OAAO,qBAAqB,CAAC;AAC/B,CAAC;AAED,SAAS,wBAAwB,CAC/B,MAAc,EACd,eAAyB,EACzB,IAA6B;IAE7B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;IACvC,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS;YAAE,SAAS;QACtC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YAChC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,IAAI,MAAM,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC;QAC3C,MAAM,IAAI,KAAK,CACb,0BAA0B,MAAM,wDAAwD,CACzF,CAAC;IACJ,CAAC;IACD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CACb,0BAA0B,MAAM,yDAAyD,CAC1F,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAsB,EAAE,OAAwB;IAC3E,IAAI,OAAO,CAAC,UAAU,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC;IACtD,OAAO,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,iBAAiB,CAAC,MAAmB;IAC5C,OAAO,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAoB,CAAC,CAAC;AAC9D,CAAC;AASD,SAAS,mBAAmB,CAAC,MAAmB;IAC9C,MAAM,OAAO,GAAG,MAAM,CAAC,QAA2B,CAAC;IACnD,OAAO;QACL,KAAK,EAAE,OAAO,CAAC,QAAQ;QACvB,MAAM,EAAE,oBAAoB,CAAC,OAAO,CAAC,QAAQ,CAAmB;QAChE,SAAS,EAAE,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC;QACtC,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC;KAC1C,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CACpB,IAAiB,EACjB,YAAoB,EACpB,aAAuB,EACvB,aAAuB;IAEvB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACtC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,CAAC,CAAC;AAC1E,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAqB,EAAE,MAAwB;IAC1E,MAAM,IAAI,GAAgB;QACxB,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;QACrB,aAAa,EAAE,EAAE;QACjB,aAAa,EAAE,EAAE;QACjB,GAAG,MAAM;KACV,CAAC;IACF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtB,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/orm/helpers/insert-graph/insert-graph-sequential-executor.d.ts

@@ -0,0 +1,7 @@
+import type { QueryExecutor } from "../../db.js";
+import { InsertGraphExecutor } from "./insert-graph-executor.js";
+import type { PlannedNode } from "./insert-graph-planner.js";
+export declare class InsertGraphSequentialExecutor extends InsertGraphExecutor {
+    protected insertReadyNodes(qe: QueryExecutor, nodes: PlannedNode[]): Promise<void>;
+}
+//# sourceMappingURL=insert-graph-sequential-executor.d.ts.map

package/dist/orm/helpers/insert-graph/insert-graph-sequential-executor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"insert-graph-sequential-executor.d.ts","sourceRoot":"","sources":["../../../../src/orm/helpers/insert-graph/insert-graph-sequential-executor.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AACjE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAE7D,qBAAa,6BAA8B,SAAQ,mBAAmB;cACpD,gBAAgB,CAAC,EAAE,EAAE,aAAa,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;CAGzF"}

package/dist/orm/helpers/insert-graph/insert-graph-sequential-executor.js

@@ -0,0 +1,8 @@
+import { InsertGraphExecutor } from "./insert-graph-executor.js";
+export class InsertGraphSequentialExecutor extends InsertGraphExecutor {
+    async insertReadyNodes(qe, nodes) {
+        for (const node of nodes)
+            await this.insertSingleNode(qe, node);
+    }
+}
+//# sourceMappingURL=insert-graph-sequential-executor.js.map

package/dist/orm/helpers/insert-graph/insert-graph-sequential-executor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"insert-graph-sequential-executor.js","sourceRoot":"","sources":["../../../../src/orm/helpers/insert-graph/insert-graph-sequential-executor.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAGjE,MAAM,OAAO,6BAA8B,SAAQ,mBAAmB;IAC1D,KAAK,CAAC,gBAAgB,CAAC,EAAiB,EAAE,KAAoB;QACtE,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,MAAM,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAClE,CAAC;CACF"}

package/dist/orm/helpers/insert-graph/sequence-id-assigner.d.ts

@@ -0,0 +1,15 @@
+import type { QueryCompiler } from "../../../dbs/types.js";
+import type { QueryExecutor } from "../../db.js";
+import type { PlannedNode } from "./insert-graph-planner.js";
+export declare class SequenceIdAssigner {
+    private readonly compiler;
+    private readonly qe;
+    private readonly tableName;
+    private readonly nodes;
+    constructor(compiler: QueryCompiler, qe: QueryExecutor, tableName: string, nodes: PlannedNode[]);
+    assign(): Promise<void>;
+    private requireSinglePkColumn;
+    private allocateValues;
+    private extractValues;
+}
+//# sourceMappingURL=sequence-id-assigner.d.ts.map

package/dist/orm/helpers/insert-graph/sequence-id-assigner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequence-id-assigner.d.ts","sourceRoot":"","sources":["../../../../src/orm/helpers/insert-graph/sequence-id-assigner.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAE7D,qBAAa,kBAAkB;IAE3B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,EAAE;IACnB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,KAAK;gBAHL,QAAQ,EAAE,aAAa,EACvB,EAAE,EAAE,aAAa,EACjB,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,WAAW,EAAE;IAGjC,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC;IAY7B,OAAO,CAAC,qBAAqB;YASf,cAAc;IAM5B,OAAO,CAAC,aAAa;CActB"}

package/dist/orm/helpers/insert-graph/sequence-id-assigner.js

@@ -0,0 +1,48 @@
+export class SequenceIdAssigner {
+    compiler;
+    qe;
+    tableName;
+    nodes;
+    constructor(compiler, qe, tableName, nodes) {
+        this.compiler = compiler;
+        this.qe = qe;
+        this.tableName = tableName;
+        this.nodes = nodes;
+    }
+    async assign() {
+        const sequenceNodes = this.nodes.filter((node) => node.idResolution === "needsSequence");
+        if (sequenceNodes.length === 0)
+            return;
+        const pkColumn = this.requireSinglePkColumn(sequenceNodes[0].pkColumns);
+        const values = await this.allocateValues(pkColumn, sequenceNodes.length);
+        for (const [index, node] of sequenceNodes.entries()) {
+            node.scalarData[pkColumn] = values[index];
+            node.idResolution = "provided";
+        }
+    }
+    requireSinglePkColumn(pkColumns) {
+        if (pkColumns.length !== 1) {
+            throw new Error("insertGraph: sequence-backed batch inserts require a single primary key column");
+        }
+        return pkColumns[0];
+    }
+    async allocateValues(pkColumn, count) {
+        const compiled = this.compiler.compileNextSequenceValues(this.tableName, pkColumn, count);
+        const rows = await this.qe.query(compiled.sql, compiled.params);
+        return this.extractValues(rows, count);
+    }
+    extractValues(rows, expectedCount) {
+        if (rows.length !== expectedCount) {
+            throw new Error("insertGraph: sequence allocation did not return the expected number of rows");
+        }
+        return rows.map((row) => {
+            if (row != null && typeof row === "object") {
+                const values = Object.values(row);
+                if (values.length === 1)
+                    return values[0];
+            }
+            throw new Error("insertGraph: sequence allocation rows must contain exactly one value");
+        });
+    }
+}
+//# sourceMappingURL=sequence-id-assigner.js.map

package/dist/orm/helpers/insert-graph/sequence-id-assigner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequence-id-assigner.js","sourceRoot":"","sources":["../../../../src/orm/helpers/insert-graph/sequence-id-assigner.ts"],"names":[],"mappings":"AAIA,MAAM,OAAO,kBAAkB;IAEV;IACA;IACA;IACA;IAJnB,YACmB,QAAuB,EACvB,EAAiB,EACjB,SAAiB,EACjB,KAAoB;QAHpB,aAAQ,GAAR,QAAQ,CAAe;QACvB,OAAE,GAAF,EAAE,CAAe;QACjB,cAAS,GAAT,SAAS,CAAQ;QACjB,UAAK,GAAL,KAAK,CAAe;IACpC,CAAC;IAEJ,KAAK,CAAC,MAAM;QACV,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,KAAK,eAAe,CAAC,CAAC;QACzF,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEvC,MAAM,QAAQ,GAAG,IAAI,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACxE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;QACzE,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YAC1C,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC;QACjC,CAAC;IACH,CAAC;IAEO,qBAAqB,CAAC,SAAmB;QAC/C,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CACb,gFAAgF,CACjF,CAAC;QACJ,CAAC;QACD,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAEO,KAAK,CAAC,cAAc,CAAC,QAAgB,EAAE,KAAa;QAC1D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,yBAAyB,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC1F,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;QAChE,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAEO,aAAa,CAAC,IAAe,EAAE,aAAqB;QAC1D,IAAI,IAAI,CAAC,MAAM,KAAK,aAAa,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CACb,6EAA6E,CAC9E,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;YACtB,IAAI,GAAG,IAAI,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;gBAC3C,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,GAA8B,CAAC,CAAC;gBAC7D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;YAC5C,CAAC;YACD,MAAM,IAAI,KAAK,CAAC,sEAAsE,CAAC,CAAC;QAC1F,CAAC,CAAC,CAAC;IACL,CAAC;CACF"}

package/dist/orm/helpers/query-plan/expr-builder.d.ts

@@ -0,0 +1,155 @@
+/**
+ * IR → Expr conversion.
+ *
+ * The planner-side IR (`src/ir/types.ts`) is the parser's output: arrow
+ * predicates and select bodies turned into a tree of nodes that still
+ * reference user-facing names like the row parameter (`u`, `c`, …) and
+ * relation keys (`u.author`). The runtime Expr model (`src/orm/expr.ts`)
+ * is what the dialect compiles to SQL: every column reference has been
+ * resolved to a (table-alias, column-path) pair, every captured
+ * `QueryBuilder` has been inlined as a child `QueryPlan`, and every
+ * one-to-many `EXISTS` has been pre-resolved to its target table and
+ * join keys.
+ *
+ * `ExprBuilder` performs that conversion. The planner constructs it once
+ * per plan with precomputed context: row-param aliases, relation join
+ * aliases, one-to-many EXISTS metadata, and already-built child subquery
+ * plans. It does not build child plans itself; when conversion reaches a
+ * subquery placeholder, it only swaps in the `QueryPlan` the planner
+ * prepared earlier.
+ */
+import type { IrNode, IrSubqueryRef, IrAggregate } from "../../../ir/types.js";
+import type { Expr, ExprColumn, ExprAggregate } from "../../expr.js";
+import type { OneToManyExistsMeta } from "../relations/relation-joins.js";
+import type { QueryPlan } from "./query-plan.js";
+export type SubqueryPlans = Map<string, QueryPlan>;
+/**
+ * Converts IR nodes to runtime `Expr` against a precomputed alias context.
+ *
+ * Constructor inputs:
+ * - `paramToAlias` — maps every row-param name in scope (including
+ *   outer-correlated ones) to its SQL table alias. Built by the planner's
+ *   `buildParamToAlias` phase.
+ * - `relationPathToAlias` — maps `"<param>.<relKey>"` to the join alias
+ *   the planner allocated for that relation. Drives the column-path
+ *   rewrite in `resolveColumn` (a member access through a joined relation
+ *   becomes a column reference on the join's alias).
+ * - `oneToManyExists` — pre-resolved EXISTS metadata keyed by
+ *   `"<rootParam>.<relationKey>"`. Lets `convertExists` emit a fully
+ *   structured `ExprExists` without redoing the relation lookup.
+ * - `subqueryPlans` — child plans keyed by the runtime param/subquery
+ *   placeholder names that reference captured `QueryBuilder`s.
+ */
+export declare class ExprBuilder {
+    private readonly paramToAlias;
+    private readonly relationPathToAlias;
+    private readonly oneToManyExists;
+    private readonly subqueryPlans;
+    private readonly relationKeys;
+    private readonly cteNames;
+    constructor(paramToAlias: Record<string, string>, relationPathToAlias: Record<string, string>, oneToManyExists: Record<string, OneToManyExistsMeta>, subqueryPlans: SubqueryPlans, relationKeys?: Set<string>, cteNames?: Set<string>);
+    /**
+     * Recursively convert any IR node to an `Expr`.
+     *
+     * `scope` is the row-param-to-table-alias mapping in effect for this
+     * conversion. It defaults to the builder's `paramToAlias` (the top-level
+     * scope of the plan being built). `convertExists` augments and re-passes
+     * it: when an `EXISTS` predicate binds a fresh inner row-param (e.g.
+     * `d.employees.some(e => e.name === "Alice")` binds `e`), the recursive
+     * call uses `{ ...scope, [innerParam]: innerAlias }` so the inner
+     * predicate's `e.name` resolves against the inner-relation table alias
+     * rather than the outer row's.
+     *
+     * Throws on unknown node kinds — the IR types are a closed union, so
+     * hitting the default branch means a future-added kind wasn't handled.
+     */
+    convert(node: IrNode, scope?: Record<string, string>, inlineParams?: Record<string, unknown>): Expr;
+    /**
+     * Resolve `param.path` (an IR member reference) to a (alias, column-path)
+     * pair the dialect can render directly.
+     *
+     * Resolution proceeds in two steps:
+     *
+     * 1. **Alias lookup.** The starting alias is `scope[param]`. The planner
+     *    builds that scope before conversion, including local and correlated
+     *    row params.
+     *
+     * 2. **Relation rewrite.** If `path[0]` names a relation that has been
+     *    joined into the query (`relationPathToAlias` has an entry for
+     *    `"<param>.<path[0]>"`), the alias is replaced with the join's
+     *    alias and the leading segment is dropped from the path. Example:
+     *    `u.author.name` with `relationPathToAlias["u.author"] = "t1"`
+     *    rewrites to `(alias: "t1", column: ["name"])`.
+     *
+     * The returned `ExprColumn.column` is a path array: empty means the
+     * alias itself (rare — only when relation rewrite consumed the entire
+     * path), single element is a leaf column, multiple elements is a
+     * dotted path (rare; preserved for forward compatibility).
+     */
+    resolveColumn(param: string, path: string[], scope?: Record<string, string>): ExprColumn;
+    private assertColumnPath;
+    /**
+     * Convert an `IrAggregate` (e.g. `count(u.id)`, `sum(p.price)`) to an
+     * `ExprAggregate`. The argument expression — when present — is converted
+     * recursively so nested member paths resolve through the same alias
+     * scope. `null` arg means `COUNT(*)` style.
+     *
+     * Public so the planner's `buildSelectItems` can convert select-list
+     * aggregates directly without a wrapping `IrNode` that would otherwise
+     * route through `convert`.
+     */
+    convertAggregate(agg: IrAggregate, scope?: Record<string, string>, inlineParams?: Record<string, unknown>): ExprAggregate;
+    /**
+     * Convert an `IrSubqueryRef` (a transformer-emitted placeholder pointing
+     * at a captured `QueryBuilder` in the param bags) to an `ExprSubquery`
+     * by looking up the child plan the planner already built.
+     * Public so `buildSelectItems` can use it for select-list subqueries
+     * (`Entity.query()....` projected as a column value).
+     */
+    convertSubqueryRef(ref: IrSubqueryRef): Expr;
+    /**
+     * Resolve an `IrParam` (free variable referenced by name from a runtime-
+     * parsed predicate). Captured subqueries are represented as
+     * `IrSubqueryRef`, so params always stay late-bound.
+     */
+    private resolveParamRef;
+    /**
+     * Convert `<expr> IN <rhs>` (or `NOT IN`). The right-hand side has three
+     * legal IR shapes that map to three different `ExprInRhs` shapes:
+     *
+     * - `IrConst` array → `{ kind: "values", values }` — inline literal list,
+     *   compiled to `(?, ?, ?)` placeholders.
+     * - `IrParam` → a late-bound param reference. It expands at execution
+     *   time when the dialect resolves `__param` sentinels.
+     * - `IrSubqueryRef` → a pre-built inline subquery plan.
+     *
+     * Anything else throws — IN's right side is a closed union by spec.
+     */
+    private convertIn;
+    /**
+     * Convert an `IrExists` (a one-to-many `EXISTS (...)` subquery).
+     *
+     * The relation lookup was done up-front by the planner's
+     * `OneToManyExistsBuilder`, which produced `oneToManyExists` keyed by
+     * `"<rootParam>.<relationKey>"`. We just look up the entry and stamp it
+     * onto the runtime `ExprExists`.
+     *
+     * Two scope details worth noting:
+     *
+     * 1. **outerAlias.** This is the alias the EXISTS predicate joins
+     *    against (typically the main table). Resolving via
+     *    `scope[node.rootParam]` is what makes nested EXISTS work: when an
+     *    EXISTS is itself inside another EXISTS' inner predicate, the
+     *    inner-most rootParam is actually the parent EXISTS' bound row,
+     *    and `scope` will have been augmented to map it to the parent's
+     *    inner alias.
+     *
+     * 2. **innerScope.** Augmenting with `[innerParam]: info.alias` is what
+     *    lets the inner predicate's column references (`e.name` in
+     *    `.some(e => e.name === ...)`) resolve to the inner relation's
+     *    table alias rather than the outer row's.
+     */
+    private convertExists;
+    private getSubqueryPlan;
+}
+//# sourceMappingURL=expr-builder.d.ts.map

package/dist/orm/helpers/query-plan/expr-builder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expr-builder.d.ts","sourceRoot":"","sources":["../../../../src/orm/helpers/query-plan/expr-builder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAC/E,OAAO,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AACrE,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,gCAAgC,CAAC;AAC1E,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEjD,MAAM,MAAM,aAAa,GAAG,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;AAEnD;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,WAAW;IAEpB,OAAO,CAAC,QAAQ,CAAC,YAAY;IAC7B,OAAO,CAAC,QAAQ,CAAC,mBAAmB;IACpC,OAAO,CAAC,QAAQ,CAAC,eAAe;IAChC,OAAO,CAAC,QAAQ,CAAC,aAAa;IAC9B,OAAO,CAAC,QAAQ,CAAC,YAAY;IAC7B,OAAO,CAAC,QAAQ,CAAC,QAAQ;gBALR,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EACpC,mBAAmB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAC3C,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,EACpD,aAAa,EAAE,aAAa,EAC5B,YAAY,GAAE,GAAG,CAAC,MAAM,CAAa,EACrC,QAAQ,GAAE,GAAG,CAAC,MAAM,CAAa;IAGpD;;;;;;;;;;;;;;OAcG;IACH,OAAO,CACL,IAAI,EAAE,MAAM,EACZ,KAAK,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAqB,EACjD,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GACrC,IAAI;IAoDP;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,aAAa,CACX,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EAAE,EACd,KAAK,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAqB,GAChD,UAAU;IAiBb,OAAO,CAAC,gBAAgB;IAcxB;;;;;;;;;OASG;IACH,gBAAgB,CACd,GAAG,EAAE,WAAW,EAChB,KAAK,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAqB,EACjD,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GACrC,aAAa;IAWhB;;;;;;OAMG;IACH,kBAAkB,CAAC,GAAG,EAAE,aAAa,GAAG,IAAI;IAI5C;;;;OAIG;IACH,OAAO,CAAC,eAAe;IAmBvB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,SAAS;IA0BjB;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,OAAO,CAAC,aAAa;IAyBrB,OAAO,CAAC,eAAe;CAGxB"}