@quereus/quereus 0.17.1 → 1.0.0

package/dist/src/planner/rules/cache/rule-scalar-cse.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Rule: Scalar Common Subexpression Elimination (CSE)
+ *
+ * Detects duplicate scalar expression computations across a ProjectNode and
+ * its immediate relational child chain (Filter, Sort), then injects a
+ * lower ProjectNode that computes each deduplicated expression once.
+ *
+ * Guards:
+ * - Only deduplicate deterministic expressions
+ * - Skip bare column references and literals (cost 0, cheap to recompute)
+ * - Require at least 2 occurrences of the same fingerprint
+ *
+ * Pass: Structural (top-down), priority 22
+ * Node type: PlanNodeType.Project
+ */
+import type { PlanNode } from '../../nodes/plan-node.js';
+import type { OptContext } from '../../framework/context.js';
+export declare function ruleScalarCSE(node: PlanNode, _context: OptContext): PlanNode | null;
+//# sourceMappingURL=rule-scalar-cse.d.ts.map

package/dist/src/planner/rules/cache/rule-scalar-cse.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-scalar-cse.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/cache/rule-scalar-cse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAiD,MAAM,0BAA0B,CAAC;AAExG,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AA0F7D,wBAAgB,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAkOnF"}

package/dist/src/planner/rules/cache/rule-scalar-cse.js

