@quereus/quereus 3.2.1 → 4.0.0

package/dist/src/planner/nodes/set-operation-node.d.ts

@@ -3,20 +3,142 @@ import type { RelationalPlanNode, Attribute, BinaryRelationalNode, PhysicalPrope
 import type { RelationType } from '../../common/datatype.js';
 import { PlanNodeType } from './plan-node-type.js';
 import type { Scope } from '../scopes/scope.js';
+/**
+ * One `<setop> exists <branch> as <name>` membership-flag column the
+ * `SetOperationNode` appends after the data columns. The vertical (row) analogue
+ * of the join's `ExistenceColumnSpec`: a clean `{true,false}` NOT NULL boolean
+ * **derived at the combinator** by a per-branch semijoin probe (`tuple ∈ branch`),
+ * never a stored operand column (which would re-enter the union schema and dedup).
+ * The `attrId` is minted once at build time (so it is stable across `withChildren`
+ * rebuilds); `branch` is the immediate operand whose membership the flag reifies.
+ */
+export interface SetOpMembershipSpec {
+    readonly attrId: number;
+    readonly name: string;
+    readonly branch: 'left' | 'right';
+}
 export declare class SetOperationNode extends PlanNode implements BinaryRelationalNode {
     readonly left: RelationalPlanNode;
     readonly right: RelationalPlanNode;
     readonly op: 'union' | 'unionAll' | 'intersect' | 'except';
+    /**
+     * Membership-flag columns appended after the data columns (read half:
+     * `set-op-membership-read`). Empty/undefined for an ordinary set operation.
+     */
+    readonly membership?: readonly SetOpMembershipSpec[] | undefined;
     readonly nodeType = PlanNodeType.SetOperation;
     private attributesCache;
-    constructor(scope: Scope, left: RelationalPlanNode, right: RelationalPlanNode, op: 'union' | 'unionAll' | 'intersect' | 'except');
+    /**
+     * Per-data-column collation resolved across BOTH inputs through the shared
+     * comparison lattice (`set-operation-cross-input-collation-merge`). Cached so
+     * `buildAttributes` and `getType` read ONE result and cannot drift — the dedup
+     * comparator (which keys off the output attribute collation) and an enclosing
+     * ORDER BY (which keys off the output column collation) thus stay in lockstep.
+     */
+    private dataCollationsCache;
+    constructor(scope: Scope, left: RelationalPlanNode, right: RelationalPlanNode, op: 'union' | 'unionAll' | 'intersect' | 'except', 
+    /**
+     * Membership-flag columns appended after the data columns (read half:
+     * `set-op-membership-read`). Empty/undefined for an ordinary set operation.
+     */
+    membership?: readonly SetOpMembershipSpec[] | undefined);
+    /**
+     * Resolve each DATA column's dedup/compare collation across both inputs through
+     * the shared comparison lattice (`resolveSetOpColumnCollation`). The conflict
+     * policy is keyed on set-ness:
+     *  - DISTINCT operators (`union`/`intersect`/`except`, `op !== 'unionAll'`) DO
+     *    dedup, so a same-rank explicit/declared name conflict is a plan-time error
+     *    — the same one a spelled-out `l.c = r.c` would throw. Forced at build time
+     *    by `createSetOperationScope` (and, for DIFF, by the outer union forcing the
+     *    nested except nodes transitively).
+     *  - `union all` does NO dedup, so a conflict must NOT throw — it propagates no
+     *    collation forward (BINARY-equivalent), exactly as `mergePropagatedCollation`
+     *    swallows conflicts for `||` / CASE. Rows pass through unchanged (bag).
+     * Only the first `dataColumnCount()` columns are resolved; flag columns (appended
+     * after, `EXISTENCE_FLAG_TYPE`, no collation) are never touched.
+     */
+    private resolveDataCollations;
+    /**
+     * Data column `i`'s `ScalarType` rebased onto the cross-input-resolved collation:
+     * the left operand's type stays the base (logicalType, nullable, affinity —
+     * cross-branch type merge stays out of scope) and ONLY `collationName`/
+     * `collationSource` are overridden (both possibly `undefined` for the BINARY
+     * floor). Callers map this over the first `dataColumnCount()` attrs/columns,
+     * preserving attribute ids (only the type's collation changes) so ORDER BY / an
+     * enclosing view still resolve and a `withChildren` rebuild yields the same ids.
+     */
+    private resolvedDataType;
+    /** True when this set operation exposes its OWN membership flags. */
+    get hasMembershipColumns(): boolean;
+    /**
+     * True when this node surfaces ANY flag column — its own membership flags OR an
+     * operand's surfaced flags (a flag-less outer over a flagged operand still surfaces
+     * the inner flags). The runtime read half selects the buffering surfacing runner on
+     * this, not on `hasMembershipColumns` alone.
+     */
+    get hasSurfacedFlags(): boolean;
+    /**
+     * Number of DATA (non-flag) columns — recursively the left-most non-set-op leaf's
+     * column count (flags are always appended after data, at every depth). Public: the
+     * runtime emitter and the write half both need it.
+     */
+    dataColumnCount(): number;
+    /** Count of the LEFT operand's surfaced flag columns (0 for a plain / flag-less operand). */
+    private get leftFlagCount();
+    /** Count of the RIGHT operand's surfaced flag columns (0 for a plain / flag-less operand). */
+    private get rightFlagCount();
+    /**
+     * Output index where this node's OWN membership flags begin, after the data columns
+     * and BOTH operands' surfaced flag columns:
+     * `[data] ++ [L flags] ++ [R flags] ++ [own flags]`.
+     */
+    private get ownFlagBase();
+    /**
+     * Output attributes under the defined projection rule
+     * `[data] ++ [L flags] ++ [R flags] ++ [own flags]`:
+     *  - data: the first `dataColumnCount` attrs taken verbatim from the left child
+     *    (preserves data attribute ids so an ORDER BY / enclosing view still resolves);
+     *  - L / R flags: each operand's attrs BEYOND its own data arity (their inner spec
+     *    ids ride through verbatim, so a surfaced inner flag keeps the inner node's id);
+     *  - own flags: the appended `{true,false}` NOT NULL booleans with pre-minted ids.
+     */
     private buildAttributes;
     getAttributes(): readonly Attribute[];
     getType(): RelationType;
     getChildren(): readonly PlanNode[];
     getRelations(): readonly [RelationalPlanNode, RelationalPlanNode];
     computePhysical(_childrenPhysical: PhysicalProperties[]): Partial<PhysicalProperties>;
+    /**
+     * `key → flag` forward FDs (Invariant 1). A DISTINCT set operation (`isSet`) is
+     * keyed on its all-columns combination, so the data columns functionally determine
+     * each flag (the flag is `tuple ∈ branch`, a function of the data tuple). A bag
+     * (`union all`) has no data-column key, so it makes NO `key → flag` claim.
+     */
+    private membershipFds;
+    /** `{true,false}` enum domain per OWN appended flag (at its shifted index). */
+    private membershipDomains;
+    /**
+     * Constant-fold the trivially-determined flags (Invariant 2). For `except`
+     * (`A except B`) every visible row is in the left and not the right, so a
+     * `left` flag is constant-true and a `right` flag constant-false. For
+     * `intersect` every visible row is in every branch, so all flags are
+     * constant-true. `union` / `union all` fold nothing.
+     */
+    private membershipConstantBindings;
+    /**
+     * One read-only `existence` `UpdateSite` per membership flag, naming the owning
+     * `SetOperationNode` and the immediate operand the flag reifies. Read-only here
+     * (`resolveBaseSite` resolves a `set-op-branch` component non-writable in this
+     * half); the write half routes a membership-flip to that branch's sub-plan.
+     *
+     * The `guard` is the branch's accumulated selection predicate. In this read half
+     * it is **carried, not consumed** (the write half computes the real conjunction of
+     * σ predicates down to the branch's base for predicate-honest leaf addressing), so
+     * a `true` literal placeholder is sufficient and honest about the read-half scope.
+     */
+    private membershipLineage;
     withChildren(newChildren: readonly PlanNode[]): PlanNode;
     toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
 }
 //# sourceMappingURL=set-operation-node.d.ts.map

package/dist/src/planner/nodes/set-operation-node.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"set-operation-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/set-operation-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAoB,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,KAAK,EAAE,kBAAkB,EAAE,SAAS,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAC9G,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAKhD,qBAAa,gBAAiB,SAAQ,QAAS,YAAW,oBAAoB;aAM1D,IAAI,EAAE,kBAAkB;aACxB,KAAK,EAAE,kBAAkB;aACzB,EAAE,EAAE,OAAO,GAAG,UAAU,GAAG,WAAW,GAAG,QAAQ;IAPnE,QAAQ,CAAC,QAAQ,6BAA6B;IAC9C,OAAO,CAAC,eAAe,CAA+B;gBAGpD,KAAK,EAAE,KAAK,EACI,IAAI,EAAE,kBAAkB,EACxB,KAAK,EAAE,kBAAkB,EACzB,EAAE,EAAE,OAAO,GAAG,UAAU,GAAG,WAAW,GAAG,QAAQ;IAanE,OAAO,CAAC,eAAe;IAOvB,aAAa,IAAI,SAAS,SAAS,EAAE;IAIrC,OAAO,IAAI,YAAY;IAKvB,WAAW,IAAI,SAAS,QAAQ,EAAE;IAIlC,YAAY,IAAI,SAAS,CAAC,kBAAkB,EAAE,kBAAkB,CAAC;IAIjE,eAAe,CAAC,iBAAiB,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAyBrF,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IA6B/C,QAAQ,IAAI,MAAM;CAG5B"}
+{"version":3,"file":"set-operation-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/set-operation-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAoB,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,KAAK,EAAE,kBAAkB,EAAE,SAAS,EAAE,oBAAoB,EAAE,kBAAkB,EAAuE,MAAM,gBAAgB,CAAC;AACnL,OAAO,KAAK,EAAE,YAAY,EAA0C,MAAM,0BAA0B,CAAC;AAErG,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAchD;;;;;;;;GAQG;AACH,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC;CACnC;AAqBD,qBAAa,gBAAiB,SAAQ,QAAS,YAAW,oBAAoB;aAc1D,IAAI,EAAE,kBAAkB;aACxB,KAAK,EAAE,kBAAkB;aACzB,EAAE,EAAE,OAAO,GAAG,UAAU,GAAG,WAAW,GAAG,QAAQ;IACjE;;;OAGG;aACa,UAAU,CAAC,EAAE,SAAS,mBAAmB,EAAE;IApB7D,QAAQ,CAAC,QAAQ,6BAA6B;IAC9C,OAAO,CAAC,eAAe,CAA+B;IACtD;;;;;;OAMG;IACH,OAAO,CAAC,mBAAmB,CAA2C;gBAGpE,KAAK,EAAE,KAAK,EACI,IAAI,EAAE,kBAAkB,EACxB,KAAK,EAAE,kBAAkB,EACzB,EAAE,EAAE,OAAO,GAAG,UAAU,GAAG,WAAW,GAAG,QAAQ;IACjE;;;OAGG;IACa,UAAU,CAAC,EAAE,SAAS,mBAAmB,EAAE,YAAA;IAmB7D;;;;;;;;;;;;;;OAcG;IACH,OAAO,CAAC,qBAAqB;IAkB7B;;;;;;;;OAQG;IACH,OAAO,CAAC,gBAAgB;IAKxB,qEAAqE;IACrE,IAAI,oBAAoB,IAAI,OAAO,CAElC;IAED;;;;;OAKG;IACH,IAAI,gBAAgB,IAAI,OAAO,CAE9B;IAED;;;;OAIG;IACH,eAAe,IAAI,MAAM;IAIzB,6FAA6F;IAC7F,OAAO,KAAK,aAAa,GAExB;IAED,8FAA8F;IAC9F,OAAO,KAAK,cAAc,GAEzB;IAED;;;;OAIG;IACH,OAAO,KAAK,WAAW,GAEtB;IAED;;;;;;;;OAQG;IACH,OAAO,CAAC,eAAe;IAoBvB,aAAa,IAAI,SAAS,SAAS,EAAE;IAIrC,OAAO,IAAI,YAAY;IAoCvB,WAAW,IAAI,SAAS,QAAQ,EAAE;IAIlC,YAAY,IAAI,SAAS,CAAC,kBAAkB,EAAE,kBAAkB,CAAC;IAIjE,eAAe,CAAC,iBAAiB,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,kBAAkB,CAAC;IA6CrF;;;;;OAKG;IACH,OAAO,CAAC,aAAa;IAarB,+EAA+E;IAC/E,OAAO,CAAC,iBAAiB;IASzB;;;;;;OAMG;IACH,OAAO,CAAC,0BAA0B;IAgBlC;;;;;;;;;;OAUG;IACH,OAAO,CAAC,iBAAiB;IAczB,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAgC/C,QAAQ,IAAI,MAAM;IAIlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAOzD"}

