@rocicorp/zero 0.25.0-canary.0 → 0.25.0-canary.1

package/out/zql/src/planner/planner-builder.js

@@ -0,0 +1,180 @@
+import { assert } from "../../../shared/src/asserts.js";
+import { must } from "../../../shared/src/must.js";
+import { planIdSymbol } from "../../../zero-protocol/src/ast.js";
+import { PlannerFanIn } from "./planner-fan-in.js";
+import { PlannerFanOut } from "./planner-fan-out.js";
+import { PlannerGraph } from "./planner-graph.js";
+import { PlannerJoin } from "./planner-join.js";
+import { PlannerTerminus } from "./planner-terminus.js";
+function wireOutput(from, to) {
+    switch (from.kind) {
+        case 'connection':
+        case 'join':
+        case 'fan-in':
+            from.setOutput(to);
+            break;
+        case 'fan-out':
+            from.addOutput(to);
+            break;
+        case 'terminus':
+            assert(false, 'Terminus nodes cannot have outputs');
+    }
+}
+export function buildPlanGraph(ast, model, baseConstraints) {
+    const graph = new PlannerGraph();
+    let nextPlanId = 0;
+    const source = graph.addSource(ast.table, model);
+    const connection = source.connect(ast.orderBy ?? [], ast.where, baseConstraints, ast.limit);
+    graph.connections.push(connection);
+    let end = connection;
+    if (ast.where) {
+        end = processCondition(ast.where, end, graph, model, ast.table, () => nextPlanId++);
+    }
+    const terminus = new PlannerTerminus(end);
+    wireOutput(end, terminus);
+    graph.setTerminus(terminus);
+    const subPlans = {};
+    if (ast.related) {
+        for (const csq of ast.related) {
+            const alias = must(csq.subquery.alias, 'Related subquery must have alias');
+            const childConstraints = extractConstraint(csq.correlation.childField, csq.subquery.table);
+            subPlans[alias] = buildPlanGraph(csq.subquery, model, childConstraints);
+        }
+    }
+    return { plan: graph, subPlans };
+}
+function processCondition(condition, input, graph, model, parentTable, getPlanId) {
+    switch (condition.type) {
+        case 'simple':
+            return input;
+        case 'and':
+            return processAnd(condition, input, graph, model, parentTable, getPlanId);
+        case 'or':
+            return processOr(condition, input, graph, model, parentTable, getPlanId);
+        case 'correlatedSubquery':
+            return processCorrelatedSubquery(condition, input, graph, model, parentTable, getPlanId);
+    }
+}
+function processAnd(condition, input, graph, model, parentTable, getPlanId) {
+    let end = input;
+    for (const subCondition of condition.conditions) {
+        end = processCondition(subCondition, end, graph, model, parentTable, getPlanId);
+    }
+    return end;
+}
+function processOr(condition, input, graph, model, parentTable, getPlanId) {
+    const subqueryConditions = condition.conditions.filter(c => c.type === 'correlatedSubquery' || hasCorrelatedSubquery(c));
+    if (subqueryConditions.length === 0) {
+        return input;
+    }
+    const fanOut = new PlannerFanOut(input);
+    graph.fanOuts.push(fanOut);
+    wireOutput(input, fanOut);
+    const branches = [];
+    for (const subCondition of subqueryConditions) {
+        const branch = processCondition(subCondition, fanOut, graph, model, parentTable, getPlanId);
+        branches.push(branch);
+        fanOut.addOutput(branch);
+    }
+    const fanIn = new PlannerFanIn(branches);
+    graph.fanIns.push(fanIn);
+    for (const branch of branches) {
+        wireOutput(branch, fanIn);
+    }
+    return fanIn;
+}
+function processCorrelatedSubquery(condition, input, graph, model, parentTable, getPlanId) {
+    const { related } = condition;
+    const childTable = related.subquery.table;
+    const childSource = graph.hasSource(childTable)
+        ? graph.getSource(childTable)
+        : graph.addSource(childTable, model);
+    const childConnection = childSource.connect(related.subquery.orderBy ?? [], related.subquery.where, undefined, // no base constraints for EXISTS/NOT EXISTS
+    condition.op === 'EXISTS' ? 1 : undefined);
+    graph.connections.push(childConnection);
+    let childEnd = childConnection;
+    if (related.subquery.where) {
+        childEnd = processCondition(related.subquery.where, childEnd, graph, model, childTable, getPlanId);
+    }
+    const parentConstraint = extractConstraint(related.correlation.parentField, parentTable);
+    const childConstraint = extractConstraint(related.correlation.childField, childTable);
+    const planId = getPlanId();
+    condition[planIdSymbol] = planId;
+    const join = new PlannerJoin(input, childEnd, parentConstraint, childConstraint, condition.op !== 'NOT EXISTS', planId);
+    graph.joins.push(join);
+    wireOutput(input, join);
+    wireOutput(childEnd, join);
+    return join;
+}
+function hasCorrelatedSubquery(condition) {
+    if (condition.type === 'correlatedSubquery') {
+        return true;
+    }
+    if (condition.type === 'and' || condition.type === 'or') {
+        return condition.conditions.some(hasCorrelatedSubquery);
+    }
+    return false;
+}
+function extractConstraint(fields, _tableName) {
+    return Object.fromEntries(fields.map(field => [field, undefined]));
+}
+function planRecursively(plans, planDebugger) {
+    for (const subPlan of Object.values(plans.subPlans)) {
+        planRecursively(subPlan, planDebugger);
+    }
+    plans.plan.plan(planDebugger);
+}
+export function planQuery(ast, model, planDebugger) {
+    const plans = buildPlanGraph(ast, model);
+    planRecursively(plans, planDebugger);
+    return applyPlansToAST(ast, plans);
+}
+function applyToCondition(condition, flippedIds) {
+    if (condition.type === 'simple') {
+        return condition;
+    }
+    if (condition.type === 'correlatedSubquery') {
+        const planId = condition[planIdSymbol];
+        const shouldFlip = planId !== undefined && flippedIds.has(planId);
+        return {
+            ...condition,
+            flip: shouldFlip ? true : condition.flip,
+            related: {
+                ...condition.related,
+                subquery: {
+                    ...condition.related.subquery,
+                    where: condition.related.subquery.where
+                        ? applyToCondition(condition.related.subquery.where, flippedIds)
+                        : undefined,
+                },
+            },
+        };
+    }
+    return {
+        ...condition,
+        conditions: condition.conditions.map(c => applyToCondition(c, flippedIds)),
+    };
+}
+function applyPlansToAST(ast, plans) {
+    const flippedIds = new Set();
+    for (const join of plans.plan.joins) {
+        if (join.type === 'flipped' && join.planId !== undefined) {
+            flippedIds.add(join.planId);
+        }
+    }
+    return {
+        ...ast,
+        where: ast.where ? applyToCondition(ast.where, flippedIds) : undefined,
+        related: ast.related?.map(csq => {
+            const alias = must(csq.subquery.alias, 'Related subquery must have alias');
+            const subPlan = plans.subPlans[alias];
+            return {
+                ...csq,
+                subquery: subPlan
+                    ? applyPlansToAST(csq.subquery, subPlan)
+                    : csq.subquery,
+            };
+        }),
+    };
+}
+//# sourceMappingURL=planner-builder.js.map

