@rocicorp/zero 1.6.0-canary.1 → 1.6.0-canary.11

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

@@ -1 +1 @@
-{"version":3,"file":"planner-join.js","names":["#parent","#child","#parentConstraint","#childConstraint","#flippable","#initialType","#type","#output"],"sources":["../../../../../zql/src/planner/planner-join.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {\n  mergeConstraints,\n  type PlannerConstraint,\n} from './planner-constraint.ts';\nimport type {PlanDebugger} from './planner-debug.ts';\nimport {omitFanout} from './planner-node.ts';\nimport type {\n  CostEstimate,\n  JoinOrConnection,\n  PlannerNode,\n} from './planner-node.ts';\nimport type {PlannerTerminus} from './planner-terminus.ts';\n\n/**\n * Translate constraints for a flipped join from parent space to child space.\n * Matches the runtime behavior of FlippedJoin.fetch() which translates\n * parent constraints to child constraints using index-based key mapping.\n *\n * Example:\n *   parentConstraint = {issueID: undefined, projectID: undefined}\n *   childConstraint = {id: undefined, projectID: undefined}\n *   incomingConstraint = {issueID: 5}\n *   result = {id: 5}  // issueID at index 0 maps to id at index 0\n */\nfunction translateConstraintsForFlippedJoin(\n  incomingConstraint: PlannerConstraint | undefined,\n  parentConstraint: PlannerConstraint,\n  childConstraint: PlannerConstraint,\n): PlannerConstraint | undefined {\n  if (!incomingConstraint) return undefined;\n\n  const parentKeys = Object.keys(parentConstraint);\n  const childKeys = Object.keys(childConstraint);\n  const translated: PlannerConstraint = {};\n\n  for (const [key, value] of Object.entries(incomingConstraint)) {\n    const index = parentKeys.indexOf(key);\n    if (index !== -1) {\n      // Found this key in parent at position `index`\n      // Map to child key at same position\n      translated[childKeys[index]] = value;\n    }\n  }\n\n  return Object.keys(translated).length > 0 ? translated : undefined;\n}\n\n/**\n * Semi-join overhead multiplier.\n *\n * Semi-joins represent correlated subqueries (EXISTS checks) which have\n * execution overhead compared to flipped joins, even when logical row counts\n * are identical. This overhead comes from:\n * - Need to execute a separate correlation check for each parent row\n * - Cannot leverage combined constraint checking as effectively as flipped joins\n *\n * A multiplier of 1.5 means semi-joins are estimated to be ~50% more expensive\n * than equivalent flipped joins, which empirically matches observed performance\n * differences in production workloads (e.g., 1.7x in zbugs benchmarks).\n *\n * Flipped joins have a different overhead in that they become unlimited. This\n * is accounted for when propagating unlimits rather than here.\n */\n// const SEMI_JOIN_OVERHEAD_MULTIPLIER = 1.5;\n\n/**\n * Represents a join between two data streams (parent and child).\n *\n * # Dual-State Pattern\n * Like all planner nodes, PlannerJoin separates:\n * 1. IMMUTABLE STRUCTURE: Parent/child nodes, constraints, flippability\n * 2. MUTABLE STATE: Join type (semi/flipped), pinned status\n *\n * # Join Flipping\n * A join can be in two states:\n * - 'semi': Parent is outer loop, child is inner (semi-join for EXISTS)\n * - 'flipped': Child is outer loop, parent is inner\n *\n * Flipping is the key optimization: choosing which table scans first.\n * NOT EXISTS joins cannot be flipped (#flippable = false).\n *\n * # Constraint Propagation\n * - Semi-join: Sends childConstraint to child, forwards received constraints to parent\n * - Flipped join: Sends undefined to child, merges parentConstraint with received to parent\n * - Unpinned join: Only forwards constraints to parent (doesn't constrain child yet)\n *\n * # Lifecycle\n * 1. Construct with immutable structure (parent, child, constraints, flippability)\n * 2. Wire to output node during graph construction\n * 3. Planning calls flipIfNeeded() based on connection selection order\n * 4. pin() locks the join type once chosen\n * 5. reset() clears mutable state (type → 'semi', pinned → false)\n */\nexport class PlannerJoin {\n  readonly kind = 'join' as const;\n\n  readonly #parent: Exclude<PlannerNode, PlannerTerminus>;\n  readonly #child: Exclude<PlannerNode, PlannerTerminus>;\n  readonly #parentConstraint: PlannerConstraint;\n  readonly #childConstraint: PlannerConstraint;\n  readonly #flippable: boolean;\n  readonly planId: number;\n  #output?: PlannerNode | undefined; // Set once during graph construction\n\n  // Reset between planning attempts\n  #type: 'semi' | 'flipped';\n  readonly #initialType: 'semi' | 'flipped';\n\n  constructor(\n    parent: Exclude<PlannerNode, PlannerTerminus>,\n    child: Exclude<PlannerNode, PlannerTerminus>,\n    parentConstraint: PlannerConstraint,\n    childConstraint: PlannerConstraint,\n    flippable: boolean,\n    planId: number,\n    initialType: 'semi' | 'flipped' = 'semi',\n  ) {\n    this.#type = initialType;\n    this.#initialType = initialType;\n    this.#parent = parent;\n    this.#child = child;\n    this.#childConstraint = childConstraint;\n    this.#parentConstraint = parentConstraint;\n    this.#flippable = flippable;\n    this.planId = planId;\n  }\n\n  setOutput(node: PlannerNode): void {\n    this.#output = node;\n  }\n\n  get output(): PlannerNode {\n    assert(this.#output !== undefined, 'Output not set');\n    return this.#output;\n  }\n\n  closestJoinOrSource(): JoinOrConnection {\n    return 'join';\n  }\n\n  flipIfNeeded(input: PlannerNode): void {\n    if (input === this.#child) {\n      this.flip();\n    } else {\n      assert(\n        input === this.#parent,\n        'Can only flip a join from one of its inputs',\n      );\n    }\n  }\n\n  flip(): void {\n    assert(this.#type === 'semi', 'Can only flip a semi-join');\n    if (!this.#flippable) {\n      throw new UnflippableJoinError(\n        'Cannot flip a non-flippable join (e.g., NOT EXISTS)',\n      );\n    }\n    this.#type = 'flipped';\n  }\n\n  get type(): 'semi' | 'flipped' {\n    return this.#type;\n  }\n  isFlippable(): boolean {\n    return this.#flippable;\n  }\n\n  /**\n   * Propagate unlimiting when this join is flipped.\n   * When a join is flipped:\n   * 1. Child becomes outer loop → produces all rows (unlimited)\n   * 2. Parent is fetched once per child row → effectively unlimited\n   *\n   * Example: If child produces 896 rows, parent is fetched 896 times.\n   * Even if each fetch returns 1 row, parent produces 896 total rows.\n   *\n   * Propagation rules:\n   * - Connection: call unlimit()\n   * - Semi-join: continue to parent (outer loop)\n   * - Flipped join: stop (already unlimited when it was flipped)\n   * - Fan-out/Fan-in: propagate to all inputs\n   */\n  propagateUnlimit(): void {\n    assert(this.#type === 'flipped', 'Can only unlimit a flipped join');\n    // Parent stays limited; child becomes unlimited\n    this.#child.propagateUnlimitFromFlippedJoin(); // Up the child chain\n  }\n\n  /**\n   * Called when a parent join is flipped and this join is part of its child subgraph.\n   * Continue propagation to parent (the outer loop).\n   * If we are hitting a semi-join, the parent drives.\n   * If we are hitting a flip-join, well now we have to unlimit its parent too!\n   */\n  propagateUnlimitFromFlippedJoin(): void {\n    this.#parent.propagateUnlimitFromFlippedJoin();\n  }\n\n  propagateConstraints(\n    branchPattern: number[],\n    constraint: PlannerConstraint | undefined,\n    from?: PlannerNode,\n    planDebugger?: PlanDebugger,\n  ): void {\n    planDebugger?.log({\n      type: 'node-constraint',\n      nodeType: 'join',\n      node: this.getName(),\n      branchPattern,\n      constraint,\n      from: from ? getNodeName(from) : 'unknown',\n    });\n\n    if (this.#type === 'semi') {\n      // A semi-join always has constraints for its child.\n      // They are defined by the correlation between parent and child.\n      this.#child.propagateConstraints(\n        branchPattern,\n        this.#childConstraint,\n        this,\n        planDebugger,\n      );\n      // A semi-join forwards constraints to its parent.\n      this.#parent.propagateConstraints(\n        branchPattern,\n        constraint,\n        this,\n        planDebugger,\n      );\n    } else if (this.#type === 'flipped') {\n      // A flipped join translates constraints from parent space to child space.\n      // This matches FlippedJoin.fetch() runtime behavior where parent constraints\n      // on join keys are translated to child constraints.\n      // Example: If parent has {issueID: 5} and join maps issueID→id,\n      // child gets {id: 5} allowing index usage.\n      const translatedConstraint = translateConstraintsForFlippedJoin(\n        constraint,\n        this.#parentConstraint,\n        this.#childConstraint,\n      );\n      this.#child.propagateConstraints(\n        branchPattern,\n        translatedConstraint,\n        this,\n        planDebugger,\n      );\n      // A flipped join will have constraints to send to its parent.\n      // - The constraints its output sent\n      // - The constraints its child creates\n      this.#parent.propagateConstraints(\n        branchPattern,\n        mergeConstraints(constraint, this.#parentConstraint),\n        this,\n        planDebugger,\n      );\n    }\n  }\n\n  reset(): void {\n    this.#type = this.#initialType;\n  }\n\n  estimateCost(\n    /**\n     * This argument is to deal with consecutive `andExists` statements.\n     * Each one will constrain how often a parent row passes all constraints.\n     * This means that we have to scan more and more parent rows the more\n     * constraints we add.\n     *\n     * DownstreamChildSelectivity factors in fanout factor\n     * from parent -> child\n     */\n    downstreamChildSelectivity: number,\n    /**\n     * branchPattern uniquely identifies OR branches in the graph.\n     * Each path through an OR will have unique constraints to apply to the source\n     * connection.\n     * branchPattern allows us to correlate a path through the graph\n     * to the constraints that should be applied for that path.\n     *\n     * Example graph:\n     *  UFO\n     * /  \\\n     * J1   J2\n     * \\  /\n     *  UFI\n     *\n     * J1 and J2 are joins inside an OR (FO).\n     * branchPattern [0] = path through J1\n     * branchPattern [1] = path through J2\n     *\n     * If many ORs are nested, branchPattern will have multiple elements\n     * representing each level of OR.\n     *\n     * If no joins are flipped within the `OR`, then only a single\n     * branchPattern element will be needed, as FO represents all sub-joins\n     * as a single path.\n     */\n    branchPattern: number[],\n    planDebugger?: PlanDebugger,\n  ): CostEstimate {\n    /**\n     * downstreamChildSelectivity accumulates up a parent chain, not\n     * up child chains. Child chains represent independent sub-graphs.\n     * So we pass 1 for `downstreamChildSelectivity` when estimating child cost.\n     * Put another way, downstreamChildSelectivity impacts how many parent\n     * rows are returned.\n     */\n    const child = this.#child.estimateCost(1, branchPattern, planDebugger);\n\n    const fanoutFactor = child.fanout(Object.keys(this.#childConstraint));\n    // Factor in how many child rows match a parent row.\n    // E.g., if an issue has 10 comments on average then we're more\n    // likely to hit a comment compared to if an issue has 1 comment on average.\n    // If an index is all nulls (no parents match any children)\n    // this will collapse to 0.\n    const scaledChildSelectivity =\n      1 - Math.pow(1 - child.selectivity, fanoutFactor.fanout);\n\n    // Why do we not need fanout in the other direction?\n    // E.g., for an `inventory -> film` flipped-join, if each film has 100 inventories (100 copies)\n    // then we're more likely to hit an inventory row compared to if each film has 1 inventory.\n    // Flipped-join already accounts for this because the child selectivity is implicitly accounted\n    // for. The returned row estimate of the child is already representative of how many\n    // rows the child will have post-filtering.\n\n    /**\n     * How selective is the graph from this point forward?\n     * If we are _very_ selective then we must scan more parent rows\n     * before finding a match.\n     * E.g., if childSelectivity = 0.1 and downstreamChildSelectivity = 0.5\n     * then we only pass 5% of parent rows (0.1 * 0.5 = 0.05).\n     *\n     * This is used to estimate how many rows will be pulled from the parent\n     * when trying to satisfy downstream constraints and a limit.\n     *\n     * NOTE: We do not know if the probabilities are correlated so we assume independence.\n     * This is a fundamental limitation of the planner.\n     */\n    const parent = this.#parent.estimateCost(\n      // Selectivity flows up the graph from child to parent\n      // so we can determine the total selectivity of all ANDed exists checks.\n      this.#type === 'flipped'\n        ? 1 * downstreamChildSelectivity\n        : scaledChildSelectivity * downstreamChildSelectivity,\n      branchPattern,\n      planDebugger,\n    );\n\n    let costEstimate: CostEstimate;\n\n    if (this.type === 'semi') {\n      costEstimate = {\n        startupCost: parent.startupCost,\n        scanEst:\n          parent.limit === undefined\n            ? parent.returnedRows\n            : Math.min(\n                parent.returnedRows,\n                downstreamChildSelectivity === 0\n                  ? 0\n                  : parent.limit / downstreamChildSelectivity,\n              ),\n        cost:\n          parent.cost +\n          parent.scanEst * (child.startupCost + child.cost + child.scanEst),\n        returnedRows: parent.returnedRows * child.selectivity,\n        selectivity: child.selectivity * parent.selectivity,\n        limit: parent.limit,\n        fanout: parent.fanout,\n      };\n    } else {\n      costEstimate = {\n        startupCost: child.startupCost,\n        scanEst:\n          parent.limit === undefined\n            ? parent.returnedRows * child.returnedRows\n            : Math.min(\n                parent.returnedRows * child.returnedRows,\n                downstreamChildSelectivity === 0\n                  ? 0\n                  : parent.limit / downstreamChildSelectivity,\n              ),\n        cost:\n          child.cost +\n          child.scanEst * (parent.startupCost + parent.cost + parent.scanEst),\n        // the child selectivity is not relevant here because it has already been taken into account via the flipping.\n        // I.e., `child.returnedRows` is the estimated number of rows produced by the child _after_ taking filtering into account.\n        returnedRows: parent.returnedRows * child.returnedRows,\n        selectivity: parent.selectivity * child.selectivity,\n        limit: parent.limit,\n        fanout: parent.fanout,\n      };\n    }\n\n    if (planDebugger) {\n      planDebugger.log({\n        type: 'node-cost',\n        nodeType: 'join',\n        node: this.getName(),\n        branchPattern,\n        downstreamChildSelectivity,\n        costEstimate: omitFanout(costEstimate),\n        joinType: this.#type,\n      });\n    }\n\n    return costEstimate;\n  }\n\n  /**\n   * Get a human-readable name for this join for debugging.\n   * Format: \"parentName ⋈ childName\"\n   */\n  getName(): string {\n    const parentName = getNodeName(this.#parent);\n    const childName = getNodeName(this.#child);\n    return `${parentName} ⋈ ${childName}`;\n  }\n\n  /**\n   * Get debug information about this join's state.\n   */\n  getDebugInfo(): {\n    name: string;\n    type: 'semi' | 'flipped';\n    planId: number;\n  } {\n    return {\n      name: this.getName(),\n      type: this.#type,\n      planId: this.planId,\n    };\n  }\n}\n\nexport class UnflippableJoinError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'UnflippableJoinError';\n  }\n}\n\n/**\n * Get a human-readable name for any planner node.\n * Used for debugging and tracing.\n */\nfunction getNodeName(node: PlannerNode): string {\n  switch (node.kind) {\n    case 'connection':\n      return node.name;\n    case 'join':\n      return node.getName();\n    case 'fan-out':\n      return 'FO';\n    case 'fan-in':\n      return 'FI';\n    case 'terminus':\n      return 'terminus';\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;AAyBA,SAAS,mCACP,oBACA,kBACA,iBAC+B;AAC/B,KAAI,CAAC,mBAAoB,QAAO,KAAA;CAEhC,MAAM,aAAa,OAAO,KAAK,iBAAiB;CAChD,MAAM,YAAY,OAAO,KAAK,gBAAgB;CAC9C,MAAM,aAAgC,EAAE;AAExC,MAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,mBAAmB,EAAE;EAC7D,MAAM,QAAQ,WAAW,QAAQ,IAAI;AACrC,MAAI,UAAU,GAGZ,YAAW,UAAU,UAAU;;AAInC,QAAO,OAAO,KAAK,WAAW,CAAC,SAAS,IAAI,aAAa,KAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiD3D,IAAa,cAAb,MAAyB;CACvB,OAAgB;CAEhB;CACA;CACA;CACA;CACA;CACA;CACA;CAGA;CACA;CAEA,YACE,QACA,OACA,kBACA,iBACA,WACA,QACA,cAAkC,QAClC;AACA,QAAA,OAAa;AACb,QAAA,cAAoB;AACpB,QAAA,SAAe;AACf,QAAA,QAAc;AACd,QAAA,kBAAwB;AACxB,QAAA,mBAAyB;AACzB,QAAA,YAAkB;AAClB,OAAK,SAAS;;CAGhB,UAAU,MAAyB;AACjC,QAAA,SAAe;;CAGjB,IAAI,SAAsB;AACxB,SAAO,MAAA,WAAiB,KAAA,GAAW,iBAAiB;AACpD,SAAO,MAAA;;CAGT,sBAAwC;AACtC,SAAO;;CAGT,aAAa,OAA0B;AACrC,MAAI,UAAU,MAAA,MACZ,MAAK,MAAM;MAEX,QACE,UAAU,MAAA,QACV,8CACD;;CAIL,OAAa;AACX,SAAO,MAAA,SAAe,QAAQ,4BAA4B;AAC1D,MAAI,CAAC,MAAA,UACH,OAAM,IAAI,qBACR,sDACD;AAEH,QAAA,OAAa;;CAGf,IAAI,OAA2B;AAC7B,SAAO,MAAA;;CAET,cAAuB;AACrB,SAAO,MAAA;;;;;;;;;;;;;;;;;CAkBT,mBAAyB;AACvB,SAAO,MAAA,SAAe,WAAW,kCAAkC;AAEnE,QAAA,MAAY,iCAAiC;;;;;;;;CAS/C,kCAAwC;AACtC,QAAA,OAAa,iCAAiC;;CAGhD,qBACE,eACA,YACA,MACA,cACM;AACN,gBAAc,IAAI;GAChB,MAAM;GACN,UAAU;GACV,MAAM,KAAK,SAAS;GACpB;GACA;GACA,MAAM,OAAO,YAAY,KAAK,GAAG;GAClC,CAAC;AAEF,MAAI,MAAA,SAAe,QAAQ;AAGzB,SAAA,MAAY,qBACV,eACA,MAAA,iBACA,MACA,aACD;AAED,SAAA,OAAa,qBACX,eACA,YACA,MACA,aACD;aACQ,MAAA,SAAe,WAAW;GAMnC,MAAM,uBAAuB,mCAC3B,YACA,MAAA,kBACA,MAAA,gBACD;AACD,SAAA,MAAY,qBACV,eACA,sBACA,MACA,aACD;AAID,SAAA,OAAa,qBACX,eACA,iBAAiB,YAAY,MAAA,iBAAuB,EACpD,MACA,aACD;;;CAIL,QAAc;AACZ,QAAA,OAAa,MAAA;;CAGf,aAUE,4BA0BA,eACA,cACc;;;;;;;;EAQd,MAAM,QAAQ,MAAA,MAAY,aAAa,GAAG,eAAe,aAAa;EAEtE,MAAM,eAAe,MAAM,OAAO,OAAO,KAAK,MAAA,gBAAsB,CAAC;EAMrE,MAAM,yBACJ,IAAI,KAAK,IAAI,IAAI,MAAM,aAAa,aAAa,OAAO;;;;;;;;;;;;;;EAsB1D,MAAM,SAAS,MAAA,OAAa,aAG1B,MAAA,SAAe,YACX,IAAI,6BACJ,yBAAyB,4BAC7B,eACA,aACD;EAED,IAAI;AAEJ,MAAI,KAAK,SAAS,OAChB,gBAAe;GACb,aAAa,OAAO;GACpB,SACE,OAAO,UAAU,KAAA,IACb,OAAO,eACP,KAAK,IACH,OAAO,cACP,+BAA+B,IAC3B,IACA,OAAO,QAAQ,2BACpB;GACP,MACE,OAAO,OACP,OAAO,WAAW,MAAM,cAAc,MAAM,OAAO,MAAM;GAC3D,cAAc,OAAO,eAAe,MAAM;GAC1C,aAAa,MAAM,cAAc,OAAO;GACxC,OAAO,OAAO;GACd,QAAQ,OAAO;GAChB;MAED,gBAAe;GACb,aAAa,MAAM;GACnB,SACE,OAAO,UAAU,KAAA,IACb,OAAO,eAAe,MAAM,eAC5B,KAAK,IACH,OAAO,eAAe,MAAM,cAC5B,+BAA+B,IAC3B,IACA,OAAO,QAAQ,2BACpB;GACP,MACE,MAAM,OACN,MAAM,WAAW,OAAO,cAAc,OAAO,OAAO,OAAO;GAG7D,cAAc,OAAO,eAAe,MAAM;GAC1C,aAAa,OAAO,cAAc,MAAM;GACxC,OAAO,OAAO;GACd,QAAQ,OAAO;GAChB;AAGH,MAAI,aACF,cAAa,IAAI;GACf,MAAM;GACN,UAAU;GACV,MAAM,KAAK,SAAS;GACpB;GACA;GACA,cAAc,WAAW,aAAa;GACtC,UAAU,MAAA;GACX,CAAC;AAGJ,SAAO;;;;;;CAOT,UAAkB;AAGhB,SAAO,GAFY,YAAY,MAAA,OAAa,CAEvB,KADH,YAAY,MAAA,MAAY;;;;;CAO5C,eAIE;AACA,SAAO;GACL,MAAM,KAAK,SAAS;GACpB,MAAM,MAAA;GACN,QAAQ,KAAK;GACd;;;AAIL,IAAa,uBAAb,cAA0C,MAAM;CAC9C,YAAY,SAAiB;AAC3B,QAAM,QAAQ;AACd,OAAK,OAAO;;;;;;;AAQhB,SAAS,YAAY,MAA2B;AAC9C,SAAQ,KAAK,MAAb;EACE,KAAK,aACH,QAAO,KAAK;EACd,KAAK,OACH,QAAO,KAAK,SAAS;EACvB,KAAK,UACH,QAAO;EACT,KAAK,SACH,QAAO;EACT,KAAK,WACH,QAAO"}
+{"version":3,"file":"planner-join.js","names":["#parent","#child","#parentConstraint","#childConstraint","#flippable","#initialType","#type","#output"],"sources":["../../../../../zql/src/planner/planner-join.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {getMultiConstraintChunkSize} from '../ivm/flipped-join.ts';\nimport {\n  mergeConstraints,\n  type PlannerConstraint,\n} from './planner-constraint.ts';\nimport type {PlanDebugger} from './planner-debug.ts';\nimport {omitFanout} from './planner-node.ts';\nimport type {\n  CostEstimate,\n  JoinOrConnection,\n  PlannerNode,\n} from './planner-node.ts';\nimport type {PlannerTerminus} from './planner-terminus.ts';\n\n/**\n * Translate constraints for a flipped join from parent space to child space.\n * Matches the runtime behavior of FlippedJoin.fetch() which translates\n * parent constraints to child constraints using index-based key mapping.\n *\n * Example:\n *   parentConstraint = {issueID: undefined, projectID: undefined}\n *   childConstraint = {id: undefined, projectID: undefined}\n *   incomingConstraint = {issueID: 5}\n *   result = {id: 5}  // issueID at index 0 maps to id at index 0\n */\nfunction translateConstraintsForFlippedJoin(\n  incomingConstraint: PlannerConstraint | undefined,\n  parentConstraint: PlannerConstraint,\n  childConstraint: PlannerConstraint,\n): PlannerConstraint | undefined {\n  if (!incomingConstraint) return undefined;\n\n  const parentKeys = Object.keys(parentConstraint);\n  const childKeys = Object.keys(childConstraint);\n  const translated: PlannerConstraint = {};\n\n  for (const [key, value] of Object.entries(incomingConstraint)) {\n    const index = parentKeys.indexOf(key);\n    if (index !== -1) {\n      // Found this key in parent at position `index`\n      // Map to child key at same position\n      translated[childKeys[index]] = value;\n    }\n  }\n\n  return Object.keys(translated).length > 0 ? translated : undefined;\n}\n\n/**\n * Semi-join overhead multiplier.\n *\n * Semi-joins represent correlated subqueries (EXISTS checks) which have\n * execution overhead compared to flipped joins, even when logical row counts\n * are identical. This overhead comes from:\n * - Need to execute a separate correlation check for each parent row\n * - Cannot leverage combined constraint checking as effectively as flipped joins\n *\n * A multiplier of 1.5 means semi-joins are estimated to be ~50% more expensive\n * than equivalent flipped joins, which empirically matches observed performance\n * differences in production workloads (e.g., 1.7x in zbugs benchmarks).\n *\n * Flipped joins have a different overhead in that they become unlimited. This\n * is accounted for when propagating unlimits rather than here.\n */\n// const SEMI_JOIN_OVERHEAD_MULTIPLIER = 1.5;\n\n/**\n * Represents a join between two data streams (parent and child).\n *\n * # Dual-State Pattern\n * Like all planner nodes, PlannerJoin separates:\n * 1. IMMUTABLE STRUCTURE: Parent/child nodes, constraints, flippability\n * 2. MUTABLE STATE: Join type (semi/flipped), pinned status\n *\n * # Join Flipping\n * A join can be in two states:\n * - 'semi': Parent is outer loop, child is inner (semi-join for EXISTS)\n * - 'flipped': Child is outer loop, parent is inner\n *\n * Flipping is the key optimization: choosing which table scans first.\n * NOT EXISTS joins cannot be flipped (#flippable = false).\n *\n * # Constraint Propagation\n * - Semi-join: Sends childConstraint to child, forwards received constraints to parent\n * - Flipped join: Sends undefined to child, merges parentConstraint with received to parent\n * - Unpinned join: Only forwards constraints to parent (doesn't constrain child yet)\n *\n * # Lifecycle\n * 1. Construct with immutable structure (parent, child, constraints, flippability)\n * 2. Wire to output node during graph construction\n * 3. Planning calls flipIfNeeded() based on connection selection order\n * 4. pin() locks the join type once chosen\n * 5. reset() clears mutable state (type → 'semi', pinned → false)\n */\nexport class PlannerJoin {\n  readonly kind = 'join' as const;\n\n  readonly #parent: Exclude<PlannerNode, PlannerTerminus>;\n  readonly #child: Exclude<PlannerNode, PlannerTerminus>;\n  readonly #parentConstraint: PlannerConstraint;\n  readonly #childConstraint: PlannerConstraint;\n  readonly #flippable: boolean;\n  readonly planId: number;\n  #output?: PlannerNode | undefined; // Set once during graph construction\n\n  // Reset between planning attempts\n  #type: 'semi' | 'flipped';\n  readonly #initialType: 'semi' | 'flipped';\n\n  constructor(\n    parent: Exclude<PlannerNode, PlannerTerminus>,\n    child: Exclude<PlannerNode, PlannerTerminus>,\n    parentConstraint: PlannerConstraint,\n    childConstraint: PlannerConstraint,\n    flippable: boolean,\n    planId: number,\n    initialType: 'semi' | 'flipped' = 'semi',\n  ) {\n    this.#type = initialType;\n    this.#initialType = initialType;\n    this.#parent = parent;\n    this.#child = child;\n    this.#childConstraint = childConstraint;\n    this.#parentConstraint = parentConstraint;\n    this.#flippable = flippable;\n    this.planId = planId;\n  }\n\n  setOutput(node: PlannerNode): void {\n    this.#output = node;\n  }\n\n  get output(): PlannerNode {\n    assert(this.#output !== undefined, 'Output not set');\n    return this.#output;\n  }\n\n  closestJoinOrSource(): JoinOrConnection {\n    return 'join';\n  }\n\n  flipIfNeeded(input: PlannerNode): void {\n    if (input === this.#child) {\n      this.flip();\n    } else {\n      assert(\n        input === this.#parent,\n        'Can only flip a join from one of its inputs',\n      );\n    }\n  }\n\n  flip(): void {\n    assert(this.#type === 'semi', 'Can only flip a semi-join');\n    if (!this.#flippable) {\n      throw new UnflippableJoinError(\n        'Cannot flip a non-flippable join (e.g., NOT EXISTS)',\n      );\n    }\n    this.#type = 'flipped';\n  }\n\n  get type(): 'semi' | 'flipped' {\n    return this.#type;\n  }\n  isFlippable(): boolean {\n    return this.#flippable;\n  }\n\n  /**\n   * Propagate unlimiting when this join is flipped.\n   * When a join is flipped:\n   * 1. Child becomes outer loop → produces all rows (unlimited)\n   * 2. Parent is fetched once per child row → effectively unlimited\n   *\n   * Example: If child produces 896 rows, parent is fetched 896 times.\n   * Even if each fetch returns 1 row, parent produces 896 total rows.\n   *\n   * Propagation rules:\n   * - Connection: call unlimit()\n   * - Semi-join: continue to parent (outer loop)\n   * - Flipped join: stop (already unlimited when it was flipped)\n   * - Fan-out/Fan-in: propagate to all inputs\n   */\n  propagateUnlimit(): void {\n    assert(this.#type === 'flipped', 'Can only unlimit a flipped join');\n    // Parent stays limited; child becomes unlimited\n    this.#child.propagateUnlimitFromFlippedJoin(); // Up the child chain\n  }\n\n  /**\n   * Called when a parent join is flipped and this join is part of its child subgraph.\n   * Continue propagation to parent (the outer loop).\n   * If we are hitting a semi-join, the parent drives.\n   * If we are hitting a flip-join, well now we have to unlimit its parent too!\n   */\n  propagateUnlimitFromFlippedJoin(): void {\n    this.#parent.propagateUnlimitFromFlippedJoin();\n  }\n\n  propagateConstraints(\n    branchPattern: number[],\n    constraint: PlannerConstraint | undefined,\n    from?: PlannerNode,\n    planDebugger?: PlanDebugger,\n  ): void {\n    planDebugger?.log({\n      type: 'node-constraint',\n      nodeType: 'join',\n      node: this.getName(),\n      branchPattern,\n      constraint,\n      from: from ? getNodeName(from) : 'unknown',\n    });\n\n    if (this.#type === 'semi') {\n      // A semi-join always has constraints for its child.\n      // They are defined by the correlation between parent and child.\n      this.#child.propagateConstraints(\n        branchPattern,\n        this.#childConstraint,\n        this,\n        planDebugger,\n      );\n      // A semi-join forwards constraints to its parent.\n      this.#parent.propagateConstraints(\n        branchPattern,\n        constraint,\n        this,\n        planDebugger,\n      );\n    } else if (this.#type === 'flipped') {\n      // A flipped join translates constraints from parent space to child space.\n      // This matches FlippedJoin.fetch() runtime behavior where parent constraints\n      // on join keys are translated to child constraints.\n      // Example: If parent has {issueID: 5} and join maps issueID→id,\n      // child gets {id: 5} allowing index usage.\n      const translatedConstraint = translateConstraintsForFlippedJoin(\n        constraint,\n        this.#parentConstraint,\n        this.#childConstraint,\n      );\n      this.#child.propagateConstraints(\n        branchPattern,\n        translatedConstraint,\n        this,\n        planDebugger,\n      );\n      // A flipped join will have constraints to send to its parent.\n      // - The constraints its output sent\n      // - The constraints its child creates\n      this.#parent.propagateConstraints(\n        branchPattern,\n        mergeConstraints(constraint, this.#parentConstraint),\n        this,\n        planDebugger,\n      );\n    }\n  }\n\n  reset(): void {\n    this.#type = this.#initialType;\n  }\n\n  estimateCost(\n    /**\n     * This argument is to deal with consecutive `andExists` statements.\n     * Each one will constrain how often a parent row passes all constraints.\n     * This means that we have to scan more and more parent rows the more\n     * constraints we add.\n     *\n     * DownstreamChildSelectivity factors in fanout factor\n     * from parent -> child\n     */\n    downstreamChildSelectivity: number,\n    /**\n     * branchPattern uniquely identifies OR branches in the graph.\n     * Each path through an OR will have unique constraints to apply to the source\n     * connection.\n     * branchPattern allows us to correlate a path through the graph\n     * to the constraints that should be applied for that path.\n     *\n     * Example graph:\n     *  UFO\n     * /  \\\n     * J1   J2\n     * \\  /\n     *  UFI\n     *\n     * J1 and J2 are joins inside an OR (FO).\n     * branchPattern [0] = path through J1\n     * branchPattern [1] = path through J2\n     *\n     * If many ORs are nested, branchPattern will have multiple elements\n     * representing each level of OR.\n     *\n     * If no joins are flipped within the `OR`, then only a single\n     * branchPattern element will be needed, as FO represents all sub-joins\n     * as a single path.\n     */\n    branchPattern: number[],\n    planDebugger?: PlanDebugger,\n  ): CostEstimate {\n    /**\n     * downstreamChildSelectivity accumulates up a parent chain, not\n     * up child chains. Child chains represent independent sub-graphs.\n     * So we pass 1 for `downstreamChildSelectivity` when estimating child cost.\n     * Put another way, downstreamChildSelectivity impacts how many parent\n     * rows are returned.\n     */\n    const child = this.#child.estimateCost(1, branchPattern, planDebugger);\n\n    const fanoutFactor = child.fanout(Object.keys(this.#childConstraint));\n    // Factor in how many child rows match a parent row.\n    // E.g., if an issue has 10 comments on average then we're more\n    // likely to hit a comment compared to if an issue has 1 comment on average.\n    // If an index is all nulls (no parents match any children)\n    // this will collapse to 0.\n    const scaledChildSelectivity =\n      1 - Math.pow(1 - child.selectivity, fanoutFactor.fanout);\n\n    // Why do we not need fanout in the other direction?\n    // E.g., for an `inventory -> film` flipped-join, if each film has 100 inventories (100 copies)\n    // then we're more likely to hit an inventory row compared to if each film has 1 inventory.\n    // Flipped-join already accounts for this because the child selectivity is implicitly accounted\n    // for. The returned row estimate of the child is already representative of how many\n    // rows the child will have post-filtering.\n\n    /**\n     * How selective is the graph from this point forward?\n     * If we are _very_ selective then we must scan more parent rows\n     * before finding a match.\n     * E.g., if childSelectivity = 0.1 and downstreamChildSelectivity = 0.5\n     * then we only pass 5% of parent rows (0.1 * 0.5 = 0.05).\n     *\n     * This is used to estimate how many rows will be pulled from the parent\n     * when trying to satisfy downstream constraints and a limit.\n     *\n     * NOTE: We do not know if the probabilities are correlated so we assume independence.\n     * This is a fundamental limitation of the planner.\n     */\n    const parent = this.#parent.estimateCost(\n      // Selectivity flows up the graph from child to parent\n      // so we can determine the total selectivity of all ANDed exists checks.\n      this.#type === 'flipped'\n        ? 1 * downstreamChildSelectivity\n        : scaledChildSelectivity * downstreamChildSelectivity,\n      branchPattern,\n      planDebugger,\n    );\n\n    let costEstimate: CostEstimate;\n\n    if (this.type === 'semi') {\n      costEstimate = {\n        startupCost: parent.startupCost,\n        scanEst:\n          parent.limit === undefined\n            ? parent.returnedRows\n            : Math.min(\n                parent.returnedRows,\n                downstreamChildSelectivity === 0\n                  ? 0\n                  : parent.limit / downstreamChildSelectivity,\n              ),\n        cost:\n          parent.cost +\n          parent.scanEst * (child.startupCost + child.cost + child.scanEst),\n        returnedRows: parent.returnedRows * child.selectivity,\n        selectivity: child.selectivity * parent.selectivity,\n        limit: parent.limit,\n        fanout: parent.fanout,\n      };\n    } else {\n      costEstimate = {\n        startupCost: child.startupCost,\n        scanEst:\n          parent.limit === undefined\n            ? parent.returnedRows * child.returnedRows\n            : Math.min(\n                parent.returnedRows * child.returnedRows,\n                downstreamChildSelectivity === 0\n                  ? 0\n                  : parent.limit / downstreamChildSelectivity,\n              ),\n        // FlippedJoin batches child→parent lookups into chunks of\n        // getMultiConstraintChunkSize(), issuing one IN-list query per\n        // chunk. So `parent.startupCost` (statement prepare + plan\n        // setup) is paid once per chunk, not once per child row. The\n        // per-seek work (`parent.cost` index walk + `parent.scanEst`\n        // rows) still scales with child row count: each IN value still\n        // does its own index seek.\n        cost:\n          child.cost +\n          Math.ceil(child.scanEst / getMultiConstraintChunkSize()) *\n            parent.startupCost +\n          child.scanEst * (parent.cost + parent.scanEst),\n        // the child selectivity is not relevant here because it has already been taken into account via the flipping.\n        // I.e., `child.returnedRows` is the estimated number of rows produced by the child _after_ taking filtering into account.\n        returnedRows: parent.returnedRows * child.returnedRows,\n        selectivity: parent.selectivity * child.selectivity,\n        limit: parent.limit,\n        fanout: parent.fanout,\n      };\n    }\n\n    if (planDebugger) {\n      planDebugger.log({\n        type: 'node-cost',\n        nodeType: 'join',\n        node: this.getName(),\n        branchPattern,\n        downstreamChildSelectivity,\n        costEstimate: omitFanout(costEstimate),\n        joinType: this.#type,\n      });\n    }\n\n    return costEstimate;\n  }\n\n  /**\n   * Get a human-readable name for this join for debugging.\n   * Format: \"parentName ⋈ childName\"\n   */\n  getName(): string {\n    const parentName = getNodeName(this.#parent);\n    const childName = getNodeName(this.#child);\n    return `${parentName} ⋈ ${childName}`;\n  }\n\n  /**\n   * Get debug information about this join's state.\n   */\n  getDebugInfo(): {\n    name: string;\n    type: 'semi' | 'flipped';\n    planId: number;\n  } {\n    return {\n      name: this.getName(),\n      type: this.#type,\n      planId: this.planId,\n    };\n  }\n}\n\nexport class UnflippableJoinError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'UnflippableJoinError';\n  }\n}\n\n/**\n * Get a human-readable name for any planner node.\n * Used for debugging and tracing.\n */\nfunction getNodeName(node: PlannerNode): string {\n  switch (node.kind) {\n    case 'connection':\n      return node.name;\n    case 'join':\n      return node.getName();\n    case 'fan-out':\n      return 'FO';\n    case 'fan-in':\n      return 'FI';\n    case 'terminus':\n      return 'terminus';\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AA0BA,SAAS,mCACP,oBACA,kBACA,iBAC+B;CAC/B,IAAI,CAAC,oBAAoB,OAAO,KAAA;CAEhC,MAAM,aAAa,OAAO,KAAK,gBAAgB;CAC/C,MAAM,YAAY,OAAO,KAAK,eAAe;CAC7C,MAAM,aAAgC,CAAC;CAEvC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,kBAAkB,GAAG;EAC7D,MAAM,QAAQ,WAAW,QAAQ,GAAG;EACpC,IAAI,UAAU,IAGZ,WAAW,UAAU,UAAU;CAEnC;CAEA,OAAO,OAAO,KAAK,UAAU,EAAE,SAAS,IAAI,aAAa,KAAA;AAC3D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgDA,IAAa,cAAb,MAAyB;CACvB,OAAgB;CAEhB;CACA;CACA;CACA;CACA;CACA;CACA;CAGA;CACA;CAEA,YACE,QACA,OACA,kBACA,iBACA,WACA,QACA,cAAkC,QAClC;EACA,KAAKM,QAAQ;EACb,KAAKD,eAAe;EACpB,KAAKL,UAAU;EACf,KAAKC,SAAS;EACd,KAAKE,mBAAmB;EACxB,KAAKD,oBAAoB;EACzB,KAAKE,aAAa;EAClB,KAAK,SAAS;CAChB;CAEA,UAAU,MAAyB;EACjC,KAAKG,UAAU;CACjB;CAEA,IAAI,SAAsB;EACxB,OAAO,KAAKA,YAAY,KAAA,GAAW,gBAAgB;EACnD,OAAO,KAAKA;CACd;CAEA,sBAAwC;EACtC,OAAO;CACT;CAEA,aAAa,OAA0B;EACrC,IAAI,UAAU,KAAKN,QACjB,KAAK,KAAK;OAEV,OACE,UAAU,KAAKD,SACf,6CACF;CAEJ;CAEA,OAAa;EACX,OAAO,KAAKM,UAAU,QAAQ,2BAA2B;EACzD,IAAI,CAAC,KAAKF,YACR,MAAM,IAAI,qBACR,qDACF;EAEF,KAAKE,QAAQ;CACf;CAEA,IAAI,OAA2B;EAC7B,OAAO,KAAKA;CACd;CACA,cAAuB;EACrB,OAAO,KAAKF;CACd;;;;;;;;;;;;;;;;CAiBA,mBAAyB;EACvB,OAAO,KAAKE,UAAU,WAAW,iCAAiC;EAElE,KAAKL,OAAO,gCAAgC;CAC9C;;;;;;;CAQA,kCAAwC;EACtC,KAAKD,QAAQ,gCAAgC;CAC/C;CAEA,qBACE,eACA,YACA,MACA,cACM;EACN,cAAc,IAAI;GAChB,MAAM;GACN,UAAU;GACV,MAAM,KAAK,QAAQ;GACnB;GACA;GACA,MAAM,OAAO,YAAY,IAAI,IAAI;EACnC,CAAC;EAED,IAAI,KAAKM,UAAU,QAAQ;GAGzB,KAAKL,OAAO,qBACV,eACA,KAAKE,kBACL,MACA,YACF;GAEA,KAAKH,QAAQ,qBACX,eACA,YACA,MACA,YACF;EACF,OAAO,IAAI,KAAKM,UAAU,WAAW;GAMnC,MAAM,uBAAuB,mCAC3B,YACA,KAAKJ,mBACL,KAAKC,gBACP;GACA,KAAKF,OAAO,qBACV,eACA,sBACA,MACA,YACF;GAIA,KAAKD,QAAQ,qBACX,eACA,iBAAiB,YAAY,KAAKE,iBAAiB,GACnD,MACA,YACF;EACF;CACF;CAEA,QAAc;EACZ,KAAKI,QAAQ,KAAKD;CACpB;CAEA,aAUE,4BA0BA,eACA,cACc;;;;;;;;EAQd,MAAM,QAAQ,KAAKJ,OAAO,aAAa,GAAG,eAAe,YAAY;EAErE,MAAM,eAAe,MAAM,OAAO,OAAO,KAAK,KAAKE,gBAAgB,CAAC;EAMpE,MAAM,yBACJ,IAAI,KAAK,IAAI,IAAI,MAAM,aAAa,aAAa,MAAM;;;;;;;;;;;;;;EAsBzD,MAAM,SAAS,KAAKH,QAAQ,aAG1B,KAAKM,UAAU,YACX,IAAI,6BACJ,yBAAyB,4BAC7B,eACA,YACF;EAEA,IAAI;EAEJ,IAAI,KAAK,SAAS,QAChB,eAAe;GACb,aAAa,OAAO;GACpB,SACE,OAAO,UAAU,KAAA,IACb,OAAO,eACP,KAAK,IACH,OAAO,cACP,+BAA+B,IAC3B,IACA,OAAO,QAAQ,0BACrB;GACN,MACE,OAAO,OACP,OAAO,WAAW,MAAM,cAAc,MAAM,OAAO,MAAM;GAC3D,cAAc,OAAO,eAAe,MAAM;GAC1C,aAAa,MAAM,cAAc,OAAO;GACxC,OAAO,OAAO;GACd,QAAQ,OAAO;EACjB;OAEA,eAAe;GACb,aAAa,MAAM;GACnB,SACE,OAAO,UAAU,KAAA,IACb,OAAO,eAAe,MAAM,eAC5B,KAAK,IACH,OAAO,eAAe,MAAM,cAC5B,+BAA+B,IAC3B,IACA,OAAO,QAAQ,0BACrB;GAQN,MACE,MAAM,OACN,KAAK,KAAK,MAAM,UAAU,4BAA4B,CAAC,IACrD,OAAO,cACT,MAAM,WAAW,OAAO,OAAO,OAAO;GAGxC,cAAc,OAAO,eAAe,MAAM;GAC1C,aAAa,OAAO,cAAc,MAAM;GACxC,OAAO,OAAO;GACd,QAAQ,OAAO;EACjB;EAGF,IAAI,cACF,aAAa,IAAI;GACf,MAAM;GACN,UAAU;GACV,MAAM,KAAK,QAAQ;GACnB;GACA;GACA,cAAc,WAAW,YAAY;GACrC,UAAU,KAAKA;EACjB,CAAC;EAGH,OAAO;CACT;;;;;CAMA,UAAkB;EAGhB,OAAO,GAFY,YAAY,KAAKN,OAE1B,EAAW,KADH,YAAY,KAAKC,MACT;CAC5B;;;;CAKA,eAIE;EACA,OAAO;GACL,MAAM,KAAK,QAAQ;GACnB,MAAM,KAAKK;GACX,QAAQ,KAAK;EACf;CACF;AACF;AAEA,IAAa,uBAAb,cAA0C,MAAM;CAC9C,YAAY,SAAiB;EAC3B,MAAM,OAAO;EACb,KAAK,OAAO;CACd;AACF;;;;;AAMA,SAAS,YAAY,MAA2B;CAC9C,QAAQ,KAAK,MAAb;EACE,KAAK,cACH,OAAO,KAAK;EACd,KAAK,QACH,OAAO,KAAK,QAAQ;EACtB,KAAK,WACH,OAAO;EACT,KAAK,UACH,OAAO;EACT,KAAK,YACH,OAAO;CACX;AACF"}

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

@@ -1 +1 @@
-{"version":3,"file":"planner-node.js","names":[],"sources":["../../../../../zql/src/planner/planner-node.ts"],"sourcesContent":["import type {FanoutCostModel, PlannerConnection} from './planner-connection.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 type {PlannerTerminus} from './planner-terminus.ts';\n\n/**\n * Union of all node types that can appear in the planner graph.\n * All nodes follow the dual-state pattern described above.\n */\nexport type PlannerNode =\n  | PlannerJoin\n  | PlannerConnection\n  | PlannerFanOut\n  | PlannerFanIn\n  | PlannerTerminus;\n\nexport type CostEstimate = {\n  startupCost: number;\n  scanEst: number;\n\n  /**\n   * The cumulative cost to run the pipeline so far.\n   *\n   * In a semi-join, each row output by the parent is multiplied by the cost to evaluate the child.\n   * In a flipped join, each row output by the child is multiplied by the cost to evaluate the parent.\n   *\n   * \"each row output by the parent\" is determined by the downstreamChildSelectivity parameter in combination\n   * with the limit or the rows output by the parent node.\n   *\n   * We pull on the parent and stop when hitting a limit or exhausting rows.\n   */\n  cost: number;\n\n  /**\n   * The number of rows output from a node.\n   * - For a connection, this is the estimated number of rows returned by the source query.\n   * - For a semi-join, this is the estimated number of rows that pass the semi-join filter.\n   * - For a flipped join, this is the estimated number of rows that match all child rows.\n   * - For fan-in, this is the sum of the rows from each input.\n   * - For fan-out, this is the rows from its input.\n   */\n  returnedRows: number;\n\n  /**\n   * The selectivity of the node.\n   * For a connection, this is the fraction of rows passing filters (1.0 = no filtering).\n   * For joins, this is the fraction of parent rows that match child rows.\n   * For fan-in, this is the probability of a match in any branch, assuming independent events.\n   * For fan-out, this is the selectivity of its input.\n   */\n  selectivity: number;\n  limit: number | undefined;\n\n  fanout: FanoutCostModel;\n};\n\n/**\n * Omit the fanout function from a cost estimate for serialization.\n */\nexport function omitFanout(cost: CostEstimate): Omit<CostEstimate, 'fanout'> {\n  const {fanout: _, ...rest} = cost;\n  return rest;\n}\n\nexport type NodeType = PlannerNode['kind'];\n\nexport type JoinOrConnection = 'join' | 'connection';\n\nexport type JoinType = PlannerJoin['type'];\n"],"mappings":";;;;AA4DA,SAAgB,WAAW,MAAkD;CAC3E,MAAM,EAAC,QAAQ,GAAG,GAAG,SAAQ;AAC7B,QAAO"}
+{"version":3,"file":"planner-node.js","names":[],"sources":["../../../../../zql/src/planner/planner-node.ts"],"sourcesContent":["import type {FanoutCostModel, PlannerConnection} from './planner-connection.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 type {PlannerTerminus} from './planner-terminus.ts';\n\n/**\n * Union of all node types that can appear in the planner graph.\n * All nodes follow the dual-state pattern described above.\n */\nexport type PlannerNode =\n  | PlannerJoin\n  | PlannerConnection\n  | PlannerFanOut\n  | PlannerFanIn\n  | PlannerTerminus;\n\nexport type CostEstimate = {\n  startupCost: number;\n  scanEst: number;\n\n  /**\n   * The cumulative cost to run the pipeline so far.\n   *\n   * In a semi-join, each row output by the parent is multiplied by the cost to evaluate the child.\n   * In a flipped join, each row output by the child is multiplied by the cost to evaluate the parent.\n   *\n   * \"each row output by the parent\" is determined by the downstreamChildSelectivity parameter in combination\n   * with the limit or the rows output by the parent node.\n   *\n   * We pull on the parent and stop when hitting a limit or exhausting rows.\n   */\n  cost: number;\n\n  /**\n   * The number of rows output from a node.\n   * - For a connection, this is the estimated number of rows returned by the source query.\n   * - For a semi-join, this is the estimated number of rows that pass the semi-join filter.\n   * - For a flipped join, this is the estimated number of rows that match all child rows.\n   * - For fan-in, this is the sum of the rows from each input.\n   * - For fan-out, this is the rows from its input.\n   */\n  returnedRows: number;\n\n  /**\n   * The selectivity of the node.\n   * For a connection, this is the fraction of rows passing filters (1.0 = no filtering).\n   * For joins, this is the fraction of parent rows that match child rows.\n   * For fan-in, this is the probability of a match in any branch, assuming independent events.\n   * For fan-out, this is the selectivity of its input.\n   */\n  selectivity: number;\n  limit: number | undefined;\n\n  fanout: FanoutCostModel;\n};\n\n/**\n * Omit the fanout function from a cost estimate for serialization.\n */\nexport function omitFanout(cost: CostEstimate): Omit<CostEstimate, 'fanout'> {\n  const {fanout: _, ...rest} = cost;\n  return rest;\n}\n\nexport type NodeType = PlannerNode['kind'];\n\nexport type JoinOrConnection = 'join' | 'connection';\n\nexport type JoinType = PlannerJoin['type'];\n"],"mappings":";;;;AA4DA,SAAgB,WAAW,MAAkD;CAC3E,MAAM,EAAC,QAAQ,GAAG,GAAG,SAAQ;CAC7B,OAAO;AACT"}

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

@@ -1 +1 @@
-{"version":3,"file":"planner-source.js","names":["#model"],"sources":["../../../../../zql/src/planner/planner-source.ts"],"sourcesContent":["import type {Condition, Ordering} from '../../../zero-protocol/src/ast.ts';\nimport {\n  PlannerConnection,\n  type ConnectionCostModel,\n} from './planner-connection.ts';\nimport type {PlannerConstraint} from './planner-constraint.ts';\n\nexport type {ConnectionCostModel};\n\nexport class PlannerSource {\n  readonly name: string;\n  readonly #model: ConnectionCostModel;\n\n  constructor(name: string, model: ConnectionCostModel) {\n    this.name = name;\n    this.#model = model;\n  }\n\n  connect(\n    sort: Ordering,\n    filters: Condition | undefined,\n    isRoot: boolean,\n    baseConstraints?: PlannerConstraint,\n    limit?: number,\n  ): PlannerConnection {\n    return new PlannerConnection(\n      this.name,\n      this.#model,\n      sort,\n      filters,\n      isRoot,\n      baseConstraints,\n      limit,\n    );\n  }\n}\n"],"mappings":";;AASA,IAAa,gBAAb,MAA2B;CACzB;CACA;CAEA,YAAY,MAAc,OAA4B;AACpD,OAAK,OAAO;AACZ,QAAA,QAAc;;CAGhB,QACE,MACA,SACA,QACA,iBACA,OACmB;AACnB,SAAO,IAAI,kBACT,KAAK,MACL,MAAA,OACA,MACA,SACA,QACA,iBACA,MACD"}
+{"version":3,"file":"planner-source.js","names":["#model"],"sources":["../../../../../zql/src/planner/planner-source.ts"],"sourcesContent":["import type {Condition, Ordering} from '../../../zero-protocol/src/ast.ts';\nimport {\n  PlannerConnection,\n  type ConnectionCostModel,\n} from './planner-connection.ts';\nimport type {PlannerConstraint} from './planner-constraint.ts';\n\nexport type {ConnectionCostModel};\n\nexport class PlannerSource {\n  readonly name: string;\n  readonly #model: ConnectionCostModel;\n\n  constructor(name: string, model: ConnectionCostModel) {\n    this.name = name;\n    this.#model = model;\n  }\n\n  connect(\n    sort: Ordering,\n    filters: Condition | undefined,\n    isRoot: boolean,\n    baseConstraints?: PlannerConstraint,\n    limit?: number,\n  ): PlannerConnection {\n    return new PlannerConnection(\n      this.name,\n      this.#model,\n      sort,\n      filters,\n      isRoot,\n      baseConstraints,\n      limit,\n    );\n  }\n}\n"],"mappings":";;AASA,IAAa,gBAAb,MAA2B;CACzB;CACA;CAEA,YAAY,MAAc,OAA4B;EACpD,KAAK,OAAO;EACZ,KAAKA,SAAS;CAChB;CAEA,QACE,MACA,SACA,QACA,iBACA,OACmB;EACnB,OAAO,IAAI,kBACT,KAAK,MACL,KAAKA,QACL,MACA,SACA,QACA,iBACA,KACF;CACF;AACF"}

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

@@ -1 +1 @@
-{"version":3,"file":"planner-terminus.js","names":["#input"],"sources":["../../../../../zql/src/planner/planner-terminus.ts"],"sourcesContent":["import type {PlanDebugger} from './planner-debug.ts';\nimport type {\n  CostEstimate,\n  JoinOrConnection,\n  PlannerNode,\n} from './planner-node.ts';\n\nexport class PlannerTerminus {\n  readonly kind = 'terminus' as const;\n  readonly #input: Exclude<PlannerNode, PlannerTerminus>;\n\n  constructor(input: Exclude<PlannerNode, PlannerTerminus>) {\n    this.#input = input;\n  }\n\n  get pinned(): boolean {\n    return true;\n  }\n\n  closestJoinOrSource(): JoinOrConnection {\n    return this.#input.closestJoinOrSource();\n  }\n\n  propagateConstraints(planDebugger?: PlanDebugger): void {\n    this.#input.propagateConstraints([], undefined, this, planDebugger);\n  }\n\n  estimateCost(planDebugger?: PlanDebugger): CostEstimate {\n    // Terminus starts the cost estimation flow with empty branch pattern\n    return this.#input.estimateCost(1, [], planDebugger);\n  }\n\n  /**\n   * Propagate unlimiting when a parent join is flipped.\n   * Terminus doesn't participate in unlimiting.\n   */\n  propagateUnlimitFromFlippedJoin(): void {\n    // No-op: terminus doesn't need to unlimit anything\n  }\n}\n"],"mappings":";AAOA,IAAa,kBAAb,MAA6B;CAC3B,OAAgB;CAChB;CAEA,YAAY,OAA8C;AACxD,QAAA,QAAc;;CAGhB,IAAI,SAAkB;AACpB,SAAO;;CAGT,sBAAwC;AACtC,SAAO,MAAA,MAAY,qBAAqB;;CAG1C,qBAAqB,cAAmC;AACtD,QAAA,MAAY,qBAAqB,EAAE,EAAE,KAAA,GAAW,MAAM,aAAa;;CAGrE,aAAa,cAA2C;AAEtD,SAAO,MAAA,MAAY,aAAa,GAAG,EAAE,EAAE,aAAa;;;;;;CAOtD,kCAAwC"}
+{"version":3,"file":"planner-terminus.js","names":["#input"],"sources":["../../../../../zql/src/planner/planner-terminus.ts"],"sourcesContent":["import type {PlanDebugger} from './planner-debug.ts';\nimport type {\n  CostEstimate,\n  JoinOrConnection,\n  PlannerNode,\n} from './planner-node.ts';\n\nexport class PlannerTerminus {\n  readonly kind = 'terminus' as const;\n  readonly #input: Exclude<PlannerNode, PlannerTerminus>;\n\n  constructor(input: Exclude<PlannerNode, PlannerTerminus>) {\n    this.#input = input;\n  }\n\n  get pinned(): boolean {\n    return true;\n  }\n\n  closestJoinOrSource(): JoinOrConnection {\n    return this.#input.closestJoinOrSource();\n  }\n\n  propagateConstraints(planDebugger?: PlanDebugger): void {\n    this.#input.propagateConstraints([], undefined, this, planDebugger);\n  }\n\n  estimateCost(planDebugger?: PlanDebugger): CostEstimate {\n    // Terminus starts the cost estimation flow with empty branch pattern\n    return this.#input.estimateCost(1, [], planDebugger);\n  }\n\n  /**\n   * Propagate unlimiting when a parent join is flipped.\n   * Terminus doesn't participate in unlimiting.\n   */\n  propagateUnlimitFromFlippedJoin(): void {\n    // No-op: terminus doesn't need to unlimit anything\n  }\n}\n"],"mappings":";AAOA,IAAa,kBAAb,MAA6B;CAC3B,OAAgB;CAChB;CAEA,YAAY,OAA8C;EACxD,KAAKA,SAAS;CAChB;CAEA,IAAI,SAAkB;EACpB,OAAO;CACT;CAEA,sBAAwC;EACtC,OAAO,KAAKA,OAAO,oBAAoB;CACzC;CAEA,qBAAqB,cAAmC;EACtD,KAAKA,OAAO,qBAAqB,CAAC,GAAG,KAAA,GAAW,MAAM,YAAY;CACpE;CAEA,aAAa,cAA2C;EAEtD,OAAO,KAAKA,OAAO,aAAa,GAAG,CAAC,GAAG,YAAY;CACrD;;;;;CAMA,kCAAwC,CAExC;AACF"}

package/out/zql/src/query/complete-ordering.js.map

@@ -1 +1 @@
-{"version":3,"file":"complete-ordering.js","names":[],"sources":["../../../../../zql/src/query/complete-ordering.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {AST, Condition, Ordering} from '../../../zero-protocol/src/ast.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\n\nexport function completeOrdering(\n  ast: AST,\n  getPrimaryKey: (tableName: string) => PrimaryKey,\n): AST {\n  const primaryKey = must(getPrimaryKey(ast.table));\n  return {\n    ...ast,\n    ...(ast.related\n      ? {\n          related: ast.related?.map(r => ({\n            ...r,\n            subquery: completeOrdering(r.subquery, getPrimaryKey),\n          })),\n        }\n      : undefined),\n    ...(ast.where\n      ? {\n          where: completeOrderingInCondition(ast.where, getPrimaryKey),\n        }\n      : undefined),\n    orderBy: addPrimaryKeys(primaryKey, ast.orderBy),\n  };\n}\n\nexport function assertOrderingIncludesPK(\n  ordering: Ordering,\n  pk: PrimaryKey,\n): void {\n  // oxlint-disable-next-line unicorn/prefer-set-has -- Array is more appropriate here for small collections\n  const orderingFields = ordering.map(([field]) => field);\n  const missingFields = pk.filter(pkField => !orderingFields.includes(pkField));\n\n  assert(\n    missingFields.length === 0,\n    `Ordering must include all primary key fields. Missing: ${missingFields.join(\n      ', ',\n    )}.`,\n  );\n}\n\nfunction completeOrderingInCondition<C extends Condition | undefined>(\n  condition: C,\n  getPrimaryKey: (tableName: string) => PrimaryKey,\n): C {\n  if (!condition) {\n    return condition;\n  }\n  if (condition.type === 'simple') {\n    return condition;\n  }\n  if (condition.type === 'correlatedSubquery') {\n    return {\n      ...condition,\n      related: {\n        ...condition.related,\n        subquery: completeOrdering(condition.related.subquery, getPrimaryKey),\n      },\n    };\n  }\n  condition.type satisfies 'and' | 'or';\n  return {\n    ...condition,\n    conditions: condition.conditions.map(c =>\n      completeOrderingInCondition(c, getPrimaryKey),\n    ),\n  };\n}\n\nfunction addPrimaryKeys(\n  primaryKey: PrimaryKey,\n  orderBy: Ordering | undefined,\n): Ordering {\n  orderBy = orderBy ?? [];\n  const primaryKeysToAdd = new Set(primaryKey);\n\n  for (const [field] of orderBy) {\n    primaryKeysToAdd.delete(field);\n  }\n\n  if (primaryKeysToAdd.size === 0) {\n    return orderBy;\n  }\n\n  return [\n    ...orderBy,\n    ...Array.from(primaryKeysToAdd, key => [key, 'asc'] as [string, 'asc']),\n  ];\n}\n"],"mappings":";;;AAKA,SAAgB,iBACd,KACA,eACK;CACL,MAAM,aAAa,KAAK,cAAc,IAAI,MAAM,CAAC;AACjD,QAAO;EACL,GAAG;EACH,GAAI,IAAI,UACJ,EACE,SAAS,IAAI,SAAS,KAAI,OAAM;GAC9B,GAAG;GACH,UAAU,iBAAiB,EAAE,UAAU,cAAc;GACtD,EAAE,EACJ,GACD,KAAA;EACJ,GAAI,IAAI,QACJ,EACE,OAAO,4BAA4B,IAAI,OAAO,cAAc,EAC7D,GACD,KAAA;EACJ,SAAS,eAAe,YAAY,IAAI,QAAQ;EACjD;;AAGH,SAAgB,yBACd,UACA,IACM;CAEN,MAAM,iBAAiB,SAAS,KAAK,CAAC,WAAW,MAAM;CACvD,MAAM,gBAAgB,GAAG,QAAO,YAAW,CAAC,eAAe,SAAS,QAAQ,CAAC;AAE7E,QACE,cAAc,WAAW,GACzB,0DAA0D,cAAc,KACtE,KACD,CAAC,GACH;;AAGH,SAAS,4BACP,WACA,eACG;AACH,KAAI,CAAC,UACH,QAAO;AAET,KAAI,UAAU,SAAS,SACrB,QAAO;AAET,KAAI,UAAU,SAAS,qBACrB,QAAO;EACL,GAAG;EACH,SAAS;GACP,GAAG,UAAU;GACb,UAAU,iBAAiB,UAAU,QAAQ,UAAU,cAAc;GACtE;EACF;AAEH,WAAU;AACV,QAAO;EACL,GAAG;EACH,YAAY,UAAU,WAAW,KAAI,MACnC,4BAA4B,GAAG,cAAc,CAC9C;EACF;;AAGH,SAAS,eACP,YACA,SACU;AACV,WAAU,WAAW,EAAE;CACvB,MAAM,mBAAmB,IAAI,IAAI,WAAW;AAE5C,MAAK,MAAM,CAAC,UAAU,QACpB,kBAAiB,OAAO,MAAM;AAGhC,KAAI,iBAAiB,SAAS,EAC5B,QAAO;AAGT,QAAO,CACL,GAAG,SACH,GAAG,MAAM,KAAK,mBAAkB,QAAO,CAAC,KAAK,MAAM,CAAoB,CACxE"}
+{"version":3,"file":"complete-ordering.js","names":[],"sources":["../../../../../zql/src/query/complete-ordering.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {AST, Condition, Ordering} from '../../../zero-protocol/src/ast.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\n\nexport function completeOrdering(\n  ast: AST,\n  getPrimaryKey: (tableName: string) => PrimaryKey,\n): AST {\n  const primaryKey = must(getPrimaryKey(ast.table));\n  return {\n    ...ast,\n    ...(ast.related\n      ? {\n          related: ast.related?.map(r => ({\n            ...r,\n            subquery: completeOrdering(r.subquery, getPrimaryKey),\n          })),\n        }\n      : undefined),\n    ...(ast.where\n      ? {\n          where: completeOrderingInCondition(ast.where, getPrimaryKey),\n        }\n      : undefined),\n    orderBy: addPrimaryKeys(primaryKey, ast.orderBy),\n  };\n}\n\nexport function assertOrderingIncludesPK(\n  ordering: Ordering,\n  pk: PrimaryKey,\n): void {\n  // oxlint-disable-next-line unicorn/prefer-set-has -- Array is more appropriate here for small collections\n  const orderingFields = ordering.map(([field]) => field);\n  const missingFields = pk.filter(pkField => !orderingFields.includes(pkField));\n\n  assert(\n    missingFields.length === 0,\n    `Ordering must include all primary key fields. Missing: ${missingFields.join(\n      ', ',\n    )}.`,\n  );\n}\n\nfunction completeOrderingInCondition<C extends Condition | undefined>(\n  condition: C,\n  getPrimaryKey: (tableName: string) => PrimaryKey,\n): C {\n  if (!condition) {\n    return condition;\n  }\n  if (condition.type === 'simple') {\n    return condition;\n  }\n  if (condition.type === 'correlatedSubquery') {\n    return {\n      ...condition,\n      related: {\n        ...condition.related,\n        subquery: completeOrdering(condition.related.subquery, getPrimaryKey),\n      },\n    };\n  }\n  condition.type satisfies 'and' | 'or';\n  return {\n    ...condition,\n    conditions: condition.conditions.map(c =>\n      completeOrderingInCondition(c, getPrimaryKey),\n    ),\n  };\n}\n\nfunction addPrimaryKeys(\n  primaryKey: PrimaryKey,\n  orderBy: Ordering | undefined,\n): Ordering {\n  orderBy = orderBy ?? [];\n  const primaryKeysToAdd = new Set(primaryKey);\n\n  for (const [field] of orderBy) {\n    primaryKeysToAdd.delete(field);\n  }\n\n  if (primaryKeysToAdd.size === 0) {\n    return orderBy;\n  }\n\n  return [\n    ...orderBy,\n    ...Array.from(primaryKeysToAdd, key => [key, 'asc'] as [string, 'asc']),\n  ];\n}\n"],"mappings":";;;AAKA,SAAgB,iBACd,KACA,eACK;CACL,MAAM,aAAa,KAAK,cAAc,IAAI,KAAK,CAAC;CAChD,OAAO;EACL,GAAG;EACH,GAAI,IAAI,UACJ,EACE,SAAS,IAAI,SAAS,KAAI,OAAM;GAC9B,GAAG;GACH,UAAU,iBAAiB,EAAE,UAAU,aAAa;EACtD,EAAE,EACJ,IACA,KAAA;EACJ,GAAI,IAAI,QACJ,EACE,OAAO,4BAA4B,IAAI,OAAO,aAAa,EAC7D,IACA,KAAA;EACJ,SAAS,eAAe,YAAY,IAAI,OAAO;CACjD;AACF;AAEA,SAAgB,yBACd,UACA,IACM;CAEN,MAAM,iBAAiB,SAAS,KAAK,CAAC,WAAW,KAAK;CACtD,MAAM,gBAAgB,GAAG,QAAO,YAAW,CAAC,eAAe,SAAS,OAAO,CAAC;CAE5E,OACE,cAAc,WAAW,GACzB,0DAA0D,cAAc,KACtE,IACF,EAAE,EACJ;AACF;AAEA,SAAS,4BACP,WACA,eACG;CACH,IAAI,CAAC,WACH,OAAO;CAET,IAAI,UAAU,SAAS,UACrB,OAAO;CAET,IAAI,UAAU,SAAS,sBACrB,OAAO;EACL,GAAG;EACH,SAAS;GACP,GAAG,UAAU;GACb,UAAU,iBAAiB,UAAU,QAAQ,UAAU,aAAa;EACtE;CACF;CAEF,UAAU;CACV,OAAO;EACL,GAAG;EACH,YAAY,UAAU,WAAW,KAAI,MACnC,4BAA4B,GAAG,aAAa,CAC9C;CACF;AACF;AAEA,SAAS,eACP,YACA,SACU;CACV,UAAU,WAAW,CAAC;CACtB,MAAM,mBAAmB,IAAI,IAAI,UAAU;CAE3C,KAAK,MAAM,CAAC,UAAU,SACpB,iBAAiB,OAAO,KAAK;CAG/B,IAAI,iBAAiB,SAAS,GAC5B,OAAO;CAGT,OAAO,CACL,GAAG,SACH,GAAG,MAAM,KAAK,mBAAkB,QAAO,CAAC,KAAK,KAAK,CAAoB,CACxE;AACF"}

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

@@ -1 +1 @@
-{"version":3,"file":"create-builder.js","names":[],"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 {ConditionalSchemaQuery, 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\n/** @deprecated Use {@linkcode createBuilder} with `tx.run(zql.table.where(...))` instead. */\nexport function createRunnableBuilder<S extends Schema>(\n  delegate: QueryDelegate,\n  schema: S,\n): ConditionalSchemaQuery<S> {\n  if (!schema.enableLegacyQueries) {\n    return undefined as ConditionalSchemaQuery<S>;\n  }\n\n  return createBuilderWithQueryFactory(schema, table =>\n    newRunnableQuery(delegate, schema, table),\n  ) as ConditionalSchemaQuery<S>;\n}\n\nfunction createBuilderWithQueryFactory<S extends Schema>(\n  schema: S,\n  queryFactory: (table: keyof S['tables'] & string) => Query<string, S>,\n): SchemaQuery<S> {\n  // Create a target with no prototype so accessing unknown properties returns\n  // undefined instead of inherited Object.prototype methods (e.g., toString).\n  // This fixes React 19 dev mode compatibility where accessing $$typeof should\n  // return undefined rather than throwing.\n  const target = Object.assign(Object.create(null), schema.tables) as Record<\n    string,\n    unknown\n  >;\n\n  // No onMissing handler needed - unknown properties return undefined due to\n  // null prototype, which is the desired behavior for normal JS object semantics.\n  return recordProxy(target, (_tableSchema, prop) =>\n    queryFactory(prop),\n  ) as SchemaQuery<S>;\n}\n"],"mappings":";;;;;;;AAWA,SAAgB,cAAgC,QAA2B;AACzE,QAAO,8BAA8B,SAAQ,UAC3C,SAAS,QAAQ,MAAM,CACxB;;;AAIH,SAAgB,sBACd,UACA,QAC2B;AAC3B,KAAI,CAAC,OAAO,oBACV;AAGF,QAAO,8BAA8B,SAAQ,UAC3C,iBAAiB,UAAU,QAAQ,MAAM,CAC1C;;AAGH,SAAS,8BACP,QACA,cACgB;AAYhB,QAAO,YAPQ,OAAO,OAAO,OAAO,OAAO,KAAK,EAAE,OAAO,OAAO,GAOpC,cAAc,SACxC,aAAa,KAAK,CACnB"}
+{"version":3,"file":"create-builder.js","names":[],"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 {ConditionalSchemaQuery, 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\n/** @deprecated Use {@linkcode createBuilder} with `tx.run(zql.table.where(...))` instead. */\nexport function createRunnableBuilder<S extends Schema>(\n  delegate: QueryDelegate,\n  schema: S,\n): ConditionalSchemaQuery<S> {\n  if (!schema.enableLegacyQueries) {\n    return undefined as ConditionalSchemaQuery<S>;\n  }\n\n  return createBuilderWithQueryFactory(schema, table =>\n    newRunnableQuery(delegate, schema, table),\n  ) as ConditionalSchemaQuery<S>;\n}\n\nfunction createBuilderWithQueryFactory<S extends Schema>(\n  schema: S,\n  queryFactory: (table: keyof S['tables'] & string) => Query<string, S>,\n): SchemaQuery<S> {\n  // Create a target with no prototype so accessing unknown properties returns\n  // undefined instead of inherited Object.prototype methods (e.g., toString).\n  // This fixes React 19 dev mode compatibility where accessing $$typeof should\n  // return undefined rather than throwing.\n  const target = Object.assign(Object.create(null), schema.tables) as Record<\n    string,\n    unknown\n  >;\n\n  // No onMissing handler needed - unknown properties return undefined due to\n  // null prototype, which is the desired behavior for normal JS object semantics.\n  return recordProxy(target, (_tableSchema, prop) =>\n    queryFactory(prop),\n  ) as SchemaQuery<S>;\n}\n"],"mappings":";;;;;;;AAWA,SAAgB,cAAgC,QAA2B;CACzE,OAAO,8BAA8B,SAAQ,UAC3C,SAAS,QAAQ,KAAK,CACxB;AACF;;AAGA,SAAgB,sBACd,UACA,QAC2B;CAC3B,IAAI,CAAC,OAAO,qBACV;CAGF,OAAO,8BAA8B,SAAQ,UAC3C,iBAAiB,UAAU,QAAQ,KAAK,CAC1C;AACF;AAEA,SAAS,8BACP,QACA,cACgB;CAYhB,OAAO,YAPQ,OAAO,OAAO,OAAO,OAAO,IAAI,GAAG,OAAO,MAOtC,IAAS,cAAc,SACxC,aAAa,IAAI,CACnB;AACF"}

