@rocicorp/zero 0.26.1 → 0.26.2-canary.4

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

@@ -1,165 +1,149 @@
 import { assert } from "../../../shared/src/asserts.js";
 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();
-      }
-    }
-  }
-  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;
-        }
-        if (cost.cost > maxRunningCost) {
-          maxRunningCost = cost.cost;
-        }
-        if (cost.startupCost > maxStartupCost) {
-          maxStartupCost = cost.startupCost;
-        }
-        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++;
-    }
-  }
-}
-export {
-  PlannerFanIn
+//#region ../zql/src/planner/planner-fan-in.ts
+/**
+* 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.
+*/
+var PlannerFanIn = class {
+	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();
+	}
+	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;
+				if (cost.cost > maxRunningCost) maxRunningCost = cost.cost;
+				if (cost.startupCost > maxStartupCost) maxStartupCost = cost.startupCost;
+				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];
+			/**
+			* 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;
+		}
+		let i = 0;
+		for (const input of this.#inputs) {
+			input.propagateConstraints([i, ...branchPattern], constraint, this, planDebugger);
+			i++;
+		}
+	}
 };
-//# sourceMappingURL=planner-fan-in.js.map
+//#endregion
+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","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;"}
+{"version":3,"file":"planner-fan-in.js","names":["#inputs","#type","#output"],"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"],"mappings":";;;;;;;;;;;;;;;;;;;AA2BA,IAAa,eAAb,MAA0B;CACxB,OAAgB;CAChB;CACA;CACA;CAEA,YAAY,QAAiD;AAC3D,QAAA,OAAa;AACb,QAAA,SAAe;;CAGjB,IAAI,OAAO;AACT,SAAO,MAAA;;CAGT,sBAAwC;AACtC,SAAO;;CAGT,UAAU,MAAyB;AACjC,QAAA,SAAe;;CAGjB,IAAI,SAAsB;AACxB,SAAO,MAAA,WAAiB,KAAA,GAAW,iBAAiB;AACpD,SAAO,MAAA;;CAGT,QAAQ;AACN,QAAA,OAAa;;CAGf,eAAqB;AACnB,QAAA,OAAa;;;;;;CAOf,kCAAwC;AACtC,OAAK,MAAM,SAAS,MAAA,OAClB,KACE,qCAAqC,SACrC,OAAO,MAAM,oCAAoC,WAG/C,OACA,iCAAiC;;CAKzC,aACE,4BACA,eACA,cACc;EAGd,IAAI,YAA0B;GAC5B,cAAc;GACd,MAAM;GACN,SAAS;GACT,aAAa;GACb,aAAa;GACb,OAAO,KAAA;GACP,cAAc;AACZ,UAAM,IAAI,MAAM,6BAA6B;;GAEhD;AAED,MAAI,MAAA,SAAe,MAAM;GAEvB,MAAM,iBAAiB,CAAC,GAAG,GAAG,cAAc;GAC5C,IAAI,UAAU;GACd,IAAI,iBAAiB;GACrB,IAAI,iBAAiB;GACrB,IAAI,aAAa;GAEjB,IAAI,cAAc;AAClB,QAAK,MAAM,SAAS,MAAA,QAAc;IAChC,MAAM,OAAO,MAAM,aACjB,4BACA,gBACA,aACD;AACD,cAAU,SAAS,KAAK;AACxB,QAAI,KAAK,eAAe,QACtB,WAAU,KAAK;AAEjB,QAAI,KAAK,OAAO,eACd,kBAAiB,KAAK;AAExB,QAAI,KAAK,cAAc,eACrB,kBAAiB,KAAK;AAExB,QAAI,KAAK,UAAU,WACjB,cAAa,KAAK;AAMpB,mBAAe,IAAI,KAAK;AAGxB,WACE,UAAU,UAAU,KAAA,KAAa,KAAK,UAAU,UAAU,OAC1D,8CACD;AACD,cAAU,QAAQ,KAAK;;AAGzB,aAAU,eAAe;AACzB,aAAU,OAAO;AACjB,aAAU,cAAc,IAAI;AAC5B,aAAU,cAAc;AACxB,aAAU,UAAU;SACf;GAEL,IAAI,IAAI;GAER,IAAI,cAAc;AAClB,QAAK,MAAM,SAAS,MAAA,QAAc;IAChC,MAAM,iBAAiB,CAAC,GAAG,GAAG,cAAc;IAC5C,MAAM,OAAO,MAAM,aACjB,4BACA,gBACA,aACD;AACD,cAAU,SAAS,KAAK;AACxB,cAAU,gBAAgB,KAAK;AAC/B,cAAU,QAAQ,KAAK;AACvB,cAAU,WAAW,KAAK;AAC1B,cAAU,cAAc,UAAU,cAAc,KAAK;AAKrD,mBAAe,IAAI,KAAK;AAGxB,WACE,UAAU,UAAU,KAAA,KAAa,KAAK,UAAU,UAAU,OAC1D,8CACD;AACD,cAAU,QAAQ,KAAK;AACvB;;AAEF,aAAU,cAAc,IAAI;;AAG9B,MAAI,aACF,cAAa,IAAI;GACf,MAAM;GACN,UAAU;GACV,MAAM,MAAA;GACN;GACA;GACA,cAAc,WAAW,UAAU;GACpC,CAAC;AAGJ,SAAO;;CAGT,qBACE,eACA,YACA,MACA,cACM;AACN,gBAAc,IAAI;GAChB,MAAM;GACN,UAAU;GACV,MAAM,MAAA;GACN;GACA;GACA,MAAM,MAAM,QAAQ;GACrB,CAAC;AAEF,MAAI,MAAA,SAAe,MAAM;GACvB,MAAM,iBAAiB,CAAC,GAAG,GAAG,cAAc;;;;;;;;AAQ5C,QAAK,MAAM,SAAS,MAAA,OAClB,OAAM,qBACJ,gBACA,YACA,MACA,aACD;AAEH;;EAGF,IAAI,IAAI;AACR,OAAK,MAAM,SAAS,MAAA,QAAc;AAChC,SAAM,qBACJ,CAAC,GAAG,GAAG,cAAc,EACrB,YACA,MACA,aACD;AACD"}

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

@@ -1,76 +1,64 @@
 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)
-      });
-    }
-    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();
-    }
-  }
-}
-export {
-  PlannerFanOut
+//#region ../zql/src/planner/planner-fan-out.ts
+var PlannerFanOut = class {
+	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)
+		});
+		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
+//#endregion
+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","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;"}
+{"version":3,"file":"planner-fan-out.js","names":["#outputs","#input","#type"],"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"],"mappings":";;AAUA,IAAa,gBAAb,MAA2B;CACzB,OAAgB;CAChB;CACA,WAAmC,EAAE;CACrC;CAEA,YAAY,OAA8C;AACxD,QAAA,OAAa;AACb,QAAA,QAAc;;CAGhB,IAAI,OAAO;AACT,SAAO,MAAA;;CAGT,UAAU,MAAyB;AACjC,QAAA,QAAc,KAAK,KAAK;;CAG1B,IAAI,UAAyB;AAC3B,SAAO,MAAA;;CAGT,sBAAwC;AACtC,SAAO,MAAA,MAAY,qBAAqB;;CAG1C,qBACE,eACA,YACA,MACA,cACM;AACN,gBAAc,IAAI;GAChB,MAAM;GACN,UAAU;GACV,MAAM;GACN;GACA;GACA,MAAM,MAAM,QAAQ;GACrB,CAAC;AAEF,QAAA,MAAY,qBACV,eACA,YACA,MACA,aACD;;CAGH,aACE,4BACA,eACA,cACc;EACd,MAAM,MAAM,MAAA,MAAY,aACtB,4BACA,eACA,aACD;AAED,MAAI,aACF,cAAa,IAAI;GACf,MAAM;GACN,UAAU;GACV,MAAM;GACN;GACA;GACA,cAAc,WAAW,IAAI;GAC9B,CAAC;AAGJ,SAAO;;CAGT,eAAqB;AACnB,QAAA,OAAa;;CAGf,QAAc;AACZ,QAAA,OAAa;;;;;;CAOf,kCAAwC;AACtC,MACE,qCAAqC,MAAA,SACrC,OAAO,MAAA,MAAY,oCAAoC,WAGrD,OAAA,MACA,iCAAiC"}