package/out/zql/src/planner/planner-builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-builder.js","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-builder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AACtD,OAAO,EAAC,IAAI,EAAC,MAAM,6BAA6B,CAAC;AAQjD,OAAO,EAAC,YAAY,EAAC,MAAM,mCAAmC,CAAC;AAI/D,OAAO,EAAC,YAAY,EAAC,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAC,aAAa,EAAC,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAC,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAC,WAAW,EAAC,MAAM,mBAAmB,CAAC;AAE9C,OAAO,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAEtD,SAAS,UAAU,CAAC,IAAiB,EAAE,EAAe;IACpD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,YAAY,CAAC;QAClB,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ;YACX,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACnB,MAAM;QACR,KAAK,SAAS;YACZ,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACnB,MAAM;QACR,KAAK,UAAU;YACb,MAAM,CAAC,KAAK,EAAE,oCAAoC,CAAC,CAAC;IACxD,CAAC;AACH,CAAC;AAOD,MAAM,UAAU,cAAc,CAC5B,GAAQ,EACR,KAA0B,EAC1B,eAAmC;IAEnC,MAAM,KAAK,GAAG,IAAI,YAAY,EAAE,CAAC;IACjC,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,CAC/B,GAAG,CAAC,OAAO,IAAI,EAAE,EACjB,GAAG,CAAC,KAAK,EACT,eAAe,EACf,GAAG,CAAC,KAAK,CACV,CAAC;IACF,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAEnC,IAAI,GAAG,GAAgB,UAAU,CAAC;IAClC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QACd,GAAG,GAAG,gBAAgB,CACpB,GAAG,CAAC,KAAK,EACT,GAAG,EACH,KAAK,EACL,KAAK,EACL,GAAG,CAAC,KAAK,EACT,GAAG,EAAE,CAAC,UAAU,EAAE,CACnB,CAAC;IACJ,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,eAAe,CAAC,GAAG,CAAC,CAAC;IAC1C,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC1B,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAE5B,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;QAChB,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,IAAI,CAChB,GAAG,CAAC,QAAQ,CAAC,KAAK,EAClB,kCAAkC,CACnC,CAAC;YACF,MAAM,gBAAgB,GAAG,iBAAiB,CACxC,GAAG,CAAC,WAAW,CAAC,UAAU,EAC1B,GAAG,CAAC,QAAQ,CAAC,KAAK,CACnB,CAAC;YACF,QAAQ,CAAC,KAAK,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IAED,OAAO,EAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAC,CAAC;AACjC,CAAC;AAED,SAAS,gBAAgB,CACvB,SAAoB,EACpB,KAAkB,EAClB,KAAmB,EACnB,KAA0B,EAC1B,WAAmB,EACnB,SAAuB;IAEvB,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC;QACf,KAAK,KAAK;YACR,OAAO,UAAU,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAC5E,KAAK,IAAI;YACP,OAAO,SAAS,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAC3E,KAAK,oBAAoB;YACvB,OAAO,yBAAyB,CAC9B,SAAS,EACT,KAAK,EACL,KAAK,EACL,KAAK,EACL,WAAW,EACX,SAAS,CACV,CAAC;IACN,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CACjB,SAAsB,EACtB,KAAkB,EAClB,KAAmB,EACnB,KAA0B,EAC1B,WAAmB,EACnB,SAAuB;IAEvB,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,KAAK,MAAM,YAAY,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;QAChD,GAAG,GAAG,gBAAgB,CACpB,YAAY,EACZ,GAAG,EACH,KAAK,EACL,KAAK,EACL,WAAW,EACX,SAAS,CACV,CAAC;IACJ,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAChB,SAAsB,EACtB,KAAkB,EAClB,KAAmB,EACnB,KAA0B,EAC1B,WAAmB,EACnB,SAAuB;IAEvB,MAAM,kBAAkB,GAAG,SAAS,CAAC,UAAU,CAAC,MAAM,CACpD,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,oBAAoB,IAAI,qBAAqB,CAAC,CAAC,CAAC,CACjE,CAAC;IAEF,IAAI,kBAAkB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,aAAa,CAAC,KAAK,CAAC,CAAC;IACxC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3B,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAE1B,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,KAAK,MAAM,YAAY,IAAI,kBAAkB,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,gBAAgB,CAC7B,YAAY,EACZ,MAAM,EACN,KAAK,EACL,KAAK,EACL,WAAW,EACX,SAAS,CACV,CAAC;QACF,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC3B,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;IACzC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,yBAAyB,CAChC,SAAsC,EACtC,KAAkB,EAClB,KAAmB,EACnB,KAA0B,EAC1B,WAAmB,EACnB,SAAuB;IAEvB,MAAM,EAAC,OAAO,EAAC,GAAG,SAAS,CAAC;IAC5B,MAAM,UAAU,GAAG,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC;IAE1C,MAAM,WAAW,GAAG,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC;QAC7C,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC;QAC7B,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IAEvC,MAAM,eAAe,GAAG,WAAW,CAAC,OAAO,CACzC,OAAO,CAAC,QAAQ,CAAC,OAAO,IAAI,EAAE,EAC9B,OAAO,CAAC,QAAQ,CAAC,KAAK,EACtB,SAAS,EAAE,4CAA4C;IACvD,SAAS,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAC1C,CAAC;IACF,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAExC,IAAI,QAAQ,GAAgB,eAAe,CAAC;IAC5C,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QAC3B,QAAQ,GAAG,gBAAgB,CACzB,OAAO,CAAC,QAAQ,CAAC,KAAK,EACtB,QAAQ,EACR,KAAK,EACL,KAAK,EACL,UAAU,EACV,SAAS,CACV,CAAC;IACJ,CAAC;IAED,MAAM,gBAAgB,GAAG,iBAAiB,CACxC,OAAO,CAAC,WAAW,CAAC,WAAW,EAC/B,WAAW,CACZ,CAAC;IACF,MAAM,eAAe,GAAG,iBAAiB,CACvC,OAAO,CAAC,WAAW,CAAC,UAAU,EAC9B,UAAU,CACX,CAAC;IAEF,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,SAAS,CAAC,YAAY,CAAC,GAAG,MAAM,CAAC;IAEjC,MAAM,IAAI,GAAG,IAAI,WAAW,CAC1B,KAAK,EACL,QAAQ,EACR,gBAAgB,EAChB,eAAe,EACf,SAAS,CAAC,EAAE,KAAK,YAAY,EAC7B,MAAM,CACP,CAAC;IACF,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEvB,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACxB,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAE3B,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,qBAAqB,CAAC,SAAoB;IACjD,IAAI,SAAS,CAAC,IAAI,KAAK,oBAAoB,EAAE,CAAC;QAC5C,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,SAAS,CAAC,IAAI,KAAK,KAAK,IAAI,SAAS,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;QACxD,OAAO,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,iBAAiB,CACxB,MAAyB,EACzB,UAAkB;IAElB,OAAO,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;AACrE,CAAC;AAED,SAAS,eAAe,CAAC,KAAY,EAAE,YAA2B;IAChE,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QACpD,eAAe,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;IACzC,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,SAAS,CACvB,GAAQ,EACR,KAA0B,EAC1B,YAA2B;IAE3B,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACzC,eAAe,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACrC,OAAO,eAAe,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,gBAAgB,CACvB,SAAoB,EACpB,UAAuB;IAEvB,IAAI,SAAS,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAChC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,IAAI,SAAS,CAAC,IAAI,KAAK,oBAAoB,EAAE,CAAC;QAC5C,MAAM,MAAM,GAAI,SAA+C,CAC7D,YAAY,CACb,CAAC;QACF,MAAM,UAAU,GAAG,MAAM,KAAK,SAAS,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAElE,OAAO;YACL,GAAG,SAAS;YACZ,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI;YACxC,OAAO,EAAE;gBACP,GAAG,SAAS,CAAC,OAAO;gBACpB,QAAQ,EAAE;oBACR,GAAG,SAAS,CAAC,OAAO,CAAC,QAAQ;oBAC7B,KAAK,EAAE,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK;wBACrC,CAAC,CAAC,gBAAgB,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;wBAChE,CAAC,CAAC,SAAS;iBACd;aACF;SACF,CAAC;IACJ,CAAC;IAED,OAAO;QACL,GAAG,SAAS;QACZ,UAAU,EAAE,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;KAC3E,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,GAAQ,EAAE,KAAY;IAC7C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACzD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO;QACL,GAAG,GAAG;QACN,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS;QACtE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE;YAC9B,MAAM,KAAK,GAAG,IAAI,CAChB,GAAG,CAAC,QAAQ,CAAC,KAAK,EAClB,kCAAkC,CACnC,CAAC;YACF,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACtC,OAAO;gBACL,GAAG,GAAG;gBACN,QAAQ,EAAE,OAAO;oBACf,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC;oBACxC,CAAC,CAAC,GAAG,CAAC,QAAQ;aACjB,CAAC;QACJ,CAAC,CAAC;KACH,CAAC;AACJ,CAAC"}

