@quereus/quereus 0.1.0

package/dist/src/planner/debug.js

@@ -0,0 +1,228 @@
+import { safeJsonStringify } from '../util/serialization.js';
+import { astToString } from '../util/ast-stringify.js';
+import { quereusError } from '../common/errors.js';
+import { StatusCode } from '../common/types.js';
+/**
+ * Checks if a value is an AST node
+ */
+function isAstNode(value) {
+    return value && typeof value === 'object' && 'type' in value && typeof value.type === 'string';
+}
+/**
+ * Recursively processes a value, converting AST nodes to SQL strings
+ */
+function processValue(value) {
+    if (value === null || value === undefined) {
+        return value;
+    }
+    // If it's an AST node, convert to SQL string
+    if (isAstNode(value)) {
+        try {
+            return astToString(value);
+        }
+        catch {
+            return `[AST:${value.type}]`; // Fallback if stringify fails
+        }
+    }
+    // If it's an array, process each element
+    if (Array.isArray(value)) {
+        return value.map(processValue);
+    }
+    // If it's an object, process each property
+    if (typeof value === 'object') {
+        // Skip circular references and complex objects
+        if (value.constructor !== Object && value.constructor !== Array) {
+            return '[COMPLEX_OBJECT]';
+        }
+        const processed = {};
+        for (const [key, val] of Object.entries(value)) {
+            try {
+                processed[key] = processValue(val);
+            }
+            catch {
+                processed[key] = '[UNPROCESSABLE]';
+            }
+        }
+        return processed;
+    }
+    // For primitives, return as-is
+    return value;
+}
+/**
+ * Serializes a PlanNode tree to a detailed JSON representation using the existing visit pattern.
+ */
+export function serializePlanTree(rootNode) {
+    const nodeMap = new Map();
+    // First pass: collect all nodes using the visit pattern
+    rootNode.visit((node) => {
+        if (!nodeMap.has(node)) {
+            // Get node-specific properties by examining the node object
+            const properties = {};
+            // Extract interesting properties from the node (excluding functions and circular refs)
+            for (const [key, value] of Object.entries(node)) {
+                if (key === 'scope' || key === 'id' || key === 'nodeType' || key === 'estimatedCost') {
+                    continue; // Skip these as they're handled separately
+                }
+                if (typeof value === 'function') {
+                    continue; // Skip functions
+                }
+                if (value && typeof value === 'object' && 'nodeType' in value) {
+                    // This is likely another PlanNode, skip to avoid duplication
+                    continue;
+                }
+                try {
+                    // Process the property value, converting AST nodes to SQL strings
+                    properties[key] = processValue(value);
+                }
+                catch {
+                    properties[key] = '[UNSERIALIZABLE]';
+                }
+            }
+            nodeMap.set(node, {
+                id: node.id,
+                nodeType: node.nodeType,
+                type: node.getType(),
+                estimatedCost: node.estimatedCost,
+                estimatedRows: node.estimatedRows,
+                totalCost: node.getTotalCost(),
+                children: [], // Will be filled in second pass
+                relations: [], // Will be filled in second pass
+                properties
+            });
+        }
+    });
+    // Second pass: establish relationships
+    for (const [node, info] of nodeMap) {
+        info.children = node.getChildren()
+            .map(child => nodeMap.get(child))
+            .filter(Boolean);
+        info.relations = node.getRelations()
+            .map(relation => nodeMap.get(relation))
+            .filter(Boolean);
+    }
+    const rootInfo = nodeMap.get(rootNode);
+    if (!rootInfo) {
+        quereusError('Root node not found in serialization map', StatusCode.INTERNAL);
+    }
+    return safeJsonStringify(rootInfo, 2);
+}
+/**
+ * Generates a human-readable program listing of instructions.
+ */
+export function generateInstructionProgram(instructions, destinations) {
+    const lines = [];
+    lines.push('=== INSTRUCTION PROGRAM ===');
+    lines.push('');
+    const subProgramMap = new Map();
+    let nextSubProgramId = 0;
+    for (let i = 0; i < instructions.length; i++) {
+        const instruction = instructions[i];
+        const dest = destinations[i];
+        const note = instruction.note ? ` ; ${instruction.note}` : '';
+        const destStr = dest !== null ? ` -> [${dest}]` : ' -> [RESULT]';
+        let subProgramInfo = '';
+        if (instruction.programs && instruction.programs.length > 0) {
+            const programIds = [];
+            for (const program of instruction.programs) {
+                const programId = nextSubProgramId++;
+                subProgramMap.set(programId, { scheduler: program, parentIndex: i });
+                programIds.push(programId);
+            }
+            subProgramInfo = ` SUB-PROGRAMS: [${programIds.join(', ')}]`;
+        }
+        lines.push(`[${i.toString().padStart(3)}] PARAMS: [${instruction.params.map((_, idx) => instructions.findIndex(inst => inst === instruction.params[idx])).join(', ')}]${destStr}${note}${subProgramInfo}`);
+    }
+    // Add sub-program listings
+    if (subProgramMap.size > 0) {
+        lines.push('');
+        lines.push('=== SUB-PROGRAMS ===');
+        for (const [programId, { scheduler, parentIndex }] of subProgramMap) {
+            lines.push('');
+            lines.push(`--- SUB-PROGRAM ${programId} (called by instruction ${parentIndex}) ---`);
+            const subProgram = generateInstructionProgram(scheduler.instructions, scheduler.destinations);
+            // Remove the header and footer from sub-program and indent
+            const subLines = subProgram.split('\n').slice(2, -2);
+            for (const line of subLines) {
+                if (line.trim()) {
+                    lines.push(`  ${line}`);
+                }
+            }
+        }
+    }
+    lines.push('');
+    lines.push('=== END PROGRAM ===');
+    return lines.join('\n');
+}
+/**
+ * Extracts detailed information about the instruction program structure.
+ */
+export function getInstructionDebugInfo(instructions, destinations) {
+    let nextSubProgramId = 0;
+    return instructions.map((instruction, index) => {
+        let subPrograms;
+        if (instruction.programs && instruction.programs.length > 0) {
+            subPrograms = instruction.programs.map(scheduler => {
+                const programId = nextSubProgramId++;
+                const subInstructions = getInstructionDebugInfo(scheduler.instructions, scheduler.destinations);
+                return {
+                    programIndex: programId,
+                    instructionCount: scheduler.instructions.length,
+                    rootNote: scheduler.instructions[scheduler.instructions.length - 1]?.note,
+                    instructions: subInstructions
+                };
+            });
+        }
+        return {
+            index,
+            note: instruction.note,
+            paramCount: instruction.params.length,
+            paramIndices: instruction.params.map(param => instructions.findIndex(inst => inst === param)),
+            destination: destinations[index],
+            subPrograms
+        };
+    });
+}
+/**
+ * Generates a comprehensive trace report that includes sub-program execution details.
+ */
+export function generateTraceReport(tracer) {
+    const events = tracer.getTraceEvents?.() || [];
+    const subPrograms = tracer.getSubPrograms?.() || new Map();
+    const lines = [];
+    lines.push('=== EXECUTION TRACE ===');
+    lines.push('');
+    for (const event of events) {
+        const timestamp = new Date(event.timestamp).toISOString();
+        const typeStr = event.type.toUpperCase().padEnd(6);
+        const note = event.note ? ` (${event.note})` : '';
+        lines.push(`[${event.instructionIndex.toString().padStart(3)}] ${typeStr} ${timestamp}${note}`);
+        if (event.type === 'input' && event.subPrograms) {
+            for (const subProgram of event.subPrograms) {
+                lines.push(`     └─ SUB-PROGRAM ${subProgram.programIndex}: ${subProgram.instructionCount} instructions${subProgram.rootNote ? ` (${subProgram.rootNote})` : ''}`);
+            }
+        }
+        if (event.type === 'error') {
+            lines.push(`     ERROR: ${event.error}`);
+        }
+    }
+    if (subPrograms.size > 0) {
+        lines.push('');
+        lines.push('=== SUB-PROGRAM DETAILS ===');
+        for (const [programId, { scheduler, parentInstructionIndex }] of subPrograms) {
+            lines.push('');
+            lines.push(`--- SUB-PROGRAM ${programId} (parent instruction: ${parentInstructionIndex}) ---`);
+            const programListing = generateInstructionProgram(scheduler.instructions, scheduler.destinations);
+            // Remove header/footer and indent
+            const programLines = programListing.split('\n').slice(2, -2);
+            for (const line of programLines) {
+                if (line.trim()) {
+                    lines.push(`  ${line}`);
+                }
+            }
+        }
+    }
+    lines.push('');
+    lines.push('=== END TRACE ===');
+    return lines.join('\n');
+}
+//# sourceMappingURL=debug.js.map

