@quereus/quereus 4.4.0 → 4.5.0

package/dist/src/planner/util/column-origins.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Column origin attribution.
+ *
+ * Maps every output attribute id reachable under a relational subtree back to the
+ * base-table column that minted it. `rule-filter-selectivity` uses this to route
+ * each conjunct of a filter-over-join predicate to the statistics of the table its
+ * columns actually come from, instead of declining the whole filter because its
+ * source spans more than one table.
+ *
+ * ## Identity — not schema — distinguishes the two sides of a self-join
+ *
+ * `ColumnOrigin.ref` is the `TableReferenceNode` instance that produced the
+ * attribute. `from t a join t b` yields two distinct TableReferenceNodes sharing
+ * ONE `TableSchema` object, so a caller asking "how many relations does this
+ * expression touch?" must key on `ref` identity. Keying on `table` collapses the
+ * two sides and mis-classifies `a.age > b.age` as a single-table predicate
+ * comparing a column to a constant.
+ *
+ * ## Attributes minted above a base table are deliberately absent
+ *
+ * Computed projections, aggregate outputs, `values` rows and join existence flags
+ * never appear in the map. A predicate over one of them has no base-table column
+ * statistics to consult, so the caller must treat it as unknown rather than
+ * mis-attribute it by column name.
+ *
+ * ## Row-merging operators are opaque
+ *
+ * A set operation and a recursive CTE both *forward* their left / base-case branch's
+ * attribute ids (see `analysis/attribute-provenance.ts`), but the rows behind those
+ * ids come from every branch. `union all` of a 4-distinct-value column with a
+ * 1000-distinct-value one publishes the left branch's id while carrying both
+ * distributions, so attributing it to the left base table alone would hand the
+ * caller one branch's statistics as if they described the whole relation. The walk
+ * therefore stops at such a node and records nothing beneath it — a conjunct over a
+ * union reads as unknown, exactly like one over a computed projection.
+ */
+import { TableReferenceNode } from '../nodes/reference.js';
+import type { RelationalPlanNode } from '../nodes/plan-node.js';
+import type { TableSchema } from '../../schema/table.js';
+/** Where a single attribute came from: a column of a specific base-table reference. */
+export interface ColumnOrigin {
+    /** The TableReferenceNode that minted this attribute — identity is significant. */
+    readonly ref: TableReferenceNode;
+    readonly table: TableSchema;
+    readonly columnIndex: number;
+    readonly columnName: string;
+}
+/**
+ * Attribute id → originating base-table column, for every base column reachable
+ * under `node` via `getRelations()`.
+ *
+ * The walk descends relations only, so scalar subqueries hanging off a join
+ * condition or a filter predicate are NOT traversed — their columns stay out of
+ * the map and any conjunct referencing them reads as unknown. It also stops at a
+ * row-merging operator (see the file doc-comment).
+ */
+export declare function collectColumnOrigins(node: RelationalPlanNode): Map<number, ColumnOrigin>;
+//# sourceMappingURL=column-origins.d.ts.map

package/dist/src/planner/util/column-origins.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"column-origins.d.ts","sourceRoot":"","sources":["../../../../src/planner/util/column-origins.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAG3D,OAAO,KAAK,EAAY,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAC1E,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAEzD,uFAAuF;AACvF,MAAM,WAAW,YAAY;IAC5B,mFAAmF;IACnF,QAAQ,CAAC,GAAG,EAAE,kBAAkB,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,kBAAkB,GAAG,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAoBxF"}

package/dist/src/planner/util/column-origins.js

@@ -0,0 +1,90 @@
+/**
+ * Column origin attribution.
+ *
+ * Maps every output attribute id reachable under a relational subtree back to the
+ * base-table column that minted it. `rule-filter-selectivity` uses this to route
+ * each conjunct of a filter-over-join predicate to the statistics of the table its
+ * columns actually come from, instead of declining the whole filter because its
+ * source spans more than one table.
+ *
+ * ## Identity — not schema — distinguishes the two sides of a self-join
+ *
+ * `ColumnOrigin.ref` is the `TableReferenceNode` instance that produced the
+ * attribute. `from t a join t b` yields two distinct TableReferenceNodes sharing
+ * ONE `TableSchema` object, so a caller asking "how many relations does this
+ * expression touch?" must key on `ref` identity. Keying on `table` collapses the
+ * two sides and mis-classifies `a.age > b.age` as a single-table predicate
+ * comparing a column to a constant.
+ *
+ * ## Attributes minted above a base table are deliberately absent
+ *
+ * Computed projections, aggregate outputs, `values` rows and join existence flags
+ * never appear in the map. A predicate over one of them has no base-table column
+ * statistics to consult, so the caller must treat it as unknown rather than
+ * mis-attribute it by column name.
+ *
+ * ## Row-merging operators are opaque
+ *
+ * A set operation and a recursive CTE both *forward* their left / base-case branch's
+ * attribute ids (see `analysis/attribute-provenance.ts`), but the rows behind those
+ * ids come from every branch. `union all` of a 4-distinct-value column with a
+ * 1000-distinct-value one publishes the left branch's id while carrying both
+ * distributions, so attributing it to the left base table alone would hand the
+ * caller one branch's statistics as if they described the whole relation. The walk
+ * therefore stops at such a node and records nothing beneath it — a conjunct over a
+ * union reads as unknown, exactly like one over a computed projection.
+ */
+import { TableReferenceNode } from '../nodes/reference.js';
+import { SetOperationNode } from '../nodes/set-operation-node.js';
+import { RecursiveCTENode } from '../nodes/recursive-cte-node.js';
+/**
+ * Attribute id → originating base-table column, for every base column reachable
+ * under `node` via `getRelations()`.
+ *
+ * The walk descends relations only, so scalar subqueries hanging off a join
+ * condition or a filter predicate are NOT traversed — their columns stay out of
+ * the map and any conjunct referencing them reads as unknown. It also stops at a
+ * row-merging operator (see the file doc-comment).
+ */
+export function collectColumnOrigins(node) {
+    const origins = new Map();
+    // Plan trees are DAGs (a CTE instance can be shared), so dedupe by identity.
+    const visited = new Set();
+    const stack = [node];
+    while (stack.length > 0) {
+        const n = stack.pop();
+        if (visited.has(n))
+            continue;
+        visited.add(n);
+        if (n instanceof TableReferenceNode) {
+            addBaseColumns(n, origins);
+            continue;
+        }
+        if (isRowMerging(n))
+            continue;
+        for (const rel of n.getRelations())
+            stack.push(rel);
+    }
+    return origins;
+}
+/**
+ * Does this node publish one branch's attribute ids over rows drawn from several
+ * branches? Such an id describes no single base-table column.
+ */
+function isRowMerging(node) {
+    return node instanceof SetOperationNode || node instanceof RecursiveCTENode;
+}
+/** Zip a table reference's attributes with its schema columns (1:1 by construction). */
+function addBaseColumns(ref, out) {
+    // TableReferenceNode builds its attributes by mapping `tableSchema.columns`
+    // positionally (see reference.ts), so index i describes the same column in both
+    // lists — the same zip `computePhysical` uses to seed update lineage.
+    const attrs = ref.getAttributes();
+    ref.tableSchema.columns.forEach((col, i) => {
+        const attr = attrs[i];
+        if (!attr)
+            return;
+        out.set(attr.id, { ref, table: ref.tableSchema, columnIndex: i, columnName: col.name });
+    });
+}
+//# sourceMappingURL=column-origins.js.map

