@quereus/quereus 0.1.0

package/dist/src/planner/nodes/delete-node.d.ts

@@ -0,0 +1,27 @@
+import type { Scope } from '../scopes/scope.js';
+import { PlanNode, type RelationalPlanNode, type Attribute, type RowDescriptor } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+import type { TableReferenceNode } from './reference.js';
+import type { RelationType } from '../../common/datatype.js';
+/**
+ * Represents a DELETE statement in the logical query plan.
+ */
+export declare class DeleteNode extends PlanNode implements RelationalPlanNode {
+    readonly table: TableReferenceNode;
+    readonly source: RelationalPlanNode;
+    readonly oldRowDescriptor?: RowDescriptor | undefined;
+    readonly flatRowDescriptor?: RowDescriptor | undefined;
+    readonly nodeType = PlanNodeType.Delete;
+    constructor(scope: Scope, table: TableReferenceNode, source: RelationalPlanNode, // Typically a FilterNode wrapping a TableScanNode
+    oldRowDescriptor?: RowDescriptor | undefined, // For constraint checking
+    flatRowDescriptor?: RowDescriptor | undefined);
+    getType(): RelationType;
+    getAttributes(): Attribute[];
+    getRelations(): readonly [RelationalPlanNode, TableReferenceNode];
+    getChildren(): readonly [];
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+    get estimatedRows(): number | undefined;
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+}
+//# sourceMappingURL=delete-node.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"delete-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/delete-node.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,KAAK,kBAAkB,EAAE,KAAK,SAAS,EAAE,KAAK,aAAa,EAAE,MAAM,gBAAgB,CAAC;AACvG,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACzD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAG7D;;GAEG;AACH,qBAAa,UAAW,SAAQ,QAAS,YAAW,kBAAkB;aAKlD,KAAK,EAAE,kBAAkB;aACzB,MAAM,EAAE,kBAAkB;aAC1B,gBAAgB,CAAC,EAAE,aAAa;aAChC,iBAAiB,CAAC,EAAE,aAAa;IAPnD,SAAkB,QAAQ,uBAAuB;gBAG/C,KAAK,EAAE,KAAK,EACI,KAAK,EAAE,kBAAkB,EACzB,MAAM,EAAE,kBAAkB,EAAE,kDAAkD;IAC9E,gBAAgB,CAAC,EAAE,aAAa,YAAA,EAAE,0BAA0B;IAC5D,iBAAiB,CAAC,EAAE,aAAa,YAAA;IAKpD,OAAO,IAAI,YAAY;IAItB,aAAa,IAAI,SAAS,EAAE;IAQ5B,YAAY,IAAI,SAAS,CAAC,kBAAkB,EAAE,kBAAkB,CAAC;IAKjE,WAAW,IAAI,SAAS,EAAE;IAI1B,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IAOxD,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CAEtC;IAEQ,QAAQ,IAAI,MAAM;IAIlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAYzD"}

package/dist/src/planner/nodes/delete-node.js

@@ -0,0 +1,62 @@
+import { PlanNode } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+import { buildAttributesFromFlatDescriptor } from '../../util/row-descriptor.js';
+/**
+ * Represents a DELETE statement in the logical query plan.
+ */
+export class DeleteNode extends PlanNode {
+    table;
+    source;
+    oldRowDescriptor;
+    flatRowDescriptor;
+    nodeType = PlanNodeType.Delete;
+    constructor(scope, table, source, // Typically a FilterNode wrapping a TableScanNode
+    oldRowDescriptor, // For constraint checking
+    flatRowDescriptor) {
+        super(scope);
+        this.table = table;
+        this.source = source;
+        this.oldRowDescriptor = oldRowDescriptor;
+        this.flatRowDescriptor = flatRowDescriptor;
+    }
+    getType() {
+        return this.source.getType();
+    }
+    getAttributes() {
+        if (this.flatRowDescriptor && Object.keys(this.flatRowDescriptor).length > 0) {
+            return buildAttributesFromFlatDescriptor(this.flatRowDescriptor);
+        }
+        // Fallback to source attributes for backward compatibility
+        return this.source.getAttributes();
+    }
+    getRelations() {
+        // The source provides keys to be deleted, table is the target of deletions.
+        return [this.source, this.table];
+    }
+    getChildren() {
+        return [];
+    }
+    withChildren(newChildren) {
+        if (newChildren.length !== 0) {
+            throw new Error(`DeleteNode expects 0 children, got ${newChildren.length}`);
+        }
+        return this; // No children in getChildren(), source is accessed via getRelations()
+    }
+    get estimatedRows() {
+        return this.source.estimatedRows;
+    }
+    toString() {
+        return `DELETE FROM ${this.table.tableSchema.name}`;
+    }
+    getLogicalAttributes() {
+        const props = {
+            table: this.table.tableSchema.name,
+            schema: this.table.tableSchema.schemaName
+        };
+        if (this.flatRowDescriptor) {
+            props.hasFlatRowDescriptor = true;
+        }
+        return props;
+    }
+}
+//# sourceMappingURL=delete-node.js.map