package/out/zql/src/planner/planner-connection.d.ts

@@ -0,0 +1,119 @@
+import type { Condition, Ordering } from '../../../zero-protocol/src/ast.ts';
+import { type PlannerConstraint } from './planner-constraint.ts';
+import type { CostEstimate, JoinOrConnection, PlannerNode } from './planner-node.ts';
+/**
+ * Represents a connection to a source (table scan).
+ *
+ * # Dual State Pattern
+ * Like all planner nodes, PlannerConnection separates:
+ * 1. immutable structure: Ordering, filters, cost model (set at construction)
+ * 2. mutable state: Pinned status, constraints (mutated during planning)
+ *
+ * # Cost Estimation
+ * The ordering and filters determine the initial cost. As planning progresses,
+ * constraints from parent joins refine the cost estimate.
+ *
+ * # Constraint Flow
+ * When a connection is pinned as the outer loop, it reveals constraints for
+ * connected joins. These constraints propagate through the graph, allowing
+ * other connections to update their cost estimates.
+ *
+ * Example:
+ *
+ * ```ts
+ * builder.issue.whereExists('assignee', a => a.where('name', 'Alice'))
+ * ```
+ *
+ * ```
+ * [issue]  [assignee]
+ *   |         |
+ *   |         +-- where name = 'Alice'
+ *    \        /
+ *     \      /
+ *      [join]
+ *        |
+ * ```
+ *
+ * - Initial state: Both connections have no constraints, costs are unconstrained
+ * - If `issue` chosen first: Reveals constraint `assignee_id` for assignee connection
+ * - If `assignee` chosen first: Reveals constraint `assignee_id` for issue connection
+ * - Updated costs guide the next selection
+ *
+ * # Lifecycle
+ * 1. Construct with immutable structure (ordering, filters, cost model)
+ * 2. Wire to output node during graph construction
+ * 3. Planning mutates pinned status and accumulates constraints
+ * 4. reset() clears mutable state for replanning
+ */
+export declare class PlannerConnection {
+    #private;
+    readonly kind: "connection";
+    readonly table: string;
+    readonly name: string;
+    readonly selectivity: number;
+    /**
+     * Current limit during planning. Can be cleared (set to undefined) when a
+     * parent join is flipped, indicating this connection is now in an outer loop
+     * and should not be limited by EXISTS semantics.
+     */
+    limit: number | undefined;
+    constructor(table: string, model: ConnectionCostModel, sort: Ordering, filters: Condition | undefined, baseConstraints?: PlannerConstraint, limit?: number, name?: string);
+    setOutput(node: PlannerNode): void;
+    get output(): PlannerNode;
+    closestJoinOrSource(): JoinOrConnection;
+    /**
+     * Constraints are uniquely identified by their path through the
+     * graph.
+     *
+     * FO represents all sub-joins as a single path.
+     * UFO represents each sub-join as a separate path.
+     * The first branch in a UFO will match the path of FO so no re-set needs to happen
+     * when swapping from FO to UFO.
+     *
+     * FO swaps to UFO when a join inside FO-FI gets flipped.
+     *
+     * The max of the last element of the paths is the number of
+     * root branches.
+     */
+    propagateConstraints(path: number[], c: PlannerConstraint | undefined): void;
+    estimateCost(branchPattern?: number[]): CostEstimate;
+    /**
+     * Remove the limit from this connection.
+     * Called when a parent join is flipped, making this connection part of an
+     * outer loop that should produce all rows rather than stopping at the limit.
+     */
+    unlimit(): void;
+    /**
+     * Propagate unlimiting when a parent join is flipped.
+     * For connections, we simply remove the limit.
+     */
+    propagateUnlimitFromFlippedJoin(): void;
+    reset(): void;
+    /**
+     * Capture constraint state for snapshotting.
+     * Used by PlannerGraph to save/restore planning state.
+     */
+    captureConstraints(): Map<string, PlannerConstraint | undefined>;
+    /**
+     * Restore constraint state from a snapshot.
+     * Used by PlannerGraph to restore planning state.
+     */
+    restoreConstraints(constraints: Map<string, PlannerConstraint | undefined>): void;
+    /**
+     * Get current constraints for debugging.
+     * Returns a copy of the constraints map.
+     */
+    getConstraintsForDebug(): Map<string, PlannerConstraint | undefined>;
+    /**
+     * Get estimated cost for each constraint branch.
+     * Returns a map of constraint key to cost estimate.
+     * Forces cost calculation if not already cached.
+     */
+    getConstraintCostsForDebug(): Map<string, CostEstimate>;
+}
+export type CostModelCost = {
+    startupCost: number;
+    rows: number;
+};
+export type ConnectionCostModel = (table: string, sort: Ordering, filters: Condition | undefined, constraint: PlannerConstraint | undefined) => CostModelCost;
+//# sourceMappingURL=planner-connection.d.ts.map

