@rocicorp/zero 0.25.0 → 0.26.0-canary.0

package/out/zql/src/planner/planner-fan-in.js

@@ -1,167 +1,165 @@
 import { assert } from "../../../shared/src/asserts.js";
-/**
- * A PlannerFanIn node can either be a normal FanIn or UnionFanIn.
- *
- * These have different performance characteristics so we need to distinguish them.
- *
- * A normal FanIn only does a single fetch to FanOut, regardless of how many internal
- * branches / inputs it has.
- *
- * A UnionFanIn does a fetch per internal branch / input. This causes an exponential
- * increase in cost if many UnionFanIns are chained after on another. E.g., `(A or B) AND (C or D)`.
- *
- * To capture this cost blow-up, union fan in assigns different branch patterns to their inputs.
- *
- * Since UFI will generate a unique branch pattern per input, planner-connection will yield a higher cost
- * each time a UFI is present. planner-connection will return the sum of the costs of each unique branch pattern.
- */
-export class PlannerFanIn {
-    kind = 'fan-in';
-    #type;
-    #output;
-    #inputs;
-    constructor(inputs) {
-        this.#type = 'FI';
-        this.#inputs = inputs;
+import { omitFanout } from "./planner-node.js";
+class PlannerFanIn {
+  kind = "fan-in";
+  #type;
+  #output;
+  #inputs;
+  constructor(inputs) {
+    this.#type = "FI";
+    this.#inputs = inputs;
+  }
+  get type() {
+    return this.#type;
+  }
+  closestJoinOrSource() {
+    return "join";
+  }
+  setOutput(node) {
+    this.#output = node;
+  }
+  get output() {
+    assert(this.#output !== void 0, "Output not set");
+    return this.#output;
+  }
+  reset() {
+    this.#type = "FI";
+  }
+  convertToUFI() {
+    this.#type = "UFI";
+  }
+  /**
+   * Propagate unlimiting when a parent join is flipped.
+   * Fan-in propagates to all of its inputs.
+   */
+  propagateUnlimitFromFlippedJoin() {
+    for (const input of this.#inputs) {
+      if ("propagateUnlimitFromFlippedJoin" in input && typeof input.propagateUnlimitFromFlippedJoin === "function") {
+        input.propagateUnlimitFromFlippedJoin();
+      }
     }
-    get type() {
-        return this.#type;
-    }
-    closestJoinOrSource() {
-        return 'join';
-    }
-    setOutput(node) {
-        this.#output = node;
-    }
-    get output() {
-        assert(this.#output !== undefined, 'Output not set');
-        return this.#output;
-    }
-    reset() {
-        this.#type = 'FI';
-    }
-    convertToUFI() {
-        this.#type = 'UFI';
-    }
-    /**
-     * Propagate unlimiting when a parent join is flipped.
-     * Fan-in propagates to all of its inputs.
-     */
-    propagateUnlimitFromFlippedJoin() {
-        for (const input of this.#inputs) {
-            if ('propagateUnlimitFromFlippedJoin' in input &&
-                typeof input.propagateUnlimitFromFlippedJoin === 'function') {
-                input.propagateUnlimitFromFlippedJoin();
-            }
+  }
+  estimateCost(downstreamChildSelectivity, branchPattern, planDebugger) {
+    let totalCost = {
+      returnedRows: 0,
+      cost: 0,
+      scanEst: 0,
+      startupCost: 0,
+      selectivity: 0,
+      limit: void 0,
+      fanout: () => {
+        throw new Error("Failed to set fanout model");
+      }
+    };
+    if (this.#type === "FI") {
+      const updatedPattern = [0, ...branchPattern];
+      let maxrows = 0;
+      let maxRunningCost = 0;
+      let maxStartupCost = 0;
+      let maxScanEst = 0;
+      let noMatchProb = 1;
+      for (const input of this.#inputs) {
+        const cost = input.estimateCost(
+          downstreamChildSelectivity,
+          updatedPattern,
+          planDebugger
+        );
+        totalCost.fanout = cost.fanout;
+        if (cost.returnedRows > maxrows) {
+          maxrows = cost.returnedRows;
         }
-    }
-    estimateCost(downstreamChildSelectivity, branchPattern, planDebugger) {
-        // FanIn always sums costs of its inputs
-        // But it needs to pass the correct branch pattern to each input
-        let totalCost = {
-            returnedRows: 0,
-            cost: 0,
-            scanEst: 0,
-            startupCost: 0,
-            selectivity: 0,
-            limit: undefined,
-        };
-        if (this.#type === 'FI') {
-            // Normal FanIn: all inputs get the same branch pattern with 0 prepended
-            const updatedPattern = [0, ...branchPattern];
-            let maxrows = 0;
-            let maxRunningCost = 0;
-            let maxStartupCost = 0;
-            let maxScanEst = 0;
-            let noMatchProb = 1.0;
-            for (const input of this.#inputs) {
-                const cost = input.estimateCost(downstreamChildSelectivity, updatedPattern, planDebugger);
-                if (cost.returnedRows > maxrows) {
-                    maxrows = cost.returnedRows;
-                }
-                if (cost.cost > maxRunningCost) {
-                    maxRunningCost = cost.cost;
-                }
-                if (cost.startupCost > maxStartupCost) {
-                    maxStartupCost = cost.startupCost;
-                }
-                if (cost.scanEst > maxScanEst) {
-                    maxScanEst = cost.scanEst;
-                }
-                // OR branches: combine selectivities assuming independent events
-                // P(A OR B) = 1 - (1-A)(1-B)
-                // Track probability of NO match in any branch
-                noMatchProb *= 1 - cost.selectivity;
-                // all inputs should have the same limit.
-                assert(totalCost.limit === undefined || cost.limit === totalCost.limit, 'All FanIn inputs should have the same limit');
-                totalCost.limit = cost.limit;
-            }
-            totalCost.returnedRows = maxrows;
-            totalCost.cost = maxRunningCost;
-            totalCost.selectivity = 1 - noMatchProb;
-            totalCost.startupCost = maxStartupCost;
-            totalCost.scanEst = maxScanEst;
-        }
-        else {
-            // Union FanIn (UFI): each input gets unique branch pattern
-            let i = 0;
-            let noMatchProb = 1.0;
-            for (const input of this.#inputs) {
-                const updatedPattern = [i, ...branchPattern];
-                const cost = input.estimateCost(downstreamChildSelectivity, updatedPattern, planDebugger);
-                totalCost.returnedRows += cost.returnedRows;
-                totalCost.cost += cost.cost;
-                totalCost.scanEst += cost.scanEst;
-                totalCost.startupCost = totalCost.startupCost + cost.startupCost;
-                // OR branches: combine selectivities assuming independent events
-                // P(A OR B) = 1 - (1-A)(1-B)
-                // Track probability of NO match in any branch
-                noMatchProb *= 1 - cost.selectivity;
-                // all inputs should have the same limit.
-                assert(totalCost.limit === undefined || cost.limit === totalCost.limit, 'All FanIn inputs should have the same limit');
-                totalCost.limit = cost.limit;
-                i++;
-            }
-            totalCost.selectivity = 1 - noMatchProb;
+        if (cost.cost > maxRunningCost) {
+          maxRunningCost = cost.cost;
         }
-        planDebugger?.log({
-            type: 'node-cost',
-            nodeType: 'fan-in',
-            node: this.#type,
-            branchPattern,
-            downstreamChildSelectivity,
-            costEstimate: totalCost,
-        });
-        return totalCost;
-    }
-    propagateConstraints(branchPattern, constraint, from, planDebugger) {
-        planDebugger?.log({
-            type: 'node-constraint',
-            nodeType: 'fan-in',
-            node: this.#type,
-            branchPattern,
-            constraint,
-            from: from?.kind ?? 'unknown',
-        });
-        if (this.#type === 'FI') {
-            const updatedPattern = [0, ...branchPattern];
-            /**
-             * All inputs get the same branch pattern.
-             * 1. They cannot contribute differing constraints to their parent inputs because they are not flipped.
-             *    If they were flipped this would be of type UFI.
-             * 2. All inputs need to be called because they could be pinned. If they are pinned they could have constraints
-             *    to send to their children.
-             */
-            for (const input of this.#inputs) {
-                input.propagateConstraints(updatedPattern, constraint, this, planDebugger);
-            }
-            return;
+        if (cost.startupCost > maxStartupCost) {
+          maxStartupCost = cost.startupCost;
         }
-        let i = 0;
-        for (const input of this.#inputs) {
-            input.propagateConstraints([i, ...branchPattern], constraint, this, planDebugger);
-            i++;
+        if (cost.scanEst > maxScanEst) {
+          maxScanEst = cost.scanEst;
         }
+        noMatchProb *= 1 - cost.selectivity;
+        assert(
+          totalCost.limit === void 0 || cost.limit === totalCost.limit,
+          "All FanIn inputs should have the same limit"
+        );
+        totalCost.limit = cost.limit;
+      }
+      totalCost.returnedRows = maxrows;
+      totalCost.cost = maxRunningCost;
+      totalCost.selectivity = 1 - noMatchProb;
+      totalCost.startupCost = maxStartupCost;
+      totalCost.scanEst = maxScanEst;
+    } else {
+      let i = 0;
+      let noMatchProb = 1;
+      for (const input of this.#inputs) {
+        const updatedPattern = [i, ...branchPattern];
+        const cost = input.estimateCost(
+          downstreamChildSelectivity,
+          updatedPattern,
+          planDebugger
+        );
+        totalCost.fanout = cost.fanout;
+        totalCost.returnedRows += cost.returnedRows;
+        totalCost.cost += cost.cost;
+        totalCost.scanEst += cost.scanEst;
+        totalCost.startupCost = totalCost.startupCost + cost.startupCost;
+        noMatchProb *= 1 - cost.selectivity;
+        assert(
+          totalCost.limit === void 0 || cost.limit === totalCost.limit,
+          "All FanIn inputs should have the same limit"
+        );
+        totalCost.limit = cost.limit;
+        i++;
+      }
+      totalCost.selectivity = 1 - noMatchProb;
+    }
+    if (planDebugger) {
+      planDebugger.log({
+        type: "node-cost",
+        nodeType: "fan-in",
+        node: this.#type,
+        branchPattern,
+        downstreamChildSelectivity,
+        costEstimate: omitFanout(totalCost)
+      });
+    }
+    return totalCost;
+  }
+  propagateConstraints(branchPattern, constraint, from, planDebugger) {
+    planDebugger?.log({
+      type: "node-constraint",
+      nodeType: "fan-in",
+      node: this.#type,
+      branchPattern,
+      constraint,
+      from: from?.kind ?? "unknown"
+    });
+    if (this.#type === "FI") {
+      const updatedPattern = [0, ...branchPattern];
+      for (const input of this.#inputs) {
+        input.propagateConstraints(
+          updatedPattern,
+          constraint,
+          this,
+          planDebugger
+        );
+      }
+      return;
+    }
+    let i = 0;
+    for (const input of this.#inputs) {
+      input.propagateConstraints(
+        [i, ...branchPattern],
+        constraint,
+        this,
+        planDebugger
+      );
+      i++;
     }
+  }
 }
-//# sourceMappingURL=planner-fan-in.js.map
+export {
+  PlannerFanIn
+};
+//# sourceMappingURL=planner-fan-in.js.map

package/out/zql/src/planner/planner-fan-in.js.map

@@ -1 +1 @@
-{"version":3,"file":"planner-fan-in.js","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-fan-in.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAUtD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,YAAY;IACd,IAAI,GAAG,QAAiB,CAAC;IAClC,KAAK,CAAe;IACpB,OAAO,CAA2B;IACzB,OAAO,CAA0C;IAE1D,YAAY,MAA+C;QACzD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,mBAAmB;QACjB,OAAO,MAAM,CAAC;IAChB,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,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,YAAY;QACV,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,+BAA+B;QAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IACE,iCAAiC,IAAI,KAAK;gBAC1C,OAAO,KAAK,CAAC,+BAA+B,KAAK,UAAU,EAC3D,CAAC;gBAEC,KACD,CAAC,+BAA+B,EAAE,CAAC;YACtC,CAAC;QACH,CAAC;IACH,CAAC;IAED,YAAY,CACV,0BAAkC,EAClC,aAAuB,EACvB,YAA2B;QAE3B,wCAAwC;QACxC,gEAAgE;QAChE,IAAI,SAAS,GAAiB;YAC5B,YAAY,EAAE,CAAC;YACf,IAAI,EAAE,CAAC;YACP,OAAO,EAAE,CAAC;YACV,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,CAAC;YACd,KAAK,EAAE,SAAS;SACjB,CAAC;QAEF,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YACxB,wEAAwE;YACxE,MAAM,cAAc,GAAG,CAAC,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC;YAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,cAAc,GAAG,CAAC,CAAC;YACvB,IAAI,cAAc,GAAG,CAAC,CAAC;YACvB,IAAI,UAAU,GAAG,CAAC,CAAC;YAEnB,IAAI,WAAW,GAAG,GAAG,CAAC;YACtB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjC,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAC7B,0BAA0B,EAC1B,cAAc,EACd,YAAY,CACb,CAAC;gBACF,IAAI,IAAI,CAAC,YAAY,GAAG,OAAO,EAAE,CAAC;oBAChC,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC;gBAC9B,CAAC;gBACD,IAAI,IAAI,CAAC,IAAI,GAAG,cAAc,EAAE,CAAC;oBAC/B,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC;gBAC7B,CAAC;gBACD,IAAI,IAAI,CAAC,WAAW,GAAG,cAAc,EAAE,CAAC;oBACtC,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC;gBACpC,CAAC;gBACD,IAAI,IAAI,CAAC,OAAO,GAAG,UAAU,EAAE,CAAC;oBAC9B,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC;gBAC5B,CAAC;gBAED,iEAAiE;gBACjE,6BAA6B;gBAC7B,8CAA8C;gBAC9C,WAAW,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;gBAEpC,yCAAyC;gBACzC,MAAM,CACJ,SAAS,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,EAC/D,6CAA6C,CAC9C,CAAC;gBACF,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YAC/B,CAAC;YAED,SAAS,CAAC,YAAY,GAAG,OAAO,CAAC;YACjC,SAAS,CAAC,IAAI,GAAG,cAAc,CAAC;YAChC,SAAS,CAAC,WAAW,GAAG,CAAC,GAAG,WAAW,CAAC;YACxC,SAAS,CAAC,WAAW,GAAG,cAAc,CAAC;YACvC,SAAS,CAAC,OAAO,GAAG,UAAU,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,2DAA2D;YAC3D,IAAI,CAAC,GAAG,CAAC,CAAC;YAEV,IAAI,WAAW,GAAG,GAAG,CAAC;YACtB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjC,MAAM,cAAc,GAAG,CAAC,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC;gBAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAC7B,0BAA0B,EAC1B,cAAc,EACd,YAAY,CACb,CAAC;gBACF,SAAS,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,CAAC;gBAC5C,SAAS,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;gBAC5B,SAAS,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC;gBAClC,SAAS,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;gBAEjE,iEAAiE;gBACjE,6BAA6B;gBAC7B,8CAA8C;gBAC9C,WAAW,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;gBAEpC,yCAAyC;gBACzC,MAAM,CACJ,SAAS,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK,EAC/D,6CAA6C,CAC9C,CAAC;gBACF,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC7B,CAAC,EAAE,CAAC;YACN,CAAC;YACD,SAAS,CAAC,WAAW,GAAG,CAAC,GAAG,WAAW,CAAC;QAC1C,CAAC;QAED,YAAY,EAAE,GAAG,CAAC;YAChB,IAAI,EAAE,WAAW;YACjB,QAAQ,EAAE,QAAQ;YAClB,IAAI,EAAE,IAAI,CAAC,KAAK;YAChB,aAAa;YACb,0BAA0B;YAC1B,YAAY,EAAE,SAAS;SACxB,CAAC,CAAC;QAEH,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,oBAAoB,CAClB,aAAuB,EACvB,UAAyC,EACzC,IAAkB,EAClB,YAA2B;QAE3B,YAAY,EAAE,GAAG,CAAC;YAChB,IAAI,EAAE,iBAAiB;YACvB,QAAQ,EAAE,QAAQ;YAClB,IAAI,EAAE,IAAI,CAAC,KAAK;YAChB,aAAa;YACb,UAAU;YACV,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,SAAS;SAC9B,CAAC,CAAC;QAEH,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,CAAC,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC;YAC7C;;;;;;eAMG;YACH,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjC,KAAK,CAAC,oBAAoB,CACxB,cAAc,EACd,UAAU,EACV,IAAI,EACJ,YAAY,CACb,CAAC;YACJ,CAAC;YACD,OAAO;QACT,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,oBAAoB,CACxB,CAAC,CAAC,EAAE,GAAG,aAAa,CAAC,EACrB,UAAU,EACV,IAAI,EACJ,YAAY,CACb,CAAC;YACF,CAAC,EAAE,CAAC;QACN,CAAC;IACH,CAAC;CACF"}
+{"version":3,"file":"planner-fan-in.js","sources":["../../../../../zql/src/planner/planner-fan-in.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {PlannerConstraint} from './planner-constraint.ts';\nimport type {PlanDebugger} from './planner-debug.ts';\nimport {omitFanout} from './planner-node.ts';\nimport type {\n  CostEstimate,\n  JoinOrConnection,\n  PlannerNode,\n} from './planner-node.ts';\nimport type {PlannerTerminus} from './planner-terminus.ts';\n\n/**\n * A PlannerFanIn node can either be a normal FanIn or UnionFanIn.\n *\n * These have different performance characteristics so we need to distinguish them.\n *\n * A normal FanIn only does a single fetch to FanOut, regardless of how many internal\n * branches / inputs it has.\n *\n * A UnionFanIn does a fetch per internal branch / input. This causes an exponential\n * increase in cost if many UnionFanIns are chained after on another. E.g., `(A or B) AND (C or D)`.\n *\n * To capture this cost blow-up, union fan in assigns different branch patterns to their inputs.\n *\n * Since UFI will generate a unique branch pattern per input, planner-connection will yield a higher cost\n * each time a UFI is present. planner-connection will return the sum of the costs of each unique branch pattern.\n */\nexport class PlannerFanIn {\n  readonly kind = 'fan-in' as const;\n  #type: 'FI' | 'UFI';\n  #output?: PlannerNode | undefined;\n  readonly #inputs: Exclude<PlannerNode, PlannerTerminus>[];\n\n  constructor(inputs: Exclude<PlannerNode, PlannerTerminus>[]) {\n    this.#type = 'FI';\n    this.#inputs = inputs;\n  }\n\n  get type() {\n    return this.#type;\n  }\n\n  closestJoinOrSource(): JoinOrConnection {\n    return 'join';\n  }\n\n  setOutput(node: PlannerNode): void {\n    this.#output = node;\n  }\n\n  get output(): PlannerNode {\n    assert(this.#output !== undefined, 'Output not set');\n    return this.#output;\n  }\n\n  reset() {\n    this.#type = 'FI';\n  }\n\n  convertToUFI(): void {\n    this.#type = 'UFI';\n  }\n\n  /**\n   * Propagate unlimiting when a parent join is flipped.\n   * Fan-in propagates to all of its inputs.\n   */\n  propagateUnlimitFromFlippedJoin(): void {\n    for (const input of this.#inputs) {\n      if (\n        'propagateUnlimitFromFlippedJoin' in input &&\n        typeof input.propagateUnlimitFromFlippedJoin === 'function'\n      ) {\n        (\n          input as {propagateUnlimitFromFlippedJoin(): void}\n        ).propagateUnlimitFromFlippedJoin();\n      }\n    }\n  }\n\n  estimateCost(\n    downstreamChildSelectivity: number,\n    branchPattern: number[],\n    planDebugger?: PlanDebugger,\n  ): CostEstimate {\n    // FanIn always sums costs of its inputs\n    // But it needs to pass the correct branch pattern to each input\n    let totalCost: CostEstimate = {\n      returnedRows: 0,\n      cost: 0,\n      scanEst: 0,\n      startupCost: 0,\n      selectivity: 0,\n      limit: undefined,\n      fanout: () => {\n        throw new Error('Failed to set fanout model');\n      },\n    };\n\n    if (this.#type === 'FI') {\n      // Normal FanIn: all inputs get the same branch pattern with 0 prepended\n      const updatedPattern = [0, ...branchPattern];\n      let maxrows = 0;\n      let maxRunningCost = 0;\n      let maxStartupCost = 0;\n      let maxScanEst = 0;\n\n      let noMatchProb = 1.0;\n      for (const input of this.#inputs) {\n        const cost = input.estimateCost(\n          downstreamChildSelectivity,\n          updatedPattern,\n          planDebugger,\n        );\n        totalCost.fanout = cost.fanout;\n        if (cost.returnedRows > maxrows) {\n          maxrows = cost.returnedRows;\n        }\n        if (cost.cost > maxRunningCost) {\n          maxRunningCost = cost.cost;\n        }\n        if (cost.startupCost > maxStartupCost) {\n          maxStartupCost = cost.startupCost;\n        }\n        if (cost.scanEst > maxScanEst) {\n          maxScanEst = cost.scanEst;\n        }\n\n        // OR branches: combine selectivities assuming independent events\n        // P(A OR B) = 1 - (1-A)(1-B)\n        // Track probability of NO match in any branch\n        noMatchProb *= 1 - cost.selectivity;\n\n        // all inputs should have the same limit.\n        assert(\n          totalCost.limit === undefined || cost.limit === totalCost.limit,\n          'All FanIn inputs should have the same limit',\n        );\n        totalCost.limit = cost.limit;\n      }\n\n      totalCost.returnedRows = maxrows;\n      totalCost.cost = maxRunningCost;\n      totalCost.selectivity = 1 - noMatchProb;\n      totalCost.startupCost = maxStartupCost;\n      totalCost.scanEst = maxScanEst;\n    } else {\n      // Union FanIn (UFI): each input gets unique branch pattern\n      let i = 0;\n\n      let noMatchProb = 1.0;\n      for (const input of this.#inputs) {\n        const updatedPattern = [i, ...branchPattern];\n        const cost = input.estimateCost(\n          downstreamChildSelectivity,\n          updatedPattern,\n          planDebugger,\n        );\n        totalCost.fanout = cost.fanout;\n        totalCost.returnedRows += cost.returnedRows;\n        totalCost.cost += cost.cost;\n        totalCost.scanEst += cost.scanEst;\n        totalCost.startupCost = totalCost.startupCost + cost.startupCost;\n\n        // OR branches: combine selectivities assuming independent events\n        // P(A OR B) = 1 - (1-A)(1-B)\n        // Track probability of NO match in any branch\n        noMatchProb *= 1 - cost.selectivity;\n\n        // all inputs should have the same limit.\n        assert(\n          totalCost.limit === undefined || cost.limit === totalCost.limit,\n          'All FanIn inputs should have the same limit',\n        );\n        totalCost.limit = cost.limit;\n        i++;\n      }\n      totalCost.selectivity = 1 - noMatchProb;\n    }\n\n    if (planDebugger) {\n      planDebugger.log({\n        type: 'node-cost',\n        nodeType: 'fan-in',\n        node: this.#type,\n        branchPattern,\n        downstreamChildSelectivity,\n        costEstimate: omitFanout(totalCost),\n      });\n    }\n\n    return totalCost;\n  }\n\n  propagateConstraints(\n    branchPattern: number[],\n    constraint: PlannerConstraint | undefined,\n    from?: PlannerNode,\n    planDebugger?: PlanDebugger,\n  ): void {\n    planDebugger?.log({\n      type: 'node-constraint',\n      nodeType: 'fan-in',\n      node: this.#type,\n      branchPattern,\n      constraint,\n      from: from?.kind ?? 'unknown',\n    });\n\n    if (this.#type === 'FI') {\n      const updatedPattern = [0, ...branchPattern];\n      /**\n       * All inputs get the same branch pattern.\n       * 1. They cannot contribute differing constraints to their parent inputs because they are not flipped.\n       *    If they were flipped this would be of type UFI.\n       * 2. All inputs need to be called because they could be pinned. If they are pinned they could have constraints\n       *    to send to their children.\n       */\n      for (const input of this.#inputs) {\n        input.propagateConstraints(\n          updatedPattern,\n          constraint,\n          this,\n          planDebugger,\n        );\n      }\n      return;\n    }\n\n    let i = 0;\n    for (const input of this.#inputs) {\n      input.propagateConstraints(\n        [i, ...branchPattern],\n        constraint,\n        this,\n        planDebugger,\n      );\n      i++;\n    }\n  }\n}\n"],"names":[],"mappings":";;AA2BO,MAAM,aAAa;AAAA,EACf,OAAO;AAAA,EAChB;AAAA,EACA;AAAA,EACS;AAAA,EAET,YAAY,QAAiD;AAC3D,SAAK,QAAQ;AACb,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,sBAAwC;AACtC,WAAO;AAAA,EACT;AAAA,EAEA,UAAU,MAAyB;AACjC,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,IAAI,SAAsB;AACxB,WAAO,KAAK,YAAY,QAAW,gBAAgB;AACnD,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,QAAQ;AACN,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,eAAqB;AACnB,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kCAAwC;AACtC,eAAW,SAAS,KAAK,SAAS;AAChC,UACE,qCAAqC,SACrC,OAAO,MAAM,oCAAoC,YACjD;AAEE,cACA,gCAAA;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AAAA,EAEA,aACE,4BACA,eACA,cACc;AAGd,QAAI,YAA0B;AAAA,MAC5B,cAAc;AAAA,MACd,MAAM;AAAA,MACN,SAAS;AAAA,MACT,aAAa;AAAA,MACb,aAAa;AAAA,MACb,OAAO;AAAA,MACP,QAAQ,MAAM;AACZ,cAAM,IAAI,MAAM,4BAA4B;AAAA,MAC9C;AAAA,IAAA;AAGF,QAAI,KAAK,UAAU,MAAM;AAEvB,YAAM,iBAAiB,CAAC,GAAG,GAAG,aAAa;AAC3C,UAAI,UAAU;AACd,UAAI,iBAAiB;AACrB,UAAI,iBAAiB;AACrB,UAAI,aAAa;AAEjB,UAAI,cAAc;AAClB,iBAAW,SAAS,KAAK,SAAS;AAChC,cAAM,OAAO,MAAM;AAAA,UACjB;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAEF,kBAAU,SAAS,KAAK;AACxB,YAAI,KAAK,eAAe,SAAS;AAC/B,oBAAU,KAAK;AAAA,QACjB;AACA,YAAI,KAAK,OAAO,gBAAgB;AAC9B,2BAAiB,KAAK;AAAA,QACxB;AACA,YAAI,KAAK,cAAc,gBAAgB;AACrC,2BAAiB,KAAK;AAAA,QACxB;AACA,YAAI,KAAK,UAAU,YAAY;AAC7B,uBAAa,KAAK;AAAA,QACpB;AAKA,uBAAe,IAAI,KAAK;AAGxB;AAAA,UACE,UAAU,UAAU,UAAa,KAAK,UAAU,UAAU;AAAA,UAC1D;AAAA,QAAA;AAEF,kBAAU,QAAQ,KAAK;AAAA,MACzB;AAEA,gBAAU,eAAe;AACzB,gBAAU,OAAO;AACjB,gBAAU,cAAc,IAAI;AAC5B,gBAAU,cAAc;AACxB,gBAAU,UAAU;AAAA,IACtB,OAAO;AAEL,UAAI,IAAI;AAER,UAAI,cAAc;AAClB,iBAAW,SAAS,KAAK,SAAS;AAChC,cAAM,iBAAiB,CAAC,GAAG,GAAG,aAAa;AAC3C,cAAM,OAAO,MAAM;AAAA,UACjB;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAEF,kBAAU,SAAS,KAAK;AACxB,kBAAU,gBAAgB,KAAK;AAC/B,kBAAU,QAAQ,KAAK;AACvB,kBAAU,WAAW,KAAK;AAC1B,kBAAU,cAAc,UAAU,cAAc,KAAK;AAKrD,uBAAe,IAAI,KAAK;AAGxB;AAAA,UACE,UAAU,UAAU,UAAa,KAAK,UAAU,UAAU;AAAA,UAC1D;AAAA,QAAA;AAEF,kBAAU,QAAQ,KAAK;AACvB;AAAA,MACF;AACA,gBAAU,cAAc,IAAI;AAAA,IAC9B;AAEA,QAAI,cAAc;AAChB,mBAAa,IAAI;AAAA,QACf,MAAM;AAAA,QACN,UAAU;AAAA,QACV,MAAM,KAAK;AAAA,QACX;AAAA,QACA;AAAA,QACA,cAAc,WAAW,SAAS;AAAA,MAAA,CACnC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,qBACE,eACA,YACA,MACA,cACM;AACN,kBAAc,IAAI;AAAA,MAChB,MAAM;AAAA,MACN,UAAU;AAAA,MACV,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,MAAM,MAAM,QAAQ;AAAA,IAAA,CACrB;AAED,QAAI,KAAK,UAAU,MAAM;AACvB,YAAM,iBAAiB,CAAC,GAAG,GAAG,aAAa;AAQ3C,iBAAW,SAAS,KAAK,SAAS;AAChC,cAAM;AAAA,UACJ;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAAA,MAEJ;AACA;AAAA,IACF;AAEA,QAAI,IAAI;AACR,eAAW,SAAS,KAAK,SAAS;AAChC,YAAM;AAAA,QACJ,CAAC,GAAG,GAAG,aAAa;AAAA,QACpB;AAAA,QACA;AAAA,QACA;AAAA,MAAA;AAEF;AAAA,IACF;AAAA,EACF;AACF;"}

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

@@ -1 +1 @@
-{"version":3,"file":"planner-fan-out.d.ts","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-fan-out.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,yBAAyB,CAAC;AAC/D,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,oBAAoB,CAAC;AACrD,OAAO,KAAK,EACV,YAAY,EACZ,gBAAgB,EAChB,WAAW,EACZ,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAE3D,qBAAa,aAAa;;IACxB,QAAQ,CAAC,IAAI,EAAG,SAAS,CAAU;gBAKvB,KAAK,EAAE,OAAO,CAAC,WAAW,EAAE,eAAe,CAAC;IAKxD,IAAI,IAAI,iBAEP;IAED,SAAS,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IAIlC,IAAI,OAAO,IAAI,WAAW,EAAE,CAE3B;IAED,mBAAmB,IAAI,gBAAgB;IAIvC,oBAAoB,CAClB,aAAa,EAAE,MAAM,EAAE,EACvB,UAAU,EAAE,iBAAiB,GAAG,SAAS,EACzC,IAAI,CAAC,EAAE,WAAW,EAClB,YAAY,CAAC,EAAE,YAAY,GAC1B,IAAI;IAkBP,YAAY,CACV,0BAA0B,EAAE,MAAM,EAClC,aAAa,EAAE,MAAM,EAAE,EACvB,YAAY,CAAC,EAAE,YAAY,GAC1B,YAAY;IAmBf,YAAY,IAAI,IAAI;IAIpB,KAAK,IAAI,IAAI;IAIb;;;OAGG;IACH,+BAA+B,IAAI,IAAI;CAUxC"}
+{"version":3,"file":"planner-fan-out.d.ts","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-fan-out.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,yBAAyB,CAAC;AAC/D,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAErD,OAAO,KAAK,EACV,YAAY,EACZ,gBAAgB,EAChB,WAAW,EACZ,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAE3D,qBAAa,aAAa;;IACxB,QAAQ,CAAC,IAAI,EAAG,SAAS,CAAU;gBAKvB,KAAK,EAAE,OAAO,CAAC,WAAW,EAAE,eAAe,CAAC;IAKxD,IAAI,IAAI,iBAEP;IAED,SAAS,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IAIlC,IAAI,OAAO,IAAI,WAAW,EAAE,CAE3B;IAED,mBAAmB,IAAI,gBAAgB;IAIvC,oBAAoB,CAClB,aAAa,EAAE,MAAM,EAAE,EACvB,UAAU,EAAE,iBAAiB,GAAG,SAAS,EACzC,IAAI,CAAC,EAAE,WAAW,EAClB,YAAY,CAAC,EAAE,YAAY,GAC1B,IAAI;IAkBP,YAAY,CACV,0BAA0B,EAAE,MAAM,EAClC,aAAa,EAAE,MAAM,EAAE,EACvB,YAAY,CAAC,EAAE,YAAY,GAC1B,YAAY;IAqBf,YAAY,IAAI,IAAI;IAIpB,KAAK,IAAI,IAAI;IAIb;;;OAGG;IACH,+BAA+B,IAAI,IAAI;CAUxC"}

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

@@ -1,62 +1,76 @@
-export class PlannerFanOut {
-    kind = 'fan-out';
-    #type;
-    #outputs = [];
-    #input;
-    constructor(input) {
-        this.#type = 'FO';
-        this.#input = input;
+import { omitFanout } from "./planner-node.js";
+class PlannerFanOut {
+  kind = "fan-out";
+  #type;
+  #outputs = [];
+  #input;
+  constructor(input) {
+    this.#type = "FO";
+    this.#input = input;
+  }
+  get type() {
+    return this.#type;
+  }
+  addOutput(node) {
+    this.#outputs.push(node);
+  }
+  get outputs() {
+    return this.#outputs;
+  }
+  closestJoinOrSource() {
+    return this.#input.closestJoinOrSource();
+  }
+  propagateConstraints(branchPattern, constraint, from, planDebugger) {
+    planDebugger?.log({
+      type: "node-constraint",
+      nodeType: "fan-out",
+      node: "FO",
+      branchPattern,
+      constraint,
+      from: from?.kind ?? "unknown"
+    });
+    this.#input.propagateConstraints(
+      branchPattern,
+      constraint,
+      this,
+      planDebugger
+    );
+  }
+  estimateCost(downstreamChildSelectivity, branchPattern, planDebugger) {
+    const ret = this.#input.estimateCost(
+      downstreamChildSelectivity,
+      branchPattern,
+      planDebugger
+    );
+    if (planDebugger) {
+      planDebugger.log({
+        type: "node-cost",
+        nodeType: "fan-out",
+        node: "FO",
+        branchPattern,
+        downstreamChildSelectivity,
+        costEstimate: omitFanout(ret)
+      });
     }
-    get type() {
-        return this.#type;
-    }
-    addOutput(node) {
-        this.#outputs.push(node);
-    }
-    get outputs() {
-        return this.#outputs;
-    }
-    closestJoinOrSource() {
-        return this.#input.closestJoinOrSource();
-    }
-    propagateConstraints(branchPattern, constraint, from, planDebugger) {
-        planDebugger?.log({
-            type: 'node-constraint',
-            nodeType: 'fan-out',
-            node: 'FO',
-            branchPattern,
-            constraint,
-            from: from?.kind ?? 'unknown',
-        });
-        this.#input.propagateConstraints(branchPattern, constraint, this, planDebugger);
-    }
-    estimateCost(downstreamChildSelectivity, branchPattern, planDebugger) {
-        const ret = this.#input.estimateCost(downstreamChildSelectivity, branchPattern, planDebugger);
-        planDebugger?.log({
-            type: 'node-cost',
-            nodeType: 'fan-out',
-            node: 'FO',
-            branchPattern,
-            downstreamChildSelectivity,
-            costEstimate: ret,
-        });
-        return ret;
-    }
-    convertToUFO() {
-        this.#type = 'UFO';
-    }
-    reset() {
-        this.#type = 'FO';
-    }
-    /**
-     * Propagate unlimiting when a parent join is flipped.
-     * Fan-out propagates to its input.
-     */
-    propagateUnlimitFromFlippedJoin() {
-        if ('propagateUnlimitFromFlippedJoin' in this.#input &&
-            typeof this.#input.propagateUnlimitFromFlippedJoin === 'function') {
-            this.#input.propagateUnlimitFromFlippedJoin();
-        }
+    return ret;
+  }
+  convertToUFO() {
+    this.#type = "UFO";
+  }
+  reset() {
+    this.#type = "FO";
+  }
+  /**
+   * Propagate unlimiting when a parent join is flipped.
+   * Fan-out propagates to its input.
+   */
+  propagateUnlimitFromFlippedJoin() {
+    if ("propagateUnlimitFromFlippedJoin" in this.#input && typeof this.#input.propagateUnlimitFromFlippedJoin === "function") {
+      this.#input.propagateUnlimitFromFlippedJoin();
     }
+  }
 }
-//# sourceMappingURL=planner-fan-out.js.map
+export {
+  PlannerFanOut
+};
+//# sourceMappingURL=planner-fan-out.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"planner-fan-out.js","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-fan-out.ts"],"names":[],"mappings":"AASA,MAAM,OAAO,aAAa;IACf,IAAI,GAAG,SAAkB,CAAC;IACnC,KAAK,CAAe;IACX,QAAQ,GAAkB,EAAE,CAAC;IAC7B,MAAM,CAAwC;IAEvD,YAAY,KAA4C;QACtD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,SAAS,CAAC,IAAiB;QACzB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,mBAAmB;QACjB,OAAO,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC;IAC3C,CAAC;IAED,oBAAoB,CAClB,aAAuB,EACvB,UAAyC,EACzC,IAAkB,EAClB,YAA2B;QAE3B,YAAY,EAAE,GAAG,CAAC;YAChB,IAAI,EAAE,iBAAiB;YACvB,QAAQ,EAAE,SAAS;YACnB,IAAI,EAAE,IAAI;YACV,aAAa;YACb,UAAU;YACV,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,SAAS;SAC9B,CAAC,CAAC;QAEH,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAC9B,aAAa,EACb,UAAU,EACV,IAAI,EACJ,YAAY,CACb,CAAC;IACJ,CAAC;IAED,YAAY,CACV,0BAAkC,EAClC,aAAuB,EACvB,YAA2B;QAE3B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAClC,0BAA0B,EAC1B,aAAa,EACb,YAAY,CACb,CAAC;QAEF,YAAY,EAAE,GAAG,CAAC;YAChB,IAAI,EAAE,WAAW;YACjB,QAAQ,EAAE,SAAS;YACnB,IAAI,EAAE,IAAI;YACV,aAAa;YACb,0BAA0B;YAC1B,YAAY,EAAE,GAAG;SAClB,CAAC,CAAC;QAEH,OAAO,GAAG,CAAC;IACb,CAAC;IAED,YAAY;QACV,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED;;;OAGG;IACH,+BAA+B;QAC7B,IACE,iCAAiC,IAAI,IAAI,CAAC,MAAM;YAChD,OAAO,IAAI,CAAC,MAAM,CAAC,+BAA+B,KAAK,UAAU,EACjE,CAAC;YAEC,IAAI,CAAC,MACN,CAAC,+BAA+B,EAAE,CAAC;QACtC,CAAC;IACH,CAAC;CACF"}
+{"version":3,"file":"planner-fan-out.js","sources":["../../../../../zql/src/planner/planner-fan-out.ts"],"sourcesContent":["import type {PlannerConstraint} from './planner-constraint.ts';\nimport type {PlanDebugger} from './planner-debug.ts';\nimport {omitFanout} from './planner-node.ts';\nimport type {\n  CostEstimate,\n  JoinOrConnection,\n  PlannerNode,\n} from './planner-node.ts';\nimport type {PlannerTerminus} from './planner-terminus.ts';\n\nexport class PlannerFanOut {\n  readonly kind = 'fan-out' as const;\n  #type: 'FO' | 'UFO';\n  readonly #outputs: PlannerNode[] = [];\n  readonly #input: Exclude<PlannerNode, PlannerTerminus>;\n\n  constructor(input: Exclude<PlannerNode, PlannerTerminus>) {\n    this.#type = 'FO';\n    this.#input = input;\n  }\n\n  get type() {\n    return this.#type;\n  }\n\n  addOutput(node: PlannerNode): void {\n    this.#outputs.push(node);\n  }\n\n  get outputs(): PlannerNode[] {\n    return this.#outputs;\n  }\n\n  closestJoinOrSource(): JoinOrConnection {\n    return this.#input.closestJoinOrSource();\n  }\n\n  propagateConstraints(\n    branchPattern: number[],\n    constraint: PlannerConstraint | undefined,\n    from?: PlannerNode,\n    planDebugger?: PlanDebugger,\n  ): void {\n    planDebugger?.log({\n      type: 'node-constraint',\n      nodeType: 'fan-out',\n      node: 'FO',\n      branchPattern,\n      constraint,\n      from: from?.kind ?? 'unknown',\n    });\n\n    this.#input.propagateConstraints(\n      branchPattern,\n      constraint,\n      this,\n      planDebugger,\n    );\n  }\n\n  estimateCost(\n    downstreamChildSelectivity: number,\n    branchPattern: number[],\n    planDebugger?: PlanDebugger,\n  ): CostEstimate {\n    const ret = this.#input.estimateCost(\n      downstreamChildSelectivity,\n      branchPattern,\n      planDebugger,\n    );\n\n    if (planDebugger) {\n      planDebugger.log({\n        type: 'node-cost',\n        nodeType: 'fan-out',\n        node: 'FO',\n        branchPattern,\n        downstreamChildSelectivity,\n        costEstimate: omitFanout(ret),\n      });\n    }\n\n    return ret;\n  }\n\n  convertToUFO(): void {\n    this.#type = 'UFO';\n  }\n\n  reset(): void {\n    this.#type = 'FO';\n  }\n\n  /**\n   * Propagate unlimiting when a parent join is flipped.\n   * Fan-out propagates to its input.\n   */\n  propagateUnlimitFromFlippedJoin(): void {\n    if (\n      'propagateUnlimitFromFlippedJoin' in this.#input &&\n      typeof this.#input.propagateUnlimitFromFlippedJoin === 'function'\n    ) {\n      (\n        this.#input as {propagateUnlimitFromFlippedJoin(): void}\n      ).propagateUnlimitFromFlippedJoin();\n    }\n  }\n}\n"],"names":[],"mappings":";AAUO,MAAM,cAAc;AAAA,EAChB,OAAO;AAAA,EAChB;AAAA,EACS,WAA0B,CAAA;AAAA,EAC1B;AAAA,EAET,YAAY,OAA8C;AACxD,SAAK,QAAQ;AACb,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,IAAI,OAAO;AACT,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,UAAU,MAAyB;AACjC,SAAK,SAAS,KAAK,IAAI;AAAA,EACzB;AAAA,EAEA,IAAI,UAAyB;AAC3B,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,sBAAwC;AACtC,WAAO,KAAK,OAAO,oBAAA;AAAA,EACrB;AAAA,EAEA,qBACE,eACA,YACA,MACA,cACM;AACN,kBAAc,IAAI;AAAA,MAChB,MAAM;AAAA,MACN,UAAU;AAAA,MACV,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA,MAAM,MAAM,QAAQ;AAAA,IAAA,CACrB;AAED,SAAK,OAAO;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEA,aACE,4BACA,eACA,cACc;AACd,UAAM,MAAM,KAAK,OAAO;AAAA,MACtB;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAGF,QAAI,cAAc;AAChB,mBAAa,IAAI;AAAA,QACf,MAAM;AAAA,QACN,UAAU;AAAA,QACV,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA,cAAc,WAAW,GAAG;AAAA,MAAA,CAC7B;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,eAAqB;AACnB,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,QAAc;AACZ,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kCAAwC;AACtC,QACE,qCAAqC,KAAK,UAC1C,OAAO,KAAK,OAAO,oCAAoC,YACvD;AAEE,WAAK,OACL,gCAAA;AAAA,IACJ;AAAA,EACF;AACF;"}

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

@@ -1,15 +1,16 @@
-import type { PlannerJoin } from './planner-join.ts';
-import type { PlannerFanOut } from './planner-fan-out.ts';
-import type { PlannerFanIn } from './planner-fan-in.ts';
+import type { LogContext } from '@rocicorp/logger';
+import type { PlanDebugger } from './planner-debug.ts';
 import type { PlannerConnection } from './planner-connection.ts';
-import type { PlannerTerminus } from './planner-terminus.ts';
-import { PlannerSource, type ConnectionCostModel } from './planner-source.ts';
 import type { PlannerConstraint } from './planner-constraint.ts';
-import type { PlanDebugger } from './planner-debug.ts';
+import type { PlannerFanIn } from './planner-fan-in.ts';
+import type { PlannerFanOut } from './planner-fan-out.ts';
+import type { PlannerJoin } from './planner-join.ts';
+import { PlannerSource, type ConnectionCostModel } from './planner-source.ts';
+import type { PlannerTerminus } from './planner-terminus.ts';
 /**
  * Captured state of a plan for comparison and restoration.
  */
-type PlanState = {
+export type PlanState = {
     connections: Array<{
         limit: number | undefined;
     }>;
@@ -96,8 +97,8 @@ export declare class PlannerGraph {
      * FanOut/FanIn states (FO/UFO and FI/UFI) are automatically derived from join flip states.
      *
      * @param planDebugger - Optional debugger to receive structured events during planning
+     * @param lc - Optional logger for warnings
      */
-    plan(planDebugger?: PlanDebugger): void;
+    plan(planDebugger?: PlanDebugger, lc?: LogContext): void;
 }
-export {};
 //# sourceMappingURL=planner-graph.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"planner-graph.d.ts","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-graph.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,mBAAmB,CAAC;AACnD,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,sBAAsB,CAAC;AACxD,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,qBAAqB,CAAC;AACtD,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,yBAAyB,CAAC;AAC/D,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAE3D,OAAO,EAAC,aAAa,EAAE,KAAK,mBAAmB,EAAC,MAAM,qBAAqB,CAAC;AAC5E,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,yBAAyB,CAAC;AAE/D,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,oBAAoB,CAAC;AAErD;;GAEG;AACH,KAAK,SAAS,GAAG;IACf,WAAW,EAAE,KAAK,CAAC;QAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAA;KAAC,CAAC,CAAC;IAChD,KAAK,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAAA;KAAC,CAAC,CAAC;IACzC,OAAO,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,IAAI,GAAG,KAAK,CAAA;KAAC,CAAC,CAAC;IACrC,MAAM,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,IAAI,GAAG,KAAK,CAAA;KAAC,CAAC,CAAC;IACpC,qBAAqB,EAAE,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,iBAAiB,GAAG,SAAS,CAAC,CAAC,CAAC;CAC1E,CAAC;AAkBF,qBAAa,YAAY;;IAQvB,KAAK,EAAE,WAAW,EAAE,CAAM;IAC1B,OAAO,EAAE,aAAa,EAAE,CAAM;IAC9B,MAAM,EAAE,YAAY,EAAE,CAAM;IAC5B,WAAW,EAAE,iBAAiB,EAAE,CAAM;IAEtC;;;;;OAKG;IACH,kBAAkB;IAOlB;;OAEG;IACH,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,mBAAmB,GAAG,aAAa;IAUlE;;OAEG;IACH,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa;IAMtC;;OAEG;IACH,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAIhC;;;OAGG;IACH,WAAW,CAAC,QAAQ,EAAE,eAAe,GAAG,IAAI;IAI5C;;;;OAIG;IACH,oBAAoB,CAAC,YAAY,CAAC,EAAE,YAAY,GAAG,IAAI;IAQvD;;;OAGG;IACH,YAAY,CAAC,YAAY,CAAC,EAAE,YAAY,GAAG,MAAM;IAKjD;;;;;;;;OAQG;IACH,uBAAuB,IAAI,SAAS;IAYpC;;;;;;;;OAQG;IACH,uBAAuB,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI;IAkF/C;;;;;;;;;;;OAWG;IACH,IAAI,CAAC,YAAY,CAAC,EAAE,YAAY,GAAG,IAAI;CAsIxC"}
+{"version":3,"file":"planner-graph.d.ts","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAGjD,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,oBAAoB,CAAC;AACrD,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,yBAAyB,CAAC;AAC/D,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,yBAAyB,CAAC;AAC/D,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,qBAAqB,CAAC;AACtD,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,sBAAsB,CAAC;AACxD,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,mBAAmB,CAAC;AAGnD,OAAO,EAAC,aAAa,EAAE,KAAK,mBAAmB,EAAC,MAAM,qBAAqB,CAAC;AAC5E,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAE3D;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG;IACtB,WAAW,EAAE,KAAK,CAAC;QAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAA;KAAC,CAAC,CAAC;IAChD,KAAK,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAAA;KAAC,CAAC,CAAC;IACzC,OAAO,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,IAAI,GAAG,KAAK,CAAA;KAAC,CAAC,CAAC;IACrC,MAAM,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,IAAI,GAAG,KAAK,CAAA;KAAC,CAAC,CAAC;IACpC,qBAAqB,EAAE,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,iBAAiB,GAAG,SAAS,CAAC,CAAC,CAAC;CAC1E,CAAC;AAkBF,qBAAa,YAAY;;IAQvB,KAAK,EAAE,WAAW,EAAE,CAAM;IAC1B,OAAO,EAAE,aAAa,EAAE,CAAM;IAC9B,MAAM,EAAE,YAAY,EAAE,CAAM;IAC5B,WAAW,EAAE,iBAAiB,EAAE,CAAM;IAEtC;;;;;OAKG;IACH,kBAAkB;IAOlB;;OAEG;IACH,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,mBAAmB,GAAG,aAAa;IAUlE;;OAEG;IACH,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa;IAMtC;;OAEG;IACH,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAIhC;;;OAGG;IACH,WAAW,CAAC,QAAQ,EAAE,eAAe,GAAG,IAAI;IAI5C;;;;OAIG;IACH,oBAAoB,CAAC,YAAY,CAAC,EAAE,YAAY,GAAG,IAAI;IAQvD;;;OAGG;IACH,YAAY,CAAC,YAAY,CAAC,EAAE,YAAY,GAAG,MAAM;IAKjD;;;;;;;;OAQG;IACH,uBAAuB,IAAI,SAAS;IAYpC;;;;;;;;OAQG;IACH,uBAAuB,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI;IAsF/C;;;;;;;;;;;;OAYG;IACH,IAAI,CAAC,YAAY,CAAC,EAAE,YAAY,EAAE,EAAE,CAAC,EAAE,UAAU,GAAG,IAAI;CA+HzD"}