package/dist/src/planner/nodes/delete-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"delete-node.js","sourceRoot":"","sources":["../../../../src/planner/nodes/delete-node.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAA+D,MAAM,gBAAgB,CAAC;AACvG,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAGnD,OAAO,EAAE,iCAAiC,EAAE,MAAM,8BAA8B,CAAC;AAEjF;;GAEG;AACH,MAAM,OAAO,UAAW,SAAQ,QAAQ;IAKpB;IACA;IACA;IACA;IAPA,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC;IAEjD,YACE,KAAY,EACI,KAAyB,EACzB,MAA0B,EAAE,kDAAkD;IAC9E,gBAAgC,EAAE,0BAA0B;IAC5D,iBAAiC;QAEjD,KAAK,CAAC,KAAK,CAAC,CAAC;QALG,UAAK,GAAL,KAAK,CAAoB;QACzB,WAAM,GAAN,MAAM,CAAoB;QAC1B,qBAAgB,GAAhB,gBAAgB,CAAgB;QAChC,sBAAiB,GAAjB,iBAAiB,CAAgB;IAGnD,CAAC;IAEF,OAAO;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAEA,aAAa;QACX,IAAI,IAAI,CAAC,iBAAiB,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7E,OAAO,iCAAiC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QACnE,CAAC;QACD,2DAA2D;QAC3D,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;IACrC,CAAC;IAED,YAAY;QACV,4EAA4E;QAC5E,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,WAAW;QACT,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,YAAY,CAAC,WAAgC;QAC3C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,sCAAsC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,IAAI,CAAC,CAAC,sEAAsE;IACrF,CAAC;IAED,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;IACnC,CAAC;IAEQ,QAAQ;QACf,OAAO,eAAe,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;IACtD,CAAC;IAEQ,oBAAoB;QAC3B,MAAM,KAAK,GAA4B;YACrC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI;YAClC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU;SAC1C,CAAC;QAEF,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC3B,KAAK,CAAC,oBAAoB,GAAG,IAAI,CAAC;QACpC,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

package/dist/src/planner/nodes/distinct-node.d.ts

@@ -0,0 +1,22 @@
+import { PlanNodeType } from './plan-node-type.js';
+import { PlanNode, type RelationalPlanNode, type UnaryRelationalNode, type Attribute } from './plan-node.js';
+import type { RelationType } from '../../common/datatype.js';
+import type { Scope } from '../scopes/scope.js';
+/**
+ * Represents a DISTINCT operation that eliminates duplicate rows.
+ * It takes an input relation and outputs unique rows.
+ */
+export declare class DistinctNode extends PlanNode implements UnaryRelationalNode {
+    readonly source: RelationalPlanNode;
+    readonly nodeType = PlanNodeType.Distinct;
+    constructor(scope: Scope, source: RelationalPlanNode, estimatedCostOverride?: number);
+    getType(): RelationType;
+    getAttributes(): Attribute[];
+    getChildren(): readonly [RelationalPlanNode];
+    getRelations(): readonly [RelationalPlanNode];
+    get estimatedRows(): number | undefined;
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+}
+//# sourceMappingURL=distinct-node.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"distinct-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/distinct-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,kBAAkB,EAAE,KAAK,mBAAmB,EAAE,KAAK,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC7G,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAIhD;;;GAGG;AACH,qBAAa,YAAa,SAAQ,QAAS,YAAW,mBAAmB;aAKrD,MAAM,EAAE,kBAAkB;IAJ5C,SAAkB,QAAQ,yBAAyB;gBAGjD,KAAK,EAAE,KAAK,EACI,MAAM,EAAE,kBAAkB,EAC1C,qBAAqB,CAAC,EAAE,MAAM;IAShC,OAAO,IAAI,YAAY;IAUvB,aAAa,IAAI,SAAS,EAAE;IAK5B,WAAW,IAAI,SAAS,CAAC,kBAAkB,CAAC;IAI5C,YAAY,IAAI,SAAS,CAAC,kBAAkB,CAAC;IAI7C,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CAUtC;IAEQ,QAAQ,IAAI,MAAM;IAIlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAIxD,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;CAuBzD"}

package/dist/src/planner/nodes/distinct-node.js

@@ -0,0 +1,74 @@
+import { PlanNodeType } from './plan-node-type.js';
+import { PlanNode } from './plan-node.js';
+import { quereusError } from '../../common/errors.js';
+import { StatusCode } from '../../index.js';
+/**
+ * Represents a DISTINCT operation that eliminates duplicate rows.
+ * It takes an input relation and outputs unique rows.
+ */
+export class DistinctNode extends PlanNode {
+    source;
+    nodeType = PlanNodeType.Distinct;
+    constructor(scope, source, estimatedCostOverride) {
+        // Cost: cost of source + cost of deduplication (roughly O(n log n) for sorting approach)
+        const sourceCost = source.getTotalCost();
+        const sourceRows = source.estimatedRows ?? 1;
+        const deduplicationCost = sourceRows * Math.log2(Math.max(1, sourceRows));
+        super(scope, estimatedCostOverride ?? (sourceCost + deduplicationCost));
+        this.source = source;
+    }
+    getType() {
+        // DISTINCT always produces a set (no duplicates)
+        const sourceType = this.source.getType();
+        return {
+            ...sourceType,
+            // TODO: ensure that formed key is represented in the type
+            isSet: true // DISTINCT guarantees uniqueness
+        };
+    }
+    getAttributes() {
+        // DISTINCT preserves the same attributes as its source
+        return this.source.getAttributes();
+    }
+    getChildren() {
+        return [this.source];
+    }
+    getRelations() {
+        return [this.source];
+    }
+    get estimatedRows() {
+        // DISTINCT reduces the number of rows by eliminating duplicates
+        // This is a rough estimate - in reality it depends on data distribution
+        const sourceRows = this.source.estimatedRows;
+        if (sourceRows === undefined)
+            return undefined;
+        if (sourceRows <= 1)
+            return sourceRows;
+        // Rough heuristic: assume some duplicates exist
+        // More sophisticated planners would use column statistics
+        return Math.max(1, Math.floor(sourceRows * 0.7));
+    }
+    toString() {
+        return 'DISTINCT';
+    }
+    getLogicalAttributes() {
+        return {};
+    }
+    withChildren(newChildren) {
+        if (newChildren.length !== 1) {
+            quereusError(`DistinctNode expects 1 child, got ${newChildren.length}`, StatusCode.INTERNAL);
+        }
+        const [newSource] = newChildren;
+        // Type check
+        if (!('getAttributes' in newSource) || typeof newSource.getAttributes !== 'function') {
+            quereusError('DistinctNode: child must be a RelationalPlanNode', StatusCode.INTERNAL);
+        }
+        // Return same instance if nothing changed
+        if (newSource === this.source) {
+            return this;
+        }
+        // Create new instance preserving attributes (distinct preserves source attributes)
+        return new DistinctNode(this.scope, newSource);
+    }
+}
+//# sourceMappingURL=distinct-node.js.map

package/dist/src/planner/nodes/distinct-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"distinct-node.js","sourceRoot":"","sources":["../../../../src/planner/nodes/distinct-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAqE,MAAM,gBAAgB,CAAC;AAG7G,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAE5C;;;GAGG;AACH,MAAM,OAAO,YAAa,SAAQ,QAAQ;IAKtB;IAJA,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC;IAEnD,YACE,KAAY,EACI,MAA0B,EAC1C,qBAA8B;QAE9B,yFAAyF;QACzF,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;QACzC,MAAM,UAAU,GAAG,MAAM,CAAC,aAAa,IAAI,CAAC,CAAC;QAC7C,MAAM,iBAAiB,GAAG,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QAC1E,KAAK,CAAC,KAAK,EAAE,qBAAqB,IAAI,CAAC,UAAU,GAAG,iBAAiB,CAAC,CAAC,CAAC;QAPxD,WAAM,GAAN,MAAM,CAAoB;IAQ5C,CAAC;IAED,OAAO;QACL,iDAAiD;QACjD,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACzC,OAAO;YACL,GAAG,UAAU;YAChB,0DAA0D;YACvD,KAAK,EAAE,IAAI,CAAC,iCAAiC;SAC9C,CAAC;IACJ,CAAC;IAED,aAAa;QACX,uDAAuD;QACvD,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;IACrC,CAAC;IAED,WAAW;QACT,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,YAAY;QACV,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,IAAI,aAAa;QACf,gEAAgE;QAChE,wEAAwE;QACxE,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QAC7C,IAAI,UAAU,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC/C,IAAI,UAAU,IAAI,CAAC;YAAE,OAAO,UAAU,CAAC;QAEvC,gDAAgD;QAChD,0DAA0D;QAC1D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC;IACnD,CAAC;IAEQ,QAAQ;QACf,OAAO,UAAU,CAAC;IACpB,CAAC;IAEQ,oBAAoB;QAC3B,OAAO,EAAG,CAAC;IACb,CAAC;IAED,YAAY,CAAC,WAAgC;QAC3C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,YAAY,CAAC,qCAAqC,WAAW,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC/F,CAAC;QAED,MAAM,CAAC,SAAS,CAAC,GAAG,WAAW,CAAC;QAEhC,aAAa;QACb,IAAI,CAAC,CAAC,eAAe,IAAI,SAAS,CAAC,IAAI,OAAQ,SAAiB,CAAC,aAAa,KAAK,UAAU,EAAE,CAAC;YAC9F,YAAY,CAAC,kDAAkD,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACxF,CAAC;QAED,0CAA0C;QAC1C,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,mFAAmF;QACnF,OAAO,IAAI,YAAY,CACrB,IAAI,CAAC,KAAK,EACV,SAA+B,CAChC,CAAC;IACJ,CAAC;CACF"}

package/dist/src/planner/nodes/dml-executor-node.d.ts

@@ -0,0 +1,30 @@
+import type { Scope } from '../scopes/scope.js';
+import { PlanNode, type RelationalPlanNode, type Attribute, type PhysicalProperties } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+import type { TableReferenceNode } from './reference.js';
+import type { RelationType } from '../../common/datatype.js';
+import type { ConflictResolution } from '../../common/constants.js';
+import { RowOp } from '../../parser/ast.js';
+/**
+ * Executes actual database insert/update/delete operations after constraint validation.
+ * This node performs the actual vtab.xUpdate operations and yields the affected rows.
+ * All data transformations (defaults, conversions, etc.) happen before this node.
+ */
+export declare class DmlExecutorNode extends PlanNode implements RelationalPlanNode {
+    readonly source: RelationalPlanNode;
+    readonly table: TableReferenceNode;
+    readonly operation: RowOp;
+    readonly onConflict?: ConflictResolution | undefined;
+    readonly nodeType = PlanNodeType.UpdateExecutor;
+    constructor(scope: Scope, source: RelationalPlanNode, table: TableReferenceNode, operation: RowOp, onConflict?: ConflictResolution | undefined);
+    getType(): RelationType;
+    getAttributes(): Attribute[];
+    getRelations(): readonly [RelationalPlanNode, TableReferenceNode];
+    getChildren(): readonly PlanNode[];
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+    get estimatedRows(): number | undefined;
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+    computePhysical(): Partial<PhysicalProperties>;
+}
+//# sourceMappingURL=dml-executor-node.d.ts.map

package/dist/src/planner/nodes/dml-executor-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dml-executor-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/dml-executor-node.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,KAAK,kBAAkB,EAAE,KAAK,SAAS,EAAE,KAAK,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAC5G,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACzD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AACpE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C;;;;GAIG;AACH,qBAAa,eAAgB,SAAQ,QAAS,YAAW,kBAAkB;aAKvD,MAAM,EAAE,kBAAkB;aAC1B,KAAK,EAAE,kBAAkB;aACzB,SAAS,EAAE,KAAK;aAChB,UAAU,CAAC,EAAE,kBAAkB;IAPjD,SAAkB,QAAQ,+BAA+B;gBAGvD,KAAK,EAAE,KAAK,EACI,MAAM,EAAE,kBAAkB,EAC1B,KAAK,EAAE,kBAAkB,EACzB,SAAS,EAAE,KAAK,EAChB,UAAU,CAAC,EAAE,kBAAkB,YAAA;IAKjD,OAAO,IAAI,YAAY;IAIvB,aAAa,IAAI,SAAS,EAAE;IAI5B,YAAY,IAAI,SAAS,CAAC,kBAAkB,EAAE,kBAAkB,CAAC;IAIjE,WAAW,IAAI,SAAS,QAAQ,EAAE;IAIlC,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IA2BxD,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CAEtC;IAEQ,QAAQ,IAAI,MAAM;IAIlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAcxD,eAAe,IAAI,OAAO,CAAC,kBAAkB,CAAC;CAM/C"}

package/dist/src/planner/nodes/dml-executor-node.js

@@ -0,0 +1,73 @@
+import { PlanNode } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+/**
+ * Executes actual database insert/update/delete operations after constraint validation.
+ * This node performs the actual vtab.xUpdate operations and yields the affected rows.
+ * All data transformations (defaults, conversions, etc.) happen before this node.
+ */
+export class DmlExecutorNode extends PlanNode {
+    source;
+    table;
+    operation;
+    onConflict;
+    nodeType = PlanNodeType.UpdateExecutor;
+    constructor(scope, source, table, operation, onConflict) {
+        super(scope);
+        this.source = source;
+        this.table = table;
+        this.operation = operation;
+        this.onConflict = onConflict;
+    }
+    getType() {
+        return this.source.getType();
+    }
+    getAttributes() {
+        return this.source.getAttributes();
+    }
+    getRelations() {
+        return [this.source, this.table];
+    }
+    getChildren() {
+        return [this.source];
+    }
+    withChildren(newChildren) {
+        if (newChildren.length !== 1) {
+            throw new Error(`UpdateExecutorNode expects 1 child, got ${newChildren.length}`);
+        }
+        const [newSource] = newChildren;
+        // Type check
+        if (!('getAttributes' in newSource) || typeof newSource.getAttributes !== 'function') {
+            throw new Error('UpdateExecutorNode: child must be a RelationalPlanNode');
+        }
+        // Return same instance if nothing changed
+        if (newSource === this.source) {
+            return this;
+        }
+        // Create new instance
+        return new DmlExecutorNode(this.scope, newSource, this.table, this.operation, this.onConflict);
+    }
+    get estimatedRows() {
+        return this.source.estimatedRows;
+    }
+    toString() {
+        return `EXECUTE ${this.operation} ${this.table.tableSchema.name}`;
+    }
+    getLogicalAttributes() {
+        const props = {
+            operation: this.operation,
+            table: this.table.tableSchema.name,
+            schema: this.table.tableSchema.schemaName,
+        };
+        if (this.onConflict) {
+            props.onConflict = this.onConflict;
+        }
+        return props;
+    }
+    computePhysical() {
+        return {
+            readonly: false, // DML executor has side effects
+            idempotent: false, // DML operations are generally not idempotent
+        };
+    }
+}
+//# sourceMappingURL=dml-executor-node.js.map

package/dist/src/planner/nodes/dml-executor-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dml-executor-node.js","sourceRoot":"","sources":["../../../../src/planner/nodes/dml-executor-node.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAoE,MAAM,gBAAgB,CAAC;AAC5G,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAMnD;;;;GAIG;AACH,MAAM,OAAO,eAAgB,SAAQ,QAAQ;IAKzB;IACA;IACA;IACA;IAPA,QAAQ,GAAG,YAAY,CAAC,cAAc,CAAC;IAEzD,YACE,KAAY,EACI,MAA0B,EAC1B,KAAyB,EACzB,SAAgB,EAChB,UAA+B;QAE/C,KAAK,CAAC,KAAK,CAAC,CAAC;QALG,WAAM,GAAN,MAAM,CAAoB;QAC1B,UAAK,GAAL,KAAK,CAAoB;QACzB,cAAS,GAAT,SAAS,CAAO;QAChB,eAAU,GAAV,UAAU,CAAqB;IAGjD,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;IACrC,CAAC;IAED,YAAY;QACV,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,WAAW;QACT,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,YAAY,CAAC,WAAgC;QAC3C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,2CAA2C,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QACnF,CAAC;QAED,MAAM,CAAC,SAAS,CAAC,GAAG,WAAW,CAAC;QAEhC,aAAa;QACb,IAAI,CAAC,CAAC,eAAe,IAAI,SAAS,CAAC,IAAI,OAAQ,SAAiB,CAAC,aAAa,KAAK,UAAU,EAAE,CAAC;YAC9F,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;QAC5E,CAAC;QAED,0CAA0C;QAC1C,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,sBAAsB;QACtB,OAAO,IAAI,eAAe,CACxB,IAAI,CAAC,KAAK,EACV,SAA+B,EAC/B,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,UAAU,CAChB,CAAC;IACJ,CAAC;IAED,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;IACnC,CAAC;IAEQ,QAAQ;QACf,OAAO,WAAW,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;IACpE,CAAC;IAEQ,oBAAoB;QAC3B,MAAM,KAAK,GAA4B;YACrC,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI;YAClC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU;SAC1C,CAAC;QAEF,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACrC,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,eAAe;QACb,OAAO;YACL,QAAQ,EAAE,KAAK,EAAE,gCAAgC;YACjD,UAAU,EAAE,KAAK,EAAE,8CAA8C;SAClE,CAAC;IACJ,CAAC;CACF"}

package/dist/src/planner/nodes/drop-table-node.d.ts

@@ -0,0 +1,15 @@
+import type { Scope } from '../scopes/scope.js';
+import { VoidNode } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+import type * as AST from '../../parser/ast.js';
+/**
+ * Represents a DROP TABLE statement in the logical query plan.
+ */
+export declare class DropTableNode extends VoidNode {
+    readonly statementAst: AST.DropStmt;
+    readonly nodeType = PlanNodeType.DropTable;
+    constructor(scope: Scope, statementAst: AST.DropStmt);
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+}
+//# sourceMappingURL=drop-table-node.d.ts.map

package/dist/src/planner/nodes/drop-table-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"drop-table-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/drop-table-node.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,KAAK,KAAK,GAAG,MAAM,qBAAqB,CAAC;AAGhD;;GAEG;AACH,qBAAa,aAAc,SAAQ,QAAQ;aAKvB,YAAY,EAAE,GAAG,CAAC,QAAQ;IAJ5C,SAAkB,QAAQ,0BAA0B;gBAGlD,KAAK,EAAE,KAAK,EACI,YAAY,EAAE,GAAG,CAAC,QAAQ;IAKnC,QAAQ,IAAI,MAAM;IAIlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAOzD"}