package/out/zql/src/query/error.js.map

@@ -1 +1 @@
-{"version":3,"file":"error.js","names":[],"sources":["../../../../../zql/src/query/error.ts"],"sourcesContent":["export class QueryParseError extends Error {\n  constructor(opts: ErrorOptions) {\n    super(\n      opts?.cause instanceof Error\n        ? `Failed to parse arguments for query: ${opts.cause.message}`\n        : `Failed to parse arguments for query`,\n      opts,\n    );\n    this.name = 'QueryParseError';\n  }\n}\n"],"mappings":";AAAA,IAAa,kBAAb,cAAqC,MAAM;CACzC,YAAY,MAAoB;AAC9B,QACE,MAAM,iBAAiB,QACnB,wCAAwC,KAAK,MAAM,YACnD,uCACJ,KACD;AACD,OAAK,OAAO"}
+{"version":3,"file":"error.js","names":[],"sources":["../../../../../zql/src/query/error.ts"],"sourcesContent":["export class QueryParseError extends Error {\n  constructor(opts: ErrorOptions) {\n    super(\n      opts?.cause instanceof Error\n        ? `Failed to parse arguments for query: ${opts.cause.message}`\n        : `Failed to parse arguments for query`,\n      opts,\n    );\n    this.name = 'QueryParseError';\n  }\n}\n"],"mappings":";AAAA,IAAa,kBAAb,cAAqC,MAAM;CACzC,YAAY,MAAoB;EAC9B,MACE,MAAM,iBAAiB,QACnB,wCAAwC,KAAK,MAAM,YACnD,uCACJ,IACF;EACA,KAAK,OAAO;CACd;AACF"}