package/dist/src/planner/debug.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"debug.js","sourceRoot":"","sources":["../../../src/planner/debug.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAGvD,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAuChD;;GAEG;AACH,SAAS,SAAS,CAAC,KAAU;IAC5B,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC;AAChG,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,KAAU;IAC/B,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QAC3C,OAAO,KAAK,CAAC;IACd,CAAC;IAED,6CAA6C;IAC7C,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QACtB,IAAI,CAAC;YACJ,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;QAAC,MAAM,CAAC;YACR,OAAO,QAAQ,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,8BAA8B;QAC7D,CAAC;IACF,CAAC;IAED,yCAAyC;IACzC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAChC,CAAC;IAED,2CAA2C;IAC3C,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC/B,+CAA+C;QAC/C,IAAI,KAAK,CAAC,WAAW,KAAK,MAAM,IAAI,KAAK,CAAC,WAAW,KAAK,KAAK,EAAE,CAAC;YACjE,OAAO,kBAAkB,CAAC;QAC3B,CAAC;QAED,MAAM,SAAS,GAAwB,EAAE,CAAC;QAC1C,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC;gBACJ,SAAS,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACpC,CAAC;YAAC,MAAM,CAAC;gBACR,SAAS,CAAC,GAAG,CAAC,GAAG,iBAAiB,CAAC;YACpC,CAAC;QACF,CAAC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,+BAA+B;IAC/B,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,QAAkB;IACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAA+B,CAAC;IAEvD,wDAAwD;IACxD,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE;QACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,4DAA4D;YAC5D,MAAM,UAAU,GAAwB,EAAE,CAAC;YAE3C,uFAAuF;YACvF,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjD,IAAI,GAAG,KAAK,OAAO,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,UAAU,IAAI,GAAG,KAAK,eAAe,EAAE,CAAC;oBACtF,SAAS,CAAC,2CAA2C;gBACtD,CAAC;gBAED,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;oBACjC,SAAS,CAAC,iBAAiB;gBAC5B,CAAC;gBAED,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,UAAU,IAAI,KAAK,EAAE,CAAC;oBAC/D,6DAA6D;oBAC7D,SAAS;gBACV,CAAC;gBAED,IAAI,CAAC;oBACJ,kEAAkE;oBAClE,UAAU,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;gBACvC,CAAC;gBAAC,MAAM,CAAC;oBACR,UAAU,CAAC,GAAG,CAAC,GAAG,kBAAkB,CAAC;gBACtC,CAAC;YACF,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE;gBACjB,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE;gBACpB,aAAa,EAAE,IAAI,CAAC,aAAa;gBACjC,aAAa,EAAG,IAAY,CAAC,aAAa;gBAC1C,SAAS,EAAE,IAAI,CAAC,YAAY,EAAE;gBAC9B,QAAQ,EAAE,EAAE,EAAE,gCAAgC;gBAC9C,SAAS,EAAE,EAAE,EAAE,gCAAgC;gBAC/C,UAAU;aACV,CAAC,CAAC;QACJ,CAAC;IACF,CAAC,CAAC,CAAC;IAEH,uCAAuC;IACvC,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QACpC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE;aAChC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;aAChC,MAAM,CAAC,OAAO,CAAwB,CAAC;QAEzC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE;aAClC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;aACtC,MAAM,CAAC,OAAO,CAAwB,CAAC;IAC1C,CAAC;IAED,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACvC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACf,YAAY,CAAC,0CAA0C,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC/E,CAAC;IAED,OAAO,iBAAiB,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,0BAA0B,CACxC,YAAoC,EACpC,YAAwC;IAExC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;IAC1C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,MAAM,aAAa,GAAG,IAAI,GAAG,EAAmD,CAAC;IACjF,IAAI,gBAAgB,GAAG,CAAC,CAAC;IAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9D,MAAM,OAAO,GAAG,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC;QAEjE,IAAI,cAAc,GAAG,EAAE,CAAC;QACxB,IAAI,WAAW,CAAC,QAAQ,IAAI,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5D,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,QAAQ,EAAE,CAAC;gBAC3C,MAAM,SAAS,GAAG,gBAAgB,EAAE,CAAC;gBACrC,aAAa,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;gBACrE,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7B,CAAC;YACD,cAAc,GAAG,mBAAmB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QAC/D,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,cAAc,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CACrF,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CACjE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,OAAO,GAAG,IAAI,GAAG,cAAc,EAAE,CAAC,CAAC;IACrD,CAAC;IAED,2BAA2B;IAC3B,IAAI,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;QAEnC,KAAK,MAAM,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,IAAI,aAAa,EAAE,CAAC;YACpE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,mBAAmB,SAAS,2BAA2B,WAAW,OAAO,CAAC,CAAC;YACtF,MAAM,UAAU,GAAG,0BAA0B,CAAC,SAAS,CAAC,YAAY,EAAE,SAAS,CAAC,YAAY,CAAC,CAAC;YAC9F,2DAA2D;YAC3D,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;oBAChB,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IAClC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,uBAAuB,CACrC,YAAoC,EACpC,YAAwC;IAExC,IAAI,gBAAgB,GAAG,CAAC,CAAC;IAEzB,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE;QAC7C,IAAI,WAA8C,CAAC;QAEnD,IAAI,WAAW,CAAC,QAAQ,IAAI,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5D,WAAW,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;gBACjD,MAAM,SAAS,GAAG,gBAAgB,EAAE,CAAC;gBACrC,MAAM,eAAe,GAAG,uBAAuB,CAAC,SAAS,CAAC,YAAY,EAAE,SAAS,CAAC,YAAY,CAAC,CAAC;gBAEhG,OAAO;oBACL,YAAY,EAAE,SAAS;oBACvB,gBAAgB,EAAE,SAAS,CAAC,YAAY,CAAC,MAAM;oBAC/C,QAAQ,EAAE,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI;oBACzE,YAAY,EAAE,eAAe;iBAC9B,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO;YACL,KAAK;YACL,IAAI,EAAE,WAAW,CAAC,IAAI;YACtB,UAAU,EAAE,WAAW,CAAC,MAAM,CAAC,MAAM;YACrC,YAAY,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAC3C,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,KAAK,CAAC,CAC/C;YACD,WAAW,EAAE,YAAY,CAAC,KAAK,CAAC;YAChC,WAAW;SACZ,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAyB;IAEzB,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,EAAE,IAAI,EAAE,CAAC;IAC/C,MAAM,WAAW,GAAG,MAAM,CAAC,cAAc,EAAE,EAAE,IAAI,IAAI,GAAG,EAAE,CAAC;IAE3D,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;IACtC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,CAAC;QAC1D,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAElD,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,gBAAgB,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC,CAAC;QAEhG,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YAChD,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;gBAC3C,KAAK,CAAC,IAAI,CAAC,uBAAuB,UAAU,CAAC,YAAY,KAAK,UAAU,CAAC,gBAAgB,gBAAgB,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACrK,CAAC;QACH,CAAC;QAED,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;QAE1C,KAAK,MAAM,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,sBAAsB,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC;YAC7E,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,mBAAmB,SAAS,yBAAyB,sBAAsB,OAAO,CAAC,CAAC;YAC/F,MAAM,cAAc,GAAG,0BAA0B,CAAC,SAAS,CAAC,YAAY,EAAE,SAAS,CAAC,YAAY,CAAC,CAAC;YAClG,kCAAkC;YAClC,MAAM,YAAY,GAAG,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7D,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;gBAChC,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;oBAChB,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAChC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/src/planner/framework/context.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Optimizer context that wraps Optimizer with StatsProvider and other utilities
+ * Provides unified interface for optimization rules
+ */
+import type { Optimizer } from '../optimizer.js';
+import type { StatsProvider } from '../stats/index.js';
+import type { OptimizerTuning } from '../optimizer-tuning.js';
+import { Database } from '../../core/database.js';
+/**
+ * Context object passed to optimization rules
+ * Contains all the utilities and data sources rules need
+ */
+export interface OptContext {
+    /** The optimizer instance */
+    readonly optimizer: Optimizer;
+    /** Statistics provider for cardinality and selectivity estimates */
+    readonly stats: StatsProvider;
+    /** Optimizer tuning parameters */
+    readonly tuning: OptimizerTuning;
+    /** Current optimization phase */
+    readonly phase: 'rewrite' | 'impl';
+    /** Rule application depth (for detecting infinite recursion) */
+    readonly depth: number;
+    /** Additional context data that rules can use */
+    readonly context: Map<string, any>;
+    /** Database instance */
+    readonly db: Database;
+}
+/**
+ * Implementation of optimization context
+ */
+export declare class OptimizationContext implements OptContext {
+    readonly optimizer: Optimizer;
+    readonly stats: StatsProvider;
+    readonly tuning: OptimizerTuning;
+    readonly phase: 'rewrite' | 'impl';
+    readonly db: Database;
+    readonly depth: number;
+    readonly context: Map<string, any>;
+    constructor(optimizer: Optimizer, stats: StatsProvider, tuning: OptimizerTuning, phase: "rewrite" | "impl" | undefined, db: Database, depth?: number);
+    /**
+     * Create a new context for a different phase
+     */
+    withPhase(phase: 'rewrite' | 'impl'): OptimizationContext;
+    /**
+     * Create a new context with incremented depth
+     */
+    withIncrementedDepth(): OptimizationContext;
+    /**
+     * Create a new context with additional context data
+     */
+    withContext(key: string, value: any): OptimizationContext;
+    /**
+     * Get context value
+     */
+    getContext<T>(key: string): T | undefined;
+    /**
+     * Check if context has a key
+     */
+    hasContext(key: string): boolean;
+    /**
+     * Set context value (mutates current context)
+     */
+    setContext(key: string, value: any): void;
+    /**
+     * Remove context value (mutates current context)
+     */
+    deleteContext(key: string): boolean;
+    /**
+     * Clear all context data (mutates current context)
+     */
+    clearContext(): void;
+    /**
+     * Get a snapshot of all context data
+     */
+    getContextSnapshot(): Record<string, any>;
+}
+/**
+ * Factory function to create optimization context
+ */
+export declare function createOptContext(optimizer: Optimizer, stats: StatsProvider, tuning: OptimizerTuning, db: Database, phase?: 'rewrite' | 'impl'): OptContext;
+/**
+ * Type guard to check if an object is an OptContext
+ */
+export declare function isOptContext(obj: any): obj is OptContext;
+//# sourceMappingURL=context.d.ts.map

package/dist/src/planner/framework/context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"context.d.ts","sourceRoot":"","sources":["../../../../src/planner/framework/context.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACjD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AACvD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAI9D,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAIlD;;;GAGG;AACH,MAAM,WAAW,UAAU;IAC1B,6BAA6B;IAC7B,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;IAE9B,oEAAoE;IACpE,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC;IAE9B,kCAAkC;IAClC,QAAQ,CAAC,MAAM,EAAE,eAAe,CAAC;IAEjC,iCAAiC;IACjC,QAAQ,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,CAAC;IAEnC,gEAAgE;IAChE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAEvB,iDAAiD;IACjD,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAEnC,wBAAwB;IACxB,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;CACtB;AAED;;GAEG;AACH,qBAAa,mBAAoB,YAAW,UAAU;aAIpC,SAAS,EAAE,SAAS;aACpB,KAAK,EAAE,aAAa;aACpB,MAAM,EAAE,eAAe;aACvB,KAAK,EAAE,SAAS,GAAG,MAAM;aACzB,EAAE,EAAE,QAAQ;aACZ,KAAK,EAAE,MAAM;IAR9B,QAAQ,CAAC,OAAO,mBAA0B;gBAGzB,SAAS,EAAE,SAAS,EACpB,KAAK,EAAE,aAAa,EACpB,MAAM,EAAE,eAAe,EACvB,KAAK,EAAE,SAAS,GAAG,MAAM,YAAY,EACrC,EAAE,EAAE,QAAQ,EACZ,KAAK,GAAE,MAAU;IAKlC;;OAEG;IACH,SAAS,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,GAAG,mBAAmB;IAWzD;;OAEG;IACH,oBAAoB,IAAI,mBAAmB;IAe3C;;OAEG;IACH,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,mBAAmB;IAqBzD;;OAEG;IACH,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAIzC;;OAEG;IACH,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIhC;;OAEG;IACH,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,IAAI;IAIzC;;OAEG;IACH,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAInC;;OAEG;IACH,YAAY,IAAI,IAAI;IAIpB;;OAEG;IACH,kBAAkB,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC;CAOzC;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC/B,SAAS,EAAE,SAAS,EACpB,KAAK,EAAE,aAAa,EACpB,MAAM,EAAE,eAAe,EACvB,EAAE,EAAE,QAAQ,EACZ,KAAK,GAAE,SAAS,GAAG,MAAkB,GACnC,UAAU,CAEZ;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,IAAI,UAAU,CASxD"}

package/dist/src/planner/framework/context.js

@@ -0,0 +1,117 @@
+/**
+ * Optimizer context that wraps Optimizer with StatsProvider and other utilities
+ * Provides unified interface for optimization rules
+ */
+import { createLogger } from '../../common/logger.js';
+import { StatusCode } from '../../common/types.js';
+import { quereusError } from '../../common/errors.js';
+const log = createLogger('optimizer:framework:context');
+/**
+ * Implementation of optimization context
+ */
+export class OptimizationContext {
+    optimizer;
+    stats;
+    tuning;
+    phase;
+    db;
+    depth;
+    context = new Map();
+    constructor(optimizer, stats, tuning, phase = 'rewrite', db, depth = 0) {
+        this.optimizer = optimizer;
+        this.stats = stats;
+        this.tuning = tuning;
+        this.phase = phase;
+        this.db = db;
+        this.depth = depth;
+        log('Created optimization context (phase: %s, depth: %d)', phase, depth);
+    }
+    /**
+     * Create a new context for a different phase
+     */
+    withPhase(phase) {
+        return new OptimizationContext(this.optimizer, this.stats, this.tuning, phase, this.db, this.depth);
+    }
+    /**
+     * Create a new context with incremented depth
+     */
+    withIncrementedDepth() {
+        if (this.depth >= this.tuning.maxOptimizationDepth) {
+            quereusError(`Maximum optimization depth exceeded: ${this.depth}`, StatusCode.ERROR);
+        }
+        return new OptimizationContext(this.optimizer, this.stats, this.tuning, this.phase, this.db, this.depth + 1);
+    }
+    /**
+     * Create a new context with additional context data
+     */
+    withContext(key, value) {
+        const newContext = new OptimizationContext(this.optimizer, this.stats, this.tuning, this.phase, this.db, this.depth);
+        // Copy existing context
+        for (const [k, v] of this.context) {
+            newContext.context.set(k, v);
+        }
+        // Add new context
+        newContext.context.set(key, value);
+        return newContext;
+    }
+    /**
+     * Get context value
+     */
+    getContext(key) {
+        return this.context.get(key);
+    }
+    /**
+     * Check if context has a key
+     */
+    hasContext(key) {
+        return this.context.has(key);
+    }
+    /**
+     * Set context value (mutates current context)
+     */
+    setContext(key, value) {
+        this.context.set(key, value);
+    }
+    /**
+     * Remove context value (mutates current context)
+     */
+    deleteContext(key) {
+        return this.context.delete(key);
+    }
+    /**
+     * Clear all context data (mutates current context)
+     */
+    clearContext() {
+        this.context.clear();
+    }
+    /**
+     * Get a snapshot of all context data
+     */
+    getContextSnapshot() {
+        const snapshot = {};
+        for (const [key, value] of this.context) {
+            snapshot[key] = value;
+        }
+        return snapshot;
+    }
+}
+/**
+ * Factory function to create optimization context
+ */
+export function createOptContext(optimizer, stats, tuning, db, phase = 'rewrite') {
+    return new OptimizationContext(optimizer, stats, tuning, phase, db);
+}
+/**
+ * Type guard to check if an object is an OptContext
+ */
+export function isOptContext(obj) {
+    return obj &&
+        typeof obj === 'object' &&
+        'optimizer' in obj &&
+        'stats' in obj &&
+        'tuning' in obj &&
+        'phase' in obj &&
+        'depth' in obj &&
+        'context' in obj;
+}
+//# sourceMappingURL=context.js.map

package/dist/src/planner/framework/context.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"context.js","sourceRoot":"","sources":["../../../../src/planner/framework/context.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAGtD,MAAM,GAAG,GAAG,YAAY,CAAC,6BAA6B,CAAC,CAAC;AA6BxD;;GAEG;AACH,MAAM,OAAO,mBAAmB;IAId;IACA;IACA;IACA;IACA;IACA;IARR,OAAO,GAAG,IAAI,GAAG,EAAe,CAAC;IAE1C,YACiB,SAAoB,EACpB,KAAoB,EACpB,MAAuB,EACvB,QAA4B,SAAS,EACrC,EAAY,EACZ,QAAgB,CAAC;QALjB,cAAS,GAAT,SAAS,CAAW;QACpB,UAAK,GAAL,KAAK,CAAe;QACpB,WAAM,GAAN,MAAM,CAAiB;QACvB,UAAK,GAAL,KAAK,CAAgC;QACrC,OAAE,GAAF,EAAE,CAAU;QACZ,UAAK,GAAL,KAAK,CAAY;QAEjC,GAAG,CAAC,qDAAqD,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC1E,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,KAAyB;QAClC,OAAO,IAAI,mBAAmB,CAC7B,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,KAAK,EACL,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,KAAK,CACV,CAAC;IACH,CAAC;IAED;;OAEG;IACH,oBAAoB;QACnB,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,oBAAoB,EAAE,CAAC;YACpD,YAAY,CAAC,wCAAwC,IAAI,CAAC,KAAK,EAAE,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;QACtF,CAAC;QAED,OAAO,IAAI,mBAAmB,CAC7B,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,KAAK,GAAG,CAAC,CACd,CAAC;IACH,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,GAAW,EAAE,KAAU;QAClC,MAAM,UAAU,GAAG,IAAI,mBAAmB,CACzC,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,KAAK,CACV,CAAC;QAEF,wBAAwB;QACxB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACnC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,CAAC;QAED,kBAAkB;QAClB,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAEnC,OAAO,UAAU,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,UAAU,CAAI,GAAW;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAkB,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,GAAW,EAAE,KAAU;QACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,GAAW;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,YAAY;QACX,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,kBAAkB;QACjB,MAAM,QAAQ,GAAwB,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACzC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACvB,CAAC;QACD,OAAO,QAAQ,CAAC;IACjB,CAAC;CACD;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC/B,SAAoB,EACpB,KAAoB,EACpB,MAAuB,EACvB,EAAY,EACZ,QAA4B,SAAS;IAErC,OAAO,IAAI,mBAAmB,CAAC,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;AACrE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,GAAQ;IACpC,OAAO,GAAG;QACT,OAAO,GAAG,KAAK,QAAQ;QACvB,WAAW,IAAI,GAAG;QAClB,OAAO,IAAI,GAAG;QACd,QAAQ,IAAI,GAAG;QACf,OAAO,IAAI,GAAG;QACd,OAAO,IAAI,GAAG;QACd,SAAS,IAAI,GAAG,CAAC;AACnB,CAAC"}

package/dist/src/planner/framework/physical-utils.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Physical property utilities for the Titan optimizer
+ * Provides helpers for handling ordering, unique keys, and property propagation
+ */
+import type { ScalarPlanNode } from '../nodes/plan-node.js';
+import type { ColumnReferenceNode } from '../nodes/reference.js';
+/**
+ * Ordering specification for a column
+ */
+export interface Ordering {
+    /** Column index */
+    column: number;
+    /** True for descending order */
+    desc: boolean;
+}
+/**
+ * Extract ordering from sort keys if they are trivial column references
+ * Returns undefined if any sort key is not a simple column reference
+ */
+export declare function extractOrderingFromSortKeys(sortKeys: readonly {
+    expression: ScalarPlanNode;
+    direction: 'asc' | 'desc';
+}[], sourceAttributes: readonly {
+    id: number;
+}[]): Ordering[] | undefined;
+/**
+ * Check if a scalar expression is a trivial column reference
+ */
+export declare function isTrivialColumnReference(expr: ScalarPlanNode): boolean;
+/**
+ * Extract column index from a column reference if it exists in the given attributes
+ */
+export declare function getColumnIndex(columnRef: ColumnReferenceNode, attributes: Array<{
+    id: number;
+}>): number | undefined;
+/**
+ * Merge ordering requirements between parent and child
+ * Returns undefined if orderings are incompatible
+ */
+export declare function mergeOrderings(parent: Ordering[] | undefined, child: Ordering[] | undefined): Ordering[] | undefined;
+/**
+ * Check if two orderings are compatible (one satisfies the other)
+ */
+export declare function orderingsCompatible(required: Ordering[] | undefined, provided: Ordering[] | undefined): boolean;
+/**
+ * Check if orderings are exactly equal
+ */
+export declare function orderingsEqual(a: Ordering[] | undefined, b: Ordering[] | undefined): boolean;
+/**
+ * Reverse an ordering (flip ASC/DESC)
+ */
+export declare function reverseOrdering(ordering: Ordering[]): Ordering[];
+/**
+ * Check if unique keys guarantee distinctness for given columns
+ */
+export declare function uniqueKeysImplyDistinct(uniqueKeys: number[][], projectedColumns: number[]): boolean;
+/**
+ * Project unique keys through a projection
+ * Returns keys that are still unique after projection
+ */
+export declare function projectUniqueKeys(uniqueKeys: number[][], columnMapping: Map<number, number>): number[][];
+//# sourceMappingURL=physical-utils.d.ts.map

package/dist/src/planner/framework/physical-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"physical-utils.d.ts","sourceRoot":"","sources":["../../../../src/planner/framework/physical-utils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAEjE;;GAEG;AACH,MAAM,WAAW,QAAQ;IACxB,mBAAmB;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,gCAAgC;IAChC,IAAI,EAAE,OAAO,CAAC;CACd;AAED;;;GAGG;AACH,wBAAgB,2BAA2B,CAC1C,QAAQ,EAAE,SAAS;IAAE,UAAU,EAAE,cAAc,CAAC;IAAC,SAAS,EAAE,KAAK,GAAG,MAAM,CAAA;CAAE,EAAE,EAC9E,gBAAgB,EAAE,SAAS;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,EAAE,GACzC,QAAQ,EAAE,GAAG,SAAS,CAwBxB;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,cAAc,GAAG,OAAO,CAEtE;AAED;;GAEG;AACH,wBAAgB,cAAc,CAC7B,SAAS,EAAE,mBAAmB,EAC9B,UAAU,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC,GAC/B,MAAM,GAAG,SAAS,CAGpB;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAC7B,MAAM,EAAE,QAAQ,EAAE,GAAG,SAAS,EAC9B,KAAK,EAAE,QAAQ,EAAE,GAAG,SAAS,GAC3B,QAAQ,EAAE,GAAG,SAAS,CA6BxB;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAClC,QAAQ,EAAE,QAAQ,EAAE,GAAG,SAAS,EAChC,QAAQ,EAAE,QAAQ,EAAE,GAAG,SAAS,GAC9B,OAAO,CAwBT;AAED;;GAEG;AACH,wBAAgB,cAAc,CAC7B,CAAC,EAAE,QAAQ,EAAE,GAAG,SAAS,EACzB,CAAC,EAAE,QAAQ,EAAE,GAAG,SAAS,GACvB,OAAO,CAYT;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAEhE;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CACtC,UAAU,EAAE,MAAM,EAAE,EAAE,EACtB,gBAAgB,EAAE,MAAM,EAAE,GACxB,OAAO,CAKT;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAChC,UAAU,EAAE,MAAM,EAAE,EAAE,EACtB,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC,MAAM,EAAE,EAAE,CAsBZ"}

package/dist/src/planner/framework/physical-utils.js

@@ -0,0 +1,149 @@
+/**
+ * Physical property utilities for the Titan optimizer
+ * Provides helpers for handling ordering, unique keys, and property propagation
+ */
+import { PlanNodeType } from '../nodes/plan-node-type.js';
+/**
+ * Extract ordering from sort keys if they are trivial column references
+ * Returns undefined if any sort key is not a simple column reference
+ */
+export function extractOrderingFromSortKeys(sortKeys, sourceAttributes) {
+    const ordering = [];
+    for (const sortKey of sortKeys) {
+        // Check if this is a trivial column reference
+        if (sortKey.expression.nodeType !== PlanNodeType.ColumnReference) {
+            return undefined; // Non-trivial expression, cannot determine ordering
+        }
+        const columnRef = sortKey.expression;
+        // Find the column index in the source attributes
+        const columnIndex = sourceAttributes.findIndex(attr => attr.id === columnRef.attributeId);
+        if (columnIndex === -1) {
+            return undefined; // Column not found in source
+        }
+        ordering.push({
+            column: columnIndex,
+            desc: sortKey.direction === 'desc'
+        });
+    }
+    return ordering;
+}
+/**
+ * Check if a scalar expression is a trivial column reference
+ */
+export function isTrivialColumnReference(expr) {
+    return expr.nodeType === PlanNodeType.ColumnReference;
+}
+/**
+ * Extract column index from a column reference if it exists in the given attributes
+ */
+export function getColumnIndex(columnRef, attributes) {
+    const index = attributes.findIndex(attr => attr.id === columnRef.attributeId);
+    return index >= 0 ? index : undefined;
+}
+/**
+ * Merge ordering requirements between parent and child
+ * Returns undefined if orderings are incompatible
+ */
+export function mergeOrderings(parent, child) {
+    // If parent has no ordering requirements, use child's ordering
+    if (!parent || parent.length === 0) {
+        return child;
+    }
+    // If child provides no ordering, parent requirements cannot be satisfied
+    if (!child || child.length === 0) {
+        return undefined;
+    }
+    // Check if child ordering satisfies parent requirements
+    if (parent.length > child.length) {
+        return undefined; // Child provides fewer columns than parent needs
+    }
+    // Verify each parent requirement is satisfied by child
+    for (let i = 0; i < parent.length; i++) {
+        const parentOrder = parent[i];
+        const childOrder = child[i];
+        if (parentOrder.column !== childOrder.column ||
+            parentOrder.desc !== childOrder.desc) {
+            return undefined; // Ordering mismatch
+        }
+    }
+    // Parent requirements are satisfied, return child's full ordering
+    return child;
+}
+/**
+ * Check if two orderings are compatible (one satisfies the other)
+ */
+export function orderingsCompatible(required, provided) {
+    if (!required || required.length === 0) {
+        return true; // No requirements
+    }
+    if (!provided || provided.length === 0) {
+        return false; // Requirements exist but nothing provided
+    }
+    if (required.length > provided.length) {
+        return false; // Not enough columns provided
+    }
+    // Check prefix compatibility
+    for (let i = 0; i < required.length; i++) {
+        const req = required[i];
+        const prov = provided[i];
+        if (req.column !== prov.column || req.desc !== prov.desc) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * Check if orderings are exactly equal
+ */
+export function orderingsEqual(a, b) {
+    if (a === b)
+        return true;
+    if (!a || !b)
+        return false;
+    if (a.length !== b.length)
+        return false;
+    for (let i = 0; i < a.length; i++) {
+        if (a[i].column !== b[i].column || a[i].desc !== b[i].desc) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * Reverse an ordering (flip ASC/DESC)
+ */
+export function reverseOrdering(ordering) {
+    return ordering.map(ord => ({ ...ord, desc: !ord.desc }));
+}
+/**
+ * Check if unique keys guarantee distinctness for given columns
+ */
+export function uniqueKeysImplyDistinct(uniqueKeys, projectedColumns) {
+    // Check if any unique key is a subset of projected columns
+    return uniqueKeys.some(key => key.every(col => projectedColumns.includes(col)));
+}
+/**
+ * Project unique keys through a projection
+ * Returns keys that are still unique after projection
+ */
+export function projectUniqueKeys(uniqueKeys, columnMapping // oldColumn -> newColumn
+) {
+    const result = [];
+    for (const key of uniqueKeys) {
+        const projectedKey = [];
+        let keyIsValid = true;
+        for (const col of key) {
+            const newCol = columnMapping.get(col);
+            if (newCol === undefined) {
+                keyIsValid = false;
+                break; // Key column not in projection
+            }
+            projectedKey.push(newCol);
+        }
+        if (keyIsValid) {
+            result.push(projectedKey);
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=physical-utils.js.map