@@ -0,0 +1,245 @@
+/**
+ * Rule: Scalar Common Subexpression Elimination (CSE)
+ *
+ * Detects duplicate scalar expression computations across a ProjectNode and
+ * its immediate relational child chain (Filter, Sort), then injects a
+ * lower ProjectNode that computes each deduplicated expression once.
+ *
+ * Guards:
+ * - Only deduplicate deterministic expressions
+ * - Skip bare column references and literals (cost 0, cheap to recompute)
+ * - Require at least 2 occurrences of the same fingerprint
+ *
+ * Pass: Structural (top-down), priority 22
+ * Node type: PlanNodeType.Project
+ */
+import { createLogger } from '../../../common/logger.js';
+import { PlanNode as PlanNodeClass } from '../../nodes/plan-node.js';
+import { PlanNodeType } from '../../nodes/plan-node-type.js';
+import { ProjectNode } from '../../nodes/project-node.js';
+import { FilterNode } from '../../nodes/filter.js';
+import { SortNode } from '../../nodes/sort.js';
+import { ColumnReferenceNode } from '../../nodes/reference.js';
+import { fingerprintExpression } from '../../analysis/expression-fingerprint.js';
+const log = createLogger('optimizer:rule:scalar-cse');
+/**
+ * Recursively collect all scalar subexpression locations from a scalar expression tree.
+ * Each subexpression that is non-trivial and deterministic gets its own location entry.
+ */
+function collectSubexpressions(root, owner, index, out) {
+    // Skip column references and literals - they're trivially cheap
+    if (root.nodeType === PlanNodeType.ColumnReference || root.nodeType === PlanNodeType.Literal) {
+        return;
+    }
+    // Skip non-deterministic expressions
+    if (root.physical.deterministic === false) {
+        return;
+    }
+    // Skip parameter references - cheap to evaluate
+    if (root.nodeType === PlanNodeType.ParameterReference) {
+        return;
+    }
+    out.push({ owner, index, node: root });
+    // Recurse into children (scalar children only)
+    for (const child of root.getChildren()) {
+        if (child.getType().typeClass === 'scalar') {
+            collectSubexpressions(child, owner, index, out);
+        }
+    }
+}
+/**
+ * Collect the relational child chain under a ProjectNode.
+ * Returns [filter?, sort?, bottomSource] where filter/sort are optional
+ * intermediate nodes and bottomSource is the first non-Filter/non-Sort child.
+ */
+function collectChain(project) {
+    let current = project.source;
+    let filter = null;
+    let sort = null;
+    // Walk at most two levels: Filter then Sort, or Sort then Filter
+    for (let i = 0; i < 2; i++) {
+        if (!filter && current instanceof FilterNode) {
+            filter = current;
+            current = current.source;
+        }
+        else if (!sort && current instanceof SortNode) {
+            sort = current;
+            current = current.source;
+        }
+        else {
+            break;
+        }
+    }
+    return { filter, sort, bottomSource: current };
+}
+export function ruleScalarCSE(node, _context) {
+    if (node.nodeType !== PlanNodeType.Project) {
+        return null;
+    }
+    const project = node;
+    const { filter, sort, bottomSource } = collectChain(project);
+    // Collect all subexpressions from the chain
+    const allLocations = [];
+    // Collect from projections
+    for (let i = 0; i < project.projections.length; i++) {
+        collectSubexpressions(project.projections[i].node, 'project', i, allLocations);
+    }
+    // Collect from filter predicate
+    if (filter) {
+        collectSubexpressions(filter.predicate, 'filter', 0, allLocations);
+    }
+    // Collect from sort keys
+    if (sort) {
+        for (let i = 0; i < sort.sortKeys.length; i++) {
+            collectSubexpressions(sort.sortKeys[i].expression, 'sort', i, allLocations);
+        }
+    }
+    if (allLocations.length === 0) {
+        return null;
+    }
+    // Group by fingerprint
+    const groups = new Map();
+    for (const loc of allLocations) {
+        const fp = fingerprintExpression(loc.node);
+        let group = groups.get(fp);
+        if (!group) {
+            group = [];
+            groups.set(fp, group);
+        }
+        group.push(loc);
+    }
+    // Find groups with duplicates (2+ locations with distinct node identities)
+    const duplicateGroups = [];
+    for (const [fingerprint, locations] of groups) {
+        // Deduplicate by node identity - same node object appearing in multiple positions
+        // counts as one, we need at least 2 distinct node instances
+        const uniqueNodes = new Set(locations.map(l => l.node));
+        if (uniqueNodes.size >= 2) {
+            duplicateGroups.push({ fingerprint, locations });
+        }
+    }
+    if (duplicateGroups.length === 0) {
+        return null;
+    }
+    log('Found %d duplicate expression groups in Project chain', duplicateGroups.length);
+    // For each duplicate group, pick the canonical instance and create a computed column
+    const injectedProjections = [];
+    const injectedAttributes = [];
+    // Map from canonical node id to the new attribute/column ref info
+    const replacements = new Map();
+    // We'll build the injected projections: passthrough of bottomSource + computed columns
+    // First, collect passthrough from the bottomSource
+    const bottomAttrs = bottomSource.getAttributes();
+    // Index for the new columns starts after passthrough columns
+    let nextColIndex = bottomAttrs.length;
+    for (const group of duplicateGroups) {
+        const canonical = group.locations[0].node;
+        const attrId = PlanNodeClass.nextAttrId();
+        const alias = `$cse_${attrId}`;
+        const colRefExpr = {
+            type: 'column',
+            name: alias,
+        };
+        const colRef = new ColumnReferenceNode(project.scope, colRefExpr, canonical.getType(), attrId, nextColIndex);
+        injectedProjections.push({
+            node: canonical,
+            alias,
+            attributeId: attrId,
+        });
+        injectedAttributes.push({
+            id: attrId,
+            name: alias,
+            type: canonical.getType(),
+            sourceRelation: 'cse',
+            relationName: 'cse',
+        });
+        replacements.set(group.fingerprint, { attrId, colRef, canonical });
+        nextColIndex++;
+    }
+    // Build the passthrough projections for the injected ProjectNode
+    const passthroughProjections = bottomAttrs.map((attr, i) => {
+        const colRefExpr = {
+            type: 'column',
+            name: attr.name,
+        };
+        const colRef = new ColumnReferenceNode(project.scope, colRefExpr, attr.type, attr.id, i);
+        return {
+            node: colRef,
+            alias: attr.name,
+            attributeId: attr.id,
+        };
+    });
+    // Combine passthrough + computed projections
+    const allInjectedProjections = [...passthroughProjections, ...injectedProjections];
+    // Build predefined attributes for the injected ProjectNode
+    const predefinedAttributes = [
+        ...bottomAttrs.map(a => ({ ...a })),
+        ...injectedAttributes,
+    ];
+    // Create the injected ProjectNode
+    const injectedProject = new ProjectNode(project.scope, bottomSource, allInjectedProjections, undefined, predefinedAttributes, true // preserveInputColumns
+    );
+    // Now replace all duplicate occurrences in the outer nodes with ColumnReferenceNodes
+    // We need to rebuild: project projections, filter predicate, sort keys
+    // Helper: replace all occurrences of any duplicate group's nodes with colRefs
+    function replaceAllDuplicates(expr) {
+        // Check if this exact expression matches a fingerprint group
+        if (expr.nodeType !== PlanNodeType.ColumnReference &&
+            expr.nodeType !== PlanNodeType.Literal &&
+            expr.nodeType !== PlanNodeType.ParameterReference &&
+            expr.physical.deterministic !== false) {
+            const fp = fingerprintExpression(expr);
+            const rep = replacements.get(fp);
+            if (rep) {
+                return rep.colRef;
+            }
+        }
+        // Recurse into children
+        const children = expr.getChildren();
+        if (children.length === 0)
+            return expr;
+        const newChildren = [];
+        let changed = false;
+        for (const child of children) {
+            if (child.getType().typeClass === 'scalar') {
+                const replaced = replaceAllDuplicates(child);
+                newChildren.push(replaced);
+                if (replaced !== child)
+                    changed = true;
+            }
+            else {
+                newChildren.push(child);
+            }
+        }
+        if (!changed)
+            return expr;
+        return expr.withChildren(newChildren);
+    }
+    // Rebuild sort (innermost in the outer chain, sits on injectedProject)
+    let newSortOrSource = injectedProject;
+    if (sort) {
+        const newSortKeys = sort.sortKeys.map(key => ({
+            expression: replaceAllDuplicates(key.expression),
+            direction: key.direction,
+            nulls: key.nulls,
+        }));
+        newSortOrSource = new SortNode(sort.scope, injectedProject, newSortKeys);
+    }
+    // Rebuild filter
+    let newFilterOrSource = newSortOrSource;
+    if (filter) {
+        const newPredicate = replaceAllDuplicates(filter.predicate);
+        newFilterOrSource = new FilterNode(filter.scope, newSortOrSource, newPredicate);
+    }
+    // Rebuild the outer project
+    const origAttributes = project.getAttributes();
+    const newProjections = project.projections.map((proj, i) => ({
+        node: replaceAllDuplicates(proj.node),
+        alias: proj.alias,
+        attributeId: origAttributes[i].id,
+    }));
+    const newProject = new ProjectNode(project.scope, newFilterOrSource, newProjections, undefined, origAttributes, project.preserveInputColumns);
+    log('Injected CSE ProjectNode with %d computed columns', injectedProjections.length);
+    return newProject;
+}
+//# sourceMappingURL=rule-scalar-cse.js.map