package/out/zql/src/query/escape-like.js.map

@@ -1 +1 @@
-{"version":3,"file":"escape-like.js","names":[],"sources":["../../../../../zql/src/query/escape-like.ts"],"sourcesContent":["export function escapeLike(val: string) {\n  return val.replace(/[%_]/g, '\\\\$&');\n}\n"],"mappings":";AAAA,SAAgB,WAAW,KAAa;AACtC,QAAO,IAAI,QAAQ,SAAS,OAAO"}
+{"version":3,"file":"escape-like.js","names":[],"sources":["../../../../../zql/src/query/escape-like.ts"],"sourcesContent":["export function escapeLike(val: string) {\n  return val.replace(/[%_]/g, '\\\\$&');\n}\n"],"mappings":";AAAA,SAAgB,WAAW,KAAa;CACtC,OAAO,IAAI,QAAQ,SAAS,MAAM;AACpC"}

package/out/zql/src/query/expression.js.map

@@ -1 +1 @@
-{"version":3,"file":"expression.js","names":["#exists"],"sources":["../../../../../zql/src/query/expression.ts"],"sourcesContent":["/* oxlint-disable @typescript-eslint/no-explicit-any */\nimport {must} from '../../../shared/src/must.ts';\nimport {\n  toStaticParam,\n  type Condition,\n  type LiteralValue,\n  type Parameter,\n  type SimpleOperator,\n} from '../../../zero-protocol/src/ast.ts';\nimport type {Schema as ZeroSchema} from '../../../zero-types/src/schema.ts';\nimport type {\n  AvailableRelationships,\n  DestTableName,\n  ExistsOptions,\n  GetFilterType,\n  NoCompoundTypeSelector,\n  PullTableSchema,\n  Query,\n} from './query.ts';\n\nexport type ParameterReference = {\n  [toStaticParam](): Parameter;\n};\n\n/**\n * A factory function that creates a condition. This is used to create\n * complex conditions that can be passed to the `where` method of a query.\n *\n * @example\n *\n * ```ts\n * const condition: ExpressionFactory<User> = ({and, cmp, or}) =>\n *   and(\n *     cmp('name', '=', 'Alice'),\n *     or(cmp('age', '>', 18), cmp('isStudent', '=', true)),\n *   );\n *\n * const query = z.query.user.where(condition);\n * ```\n */\nexport interface ExpressionFactory<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n> {\n  (eb: ExpressionBuilder<TTable, TSchema>): Condition;\n}\n\nexport class ExpressionBuilder<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n> {\n  readonly #exists: (\n    relationship: string,\n    cb?: (query: Query<TTable, TSchema>) => Query<TTable, TSchema, any>,\n    options?: ExistsOptions,\n  ) => Condition;\n\n  constructor(\n    exists: (\n      relationship: string,\n      cb?: (query: Query<TTable, TSchema>) => Query<TTable, TSchema, any>,\n      options?: ExistsOptions,\n    ) => Condition,\n  ) {\n    this.#exists = exists;\n    this.exists = this.exists.bind(this);\n  }\n\n  get eb() {\n    return this;\n  }\n\n  cmp<\n    TSelector extends NoCompoundTypeSelector<PullTableSchema<TTable, TSchema>>,\n    TOperator extends SimpleOperator,\n  >(\n    field: TSelector,\n    op: TOperator,\n    value:\n      | GetFilterType<PullTableSchema<TTable, TSchema>, TSelector, TOperator>\n      | ParameterReference\n      | undefined,\n  ): Condition;\n  cmp<\n    TSelector extends NoCompoundTypeSelector<PullTableSchema<TTable, TSchema>>,\n  >(\n    field: TSelector,\n    value:\n      | GetFilterType<PullTableSchema<TTable, TSchema>, TSelector, '='>\n      | ParameterReference\n      | undefined,\n  ): Condition;\n  cmp(\n    field: string,\n    opOrValue: SimpleOperator | ParameterReference | LiteralValue | undefined,\n    value?: ParameterReference | LiteralValue,\n  ): Condition {\n    if (arguments.length === 2) {\n      return cmp(field, opOrValue);\n    }\n    return cmp(field, opOrValue, value);\n  }\n\n  cmpLit(\n    left: ParameterReference | LiteralValue | undefined,\n    op: SimpleOperator,\n    right: ParameterReference | LiteralValue | undefined,\n  ): Condition {\n    return {\n      type: 'simple',\n      left: isParameterReference(left)\n        ? left[toStaticParam]()\n        : {type: 'literal', value: left ?? null},\n      right: isParameterReference(right)\n        ? right[toStaticParam]()\n        : {type: 'literal', value: right ?? null},\n      op,\n    };\n  }\n\n  and = and;\n  or = or;\n  not = not;\n\n  exists = <TRelationship extends AvailableRelationships<TTable, TSchema>>(\n    relationship: TRelationship,\n    cb?: (\n      query: Query<DestTableName<TTable, TSchema, TRelationship>, TSchema>,\n    ) => Query<any, TSchema>,\n    options?: ExistsOptions,\n  ): Condition => this.#exists(relationship, cb, options);\n}\n\nexport function and(...conditions: (Condition | undefined)[]): Condition {\n  const expressions = filterTrue(filterUndefined(conditions));\n\n  if (expressions.length === 1) {\n    return expressions[0];\n  }\n\n  if (expressions.some(isAlwaysFalse)) {\n    return FALSE;\n  }\n\n  return {type: 'and', conditions: expressions};\n}\n\nexport function or(...conditions: (Condition | undefined)[]): Condition {\n  const expressions = filterFalse(filterUndefined(conditions));\n\n  if (expressions.length === 1) {\n    return expressions[0];\n  }\n\n  if (expressions.some(isAlwaysTrue)) {\n    return TRUE;\n  }\n\n  return {type: 'or', conditions: expressions};\n}\n\nexport function not(expression: Condition): Condition {\n  switch (expression.type) {\n    case 'and':\n      return {\n        type: 'or',\n        conditions: expression.conditions.map(not),\n      };\n    case 'or':\n      return {\n        type: 'and',\n        conditions: expression.conditions.map(not),\n      };\n    case 'correlatedSubquery':\n      return {\n        type: 'correlatedSubquery',\n        related: expression.related,\n        op: negateOperator(expression.op),\n        ...(expression.flip !== undefined ? {flip: expression.flip} : {}),\n        ...(expression.scalar !== undefined ? {scalar: expression.scalar} : {}),\n      };\n    case 'simple':\n      return {\n        type: 'simple',\n        op: negateOperator(expression.op),\n        left: expression.left,\n        right: expression.right,\n      };\n  }\n}\n\nexport function cmp(\n  field: string,\n  opOrValue: SimpleOperator | ParameterReference | LiteralValue | undefined,\n  value?: ParameterReference | LiteralValue,\n): Condition {\n  let op: SimpleOperator;\n  let actualValue: ParameterReference | LiteralValue | undefined;\n\n  if (arguments.length === 2) {\n    // 2-arg form: cmp(field, value) - defaults to '=' operator\n    actualValue = opOrValue as ParameterReference | LiteralValue | undefined;\n    op = '=';\n  } else {\n    // 3-arg form: cmp(field, op, value)\n    op = opOrValue as SimpleOperator;\n    actualValue = value;\n  }\n\n  return {\n    type: 'simple',\n    left: {type: 'column', name: field},\n    right: isParameterReference(actualValue)\n      ? actualValue[toStaticParam]()\n      : {type: 'literal', value: actualValue ?? null},\n    op,\n  };\n}\n\nfunction isParameterReference(\n  value: ParameterReference | LiteralValue | null | undefined,\n): value is ParameterReference {\n  return (\n    value !== null &&\n    value !== undefined &&\n    typeof value === 'object' &&\n    (value as any)[toStaticParam]\n  );\n}\n\nexport const TRUE: Condition = {\n  type: 'and',\n  conditions: [],\n};\n\nconst FALSE: Condition = {\n  type: 'or',\n  conditions: [],\n};\n\nfunction isAlwaysTrue(condition: Condition): boolean {\n  return condition.type === 'and' && condition.conditions.length === 0;\n}\n\nfunction isAlwaysFalse(condition: Condition): boolean {\n  return condition.type === 'or' && condition.conditions.length === 0;\n}\n\nexport function simplifyCondition(c: Condition): Condition {\n  if (c.type === 'simple' || c.type === 'correlatedSubquery') {\n    return c;\n  }\n  if (c.conditions.length === 1) {\n    return simplifyCondition(c.conditions[0]);\n  }\n  const conditions = flatten(c.type, c.conditions.map(simplifyCondition));\n  if (c.type === 'and' && conditions.some(isAlwaysFalse)) {\n    return FALSE;\n  }\n  if (c.type === 'or' && conditions.some(isAlwaysTrue)) {\n    return TRUE;\n  }\n  return {\n    type: c.type,\n    conditions,\n  };\n}\n\nexport function flatten(\n  type: 'and' | 'or',\n  conditions: readonly Condition[],\n): Condition[] {\n  const flattened: Condition[] = [];\n  for (const c of conditions) {\n    if (c.type === type) {\n      flattened.push(...c.conditions);\n    } else {\n      flattened.push(c);\n    }\n  }\n\n  return flattened;\n}\n\nconst negateSimpleOperatorMap = {\n  ['=']: '!=',\n  ['!=']: '=',\n  ['<']: '>=',\n  ['>']: '<=',\n  ['>=']: '<',\n  ['<=']: '>',\n  ['IN']: 'NOT IN',\n  ['NOT IN']: 'IN',\n  ['LIKE']: 'NOT LIKE',\n  ['NOT LIKE']: 'LIKE',\n  ['ILIKE']: 'NOT ILIKE',\n  ['NOT ILIKE']: 'ILIKE',\n  ['IS']: 'IS NOT',\n  ['IS NOT']: 'IS',\n} as const;\n\nconst negateOperatorMap = {\n  ...negateSimpleOperatorMap,\n  ['EXISTS']: 'NOT EXISTS',\n  ['NOT EXISTS']: 'EXISTS',\n} as const;\n\nexport function negateOperator<OP extends keyof typeof negateOperatorMap>(\n  op: OP,\n): (typeof negateOperatorMap)[OP] {\n  return must(negateOperatorMap[op]);\n}\n\nfunction filterUndefined<T>(array: (T | undefined)[]): T[] {\n  return array.filter(e => e !== undefined);\n}\n\nfunction filterTrue(conditions: Condition[]): Condition[] {\n  return conditions.filter(c => !isAlwaysTrue(c));\n}\n\nfunction filterFalse(conditions: Condition[]): Condition[] {\n  return conditions.filter(c => !isAlwaysFalse(c));\n}\n"],"mappings":";;;AA+CA,IAAa,oBAAb,MAGE;CACA;CAMA,YACE,QAKA;AACA,QAAA,SAAe;AACf,OAAK,SAAS,KAAK,OAAO,KAAK,KAAK;;CAGtC,IAAI,KAAK;AACP,SAAO;;CAuBT,IACE,OACA,WACA,OACW;AACX,MAAI,UAAU,WAAW,EACvB,QAAO,IAAI,OAAO,UAAU;AAE9B,SAAO,IAAI,OAAO,WAAW,MAAM;;CAGrC,OACE,MACA,IACA,OACW;AACX,SAAO;GACL,MAAM;GACN,MAAM,qBAAqB,KAAK,GAC5B,KAAK,gBAAgB,GACrB;IAAC,MAAM;IAAW,OAAO,QAAQ;IAAK;GAC1C,OAAO,qBAAqB,MAAM,GAC9B,MAAM,gBAAgB,GACtB;IAAC,MAAM;IAAW,OAAO,SAAS;IAAK;GAC3C;GACD;;CAGH,MAAM;CACN,KAAK;CACL,MAAM;CAEN,UACE,cACA,IAGA,YACc,MAAA,OAAa,cAAc,IAAI,QAAQ;;AAGzD,SAAgB,IAAI,GAAG,YAAkD;CACvE,MAAM,cAAc,WAAW,gBAAgB,WAAW,CAAC;AAE3D,KAAI,YAAY,WAAW,EACzB,QAAO,YAAY;AAGrB,KAAI,YAAY,KAAK,cAAc,CACjC,QAAO;AAGT,QAAO;EAAC,MAAM;EAAO,YAAY;EAAY;;AAG/C,SAAgB,GAAG,GAAG,YAAkD;CACtE,MAAM,cAAc,YAAY,gBAAgB,WAAW,CAAC;AAE5D,KAAI,YAAY,WAAW,EACzB,QAAO,YAAY;AAGrB,KAAI,YAAY,KAAK,aAAa,CAChC,QAAO;AAGT,QAAO;EAAC,MAAM;EAAM,YAAY;EAAY;;AAG9C,SAAgB,IAAI,YAAkC;AACpD,SAAQ,WAAW,MAAnB;EACE,KAAK,MACH,QAAO;GACL,MAAM;GACN,YAAY,WAAW,WAAW,IAAI,IAAI;GAC3C;EACH,KAAK,KACH,QAAO;GACL,MAAM;GACN,YAAY,WAAW,WAAW,IAAI,IAAI;GAC3C;EACH,KAAK,qBACH,QAAO;GACL,MAAM;GACN,SAAS,WAAW;GACpB,IAAI,eAAe,WAAW,GAAG;GACjC,GAAI,WAAW,SAAS,KAAA,IAAY,EAAC,MAAM,WAAW,MAAK,GAAG,EAAE;GAChE,GAAI,WAAW,WAAW,KAAA,IAAY,EAAC,QAAQ,WAAW,QAAO,GAAG,EAAE;GACvE;EACH,KAAK,SACH,QAAO;GACL,MAAM;GACN,IAAI,eAAe,WAAW,GAAG;GACjC,MAAM,WAAW;GACjB,OAAO,WAAW;GACnB;;;AAIP,SAAgB,IACd,OACA,WACA,OACW;CACX,IAAI;CACJ,IAAI;AAEJ,KAAI,UAAU,WAAW,GAAG;AAE1B,gBAAc;AACd,OAAK;QACA;AAEL,OAAK;AACL,gBAAc;;AAGhB,QAAO;EACL,MAAM;EACN,MAAM;GAAC,MAAM;GAAU,MAAM;GAAM;EACnC,OAAO,qBAAqB,YAAY,GACpC,YAAY,gBAAgB,GAC5B;GAAC,MAAM;GAAW,OAAO,eAAe;GAAK;EACjD;EACD;;AAGH,SAAS,qBACP,OAC6B;AAC7B,QACE,UAAU,QACV,UAAU,KAAA,KACV,OAAO,UAAU,YAChB,MAAc;;AAInB,IAAa,OAAkB;CAC7B,MAAM;CACN,YAAY,EAAE;CACf;AAED,IAAM,QAAmB;CACvB,MAAM;CACN,YAAY,EAAE;CACf;AAED,SAAS,aAAa,WAA+B;AACnD,QAAO,UAAU,SAAS,SAAS,UAAU,WAAW,WAAW;;AAGrE,SAAS,cAAc,WAA+B;AACpD,QAAO,UAAU,SAAS,QAAQ,UAAU,WAAW,WAAW;;AAGpE,SAAgB,kBAAkB,GAAyB;AACzD,KAAI,EAAE,SAAS,YAAY,EAAE,SAAS,qBACpC,QAAO;AAET,KAAI,EAAE,WAAW,WAAW,EAC1B,QAAO,kBAAkB,EAAE,WAAW,GAAG;CAE3C,MAAM,aAAa,QAAQ,EAAE,MAAM,EAAE,WAAW,IAAI,kBAAkB,CAAC;AACvE,KAAI,EAAE,SAAS,SAAS,WAAW,KAAK,cAAc,CACpD,QAAO;AAET,KAAI,EAAE,SAAS,QAAQ,WAAW,KAAK,aAAa,CAClD,QAAO;AAET,QAAO;EACL,MAAM,EAAE;EACR;EACD;;AAGH,SAAgB,QACd,MACA,YACa;CACb,MAAM,YAAyB,EAAE;AACjC,MAAK,MAAM,KAAK,WACd,KAAI,EAAE,SAAS,KACb,WAAU,KAAK,GAAG,EAAE,WAAW;KAE/B,WAAU,KAAK,EAAE;AAIrB,QAAO;;AAoBT,IAAM,oBAAoB;EAhBvB,MAAM;EACN,OAAO;EACP,MAAM;EACN,MAAM;EACN,OAAO;EACP,OAAO;EACP,OAAO;EACP,WAAW;EACX,SAAS;EACT,aAAa;EACb,UAAU;EACV,cAAc;EACd,OAAO;EACP,WAAW;EAKX,WAAW;EACX,eAAe;CACjB;AAED,SAAgB,eACd,IACgC;AAChC,QAAO,KAAK,kBAAkB,IAAI;;AAGpC,SAAS,gBAAmB,OAA+B;AACzD,QAAO,MAAM,QAAO,MAAK,MAAM,KAAA,EAAU;;AAG3C,SAAS,WAAW,YAAsC;AACxD,QAAO,WAAW,QAAO,MAAK,CAAC,aAAa,EAAE,CAAC;;AAGjD,SAAS,YAAY,YAAsC;AACzD,QAAO,WAAW,QAAO,MAAK,CAAC,cAAc,EAAE,CAAC"}
+{"version":3,"file":"expression.js","names":["#exists"],"sources":["../../../../../zql/src/query/expression.ts"],"sourcesContent":["/* oxlint-disable @typescript-eslint/no-explicit-any */\nimport {must} from '../../../shared/src/must.ts';\nimport {\n  toStaticParam,\n  type Condition,\n  type LiteralValue,\n  type Parameter,\n  type SimpleOperator,\n} from '../../../zero-protocol/src/ast.ts';\nimport type {Schema as ZeroSchema} from '../../../zero-types/src/schema.ts';\nimport type {\n  AvailableRelationships,\n  DestTableName,\n  ExistsOptions,\n  GetFilterType,\n  NoCompoundTypeSelector,\n  PullTableSchema,\n  Query,\n} from './query.ts';\n\nexport type ParameterReference = {\n  [toStaticParam](): Parameter;\n};\n\n/**\n * A factory function that creates a condition. This is used to create\n * complex conditions that can be passed to the `where` method of a query.\n *\n * @example\n *\n * ```ts\n * const condition: ExpressionFactory<User> = ({and, cmp, or}) =>\n *   and(\n *     cmp('name', '=', 'Alice'),\n *     or(cmp('age', '>', 18), cmp('isStudent', '=', true)),\n *   );\n *\n * const query = z.query.user.where(condition);\n * ```\n */\nexport interface ExpressionFactory<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n> {\n  (eb: ExpressionBuilder<TTable, TSchema>): Condition;\n}\n\nexport class ExpressionBuilder<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n> {\n  readonly #exists: (\n    relationship: string,\n    cb?: (query: Query<TTable, TSchema>) => Query<TTable, TSchema, any>,\n    options?: ExistsOptions,\n  ) => Condition;\n\n  constructor(\n    exists: (\n      relationship: string,\n      cb?: (query: Query<TTable, TSchema>) => Query<TTable, TSchema, any>,\n      options?: ExistsOptions,\n    ) => Condition,\n  ) {\n    this.#exists = exists;\n    this.exists = this.exists.bind(this);\n  }\n\n  get eb() {\n    return this;\n  }\n\n  cmp<\n    TSelector extends NoCompoundTypeSelector<PullTableSchema<TTable, TSchema>>,\n    TOperator extends SimpleOperator,\n  >(\n    field: TSelector,\n    op: TOperator,\n    value:\n      | GetFilterType<PullTableSchema<TTable, TSchema>, TSelector, TOperator>\n      | ParameterReference\n      | undefined,\n  ): Condition;\n  cmp<\n    TSelector extends NoCompoundTypeSelector<PullTableSchema<TTable, TSchema>>,\n  >(\n    field: TSelector,\n    value:\n      | GetFilterType<PullTableSchema<TTable, TSchema>, TSelector, '='>\n      | ParameterReference\n      | undefined,\n  ): Condition;\n  cmp(\n    field: string,\n    opOrValue: SimpleOperator | ParameterReference | LiteralValue | undefined,\n    value?: ParameterReference | LiteralValue,\n  ): Condition {\n    if (arguments.length === 2) {\n      return cmp(field, opOrValue);\n    }\n    return cmp(field, opOrValue, value);\n  }\n\n  cmpLit(\n    left: ParameterReference | LiteralValue | undefined,\n    op: SimpleOperator,\n    right: ParameterReference | LiteralValue | undefined,\n  ): Condition {\n    return {\n      type: 'simple',\n      left: isParameterReference(left)\n        ? left[toStaticParam]()\n        : {type: 'literal', value: left ?? null},\n      right: isParameterReference(right)\n        ? right[toStaticParam]()\n        : {type: 'literal', value: right ?? null},\n      op,\n    };\n  }\n\n  and = and;\n  or = or;\n  not = not;\n\n  exists = <TRelationship extends AvailableRelationships<TTable, TSchema>>(\n    relationship: TRelationship,\n    cb?: (\n      query: Query<DestTableName<TTable, TSchema, TRelationship>, TSchema>,\n    ) => Query<any, TSchema>,\n    options?: ExistsOptions,\n  ): Condition => this.#exists(relationship, cb, options);\n}\n\nexport function and(...conditions: (Condition | undefined)[]): Condition {\n  const expressions = filterTrue(filterUndefined(conditions));\n\n  if (expressions.length === 1) {\n    return expressions[0];\n  }\n\n  if (expressions.some(isAlwaysFalse)) {\n    return FALSE;\n  }\n\n  return {type: 'and', conditions: expressions};\n}\n\nexport function or(...conditions: (Condition | undefined)[]): Condition {\n  const expressions = filterFalse(filterUndefined(conditions));\n\n  if (expressions.length === 1) {\n    return expressions[0];\n  }\n\n  if (expressions.some(isAlwaysTrue)) {\n    return TRUE;\n  }\n\n  return {type: 'or', conditions: expressions};\n}\n\nexport function not(expression: Condition): Condition {\n  switch (expression.type) {\n    case 'and':\n      return {\n        type: 'or',\n        conditions: expression.conditions.map(not),\n      };\n    case 'or':\n      return {\n        type: 'and',\n        conditions: expression.conditions.map(not),\n      };\n    case 'correlatedSubquery':\n      return {\n        type: 'correlatedSubquery',\n        related: expression.related,\n        op: negateOperator(expression.op),\n        ...(expression.flip !== undefined ? {flip: expression.flip} : {}),\n        ...(expression.scalar !== undefined ? {scalar: expression.scalar} : {}),\n      };\n    case 'simple':\n      return {\n        type: 'simple',\n        op: negateOperator(expression.op),\n        left: expression.left,\n        right: expression.right,\n      };\n  }\n}\n\nexport function cmp(\n  field: string,\n  opOrValue: SimpleOperator | ParameterReference | LiteralValue | undefined,\n  value?: ParameterReference | LiteralValue,\n): Condition {\n  let op: SimpleOperator;\n  let actualValue: ParameterReference | LiteralValue | undefined;\n\n  if (arguments.length === 2) {\n    // 2-arg form: cmp(field, value) - defaults to '=' operator\n    actualValue = opOrValue as ParameterReference | LiteralValue | undefined;\n    op = '=';\n  } else {\n    // 3-arg form: cmp(field, op, value)\n    op = opOrValue as SimpleOperator;\n    actualValue = value;\n  }\n\n  return {\n    type: 'simple',\n    left: {type: 'column', name: field},\n    right: isParameterReference(actualValue)\n      ? actualValue[toStaticParam]()\n      : {type: 'literal', value: actualValue ?? null},\n    op,\n  };\n}\n\nfunction isParameterReference(\n  value: ParameterReference | LiteralValue | null | undefined,\n): value is ParameterReference {\n  return (\n    value !== null &&\n    value !== undefined &&\n    typeof value === 'object' &&\n    (value as any)[toStaticParam]\n  );\n}\n\nexport const TRUE: Condition = {\n  type: 'and',\n  conditions: [],\n};\n\nconst FALSE: Condition = {\n  type: 'or',\n  conditions: [],\n};\n\nfunction isAlwaysTrue(condition: Condition): boolean {\n  return condition.type === 'and' && condition.conditions.length === 0;\n}\n\nfunction isAlwaysFalse(condition: Condition): boolean {\n  return condition.type === 'or' && condition.conditions.length === 0;\n}\n\nexport function simplifyCondition(c: Condition): Condition {\n  if (c.type === 'simple' || c.type === 'correlatedSubquery') {\n    return c;\n  }\n  if (c.conditions.length === 1) {\n    return simplifyCondition(c.conditions[0]);\n  }\n  const conditions = flatten(c.type, c.conditions.map(simplifyCondition));\n  if (c.type === 'and' && conditions.some(isAlwaysFalse)) {\n    return FALSE;\n  }\n  if (c.type === 'or' && conditions.some(isAlwaysTrue)) {\n    return TRUE;\n  }\n  return {\n    type: c.type,\n    conditions,\n  };\n}\n\nexport function flatten(\n  type: 'and' | 'or',\n  conditions: readonly Condition[],\n): Condition[] {\n  const flattened: Condition[] = [];\n  for (const c of conditions) {\n    if (c.type === type) {\n      flattened.push(...c.conditions);\n    } else {\n      flattened.push(c);\n    }\n  }\n\n  return flattened;\n}\n\nconst negateSimpleOperatorMap = {\n  ['=']: '!=',\n  ['!=']: '=',\n  ['<']: '>=',\n  ['>']: '<=',\n  ['>=']: '<',\n  ['<=']: '>',\n  ['IN']: 'NOT IN',\n  ['NOT IN']: 'IN',\n  ['LIKE']: 'NOT LIKE',\n  ['NOT LIKE']: 'LIKE',\n  ['ILIKE']: 'NOT ILIKE',\n  ['NOT ILIKE']: 'ILIKE',\n  ['IS']: 'IS NOT',\n  ['IS NOT']: 'IS',\n} as const;\n\nconst negateOperatorMap = {\n  ...negateSimpleOperatorMap,\n  ['EXISTS']: 'NOT EXISTS',\n  ['NOT EXISTS']: 'EXISTS',\n} as const;\n\nexport function negateOperator<OP extends keyof typeof negateOperatorMap>(\n  op: OP,\n): (typeof negateOperatorMap)[OP] {\n  return must(negateOperatorMap[op]);\n}\n\nfunction filterUndefined<T>(array: (T | undefined)[]): T[] {\n  return array.filter(e => e !== undefined);\n}\n\nfunction filterTrue(conditions: Condition[]): Condition[] {\n  return conditions.filter(c => !isAlwaysTrue(c));\n}\n\nfunction filterFalse(conditions: Condition[]): Condition[] {\n  return conditions.filter(c => !isAlwaysFalse(c));\n}\n"],"mappings":";;;AA+CA,IAAa,oBAAb,MAGE;CACA;CAMA,YACE,QAKA;EACA,KAAKA,UAAU;EACf,KAAK,SAAS,KAAK,OAAO,KAAK,IAAI;CACrC;CAEA,IAAI,KAAK;EACP,OAAO;CACT;CAsBA,IACE,OACA,WACA,OACW;EACX,IAAI,UAAU,WAAW,GACvB,OAAO,IAAI,OAAO,SAAS;EAE7B,OAAO,IAAI,OAAO,WAAW,KAAK;CACpC;CAEA,OACE,MACA,IACA,OACW;EACX,OAAO;GACL,MAAM;GACN,MAAM,qBAAqB,IAAI,IAC3B,KAAK,eAAe,IACpB;IAAC,MAAM;IAAW,OAAO,QAAQ;GAAI;GACzC,OAAO,qBAAqB,KAAK,IAC7B,MAAM,eAAe,IACrB;IAAC,MAAM;IAAW,OAAO,SAAS;GAAI;GAC1C;EACF;CACF;CAEA,MAAM;CACN,KAAK;CACL,MAAM;CAEN,UACE,cACA,IAGA,YACc,KAAKA,QAAQ,cAAc,IAAI,OAAO;AACxD;AAEA,SAAgB,IAAI,GAAG,YAAkD;CACvE,MAAM,cAAc,WAAW,gBAAgB,UAAU,CAAC;CAE1D,IAAI,YAAY,WAAW,GACzB,OAAO,YAAY;CAGrB,IAAI,YAAY,KAAK,aAAa,GAChC,OAAO;CAGT,OAAO;EAAC,MAAM;EAAO,YAAY;CAAW;AAC9C;AAEA,SAAgB,GAAG,GAAG,YAAkD;CACtE,MAAM,cAAc,YAAY,gBAAgB,UAAU,CAAC;CAE3D,IAAI,YAAY,WAAW,GACzB,OAAO,YAAY;CAGrB,IAAI,YAAY,KAAK,YAAY,GAC/B,OAAO;CAGT,OAAO;EAAC,MAAM;EAAM,YAAY;CAAW;AAC7C;AAEA,SAAgB,IAAI,YAAkC;CACpD,QAAQ,WAAW,MAAnB;EACE,KAAK,OACH,OAAO;GACL,MAAM;GACN,YAAY,WAAW,WAAW,IAAI,GAAG;EAC3C;EACF,KAAK,MACH,OAAO;GACL,MAAM;GACN,YAAY,WAAW,WAAW,IAAI,GAAG;EAC3C;EACF,KAAK,sBACH,OAAO;GACL,MAAM;GACN,SAAS,WAAW;GACpB,IAAI,eAAe,WAAW,EAAE;GAChC,GAAI,WAAW,SAAS,KAAA,IAAY,EAAC,MAAM,WAAW,KAAI,IAAI,CAAC;GAC/D,GAAI,WAAW,WAAW,KAAA,IAAY,EAAC,QAAQ,WAAW,OAAM,IAAI,CAAC;EACvE;EACF,KAAK,UACH,OAAO;GACL,MAAM;GACN,IAAI,eAAe,WAAW,EAAE;GAChC,MAAM,WAAW;GACjB,OAAO,WAAW;EACpB;CACJ;AACF;AAEA,SAAgB,IACd,OACA,WACA,OACW;CACX,IAAI;CACJ,IAAI;CAEJ,IAAI,UAAU,WAAW,GAAG;EAE1B,cAAc;EACd,KAAK;CACP,OAAO;EAEL,KAAK;EACL,cAAc;CAChB;CAEA,OAAO;EACL,MAAM;EACN,MAAM;GAAC,MAAM;GAAU,MAAM;EAAK;EAClC,OAAO,qBAAqB,WAAW,IACnC,YAAY,eAAe,IAC3B;GAAC,MAAM;GAAW,OAAO,eAAe;EAAI;EAChD;CACF;AACF;AAEA,SAAS,qBACP,OAC6B;CAC7B,OACE,UAAU,QACV,UAAU,KAAA,KACV,OAAO,UAAU,YAChB,MAAc;AAEnB;AAEA,IAAa,OAAkB;CAC7B,MAAM;CACN,YAAY,CAAC;AACf;AAEA,IAAM,QAAmB;CACvB,MAAM;CACN,YAAY,CAAC;AACf;AAEA,SAAS,aAAa,WAA+B;CACnD,OAAO,UAAU,SAAS,SAAS,UAAU,WAAW,WAAW;AACrE;AAEA,SAAS,cAAc,WAA+B;CACpD,OAAO,UAAU,SAAS,QAAQ,UAAU,WAAW,WAAW;AACpE;AAEA,SAAgB,kBAAkB,GAAyB;CACzD,IAAI,EAAE,SAAS,YAAY,EAAE,SAAS,sBACpC,OAAO;CAET,IAAI,EAAE,WAAW,WAAW,GAC1B,OAAO,kBAAkB,EAAE,WAAW,EAAE;CAE1C,MAAM,aAAa,QAAQ,EAAE,MAAM,EAAE,WAAW,IAAI,iBAAiB,CAAC;CACtE,IAAI,EAAE,SAAS,SAAS,WAAW,KAAK,aAAa,GACnD,OAAO;CAET,IAAI,EAAE,SAAS,QAAQ,WAAW,KAAK,YAAY,GACjD,OAAO;CAET,OAAO;EACL,MAAM,EAAE;EACR;CACF;AACF;AAEA,SAAgB,QACd,MACA,YACa;CACb,MAAM,YAAyB,CAAC;CAChC,KAAK,MAAM,KAAK,YACd,IAAI,EAAE,SAAS,MACb,UAAU,KAAK,GAAG,EAAE,UAAU;MAE9B,UAAU,KAAK,CAAC;CAIpB,OAAO;AACT;AAmBA,IAAM,oBAAoB;EAhBvB,MAAM;EACN,OAAO;EACP,MAAM;EACN,MAAM;EACN,OAAO;EACP,OAAO;EACP,OAAO;EACP,WAAW;EACX,SAAS;EACT,aAAa;EACb,UAAU;EACV,cAAc;EACd,OAAO;EACP,WAAW;EAKX,WAAW;EACX,eAAe;AAClB;AAEA,SAAgB,eACd,IACgC;CAChC,OAAO,KAAK,kBAAkB,GAAG;AACnC;AAEA,SAAS,gBAAmB,OAA+B;CACzD,OAAO,MAAM,QAAO,MAAK,MAAM,KAAA,CAAS;AAC1C;AAEA,SAAS,WAAW,YAAsC;CACxD,OAAO,WAAW,QAAO,MAAK,CAAC,aAAa,CAAC,CAAC;AAChD;AAEA,SAAS,YAAY,YAAsC;CACzD,OAAO,WAAW,QAAO,MAAK,CAAC,cAAc,CAAC,CAAC;AACjD"}

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

