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

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"planner-connection.js","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-connection.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAEtD,OAAO,EACL,gBAAgB,GAEjB,MAAM,yBAAyB,CAAC;AAQjC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AACH,MAAM,OAAO,iBAAiB;IACnB,IAAI,GAAG,YAAqB,CAAC;IAEtC,2EAA2E;IAC3E,+DAA+D;IAC/D,2EAA2E;IAClE,KAAK,CAAW;IAChB,QAAQ,CAAwB;IAChC,MAAM,CAAsB;IAC5B,KAAK,CAAS;IACd,IAAI,CAAS,CAAC,6DAA6D;IAC3E,gBAAgB,CAAgC,CAAC,sCAAsC;IACvF,UAAU,CAAqB,CAAC,uDAAuD;IACvF,WAAW,CAAS,CAAC,wDAAwD;IACtF,OAAO,CAA2B,CAAC,qCAAqC;IAExE,2EAA2E;IAC3E,sDAAsD;IACtD,2EAA2E;IAC3E;;;;OAIG;IACH,KAAK,CAAqB;IAE1B;;;;;;OAMG;IACM,YAAY,CAA6C;IAEzD,OAAO,CAAU;IAE1B;;;;OAIG;IACH,sBAAsB,GAA8B,IAAI,GAAG,EAAE,CAAC;IAE9D,YACE,KAAa,EACb,KAA0B,EAC1B,IAAc,EACd,OAA8B,EAC9B,MAAe,EACf,eAAmC,EACnC,KAAc,EACd,IAAa;QAEb,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,KAAK,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;QACxC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;QAC9B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QAEtB,qEAAqE;QACrE,mDAAmD;QACnD,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,EAAE,CAAC;YACnC,MAAM,eAAe,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;YAC/D,MAAM,kBAAkB,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACpE,IAAI,CAAC,WAAW;gBACd,kBAAkB,CAAC,IAAI,GAAG,CAAC;oBACzB,CAAC,CAAC,eAAe,CAAC,IAAI,GAAG,kBAAkB,CAAC,IAAI;oBAChD,CAAC,CAAC,GAAG,CAAC;QACZ,CAAC;aAAM,CAAC;YACN,kDAAkD;YAClD,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;QACzB,CAAC;IACH,CAAC;IAED,SAAS,CAAC,IAAiB;QACzB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACtB,CAAC;IAED,IAAI,MAAM;QACR,MAAM,CAAC,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,gBAAgB,CAAC,CAAC;QACrD,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,mBAAmB;QACjB,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,oBAAoB,CAClB,IAAc,EACd,CAAgC,EAChC,IAAkB,EAClB,YAA2B;QAE3B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC9B,8CAA8C;QAC9C,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC;QAEpC,YAAY,EAAE,GAAG,CAAC;YAChB,IAAI,EAAE,iBAAiB;YACvB,QAAQ,EAAE,YAAY;YACtB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,aAAa,EAAE,IAAI;YACnB,UAAU,EAAE,CAAC;YACb,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,SAAS;SAC9B,CAAC,CAAC;IACL,CAAC;IAED,YAAY,CACV,0BAAkC,EAClC,aAAuB,EACvB,YAA2B;QAE3B,kEAAkE;QAClE,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEpC,mCAAmC;QACnC,IAAI,IAAI,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,iCAAiC;QACjC,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9C,qDAAqD;QACrD,MAAM,gBAAgB,GAAG,gBAAgB,CACvC,IAAI,CAAC,gBAAgB,EACrB,UAAU,CACX,CAAC;QACF,MAAM,EAAC,WAAW,EAAE,IAAI,EAAC,GAAG,IAAI,CAAC,MAAM,CACrC,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,QAAQ,EACb,gBAAgB,CACjB,CAAC;QACF,IAAI,GAAG;YACL,WAAW;YACX,OAAO,EACL,IAAI,CAAC,KAAK,KAAK,SAAS;gBACtB,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,GAAG,0BAA0B,CAAC;YAC7D,IAAI,EAAE,CAAC;YACP,YAAY,EAAE,IAAI;YAClB,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC;QACF,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAE3C,YAAY,EAAE,GAAG,CAAC;YAChB,IAAI,EAAE,WAAW;YACjB,QAAQ,EAAE,YAAY;YACtB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,aAAa;YACb,0BAA0B;YAC1B,YAAY,EAAE,IAAI;YAClB,OAAO,EAAE,IAAI,CAAC,QAAQ;SACvB,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,qCAAqC;YACrC,OAAO;QACT,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,gDAAgD;YAChD,iDAAiD;YACjD,6DAA6D;QAC/D,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,+BAA+B;QAC7B,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;QAC7B,wBAAwB;QACxB,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC;IACtC,CAAC;IAED;;;OAGG;IACH,kBAAkB;QAChB,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAChB,WAAuD;QAEvD,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;YACvC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,8CAA8C;QAC9C,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC;IACtC,CAAC;IAED;;;OAGG;IACH,sBAAsB;QACpB,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,kBAAkB;QAChB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACH,0BAA0B;QACxB,8BAA8B;QAC9B,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;IAC9C,CAAC;CACF"}

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

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

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

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

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

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

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

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

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