package/dist/src/planner/nodes/drop-table-node.js

@@ -0,0 +1,25 @@
+import { VoidNode } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+import { expressionToString } from '../../util/ast-stringify.js';
+/**
+ * Represents a DROP TABLE statement in the logical query plan.
+ */
+export class DropTableNode extends VoidNode {
+    statementAst;
+    nodeType = PlanNodeType.DropTable;
+    constructor(scope, statementAst) {
+        super(scope);
+        this.statementAst = statementAst;
+    }
+    toString() {
+        return `DROP TABLE ${this.statementAst.name.name}`;
+    }
+    getLogicalAttributes() {
+        return {
+            table: this.statementAst.name.name,
+            schema: this.statementAst.name.schema,
+            statement: expressionToString(this.statementAst)
+        };
+    }
+}
+//# sourceMappingURL=drop-table-node.js.map

package/dist/src/planner/nodes/drop-table-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"drop-table-node.js","sourceRoot":"","sources":["../../../../src/planner/nodes/drop-table-node.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAEjE;;GAEG;AACH,MAAM,OAAO,aAAc,SAAQ,QAAQ;IAKvB;IAJA,QAAQ,GAAG,YAAY,CAAC,SAAS,CAAC;IAEpD,YACE,KAAY,EACI,YAA0B;QAE1C,KAAK,CAAC,KAAK,CAAC,CAAC;QAFG,iBAAY,GAAZ,YAAY,CAAc;IAG5C,CAAC;IAEQ,QAAQ;QACf,OAAO,cAAc,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IACrD,CAAC;IAEQ,oBAAoB;QAC3B,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI;YAClC,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM;YACrC,SAAS,EAAE,kBAAkB,CAAC,IAAI,CAAC,YAAmB,CAAC;SACxD,CAAC;IACJ,CAAC;CACF"}