package/out/zql/src/planner/planner-connection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-connection.d.ts","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-connection.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,SAAS,EAAE,QAAQ,EAAC,MAAM,mCAAmC,CAAC;AAC3E,OAAO,EAEL,KAAK,iBAAiB,EACvB,MAAM,yBAAyB,CAAC;AACjC,OAAO,KAAK,EACV,YAAY,EACZ,gBAAgB,EAChB,WAAW,EACZ,MAAM,mBAAmB,CAAC;AAE3B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AACH,qBAAa,iBAAiB;;IAC5B,QAAQ,CAAC,IAAI,EAAG,YAAY,CAAU;IAQtC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAGtB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAM7B;;;;OAIG;IACH,KAAK,EAAE,MAAM,GAAG,SAAS,CAAC;gBA2BxB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,mBAAmB,EAC1B,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,SAAS,GAAG,SAAS,EAC9B,eAAe,CAAC,EAAE,iBAAiB,EACnC,KAAK,CAAC,EAAE,MAAM,EACd,IAAI,CAAC,EAAE,MAAM;IA2Bf,SAAS,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IAIlC,IAAI,MAAM,IAAI,WAAW,CAGxB;IAED,mBAAmB,IAAI,gBAAgB;IAIvC;;;;;;;;;;;;;OAaG;IACH,oBAAoB,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,iBAAiB,GAAG,SAAS,GAAG,IAAI;IAS5E,YAAY,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,GAAG,YAAY;IAmHpD;;;;OAIG;IACH,OAAO,IAAI,IAAI;IASf;;;OAGG;IACH,+BAA+B,IAAI,IAAI;IAIvC,KAAK;IASL;;;OAGG;IACH,kBAAkB,IAAI,GAAG,CAAC,MAAM,EAAE,iBAAiB,GAAG,SAAS,CAAC;IAIhE;;;OAGG;IACH,kBAAkB,CAChB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,GAAG,SAAS,CAAC,GACtD,IAAI;IAWP;;;OAGG;IACH,sBAAsB,IAAI,GAAG,CAAC,MAAM,EAAE,iBAAiB,GAAG,SAAS,CAAC;IAIpE;;;;OAIG;IACH,0BAA0B,IAAI,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC;CAMxD;AAED,MAAM,MAAM,aAAa,GAAG;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAC,CAAC;AAChE,MAAM,MAAM,mBAAmB,GAAG,CAChC,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,SAAS,GAAG,SAAS,EAC9B,UAAU,EAAE,iBAAiB,GAAG,SAAS,KACtC,aAAa,CAAC"}

