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

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,9 @@
+function mergeConstraints(a, b) {
+  if (!a) return b;
+  if (!b) return a;
+  return { ...a, ...b };
+}
+export {
+  mergeConstraints
+};
+//# sourceMappingURL=planner-constraint.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"planner-constraint.js","sources":["../../../../../zql/src/planner/planner-constraint.ts"],"sourcesContent":["/**\n * We do not know the value a constraint will take until runtime.\n *\n * However, we do know the column.\n *\n * E.g., we know that `issue.assignee_id` will be constrained to typeof issue.assignee_id.\n */\nexport type PlannerConstraint = Record<string, undefined>;\n\n/**\n * Multiple flipped joins will contribute extra constraints to a parent join.\n * These need to be merged.\n */\nexport function mergeConstraints(\n  a: PlannerConstraint | undefined,\n  b: PlannerConstraint | undefined,\n): PlannerConstraint | undefined {\n  if (!a) return b;\n  if (!b) return a;\n  return {...a, ...b};\n}\n"],"names":[],"mappings":"AAaO,SAAS,iBACd,GACA,GAC+B;AAC/B,MAAI,CAAC,EAAG,QAAO;AACf,MAAI,CAAC,EAAG,QAAO;AACf,SAAO,EAAC,GAAG,GAAG,GAAG,EAAA;AACnB;"}

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

@@ -0,0 +1,143 @@
+import type * as v from '../../../shared/src/valita.ts';
+import type { Condition, Ordering } from '../../../zero-protocol/src/ast.ts';
+import type { attemptStartEventJSONSchema, bestPlanSelectedEventJSONSchema, connectionSelectedEventJSONSchema, nodeConstraintEventJSONSchema, PlanDebugEventJSON, planFailedEventJSONSchema } from '../../../zero-protocol/src/analyze-query-result.ts';
+import type { PlannerConstraint } from './planner-constraint.ts';
+import type { CostEstimate, JoinType } from './planner-node.ts';
+import type { PlanState } from './planner-graph.ts';
+/**
+ * Structured debug events emitted during query planning.
+ * These events can be accumulated, printed, or analyzed to understand
+ * the planner's decision-making process.
+ */
+/**
+ * Starting a new planning attempt with a different root connection.
+ */
+export type AttemptStartEvent = v.Infer<typeof attemptStartEventJSONSchema>;
+/**
+ * Snapshot of connection costs before selecting the next connection.
+ */
+export type ConnectionCostsEvent = {
+    type: 'connection-costs';
+    attemptNumber: number;
+    costs: Array<{
+        connection: string;
+        cost: number;
+        costEstimate: Omit<CostEstimate, 'fanout'>;
+        pinned: boolean;
+        constraints: Record<string, PlannerConstraint | undefined>;
+        constraintCosts: Record<string, Omit<CostEstimate, 'fanout'>>;
+    }>;
+};
+/**
+ * A connection was chosen and pinned.
+ */
+export type ConnectionSelectedEvent = v.Infer<typeof connectionSelectedEventJSONSchema>;
+/**
+ * Constraints have been propagated through the graph.
+ */
+export type ConstraintsPropagatedEvent = {
+    type: 'constraints-propagated';
+    attemptNumber: number;
+    connectionConstraints: Array<{
+        connection: string;
+        constraints: Record<string, PlannerConstraint | undefined>;
+        constraintCosts: Record<string, Omit<CostEstimate, 'fanout'>>;
+    }>;
+};
+/**
+ * A complete plan was found for this attempt.
+ */
+export type PlanCompleteEvent = {
+    type: 'plan-complete';
+    attemptNumber: number;
+    totalCost: number;
+    flipPattern: number;
+    joinStates: Array<{
+        join: string;
+        type: JoinType;
+    }>;
+    planSnapshot: PlanState;
+};
+/**
+ * Planning attempt failed (e.g., unflippable join).
+ */
+export type PlanFailedEvent = v.Infer<typeof planFailedEventJSONSchema>;
+/**
+ * The best plan across all attempts was selected.
+ */
+export type BestPlanSelectedEvent = v.Infer<typeof bestPlanSelectedEventJSONSchema>;
+/**
+ * A node computed its cost estimate during planning.
+ * Emitted by nodes during estimateCost() traversal.
+ * attemptNumber is added by the debugger.
+ */
+export type NodeCostEvent = {
+    type: 'node-cost';
+    attemptNumber?: number;
+    nodeType: 'connection' | 'join' | 'fan-out' | 'fan-in' | 'terminus';
+    node: string;
+    branchPattern: number[];
+    downstreamChildSelectivity: number;
+    costEstimate: Omit<CostEstimate, 'fanout'>;
+    filters?: Condition | undefined;
+    ordering?: Ordering | undefined;
+    joinType?: JoinType | undefined;
+};
+/**
+ * A node received constraints during constraint propagation.
+ * Emitted by nodes during propagateConstraints() traversal.
+ * attemptNumber is added by the debugger.
+ */
+export type NodeConstraintEvent = v.Infer<typeof nodeConstraintEventJSONSchema>;
+/**
+ * Union of all debug event types.
+ */
+export type PlanDebugEvent = AttemptStartEvent | ConnectionCostsEvent | ConnectionSelectedEvent | ConstraintsPropagatedEvent | PlanCompleteEvent | PlanFailedEvent | BestPlanSelectedEvent | NodeCostEvent | NodeConstraintEvent;
+/**
+ * Interface for objects that receive debug events during planning.
+ */
+export interface PlanDebugger {
+    log(event: PlanDebugEvent): void;
+}
+/**
+ * Simple accumulator debugger that stores all events.
+ * Useful for tests and debugging.
+ */
+export declare class AccumulatorDebugger implements PlanDebugger {
+    readonly events: PlanDebugEvent[];
+    private currentAttempt;
+    log(event: PlanDebugEvent): void;
+    /**
+     * Get all events of a specific type.
+     */
+    getEvents<T extends PlanDebugEvent['type']>(type: T): Extract<PlanDebugEvent, {
+        type: T;
+    }>[];
+    /**
+     * Format events as a human-readable string.
+     */
+    format(): string;
+}
+/**
+ * Serialize an array of debug events to JSON-compatible format.
+ * The fanout function is already omitted when events are created.
+ * The planSnapshot is excluded as it's internal state not needed for debugging.
+ */
+export declare function serializePlanDebugEvents(events: PlanDebugEvent[]): PlanDebugEventJSON[];
+/**
+ * Format planner debug events as a human-readable string.
+ * Works with JSON-serialized events (from inspector API) or native events (from AccumulatorDebugger).
+ *
+ * @param events - Array of planner debug events (either JSON or native format)
+ * @returns Formatted string showing planning attempts, costs, and final plan selection
+ *
+ * @example
+ * ```typescript
+ * const result = await inspector.analyzeQuery(query, { plannerDebug: true });
+ * if (result.plannerEvents) {
+ *   console.log(formatPlannerEvents(result.plannerEvents));
+ * }
+ * ```
+ */
+export declare function formatPlannerEvents(events: PlanDebugEventJSON[] | PlanDebugEvent[]): string;
+//# sourceMappingURL=planner-debug.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"planner-debug.d.ts","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-debug.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,CAAC,MAAM,+BAA+B,CAAC;AACxD,OAAO,KAAK,EACV,SAAS,EACT,QAAQ,EAET,MAAM,mCAAmC,CAAC;AAC3C,OAAO,KAAK,EACV,2BAA2B,EAC3B,+BAA+B,EAC/B,iCAAiC,EACjC,6BAA6B,EAC7B,kBAAkB,EAClB,yBAAyB,EAC1B,MAAM,oDAAoD,CAAC;AAC5D,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,yBAAyB,CAAC;AAC/D,OAAO,KAAK,EAAC,YAAY,EAAE,QAAQ,EAAC,MAAM,mBAAmB,CAAC;AAC9D,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,oBAAoB,CAAC;AAElD;;;;GAIG;AAEH;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,2BAA2B,CAAC,CAAC;AAE5E;;GAEG;AACH,MAAM,MAAM,oBAAoB,GAAG;IACjC,IAAI,EAAE,kBAAkB,CAAC;IACzB,aAAa,EAAE,MAAM,CAAC;IACtB,KAAK,EAAE,KAAK,CAAC;QACX,UAAU,EAAE,MAAM,CAAC;QACnB,IAAI,EAAE,MAAM,CAAC;QACb,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;QAC3C,MAAM,EAAE,OAAO,CAAC;QAChB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,iBAAiB,GAAG,SAAS,CAAC,CAAC;QAC3D,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC;KAC/D,CAAC,CAAC;CACJ,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,CAAC,KAAK,CAC3C,OAAO,iCAAiC,CACzC,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,0BAA0B,GAAG;IACvC,IAAI,EAAE,wBAAwB,CAAC;IAC/B,aAAa,EAAE,MAAM,CAAC;IACtB,qBAAqB,EAAE,KAAK,CAAC;QAC3B,UAAU,EAAE,MAAM,CAAC;QACnB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,iBAAiB,GAAG,SAAS,CAAC,CAAC;QAC3D,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC;KAC/D,CAAC,CAAC;CACJ,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG;IAC9B,IAAI,EAAE,eAAe,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,KAAK,CAAC;QAChB,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,EAAE,QAAQ,CAAC;KAChB,CAAC,CAAC;IAEH,YAAY,EAAE,SAAS,CAAC;CACzB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,yBAAyB,CAAC,CAAC;AAExE;;GAEG;AACH,MAAM,MAAM,qBAAqB,GAAG,CAAC,CAAC,KAAK,CACzC,OAAO,+BAA+B,CACvC,CAAC;AAEF;;;;GAIG;AACH,MAAM,MAAM,aAAa,GAAG;IAC1B,IAAI,EAAE,WAAW,CAAC;IAClB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,EAAE,YAAY,GAAG,MAAM,GAAG,SAAS,GAAG,QAAQ,GAAG,UAAU,CAAC;IACpE,IAAI,EAAE,MAAM,CAAC;IACb,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,0BAA0B,EAAE,MAAM,CAAC;IACnC,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;IAC3C,OAAO,CAAC,EAAE,SAAS,GAAG,SAAS,CAAC;IAChC,QAAQ,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAC;IAChC,QAAQ,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAC;CACjC,CAAC;AAEF;;;;GAIG;AACH,MAAM,MAAM,mBAAmB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,6BAA6B,CAAC,CAAC;AAEhF;;GAEG;AACH,MAAM,MAAM,cAAc,GACtB,iBAAiB,GACjB,oBAAoB,GACpB,uBAAuB,GACvB,0BAA0B,GAC1B,iBAAiB,GACjB,eAAe,GACf,qBAAqB,GACrB,aAAa,GACb,mBAAmB,CAAC;AAExB;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,GAAG,CAAC,KAAK,EAAE,cAAc,GAAG,IAAI,CAAC;CAClC;AAED;;;GAGG;AACH,qBAAa,mBAAoB,YAAW,YAAY;IACtD,QAAQ,CAAC,MAAM,EAAE,cAAc,EAAE,CAAM;IACvC,OAAO,CAAC,cAAc,CAAK;IAE3B,GAAG,CAAC,KAAK,EAAE,cAAc,GAAG,IAAI;IAehC;;OAEG;IACH,SAAS,CAAC,CAAC,SAAS,cAAc,CAAC,MAAM,CAAC,EACxC,IAAI,EAAE,CAAC,GACN,OAAO,CAAC,cAAc,EAAE;QAAC,IAAI,EAAE,CAAC,CAAA;KAAC,CAAC,EAAE;IAOvC;;OAEG;IACH,MAAM,IAAI,MAAM;CAGjB;AA8QD;;;;GAIG;AACH,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,cAAc,EAAE,GACvB,kBAAkB,EAAE,CAEtB;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,kBAAkB,EAAE,GAAG,cAAc,EAAE,GAC9C,MAAM,CAyDR"}

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