package/dist/src/planner/rules/cache/rule-scalar-cse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-scalar-cse.js","sourceRoot":"","sources":["../../../../../src/planner/rules/cache/rule-scalar-cse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,OAAO,EAAE,QAAQ,IAAI,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAErE,OAAO,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAC7D,OAAO,EAAE,WAAW,EAAmB,MAAM,6BAA6B,CAAC;AAC3E,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAgB,MAAM,qBAAqB,CAAC;AAC7D,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,qBAAqB,EAAE,MAAM,0CAA0C,CAAC;AAGjF,MAAM,GAAG,GAAG,YAAY,CAAC,2BAA2B,CAAC,CAAC;AAkBtD;;;GAGG;AACH,SAAS,qBAAqB,CAC7B,IAAoB,EACpB,KAA4B,EAC5B,KAAa,EACb,GAAmB;IAEnB,gEAAgE;IAChE,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,eAAe,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,OAAO,EAAE,CAAC;QAC9F,OAAO;IACR,CAAC;IACD,qCAAqC;IACrC,IAAI,IAAI,CAAC,QAAQ,CAAC,aAAa,KAAK,KAAK,EAAE,CAAC;QAC3C,OAAO;IACR,CAAC;IACD,gDAAgD;IAChD,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,kBAAkB,EAAE,CAAC;QACvD,OAAO;IACR,CAAC;IAED,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAEvC,+CAA+C;IAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACxC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;YAC5C,qBAAqB,CAAC,KAAuB,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QACnE,CAAC;IACF,CAAC;AACF,CAAC;AAED;;;;GAIG;AACH,SAAS,YAAY,CAAC,OAAoB;IAKzC,IAAI,OAAO,GAAuB,OAAO,CAAC,MAAM,CAAC;IACjD,IAAI,MAAM,GAAsB,IAAI,CAAC;IACrC,IAAI,IAAI,GAAoB,IAAI,CAAC;IAEjC,iEAAiE;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,CAAC,MAAM,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;YAC9C,MAAM,GAAG,OAAO,CAAC;YACjB,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;QAC1B,CAAC;aAAM,IAAI,CAAC,IAAI,IAAI,OAAO,YAAY,QAAQ,EAAE,CAAC;YACjD,IAAI,GAAG,OAAO,CAAC;YACf,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;QAC1B,CAAC;aAAM,CAAC;YACP,MAAM;QACP,CAAC;IACF,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,IAAc,EAAE,QAAoB;IACjE,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,OAAO,EAAE,CAAC;QAC5C,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,OAAO,GAAG,IAAmB,CAAC;IACpC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IAE7D,4CAA4C;IAC5C,MAAM,YAAY,GAAmB,EAAE,CAAC;IAExC,2BAA2B;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrD,qBAAqB,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IAChF,CAAC;IAED,gCAAgC;IAChC,IAAI,MAAM,EAAE,CAAC;QACZ,qBAAqB,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;IACpE,CAAC;IAED,yBAAyB;IACzB,IAAI,IAAI,EAAE,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;QAC7E,CAAC;IACF,CAAC;IAED,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC;IACb,CAAC;IAED,uBAAuB;IACvB,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IACjD,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAChC,MAAM,EAAE,GAAG,qBAAqB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,EAAE,CAAC;YACZ,KAAK,GAAG,EAAE,CAAC;YACX,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACvB,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,2EAA2E;IAC3E,MAAM,eAAe,GAAuB,EAAE,CAAC;IAC/C,KAAK,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,IAAI,MAAM,EAAE,CAAC;QAC/C,kFAAkF;QAClF,4DAA4D;QAC5D,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACxD,IAAI,WAAW,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YAC3B,eAAe,CAAC,IAAI,CAAC,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,CAAC;QAClD,CAAC;IACF,CAAC;IAED,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC;IACb,CAAC;IAED,GAAG,CAAC,uDAAuD,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC;IAErF,qFAAqF;IACrF,MAAM,mBAAmB,GAAiB,EAAE,CAAC;IAC7C,MAAM,kBAAkB,GAAgB,EAAE,CAAC;IAE3C,kEAAkE;IAClE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAsF,CAAC;IAEnH,uFAAuF;IACvF,mDAAmD;IACnD,MAAM,WAAW,GAAG,YAAY,CAAC,aAAa,EAAE,CAAC;IAEjD,6DAA6D;IAC7D,IAAI,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC;IAEtC,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC1C,MAAM,MAAM,GAAG,aAAa,CAAC,UAAU,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,QAAQ,MAAM,EAAE,CAAC;QAE/B,MAAM,UAAU,GAAmB;YAClC,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,KAAK;SACO,CAAC;QAEpB,MAAM,MAAM,GAAG,IAAI,mBAAmB,CACrC,OAAO,CAAC,KAAK,EACb,UAAU,EACV,SAAS,CAAC,OAAO,EAAE,EACnB,MAAM,EACN,YAAY,CACZ,CAAC;QAEF,mBAAmB,CAAC,IAAI,CAAC;YACxB,IAAI,EAAE,SAAS;YACf,KAAK;YACL,WAAW,EAAE,MAAM;SACnB,CAAC,CAAC;QAEH,kBAAkB,CAAC,IAAI,CAAC;YACvB,EAAE,EAAE,MAAM;YACV,IAAI,EAAE,KAAK;YACX,IAAI,EAAE,SAAS,CAAC,OAAO,EAAE;YACzB,cAAc,EAAE,KAAK;YACrB,YAAY,EAAE,KAAK;SACnB,CAAC,CAAC;QAEH,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;QACnE,YAAY,EAAE,CAAC;IAChB,CAAC;IAED,iEAAiE;IACjE,MAAM,sBAAsB,GAAiB,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QACxE,MAAM,UAAU,GAAmB;YAClC,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,IAAI,CAAC,IAAI;SACG,CAAC;QAEpB,MAAM,MAAM,GAAG,IAAI,mBAAmB,CACrC,OAAO,CAAC,KAAK,EACb,UAAU,EACV,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,EAAE,EACP,CAAC,CACD,CAAC;QAEF,OAAO;YACN,IAAI,EAAE,MAAM;YACZ,KAAK,EAAE,IAAI,CAAC,IAAI;YAChB,WAAW,EAAE,IAAI,CAAC,EAAE;SACN,CAAC;IACjB,CAAC,CAAC,CAAC;IAEH,6CAA6C;IAC7C,MAAM,sBAAsB,GAAG,CAAC,GAAG,sBAAsB,EAAE,GAAG,mBAAmB,CAAC,CAAC;IAEnF,2DAA2D;IAC3D,MAAM,oBAAoB,GAAgB;QACzC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,GAAG,kBAAkB;KACrB,CAAC;IAEF,kCAAkC;IAClC,MAAM,eAAe,GAAG,IAAI,WAAW,CACtC,OAAO,CAAC,KAAK,EACb,YAAY,EACZ,sBAAsB,EACtB,SAAS,EACT,oBAAoB,EACpB,IAAI,CAAC,uBAAuB;KAC5B,CAAC;IAEF,qFAAqF;IACrF,uEAAuE;IAEvE,8EAA8E;IAC9E,SAAS,oBAAoB,CAAC,IAAoB;QACjD,6DAA6D;QAC7D,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,eAAe;YACjD,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,OAAO;YACtC,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,kBAAkB;YACjD,IAAI,CAAC,QAAQ,CAAC,aAAa,KAAK,KAAK,EAAE,CAAC;YACxC,MAAM,EAAE,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAC;YACvC,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,GAAG,EAAE,CAAC;gBACT,OAAO,GAAG,CAAC,MAAM,CAAC;YACnB,CAAC;QACF,CAAC;QAED,wBAAwB;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACpC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEvC,MAAM,WAAW,GAAe,EAAE,CAAC;QACnC,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;gBAC5C,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAAuB,CAAC,CAAC;gBAC/D,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC3B,IAAI,QAAQ,KAAK,KAAK;oBAAE,OAAO,GAAG,IAAI,CAAC;YACxC,CAAC;iBAAM,CAAC;gBACP,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;QACF,CAAC;QAED,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAC1B,OAAO,IAAI,CAAC,YAAY,CAAC,WAAW,CAAmB,CAAC;IACzD,CAAC;IAED,uEAAuE;IACvE,IAAI,eAAe,GAAuB,eAAe,CAAC;IAC1D,IAAI,IAAI,EAAE,CAAC;QACV,MAAM,WAAW,GAAc,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACxD,UAAU,EAAE,oBAAoB,CAAC,GAAG,CAAC,UAAU,CAAC;YAChD,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,KAAK,EAAE,GAAG,CAAC,KAAK;SAChB,CAAC,CAAC,CAAC;QACJ,eAAe,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,eAAe,EAAE,WAAW,CAAC,CAAC;IAC1E,CAAC;IAED,iBAAiB;IACjB,IAAI,iBAAiB,GAAuB,eAAe,CAAC;IAC5D,IAAI,MAAM,EAAE,CAAC;QACZ,MAAM,YAAY,GAAG,oBAAoB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC5D,iBAAiB,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,KAAK,EAAE,eAAe,EAAE,YAAY,CAAC,CAAC;IACjF,CAAC;IAED,4BAA4B;IAC5B,MAAM,cAAc,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAC/C,MAAM,cAAc,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5D,IAAI,EAAE,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC;QACrC,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,WAAW,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE;KACjC,CAAC,CAAC,CAAC;IAEJ,MAAM,UAAU,GAAG,IAAI,WAAW,CACjC,OAAO,CAAC,KAAK,EACb,iBAAiB,EACjB,cAAc,EACd,SAAS,EACT,cAAc,EACd,OAAO,CAAC,oBAAoB,CAC5B,CAAC;IAEF,GAAG,CAAC,mDAAmD,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC;IACrF,OAAO,UAAU,CAAC;AACnB,CAAC"}