package/dist/src/planner/nodes/drop-view-node.d.ts

@@ -0,0 +1,17 @@
+import { VoidNode } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+import type { Scope } from '../scopes/scope.js';
+/**
+ * Plan node for DROP VIEW statements.
+ * Removes a view definition from the schema.
+ */
+export declare class DropViewNode extends VoidNode {
+    readonly viewName: string;
+    readonly schemaName: string;
+    readonly ifExists: boolean;
+    readonly nodeType = PlanNodeType.DropView;
+    constructor(scope: Scope, viewName: string, schemaName: string, ifExists: boolean);
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+}
+//# sourceMappingURL=drop-view-node.d.ts.map

package/dist/src/planner/nodes/drop-view-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"drop-view-node.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/drop-view-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAEhD;;;GAGG;AACH,qBAAa,YAAa,SAAQ,QAAQ;aAKxB,QAAQ,EAAE,MAAM;aAChB,UAAU,EAAE,MAAM;aAClB,QAAQ,EAAE,OAAO;IANlC,QAAQ,CAAC,QAAQ,yBAAyB;gBAGzC,KAAK,EAAE,KAAK,EACI,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,OAAO;IAKzB,QAAQ,IAAI,MAAM;IAKlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAOxD"}

package/dist/src/planner/nodes/drop-view-node.js