@@ -1 +1 @@
-{"version":3,"file":"measure-push-operator.js","names":["#input","#queryID","#metricsDelegate","#metricName","#output"],"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"],"mappings":";;AAeA,IAAa,sBAAb,MAAqD;CACnD;CACA;CACA;CAEA,UAAkB;CAClB;CAEA,YACE,OACA,SACA,iBACA,YACA;AACA,QAAA,QAAc;AACd,QAAA,UAAgB;AAChB,QAAA,kBAAwB;AACxB,QAAA,aAAmB;AACnB,QAAM,UAAU,KAAK;;CAGvB,UAAU,QAAsB;AAC9B,QAAA,SAAe;;CAGjB,MAAM,KAA2C;AAC/C,SAAO,MAAA,MAAY,MAAM,IAAI;;CAG/B,YAA0B;AACxB,SAAO,MAAA,MAAY,WAAW;;CAGhC,UAAgB;AACd,QAAA,MAAY,SAAS;;CAGvB,CAAC,KAAK,QAAiC;EACrC,MAAM,YAAY,YAAY,KAAK;AACnC,SAAO,MAAA,OAAa,KAAK,QAAQ,KAAK;AACtC,QAAA,gBAAsB,UACpB,MAAA,YACA,YAAY,KAAK,GAAG,WACpB,MAAA,QACD"}
+{"version":3,"file":"measure-push-operator.js","names":["#input","#queryID","#metricsDelegate","#metricName","#output"],"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"],"mappings":";;AAeA,IAAa,sBAAb,MAAqD;CACnD;CACA;CACA;CAEA,UAAkB;CAClB;CAEA,YACE,OACA,SACA,iBACA,YACA;EACA,KAAKA,SAAS;EACd,KAAKC,WAAW;EAChB,KAAKC,mBAAmB;EACxB,KAAKC,cAAc;EACnB,MAAM,UAAU,IAAI;CACtB;CAEA,UAAU,QAAsB;EAC9B,KAAKC,UAAU;CACjB;CAEA,MAAM,KAA2C;EAC/C,OAAO,KAAKJ,OAAO,MAAM,GAAG;CAC9B;CAEA,YAA0B;EACxB,OAAO,KAAKA,OAAO,UAAU;CAC/B;CAEA,UAAgB;EACd,KAAKA,OAAO,QAAQ;CACtB;CAEA,CAAC,KAAK,QAAiC;EACrC,MAAM,YAAY,YAAY,IAAI;EAClC,OAAO,KAAKI,QAAQ,KAAK,QAAQ,IAAI;EACrC,KAAKF,iBAAiB,UACpB,KAAKC,aACL,YAAY,IAAI,IAAI,WACpB,KAAKF,QACP;CACF;AACF"}

package/out/zql/src/query/metrics-delegate.js.map

@@ -1 +1 @@
-{"version":3,"file":"metrics-delegate.js","names":[],"sources":["../../../../../zql/src/query/metrics-delegate.ts"],"sourcesContent":["import type {AST} from '../../../zero-protocol/src/ast.ts';\n\nexport type ClientMetricMap = {\n  'query-materialization-client': [queryID: string];\n  'query-materialization-end-to-end': [queryID: string, ast: AST];\n  'query-update-client': [queryID: string];\n};\n\nexport type ServerMetricMap = {\n  'query-materialization-server': [queryID: string];\n  'query-update-server': [queryID: string];\n};\n\nexport type MetricMap = ClientMetricMap & ServerMetricMap;\n\nexport interface MetricsDelegate {\n  addMetric<K extends keyof MetricMap>(\n    metric: K,\n    value: number,\n    ...args: MetricMap[K]\n  ): void;\n}\n\nexport function isClientMetric(\n  metric: keyof MetricMap,\n): metric is keyof ClientMetricMap {\n  return metric.endsWith('-client') || metric.endsWith('-end-to-end');\n}\n\nexport function isServerMetric(\n  metric: keyof MetricMap,\n): metric is keyof ServerMetricMap {\n  return metric.endsWith('-server');\n}\n"],"mappings":";AAuBA,SAAgB,eACd,QACiC;AACjC,QAAO,OAAO,SAAS,UAAU,IAAI,OAAO,SAAS,cAAc;;AAGrE,SAAgB,eACd,QACiC;AACjC,QAAO,OAAO,SAAS,UAAU"}
+{"version":3,"file":"metrics-delegate.js","names":[],"sources":["../../../../../zql/src/query/metrics-delegate.ts"],"sourcesContent":["import type {AST} from '../../../zero-protocol/src/ast.ts';\n\nexport type ClientMetricMap = {\n  'query-materialization-client': [queryID: string];\n  'query-materialization-end-to-end': [queryID: string, ast: AST];\n  'query-update-client': [queryID: string];\n};\n\nexport type ServerMetricMap = {\n  'query-materialization-server': [queryID: string];\n  'query-update-server': [queryID: string];\n};\n\nexport type MetricMap = ClientMetricMap & ServerMetricMap;\n\nexport interface MetricsDelegate {\n  addMetric<K extends keyof MetricMap>(\n    metric: K,\n    value: number,\n    ...args: MetricMap[K]\n  ): void;\n}\n\nexport function isClientMetric(\n  metric: keyof MetricMap,\n): metric is keyof ClientMetricMap {\n  return metric.endsWith('-client') || metric.endsWith('-end-to-end');\n}\n\nexport function isServerMetric(\n  metric: keyof MetricMap,\n): metric is keyof ServerMetricMap {\n  return metric.endsWith('-server');\n}\n"],"mappings":";AAuBA,SAAgB,eACd,QACiC;CACjC,OAAO,OAAO,SAAS,SAAS,KAAK,OAAO,SAAS,aAAa;AACpE;AAEA,SAAgB,eACd,QACiC;CACjC,OAAO,OAAO,SAAS,SAAS;AAClC"}