@@ -0,0 +1,242 @@
+class AccumulatorDebugger {
+  events = [];
+  currentAttempt = 0;
+  log(event) {
+    if (event.type === "attempt-start") {
+      this.currentAttempt = event.attemptNumber;
+    }
+    if (event.type === "node-cost" || event.type === "node-constraint") {
+      event.attemptNumber = this.currentAttempt;
+    }
+    this.events.push(event);
+  }
+  /**
+   * Get all events of a specific type.
+   */
+  getEvents(type) {
+    return this.events.filter((e) => e.type === type);
+  }
+  /**
+   * Format events as a human-readable string.
+   */
+  format() {
+    return formatPlannerEvents(this.events);
+  }
+}
+function formatConstraint(constraint) {
+  if (!constraint) return "{}";
+  const keys = Object.keys(constraint);
+  if (keys.length === 0) return "{}";
+  return "{" + keys.join(", ") + "}";
+}
+function formatValuePosition(value) {
+  switch (value.type) {
+    case "column":
+      return value.name;
+    case "literal":
+      if (typeof value.value === "string") {
+        return `'${value.value}'`;
+      }
+      return JSON.stringify(value.value);
+    case "static":
+      return `@${value.anchor}.${Array.isArray(value.field) ? value.field.join(".") : value.field}`;
+  }
+}
+function formatFilter(filter) {
+  if (!filter) return "none";
+  switch (filter.type) {
+    case "simple":
+      return `${formatValuePosition(filter.left)} ${filter.op} ${formatValuePosition(filter.right)}`;
+    case "and":
+      return `(${filter.conditions.map(formatFilter).join(" AND ")})`;
+    case "or":
+      return `(${filter.conditions.map(formatFilter).join(" OR ")})`;
+    case "correlatedSubquery":
+      return `EXISTS(${filter.related.subquery.table})`;
+    default:
+      return JSON.stringify(filter);
+  }
+}
+function formatOrdering(ordering) {
+  if (!ordering || ordering.length === 0) return "none";
+  return ordering.map(([field, direction]) => `${field} ${direction}`).join(", ");
+}
+function formatAttemptSummary(attemptNum, events) {
+  const lines = [];
+  const startEvent = events.find((e) => e.type === "attempt-start");
+  const totalAttempts = startEvent?.totalAttempts ?? "?";
+  const numBits = typeof totalAttempts === "number" ? Math.ceil(Math.log2(totalAttempts)) || 1 : 1;
+  const bitPattern = attemptNum.toString(2).padStart(numBits, "0");
+  lines.push(
+    `[Attempt ${attemptNum + 1}/${totalAttempts}] Pattern ${attemptNum} (${bitPattern})`
+  );
+  const connectionCostEvents = [];
+  const connectionConstraintEvents = [];
+  for (const event of events) {
+    if (event.type === "node-cost" && event.nodeType === "connection") {
+      connectionCostEvents.push(event);
+    }
+    if (event.type === "node-constraint" && event.nodeType === "connection") {
+      connectionConstraintEvents.push(event);
+    }
+  }
+  if (connectionCostEvents.length > 0) {
+    lines.push("  Connections:");
+    for (const cost of connectionCostEvents) {
+      const constraint = connectionConstraintEvents.find(
+        (c) => c.node === cost.node && c.branchPattern.join(",") === cost.branchPattern.join(",")
+      )?.constraint;
+      const constraintStr = formatConstraint(constraint);
+      const filterStr = formatFilter(cost.filters);
+      const orderingStr = formatOrdering(cost.ordering);
+      const limitStr = cost.costEstimate.limit !== void 0 ? cost.costEstimate.limit.toString() : "none";
+      lines.push(`    ${cost.node}:`);
+      lines.push(
+        `      cost=${cost.costEstimate.cost.toFixed(2)}, startup=${cost.costEstimate.startupCost.toFixed(2)}, scan=${cost.costEstimate.scanEst.toFixed(2)}`
+      );
+      lines.push(
+        `      rows=${cost.costEstimate.returnedRows.toFixed(2)}, selectivity=${cost.costEstimate.selectivity.toFixed(8)}, limit=${limitStr}`
+      );
+      lines.push(
+        `      downstreamChildSelectivity=${cost.downstreamChildSelectivity.toFixed(8)}`
+      );
+      lines.push(`      constraints=${constraintStr}`);
+      lines.push(`      filters=${filterStr}`);
+      lines.push(`      ordering=${orderingStr}`);
+    }
+  }
+  const joinCosts = [];
+  for (const event of events) {
+    if (event.type === "node-cost" && event.nodeType === "join") {
+      joinCosts.push(event);
+    }
+  }
+  if (joinCosts.length > 0) {
+    lines.push("  Joins:");
+    for (const cost of joinCosts) {
+      const typeStr = cost.joinType ? ` (${cost.joinType})` : "";
+      const limitStr = cost.costEstimate.limit !== void 0 ? cost.costEstimate.limit.toString() : "none";
+      lines.push(`    ${cost.node}${typeStr}:`);
+      lines.push(
+        `      cost=${cost.costEstimate.cost.toFixed(2)}, startup=${cost.costEstimate.startupCost.toFixed(2)}, scan=${cost.costEstimate.scanEst.toFixed(2)}`
+      );
+      lines.push(
+        `      rows=${cost.costEstimate.returnedRows.toFixed(2)}, selectivity=${cost.costEstimate.selectivity.toFixed(8)}, limit=${limitStr}`
+      );
+      lines.push(
+        `      downstreamChildSelectivity=${cost.downstreamChildSelectivity.toFixed(8)}`
+      );
+    }
+  }
+  const completeEvent = events.find((e) => e.type === "plan-complete");
+  const failedEvent = events.find((e) => e.type === "plan-failed");
+  if (completeEvent) {
+    lines.push(
+      `  ✓ Plan complete: total cost = ${completeEvent.totalCost.toFixed(2)}`
+    );
+  } else if (failedEvent) {
+    lines.push(`  ✗ Plan failed: ${failedEvent.reason}`);
+  }
+  return lines;
+}
+function convertConstraintUndefinedToNull(constraint) {
+  if (constraint === void 0) {
+    return void 0;
+  }
+  if (constraint === null) {
+    return null;
+  }
+  const result = {};
+  for (const [key, val] of Object.entries(constraint)) {
+    result[key] = val === void 0 ? null : val;
+  }
+  return result;
+}
+function serializeEvent(event) {
+  if (event.type === "plan-complete") {
+    const { planSnapshot: _, ...rest } = event;
+    return rest;
+  }
+  if (event.type === "node-constraint") {
+    return {
+      ...event,
+      constraint: convertConstraintUndefinedToNull(event.constraint)
+    };
+  }
+  if (event.type === "connection-costs") {
+    return {
+      ...event,
+      costs: event.costs.map((cost) => ({
+        ...cost,
+        constraints: Object.fromEntries(
+          Object.entries(cost.constraints).map(([key, val]) => [
+            key,
+            convertConstraintUndefinedToNull(val)
+          ])
+        )
+      }))
+    };
+  }
+  if (event.type === "constraints-propagated") {
+    return {
+      ...event,
+      connectionConstraints: event.connectionConstraints.map((cc) => ({
+        ...cc,
+        constraints: Object.fromEntries(
+          Object.entries(cc.constraints).map(([key, val]) => [
+            key,
+            convertConstraintUndefinedToNull(val)
+          ])
+        )
+      }))
+    };
+  }
+  return event;
+}
+function serializePlanDebugEvents(events) {
+  return events.map(serializeEvent);
+}
+function formatPlannerEvents(events) {
+  const lines = [];
+  const eventsByAttempt = /* @__PURE__ */ new Map();
+  let bestPlanEvent;
+  for (const event of events) {
+    if ("attemptNumber" in event) {
+      const attempt = event.attemptNumber;
+      if (attempt !== void 0) {
+        let attemptEvents = eventsByAttempt.get(attempt);
+        if (!attemptEvents) {
+          attemptEvents = [];
+          eventsByAttempt.set(attempt, attemptEvents);
+        }
+        attemptEvents.push(event);
+      }
+    } else if (event.type === "best-plan-selected") {
+      bestPlanEvent = event;
+    }
+  }
+  for (const [attemptNum, events2] of eventsByAttempt.entries()) {
+    lines.push(...formatAttemptSummary(attemptNum, events2));
+    lines.push("");
+  }
+  if (bestPlanEvent) {
+    lines.push("─".repeat(60));
+    lines.push(
+      `✓ Best plan: Attempt ${bestPlanEvent.bestAttemptNumber + 1} (cost=${bestPlanEvent.totalCost.toFixed(2)})`
+    );
+    if (bestPlanEvent.joinStates.length > 0) {
+      lines.push("  Join types:");
+      for (const j of bestPlanEvent.joinStates) {
+        lines.push(`    ${j.join}: ${j.type}`);
+      }
+    }
+    lines.push("─".repeat(60));
+  }
+  return lines.join("\n");
+}
+export {
+  AccumulatorDebugger,
+  formatPlannerEvents,
+  serializePlanDebugEvents
+};
+//# sourceMappingURL=planner-debug.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"planner-debug.js","sources":["../../../../../zql/src/planner/planner-debug.ts"],"sourcesContent":["import type * as v from '../../../shared/src/valita.ts';\nimport type {\n  Condition,\n  Ordering,\n  ValuePosition,\n} from '../../../zero-protocol/src/ast.ts';\nimport type {\n  attemptStartEventJSONSchema,\n  bestPlanSelectedEventJSONSchema,\n  connectionSelectedEventJSONSchema,\n  nodeConstraintEventJSONSchema,\n  PlanDebugEventJSON,\n  planFailedEventJSONSchema,\n} from '../../../zero-protocol/src/analyze-query-result.ts';\nimport type {PlannerConstraint} from './planner-constraint.ts';\nimport type {CostEstimate, JoinType} from './planner-node.ts';\nimport type {PlanState} from './planner-graph.ts';\n\n/**\n * Structured debug events emitted during query planning.\n * These events can be accumulated, printed, or analyzed to understand\n * the planner's decision-making process.\n */\n\n/**\n * Starting a new planning attempt with a different root connection.\n */\nexport type AttemptStartEvent = v.Infer<typeof attemptStartEventJSONSchema>;\n\n/**\n * Snapshot of connection costs before selecting the next connection.\n */\nexport type ConnectionCostsEvent = {\n  type: 'connection-costs';\n  attemptNumber: number;\n  costs: Array<{\n    connection: string;\n    cost: number;\n    costEstimate: Omit<CostEstimate, 'fanout'>;\n    pinned: boolean;\n    constraints: Record<string, PlannerConstraint | undefined>;\n    constraintCosts: Record<string, Omit<CostEstimate, 'fanout'>>;\n  }>;\n};\n\n/**\n * A connection was chosen and pinned.\n */\nexport type ConnectionSelectedEvent = v.Infer<\n  typeof connectionSelectedEventJSONSchema\n>;\n\n/**\n * Constraints have been propagated through the graph.\n */\nexport type ConstraintsPropagatedEvent = {\n  type: 'constraints-propagated';\n  attemptNumber: number;\n  connectionConstraints: Array<{\n    connection: string;\n    constraints: Record<string, PlannerConstraint | undefined>;\n    constraintCosts: Record<string, Omit<CostEstimate, 'fanout'>>;\n  }>;\n};\n\n/**\n * A complete plan was found for this attempt.\n */\nexport type PlanCompleteEvent = {\n  type: 'plan-complete';\n  attemptNumber: number;\n  totalCost: number;\n  flipPattern: number; // Bitmask indicating which joins are flipped\n  joinStates: Array<{\n    join: string;\n    type: JoinType;\n  }>;\n  // Planning snapshot that can be restored and applied to AST\n  planSnapshot: PlanState;\n};\n\n/**\n * Planning attempt failed (e.g., unflippable join).\n */\nexport type PlanFailedEvent = v.Infer<typeof planFailedEventJSONSchema>;\n\n/**\n * The best plan across all attempts was selected.\n */\nexport type BestPlanSelectedEvent = v.Infer<\n  typeof bestPlanSelectedEventJSONSchema\n>;\n\n/**\n * A node computed its cost estimate during planning.\n * Emitted by nodes during estimateCost() traversal.\n * attemptNumber is added by the debugger.\n */\nexport type NodeCostEvent = {\n  type: 'node-cost';\n  attemptNumber?: number;\n  nodeType: 'connection' | 'join' | 'fan-out' | 'fan-in' | 'terminus';\n  node: string;\n  branchPattern: number[];\n  downstreamChildSelectivity: number;\n  costEstimate: Omit<CostEstimate, 'fanout'>;\n  filters?: Condition | undefined; // Only for connections\n  ordering?: Ordering | undefined; // Only for connections\n  joinType?: JoinType | undefined; // Only for joins\n};\n\n/**\n * A node received constraints during constraint propagation.\n * Emitted by nodes during propagateConstraints() traversal.\n * attemptNumber is added by the debugger.\n */\nexport type NodeConstraintEvent = v.Infer<typeof nodeConstraintEventJSONSchema>;\n\n/**\n * Union of all debug event types.\n */\nexport type PlanDebugEvent =\n  | AttemptStartEvent\n  | ConnectionCostsEvent\n  | ConnectionSelectedEvent\n  | ConstraintsPropagatedEvent\n  | PlanCompleteEvent\n  | PlanFailedEvent\n  | BestPlanSelectedEvent\n  | NodeCostEvent\n  | NodeConstraintEvent;\n\n/**\n * Interface for objects that receive debug events during planning.\n */\nexport interface PlanDebugger {\n  log(event: PlanDebugEvent): void;\n}\n\n/**\n * Simple accumulator debugger that stores all events.\n * Useful for tests and debugging.\n */\nexport class AccumulatorDebugger implements PlanDebugger {\n  readonly events: PlanDebugEvent[] = [];\n  private currentAttempt = 0;\n\n  log(event: PlanDebugEvent): void {\n    // Track current attempt number\n    if (event.type === 'attempt-start') {\n      this.currentAttempt = event.attemptNumber;\n    }\n\n    // Add attempt number to node events\n    if (event.type === 'node-cost' || event.type === 'node-constraint') {\n      (event as NodeCostEvent | NodeConstraintEvent).attemptNumber =\n        this.currentAttempt;\n    }\n\n    this.events.push(event);\n  }\n\n  /**\n   * Get all events of a specific type.\n   */\n  getEvents<T extends PlanDebugEvent['type']>(\n    type: T,\n  ): Extract<PlanDebugEvent, {type: T}>[] {\n    return this.events.filter(e => e.type === type) as Extract<\n      PlanDebugEvent,\n      {type: T}\n    >[];\n  }\n\n  /**\n   * Format events as a human-readable string.\n   */\n  format(): string {\n    return formatPlannerEvents(this.events);\n  }\n}\n\n/**\n * Format a constraint object as a human-readable string.\n */\nfunction formatConstraint(\n  constraint: PlannerConstraint | Record<string, unknown> | null | undefined,\n): string {\n  if (!constraint) return '{}';\n  const keys = Object.keys(constraint);\n  if (keys.length === 0) return '{}';\n  return '{' + keys.join(', ') + '}';\n}\n\n/**\n * Format a ValuePosition (column, literal, or static parameter) as a human-readable string.\n */\nfunction formatValuePosition(value: ValuePosition): string {\n  switch (value.type) {\n    case 'column':\n      return value.name;\n    case 'literal':\n      // Format literal values with SQL-style quoting for strings\n      if (typeof value.value === 'string') {\n        return `'${value.value}'`;\n      }\n      return JSON.stringify(value.value);\n    case 'static':\n      return `@${value.anchor}.${Array.isArray(value.field) ? value.field.join('.') : value.field}`;\n  }\n}\n\n/**\n * Format a Condition (filter) as a human-readable string.\n */\nfunction formatFilter(filter: Condition | undefined): string {\n  if (!filter) return 'none';\n\n  switch (filter.type) {\n    case 'simple':\n      return `${formatValuePosition(filter.left)} ${filter.op} ${formatValuePosition(filter.right)}`;\n    case 'and':\n      return `(${filter.conditions.map(formatFilter).join(' AND ')})`;\n    case 'or':\n      return `(${filter.conditions.map(formatFilter).join(' OR ')})`;\n    case 'correlatedSubquery':\n      return `EXISTS(${filter.related.subquery.table})`;\n    default:\n      return JSON.stringify(filter);\n  }\n}\n\n/**\n * Format an Ordering as a human-readable string.\n */\nfunction formatOrdering(ordering: Ordering | undefined): string {\n  if (!ordering || ordering.length === 0) return 'none';\n  return ordering\n    .map(([field, direction]) => `${field} ${direction}`)\n    .join(', ');\n}\n\n/**\n * Format a compact summary for a single planning attempt.\n */\nfunction formatAttemptSummary(\n  attemptNum: number,\n  events: (PlanDebugEvent | PlanDebugEventJSON)[],\n): string[] {\n  const lines: string[] = [];\n\n  // Find the attempt-start event to get total attempts\n  const startEvent = events.find(e => e.type === 'attempt-start') as\n    | AttemptStartEvent\n    | undefined;\n  const totalAttempts = startEvent?.totalAttempts ?? '?';\n\n  // Calculate number of bits needed for pattern\n  const numBits =\n    typeof totalAttempts === 'number'\n      ? Math.ceil(Math.log2(totalAttempts)) || 1\n      : 1;\n  const bitPattern = attemptNum.toString(2).padStart(numBits, '0');\n\n  lines.push(\n    `[Attempt ${attemptNum + 1}/${totalAttempts}] Pattern ${attemptNum} (${bitPattern})`,\n  );\n\n  // Collect connection costs (use array to preserve all connections, including duplicates)\n  const connectionCostEvents: (\n    | NodeCostEvent\n    | Extract<PlanDebugEventJSON, {type: 'node-cost'}>\n  )[] = [];\n  const connectionConstraintEvents: (\n    | NodeConstraintEvent\n    | Extract<PlanDebugEventJSON, {type: 'node-constraint'}>\n  )[] = [];\n\n  for (const event of events) {\n    if (event.type === 'node-cost' && event.nodeType === 'connection') {\n      connectionCostEvents.push(event);\n    }\n    if (event.type === 'node-constraint' && event.nodeType === 'connection') {\n      connectionConstraintEvents.push(event);\n    }\n  }\n\n  // Show connection summary\n  if (connectionCostEvents.length > 0) {\n    lines.push('  Connections:');\n    for (const cost of connectionCostEvents) {\n      // Find matching constraint event (same node name and branch pattern)\n      const constraint = connectionConstraintEvents.find(\n        c =>\n          c.node === cost.node &&\n          c.branchPattern.join(',') === cost.branchPattern.join(','),\n      )?.constraint;\n\n      const constraintStr = formatConstraint(constraint);\n      const filterStr = formatFilter(cost.filters);\n      const orderingStr = formatOrdering(cost.ordering);\n      const limitStr =\n        cost.costEstimate.limit !== undefined\n          ? cost.costEstimate.limit.toString()\n          : 'none';\n\n      lines.push(`    ${cost.node}:`);\n      lines.push(\n        `      cost=${cost.costEstimate.cost.toFixed(2)}, startup=${cost.costEstimate.startupCost.toFixed(2)}, scan=${cost.costEstimate.scanEst.toFixed(2)}`,\n      );\n      lines.push(\n        `      rows=${cost.costEstimate.returnedRows.toFixed(2)}, selectivity=${cost.costEstimate.selectivity.toFixed(8)}, limit=${limitStr}`,\n      );\n      lines.push(\n        `      downstreamChildSelectivity=${cost.downstreamChildSelectivity.toFixed(8)}`,\n      );\n      lines.push(`      constraints=${constraintStr}`);\n      lines.push(`      filters=${filterStr}`);\n      lines.push(`      ordering=${orderingStr}`);\n    }\n  }\n\n  // Collect join costs from node-cost events\n  const joinCosts: (\n    | NodeCostEvent\n    | Extract<PlanDebugEventJSON, {type: 'node-cost'}>\n  )[] = [];\n  for (const event of events) {\n    if (event.type === 'node-cost' && event.nodeType === 'join') {\n      joinCosts.push(event);\n    }\n  }\n\n  if (joinCosts.length > 0) {\n    lines.push('  Joins:');\n    for (const cost of joinCosts) {\n      const typeStr = cost.joinType ? ` (${cost.joinType})` : '';\n      const limitStr =\n        cost.costEstimate.limit !== undefined\n          ? cost.costEstimate.limit.toString()\n          : 'none';\n\n      lines.push(`    ${cost.node}${typeStr}:`);\n      lines.push(\n        `      cost=${cost.costEstimate.cost.toFixed(2)}, startup=${cost.costEstimate.startupCost.toFixed(2)}, scan=${cost.costEstimate.scanEst.toFixed(2)}`,\n      );\n      lines.push(\n        `      rows=${cost.costEstimate.returnedRows.toFixed(2)}, selectivity=${cost.costEstimate.selectivity.toFixed(8)}, limit=${limitStr}`,\n      );\n      lines.push(\n        `      downstreamChildSelectivity=${cost.downstreamChildSelectivity.toFixed(8)}`,\n      );\n    }\n  }\n\n  // Find completion/failure events\n  const completeEvent = events.find(e => e.type === 'plan-complete') as\n    | PlanCompleteEvent\n    | undefined;\n  const failedEvent = events.find(e => e.type === 'plan-failed') as\n    | PlanFailedEvent\n    | undefined;\n\n  // Show final status\n\n  if (completeEvent) {\n    lines.push(\n      `  ✓ Plan complete: total cost = ${completeEvent.totalCost.toFixed(2)}`,\n    );\n  } else if (failedEvent) {\n    lines.push(`  ✗ Plan failed: ${failedEvent.reason}`);\n  }\n\n  return lines;\n}\n\n/**\n * Convert undefined values to null in a constraint object for JSON serialization.\n * PlannerConstraint uses Record<string, undefined> which loses keys during JSON.stringify.\n */\nfunction convertConstraintUndefinedToNull(\n  constraint: PlannerConstraint | Record<string, unknown> | undefined | null,\n): Record<string, unknown> | undefined | null {\n  if (constraint === undefined) {\n    return undefined;\n  }\n  if (constraint === null) {\n    return null;\n  }\n  const result: Record<string, unknown> = {};\n  for (const [key, val] of Object.entries(constraint)) {\n    result[key] = val === undefined ? null : val;\n  }\n  return result;\n}\n\n/**\n * Serialize a single debug event to JSON-compatible format.\n * The fanout function is already omitted when events are created.\n * The planSnapshot is excluded as it's internal state not needed for debugging.\n * Undefined values in constraints are converted to null for JSON serialization.\n */\nfunction serializeEvent(event: PlanDebugEvent): PlanDebugEventJSON {\n  // Remove planSnapshot from plan-complete events\n  if (event.type === 'plan-complete') {\n    const {planSnapshot: _, ...rest} = event;\n    return rest as PlanDebugEventJSON;\n  }\n\n  // Convert constraint undefined values to null for specific event types\n  if (event.type === 'node-constraint') {\n    return {\n      ...event,\n      constraint: convertConstraintUndefinedToNull(event.constraint),\n    } as PlanDebugEventJSON;\n  }\n\n  if (event.type === 'connection-costs') {\n    return {\n      ...event,\n      costs: event.costs.map(cost => ({\n        ...cost,\n        constraints: Object.fromEntries(\n          Object.entries(cost.constraints).map(([key, val]) => [\n            key,\n            convertConstraintUndefinedToNull(val),\n          ]),\n        ),\n      })),\n    } as PlanDebugEventJSON;\n  }\n\n  if (event.type === 'constraints-propagated') {\n    return {\n      ...event,\n      connectionConstraints: event.connectionConstraints.map(cc => ({\n        ...cc,\n        constraints: Object.fromEntries(\n          Object.entries(cc.constraints).map(([key, val]) => [\n            key,\n            convertConstraintUndefinedToNull(val),\n          ]),\n        ),\n      })),\n    } as PlanDebugEventJSON;\n  }\n\n  return event as PlanDebugEventJSON;\n}\n\n/**\n * Serialize an array of debug events to JSON-compatible format.\n * The fanout function is already omitted when events are created.\n * The planSnapshot is excluded as it's internal state not needed for debugging.\n */\nexport function serializePlanDebugEvents(\n  events: PlanDebugEvent[],\n): PlanDebugEventJSON[] {\n  return events.map(serializeEvent);\n}\n\n/**\n * Format planner debug events as a human-readable string.\n * Works with JSON-serialized events (from inspector API) or native events (from AccumulatorDebugger).\n *\n * @param events - Array of planner debug events (either JSON or native format)\n * @returns Formatted string showing planning attempts, costs, and final plan selection\n *\n * @example\n * ```typescript\n * const result = await inspector.analyzeQuery(query, { plannerDebug: true });\n * if (result.plannerEvents) {\n *   console.log(formatPlannerEvents(result.plannerEvents));\n * }\n * ```\n */\nexport function formatPlannerEvents(\n  events: PlanDebugEventJSON[] | PlanDebugEvent[],\n): string {\n  const lines: string[] = [];\n\n  // Group events by attempt\n  const eventsByAttempt = new Map<\n    number,\n    (PlanDebugEventJSON | PlanDebugEvent)[]\n  >();\n  let bestPlanEvent:\n    | {\n        type: 'best-plan-selected';\n        bestAttemptNumber: number;\n        totalCost: number;\n        flipPattern: number;\n        joinStates: Array<{join: string; type: string}>;\n      }\n    | undefined;\n\n  for (const event of events) {\n    if ('attemptNumber' in event) {\n      const attempt = event.attemptNumber;\n      if (attempt !== undefined) {\n        let attemptEvents = eventsByAttempt.get(attempt);\n        if (!attemptEvents) {\n          attemptEvents = [];\n          eventsByAttempt.set(attempt, attemptEvents);\n        }\n        attemptEvents.push(event);\n      }\n    } else if (event.type === 'best-plan-selected') {\n      // Save for displaying at the end\n      bestPlanEvent = event;\n    }\n  }\n\n  // Format each attempt as a compact summary\n  for (const [attemptNum, events] of eventsByAttempt.entries()) {\n    lines.push(...formatAttemptSummary(attemptNum, events));\n    lines.push(''); // Blank line between attempts\n  }\n\n  // Show the final plan selection\n  if (bestPlanEvent) {\n    lines.push('─'.repeat(60));\n    lines.push(\n      `✓ Best plan: Attempt ${bestPlanEvent.bestAttemptNumber + 1} (cost=${bestPlanEvent.totalCost.toFixed(2)})`,\n    );\n    if (bestPlanEvent.joinStates.length > 0) {\n      lines.push('  Join types:');\n      for (const j of bestPlanEvent.joinStates) {\n        lines.push(`    ${j.join}: ${j.type}`);\n      }\n    }\n    lines.push('─'.repeat(60));\n  }\n\n  return lines.join('\\n');\n}\n"],"names":["events"],"mappings":"AA+IO,MAAM,oBAA4C;AAAA,EAC9C,SAA2B,CAAA;AAAA,EAC5B,iBAAiB;AAAA,EAEzB,IAAI,OAA6B;AAE/B,QAAI,MAAM,SAAS,iBAAiB;AAClC,WAAK,iBAAiB,MAAM;AAAA,IAC9B;AAGA,QAAI,MAAM,SAAS,eAAe,MAAM,SAAS,mBAAmB;AACjE,YAA8C,gBAC7C,KAAK;AAAA,IACT;AAEA,SAAK,OAAO,KAAK,KAAK;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,UACE,MACsC;AACtC,WAAO,KAAK,OAAO,OAAO,CAAA,MAAK,EAAE,SAAS,IAAI;AAAA,EAIhD;AAAA;AAAA;AAAA;AAAA,EAKA,SAAiB;AACf,WAAO,oBAAoB,KAAK,MAAM;AAAA,EACxC;AACF;AAKA,SAAS,iBACP,YACQ;AACR,MAAI,CAAC,WAAY,QAAO;AACxB,QAAM,OAAO,OAAO,KAAK,UAAU;AACnC,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,SAAO,MAAM,KAAK,KAAK,IAAI,IAAI;AACjC;AAKA,SAAS,oBAAoB,OAA8B;AACzD,UAAQ,MAAM,MAAA;AAAA,IACZ,KAAK;AACH,aAAO,MAAM;AAAA,IACf,KAAK;AAEH,UAAI,OAAO,MAAM,UAAU,UAAU;AACnC,eAAO,IAAI,MAAM,KAAK;AAAA,MACxB;AACA,aAAO,KAAK,UAAU,MAAM,KAAK;AAAA,IACnC,KAAK;AACH,aAAO,IAAI,MAAM,MAAM,IAAI,MAAM,QAAQ,MAAM,KAAK,IAAI,MAAM,MAAM,KAAK,GAAG,IAAI,MAAM,KAAK;AAAA,EAAA;AAEjG;AAKA,SAAS,aAAa,QAAuC;AAC3D,MAAI,CAAC,OAAQ,QAAO;AAEpB,UAAQ,OAAO,MAAA;AAAA,IACb,KAAK;AACH,aAAO,GAAG,oBAAoB,OAAO,IAAI,CAAC,IAAI,OAAO,EAAE,IAAI,oBAAoB,OAAO,KAAK,CAAC;AAAA,IAC9F,KAAK;AACH,aAAO,IAAI,OAAO,WAAW,IAAI,YAAY,EAAE,KAAK,OAAO,CAAC;AAAA,IAC9D,KAAK;AACH,aAAO,IAAI,OAAO,WAAW,IAAI,YAAY,EAAE,KAAK,MAAM,CAAC;AAAA,IAC7D,KAAK;AACH,aAAO,UAAU,OAAO,QAAQ,SAAS,KAAK;AAAA,IAChD;AACE,aAAO,KAAK,UAAU,MAAM;AAAA,EAAA;AAElC;AAKA,SAAS,eAAe,UAAwC;AAC9D,MAAI,CAAC,YAAY,SAAS,WAAW,EAAG,QAAO;AAC/C,SAAO,SACJ,IAAI,CAAC,CAAC,OAAO,SAAS,MAAM,GAAG,KAAK,IAAI,SAAS,EAAE,EACnD,KAAK,IAAI;AACd;AAKA,SAAS,qBACP,YACA,QACU;AACV,QAAM,QAAkB,CAAA;AAGxB,QAAM,aAAa,OAAO,KAAK,CAAA,MAAK,EAAE,SAAS,eAAe;AAG9D,QAAM,gBAAgB,YAAY,iBAAiB;AAGnD,QAAM,UACJ,OAAO,kBAAkB,WACrB,KAAK,KAAK,KAAK,KAAK,aAAa,CAAC,KAAK,IACvC;AACN,QAAM,aAAa,WAAW,SAAS,CAAC,EAAE,SAAS,SAAS,GAAG;AAE/D,QAAM;AAAA,IACJ,YAAY,aAAa,CAAC,IAAI,aAAa,aAAa,UAAU,KAAK,UAAU;AAAA,EAAA;AAInF,QAAM,uBAGA,CAAA;AACN,QAAM,6BAGA,CAAA;AAEN,aAAW,SAAS,QAAQ;AAC1B,QAAI,MAAM,SAAS,eAAe,MAAM,aAAa,cAAc;AACjE,2BAAqB,KAAK,KAAK;AAAA,IACjC;AACA,QAAI,MAAM,SAAS,qBAAqB,MAAM,aAAa,cAAc;AACvE,iCAA2B,KAAK,KAAK;AAAA,IACvC;AAAA,EACF;AAGA,MAAI,qBAAqB,SAAS,GAAG;AACnC,UAAM,KAAK,gBAAgB;AAC3B,eAAW,QAAQ,sBAAsB;AAEvC,YAAM,aAAa,2BAA2B;AAAA,QAC5C,CAAA,MACE,EAAE,SAAS,KAAK,QAChB,EAAE,cAAc,KAAK,GAAG,MAAM,KAAK,cAAc,KAAK,GAAG;AAAA,MAAA,GAC1D;AAEH,YAAM,gBAAgB,iBAAiB,UAAU;AACjD,YAAM,YAAY,aAAa,KAAK,OAAO;AAC3C,YAAM,cAAc,eAAe,KAAK,QAAQ;AAChD,YAAM,WACJ,KAAK,aAAa,UAAU,SACxB,KAAK,aAAa,MAAM,SAAA,IACxB;AAEN,YAAM,KAAK,OAAO,KAAK,IAAI,GAAG;AAC9B,YAAM;AAAA,QACJ,cAAc,KAAK,aAAa,KAAK,QAAQ,CAAC,CAAC,aAAa,KAAK,aAAa,YAAY,QAAQ,CAAC,CAAC,UAAU,KAAK,aAAa,QAAQ,QAAQ,CAAC,CAAC;AAAA,MAAA;AAEpJ,YAAM;AAAA,QACJ,cAAc,KAAK,aAAa,aAAa,QAAQ,CAAC,CAAC,iBAAiB,KAAK,aAAa,YAAY,QAAQ,CAAC,CAAC,WAAW,QAAQ;AAAA,MAAA;AAErI,YAAM;AAAA,QACJ,oCAAoC,KAAK,2BAA2B,QAAQ,CAAC,CAAC;AAAA,MAAA;AAEhF,YAAM,KAAK,qBAAqB,aAAa,EAAE;AAC/C,YAAM,KAAK,iBAAiB,SAAS,EAAE;AACvC,YAAM,KAAK,kBAAkB,WAAW,EAAE;AAAA,IAC5C;AAAA,EACF;AAGA,QAAM,YAGA,CAAA;AACN,aAAW,SAAS,QAAQ;AAC1B,QAAI,MAAM,SAAS,eAAe,MAAM,aAAa,QAAQ;AAC3D,gBAAU,KAAK,KAAK;AAAA,IACtB;AAAA,EACF;AAEA,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM,KAAK,UAAU;AACrB,eAAW,QAAQ,WAAW;AAC5B,YAAM,UAAU,KAAK,WAAW,KAAK,KAAK,QAAQ,MAAM;AACxD,YAAM,WACJ,KAAK,aAAa,UAAU,SACxB,KAAK,aAAa,MAAM,SAAA,IACxB;AAEN,YAAM,KAAK,OAAO,KAAK,IAAI,GAAG,OAAO,GAAG;AACxC,YAAM;AAAA,QACJ,cAAc,KAAK,aAAa,KAAK,QAAQ,CAAC,CAAC,aAAa,KAAK,aAAa,YAAY,QAAQ,CAAC,CAAC,UAAU,KAAK,aAAa,QAAQ,QAAQ,CAAC,CAAC;AAAA,MAAA;AAEpJ,YAAM;AAAA,QACJ,cAAc,KAAK,aAAa,aAAa,QAAQ,CAAC,CAAC,iBAAiB,KAAK,aAAa,YAAY,QAAQ,CAAC,CAAC,WAAW,QAAQ;AAAA,MAAA;AAErI,YAAM;AAAA,QACJ,oCAAoC,KAAK,2BAA2B,QAAQ,CAAC,CAAC;AAAA,MAAA;AAAA,IAElF;AAAA,EACF;AAGA,QAAM,gBAAgB,OAAO,KAAK,CAAA,MAAK,EAAE,SAAS,eAAe;AAGjE,QAAM,cAAc,OAAO,KAAK,CAAA,MAAK,EAAE,SAAS,aAAa;AAM7D,MAAI,eAAe;AACjB,UAAM;AAAA,MACJ,mCAAmC,cAAc,UAAU,QAAQ,CAAC,CAAC;AAAA,IAAA;AAAA,EAEzE,WAAW,aAAa;AACtB,UAAM,KAAK,oBAAoB,YAAY,MAAM,EAAE;AAAA,EACrD;AAEA,SAAO;AACT;AAMA,SAAS,iCACP,YAC4C;AAC5C,MAAI,eAAe,QAAW;AAC5B,WAAO;AAAA,EACT;AACA,MAAI,eAAe,MAAM;AACvB,WAAO;AAAA,EACT;AACA,QAAM,SAAkC,CAAA;AACxC,aAAW,CAAC,KAAK,GAAG,KAAK,OAAO,QAAQ,UAAU,GAAG;AACnD,WAAO,GAAG,IAAI,QAAQ,SAAY,OAAO;AAAA,EAC3C;AACA,SAAO;AACT;AAQA,SAAS,eAAe,OAA2C;AAEjE,MAAI,MAAM,SAAS,iBAAiB;AAClC,UAAM,EAAC,cAAc,GAAG,GAAG,SAAQ;AACnC,WAAO;AAAA,EACT;AAGA,MAAI,MAAM,SAAS,mBAAmB;AACpC,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY,iCAAiC,MAAM,UAAU;AAAA,IAAA;AAAA,EAEjE;AAEA,MAAI,MAAM,SAAS,oBAAoB;AACrC,WAAO;AAAA,MACL,GAAG;AAAA,MACH,OAAO,MAAM,MAAM,IAAI,CAAA,UAAS;AAAA,QAC9B,GAAG;AAAA,QACH,aAAa,OAAO;AAAA,UAClB,OAAO,QAAQ,KAAK,WAAW,EAAE,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM;AAAA,YACnD;AAAA,YACA,iCAAiC,GAAG;AAAA,UAAA,CACrC;AAAA,QAAA;AAAA,MACH,EACA;AAAA,IAAA;AAAA,EAEN;AAEA,MAAI,MAAM,SAAS,0BAA0B;AAC3C,WAAO;AAAA,MACL,GAAG;AAAA,MACH,uBAAuB,MAAM,sBAAsB,IAAI,CAAA,QAAO;AAAA,QAC5D,GAAG;AAAA,QACH,aAAa,OAAO;AAAA,UAClB,OAAO,QAAQ,GAAG,WAAW,EAAE,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM;AAAA,YACjD;AAAA,YACA,iCAAiC,GAAG;AAAA,UAAA,CACrC;AAAA,QAAA;AAAA,MACH,EACA;AAAA,IAAA;AAAA,EAEN;AAEA,SAAO;AACT;AAOO,SAAS,yBACd,QACsB;AACtB,SAAO,OAAO,IAAI,cAAc;AAClC;AAiBO,SAAS,oBACd,QACQ;AACR,QAAM,QAAkB,CAAA;AAGxB,QAAM,sCAAsB,IAAA;AAI5B,MAAI;AAUJ,aAAW,SAAS,QAAQ;AAC1B,QAAI,mBAAmB,OAAO;AAC5B,YAAM,UAAU,MAAM;AACtB,UAAI,YAAY,QAAW;AACzB,YAAI,gBAAgB,gBAAgB,IAAI,OAAO;AAC/C,YAAI,CAAC,eAAe;AAClB,0BAAgB,CAAA;AAChB,0BAAgB,IAAI,SAAS,aAAa;AAAA,QAC5C;AACA,sBAAc,KAAK,KAAK;AAAA,MAC1B;AAAA,IACF,WAAW,MAAM,SAAS,sBAAsB;AAE9C,sBAAgB;AAAA,IAClB;AAAA,EACF;AAGA,aAAW,CAAC,YAAYA,OAAM,KAAK,gBAAgB,WAAW;AAC5D,UAAM,KAAK,GAAG,qBAAqB,YAAYA,OAAM,CAAC;AACtD,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,MAAI,eAAe;AACjB,UAAM,KAAK,IAAI,OAAO,EAAE,CAAC;AACzB,UAAM;AAAA,MACJ,wBAAwB,cAAc,oBAAoB,CAAC,UAAU,cAAc,UAAU,QAAQ,CAAC,CAAC;AAAA,IAAA;AAEzG,QAAI,cAAc,WAAW,SAAS,GAAG;AACvC,YAAM,KAAK,eAAe;AAC1B,iBAAW,KAAK,cAAc,YAAY;AACxC,cAAM,KAAK,OAAO,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAAA,MACvC;AAAA,IACF;AACA,UAAM,KAAK,IAAI,OAAO,EAAE,CAAC;AAAA,EAC3B;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;"}

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