package/dist/src/planner/util/column-origins.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"column-origins.js","sourceRoot":"","sources":["../../../../src/planner/util/column-origins.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAalE;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAwB;IAC5D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAC;IAChD,6EAA6E;IAC7E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAY,CAAC;IACpC,MAAM,KAAK,GAAyB,CAAC,IAAI,CAAC,CAAC;IAE3C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACvB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC7B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEf,IAAI,CAAC,YAAY,kBAAkB,EAAE,CAAC;YACrC,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC3B,SAAS;QACV,CAAC;QACD,IAAI,YAAY,CAAC,CAAC,CAAC;YAAE,SAAS;QAC9B,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,YAAY,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,IAAwB;IAC7C,OAAO,IAAI,YAAY,gBAAgB,IAAI,IAAI,YAAY,gBAAgB,CAAC;AAC7E,CAAC;AAED,wFAAwF;AACxF,SAAS,cAAc,CAAC,GAAuB,EAAE,GAA8B;IAC9E,4EAA4E;IAC5E,gFAAgF;IAChF,sEAAsE;IACtE,MAAM,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC;IAClC,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,WAAW,EAAE,WAAW,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IACzF,CAAC,CAAC,CAAC;AACJ,CAAC"}

package/dist/src/runtime/deferred-constraint-queue.d.ts