package/out/zql/src/query/named.js.map

@@ -1 +1 @@
-{"version":3,"file":"named.js","names":[],"sources":["../../../../../zql/src/query/named.ts"],"sourcesContent":["import type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport {QueryParseError} from './error.ts';\nimport {asQueryInternals} from './query-internals.ts';\nimport {type AnyQuery} from './query.ts';\n\n/** @deprecated */\nexport type QueryFn<\n  TContext,\n  TTakesContext extends boolean,\n  TArg extends ReadonlyJSONValue[],\n  TReturnQuery extends AnyQuery,\n> = TTakesContext extends false\n  ? {(...args: TArg): TReturnQuery}\n  : {(context: TContext, ...args: TArg): TReturnQuery};\n\n/** @deprecated */\nexport type SyncedQuery<\n  TName extends string,\n  TContext,\n  TTakesContext extends boolean,\n  TArg extends ReadonlyJSONValue[],\n  TReturnQuery extends AnyQuery,\n> = QueryFn<TContext, TTakesContext, TArg, TReturnQuery> & {\n  queryName: TName;\n  parse: ParseFn<TArg> | undefined;\n  takesContext: TTakesContext;\n};\n\nfunction normalizeParser<T extends ReadonlyJSONValue[]>(\n  parser: ParseFn<T> | HasParseFn<T> | undefined,\n): ParseFn<T> | undefined {\n  if (parser) {\n    if ('parse' in parser) {\n      return parser.parse.bind(parser);\n    }\n    return parser;\n  }\n  return undefined;\n}\n\n/**\n * @deprecated Use {@linkcode defineQuery} instead.\n */\nexport function syncedQuery<\n  TName extends string,\n  TArg extends ReadonlyJSONValue[],\n  TReturnQuery extends AnyQuery,\n>(\n  name: TName,\n  parser: ParseFn<TArg> | HasParseFn<TArg> | undefined,\n  fn: QueryFn<unknown, false, TArg, TReturnQuery>,\n): SyncedQuery<TName, unknown, false, TArg, TReturnQuery> {\n  const impl = syncedQueryImpl(name, fn, false);\n  // oxlint-disable-next-line no-explicit-any\n  const ret: any = (...args: TArg) => impl(undefined, args);\n  ret.queryName = name;\n  ret.parse = normalizeParser(parser);\n  ret.takesContext = false;\n  return ret;\n}\n\n/**\n * @deprecated Use {@linkcode defineQuery} instead.\n */\nexport function syncedQueryWithContext<\n  TName extends string,\n  TContext,\n  TArg extends ReadonlyJSONValue[],\n  TReturnQuery extends AnyQuery,\n>(\n  name: TName,\n  parser: ParseFn<TArg> | HasParseFn<TArg> | undefined,\n  fn: QueryFn<TContext, true, TArg, TReturnQuery>,\n): SyncedQuery<TName, TContext, true, TArg, TReturnQuery> {\n  const impl = syncedQueryImpl(name, fn, true);\n  // oxlint-disable-next-line no-explicit-any\n  const ret: any = (context: TContext, ...args: TArg) => impl(context, args);\n  ret.queryName = name;\n  ret.parse = normalizeParser(parser);\n  ret.takesContext = true;\n  return ret;\n}\n\n/** @deprecated */\nfunction syncedQueryImpl<\n  TName extends string,\n  TContext,\n  TArg extends ReadonlyJSONValue[],\n  // oxlint-disable-next-line no-explicit-any\n>(name: TName, fn: any, takesContext: boolean) {\n  return (context: TContext, args: TArg) => {\n    const q = takesContext ? fn(context, ...args) : fn(...args);\n    return asQueryInternals(q).nameAndArgs(name, args);\n  };\n}\n\n/** @deprecated */\n\n// oxlint-disable-next-line no-explicit-any\ntype AnySyncedQuery = SyncedQuery<any, any, any, any, any>;\n\n/** @deprecated */\nexport function withValidation<F extends AnySyncedQuery>(\n  fn: F,\n  // oxlint-disable-next-line no-explicit-any\n): F extends SyncedQuery<infer N, infer C, any, any, infer R>\n  ? SyncedQuery<N, C, true, ReadonlyJSONValue[], R>\n  : F {\n  // If we have a parse function this is a SyncedQuery\n  if ('parse' in fn) {\n    const {parse} = fn;\n    if (!parse) {\n      throw new Error('ret does not have a parse function defined');\n    }\n    // oxlint-disable-next-line no-explicit-any\n    const ret: any = (context: unknown, ...args: unknown[]) => {\n      let parsed;\n      try {\n        parsed = parse(args);\n      } catch (error) {\n        throw new QueryParseError({cause: error});\n      }\n      // oxlint-disable-next-line no-explicit-any\n      return fn.takesContext ? fn(context, ...parsed) : (fn as any)(...parsed);\n    };\n    ret.queryName = fn.queryName;\n    ret.parse = fn.parse;\n    ret.takesContext = true;\n\n    return ret;\n  }\n\n  // If we don't have a parse function, return the function as-is\n  // (this shouldn't happen in practice)\n  // oxlint-disable-next-line no-explicit-any\n  return fn as any;\n}\n\n/** @deprecated */\nexport type ParseFn<T extends ReadonlyJSONValue[]> = (args: unknown[]) => T;\n\n/** @deprecated */\nexport type HasParseFn<T extends ReadonlyJSONValue[]> = {\n  parse: ParseFn<T>;\n};\n\n/** @deprecated */\nexport type Parser<T extends ReadonlyJSONValue[]> = ParseFn<T> | HasParseFn<T>;\n\nexport type CustomQueryID = {\n  name: string;\n  args: ReadonlyArray<ReadonlyJSONValue>;\n};\n"],"mappings":";;;;AA4BA,SAAS,gBACP,QACwB;AACxB,KAAI,QAAQ;AACV,MAAI,WAAW,OACb,QAAO,OAAO,MAAM,KAAK,OAAO;AAElC,SAAO;;;;;;AAQX,SAAgB,YAKd,MACA,QACA,IACwD;CACxD,MAAM,OAAO,gBAAgB,MAAM,IAAI,MAAM;CAE7C,MAAM,OAAY,GAAG,SAAe,KAAK,KAAA,GAAW,KAAK;AACzD,KAAI,YAAY;AAChB,KAAI,QAAQ,gBAAgB,OAAO;AACnC,KAAI,eAAe;AACnB,QAAO;;;;;AAMT,SAAgB,uBAMd,MACA,QACA,IACwD;CACxD,MAAM,OAAO,gBAAgB,MAAM,IAAI,KAAK;CAE5C,MAAM,OAAY,SAAmB,GAAG,SAAe,KAAK,SAAS,KAAK;AAC1E,KAAI,YAAY;AAChB,KAAI,QAAQ,gBAAgB,OAAO;AACnC,KAAI,eAAe;AACnB,QAAO;;;AAIT,SAAS,gBAKP,MAAa,IAAS,cAAuB;AAC7C,SAAQ,SAAmB,SAAe;AAExC,SAAO,iBADG,eAAe,GAAG,SAAS,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK,CACjC,CAAC,YAAY,MAAM,KAAK;;;;AAUtD,SAAgB,eACd,IAII;AAEJ,KAAI,WAAW,IAAI;EACjB,MAAM,EAAC,UAAS;AAChB,MAAI,CAAC,MACH,OAAM,IAAI,MAAM,6CAA6C;EAG/D,MAAM,OAAY,SAAkB,GAAG,SAAoB;GACzD,IAAI;AACJ,OAAI;AACF,aAAS,MAAM,KAAK;YACb,OAAO;AACd,UAAM,IAAI,gBAAgB,EAAC,OAAO,OAAM,CAAC;;AAG3C,UAAO,GAAG,eAAe,GAAG,SAAS,GAAG,OAAO,GAAI,GAAW,GAAG,OAAO;;AAE1E,MAAI,YAAY,GAAG;AACnB,MAAI,QAAQ,GAAG;AACf,MAAI,eAAe;AAEnB,SAAO;;AAMT,QAAO"}
+{"version":3,"file":"named.js","names":[],"sources":["../../../../../zql/src/query/named.ts"],"sourcesContent":["import type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport {QueryParseError} from './error.ts';\nimport {asQueryInternals} from './query-internals.ts';\nimport {type AnyQuery} from './query.ts';\n\n/** @deprecated */\nexport type QueryFn<\n  TContext,\n  TTakesContext extends boolean,\n  TArg extends ReadonlyJSONValue[],\n  TReturnQuery extends AnyQuery,\n> = TTakesContext extends false\n  ? {(...args: TArg): TReturnQuery}\n  : {(context: TContext, ...args: TArg): TReturnQuery};\n\n/** @deprecated */\nexport type SyncedQuery<\n  TName extends string,\n  TContext,\n  TTakesContext extends boolean,\n  TArg extends ReadonlyJSONValue[],\n  TReturnQuery extends AnyQuery,\n> = QueryFn<TContext, TTakesContext, TArg, TReturnQuery> & {\n  queryName: TName;\n  parse: ParseFn<TArg> | undefined;\n  takesContext: TTakesContext;\n};\n\nfunction normalizeParser<T extends ReadonlyJSONValue[]>(\n  parser: ParseFn<T> | HasParseFn<T> | undefined,\n): ParseFn<T> | undefined {\n  if (parser) {\n    if ('parse' in parser) {\n      return parser.parse.bind(parser);\n    }\n    return parser;\n  }\n  return undefined;\n}\n\n/**\n * @deprecated Use {@linkcode defineQuery} instead.\n */\nexport function syncedQuery<\n  TName extends string,\n  TArg extends ReadonlyJSONValue[],\n  TReturnQuery extends AnyQuery,\n>(\n  name: TName,\n  parser: ParseFn<TArg> | HasParseFn<TArg> | undefined,\n  fn: QueryFn<unknown, false, TArg, TReturnQuery>,\n): SyncedQuery<TName, unknown, false, TArg, TReturnQuery> {\n  const impl = syncedQueryImpl(name, fn, false);\n  // oxlint-disable-next-line no-explicit-any\n  const ret: any = (...args: TArg) => impl(undefined, args);\n  ret.queryName = name;\n  ret.parse = normalizeParser(parser);\n  ret.takesContext = false;\n  return ret;\n}\n\n/**\n * @deprecated Use {@linkcode defineQuery} instead.\n */\nexport function syncedQueryWithContext<\n  TName extends string,\n  TContext,\n  TArg extends ReadonlyJSONValue[],\n  TReturnQuery extends AnyQuery,\n>(\n  name: TName,\n  parser: ParseFn<TArg> | HasParseFn<TArg> | undefined,\n  fn: QueryFn<TContext, true, TArg, TReturnQuery>,\n): SyncedQuery<TName, TContext, true, TArg, TReturnQuery> {\n  const impl = syncedQueryImpl(name, fn, true);\n  // oxlint-disable-next-line no-explicit-any\n  const ret: any = (context: TContext, ...args: TArg) => impl(context, args);\n  ret.queryName = name;\n  ret.parse = normalizeParser(parser);\n  ret.takesContext = true;\n  return ret;\n}\n\n/** @deprecated */\nfunction syncedQueryImpl<\n  TName extends string,\n  TContext,\n  TArg extends ReadonlyJSONValue[],\n  // oxlint-disable-next-line no-explicit-any\n>(name: TName, fn: any, takesContext: boolean) {\n  return (context: TContext, args: TArg) => {\n    const q = takesContext ? fn(context, ...args) : fn(...args);\n    return asQueryInternals(q).nameAndArgs(name, args);\n  };\n}\n\n/** @deprecated */\n\n// oxlint-disable-next-line no-explicit-any\ntype AnySyncedQuery = SyncedQuery<any, any, any, any, any>;\n\n/** @deprecated */\nexport function withValidation<F extends AnySyncedQuery>(\n  fn: F,\n  // oxlint-disable-next-line no-explicit-any\n): F extends SyncedQuery<infer N, infer C, any, any, infer R>\n  ? SyncedQuery<N, C, true, ReadonlyJSONValue[], R>\n  : F {\n  // If we have a parse function this is a SyncedQuery\n  if ('parse' in fn) {\n    const {parse} = fn;\n    if (!parse) {\n      throw new Error('ret does not have a parse function defined');\n    }\n    // oxlint-disable-next-line no-explicit-any\n    const ret: any = (context: unknown, ...args: unknown[]) => {\n      let parsed;\n      try {\n        parsed = parse(args);\n      } catch (error) {\n        throw new QueryParseError({cause: error});\n      }\n      // oxlint-disable-next-line no-explicit-any\n      return fn.takesContext ? fn(context, ...parsed) : (fn as any)(...parsed);\n    };\n    ret.queryName = fn.queryName;\n    ret.parse = fn.parse;\n    ret.takesContext = true;\n\n    return ret;\n  }\n\n  // If we don't have a parse function, return the function as-is\n  // (this shouldn't happen in practice)\n  // oxlint-disable-next-line no-explicit-any\n  return fn as any;\n}\n\n/** @deprecated */\nexport type ParseFn<T extends ReadonlyJSONValue[]> = (args: unknown[]) => T;\n\n/** @deprecated */\nexport type HasParseFn<T extends ReadonlyJSONValue[]> = {\n  parse: ParseFn<T>;\n};\n\n/** @deprecated */\nexport type Parser<T extends ReadonlyJSONValue[]> = ParseFn<T> | HasParseFn<T>;\n\nexport type CustomQueryID = {\n  name: string;\n  args: ReadonlyArray<ReadonlyJSONValue>;\n};\n"],"mappings":";;;;AA4BA,SAAS,gBACP,QACwB;CACxB,IAAI,QAAQ;EACV,IAAI,WAAW,QACb,OAAO,OAAO,MAAM,KAAK,MAAM;EAEjC,OAAO;CACT;AAEF;;;;AAKA,SAAgB,YAKd,MACA,QACA,IACwD;CACxD,MAAM,OAAO,gBAAgB,MAAM,IAAI,KAAK;CAE5C,MAAM,OAAY,GAAG,SAAe,KAAK,KAAA,GAAW,IAAI;CACxD,IAAI,YAAY;CAChB,IAAI,QAAQ,gBAAgB,MAAM;CAClC,IAAI,eAAe;CACnB,OAAO;AACT;;;;AAKA,SAAgB,uBAMd,MACA,QACA,IACwD;CACxD,MAAM,OAAO,gBAAgB,MAAM,IAAI,IAAI;CAE3C,MAAM,OAAY,SAAmB,GAAG,SAAe,KAAK,SAAS,IAAI;CACzE,IAAI,YAAY;CAChB,IAAI,QAAQ,gBAAgB,MAAM;CAClC,IAAI,eAAe;CACnB,OAAO;AACT;;AAGA,SAAS,gBAKP,MAAa,IAAS,cAAuB;CAC7C,QAAQ,SAAmB,SAAe;EAExC,OAAO,iBADG,eAAe,GAAG,SAAS,GAAG,IAAI,IAAI,GAAG,GAAG,IAAI,CACjC,EAAE,YAAY,MAAM,IAAI;CACnD;AACF;;AAQA,SAAgB,eACd,IAII;CAEJ,IAAI,WAAW,IAAI;EACjB,MAAM,EAAC,UAAS;EAChB,IAAI,CAAC,OACH,MAAM,IAAI,MAAM,4CAA4C;EAG9D,MAAM,OAAY,SAAkB,GAAG,SAAoB;GACzD,IAAI;GACJ,IAAI;IACF,SAAS,MAAM,IAAI;GACrB,SAAS,OAAO;IACd,MAAM,IAAI,gBAAgB,EAAC,OAAO,MAAK,CAAC;GAC1C;GAEA,OAAO,GAAG,eAAe,GAAG,SAAS,GAAG,MAAM,IAAK,GAAW,GAAG,MAAM;EACzE;EACA,IAAI,YAAY,GAAG;EACnB,IAAI,QAAQ,GAAG;EACf,IAAI,eAAe;EAEnB,OAAO;CACT;CAKA,OAAO;AACT"}

package/out/zql/src/query/query-delegate-base.js.map

