@rocicorp/zero 0.25.0-canary.14 → 0.25.0-canary.15

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

@@ -1 +1 @@
-{"version":3,"file":"planner-graph.js","sources":["../../../../../zql/src/planner/planner-graph.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport {PlannerException} from '../error.ts';\nimport type {PlanDebugger} from './planner-debug.ts';\nimport type {PlannerConnection} from './planner-connection.ts';\nimport type {PlannerConstraint} from './planner-constraint.ts';\nimport type {PlannerFanIn} from './planner-fan-in.ts';\nimport type {PlannerFanOut} from './planner-fan-out.ts';\nimport type {PlannerJoin} from './planner-join.ts';\nimport {omitFanout} from './planner-node.ts';\nimport type {PlannerNode} from './planner-node.ts';\nimport {PlannerSource, type ConnectionCostModel} from './planner-source.ts';\nimport type {PlannerTerminus} from './planner-terminus.ts';\n\n/**\n * Captured state of a plan for comparison and restoration.\n */\nexport type PlanState = {\n  connections: Array<{limit: number | undefined}>;\n  joins: Array<{type: 'semi' | 'flipped'}>;\n  fanOuts: Array<{type: 'FO' | 'UFO'}>;\n  fanIns: Array<{type: 'FI' | 'UFI'}>;\n  connectionConstraints: Array<Map<string, PlannerConstraint | undefined>>;\n};\n\n/**\n * Maximum number of flippable joins to attempt exhaustive enumeration.\n * With n flippable joins, we explore 2^n plans.\n * 10 joins = 1024 plans (~100-200ms), 12 joins = 4096 plans (~400ms - 1 second)\n */\nconst MAX_FLIPPABLE_JOINS = 9;\n\n/**\n * Cached information about FanOut→FanIn relationships.\n * Computed once during planning to avoid redundant BFS traversals.\n */\ntype FOFIInfo = {\n  fi: PlannerFanIn | undefined;\n  joinsBetween: PlannerJoin[];\n};\n\nexport class PlannerGraph {\n  // Sources indexed by table name\n  readonly #sources = new Map<string, PlannerSource>();\n\n  // The final output node where constraint propagation starts\n  #terminus: PlannerTerminus | undefined = undefined;\n\n  // Collections of nodes with mutable planning state\n  joins: PlannerJoin[] = [];\n  fanOuts: PlannerFanOut[] = [];\n  fanIns: PlannerFanIn[] = [];\n  connections: PlannerConnection[] = [];\n\n  /**\n   * Reset all planning state back to initial values for another planning pass.\n   * Resets only mutable planning state - graph structure is unchanged.\n   *\n   * This allows replanning the same query graph with different strategies.\n   */\n  resetPlanningState() {\n    for (const j of this.joins) j.reset();\n    for (const fo of this.fanOuts) fo.reset();\n    for (const fi of this.fanIns) fi.reset();\n    for (const c of this.connections) c.reset();\n  }\n\n  /**\n   * Create and register a source (table) in the graph.\n   */\n  addSource(name: string, model: ConnectionCostModel): PlannerSource {\n    assert(\n      !this.#sources.has(name),\n      `Source ${name} already exists in the graph`,\n    );\n    const source = new PlannerSource(name, model);\n    this.#sources.set(name, source);\n    return source;\n  }\n\n  /**\n   * Get a source by table name.\n   */\n  getSource(name: string): PlannerSource {\n    const source = this.#sources.get(name);\n    assert(source !== undefined, `Source ${name} not found in the graph`);\n    return source;\n  }\n\n  /**\n   * Check if a source exists by table name.\n   */\n  hasSource(name: string): boolean {\n    return this.#sources.has(name);\n  }\n\n  /**\n   * Set the terminus (final output) node of the graph.\n   * Constraint propagation starts from this node.\n   */\n  setTerminus(terminus: PlannerTerminus): void {\n    this.#terminus = terminus;\n  }\n\n  /**\n   * Initiate constraint propagation from the terminus node.\n   * This sends constraints up through the graph to update\n   * connection cost estimates.\n   */\n  propagateConstraints(planDebugger?: PlanDebugger): void {\n    assert(\n      this.#terminus !== undefined,\n      'Cannot propagate constraints without a terminus node',\n    );\n    this.#terminus.propagateConstraints(planDebugger);\n  }\n\n  /**\n   * Calculate total cost of the current plan.\n   * Total cost includes both startup cost (one-time, e.g., sorting) and running cost.\n   */\n  getTotalCost(planDebugger?: PlanDebugger): number {\n    const estimate = must(this.#terminus).estimateCost(planDebugger);\n    return estimate.cost + estimate.startupCost;\n  }\n\n  /**\n   * Capture a lightweight snapshot of the current planning state.\n   * Used for backtracking during multi-start greedy search.\n   *\n   * Captures mutable state including pinned flags, join types, and\n   * constraint maps to avoid needing repropagation on restore.\n   *\n   * @returns A snapshot that can be restored via restorePlanningSnapshot()\n   */\n  capturePlanningSnapshot(): PlanState {\n    return {\n      connections: this.connections.map(c => ({\n        limit: c.limit,\n      })),\n      joins: this.joins.map(j => ({type: j.type})),\n      fanOuts: this.fanOuts.map(fo => ({type: fo.type})),\n      fanIns: this.fanIns.map(fi => ({type: fi.type})),\n      connectionConstraints: this.connections.map(c => c.captureConstraints()),\n    };\n  }\n\n  /**\n   * Restore planning state from a previously captured snapshot.\n   * Used for backtracking when a planning attempt fails.\n   *\n   * Restores pinned flags, join types, and constraint maps, eliminating\n   * the need for repropagation.\n   *\n   * @param state - Snapshot created by capturePlanningSnapshot()\n   */\n  restorePlanningSnapshot(state: PlanState): void {\n    this.#validateSnapshotShape(state);\n    this.#restoreConnections(state);\n    this.#restoreJoins(state);\n    this.#restoreFanNodes(state);\n  }\n\n  /**\n   * Validate that snapshot shape matches current graph structure.\n   */\n  #validateSnapshotShape(state: PlanState): void {\n    assert(\n      this.connections.length === state.connections.length,\n      'Plan state mismatch: connections',\n    );\n    assert(\n      this.joins.length === state.joins.length,\n      'Plan state mismatch: joins',\n    );\n    assert(\n      this.fanOuts.length === state.fanOuts.length,\n      'Plan state mismatch: fanOuts',\n    );\n    assert(\n      this.fanIns.length === state.fanIns.length,\n      'Plan state mismatch: fanIns',\n    );\n    assert(\n      this.connections.length === state.connectionConstraints.length,\n      'Plan state mismatch: connectionConstraints',\n    );\n  }\n\n  /**\n   * Restore connection pinned flags, limits, and constraint maps.\n   */\n  #restoreConnections(state: PlanState): void {\n    for (let i = 0; i < this.connections.length; i++) {\n      this.connections[i].limit = state.connections[i].limit;\n      this.connections[i].restoreConstraints(state.connectionConstraints[i]);\n    }\n  }\n\n  /**\n   * Restore join types and pinned flags.\n   */\n  #restoreJoins(state: PlanState): void {\n    for (let i = 0; i < this.joins.length; i++) {\n      const join = this.joins[i];\n      const targetState = state.joins[i];\n\n      // Reset to initial state first\n      join.reset();\n\n      // Apply target state\n      if (targetState.type === 'flipped' && join.type !== 'flipped') {\n        join.flip();\n      }\n      assert(\n        targetState.type === join.type,\n        'join is not in the correct state after reset',\n      );\n    }\n  }\n\n  /**\n   * Restore FanOut and FanIn types.\n   */\n  #restoreFanNodes(state: PlanState): void {\n    for (let i = 0; i < this.fanOuts.length; i++) {\n      const fo = this.fanOuts[i];\n      const targetType = state.fanOuts[i].type;\n      if (targetType === 'UFO' && fo.type === 'FO') {\n        fo.convertToUFO();\n      }\n    }\n\n    for (let i = 0; i < this.fanIns.length; i++) {\n      const fi = this.fanIns[i];\n      const targetType = state.fanIns[i].type;\n      if (targetType === 'UFI' && fi.type === 'FI') {\n        fi.convertToUFI();\n      }\n    }\n  }\n\n  /**\n   * Main planning algorithm using exhaustive join flip enumeration.\n   *\n   * Enumerates all possible flip patterns for flippable joins (2^n for n flippable joins).\n   * Each pattern represents a different query execution plan. We evaluate the cost of each\n   * plan and select the one with the lowest cost.\n   *\n   * Connections are used only for cost estimation - the flip patterns determine the plan.\n   * FanOut/FanIn states (FO/UFO and FI/UFI) are automatically derived from join flip states.\n   *\n   * @param planDebugger - Optional debugger to receive structured events during planning\n   */\n  plan(planDebugger?: PlanDebugger): void {\n    // Get all flippable joins\n    const flippableJoins = this.joins.filter(j => j.isFlippable());\n\n    // Safety check: throw if too many flippable joins\n    if (flippableJoins.length > MAX_FLIPPABLE_JOINS) {\n      throw new PlannerException(\n        'max_flippable_joins',\n        `Query has ${flippableJoins.length} EXISTS checks in a single RELATED call (or in the top level query), which would require ` +\n          `${2 ** flippableJoins.length} plan evaluations. This may be very slow. ` +\n          `Consider simplifying the query or increasing MAX_FLIPPABLE_JOINS (currently set to ${MAX_FLIPPABLE_JOINS}).`,\n      );\n    }\n\n    // Build FO→FI cache once to avoid redundant BFS traversals in each iteration\n    const fofiCache = buildFOFICache(this);\n\n    const numPatterns =\n      flippableJoins.length === 0 ? 0 : 2 ** flippableJoins.length;\n    let bestCost = Infinity;\n    let bestPlan: PlanState | undefined = undefined;\n    let bestAttemptNumber = -1;\n\n    // Enumerate all flip patterns\n    for (let pattern = 0; pattern < numPatterns; pattern++) {\n      // Reset to initial state\n      this.resetPlanningState();\n\n      if (planDebugger) {\n        planDebugger.log({\n          type: 'attempt-start',\n          attemptNumber: pattern,\n          totalAttempts: numPatterns,\n        });\n      }\n\n      // Apply flip pattern (treat pattern as bitmask)\n      // Bit i set to 1 means flip join i\n      for (let i = 0; i < flippableJoins.length; i++) {\n        if (pattern & (1 << i)) {\n          flippableJoins[i].flip();\n        }\n      }\n\n      // Derive FO/UFO and FI/UFI states from join flip states\n      checkAndConvertFOFI(fofiCache);\n\n      // Propagate unlimiting for flipped joins\n      propagateUnlimitForFlippedJoins(this);\n\n      // Propagate constraints through the graph\n      this.propagateConstraints(planDebugger);\n\n      if (planDebugger) {\n        planDebugger.log({\n          type: 'constraints-propagated',\n          attemptNumber: pattern,\n          connectionConstraints: this.connections.map(c => {\n            const constraintCosts = c.getConstraintCostsForDebug();\n            const constraintCostsWithoutFanout: Record<\n              string,\n              Omit<(typeof constraintCosts)[string], 'fanout'>\n            > = {};\n            for (const [key, cost] of Object.entries(constraintCosts)) {\n              constraintCostsWithoutFanout[key] = omitFanout(cost);\n            }\n            return {\n              connection: c.name,\n              constraints: c.getConstraintsForDebug(),\n              constraintCosts: constraintCostsWithoutFanout,\n            };\n          }),\n        });\n      }\n\n      // Evaluate this plan\n      const totalCost = this.getTotalCost(planDebugger);\n\n      if (planDebugger) {\n        planDebugger.log({\n          type: 'plan-complete',\n          attemptNumber: pattern,\n          totalCost,\n          flipPattern: pattern, // Bitmask of which joins are flipped\n          planSnapshot: this.capturePlanningSnapshot(),\n          joinStates: this.joins.map(j => {\n            const info = j.getDebugInfo();\n            return {\n              join: info.name,\n              type: info.type,\n            };\n          }),\n        });\n      }\n\n      // Track best plan\n      if (totalCost < bestCost) {\n        bestCost = totalCost;\n        bestPlan = this.capturePlanningSnapshot();\n        bestAttemptNumber = pattern;\n      }\n    }\n\n    // Restore best plan\n    if (bestPlan) {\n      this.restorePlanningSnapshot(bestPlan);\n      // Propagate constraints to ensure all derived state is consistent\n      this.propagateConstraints(planDebugger);\n\n      if (planDebugger) {\n        planDebugger.log({\n          type: 'best-plan-selected',\n          bestAttemptNumber,\n          totalCost: bestCost,\n          flipPattern: bestAttemptNumber, // The best attempt number is also the flip pattern\n          joinStates: this.joins.map(j => ({\n            join: j.getName(),\n            type: j.type,\n          })),\n        });\n      }\n    } else {\n      assert(\n        numPatterns === 0,\n        'no plan was found but flippable joins did exist!',\n      );\n    }\n  }\n}\n\n/**\n * Build cache of FO→FI relationships and joins between them.\n * Called once at the start of planning to avoid redundant BFS traversals.\n */\nfunction buildFOFICache(graph: PlannerGraph): Map<PlannerFanOut, FOFIInfo> {\n  const cache = new Map<PlannerFanOut, FOFIInfo>();\n\n  for (const fo of graph.fanOuts) {\n    const info = findFIAndJoins(fo);\n    cache.set(fo, info);\n  }\n\n  return cache;\n}\n\n/**\n * Check if any joins downstream of a FanOut (before reaching FanIn) are flipped.\n * If so, convert the FO to UFO and the FI to UFI.\n *\n * This must be called after join flipping and before propagateConstraints.\n */\nfunction checkAndConvertFOFI(fofiCache: Map<PlannerFanOut, FOFIInfo>): void {\n  for (const [fo, info] of fofiCache) {\n    const hasFlippedJoin = info.joinsBetween.some(j => j.type === 'flipped');\n    if (info.fi && hasFlippedJoin) {\n      fo.convertToUFO();\n      info.fi.convertToUFI();\n    }\n  }\n}\n\n/**\n * Traverse from a FanOut through its outputs to find the corresponding FanIn\n * and collect all joins along the way.\n */\nfunction findFIAndJoins(fo: PlannerFanOut): FOFIInfo {\n  const joinsBetween: PlannerJoin[] = [];\n  let fi: PlannerFanIn | undefined = undefined;\n\n  // BFS through FO outputs to find FI and collect joins\n  const queue: PlannerNode[] = [...fo.outputs];\n  const visited = new Set<PlannerNode>();\n\n  while (queue.length > 0) {\n    const node = must(queue.shift());\n    if (visited.has(node)) continue;\n    visited.add(node);\n\n    switch (node.kind) {\n      case 'join':\n        joinsBetween.push(node);\n        queue.push(node.output);\n        break;\n      case 'fan-out':\n        // Nested FO - traverse its outputs\n        queue.push(...node.outputs);\n        break;\n      case 'fan-in':\n        // Found the FI - this is the boundary, don't traverse further\n        fi = node;\n        break;\n      case 'connection':\n        // Shouldn't happen in a well-formed graph\n        break;\n      case 'terminus':\n        // Reached the end without finding FI\n        break;\n    }\n  }\n\n  return {fi, joinsBetween};\n}\n\n/**\n * Propagate unlimiting to all flipped joins in the graph.\n * When a join is flipped, its child becomes the outer loop and should no longer\n * be limited by EXISTS semantics.\n *\n * This must be called after join flipping and before propagateConstraints.\n */\nfunction propagateUnlimitForFlippedJoins(graph: PlannerGraph): void {\n  for (const join of graph.joins) {\n    if (join.type === 'flipped') {\n      join.propagateUnlimit();\n    }\n  }\n}\n"],"names":[],"mappings":";;;;;AA8BA,MAAM,sBAAsB;AAWrB,MAAM,aAAa;AAAA;AAAA,EAEf,+BAAe,IAAA;AAAA;AAAA,EAGxB,YAAyC;AAAA;AAAA,EAGzC,QAAuB,CAAA;AAAA,EACvB,UAA2B,CAAA;AAAA,EAC3B,SAAyB,CAAA;AAAA,EACzB,cAAmC,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQnC,qBAAqB;AACnB,eAAW,KAAK,KAAK,MAAO,GAAE,MAAA;AAC9B,eAAW,MAAM,KAAK,QAAS,IAAG,MAAA;AAClC,eAAW,MAAM,KAAK,OAAQ,IAAG,MAAA;AACjC,eAAW,KAAK,KAAK,YAAa,GAAE,MAAA;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,MAAc,OAA2C;AACjE;AAAA,MACE,CAAC,KAAK,SAAS,IAAI,IAAI;AAAA,MACvB,UAAU,IAAI;AAAA,IAAA;AAEhB,UAAM,SAAS,IAAI,cAAc,MAAM,KAAK;AAC5C,SAAK,SAAS,IAAI,MAAM,MAAM;AAC9B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,MAA6B;AACrC,UAAM,SAAS,KAAK,SAAS,IAAI,IAAI;AACrC,WAAO,WAAW,QAAW,UAAU,IAAI,yBAAyB;AACpE,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,MAAuB;AAC/B,WAAO,KAAK,SAAS,IAAI,IAAI;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,UAAiC;AAC3C,SAAK,YAAY;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,qBAAqB,cAAmC;AACtD;AAAA,MACE,KAAK,cAAc;AAAA,MACnB;AAAA,IAAA;AAEF,SAAK,UAAU,qBAAqB,YAAY;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAa,cAAqC;AAChD,UAAM,WAAW,KAAK,KAAK,SAAS,EAAE,aAAa,YAAY;AAC/D,WAAO,SAAS,OAAO,SAAS;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,0BAAqC;AACnC,WAAO;AAAA,MACL,aAAa,KAAK,YAAY,IAAI,CAAA,OAAM;AAAA,QACtC,OAAO,EAAE;AAAA,MAAA,EACT;AAAA,MACF,OAAO,KAAK,MAAM,IAAI,QAAM,EAAC,MAAM,EAAE,KAAA,EAAM;AAAA,MAC3C,SAAS,KAAK,QAAQ,IAAI,SAAO,EAAC,MAAM,GAAG,KAAA,EAAM;AAAA,MACjD,QAAQ,KAAK,OAAO,IAAI,SAAO,EAAC,MAAM,GAAG,KAAA,EAAM;AAAA,MAC/C,uBAAuB,KAAK,YAAY,IAAI,CAAA,MAAK,EAAE,oBAAoB;AAAA,IAAA;AAAA,EAE3E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,wBAAwB,OAAwB;AAC9C,SAAK,uBAAuB,KAAK;AACjC,SAAK,oBAAoB,KAAK;AAC9B,SAAK,cAAc,KAAK;AACxB,SAAK,iBAAiB,KAAK;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,uBAAuB,OAAwB;AAC7C;AAAA,MACE,KAAK,YAAY,WAAW,MAAM,YAAY;AAAA,MAC9C;AAAA,IAAA;AAEF;AAAA,MACE,KAAK,MAAM,WAAW,MAAM,MAAM;AAAA,MAClC;AAAA,IAAA;AAEF;AAAA,MACE,KAAK,QAAQ,WAAW,MAAM,QAAQ;AAAA,MACtC;AAAA,IAAA;AAEF;AAAA,MACE,KAAK,OAAO,WAAW,MAAM,OAAO;AAAA,MACpC;AAAA,IAAA;AAEF;AAAA,MACE,KAAK,YAAY,WAAW,MAAM,sBAAsB;AAAA,MACxD;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAoB,OAAwB;AAC1C,aAAS,IAAI,GAAG,IAAI,KAAK,YAAY,QAAQ,KAAK;AAChD,WAAK,YAAY,CAAC,EAAE,QAAQ,MAAM,YAAY,CAAC,EAAE;AACjD,WAAK,YAAY,CAAC,EAAE,mBAAmB,MAAM,sBAAsB,CAAC,CAAC;AAAA,IACvE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,OAAwB;AACpC,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KAAK;AAC1C,YAAM,OAAO,KAAK,MAAM,CAAC;AACzB,YAAM,cAAc,MAAM,MAAM,CAAC;AAGjC,WAAK,MAAA;AAGL,UAAI,YAAY,SAAS,aAAa,KAAK,SAAS,WAAW;AAC7D,aAAK,KAAA;AAAA,MACP;AACA;AAAA,QACE,YAAY,SAAS,KAAK;AAAA,QAC1B;AAAA,MAAA;AAAA,IAEJ;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,OAAwB;AACvC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KAAK;AAC5C,YAAM,KAAK,KAAK,QAAQ,CAAC;AACzB,YAAM,aAAa,MAAM,QAAQ,CAAC,EAAE;AACpC,UAAI,eAAe,SAAS,GAAG,SAAS,MAAM;AAC5C,WAAG,aAAA;AAAA,MACL;AAAA,IACF;AAEA,aAAS,IAAI,GAAG,IAAI,KAAK,OAAO,QAAQ,KAAK;AAC3C,YAAM,KAAK,KAAK,OAAO,CAAC;AACxB,YAAM,aAAa,MAAM,OAAO,CAAC,EAAE;AACnC,UAAI,eAAe,SAAS,GAAG,SAAS,MAAM;AAC5C,WAAG,aAAA;AAAA,MACL;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,KAAK,cAAmC;AAEtC,UAAM,iBAAiB,KAAK,MAAM,OAAO,CAAA,MAAK,EAAE,aAAa;AAG7D,QAAI,eAAe,SAAS,qBAAqB;AAC/C,YAAM,IAAI;AAAA,QACR;AAAA,QACA,aAAa,eAAe,MAAM,4FAC7B,KAAK,eAAe,MAAM,gIACyD,mBAAmB;AAAA,MAAA;AAAA,IAE/G;AAGA,UAAM,YAAY,eAAe,IAAI;AAErC,UAAM,cACJ,eAAe,WAAW,IAAI,IAAI,KAAK,eAAe;AACxD,QAAI,WAAW;AACf,QAAI,WAAkC;AACtC,QAAI,oBAAoB;AAGxB,aAAS,UAAU,GAAG,UAAU,aAAa,WAAW;AAEtD,WAAK,mBAAA;AAEL,UAAI,cAAc;AAChB,qBAAa,IAAI;AAAA,UACf,MAAM;AAAA,UACN,eAAe;AAAA,UACf,eAAe;AAAA,QAAA,CAChB;AAAA,MACH;AAIA,eAAS,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;AAC9C,YAAI,UAAW,KAAK,GAAI;AACtB,yBAAe,CAAC,EAAE,KAAA;AAAA,QACpB;AAAA,MACF;AAGA,0BAAoB,SAAS;AAG7B,sCAAgC,IAAI;AAGpC,WAAK,qBAAqB,YAAY;AAEtC,UAAI,cAAc;AAChB,qBAAa,IAAI;AAAA,UACf,MAAM;AAAA,UACN,eAAe;AAAA,UACf,uBAAuB,KAAK,YAAY,IAAI,CAAA,MAAK;AAC/C,kBAAM,kBAAkB,EAAE,2BAAA;AAC1B,kBAAM,+BAGF,CAAA;AACJ,uBAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,eAAe,GAAG;AACzD,2CAA6B,GAAG,IAAI,WAAW,IAAI;AAAA,YACrD;AACA,mBAAO;AAAA,cACL,YAAY,EAAE;AAAA,cACd,aAAa,EAAE,uBAAA;AAAA,cACf,iBAAiB;AAAA,YAAA;AAAA,UAErB,CAAC;AAAA,QAAA,CACF;AAAA,MACH;AAGA,YAAM,YAAY,KAAK,aAAa,YAAY;AAEhD,UAAI,cAAc;AAChB,qBAAa,IAAI;AAAA,UACf,MAAM;AAAA,UACN,eAAe;AAAA,UACf;AAAA,UACA,aAAa;AAAA;AAAA,UACb,cAAc,KAAK,wBAAA;AAAA,UACnB,YAAY,KAAK,MAAM,IAAI,CAAA,MAAK;AAC9B,kBAAM,OAAO,EAAE,aAAA;AACf,mBAAO;AAAA,cACL,MAAM,KAAK;AAAA,cACX,MAAM,KAAK;AAAA,YAAA;AAAA,UAEf,CAAC;AAAA,QAAA,CACF;AAAA,MACH;AAGA,UAAI,YAAY,UAAU;AACxB,mBAAW;AACX,mBAAW,KAAK,wBAAA;AAChB,4BAAoB;AAAA,MACtB;AAAA,IACF;AAGA,QAAI,UAAU;AACZ,WAAK,wBAAwB,QAAQ;AAErC,WAAK,qBAAqB,YAAY;AAEtC,UAAI,cAAc;AAChB,qBAAa,IAAI;AAAA,UACf,MAAM;AAAA,UACN;AAAA,UACA,WAAW;AAAA,UACX,aAAa;AAAA;AAAA,UACb,YAAY,KAAK,MAAM,IAAI,CAAA,OAAM;AAAA,YAC/B,MAAM,EAAE,QAAA;AAAA,YACR,MAAM,EAAE;AAAA,UAAA,EACR;AAAA,QAAA,CACH;AAAA,MACH;AAAA,IACF,OAAO;AACL;AAAA,QACE,gBAAgB;AAAA,QAChB;AAAA,MAAA;AAAA,IAEJ;AAAA,EACF;AACF;AAMA,SAAS,eAAe,OAAmD;AACzE,QAAM,4BAAY,IAAA;AAElB,aAAW,MAAM,MAAM,SAAS;AAC9B,UAAM,OAAO,eAAe,EAAE;AAC9B,UAAM,IAAI,IAAI,IAAI;AAAA,EACpB;AAEA,SAAO;AACT;AAQA,SAAS,oBAAoB,WAA+C;AAC1E,aAAW,CAAC,IAAI,IAAI,KAAK,WAAW;AAClC,UAAM,iBAAiB,KAAK,aAAa,KAAK,CAAA,MAAK,EAAE,SAAS,SAAS;AACvE,QAAI,KAAK,MAAM,gBAAgB;AAC7B,SAAG,aAAA;AACH,WAAK,GAAG,aAAA;AAAA,IACV;AAAA,EACF;AACF;AAMA,SAAS,eAAe,IAA6B;AACnD,QAAM,eAA8B,CAAA;AACpC,MAAI,KAA+B;AAGnC,QAAM,QAAuB,CAAC,GAAG,GAAG,OAAO;AAC3C,QAAM,8BAAc,IAAA;AAEpB,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,OAAO,KAAK,MAAM,MAAA,CAAO;AAC/B,QAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,YAAQ,IAAI,IAAI;AAEhB,YAAQ,KAAK,MAAA;AAAA,MACX,KAAK;AACH,qBAAa,KAAK,IAAI;AACtB,cAAM,KAAK,KAAK,MAAM;AACtB;AAAA,MACF,KAAK;AAEH,cAAM,KAAK,GAAG,KAAK,OAAO;AAC1B;AAAA,MACF,KAAK;AAEH,aAAK;AACL;AAAA,IAMA;AAAA,EAEN;AAEA,SAAO,EAAC,IAAI,aAAA;AACd;AASA,SAAS,gCAAgC,OAA2B;AAClE,aAAW,QAAQ,MAAM,OAAO;AAC9B,QAAI,KAAK,SAAS,WAAW;AAC3B,WAAK,iBAAA;AAAA,IACP;AAAA,EACF;AACF;"}
+{"version":3,"file":"planner-graph.js","sources":["../../../../../zql/src/planner/planner-graph.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assert} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {PlanDebugger} from './planner-debug.ts';\nimport type {PlannerConnection} from './planner-connection.ts';\nimport type {PlannerConstraint} from './planner-constraint.ts';\nimport type {PlannerFanIn} from './planner-fan-in.ts';\nimport type {PlannerFanOut} from './planner-fan-out.ts';\nimport type {PlannerJoin} from './planner-join.ts';\nimport {omitFanout} from './planner-node.ts';\nimport type {PlannerNode} from './planner-node.ts';\nimport {PlannerSource, type ConnectionCostModel} from './planner-source.ts';\nimport type {PlannerTerminus} from './planner-terminus.ts';\n\n/**\n * Captured state of a plan for comparison and restoration.\n */\nexport type PlanState = {\n  connections: Array<{limit: number | undefined}>;\n  joins: Array<{type: 'semi' | 'flipped'}>;\n  fanOuts: Array<{type: 'FO' | 'UFO'}>;\n  fanIns: Array<{type: 'FI' | 'UFI'}>;\n  connectionConstraints: Array<Map<string, PlannerConstraint | undefined>>;\n};\n\n/**\n * Maximum number of flippable joins to attempt exhaustive enumeration.\n * With n flippable joins, we explore 2^n plans.\n * 10 joins = 1024 plans (~100-200ms), 12 joins = 4096 plans (~400ms - 1 second)\n */\nconst MAX_FLIPPABLE_JOINS = 9;\n\n/**\n * Cached information about FanOut→FanIn relationships.\n * Computed once during planning to avoid redundant BFS traversals.\n */\ntype FOFIInfo = {\n  fi: PlannerFanIn | undefined;\n  joinsBetween: PlannerJoin[];\n};\n\nexport class PlannerGraph {\n  // Sources indexed by table name\n  readonly #sources = new Map<string, PlannerSource>();\n\n  // The final output node where constraint propagation starts\n  #terminus: PlannerTerminus | undefined = undefined;\n\n  // Collections of nodes with mutable planning state\n  joins: PlannerJoin[] = [];\n  fanOuts: PlannerFanOut[] = [];\n  fanIns: PlannerFanIn[] = [];\n  connections: PlannerConnection[] = [];\n\n  /**\n   * Reset all planning state back to initial values for another planning pass.\n   * Resets only mutable planning state - graph structure is unchanged.\n   *\n   * This allows replanning the same query graph with different strategies.\n   */\n  resetPlanningState() {\n    for (const j of this.joins) j.reset();\n    for (const fo of this.fanOuts) fo.reset();\n    for (const fi of this.fanIns) fi.reset();\n    for (const c of this.connections) c.reset();\n  }\n\n  /**\n   * Create and register a source (table) in the graph.\n   */\n  addSource(name: string, model: ConnectionCostModel): PlannerSource {\n    assert(\n      !this.#sources.has(name),\n      `Source ${name} already exists in the graph`,\n    );\n    const source = new PlannerSource(name, model);\n    this.#sources.set(name, source);\n    return source;\n  }\n\n  /**\n   * Get a source by table name.\n   */\n  getSource(name: string): PlannerSource {\n    const source = this.#sources.get(name);\n    assert(source !== undefined, `Source ${name} not found in the graph`);\n    return source;\n  }\n\n  /**\n   * Check if a source exists by table name.\n   */\n  hasSource(name: string): boolean {\n    return this.#sources.has(name);\n  }\n\n  /**\n   * Set the terminus (final output) node of the graph.\n   * Constraint propagation starts from this node.\n   */\n  setTerminus(terminus: PlannerTerminus): void {\n    this.#terminus = terminus;\n  }\n\n  /**\n   * Initiate constraint propagation from the terminus node.\n   * This sends constraints up through the graph to update\n   * connection cost estimates.\n   */\n  propagateConstraints(planDebugger?: PlanDebugger): void {\n    assert(\n      this.#terminus !== undefined,\n      'Cannot propagate constraints without a terminus node',\n    );\n    this.#terminus.propagateConstraints(planDebugger);\n  }\n\n  /**\n   * Calculate total cost of the current plan.\n   * Total cost includes both startup cost (one-time, e.g., sorting) and running cost.\n   */\n  getTotalCost(planDebugger?: PlanDebugger): number {\n    const estimate = must(this.#terminus).estimateCost(planDebugger);\n    return estimate.cost + estimate.startupCost;\n  }\n\n  /**\n   * Capture a lightweight snapshot of the current planning state.\n   * Used for backtracking during multi-start greedy search.\n   *\n   * Captures mutable state including pinned flags, join types, and\n   * constraint maps to avoid needing repropagation on restore.\n   *\n   * @returns A snapshot that can be restored via restorePlanningSnapshot()\n   */\n  capturePlanningSnapshot(): PlanState {\n    return {\n      connections: this.connections.map(c => ({\n        limit: c.limit,\n      })),\n      joins: this.joins.map(j => ({type: j.type})),\n      fanOuts: this.fanOuts.map(fo => ({type: fo.type})),\n      fanIns: this.fanIns.map(fi => ({type: fi.type})),\n      connectionConstraints: this.connections.map(c => c.captureConstraints()),\n    };\n  }\n\n  /**\n   * Restore planning state from a previously captured snapshot.\n   * Used for backtracking when a planning attempt fails.\n   *\n   * Restores pinned flags, join types, and constraint maps, eliminating\n   * the need for repropagation.\n   *\n   * @param state - Snapshot created by capturePlanningSnapshot()\n   */\n  restorePlanningSnapshot(state: PlanState): void {\n    this.#validateSnapshotShape(state);\n    this.#restoreConnections(state);\n    this.#restoreJoins(state);\n    this.#restoreFanNodes(state);\n  }\n\n  /**\n   * Validate that snapshot shape matches current graph structure.\n   */\n  #validateSnapshotShape(state: PlanState): void {\n    assert(\n      this.connections.length === state.connections.length,\n      'Plan state mismatch: connections',\n    );\n    assert(\n      this.joins.length === state.joins.length,\n      'Plan state mismatch: joins',\n    );\n    assert(\n      this.fanOuts.length === state.fanOuts.length,\n      'Plan state mismatch: fanOuts',\n    );\n    assert(\n      this.fanIns.length === state.fanIns.length,\n      'Plan state mismatch: fanIns',\n    );\n    assert(\n      this.connections.length === state.connectionConstraints.length,\n      'Plan state mismatch: connectionConstraints',\n    );\n  }\n\n  /**\n   * Restore connection pinned flags, limits, and constraint maps.\n   */\n  #restoreConnections(state: PlanState): void {\n    for (let i = 0; i < this.connections.length; i++) {\n      this.connections[i].limit = state.connections[i].limit;\n      this.connections[i].restoreConstraints(state.connectionConstraints[i]);\n    }\n  }\n\n  /**\n   * Restore join types and pinned flags.\n   */\n  #restoreJoins(state: PlanState): void {\n    for (let i = 0; i < this.joins.length; i++) {\n      const join = this.joins[i];\n      const targetState = state.joins[i];\n\n      // Reset to initial state first\n      join.reset();\n\n      // Apply target state\n      if (targetState.type === 'flipped' && join.type !== 'flipped') {\n        join.flip();\n      }\n      assert(\n        targetState.type === join.type,\n        'join is not in the correct state after reset',\n      );\n    }\n  }\n\n  /**\n   * Restore FanOut and FanIn types.\n   */\n  #restoreFanNodes(state: PlanState): void {\n    for (let i = 0; i < this.fanOuts.length; i++) {\n      const fo = this.fanOuts[i];\n      const targetType = state.fanOuts[i].type;\n      if (targetType === 'UFO' && fo.type === 'FO') {\n        fo.convertToUFO();\n      }\n    }\n\n    for (let i = 0; i < this.fanIns.length; i++) {\n      const fi = this.fanIns[i];\n      const targetType = state.fanIns[i].type;\n      if (targetType === 'UFI' && fi.type === 'FI') {\n        fi.convertToUFI();\n      }\n    }\n  }\n\n  /**\n   * Main planning algorithm using exhaustive join flip enumeration.\n   *\n   * Enumerates all possible flip patterns for flippable joins (2^n for n flippable joins).\n   * Each pattern represents a different query execution plan. We evaluate the cost of each\n   * plan and select the one with the lowest cost.\n   *\n   * Connections are used only for cost estimation - the flip patterns determine the plan.\n   * FanOut/FanIn states (FO/UFO and FI/UFI) are automatically derived from join flip states.\n   *\n   * @param planDebugger - Optional debugger to receive structured events during planning\n   * @param lc - Optional logger for warnings\n   */\n  plan(planDebugger?: PlanDebugger, lc?: LogContext): void {\n    // Get all flippable joins\n    const flippableJoins = this.joins.filter(j => j.isFlippable());\n\n    // Too many flippable joins - skip optimization and run as-is\n    if (flippableJoins.length > MAX_FLIPPABLE_JOINS) {\n      lc?.warn?.(\n        `Query has ${flippableJoins.length} EXISTS checks which would require ` +\n          `${2 ** flippableJoins.length} plan evaluations. Skipping optimization.`,\n      );\n      return;\n    }\n\n    // Build FO→FI cache once to avoid redundant BFS traversals in each iteration\n    const fofiCache = buildFOFICache(this);\n\n    const numPatterns =\n      flippableJoins.length === 0 ? 0 : 2 ** flippableJoins.length;\n    let bestCost = Infinity;\n    let bestPlan: PlanState | undefined = undefined;\n    let bestAttemptNumber = -1;\n\n    // Enumerate all flip patterns\n    for (let pattern = 0; pattern < numPatterns; pattern++) {\n      // Reset to initial state\n      this.resetPlanningState();\n\n      if (planDebugger) {\n        planDebugger.log({\n          type: 'attempt-start',\n          attemptNumber: pattern,\n          totalAttempts: numPatterns,\n        });\n      }\n\n      // Apply flip pattern (treat pattern as bitmask)\n      // Bit i set to 1 means flip join i\n      for (let i = 0; i < flippableJoins.length; i++) {\n        if (pattern & (1 << i)) {\n          flippableJoins[i].flip();\n        }\n      }\n\n      // Derive FO/UFO and FI/UFI states from join flip states\n      checkAndConvertFOFI(fofiCache);\n\n      // Propagate unlimiting for flipped joins\n      propagateUnlimitForFlippedJoins(this);\n\n      // Propagate constraints through the graph\n      this.propagateConstraints(planDebugger);\n\n      if (planDebugger) {\n        planDebugger.log({\n          type: 'constraints-propagated',\n          attemptNumber: pattern,\n          connectionConstraints: this.connections.map(c => {\n            const constraintCosts = c.getConstraintCostsForDebug();\n            const constraintCostsWithoutFanout: Record<\n              string,\n              Omit<(typeof constraintCosts)[string], 'fanout'>\n            > = {};\n            for (const [key, cost] of Object.entries(constraintCosts)) {\n              constraintCostsWithoutFanout[key] = omitFanout(cost);\n            }\n            return {\n              connection: c.name,\n              constraints: c.getConstraintsForDebug(),\n              constraintCosts: constraintCostsWithoutFanout,\n            };\n          }),\n        });\n      }\n\n      // Evaluate this plan\n      const totalCost = this.getTotalCost(planDebugger);\n\n      if (planDebugger) {\n        planDebugger.log({\n          type: 'plan-complete',\n          attemptNumber: pattern,\n          totalCost,\n          flipPattern: pattern, // Bitmask of which joins are flipped\n          planSnapshot: this.capturePlanningSnapshot(),\n          joinStates: this.joins.map(j => {\n            const info = j.getDebugInfo();\n            return {\n              join: info.name,\n              type: info.type,\n            };\n          }),\n        });\n      }\n\n      // Track best plan\n      if (totalCost < bestCost) {\n        bestCost = totalCost;\n        bestPlan = this.capturePlanningSnapshot();\n        bestAttemptNumber = pattern;\n      }\n    }\n\n    // Restore best plan\n    if (bestPlan) {\n      this.restorePlanningSnapshot(bestPlan);\n      // Propagate constraints to ensure all derived state is consistent\n      this.propagateConstraints(planDebugger);\n\n      if (planDebugger) {\n        planDebugger.log({\n          type: 'best-plan-selected',\n          bestAttemptNumber,\n          totalCost: bestCost,\n          flipPattern: bestAttemptNumber, // The best attempt number is also the flip pattern\n          joinStates: this.joins.map(j => ({\n            join: j.getName(),\n            type: j.type,\n          })),\n        });\n      }\n    } else {\n      assert(\n        numPatterns === 0,\n        'no plan was found but flippable joins did exist!',\n      );\n    }\n  }\n}\n\n/**\n * Build cache of FO→FI relationships and joins between them.\n * Called once at the start of planning to avoid redundant BFS traversals.\n */\nfunction buildFOFICache(graph: PlannerGraph): Map<PlannerFanOut, FOFIInfo> {\n  const cache = new Map<PlannerFanOut, FOFIInfo>();\n\n  for (const fo of graph.fanOuts) {\n    const info = findFIAndJoins(fo);\n    cache.set(fo, info);\n  }\n\n  return cache;\n}\n\n/**\n * Check if any joins downstream of a FanOut (before reaching FanIn) are flipped.\n * If so, convert the FO to UFO and the FI to UFI.\n *\n * This must be called after join flipping and before propagateConstraints.\n */\nfunction checkAndConvertFOFI(fofiCache: Map<PlannerFanOut, FOFIInfo>): void {\n  for (const [fo, info] of fofiCache) {\n    const hasFlippedJoin = info.joinsBetween.some(j => j.type === 'flipped');\n    if (info.fi && hasFlippedJoin) {\n      fo.convertToUFO();\n      info.fi.convertToUFI();\n    }\n  }\n}\n\n/**\n * Traverse from a FanOut through its outputs to find the corresponding FanIn\n * and collect all joins along the way.\n */\nfunction findFIAndJoins(fo: PlannerFanOut): FOFIInfo {\n  const joinsBetween: PlannerJoin[] = [];\n  let fi: PlannerFanIn | undefined = undefined;\n\n  // BFS through FO outputs to find FI and collect joins\n  const queue: PlannerNode[] = [...fo.outputs];\n  const visited = new Set<PlannerNode>();\n\n  while (queue.length > 0) {\n    const node = must(queue.shift());\n    if (visited.has(node)) continue;\n    visited.add(node);\n\n    switch (node.kind) {\n      case 'join':\n        joinsBetween.push(node);\n        queue.push(node.output);\n        break;\n      case 'fan-out':\n        // Nested FO - traverse its outputs\n        queue.push(...node.outputs);\n        break;\n      case 'fan-in':\n        // Found the FI - this is the boundary, don't traverse further\n        fi = node;\n        break;\n      case 'connection':\n        // Shouldn't happen in a well-formed graph\n        break;\n      case 'terminus':\n        // Reached the end without finding FI\n        break;\n    }\n  }\n\n  return {fi, joinsBetween};\n}\n\n/**\n * Propagate unlimiting to all flipped joins in the graph.\n * When a join is flipped, its child becomes the outer loop and should no longer\n * be limited by EXISTS semantics.\n *\n * This must be called after join flipping and before propagateConstraints.\n */\nfunction propagateUnlimitForFlippedJoins(graph: PlannerGraph): void {\n  for (const join of graph.joins) {\n    if (join.type === 'flipped') {\n      join.propagateUnlimit();\n    }\n  }\n}\n"],"names":[],"mappings":";;;;AA8BA,MAAM,sBAAsB;AAWrB,MAAM,aAAa;AAAA;AAAA,EAEf,+BAAe,IAAA;AAAA;AAAA,EAGxB,YAAyC;AAAA;AAAA,EAGzC,QAAuB,CAAA;AAAA,EACvB,UAA2B,CAAA;AAAA,EAC3B,SAAyB,CAAA;AAAA,EACzB,cAAmC,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQnC,qBAAqB;AACnB,eAAW,KAAK,KAAK,MAAO,GAAE,MAAA;AAC9B,eAAW,MAAM,KAAK,QAAS,IAAG,MAAA;AAClC,eAAW,MAAM,KAAK,OAAQ,IAAG,MAAA;AACjC,eAAW,KAAK,KAAK,YAAa,GAAE,MAAA;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,MAAc,OAA2C;AACjE;AAAA,MACE,CAAC,KAAK,SAAS,IAAI,IAAI;AAAA,MACvB,UAAU,IAAI;AAAA,IAAA;AAEhB,UAAM,SAAS,IAAI,cAAc,MAAM,KAAK;AAC5C,SAAK,SAAS,IAAI,MAAM,MAAM;AAC9B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,MAA6B;AACrC,UAAM,SAAS,KAAK,SAAS,IAAI,IAAI;AACrC,WAAO,WAAW,QAAW,UAAU,IAAI,yBAAyB;AACpE,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,MAAuB;AAC/B,WAAO,KAAK,SAAS,IAAI,IAAI;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,UAAiC;AAC3C,SAAK,YAAY;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,qBAAqB,cAAmC;AACtD;AAAA,MACE,KAAK,cAAc;AAAA,MACnB;AAAA,IAAA;AAEF,SAAK,UAAU,qBAAqB,YAAY;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAa,cAAqC;AAChD,UAAM,WAAW,KAAK,KAAK,SAAS,EAAE,aAAa,YAAY;AAC/D,WAAO,SAAS,OAAO,SAAS;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,0BAAqC;AACnC,WAAO;AAAA,MACL,aAAa,KAAK,YAAY,IAAI,CAAA,OAAM;AAAA,QACtC,OAAO,EAAE;AAAA,MAAA,EACT;AAAA,MACF,OAAO,KAAK,MAAM,IAAI,QAAM,EAAC,MAAM,EAAE,KAAA,EAAM;AAAA,MAC3C,SAAS,KAAK,QAAQ,IAAI,SAAO,EAAC,MAAM,GAAG,KAAA,EAAM;AAAA,MACjD,QAAQ,KAAK,OAAO,IAAI,SAAO,EAAC,MAAM,GAAG,KAAA,EAAM;AAAA,MAC/C,uBAAuB,KAAK,YAAY,IAAI,CAAA,MAAK,EAAE,oBAAoB;AAAA,IAAA;AAAA,EAE3E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,wBAAwB,OAAwB;AAC9C,SAAK,uBAAuB,KAAK;AACjC,SAAK,oBAAoB,KAAK;AAC9B,SAAK,cAAc,KAAK;AACxB,SAAK,iBAAiB,KAAK;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,uBAAuB,OAAwB;AAC7C;AAAA,MACE,KAAK,YAAY,WAAW,MAAM,YAAY;AAAA,MAC9C;AAAA,IAAA;AAEF;AAAA,MACE,KAAK,MAAM,WAAW,MAAM,MAAM;AAAA,MAClC;AAAA,IAAA;AAEF;AAAA,MACE,KAAK,QAAQ,WAAW,MAAM,QAAQ;AAAA,MACtC;AAAA,IAAA;AAEF;AAAA,MACE,KAAK,OAAO,WAAW,MAAM,OAAO;AAAA,MACpC;AAAA,IAAA;AAEF;AAAA,MACE,KAAK,YAAY,WAAW,MAAM,sBAAsB;AAAA,MACxD;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAoB,OAAwB;AAC1C,aAAS,IAAI,GAAG,IAAI,KAAK,YAAY,QAAQ,KAAK;AAChD,WAAK,YAAY,CAAC,EAAE,QAAQ,MAAM,YAAY,CAAC,EAAE;AACjD,WAAK,YAAY,CAAC,EAAE,mBAAmB,MAAM,sBAAsB,CAAC,CAAC;AAAA,IACvE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,OAAwB;AACpC,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KAAK;AAC1C,YAAM,OAAO,KAAK,MAAM,CAAC;AACzB,YAAM,cAAc,MAAM,MAAM,CAAC;AAGjC,WAAK,MAAA;AAGL,UAAI,YAAY,SAAS,aAAa,KAAK,SAAS,WAAW;AAC7D,aAAK,KAAA;AAAA,MACP;AACA;AAAA,QACE,YAAY,SAAS,KAAK;AAAA,QAC1B;AAAA,MAAA;AAAA,IAEJ;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,OAAwB;AACvC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,QAAQ,KAAK;AAC5C,YAAM,KAAK,KAAK,QAAQ,CAAC;AACzB,YAAM,aAAa,MAAM,QAAQ,CAAC,EAAE;AACpC,UAAI,eAAe,SAAS,GAAG,SAAS,MAAM;AAC5C,WAAG,aAAA;AAAA,MACL;AAAA,IACF;AAEA,aAAS,IAAI,GAAG,IAAI,KAAK,OAAO,QAAQ,KAAK;AAC3C,YAAM,KAAK,KAAK,OAAO,CAAC;AACxB,YAAM,aAAa,MAAM,OAAO,CAAC,EAAE;AACnC,UAAI,eAAe,SAAS,GAAG,SAAS,MAAM;AAC5C,WAAG,aAAA;AAAA,MACL;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,KAAK,cAA6B,IAAuB;AAEvD,UAAM,iBAAiB,KAAK,MAAM,OAAO,CAAA,MAAK,EAAE,aAAa;AAG7D,QAAI,eAAe,SAAS,qBAAqB;AAC/C,UAAI;AAAA,QACF,aAAa,eAAe,MAAM,sCAC7B,KAAK,eAAe,MAAM;AAAA,MAAA;AAEjC;AAAA,IACF;AAGA,UAAM,YAAY,eAAe,IAAI;AAErC,UAAM,cACJ,eAAe,WAAW,IAAI,IAAI,KAAK,eAAe;AACxD,QAAI,WAAW;AACf,QAAI,WAAkC;AACtC,QAAI,oBAAoB;AAGxB,aAAS,UAAU,GAAG,UAAU,aAAa,WAAW;AAEtD,WAAK,mBAAA;AAEL,UAAI,cAAc;AAChB,qBAAa,IAAI;AAAA,UACf,MAAM;AAAA,UACN,eAAe;AAAA,UACf,eAAe;AAAA,QAAA,CAChB;AAAA,MACH;AAIA,eAAS,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;AAC9C,YAAI,UAAW,KAAK,GAAI;AACtB,yBAAe,CAAC,EAAE,KAAA;AAAA,QACpB;AAAA,MACF;AAGA,0BAAoB,SAAS;AAG7B,sCAAgC,IAAI;AAGpC,WAAK,qBAAqB,YAAY;AAEtC,UAAI,cAAc;AAChB,qBAAa,IAAI;AAAA,UACf,MAAM;AAAA,UACN,eAAe;AAAA,UACf,uBAAuB,KAAK,YAAY,IAAI,CAAA,MAAK;AAC/C,kBAAM,kBAAkB,EAAE,2BAAA;AAC1B,kBAAM,+BAGF,CAAA;AACJ,uBAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,eAAe,GAAG;AACzD,2CAA6B,GAAG,IAAI,WAAW,IAAI;AAAA,YACrD;AACA,mBAAO;AAAA,cACL,YAAY,EAAE;AAAA,cACd,aAAa,EAAE,uBAAA;AAAA,cACf,iBAAiB;AAAA,YAAA;AAAA,UAErB,CAAC;AAAA,QAAA,CACF;AAAA,MACH;AAGA,YAAM,YAAY,KAAK,aAAa,YAAY;AAEhD,UAAI,cAAc;AAChB,qBAAa,IAAI;AAAA,UACf,MAAM;AAAA,UACN,eAAe;AAAA,UACf;AAAA,UACA,aAAa;AAAA;AAAA,UACb,cAAc,KAAK,wBAAA;AAAA,UACnB,YAAY,KAAK,MAAM,IAAI,CAAA,MAAK;AAC9B,kBAAM,OAAO,EAAE,aAAA;AACf,mBAAO;AAAA,cACL,MAAM,KAAK;AAAA,cACX,MAAM,KAAK;AAAA,YAAA;AAAA,UAEf,CAAC;AAAA,QAAA,CACF;AAAA,MACH;AAGA,UAAI,YAAY,UAAU;AACxB,mBAAW;AACX,mBAAW,KAAK,wBAAA;AAChB,4BAAoB;AAAA,MACtB;AAAA,IACF;AAGA,QAAI,UAAU;AACZ,WAAK,wBAAwB,QAAQ;AAErC,WAAK,qBAAqB,YAAY;AAEtC,UAAI,cAAc;AAChB,qBAAa,IAAI;AAAA,UACf,MAAM;AAAA,UACN;AAAA,UACA,WAAW;AAAA,UACX,aAAa;AAAA;AAAA,UACb,YAAY,KAAK,MAAM,IAAI,CAAA,OAAM;AAAA,YAC/B,MAAM,EAAE,QAAA;AAAA,YACR,MAAM,EAAE;AAAA,UAAA,EACR;AAAA,QAAA,CACH;AAAA,MACH;AAAA,IACF,OAAO;AACL;AAAA,QACE,gBAAgB;AAAA,QAChB;AAAA,MAAA;AAAA,IAEJ;AAAA,EACF;AACF;AAMA,SAAS,eAAe,OAAmD;AACzE,QAAM,4BAAY,IAAA;AAElB,aAAW,MAAM,MAAM,SAAS;AAC9B,UAAM,OAAO,eAAe,EAAE;AAC9B,UAAM,IAAI,IAAI,IAAI;AAAA,EACpB;AAEA,SAAO;AACT;AAQA,SAAS,oBAAoB,WAA+C;AAC1E,aAAW,CAAC,IAAI,IAAI,KAAK,WAAW;AAClC,UAAM,iBAAiB,KAAK,aAAa,KAAK,CAAA,MAAK,EAAE,SAAS,SAAS;AACvE,QAAI,KAAK,MAAM,gBAAgB;AAC7B,SAAG,aAAA;AACH,WAAK,GAAG,aAAA;AAAA,IACV;AAAA,EACF;AACF;AAMA,SAAS,eAAe,IAA6B;AACnD,QAAM,eAA8B,CAAA;AACpC,MAAI,KAA+B;AAGnC,QAAM,QAAuB,CAAC,GAAG,GAAG,OAAO;AAC3C,QAAM,8BAAc,IAAA;AAEpB,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,OAAO,KAAK,MAAM,MAAA,CAAO;AAC/B,QAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,YAAQ,IAAI,IAAI;AAEhB,YAAQ,KAAK,MAAA;AAAA,MACX,KAAK;AACH,qBAAa,KAAK,IAAI;AACtB,cAAM,KAAK,KAAK,MAAM;AACtB;AAAA,MACF,KAAK;AAEH,cAAM,KAAK,GAAG,KAAK,OAAO;AAC1B;AAAA,MACF,KAAK;AAEH,aAAK;AACL;AAAA,IAMA;AAAA,EAEN;AAEA,SAAO,EAAC,IAAI,aAAA;AACd;AASA,SAAS,gCAAgC,OAA2B;AAClE,aAAW,QAAQ,MAAM,OAAO;AAC9B,QAAI,KAAK,SAAS,WAAW;AAC3B,WAAK,iBAAA;AAAA,IACP;AAAA,EACF;AACF;"}