@@ -0,0 +1,148 @@
+import type { Condition } from '../../../zero-protocol/src/ast.ts';
+import type { PlannerConstraint } from './planner-constraint.ts';
+import type { CostEstimate, JoinType } from './planner-node.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 = {
+    type: 'attempt-start';
+    attemptNumber: number;
+    totalAttempts: number;
+};
+/**
+ * Snapshot of connection costs before selecting the next connection.
+ */
+export type ConnectionCostsEvent = {
+    type: 'connection-costs';
+    attemptNumber: number;
+    costs: Array<{
+        connection: string;
+        cost: number;
+        costEstimate: CostEstimate;
+        pinned: boolean;
+        constraints: Map<string, PlannerConstraint | undefined>;
+        constraintCosts: Map<string, CostEstimate>;
+    }>;
+};
+/**
+ * A connection was chosen and pinned.
+ */
+export type ConnectionSelectedEvent = {
+    type: 'connection-selected';
+    attemptNumber: number;
+    connection: string;
+    cost: number;
+    isRoot: boolean;
+};
+/**
+ * Constraints have been propagated through the graph.
+ */
+export type ConstraintsPropagatedEvent = {
+    type: 'constraints-propagated';
+    attemptNumber: number;
+    connectionConstraints: Array<{
+        connection: string;
+        constraints: Map<string, PlannerConstraint | undefined>;
+        constraintCosts: Map<string, CostEstimate>;
+    }>;
+};
+/**
+ * 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?: unknown;
+};
+/**
+ * Planning attempt failed (e.g., unflippable join).
+ */
+export type PlanFailedEvent = {
+    type: 'plan-failed';
+    attemptNumber: number;
+    reason: string;
+};
+/**
+ * The best plan across all attempts was selected.
+ */
+export type BestPlanSelectedEvent = {
+    type: 'best-plan-selected';
+    bestAttemptNumber: number;
+    totalCost: number;
+    flipPattern: number;
+    joinStates: Array<{
+        join: string;
+        type: JoinType;
+    }>;
+};
+/**
+ * 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: CostEstimate;
+    filters?: Condition | 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 = {
+    type: 'node-constraint';
+    attemptNumber?: number;
+    nodeType: 'connection' | 'join' | 'fan-out' | 'fan-in' | 'terminus';
+    node: string;
+    branchPattern: number[];
+    constraint: PlannerConstraint | undefined;
+    from: string;
+};
+/**
+ * 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;
+}
+//# 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,EAAC,SAAS,EAAC,MAAM,mCAAmC,CAAC;AACjE,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,yBAAyB,CAAC;AAC/D,OAAO,KAAK,EAAC,YAAY,EAAE,QAAQ,EAAC,MAAM,mBAAmB,CAAC;AAE9D;;;;GAIG;AAEH;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG;IAC9B,IAAI,EAAE,eAAe,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;CACvB,CAAC;AAEF;;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,YAAY,CAAC;QAC3B,MAAM,EAAE,OAAO,CAAC;QAChB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,GAAG,SAAS,CAAC,CAAC;QACxD,eAAe,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;KAC5C,CAAC,CAAC;CACJ,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,uBAAuB,GAAG;IACpC,IAAI,EAAE,qBAAqB,CAAC;IAC5B,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,OAAO,CAAC;CACjB,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,GAAG,CAAC,MAAM,EAAE,iBAAiB,GAAG,SAAS,CAAC,CAAC;QACxD,eAAe,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;KAC5C,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,CAAC,EAAE,OAAO,CAAC;CACxB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG;IAC5B,IAAI,EAAE,aAAa,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,qBAAqB,GAAG;IAClC,IAAI,EAAE,oBAAoB,CAAC;IAC3B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,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;CACJ,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,YAAY,CAAC;IAC3B,OAAO,CAAC,EAAE,SAAS,GAAG,SAAS,CAAC;IAChC,QAAQ,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAC;CACjC,CAAC;AAEF;;;;GAIG;AACH,MAAM,MAAM,mBAAmB,GAAG;IAChC,IAAI,EAAE,iBAAiB,CAAC;IACxB,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,UAAU,EAAE,iBAAiB,GAAG,SAAS,CAAC;IAC1C,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAEF;;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;CA6CjB"}

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

@@ -0,0 +1,176 @@
+/**
+ * Simple accumulator debugger that stores all events.
+ * Useful for tests and debugging.
+ */
+export class AccumulatorDebugger {
+    events = [];
+    currentAttempt = 0;
+    log(event) {
+        // Track current attempt number
+        if (event.type === 'attempt-start') {
+            this.currentAttempt = event.attemptNumber;
+        }
+        // Add attempt number to node events
+        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() {
+        const lines = [];
+        // Group events by attempt
+        const eventsByAttempt = new Map();
+        let bestPlanEvent;
+        for (const event of this.events) {
+            if ('attemptNumber' in event) {
+                const attempt = event.attemptNumber;
+                let attemptEvents = eventsByAttempt.get(attempt);
+                if (!attemptEvents) {
+                    attemptEvents = [];
+                    eventsByAttempt.set(attempt, attemptEvents);
+                }
+                attemptEvents.push(event);
+            }
+            else if (event.type === 'best-plan-selected') {
+                // Save for displaying at the end
+                bestPlanEvent = event;
+            }
+        }
+        // Format each attempt as a compact summary
+        for (const [attemptNum, events] of eventsByAttempt.entries()) {
+            lines.push(...formatAttemptSummary(attemptNum, events));
+            lines.push(''); // Blank line between attempts
+        }
+        // Show the final plan selection
+        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');
+    }
+}
+/**
+ * Format a constraint object as a human-readable string.
+ */
+function formatConstraint(constraint) {
+    if (!constraint)
+        return '{}';
+    const keys = Object.keys(constraint);
+    if (keys.length === 0)
+        return '{}';
+    return '{' + keys.join(', ') + '}';
+}
+/**
+ * Format a Condition (filter) as a human-readable string.
+ */
+function formatFilter(filter) {
+    if (!filter)
+        return 'none';
+    switch (filter.type) {
+        case 'simple':
+            return `${filter.left.type === 'column' ? filter.left.name : JSON.stringify(filter.left)} ${filter.op} ${filter.right.type === 'literal' ? JSON.stringify(filter.right.value) : JSON.stringify(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);
+    }
+}
+/**
+ * Format a compact summary for a single planning attempt.
+ */
+function formatAttemptSummary(attemptNum, events) {
+    const lines = [];
+    // Find the attempt-start event to get total attempts
+    const startEvent = events.find(e => e.type === 'attempt-start');
+    const totalAttempts = startEvent?.totalAttempts ?? '?';
+    // Calculate number of bits needed for pattern
+    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})`);
+    // Collect connection costs (use array to preserve all connections, including duplicates)
+    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);
+        }
+    }
+    // Show connection summary
+    if (connectionCostEvents.length > 0) {
+        lines.push('  Connections:');
+        for (const cost of connectionCostEvents) {
+            // Find matching constraint event (same node name and branch pattern)
+            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 limitStr = cost.costEstimate.limit !== undefined
+                ? 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}`);
+        }
+    }
+    // Collect join costs from node-cost events
+    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 !== undefined
+                ? 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)}`);
+        }
+    }
+    // Find completion/failure events
+    const completeEvent = events.find(e => e.type === 'plan-complete');
+    const failedEvent = events.find(e => e.type === 'plan-failed');
+    // Show final status
+    if (completeEvent) {
+        lines.push(`  ✓ Plan complete: total cost = ${completeEvent.totalCost.toFixed(2)}`);
+    }
+    else if (failedEvent) {
+        lines.push(`  ✗ Plan failed: ${failedEvent.reason}`);
+    }
+    return lines;
+}
+//# sourceMappingURL=planner-debug.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"planner-debug.js","sourceRoot":"","sources":["../../../../../zql/src/planner/planner-debug.ts"],"names":[],"mappings":"AAuJA;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IACrB,MAAM,GAAqB,EAAE,CAAC;IAC/B,cAAc,GAAG,CAAC,CAAC;IAE3B,GAAG,CAAC,KAAqB;QACvB,+BAA+B;QAC/B,IAAI,KAAK,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;YACnC,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC,aAAa,CAAC;QAC5C,CAAC;QAED,oCAAoC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,IAAI,KAAK,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;YAClE,KAA6C,CAAC,aAAa;gBAC1D,IAAI,CAAC,cAAc,CAAC;QACxB,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,SAAS,CACP,IAAO;QAEP,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAG3C,CAAC;IACN,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,0BAA0B;QAC1B,MAAM,eAAe,GAAG,IAAI,GAAG,EAA4B,CAAC;QAC5D,IAAI,aAAgD,CAAC;QAErD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,IAAI,eAAe,IAAI,KAAK,EAAE,CAAC;gBAC7B,MAAM,OAAO,GAAG,KAAK,CAAC,aAAa,CAAC;gBACpC,IAAI,aAAa,GAAG,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACjD,IAAI,CAAC,aAAa,EAAE,CAAC;oBACnB,aAAa,GAAG,EAAE,CAAC;oBACnB,eAAe,CAAC,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;gBAC9C,CAAC;gBACD,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC5B,CAAC;iBAAM,IAAI,KAAK,CAAC,IAAI,KAAK,oBAAoB,EAAE,CAAC;gBAC/C,iCAAiC;gBACjC,aAAa,GAAG,KAAK,CAAC;YACxB,CAAC;QACH,CAAC;QAED,2CAA2C;QAC3C,KAAK,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YAC7D,KAAK,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC;YACxD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,8BAA8B;QAChD,CAAC;QAED,gCAAgC;QAChC,IAAI,aAAa,EAAE,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,KAAK,CAAC,IAAI,CACR,wBAAwB,aAAa,CAAC,iBAAiB,GAAG,CAAC,UAAU,aAAa,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAC3G,CAAC;YACF,IAAI,aAAa,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBAC5B,KAAK,MAAM,CAAC,IAAI,aAAa,CAAC,UAAU,EAAE,CAAC;oBACzC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;CACF;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,UAAyC;IACjE,IAAI,CAAC,UAAU;QAAE,OAAO,IAAI,CAAC;IAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACrC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,MAA6B;IACjD,IAAI,CAAC,MAAM;QAAE,OAAO,MAAM,CAAC;IAE3B,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ;YACX,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,EAAE,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACjN,KAAK,KAAK;YACR,OAAO,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC;QAClE,KAAK,IAAI;YACP,OAAO,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;QACjE,KAAK,oBAAoB;YACvB,OAAO,UAAU,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC;QACpD;YACE,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAC3B,UAAkB,EAClB,MAAwB;IAExB,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,qDAAqD;IACrD,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,eAAe,CAEjD,CAAC;IACd,MAAM,aAAa,GAAG,UAAU,EAAE,aAAa,IAAI,GAAG,CAAC;IAEvD,8CAA8C;IAC9C,MAAM,OAAO,GACX,OAAO,aAAa,KAAK,QAAQ;QAC/B,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC;QAC1C,CAAC,CAAC,CAAC,CAAC;IACR,MAAM,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAEjE,KAAK,CAAC,IAAI,CACR,YAAY,UAAU,GAAG,CAAC,IAAI,aAAa,aAAa,UAAU,KAAK,UAAU,GAAG,CACrF,CAAC;IAEF,yFAAyF;IACzF,MAAM,oBAAoB,GAAoB,EAAE,CAAC;IACjD,MAAM,0BAA0B,GAA0B,EAAE,CAAC;IAE7D,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,IAAI,KAAK,CAAC,QAAQ,KAAK,YAAY,EAAE,CAAC;YAClE,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,iBAAiB,IAAI,KAAK,CAAC,QAAQ,KAAK,YAAY,EAAE,CAAC;YACxE,0BAA0B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,0BAA0B;IAC1B,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,oBAAoB,EAAE,CAAC;YACxC,qEAAqE;YACrE,MAAM,UAAU,GAAG,0BAA0B,CAAC,IAAI,CAChD,CAAC,CAAC,EAAE,CACF,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;gBACpB,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAC7D,EAAE,UAAU,CAAC;YAEd,MAAM,aAAa,GAAG,gBAAgB,CAAC,UAAU,CAAC,CAAC;YACnD,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,QAAQ,GACZ,IAAI,CAAC,YAAY,CAAC,KAAK,KAAK,SAAS;gBACnC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE;gBACpC,CAAC,CAAC,MAAM,CAAC;YAEb,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YAChC,KAAK,CAAC,IAAI,CACR,cAAc,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CACrJ,CAAC;YACF,KAAK,CAAC,IAAI,CACR,cAAc,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,QAAQ,EAAE,CACtI,CAAC;YACF,KAAK,CAAC,IAAI,CACR,oCAAoC,IAAI,CAAC,0BAA0B,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CACjF,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,qBAAqB,aAAa,EAAE,CAAC,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,iBAAiB,SAAS,EAAE,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,2CAA2C;IAC3C,MAAM,SAAS,GAAoB,EAAE,CAAC;IACtC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,IAAI,KAAK,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;YAC5D,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvB,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3D,MAAM,QAAQ,GACZ,IAAI,CAAC,YAAY,CAAC,KAAK,KAAK,SAAS;gBACnC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE;gBACpC,CAAC,CAAC,MAAM,CAAC;YAEb,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,GAAG,OAAO,GAAG,CAAC,CAAC;YAC1C,KAAK,CAAC,IAAI,CACR,cAAc,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CACrJ,CAAC;YACF,KAAK,CAAC,IAAI,CACR,cAAc,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,QAAQ,EAAE,CACtI,CAAC;YACF,KAAK,CAAC,IAAI,CACR,oCAAoC,IAAI,CAAC,0BAA0B,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CACjF,CAAC;QACJ,CAAC;IACH,CAAC;IAED,iCAAiC;IACjC,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,eAAe,CAEpD,CAAC;IACd,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAEhD,CAAC;IAEd,oBAAoB;IAEpB,IAAI,aAAa,EAAE,CAAC;QAClB,KAAK,CAAC,IAAI,CACR,mCAAmC,aAAa,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CACxE,CAAC;IACJ,CAAC;SAAM,IAAI,WAAW,EAAE,CAAC;QACvB,KAAK,CAAC,IAAI,CAAC,oBAAoB,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;IACvD,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}