@@ -1 +1 @@
-{"version":3,"file":"query-delegate-base.js","names":[],"sources":["../../../../../zql/src/query/query-delegate-base.ts"],"sourcesContent":["import {resolver} from '@rocicorp/resolver';\nimport type {AST} from '../../../zero-protocol/src/ast.ts';\nimport type {ErroredQuery} from '../../../zero-protocol/src/custom-queries.ts';\nimport {hashOfNameAndArgs} from '../../../zero-protocol/src/query-hash.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport {buildPipeline} from '../builder/builder.ts';\nimport {ArrayView} from '../ivm/array-view.ts';\nimport type {FilterInput} from '../ivm/filter-operators.ts';\nimport {MemoryStorage} from '../ivm/memory-storage.ts';\nimport type {Input, InputBase, Storage} from '../ivm/operator.ts';\nimport type {Source, SourceInput} from '../ivm/source.ts';\nimport type {Format, ViewFactory} from '../ivm/view.ts';\nimport type {MetricMap} from './metrics-delegate.ts';\nimport type {CustomQueryID} from './named.ts';\nimport type {\n  CommitListener,\n  GotCallback,\n  QueryDelegate,\n} from './query-delegate.ts';\nimport {asQueryInternals, type QueryInternals} from './query-internals.ts';\nimport type {\n  HumanReadable,\n  MaterializeOptions,\n  PreloadOptions,\n  Query,\n  RunOptions,\n} from './query.ts';\nimport {DEFAULT_PRELOAD_TTL_MS, DEFAULT_TTL_MS, type TTL} from './ttl.ts';\nimport type {TypedView} from './typed-view.ts';\n\n/**\n * Base class that provides default implementations for common QueryDelegate methods.\n * Subclasses can override specific methods as needed.\n */\nexport abstract class QueryDelegateBase implements QueryDelegate {\n  /**\n   * Default implementation that just calls applyViewUpdates synchronously.\n   * Override if you need custom batching behavior (e.g., SolidJS).\n   */\n  batchViewUpdates<T>(applyViewUpdates: () => T): T {\n    return applyViewUpdates();\n  }\n\n  /**\n   * Default implementation returns MemoryStorage.\n   * Override if you need custom storage.\n   */\n  createStorage(): Storage {\n    return new MemoryStorage();\n  }\n\n  /**\n   * Default implementation calls materializeImpl.\n   * Override if you need custom materialization behavior.\n   */\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: undefined,\n    options?: MaterializeOptions,\n  ): TypedView<HumanReadable<TReturn>>;\n\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T;\n\n  /**\n   * Materialize a query into a custom view using a provided factory function.\n   */\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T;\n\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T {\n    return materializeImpl(query, this, factory, options);\n  }\n\n  /**\n   * Default implementation calls runImpl.\n   * Override if you need custom query execution (e.g., TestPGQueryDelegate).\n   */\n  run<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    options?: RunOptions,\n  ): Promise<HumanReadable<TReturn>> {\n    return runImpl(query, this, options);\n  }\n\n  /**\n   * Default implementation calls preloadImpl.\n   * Override if you need custom preload behavior.\n   */\n  preload<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    options?: PreloadOptions,\n  ): {\n    cleanup: () => void;\n    complete: Promise<void>;\n  } {\n    return preloadImpl(query, this, options);\n  }\n\n  /**\n   * Default no-op implementation for decorateSourceInput.\n   * Override if you need to wrap or instrument source inputs.\n   */\n  decorateSourceInput(input: SourceInput, _queryID: string): Input {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for decorateInput.\n   * Override if you need to wrap or instrument inputs.\n   */\n  decorateInput(input: Input, _name: string): Input {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for decorateFilterInput.\n   * Override if you need to wrap or instrument filter inputs.\n   */\n  decorateFilterInput(input: FilterInput, _name: string): FilterInput {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for addEdge.\n   * Override if you need to track graph edges (e.g., visualization).\n   */\n  addEdge(_source: InputBase, _dest: InputBase): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation for addMetric.\n   * Override if you need to collect metrics.\n   */\n  addMetric<K extends keyof MetricMap>(\n    _metric: K,\n    _value: number,\n    ..._args: MetricMap[K]\n  ): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to track server queries (e.g., ZeroContext, test delegates).\n   */\n  addServerQuery(_ast: AST, _ttl: TTL, _gotCallback?: GotCallback): () => void {\n    return () => {};\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to track custom queries (e.g., ZeroContext, test delegates).\n   */\n  addCustomQuery(\n    _ast: AST,\n    _customQueryID: CustomQueryID,\n    _ttl: TTL,\n    _gotCallback?: GotCallback,\n  ): () => void {\n    return () => {};\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to handle query updates.\n   */\n  updateServerQuery(_ast: AST, _ttl: TTL): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to handle custom query updates.\n   */\n  updateCustomQuery(_customQueryID: CustomQueryID, _ttl: TTL): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to flush query changes.\n   */\n  flushQueryChanges(): void {\n    // No-op\n  }\n\n  /**\n   * Called when a transaction commits. Override to add custom behavior.\n   * Default implementation returns a no-op cleanup function.\n   */\n  onTransactionCommit(_cb: CommitListener): () => void {\n    return () => {};\n  }\n\n  /**\n   * Validates run options. Override to add custom validation.\n   * Default implementation is a no-op.\n   */\n  assertValidRunOptions(_options?: RunOptions): void {\n    // No-op\n  }\n\n  abstract readonly defaultQueryComplete: boolean;\n\n  // BuilderDelegate methods - must be implemented\n  abstract getSource(name: string): Source | undefined;\n}\n\n// oxlint-disable-next-line require-await\nexport async function runImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  options?: RunOptions,\n): Promise<HumanReadable<TReturn>> {\n  delegate.assertValidRunOptions(options);\n  const v: TypedView<HumanReadable<TReturn>> = materializeImpl(\n    query,\n    delegate,\n    undefined,\n    {\n      ttl: options?.ttl,\n    },\n  );\n  if (options?.type === 'complete') {\n    return new Promise(resolve => {\n      v.addListener((data, type) => {\n        if (type === 'complete') {\n          v.destroy();\n          resolve(data as HumanReadable<TReturn>);\n        } else if (type === 'error') {\n          v.destroy();\n          resolve(Promise.reject(data));\n        }\n      });\n    });\n  }\n\n  options?.type satisfies 'unknown' | undefined;\n\n  const ret = v.data;\n  v.destroy();\n  return ret;\n}\n\nexport function preloadImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  options?: PreloadOptions,\n): {\n  cleanup: () => void;\n  complete: Promise<void>;\n} {\n  const qi = asQueryInternals(query);\n  const ttl = options?.ttl ?? DEFAULT_PRELOAD_TTL_MS;\n  const {resolve, promise: complete} = resolver<void>();\n  const {customQueryID, ast} = qi;\n  if (customQueryID) {\n    const cleanup = delegate.addCustomQuery(ast, customQueryID, ttl, got => {\n      if (got) {\n        resolve();\n      }\n    });\n    return {\n      cleanup,\n      complete,\n    };\n  }\n\n  const cleanup = delegate.addServerQuery(ast, ttl, got => {\n    if (got) {\n      resolve();\n    }\n  });\n  return {\n    cleanup,\n    complete,\n  };\n}\n\nexport function materializeImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n  T,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  factory: ViewFactory<\n    TTable,\n    TSchema,\n    TReturn,\n    T\n    // oxlint-disable-next-line no-explicit-any\n  > = arrayViewFactory as any,\n  options?: MaterializeOptions,\n): T {\n  let ttl: TTL = options?.ttl ?? DEFAULT_TTL_MS;\n\n  const qi = asQueryInternals(query);\n  const {ast, format, customQueryID} = qi;\n  const queryHash = qi.hash();\n\n  const queryID = customQueryID\n    ? hashOfNameAndArgs(customQueryID.name, customQueryID.args)\n    : queryHash;\n  const queryCompleteResolver = resolver<true>();\n  let queryComplete: boolean | ErroredQuery = delegate.defaultQueryComplete;\n  const updateTTL = customQueryID\n    ? (newTTL: TTL) => delegate.updateCustomQuery(customQueryID, newTTL)\n    : (newTTL: TTL) => delegate.updateServerQuery(ast, newTTL);\n\n  const gotCallback: GotCallback = (got, error) => {\n    if (error) {\n      queryCompleteResolver.reject(error);\n      queryComplete = error;\n      return;\n    }\n\n    if (got) {\n      delegate.addMetric(\n        'query-materialization-end-to-end',\n        performance.now() - t0,\n        queryID,\n        ast,\n      );\n      queryComplete = true;\n      queryCompleteResolver.resolve(true);\n    }\n  };\n\n  let removeCommitObserver: (() => void) | undefined;\n  const onDestroy = () => {\n    input.destroy();\n    removeCommitObserver?.();\n    removeAddedQuery();\n  };\n\n  const t0 = performance.now();\n\n  const removeAddedQuery = customQueryID\n    ? delegate.addCustomQuery(ast, customQueryID, ttl, gotCallback)\n    : delegate.addServerQuery(ast, ttl, gotCallback);\n\n  const input = buildPipeline(ast, delegate, queryID);\n\n  const view = delegate.batchViewUpdates(() =>\n    (factory ?? arrayViewFactory)(\n      query,\n      input,\n      format,\n      onDestroy,\n      cb => {\n        removeCommitObserver = delegate.onTransactionCommit(cb);\n      },\n      queryComplete || queryCompleteResolver.promise,\n      updateTTL,\n    ),\n  );\n\n  delegate.addMetric(\n    'query-materialization-client',\n    performance.now() - t0,\n    queryID,\n  );\n\n  return view as T;\n}\n\nfunction arrayViewFactory<\n  TTable extends string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  _query: QueryInternals<TTable, TSchema, TReturn>,\n  input: Input,\n  format: Format,\n  onDestroy: () => void,\n  onTransactionCommit: (cb: () => void) => void,\n  queryComplete: true | ErroredQuery | Promise<true>,\n  updateTTL: (ttl: TTL) => void,\n): TypedView<HumanReadable<TReturn>> {\n  const v = new ArrayView<HumanReadable<TReturn>>(\n    input,\n    format,\n    queryComplete,\n    updateTTL,\n  );\n  v.onDestroy = onDestroy;\n  onTransactionCommit(() => {\n    v.flush();\n  });\n  return v;\n}\n"],"mappings":";;;;;;;;;;;;AAkCA,IAAsB,oBAAtB,MAAiE;;;;;CAK/D,iBAAoB,kBAA8B;AAChD,SAAO,kBAAkB;;;;;;CAO3B,gBAAyB;AACvB,SAAO,IAAI,eAAe;;CA0C5B,YAME,OACA,SACA,SACG;AACH,SAAO,gBAAgB,OAAO,MAAM,SAAS,QAAQ;;;;;;CAOvD,IAKE,OACA,SACiC;AACjC,SAAO,QAAQ,OAAO,MAAM,QAAQ;;;;;;CAOtC,QAKE,OACA,SAIA;AACA,SAAO,YAAY,OAAO,MAAM,QAAQ;;;;;;CAO1C,oBAAoB,OAAoB,UAAyB;AAC/D,SAAO;;;;;;CAOT,cAAc,OAAc,OAAsB;AAChD,SAAO;;;;;;CAOT,oBAAoB,OAAoB,OAA4B;AAClE,SAAO;;;;;;CAOT,QAAQ,SAAoB,OAAwB;;;;;CAQpD,UACE,SACA,QACA,GAAG,OACG;;;;;CAQR,eAAe,MAAW,MAAW,cAAwC;AAC3E,eAAa;;;;;;CAOf,eACE,MACA,gBACA,MACA,cACY;AACZ,eAAa;;;;;;CAOf,kBAAkB,MAAW,MAAiB;;;;;CAQ9C,kBAAkB,gBAA+B,MAAiB;;;;;CAQlE,oBAA0B;;;;;CAQ1B,oBAAoB,KAAiC;AACnD,eAAa;;;;;;CAOf,sBAAsB,UAA6B;;AAWrD,eAAsB,QAKpB,OACA,UACA,SACiC;AACjC,UAAS,sBAAsB,QAAQ;CACvC,MAAM,IAAuC,gBAC3C,OACA,UACA,KAAA,GACA,EACE,KAAK,SAAS,KACf,CACF;AACD,KAAI,SAAS,SAAS,WACpB,QAAO,IAAI,SAAQ,YAAW;AAC5B,IAAE,aAAa,MAAM,SAAS;AAC5B,OAAI,SAAS,YAAY;AACvB,MAAE,SAAS;AACX,YAAQ,KAA+B;cAC9B,SAAS,SAAS;AAC3B,MAAE,SAAS;AACX,YAAQ,QAAQ,OAAO,KAAK,CAAC;;IAE/B;GACF;AAGJ,UAAS;CAET,MAAM,MAAM,EAAE;AACd,GAAE,SAAS;AACX,QAAO;;AAGT,SAAgB,YAKd,OACA,UACA,SAIA;CACA,MAAM,KAAK,iBAAiB,MAAM;CAClC,MAAM,MAAM,SAAS,OAAA;CACrB,MAAM,EAAC,SAAS,SAAS,aAAY,UAAgB;CACrD,MAAM,EAAC,eAAe,QAAO;AAC7B,KAAI,cAMF,QAAO;EACL,SANc,SAAS,eAAe,KAAK,eAAe,MAAK,QAAO;AACtE,OAAI,IACF,UAAS;IAEX;EAGA;EACD;AAQH,QAAO;EACL,SANc,SAAS,eAAe,KAAK,MAAK,QAAO;AACvD,OAAI,IACF,UAAS;IAEX;EAGA;EACD;;AAGH,SAAgB,gBAMd,OACA,UACA,UAMI,kBACJ,SACG;CACH,IAAI,MAAW,SAAS,OAAA;CAExB,MAAM,KAAK,iBAAiB,MAAM;CAClC,MAAM,EAAC,KAAK,QAAQ,kBAAiB;CACrC,MAAM,YAAY,GAAG,MAAM;CAE3B,MAAM,UAAU,gBACZ,kBAAkB,cAAc,MAAM,cAAc,KAAK,GACzD;CACJ,MAAM,wBAAwB,UAAgB;CAC9C,IAAI,gBAAwC,SAAS;CACrD,MAAM,YAAY,iBACb,WAAgB,SAAS,kBAAkB,eAAe,OAAO,IACjE,WAAgB,SAAS,kBAAkB,KAAK,OAAO;CAE5D,MAAM,eAA4B,KAAK,UAAU;AAC/C,MAAI,OAAO;AACT,yBAAsB,OAAO,MAAM;AACnC,mBAAgB;AAChB;;AAGF,MAAI,KAAK;AACP,YAAS,UACP,oCACA,YAAY,KAAK,GAAG,IACpB,SACA,IACD;AACD,mBAAgB;AAChB,yBAAsB,QAAQ,KAAK;;;CAIvC,IAAI;CACJ,MAAM,kBAAkB;AACtB,QAAM,SAAS;AACf,0BAAwB;AACxB,oBAAkB;;CAGpB,MAAM,KAAK,YAAY,KAAK;CAE5B,MAAM,mBAAmB,gBACrB,SAAS,eAAe,KAAK,eAAe,KAAK,YAAY,GAC7D,SAAS,eAAe,KAAK,KAAK,YAAY;CAElD,MAAM,QAAQ,cAAc,KAAK,UAAU,QAAQ;CAEnD,MAAM,OAAO,SAAS,wBACnB,WAAW,kBACV,OACA,OACA,QACA,YACA,OAAM;AACJ,yBAAuB,SAAS,oBAAoB,GAAG;IAEzD,iBAAiB,sBAAsB,SACvC,UACD,CACF;AAED,UAAS,UACP,gCACA,YAAY,KAAK,GAAG,IACpB,QACD;AAED,QAAO;;AAGT,SAAS,iBAKP,QACA,OACA,QACA,WACA,qBACA,eACA,WACmC;CACnC,MAAM,IAAI,IAAI,UACZ,OACA,QACA,eACA,UACD;AACD,GAAE,YAAY;AACd,2BAA0B;AACxB,IAAE,OAAO;GACT;AACF,QAAO"}
+{"version":3,"file":"query-delegate-base.js","names":[],"sources":["../../../../../zql/src/query/query-delegate-base.ts"],"sourcesContent":["import {resolver} from '@rocicorp/resolver';\nimport type {AST} from '../../../zero-protocol/src/ast.ts';\nimport type {ErroredQuery} from '../../../zero-protocol/src/custom-queries.ts';\nimport {hashOfNameAndArgs} from '../../../zero-protocol/src/query-hash.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport {buildPipeline} from '../builder/builder.ts';\nimport {ArrayView} from '../ivm/array-view.ts';\nimport type {FilterInput} from '../ivm/filter-operators.ts';\nimport {MemoryStorage} from '../ivm/memory-storage.ts';\nimport type {Input, InputBase, Storage} from '../ivm/operator.ts';\nimport type {Source, SourceInput} from '../ivm/source.ts';\nimport type {Format, ViewFactory} from '../ivm/view.ts';\nimport type {MetricMap} from './metrics-delegate.ts';\nimport type {CustomQueryID} from './named.ts';\nimport type {\n  CommitListener,\n  GotCallback,\n  QueryDelegate,\n} from './query-delegate.ts';\nimport {asQueryInternals, type QueryInternals} from './query-internals.ts';\nimport type {\n  HumanReadable,\n  MaterializeOptions,\n  PreloadOptions,\n  Query,\n  RunOptions,\n} from './query.ts';\nimport {DEFAULT_PRELOAD_TTL_MS, DEFAULT_TTL_MS, type TTL} from './ttl.ts';\nimport type {TypedView} from './typed-view.ts';\n\n/**\n * Base class that provides default implementations for common QueryDelegate methods.\n * Subclasses can override specific methods as needed.\n */\nexport abstract class QueryDelegateBase implements QueryDelegate {\n  /**\n   * Default implementation that just calls applyViewUpdates synchronously.\n   * Override if you need custom batching behavior (e.g., SolidJS).\n   */\n  batchViewUpdates<T>(applyViewUpdates: () => T): T {\n    return applyViewUpdates();\n  }\n\n  /**\n   * Default implementation returns MemoryStorage.\n   * Override if you need custom storage.\n   */\n  createStorage(): Storage {\n    return new MemoryStorage();\n  }\n\n  /**\n   * Default implementation calls materializeImpl.\n   * Override if you need custom materialization behavior.\n   */\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: undefined,\n    options?: MaterializeOptions,\n  ): TypedView<HumanReadable<TReturn>>;\n\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T;\n\n  /**\n   * Materialize a query into a custom view using a provided factory function.\n   */\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T;\n\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T {\n    return materializeImpl(query, this, factory, options);\n  }\n\n  /**\n   * Default implementation calls runImpl.\n   * Override if you need custom query execution (e.g., TestPGQueryDelegate).\n   */\n  run<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    options?: RunOptions,\n  ): Promise<HumanReadable<TReturn>> {\n    return runImpl(query, this, options);\n  }\n\n  /**\n   * Default implementation calls preloadImpl.\n   * Override if you need custom preload behavior.\n   */\n  preload<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    options?: PreloadOptions,\n  ): {\n    cleanup: () => void;\n    complete: Promise<void>;\n  } {\n    return preloadImpl(query, this, options);\n  }\n\n  /**\n   * Default no-op implementation for decorateSourceInput.\n   * Override if you need to wrap or instrument source inputs.\n   */\n  decorateSourceInput(input: SourceInput, _queryID: string): Input {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for decorateInput.\n   * Override if you need to wrap or instrument inputs.\n   */\n  decorateInput(input: Input, _name: string): Input {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for decorateFilterInput.\n   * Override if you need to wrap or instrument filter inputs.\n   */\n  decorateFilterInput(input: FilterInput, _name: string): FilterInput {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for addEdge.\n   * Override if you need to track graph edges (e.g., visualization).\n   */\n  addEdge(_source: InputBase, _dest: InputBase): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation for addMetric.\n   * Override if you need to collect metrics.\n   */\n  addMetric<K extends keyof MetricMap>(\n    _metric: K,\n    _value: number,\n    ..._args: MetricMap[K]\n  ): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to track server queries (e.g., ZeroContext, test delegates).\n   */\n  addServerQuery(_ast: AST, _ttl: TTL, _gotCallback?: GotCallback): () => void {\n    return () => {};\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to track custom queries (e.g., ZeroContext, test delegates).\n   */\n  addCustomQuery(\n    _ast: AST,\n    _customQueryID: CustomQueryID,\n    _ttl: TTL,\n    _gotCallback?: GotCallback,\n  ): () => void {\n    return () => {};\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to handle query updates.\n   */\n  updateServerQuery(_ast: AST, _ttl: TTL): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to handle custom query updates.\n   */\n  updateCustomQuery(_customQueryID: CustomQueryID, _ttl: TTL): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to flush query changes.\n   */\n  flushQueryChanges(): void {\n    // No-op\n  }\n\n  /**\n   * Called when a transaction commits. Override to add custom behavior.\n   * Default implementation returns a no-op cleanup function.\n   */\n  onTransactionCommit(_cb: CommitListener): () => void {\n    return () => {};\n  }\n\n  /**\n   * Validates run options. Override to add custom validation.\n   * Default implementation is a no-op.\n   */\n  assertValidRunOptions(_options?: RunOptions): void {\n    // No-op\n  }\n\n  abstract readonly defaultQueryComplete: boolean;\n\n  // BuilderDelegate methods - must be implemented\n  abstract getSource(name: string): Source | undefined;\n}\n\n// oxlint-disable-next-line require-await\nexport async function runImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  options?: RunOptions,\n): Promise<HumanReadable<TReturn>> {\n  delegate.assertValidRunOptions(options);\n  const v: TypedView<HumanReadable<TReturn>> = materializeImpl(\n    query,\n    delegate,\n    undefined,\n    {\n      ttl: options?.ttl,\n    },\n  );\n  if (options?.type === 'complete') {\n    return new Promise(resolve => {\n      v.addListener((data, type) => {\n        if (type === 'complete') {\n          v.destroy();\n          resolve(data as HumanReadable<TReturn>);\n        } else if (type === 'error') {\n          v.destroy();\n          resolve(Promise.reject(data));\n        }\n      });\n    });\n  }\n\n  options?.type satisfies 'unknown' | undefined;\n\n  const ret = v.data;\n  v.destroy();\n  return ret;\n}\n\nexport function preloadImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  options?: PreloadOptions,\n): {\n  cleanup: () => void;\n  complete: Promise<void>;\n} {\n  const qi = asQueryInternals(query);\n  const ttl = options?.ttl ?? DEFAULT_PRELOAD_TTL_MS;\n  const {resolve, promise: complete} = resolver<void>();\n  const {customQueryID, ast} = qi;\n  if (customQueryID) {\n    const cleanup = delegate.addCustomQuery(ast, customQueryID, ttl, got => {\n      if (got) {\n        resolve();\n      }\n    });\n    return {\n      cleanup,\n      complete,\n    };\n  }\n\n  const cleanup = delegate.addServerQuery(ast, ttl, got => {\n    if (got) {\n      resolve();\n    }\n  });\n  return {\n    cleanup,\n    complete,\n  };\n}\n\nexport function materializeImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n  T,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  factory: ViewFactory<\n    TTable,\n    TSchema,\n    TReturn,\n    T\n    // oxlint-disable-next-line no-explicit-any\n  > = arrayViewFactory as any,\n  options?: MaterializeOptions,\n): T {\n  let ttl: TTL = options?.ttl ?? DEFAULT_TTL_MS;\n\n  const qi = asQueryInternals(query);\n  const {ast, format, customQueryID} = qi;\n  const queryHash = qi.hash();\n\n  const queryID = customQueryID\n    ? hashOfNameAndArgs(customQueryID.name, customQueryID.args)\n    : queryHash;\n  const queryCompleteResolver = resolver<true>();\n  let queryComplete: boolean | ErroredQuery = delegate.defaultQueryComplete;\n  const updateTTL = customQueryID\n    ? (newTTL: TTL) => delegate.updateCustomQuery(customQueryID, newTTL)\n    : (newTTL: TTL) => delegate.updateServerQuery(ast, newTTL);\n\n  const gotCallback: GotCallback = (got, error) => {\n    if (error) {\n      queryCompleteResolver.reject(error);\n      queryComplete = error;\n      return;\n    }\n\n    if (got) {\n      delegate.addMetric(\n        'query-materialization-end-to-end',\n        performance.now() - t0,\n        queryID,\n        ast,\n      );\n      queryComplete = true;\n      queryCompleteResolver.resolve(true);\n    }\n  };\n\n  let removeCommitObserver: (() => void) | undefined;\n  const onDestroy = () => {\n    input.destroy();\n    removeCommitObserver?.();\n    removeAddedQuery();\n  };\n\n  const t0 = performance.now();\n\n  const removeAddedQuery = customQueryID\n    ? delegate.addCustomQuery(ast, customQueryID, ttl, gotCallback)\n    : delegate.addServerQuery(ast, ttl, gotCallback);\n\n  const input = buildPipeline(ast, delegate, queryID);\n\n  const view = delegate.batchViewUpdates(() =>\n    (factory ?? arrayViewFactory)(\n      query,\n      input,\n      format,\n      onDestroy,\n      cb => {\n        removeCommitObserver = delegate.onTransactionCommit(cb);\n      },\n      queryComplete || queryCompleteResolver.promise,\n      updateTTL,\n    ),\n  );\n\n  delegate.addMetric(\n    'query-materialization-client',\n    performance.now() - t0,\n    queryID,\n  );\n\n  return view as T;\n}\n\nfunction arrayViewFactory<\n  TTable extends string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  _query: QueryInternals<TTable, TSchema, TReturn>,\n  input: Input,\n  format: Format,\n  onDestroy: () => void,\n  onTransactionCommit: (cb: () => void) => void,\n  queryComplete: true | ErroredQuery | Promise<true>,\n  updateTTL: (ttl: TTL) => void,\n): TypedView<HumanReadable<TReturn>> {\n  const v = new ArrayView<HumanReadable<TReturn>>(\n    input,\n    format,\n    queryComplete,\n    updateTTL,\n  );\n  v.onDestroy = onDestroy;\n  onTransactionCommit(() => {\n    v.flush();\n  });\n  return v;\n}\n"],"mappings":";;;;;;;;;;;;AAkCA,IAAsB,oBAAtB,MAAiE;;;;;CAK/D,iBAAoB,kBAA8B;EAChD,OAAO,iBAAiB;CAC1B;;;;;CAMA,gBAAyB;EACvB,OAAO,IAAI,cAAc;CAC3B;CAyCA,YAME,OACA,SACA,SACG;EACH,OAAO,gBAAgB,OAAO,MAAM,SAAS,OAAO;CACtD;;;;;CAMA,IAKE,OACA,SACiC;EACjC,OAAO,QAAQ,OAAO,MAAM,OAAO;CACrC;;;;;CAMA,QAKE,OACA,SAIA;EACA,OAAO,YAAY,OAAO,MAAM,OAAO;CACzC;;;;;CAMA,oBAAoB,OAAoB,UAAyB;EAC/D,OAAO;CACT;;;;;CAMA,cAAc,OAAc,OAAsB;EAChD,OAAO;CACT;;;;;CAMA,oBAAoB,OAAoB,OAA4B;EAClE,OAAO;CACT;;;;;CAMA,QAAQ,SAAoB,OAAwB,CAEpD;;;;;CAMA,UACE,SACA,QACA,GAAG,OACG,CAER;;;;;CAMA,eAAe,MAAW,MAAW,cAAwC;EAC3E,aAAa,CAAC;CAChB;;;;;CAMA,eACE,MACA,gBACA,MACA,cACY;EACZ,aAAa,CAAC;CAChB;;;;;CAMA,kBAAkB,MAAW,MAAiB,CAE9C;;;;;CAMA,kBAAkB,gBAA+B,MAAiB,CAElE;;;;;CAMA,oBAA0B,CAE1B;;;;;CAMA,oBAAoB,KAAiC;EACnD,aAAa,CAAC;CAChB;;;;;CAMA,sBAAsB,UAA6B,CAEnD;AAMF;AAGA,eAAsB,QAKpB,OACA,UACA,SACiC;CACjC,SAAS,sBAAsB,OAAO;CACtC,MAAM,IAAuC,gBAC3C,OACA,UACA,KAAA,GACA,EACE,KAAK,SAAS,IAChB,CACF;CACA,IAAI,SAAS,SAAS,YACpB,OAAO,IAAI,SAAQ,YAAW;EAC5B,EAAE,aAAa,MAAM,SAAS;GAC5B,IAAI,SAAS,YAAY;IACvB,EAAE,QAAQ;IACV,QAAQ,IAA8B;GACxC,OAAO,IAAI,SAAS,SAAS;IAC3B,EAAE,QAAQ;IACV,QAAQ,QAAQ,OAAO,IAAI,CAAC;GAC9B;EACF,CAAC;CACH,CAAC;CAGH,SAAS;CAET,MAAM,MAAM,EAAE;CACd,EAAE,QAAQ;CACV,OAAO;AACT;AAEA,SAAgB,YAKd,OACA,UACA,SAIA;CACA,MAAM,KAAK,iBAAiB,KAAK;CACjC,MAAM,MAAM,SAAS,OAAA;CACrB,MAAM,EAAC,SAAS,SAAS,aAAY,SAAe;CACpD,MAAM,EAAC,eAAe,QAAO;CAC7B,IAAI,eAMF,OAAO;EACL,SANc,SAAS,eAAe,KAAK,eAAe,MAAK,QAAO;GACtE,IAAI,KACF,QAAQ;EAEZ,CAEE;EACA;CACF;CAQF,OAAO;EACL,SANc,SAAS,eAAe,KAAK,MAAK,QAAO;GACvD,IAAI,KACF,QAAQ;EAEZ,CAEE;EACA;CACF;AACF;AAEA,SAAgB,gBAMd,OACA,UACA,UAMI,kBACJ,SACG;CACH,IAAI,MAAW,SAAS,OAAA;CAExB,MAAM,KAAK,iBAAiB,KAAK;CACjC,MAAM,EAAC,KAAK,QAAQ,kBAAiB;CACrC,MAAM,YAAY,GAAG,KAAK;CAE1B,MAAM,UAAU,gBACZ,kBAAkB,cAAc,MAAM,cAAc,IAAI,IACxD;CACJ,MAAM,wBAAwB,SAAe;CAC7C,IAAI,gBAAwC,SAAS;CACrD,MAAM,YAAY,iBACb,WAAgB,SAAS,kBAAkB,eAAe,MAAM,KAChE,WAAgB,SAAS,kBAAkB,KAAK,MAAM;CAE3D,MAAM,eAA4B,KAAK,UAAU;EAC/C,IAAI,OAAO;GACT,sBAAsB,OAAO,KAAK;GAClC,gBAAgB;GAChB;EACF;EAEA,IAAI,KAAK;GACP,SAAS,UACP,oCACA,YAAY,IAAI,IAAI,IACpB,SACA,GACF;GACA,gBAAgB;GAChB,sBAAsB,QAAQ,IAAI;EACpC;CACF;CAEA,IAAI;CACJ,MAAM,kBAAkB;EACtB,MAAM,QAAQ;EACd,uBAAuB;EACvB,iBAAiB;CACnB;CAEA,MAAM,KAAK,YAAY,IAAI;CAE3B,MAAM,mBAAmB,gBACrB,SAAS,eAAe,KAAK,eAAe,KAAK,WAAW,IAC5D,SAAS,eAAe,KAAK,KAAK,WAAW;CAEjD,MAAM,QAAQ,cAAc,KAAK,UAAU,OAAO;CAElD,MAAM,OAAO,SAAS,wBACnB,WAAW,kBACV,OACA,OACA,QACA,YACA,OAAM;EACJ,uBAAuB,SAAS,oBAAoB,EAAE;CACxD,GACA,iBAAiB,sBAAsB,SACvC,SACF,CACF;CAEA,SAAS,UACP,gCACA,YAAY,IAAI,IAAI,IACpB,OACF;CAEA,OAAO;AACT;AAEA,SAAS,iBAKP,QACA,OACA,QACA,WACA,qBACA,eACA,WACmC;CACnC,MAAM,IAAI,IAAI,UACZ,OACA,QACA,eACA,SACF;CACA,EAAE,YAAY;CACd,0BAA0B;EACxB,EAAE,MAAM;CACV,CAAC;CACD,OAAO;AACT"}

package/out/zql/src/query/query-impl.js