@@ -0,0 +1,39 @@
+import type { PlannerConstraint } from './planner-constraint.ts';
+import type { PlanDebugger } from './planner-debug.ts';
+import type { CostEstimate, JoinOrConnection, PlannerNode } from './planner-node.ts';
+import type { PlannerTerminus } from './planner-terminus.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.
+ */
+export declare class PlannerFanIn {
+    #private;
+    readonly kind: "fan-in";
+    constructor(inputs: Exclude<PlannerNode, PlannerTerminus>[]);
+    get type(): "FI" | "UFI";
+    closestJoinOrSource(): JoinOrConnection;
+    setOutput(node: PlannerNode): void;
+    get output(): PlannerNode;
+    reset(): void;
+    convertToUFI(): void;
+    /**
+     * Propagate unlimiting when a parent join is flipped.
+     * Fan-in propagates to all of its inputs.
+     */
+    propagateUnlimitFromFlippedJoin(): void;
+    estimateCost(downstreamChildSelectivity: number, branchPattern: number[], planDebugger?: PlanDebugger): CostEstimate;
+    propagateConstraints(branchPattern: number[], constraint: PlannerConstraint | undefined, from?: PlannerNode, planDebugger?: PlanDebugger): void;
+}
+//# sourceMappingURL=planner-fan-in.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"planner-fan-in.d.ts","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-fan-in.ts"],"names":[],"mappings":"AACA,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;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,YAAY;;IACvB,QAAQ,CAAC,IAAI,EAAG,QAAQ,CAAU;gBAKtB,MAAM,EAAE,OAAO,CAAC,WAAW,EAAE,eAAe,CAAC,EAAE;IAK3D,IAAI,IAAI,iBAEP;IAED,mBAAmB,IAAI,gBAAgB;IAIvC,SAAS,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IAIlC,IAAI,MAAM,IAAI,WAAW,CAGxB;IAED,KAAK;IAIL,YAAY,IAAI,IAAI;IAIpB;;;OAGG;IACH,+BAA+B,IAAI,IAAI;IAavC,YAAY,CACV,0BAA0B,EAAE,MAAM,EAClC,aAAa,EAAE,MAAM,EAAE,EACvB,YAAY,CAAC,EAAE,YAAY,GAC1B,YAAY;IA8Gf,oBAAoB,CAClB,aAAa,EAAE,MAAM,EAAE,EACvB,UAAU,EAAE,iBAAiB,GAAG,SAAS,EACzC,IAAI,CAAC,EAAE,WAAW,EAClB,YAAY,CAAC,EAAE,YAAY,GAC1B,IAAI;CAyCR"}