@@ -0,0 +1,30 @@
+import { VoidNode } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+/**
+ * Plan node for DROP VIEW statements.
+ * Removes a view definition from the schema.
+ */
+export class DropViewNode extends VoidNode {
+    viewName;
+    schemaName;
+    ifExists;
+    nodeType = PlanNodeType.DropView;
+    constructor(scope, viewName, schemaName, ifExists) {
+        super(scope, 1); // Low cost for DDL operations
+        this.viewName = viewName;
+        this.schemaName = schemaName;
+        this.ifExists = ifExists;
+    }
+    toString() {
+        const ifExistsClause = this.ifExists ? 'IF EXISTS ' : '';
+        return `DROP VIEW ${ifExistsClause}${this.schemaName}.${this.viewName}`;
+    }
+    getLogicalAttributes() {
+        return {
+            viewName: this.viewName,
+            schemaName: this.schemaName,
+            ifExists: this.ifExists
+        };
+    }
+}
+//# sourceMappingURL=drop-view-node.js.map

package/dist/src/planner/nodes/drop-view-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"drop-view-node.js","sourceRoot":"","sources":["../../../../src/planner/nodes/drop-view-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAGnD;;;GAGG;AACH,MAAM,OAAO,YAAa,SAAQ,QAAQ;IAKxB;IACA;IACA;IANR,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC;IAE1C,YACC,KAAY,EACI,QAAgB,EAChB,UAAkB,EAClB,QAAiB;QAEjC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,8BAA8B;QAJ/B,aAAQ,GAAR,QAAQ,CAAQ;QAChB,eAAU,GAAV,UAAU,CAAQ;QAClB,aAAQ,GAAR,QAAQ,CAAS;IAGlC,CAAC;IAEQ,QAAQ;QAChB,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QACzD,OAAO,aAAa,cAAc,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;IACzE,CAAC;IAEQ,oBAAoB;QAC5B,OAAO;YACN,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACvB,CAAC;IACH,CAAC;CACD"}