@@ -10,6 +10,15 @@ export interface DeferredConstraintRow {
     connectionId?: string;
     contextRow?: Row;
     contextDescriptor?: RowDescriptor;
+    /**
+     * Lowercase `<schema>.<name>` as this entry's frozen evaluator names a table →
+     * the name that table carries now. Populated by {@link DeferredConstraintQueue.notifyTableRename}
+     * for renames that happen AFTER this entry was queued, and handed to the scan
+     * leaf via `RuntimeContext.tableNameRemap` at evaluation time. Per-entry rather
+     * than queue-wide because a freed name may be reused by a fresh table in the
+     * same transaction — only entries queued before the rename may be redirected.
+     */
+    tableRenames?: Map<string, string>;
 }
 export declare class DeferredConstraintQueue {
     private readonly db;
@@ -17,6 +26,37 @@ export declare class DeferredConstraintQueue {
     private layers;
     constructor(db: Database);
     enqueue(baseTable: string, constraintName: string, row: Row, descriptor: RowDescriptor, evaluator: (ctx: RuntimeContext) => OutputValue, connectionId?: string, contextRow?: Row, contextDescriptor?: RowDescriptor): void;
+    /**
+     * Records an `ALTER TABLE ... RENAME TO` against every entry already queued, so a
+     * check parked before the rename still finds its tables at commit.
+     *
+     * Two halves:
+     *  - every pending entry learns `<schema>.<oldName>` → `newName`, composing across
+     *    repeated renames (`pp → pp2 → pp3` leaves `main.pp` → `pp3`). Composition is
+     *    confined to keys in the renamed table's own schema — map VALUES are bare names,
+     *    so a same-named table in another schema must not follow this rename. An entry
+     *    that already maps `<schema>.<oldName>` is left alone on that key: its emit-time
+     *    table has moved on, and this rename is about whichever table holds the freed
+     *    name now.
+     *  - the bucket keyed by the write-time table name moves with the table, so
+     *    {@link findConnection}'s name fallback keys off the CURRENT name.
+     *
+     * NOTE: stamps every pending entry, including entries below the current savepoint
+     * layer, and `rollbackLayer` does not unstamp them. Correct today because a catalog
+     * rename is not rolled back either — the built-in modules declare the
+     * `'non-transactional'` DDL tier, so `rollback to <savepoint>` (and a whole
+     * `rollback`) leave the rename applied. If transactional DDL ever lands for the
+     * native backends, this remap has to become layer-scoped alongside the catalog.
+     *
+     * NOTE: walks every queued entry per rename, and each entry owns its own map — so a
+     * bulk load that parks a very large number of deferred rows and then renames pays
+     * O(entries) per rename plus one Map per entry. Fine at today's scale (renames inside
+     * a write transaction are rare); if that combination ever shows up hot, share one
+     * copy-on-write rename map across the entries queued between two renames.
+     */
+    notifyTableRename(schemaName: string, oldName: string, newName: string): void;
+    /** Moves the `oldKey` bucket to `newKey`, merging per-constraint row lists into an existing destination. */
+    private rekeyBucket;
     beginLayer(): void;
     rollbackLayer(): void;
     releaseLayer(): void;

package/dist/src/runtime/deferred-constraint-queue.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"deferred-constraint-queue.d.ts","sourceRoot":"","sources":["../../../src/runtime/deferred-constraint-queue.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAY,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACrE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,+BAA+B,CAAC;AACnE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AASpD,MAAM,WAAW,qBAAqB;IACrC,GAAG,EAAE,GAAG,CAAC;IACT,UAAU,EAAE,aAAa,CAAC;IAC1B,SAAS,EAAE,CAAC,GAAG,EAAE,cAAc,KAAK,WAAW,CAAC;IAChD,cAAc,EAAE,MAAM,CAAC;IACvB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,UAAU,CAAC,EAAE,GAAG,CAAC;IACjB,iBAAiB,CAAC,EAAE,aAAa,CAAC;CAClC;AAID,qBAAa,uBAAuB;IAIvB,OAAO,CAAC,QAAQ,CAAC,EAAE;IAH/B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAwC;IAChE,OAAO,CAAC,MAAM,CAAmC;gBAEpB,EAAE,EAAE,QAAQ;IAEzC,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,cAAc,KAAK,WAAW,EAAE,YAAY,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,GAAG,EAAE,iBAAiB,CAAC,EAAE,aAAa,GAAG,IAAI;IAiB1N,UAAU,IAAI,IAAI;IAIlB,aAAa,IAAI,IAAI;IAIrB,YAAY,IAAI,IAAI;IAOpB,KAAK,IAAI,IAAI;IAKP,eAAe,IAAI,OAAO,CAAC,IAAI,CAAC;YAyBxB,aAAa;IAoB3B,OAAO,CAAC,cAAc;IAItB,OAAO,CAAC,UAAU;IAKlB,OAAO,CAAC,QAAQ;IA2BhB,OAAO,CAAC,KAAK;IAYb,OAAO,CAAC,cAAc;CA2BtB"}
+{"version":3,"file":"deferred-constraint-queue.d.ts","sourceRoot":"","sources":["../../../src/runtime/deferred-constraint-queue.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAY,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACrE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,+BAA+B,CAAC;AACnE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AASpD,MAAM,WAAW,qBAAqB;IACrC,GAAG,EAAE,GAAG,CAAC;IACT,UAAU,EAAE,aAAa,CAAC;IAC1B,SAAS,EAAE,CAAC,GAAG,EAAE,cAAc,KAAK,WAAW,CAAC;IAChD,cAAc,EAAE,MAAM,CAAC;IACvB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,UAAU,CAAC,EAAE,GAAG,CAAC;IACjB,iBAAiB,CAAC,EAAE,aAAa,CAAC;IAClC;;;;;;;OAOG;IACH,YAAY,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACnC;AAID,qBAAa,uBAAuB;IAIvB,OAAO,CAAC,QAAQ,CAAC,EAAE;IAH/B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAwC;IAChE,OAAO,CAAC,MAAM,CAAmC;gBAEpB,EAAE,EAAE,QAAQ;IAEzC,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,cAAc,KAAK,WAAW,EAAE,YAAY,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,GAAG,EAAE,iBAAiB,CAAC,EAAE,aAAa,GAAG,IAAI;IAiB1N;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2BG;IACH,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI;IA4B7E,4GAA4G;IAC5G,OAAO,CAAC,WAAW;IAgBnB,UAAU,IAAI,IAAI;IAIlB,aAAa,IAAI,IAAI;IAIrB,YAAY,IAAI,IAAI;IAOpB,KAAK,IAAI,IAAI;IAKP,eAAe,IAAI,OAAO,CAAC,IAAI,CAAC;YA4BxB,aAAa;IA0B3B,OAAO,CAAC,cAAc;IAItB,OAAO,CAAC,UAAU;IAKlB,OAAO,CAAC,QAAQ;IA4BhB,OAAO,CAAC,KAAK;IAYb,OAAO,CAAC,cAAc;CAkCtB"}

package/dist/src/runtime/deferred-constraint-queue.js

@@ -29,6 +29,80 @@ export class DeferredConstraintQueue {
             contextDescriptor
         });
     }
+    /**
+     * Records an `ALTER TABLE ... RENAME TO` against every entry already queued, so a
+     * check parked before the rename still finds its tables at commit.
+     *
+     * Two halves:
+     *  - every pending entry learns `<schema>.<oldName>` → `newName`, composing across
+     *    repeated renames (`pp → pp2 → pp3` leaves `main.pp` → `pp3`). Composition is
+     *    confined to keys in the renamed table's own schema — map VALUES are bare names,
+     *    so a same-named table in another schema must not follow this rename. An entry
+     *    that already maps `<schema>.<oldName>` is left alone on that key: its emit-time
+     *    table has moved on, and this rename is about whichever table holds the freed
+     *    name now.
+     *  - the bucket keyed by the write-time table name moves with the table, so
+     *    {@link findConnection}'s name fallback keys off the CURRENT name.
+     *
+     * NOTE: stamps every pending entry, including entries below the current savepoint
+     * layer, and `rollbackLayer` does not unstamp them. Correct today because a catalog
+     * rename is not rolled back either — the built-in modules declare the
+     * `'non-transactional'` DDL tier, so `rollback to <savepoint>` (and a whole
+     * `rollback`) leave the rename applied. If transactional DDL ever lands for the
+     * native backends, this remap has to become layer-scoped alongside the catalog.
+     *
+     * NOTE: walks every queued entry per rename, and each entry owns its own map — so a
+     * bulk load that parks a very large number of deferred rows and then renames pays
+     * O(entries) per rename plus one Map per entry. Fine at today's scale (renames inside
+     * a write transaction are rare); if that combination ever shows up hot, share one
+     * copy-on-write rename map across the entries queued between two renames.
+     */
+    notifyTableRename(schemaName, oldName, newName) {
+        const oldKey = `${schemaName}.${oldName}`.toLowerCase();
+        const newKey = `${schemaName}.${newName}`.toLowerCase();
+        const oldLower = oldName.toLowerCase();
+        const schemaPrefix = `${schemaName.toLowerCase()}.`;
+        const stampStore = (store) => {
+            for (const constraints of store.values()) {
+                for (const rows of constraints.values()) {
+                    for (const entry of rows) {
+                        const renames = entry.tableRenames ?? new Map();
+                        for (const [key, current] of renames) {
+                            if (key.startsWith(schemaPrefix) && current.toLowerCase() === oldLower) {
+                                renames.set(key, newName);
+                            }
+                        }
+                        if (!renames.has(oldKey))
+                            renames.set(oldKey, newName);
+                        entry.tableRenames = renames;
+                    }
+                }
+            }
+            this.rekeyBucket(store, oldKey, newKey);
+        };
+        stampStore(this.entries);
+        for (const layer of this.layers)
+            stampStore(layer);
+    }
+    /** Moves the `oldKey` bucket to `newKey`, merging per-constraint row lists into an existing destination. */
+    rekeyBucket(store, oldKey, newKey) {
+        if (oldKey === newKey)
+            return;
+        const bucket = store.get(oldKey);
+        if (!bucket)
+            return;
+        store.delete(oldKey);
+        const dest = store.get(newKey);
+        if (!dest) {
+            store.set(newKey, bucket);
+            return;
+        }
+        for (const [constraintName, rows] of bucket) {
+            if (!dest.has(constraintName))
+                dest.set(constraintName, []);
+            dest.get(constraintName).push(...rows);
+        }
+    }
     beginLayer() {
         this.layers.push(new Map());
     }
@@ -65,6 +139,9 @@ export class DeferredConstraintQueue {
                 for (const entry of rows) {
                     const connection = this.findConnection(activeConnections, table, entry.connectionId);
                     runtimeCtx.activeConnection = connection;
+                    // Per entry: the evaluator was frozen at row-write time, so any table it
+                    // names by the pre-rename name resolves through this map in the scan leaf.
+                    runtimeCtx.tableNameRemap = entry.tableRenames;
                     await this.evaluateEntry(runtimeCtx, entry);
                 }
             }
@@ -81,6 +158,12 @@ export class DeferredConstraintQueue {
         try {
             slot.set(evaluationRow);
             const value = await entry.evaluator(runtimeCtx);
+            // NOTE: unreachable from today's two enqueue sites (runtime/emit/constraint-check.ts
+            // and core/derived-row-validator.ts) — both wrap their evaluator so it throws its
+            // own message, attributed identically to the immediate path. This stays as the
+            // safety net for any future caller that queues a raw evaluator; if that never
+            // happens, it can go, and if it does, prefer teaching the caller to self-attribute
+            // over enriching this generic (name-only) message.
             if (value !== null && !isTruthy(value)) {
                 throw new QuereusError(`CHECK constraint failed: ${entry.constraintName}`, StatusCode.CONSTRAINT);
             }
@@ -116,6 +199,7 @@ export class DeferredConstraintQueue {
                         connectionId: entry.connectionId,
                         contextRow: entry.contextRow ? entry.contextRow.slice() : undefined,
                         contextDescriptor: entry.contextDescriptor,
+                        tableRenames: entry.tableRenames,
                     })));
                 }
             }