package/dist/src/planner/rules/predicate/rule-filter-merge.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Rule: Filter Merge
+ *
+ * Merges adjacent Filter nodes into a single Filter with an AND-combined predicate.
+ *
+ * Filter(pred_outer) → Filter(pred_inner) → source
+ * becomes:
+ * Filter(pred_outer AND pred_inner) → source
+ *
+ * Always safe: the conjunction is semantically identical.
+ */
+import type { PlanNode } from '../../nodes/plan-node.js';
+import type { OptContext } from '../../framework/context.js';
+export declare function ruleFilterMerge(node: PlanNode, _context: OptContext): PlanNode | null;
+//# sourceMappingURL=rule-filter-merge.d.ts.map

package/dist/src/planner/rules/predicate/rule-filter-merge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-filter-merge.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/predicate/rule-filter-merge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AACzD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAQ7D,wBAAgB,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAsBrF"}

package/dist/src/planner/rules/predicate/rule-filter-merge.js

@@ -0,0 +1,39 @@
+/**
+ * Rule: Filter Merge
+ *
+ * Merges adjacent Filter nodes into a single Filter with an AND-combined predicate.
+ *
+ * Filter(pred_outer) → Filter(pred_inner) → source
+ * becomes:
+ * Filter(pred_outer AND pred_inner) → source
+ *
+ * Always safe: the conjunction is semantically identical.
+ */
+import { createLogger } from '../../../common/logger.js';
+import { PlanNodeType } from '../../nodes/plan-node-type.js';
+import { FilterNode } from '../../nodes/filter.js';
+import { BinaryOpNode } from '../../nodes/scalar.js';
+const log = createLogger('optimizer:rule:filter-merge');
+export function ruleFilterMerge(node, _context) {
+    if (node.nodeType !== PlanNodeType.Filter)
+        return null;
+    let current = node;
+    if (current.source.nodeType !== PlanNodeType.Filter)
+        return null;
+    // Iteratively absorb all adjacent filters (handles triple+ stacks in one visit)
+    let predicate = current.predicate;
+    while (current.source.nodeType === PlanNodeType.Filter) {
+        const inner = current.source;
+        const ast = {
+            type: 'binary',
+            operator: 'AND',
+            left: predicate.expression,
+            right: inner.predicate.expression,
+        };
+        predicate = new BinaryOpNode(current.scope, ast, predicate, inner.predicate);
+        current = inner;
+    }
+    log('Merged adjacent filters into single AND predicate');
+    return new FilterNode(node.scope, current.source, predicate);
+}
+//# sourceMappingURL=rule-filter-merge.js.map