package/dist/src/planner/nodes/filter.d.ts

@@ -0,0 +1,24 @@
+import { PlanNodeType } from './plan-node-type.js';
+import { PlanNode, type RelationalPlanNode, type ScalarPlanNode, type UnaryRelationalNode, type Attribute } from './plan-node.js';
+import type { RelationType } from '../../common/datatype.js';
+import type { Scope } from '../scopes/scope.js';
+/**
+ * Represents a filter operation (WHERE clause).
+ * It takes an input relation and a predicate expression,
+ * and outputs rows for which the predicate is true.
+ */
+export declare class FilterNode extends PlanNode implements UnaryRelationalNode {
+    readonly source: RelationalPlanNode;
+    readonly predicate: ScalarPlanNode;
+    readonly nodeType = PlanNodeType.Filter;
+    constructor(scope: Scope, source: RelationalPlanNode, predicate: ScalarPlanNode, estimatedCostOverride?: number);
+    getType(): RelationType;
+    getAttributes(): Attribute[];
+    getChildren(): readonly [RelationalPlanNode, ScalarPlanNode];
+    getRelations(): readonly [RelationalPlanNode];
+    get estimatedRows(): number | undefined;
+    toString(): string;
+    getLogicalAttributes(): Record<string, unknown>;
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+}
+//# sourceMappingURL=filter.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"filter.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/filter.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,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAClI,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAKhD;;;;GAIG;AACH,qBAAa,UAAW,SAAQ,QAAS,YAAW,mBAAmB;aAKrD,MAAM,EAAE,kBAAkB;aAC1B,SAAS,EAAE,cAAc;IAL1C,SAAkB,QAAQ,uBAAuB;gBAGhD,KAAK,EAAE,KAAK,EACI,MAAM,EAAE,kBAAkB,EAC1B,SAAS,EAAE,cAAc,EACzC,qBAAqB,CAAC,EAAE,MAAM;IAM/B,OAAO,IAAI,YAAY;IAKvB,aAAa,IAAI,SAAS,EAAE;IAK5B,WAAW,IAAI,SAAS,CAAC,kBAAkB,EAAE,cAAc,CAAC;IAI5D,YAAY,IAAI,SAAS,CAAC,kBAAkB,CAAC;IAI7C,IAAI,aAAa,IAAI,MAAM,GAAG,SAAS,CAOtC;IAEQ,QAAQ,IAAI,MAAM;IAIlB,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAMxD,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;CA2BxD"}

package/dist/src/planner/nodes/filter.js