package/out/zql/src/planner/planner-connection.js

@@ -0,0 +1,301 @@
+import { assert } from "../../../shared/src/asserts.js";
+import { mergeConstraints, } from "./planner-constraint.js";
+/**
+ * Represents a connection to a source (table scan).
+ *
+ * # Dual State Pattern
+ * Like all planner nodes, PlannerConnection separates:
+ * 1. immutable structure: Ordering, filters, cost model (set at construction)
+ * 2. mutable state: Pinned status, constraints (mutated during planning)
+ *
+ * # Cost Estimation
+ * The ordering and filters determine the initial cost. As planning progresses,
+ * constraints from parent joins refine the cost estimate.
+ *
+ * # Constraint Flow
+ * When a connection is pinned as the outer loop, it reveals constraints for
+ * connected joins. These constraints propagate through the graph, allowing
+ * other connections to update their cost estimates.
+ *
+ * Example:
+ *
+ * ```ts
+ * builder.issue.whereExists('assignee', a => a.where('name', 'Alice'))
+ * ```
+ *
+ * ```
+ * [issue]  [assignee]
+ *   |         |
+ *   |         +-- where name = 'Alice'
+ *    \        /
+ *     \      /
+ *      [join]
+ *        |
+ * ```
+ *
+ * - Initial state: Both connections have no constraints, costs are unconstrained
+ * - If `issue` chosen first: Reveals constraint `assignee_id` for assignee connection
+ * - If `assignee` chosen first: Reveals constraint `assignee_id` for issue connection
+ * - Updated costs guide the next selection
+ *
+ * # Lifecycle
+ * 1. Construct with immutable structure (ordering, filters, cost model)
+ * 2. Wire to output node during graph construction
+ * 3. Planning mutates pinned status and accumulates constraints
+ * 4. reset() clears mutable state for replanning
+ */
+export class PlannerConnection {
+    kind = 'connection';
+    // ========================================================================
+    // IMMUTABLE STRUCTURE (set during construction, never changes)
+    // ========================================================================
+    #sort;
+    #filters;
+    #model;
+    table;
+    name; // Human-readable name for debugging (defaults to table name)
+    #baseConstraints; // Constraints from parent correlation
+    #baseLimit; // Original limit from query structure (never modified)
+    selectivity; // Fraction of rows passing filters (1.0 = no filtering)
+    #output; // Set once during graph construction
+    // ========================================================================
+    // MUTABLE PLANNING STATE (changes during plan search)
+    // ========================================================================
+    /**
+     * Current limit during planning. Can be cleared (set to undefined) when a
+     * parent join is flipped, indicating this connection is now in an outer loop
+     * and should not be limited by EXISTS semantics.
+     */
+    limit;
+    /**
+     * Constraints accumulated from parent joins during planning.
+     * Key is a path through the graph (e.g., "0,1" for branch pattern [0,1]).
+     *
+     * Undefined constraints are possible when a FO converts to UFO and only
+     * a single join in the UFO is flipped - other branches report undefined.
+     */
+    #constraints;
+    /**
+     * Cached total cost (sum of all branches) to avoid redundant calculations.
+     * Invalidated when constraints change.
+     */
+    #cachedTotalCost = undefined;
+    /**
+     * Cached per-constraint costs to avoid redundant cost model calls.
+     * Maps constraint key (branch pattern string) to computed cost.
+     * Invalidated when constraints change.
+     */
+    #cachedConstraintCosts = new Map();
+    #costDirty = true;
+    constructor(table, model, sort, filters, baseConstraints, limit, name) {
+        this.table = table;
+        this.name = name ?? table;
+        this.#sort = sort;
+        this.#filters = filters;
+        this.#model = model;
+        this.#baseConstraints = baseConstraints;
+        this.#baseLimit = limit;
+        this.limit = limit;
+        this.#constraints = new Map();
+        // Compute selectivity for EXISTS child connections (baseLimit === 1)
+        // Selectivity = fraction of rows that pass filters
+        if (limit !== undefined && filters) {
+            const costWithFilters = model(table, sort, filters, undefined);
+            const costWithoutFilters = model(table, sort, undefined, undefined);
+            this.selectivity =
+                costWithoutFilters.rows > 0
+                    ? costWithFilters.rows / costWithoutFilters.rows
+                    : 1.0;
+        }
+        else {
+            // Root connections or connections without filters
+            this.selectivity = 1.0;
+        }
+    }
+    setOutput(node) {
+        this.#output = node;
+    }
+    get output() {
+        assert(this.#output !== undefined, 'Output not set');
+        return this.#output;
+    }
+    closestJoinOrSource() {
+        return 'connection';
+    }
+    /**
+     * Constraints are uniquely identified by their path through the
+     * graph.
+     *
+     * FO represents all sub-joins as a single path.
+     * UFO represents each sub-join as a separate path.
+     * The first branch in a UFO will match the path of FO so no re-set needs to happen
+     * when swapping from FO to UFO.
+     *
+     * FO swaps to UFO when a join inside FO-FI gets flipped.
+     *
+     * The max of the last element of the paths is the number of
+     * root branches.
+     */
+    propagateConstraints(path, c) {
+        const key = path.join(',');
+        this.#constraints.set(key, c);
+        // Constraints changed, invalidate cost caches
+        this.#cachedTotalCost = undefined;
+        this.#cachedConstraintCosts.clear();
+        this.#costDirty = true;
+    }
+    estimateCost(branchPattern) {
+        // If no branch pattern specified, return sum of all branches
+        // This is used by getUnpinnedConnectionCosts to get total cost
+        if (branchPattern === undefined) {
+            // Return cached total cost if still valid
+            if (!this.#costDirty && this.#cachedTotalCost !== undefined) {
+                return this.#cachedTotalCost;
+            }
+            // Calculate fresh cost - sum of all branch costs
+            let totalRows = 0;
+            let maxStartupCost = 0;
+            if (this.#constraints.size === 0) {
+                // No constraints - compute unconstrained cost (but still merge base constraints)
+                const key = '';
+                let cost = this.#cachedConstraintCosts.get(key);
+                if (cost === undefined) {
+                    // Merge base constraints even when no propagated constraints
+                    const { startupCost, rows } = this.#model(this.table, this.#sort, this.#filters, this.#baseConstraints);
+                    cost = {
+                        rows,
+                        runningCost: rows,
+                        startupCost,
+                        selectivity: this.selectivity,
+                        limit: this.limit,
+                    };
+                    this.#cachedConstraintCosts.set(key, cost);
+                }
+                totalRows = cost.rows;
+                maxStartupCost = cost.startupCost;
+            }
+            else {
+                // Sum costs for all constraint branches
+                for (const [key, constraint] of this.#constraints.entries()) {
+                    let cost = this.#cachedConstraintCosts.get(key);
+                    if (cost === undefined) {
+                        // Merge base constraints with propagated constraints
+                        const mergedConstraint = mergeConstraints(this.#baseConstraints, constraint);
+                        const { startupCost, rows } = this.#model(this.table, this.#sort, this.#filters, mergedConstraint);
+                        cost = {
+                            rows,
+                            runningCost: rows,
+                            startupCost,
+                            selectivity: this.selectivity,
+                            limit: this.limit,
+                        };
+                        this.#cachedConstraintCosts.set(key, cost);
+                    }
+                    totalRows += cost.rows;
+                    // TODO: if no branch pattern is specified, should we sum startup costs?
+                    maxStartupCost = Math.max(maxStartupCost, cost.startupCost);
+                }
+            }
+            const ret = {
+                rows: totalRows,
+                runningCost: totalRows,
+                startupCost: maxStartupCost,
+                selectivity: this.selectivity,
+                limit: this.limit,
+            };
+            // Cache total and mark as clean
+            this.#cachedTotalCost = ret;
+            this.#costDirty = false;
+            return ret;
+        }
+        // Branch pattern specified - return cost for this specific branch
+        const key = branchPattern.join(',');
+        // Check per-constraint cache first
+        let cost = this.#cachedConstraintCosts.get(key);
+        if (cost !== undefined) {
+            return cost;
+        }
+        // Cache miss - compute and cache
+        const constraint = this.#constraints.get(key);
+        // Merge base constraints with propagated constraints
+        const mergedConstraint = mergeConstraints(this.#baseConstraints, constraint);
+        const { startupCost, rows } = this.#model(this.table, this.#sort, this.#filters, mergedConstraint);
+        cost = {
+            rows,
+            runningCost: rows,
+            startupCost,
+            selectivity: this.selectivity,
+            limit: this.limit,
+        };
+        this.#cachedConstraintCosts.set(key, cost);
+        return cost;
+    }
+    /**
+     * Remove the limit from this connection.
+     * Called when a parent join is flipped, making this connection part of an
+     * outer loop that should produce all rows rather than stopping at the limit.
+     */
+    unlimit() {
+        if (this.limit !== undefined) {
+            this.limit = undefined;
+            // Limit changes do not impact connection costs.
+            // Limit is taken into account at the join level.
+            // Given that, we do not need to invalidate cost caches here.
+        }
+    }
+    /**
+     * Propagate unlimiting when a parent join is flipped.
+     * For connections, we simply remove the limit.
+     */
+    propagateUnlimitFromFlippedJoin() {
+        this.unlimit();
+    }
+    reset() {
+        this.#constraints.clear();
+        this.limit = this.#baseLimit;
+        // Clear all cost caches
+        this.#cachedTotalCost = undefined;
+        this.#cachedConstraintCosts.clear();
+        this.#costDirty = true;
+    }
+    /**
+     * Capture constraint state for snapshotting.
+     * Used by PlannerGraph to save/restore planning state.
+     */
+    captureConstraints() {
+        return new Map(this.#constraints);
+    }
+    /**
+     * Restore constraint state from a snapshot.
+     * Used by PlannerGraph to restore planning state.
+     */
+    restoreConstraints(constraints) {
+        this.#constraints.clear();
+        for (const [key, value] of constraints) {
+            this.#constraints.set(key, value);
+        }
+        // Constraints changed, invalidate cost caches
+        this.#cachedTotalCost = undefined;
+        this.#cachedConstraintCosts.clear();
+        this.#costDirty = true;
+    }
+    /**
+     * Get current constraints for debugging.
+     * Returns a copy of the constraints map.
+     */
+    getConstraintsForDebug() {
+        return new Map(this.#constraints);
+    }
+    /**
+     * Get estimated cost for each constraint branch.
+     * Returns a map of constraint key to cost estimate.
+     * Forces cost calculation if not already cached.
+     */
+    getConstraintCostsForDebug() {
+        // Trigger cost calculation to populate cache
+        this.estimateCost(undefined);
+        // Return copy of cached costs
+        return new Map(this.#cachedConstraintCosts);
+    }
+}
+//# sourceMappingURL=planner-connection.js.map

package/out/zql/src/planner/planner-connection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-connection.js","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-connection.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAEtD,OAAO,EACL,gBAAgB,GAEjB,MAAM,yBAAyB,CAAC;AAOjC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AACH,MAAM,OAAO,iBAAiB;IACnB,IAAI,GAAG,YAAqB,CAAC;IAEtC,2EAA2E;IAC3E,+DAA+D;IAC/D,2EAA2E;IAClE,KAAK,CAAW;IAChB,QAAQ,CAAwB;IAChC,MAAM,CAAsB;IAC5B,KAAK,CAAS;IACd,IAAI,CAAS,CAAC,6DAA6D;IAC3E,gBAAgB,CAAgC,CAAC,sCAAsC;IACvF,UAAU,CAAqB,CAAC,uDAAuD;IACvF,WAAW,CAAS,CAAC,wDAAwD;IACtF,OAAO,CAA2B,CAAC,qCAAqC;IAExE,2EAA2E;IAC3E,sDAAsD;IACtD,2EAA2E;IAC3E;;;;OAIG;IACH,KAAK,CAAqB;IAE1B;;;;;;OAMG;IACM,YAAY,CAA6C;IAElE;;;OAGG;IACH,gBAAgB,GAA6B,SAAS,CAAC;IAEvD;;;;OAIG;IACH,sBAAsB,GAA8B,IAAI,GAAG,EAAE,CAAC;IAE9D,UAAU,GAAG,IAAI,CAAC;IAElB,YACE,KAAa,EACb,KAA0B,EAC1B,IAAc,EACd,OAA8B,EAC9B,eAAmC,EACnC,KAAc,EACd,IAAa;QAEb,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,KAAK,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;QACxC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;QAE9B,qEAAqE;QACrE,mDAAmD;QACnD,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,EAAE,CAAC;YACnC,MAAM,eAAe,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;YAC/D,MAAM,kBAAkB,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACpE,IAAI,CAAC,WAAW;gBACd,kBAAkB,CAAC,IAAI,GAAG,CAAC;oBACzB,CAAC,CAAC,eAAe,CAAC,IAAI,GAAG,kBAAkB,CAAC,IAAI;oBAChD,CAAC,CAAC,GAAG,CAAC;QACZ,CAAC;aAAM,CAAC;YACN,kDAAkD;YAClD,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;QACzB,CAAC;IACH,CAAC;IAED,SAAS,CAAC,IAAiB;QACzB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACtB,CAAC;IAED,IAAI,MAAM;QACR,MAAM,CAAC,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,gBAAgB,CAAC,CAAC;QACrD,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,mBAAmB;QACjB,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,oBAAoB,CAAC,IAAc,EAAE,CAAgC;QACnE,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC9B,8CAA8C;QAC9C,IAAI,CAAC,gBAAgB,GAAG,SAAS,CAAC;QAClC,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC;QACpC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;IACzB,CAAC;IAED,YAAY,CAAC,aAAwB;QACnC,6DAA6D;QAC7D,+DAA+D;QAC/D,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;YAChC,0CAA0C;YAC1C,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;gBAC5D,OAAO,IAAI,CAAC,gBAAgB,CAAC;YAC/B,CAAC;YAED,iDAAiD;YACjD,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,IAAI,cAAc,GAAG,CAAC,CAAC;YACvB,IAAI,IAAI,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACjC,iFAAiF;gBACjF,MAAM,GAAG,GAAG,EAAE,CAAC;gBACf,IAAI,IAAI,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,6DAA6D;oBAC7D,MAAM,EAAC,WAAW,EAAE,IAAI,EAAC,GAAG,IAAI,CAAC,MAAM,CACrC,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,gBAAgB,CACtB,CAAC;oBACF,IAAI,GAAG;wBACL,IAAI;wBACJ,WAAW,EAAE,IAAI;wBACjB,WAAW;wBACX,WAAW,EAAE,IAAI,CAAC,WAAW;wBAC7B,KAAK,EAAE,IAAI,CAAC,KAAK;qBAClB,CAAC;oBACF,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAC7C,CAAC;gBACD,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;gBACtB,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC;YACpC,CAAC;iBAAM,CAAC;gBACN,wCAAwC;gBACxC,KAAK,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC5D,IAAI,IAAI,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;wBACvB,qDAAqD;wBACrD,MAAM,gBAAgB,GAAG,gBAAgB,CACvC,IAAI,CAAC,gBAAgB,EACrB,UAAU,CACX,CAAC;wBACF,MAAM,EAAC,WAAW,EAAE,IAAI,EAAC,GAAG,IAAI,CAAC,MAAM,CACrC,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,QAAQ,EACb,gBAAgB,CACjB,CAAC;wBACF,IAAI,GAAG;4BACL,IAAI;4BACJ,WAAW,EAAE,IAAI;4BACjB,WAAW;4BACX,WAAW,EAAE,IAAI,CAAC,WAAW;4BAC7B,KAAK,EAAE,IAAI,CAAC,KAAK;yBAClB,CAAC;wBACF,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;oBAC7C,CAAC;oBACD,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC;oBACvB,wEAAwE;oBACxE,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC9D,CAAC;YACH,CAAC;YAED,MAAM,GAAG,GAAG;gBACV,IAAI,EAAE,SAAS;gBACf,WAAW,EAAE,SAAS;gBACtB,WAAW,EAAE,cAAc;gBAC3B,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,KAAK,EAAE,IAAI,CAAC,KAAK;aAClB,CAAC;YAEF,gCAAgC;YAChC,IAAI,CAAC,gBAAgB,GAAG,GAAG,CAAC;YAC5B,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;YAExB,OAAO,GAAG,CAAC;QACb,CAAC;QAED,kEAAkE;QAClE,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEpC,mCAAmC;QACnC,IAAI,IAAI,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,iCAAiC;QACjC,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9C,qDAAqD;QACrD,MAAM,gBAAgB,GAAG,gBAAgB,CACvC,IAAI,CAAC,gBAAgB,EACrB,UAAU,CACX,CAAC;QACF,MAAM,EAAC,WAAW,EAAE,IAAI,EAAC,GAAG,IAAI,CAAC,MAAM,CACrC,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,QAAQ,EACb,gBAAgB,CACjB,CAAC;QACF,IAAI,GAAG;YACL,IAAI;YACJ,WAAW,EAAE,IAAI;YACjB,WAAW;YACX,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC;QACF,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAE3C,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,gDAAgD;YAChD,iDAAiD;YACjD,6DAA6D;QAC/D,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,+BAA+B;QAC7B,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;QAC7B,wBAAwB;QACxB,IAAI,CAAC,gBAAgB,GAAG,SAAS,CAAC;QAClC,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC;QACpC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,kBAAkB;QAChB,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAChB,WAAuD;QAEvD,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;YACvC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,8CAA8C;QAC9C,IAAI,CAAC,gBAAgB,GAAG,SAAS,CAAC;QAClC,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC;QACpC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,sBAAsB;QACpB,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACH,0BAA0B;QACxB,6CAA6C;QAC7C,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAC7B,8BAA8B;QAC9B,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;IAC9C,CAAC;CACF"}

package/out/zql/src/planner/planner-constraint.d.ts

@@ -0,0 +1,14 @@
+/**
+ * We do not know the value a constraint will take until runtime.
+ *
+ * However, we do know the column.
+ *
+ * E.g., we know that `issue.assignee_id` will be constrained to typeof issue.assignee_id.
+ */
+export type PlannerConstraint = Record<string, undefined>;
+/**
+ * Multiple flipped joins will contribute extra constraints to a parent join.
+ * These need to be merged.
+ */
+export declare function mergeConstraints(a: PlannerConstraint | undefined, b: PlannerConstraint | undefined): PlannerConstraint | undefined;
+//# sourceMappingURL=planner-constraint.d.ts.map

package/out/zql/src/planner/planner-constraint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-constraint.d.ts","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-constraint.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,MAAM,iBAAiB,GAAG,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;AAE1D;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,CAAC,EAAE,iBAAiB,GAAG,SAAS,EAChC,CAAC,EAAE,iBAAiB,GAAG,SAAS,GAC/B,iBAAiB,GAAG,SAAS,CAI/B"}

package/out/zql/src/planner/planner-constraint.js

@@ -0,0 +1,12 @@
+/**
+ * Multiple flipped joins will contribute extra constraints to a parent join.
+ * These need to be merged.
+ */
+export function mergeConstraints(a, b) {
+    if (!a)
+        return b;
+    if (!b)
+        return a;
+    return { ...a, ...b };
+}
+//# sourceMappingURL=planner-constraint.js.map

package/out/zql/src/planner/planner-constraint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-constraint.js","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-constraint.ts"],"names":[],"mappings":"AASA;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,CAAgC,EAChC,CAAgC;IAEhC,IAAI,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IACjB,IAAI,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IACjB,OAAO,EAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAC,CAAC;AACtB,CAAC"}