package/dist/src/planner/rules/predicate/rule-filter-merge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-filter-merge.js","sourceRoot":"","sources":["../../../../../src/planner/rules/predicate/rule-filter-merge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAGzD,OAAO,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAGrD,MAAM,GAAG,GAAG,YAAY,CAAC,6BAA6B,CAAC,CAAC;AAExD,MAAM,UAAU,eAAe,CAAC,IAAc,EAAE,QAAoB;IACnE,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACvD,IAAI,OAAO,GAAG,IAAkB,CAAC;IAEjC,IAAI,OAAO,CAAC,MAAM,CAAC,QAAQ,KAAK,YAAY,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEjE,gFAAgF;IAChF,IAAI,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;IAClC,OAAO,OAAO,CAAC,MAAM,CAAC,QAAQ,KAAK,YAAY,CAAC,MAAM,EAAE,CAAC;QACxD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAoB,CAAC;QAC3C,MAAM,GAAG,GAAmB;YAC3B,IAAI,EAAE,QAAQ;YACd,QAAQ,EAAE,KAAK;YACf,IAAI,EAAG,SAAiB,CAAC,UAAU;YACnC,KAAK,EAAG,KAAK,CAAC,SAAiB,CAAC,UAAU;SAC1C,CAAC;QACF,SAAS,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QAC7E,OAAO,GAAG,KAAK,CAAC;IACjB,CAAC;IAED,GAAG,CAAC,mDAAmD,CAAC,CAAC;IACzD,OAAO,IAAI,UAAU,CAAE,IAAmB,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;AAC9E,CAAC"}

package/dist/src/planner/rules/predicate/rule-predicate-pushdown.d.ts

@@ -7,6 +7,7 @@
  * Safe moves implemented now:
  * - Across Sort: always safe (ordering unaffected by selection)
  * - Across Distinct: safe for selection predicates (commute)
+ * - Across Alias: safe because AliasNode only renames relationName; attribute IDs are unchanged
  * - Across Project: only if predicate references attribute IDs available below the Project source
  *   (we verify attribute-id coverage), and we keep predicate unchanged (IDs preserved by design)
  * - Into Retrieve: wrap Retrieve.source with a Filter

package/dist/src/planner/rules/predicate/rule-predicate-pushdown.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rule-predicate-pushdown.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/predicate/rule-predicate-pushdown.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAsB,MAAM,0BAA0B,CAAC;AAE7E,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAe7D,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAc3F"}
+{"version":3,"file":"rule-predicate-pushdown.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/predicate/rule-predicate-pushdown.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAsB,MAAM,0BAA0B,CAAC;AAE7E,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAgB7D,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAc3F"}

package/dist/src/planner/rules/predicate/rule-predicate-pushdown.js

@@ -7,6 +7,7 @@
  * Safe moves implemented now:
  * - Across Sort: always safe (ordering unaffected by selection)
  * - Across Distinct: safe for selection predicates (commute)
+ * - Across Alias: safe because AliasNode only renames relationName; attribute IDs are unchanged
  * - Across Project: only if predicate references attribute IDs available below the Project source
  *   (we verify attribute-id coverage), and we keep predicate unchanged (IDs preserved by design)
  * - Into Retrieve: wrap Retrieve.source with a Filter
@@ -23,6 +24,7 @@ import { SortNode } from '../../nodes/sort.js';
 import { DistinctNode } from '../../nodes/distinct-node.js';
 import { ProjectNode } from '../../nodes/project-node.js';
 import { RetrieveNode } from '../../nodes/retrieve-node.js';
+import { AliasNode } from '../../nodes/alias-node.js';
 import { CapabilityDetectors } from '../../framework/characteristics.js';
 import { normalizePredicate } from '../../analysis/predicate-normalizer.js';
 import { collectBindingsInExpr } from '../../analysis/binding-collector.js';
@@ -65,6 +67,13 @@ function tryPushDown(child, predicate, scope) {
         }
         return new FilterNode(scope, updatedRetrieve, extraction.residualPredicate);
     }