@@ -0,0 +1,72 @@
+import { PlanNodeType } from './plan-node-type.js';
+import { PlanNode } from './plan-node.js';
+import { formatExpression } from '../../util/plan-formatter.js';
+import { quereusError } from '../../common/errors.js';
+import { StatusCode } from '../../common/types.js';
+/**
+ * Represents a filter operation (WHERE clause).
+ * It takes an input relation and a predicate expression,
+ * and outputs rows for which the predicate is true.
+ */
+export class FilterNode extends PlanNode {
+    source;
+    predicate;
+    nodeType = PlanNodeType.Filter;
+    constructor(scope, source, predicate, estimatedCostOverride) {
+        // Cost: cost of source + cost of evaluating predicate for each source row
+        super(scope, estimatedCostOverride ?? (source.getTotalCost() + (source.estimatedRows ?? 1) * predicate.getTotalCost()));
+        this.source = source;
+        this.predicate = predicate;
+    }
+    getType() {
+        // Filter preserves the type of the source relation
+        return this.source.getType();
+    }
+    getAttributes() {
+        // Filter preserves the same attributes as its source
+        return this.source.getAttributes();
+    }
+    getChildren() {
+        return [this.source, this.predicate];
+    }
+    getRelations() {
+        return [this.source];
+    }
+    get estimatedRows() {
+        // This is a rough estimate. A more sophisticated planner would use selectivity estimates.
+        // For now, assume a selectivity of 0.5 if source has rows, otherwise 0.
+        // TODO: Use selectivity estimates
+        const sourceRows = this.source.estimatedRows;
+        if (sourceRows === undefined)
+            return undefined;
+        return sourceRows > 0 ? Math.max(1, Math.floor(sourceRows * 0.5)) : 0;
+    }
+    toString() {
+        return `WHERE ${formatExpression(this.predicate)}`;
+    }
+    getLogicalAttributes() {
+        return {
+            predicate: formatExpression(this.predicate)
+        };
+    }
+    withChildren(newChildren) {
+        if (newChildren.length !== 2) {
+            quereusError(`FilterNode expects 2 children, got ${newChildren.length}`, StatusCode.INTERNAL);
+        }
+        const [newSource, newPredicate] = newChildren;
+        // Type check
+        if (!('getAttributes' in newSource) || typeof newSource.getAttributes !== 'function') {
+            quereusError('FilterNode: first child must be a RelationalPlanNode', StatusCode.INTERNAL);
+        }
+        if (!('expression' in newPredicate)) {
+            quereusError('FilterNode: second child must be a ScalarPlanNode', StatusCode.INTERNAL);
+        }
+        // Return same instance if nothing changed
+        if (newSource === this.source && newPredicate === this.predicate) {
+            return this;
+        }
+        // Create new instance preserving attributes (filter preserves source attributes)
+        return new FilterNode(this.scope, newSource, newPredicate);
+    }
+}
+//# sourceMappingURL=filter.js.map

package/dist/src/planner/nodes/filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter.js","sourceRoot":"","sources":["../../../../src/planner/nodes/filter.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAA0F,MAAM,gBAAgB,CAAC;AAGlI,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAEnD;;;;GAIG;AACH,MAAM,OAAO,UAAW,SAAQ,QAAQ;IAKtB;IACA;IALC,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC;IAEjD,YACC,KAAY,EACI,MAA0B,EAC1B,SAAyB,EACzC,qBAA8B;QAE9B,0EAA0E;QAC1E,KAAK,CAAC,KAAK,EAAE,qBAAqB,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,aAAa,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;QALxG,WAAM,GAAN,MAAM,CAAoB;QAC1B,cAAS,GAAT,SAAS,CAAgB;IAK1C,CAAC;IAED,OAAO;QACN,mDAAmD;QACnD,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAED,aAAa;QACZ,qDAAqD;QACrD,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;IACpC,CAAC;IAED,WAAW;QACV,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC;IAED,YAAY;QACX,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;IAED,IAAI,aAAa;QAChB,0FAA0F;QAC1F,wEAAwE;QACxE,kCAAkC;QAClC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QAC7C,IAAI,UAAU,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC/C,OAAO,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IAEQ,QAAQ;QAChB,OAAO,SAAS,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;IACpD,CAAC;IAEQ,oBAAoB;QAC5B,OAAO;YACN,SAAS,EAAE,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC;SAC3C,CAAC;IACH,CAAC;IAED,YAAY,CAAC,WAAgC;QAC5C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,YAAY,CAAC,sCAAsC,WAAW,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC/F,CAAC;QAED,MAAM,CAAC,SAAS,EAAE,YAAY,CAAC,GAAG,WAAW,CAAC;QAE9C,aAAa;QACb,IAAI,CAAC,CAAC,eAAe,IAAI,SAAS,CAAC,IAAI,OAAQ,SAAiB,CAAC,aAAa,KAAK,UAAU,EAAE,CAAC;YAC/F,YAAY,CAAC,sDAAsD,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC3F,CAAC;QACD,IAAI,CAAC,CAAC,YAAY,IAAI,YAAY,CAAC,EAAE,CAAC;YACrC,YAAY,CAAC,mDAAmD,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACxF,CAAC;QAED,0CAA0C;QAC1C,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,IAAI,YAAY,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;YAClE,OAAO,IAAI,CAAC;QACb,CAAC;QAED,iFAAiF;QACjF,OAAO,IAAI,UAAU,CACpB,IAAI,CAAC,KAAK,EACV,SAA+B,EAC/B,YAA8B,CAC9B,CAAC;IACH,CAAC;CACD"}