package/out/zql/src/query/create-builder.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"create-builder.d.ts","sourceRoot":"","sources":["../../../../../zql/src/query/create-builder.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAC9D,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,qBAAqB,CAAC;AAIvD,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,mBAAmB,CAAC;AAEnD;;GAEG;AACH,wBAAgB,aAAa,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAIzE;AAED,wBAAgB,qBAAqB,CAAC,CAAC,SAAS,MAAM,EACpD,QAAQ,EAAE,aAAa,EACvB,MAAM,EAAE,CAAC,GACR,WAAW,CAAC,CAAC,CAAC,CAIhB"}
+{"version":3,"file":"create-builder.d.ts","sourceRoot":"","sources":["../../../../../zql/src/query/create-builder.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAC9D,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,qBAAqB,CAAC;AAIvD,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,mBAAmB,CAAC;AAEnD;;GAEG;AACH,wBAAgB,aAAa,CAAC,CAAC,SAAS,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAIzE;AAED,wBAAgB,qBAAqB,CAAC,CAAC,SAAS,MAAM,EACpD,QAAQ,EAAE,aAAa,EACvB,MAAM,EAAE,CAAC,GACR,WAAW,CAAC,CAAC,CAAC,CAIhB"}

package/out/zql/src/query/create-builder.js

@@ -1,3 +1,4 @@
+import { recordProxy } from "../../../shared/src/record-proxy.js";
 import { newQuery } from "./query-impl.js";
 import { newRunnableQuery } from "./runnable-query-impl.js";
 function createBuilder(schema) {
@@ -13,43 +14,13 @@ function createRunnableBuilder(delegate, schema) {
   );
 }
 function createBuilderWithQueryFactory(schema, queryFactory) {
-  const cache = /* @__PURE__ */ new Map();
-  const { tables } = schema;
-  function getQuery(prop) {
-    const cached = cache.get(prop);
-    if (cached) {
-      return cached;
+  return recordProxy(
+    schema.tables,
+    (_tableSchema, prop) => queryFactory(prop),
+    (prop) => {
+      throw new Error(`Table ${prop} does not exist in schema`);
     }
-    if (!Object.hasOwn(schema.tables, prop)) {
-      return void 0;
-    }
-    const q = queryFactory(prop);
-    cache.set(prop, q);
-    return q;
-  }
-  return new Proxy(tables, {
-    get: (_target, prop) => {
-      if (typeof prop === "symbol") {
-        return void 0;
-      }
-      const q = getQuery(prop);
-      if (!q) {
-        throw new Error(`Table ${String(prop)} does not exist in schema`);
-      }
-      return q;
-    },
-    getOwnPropertyDescriptor: (_target, prop) => {
-      if (typeof prop === "symbol") {
-        return void 0;
-      }
-      const value = getQuery(prop);
-      if (!value) {
-        return void 0;
-      }
-      const desc = Reflect.getOwnPropertyDescriptor(tables, prop);
-      return { ...desc, value };
-    }
-  });
+  );
 }
 export {
   createBuilder,

package/out/zql/src/query/create-builder.js.map

@@ -1 +1 @@
-{"version":3,"file":"create-builder.js","sources":["../../../../../zql/src/query/create-builder.ts"],"sourcesContent":["import type {Schema} from '../../../zero-types/src/schema.ts';\nimport type {QueryDelegate} from './query-delegate.ts';\nimport {newQuery} from './query-impl.ts';\nimport type {Query} from './query.ts';\nimport {newRunnableQuery} from './runnable-query-impl.ts';\nimport type {SchemaQuery} from './schema-query.ts';\n\n/**\n * Returns a set of query builders for the given schema.\n */\nexport function createBuilder<S extends Schema>(schema: S): SchemaQuery<S> {\n  return createBuilderWithQueryFactory(schema, table =>\n    newQuery(schema, table),\n  );\n}\n\nexport function createRunnableBuilder<S extends Schema>(\n  delegate: QueryDelegate,\n  schema: S,\n): SchemaQuery<S> {\n  return createBuilderWithQueryFactory(schema, table =>\n    newRunnableQuery(delegate, schema, table),\n  );\n}\n\nfunction createBuilderWithQueryFactory<S extends Schema>(\n  schema: S,\n  queryFactory: (table: keyof S['tables'] & string) => Query<string, S>,\n): SchemaQuery<S> {\n  const cache = new Map<string, Query<string, S>>();\n  const {tables} = schema;\n\n  function getQuery(prop: string) {\n    const cached = cache.get(prop);\n    if (cached) {\n      return cached;\n    }\n\n    if (!Object.hasOwn(schema.tables, prop)) {\n      return undefined;\n    }\n\n    const q = queryFactory(prop);\n    cache.set(prop, q);\n    return q;\n  }\n\n  return new Proxy(tables, {\n    get: (_target, prop) => {\n      if (typeof prop === 'symbol') {\n        return undefined;\n      }\n      const q = getQuery(prop);\n      if (!q) {\n        throw new Error(`Table ${String(prop)} does not exist in schema`);\n      }\n      return q;\n    },\n\n    getOwnPropertyDescriptor: (_target, prop) => {\n      if (typeof prop === 'symbol') {\n        return undefined;\n      }\n      const value = getQuery(prop);\n      if (!value) {\n        return undefined;\n      }\n      const desc = Reflect.getOwnPropertyDescriptor(tables, prop);\n      return {...desc, value};\n    },\n  }) as unknown as SchemaQuery<S>;\n}\n"],"names":[],"mappings":";;AAUO,SAAS,cAAgC,QAA2B;AACzE,SAAO;AAAA,IAA8B;AAAA,IAAQ,CAAA,UAC3C,SAAS,QAAQ,KAAK;AAAA,EAAA;AAE1B;AAEO,SAAS,sBACd,UACA,QACgB;AAChB,SAAO;AAAA,IAA8B;AAAA,IAAQ,CAAA,UAC3C,iBAAiB,UAAU,QAAQ,KAAK;AAAA,EAAA;AAE5C;AAEA,SAAS,8BACP,QACA,cACgB;AAChB,QAAM,4BAAY,IAAA;AAClB,QAAM,EAAC,WAAU;AAEjB,WAAS,SAAS,MAAc;AAC9B,UAAM,SAAS,MAAM,IAAI,IAAI;AAC7B,QAAI,QAAQ;AACV,aAAO;AAAA,IACT;AAEA,QAAI,CAAC,OAAO,OAAO,OAAO,QAAQ,IAAI,GAAG;AACvC,aAAO;AAAA,IACT;AAEA,UAAM,IAAI,aAAa,IAAI;AAC3B,UAAM,IAAI,MAAM,CAAC;AACjB,WAAO;AAAA,EACT;AAEA,SAAO,IAAI,MAAM,QAAQ;AAAA,IACvB,KAAK,CAAC,SAAS,SAAS;AACtB,UAAI,OAAO,SAAS,UAAU;AAC5B,eAAO;AAAA,MACT;AACA,YAAM,IAAI,SAAS,IAAI;AACvB,UAAI,CAAC,GAAG;AACN,cAAM,IAAI,MAAM,SAAS,OAAO,IAAI,CAAC,2BAA2B;AAAA,MAClE;AACA,aAAO;AAAA,IACT;AAAA,IAEA,0BAA0B,CAAC,SAAS,SAAS;AAC3C,UAAI,OAAO,SAAS,UAAU;AAC5B,eAAO;AAAA,MACT;AACA,YAAM,QAAQ,SAAS,IAAI;AAC3B,UAAI,CAAC,OAAO;AACV,eAAO;AAAA,MACT;AACA,YAAM,OAAO,QAAQ,yBAAyB,QAAQ,IAAI;AAC1D,aAAO,EAAC,GAAG,MAAM,MAAA;AAAA,IACnB;AAAA,EAAA,CACD;AACH;"}
+{"version":3,"file":"create-builder.js","sources":["../../../../../zql/src/query/create-builder.ts"],"sourcesContent":["import {recordProxy} from '../../../shared/src/record-proxy.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport type {QueryDelegate} from './query-delegate.ts';\nimport {newQuery} from './query-impl.ts';\nimport type {Query} from './query.ts';\nimport {newRunnableQuery} from './runnable-query-impl.ts';\nimport type {SchemaQuery} from './schema-query.ts';\n\n/**\n * Returns a set of query builders for the given schema.\n */\nexport function createBuilder<S extends Schema>(schema: S): SchemaQuery<S> {\n  return createBuilderWithQueryFactory(schema, table =>\n    newQuery(schema, table),\n  );\n}\n\nexport function createRunnableBuilder<S extends Schema>(\n  delegate: QueryDelegate,\n  schema: S,\n): SchemaQuery<S> {\n  return createBuilderWithQueryFactory(schema, table =>\n    newRunnableQuery(delegate, schema, table),\n  );\n}\n\nfunction createBuilderWithQueryFactory<S extends Schema>(\n  schema: S,\n  queryFactory: (table: keyof S['tables'] & string) => Query<string, S>,\n): SchemaQuery<S> {\n  return recordProxy(\n    schema.tables,\n    (_tableSchema, prop) => queryFactory(prop),\n    prop => {\n      throw new Error(`Table ${prop} does not exist in schema`);\n    },\n  ) as unknown as SchemaQuery<S>;\n}\n"],"names":[],"mappings":";;;AAWO,SAAS,cAAgC,QAA2B;AACzE,SAAO;AAAA,IAA8B;AAAA,IAAQ,CAAA,UAC3C,SAAS,QAAQ,KAAK;AAAA,EAAA;AAE1B;AAEO,SAAS,sBACd,UACA,QACgB;AAChB,SAAO;AAAA,IAA8B;AAAA,IAAQ,CAAA,UAC3C,iBAAiB,UAAU,QAAQ,KAAK;AAAA,EAAA;AAE5C;AAEA,SAAS,8BACP,QACA,cACgB;AAChB,SAAO;AAAA,IACL,OAAO;AAAA,IACP,CAAC,cAAc,SAAS,aAAa,IAAI;AAAA,IACzC,CAAA,SAAQ;AACN,YAAM,IAAI,MAAM,SAAS,IAAI,2BAA2B;AAAA,IAC1D;AAAA,EAAA;AAEJ;"}

package/out/zql/src/query/measure-push-operator.d.ts

@@ -12,7 +12,7 @@ export declare class MeasurePushOperator implements Operator {
     fetch(req: FetchRequest): Stream<Node | 'yield'>;
     getSchema(): SourceSchema;
     destroy(): void;
-    push(change: Change): void;
+    push(change: Change): Stream<'yield'>;
 }
 export {};
 //# sourceMappingURL=measure-push-operator.d.ts.map

package/out/zql/src/query/measure-push-operator.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"measure-push-operator.d.ts","sourceRoot":"","sources":["../../../../../zql/src/query/measure-push-operator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,kBAAkB,CAAC;AAC7C,OAAO,KAAK,EAAC,IAAI,EAAC,MAAM,gBAAgB,CAAC;AACzC,OAAO,EAEL,KAAK,YAAY,EACjB,KAAK,KAAK,EACV,KAAK,QAAQ,EACb,KAAK,MAAM,EACZ,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,kBAAkB,CAAC;AACnD,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,kBAAkB,CAAC;AAC7C,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAE3D,KAAK,UAAU,GAAG,qBAAqB,GAAG,qBAAqB,CAAC;AAEhE,qBAAa,mBAAoB,YAAW,QAAQ;;gBAShD,KAAK,EAAE,KAAK,EACZ,OAAO,EAAE,MAAM,EACf,eAAe,EAAE,eAAe,EAChC,UAAU,EAAE,UAAU;IASxB,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAI/B,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC;IAIhD,SAAS,IAAI,YAAY;IAIzB,OAAO,IAAI,IAAI;IAIf,IAAI,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;CAS3B"}
+{"version":3,"file":"measure-push-operator.d.ts","sourceRoot":"","sources":["../../../../../zql/src/query/measure-push-operator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,kBAAkB,CAAC;AAC7C,OAAO,KAAK,EAAC,IAAI,EAAC,MAAM,gBAAgB,CAAC;AACzC,OAAO,EAEL,KAAK,YAAY,EACjB,KAAK,KAAK,EACV,KAAK,QAAQ,EACb,KAAK,MAAM,EACZ,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,kBAAkB,CAAC;AACnD,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,kBAAkB,CAAC;AAC7C,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAE3D,KAAK,UAAU,GAAG,qBAAqB,GAAG,qBAAqB,CAAC;AAEhE,qBAAa,mBAAoB,YAAW,QAAQ;;gBAShD,KAAK,EAAE,KAAK,EACZ,OAAO,EAAE,MAAM,EACf,eAAe,EAAE,eAAe,EAChC,UAAU,EAAE,UAAU;IASxB,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAI/B,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC;IAIhD,SAAS,IAAI,YAAY;IAIzB,OAAO,IAAI,IAAI;IAId,IAAI,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC;CASvC"}

package/out/zql/src/query/measure-push-operator.js

@@ -24,9 +24,9 @@ class MeasurePushOperator {
   destroy() {
     this.#input.destroy();
   }
-  push(change) {
+  *push(change) {
     const startTime = performance.now();
-    this.#output.push(change, this);
+    yield* this.#output.push(change, this);
     this.#metricsDelegate.addMetric(
       this.#metricName,
       performance.now() - startTime,

package/out/zql/src/query/measure-push-operator.js.map

@@ -1 +1 @@
-{"version":3,"file":"measure-push-operator.js","sources":["../../../../../zql/src/query/measure-push-operator.ts"],"sourcesContent":["import type {Change} from '../ivm/change.ts';\nimport type {Node} from '../ivm/data.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type Operator,\n  type Output,\n} from '../ivm/operator.ts';\nimport type {SourceSchema} from '../ivm/schema.ts';\nimport type {Stream} from '../ivm/stream.ts';\nimport type {MetricsDelegate} from './metrics-delegate.ts';\n\ntype MetricName = 'query-update-client' | 'query-update-server';\n\nexport class MeasurePushOperator implements Operator {\n  readonly #input: Input;\n  readonly #queryID: string;\n  readonly #metricsDelegate: MetricsDelegate;\n\n  #output: Output = throwOutput;\n  readonly #metricName: MetricName;\n\n  constructor(\n    input: Input,\n    queryID: string,\n    metricsDelegate: MetricsDelegate,\n    metricName: MetricName,\n  ) {\n    this.#input = input;\n    this.#queryID = queryID;\n    this.#metricsDelegate = metricsDelegate;\n    this.#metricName = metricName;\n    input.setOutput(this);\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    return this.#input.fetch(req);\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  push(change: Change): void {\n    const startTime = performance.now();\n    this.#output.push(change, this);\n    this.#metricsDelegate.addMetric(\n      this.#metricName,\n      performance.now() - startTime,\n      this.#queryID,\n    );\n  }\n}\n"],"names":[],"mappings":";AAeO,MAAM,oBAAwC;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EAET,UAAkB;AAAA,EACT;AAAA,EAET,YACE,OACA,SACA,iBACA,YACA;AACA,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,mBAAmB;AACxB,SAAK,cAAc;AACnB,UAAM,UAAU,IAAI;AAAA,EACtB;AAAA,EAEA,UAAU,QAAsB;AAC9B,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,MAAM,KAA2C;AAC/C,WAAO,KAAK,OAAO,MAAM,GAAG;AAAA,EAC9B;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK,OAAO,UAAA;AAAA,EACrB;AAAA,EAEA,UAAgB;AACd,SAAK,OAAO,QAAA;AAAA,EACd;AAAA,EAEA,KAAK,QAAsB;AACzB,UAAM,YAAY,YAAY,IAAA;AAC9B,SAAK,QAAQ,KAAK,QAAQ,IAAI;AAC9B,SAAK,iBAAiB;AAAA,MACpB,KAAK;AAAA,MACL,YAAY,QAAQ;AAAA,MACpB,KAAK;AAAA,IAAA;AAAA,EAET;AACF;"}
+{"version":3,"file":"measure-push-operator.js","sources":["../../../../../zql/src/query/measure-push-operator.ts"],"sourcesContent":["import type {Change} from '../ivm/change.ts';\nimport type {Node} from '../ivm/data.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type Operator,\n  type Output,\n} from '../ivm/operator.ts';\nimport type {SourceSchema} from '../ivm/schema.ts';\nimport type {Stream} from '../ivm/stream.ts';\nimport type {MetricsDelegate} from './metrics-delegate.ts';\n\ntype MetricName = 'query-update-client' | 'query-update-server';\n\nexport class MeasurePushOperator implements Operator {\n  readonly #input: Input;\n  readonly #queryID: string;\n  readonly #metricsDelegate: MetricsDelegate;\n\n  #output: Output = throwOutput;\n  readonly #metricName: MetricName;\n\n  constructor(\n    input: Input,\n    queryID: string,\n    metricsDelegate: MetricsDelegate,\n    metricName: MetricName,\n  ) {\n    this.#input = input;\n    this.#queryID = queryID;\n    this.#metricsDelegate = metricsDelegate;\n    this.#metricName = metricName;\n    input.setOutput(this);\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    return this.#input.fetch(req);\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  *push(change: Change): Stream<'yield'> {\n    const startTime = performance.now();\n    yield* this.#output.push(change, this);\n    this.#metricsDelegate.addMetric(\n      this.#metricName,\n      performance.now() - startTime,\n      this.#queryID,\n    );\n  }\n}\n"],"names":[],"mappings":";AAeO,MAAM,oBAAwC;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EAET,UAAkB;AAAA,EACT;AAAA,EAET,YACE,OACA,SACA,iBACA,YACA;AACA,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,mBAAmB;AACxB,SAAK,cAAc;AACnB,UAAM,UAAU,IAAI;AAAA,EACtB;AAAA,EAEA,UAAU,QAAsB;AAC9B,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,MAAM,KAA2C;AAC/C,WAAO,KAAK,OAAO,MAAM,GAAG;AAAA,EAC9B;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK,OAAO,UAAA;AAAA,EACrB;AAAA,EAEA,UAAgB;AACd,SAAK,OAAO,QAAA;AAAA,EACd;AAAA,EAEA,CAAC,KAAK,QAAiC;AACrC,UAAM,YAAY,YAAY,IAAA;AAC9B,WAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC,SAAK,iBAAiB;AAAA,MACpB,KAAK;AAAA,MACL,YAAY,QAAQ;AAAA,MACpB,KAAK;AAAA,IAAA;AAAA,EAET;AACF;"}

package/out/zqlite/src/internal/sql-inline.d.ts

@@ -0,0 +1,13 @@
+import type { SQLQuery } from '@databases/sql';
+/**
+ * Compiles a SQL query with values inlined directly into the SQL string.
+ *
+ * WARNING: This should ONLY be used for cost estimation in the query planner.
+ * Never use this for user-facing queries - always use the standard `compile()`
+ * function from sql.ts which uses parameterized queries.
+ *
+ * @param sql The SQL query to compile
+ * @returns SQL string with values inlined
+ */
+export declare function compileInline(sql: SQLQuery): string;
+//# sourceMappingURL=sql-inline.d.ts.map

package/out/zqlite/src/internal/sql-inline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sql-inline.d.ts","sourceRoot":"","sources":["../../../../../zqlite/src/internal/sql-inline.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAoE7C;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,QAAQ,GAAG,MAAM,CAEnD"}

package/out/zqlite/src/internal/sql-inline.js

@@ -0,0 +1,45 @@
+import { escapeSQLiteIdentifier } from "@databases/escape-identifier";
+function escapeSQLiteString(str) {
+  return `'${str.replace(/'/g, "''")}'`;
+}
+function inlineValue(value) {
+  if (value === null) {
+    return "NULL";
+  }
+  if (typeof value === "string") {
+    return escapeSQLiteString(value);
+  }
+  if (typeof value === "number") {
+    return String(value);
+  }
+  if (typeof value === "boolean") {
+    return value ? "1" : "0";
+  }
+  if (Array.isArray(value)) {
+    return escapeSQLiteString(JSON.stringify(value));
+  }
+  return escapeSQLiteString(JSON.stringify(value));
+}
+const sqliteInlineFormat = {
+  escapeIdentifier: (str) => escapeSQLiteIdentifier(str),
+  formatValue: (value) => (
+    // undefined is our signal to use a placeholder
+    // IMPORTANT. Changing this will break the planner as it will assume `NULL`
+    // for constraints!
+    value === void 0 ? {
+      placeholder: "?",
+      value
+    } : {
+      placeholder: inlineValue(value),
+      value: void 0
+      // No binding needed since value is inlined
+    }
+  )
+};
+function compileInline(sql) {
+  return sql.format(sqliteInlineFormat).text;
+}
+export {
+  compileInline
+};
+//# sourceMappingURL=sql-inline.js.map

package/out/zqlite/src/internal/sql-inline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sql-inline.js","sources":["../../../../../zqlite/src/internal/sql-inline.ts"],"sourcesContent":["import type {FormatConfig} from '@databases/sql';\nimport type {SQLQuery} from '@databases/sql';\nimport {escapeSQLiteIdentifier} from '@databases/escape-identifier';\n\n/**\n * Escapes a SQLite string value by doubling single quotes.\n * SQLite uses single quotes for string literals and doubles them for escaping.\n */\nfunction escapeSQLiteString(str: string): string {\n  return `'${str.replace(/'/g, \"''\")}'`;\n}\n\n/**\n * Formats a value for inline inclusion in SQL (not as a placeholder).\n *\n * WARNING: This should ONLY be used for cost estimation in the query planner,\n * not for user-facing queries. All production queries must use parameterized\n * statements to prevent SQL injection.\n *\n * @param value The value to inline into SQL\n * @returns SQL literal representation of the value\n */\nfunction inlineValue(value: unknown): string {\n  if (value === null) {\n    return 'NULL';\n  }\n  if (typeof value === 'string') {\n    return escapeSQLiteString(value);\n  }\n  if (typeof value === 'number') {\n    return String(value);\n  }\n  if (typeof value === 'boolean') {\n    // SQLite uses 1 and 0 for booleans\n    return value ? '1' : '0';\n  }\n  if (Array.isArray(value)) {\n    // For arrays, use JSON representation (same as query-builder.ts does for IN clauses)\n    return escapeSQLiteString(JSON.stringify(value));\n  }\n  // For objects/other JSON types\n  return escapeSQLiteString(JSON.stringify(value));\n}\n\n/**\n * Format configuration that inlines values directly into SQL instead of using placeholders.\n *\n * This is used ONLY for cost estimation in the SQLite cost model, where we want SQLite's\n * query planner to see actual values to make better decisions about index usage and query plans.\n *\n * Production code must use the standard parameterized format from sql.ts.\n */\nconst sqliteInlineFormat: FormatConfig = {\n  escapeIdentifier: str => escapeSQLiteIdentifier(str),\n  formatValue: value =>\n    // undefined is our signal to use a placeholder\n    // IMPORTANT. Changing this will break the planner as it will assume `NULL`\n    // for constraints!\n    value === undefined\n      ? {\n          placeholder: '?',\n          value,\n        }\n      : {\n          placeholder: inlineValue(value),\n          value: undefined, // No binding needed since value is inlined\n        },\n};\n\n/**\n * Compiles a SQL query with values inlined directly into the SQL string.\n *\n * WARNING: This should ONLY be used for cost estimation in the query planner.\n * Never use this for user-facing queries - always use the standard `compile()`\n * function from sql.ts which uses parameterized queries.\n *\n * @param sql The SQL query to compile\n * @returns SQL string with values inlined\n */\nexport function compileInline(sql: SQLQuery): string {\n  return sql.format(sqliteInlineFormat).text;\n}\n"],"names":[],"mappings":";AAQA,SAAS,mBAAmB,KAAqB;AAC/C,SAAO,IAAI,IAAI,QAAQ,MAAM,IAAI,CAAC;AACpC;AAYA,SAAS,YAAY,OAAwB;AAC3C,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,mBAAmB,KAAK;AAAA,EACjC;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,MAAI,OAAO,UAAU,WAAW;AAE9B,WAAO,QAAQ,MAAM;AAAA,EACvB;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AAExB,WAAO,mBAAmB,KAAK,UAAU,KAAK,CAAC;AAAA,EACjD;AAEA,SAAO,mBAAmB,KAAK,UAAU,KAAK,CAAC;AACjD;AAUA,MAAM,qBAAmC;AAAA,EACvC,kBAAkB,CAAA,QAAO,uBAAuB,GAAG;AAAA,EACnD,aAAa,CAAA;AAAA;AAAA;AAAA;AAAA,IAIX,UAAU,SACN;AAAA,MACE,aAAa;AAAA,MACb;AAAA,IAAA,IAEF;AAAA,MACE,aAAa,YAAY,KAAK;AAAA,MAC9B,OAAO;AAAA;AAAA,IAAA;AAAA;AAEjB;AAYO,SAAS,cAAc,KAAuB;AACnD,SAAO,IAAI,OAAO,kBAAkB,EAAE;AACxC;"}

package/out/zqlite/src/sqlite-cost-model.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sqlite-cost-model.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/sqlite-cost-model.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,mBAAmB,EAEpB,MAAM,6CAA6C,CAAC;AAIrD,OAAO,KAAK,EAAC,QAAQ,EAAY,MAAM,SAAS,CAAC;AAIjD,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,sCAAsC,CAAC;AAiBtE;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,QAAQ,EACZ,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE;IAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;CAAC,CAAC,GAC9D,mBAAmB,CAgDrB;AAoHD,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAK9C"}
+{"version":3,"file":"sqlite-cost-model.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/sqlite-cost-model.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,mBAAmB,EAEpB,MAAM,6CAA6C,CAAC;AAIrD,OAAO,KAAK,EAAC,QAAQ,EAAY,MAAM,SAAS,CAAC;AAIjD,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,sCAAsC,CAAC;AAiBtE;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,QAAQ,EACZ,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE;IAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;CAAC,CAAC,GAC9D,mBAAmB,CAqDrB;AAoHD,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAK9C"}

package/out/zqlite/src/sqlite-cost-model.js

@@ -1,6 +1,6 @@
 import SQLite3Database from "@rocicorp/zero-sqlite3";
 import { buildSelectQuery } from "./query-builder.js";
-import { compile } from "./internal/sql.js";
+import { compileInline } from "./internal/sql-inline.js";
 import { assert } from "../../shared/src/asserts.js";
 import { must } from "../../shared/src/must.js";
 import { SQLiteStatFanout } from "./sqlite-stat-fanout.js";
@@ -20,7 +20,7 @@ function createSQLiteCostModel(db, tableSpecs) {
       void 0
       // start is undefined here
     );
-    const sql = compile(query);
+    const sql = compileInline(query);
     const stmt = db.prepare(sql);
     const loops = getScanstatusLoops(stmt);
     assert(

package/out/zqlite/src/sqlite-cost-model.js.map

@@ -1 +1 @@
-{"version":3,"file":"sqlite-cost-model.js","sources":["../../../../zqlite/src/sqlite-cost-model.ts"],"sourcesContent":["import type {Condition, Ordering} from '../../zero-protocol/src/ast.ts';\nimport type {\n  ConnectionCostModel,\n  CostModelCost,\n} from '../../zql/src/planner/planner-connection.ts';\nimport type {PlannerConstraint} from '../../zql/src/planner/planner-constraint.ts';\nimport SQLite3Database from '@rocicorp/zero-sqlite3';\nimport {buildSelectQuery, type NoSubqueryCondition} from './query-builder.ts';\nimport type {Database, Statement} from './db.ts';\nimport {compile} from './internal/sql.ts';\nimport {assert} from '../../shared/src/asserts.ts';\nimport {must} from '../../shared/src/must.ts';\nimport type {SchemaValue} from '../../zero-types/src/schema-value.ts';\nimport {SQLiteStatFanout} from './sqlite-stat-fanout.ts';\n\n/**\n * Loop information returned by SQLite's scanstatus API.\n */\ninterface ScanstatusLoop {\n  /** Unique identifier for this loop */\n  selectId: number;\n  /** Parent loop ID, or 0 for root loops */\n  parentId: number;\n  /** Estimated rows emitted per turn of parent loop */\n  est: number;\n  /** EXPLAIN text for this loop to determine: b-tree vs list subquery */\n  explain: string;\n}\n\n/**\n * Creates a SQLite-based cost model for query planning.\n * Uses SQLite's scanstatus API to estimate query costs based on the actual\n * SQLite query planner's analysis.\n *\n * @param db Database instance for preparing statements\n * @param tableSpecs Map of table names to their table specs with ZQL schemas\n * @returns ConnectionCostModel function for use with the planner\n */\nexport function createSQLiteCostModel(\n  db: Database,\n  tableSpecs: Map<string, {zqlSpec: Record<string, SchemaValue>}>,\n): ConnectionCostModel {\n  const fanoutEstimator = new SQLiteStatFanout(db);\n  return (\n    tableName: string,\n    sort: Ordering,\n    filters: Condition | undefined,\n    constraint: PlannerConstraint | undefined,\n  ): CostModelCost => {\n    // Transform filters to remove correlated subqueries\n    // The cost model can't handle correlated subqueries, so we estimate cost\n    // without them. This is conservative - actual cost may be higher.\n    const noSubqueryFilters = filters\n      ? removeCorrelatedSubqueries(filters)\n      : undefined;\n\n    // Build the SQL query using the same logic as actual queries\n    const {zqlSpec} = must(tableSpecs.get(tableName));\n\n    const query = buildSelectQuery(\n      tableName,\n      zqlSpec,\n      constraint,\n      noSubqueryFilters,\n      sort,\n      undefined, // reverse is undefined here\n      undefined, // start is undefined here\n    );\n\n    const sql = compile(query);\n\n    // Prepare statement to get scanstatus information\n    const stmt = db.prepare(sql);\n\n    // Get scanstatus loops from the prepared statement\n    const loops = getScanstatusLoops(stmt);\n\n    // Scanstatus should always be available - if we get no loops, something is wrong\n    assert(\n      loops.length > 0,\n      `Expected scanstatus to return at least one loop for query: ${sql}`,\n    );\n\n    const ret = estimateCost(loops, (columns: string[]) =>\n      fanoutEstimator.getFanout(tableName, columns),\n    );\n\n    return ret;\n  };\n}\n\n/**\n * Removes correlated subqueries from conditions.\n * The cost model estimates cost without correlated subqueries since\n * they can't be included in the scanstatus query.\n */\nfunction removeCorrelatedSubqueries(\n  condition: Condition,\n): NoSubqueryCondition | undefined {\n  switch (condition.type) {\n    case 'correlatedSubquery':\n      // Remove correlated subqueries - we can't estimate their cost via scanstatus\n      return undefined;\n    case 'simple':\n      return condition;\n    case 'and': {\n      const filtered = condition.conditions\n        .map(c => removeCorrelatedSubqueries(c))\n        .filter((c): c is NoSubqueryCondition => c !== undefined);\n      if (filtered.length === 0) return undefined;\n      if (filtered.length === 1) return filtered[0];\n      return {type: 'and', conditions: filtered};\n    }\n    case 'or': {\n      const filtered = condition.conditions\n        .map(c => removeCorrelatedSubqueries(c))\n        .filter((c): c is NoSubqueryCondition => c !== undefined);\n      if (filtered.length === 0) return undefined;\n      if (filtered.length === 1) return filtered[0];\n      return {type: 'or', conditions: filtered};\n    }\n  }\n}\n\n/**\n * Gets scanstatus loop information from a prepared statement.\n * Iterates through all query elements and extracts loop statistics.\n *\n * Uses SQLITE_SCANSTAT_COMPLEX flag (1) to get all loops including sorting operations.\n *\n * @param stmt Prepared statement to get scanstatus from\n * @returns Array of loop information, or empty array if scanstatus unavailable\n */\nfunction getScanstatusLoops(stmt: Statement): ScanstatusLoop[] {\n  const loops: ScanstatusLoop[] = [];\n\n  // Iterate through query elements by incrementing idx until we get undefined\n  // which indicates we've reached the end\n  for (let idx = 0; ; idx++) {\n    const selectId = stmt.scanStatus(\n      idx,\n      SQLite3Database.SQLITE_SCANSTAT_SELECTID,\n      1,\n    );\n\n    if (selectId === undefined) {\n      break;\n    }\n\n    loops.push({\n      selectId: must(selectId),\n      parentId: must(\n        stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_PARENTID, 1),\n      ),\n      explain: must(\n        stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_EXPLAIN, 1),\n      ),\n      est: must(stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_EST, 1)),\n    });\n  }\n\n  return loops.sort((a, b) => a.selectId - b.selectId);\n}\n\n/**\n * Estimates the cost of a query based on scanstats from sqlite3_stmt_scanstatus_v2\n */\nfunction estimateCost(\n  scanstats: ScanstatusLoop[],\n  fanout: CostModelCost['fanout'],\n): CostModelCost {\n  // Sort by selectId to process in execution order\n  const sorted = [...scanstats].sort((a, b) => a.selectId - b.selectId);\n\n  let totalRows = 0;\n  let totalCost = 0;\n\n  // Identify if there are multiple top-level (parentId=0) operations\n  // If so, the first is typically the scan, and subsequent ones are sorts\n  const topLevelOps = sorted.filter(s => s.parentId === 0);\n\n  // We only consider top level ops since ZQL queries are single-table when hitting SQLite.\n  // We do have a nested op in the case of `WHERE x IN (:arg)` but it is negligible\n  // assuming :arg is small.\n  let firstLoop = true;\n  for (const op of topLevelOps) {\n    if (firstLoop) {\n      // First top-level op is the main scan\n      // and determines the total number of rows output.\n      totalRows = op.est;\n      firstLoop = false;\n    } else {\n      if (op.explain.includes('ORDER BY')) {\n        totalCost += btreeCost(totalRows);\n      }\n    }\n  }\n\n  return {\n    rows: totalRows,\n    startupCost: totalCost,\n    fanout,\n  };\n}\n\nexport function btreeCost(rows: number): number {\n  // B-Tree construction is ~O(n log n) so we estimate the cost as such.\n  // We divide the cost by 10 because sorting in SQLite is ~10x faster\n  // than bringing the data into JS and sorting there.\n  return (rows * Math.log2(rows)) / 10;\n}\n"],"names":[],"mappings":";;;;;;AAsCO,SAAS,sBACd,IACA,YACqB;AACrB,QAAM,kBAAkB,IAAI,iBAAiB,EAAE;AAC/C,SAAO,CACL,WACA,MACA,SACA,eACkB;AAIlB,UAAM,oBAAoB,UACtB,2BAA2B,OAAO,IAClC;AAGJ,UAAM,EAAC,QAAA,IAAW,KAAK,WAAW,IAAI,SAAS,CAAC;AAEhD,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA,IAAA;AAGF,UAAM,MAAM,QAAQ,KAAK;AAGzB,UAAM,OAAO,GAAG,QAAQ,GAAG;AAG3B,UAAM,QAAQ,mBAAmB,IAAI;AAGrC;AAAA,MACE,MAAM,SAAS;AAAA,MACf,8DAA8D,GAAG;AAAA,IAAA;AAGnE,UAAM,MAAM;AAAA,MAAa;AAAA,MAAO,CAAC,YAC/B,gBAAgB,UAAU,WAAW,OAAO;AAAA,IAAA;AAG9C,WAAO;AAAA,EACT;AACF;AAOA,SAAS,2BACP,WACiC;AACjC,UAAQ,UAAU,MAAA;AAAA,IAChB,KAAK;AAEH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK,OAAO;AACV,YAAM,WAAW,UAAU,WACxB,IAAI,CAAA,MAAK,2BAA2B,CAAC,CAAC,EACtC,OAAO,CAAC,MAAgC,MAAM,MAAS;AAC1D,UAAI,SAAS,WAAW,EAAG,QAAO;AAClC,UAAI,SAAS,WAAW,EAAG,QAAO,SAAS,CAAC;AAC5C,aAAO,EAAC,MAAM,OAAO,YAAY,SAAA;AAAA,IACnC;AAAA,IACA,KAAK,MAAM;AACT,YAAM,WAAW,UAAU,WACxB,IAAI,CAAA,MAAK,2BAA2B,CAAC,CAAC,EACtC,OAAO,CAAC,MAAgC,MAAM,MAAS;AAC1D,UAAI,SAAS,WAAW,EAAG,QAAO;AAClC,UAAI,SAAS,WAAW,EAAG,QAAO,SAAS,CAAC;AAC5C,aAAO,EAAC,MAAM,MAAM,YAAY,SAAA;AAAA,IAClC;AAAA,EAAA;AAEJ;AAWA,SAAS,mBAAmB,MAAmC;AAC7D,QAAM,QAA0B,CAAA;AAIhC,WAAS,MAAM,KAAK,OAAO;AACzB,UAAM,WAAW,KAAK;AAAA,MACpB;AAAA,MACA,gBAAgB;AAAA,MAChB;AAAA,IAAA;AAGF,QAAI,aAAa,QAAW;AAC1B;AAAA,IACF;AAEA,UAAM,KAAK;AAAA,MACT,UAAU,KAAK,QAAQ;AAAA,MACvB,UAAU;AAAA,QACR,KAAK,WAAW,KAAK,gBAAgB,0BAA0B,CAAC;AAAA,MAAA;AAAA,MAElE,SAAS;AAAA,QACP,KAAK,WAAW,KAAK,gBAAgB,yBAAyB,CAAC;AAAA,MAAA;AAAA,MAEjE,KAAK,KAAK,KAAK,WAAW,KAAK,gBAAgB,qBAAqB,CAAC,CAAC;AAAA,IAAA,CACvE;AAAA,EACH;AAEA,SAAO,MAAM,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACrD;AAKA,SAAS,aACP,WACA,QACe;AAEf,QAAM,SAAS,CAAC,GAAG,SAAS,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAEpE,MAAI,YAAY;AAChB,MAAI,YAAY;AAIhB,QAAM,cAAc,OAAO,OAAO,CAAA,MAAK,EAAE,aAAa,CAAC;AAKvD,MAAI,YAAY;AAChB,aAAW,MAAM,aAAa;AAC5B,QAAI,WAAW;AAGb,kBAAY,GAAG;AACf,kBAAY;AAAA,IACd,OAAO;AACL,UAAI,GAAG,QAAQ,SAAS,UAAU,GAAG;AACnC,qBAAa,UAAU,SAAS;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN,aAAa;AAAA,IACb;AAAA,EAAA;AAEJ;AAEO,SAAS,UAAU,MAAsB;AAI9C,SAAQ,OAAO,KAAK,KAAK,IAAI,IAAK;AACpC;"}
+{"version":3,"file":"sqlite-cost-model.js","sources":["../../../../zqlite/src/sqlite-cost-model.ts"],"sourcesContent":["import type {Condition, Ordering} from '../../zero-protocol/src/ast.ts';\nimport type {\n  ConnectionCostModel,\n  CostModelCost,\n} from '../../zql/src/planner/planner-connection.ts';\nimport type {PlannerConstraint} from '../../zql/src/planner/planner-constraint.ts';\nimport SQLite3Database from '@rocicorp/zero-sqlite3';\nimport {buildSelectQuery, type NoSubqueryCondition} from './query-builder.ts';\nimport type {Database, Statement} from './db.ts';\nimport {compileInline} from './internal/sql-inline.ts';\nimport {assert} from '../../shared/src/asserts.ts';\nimport {must} from '../../shared/src/must.ts';\nimport type {SchemaValue} from '../../zero-types/src/schema-value.ts';\nimport {SQLiteStatFanout} from './sqlite-stat-fanout.ts';\n\n/**\n * Loop information returned by SQLite's scanstatus API.\n */\ninterface ScanstatusLoop {\n  /** Unique identifier for this loop */\n  selectId: number;\n  /** Parent loop ID, or 0 for root loops */\n  parentId: number;\n  /** Estimated rows emitted per turn of parent loop */\n  est: number;\n  /** EXPLAIN text for this loop to determine: b-tree vs list subquery */\n  explain: string;\n}\n\n/**\n * Creates a SQLite-based cost model for query planning.\n * Uses SQLite's scanstatus API to estimate query costs based on the actual\n * SQLite query planner's analysis.\n *\n * @param db Database instance for preparing statements\n * @param tableSpecs Map of table names to their table specs with ZQL schemas\n * @returns ConnectionCostModel function for use with the planner\n */\nexport function createSQLiteCostModel(\n  db: Database,\n  tableSpecs: Map<string, {zqlSpec: Record<string, SchemaValue>}>,\n): ConnectionCostModel {\n  const fanoutEstimator = new SQLiteStatFanout(db);\n  return (\n    tableName: string,\n    sort: Ordering,\n    filters: Condition | undefined,\n    constraint: PlannerConstraint | undefined,\n  ): CostModelCost => {\n    // Transform filters to remove correlated subqueries\n    // The cost model can't handle correlated subqueries, so we estimate cost\n    // without them. This is conservative - actual cost may be higher.\n    const noSubqueryFilters = filters\n      ? removeCorrelatedSubqueries(filters)\n      : undefined;\n\n    // Build the SQL query using the same logic as actual queries\n    const {zqlSpec} = must(tableSpecs.get(tableName));\n\n    const query = buildSelectQuery(\n      tableName,\n      zqlSpec,\n      constraint,\n      noSubqueryFilters,\n      sort,\n      undefined, // reverse is undefined here\n      undefined, // start is undefined here\n    );\n\n    // Use compileInline to inline actual values into the SQL for cost estimation.\n    // This allows SQLite's query planner to see real values and make better decisions\n    // about index usage and query plans. This is safe here because it's only used for\n    // cost estimation, not for executing user-facing queries (which use parameterized\n    // queries via the standard compile() function).\n    const sql = compileInline(query);\n\n    // Prepare statement to get scanstatus information\n    const stmt = db.prepare(sql);\n\n    // Get scanstatus loops from the prepared statement\n    const loops = getScanstatusLoops(stmt);\n\n    // Scanstatus should always be available - if we get no loops, something is wrong\n    assert(\n      loops.length > 0,\n      `Expected scanstatus to return at least one loop for query: ${sql}`,\n    );\n\n    const ret = estimateCost(loops, (columns: string[]) =>\n      fanoutEstimator.getFanout(tableName, columns),\n    );\n\n    return ret;\n  };\n}\n\n/**\n * Removes correlated subqueries from conditions.\n * The cost model estimates cost without correlated subqueries since\n * they can't be included in the scanstatus query.\n */\nfunction removeCorrelatedSubqueries(\n  condition: Condition,\n): NoSubqueryCondition | undefined {\n  switch (condition.type) {\n    case 'correlatedSubquery':\n      // Remove correlated subqueries - we can't estimate their cost via scanstatus\n      return undefined;\n    case 'simple':\n      return condition;\n    case 'and': {\n      const filtered = condition.conditions\n        .map(c => removeCorrelatedSubqueries(c))\n        .filter((c): c is NoSubqueryCondition => c !== undefined);\n      if (filtered.length === 0) return undefined;\n      if (filtered.length === 1) return filtered[0];\n      return {type: 'and', conditions: filtered};\n    }\n    case 'or': {\n      const filtered = condition.conditions\n        .map(c => removeCorrelatedSubqueries(c))\n        .filter((c): c is NoSubqueryCondition => c !== undefined);\n      if (filtered.length === 0) return undefined;\n      if (filtered.length === 1) return filtered[0];\n      return {type: 'or', conditions: filtered};\n    }\n  }\n}\n\n/**\n * Gets scanstatus loop information from a prepared statement.\n * Iterates through all query elements and extracts loop statistics.\n *\n * Uses SQLITE_SCANSTAT_COMPLEX flag (1) to get all loops including sorting operations.\n *\n * @param stmt Prepared statement to get scanstatus from\n * @returns Array of loop information, or empty array if scanstatus unavailable\n */\nfunction getScanstatusLoops(stmt: Statement): ScanstatusLoop[] {\n  const loops: ScanstatusLoop[] = [];\n\n  // Iterate through query elements by incrementing idx until we get undefined\n  // which indicates we've reached the end\n  for (let idx = 0; ; idx++) {\n    const selectId = stmt.scanStatus(\n      idx,\n      SQLite3Database.SQLITE_SCANSTAT_SELECTID,\n      1,\n    );\n\n    if (selectId === undefined) {\n      break;\n    }\n\n    loops.push({\n      selectId: must(selectId),\n      parentId: must(\n        stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_PARENTID, 1),\n      ),\n      explain: must(\n        stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_EXPLAIN, 1),\n      ),\n      est: must(stmt.scanStatus(idx, SQLite3Database.SQLITE_SCANSTAT_EST, 1)),\n    });\n  }\n\n  return loops.sort((a, b) => a.selectId - b.selectId);\n}\n\n/**\n * Estimates the cost of a query based on scanstats from sqlite3_stmt_scanstatus_v2\n */\nfunction estimateCost(\n  scanstats: ScanstatusLoop[],\n  fanout: CostModelCost['fanout'],\n): CostModelCost {\n  // Sort by selectId to process in execution order\n  const sorted = [...scanstats].sort((a, b) => a.selectId - b.selectId);\n\n  let totalRows = 0;\n  let totalCost = 0;\n\n  // Identify if there are multiple top-level (parentId=0) operations\n  // If so, the first is typically the scan, and subsequent ones are sorts\n  const topLevelOps = sorted.filter(s => s.parentId === 0);\n\n  // We only consider top level ops since ZQL queries are single-table when hitting SQLite.\n  // We do have a nested op in the case of `WHERE x IN (:arg)` but it is negligible\n  // assuming :arg is small.\n  let firstLoop = true;\n  for (const op of topLevelOps) {\n    if (firstLoop) {\n      // First top-level op is the main scan\n      // and determines the total number of rows output.\n      totalRows = op.est;\n      firstLoop = false;\n    } else {\n      if (op.explain.includes('ORDER BY')) {\n        totalCost += btreeCost(totalRows);\n      }\n    }\n  }\n\n  return {\n    rows: totalRows,\n    startupCost: totalCost,\n    fanout,\n  };\n}\n\nexport function btreeCost(rows: number): number {\n  // B-Tree construction is ~O(n log n) so we estimate the cost as such.\n  // We divide the cost by 10 because sorting in SQLite is ~10x faster\n  // than bringing the data into JS and sorting there.\n  return (rows * Math.log2(rows)) / 10;\n}\n"],"names":[],"mappings":";;;;;;AAsCO,SAAS,sBACd,IACA,YACqB;AACrB,QAAM,kBAAkB,IAAI,iBAAiB,EAAE;AAC/C,SAAO,CACL,WACA,MACA,SACA,eACkB;AAIlB,UAAM,oBAAoB,UACtB,2BAA2B,OAAO,IAClC;AAGJ,UAAM,EAAC,QAAA,IAAW,KAAK,WAAW,IAAI,SAAS,CAAC;AAEhD,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,MACA;AAAA;AAAA,IAAA;AAQF,UAAM,MAAM,cAAc,KAAK;AAG/B,UAAM,OAAO,GAAG,QAAQ,GAAG;AAG3B,UAAM,QAAQ,mBAAmB,IAAI;AAGrC;AAAA,MACE,MAAM,SAAS;AAAA,MACf,8DAA8D,GAAG;AAAA,IAAA;AAGnE,UAAM,MAAM;AAAA,MAAa;AAAA,MAAO,CAAC,YAC/B,gBAAgB,UAAU,WAAW,OAAO;AAAA,IAAA;AAG9C,WAAO;AAAA,EACT;AACF;AAOA,SAAS,2BACP,WACiC;AACjC,UAAQ,UAAU,MAAA;AAAA,IAChB,KAAK;AAEH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK,OAAO;AACV,YAAM,WAAW,UAAU,WACxB,IAAI,CAAA,MAAK,2BAA2B,CAAC,CAAC,EACtC,OAAO,CAAC,MAAgC,MAAM,MAAS;AAC1D,UAAI,SAAS,WAAW,EAAG,QAAO;AAClC,UAAI,SAAS,WAAW,EAAG,QAAO,SAAS,CAAC;AAC5C,aAAO,EAAC,MAAM,OAAO,YAAY,SAAA;AAAA,IACnC;AAAA,IACA,KAAK,MAAM;AACT,YAAM,WAAW,UAAU,WACxB,IAAI,CAAA,MAAK,2BAA2B,CAAC,CAAC,EACtC,OAAO,CAAC,MAAgC,MAAM,MAAS;AAC1D,UAAI,SAAS,WAAW,EAAG,QAAO;AAClC,UAAI,SAAS,WAAW,EAAG,QAAO,SAAS,CAAC;AAC5C,aAAO,EAAC,MAAM,MAAM,YAAY,SAAA;AAAA,IAClC;AAAA,EAAA;AAEJ;AAWA,SAAS,mBAAmB,MAAmC;AAC7D,QAAM,QAA0B,CAAA;AAIhC,WAAS,MAAM,KAAK,OAAO;AACzB,UAAM,WAAW,KAAK;AAAA,MACpB;AAAA,MACA,gBAAgB;AAAA,MAChB;AAAA,IAAA;AAGF,QAAI,aAAa,QAAW;AAC1B;AAAA,IACF;AAEA,UAAM,KAAK;AAAA,MACT,UAAU,KAAK,QAAQ;AAAA,MACvB,UAAU;AAAA,QACR,KAAK,WAAW,KAAK,gBAAgB,0BAA0B,CAAC;AAAA,MAAA;AAAA,MAElE,SAAS;AAAA,QACP,KAAK,WAAW,KAAK,gBAAgB,yBAAyB,CAAC;AAAA,MAAA;AAAA,MAEjE,KAAK,KAAK,KAAK,WAAW,KAAK,gBAAgB,qBAAqB,CAAC,CAAC;AAAA,IAAA,CACvE;AAAA,EACH;AAEA,SAAO,MAAM,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACrD;AAKA,SAAS,aACP,WACA,QACe;AAEf,QAAM,SAAS,CAAC,GAAG,SAAS,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAEpE,MAAI,YAAY;AAChB,MAAI,YAAY;AAIhB,QAAM,cAAc,OAAO,OAAO,CAAA,MAAK,EAAE,aAAa,CAAC;AAKvD,MAAI,YAAY;AAChB,aAAW,MAAM,aAAa;AAC5B,QAAI,WAAW;AAGb,kBAAY,GAAG;AACf,kBAAY;AAAA,IACd,OAAO;AACL,UAAI,GAAG,QAAQ,SAAS,UAAU,GAAG;AACnC,qBAAa,UAAU,SAAS;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN,aAAa;AAAA,IACb;AAAA,EAAA;AAEJ;AAEO,SAAS,UAAU,MAAsB;AAI9C,SAAQ,OAAO,KAAK,KAAK,IAAI,IAAK;AACpC;"}

package/out/zqlite/src/table-source.d.ts

@@ -6,6 +6,7 @@ import type { PrimaryKey } from '../../zero-protocol/src/primary-key.ts';
 import type { SchemaValue, ValueType } from '../../zero-schema/src/table-schema.ts';
 import type { DebugDelegate } from '../../zql/src/builder/debug-delegate.ts';
 import { type Source, type SourceChange, type SourceInput } from '../../zql/src/ivm/source.ts';
+import type { Stream } from '../../zql/src/ivm/stream.ts';
 import type { Database } from './db.ts';
 /**
  * A source that is backed by a SQLite table.
@@ -42,8 +43,8 @@ export declare class TableSource implements Source {
     setDB(db: Database): void;
     connect(sort: Ordering, filters?: Condition, splitEditKeys?: Set<string>, debug?: DebugDelegate): SourceInput;
     toSQLiteRow(row: Row): Row;
-    push(change: SourceChange): void;
-    genPush(change: SourceChange): Generator<undefined, void, unknown>;
+    push(change: SourceChange): Stream<'yield'>;
+    genPush(change: SourceChange): Generator<"yield" | undefined, void, unknown>;
     /**
      * Retrieves a row from the backing DB by a unique key, or `undefined` if such a
      * row does not exist. This is not used in the IVM pipeline but is useful

package/out/zqlite/src/table-source.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"table-source.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/table-source.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,+BAA+B,CAAC;AAK7D,OAAO,KAAK,EAAC,SAAS,EAAE,QAAQ,EAAC,MAAM,gCAAgC,CAAC;AACxE,OAAO,KAAK,EAAC,GAAG,EAAQ,MAAM,iCAAiC,CAAC;AAChE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AACvE,OAAO,KAAK,EACV,WAAW,EACX,SAAS,EACV,MAAM,uCAAuC,CAAC;AAC/C,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,yCAAyC,CAAC;AAe3E,OAAO,EACL,KAAK,MAAM,EACX,KAAK,YAAY,EACjB,KAAK,WAAW,EACjB,MAAM,6BAA6B,CAAC;AAErC,OAAO,KAAK,EAAC,QAAQ,EAAY,MAAM,SAAS,CAAC;AAqBjD;;;;;;;;;;;;;GAaG;AACH,qBAAa,WAAY,YAAW,MAAM;;IAexC;;;;;OAKG;gBAED,UAAU,EAAE,UAAU,EACtB,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,QAAQ,EACZ,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACpC,UAAU,EAAE,UAAU,EACtB,WAAW,gBAAc;IAiB3B,IAAI,WAAW;;;;MAMd;IAED;;;OAGG;IACH,KAAK,CAAC,EAAE,EAAE,QAAQ;IA4FlB,OAAO,CACL,IAAI,EAAE,QAAQ,EACd,OAAO,CAAC,EAAE,SAAS,EACnB,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAC3B,KAAK,CAAC,EAAE,aAAa;IAuCvB,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG;IAqG1B,IAAI,CAAC,MAAM,EAAE,YAAY,GAAG,IAAI;IAM/B,OAAO,CAAC,MAAM,EAAE,YAAY;IA4F7B;;;;;;OAMG;IACH,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS;CA6BrC;AA6BD,wBAAgB,aAAa,CAC3B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,GAAG,EAAE,GAAG,EACR,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,GACvC,SAAS,OAAO,EAAE,CAEpB;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,SAAS,wCAa/C;AAED,wBAAgB,eAAe,CAC7B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACvC,GAAG,EAAE,GAAG,EACR,SAAS,EAAE,MAAM,GAChB,GAAG,CAaL;AAwCD,qBAAa,qBAAsB,SAAQ,KAAK;CAAG"}
+{"version":3,"file":"table-source.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/table-source.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,+BAA+B,CAAC;AAK7D,OAAO,KAAK,EAAC,SAAS,EAAE,QAAQ,EAAC,MAAM,gCAAgC,CAAC;AACxE,OAAO,KAAK,EAAC,GAAG,EAAQ,MAAM,iCAAiC,CAAC;AAChE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AACvE,OAAO,KAAK,EACV,WAAW,EACX,SAAS,EACV,MAAM,uCAAuC,CAAC;AAC/C,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,yCAAyC,CAAC;AAe3E,OAAO,EACL,KAAK,MAAM,EACX,KAAK,YAAY,EACjB,KAAK,WAAW,EACjB,MAAM,6BAA6B,CAAC;AACrC,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,6BAA6B,CAAC;AACxD,OAAO,KAAK,EAAC,QAAQ,EAAY,MAAM,SAAS,CAAC;AAqBjD;;;;;;;;;;;;;GAaG;AACH,qBAAa,WAAY,YAAW,MAAM;;IAexC;;;;;OAKG;gBAED,UAAU,EAAE,UAAU,EACtB,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,QAAQ,EACZ,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACpC,UAAU,EAAE,UAAU,EACtB,WAAW,gBAAc;IAiB3B,IAAI,WAAW;;;;MAMd;IAED;;;OAGG;IACH,KAAK,CAAC,EAAE,EAAE,QAAQ;IA4FlB,OAAO,CACL,IAAI,EAAE,QAAQ,EACd,OAAO,CAAC,EAAE,SAAS,EACnB,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAC3B,KAAK,CAAC,EAAE,aAAa;IAuCvB,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG;IAqGzB,IAAI,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC;IAQ3C,OAAO,CAAC,MAAM,EAAE,YAAY;IA4F7B;;;;;;OAMG;IACH,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS;CA6BrC;AA6BD,wBAAgB,aAAa,CAC3B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,GAAG,EAAE,GAAG,EACR,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,GACvC,SAAS,OAAO,EAAE,CAEpB;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,SAAS,wCAa/C;AAED,wBAAgB,eAAe,CAC7B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACvC,GAAG,EAAE,GAAG,EACR,SAAS,EAAE,MAAM,GAChB,GAAG,CAaL;AAwCD,qBAAa,qBAAsB,SAAQ,KAAK;CAAG"}

package/out/zqlite/src/table-source.js

@@ -257,8 +257,11 @@ class TableSource {
       rowIterator.return?.();
     }
   }
-  push(change) {
-    for (const _ of this.genPush(change)) {
+  *push(change) {
+    for (const result of this.genPush(change)) {
+      if (result === "yield") {
+        yield result;
+      }
     }
   }
   *genPush(change) {

package/out/zqlite/src/table-source.js.map

@@ -1 +1 @@
-{"version":3,"file":"table-source.js","sources":["../../../../zqlite/src/table-source.ts"],"sourcesContent":["import type {SQLQuery} from '@databases/sql';\nimport type {LogContext} from '@rocicorp/logger';\nimport SQLite3Database from '@rocicorp/zero-sqlite3';\nimport type {LogConfig} from '../../otel/src/log-options.ts';\nimport {timeSampled} from '../../otel/src/maybe-time.ts';\nimport {assert, unreachable} from '../../shared/src/asserts.ts';\nimport {must} from '../../shared/src/must.ts';\nimport type {Writable} from '../../shared/src/writable.ts';\nimport type {Condition, Ordering} from '../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../zero-protocol/src/primary-key.ts';\nimport type {\n  SchemaValue,\n  ValueType,\n} from '../../zero-schema/src/table-schema.ts';\nimport type {DebugDelegate} from '../../zql/src/builder/debug-delegate.ts';\nimport {\n  createPredicate,\n  transformFilters,\n} from '../../zql/src/builder/filter.ts';\nimport {makeComparator, type Node} from '../../zql/src/ivm/data.ts';\nimport {\n  generateWithOverlay,\n  generateWithStart,\n  genPushAndWriteWithSplitEdit,\n  type Connection,\n  type Overlay,\n} from '../../zql/src/ivm/memory-source.ts';\nimport {type FetchRequest} from '../../zql/src/ivm/operator.ts';\nimport type {SourceSchema} from '../../zql/src/ivm/schema.ts';\nimport {\n  type Source,\n  type SourceChange,\n  type SourceInput,\n} from '../../zql/src/ivm/source.ts';\nimport type {Stream} from '../../zql/src/ivm/stream.ts';\nimport type {Database, Statement} from './db.ts';\nimport {compile, format, sql} from './internal/sql.ts';\nimport {StatementCache} from './internal/statement-cache.ts';\nimport {\n  buildSelectQuery,\n  toSQLiteType,\n  type NoSubqueryCondition,\n} from './query-builder.ts';\nimport {assertOrderingIncludesPK} from '../../zql/src/query/complete-ordering.ts';\n\ntype Statements = {\n  readonly cache: StatementCache;\n  readonly insert: Statement;\n  readonly delete: Statement;\n  readonly update: Statement | undefined;\n  readonly checkExists: Statement;\n  readonly getExisting: Statement;\n};\n\nlet eventCount = 0;\n\n/**\n * A source that is backed by a SQLite table.\n *\n * Values are written to the backing table _after_ being vended by the source.\n *\n * This ordering of events is to ensure self joins function properly. That is,\n * we can't reveal a value to an output before it has been pushed to that output.\n *\n * The code is fairly straightforward except for:\n * 1. Dealing with a `fetch` that has a basis of `before`.\n * 2. Dealing with compound orders that have differing directions (a ASC, b DESC, c ASC)\n *\n * See comments in relevant functions for more details.\n */\nexport class TableSource implements Source {\n  readonly #dbCache = new WeakMap<Database, Statements>();\n  readonly #connections: Connection[] = [];\n  readonly #table: string;\n  readonly #columns: Record<string, SchemaValue>;\n  // Maps sorted columns JSON string (e.g. '[\"a\",\"b\"]) to Set of columns.\n  readonly #uniqueIndexes: Map<string, Set<string>>;\n  readonly #primaryKey: PrimaryKey;\n  readonly #logConfig: LogConfig;\n  readonly #lc: LogContext;\n  readonly #shouldYield: () => boolean;\n  #stmts: Statements;\n  #overlay?: Overlay | undefined;\n  #pushEpoch = 0;\n\n  /**\n   * @param shouldYield a function called after each row is read from the database,\n   * which should return true if the source should yield the special 'yield' value\n   * to yield control back to the caller at the end of the pipeline.  Can\n   * also throw an error to abort the pipeline processing.\n   */\n  constructor(\n    logContext: LogContext,\n    logConfig: LogConfig,\n    db: Database,\n    tableName: string,\n    columns: Record<string, SchemaValue>,\n    primaryKey: PrimaryKey,\n    shouldYield = () => false,\n  ) {\n    this.#lc = logContext;\n    this.#logConfig = logConfig;\n    this.#table = tableName;\n    this.#columns = columns;\n    this.#uniqueIndexes = getUniqueIndexes(db, tableName);\n    this.#primaryKey = primaryKey;\n    this.#stmts = this.#getStatementsFor(db);\n    this.#shouldYield = shouldYield;\n\n    assert(\n      this.#uniqueIndexes.has(JSON.stringify([...primaryKey].sort())),\n      `primary key ${primaryKey} does not have a UNIQUE index`,\n    );\n  }\n\n  get tableSchema() {\n    return {\n      name: this.#table,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n    };\n  }\n\n  /**\n   * Sets the db (snapshot) to use, to facilitate the Snapshotter leapfrog\n   * algorithm for concurrent traversal of historic timelines.\n   */\n  setDB(db: Database) {\n    this.#stmts = this.#getStatementsFor(db);\n  }\n\n  #getStatementsFor(db: Database) {\n    const cached = this.#dbCache.get(db);\n    if (cached) {\n      return cached;\n    }\n\n    const stmts = {\n      cache: new StatementCache(db),\n      insert: db.prepare(\n        compile(\n          sql`INSERT INTO ${sql.ident(this.#table)} (${sql.join(\n            Object.keys(this.#columns).map(c => sql.ident(c)),\n            ', ',\n          )}) VALUES (${sql.__dangerous__rawValue(\n            Array.from({length: Object.keys(this.#columns).length})\n              .fill('?')\n              .join(','),\n          )})`,\n        ),\n      ),\n      delete: db.prepare(\n        compile(\n          sql`DELETE FROM ${sql.ident(this.#table)} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )}`,\n        ),\n      ),\n      // If all the columns are part of the primary key, we cannot use UPDATE.\n      update:\n        Object.keys(this.#columns).length > this.#primaryKey.length\n          ? db.prepare(\n              compile(\n                sql`UPDATE ${sql.ident(this.#table)} SET ${sql.join(\n                  nonPrimaryKeys(this.#columns, this.#primaryKey).map(\n                    c => sql`${sql.ident(c)}=?`,\n                  ),\n                  ',',\n                )} WHERE ${sql.join(\n                  this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n                  ' AND ',\n                )}`,\n              ),\n            )\n          : undefined,\n      checkExists: db.prepare(\n        compile(\n          sql`SELECT 1 AS \"exists\" FROM ${sql.ident(\n            this.#table,\n          )} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )} LIMIT 1`,\n        ),\n      ),\n      getExisting: db.prepare(\n        compile(\n          sql`SELECT * FROM ${sql.ident(this.#table)} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )}`,\n        ),\n      ),\n    };\n    this.#dbCache.set(db, stmts);\n    return stmts;\n  }\n\n  get #allColumns() {\n    return sql.join(\n      Object.keys(this.#columns).map(c => sql.ident(c)),\n      sql`,`,\n    );\n  }\n\n  #getSchema(connection: Connection): SourceSchema {\n    return {\n      tableName: this.#table,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n      sort: connection.sort,\n      relationships: {},\n      isHidden: false,\n      system: 'client',\n      compareRows: connection.compareRows,\n    };\n  }\n\n  connect(\n    sort: Ordering,\n    filters?: Condition,\n    splitEditKeys?: Set<string>,\n    debug?: DebugDelegate,\n  ) {\n    const transformedFilters = transformFilters(filters);\n    const input: SourceInput = {\n      getSchema: () => schema,\n      fetch: req => this.#fetch(req, connection),\n      setOutput: output => {\n        connection.output = output;\n      },\n      destroy: () => {\n        const idx = this.#connections.indexOf(connection);\n        assert(idx !== -1, 'Connection not found');\n        this.#connections.splice(idx, 1);\n      },\n      fullyAppliedFilters: !transformedFilters.conditionsRemoved,\n    };\n\n    const connection: Connection = {\n      input,\n      debug,\n      output: undefined,\n      sort,\n      splitEditKeys,\n      filters: transformedFilters.filters\n        ? {\n            condition: transformedFilters.filters,\n            predicate: createPredicate(transformedFilters.filters),\n          }\n        : undefined,\n      compareRows: makeComparator(sort),\n      lastPushedEpoch: 0,\n    };\n    const schema = this.#getSchema(connection);\n    assertOrderingIncludesPK(sort, this.#primaryKey);\n\n    this.#connections.push(connection);\n    return input;\n  }\n\n  toSQLiteRow(row: Row): Row {\n    return Object.fromEntries(\n      Object.entries(row).map(([key, value]) => [\n        key,\n        toSQLiteType(value, this.#columns[key].type),\n      ]),\n    ) as Row;\n  }\n\n  *#fetch(req: FetchRequest, connection: Connection): Stream<Node | 'yield'> {\n    const {sort, debug} = connection;\n\n    const query = this.#requestToSQL(req, connection.filters?.condition, sort);\n    const sqlAndBindings = format(query);\n\n    const cachedStatement = this.#stmts.cache.get(sqlAndBindings.text);\n    try {\n      cachedStatement.statement.safeIntegers(true);\n      const rowIterator = cachedStatement.statement.iterate<Row>(\n        ...sqlAndBindings.values,\n      );\n\n      const comparator = makeComparator(sort, req.reverse);\n\n      debug?.initQuery(this.#table, sqlAndBindings.text);\n\n      yield* generateWithStart(\n        generateWithYields(\n          generateWithOverlay(\n            req.start?.row,\n            this.#mapFromSQLiteTypes(\n              this.#columns,\n              rowIterator,\n              sqlAndBindings.text,\n              debug,\n            ),\n            req.constraint,\n            this.#overlay,\n            connection.lastPushedEpoch,\n            comparator,\n            connection.filters?.predicate,\n          ),\n          this.#shouldYield,\n        ),\n        req.start,\n        comparator,\n      );\n    } finally {\n      if (debug) {\n        let totalNvisit = 0;\n        let i = 0;\n        while (true) {\n          const nvisit = cachedStatement.statement.scanStatus(\n            i++,\n            SQLite3Database.SQLITE_SCANSTAT_NVISIT,\n            1,\n          );\n          if (nvisit === undefined) {\n            break;\n          }\n          totalNvisit += Number(nvisit);\n        }\n        if (totalNvisit !== 0) {\n          debug.recordNVisit(this.#table, sqlAndBindings.text, totalNvisit);\n        }\n        cachedStatement.statement.scanStatusReset();\n      }\n      this.#stmts.cache.return(cachedStatement);\n    }\n  }\n\n  *#mapFromSQLiteTypes(\n    valueTypes: Record<string, SchemaValue>,\n    rowIterator: IterableIterator<Row>,\n    query: string,\n    debug: DebugDelegate | undefined,\n  ): IterableIterator<Row> {\n    let result;\n    try {\n      do {\n        result = timeSampled(\n          this.#lc,\n          ++eventCount,\n          this.#logConfig.ivmSampling,\n          () => rowIterator.next(),\n          this.#logConfig.slowRowThreshold,\n          () =>\n            `table-source.next took too long for ${query}. Are you missing an index?`,\n        );\n        if (result.done) {\n          break;\n        }\n        const row = fromSQLiteTypes(valueTypes, result.value, this.#table);\n        debug?.rowVended(this.#table, query, row);\n        yield row;\n      } while (!result.done);\n    } finally {\n      rowIterator.return?.();\n    }\n  }\n\n  push(change: SourceChange): void {\n    for (const _ of this.genPush(change)) {\n      // Nothing to do.\n    }\n  }\n\n  *genPush(change: SourceChange) {\n    const exists = (row: Row) =>\n      this.#stmts.checkExists.get<{exists: number} | undefined>(\n        ...toSQLiteTypes(this.#primaryKey, row, this.#columns),\n      )?.exists === 1;\n    const setOverlay = (o: Overlay | undefined) => (this.#overlay = o);\n    const writeChange = (c: SourceChange) => this.#writeChange(c);\n\n    yield* genPushAndWriteWithSplitEdit(\n      this.#connections,\n      change,\n      exists,\n      setOverlay,\n      writeChange,\n      () => ++this.#pushEpoch,\n    );\n  }\n\n  #writeChange(change: SourceChange) {\n    switch (change.type) {\n      case 'add':\n        this.#stmts.insert.run(\n          ...toSQLiteTypes(\n            Object.keys(this.#columns),\n            change.row,\n            this.#columns,\n          ),\n        );\n        break;\n      case 'remove':\n        this.#stmts.delete.run(\n          ...toSQLiteTypes(this.#primaryKey, change.row, this.#columns),\n        );\n        break;\n      case 'edit': {\n        // If the PK is the same, use UPDATE.\n        if (\n          canUseUpdate(\n            change.oldRow,\n            change.row,\n            this.#columns,\n            this.#primaryKey,\n          )\n        ) {\n          const mergedRow = {\n            ...change.oldRow,\n            ...change.row,\n          };\n          const params = [\n            ...nonPrimaryValues(this.#columns, this.#primaryKey, mergedRow),\n            ...toSQLiteTypes(this.#primaryKey, mergedRow, this.#columns),\n          ];\n          must(this.#stmts.update).run(params);\n        } else {\n          this.#stmts.delete.run(\n            ...toSQLiteTypes(this.#primaryKey, change.oldRow, this.#columns),\n          );\n          this.#stmts.insert.run(\n            ...toSQLiteTypes(\n              Object.keys(this.#columns),\n              change.row,\n              this.#columns,\n            ),\n          );\n        }\n\n        break;\n      }\n      default:\n        unreachable(change);\n    }\n  }\n\n  #getRowStmtCache = new Map<string, string>();\n\n  #getRowStmt(keyCols: string[]): string {\n    const keyString = JSON.stringify(keyCols);\n    let stmt = this.#getRowStmtCache.get(keyString);\n    if (!stmt) {\n      stmt = compile(\n        sql`SELECT ${this.#allColumns} FROM ${sql.ident(\n          this.#table,\n        )} WHERE ${sql.join(\n          keyCols.map(k => sql`${sql.ident(k)}=?`),\n          sql` AND`,\n        )}`,\n      );\n      this.#getRowStmtCache.set(keyString, stmt);\n    }\n    return stmt;\n  }\n\n  /**\n   * Retrieves a row from the backing DB by a unique key, or `undefined` if such a\n   * row does not exist. This is not used in the IVM pipeline but is useful\n   * for retrieving data that is consistent with the state (and type\n   * semantics) of the pipeline. Note that this key may not necessarily correspond\n   * to the `primaryKey` with which this TableSource.\n   */\n  getRow(rowKey: Row): Row | undefined {\n    const keyCols = Object.keys(rowKey);\n    const keyVals = Object.values(rowKey);\n\n    const stmt = this.#getRowStmt(keyCols);\n    const row = this.#stmts.cache.use(stmt, cached =>\n      cached.statement.safeIntegers(true).get<Row>(keyVals),\n    );\n    if (row) {\n      return fromSQLiteTypes(this.#columns, row, this.#table);\n    }\n    return row;\n  }\n\n  #requestToSQL(\n    request: FetchRequest,\n    filters: NoSubqueryCondition | undefined,\n    order: Ordering,\n  ): SQLQuery {\n    return buildSelectQuery(\n      this.#table,\n      this.#columns,\n      request.constraint,\n      filters,\n      order,\n      request.reverse,\n      request.start,\n    );\n  }\n}\n\nfunction getUniqueIndexes(\n  db: Database,\n  tableName: string,\n): Map<string, Set<string>> {\n  const sqlAndBindings = format(\n    sql`\n    SELECT idx.name, json_group_array(col.name) as columnsJSON\n      FROM sqlite_master as idx\n      JOIN pragma_index_list(idx.tbl_name) AS info ON info.name = idx.name\n      JOIN pragma_index_info(idx.name) as col\n      WHERE idx.tbl_name = ${tableName} AND\n            idx.type = 'index' AND \n            info.\"unique\" != 0\n      GROUP BY idx.name\n      ORDER BY idx.name`,\n  );\n  const stmt = db.prepare(sqlAndBindings.text);\n  const indexes = stmt.all<{columnsJSON: string}>(...sqlAndBindings.values);\n  return new Map(\n    indexes.map(({columnsJSON}) => {\n      const columns = JSON.parse(columnsJSON);\n      const set = new Set<string>(columns);\n      return [JSON.stringify(columns.sort()), set];\n    }),\n  );\n}\n\nexport function toSQLiteTypes(\n  columns: readonly string[],\n  row: Row,\n  columnTypes: Record<string, SchemaValue>,\n): readonly unknown[] {\n  return columns.map(col => toSQLiteType(row[col], columnTypes[col].type));\n}\n\nexport function toSQLiteTypeName(type: ValueType) {\n  switch (type) {\n    case 'boolean':\n      return 'INTEGER';\n    case 'number':\n      return 'REAL';\n    case 'string':\n      return 'TEXT';\n    case 'null':\n      return 'NULL';\n    case 'json':\n      return 'TEXT';\n  }\n}\n\nexport function fromSQLiteTypes(\n  valueTypes: Record<string, SchemaValue>,\n  row: Row,\n  tableName: string,\n): Row {\n  const newRow: Writable<Row> = {};\n  for (const key of Object.keys(row)) {\n    const valueType = valueTypes[key];\n    if (valueType === undefined) {\n      const columnList = Object.keys(valueTypes).sort().join(', ');\n      throw new Error(\n        `Invalid column \"${key}\" for table \"${tableName}\". Synced columns include ${columnList}`,\n      );\n    }\n    newRow[key] = fromSQLiteType(valueType.type, row[key], key, tableName);\n  }\n  return newRow;\n}\n\nfunction fromSQLiteType(\n  valueType: ValueType,\n  v: Value,\n  column: string,\n  tableName: string,\n): Value {\n  if (v === null) {\n    return null;\n  }\n  switch (valueType) {\n    case 'boolean':\n      return !!v;\n    case 'number':\n    case 'string':\n    case 'null':\n      if (typeof v === 'bigint') {\n        if (v > Number.MAX_SAFE_INTEGER || v < Number.MIN_SAFE_INTEGER) {\n          throw new UnsupportedValueError(\n            `value ${v} (in ${tableName}.${column}) is outside of supported bounds`,\n          );\n        }\n        return Number(v);\n      }\n      return v;\n    case 'json':\n      try {\n        return JSON.parse(v as string);\n      } catch (error) {\n        const errorMessage =\n          error instanceof Error ? error.message : String(error);\n        throw new UnsupportedValueError(\n          `Failed to parse JSON for ${tableName}.${column}: ${errorMessage}`,\n          {cause: error},\n        );\n      }\n  }\n}\n\nexport class UnsupportedValueError extends Error {}\n\nfunction canUseUpdate(\n  oldRow: Row,\n  row: Row,\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n): boolean {\n  for (const pk of primaryKey) {\n    if (oldRow[pk] !== row[pk]) {\n      return false;\n    }\n  }\n  return Object.keys(columns).length > primaryKey.length;\n}\n\nfunction nonPrimaryValues(\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n  row: Row,\n): Iterable<unknown> {\n  return nonPrimaryKeys(columns, primaryKey).map(c =>\n    toSQLiteType(row[c], columns[c].type),\n  );\n}\n\nfunction nonPrimaryKeys(\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n) {\n  return Object.keys(columns).filter(c => !primaryKey.includes(c));\n}\n\nfunction* generateWithYields(stream: Stream<Node>, shouldYield: () => boolean) {\n  for (const n of stream) {\n    if (shouldYield()) {\n      yield 'yield';\n    }\n    yield n;\n  }\n}\n"],"names":[],"mappings":";;;;;;;;;;;AAuDA,IAAI,aAAa;AAgBV,MAAM,YAA8B;AAAA,EAChC,+BAAe,QAAA;AAAA,EACf,eAA6B,CAAA;AAAA,EAC7B;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACT;AAAA,EACA;AAAA,EACA,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQb,YACE,YACA,WACA,IACA,WACA,SACA,YACA,cAAc,MAAM,OACpB;AACA,SAAK,MAAM;AACX,SAAK,aAAa;AAClB,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,iBAAiB,iBAAiB,IAAI,SAAS;AACpD,SAAK,cAAc;AACnB,SAAK,SAAS,KAAK,kBAAkB,EAAE;AACvC,SAAK,eAAe;AAEpB;AAAA,MACE,KAAK,eAAe,IAAI,KAAK,UAAU,CAAC,GAAG,UAAU,EAAE,KAAA,CAAM,CAAC;AAAA,MAC9D,eAAe,UAAU;AAAA,IAAA;AAAA,EAE7B;AAAA,EAEA,IAAI,cAAc;AAChB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,SAAS,KAAK;AAAA,MACd,YAAY,KAAK;AAAA,IAAA;AAAA,EAErB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,IAAc;AAClB,SAAK,SAAS,KAAK,kBAAkB,EAAE;AAAA,EACzC;AAAA,EAEA,kBAAkB,IAAc;AAC9B,UAAM,SAAS,KAAK,SAAS,IAAI,EAAE;AACnC,QAAI,QAAQ;AACV,aAAO;AAAA,IACT;AAEA,UAAM,QAAQ;AAAA,MACZ,OAAO,IAAI,eAAe,EAAE;AAAA,MAC5B,QAAQ,GAAG;AAAA,QACT;AAAA,UACE,kBAAkB,IAAI,MAAM,KAAK,MAAM,CAAC,KAAK,IAAI;AAAA,YAC/C,OAAO,KAAK,KAAK,QAAQ,EAAE,IAAI,CAAA,MAAK,IAAI,MAAM,CAAC,CAAC;AAAA,YAChD;AAAA,UAAA,CACD,aAAa,IAAI;AAAA,YAChB,MAAM,KAAK,EAAC,QAAQ,OAAO,KAAK,KAAK,QAAQ,EAAE,OAAA,CAAO,EACnD,KAAK,GAAG,EACR,KAAK,GAAG;AAAA,UAAA,CACZ;AAAA,QAAA;AAAA,MACH;AAAA,MAEF,QAAQ,GAAG;AAAA,QACT;AAAA,UACE,kBAAkB,IAAI,MAAM,KAAK,MAAM,CAAC,UAAU,IAAI;AAAA,YACpD,KAAK,YAAY,IAAI,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC,IAAI;AAAA,YAChD;AAAA,UAAA,CACD;AAAA,QAAA;AAAA,MACH;AAAA;AAAA,MAGF,QACE,OAAO,KAAK,KAAK,QAAQ,EAAE,SAAS,KAAK,YAAY,SACjD,GAAG;AAAA,QACD;AAAA,UACE,aAAa,IAAI,MAAM,KAAK,MAAM,CAAC,QAAQ,IAAI;AAAA,YAC7C,eAAe,KAAK,UAAU,KAAK,WAAW,EAAE;AAAA,cAC9C,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC;AAAA,YAAA;AAAA,YAEzB;AAAA,UAAA,CACD,UAAU,IAAI;AAAA,YACb,KAAK,YAAY,IAAI,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC,IAAI;AAAA,YAChD;AAAA,UAAA,CACD;AAAA,QAAA;AAAA,MACH,IAEF;AAAA,MACN,aAAa,GAAG;AAAA,QACd;AAAA,UACE,gCAAgC,IAAI;AAAA,YAClC,KAAK;AAAA,UAAA,CACN,UAAU,IAAI;AAAA,YACb,KAAK,YAAY,IAAI,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC,IAAI;AAAA,YAChD;AAAA,UAAA,CACD;AAAA,QAAA;AAAA,MACH;AAAA,MAEF,aAAa,GAAG;AAAA,QACd;AAAA,UACE,oBAAoB,IAAI,MAAM,KAAK,MAAM,CAAC,UAAU,IAAI;AAAA,YACtD,KAAK,YAAY,IAAI,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC,IAAI;AAAA,YAChD;AAAA,UAAA,CACD;AAAA,QAAA;AAAA,MACH;AAAA,IACF;AAEF,SAAK,SAAS,IAAI,IAAI,KAAK;AAC3B,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,cAAc;AAChB,WAAO,IAAI;AAAA,MACT,OAAO,KAAK,KAAK,QAAQ,EAAE,IAAI,CAAA,MAAK,IAAI,MAAM,CAAC,CAAC;AAAA,MAChD;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEA,WAAW,YAAsC;AAC/C,WAAO;AAAA,MACL,WAAW,KAAK;AAAA,MAChB,SAAS,KAAK;AAAA,MACd,YAAY,KAAK;AAAA,MACjB,MAAM,WAAW;AAAA,MACjB,eAAe,CAAA;AAAA,MACf,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,aAAa,WAAW;AAAA,IAAA;AAAA,EAE5B;AAAA,EAEA,QACE,MACA,SACA,eACA,OACA;AACA,UAAM,qBAAqB,iBAAiB,OAAO;AACnD,UAAM,QAAqB;AAAA,MACzB,WAAW,MAAM;AAAA,MACjB,OAAO,CAAA,QAAO,KAAK,OAAO,KAAK,UAAU;AAAA,MACzC,WAAW,CAAA,WAAU;AACnB,mBAAW,SAAS;AAAA,MACtB;AAAA,MACA,SAAS,MAAM;AACb,cAAM,MAAM,KAAK,aAAa,QAAQ,UAAU;AAChD,eAAO,QAAQ,IAAI,sBAAsB;AACzC,aAAK,aAAa,OAAO,KAAK,CAAC;AAAA,MACjC;AAAA,MACA,qBAAqB,CAAC,mBAAmB;AAAA,IAAA;AAG3C,UAAM,aAAyB;AAAA,MAC7B;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,SAAS,mBAAmB,UACxB;AAAA,QACE,WAAW,mBAAmB;AAAA,QAC9B,WAAW,gBAAgB,mBAAmB,OAAO;AAAA,MAAA,IAEvD;AAAA,MACJ,aAAa,eAAe,IAAI;AAAA,MAChC,iBAAiB;AAAA,IAAA;AAEnB,UAAM,SAAS,KAAK,WAAW,UAAU;AACzC,6BAAyB,MAAM,KAAK,WAAW;AAE/C,SAAK,aAAa,KAAK,UAAU;AACjC,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,KAAe;AACzB,WAAO,OAAO;AAAA,MACZ,OAAO,QAAQ,GAAG,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;AAAA,QACxC;AAAA,QACA,aAAa,OAAO,KAAK,SAAS,GAAG,EAAE,IAAI;AAAA,MAAA,CAC5C;AAAA,IAAA;AAAA,EAEL;AAAA,EAEA,CAAC,OAAO,KAAmB,YAAgD;AACzE,UAAM,EAAC,MAAM,MAAA,IAAS;AAEtB,UAAM,QAAQ,KAAK,cAAc,KAAK,WAAW,SAAS,WAAW,IAAI;AACzE,UAAM,iBAAiB,OAAO,KAAK;AAEnC,UAAM,kBAAkB,KAAK,OAAO,MAAM,IAAI,eAAe,IAAI;AACjE,QAAI;AACF,sBAAgB,UAAU,aAAa,IAAI;AAC3C,YAAM,cAAc,gBAAgB,UAAU;AAAA,QAC5C,GAAG,eAAe;AAAA,MAAA;AAGpB,YAAM,aAAa,eAAe,MAAM,IAAI,OAAO;AAEnD,aAAO,UAAU,KAAK,QAAQ,eAAe,IAAI;AAEjD,aAAO;AAAA,QACL;AAAA,UACE;AAAA,YACE,IAAI,OAAO;AAAA,YACX,KAAK;AAAA,cACH,KAAK;AAAA,cACL;AAAA,cACA,eAAe;AAAA,cACf;AAAA,YAAA;AAAA,YAEF,IAAI;AAAA,YACJ,KAAK;AAAA,YACL,WAAW;AAAA,YACX;AAAA,YACA,WAAW,SAAS;AAAA,UAAA;AAAA,UAEtB,KAAK;AAAA,QAAA;AAAA,QAEP,IAAI;AAAA,QACJ;AAAA,MAAA;AAAA,IAEJ,UAAA;AACE,UAAI,OAAO;AACT,YAAI,cAAc;AAClB,YAAI,IAAI;AACR,eAAO,MAAM;AACX,gBAAM,SAAS,gBAAgB,UAAU;AAAA,YACvC;AAAA,YACA,gBAAgB;AAAA,YAChB;AAAA,UAAA;AAEF,cAAI,WAAW,QAAW;AACxB;AAAA,UACF;AACA,yBAAe,OAAO,MAAM;AAAA,QAC9B;AACA,YAAI,gBAAgB,GAAG;AACrB,gBAAM,aAAa,KAAK,QAAQ,eAAe,MAAM,WAAW;AAAA,QAClE;AACA,wBAAgB,UAAU,gBAAA;AAAA,MAC5B;AACA,WAAK,OAAO,MAAM,OAAO,eAAe;AAAA,IAC1C;AAAA,EACF;AAAA,EAEA,CAAC,oBACC,YACA,aACA,OACA,OACuB;AACvB,QAAI;AACJ,QAAI;AACF,SAAG;AACD,iBAAS;AAAA,UACP,KAAK;AAAA,UACL,EAAE;AAAA,UACF,KAAK,WAAW;AAAA,UAChB,MAAM,YAAY,KAAA;AAAA,UAClB,KAAK,WAAW;AAAA,UAChB,MACE,uCAAuC,KAAK;AAAA,QAAA;AAEhD,YAAI,OAAO,MAAM;AACf;AAAA,QACF;AACA,cAAM,MAAM,gBAAgB,YAAY,OAAO,OAAO,KAAK,MAAM;AACjE,eAAO,UAAU,KAAK,QAAQ,OAAO,GAAG;AACxC,cAAM;AAAA,MACR,SAAS,CAAC,OAAO;AAAA,IACnB,UAAA;AACE,kBAAY,SAAA;AAAA,IACd;AAAA,EACF;AAAA,EAEA,KAAK,QAA4B;AAC/B,eAAW,KAAK,KAAK,QAAQ,MAAM,GAAG;AAAA,IAEtC;AAAA,EACF;AAAA,EAEA,CAAC,QAAQ,QAAsB;AAC7B,UAAM,SAAS,CAAC,QACd,KAAK,OAAO,YAAY;AAAA,MACtB,GAAG,cAAc,KAAK,aAAa,KAAK,KAAK,QAAQ;AAAA,IAAA,GACpD,WAAW;AAChB,UAAM,aAAa,CAAC,MAA4B,KAAK,WAAW;AAChE,UAAM,cAAc,CAAC,MAAoB,KAAK,aAAa,CAAC;AAE5D,WAAO;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAM,EAAE,KAAK;AAAA,IAAA;AAAA,EAEjB;AAAA,EAEA,aAAa,QAAsB;AACjC,YAAQ,OAAO,MAAA;AAAA,MACb,KAAK;AACH,aAAK,OAAO,OAAO;AAAA,UACjB,GAAG;AAAA,YACD,OAAO,KAAK,KAAK,QAAQ;AAAA,YACzB,OAAO;AAAA,YACP,KAAK;AAAA,UAAA;AAAA,QACP;AAEF;AAAA,MACF,KAAK;AACH,aAAK,OAAO,OAAO;AAAA,UACjB,GAAG,cAAc,KAAK,aAAa,OAAO,KAAK,KAAK,QAAQ;AAAA,QAAA;AAE9D;AAAA,MACF,KAAK,QAAQ;AAEX,YACE;AAAA,UACE,OAAO;AAAA,UACP,OAAO;AAAA,UACP,KAAK;AAAA,UACL,KAAK;AAAA,QAAA,GAEP;AACA,gBAAM,YAAY;AAAA,YAChB,GAAG,OAAO;AAAA,YACV,GAAG,OAAO;AAAA,UAAA;AAEZ,gBAAM,SAAS;AAAA,YACb,GAAG,iBAAiB,KAAK,UAAU,KAAK,aAAa,SAAS;AAAA,YAC9D,GAAG,cAAc,KAAK,aAAa,WAAW,KAAK,QAAQ;AAAA,UAAA;AAE7D,eAAK,KAAK,OAAO,MAAM,EAAE,IAAI,MAAM;AAAA,QACrC,OAAO;AACL,eAAK,OAAO,OAAO;AAAA,YACjB,GAAG,cAAc,KAAK,aAAa,OAAO,QAAQ,KAAK,QAAQ;AAAA,UAAA;AAEjE,eAAK,OAAO,OAAO;AAAA,YACjB,GAAG;AAAA,cACD,OAAO,KAAK,KAAK,QAAQ;AAAA,cACzB,OAAO;AAAA,cACP,KAAK;AAAA,YAAA;AAAA,UACP;AAAA,QAEJ;AAEA;AAAA,MACF;AAAA,MACA;AACE,oBAAkB;AAAA,IAAA;AAAA,EAExB;AAAA,EAEA,uCAAuB,IAAA;AAAA,EAEvB,YAAY,SAA2B;AACrC,UAAM,YAAY,KAAK,UAAU,OAAO;AACxC,QAAI,OAAO,KAAK,iBAAiB,IAAI,SAAS;AAC9C,QAAI,CAAC,MAAM;AACT,aAAO;AAAA,QACL,aAAa,KAAK,WAAW,SAAS,IAAI;AAAA,UACxC,KAAK;AAAA,QAAA,CACN,UAAU,IAAI;AAAA,UACb,QAAQ,IAAI,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC,IAAI;AAAA,UACvC;AAAA,QAAA,CACD;AAAA,MAAA;AAEH,WAAK,iBAAiB,IAAI,WAAW,IAAI;AAAA,IAC3C;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,QAA8B;AACnC,UAAM,UAAU,OAAO,KAAK,MAAM;AAClC,UAAM,UAAU,OAAO,OAAO,MAAM;AAEpC,UAAM,OAAO,KAAK,YAAY,OAAO;AACrC,UAAM,MAAM,KAAK,OAAO,MAAM;AAAA,MAAI;AAAA,MAAM,YACtC,OAAO,UAAU,aAAa,IAAI,EAAE,IAAS,OAAO;AAAA,IAAA;AAEtD,QAAI,KAAK;AACP,aAAO,gBAAgB,KAAK,UAAU,KAAK,KAAK,MAAM;AAAA,IACxD;AACA,WAAO;AAAA,EACT;AAAA,EAEA,cACE,SACA,SACA,OACU;AACV,WAAO;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ;AAAA,IAAA;AAAA,EAEZ;AACF;AAEA,SAAS,iBACP,IACA,WAC0B;AAC1B,QAAM,iBAAiB;AAAA,IACrB;AAAA;AAAA;AAAA;AAAA;AAAA,6BAKyB,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA;AAMpC,QAAM,OAAO,GAAG,QAAQ,eAAe,IAAI;AAC3C,QAAM,UAAU,KAAK,IAA2B,GAAG,eAAe,MAAM;AACxE,SAAO,IAAI;AAAA,IACT,QAAQ,IAAI,CAAC,EAAC,kBAAiB;AAC7B,YAAM,UAAU,KAAK,MAAM,WAAW;AACtC,YAAM,MAAM,IAAI,IAAY,OAAO;AACnC,aAAO,CAAC,KAAK,UAAU,QAAQ,KAAA,CAAM,GAAG,GAAG;AAAA,IAC7C,CAAC;AAAA,EAAA;AAEL;AAEO,SAAS,cACd,SACA,KACA,aACoB;AACpB,SAAO,QAAQ,IAAI,CAAA,QAAO,aAAa,IAAI,GAAG,GAAG,YAAY,GAAG,EAAE,IAAI,CAAC;AACzE;AAiBO,SAAS,gBACd,YACA,KACA,WACK;AACL,QAAM,SAAwB,CAAA;AAC9B,aAAW,OAAO,OAAO,KAAK,GAAG,GAAG;AAClC,UAAM,YAAY,WAAW,GAAG;AAChC,QAAI,cAAc,QAAW;AAC3B,YAAM,aAAa,OAAO,KAAK,UAAU,EAAE,KAAA,EAAO,KAAK,IAAI;AAC3D,YAAM,IAAI;AAAA,QACR,mBAAmB,GAAG,gBAAgB,SAAS,6BAA6B,UAAU;AAAA,MAAA;AAAA,IAE1F;AACA,WAAO,GAAG,IAAI,eAAe,UAAU,MAAM,IAAI,GAAG,GAAG,KAAK,SAAS;AAAA,EACvE;AACA,SAAO;AACT;AAEA,SAAS,eACP,WACA,GACA,QACA,WACO;AACP,MAAI,MAAM,MAAM;AACd,WAAO;AAAA,EACT;AACA,UAAQ,WAAA;AAAA,IACN,KAAK;AACH,aAAO,CAAC,CAAC;AAAA,IACX,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,UAAI,OAAO,MAAM,UAAU;AACzB,YAAI,IAAI,OAAO,oBAAoB,IAAI,OAAO,kBAAkB;AAC9D,gBAAM,IAAI;AAAA,YACR,SAAS,CAAC,QAAQ,SAAS,IAAI,MAAM;AAAA,UAAA;AAAA,QAEzC;AACA,eAAO,OAAO,CAAC;AAAA,MACjB;AACA,aAAO;AAAA,IACT,KAAK;AACH,UAAI;AACF,eAAO,KAAK,MAAM,CAAW;AAAA,MAC/B,SAAS,OAAO;AACd,cAAM,eACJ,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACvD,cAAM,IAAI;AAAA,UACR,4BAA4B,SAAS,IAAI,MAAM,KAAK,YAAY;AAAA,UAChE,EAAC,OAAO,MAAA;AAAA,QAAK;AAAA,MAEjB;AAAA,EAAA;AAEN;AAEO,MAAM,8BAA8B,MAAM;AAAC;AAElD,SAAS,aACP,QACA,KACA,SACA,YACS;AACT,aAAW,MAAM,YAAY;AAC3B,QAAI,OAAO,EAAE,MAAM,IAAI,EAAE,GAAG;AAC1B,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO,OAAO,KAAK,OAAO,EAAE,SAAS,WAAW;AAClD;AAEA,SAAS,iBACP,SACA,YACA,KACmB;AACnB,SAAO,eAAe,SAAS,UAAU,EAAE;AAAA,IAAI,CAAA,MAC7C,aAAa,IAAI,CAAC,GAAG,QAAQ,CAAC,EAAE,IAAI;AAAA,EAAA;AAExC;AAEA,SAAS,eACP,SACA,YACA;AACA,SAAO,OAAO,KAAK,OAAO,EAAE,OAAO,OAAK,CAAC,WAAW,SAAS,CAAC,CAAC;AACjE;AAEA,UAAU,mBAAmB,QAAsB,aAA4B;AAC7E,aAAW,KAAK,QAAQ;AACtB,QAAI,eAAe;AACjB,YAAM;AAAA,IACR;AACA,UAAM;AAAA,EACR;AACF;"}
+{"version":3,"file":"table-source.js","sources":["../../../../zqlite/src/table-source.ts"],"sourcesContent":["import type {SQLQuery} from '@databases/sql';\nimport type {LogContext} from '@rocicorp/logger';\nimport SQLite3Database from '@rocicorp/zero-sqlite3';\nimport type {LogConfig} from '../../otel/src/log-options.ts';\nimport {timeSampled} from '../../otel/src/maybe-time.ts';\nimport {assert, unreachable} from '../../shared/src/asserts.ts';\nimport {must} from '../../shared/src/must.ts';\nimport type {Writable} from '../../shared/src/writable.ts';\nimport type {Condition, Ordering} from '../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../zero-protocol/src/primary-key.ts';\nimport type {\n  SchemaValue,\n  ValueType,\n} from '../../zero-schema/src/table-schema.ts';\nimport type {DebugDelegate} from '../../zql/src/builder/debug-delegate.ts';\nimport {\n  createPredicate,\n  transformFilters,\n} from '../../zql/src/builder/filter.ts';\nimport {makeComparator, type Node} from '../../zql/src/ivm/data.ts';\nimport {\n  generateWithOverlay,\n  generateWithStart,\n  genPushAndWriteWithSplitEdit,\n  type Connection,\n  type Overlay,\n} from '../../zql/src/ivm/memory-source.ts';\nimport {type FetchRequest} from '../../zql/src/ivm/operator.ts';\nimport type {SourceSchema} from '../../zql/src/ivm/schema.ts';\nimport {\n  type Source,\n  type SourceChange,\n  type SourceInput,\n} from '../../zql/src/ivm/source.ts';\nimport type {Stream} from '../../zql/src/ivm/stream.ts';\nimport type {Database, Statement} from './db.ts';\nimport {compile, format, sql} from './internal/sql.ts';\nimport {StatementCache} from './internal/statement-cache.ts';\nimport {\n  buildSelectQuery,\n  toSQLiteType,\n  type NoSubqueryCondition,\n} from './query-builder.ts';\nimport {assertOrderingIncludesPK} from '../../zql/src/query/complete-ordering.ts';\n\ntype Statements = {\n  readonly cache: StatementCache;\n  readonly insert: Statement;\n  readonly delete: Statement;\n  readonly update: Statement | undefined;\n  readonly checkExists: Statement;\n  readonly getExisting: Statement;\n};\n\nlet eventCount = 0;\n\n/**\n * A source that is backed by a SQLite table.\n *\n * Values are written to the backing table _after_ being vended by the source.\n *\n * This ordering of events is to ensure self joins function properly. That is,\n * we can't reveal a value to an output before it has been pushed to that output.\n *\n * The code is fairly straightforward except for:\n * 1. Dealing with a `fetch` that has a basis of `before`.\n * 2. Dealing with compound orders that have differing directions (a ASC, b DESC, c ASC)\n *\n * See comments in relevant functions for more details.\n */\nexport class TableSource implements Source {\n  readonly #dbCache = new WeakMap<Database, Statements>();\n  readonly #connections: Connection[] = [];\n  readonly #table: string;\n  readonly #columns: Record<string, SchemaValue>;\n  // Maps sorted columns JSON string (e.g. '[\"a\",\"b\"]) to Set of columns.\n  readonly #uniqueIndexes: Map<string, Set<string>>;\n  readonly #primaryKey: PrimaryKey;\n  readonly #logConfig: LogConfig;\n  readonly #lc: LogContext;\n  readonly #shouldYield: () => boolean;\n  #stmts: Statements;\n  #overlay?: Overlay | undefined;\n  #pushEpoch = 0;\n\n  /**\n   * @param shouldYield a function called after each row is read from the database,\n   * which should return true if the source should yield the special 'yield' value\n   * to yield control back to the caller at the end of the pipeline.  Can\n   * also throw an error to abort the pipeline processing.\n   */\n  constructor(\n    logContext: LogContext,\n    logConfig: LogConfig,\n    db: Database,\n    tableName: string,\n    columns: Record<string, SchemaValue>,\n    primaryKey: PrimaryKey,\n    shouldYield = () => false,\n  ) {\n    this.#lc = logContext;\n    this.#logConfig = logConfig;\n    this.#table = tableName;\n    this.#columns = columns;\n    this.#uniqueIndexes = getUniqueIndexes(db, tableName);\n    this.#primaryKey = primaryKey;\n    this.#stmts = this.#getStatementsFor(db);\n    this.#shouldYield = shouldYield;\n\n    assert(\n      this.#uniqueIndexes.has(JSON.stringify([...primaryKey].sort())),\n      `primary key ${primaryKey} does not have a UNIQUE index`,\n    );\n  }\n\n  get tableSchema() {\n    return {\n      name: this.#table,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n    };\n  }\n\n  /**\n   * Sets the db (snapshot) to use, to facilitate the Snapshotter leapfrog\n   * algorithm for concurrent traversal of historic timelines.\n   */\n  setDB(db: Database) {\n    this.#stmts = this.#getStatementsFor(db);\n  }\n\n  #getStatementsFor(db: Database) {\n    const cached = this.#dbCache.get(db);\n    if (cached) {\n      return cached;\n    }\n\n    const stmts = {\n      cache: new StatementCache(db),\n      insert: db.prepare(\n        compile(\n          sql`INSERT INTO ${sql.ident(this.#table)} (${sql.join(\n            Object.keys(this.#columns).map(c => sql.ident(c)),\n            ', ',\n          )}) VALUES (${sql.__dangerous__rawValue(\n            Array.from({length: Object.keys(this.#columns).length})\n              .fill('?')\n              .join(','),\n          )})`,\n        ),\n      ),\n      delete: db.prepare(\n        compile(\n          sql`DELETE FROM ${sql.ident(this.#table)} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )}`,\n        ),\n      ),\n      // If all the columns are part of the primary key, we cannot use UPDATE.\n      update:\n        Object.keys(this.#columns).length > this.#primaryKey.length\n          ? db.prepare(\n              compile(\n                sql`UPDATE ${sql.ident(this.#table)} SET ${sql.join(\n                  nonPrimaryKeys(this.#columns, this.#primaryKey).map(\n                    c => sql`${sql.ident(c)}=?`,\n                  ),\n                  ',',\n                )} WHERE ${sql.join(\n                  this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n                  ' AND ',\n                )}`,\n              ),\n            )\n          : undefined,\n      checkExists: db.prepare(\n        compile(\n          sql`SELECT 1 AS \"exists\" FROM ${sql.ident(\n            this.#table,\n          )} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )} LIMIT 1`,\n        ),\n      ),\n      getExisting: db.prepare(\n        compile(\n          sql`SELECT * FROM ${sql.ident(this.#table)} WHERE ${sql.join(\n            this.#primaryKey.map(k => sql`${sql.ident(k)}=?`),\n            ' AND ',\n          )}`,\n        ),\n      ),\n    };\n    this.#dbCache.set(db, stmts);\n    return stmts;\n  }\n\n  get #allColumns() {\n    return sql.join(\n      Object.keys(this.#columns).map(c => sql.ident(c)),\n      sql`,`,\n    );\n  }\n\n  #getSchema(connection: Connection): SourceSchema {\n    return {\n      tableName: this.#table,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n      sort: connection.sort,\n      relationships: {},\n      isHidden: false,\n      system: 'client',\n      compareRows: connection.compareRows,\n    };\n  }\n\n  connect(\n    sort: Ordering,\n    filters?: Condition,\n    splitEditKeys?: Set<string>,\n    debug?: DebugDelegate,\n  ) {\n    const transformedFilters = transformFilters(filters);\n    const input: SourceInput = {\n      getSchema: () => schema,\n      fetch: req => this.#fetch(req, connection),\n      setOutput: output => {\n        connection.output = output;\n      },\n      destroy: () => {\n        const idx = this.#connections.indexOf(connection);\n        assert(idx !== -1, 'Connection not found');\n        this.#connections.splice(idx, 1);\n      },\n      fullyAppliedFilters: !transformedFilters.conditionsRemoved,\n    };\n\n    const connection: Connection = {\n      input,\n      debug,\n      output: undefined,\n      sort,\n      splitEditKeys,\n      filters: transformedFilters.filters\n        ? {\n            condition: transformedFilters.filters,\n            predicate: createPredicate(transformedFilters.filters),\n          }\n        : undefined,\n      compareRows: makeComparator(sort),\n      lastPushedEpoch: 0,\n    };\n    const schema = this.#getSchema(connection);\n    assertOrderingIncludesPK(sort, this.#primaryKey);\n\n    this.#connections.push(connection);\n    return input;\n  }\n\n  toSQLiteRow(row: Row): Row {\n    return Object.fromEntries(\n      Object.entries(row).map(([key, value]) => [\n        key,\n        toSQLiteType(value, this.#columns[key].type),\n      ]),\n    ) as Row;\n  }\n\n  *#fetch(req: FetchRequest, connection: Connection): Stream<Node | 'yield'> {\n    const {sort, debug} = connection;\n\n    const query = this.#requestToSQL(req, connection.filters?.condition, sort);\n    const sqlAndBindings = format(query);\n\n    const cachedStatement = this.#stmts.cache.get(sqlAndBindings.text);\n    try {\n      cachedStatement.statement.safeIntegers(true);\n      const rowIterator = cachedStatement.statement.iterate<Row>(\n        ...sqlAndBindings.values,\n      );\n\n      const comparator = makeComparator(sort, req.reverse);\n\n      debug?.initQuery(this.#table, sqlAndBindings.text);\n\n      yield* generateWithStart(\n        generateWithYields(\n          generateWithOverlay(\n            req.start?.row,\n            this.#mapFromSQLiteTypes(\n              this.#columns,\n              rowIterator,\n              sqlAndBindings.text,\n              debug,\n            ),\n            req.constraint,\n            this.#overlay,\n            connection.lastPushedEpoch,\n            comparator,\n            connection.filters?.predicate,\n          ),\n          this.#shouldYield,\n        ),\n        req.start,\n        comparator,\n      );\n    } finally {\n      if (debug) {\n        let totalNvisit = 0;\n        let i = 0;\n        while (true) {\n          const nvisit = cachedStatement.statement.scanStatus(\n            i++,\n            SQLite3Database.SQLITE_SCANSTAT_NVISIT,\n            1,\n          );\n          if (nvisit === undefined) {\n            break;\n          }\n          totalNvisit += Number(nvisit);\n        }\n        if (totalNvisit !== 0) {\n          debug.recordNVisit(this.#table, sqlAndBindings.text, totalNvisit);\n        }\n        cachedStatement.statement.scanStatusReset();\n      }\n      this.#stmts.cache.return(cachedStatement);\n    }\n  }\n\n  *#mapFromSQLiteTypes(\n    valueTypes: Record<string, SchemaValue>,\n    rowIterator: IterableIterator<Row>,\n    query: string,\n    debug: DebugDelegate | undefined,\n  ): IterableIterator<Row> {\n    let result;\n    try {\n      do {\n        result = timeSampled(\n          this.#lc,\n          ++eventCount,\n          this.#logConfig.ivmSampling,\n          () => rowIterator.next(),\n          this.#logConfig.slowRowThreshold,\n          () =>\n            `table-source.next took too long for ${query}. Are you missing an index?`,\n        );\n        if (result.done) {\n          break;\n        }\n        const row = fromSQLiteTypes(valueTypes, result.value, this.#table);\n        debug?.rowVended(this.#table, query, row);\n        yield row;\n      } while (!result.done);\n    } finally {\n      rowIterator.return?.();\n    }\n  }\n\n  *push(change: SourceChange): Stream<'yield'> {\n    for (const result of this.genPush(change)) {\n      if (result === 'yield') {\n        yield result;\n      }\n    }\n  }\n\n  *genPush(change: SourceChange) {\n    const exists = (row: Row) =>\n      this.#stmts.checkExists.get<{exists: number} | undefined>(\n        ...toSQLiteTypes(this.#primaryKey, row, this.#columns),\n      )?.exists === 1;\n    const setOverlay = (o: Overlay | undefined) => (this.#overlay = o);\n    const writeChange = (c: SourceChange) => this.#writeChange(c);\n\n    yield* genPushAndWriteWithSplitEdit(\n      this.#connections,\n      change,\n      exists,\n      setOverlay,\n      writeChange,\n      () => ++this.#pushEpoch,\n    );\n  }\n\n  #writeChange(change: SourceChange) {\n    switch (change.type) {\n      case 'add':\n        this.#stmts.insert.run(\n          ...toSQLiteTypes(\n            Object.keys(this.#columns),\n            change.row,\n            this.#columns,\n          ),\n        );\n        break;\n      case 'remove':\n        this.#stmts.delete.run(\n          ...toSQLiteTypes(this.#primaryKey, change.row, this.#columns),\n        );\n        break;\n      case 'edit': {\n        // If the PK is the same, use UPDATE.\n        if (\n          canUseUpdate(\n            change.oldRow,\n            change.row,\n            this.#columns,\n            this.#primaryKey,\n          )\n        ) {\n          const mergedRow = {\n            ...change.oldRow,\n            ...change.row,\n          };\n          const params = [\n            ...nonPrimaryValues(this.#columns, this.#primaryKey, mergedRow),\n            ...toSQLiteTypes(this.#primaryKey, mergedRow, this.#columns),\n          ];\n          must(this.#stmts.update).run(params);\n        } else {\n          this.#stmts.delete.run(\n            ...toSQLiteTypes(this.#primaryKey, change.oldRow, this.#columns),\n          );\n          this.#stmts.insert.run(\n            ...toSQLiteTypes(\n              Object.keys(this.#columns),\n              change.row,\n              this.#columns,\n            ),\n          );\n        }\n\n        break;\n      }\n      default:\n        unreachable(change);\n    }\n  }\n\n  #getRowStmtCache = new Map<string, string>();\n\n  #getRowStmt(keyCols: string[]): string {\n    const keyString = JSON.stringify(keyCols);\n    let stmt = this.#getRowStmtCache.get(keyString);\n    if (!stmt) {\n      stmt = compile(\n        sql`SELECT ${this.#allColumns} FROM ${sql.ident(\n          this.#table,\n        )} WHERE ${sql.join(\n          keyCols.map(k => sql`${sql.ident(k)}=?`),\n          sql` AND`,\n        )}`,\n      );\n      this.#getRowStmtCache.set(keyString, stmt);\n    }\n    return stmt;\n  }\n\n  /**\n   * Retrieves a row from the backing DB by a unique key, or `undefined` if such a\n   * row does not exist. This is not used in the IVM pipeline but is useful\n   * for retrieving data that is consistent with the state (and type\n   * semantics) of the pipeline. Note that this key may not necessarily correspond\n   * to the `primaryKey` with which this TableSource.\n   */\n  getRow(rowKey: Row): Row | undefined {\n    const keyCols = Object.keys(rowKey);\n    const keyVals = Object.values(rowKey);\n\n    const stmt = this.#getRowStmt(keyCols);\n    const row = this.#stmts.cache.use(stmt, cached =>\n      cached.statement.safeIntegers(true).get<Row>(keyVals),\n    );\n    if (row) {\n      return fromSQLiteTypes(this.#columns, row, this.#table);\n    }\n    return row;\n  }\n\n  #requestToSQL(\n    request: FetchRequest,\n    filters: NoSubqueryCondition | undefined,\n    order: Ordering,\n  ): SQLQuery {\n    return buildSelectQuery(\n      this.#table,\n      this.#columns,\n      request.constraint,\n      filters,\n      order,\n      request.reverse,\n      request.start,\n    );\n  }\n}\n\nfunction getUniqueIndexes(\n  db: Database,\n  tableName: string,\n): Map<string, Set<string>> {\n  const sqlAndBindings = format(\n    sql`\n    SELECT idx.name, json_group_array(col.name) as columnsJSON\n      FROM sqlite_master as idx\n      JOIN pragma_index_list(idx.tbl_name) AS info ON info.name = idx.name\n      JOIN pragma_index_info(idx.name) as col\n      WHERE idx.tbl_name = ${tableName} AND\n            idx.type = 'index' AND \n            info.\"unique\" != 0\n      GROUP BY idx.name\n      ORDER BY idx.name`,\n  );\n  const stmt = db.prepare(sqlAndBindings.text);\n  const indexes = stmt.all<{columnsJSON: string}>(...sqlAndBindings.values);\n  return new Map(\n    indexes.map(({columnsJSON}) => {\n      const columns = JSON.parse(columnsJSON);\n      const set = new Set<string>(columns);\n      return [JSON.stringify(columns.sort()), set];\n    }),\n  );\n}\n\nexport function toSQLiteTypes(\n  columns: readonly string[],\n  row: Row,\n  columnTypes: Record<string, SchemaValue>,\n): readonly unknown[] {\n  return columns.map(col => toSQLiteType(row[col], columnTypes[col].type));\n}\n\nexport function toSQLiteTypeName(type: ValueType) {\n  switch (type) {\n    case 'boolean':\n      return 'INTEGER';\n    case 'number':\n      return 'REAL';\n    case 'string':\n      return 'TEXT';\n    case 'null':\n      return 'NULL';\n    case 'json':\n      return 'TEXT';\n  }\n}\n\nexport function fromSQLiteTypes(\n  valueTypes: Record<string, SchemaValue>,\n  row: Row,\n  tableName: string,\n): Row {\n  const newRow: Writable<Row> = {};\n  for (const key of Object.keys(row)) {\n    const valueType = valueTypes[key];\n    if (valueType === undefined) {\n      const columnList = Object.keys(valueTypes).sort().join(', ');\n      throw new Error(\n        `Invalid column \"${key}\" for table \"${tableName}\". Synced columns include ${columnList}`,\n      );\n    }\n    newRow[key] = fromSQLiteType(valueType.type, row[key], key, tableName);\n  }\n  return newRow;\n}\n\nfunction fromSQLiteType(\n  valueType: ValueType,\n  v: Value,\n  column: string,\n  tableName: string,\n): Value {\n  if (v === null) {\n    return null;\n  }\n  switch (valueType) {\n    case 'boolean':\n      return !!v;\n    case 'number':\n    case 'string':\n    case 'null':\n      if (typeof v === 'bigint') {\n        if (v > Number.MAX_SAFE_INTEGER || v < Number.MIN_SAFE_INTEGER) {\n          throw new UnsupportedValueError(\n            `value ${v} (in ${tableName}.${column}) is outside of supported bounds`,\n          );\n        }\n        return Number(v);\n      }\n      return v;\n    case 'json':\n      try {\n        return JSON.parse(v as string);\n      } catch (error) {\n        const errorMessage =\n          error instanceof Error ? error.message : String(error);\n        throw new UnsupportedValueError(\n          `Failed to parse JSON for ${tableName}.${column}: ${errorMessage}`,\n          {cause: error},\n        );\n      }\n  }\n}\n\nexport class UnsupportedValueError extends Error {}\n\nfunction canUseUpdate(\n  oldRow: Row,\n  row: Row,\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n): boolean {\n  for (const pk of primaryKey) {\n    if (oldRow[pk] !== row[pk]) {\n      return false;\n    }\n  }\n  return Object.keys(columns).length > primaryKey.length;\n}\n\nfunction nonPrimaryValues(\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n  row: Row,\n): Iterable<unknown> {\n  return nonPrimaryKeys(columns, primaryKey).map(c =>\n    toSQLiteType(row[c], columns[c].type),\n  );\n}\n\nfunction nonPrimaryKeys(\n  columns: Record<string, SchemaValue>,\n  primaryKey: PrimaryKey,\n) {\n  return Object.keys(columns).filter(c => !primaryKey.includes(c));\n}\n\nfunction* generateWithYields(stream: Stream<Node>, shouldYield: () => boolean) {\n  for (const n of stream) {\n    if (shouldYield()) {\n      yield 'yield';\n    }\n    yield n;\n  }\n}\n"],"names":[],"mappings":";;;;;;;;;;;AAuDA,IAAI,aAAa;AAgBV,MAAM,YAA8B;AAAA,EAChC,+BAAe,QAAA;AAAA,EACf,eAA6B,CAAA;AAAA,EAC7B;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACT;AAAA,EACA;AAAA,EACA,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQb,YACE,YACA,WACA,IACA,WACA,SACA,YACA,cAAc,MAAM,OACpB;AACA,SAAK,MAAM;AACX,SAAK,aAAa;AAClB,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,iBAAiB,iBAAiB,IAAI,SAAS;AACpD,SAAK,cAAc;AACnB,SAAK,SAAS,KAAK,kBAAkB,EAAE;AACvC,SAAK,eAAe;AAEpB;AAAA,MACE,KAAK,eAAe,IAAI,KAAK,UAAU,CAAC,GAAG,UAAU,EAAE,KAAA,CAAM,CAAC;AAAA,MAC9D,eAAe,UAAU;AAAA,IAAA;AAAA,EAE7B;AAAA,EAEA,IAAI,cAAc;AAChB,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,SAAS,KAAK;AAAA,MACd,YAAY,KAAK;AAAA,IAAA;AAAA,EAErB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,IAAc;AAClB,SAAK,SAAS,KAAK,kBAAkB,EAAE;AAAA,EACzC;AAAA,EAEA,kBAAkB,IAAc;AAC9B,UAAM,SAAS,KAAK,SAAS,IAAI,EAAE;AACnC,QAAI,QAAQ;AACV,aAAO;AAAA,IACT;AAEA,UAAM,QAAQ;AAAA,MACZ,OAAO,IAAI,eAAe,EAAE;AAAA,MAC5B,QAAQ,GAAG;AAAA,QACT;AAAA,UACE,kBAAkB,IAAI,MAAM,KAAK,MAAM,CAAC,KAAK,IAAI;AAAA,YAC/C,OAAO,KAAK,KAAK,QAAQ,EAAE,IAAI,CAAA,MAAK,IAAI,MAAM,CAAC,CAAC;AAAA,YAChD;AAAA,UAAA,CACD,aAAa,IAAI;AAAA,YAChB,MAAM,KAAK,EAAC,QAAQ,OAAO,KAAK,KAAK,QAAQ,EAAE,OAAA,CAAO,EACnD,KAAK,GAAG,EACR,KAAK,GAAG;AAAA,UAAA,CACZ;AAAA,QAAA;AAAA,MACH;AAAA,MAEF,QAAQ,GAAG;AAAA,QACT;AAAA,UACE,kBAAkB,IAAI,MAAM,KAAK,MAAM,CAAC,UAAU,IAAI;AAAA,YACpD,KAAK,YAAY,IAAI,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC,IAAI;AAAA,YAChD;AAAA,UAAA,CACD;AAAA,QAAA;AAAA,MACH;AAAA;AAAA,MAGF,QACE,OAAO,KAAK,KAAK,QAAQ,EAAE,SAAS,KAAK,YAAY,SACjD,GAAG;AAAA,QACD;AAAA,UACE,aAAa,IAAI,MAAM,KAAK,MAAM,CAAC,QAAQ,IAAI;AAAA,YAC7C,eAAe,KAAK,UAAU,KAAK,WAAW,EAAE;AAAA,cAC9C,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC;AAAA,YAAA;AAAA,YAEzB;AAAA,UAAA,CACD,UAAU,IAAI;AAAA,YACb,KAAK,YAAY,IAAI,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC,IAAI;AAAA,YAChD;AAAA,UAAA,CACD;AAAA,QAAA;AAAA,MACH,IAEF;AAAA,MACN,aAAa,GAAG;AAAA,QACd;AAAA,UACE,gCAAgC,IAAI;AAAA,YAClC,KAAK;AAAA,UAAA,CACN,UAAU,IAAI;AAAA,YACb,KAAK,YAAY,IAAI,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC,IAAI;AAAA,YAChD;AAAA,UAAA,CACD;AAAA,QAAA;AAAA,MACH;AAAA,MAEF,aAAa,GAAG;AAAA,QACd;AAAA,UACE,oBAAoB,IAAI,MAAM,KAAK,MAAM,CAAC,UAAU,IAAI;AAAA,YACtD,KAAK,YAAY,IAAI,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC,IAAI;AAAA,YAChD;AAAA,UAAA,CACD;AAAA,QAAA;AAAA,MACH;AAAA,IACF;AAEF,SAAK,SAAS,IAAI,IAAI,KAAK;AAC3B,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,cAAc;AAChB,WAAO,IAAI;AAAA,MACT,OAAO,KAAK,KAAK,QAAQ,EAAE,IAAI,CAAA,MAAK,IAAI,MAAM,CAAC,CAAC;AAAA,MAChD;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEA,WAAW,YAAsC;AAC/C,WAAO;AAAA,MACL,WAAW,KAAK;AAAA,MAChB,SAAS,KAAK;AAAA,MACd,YAAY,KAAK;AAAA,MACjB,MAAM,WAAW;AAAA,MACjB,eAAe,CAAA;AAAA,MACf,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,aAAa,WAAW;AAAA,IAAA;AAAA,EAE5B;AAAA,EAEA,QACE,MACA,SACA,eACA,OACA;AACA,UAAM,qBAAqB,iBAAiB,OAAO;AACnD,UAAM,QAAqB;AAAA,MACzB,WAAW,MAAM;AAAA,MACjB,OAAO,CAAA,QAAO,KAAK,OAAO,KAAK,UAAU;AAAA,MACzC,WAAW,CAAA,WAAU;AACnB,mBAAW,SAAS;AAAA,MACtB;AAAA,MACA,SAAS,MAAM;AACb,cAAM,MAAM,KAAK,aAAa,QAAQ,UAAU;AAChD,eAAO,QAAQ,IAAI,sBAAsB;AACzC,aAAK,aAAa,OAAO,KAAK,CAAC;AAAA,MACjC;AAAA,MACA,qBAAqB,CAAC,mBAAmB;AAAA,IAAA;AAG3C,UAAM,aAAyB;AAAA,MAC7B;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,SAAS,mBAAmB,UACxB;AAAA,QACE,WAAW,mBAAmB;AAAA,QAC9B,WAAW,gBAAgB,mBAAmB,OAAO;AAAA,MAAA,IAEvD;AAAA,MACJ,aAAa,eAAe,IAAI;AAAA,MAChC,iBAAiB;AAAA,IAAA;AAEnB,UAAM,SAAS,KAAK,WAAW,UAAU;AACzC,6BAAyB,MAAM,KAAK,WAAW;AAE/C,SAAK,aAAa,KAAK,UAAU;AACjC,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,KAAe;AACzB,WAAO,OAAO;AAAA,MACZ,OAAO,QAAQ,GAAG,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;AAAA,QACxC;AAAA,QACA,aAAa,OAAO,KAAK,SAAS,GAAG,EAAE,IAAI;AAAA,MAAA,CAC5C;AAAA,IAAA;AAAA,EAEL;AAAA,EAEA,CAAC,OAAO,KAAmB,YAAgD;AACzE,UAAM,EAAC,MAAM,MAAA,IAAS;AAEtB,UAAM,QAAQ,KAAK,cAAc,KAAK,WAAW,SAAS,WAAW,IAAI;AACzE,UAAM,iBAAiB,OAAO,KAAK;AAEnC,UAAM,kBAAkB,KAAK,OAAO,MAAM,IAAI,eAAe,IAAI;AACjE,QAAI;AACF,sBAAgB,UAAU,aAAa,IAAI;AAC3C,YAAM,cAAc,gBAAgB,UAAU;AAAA,QAC5C,GAAG,eAAe;AAAA,MAAA;AAGpB,YAAM,aAAa,eAAe,MAAM,IAAI,OAAO;AAEnD,aAAO,UAAU,KAAK,QAAQ,eAAe,IAAI;AAEjD,aAAO;AAAA,QACL;AAAA,UACE;AAAA,YACE,IAAI,OAAO;AAAA,YACX,KAAK;AAAA,cACH,KAAK;AAAA,cACL;AAAA,cACA,eAAe;AAAA,cACf;AAAA,YAAA;AAAA,YAEF,IAAI;AAAA,YACJ,KAAK;AAAA,YACL,WAAW;AAAA,YACX;AAAA,YACA,WAAW,SAAS;AAAA,UAAA;AAAA,UAEtB,KAAK;AAAA,QAAA;AAAA,QAEP,IAAI;AAAA,QACJ;AAAA,MAAA;AAAA,IAEJ,UAAA;AACE,UAAI,OAAO;AACT,YAAI,cAAc;AAClB,YAAI,IAAI;AACR,eAAO,MAAM;AACX,gBAAM,SAAS,gBAAgB,UAAU;AAAA,YACvC;AAAA,YACA,gBAAgB;AAAA,YAChB;AAAA,UAAA;AAEF,cAAI,WAAW,QAAW;AACxB;AAAA,UACF;AACA,yBAAe,OAAO,MAAM;AAAA,QAC9B;AACA,YAAI,gBAAgB,GAAG;AACrB,gBAAM,aAAa,KAAK,QAAQ,eAAe,MAAM,WAAW;AAAA,QAClE;AACA,wBAAgB,UAAU,gBAAA;AAAA,MAC5B;AACA,WAAK,OAAO,MAAM,OAAO,eAAe;AAAA,IAC1C;AAAA,EACF;AAAA,EAEA,CAAC,oBACC,YACA,aACA,OACA,OACuB;AACvB,QAAI;AACJ,QAAI;AACF,SAAG;AACD,iBAAS;AAAA,UACP,KAAK;AAAA,UACL,EAAE;AAAA,UACF,KAAK,WAAW;AAAA,UAChB,MAAM,YAAY,KAAA;AAAA,UAClB,KAAK,WAAW;AAAA,UAChB,MACE,uCAAuC,KAAK;AAAA,QAAA;AAEhD,YAAI,OAAO,MAAM;AACf;AAAA,QACF;AACA,cAAM,MAAM,gBAAgB,YAAY,OAAO,OAAO,KAAK,MAAM;AACjE,eAAO,UAAU,KAAK,QAAQ,OAAO,GAAG;AACxC,cAAM;AAAA,MACR,SAAS,CAAC,OAAO;AAAA,IACnB,UAAA;AACE,kBAAY,SAAA;AAAA,IACd;AAAA,EACF;AAAA,EAEA,CAAC,KAAK,QAAuC;AAC3C,eAAW,UAAU,KAAK,QAAQ,MAAM,GAAG;AACzC,UAAI,WAAW,SAAS;AACtB,cAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,CAAC,QAAQ,QAAsB;AAC7B,UAAM,SAAS,CAAC,QACd,KAAK,OAAO,YAAY;AAAA,MACtB,GAAG,cAAc,KAAK,aAAa,KAAK,KAAK,QAAQ;AAAA,IAAA,GACpD,WAAW;AAChB,UAAM,aAAa,CAAC,MAA4B,KAAK,WAAW;AAChE,UAAM,cAAc,CAAC,MAAoB,KAAK,aAAa,CAAC;AAE5D,WAAO;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAM,EAAE,KAAK;AAAA,IAAA;AAAA,EAEjB;AAAA,EAEA,aAAa,QAAsB;AACjC,YAAQ,OAAO,MAAA;AAAA,MACb,KAAK;AACH,aAAK,OAAO,OAAO;AAAA,UACjB,GAAG;AAAA,YACD,OAAO,KAAK,KAAK,QAAQ;AAAA,YACzB,OAAO;AAAA,YACP,KAAK;AAAA,UAAA;AAAA,QACP;AAEF;AAAA,MACF,KAAK;AACH,aAAK,OAAO,OAAO;AAAA,UACjB,GAAG,cAAc,KAAK,aAAa,OAAO,KAAK,KAAK,QAAQ;AAAA,QAAA;AAE9D;AAAA,MACF,KAAK,QAAQ;AAEX,YACE;AAAA,UACE,OAAO;AAAA,UACP,OAAO;AAAA,UACP,KAAK;AAAA,UACL,KAAK;AAAA,QAAA,GAEP;AACA,gBAAM,YAAY;AAAA,YAChB,GAAG,OAAO;AAAA,YACV,GAAG,OAAO;AAAA,UAAA;AAEZ,gBAAM,SAAS;AAAA,YACb,GAAG,iBAAiB,KAAK,UAAU,KAAK,aAAa,SAAS;AAAA,YAC9D,GAAG,cAAc,KAAK,aAAa,WAAW,KAAK,QAAQ;AAAA,UAAA;AAE7D,eAAK,KAAK,OAAO,MAAM,EAAE,IAAI,MAAM;AAAA,QACrC,OAAO;AACL,eAAK,OAAO,OAAO;AAAA,YACjB,GAAG,cAAc,KAAK,aAAa,OAAO,QAAQ,KAAK,QAAQ;AAAA,UAAA;AAEjE,eAAK,OAAO,OAAO;AAAA,YACjB,GAAG;AAAA,cACD,OAAO,KAAK,KAAK,QAAQ;AAAA,cACzB,OAAO;AAAA,cACP,KAAK;AAAA,YAAA;AAAA,UACP;AAAA,QAEJ;AAEA;AAAA,MACF;AAAA,MACA;AACE,oBAAkB;AAAA,IAAA;AAAA,EAExB;AAAA,EAEA,uCAAuB,IAAA;AAAA,EAEvB,YAAY,SAA2B;AACrC,UAAM,YAAY,KAAK,UAAU,OAAO;AACxC,QAAI,OAAO,KAAK,iBAAiB,IAAI,SAAS;AAC9C,QAAI,CAAC,MAAM;AACT,aAAO;AAAA,QACL,aAAa,KAAK,WAAW,SAAS,IAAI;AAAA,UACxC,KAAK;AAAA,QAAA,CACN,UAAU,IAAI;AAAA,UACb,QAAQ,IAAI,CAAA,MAAK,MAAM,IAAI,MAAM,CAAC,CAAC,IAAI;AAAA,UACvC;AAAA,QAAA,CACD;AAAA,MAAA;AAEH,WAAK,iBAAiB,IAAI,WAAW,IAAI;AAAA,IAC3C;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,QAA8B;AACnC,UAAM,UAAU,OAAO,KAAK,MAAM;AAClC,UAAM,UAAU,OAAO,OAAO,MAAM;AAEpC,UAAM,OAAO,KAAK,YAAY,OAAO;AACrC,UAAM,MAAM,KAAK,OAAO,MAAM;AAAA,MAAI;AAAA,MAAM,YACtC,OAAO,UAAU,aAAa,IAAI,EAAE,IAAS,OAAO;AAAA,IAAA;AAEtD,QAAI,KAAK;AACP,aAAO,gBAAgB,KAAK,UAAU,KAAK,KAAK,MAAM;AAAA,IACxD;AACA,WAAO;AAAA,EACT;AAAA,EAEA,cACE,SACA,SACA,OACU;AACV,WAAO;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ;AAAA,IAAA;AAAA,EAEZ;AACF;AAEA,SAAS,iBACP,IACA,WAC0B;AAC1B,QAAM,iBAAiB;AAAA,IACrB;AAAA;AAAA;AAAA;AAAA;AAAA,6BAKyB,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAAA;AAMpC,QAAM,OAAO,GAAG,QAAQ,eAAe,IAAI;AAC3C,QAAM,UAAU,KAAK,IAA2B,GAAG,eAAe,MAAM;AACxE,SAAO,IAAI;AAAA,IACT,QAAQ,IAAI,CAAC,EAAC,kBAAiB;AAC7B,YAAM,UAAU,KAAK,MAAM,WAAW;AACtC,YAAM,MAAM,IAAI,IAAY,OAAO;AACnC,aAAO,CAAC,KAAK,UAAU,QAAQ,KAAA,CAAM,GAAG,GAAG;AAAA,IAC7C,CAAC;AAAA,EAAA;AAEL;AAEO,SAAS,cACd,SACA,KACA,aACoB;AACpB,SAAO,QAAQ,IAAI,CAAA,QAAO,aAAa,IAAI,GAAG,GAAG,YAAY,GAAG,EAAE,IAAI,CAAC;AACzE;AAiBO,SAAS,gBACd,YACA,KACA,WACK;AACL,QAAM,SAAwB,CAAA;AAC9B,aAAW,OAAO,OAAO,KAAK,GAAG,GAAG;AAClC,UAAM,YAAY,WAAW,GAAG;AAChC,QAAI,cAAc,QAAW;AAC3B,YAAM,aAAa,OAAO,KAAK,UAAU,EAAE,KAAA,EAAO,KAAK,IAAI;AAC3D,YAAM,IAAI;AAAA,QACR,mBAAmB,GAAG,gBAAgB,SAAS,6BAA6B,UAAU;AAAA,MAAA;AAAA,IAE1F;AACA,WAAO,GAAG,IAAI,eAAe,UAAU,MAAM,IAAI,GAAG,GAAG,KAAK,SAAS;AAAA,EACvE;AACA,SAAO;AACT;AAEA,SAAS,eACP,WACA,GACA,QACA,WACO;AACP,MAAI,MAAM,MAAM;AACd,WAAO;AAAA,EACT;AACA,UAAQ,WAAA;AAAA,IACN,KAAK;AACH,aAAO,CAAC,CAAC;AAAA,IACX,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,UAAI,OAAO,MAAM,UAAU;AACzB,YAAI,IAAI,OAAO,oBAAoB,IAAI,OAAO,kBAAkB;AAC9D,gBAAM,IAAI;AAAA,YACR,SAAS,CAAC,QAAQ,SAAS,IAAI,MAAM;AAAA,UAAA;AAAA,QAEzC;AACA,eAAO,OAAO,CAAC;AAAA,MACjB;AACA,aAAO;AAAA,IACT,KAAK;AACH,UAAI;AACF,eAAO,KAAK,MAAM,CAAW;AAAA,MAC/B,SAAS,OAAO;AACd,cAAM,eACJ,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACvD,cAAM,IAAI;AAAA,UACR,4BAA4B,SAAS,IAAI,MAAM,KAAK,YAAY;AAAA,UAChE,EAAC,OAAO,MAAA;AAAA,QAAK;AAAA,MAEjB;AAAA,EAAA;AAEN;AAEO,MAAM,8BAA8B,MAAM;AAAC;AAElD,SAAS,aACP,QACA,KACA,SACA,YACS;AACT,aAAW,MAAM,YAAY;AAC3B,QAAI,OAAO,EAAE,MAAM,IAAI,EAAE,GAAG;AAC1B,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO,OAAO,KAAK,OAAO,EAAE,SAAS,WAAW;AAClD;AAEA,SAAS,iBACP,SACA,YACA,KACmB;AACnB,SAAO,eAAe,SAAS,UAAU,EAAE;AAAA,IAAI,CAAA,MAC7C,aAAa,IAAI,CAAC,GAAG,QAAQ,CAAC,EAAE,IAAI;AAAA,EAAA;AAExC;AAEA,SAAS,eACP,SACA,YACA;AACA,SAAO,OAAO,KAAK,OAAO,EAAE,OAAO,OAAK,CAAC,WAAW,SAAS,CAAC,CAAC;AACjE;AAEA,UAAU,mBAAmB,QAAsB,aAA4B;AAC7E,aAAW,KAAK,QAAQ;AACtB,QAAI,eAAe;AACjB,YAAM;AAAA,IACR;AACA,UAAM;AAAA,EACR;AACF;"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@rocicorp/zero",
-  "version": "0.25.0-canary.14",
+  "version": "0.25.0-canary.15",
   "description": "Zero is a web framework for serverless web development.",
   "author": "Rocicorp, Inc.",
   "repository": {