+    // Across AliasNode (view boundary)
+    if (child instanceof AliasNode) {
+        log('Pushing predicate below AliasNode');
+        const under = child.source;
+        const newUnder = new FilterNode(under.scope, under, predicate);
+        return new AliasNode(child.scope, newUnder, child.alias);
+    }
     // Across Sort
     if (child instanceof SortNode) {
         log('Pushing predicate below Sort');

package/dist/src/planner/rules/predicate/rule-predicate-pushdown.js.map

@@ -1 +1 @@
-{"version":3,"file":"rule-predicate-pushdown.js","sourceRoot":"","sources":["../../../../../src/planner/rules/predicate/rule-predicate-pushdown.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAE5D,OAAO,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,MAAM,oCAAoC,CAAC;AAEzE,OAAO,EAAE,kBAAkB,EAAE,MAAM,wCAAwC,CAAC;AAC5E,OAAO,EAAE,qBAAqB,EAAE,MAAM,qCAAqC,CAAC;AAC5E,OAAO,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,MAAM,wCAAwC,CAAC;AAErG,MAAM,GAAG,GAAG,YAAY,CAAC,mCAAmC,CAAC,CAAC;AAE9D,MAAM,UAAU,qBAAqB,CAAC,IAAc,EAAE,QAAoB;IACzE,2BAA2B;IAC3B,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEvD,MAAM,MAAM,GAAG,IAAkB,CAAC;IACjC,MAAM,UAAU,GAAG,kBAAkB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAEzD,wCAAwC;IACxC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC;IAElD,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;IACpE,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEzB,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAAC,KAAyB,EAAE,SAAyB,EAAE,KAAU;IACnF,+EAA+E;IAChF,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;QACjC,GAAG,CAAC,2DAA2D,CAAC,CAAC;QACjE,MAAM,SAAS,GAAG,uBAAuB,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;QAChG,MAAM,UAAU,GAAG,kBAAkB,CAAC,SAAS,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9D,MAAM,SAAS,GAAG,UAAU,CAAC,yBAAyB,EAAE,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAEnF,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,GAAG,CAAC,qDAAqD,CAAC,CAAC;YAC3D,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC7E,MAAM,WAAW,GAAG;YAClB,GAAG,CAAC,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC;YACzB,GAAG,qBAAqB,CAAC,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC;SACpD,CAAC;QACF,MAAM,eAAe,GAAG,KAAK,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAEnF,qGAAqG;QACrG,IAAI,CAAC,UAAU,CAAC,iBAAiB,EAAE,CAAC;YAClC,OAAO,eAAe,CAAC;QACzB,CAAC;QACD,OAAO,IAAI,UAAU,CAAC,KAAK,EAAE,eAAgD,EAAE,UAAU,CAAC,iBAAiB,CAAC,CAAC;IAChH,CAAC;IAED,cAAc;IACd,IAAI,KAAK,YAAY,QAAQ,EAAE,CAAC;QAC/B,GAAG,CAAC,8BAA8B,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;QAC3B,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC/D,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC5D,CAAC;IAED,kBAAkB;IAClB,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;QACnC,GAAG,CAAC,kCAAkC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;QAC3B,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC/D,OAAO,IAAI,YAAY,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAED,0BAA0B;IAC1B,IAAI,KAAK,YAAY,WAAW,EAAE,CAAC;QAClC,IAAI,oBAAoB,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;YAC5C,GAAG,CAAC,4CAA4C,CAAC,CAAC;YAClD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;YAC3B,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC/D,iEAAiE;YACjE,OAAO,IAAI,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,oBAAoB,CAAC,CAAC;QACpH,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,0CAA0C;IAC1C,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,oBAAoB,CAAC,OAAoB,EAAE,SAAyB;IAC5E,mGAAmG;IACnG,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7E,MAAM,UAAU,GAAG,6BAA6B,CAAC,SAAS,CAAC,CAAC;IAC5D,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC7B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;IAC1C,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,6BAA6B,CAAC,IAAoB;IAC1D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE;QACrB,IAAI,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YACjD,GAAG,CAAC,GAAG,CAAE,IAAY,CAAC,WAAqB,CAAC,CAAC;QAC9C,CAAC;IACF,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,SAAS,QAAQ,CAAC,IAAoB,EAAE,EAA+B;IACtE,EAAE,CAAC,IAAI,CAAC,CAAC;IACT,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACpC,uBAAuB;QACvB,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1B,8DAA8D;YAC9D,QAAQ,CAAC,CAA0B,EAAE,EAAE,CAAC,CAAC;QAC1C,CAAC;IACF,CAAC;AACF,CAAC"}
+{"version":3,"file":"rule-predicate-pushdown.js","sourceRoot":"","sources":["../../../../../src/planner/rules/predicate/rule-predicate-pushdown.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAE5D,OAAO,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AACtD,OAAO,EAAE,mBAAmB,EAAE,MAAM,oCAAoC,CAAC;AAEzE,OAAO,EAAE,kBAAkB,EAAE,MAAM,wCAAwC,CAAC;AAC5E,OAAO,EAAE,qBAAqB,EAAE,MAAM,qCAAqC,CAAC;AAC5E,OAAO,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,MAAM,wCAAwC,CAAC;AAErG,MAAM,GAAG,GAAG,YAAY,CAAC,mCAAmC,CAAC,CAAC;AAE9D,MAAM,UAAU,qBAAqB,CAAC,IAAc,EAAE,QAAoB;IACzE,2BAA2B;IAC3B,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEvD,MAAM,MAAM,GAAG,IAAkB,CAAC;IACjC,MAAM,UAAU,GAAG,kBAAkB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAEzD,wCAAwC;IACxC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC;IAElD,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;IACpE,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEzB,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAAC,KAAyB,EAAE,SAAyB,EAAE,KAAU;IACnF,+EAA+E;IAChF,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;QACjC,GAAG,CAAC,2DAA2D,CAAC,CAAC;QACjE,MAAM,SAAS,GAAG,uBAAuB,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;QAChG,MAAM,UAAU,GAAG,kBAAkB,CAAC,SAAS,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9D,MAAM,SAAS,GAAG,UAAU,CAAC,yBAAyB,EAAE,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAEnF,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,GAAG,CAAC,qDAAqD,CAAC,CAAC;YAC3D,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC7E,MAAM,WAAW,GAAG;YAClB,GAAG,CAAC,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC;YACzB,GAAG,qBAAqB,CAAC,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC;SACpD,CAAC;QACF,MAAM,eAAe,GAAG,KAAK,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAEnF,qGAAqG;QACrG,IAAI,CAAC,UAAU,CAAC,iBAAiB,EAAE,CAAC;YAClC,OAAO,eAAe,CAAC;QACzB,CAAC;QACD,OAAO,IAAI,UAAU,CAAC,KAAK,EAAE,eAAgD,EAAE,UAAU,CAAC,iBAAiB,CAAC,CAAC;IAChH,CAAC;IAED,mCAAmC;IACnC,IAAI,KAAK,YAAY,SAAS,EAAE,CAAC;QAChC,GAAG,CAAC,mCAAmC,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;QAC3B,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC/D,OAAO,IAAI,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC;IAED,cAAc;IACd,IAAI,KAAK,YAAY,QAAQ,EAAE,CAAC;QAC/B,GAAG,CAAC,8BAA8B,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;QAC3B,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC/D,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC5D,CAAC;IAED,kBAAkB;IAClB,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;QACnC,GAAG,CAAC,kCAAkC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;QAC3B,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC/D,OAAO,IAAI,YAAY,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAChD,CAAC;IAED,0BAA0B;IAC1B,IAAI,KAAK,YAAY,WAAW,EAAE,CAAC;QAClC,IAAI,oBAAoB,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;YAC5C,GAAG,CAAC,4CAA4C,CAAC,CAAC;YAClD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;YAC3B,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC/D,iEAAiE;YACjE,OAAO,IAAI,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,oBAAoB,CAAC,CAAC;QACpH,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,0CAA0C;IAC1C,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,oBAAoB,CAAC,OAAoB,EAAE,SAAyB;IAC5E,mGAAmG;IACnG,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7E,MAAM,UAAU,GAAG,6BAA6B,CAAC,SAAS,CAAC,CAAC;IAC5D,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC7B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;IAC1C,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,6BAA6B,CAAC,IAAoB;IAC1D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE;QACrB,IAAI,mBAAmB,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YACjD,GAAG,CAAC,GAAG,CAAE,IAAY,CAAC,WAAqB,CAAC,CAAC;QAC9C,CAAC;IACF,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,SAAS,QAAQ,CAAC,IAAoB,EAAE,EAA+B;IACtE,EAAE,CAAC,IAAI,CAAC,CAAC;IACT,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACpC,uBAAuB;QACvB,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1B,8DAA8D;YAC9D,QAAQ,CAAC,CAA0B,EAAE,EAAE,CAAC,CAAC;QAC1C,CAAC;IACF,CAAC;AACF,CAAC"}

package/dist/src/planner/rules/retrieve/rule-projection-pruning.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Rule: Projection Pruning
+ *
+ * When an outer ProjectNode references only a subset of an inner ProjectNode's
+ * output attributes, the inner projections that are not referenced can be removed.
+ *
+ * This commonly arises after view expansion:
+ *   Project(outer: name) → Project(view: id, name, email, category, value) → Scan
+ * becomes:
+ *   Project(outer: name) → Project(view: name) → Scan
+ *
+ * The rule only fires on ProjectNode whose source is also a ProjectNode.
+ */
+import type { PlanNode } from '../../nodes/plan-node.js';
+import type { OptContext } from '../../framework/context.js';
+export declare function ruleProjectionPruning(node: PlanNode, _context: OptContext): PlanNode | null;
+//# sourceMappingURL=rule-projection-pruning.d.ts.map

package/dist/src/planner/rules/retrieve/rule-projection-pruning.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-projection-pruning.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/retrieve/rule-projection-pruning.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAkB,MAAM,0BAA0B,CAAC;AACzE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAoB7D,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAqE3F"}

package/dist/src/planner/rules/retrieve/rule-projection-pruning.js

@@ -0,0 +1,75 @@
+/**
+ * Rule: Projection Pruning
+ *
+ * When an outer ProjectNode references only a subset of an inner ProjectNode's
+ * output attributes, the inner projections that are not referenced can be removed.
+ *
+ * This commonly arises after view expansion:
+ *   Project(outer: name) → Project(view: id, name, email, category, value) → Scan
+ * becomes:
+ *   Project(outer: name) → Project(view: name) → Scan
+ *
+ * The rule only fires on ProjectNode whose source is also a ProjectNode.
+ */
+import { createLogger } from '../../../common/logger.js';
+import { ProjectNode } from '../../nodes/project-node.js';
+import { ColumnReferenceNode } from '../../nodes/reference.js';
+const log = createLogger('optimizer:rule:projection-pruning');
+/**
+ * Collect all attribute IDs referenced by ColumnReferenceNode leaves
+ * within a scalar expression tree.
+ */
+function collectReferencedAttributeIds(node, out) {
+    if (node instanceof ColumnReferenceNode) {
+        out.add(node.attributeId);
+        return;
+    }
+    for (const child of node.getChildren()) {
+        collectReferencedAttributeIds(child, out);
+    }
+}
+export function ruleProjectionPruning(node, _context) {
+    if (!(node instanceof ProjectNode))
+        return null;
+    const outer = node;
+    if (!(outer.source instanceof ProjectNode))
+        return null;
+    const inner = outer.source;
+    // Collect attribute IDs the outer project's expressions reference
+    const referencedIds = new Set();
+    for (const proj of outer.projections) {
+        collectReferencedAttributeIds(proj.node, referencedIds);
+    }
+    // Determine which inner projections are referenced
+    const innerAttrs = inner.getAttributes();
+    const keptIndices = [];
+    for (let i = 0; i < inner.projections.length; i++) {
+        if (referencedIds.has(innerAttrs[i].id)) {
+            keptIndices.push(i);
+        }
+    }
+    // Nothing to prune
+    if (keptIndices.length === inner.projections.length)
+        return null;
+    // Don't prune to zero projections — keep at least one
+    if (keptIndices.length === 0)
+        return null;
+    log('Pruning inner project from %d to %d projections', inner.projections.length, keptIndices.length);
+    // Build pruned inner projections preserving attribute IDs
+    const keptProjections = keptIndices.map(i => ({
+        node: inner.projections[i].node,
+        alias: inner.projections[i].alias,
+        attributeId: innerAttrs[i].id,
+    }));
+    const keptAttributes = keptIndices.map(i => innerAttrs[i]);
+    const prunedInner = new ProjectNode(inner.scope, inner.source, keptProjections, undefined, keptAttributes, inner.preserveInputColumns);
+    // Rebuild outer project with new source
+    const outerAttrs = outer.getAttributes();
+    const newOuterProjections = outer.projections.map((proj, i) => ({
+        node: proj.node,
+        alias: proj.alias,
+        attributeId: outerAttrs[i].id,
+    }));
+    return new ProjectNode(outer.scope, prunedInner, newOuterProjections, undefined, outerAttrs, outer.preserveInputColumns);
+}
+//# sourceMappingURL=rule-projection-pruning.js.map

package/dist/src/planner/rules/retrieve/rule-projection-pruning.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-projection-pruning.js","sourceRoot":"","sources":["../../../../../src/planner/rules/retrieve/rule-projection-pruning.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAGzD,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC1D,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAE/D,MAAM,GAAG,GAAG,YAAY,CAAC,mCAAmC,CAAC,CAAC;AAE9D;;;GAGG;AACH,SAAS,6BAA6B,CAAC,IAAc,EAAE,GAAgB;IACtE,IAAI,IAAI,YAAY,mBAAmB,EAAE,CAAC;QACzC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC1B,OAAO;IACR,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACxC,6BAA6B,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAC3C,CAAC;AACF,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,IAAc,EAAE,QAAoB;IACzE,IAAI,CAAC,CAAC,IAAI,YAAY,WAAW,CAAC;QAAE,OAAO,IAAI,CAAC;IAEhD,MAAM,KAAK,GAAG,IAAI,CAAC;IACnB,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,YAAY,WAAW,CAAC;QAAE,OAAO,IAAI,CAAC;IAExD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;IAE3B,kEAAkE;IAClE,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;QACtC,6BAA6B,CAAC,IAAI,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACzD,CAAC;IAED,mDAAmD;IACnD,MAAM,UAAU,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;IACzC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnD,IAAI,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACzC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACF,CAAC;IAED,mBAAmB;IACnB,IAAI,WAAW,CAAC,MAAM,KAAK,KAAK,CAAC,WAAW,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEjE,sDAAsD;IACtD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAE1C,GAAG,CACF,iDAAiD,EACjD,KAAK,CAAC,WAAW,CAAC,MAAM,EACxB,WAAW,CAAC,MAAM,CAClB,CAAC;IAEF,0DAA0D;IAC1D,MAAM,eAAe,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7C,IAAI,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI;QAC/B,KAAK,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK;QACjC,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;KAC7B,CAAC,CAAC,CAAC;IAEJ,MAAM,cAAc,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3D,MAAM,WAAW,GAAG,IAAI,WAAW,CAClC,KAAK,CAAC,KAAK,EACX,KAAK,CAAC,MAAM,EACZ,eAAe,EACf,SAAS,EACT,cAAc,EACd,KAAK,CAAC,oBAAoB,CAC1B,CAAC;IAEF,wCAAwC;IACxC,MAAM,UAAU,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;IACzC,MAAM,mBAAmB,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/D,IAAI,EAAE,IAAI,CAAC,IAAsB;QACjC,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;KAC7B,CAAC,CAAC,CAAC;IAEJ,OAAO,IAAI,WAAW,CACrB,KAAK,CAAC,KAAK,EACX,WAAW,EACX,mBAAmB,EACnB,SAAS,EACT,UAAU,EACV,KAAK,CAAC,oBAAoB,CAC1B,CAAC;AACH,CAAC"}

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

@@ -1,6 +1,15 @@
 import type { StreamAggregateNode } from '../../planner/nodes/stream-aggregate.js';
 import type { Instruction } from '../types.js';
 import type { EmissionContext } from '../emission-context.js';
+import type { PlanNode } from '../../planner/nodes/plan-node.js';
+import { AggValue } from '../../func/registration.js';
 export declare const ctxLog: import("debug").Debugger;
+/** Clone an aggregate initial value so each group gets an independent accumulator. */
+export declare function cloneInitialValue(initialValue: unknown): AggValue;
+/**
+ * Find the source relation node that column references should use as their context key.
+ * This traverses up the tree to find the original table scan or similar node.
+ */
+export declare function findSourceRelation(node: PlanNode): PlanNode;
 export declare function emitStreamAggregate(plan: StreamAggregateNode, ctx: EmissionContext): Instruction;
 //# sourceMappingURL=aggregate.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"aggregate.d.ts","sourceRoot":"","sources":["../../../../src/runtime/emit/aggregate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,yCAAyC,CAAC;AACnF,OAAO,KAAK,EAAE,WAAW,EAAkC,MAAM,aAAa,CAAC;AAG/E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAiB9D,eAAO,MAAM,MAAM,0BAAkC,CAAC;AAqCtD,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,mBAAmB,EAAE,GAAG,EAAE,eAAe,GAAG,WAAW,CAmhBhG"}
+{"version":3,"file":"aggregate.d.ts","sourceRoot":"","sources":["../../../../src/runtime/emit/aggregate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,yCAAyC,CAAC;AACnF,OAAO,KAAK,EAAE,WAAW,EAAkC,MAAM,aAAa,CAAC;AAG/E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAI9D,OAAO,KAAK,EAAE,QAAQ,EAAiB,MAAM,kCAAkC,CAAC;AAWhF,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,eAAO,MAAM,MAAM,0BAAkC,CAAC;AAEtD,sFAAsF;AACtF,wBAAgB,iBAAiB,CAAC,YAAY,EAAE,OAAO,GAAG,QAAQ,CAUjE;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAgB3D;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,mBAAmB,EAAE,GAAG,EAAE,eAAe,GAAG,WAAW,CAmhBhG"}

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

@@ -12,7 +12,7 @@ import { StatusCode } from '../../common/types.js';
 import { buildRowDescriptor } from '../../util/row-descriptor.js';
 export const ctxLog = createLogger('runtime:context');
 /** Clone an aggregate initial value so each group gets an independent accumulator. */
-function cloneInitialValue(initialValue) {
+export function cloneInitialValue(initialValue) {
     if (typeof initialValue === 'function') {
         return initialValue();
     }
@@ -30,7 +30,7 @@ function cloneInitialValue(initialValue) {
  * Find the source relation node that column references should use as their context key.
  * This traverses up the tree to find the original table scan or similar node.
  */
-function findSourceRelation(node) {
+export function findSourceRelation(node) {
     // Keep going up until we find a values node
     let current = node;
     while (current) {