package/dist/src/planner/nodes/function.d.ts

@@ -0,0 +1,21 @@
+import type { ScalarType } from '../../common/datatype.js';
+import type * as AST from '../../parser/ast.js';
+import type { Scope } from '../scopes/scope.js';
+import { PlanNode, type NaryScalarNode, type ScalarPlanNode, type PhysicalProperties } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+import type { FunctionSchema } from '../../schema/function.js';
+export declare class ScalarFunctionCallNode extends PlanNode implements NaryScalarNode {
+    readonly expression: AST.FunctionExpr;
+    readonly functionSchema: FunctionSchema;
+    readonly operands: ScalarPlanNode[];
+    readonly nodeType = PlanNodeType.ScalarFunctionCall;
+    constructor(scope: Scope, expression: AST.FunctionExpr, functionSchema: FunctionSchema, operands: ScalarPlanNode[]);
+    getType(): ScalarType;
+    getChildren(): readonly ScalarPlanNode[];
+    getRelations(): readonly [];
+    withChildren(newChildren: readonly PlanNode[]): PlanNode;
+    toString(): string;
+    computePhysical(_childrenPhysical: PhysicalProperties[]): Partial<PhysicalProperties>;
+    getLogicalAttributes(): Record<string, unknown>;
+}
+//# sourceMappingURL=function.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"function.d.ts","sourceRoot":"","sources":["../../../../src/planner/nodes/function.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,KAAK,KAAK,GAAG,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,KAAK,cAAc,EAAE,KAAK,cAAc,EAAE,KAAK,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAC7G,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAG/D,qBAAa,sBAAuB,SAAQ,QAAS,YAAW,cAAc;aAK5D,UAAU,EAAE,GAAG,CAAC,YAAY;aAC5B,cAAc,EAAE,cAAc;aAC9B,QAAQ,EAAE,cAAc,EAAE;IAN3C,SAAkB,QAAQ,mCAAmC;gBAG5D,KAAK,EAAE,KAAK,EACI,UAAU,EAAE,GAAG,CAAC,YAAY,EAC5B,cAAc,EAAE,cAAc,EAC9B,QAAQ,EAAE,cAAc,EAAE;IAK3C,OAAO,IAAI,UAAU;IAIrB,WAAW,IAAI,SAAS,cAAc,EAAE;IAIxC,YAAY,IAAI,SAAS,EAAE;IAI3B,YAAY,CAAC,WAAW,EAAE,SAAS,QAAQ,EAAE,GAAG,QAAQ;IA2B/C,QAAQ,IAAI,MAAM;IAIlB,eAAe,CAAC,iBAAiB,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAqBrF,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAOxD"}

package/dist/src/planner/nodes/function.js

@@ -0,0 +1,70 @@
+import { PlanNode } from './plan-node.js';
+import { PlanNodeType } from './plan-node-type.js';
+import { formatExpressionList, formatScalarType } from '../../util/plan-formatter.js';
+import { FunctionFlags } from '../../common/constants.js';
+export class ScalarFunctionCallNode extends PlanNode {
+    expression;
+    functionSchema;
+    operands;
+    nodeType = PlanNodeType.ScalarFunctionCall;
+    constructor(scope, expression, functionSchema, operands) {
+        super(scope);
+        this.expression = expression;
+        this.functionSchema = functionSchema;
+        this.operands = operands;
+    }
+    getType() {
+        return this.functionSchema.returnType;
+    }
+    getChildren() {
+        return this.operands;
+    }
+    getRelations() {
+        return [];
+    }
+    withChildren(newChildren) {
+        if (newChildren.length !== this.operands.length) {
+            throw new Error(`ScalarFunctionCallNode expects ${this.operands.length} children, got ${newChildren.length}`);
+        }
+        // Type check
+        for (const child of newChildren) {
+            if (!('expression' in child)) {
+                throw new Error('ScalarFunctionCallNode: all children must be ScalarPlanNodes');
+            }
+        }
+        // Check if anything changed
+        const childrenChanged = newChildren.some((child, i) => child !== this.operands[i]);
+        if (!childrenChanged) {
+            return this;
+        }
+        // Create new instance
+        return new ScalarFunctionCallNode(this.scope, this.expression, this.functionSchema, newChildren);
+    }
+    toString() {
+        return `${this.expression.name}(${formatExpressionList(this.operands)})`;
+    }
+    computePhysical(_childrenPhysical) {
+        // Function calls derive properties from their arguments and the function itself
+        const result = {};
+        // Use function schema to determine deterministic and readonly properties
+        const functionIsDeterministic = (this.functionSchema.flags & FunctionFlags.DETERMINISTIC) !== 0;
+        const functionIsReadonly = this.functionSchema.returnType.isReadOnly ?? true;
+        // Function is deterministic only if both function and all arguments are deterministic
+        if (!functionIsDeterministic) {
+            result.deterministic = false;
+        }
+        // Function is readonly only if both function and all arguments are readonly
+        if (!functionIsReadonly) {
+            result.readonly = false;
+        }
+        return result;
+    }
+    getLogicalAttributes() {
+        return {
+            function: this.expression.name,
+            arguments: this.operands.map(op => op.toString()),
+            resultType: formatScalarType(this.functionSchema.returnType)
+        };
+    }
+}
+//# sourceMappingURL=function.js.map