package/dist/src/planner/nodes/set-operation-node.js

@@ -3,38 +3,217 @@ import { PlanNodeType } from './plan-node-type.js';
 import { Cached } from '../../util/cached.js';
 import { quereusError, QuereusError } from '../../common/errors.js';
 import { StatusCode } from '../../common/types.js';
+import { EXISTENCE_FLAG_TYPE } from './join-utils.js';
+import { superkeyToFd } from '../util/fd-utils.js';
+import { resolveSetOpColumnCollation, collationConflictError } from '../analysis/comparison-collation.js';
+/**
+ * Recursive DATA (non-flag) arity of a set-operation operand. Flags are always
+ * appended after the data columns at every depth, so a `SetOperationNode`'s data
+ * arity is its left operand's data arity — bottoming out at the left-most non-set-op
+ * leaf. A plain operand's data arity is simply its column count.
+ */
+function dataArity(node) {
+    return node instanceof SetOperationNode ? node.dataColumnCount() : node.getType().columns.length;
+}
+/**
+ * Count of an operand's surfaced flag columns — everything beyond its data arity.
+ * Zero for an unflagged leaf or a flag-less set-op; the recursive total of surfaced
+ * flags for a (possibly nested) flagged set-op operand.
+ */
+function flagCount(node) {
+    return node.getType().columns.length - dataArity(node);
+}
 export class SetOperationNode extends PlanNode {
     left;
     right;
     op;
+    membership;
     nodeType = PlanNodeType.SetOperation;
     attributesCache;
-    constructor(scope, left, right, op) {
+    /**
+     * Per-data-column collation resolved across BOTH inputs through the shared
+     * comparison lattice (`set-operation-cross-input-collation-merge`). Cached so
+     * `buildAttributes` and `getType` read ONE result and cannot drift — the dedup
+     * comparator (which keys off the output attribute collation) and an enclosing
+     * ORDER BY (which keys off the output column collation) thus stay in lockstep.
+     */
+    dataCollationsCache;
+    constructor(scope, left, right, op, 
+    /**
+     * Membership-flag columns appended after the data columns (read half:
+     * `set-op-membership-read`). Empty/undefined for an ordinary set operation.
+     */
+    membership) {
         super(scope, left.getTotalCost() + right.getTotalCost());
         this.left = left;
         this.right = right;
         this.op = op;
-        // Validate column counts
-        const leftCols = left.getType().columns;
-        const rightCols = right.getType().columns;
-        if (leftCols.length !== rightCols.length) {
-            throw new QuereusError(`SET operation column count mismatch: left has ${leftCols.length}, right has ${rightCols.length}`, StatusCode.ERROR);
+        this.membership = membership;
+        // Validate DATA column counts only. Alignment / the union schema / dedup / set
+        // identity are all on data columns (model (b), `nestable-flagged-set-ops`): an
+        // operand may itself be a (flagged) `SetOperationNode` whose flag columns inflate
+        // its total arity but NOT its data arity, so comparing totals would spuriously
+        // reject `A union[…] (B union[…] C)`. `dataArity` recurses to the left-most
+        // non-set-op leaf, so an inner operand's surfaced flags never enter the check.
+        const leftData = dataArity(left);
+        const rightData = dataArity(right);
+        if (leftData !== rightData) {
+            throw new QuereusError(`SET operation column count mismatch: left has ${leftData}, right has ${rightData}`, StatusCode.ERROR);
         }
         // TODO: optionally check type compatibility (affinity)
         this.attributesCache = new Cached(() => this.buildAttributes());
+        this.dataCollationsCache = new Cached(() => this.resolveDataCollations());
+    }
+    /**
+     * Resolve each DATA column's dedup/compare collation across both inputs through
+     * the shared comparison lattice (`resolveSetOpColumnCollation`). The conflict
+     * policy is keyed on set-ness:
+     *  - DISTINCT operators (`union`/`intersect`/`except`, `op !== 'unionAll'`) DO
+     *    dedup, so a same-rank explicit/declared name conflict is a plan-time error
+     *    — the same one a spelled-out `l.c = r.c` would throw. Forced at build time
+     *    by `createSetOperationScope` (and, for DIFF, by the outer union forcing the
+     *    nested except nodes transitively).
+     *  - `union all` does NO dedup, so a conflict must NOT throw — it propagates no
+     *    collation forward (BINARY-equivalent), exactly as `mergePropagatedCollation`
+     *    swallows conflicts for `||` / CASE. Rows pass through unchanged (bag).
+     * Only the first `dataColumnCount()` columns are resolved; flag columns (appended
+     * after, `EXISTENCE_FLAG_TYPE`, no collation) are never touched.
+     */
+    resolveDataCollations() {
+        const isSet = this.op !== 'unionAll';
+        const leftColumns = this.left.getType().columns;
+        const rightColumns = this.right.getType().columns;
+        const dataCount = this.dataColumnCount();
+        const resolved = [];
+        for (let i = 0; i < dataCount; i++) {
+            const res = resolveSetOpColumnCollation(leftColumns[i].type, rightColumns[i].type);
+            if (res.kind === 'conflict') {
+                if (isSet)
+                    throw collationConflictError(res);
+                resolved.push({}); // union all: no comparison, carry no collation forward
+            }
+            else {
+                resolved.push({ collationName: res.collationName, collationSource: res.collationSource });
+            }
+        }
+        return resolved;
+    }
+    /**
+     * Data column `i`'s `ScalarType` rebased onto the cross-input-resolved collation:
+     * the left operand's type stays the base (logicalType, nullable, affinity —
+     * cross-branch type merge stays out of scope) and ONLY `collationName`/
+     * `collationSource` are overridden (both possibly `undefined` for the BINARY
+     * floor). Callers map this over the first `dataColumnCount()` attrs/columns,
+     * preserving attribute ids (only the type's collation changes) so ORDER BY / an
+     * enclosing view still resolve and a `withChildren` rebuild yields the same ids.
+     */
+    resolvedDataType(baseType, i) {
+        const c = this.dataCollationsCache.value[i];
+        return { ...baseType, collationName: c.collationName, collationSource: c.collationSource };
+    }
+    /** True when this set operation exposes its OWN membership flags. */
+    get hasMembershipColumns() {
+        return !!this.membership && this.membership.length > 0;
+    }
+    /**
+     * True when this node surfaces ANY flag column — its own membership flags OR an
+     * operand's surfaced flags (a flag-less outer over a flagged operand still surfaces
+     * the inner flags). The runtime read half selects the buffering surfacing runner on
+     * this, not on `hasMembershipColumns` alone.
+     */
+    get hasSurfacedFlags() {
+        return this.hasMembershipColumns || this.leftFlagCount > 0 || this.rightFlagCount > 0;
+    }
+    /**
+     * Number of DATA (non-flag) columns — recursively the left-most non-set-op leaf's
+     * column count (flags are always appended after data, at every depth). Public: the
+     * runtime emitter and the write half both need it.
+     */
+    dataColumnCount() {
+        return dataArity(this.left);
+    }
+    /** Count of the LEFT operand's surfaced flag columns (0 for a plain / flag-less operand). */
+    get leftFlagCount() {
+        return flagCount(this.left);
+    }
+    /** Count of the RIGHT operand's surfaced flag columns (0 for a plain / flag-less operand). */
+    get rightFlagCount() {
+        return flagCount(this.right);
     }
+    /**
+     * Output index where this node's OWN membership flags begin, after the data columns
+     * and BOTH operands' surfaced flag columns:
+     * `[data] ++ [L flags] ++ [R flags] ++ [own flags]`.
+     */
+    get ownFlagBase() {
+        return this.dataColumnCount() + this.leftFlagCount + this.rightFlagCount;
+    }
+    /**
+     * Output attributes under the defined projection rule
+     * `[data] ++ [L flags] ++ [R flags] ++ [own flags]`:
+     *  - data: the first `dataColumnCount` attrs taken verbatim from the left child
+     *    (preserves data attribute ids so an ORDER BY / enclosing view still resolves);
+     *  - L / R flags: each operand's attrs BEYOND its own data arity (their inner spec
+     *    ids ride through verbatim, so a surfaced inner flag keeps the inner node's id);
+     *  - own flags: the appended `{true,false}` NOT NULL booleans with pre-minted ids.
+     */
     buildAttributes() {
         const leftAttrs = this.left.getAttributes();
-        // Preserve left child's attributes directly to avoid any mapping issues
-        // This ensures ORDER BY expressions can resolve to the same attribute IDs
-        return leftAttrs;
+        const dataCount = this.dataColumnCount();
+        // Data attrs carry the cross-input-resolved collation (ids preserved); the dedup
+        // comparator and any enclosing ORDER BY both read collation from here.
+        const dataAttrs = leftAttrs.slice(0, dataCount).map((attr, i) => ({ ...attr, type: this.resolvedDataType(attr.type, i) }));
+        // No flag anywhere → the result IS the (collation-resolved) data attributes;
+        // ids unchanged so ORDER BY expressions resolve to the same ids.
+        if (!this.hasSurfacedFlags)
+            return dataAttrs;
+        // `leftAttrs` is `[data] ++ [L flags]`: keep the L-flag slice verbatim. Append the
+        // right operand's surfaced flags (beyond the shared data arity) and own flags.
+        const ownFlagAttrs = (this.membership ?? []).map(spec => ({ id: spec.attrId, name: spec.name, type: EXISTENCE_FLAG_TYPE }));
+        return [
+            ...dataAttrs,
+            ...leftAttrs.slice(dataCount),
+            ...this.right.getAttributes().slice(dataCount),
+            ...ownFlagAttrs,
+        ];
     }
     getAttributes() {
         return this.attributesCache.value;
     }
     getType() {
         const leftType = this.left.getType();
-        return { ...leftType, isSet: this.op !== 'unionAll' };
+        const isSet = this.op !== 'unionAll';
+        // Key survival across set operations:
+        //  - intersect / except: the result is a subset of the left rows, so every
+        //    left key still holds on the result.
+        //  - union / unionAll: the right side can reintroduce a value the left key
+        //    made unique (and UNION ALL duplicates rows outright), so left keys do
+        //    NOT survive. Set-ness of UNION/INTERSECT/EXCEPT is carried by `isSet`
+        //    (the all-columns key) instead — copying `leftType.keys` here would
+        //    over-claim (e.g. `select a,… from ta union select d,… from tb` has a
+        //    non-unique first column).
+        //  - Surfaced flags (own AND inner) are appended AFTER the data columns, so the key
+        //    ColRefs (which index data columns) stay valid and a flag is NEVER part of a key
+        //    at any depth (Key-Soundness Inv. 1–2).
+        const keys = (this.op === 'intersect' || this.op === 'except') ? leftType.keys : [];
+        // Data ColumnDefs carry the cross-input-resolved collation (same cached array the
+        // output attrs use, so type.collationName and attr.type.collationName cannot drift).
+        const dataCount = this.dataColumnCount();
+        const dataColumns = leftType.columns.slice(0, dataCount).map((col, i) => ({ ...col, type: this.resolvedDataType(col.type, i) }));
+        if (!this.hasSurfacedFlags) {
+            return { ...leftType, isSet, keys, columns: dataColumns };
+        }
+        // Mirror buildAttributes' `[data] ++ [L flags] ++ [R flags] ++ [own flags]` layout.
+        // `leftType.columns` is `[data] ++ [L flags]`: keep the L-flag slice verbatim; append
+        // the right operand's surfaced flag ColumnDefs (beyond the shared data arity) and own flags.
+        const ownFlagColumns = (this.membership ?? []).map(spec => ({ name: spec.name, type: EXISTENCE_FLAG_TYPE }));
+        const columns = [
+            ...dataColumns,
+            ...leftType.columns.slice(dataCount),
+            ...this.right.getType().columns.slice(dataCount),
+            ...ownFlagColumns,
+        ];
+        return { ...leftType, isSet, keys, columns };
     }
     getChildren() {
         return [this.left, this.right];
@@ -48,7 +227,10 @@ export class SetOperationNode extends PlanNode {
         // MonotonicOn(X); see ticket 1-monotonic-on-characteristic for the deferred
         // range-bound reasoning.
         //
-        // FDs / ECs / constantBindings are dropped conservatively here:
+        // FDs / ECs / constantBindings over the DATA columns are dropped conservatively
+        // here (see prior analysis below). The membership flags add their own forward
+        // surface — `key → flag`, the `{true,false}` domain, and the read-only existence
+        // `UpdateSite` — without touching the data columns' identity.
         //   - UNION ALL / EXCEPT ALL: no row-level FDs can be assumed.
         //   - UNION / INTERSECT: the all-columns FD is already captured by the
         //     `isSet` flag and downstream Distinct-style uniqueness; we do not
@@ -56,16 +238,109 @@ export class SetOperationNode extends PlanNode {
         //   - Constant bindings cannot survive: even if both sides bound `c = 5`,
         //     a row from the other side may have a different value (UNION of
         //     differing constants is no longer constant).
+        if (!this.hasMembershipColumns) {
+            return {
+                monotonicOn: undefined,
+                fds: undefined,
+                equivClasses: undefined,
+                constantBindings: undefined,
+                // Domains can't be assumed across set operations either: a UNION of
+                // [a in (1,2)] with [a in (3)] would land outside both source domains.
+                domainConstraints: undefined,
+            };
+        }
         return {
             monotonicOn: undefined,
-            fds: undefined,
+            // Invariant 1: `key → flag` for the keyed distinct case (no claim for union all).
+            fds: this.membershipFds(),
             equivClasses: undefined,
-            constantBindings: undefined,
-            // Domains can't be assumed across set operations either: a UNION of
-            // [a in (1,2)] with [a in (3)] would land outside both source domains.
-            domainConstraints: undefined,
+            // Optional constant-fold (Invariant 2): `except` ⇒ inRight=false, inLeft=true;
+            // `intersect` ⇒ all flags true. union/unionAll bind nothing (a row may be in
+            // either branch). The runtime probe agrees with these bindings.
+            constantBindings: this.membershipConstantBindings(),
+            // Domain `{true,false}` per flag — the clean-boolean point.
+            domainConstraints: this.membershipDomains(),
+            // The read-only `existence` `UpdateSite` per flag (the write half flips routing on).
+            updateLineage: this.membershipLineage(),
         };
     }
+    /**
+     * `key → flag` forward FDs (Invariant 1). A DISTINCT set operation (`isSet`) is
+     * keyed on its all-columns combination, so the data columns functionally determine
+     * each flag (the flag is `tuple ∈ branch`, a function of the data tuple). A bag
+     * (`union all`) has no data-column key, so it makes NO `key → flag` claim.
+     */
+    membershipFds() {
+        if (this.op === 'unionAll')
+            return undefined;
+        const dataColCount = this.dataColumnCount();
+        // Own flags follow the data columns AND both operands' surfaced flags. The
+        // all-data superkey determines EVERY surfaced flag (own and inner — each is a
+        // function of the data tuple it probes), so `superkeyToFd` over the full width
+        // yields `key → {every surfaced flag}`.
+        const totalCols = this.ownFlagBase + this.membership.length;
+        const allDataCols = Array.from({ length: dataColCount }, (_, i) => i);
+        const keyFd = superkeyToFd(allDataCols, totalCols);
+        return keyFd ? [keyFd] : undefined;
+    }
+    /** `{true,false}` enum domain per OWN appended flag (at its shifted index). */
+    membershipDomains() {
+        const ownFlagBase = this.ownFlagBase;
+        return this.membership.map((_spec, i) => ({
+            kind: 'enum',
+            column: ownFlagBase + i,
+            values: [true, false],
+        }));
+    }
+    /**
+     * Constant-fold the trivially-determined flags (Invariant 2). For `except`
+     * (`A except B`) every visible row is in the left and not the right, so a
+     * `left` flag is constant-true and a `right` flag constant-false. For
+     * `intersect` every visible row is in every branch, so all flags are
+     * constant-true. `union` / `union all` fold nothing.
+     */
+    membershipConstantBindings() {
+        if (this.op !== 'except' && this.op !== 'intersect')
+            return undefined;
+        const ownFlagBase = this.ownFlagBase;
+        const trueCols = [];
+        const falseCols = [];
+        this.membership.forEach((spec, i) => {
+            const col = ownFlagBase + i;
+            const isTrue = this.op === 'intersect' || spec.branch === 'left';
+            (isTrue ? trueCols : falseCols).push(col);
+        });
+        const bindings = [];
+        if (trueCols.length > 0)
+            bindings.push({ attrs: trueCols, value: { kind: 'literal', value: true } });
+        if (falseCols.length > 0)
+            bindings.push({ attrs: falseCols, value: { kind: 'literal', value: false } });
+        return bindings.length > 0 ? bindings : undefined;
+    }
+    /**
+     * One read-only `existence` `UpdateSite` per membership flag, naming the owning
+     * `SetOperationNode` and the immediate operand the flag reifies. Read-only here
+     * (`resolveBaseSite` resolves a `set-op-branch` component non-writable in this
+     * half); the write half routes a membership-flip to that branch's sub-plan.
+     *
+     * The `guard` is the branch's accumulated selection predicate. In this read half
+     * it is **carried, not consumed** (the write half computes the real conjunction of
+     * σ predicates down to the branch's base for predicate-honest leaf addressing), so
+     * a `true` literal placeholder is sufficient and honest about the read-half scope.
+     */
+    membershipLineage() {
+        const lineage = new Map();
+        const guard = { type: 'literal', value: true };
+        const setOp = Number(this.id);
+        for (const spec of this.membership) {
+            lineage.set(spec.attrId, {
+                kind: 'existence',
+                component: { kind: 'set-op-branch', setOp, branch: spec.branch },
+                guard,
+            });
+        }
+        return lineage.size > 0 ? lineage : undefined;
+    }
     withChildren(newChildren) {
         if (newChildren.length !== 2) {
             quereusError(`SetOperationNode expects 2 children, got ${newChildren.length}`, StatusCode.INTERNAL);
@@ -82,11 +357,20 @@ export class SetOperationNode extends PlanNode {
         if (newLeft === this.left && newRight === this.right) {
             return this;
         }
-        // Create new instance preserving attributes (set operation preserves left child's attributes)
-        return new SetOperationNode(this.scope, newLeft, newRight, this.op);
+        // Create new instance preserving attributes (set operation preserves left child's
+        // attributes). The membership specs carry pre-minted stable attribute ids, so they
+        // are threaded verbatim (the appended flag columns survive the rebuild).
+        return new SetOperationNode(this.scope, newLeft, newRight, this.op, this.membership);
     }
     toString() {
         return `${this.op.toUpperCase()}(${this.left.id}, ${this.right.id})`;
     }
+    getLogicalAttributes() {
+        const base = { op: this.op };
+        if (this.hasMembershipColumns) {
+            base.membership = this.membership.map(m => `exists ${m.branch} as ${m.name}`);
+        }
+        return base;
+    }
 }
 //# sourceMappingURL=set-operation-node.js.map

package/dist/src/planner/nodes/set-operation-node.js.map

@@ -1 +1 @@
-{"version":3,"file":"set-operation-node.js","sourceRoot":"","sources":["../../../../src/planner/nodes/set-operation-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAG5D,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAC9C,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACpE,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAEnD,MAAM,OAAO,gBAAiB,SAAQ,QAAQ;IAM1B;IACA;IACA;IAPT,QAAQ,GAAG,YAAY,CAAC,YAAY,CAAC;IACtC,eAAe,CAA+B;IAEtD,YACE,KAAY,EACI,IAAwB,EACxB,KAAyB,EACzB,EAAiD;QAEjE,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,YAAY,EAAE,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;QAJzC,SAAI,GAAJ,IAAI,CAAoB;QACxB,UAAK,GAAL,KAAK,CAAoB;QACzB,OAAE,GAAF,EAAE,CAA+C;QAGjE,yBAAyB;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC;QACxC,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC;QAC1C,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;YACzC,MAAM,IAAI,YAAY,CAAC,iDAAiD,QAAQ,CAAC,MAAM,eAAe,SAAS,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;QAC9I,CAAC;QACD,uDAAuD;QACvD,IAAI,CAAC,eAAe,GAAG,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;IAClE,CAAC;IAEO,eAAe;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;QAC5C,wEAAwE;QACxE,0EAA0E;QAC1E,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC;IACpC,CAAC;IAED,OAAO;QACL,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;QACrC,OAAO,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,KAAK,UAAU,EAAkB,CAAC;IACxE,CAAC;IAED,WAAW;QACT,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,YAAY;QACV,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,eAAe,CAAC,iBAAuC;QACrD,oDAAoD;QACpD,sEAAsE;QACtE,4EAA4E;QAC5E,yBAAyB;QACzB,EAAE;QACF,gEAAgE;QAChE,+DAA+D;QAC/D,uEAAuE;QACvE,uEAAuE;QACvE,kCAAkC;QAClC,0EAA0E;QAC1E,qEAAqE;QACrE,kDAAkD;QAClD,OAAO;YACL,WAAW,EAAE,SAAS;YACtB,GAAG,EAAE,SAAS;YACd,YAAY,EAAE,SAAS;YACvB,gBAAgB,EAAE,SAAS;YAC3B,oEAAoE;YACpE,uEAAuE;YACvE,iBAAiB,EAAE,SAAS;SAC7B,CAAC;IACJ,CAAC;IAED,YAAY,CAAC,WAAgC;QAC3C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,YAAY,CAAC,4CAA4C,WAAW,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACtG,CAAC;QAED,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,WAAW,CAAC;QAExC,aAAa;QACb,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YAC/B,YAAY,CAAC,4DAA4D,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QAClG,CAAC;QACD,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,YAAY,CAAC,6DAA6D,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACnG,CAAC;QAED,0CAA0C;QAC1C,IAAI,OAAO,KAAK,IAAI,CAAC,IAAI,IAAI,QAAQ,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,8FAA8F;QAC9F,OAAO,IAAI,gBAAgB,CACzB,IAAI,CAAC,KAAK,EACV,OAA6B,EAC7B,QAA8B,EAC9B,IAAI,CAAC,EAAE,CACR,CAAC;IACJ,CAAC;IAEQ,QAAQ;QACf,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC;IACvE,CAAC;CACF"}
+{"version":3,"file":"set-operation-node.js","sourceRoot":"","sources":["../../../../src/planner/nodes/set-operation-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAI5D,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAC9C,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACpE,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,2BAA2B,EAAE,sBAAsB,EAAE,MAAM,qCAAqC,CAAC;AAuB1G;;;;;GAKG;AACH,SAAS,SAAS,CAAC,IAAwB;IACzC,OAAO,IAAI,YAAY,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC;AACnG,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,IAAwB;IACzC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;AACzD,CAAC;AAED,MAAM,OAAO,gBAAiB,SAAQ,QAAQ;IAc1B;IACA;IACA;IAKA;IApBT,QAAQ,GAAG,YAAY,CAAC,YAAY,CAAC;IACtC,eAAe,CAA+B;IACtD;;;;;;OAMG;IACK,mBAAmB,CAA2C;IAEtE,YACE,KAAY,EACI,IAAwB,EACxB,KAAyB,EACzB,EAAiD;IACjE;;;OAGG;IACa,UAA2C;QAE3D,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,YAAY,EAAE,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;QATzC,SAAI,GAAJ,IAAI,CAAoB;QACxB,UAAK,GAAL,KAAK,CAAoB;QACzB,OAAE,GAAF,EAAE,CAA+C;QAKjD,eAAU,GAAV,UAAU,CAAiC;QAG3D,+EAA+E;QAC/E,+EAA+E;QAC/E,kFAAkF;QAClF,+EAA+E;QAC/E,4EAA4E;QAC5E,+EAA+E;QAC/E,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,IAAI,YAAY,CAAC,iDAAiD,QAAQ,eAAe,SAAS,EAAE,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;QAChI,CAAC;QACD,uDAAuD;QACvD,IAAI,CAAC,eAAe,GAAG,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;QAChE,IAAI,CAAC,mBAAmB,GAAG,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;IAC5E,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACK,qBAAqB;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,KAAK,UAAU,CAAC;QACrC,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC;QAChD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC;QAClD,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QACzC,MAAM,QAAQ,GAA4B,EAAE,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,2BAA2B,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACnF,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC5B,IAAI,KAAK;oBAAE,MAAM,sBAAsB,CAAC,GAAG,CAAC,CAAC;gBAC7C,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,uDAAuD;YAC5E,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,aAAa,EAAE,eAAe,EAAE,GAAG,CAAC,eAAe,EAAE,CAAC,CAAC;YAC5F,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;;;OAQG;IACK,gBAAgB,CAAC,QAAoB,EAAE,CAAS;QACtD,MAAM,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5C,OAAO,EAAE,GAAG,QAAQ,EAAE,aAAa,EAAE,CAAC,CAAC,aAAa,EAAE,eAAe,EAAE,CAAC,CAAC,eAAe,EAAE,CAAC;IAC7F,CAAC;IAED,qEAAqE;IACrE,IAAI,oBAAoB;QACtB,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IACzD,CAAC;IAED;;;;;OAKG;IACH,IAAI,gBAAgB;QAClB,OAAO,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,aAAa,GAAG,CAAC,IAAI,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACxF,CAAC;IAED;;;;OAIG;IACH,eAAe;QACb,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,6FAA6F;IAC7F,IAAY,aAAa;QACvB,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,8FAA8F;IAC9F,IAAY,cAAc;QACxB,OAAO,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACH,IAAY,WAAW;QACrB,OAAO,IAAI,CAAC,eAAe,EAAE,GAAG,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,cAAc,CAAC;IAC3E,CAAC;IAED;;;;;;;;OAQG;IACK,eAAe;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QACzC,iFAAiF;QACjF,uEAAuE;QACvE,MAAM,SAAS,GAAgB,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxI,6EAA6E;QAC7E,iEAAiE;QACjE,IAAI,CAAC,IAAI,CAAC,gBAAgB;YAAE,OAAO,SAAS,CAAC;QAC7C,mFAAmF;QACnF,+EAA+E;QAC/E,MAAM,YAAY,GAAgB,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,mBAAmB,EAAE,CAAC,CAAC,CAAC;QACzI,OAAO;YACL,GAAG,SAAS;YACZ,GAAG,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC;YAC7B,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC;YAC9C,GAAG,YAAY;SAChB,CAAC;IACJ,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC;IACpC,CAAC;IAED,OAAO;QACL,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,KAAK,UAAU,CAAC;QACrC,sCAAsC;QACtC,2EAA2E;QAC3E,yCAAyC;QACzC,2EAA2E;QAC3E,2EAA2E;QAC3E,2EAA2E;QAC3E,wEAAwE;QACxE,0EAA0E;QAC1E,+BAA+B;QAC/B,oFAAoF;QACpF,qFAAqF;QACrF,4CAA4C;QAC5C,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,WAAW,IAAI,IAAI,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACpF,kFAAkF;QAClF,qFAAqF;QACrF,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QACzC,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjI,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC3B,OAAO,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAkB,CAAC;QAC5E,CAAC;QACD,oFAAoF;QACpF,sFAAsF;QACtF,6FAA6F;QAC7F,MAAM,cAAc,GAAgB,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,mBAAmB,EAAE,CAAC,CAAC,CAAC;QAC1H,MAAM,OAAO,GAAG;YACd,GAAG,WAAW;YACd,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC;YACpC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC;YAChD,GAAG,cAAc;SAClB,CAAC;QACF,OAAO,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAkB,CAAC;IAC/D,CAAC;IAED,WAAW;QACT,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,YAAY;QACV,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,eAAe,CAAC,iBAAuC;QACrD,oDAAoD;QACpD,sEAAsE;QACtE,4EAA4E;QAC5E,yBAAyB;QACzB,EAAE;QACF,gFAAgF;QAChF,8EAA8E;QAC9E,iFAAiF;QACjF,8DAA8D;QAC9D,+DAA+D;QAC/D,uEAAuE;QACvE,uEAAuE;QACvE,kCAAkC;QAClC,0EAA0E;QAC1E,qEAAqE;QACrE,kDAAkD;QAClD,IAAI,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC/B,OAAO;gBACL,WAAW,EAAE,SAAS;gBACtB,GAAG,EAAE,SAAS;gBACd,YAAY,EAAE,SAAS;gBACvB,gBAAgB,EAAE,SAAS;gBAC3B,oEAAoE;gBACpE,uEAAuE;gBACvE,iBAAiB,EAAE,SAAS;aAC7B,CAAC;QACJ,CAAC;QAED,OAAO;YACL,WAAW,EAAE,SAAS;YACtB,kFAAkF;YAClF,GAAG,EAAE,IAAI,CAAC,aAAa,EAAE;YACzB,YAAY,EAAE,SAAS;YACvB,+EAA+E;YAC/E,6EAA6E;YAC7E,gEAAgE;YAChE,gBAAgB,EAAE,IAAI,CAAC,0BAA0B,EAAE;YACnD,4DAA4D;YAC5D,iBAAiB,EAAE,IAAI,CAAC,iBAAiB,EAAE;YAC3C,qFAAqF;YACrF,aAAa,EAAE,IAAI,CAAC,iBAAiB,EAAE;SACxC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,aAAa;QACnB,IAAI,IAAI,CAAC,EAAE,KAAK,UAAU;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QAC5C,2EAA2E;QAC3E,8EAA8E;QAC9E,+EAA+E;QAC/E,wCAAwC;QACxC,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAW,CAAC,MAAM,CAAC;QAC7D,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACtE,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;QACnD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrC,CAAC;IAED,+EAA+E;IACvE,iBAAiB;QACvB,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACrC,OAAO,IAAI,CAAC,UAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACzC,IAAI,EAAE,MAAe;YACrB,MAAM,EAAE,WAAW,GAAG,CAAC;YACvB,MAAM,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC;SACtB,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;;;;;OAMG;IACK,0BAA0B;QAChC,IAAI,IAAI,CAAC,EAAE,KAAK,QAAQ,IAAI,IAAI,CAAC,EAAE,KAAK,WAAW;YAAE,OAAO,SAAS,CAAC;QACtE,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACrC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,IAAI,CAAC,UAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACnC,MAAM,GAAG,GAAG,WAAW,GAAG,CAAC,CAAC;YAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,KAAK,WAAW,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC;YACjE,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QACH,MAAM,QAAQ,GAAsB,EAAE,CAAC;QACvC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QACrG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACxG,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;IACpD,CAAC;IAED;;;;;;;;;;OAUG;IACK,iBAAiB;QACvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC9C,MAAM,KAAK,GAAe,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QAC3D,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAW,EAAE,CAAC;YACpC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE;gBACvB,IAAI,EAAE,WAAW;gBACjB,SAAS,EAAE,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE;gBAChE,KAAK;aACN,CAAC,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IAChD,CAAC;IAED,YAAY,CAAC,WAAgC;QAC3C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,YAAY,CAAC,4CAA4C,WAAW,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACtG,CAAC;QAED,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,WAAW,CAAC;QAExC,aAAa;QACb,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YAC/B,YAAY,CAAC,4DAA4D,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QAClG,CAAC;QACD,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,YAAY,CAAC,6DAA6D,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACnG,CAAC;QAED,0CAA0C;QAC1C,IAAI,OAAO,KAAK,IAAI,CAAC,IAAI,IAAI,QAAQ,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,kFAAkF;QAClF,mFAAmF;QACnF,yEAAyE;QACzE,OAAO,IAAI,gBAAgB,CACzB,IAAI,CAAC,KAAK,EACV,OAA6B,EAC7B,QAA8B,EAC9B,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,UAAU,CAChB,CAAC;IACJ,CAAC;IAEQ,QAAQ;QACf,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC;IACvE,CAAC;IAEQ,oBAAoB;QAC3B,MAAM,IAAI,GAA4B,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC;QACtD,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC9B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,MAAM,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACjF,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/dist/src/planner/nodes/single-row.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"single-row.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/single-row.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,qBAAqB,EAAE,KAAK,SAAS,EAAE,kBAAkB,EAAE,KAAK,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC7H,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAG7D,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAEjD;;;GAGG;AACH,qBAAa,aAAc,SAAQ,QAAS,YAAW,qBAAqB,EAAE,YAAY;IACxF,SAAkB,QAAQ,0BAA0B;IAEpD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,CAA0C;IAEhF,OAAO,CAAC,QAAQ,CAAC,UAAU,CAOzB;IAEF,OAAO;IAIP,WAAkB,QAAQ,IAAI,aAAa,CAE1C;IAED,OAAO,IAAI,YAAY;IAIvB,aAAa,IAAI,SAAS,EAAE;IAK5B,WAAW,IAAI,SAAS,EAAE;IAI3B,YAAY,IAAI,SAAS,EAAE;IAI1B,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAOxD,IAAI,aAAa,IAAI,MAAM,CAE1B;IAEQ,QAAQ,IAAI,MAAM;IAIlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAQhD,eAAe,IAAI,OAAO,CAAC,kBAAkB,CAAC;IAUhD,QAAQ,IAAI,aAAa,CAAC,GAAG,CAAC;CAGrC"}
+{"version":3,"file":"single-row.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/single-row.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,qBAAqB,EAAE,KAAK,SAAS,EAAE,kBAAkB,EAAE,KAAK,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC7H,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAG7D,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAEjD;;;GAGG;AACH,qBAAa,aAAc,SAAQ,QAAS,YAAW,qBAAqB,EAAE,YAAY;IACxF,SAAkB,QAAQ,0BAA0B;IAEpD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,CAA0C;IAEhF,OAAO,CAAC,QAAQ,CAAC,UAAU,CAOzB;IAEF,OAAO;IAIP,WAAkB,QAAQ,IAAI,aAAa,CAE1C;IAED,OAAO,IAAI,YAAY;IAIvB,aAAa,IAAI,SAAS,EAAE;IAK5B,WAAW,IAAI,SAAS,EAAE;IAI3B,YAAY,IAAI,SAAS,EAAE;IAI1B,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAOxD,IAAI,aAAa,IAAI,MAAM,CAE1B;IAEQ,QAAQ,IAAI,MAAM;IAIlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAQhD,eAAe,IAAI,OAAO,CAAC,kBAAkB,CAAC;IAahD,QAAQ,IAAI,aAAa,CAAC,GAAG,CAAC;CAGrC"}

package/dist/src/planner/nodes/single-row.js

@@ -58,6 +58,9 @@ export class SingleRowNode extends PlanNode {
         // SingleRow has zero columns, so the singleton FD `∅ → all_cols` has no
         // dependents and isn't representable as an FD. The at-most-one-row
         // guarantee is communicated via `estimatedRows: 1` and `RelationType.isSet`.
+        // This is the documented `colCount === 0` carve-out of the
+        // independent-channel singleton law: the declared empty key needs no
+        // matching FD because none can exist (see test/property.spec.ts).
         return {
             estimatedRows: 1,
             constant: true,

package/dist/src/planner/nodes/single-row.js.map

@@ -1 +1 @@
-{"version":3,"file":"single-row.js","sourceRoot":"","sources":["../../../../src/planner/nodes/single-row.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAqF,MAAM,gBAAgB,CAAC;AAE7H,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAIhD;;;GAGG;AACH,MAAM,OAAO,aAAc,SAAQ,QAAQ;IACvB,QAAQ,GAAG,YAAY,CAAC,SAAS,CAAC;IAE5C,MAAM,CAAU,cAAc,GAAG,IAAI,aAAa,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,iCAAiC;IAEjG,UAAU,GAAiB;QAC1C,SAAS,EAAE,UAAU;QACrB,UAAU,EAAE,IAAI;QAChB,KAAK,EAAE,IAAI,EAAE,6BAA6B;QAC1C,OAAO,EAAE,EAAE;QACX,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,sDAAsD;QAClE,cAAc,EAAE,EAAE;KACnB,CAAC;IAEF,YAAoB,KAAY;QAC9B,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,mBAAmB;IACzC,CAAC;IAEM,MAAM,KAAK,QAAQ;QACxB,OAAO,aAAa,CAAC,cAAc,CAAC;IACtC,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED,aAAa;QACX,mDAAmD;QACnD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,WAAW;QACT,OAAO,EAAE,CAAC;IACZ,CAAC;IAEF,YAAY;QACX,OAAO,EAAE,CAAC;IACX,CAAC;IAEA,YAAY,CAAC,WAAgC;QAC3C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,yCAAyC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QACjF,CAAC;QACD,OAAO,IAAI,CAAC,CAAC,4BAA4B;IAC3C,CAAC;IAED,IAAI,aAAa;QACf,OAAO,CAAC,CAAC;IACX,CAAC;IAEQ,QAAQ;QACf,OAAO,MAAM,CAAC;IAChB,CAAC;IAEQ,oBAAoB;QAC3B,OAAO;YACL,WAAW,EAAE,yCAAyC;YACtD,OAAO,EAAE,CAAC;YACV,UAAU,EAAE,CAAC;SACd,CAAC;IACJ,CAAC;IAEO,eAAe;QACvB,wEAAwE;QACxE,mEAAmE;QACnE,6EAA6E;QAC7E,OAAO;YACN,aAAa,EAAE,CAAC;YAChB,QAAQ,EAAE,IAAI;SACd,CAAC;IACH,CAAC;IAED,KAAK,CAAC,CAAC,QAAQ;QACd,MAAM,EAAE,CAAC;IACV,CAAC"}
+{"version":3,"file":"single-row.js","sourceRoot":"","sources":["../../../../src/planner/nodes/single-row.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAqF,MAAM,gBAAgB,CAAC;AAE7H,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAIhD;;;GAGG;AACH,MAAM,OAAO,aAAc,SAAQ,QAAQ;IACvB,QAAQ,GAAG,YAAY,CAAC,SAAS,CAAC;IAE5C,MAAM,CAAU,cAAc,GAAG,IAAI,aAAa,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,iCAAiC;IAEjG,UAAU,GAAiB;QAC1C,SAAS,EAAE,UAAU;QACrB,UAAU,EAAE,IAAI;QAChB,KAAK,EAAE,IAAI,EAAE,6BAA6B;QAC1C,OAAO,EAAE,EAAE;QACX,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,sDAAsD;QAClE,cAAc,EAAE,EAAE;KACnB,CAAC;IAEF,YAAoB,KAAY;QAC9B,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,mBAAmB;IACzC,CAAC;IAEM,MAAM,KAAK,QAAQ;QACxB,OAAO,aAAa,CAAC,cAAc,CAAC;IACtC,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED,aAAa;QACX,mDAAmD;QACnD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,WAAW;QACT,OAAO,EAAE,CAAC;IACZ,CAAC;IAEF,YAAY;QACX,OAAO,EAAE,CAAC;IACX,CAAC;IAEA,YAAY,CAAC,WAAgC;QAC3C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,yCAAyC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QACjF,CAAC;QACD,OAAO,IAAI,CAAC,CAAC,4BAA4B;IAC3C,CAAC;IAED,IAAI,aAAa;QACf,OAAO,CAAC,CAAC;IACX,CAAC;IAEQ,QAAQ;QACf,OAAO,MAAM,CAAC;IAChB,CAAC;IAEQ,oBAAoB;QAC3B,OAAO;YACL,WAAW,EAAE,yCAAyC;YACtD,OAAO,EAAE,CAAC;YACV,UAAU,EAAE,CAAC;SACd,CAAC;IACJ,CAAC;IAEO,eAAe;QACvB,wEAAwE;QACxE,mEAAmE;QACnE,6EAA6E;QAC7E,2DAA2D;QAC3D,qEAAqE;QACrE,kEAAkE;QAClE,OAAO;YACN,aAAa,EAAE,CAAC;YAChB,QAAQ,EAAE,IAAI;SACd,CAAC;IACH,CAAC;IAED,KAAK,CAAC,CAAC,QAAQ;QACd,MAAM,EAAE,CAAC;IACV,CAAC"}

package/dist/src/planner/nodes/sort.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sort.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/sort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,kBAAkB,EAAE,KAAK,cAAc,EAAE,KAAK,mBAAmB,EAAE,KAAK,kBAAkB,EAAE,KAAK,SAAS,EAA0C,MAAM,gBAAgB,CAAC;AACnM,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAKhD,OAAO,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAI9D;;GAEG;AACH,MAAM,WAAW,OAAO;IACvB,gCAAgC;IAChC,UAAU,EAAE,cAAc,CAAC;IAC3B,qBAAqB;IACrB,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC;IAC1B,0BAA0B;IAC1B,KAAK,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;CACzB;AAED;;;;;GAKG;AACH,qBAAa,QAAS,SAAQ,QAAS,YAAW,mBAAmB,EAAE,WAAW;aAKhE,MAAM,EAAE,kBAAkB;aAC1B,QAAQ,EAAE,SAAS,OAAO,EAAE;IAL7C,SAAkB,QAAQ,qBAAqB;gBAG9C,KAAK,EAAE,KAAK,EACI,MAAM,EAAE,kBAAkB,EAC1B,QAAQ,EAAE,SAAS,OAAO,EAAE,EAC5C,qBAAqB,CAAC,EAAE,MAAM;IAW/B,OAAO,IAAI,YAAY;IAKvB,aAAa,IAAI,SAAS,SAAS,EAAE;IAKrC,WAAW,IAAI,SAAS,QAAQ,EAAE;IAKlC,YAAY,IAAI,SAAS,CAAC,kBAAkB,CAAC;IAI7C,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CAGtC;IAED,eAAe,CAAC,gBAAgB,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAwC3E,QAAQ,IAAI,MAAM;IAOlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAUxD,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAoCxD,WAAW,IAAI,SAAS;QAAE,UAAU,EAAE,cAAc,CAAC;QAAC,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,OAAO,GAAG,MAAM,CAAA;KAAE,EAAE;IAQ7G,YAAY,CAAC,IAAI,EAAE,SAAS;QAAE,UAAU,EAAE,cAAc,CAAC;QAAC,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,OAAO,GAAG,MAAM,CAAA;KAAE,EAAE,GAAG,QAAQ;CAqB5H"}
+{"version":3,"file":"sort.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/sort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,kBAAkB,EAAE,KAAK,cAAc,EAAE,KAAK,mBAAmB,EAAE,KAAK,kBAAkB,EAAE,KAAK,SAAS,EAA0C,MAAM,gBAAgB,CAAC;AACnM,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAKhD,OAAO,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAI9D;;GAEG;AACH,MAAM,WAAW,OAAO;IACvB,gCAAgC;IAChC,UAAU,EAAE,cAAc,CAAC;IAC3B,qBAAqB;IACrB,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC;IAC1B,0BAA0B;IAC1B,KAAK,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;CACzB;AAED;;;;;GAKG;AACH,qBAAa,QAAS,SAAQ,QAAS,YAAW,mBAAmB,EAAE,WAAW;aAKhE,MAAM,EAAE,kBAAkB;aAC1B,QAAQ,EAAE,SAAS,OAAO,EAAE;IAL7C,SAAkB,QAAQ,qBAAqB;gBAG9C,KAAK,EAAE,KAAK,EACI,MAAM,EAAE,kBAAkB,EAC1B,QAAQ,EAAE,SAAS,OAAO,EAAE,EAC5C,qBAAqB,CAAC,EAAE,MAAM;IAW/B,OAAO,IAAI,YAAY;IAKvB,aAAa,IAAI,SAAS,SAAS,EAAE;IAKrC,WAAW,IAAI,SAAS,QAAQ,EAAE;IAKlC,YAAY,IAAI,SAAS,CAAC,kBAAkB,CAAC;IAI7C,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CAGtC;IAED,eAAe,CAAC,gBAAgB,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAyC3E,QAAQ,IAAI,MAAM;IAOlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAUxD,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAoCxD,WAAW,IAAI,SAAS;QAAE,UAAU,EAAE,cAAc,CAAC;QAAC,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,OAAO,GAAG,MAAM,CAAA;KAAE,EAAE;IAQ7G,YAAY,CAAC,IAAI,EAAE,SAAS;QAAE,UAAU,EAAE,cAAc,CAAC;QAAC,SAAS,EAAE,KAAK,GAAG,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,OAAO,GAAG,MAAM,CAAA;KAAE,EAAE,GAAG,QAAQ;CAqB5H"}