@@ -50,7 +50,7 @@ var QueryImpl = class {
 		}, this.#currentJunction);
 	}
 	hash() {
-		if (!this.#hash) this.#hash = hashOfAST(this.#ast);
+		if (!this.#hash) this.#hash = hashOfAST(this.#ast) + (this.format.singular ? "t" : "f");
 		return this.#hash;
 	}
 	one = () => this.#newQuery(this.#tableName, {

package/out/zql/src/query/query-impl.js.map

@@ -1 +1 @@
-{"version":3,"file":"query-impl.js","names":["#schema","#tableName","#ast","#system","#currentJunction","#newQuery","#hash","#exists"],"sources":["../../../../../zql/src/query/query-impl.ts"],"sourcesContent":["// oxlint-disable no-explicit-any\nimport {assert} from '../../../shared/src/asserts.ts';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport {\n  type AST,\n  type CompoundKey,\n  type Condition,\n  type Parameter,\n  type SimpleOperator,\n  type System,\n  SUBQ_PREFIX,\n} from '../../../zero-protocol/src/ast.ts';\nimport {hashOfAST} from '../../../zero-protocol/src/query-hash.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport {NotImplementedError} from '../error.ts';\nimport {defaultFormat} from '../ivm/default-format.ts';\nimport type {Format, ViewFactory} from '../ivm/view.ts';\nimport {\n  type ExpressionFactory,\n  ExpressionBuilder,\n  and,\n  cmp,\n  simplifyCondition,\n} from './expression.ts';\nimport type {CustomQueryID} from './named.ts';\nimport {type QueryInternals, queryInternalsTag} from './query-internals.ts';\nimport type {\n  AnyQuery,\n  ExistsOptions,\n  GetFilterType,\n  HumanReadable,\n  PreloadOptions,\n  PullRow,\n  Query,\n  RunOptions,\n} from './query.ts';\nimport type {TTL} from './ttl.ts';\nimport type {TypedView} from './typed-view.ts';\n\ntype GetFilterTypeAny = GetFilterType<any, any, any>;\n\ntype NewQueryFunction<TSchema extends Schema> = <\n  TTable extends keyof TSchema['tables'] & string,\n  TReturn,\n>(\n  this: unknown,\n  tableName: TTable,\n  ast: AST,\n  format: Format,\n  customQueryID: CustomQueryID | undefined,\n  currentJunction: string | undefined,\n) => QueryImpl<TTable, TSchema, TReturn>;\n\nexport function newQuery<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n>(schema: TSchema, table: TTable): Query<TTable, TSchema> {\n  return newQueryImpl(schema, table, {table}, defaultFormat, 'client');\n}\n\nexport function newQueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn = PullRow<TTable, TSchema>,\n>(\n  schema: TSchema,\n  tableName: TTable,\n  ast: AST,\n  format: Format,\n  system: System,\n): QueryImpl<TTable, TSchema, TReturn> {\n  const inner: NewQueryFunction<TSchema> = (\n    tableName,\n    ast,\n    format,\n    customQueryID,\n    currentJunction,\n  ) =>\n    new QueryImpl(\n      schema,\n      tableName,\n      ast,\n      format,\n      system,\n      customQueryID,\n      currentJunction,\n      inner,\n    );\n\n  return inner(tableName, ast, format, undefined, undefined);\n}\n\nexport class QueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn = PullRow<TTable, TSchema>,\n>\n  implements\n    Query<TTable, TSchema, TReturn>,\n    QueryInternals<TTable, TSchema, TReturn>\n{\n  readonly [queryInternalsTag] = true;\n\n  readonly #schema: TSchema;\n  readonly #tableName: TTable;\n  readonly #ast: AST;\n  readonly format: Format;\n  #hash: string = '';\n  readonly #system: System;\n  readonly #currentJunction: string | undefined;\n  readonly customQueryID: CustomQueryID | undefined;\n  readonly #newQuery: NewQueryFunction<TSchema>;\n\n  constructor(\n    schema: TSchema,\n    tableName: TTable,\n    ast: AST,\n    format: Format,\n    system: System,\n    customQueryID: CustomQueryID | undefined,\n    currentJunction: string | undefined,\n    newQuery: NewQueryFunction<TSchema>,\n  ) {\n    this.#schema = schema;\n    this.#tableName = tableName;\n    this.#ast = ast;\n    this.format = format;\n    this.#system = system;\n    this.#currentJunction = currentJunction;\n    this.customQueryID = customQueryID;\n    this.#newQuery = newQuery;\n  }\n\n  run(_options?: RunOptions): Promise<HumanReadable<TReturn>> {\n    throwQueryNotRunnable();\n  }\n\n  preload(_options?: PreloadOptions): {\n    cleanup: () => void;\n    complete: Promise<void>;\n  } {\n    throwQueryNotRunnable();\n  }\n\n  materialize(ttl?: TTL): TypedView<HumanReadable<TReturn>>;\n  materialize<T>(\n    factory: ViewFactory<TTable, TSchema, TReturn, T>,\n    ttl?: TTL,\n  ): T;\n  materialize<T>(\n    _factoryOrTTL?: ViewFactory<TTable, TSchema, TReturn, T> | TTL,\n    _ttl?: TTL,\n  ): T | TypedView<HumanReadable<TReturn>> {\n    throwQueryNotRunnable();\n  }\n\n  nameAndArgs(\n    name: string,\n    args: ReadonlyArray<ReadonlyJSONValue>,\n  ): Query<TTable, TSchema, TReturn> {\n    return this.#newQuery(\n      this.#tableName,\n      this.#ast,\n      this.format,\n      {\n        name,\n        args,\n      },\n      this.#currentJunction,\n    );\n  }\n\n  hash(): string {\n    if (!this.#hash) {\n      this.#hash = hashOfAST(this.#ast);\n    }\n    return this.#hash;\n  }\n\n  one = (): Query<TTable, TSchema, TReturn | undefined> =>\n    this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        limit: 1,\n      },\n      {\n        ...this.format,\n        singular: true,\n      },\n      this.customQueryID,\n      this.#currentJunction,\n    );\n\n  whereExists = (\n    relationship: string,\n    cbOrOptions?: ((q: AnyQuery) => AnyQuery) | ExistsOptions,\n    options?: ExistsOptions,\n  ): Query<TTable, TSchema, TReturn> => {\n    const cb = typeof cbOrOptions === 'function' ? cbOrOptions : undefined;\n    const opts = typeof cbOrOptions === 'function' ? options : cbOrOptions;\n    return this.where(({exists}) => exists(relationship, cb, opts)) as Query<\n      TTable,\n      TSchema,\n      TReturn\n    >;\n  };\n\n  related = (\n    relationship: string,\n    cb?: (q: AnyQuery) => AnyQuery,\n  ): Query<TTable, TSchema, any> => {\n    if (relationship.startsWith(SUBQ_PREFIX)) {\n      throw new Error(\n        `Relationship names may not start with \"${SUBQ_PREFIX}\". That is a reserved prefix.`,\n      );\n    }\n    cb = cb ?? (q => q);\n\n    const related = this.#schema.relationships[this.#tableName][relationship];\n    assert(related, 'Invalid relationship');\n    if (isOneHop(related)) {\n      const {destSchema, destField, sourceField, cardinality} = related[0];\n      const q: AnyQuery = this.#newQuery(\n        destSchema,\n        {\n          table: destSchema,\n          alias: relationship,\n        },\n        {\n          relationships: {},\n          singular: cardinality === 'one',\n        },\n        this.customQueryID,\n        undefined,\n      ) as AnyQuery;\n      // Intentionally not setting to `one` as it is a perf degradation\n      // and the user should not be making the mistake of setting cardinality to\n      // `one` when it is actually not.\n      // if (cardinality === 'one') {\n      //   q = q.one();\n      // }\n      const subQuery = asQueryImpl(cb(q));\n      assert(\n        isCompoundKey(sourceField),\n        'The source of a relationship must specify at last 1 field',\n      );\n      assert(\n        isCompoundKey(destField),\n        'The destination of a relationship must specify at last 1 field',\n      );\n      assert(\n        sourceField.length === destField.length,\n        'The source and destination of a relationship must have the same number of fields',\n      );\n\n      return this.#newQuery(\n        this.#tableName,\n        {\n          ...this.#ast,\n          related: [\n            ...(this.#ast.related ?? []),\n            {\n              system: this.#system,\n              correlation: {\n                parentField: sourceField,\n                childField: destField,\n              },\n              subquery: subQuery.#ast,\n            },\n          ],\n        },\n        {\n          ...this.format,\n          relationships: {\n            ...this.format.relationships,\n            [relationship]: subQuery.format,\n          },\n        },\n        this.customQueryID,\n        this.#currentJunction,\n      ) as AnyQuery;\n    }\n\n    if (isTwoHop(related)) {\n      const [firstRelation, secondRelation] = related;\n      const {destSchema} = secondRelation;\n      const junctionSchema = firstRelation.destSchema;\n      const sq = asQueryImpl(\n        cb(\n          this.#newQuery(\n            destSchema,\n            {\n              table: destSchema,\n              alias: relationship,\n            },\n            {\n              relationships: {},\n              singular: secondRelation.cardinality === 'one',\n            },\n            this.customQueryID,\n            relationship,\n          ),\n        ),\n      );\n\n      assert(isCompoundKey(firstRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(firstRelation.destField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.destField), 'Invalid relationship');\n\n      return this.#newQuery(\n        this.#tableName,\n        {\n          ...this.#ast,\n          related: [\n            ...(this.#ast.related ?? []),\n            {\n              system: this.#system,\n              correlation: {\n                parentField: firstRelation.sourceField,\n                childField: firstRelation.destField,\n              },\n              hidden: true,\n              subquery: {\n                table: junctionSchema,\n                alias: relationship,\n                related: [\n                  {\n                    system: this.#system,\n                    correlation: {\n                      parentField: secondRelation.sourceField,\n                      childField: secondRelation.destField,\n                    },\n                    subquery: sq.#ast,\n                  },\n                ],\n              },\n            },\n          ],\n        },\n        {\n          ...this.format,\n          relationships: {\n            ...this.format.relationships,\n            [relationship]: sq.format,\n          },\n        },\n        this.customQueryID,\n        this.#currentJunction,\n      ) as AnyQuery;\n    }\n\n    throw new Error(`Invalid relationship ${relationship}`);\n  };\n\n  where = function (\n    this: QueryImpl<TTable, TSchema, TReturn>,\n    fieldOrExpressionFactory: string | ExpressionFactory<TTable, TSchema>,\n    opOrValue?: SimpleOperator | GetFilterTypeAny | Parameter,\n    value?: GetFilterTypeAny | Parameter,\n  ): Query<TTable, TSchema, TReturn> {\n    let cond: Condition;\n\n    if (typeof fieldOrExpressionFactory === 'function') {\n      cond = fieldOrExpressionFactory(this.expressionBuilder());\n    } else {\n      assert(arguments.length >= 2, 'Invalid condition. Too few arguments.');\n      // Distinguish between 2-arg form (field, value) and 3-arg form (field, op, value)\n      // using arguments.length to allow explicit undefined in 3-arg form.\n      if (arguments.length === 2) {\n        cond = cmp(fieldOrExpressionFactory, opOrValue);\n      } else {\n        cond = cmp(fieldOrExpressionFactory, opOrValue, value);\n      }\n    }\n\n    const existingWhere = this.#ast.where;\n    if (existingWhere) {\n      cond = and(existingWhere, cond);\n    }\n\n    const where = simplifyCondition(cond);\n\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        where,\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  }.bind(this);\n\n  start = (\n    row: Partial<Record<string, ReadonlyJSONValue | undefined>>,\n    opts?: {inclusive: boolean},\n  ): Query<TTable, TSchema, TReturn> =>\n    this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        start: {\n          row,\n          exclusive: !opts?.inclusive,\n        },\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n\n  limit = (limit: number): Query<TTable, TSchema, TReturn> => {\n    if (limit < 0) {\n      throw new Error('Limit must be non-negative');\n    }\n    if ((limit | 0) !== limit) {\n      throw new Error('Limit must be an integer');\n    }\n    if (this.#currentJunction) {\n      throw new NotImplementedError(\n        'Limit is not supported in junction relationships yet. Junction relationship being limited: ' +\n          this.#currentJunction,\n      );\n    }\n\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        limit,\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  };\n\n  orderBy = <TSelector extends keyof TSchema['tables'][TTable]['columns']>(\n    field: TSelector,\n    direction: 'asc' | 'desc',\n  ): Query<TTable, TSchema, TReturn> => {\n    if (this.#currentJunction) {\n      throw new NotImplementedError(\n        'Order by is not supported in junction relationships yet. Junction relationship being ordered: ' +\n          this.#currentJunction,\n      );\n    }\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        orderBy: [...(this.#ast.orderBy ?? []), [field as string, direction]],\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  };\n\n  #exists = (\n    relationship: string,\n    cb: ((query: AnyQuery) => AnyQuery) | undefined,\n    options?: ExistsOptions,\n  ): Condition => {\n    cb = cb ?? (q => q);\n    const flip = options?.flip;\n    const scalar = options?.scalar;\n    const related = this.#schema.relationships[this.#tableName][relationship];\n    assert(related, 'Invalid relationship');\n\n    if (isOneHop(related)) {\n      const {destSchema: destTableName, sourceField, destField} = related[0];\n      assert(isCompoundKey(sourceField), 'Invalid relationship');\n      assert(isCompoundKey(destField), 'Invalid relationship');\n\n      const subQuery = asQueryImpl(\n        cb(\n          this.#newQuery(\n            destTableName,\n            {\n              table: destTableName,\n              alias: `${SUBQ_PREFIX}${relationship}`,\n            },\n            defaultFormat,\n            this.customQueryID,\n            undefined,\n          ),\n        ),\n      );\n      return {\n        type: 'correlatedSubquery',\n        related: {\n          system: this.#system,\n          correlation: {\n            parentField: sourceField,\n            childField: destField,\n          },\n          subquery: subQuery.#ast,\n        },\n        op: 'EXISTS',\n        ...(flip !== undefined ? {flip} : {}),\n        ...(scalar !== undefined ? {scalar} : {}),\n      };\n    }\n\n    if (isTwoHop(related)) {\n      const [firstRelation, secondRelation] = related;\n      assert(isCompoundKey(firstRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(firstRelation.destField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.destField), 'Invalid relationship');\n      const {destSchema} = secondRelation;\n      const junctionSchema = firstRelation.destSchema;\n      const queryToDest = cb(\n        this.#newQuery(\n          destSchema,\n          {\n            table: destSchema,\n            alias: `${SUBQ_PREFIX}zhidden_${relationship}`,\n          },\n          defaultFormat,\n          this.customQueryID,\n          relationship,\n        ) as AnyQuery,\n      );\n\n      return {\n        type: 'correlatedSubquery',\n        related: {\n          system: this.#system,\n          correlation: {\n            parentField: firstRelation.sourceField,\n            childField: firstRelation.destField,\n          },\n          subquery: {\n            table: junctionSchema,\n            alias: `${SUBQ_PREFIX}${relationship}`,\n            where: {\n              type: 'correlatedSubquery',\n              related: {\n                system: this.#system,\n                correlation: {\n                  parentField: secondRelation.sourceField,\n                  childField: secondRelation.destField,\n                },\n                subquery: asQueryImpl(queryToDest).#ast,\n              },\n              op: 'EXISTS',\n              ...(flip !== undefined ? {flip} : {}),\n              ...(scalar !== undefined ? {scalar} : {}),\n            },\n          },\n        },\n        op: 'EXISTS',\n        ...(flip !== undefined ? {flip} : {}),\n      };\n    }\n\n    throw new Error(`Invalid relationship ${relationship}`);\n  };\n\n  get ast(): AST {\n    return this.#ast;\n  }\n\n  expressionBuilder() {\n    return new ExpressionBuilder(this.#exists);\n  }\n}\n\nexport function asQueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(q: Query<TTable, TSchema, TReturn>): QueryImpl<TTable, TSchema, TReturn> {\n  assert(q instanceof QueryImpl, 'Expected QueryImpl instance');\n  return q;\n}\n\nfunction throwQueryNotRunnable(): never {\n  throw new Error('Query is not runnable');\n}\n\nfunction isCompoundKey(field: readonly string[]): field is CompoundKey {\n  return Array.isArray(field) && field.length >= 1;\n}\n\nfunction isOneHop<T>(r: readonly T[]): r is readonly [T] {\n  return r.length === 1;\n}\n\nfunction isTwoHop<T>(r: readonly T[]): r is readonly [T, T] {\n  return r.length === 2;\n}\n"],"mappings":";;;;;;;;AAqDA,SAAgB,SAGd,QAAiB,OAAuC;AACxD,QAAO,aAAa,QAAQ,OAAO,EAAC,OAAM,EAAE,eAAe,SAAS;;AAGtE,SAAgB,aAKd,QACA,WACA,KACA,QACA,QACqC;CACrC,MAAM,SACJ,WACA,KACA,QACA,eACA,oBAEA,IAAI,UACF,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,MACD;AAEH,QAAO,MAAM,WAAW,KAAK,QAAQ,KAAA,GAAW,KAAA,EAAU;;AAG5D,IAAa,YAAb,MAQA;CACE,CAAU,qBAAqB;CAE/B;CACA;CACA;CACA;CACA,QAAgB;CAChB;CACA;CACA;CACA;CAEA,YACE,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,UACA;AACA,QAAA,SAAe;AACf,QAAA,YAAkB;AAClB,QAAA,MAAY;AACZ,OAAK,SAAS;AACd,QAAA,SAAe;AACf,QAAA,kBAAwB;AACxB,OAAK,gBAAgB;AACrB,QAAA,WAAiB;;CAGnB,IAAI,UAAwD;AAC1D,yBAAuB;;CAGzB,QAAQ,UAGN;AACA,yBAAuB;;CAQzB,YACE,eACA,MACuC;AACvC,yBAAuB;;CAGzB,YACE,MACA,MACiC;AACjC,SAAO,MAAA,SACL,MAAA,WACA,MAAA,KACA,KAAK,QACL;GACE;GACA;GACD,EACD,MAAA,gBACD;;CAGH,OAAe;AACb,MAAI,CAAC,MAAA,KACH,OAAA,OAAa,UAAU,MAAA,IAAU;AAEnC,SAAO,MAAA;;CAGT,YACE,MAAA,SACE,MAAA,WACA;EACE,GAAG,MAAA;EACH,OAAO;EACR,EACD;EACE,GAAG,KAAK;EACR,UAAU;EACX,EACD,KAAK,eACL,MAAA,gBACD;CAEH,eACE,cACA,aACA,YACoC;EACpC,MAAM,KAAK,OAAO,gBAAgB,aAAa,cAAc,KAAA;EAC7D,MAAM,OAAO,OAAO,gBAAgB,aAAa,UAAU;AAC3D,SAAO,KAAK,OAAO,EAAC,aAAY,OAAO,cAAc,IAAI,KAAK,CAAC;;CAOjE,WACE,cACA,OACgC;AAChC,MAAI,aAAa,WAAA,SAAuB,CACtC,OAAM,IAAI,MACR,0CAA0C,YAAY,+BACvD;AAEH,OAAK,QAAO,MAAK;EAEjB,MAAM,UAAU,MAAA,OAAa,cAAc,MAAA,WAAiB;AAC5D,SAAO,SAAS,uBAAuB;AACvC,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,EAAC,YAAY,WAAW,aAAa,gBAAe,QAAQ;GAClE,MAAM,IAAc,MAAA,SAClB,YACA;IACE,OAAO;IACP,OAAO;IACR,EACD;IACE,eAAe,EAAE;IACjB,UAAU,gBAAgB;IAC3B,EACD,KAAK,eACL,KAAA,EACD;GAOD,MAAM,WAAW,YAAY,GAAG,EAAE,CAAC;AACnC,UACE,cAAc,YAAY,EAC1B,4DACD;AACD,UACE,cAAc,UAAU,EACxB,iEACD;AACD,UACE,YAAY,WAAW,UAAU,QACjC,mFACD;AAED,UAAO,MAAA,SACL,MAAA,WACA;IACE,GAAG,MAAA;IACH,SAAS,CACP,GAAI,MAAA,IAAU,WAAW,EAAE,EAC3B;KACE,QAAQ,MAAA;KACR,aAAa;MACX,aAAa;MACb,YAAY;MACb;KACD,UAAU,UAAA;KACX,CACF;IACF,EACD;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,SAAS;KAC1B;IACF,EACD,KAAK,eACL,MAAA,gBACD;;AAGH,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,CAAC,eAAe,kBAAkB;GACxC,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,KAAK,YACT,GACE,MAAA,SACE,YACA;IACE,OAAO;IACP,OAAO;IACR,EACD;IACE,eAAe,EAAE;IACjB,UAAU,eAAe,gBAAgB;IAC1C,EACD,KAAK,eACL,aACD,CACF,CACF;AAED,UAAO,cAAc,cAAc,YAAY,EAAE,uBAAuB;AACxE,UAAO,cAAc,cAAc,UAAU,EAAE,uBAAuB;AACtE,UAAO,cAAc,eAAe,YAAY,EAAE,uBAAuB;AACzE,UAAO,cAAc,eAAe,UAAU,EAAE,uBAAuB;AAEvE,UAAO,MAAA,SACL,MAAA,WACA;IACE,GAAG,MAAA;IACH,SAAS,CACP,GAAI,MAAA,IAAU,WAAW,EAAE,EAC3B;KACE,QAAQ,MAAA;KACR,aAAa;MACX,aAAa,cAAc;MAC3B,YAAY,cAAc;MAC3B;KACD,QAAQ;KACR,UAAU;MACR,OAAO;MACP,OAAO;MACP,SAAS,CACP;OACE,QAAQ,MAAA;OACR,aAAa;QACX,aAAa,eAAe;QAC5B,YAAY,eAAe;QAC5B;OACD,UAAU,IAAA;OACX,CACF;MACF;KACF,CACF;IACF,EACD;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,GAAG;KACpB;IACF,EACD,KAAK,eACL,MAAA,gBACD;;AAGH,QAAM,IAAI,MAAM,wBAAwB,eAAe;;CAGzD,QAAQ,SAEN,0BACA,WACA,OACiC;EACjC,IAAI;AAEJ,MAAI,OAAO,6BAA6B,WACtC,QAAO,yBAAyB,KAAK,mBAAmB,CAAC;OACpD;AACL,UAAO,UAAU,UAAU,GAAG,wCAAwC;AAGtE,OAAI,UAAU,WAAW,EACvB,QAAO,IAAI,0BAA0B,UAAU;OAE/C,QAAO,IAAI,0BAA0B,WAAW,MAAM;;EAI1D,MAAM,gBAAgB,MAAA,IAAU;AAChC,MAAI,cACF,QAAO,IAAI,eAAe,KAAK;EAGjC,MAAM,QAAQ,kBAAkB,KAAK;AAErC,SAAO,MAAA,SACL,MAAA,WACA;GACE,GAAG,MAAA;GACH;GACD,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;GACD,KAAK,KAAK;CAEZ,SACE,KACA,SAEA,MAAA,SACE,MAAA,WACA;EACE,GAAG,MAAA;EACH,OAAO;GACL;GACA,WAAW,CAAC,MAAM;GACnB;EACF,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;CAEH,SAAS,UAAmD;AAC1D,MAAI,QAAQ,EACV,OAAM,IAAI,MAAM,6BAA6B;AAE/C,OAAK,QAAQ,OAAO,MAClB,OAAM,IAAI,MAAM,2BAA2B;AAE7C,MAAI,MAAA,gBACF,OAAM,IAAI,oBACR,gGACE,MAAA,gBACH;AAGH,SAAO,MAAA,SACL,MAAA,WACA;GACE,GAAG,MAAA;GACH;GACD,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;;CAGH,WACE,OACA,cACoC;AACpC,MAAI,MAAA,gBACF,OAAM,IAAI,oBACR,mGACE,MAAA,gBACH;AAEH,SAAO,MAAA,SACL,MAAA,WACA;GACE,GAAG,MAAA;GACH,SAAS,CAAC,GAAI,MAAA,IAAU,WAAW,EAAE,EAAG,CAAC,OAAiB,UAAU,CAAC;GACtE,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;;CAGH,WACE,cACA,IACA,YACc;AACd,OAAK,QAAO,MAAK;EACjB,MAAM,OAAO,SAAS;EACtB,MAAM,SAAS,SAAS;EACxB,MAAM,UAAU,MAAA,OAAa,cAAc,MAAA,WAAiB;AAC5D,SAAO,SAAS,uBAAuB;AAEvC,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,EAAC,YAAY,eAAe,aAAa,cAAa,QAAQ;AACpE,UAAO,cAAc,YAAY,EAAE,uBAAuB;AAC1D,UAAO,cAAc,UAAU,EAAE,uBAAuB;GAExD,MAAM,WAAW,YACf,GACE,MAAA,SACE,eACA;IACE,OAAO;IACP,OAAO,GAAG,cAAc;IACzB,EACD,eACA,KAAK,eACL,KAAA,EACD,CACF,CACF;AACD,UAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,MAAA;KACR,aAAa;MACX,aAAa;MACb,YAAY;MACb;KACD,UAAU,UAAA;KACX;IACD,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,MAAK,GAAG,EAAE;IACpC,GAAI,WAAW,KAAA,IAAY,EAAC,QAAO,GAAG,EAAE;IACzC;;AAGH,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,CAAC,eAAe,kBAAkB;AACxC,UAAO,cAAc,cAAc,YAAY,EAAE,uBAAuB;AACxE,UAAO,cAAc,cAAc,UAAU,EAAE,uBAAuB;AACtE,UAAO,cAAc,eAAe,YAAY,EAAE,uBAAuB;AACzE,UAAO,cAAc,eAAe,UAAU,EAAE,uBAAuB;GACvE,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,cAAc,GAClB,MAAA,SACE,YACA;IACE,OAAO;IACP,OAAO,GAAG,YAAY,UAAU;IACjC,EACD,eACA,KAAK,eACL,aACD,CACF;AAED,UAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,MAAA;KACR,aAAa;MACX,aAAa,cAAc;MAC3B,YAAY,cAAc;MAC3B;KACD,UAAU;MACR,OAAO;MACP,OAAO,GAAG,cAAc;MACxB,OAAO;OACL,MAAM;OACN,SAAS;QACP,QAAQ,MAAA;QACR,aAAa;SACX,aAAa,eAAe;SAC5B,YAAY,eAAe;SAC5B;QACD,UAAU,YAAY,YAAY,EAAA;QACnC;OACD,IAAI;OACJ,GAAI,SAAS,KAAA,IAAY,EAAC,MAAK,GAAG,EAAE;OACpC,GAAI,WAAW,KAAA,IAAY,EAAC,QAAO,GAAG,EAAE;OACzC;MACF;KACF;IACD,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,MAAK,GAAG,EAAE;IACrC;;AAGH,QAAM,IAAI,MAAM,wBAAwB,eAAe;;CAGzD,IAAI,MAAW;AACb,SAAO,MAAA;;CAGT,oBAAoB;AAClB,SAAO,IAAI,kBAAkB,MAAA,OAAa;;;AAI9C,SAAgB,YAId,GAAyE;AACzE,QAAO,aAAa,WAAW,8BAA8B;AAC7D,QAAO;;AAGT,SAAS,wBAA+B;AACtC,OAAM,IAAI,MAAM,wBAAwB;;AAG1C,SAAS,cAAc,OAAgD;AACrE,QAAO,MAAM,QAAQ,MAAM,IAAI,MAAM,UAAU;;AAGjD,SAAS,SAAY,GAAoC;AACvD,QAAO,EAAE,WAAW;;AAGtB,SAAS,SAAY,GAAuC;AAC1D,QAAO,EAAE,WAAW"}
+{"version":3,"file":"query-impl.js","names":["#schema","#tableName","#ast","#system","#currentJunction","#newQuery","#hash","#exists"],"sources":["../../../../../zql/src/query/query-impl.ts"],"sourcesContent":["// oxlint-disable no-explicit-any\nimport {assert} from '../../../shared/src/asserts.ts';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport {\n  type AST,\n  type CompoundKey,\n  type Condition,\n  type Parameter,\n  type SimpleOperator,\n  type System,\n  SUBQ_PREFIX,\n} from '../../../zero-protocol/src/ast.ts';\nimport {hashOfAST} from '../../../zero-protocol/src/query-hash.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport {NotImplementedError} from '../error.ts';\nimport {defaultFormat} from '../ivm/default-format.ts';\nimport type {Format, ViewFactory} from '../ivm/view.ts';\nimport {\n  type ExpressionFactory,\n  ExpressionBuilder,\n  and,\n  cmp,\n  simplifyCondition,\n} from './expression.ts';\nimport type {CustomQueryID} from './named.ts';\nimport {type QueryInternals, queryInternalsTag} from './query-internals.ts';\nimport type {\n  AnyQuery,\n  ExistsOptions,\n  GetFilterType,\n  HumanReadable,\n  PreloadOptions,\n  PullRow,\n  Query,\n  RunOptions,\n} from './query.ts';\nimport type {TTL} from './ttl.ts';\nimport type {TypedView} from './typed-view.ts';\n\ntype GetFilterTypeAny = GetFilterType<any, any, any>;\n\ntype NewQueryFunction<TSchema extends Schema> = <\n  TTable extends keyof TSchema['tables'] & string,\n  TReturn,\n>(\n  this: unknown,\n  tableName: TTable,\n  ast: AST,\n  format: Format,\n  customQueryID: CustomQueryID | undefined,\n  currentJunction: string | undefined,\n) => QueryImpl<TTable, TSchema, TReturn>;\n\nexport function newQuery<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n>(schema: TSchema, table: TTable): Query<TTable, TSchema> {\n  return newQueryImpl(schema, table, {table}, defaultFormat, 'client');\n}\n\nexport function newQueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn = PullRow<TTable, TSchema>,\n>(\n  schema: TSchema,\n  tableName: TTable,\n  ast: AST,\n  format: Format,\n  system: System,\n): QueryImpl<TTable, TSchema, TReturn> {\n  const inner: NewQueryFunction<TSchema> = (\n    tableName,\n    ast,\n    format,\n    customQueryID,\n    currentJunction,\n  ) =>\n    new QueryImpl(\n      schema,\n      tableName,\n      ast,\n      format,\n      system,\n      customQueryID,\n      currentJunction,\n      inner,\n    );\n\n  return inner(tableName, ast, format, undefined, undefined);\n}\n\nexport class QueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn = PullRow<TTable, TSchema>,\n>\n  implements\n    Query<TTable, TSchema, TReturn>,\n    QueryInternals<TTable, TSchema, TReturn>\n{\n  readonly [queryInternalsTag] = true;\n\n  readonly #schema: TSchema;\n  readonly #tableName: TTable;\n  readonly #ast: AST;\n  readonly format: Format;\n  #hash: string = '';\n  readonly #system: System;\n  readonly #currentJunction: string | undefined;\n  readonly customQueryID: CustomQueryID | undefined;\n  readonly #newQuery: NewQueryFunction<TSchema>;\n\n  constructor(\n    schema: TSchema,\n    tableName: TTable,\n    ast: AST,\n    format: Format,\n    system: System,\n    customQueryID: CustomQueryID | undefined,\n    currentJunction: string | undefined,\n    newQuery: NewQueryFunction<TSchema>,\n  ) {\n    this.#schema = schema;\n    this.#tableName = tableName;\n    this.#ast = ast;\n    this.format = format;\n    this.#system = system;\n    this.#currentJunction = currentJunction;\n    this.customQueryID = customQueryID;\n    this.#newQuery = newQuery;\n  }\n\n  run(_options?: RunOptions): Promise<HumanReadable<TReturn>> {\n    throwQueryNotRunnable();\n  }\n\n  preload(_options?: PreloadOptions): {\n    cleanup: () => void;\n    complete: Promise<void>;\n  } {\n    throwQueryNotRunnable();\n  }\n\n  materialize(ttl?: TTL): TypedView<HumanReadable<TReturn>>;\n  materialize<T>(\n    factory: ViewFactory<TTable, TSchema, TReturn, T>,\n    ttl?: TTL,\n  ): T;\n  materialize<T>(\n    _factoryOrTTL?: ViewFactory<TTable, TSchema, TReturn, T> | TTL,\n    _ttl?: TTL,\n  ): T | TypedView<HumanReadable<TReturn>> {\n    throwQueryNotRunnable();\n  }\n\n  nameAndArgs(\n    name: string,\n    args: ReadonlyArray<ReadonlyJSONValue>,\n  ): Query<TTable, TSchema, TReturn> {\n    return this.#newQuery(\n      this.#tableName,\n      this.#ast,\n      this.format,\n      {\n        name,\n        args,\n      },\n      this.#currentJunction,\n    );\n  }\n\n  hash(): string {\n    if (!this.#hash) {\n      this.#hash = hashOfAST(this.#ast) + (this.format.singular ? 't' : 'f');\n    }\n    return this.#hash;\n  }\n\n  one = (): Query<TTable, TSchema, TReturn | undefined> =>\n    this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        limit: 1,\n      },\n      {\n        ...this.format,\n        singular: true,\n      },\n      this.customQueryID,\n      this.#currentJunction,\n    );\n\n  whereExists = (\n    relationship: string,\n    cbOrOptions?: ((q: AnyQuery) => AnyQuery) | ExistsOptions,\n    options?: ExistsOptions,\n  ): Query<TTable, TSchema, TReturn> => {\n    const cb = typeof cbOrOptions === 'function' ? cbOrOptions : undefined;\n    const opts = typeof cbOrOptions === 'function' ? options : cbOrOptions;\n    return this.where(({exists}) => exists(relationship, cb, opts)) as Query<\n      TTable,\n      TSchema,\n      TReturn\n    >;\n  };\n\n  related = (\n    relationship: string,\n    cb?: (q: AnyQuery) => AnyQuery,\n  ): Query<TTable, TSchema, any> => {\n    if (relationship.startsWith(SUBQ_PREFIX)) {\n      throw new Error(\n        `Relationship names may not start with \"${SUBQ_PREFIX}\". That is a reserved prefix.`,\n      );\n    }\n    cb = cb ?? (q => q);\n\n    const related = this.#schema.relationships[this.#tableName][relationship];\n    assert(related, 'Invalid relationship');\n    if (isOneHop(related)) {\n      const {destSchema, destField, sourceField, cardinality} = related[0];\n      const q: AnyQuery = this.#newQuery(\n        destSchema,\n        {\n          table: destSchema,\n          alias: relationship,\n        },\n        {\n          relationships: {},\n          singular: cardinality === 'one',\n        },\n        this.customQueryID,\n        undefined,\n      ) as AnyQuery;\n      // Intentionally not setting to `one` as it is a perf degradation\n      // and the user should not be making the mistake of setting cardinality to\n      // `one` when it is actually not.\n      // if (cardinality === 'one') {\n      //   q = q.one();\n      // }\n      const subQuery = asQueryImpl(cb(q));\n      assert(\n        isCompoundKey(sourceField),\n        'The source of a relationship must specify at last 1 field',\n      );\n      assert(\n        isCompoundKey(destField),\n        'The destination of a relationship must specify at last 1 field',\n      );\n      assert(\n        sourceField.length === destField.length,\n        'The source and destination of a relationship must have the same number of fields',\n      );\n\n      return this.#newQuery(\n        this.#tableName,\n        {\n          ...this.#ast,\n          related: [\n            ...(this.#ast.related ?? []),\n            {\n              system: this.#system,\n              correlation: {\n                parentField: sourceField,\n                childField: destField,\n              },\n              subquery: subQuery.#ast,\n            },\n          ],\n        },\n        {\n          ...this.format,\n          relationships: {\n            ...this.format.relationships,\n            [relationship]: subQuery.format,\n          },\n        },\n        this.customQueryID,\n        this.#currentJunction,\n      ) as AnyQuery;\n    }\n\n    if (isTwoHop(related)) {\n      const [firstRelation, secondRelation] = related;\n      const {destSchema} = secondRelation;\n      const junctionSchema = firstRelation.destSchema;\n      const sq = asQueryImpl(\n        cb(\n          this.#newQuery(\n            destSchema,\n            {\n              table: destSchema,\n              alias: relationship,\n            },\n            {\n              relationships: {},\n              singular: secondRelation.cardinality === 'one',\n            },\n            this.customQueryID,\n            relationship,\n          ),\n        ),\n      );\n\n      assert(isCompoundKey(firstRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(firstRelation.destField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.destField), 'Invalid relationship');\n\n      return this.#newQuery(\n        this.#tableName,\n        {\n          ...this.#ast,\n          related: [\n            ...(this.#ast.related ?? []),\n            {\n              system: this.#system,\n              correlation: {\n                parentField: firstRelation.sourceField,\n                childField: firstRelation.destField,\n              },\n              hidden: true,\n              subquery: {\n                table: junctionSchema,\n                alias: relationship,\n                related: [\n                  {\n                    system: this.#system,\n                    correlation: {\n                      parentField: secondRelation.sourceField,\n                      childField: secondRelation.destField,\n                    },\n                    subquery: sq.#ast,\n                  },\n                ],\n              },\n            },\n          ],\n        },\n        {\n          ...this.format,\n          relationships: {\n            ...this.format.relationships,\n            [relationship]: sq.format,\n          },\n        },\n        this.customQueryID,\n        this.#currentJunction,\n      ) as AnyQuery;\n    }\n\n    throw new Error(`Invalid relationship ${relationship}`);\n  };\n\n  where = function (\n    this: QueryImpl<TTable, TSchema, TReturn>,\n    fieldOrExpressionFactory: string | ExpressionFactory<TTable, TSchema>,\n    opOrValue?: SimpleOperator | GetFilterTypeAny | Parameter,\n    value?: GetFilterTypeAny | Parameter,\n  ): Query<TTable, TSchema, TReturn> {\n    let cond: Condition;\n\n    if (typeof fieldOrExpressionFactory === 'function') {\n      cond = fieldOrExpressionFactory(this.expressionBuilder());\n    } else {\n      assert(arguments.length >= 2, 'Invalid condition. Too few arguments.');\n      // Distinguish between 2-arg form (field, value) and 3-arg form (field, op, value)\n      // using arguments.length to allow explicit undefined in 3-arg form.\n      if (arguments.length === 2) {\n        cond = cmp(fieldOrExpressionFactory, opOrValue);\n      } else {\n        cond = cmp(fieldOrExpressionFactory, opOrValue, value);\n      }\n    }\n\n    const existingWhere = this.#ast.where;\n    if (existingWhere) {\n      cond = and(existingWhere, cond);\n    }\n\n    const where = simplifyCondition(cond);\n\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        where,\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  }.bind(this);\n\n  start = (\n    row: Partial<Record<string, ReadonlyJSONValue | undefined>>,\n    opts?: {inclusive: boolean},\n  ): Query<TTable, TSchema, TReturn> =>\n    this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        start: {\n          row,\n          exclusive: !opts?.inclusive,\n        },\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n\n  limit = (limit: number): Query<TTable, TSchema, TReturn> => {\n    if (limit < 0) {\n      throw new Error('Limit must be non-negative');\n    }\n    if ((limit | 0) !== limit) {\n      throw new Error('Limit must be an integer');\n    }\n    if (this.#currentJunction) {\n      throw new NotImplementedError(\n        'Limit is not supported in junction relationships yet. Junction relationship being limited: ' +\n          this.#currentJunction,\n      );\n    }\n\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        limit,\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  };\n\n  orderBy = <TSelector extends keyof TSchema['tables'][TTable]['columns']>(\n    field: TSelector,\n    direction: 'asc' | 'desc',\n  ): Query<TTable, TSchema, TReturn> => {\n    if (this.#currentJunction) {\n      throw new NotImplementedError(\n        'Order by is not supported in junction relationships yet. Junction relationship being ordered: ' +\n          this.#currentJunction,\n      );\n    }\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        orderBy: [...(this.#ast.orderBy ?? []), [field as string, direction]],\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  };\n\n  #exists = (\n    relationship: string,\n    cb: ((query: AnyQuery) => AnyQuery) | undefined,\n    options?: ExistsOptions,\n  ): Condition => {\n    cb = cb ?? (q => q);\n    const flip = options?.flip;\n    const scalar = options?.scalar;\n    const related = this.#schema.relationships[this.#tableName][relationship];\n    assert(related, 'Invalid relationship');\n\n    if (isOneHop(related)) {\n      const {destSchema: destTableName, sourceField, destField} = related[0];\n      assert(isCompoundKey(sourceField), 'Invalid relationship');\n      assert(isCompoundKey(destField), 'Invalid relationship');\n\n      const subQuery = asQueryImpl(\n        cb(\n          this.#newQuery(\n            destTableName,\n            {\n              table: destTableName,\n              alias: `${SUBQ_PREFIX}${relationship}`,\n            },\n            defaultFormat,\n            this.customQueryID,\n            undefined,\n          ),\n        ),\n      );\n      return {\n        type: 'correlatedSubquery',\n        related: {\n          system: this.#system,\n          correlation: {\n            parentField: sourceField,\n            childField: destField,\n          },\n          subquery: subQuery.#ast,\n        },\n        op: 'EXISTS',\n        ...(flip !== undefined ? {flip} : {}),\n        ...(scalar !== undefined ? {scalar} : {}),\n      };\n    }\n\n    if (isTwoHop(related)) {\n      const [firstRelation, secondRelation] = related;\n      assert(isCompoundKey(firstRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(firstRelation.destField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.destField), 'Invalid relationship');\n      const {destSchema} = secondRelation;\n      const junctionSchema = firstRelation.destSchema;\n      const queryToDest = cb(\n        this.#newQuery(\n          destSchema,\n          {\n            table: destSchema,\n            alias: `${SUBQ_PREFIX}zhidden_${relationship}`,\n          },\n          defaultFormat,\n          this.customQueryID,\n          relationship,\n        ) as AnyQuery,\n      );\n\n      return {\n        type: 'correlatedSubquery',\n        related: {\n          system: this.#system,\n          correlation: {\n            parentField: firstRelation.sourceField,\n            childField: firstRelation.destField,\n          },\n          subquery: {\n            table: junctionSchema,\n            alias: `${SUBQ_PREFIX}${relationship}`,\n            where: {\n              type: 'correlatedSubquery',\n              related: {\n                system: this.#system,\n                correlation: {\n                  parentField: secondRelation.sourceField,\n                  childField: secondRelation.destField,\n                },\n                subquery: asQueryImpl(queryToDest).#ast,\n              },\n              op: 'EXISTS',\n              ...(flip !== undefined ? {flip} : {}),\n              ...(scalar !== undefined ? {scalar} : {}),\n            },\n          },\n        },\n        op: 'EXISTS',\n        ...(flip !== undefined ? {flip} : {}),\n      };\n    }\n\n    throw new Error(`Invalid relationship ${relationship}`);\n  };\n\n  get ast(): AST {\n    return this.#ast;\n  }\n\n  expressionBuilder() {\n    return new ExpressionBuilder(this.#exists);\n  }\n}\n\nexport function asQueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(q: Query<TTable, TSchema, TReturn>): QueryImpl<TTable, TSchema, TReturn> {\n  assert(q instanceof QueryImpl, 'Expected QueryImpl instance');\n  return q;\n}\n\nfunction throwQueryNotRunnable(): never {\n  throw new Error('Query is not runnable');\n}\n\nfunction isCompoundKey(field: readonly string[]): field is CompoundKey {\n  return Array.isArray(field) && field.length >= 1;\n}\n\nfunction isOneHop<T>(r: readonly T[]): r is readonly [T] {\n  return r.length === 1;\n}\n\nfunction isTwoHop<T>(r: readonly T[]): r is readonly [T, T] {\n  return r.length === 2;\n}\n"],"mappings":";;;;;;;;AAqDA,SAAgB,SAGd,QAAiB,OAAuC;CACxD,OAAO,aAAa,QAAQ,OAAO,EAAC,MAAK,GAAG,eAAe,QAAQ;AACrE;AAEA,SAAgB,aAKd,QACA,WACA,KACA,QACA,QACqC;CACrC,MAAM,SACJ,WACA,KACA,QACA,eACA,oBAEA,IAAI,UACF,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,KACF;CAEF,OAAO,MAAM,WAAW,KAAK,QAAQ,KAAA,GAAW,KAAA,CAAS;AAC3D;AAEA,IAAa,YAAb,MAQA;CACE,CAAU,qBAAqB;CAE/B;CACA;CACA;CACA;CACA,QAAgB;CAChB;CACA;CACA;CACA;CAEA,YACE,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,UACA;EACA,KAAKA,UAAU;EACf,KAAKC,aAAa;EAClB,KAAKC,OAAO;EACZ,KAAK,SAAS;EACd,KAAKC,UAAU;EACf,KAAKC,mBAAmB;EACxB,KAAK,gBAAgB;EACrB,KAAKC,YAAY;CACnB;CAEA,IAAI,UAAwD;EAC1D,sBAAsB;CACxB;CAEA,QAAQ,UAGN;EACA,sBAAsB;CACxB;CAOA,YACE,eACA,MACuC;EACvC,sBAAsB;CACxB;CAEA,YACE,MACA,MACiC;EACjC,OAAO,KAAKA,UACV,KAAKJ,YACL,KAAKC,MACL,KAAK,QACL;GACE;GACA;EACF,GACA,KAAKE,gBACP;CACF;CAEA,OAAe;EACb,IAAI,CAAC,KAAKE,OACR,KAAKA,QAAQ,UAAU,KAAKJ,IAAI,KAAK,KAAK,OAAO,WAAW,MAAM;EAEpE,OAAO,KAAKI;CACd;CAEA,YACE,KAAKD,UACH,KAAKJ,YACL;EACE,GAAG,KAAKC;EACR,OAAO;CACT,GACA;EACE,GAAG,KAAK;EACR,UAAU;CACZ,GACA,KAAK,eACL,KAAKE,gBACP;CAEF,eACE,cACA,aACA,YACoC;EACpC,MAAM,KAAK,OAAO,gBAAgB,aAAa,cAAc,KAAA;EAC7D,MAAM,OAAO,OAAO,gBAAgB,aAAa,UAAU;EAC3D,OAAO,KAAK,OAAO,EAAC,aAAY,OAAO,cAAc,IAAI,IAAI,CAAC;CAKhE;CAEA,WACE,cACA,OACgC;EAChC,IAAI,aAAa,WAAA,QAAsB,GACrC,MAAM,IAAI,MACR,0CAA0C,YAAY,8BACxD;EAEF,KAAK,QAAO,MAAK;EAEjB,MAAM,UAAU,KAAKJ,QAAQ,cAAc,KAAKC,YAAY;EAC5D,OAAO,SAAS,sBAAsB;EACtC,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,EAAC,YAAY,WAAW,aAAa,gBAAe,QAAQ;GAClE,MAAM,IAAc,KAAKI,UACvB,YACA;IACE,OAAO;IACP,OAAO;GACT,GACA;IACE,eAAe,CAAC;IAChB,UAAU,gBAAgB;GAC5B,GACA,KAAK,eACL,KAAA,CACF;GAOA,MAAM,WAAW,YAAY,GAAG,CAAC,CAAC;GAClC,OACE,cAAc,WAAW,GACzB,2DACF;GACA,OACE,cAAc,SAAS,GACvB,gEACF;GACA,OACE,YAAY,WAAW,UAAU,QACjC,kFACF;GAEA,OAAO,KAAKA,UACV,KAAKJ,YACL;IACE,GAAG,KAAKC;IACR,SAAS,CACP,GAAI,KAAKA,KAAK,WAAW,CAAC,GAC1B;KACE,QAAQ,KAAKC;KACb,aAAa;MACX,aAAa;MACb,YAAY;KACd;KACA,UAAU,SAASD;IACrB,CACF;GACF,GACA;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,SAAS;IAC3B;GACF,GACA,KAAK,eACL,KAAKE,gBACP;EACF;EAEA,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,CAAC,eAAe,kBAAkB;GACxC,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,KAAK,YACT,GACE,KAAKC,UACH,YACA;IACE,OAAO;IACP,OAAO;GACT,GACA;IACE,eAAe,CAAC;IAChB,UAAU,eAAe,gBAAgB;GAC3C,GACA,KAAK,eACL,YACF,CACF,CACF;GAEA,OAAO,cAAc,cAAc,WAAW,GAAG,sBAAsB;GACvE,OAAO,cAAc,cAAc,SAAS,GAAG,sBAAsB;GACrE,OAAO,cAAc,eAAe,WAAW,GAAG,sBAAsB;GACxE,OAAO,cAAc,eAAe,SAAS,GAAG,sBAAsB;GAEtE,OAAO,KAAKA,UACV,KAAKJ,YACL;IACE,GAAG,KAAKC;IACR,SAAS,CACP,GAAI,KAAKA,KAAK,WAAW,CAAC,GAC1B;KACE,QAAQ,KAAKC;KACb,aAAa;MACX,aAAa,cAAc;MAC3B,YAAY,cAAc;KAC5B;KACA,QAAQ;KACR,UAAU;MACR,OAAO;MACP,OAAO;MACP,SAAS,CACP;OACE,QAAQ,KAAKA;OACb,aAAa;QACX,aAAa,eAAe;QAC5B,YAAY,eAAe;OAC7B;OACA,UAAU,GAAGD;MACf,CACF;KACF;IACF,CACF;GACF,GACA;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,GAAG;IACrB;GACF,GACA,KAAK,eACL,KAAKE,gBACP;EACF;EAEA,MAAM,IAAI,MAAM,wBAAwB,cAAc;CACxD;CAEA,QAAQ,SAEN,0BACA,WACA,OACiC;EACjC,IAAI;EAEJ,IAAI,OAAO,6BAA6B,YACtC,OAAO,yBAAyB,KAAK,kBAAkB,CAAC;OACnD;GACL,OAAO,UAAU,UAAU,GAAG,uCAAuC;GAGrE,IAAI,UAAU,WAAW,GACvB,OAAO,IAAI,0BAA0B,SAAS;QAE9C,OAAO,IAAI,0BAA0B,WAAW,KAAK;EAEzD;EAEA,MAAM,gBAAgB,KAAKF,KAAK;EAChC,IAAI,eACF,OAAO,IAAI,eAAe,IAAI;EAGhC,MAAM,QAAQ,kBAAkB,IAAI;EAEpC,OAAO,KAAKG,UACV,KAAKJ,YACL;GACE,GAAG,KAAKC;GACR;EACF,GACA,KAAK,QACL,KAAK,eACL,KAAKE,gBACP;CACF,EAAE,KAAK,IAAI;CAEX,SACE,KACA,SAEA,KAAKC,UACH,KAAKJ,YACL;EACE,GAAG,KAAKC;EACR,OAAO;GACL;GACA,WAAW,CAAC,MAAM;EACpB;CACF,GACA,KAAK,QACL,KAAK,eACL,KAAKE,gBACP;CAEF,SAAS,UAAmD;EAC1D,IAAI,QAAQ,GACV,MAAM,IAAI,MAAM,4BAA4B;EAE9C,KAAK,QAAQ,OAAO,OAClB,MAAM,IAAI,MAAM,0BAA0B;EAE5C,IAAI,KAAKA,kBACP,MAAM,IAAI,oBACR,gGACE,KAAKA,gBACT;EAGF,OAAO,KAAKC,UACV,KAAKJ,YACL;GACE,GAAG,KAAKC;GACR;EACF,GACA,KAAK,QACL,KAAK,eACL,KAAKE,gBACP;CACF;CAEA,WACE,OACA,cACoC;EACpC,IAAI,KAAKA,kBACP,MAAM,IAAI,oBACR,mGACE,KAAKA,gBACT;EAEF,OAAO,KAAKC,UACV,KAAKJ,YACL;GACE,GAAG,KAAKC;GACR,SAAS,CAAC,GAAI,KAAKA,KAAK,WAAW,CAAC,GAAI,CAAC,OAAiB,SAAS,CAAC;EACtE,GACA,KAAK,QACL,KAAK,eACL,KAAKE,gBACP;CACF;CAEA,WACE,cACA,IACA,YACc;EACd,KAAK,QAAO,MAAK;EACjB,MAAM,OAAO,SAAS;EACtB,MAAM,SAAS,SAAS;EACxB,MAAM,UAAU,KAAKJ,QAAQ,cAAc,KAAKC,YAAY;EAC5D,OAAO,SAAS,sBAAsB;EAEtC,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,EAAC,YAAY,eAAe,aAAa,cAAa,QAAQ;GACpE,OAAO,cAAc,WAAW,GAAG,sBAAsB;GACzD,OAAO,cAAc,SAAS,GAAG,sBAAsB;GAEvD,MAAM,WAAW,YACf,GACE,KAAKI,UACH,eACA;IACE,OAAO;IACP,OAAO,GAAG,cAAc;GAC1B,GACA,eACA,KAAK,eACL,KAAA,CACF,CACF,CACF;GACA,OAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,KAAKF;KACb,aAAa;MACX,aAAa;MACb,YAAY;KACd;KACA,UAAU,SAASD;IACrB;IACA,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,KAAI,IAAI,CAAC;IACnC,GAAI,WAAW,KAAA,IAAY,EAAC,OAAM,IAAI,CAAC;GACzC;EACF;EAEA,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,CAAC,eAAe,kBAAkB;GACxC,OAAO,cAAc,cAAc,WAAW,GAAG,sBAAsB;GACvE,OAAO,cAAc,cAAc,SAAS,GAAG,sBAAsB;GACrE,OAAO,cAAc,eAAe,WAAW,GAAG,sBAAsB;GACxE,OAAO,cAAc,eAAe,SAAS,GAAG,sBAAsB;GACtE,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,cAAc,GAClB,KAAKG,UACH,YACA;IACE,OAAO;IACP,OAAO,GAAG,YAAY,UAAU;GAClC,GACA,eACA,KAAK,eACL,YACF,CACF;GAEA,OAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,KAAKF;KACb,aAAa;MACX,aAAa,cAAc;MAC3B,YAAY,cAAc;KAC5B;KACA,UAAU;MACR,OAAO;MACP,OAAO,GAAG,cAAc;MACxB,OAAO;OACL,MAAM;OACN,SAAS;QACP,QAAQ,KAAKA;QACb,aAAa;SACX,aAAa,eAAe;SAC5B,YAAY,eAAe;QAC7B;QACA,UAAU,YAAY,WAAW,EAAED;OACrC;OACA,IAAI;OACJ,GAAI,SAAS,KAAA,IAAY,EAAC,KAAI,IAAI,CAAC;OACnC,GAAI,WAAW,KAAA,IAAY,EAAC,OAAM,IAAI,CAAC;MACzC;KACF;IACF;IACA,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,KAAI,IAAI,CAAC;GACrC;EACF;EAEA,MAAM,IAAI,MAAM,wBAAwB,cAAc;CACxD;CAEA,IAAI,MAAW;EACb,OAAO,KAAKA;CACd;CAEA,oBAAoB;EAClB,OAAO,IAAI,kBAAkB,KAAKK,OAAO;CAC3C;AACF;AAEA,SAAgB,YAId,GAAyE;CACzE,OAAO,aAAa,WAAW,6BAA6B;CAC5D,OAAO;AACT;AAEA,SAAS,wBAA+B;CACtC,MAAM,IAAI,MAAM,uBAAuB;AACzC;AAEA,SAAS,cAAc,OAAgD;CACrE,OAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,UAAU;AACjD;AAEA,SAAS,SAAY,GAAoC;CACvD,OAAO,EAAE,WAAW;AACtB;AAEA,SAAS,SAAY,GAAuC;CAC1D,OAAO,EAAE,WAAW;AACtB"}

package/out/zql/src/query/query-internals.js.map

@@ -1 +1 @@
-{"version":3,"file":"query-internals.js","names":[],"sources":["../../../../../zql/src/query/query-internals.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport type {AST} from '../../../zero-protocol/src/ast.ts';\nimport type {Schema as ZeroSchema} from '../../../zero-types/src/schema.ts';\nimport type {Format} from '../ivm/view.ts';\nimport type {CustomQueryID} from './named.ts';\nimport type {Query} from './query.ts';\n\nexport const queryInternalsTag = Symbol();\n\n/**\n * Internal interface for query implementation details.\n * This is not part of the public API and should only be accessed via\n * the {@linkcode asQueryInternals} function.\n *\n * @typeParam TSchema The database schema type extending ZeroSchema\n * @typeParam TTable The name of the table being queried, must be a key of TSchema['tables']\n * @typeParam TReturn The return type of the query, defaults to PullRow<TTable, TSchema>\n */\nexport interface QueryInternals<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n  TReturn,\n> {\n  readonly [queryInternalsTag]: true;\n\n  /**\n   * Format is used to specify the shape of the query results. This is used by\n   * {@linkcode one} and it also describes the shape when using\n   * {@linkcode related}.\n   */\n  readonly format: Format;\n\n  /**\n   * A string that uniquely identifies this query. This can be used to determine\n   * if two queries are the same.\n   *\n   * The hash of a custom query, on the client, is the hash of its AST.\n   * The hash of a custom query, on the server, is the hash of its name and args.\n   *\n   * The first allows many client-side queries to be pinned to the same backend query.\n   * The second ensures we do not invoke a named query on the backend more than once for the same `name:arg` pairing.\n   *\n   * If the query.hash was of `name:args` then `useQuery` would de-dupe\n   * queries with divergent ASTs.\n   *\n   * QueryManager will hash based on `name:args` since it is speaking with\n   * the server which tracks queries by `name:args`.\n   */\n  hash(): string;\n\n  /**\n   * The completed AST for this query, with any missing primary keys added to\n   * orderBy and start.\n   */\n  readonly ast: AST;\n\n  readonly customQueryID: CustomQueryID | undefined;\n\n  /**\n   * Associates a name and arguments with this query for custom query tracking.\n   * This is used internally to track named queries on the server.\n   *\n   * @internal\n   */\n  nameAndArgs(\n    name: string,\n    args: ReadonlyArray<ReadonlyJSONValue>,\n  ): Query<TTable, TSchema, TReturn>;\n}\n\n/**\n * Helper function to cast a Query to QueryInternals.\n * This is used in tests and internal code to access query implementation details.\n * The function asserts that the query has the queryInternalsTag to ensure it\n * properly implements the QueryInternals interface.\n *\n * @internal\n */\nexport function asQueryInternals<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n  TReturn,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n): QueryInternals<TTable, TSchema, TReturn> {\n  assert(\n    queryInternalsTag in query,\n    'Query does not implement QueryInternals. This likely means there are two copies of Zero in your runtime.',\n  );\n  return query as unknown as QueryInternals<TTable, TSchema, TReturn>;\n}\n\nexport function isQueryInternals<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n  TReturn,\n>(obj: unknown): obj is QueryInternals<TTable, TSchema, TReturn> {\n  return typeof obj === 'object' && obj !== null && queryInternalsTag in obj;\n}\n\nexport function asQuery<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n  TReturn,\n>(\n  queryInternals: QueryInternals<TTable, TSchema, TReturn>,\n): Query<TTable, TSchema, TReturn> {\n  assert(queryInternalsTag in queryInternals, 'Expected query internals tag');\n  return queryInternals as unknown as Query<TTable, TSchema, TReturn>;\n}\n\n// oxlint-disable-next-line no-explicit-any\nexport type AnyQueryInternals = QueryInternals<string, ZeroSchema, any>;\n"],"mappings":";;AAQA,IAAa,oBAAoB,QAAQ;;;;;;;;;AAuEzC,SAAgB,iBAKd,OAC0C;AAC1C,QACE,qBAAqB,OACrB,2GACD;AACD,QAAO"}
+{"version":3,"file":"query-internals.js","names":[],"sources":["../../../../../zql/src/query/query-internals.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport type {AST} from '../../../zero-protocol/src/ast.ts';\nimport type {Schema as ZeroSchema} from '../../../zero-types/src/schema.ts';\nimport type {Format} from '../ivm/view.ts';\nimport type {CustomQueryID} from './named.ts';\nimport type {Query} from './query.ts';\n\nexport const queryInternalsTag = Symbol();\n\n/**\n * Internal interface for query implementation details.\n * This is not part of the public API and should only be accessed via\n * the {@linkcode asQueryInternals} function.\n *\n * @typeParam TSchema The database schema type extending ZeroSchema\n * @typeParam TTable The name of the table being queried, must be a key of TSchema['tables']\n * @typeParam TReturn The return type of the query, defaults to PullRow<TTable, TSchema>\n */\nexport interface QueryInternals<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n  TReturn,\n> {\n  readonly [queryInternalsTag]: true;\n\n  /**\n   * Format is used to specify the shape of the query results. This is used by\n   * {@linkcode one} and it also describes the shape when using\n   * {@linkcode related}.\n   */\n  readonly format: Format;\n\n  /**\n   * A string that uniquely identifies this query. This can be used to determine\n   * if two queries are the same.\n   *\n   * The hash of a custom query, on the client, is the hash of its AST.\n   * The hash of a custom query, on the server, is the hash of its name and args.\n   *\n   * The first allows many client-side queries to be pinned to the same backend query.\n   * The second ensures we do not invoke a named query on the backend more than once for the same `name:arg` pairing.\n   *\n   * If the query.hash was of `name:args` then `useQuery` would de-dupe\n   * queries with divergent ASTs.\n   *\n   * QueryManager will hash based on `name:args` since it is speaking with\n   * the server which tracks queries by `name:args`.\n   */\n  hash(): string;\n\n  /**\n   * The completed AST for this query, with any missing primary keys added to\n   * orderBy and start.\n   */\n  readonly ast: AST;\n\n  readonly customQueryID: CustomQueryID | undefined;\n\n  /**\n   * Associates a name and arguments with this query for custom query tracking.\n   * This is used internally to track named queries on the server.\n   *\n   * @internal\n   */\n  nameAndArgs(\n    name: string,\n    args: ReadonlyArray<ReadonlyJSONValue>,\n  ): Query<TTable, TSchema, TReturn>;\n}\n\n/**\n * Helper function to cast a Query to QueryInternals.\n * This is used in tests and internal code to access query implementation details.\n * The function asserts that the query has the queryInternalsTag to ensure it\n * properly implements the QueryInternals interface.\n *\n * @internal\n */\nexport function asQueryInternals<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n  TReturn,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n): QueryInternals<TTable, TSchema, TReturn> {\n  assert(\n    queryInternalsTag in query,\n    'Query does not implement QueryInternals. This likely means there are two copies of Zero in your runtime.',\n  );\n  return query as unknown as QueryInternals<TTable, TSchema, TReturn>;\n}\n\nexport function isQueryInternals<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n  TReturn,\n>(obj: unknown): obj is QueryInternals<TTable, TSchema, TReturn> {\n  return typeof obj === 'object' && obj !== null && queryInternalsTag in obj;\n}\n\nexport function asQuery<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends ZeroSchema,\n  TReturn,\n>(\n  queryInternals: QueryInternals<TTable, TSchema, TReturn>,\n): Query<TTable, TSchema, TReturn> {\n  assert(queryInternalsTag in queryInternals, 'Expected query internals tag');\n  return queryInternals as unknown as Query<TTable, TSchema, TReturn>;\n}\n\n// oxlint-disable-next-line no-explicit-any\nexport type AnyQueryInternals = QueryInternals<string, ZeroSchema, any>;\n"],"mappings":";;AAQA,IAAa,oBAAoB,OAAO;;;;;;;;;AAuExC,SAAgB,iBAKd,OAC0C;CAC1C,OACE,qBAAqB,OACrB,0GACF;CACA,OAAO;AACT"}

package/out/zql/src/query/query-registry.d.ts

@@ -97,13 +97,20 @@ export type QueryDefinitionFunction<TTable extends string, TInput extends Readon
     args: TInput;
     ctx: TContext;
 }) => Query<TTable, Schema, TReturn>;
-export type QueryExecutionFunction<TTable extends string, TInput extends ReadonlyJSONValue | undefined, TReturn, TContext> = (options: IsUnknown<TContext> extends true ? {
+export type QueryExecutionFunction<TTable extends string, TInput extends ReadonlyJSONValue | undefined, TReturn, TContext> = (options: QueryExecutionOptions<TInput, TContext>) => Query<TTable, Schema, TReturn>;
+type QueryExecutionOptions<TInput extends ReadonlyJSONValue | undefined, TContext> = undefined extends TInput ? IsUnknown<TContext> extends true ? {
+    args?: TInput | undefined;
+    ctx?: TContext | undefined;
+} : {
+    args?: TInput | undefined;
+    ctx: TContext;
+} : IsUnknown<TContext> extends true ? {
     args: TInput;
-    ctx?: TContext;
+    ctx?: TContext | undefined;
 } : {
     args: TInput;
     ctx: TContext;
-}) => Query<TTable, Schema, TReturn>;
+};
 /**
  * Defines a query to be used with {@link defineQueries}.
  *