@@ -146,6 +230,13 @@ export class DeferredConstraintQueue {
             }
             throw new QuereusError(`Deferred constraint execution could not find connectionId=${preferredId} for table ${tableKey}`, StatusCode.INTERNAL);
         }
+        // NOTE: this name fallback is only reached when the enqueue site had no
+        // `activeConnection` to stamp. `tableKey` is the table's CURRENT name, not the
+        // write-time one: `notifyTableRename` moves the bucket whenever an
+        // `ALTER TABLE ... RENAME TO` lands mid-transaction, matching the modules that
+        // re-key their connections on rename (see MemoryTableManager.rekeyRegisteredConnections).
+        // Were the two to drift apart, the entry would evaluate with no active connection and
+        // read committed state instead of the transaction's own writes.
         const normalized = tableKey.toLowerCase();
         const simple = normalized.includes('.') ? normalized.substring(normalized.lastIndexOf('.') + 1) : normalized;
         const matches = connections.filter(conn => {

package/dist/src/runtime/deferred-constraint-queue.js.map

@@ -1 +1 @@
-{"version":3,"file":"deferred-constraint-queue.js","sourceRoot":"","sources":["../../../src/runtime/deferred-constraint-queue.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,EAAE,yBAAyB,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAEtF,OAAO,EAAE,yBAAyB,EAAE,MAAM,yBAAyB,CAAC;AACpE,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAcjD,MAAM,OAAO,uBAAuB;IAIN;IAHZ,OAAO,GAA8B,IAAI,GAAG,EAAE,CAAC;IACxD,MAAM,GAAgC,EAAE,CAAC;IAEjD,YAA6B,EAAY;QAAZ,OAAE,GAAF,EAAE,CAAU;IAAI,CAAC;IAE9C,OAAO,CAAC,SAAiB,EAAE,cAAsB,EAAE,GAAQ,EAAE,UAAyB,EAAE,SAA+C,EAAE,YAAqB,EAAE,UAAgB,EAAE,iBAAiC;QAClN,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;QACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACzD,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QACzC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,cAAc,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;QAC1E,WAAW,CAAC,GAAG,CAAC,cAAc,CAAE,CAAC,IAAI,CAAC;YACrC,GAAG,EAAE,GAAG,CAAC,KAAK,EAAS;YACvB,UAAU;YACV,SAAS;YACT,cAAc;YACd,YAAY;YACZ,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,EAAS,CAAC,CAAC,CAAC,SAAS;YAC9D,iBAAiB;SACjB,CAAC,CAAC;IACJ,CAAC;IAED,UAAU;QACT,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,aAAa;QACZ,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;IACnB,CAAC;IAED,YAAY;QACX,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QAC9B,IAAI,CAAC,GAAG;YAAE,OAAO;QACjB,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;IAClB,CAAC;IAED,KAAK,CAAC,eAAe;QACpB,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE;YAAE,OAAO;QAC/B,MAAM,iBAAiB,GAAG,IAAI,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC;QACtD,MAAM,UAAU,GAAmB;YAClC,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,SAAS;YACf,MAAM,EAAE,EAAE;YACV,OAAO,EAAE,yBAAyB,EAAE;YACpC,aAAa,EAAE,uBAAuB,CAAC,IAAI,GAAG,EAAE,CAAC;YACjD,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,oBAAoB,EAAE;YACtC,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,gBAAgB,CAAC,eAAe,CAAC;SAChE,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,KAAK,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;gBACrC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;oBAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,iBAAiB,EAAE,KAAK,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;oBACrF,UAAU,CAAC,gBAAgB,GAAG,UAAU,CAAC;oBACzC,MAAM,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;gBAC7C,CAAC;YACF,CAAC;QACF,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,aAAa,CAAC,UAA0B,EAAE,KAA4B;QACnF,8DAA8D;QAC9D,MAAM,aAAa,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QACzF,MAAM,oBAAoB,GAAG,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,iBAAiB;YACvE,CAAC,CAAC,yBAAyB,CAAC,KAAK,CAAC,iBAAiB,EAAE,KAAK,CAAC,UAAU,CAAC;YACtE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC;QAGpB,MAAM,IAAI,GAAG,aAAa,CAAC,UAAU,EAAE,oBAAoB,CAAC,CAAC;QAC7D,IAAI,CAAC;YACJ,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YACxB,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,UAAU,CAAa,CAAC;YAC5D,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxC,MAAM,IAAI,YAAY,CAAC,4BAA4B,KAAK,CAAC,cAAc,EAAE,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC;YACnG,CAAC;QACF,CAAC;gBAAS,CAAC;YACV,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,CAAC;IACF,CAAC;IAEO,cAAc;QACrB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;IACpF,CAAC;IAEO,UAAU;QACjB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACvC,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IAClD,CAAC;IAEO,QAAQ;QACf,MAAM,KAAK,GAA8B,IAAI,GAAG,EAAE,CAAC;QACnD,MAAM,MAAM,GAAG,CAAC,MAAiC,EAAE,EAAE;YACpD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;gBACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBAC7D,MAAM,iBAAiB,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;gBACjD,KAAK,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;oBAClD,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,cAAc,CAAC;wBAAE,iBAAiB,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;oBACtF,iBAAiB,CAAC,GAAG,CAAC,cAAc,CAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;wBACjE,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,EAAS;wBAC7B,UAAU,EAAE,KAAK,CAAC,UAAU;wBAC5B,SAAS,EAAE,KAAK,CAAC,SAAS;wBAC1B,cAAc,EAAE,KAAK,CAAC,cAAc;wBACpC,YAAY,EAAE,KAAK,CAAC,YAAY;wBAChC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,EAAS,CAAC,CAAC,CAAC,SAAS;wBAC1E,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;qBAC1C,CAAC,CAAC,CAAC,CAAC;gBACN,CAAC;YACF,CAAC;QACF,CAAC,CAAC;QAEF,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QAC/C,OAAO,KAAK,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,MAAiC,EAAE,MAAiC;QACjF,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE,CAAC;YAC3C,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YACvC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC/D,MAAM,eAAe,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YAChD,KAAK,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;gBAClD,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,cAAc,CAAC;oBAAE,eAAe,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;gBAClF,eAAe,CAAC,GAAG,CAAC,cAAc,CAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;YACpD,CAAC;QACF,CAAC;IACF,CAAC;IAEO,cAAc,CAAC,WAAqC,EAAE,QAAgB,EAAE,WAAoB;QACnG,IAAI,WAAW,EAAE,CAAC;YACjB,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,KAAK,WAAW,CAAC,CAAC;YAC3E,IAAI,MAAM,EAAE,CAAC;gBACZ,OAAO,MAAM,CAAC;YACf,CAAC;YACD,MAAM,IAAI,YAAY,CACrB,6DAA6D,WAAW,cAAc,QAAQ,EAAE,EAChG,UAAU,CAAC,QAAQ,CACnB,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC7G,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC;YAC9C,OAAO,QAAQ,KAAK,UAAU,IAAI,QAAQ,KAAK,MAAM,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YACnD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,IAAI,YAAY,CACrB,gFAAgF,QAAQ,EAAE,EAC1F,UAAU,CAAC,QAAQ,CACnB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;CACD"}
+{"version":3,"file":"deferred-constraint-queue.js","sourceRoot":"","sources":["../../../src/runtime/deferred-constraint-queue.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,EAAE,yBAAyB,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAEtF,OAAO,EAAE,yBAAyB,EAAE,MAAM,yBAAyB,CAAC;AACpE,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAuBjD,MAAM,OAAO,uBAAuB;IAIN;IAHZ,OAAO,GAA8B,IAAI,GAAG,EAAE,CAAC;IACxD,MAAM,GAAgC,EAAE,CAAC;IAEjD,YAA6B,EAAY;QAAZ,OAAE,GAAF,EAAE,CAAU;IAAI,CAAC;IAE9C,OAAO,CAAC,SAAiB,EAAE,cAAsB,EAAE,GAAQ,EAAE,UAAyB,EAAE,SAA+C,EAAE,YAAqB,EAAE,UAAgB,EAAE,iBAAiC;QAClN,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC;QACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACzD,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QACzC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,cAAc,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;QAC1E,WAAW,CAAC,GAAG,CAAC,cAAc,CAAE,CAAC,IAAI,CAAC;YACrC,GAAG,EAAE,GAAG,CAAC,KAAK,EAAS;YACvB,UAAU;YACV,SAAS;YACT,cAAc;YACd,YAAY;YACZ,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,EAAS,CAAC,CAAC,CAAC,SAAS;YAC9D,iBAAiB;SACjB,CAAC,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2BG;IACH,iBAAiB,CAAC,UAAkB,EAAE,OAAe,EAAE,OAAe;QACrE,MAAM,MAAM,GAAG,GAAG,UAAU,IAAI,OAAO,EAAE,CAAC,WAAW,EAAE,CAAC;QACxD,MAAM,MAAM,GAAG,GAAG,UAAU,IAAI,OAAO,EAAE,CAAC,WAAW,EAAE,CAAC;QACxD,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;QACvC,MAAM,YAAY,GAAG,GAAG,UAAU,CAAC,WAAW,EAAE,GAAG,CAAC;QAEpD,MAAM,UAAU,GAAG,CAAC,KAAgC,EAAQ,EAAE;YAC7D,KAAK,MAAM,WAAW,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC1C,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;oBACzC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;wBAC1B,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,IAAI,IAAI,GAAG,EAAkB,CAAC;wBAChE,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,OAAO,EAAE,CAAC;4BACtC,IAAI,GAAG,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,WAAW,EAAE,KAAK,QAAQ,EAAE,CAAC;gCACxE,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;4BAC3B,CAAC;wBACF,CAAC;wBACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;4BAAE,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;wBACvD,KAAK,CAAC,YAAY,GAAG,OAAO,CAAC;oBAC9B,CAAC;gBACF,CAAC;YACF,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACzC,CAAC,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAAE,UAAU,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC;IAED,4GAA4G;IACpG,WAAW,CAAC,KAAgC,EAAE,MAAc,EAAE,MAAc;QACnF,IAAI,MAAM,KAAK,MAAM;YAAE,OAAO;QAC9B,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM;YAAE,OAAO;QACpB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;YACX,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAC1B,OAAO;QACR,CAAC;QACD,KAAK,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC;gBAAE,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;YAC5D,IAAI,CAAC,GAAG,CAAC,cAAc,CAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QACzC,CAAC;IACF,CAAC;IAED,UAAU;QACT,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,aAAa;QACZ,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;IACnB,CAAC;IAED,YAAY;QACX,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QAC9B,IAAI,CAAC,GAAG;YAAE,OAAO;QACjB,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;IAClB,CAAC;IAED,KAAK,CAAC,eAAe;QACpB,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE;YAAE,OAAO;QAC/B,MAAM,iBAAiB,GAAG,IAAI,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC;QACtD,MAAM,UAAU,GAAmB;YAClC,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,SAAS;YACf,MAAM,EAAE,EAAE;YACV,OAAO,EAAE,yBAAyB,EAAE;YACpC,aAAa,EAAE,uBAAuB,CAAC,IAAI,GAAG,EAAE,CAAC;YACjD,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,oBAAoB,EAAE;YACtC,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,gBAAgB,CAAC,eAAe,CAAC;SAChE,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,KAAK,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;gBACrC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;oBAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,iBAAiB,EAAE,KAAK,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;oBACrF,UAAU,CAAC,gBAAgB,GAAG,UAAU,CAAC;oBACzC,yEAAyE;oBACzE,2EAA2E;oBAC3E,UAAU,CAAC,cAAc,GAAG,KAAK,CAAC,YAAY,CAAC;oBAC/C,MAAM,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;gBAC7C,CAAC;YACF,CAAC;QACF,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,aAAa,CAAC,UAA0B,EAAE,KAA4B;QACnF,8DAA8D;QAC9D,MAAM,aAAa,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QACzF,MAAM,oBAAoB,GAAG,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,iBAAiB;YACvE,CAAC,CAAC,yBAAyB,CAAC,KAAK,CAAC,iBAAiB,EAAE,KAAK,CAAC,UAAU,CAAC;YACtE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC;QAGpB,MAAM,IAAI,GAAG,aAAa,CAAC,UAAU,EAAE,oBAAoB,CAAC,CAAC;QAC7D,IAAI,CAAC;YACJ,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YACxB,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,UAAU,CAAa,CAAC;YAC5D,qFAAqF;YACrF,kFAAkF;YAClF,+EAA+E;YAC/E,8EAA8E;YAC9E,mFAAmF;YACnF,mDAAmD;YACnD,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxC,MAAM,IAAI,YAAY,CAAC,4BAA4B,KAAK,CAAC,cAAc,EAAE,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC;YACnG,CAAC;QACF,CAAC;gBAAS,CAAC;YACV,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,CAAC;IACF,CAAC;IAEO,cAAc;QACrB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;IACpF,CAAC;IAEO,UAAU;QACjB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACvC,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IAClD,CAAC;IAEO,QAAQ;QACf,MAAM,KAAK,GAA8B,IAAI,GAAG,EAAE,CAAC;QACnD,MAAM,MAAM,GAAG,CAAC,MAAiC,EAAE,EAAE;YACpD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;gBACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBAC7D,MAAM,iBAAiB,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;gBACjD,KAAK,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;oBAClD,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,cAAc,CAAC;wBAAE,iBAAiB,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;oBACtF,iBAAiB,CAAC,GAAG,CAAC,cAAc,CAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;wBACjE,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,EAAS;wBAC7B,UAAU,EAAE,KAAK,CAAC,UAAU;wBAC5B,SAAS,EAAE,KAAK,CAAC,SAAS;wBAC1B,cAAc,EAAE,KAAK,CAAC,cAAc;wBACpC,YAAY,EAAE,KAAK,CAAC,YAAY;wBAChC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,EAAS,CAAC,CAAC,CAAC,SAAS;wBAC1E,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;wBAC1C,YAAY,EAAE,KAAK,CAAC,YAAY;qBAChC,CAAC,CAAC,CAAC,CAAC;gBACN,CAAC;YACF,CAAC;QACF,CAAC,CAAC;QAEF,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QAC/C,OAAO,KAAK,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,MAAiC,EAAE,MAAiC;QACjF,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE,CAAC;YAC3C,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YACvC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC/D,MAAM,eAAe,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YAChD,KAAK,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;gBAClD,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,cAAc,CAAC;oBAAE,eAAe,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;gBAClF,eAAe,CAAC,GAAG,CAAC,cAAc,CAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;YACpD,CAAC;QACF,CAAC;IACF,CAAC;IAEO,cAAc,CAAC,WAAqC,EAAE,QAAgB,EAAE,WAAoB;QACnG,IAAI,WAAW,EAAE,CAAC;YACjB,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,KAAK,WAAW,CAAC,CAAC;YAC3E,IAAI,MAAM,EAAE,CAAC;gBACZ,OAAO,MAAM,CAAC;YACf,CAAC;YACD,MAAM,IAAI,YAAY,CACrB,6DAA6D,WAAW,cAAc,QAAQ,EAAE,EAChG,UAAU,CAAC,QAAQ,CACnB,CAAC;QACH,CAAC;QACD,wEAAwE;QACxE,+EAA+E;QAC/E,mEAAmE;QACnE,+EAA+E;QAC/E,0FAA0F;QAC1F,sFAAsF;QACtF,gEAAgE;QAChE,MAAM,UAAU,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC7G,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC;YAC9C,OAAO,QAAQ,KAAK,UAAU,IAAI,QAAQ,KAAK,MAAM,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YACnD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,IAAI,YAAY,CACrB,gFAAgF,QAAQ,EAAE,EAC1F,UAAU,CAAC,QAAQ,CACnB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;CACD"}

package/dist/src/runtime/emit/aggregate-setup.d.ts

@@ -0,0 +1,49 @@
+import type { ScalarPlanNode } from '../../planner/nodes/plan-node.js';
+import type { AggregateArgBinding, FunctionSchema } from '../../schema/function.js';
+import { type SqlValue } from '../../common/types.js';
+import type { EmissionContext } from '../emission-context.js';
+/**
+ * Emit-time setup shared by the stream and hash aggregate emitters: both walk the
+ * same `{ expression, alias }` aggregate list and need the same per-aggregate
+ * pre-resolutions. Everything here runs ONCE per emit — never per row.
+ *
+ * {@link argComparisonContext} is shared more widely still: the window emitter
+ * binds its own registry's comparison-sensitive functions from the same context,
+ * so `min(x) over (…)` and the `min(x)` aggregate read the call site identically.
+ */
+/** One entry of a stream/hash aggregate node's `aggregates` list. */
+export type AggregateExpr = {
+    readonly expression: ScalarPlanNode;
+    readonly alias: string;
+};
+/** Compares one aggregate's argument values for DISTINCT tracking (scalar for a
+ *  single argument, element-wise for several, constant for `count(*)`). */
+export type DistinctComparator = (a: SqlValue | SqlValue[], b: SqlValue | SqlValue[]) => number;
+/** The declared logical type and resolved collation of one aggregate or window
+ *  argument at this call site — the comparison context `bindArgs` (aggregate and
+ *  window alike) and DISTINCT tracking all rank under. A missing collation name
+ *  stays undefined, which every consumer reads as BINARY. The logical type is
+ *  always known here (narrower than {@link AggregateArgBinding}, which allows an
+ *  untyped argument), so callers may compare with it directly. */
+export declare function argComparisonContext(arg: ScalarPlanNode, ctx: EmissionContext): Required<Pick<AggregateArgBinding, 'logicalType'>> & AggregateArgBinding;
+/**
+ * Resolve each aggregate's schema and bind it to its call site's argument types and
+ * collations, so a comparison-sensitive aggregate (min/max via
+ * {@link import('../../schema/function.js').AggregateFunctionSchema.bindArgs}) steps
+ * and merges by the argument's semantic order. Nothing in the per-row path then has
+ * to resolve a type or a collation.
+ */
+export declare function bindAggregateSchemas(aggregates: readonly AggregateExpr[], ctx: EmissionContext): {
+    schemas: FunctionSchema[];
+    distinctFlags: boolean[];
+};
+/** Pre-resolved typed comparators for DISTINCT aggregate argument tracking. */
+export declare function buildDistinctComparators(aggregates: readonly AggregateExpr[], ctx: EmissionContext): DistinctComparator[];
+/**
+ * Per-aggregate: may `coerceForAggregate` be skipped for this call site? Skipped when
+ * the aggregate never coerces anyway, when every argument is already numeric, or when
+ * every argument type carries semantic ordering (TIMESPAN/JSON) — the numeric-string
+ * conversion must never run ahead of a type-aware comparator.
+ */
+export declare function computeAggregateSkipCoercion(aggregates: readonly AggregateExpr[]): boolean[];
+//# sourceMappingURL=aggregate-setup.d.ts.map

package/dist/src/runtime/emit/aggregate-setup.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aggregate-setup.d.ts","sourceRoot":"","sources":["../../../../src/runtime/emit/aggregate-setup.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AACvE,OAAO,KAAK,EAAE,mBAAmB,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAKpF,OAAO,EAAc,KAAK,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAElE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAE9D;;;;;;;;GAQG;AAEH,qEAAqE;AACrE,MAAM,MAAM,aAAa,GAAG;IAAE,QAAQ,CAAC,UAAU,EAAE,cAAc,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAE5F;2EAC2E;AAC3E,MAAM,MAAM,kBAAkB,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,CAAC,EAAE,QAAQ,GAAG,QAAQ,EAAE,KAAK,MAAM,CAAC;AAEhG;;;;;kEAKkE;AAClE,wBAAgB,oBAAoB,CACnC,GAAG,EAAE,cAAc,EACnB,GAAG,EAAE,eAAe,GAClB,QAAQ,CAAC,IAAI,CAAC,mBAAmB,EAAE,aAAa,CAAC,CAAC,GAAG,mBAAmB,CAM1E;AAmBD;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CACnC,UAAU,EAAE,SAAS,aAAa,EAAE,EACpC,GAAG,EAAE,eAAe,GAClB;IAAE,OAAO,EAAE,cAAc,EAAE,CAAC;IAAC,aAAa,EAAE,OAAO,EAAE,CAAA;CAAE,CAgBzD;AAED,+EAA+E;AAC/E,wBAAgB,wBAAwB,CACvC,UAAU,EAAE,SAAS,aAAa,EAAE,EACpC,GAAG,EAAE,eAAe,GAClB,kBAAkB,EAAE,CAqBtB;AAED;;;;;GAKG;AACH,wBAAgB,4BAA4B,CAAC,UAAU,EAAE,SAAS,aAAa,EAAE,GAAG,OAAO,EAAE,CAa5F"}

package/dist/src/runtime/emit/aggregate-setup.js

@@ -0,0 +1,99 @@
+import { AggregateFunctionCallNode } from '../../planner/nodes/aggregate-function.js';
+import { isAggregateFunctionSchema } from '../../schema/function.js';
+import { bindAggregateSchema } from '../../func/registration.js';
+import { createTypedComparator, hasSemanticOrdering } from '../../util/comparison.js';
+import { StatusCode } from '../../common/types.js';
+import { quereusError } from '../../common/errors.js';
+/** The declared logical type and resolved collation of one aggregate or window
+ *  argument at this call site — the comparison context `bindArgs` (aggregate and
+ *  window alike) and DISTINCT tracking all rank under. A missing collation name
+ *  stays undefined, which every consumer reads as BINARY. The logical type is
+ *  always known here (narrower than {@link AggregateArgBinding}, which allows an
+ *  untyped argument), so callers may compare with it directly. */
+export function argComparisonContext(arg, ctx) {
+    const argType = arg.getType();
+    return {
+        logicalType: argType.logicalType,
+        collation: argType.collationName ? ctx.resolveCollation(argType.collationName) : undefined,
+    };
+}
+function argComparator(arg, ctx) {
+    const { logicalType, collation } = argComparisonContext(arg, ctx);
+    return createTypedComparator(logicalType, collation);
+}
+/** The aggregate call at `agg`, or an INTERNAL error when the plan holds something else. */
+function requireAggregateCall(agg) {
+    const funcNode = agg.expression;
+    if (!(funcNode instanceof AggregateFunctionCallNode)) {
+        quereusError(`Expected AggregateFunctionCallNode but got ${funcNode.constructor.name}`, StatusCode.INTERNAL);
+    }
+    return funcNode;
+}
+/**
+ * Resolve each aggregate's schema and bind it to its call site's argument types and
+ * collations, so a comparison-sensitive aggregate (min/max via
+ * {@link import('../../schema/function.js').AggregateFunctionSchema.bindArgs}) steps
+ * and merges by the argument's semantic order. Nothing in the per-row path then has
+ * to resolve a type or a collation.
+ */
+export function bindAggregateSchemas(aggregates, ctx) {
+    const schemas = [];
+    const distinctFlags = [];
+    for (const agg of aggregates) {
+        const funcNode = requireAggregateCall(agg);
+        const funcSchema = funcNode.functionSchema;
+        if (!isAggregateFunctionSchema(funcSchema)) {
+            quereusError(`Function ${funcNode.functionName || 'unknown'} is not an aggregate function`, StatusCode.INTERNAL);
+        }
+        schemas.push(bindAggregateSchema(funcSchema, (funcNode.args || []).map(arg => argComparisonContext(arg, ctx))));
+        distinctFlags.push(funcNode.isDistinct);
+    }
+    return { schemas, distinctFlags };
+}
+/** Pre-resolved typed comparators for DISTINCT aggregate argument tracking. */
+export function buildDistinctComparators(aggregates, ctx) {
+    return aggregates.map(agg => {
+        const funcNode = agg.expression;
+        if (!(funcNode instanceof AggregateFunctionCallNode))
+            return () => 0;
+        const args = funcNode.args || [];
+        if (args.length === 1) {
+            const cmp = argComparator(args[0], ctx);
+            return (a, b) => cmp(a, b);
+        }
+        if (args.length === 0)
+            return () => 0; // count(*) — nothing to distinguish
+        const argComparators = args.map(arg => argComparator(arg, ctx));
+        return (a, b) => {
+            const arrA = a;
+            const arrB = b;
+            for (let i = 0; i < argComparators.length; i++) {
+                const cmp = argComparators[i](arrA[i], arrB[i]);
+                if (cmp !== 0)
+                    return cmp;
+            }
+            return 0;
+        };
+    });
+}
+/**
+ * Per-aggregate: may `coerceForAggregate` be skipped for this call site? Skipped when
+ * the aggregate never coerces anyway, when every argument is already numeric, or when
+ * every argument type carries semantic ordering (TIMESPAN/JSON) — the numeric-string
+ * conversion must never run ahead of a type-aware comparator.
+ */
+export function computeAggregateSkipCoercion(aggregates) {
+    return aggregates.map(agg => {
+        const funcNode = agg.expression;
+        if (!(funcNode instanceof AggregateFunctionCallNode))
+            return false;
+        const funcName = (funcNode.functionName || '').toUpperCase();
+        // COUNT, GROUP_CONCAT and JSON_* never coerce their arguments.
+        if (funcName === 'COUNT' || funcName === 'GROUP_CONCAT' || funcName.startsWith('JSON_'))
+            return false;
+        const args = funcNode.args || [];
+        return args.length > 0 && (args.every(arg => arg.getType().logicalType.isNumeric)
+            || args.every(arg => hasSemanticOrdering(arg.getType().logicalType)));
+    });
+}
+//# sourceMappingURL=aggregate-setup.js.map

package/dist/src/runtime/emit/aggregate-setup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aggregate-setup.js","sourceRoot":"","sources":["../../../../src/runtime/emit/aggregate-setup.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,yBAAyB,EAAE,MAAM,2CAA2C,CAAC;AAGtF,OAAO,EAAE,yBAAyB,EAAE,MAAM,0BAA0B,CAAC;AACrE,OAAO,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AACjE,OAAO,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAEtF,OAAO,EAAE,UAAU,EAAiB,MAAM,uBAAuB,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAoBtD;;;;;kEAKkE;AAClE,MAAM,UAAU,oBAAoB,CACnC,GAAmB,EACnB,GAAoB;IAEpB,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC;IAC9B,OAAO;QACN,WAAW,EAAE,OAAO,CAAC,WAA0B;QAC/C,SAAS,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,gBAAgB,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,SAAS;KAC1F,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,GAAmB,EAAE,GAAoB;IAC/D,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,GAAG,oBAAoB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAClE,OAAO,qBAAqB,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;AACtD,CAAC;AAED,4FAA4F;AAC5F,SAAS,oBAAoB,CAAC,GAAkB;IAC/C,MAAM,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC;IAChC,IAAI,CAAC,CAAC,QAAQ,YAAY,yBAAyB,CAAC,EAAE,CAAC;QACtD,YAAY,CACX,8CAA8C,QAAQ,CAAC,WAAW,CAAC,IAAI,EAAE,EACzE,UAAU,CAAC,QAAQ,CACnB,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CACnC,UAAoC,EACpC,GAAoB;IAEpB,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,MAAM,aAAa,GAAc,EAAE,CAAC;IACpC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,CAAC;QAC3C,IAAI,CAAC,yBAAyB,CAAC,UAAU,CAAC,EAAE,CAAC;YAC5C,YAAY,CACX,YAAY,QAAQ,CAAC,YAAY,IAAI,SAAS,+BAA+B,EAC7E,UAAU,CAAC,QAAQ,CACnB,CAAC;QACH,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,oBAAoB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChH,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC;AACnC,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,wBAAwB,CACvC,UAAoC,EACpC,GAAoB;IAEpB,OAAO,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;QAC3B,MAAM,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC;QAChC,IAAI,CAAC,CAAC,QAAQ,YAAY,yBAAyB,CAAC;YAAE,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC;QACrE,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACxC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAa,EAAE,CAAa,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,oCAAoC;QAC3E,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAChE,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACf,MAAM,IAAI,GAAG,CAAe,CAAC;YAC7B,MAAM,IAAI,GAAG,CAAe,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChD,MAAM,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChD,IAAI,GAAG,KAAK,CAAC;oBAAE,OAAO,GAAG,CAAC;YAC3B,CAAC;YACD,OAAO,CAAC,CAAC;QACV,CAAC,CAAC;IACH,CAAC,CAAC,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,4BAA4B,CAAC,UAAoC;IAChF,OAAO,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;QAC3B,MAAM,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC;QAChC,IAAI,CAAC,CAAC,QAAQ,YAAY,yBAAyB,CAAC;YAAE,OAAO,KAAK,CAAC;QACnE,MAAM,QAAQ,GAAG,CAAC,QAAQ,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QAC7D,+DAA+D;QAC/D,IAAI,QAAQ,KAAK,OAAO,IAAI,QAAQ,KAAK,cAAc,IAAI,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC;YAAE,OAAO,KAAK,CAAC;QACtG,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC;QACjC,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC;eACnD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,WAA0B,CAAC,CAAC,CACnF,CAAC;IACH,CAAC,CAAC,CAAC;AACJ,CAAC"}

package/dist/src/runtime/emit/aggregate.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"aggregate.d.ts","sourceRoot":"","sources":["../../../../src/runtime/emit/aggregate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,yCAAyC,CAAC;AACnF,OAAO,KAAK,EAAE,WAAW,EAAkB,MAAM,aAAa,CAAC;AAI/D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAI9D,OAAO,KAAK,EAAE,QAAQ,EAAiB,MAAM,kCAAkC,CAAC;AAWhF,OAAO,EAAY,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAGzE,eAAO,MAAM,MAAM,0BAAkC,CAAC;AAMtD,OAAO,EAAE,iBAAiB,EAAE,CAAC;AAE7B;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAgB3D;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,mBAAmB,EAAE,GAAG,EAAE,eAAe,GAAG,WAAW,CAwhBhG"}
+{"version":3,"file":"aggregate.d.ts","sourceRoot":"","sources":["../../../../src/runtime/emit/aggregate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,yCAAyC,CAAC;AACnF,OAAO,KAAK,EAAE,WAAW,EAAkB,MAAM,aAAa,CAAC;AAI/D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAG9D,OAAO,KAAK,EAAE,QAAQ,EAAiB,MAAM,kCAAkC,CAAC;AAYhF,OAAO,EAAY,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAGzE,eAAO,MAAM,MAAM,0BAAkC,CAAC;AAMtD,OAAO,EAAE,iBAAiB,EAAE,CAAC;AAE7B;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAgB3D;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,mBAAmB,EAAE,GAAG,EAAE,eAAe,GAAG,WAAW,CAmdhG"}