@rocicorp/zero 1.11.0-canary.12 → 1.11.0-canary.13

package/out/zql/src/ivm/flipped-join.js.map

@@ -1 +1 @@
-{"version":3,"file":"flipped-join.js","names":["#parent","#child","#parentKey","#childKey","#relationshipName","#schema","#parentPartitionKey","#boundProvider","#storage","#pushParent","#reconcile","#pushChild","#output","#inprogressChildChange","#fetchBatched","#fetchChunked","#yieldParentWithOverlay","#inprogressChildChangePosition","#indexParentRow","#pushChildChange","#unindexParentRow"],"sources":["../../../../../zql/src/ivm/flipped-join.ts"],"sourcesContent":["import {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport {binarySearch} from '../../../shared/src/binary-search.ts';\nimport type {CompoundKey, System} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.ts';\nimport {\n  makeAddChange,\n  makeChildChange,\n  makeEditChange,\n  makeRemoveChange,\n  type Change,\n} from './change.ts';\nimport {constraintsAreCompatible, type Constraint} from './constraint.ts';\nimport type {Node} from './data.ts';\nimport {\n  buildJoinConstraint,\n  canonicalKey,\n  canonicalKeyForTest,\n  generateWithOverlayNoYield,\n  getMatchingParentEntries,\n  indexParentInStorage,\n  isJoinMatch,\n  rowEqualsForCompoundKey,\n  unindexParentInStorage,\n  type JoinStorage,\n} from './join-utils.ts';\nimport {mergeSortedStreams} from './memory-source.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type MultiConstraint,\n  type Output,\n  type Storage,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.ts';\nimport type {TakeBoundProvider} from './take-gate.ts';\n\n/**\n * Maximum number of entries sent in a single batched `parent.fetch`\n * call. Larger child-node sets are split into multiple fetches whose\n * sorted streams are merged in JS.\n *\n * Why bound this:\n *  - **Bounded fetch on early termination.** `mergeSortedStreams` primes\n *    one row from every chunk before yielding the first output, so all\n *    chunks open their cursors up front. Smaller chunks cap the\n *    worst-case overfetch when downstream `Take` consumes only a few\n *    rows — at chunk N, we may waste up to ~N index seeks before\n *    `.return()` propagates.\n *  - **Parameter limit.** Well under SQLite's default\n *    `SQLITE_MAX_VARIABLE_NUMBER` (32766). Compound keys multiply the\n *    parameter count by key length, so we leave headroom.\n *\n * Tested 64/128/256; 256 had the best worst-case across planner suites\n * and perf tests.\n *\n * We should, however, start doing shadow tests of the planner\n * against cloudzero queries.\n */\nconst MULTI_CONSTRAINT_CHUNK_SIZE = 256;\n\n// Mutable test seam — production code reads this via the getter.\nlet multiConstraintChunkSize: number = MULTI_CONSTRAINT_CHUNK_SIZE;\n\nexport function getMultiConstraintChunkSize(): number {\n  return multiConstraintChunkSize;\n}\n\n/** Test only. Returns a restore function. */\nexport function setMultiConstraintChunkSizeForTest(size: number): () => void {\n  const prev = multiConstraintChunkSize;\n  multiConstraintChunkSize = size;\n  return () => {\n    multiConstraintChunkSize = prev;\n  };\n}\n\ntype Args = {\n  parent: Input;\n  child: Input;\n  // The nth key in childKey corresponds to the nth key in parentKey.\n  parentKey: CompoundKey;\n  childKey: CompoundKey;\n\n  relationshipName: string;\n  hidden: boolean;\n  system: System;\n  parentPartitionKey?: CompoundKey | undefined;\n  boundProvider?: TakeBoundProvider | undefined;\n  storage: Storage;\n};\n\n/**\n * An *inner* join which fetches nodes from its child input first and then\n * fetches their related nodes from its parent input.  Output nodes are the\n * nodes from parent input (in parent input order), which have at least one\n * related child.  These output nodes have a new relationship added to them,\n * which has the name `relationshipName`. The value of the relationship is a\n * stream of related nodes from the child input (in child input order).\n */\nexport class FlippedJoin implements Input {\n  readonly #parent: Input;\n  readonly #child: Input;\n  readonly #parentKey: CompoundKey;\n  readonly #childKey: CompoundKey;\n  readonly #relationshipName: string;\n  readonly #schema: SourceSchema;\n  readonly #parentPartitionKey: CompoundKey | undefined;\n  readonly #boundProvider: TakeBoundProvider | undefined;\n  readonly #storage: JoinStorage;\n\n  #output: Output = throwOutput;\n\n  #inprogressChildChange: Change | undefined;\n  #inprogressChildChangePosition: Row | undefined;\n\n  constructor({\n    parent,\n    child,\n    parentKey,\n    childKey,\n    relationshipName,\n    hidden,\n    system,\n    parentPartitionKey,\n    boundProvider,\n    storage,\n  }: Args) {\n    assert(parent !== child, 'Parent and child must be different operators');\n    assert(\n      parentKey.length === childKey.length,\n      'The parentKey and childKey keys must have same length',\n    );\n    this.#parent = parent;\n    this.#child = child;\n    this.#parentKey = parentKey;\n    this.#childKey = childKey;\n    this.#relationshipName = relationshipName;\n    this.#parentPartitionKey = parentPartitionKey;\n    this.#boundProvider = boundProvider;\n    this.#storage = storage as unknown as JoinStorage;\n\n    const parentSchema = parent.getSchema();\n    const childSchema = child.getSchema();\n    this.#schema = {\n      ...parentSchema,\n      relationships: {\n        ...parentSchema.relationships,\n        [relationshipName]: {\n          ...childSchema,\n          isHidden: hidden,\n          system,\n        },\n      },\n    };\n\n    parent.setOutput({\n      push: (change: Change) => this.#pushParent(change),\n      reconcile: () => this.#reconcile(),\n    });\n    child.setOutput({\n      push: (change: Change) => this.#pushChild(change),\n      reconcile: () => this.#reconcile(),\n    });\n  }\n\n  *#reconcile(): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n\n  destroy(): void {\n    this.#child.destroy();\n    this.#parent.destroy();\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  getSchema(): SourceSchema {\n    return this.#schema;\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    // Translate constraints for the parent on parts of the join key to\n    // constraints for the child.\n    const childConstraint: Record<string, Value> = {};\n    let hasChildConstraint = false;\n    if (req.constraint) {\n      for (const [key, value] of Object.entries(req.constraint)) {\n        const index = this.#parentKey.indexOf(key);\n        if (index !== -1) {\n          hasChildConstraint = true;\n          childConstraint[this.#childKey[index]] = value;\n        }\n      }\n    }\n\n    const childNodes: Node[] = [];\n    for (const node of this.#child.fetch(\n      hasChildConstraint ? {constraint: childConstraint} : {},\n    )) {\n      if (node === 'yield') {\n        yield node;\n        continue;\n      }\n      childNodes.push(node);\n    }\n\n    // FlippedJoin's split-push change overlay logic is largely\n    // the same as Join's with the exception of remove.  For remove,\n    // the change is undone here, and then re-applied to parents with order\n    // less than or equal to change.position below.  This is necessary\n    // because if the removed node was the last related child, the\n    // related parents with position greater than change.position\n    // (which should not yet have the node removed), would not even\n    // be fetched here, and would be absent from the output all together.\n    if (this.#inprogressChildChange?.[ChangeIndex.TYPE] === ChangeType.REMOVE) {\n      const removedNode = this.#inprogressChildChange[ChangeIndex.NODE];\n      const compare = this.#child.getSchema().compareRows;\n      const insertPos = binarySearch(childNodes.length, i =>\n        compare(removedNode.row, childNodes[i].row),\n      );\n      childNodes.splice(insertPos, 0, removedNode);\n    }\n\n    yield* this.#fetchBatched(req, childNodes);\n  }\n\n  /**\n   * Fetches parents for `childNodes` in batched calls, using\n   * `multiConstraint` so the source can issue one query per chunk (e.g.\n   * SQL `IN` with index-aware seek) instead of N per-child cursors.\n   *\n   * Multi-constraint values are split into chunks of `CHUNK_SIZE`, so\n   * SQL `IN` lists stay bounded — predictable plans, statement-cache\n   * hits across calls of the same chunk size, well below SQLite's\n   * parameter limit.\n   *\n   * Within each chunk, the source returns parents in `compareRows` order.\n   * Across chunks, we merge with `mergeSortedStreams` so the overall\n   * stream is also in order. Note: the merge primes one row from every\n   * chunk before yielding the first output, so all chunks open their\n   * cursors up front. Early termination downstream then prevents any\n   * further work on un-advanced chunks (cursors get `.return()`'d via\n   * `mergeSortedStreams`'s finally block).\n   *\n   * Replaces the previous split between `#fetchMergeSort` and\n   * `#fetchQuicksort`. The unique-vs-not distinction is no longer needed:\n   * the source handles cardinality (single index seek for each value) and\n   * ordering (SQL `ORDER BY` / index walk).\n   */\n  *#fetchBatched(\n    req: FetchRequest,\n    childNodes: Node[],\n  ): Stream<Node | 'yield'> {\n    const parentReqConstraint = req.constraint;\n    const parentKey = this.#parentKey;\n    const childKey = this.#childKey;\n\n    // Build (deduped) multi-constraint and a key→child-indexes map. Same\n    // parent-key value across multiple children groups them together.\n    const computedMulti: Constraint[] = [];\n    const childIndexesByKey = new Map<string, number[]>();\n    for (let i = 0; i < childNodes.length; i++) {\n      const constraintFromChild = buildJoinConstraint(\n        childNodes[i].row,\n        childKey,\n        parentKey,\n      );\n      if (\n        !constraintFromChild ||\n        (parentReqConstraint &&\n          !constraintsAreCompatible(constraintFromChild, parentReqConstraint))\n      ) {\n        continue;\n      }\n      const key = canonicalKey(constraintFromChild, parentKey);\n      const existing = childIndexesByKey.get(key);\n      if (existing === undefined) {\n        childIndexesByKey.set(key, [i]);\n        computedMulti.push(constraintFromChild);\n      } else {\n        existing.push(i);\n      }\n    }\n\n    if (computedMulti.length === 0) {\n      return;\n    }\n\n    // Source returns parents in compareRows order within each chunk.\n    // Merge across chunks to yield a globally ordered stream.\n    const compareRows = this.#schema.compareRows;\n    const compare: (a: Node, b: Node) => number = req.reverse\n      ? (a, b) => compareRows(b.row, a.row)\n      : (a, b) => compareRows(a.row, b.row);\n\n    // Append our computed multi to whatever req.multiConstraints already\n    // contained — chained FlippedJoins each contribute one entry, so the\n    // source ANDs them all (e.g. `assigneeID IN (…) AND creatorID IN (…)`).\n    const incoming = req.multiConstraints ?? [];\n    const parentStream =\n      computedMulti.length <= multiConstraintChunkSize\n        ? this.#parent.fetch({\n            ...req,\n            multiConstraints: [...incoming, computedMulti],\n          })\n        : this.#fetchChunked(req, incoming, computedMulti, compare);\n\n    for (const node of parentStream) {\n      if (node === 'yield') {\n        yield 'yield';\n        continue;\n      }\n      const key = canonicalKey(node.row, parentKey);\n      const idxs = childIndexesByKey.get(key);\n      if (idxs === undefined) {\n        // This row's parent-key doesn't match any of our computed\n        // multi-constraint entries. Happens when our parent is an\n        // intermediate operator (e.g. a chained FlippedJoin) that passes\n        // multiConstraints through unchanged instead of filtering — see\n        // FetchRequest.multiConstraints contract. The lookup miss here\n        // performs the required filter, so just skip the row.\n        continue;\n      }\n      // Children retain their original input order within the group\n      // because we appended to `idxs` in iteration order.\n      const relatedChildNodes: Node[] = idxs.map(i => childNodes[i]);\n      yield* this.#yieldParentWithOverlay(node, relatedChildNodes);\n    }\n  }\n\n  #fetchChunked(\n    req: FetchRequest,\n    incomingMultis: readonly MultiConstraint[],\n    computedMulti: MultiConstraint,\n    compare: (a: Node, b: Node) => number,\n  ): Stream<Node | 'yield'> {\n    const chunkStreams: Stream<Node | 'yield'>[] = [];\n    for (let i = 0; i < computedMulti.length; i += multiConstraintChunkSize) {\n      chunkStreams.push(\n        this.#parent.fetch({\n          ...req,\n          multiConstraints: [\n            ...incomingMultis,\n            computedMulti.slice(i, i + multiConstraintChunkSize),\n          ],\n        }),\n      );\n    }\n    return mergeSortedStreams(chunkStreams, compare);\n  }\n\n  *#yieldParentWithOverlay(\n    minParentNode: Node,\n    relatedChildNodes: Node[],\n  ): Stream<Node> {\n    let overlaidRelatedChildNodes = relatedChildNodes;\n\n    let isParentInPushQueue: boolean;\n    if (this.#boundProvider) {\n      const partitionConstraint = this.#parentPartitionKey\n        ? Object.fromEntries(\n            this.#parentPartitionKey.map(k => [k, minParentNode.row[k]]),\n          )\n        : undefined;\n      const bound = this.#boundProvider.getBound(partitionConstraint);\n      isParentInPushQueue =\n        bound !== undefined &&\n        this.#inprogressChildChangePosition !== undefined &&\n        this.#parent\n          .getSchema()\n          .compareRows(minParentNode.row, this.#inprogressChildChangePosition) >\n          0 &&\n        this.#parent.getSchema().compareRows(minParentNode.row, bound) <= 0;\n    } else {\n      isParentInPushQueue =\n        this.#inprogressChildChangePosition !== undefined &&\n        this.#parent\n          .getSchema()\n          .compareRows(minParentNode.row, this.#inprogressChildChangePosition) >\n          0;\n    }\n\n    if (\n      this.#inprogressChildChange &&\n      this.#inprogressChildChangePosition &&\n      isJoinMatch(\n        this.#inprogressChildChange[ChangeIndex.NODE].row,\n        this.#childKey,\n        minParentNode.row,\n        this.#parentKey,\n      )\n    ) {\n      if (this.#inprogressChildChange[ChangeIndex.TYPE] === ChangeType.REMOVE) {\n        if (!isParentInPushQueue) {\n          // Remove from relatedChildNodes since the removed child\n          // was inserted into childNodes above.\n          overlaidRelatedChildNodes = relatedChildNodes.filter(\n            n => n !== this.#inprogressChildChange?.[ChangeIndex.NODE],\n          );\n        }\n      } else if (isParentInPushQueue) {\n        overlaidRelatedChildNodes = [\n          ...generateWithOverlayNoYield(\n            relatedChildNodes,\n            this.#inprogressChildChange,\n            this.#child.getSchema(),\n          ),\n        ];\n      }\n    }\n\n    // yield node if after the overlay it still has relationship nodes\n    if (overlaidRelatedChildNodes.length > 0) {\n      this.#indexParentRow(minParentNode.row);\n      yield {\n        ...minParentNode,\n        relationships: {\n          ...minParentNode.relationships,\n          [this.#relationshipName]: () => overlaidRelatedChildNodes,\n        },\n      };\n    }\n  }\n\n  *#pushChild(change: Change): Stream<'yield'> {\n    switch (change[ChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n      case ChangeType.REMOVE:\n        yield* this.#pushChildChange(change);\n        break;\n      case ChangeType.EDIT: {\n        assert(\n          rowEqualsForCompoundKey(\n            change[ChangeIndex.OLD_NODE].row,\n            change[ChangeIndex.NODE].row,\n            this.#childKey,\n          ),\n          `Child edit must not change relationship.`,\n        );\n        yield* this.#pushChildChange(change, true);\n        break;\n      }\n      case ChangeType.CHILD:\n        yield* this.#pushChildChange(change, true);\n        break;\n    }\n  }\n\n  *#pushChildChange(change: Change, exists?: boolean): Stream<'yield'> {\n    this.#inprogressChildChange = change;\n    this.#inprogressChildChangePosition = undefined;\n    try {\n      const constraint = buildJoinConstraint(\n        change[ChangeIndex.NODE].row,\n        this.#childKey,\n        this.#parentKey,\n      );\n      if (!constraint) {\n        return;\n      }\n      const childRow = change[ChangeIndex.NODE].row;\n      const changeType = change[ChangeIndex.TYPE];\n\n      const matching = getMatchingParentEntries(\n        this.#storage,\n        childRow,\n        this.#childKey,\n        this.#parentPartitionKey,\n      );\n      if (!matching) {\n        // If no matching parent is resident in the view, REMOVE and EDIT\n        // cannot affect any view-resident parent. (ADD and CHILD can qualify\n        // previously absent parents).\n        if (changeType !== ChangeType.ADD && changeType !== ChangeType.CHILD) {\n          return;\n        }\n      }\n\n      let parentNodeStream: Stream<Node | 'yield'>;\n      if (changeType !== ChangeType.ADD && changeType !== ChangeType.CHILD) {\n        assert(\n          matching,\n          'Matching entries must exist for non-add child change',\n        );\n        if (matching.length === 1) {\n          const [entry] = matching;\n          parentNodeStream = this.#parent.fetch({\n            constraint: entry.partitionConstraint\n              ? {...constraint, ...entry.partitionConstraint}\n              : constraint,\n          });\n        } else {\n          const streams = matching.map(entry =>\n            this.#parent.fetch({\n              constraint: entry.partitionConstraint\n                ? {...constraint, ...entry.partitionConstraint}\n                : constraint,\n            }),\n          );\n          const compare = (a: Node, b: Node) =>\n            this.#schema.compareRows(a.row, b.row);\n          parentNodeStream = mergeSortedStreams(streams, compare);\n        }\n      } else {\n        parentNodeStream = this.#parent.fetch({constraint});\n      }\n\n      for (const parentNode of parentNodeStream) {\n        if (parentNode === 'yield') {\n          yield 'yield';\n          continue;\n        }\n        this.#inprogressChildChange = change;\n        this.#inprogressChildChangePosition = parentNode.row;\n        const childNodeStream = () => {\n          const constraint = buildJoinConstraint(\n            parentNode.row,\n            this.#parentKey,\n            this.#childKey,\n          );\n          return constraint ? this.#child.fetch({constraint}) : [];\n        };\n        let parentExists = exists;\n        if (!parentExists) {\n          for (const childNode of childNodeStream()) {\n            if (childNode === 'yield') {\n              yield 'yield';\n              continue;\n            }\n            if (\n              this.#child\n                .getSchema()\n                .compareRows(childNode.row, change[ChangeIndex.NODE].row) !== 0\n            ) {\n              parentExists = true;\n              break;\n            }\n          }\n        }\n        if (parentExists) {\n          yield* this.#output.push(\n            makeChildChange(\n              {\n                ...parentNode,\n                relationships: {\n                  ...parentNode.relationships,\n                  [this.#relationshipName]: childNodeStream,\n                },\n              },\n              {\n                relationshipName: this.#relationshipName,\n                change,\n              },\n            ),\n            this,\n          );\n        } else {\n          const newNode = {\n            ...parentNode,\n            relationships: {\n              ...parentNode.relationships,\n              [this.#relationshipName]: () => [change[ChangeIndex.NODE]],\n            },\n          };\n          if (change[ChangeIndex.TYPE] === ChangeType.ADD) {\n            this.#indexParentRow(parentNode.row);\n            yield* this.#output.push(makeAddChange(newNode), this);\n          } else {\n            this.#unindexParentRow(parentNode.row);\n            yield* this.#output.push(makeRemoveChange(newNode), this);\n          }\n        }\n      }\n    } finally {\n      this.#inprogressChildChange = undefined;\n      this.#inprogressChildChangePosition = undefined;\n    }\n  }\n\n  #indexParentRow(row: Row): void {\n    indexParentInStorage(\n      this.#storage,\n      row,\n      this.#parentKey,\n      this.#parent.getSchema().primaryKey,\n      this.#parentPartitionKey,\n    );\n  }\n\n  #unindexParentRow(row: Row): void {\n    unindexParentInStorage(\n      this.#storage,\n      row,\n      this.#parentKey,\n      this.#parent.getSchema().primaryKey,\n      this.#parentPartitionKey,\n    );\n  }\n\n  *#pushParent(change: Change): Stream<'yield'> {\n    const childNodeStream = (node: Node) => () => {\n      const constraint = buildJoinConstraint(\n        node.row,\n        this.#parentKey,\n        this.#childKey,\n      );\n      return constraint ? this.#child.fetch({constraint}) : [];\n    };\n\n    const flip = (node: Node) => ({\n      ...node,\n      relationships: {\n        ...node.relationships,\n        [this.#relationshipName]: childNodeStream(node),\n      },\n    });\n\n    // If no related child don't push as this is an inner join.\n    let hasRelatedChild = false;\n    for (const node of childNodeStream(change[ChangeIndex.NODE])()) {\n      if (node === 'yield') {\n        yield 'yield';\n        continue;\n      } else {\n        hasRelatedChild = true;\n        break;\n      }\n    }\n    if (!hasRelatedChild) {\n      return;\n    }\n\n    switch (change[ChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n        this.#indexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeAddChange(flip(change[ChangeIndex.NODE])),\n          this,\n        );\n        break;\n      case ChangeType.REMOVE:\n        this.#unindexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeRemoveChange(flip(change[ChangeIndex.NODE])),\n          this,\n        );\n        break;\n      case ChangeType.CHILD: {\n        yield* this.#output.push(\n          makeChildChange(\n            flip(change[ChangeIndex.NODE]),\n            change[ChangeIndex.CHILD_DATA],\n          ),\n          this,\n        );\n        break;\n      }\n      case ChangeType.EDIT: {\n        assert(\n          rowEqualsForCompoundKey(\n            change[ChangeIndex.OLD_NODE].row,\n            change[ChangeIndex.NODE].row,\n            this.#parentKey,\n          ),\n          'Parent edit must not change relationship.',\n        );\n        this.#unindexParentRow(change[ChangeIndex.OLD_NODE].row);\n        this.#indexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeEditChange(\n            flip(change[ChangeIndex.NODE]),\n            flip(change[ChangeIndex.OLD_NODE]),\n          ),\n          this,\n        );\n        break;\n      }\n      default:\n        unreachable(change);\n    }\n  }\n}\n\nexport {canonicalKeyForTest};\n"],"mappings":";;;;;;;;AAiEA,IAAI,2BAAmC;AAEvC,SAAgB,8BAAsC;CACpD,OAAO;AACT;;;;;;;;;AAkCA,IAAa,cAAb,MAA0C;CACxC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA,UAAkB;CAElB;CACA;CAEA,YAAY,EACV,QACA,OACA,WACA,UACA,kBACA,QACA,QACA,oBACA,eACA,WACO;EACP,OAAO,WAAW,OAAO,8CAA8C;EACvE,OACE,UAAU,WAAW,SAAS,QAC9B,uDACF;EACA,KAAKA,UAAU;EACf,KAAKC,SAAS;EACd,KAAKC,aAAa;EAClB,KAAKC,YAAY;EACjB,KAAKC,oBAAoB;EACzB,KAAKE,sBAAsB;EAC3B,KAAKC,iBAAiB;EACtB,KAAKC,WAAW;EAEhB,MAAM,eAAe,OAAO,UAAU;EACtC,MAAM,cAAc,MAAM,UAAU;EACpC,KAAKH,UAAU;GACb,GAAG;GACH,eAAe;IACb,GAAG,aAAa;KACf,mBAAmB;KAClB,GAAG;KACH,UAAU;KACV;IACF;GACF;EACF;EAEA,OAAO,UAAU;GACf,OAAO,WAAmB,KAAKI,YAAY,MAAM;GACjD,iBAAiB,KAAKC,WAAW;EACnC,CAAC;EACD,MAAM,UAAU;GACd,OAAO,WAAmB,KAAKC,WAAW,MAAM;GAChD,iBAAiB,KAAKD,WAAW;EACnC,CAAC;CACH;CAEA,CAACA,aAA8B;EAC7B,IAAI,KAAKE,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;CAEA,UAAgB;EACd,KAAKX,OAAO,QAAQ;EACpB,KAAKD,QAAQ,QAAQ;CACvB;CAEA,UAAU,QAAsB;EAC9B,KAAKY,UAAU;CACjB;CAEA,YAA0B;EACxB,OAAO,KAAKP;CACd;CAEA,CAAC,MAAM,KAA2C;EAGhD,MAAM,kBAAyC,CAAC;EAChD,IAAI,qBAAqB;EACzB,IAAI,IAAI,YACN,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAAI,UAAU,GAAG;GACzD,MAAM,QAAQ,KAAKH,WAAW,QAAQ,GAAG;GACzC,IAAI,UAAU,IAAI;IAChB,qBAAqB;IACrB,gBAAgB,KAAKC,UAAU,UAAU;GAC3C;EACF;EAGF,MAAM,aAAqB,CAAC;EAC5B,KAAK,MAAM,QAAQ,KAAKF,OAAO,MAC7B,qBAAqB,EAAC,YAAY,gBAAe,IAAI,CAAC,CACxD,GAAG;GACD,IAAI,SAAS,SAAS;IACpB,MAAM;IACN;GACF;GACA,WAAW,KAAK,IAAI;EACtB;EAUA,IAAI,KAAKY,yBAAyB,OAAsB,GAAmB;GACzE,MAAM,cAAc,KAAKA,uBAAuB;GAChD,MAAM,UAAU,KAAKZ,OAAO,UAAU,EAAE;GACxC,MAAM,YAAY,aAAa,WAAW,SAAQ,MAChD,QAAQ,YAAY,KAAK,WAAW,GAAG,GAAG,CAC5C;GACA,WAAW,OAAO,WAAW,GAAG,WAAW;EAC7C;EAEA,OAAO,KAAKa,cAAc,KAAK,UAAU;CAC3C;;;;;;;;;;;;;;;;;;;;;;;;CAyBA,CAACA,cACC,KACA,YACwB;EACxB,MAAM,sBAAsB,IAAI;EAChC,MAAM,YAAY,KAAKZ;EACvB,MAAM,WAAW,KAAKC;EAItB,MAAM,gBAA8B,CAAC;EACrC,MAAM,oCAAoB,IAAI,IAAsB;EACpD,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;GAC1C,MAAM,sBAAsB,oBAC1B,WAAW,GAAG,KACd,UACA,SACF;GACA,IACE,CAAC,uBACA,uBACC,CAAC,yBAAyB,qBAAqB,mBAAmB,GAEpE;GAEF,MAAM,MAAM,aAAa,qBAAqB,SAAS;GACvD,MAAM,WAAW,kBAAkB,IAAI,GAAG;GAC1C,IAAI,aAAa,KAAA,GAAW;IAC1B,kBAAkB,IAAI,KAAK,CAAC,CAAC,CAAC;IAC9B,cAAc,KAAK,mBAAmB;GACxC,OACE,SAAS,KAAK,CAAC;EAEnB;EAEA,IAAI,cAAc,WAAW,GAC3B;EAKF,MAAM,cAAc,KAAKE,QAAQ;EACjC,MAAM,UAAwC,IAAI,WAC7C,GAAG,MAAM,YAAY,EAAE,KAAK,EAAE,GAAG,KACjC,GAAG,MAAM,YAAY,EAAE,KAAK,EAAE,GAAG;EAKtC,MAAM,WAAW,IAAI,oBAAoB,CAAC;EAC1C,MAAM,eACJ,cAAc,UAAU,2BACpB,KAAKL,QAAQ,MAAM;GACjB,GAAG;GACH,kBAAkB,CAAC,GAAG,UAAU,aAAa;EAC/C,CAAC,IACD,KAAKe,cAAc,KAAK,UAAU,eAAe,OAAO;EAE9D,KAAK,MAAM,QAAQ,cAAc;GAC/B,IAAI,SAAS,SAAS;IACpB,MAAM;IACN;GACF;GACA,MAAM,MAAM,aAAa,KAAK,KAAK,SAAS;GAC5C,MAAM,OAAO,kBAAkB,IAAI,GAAG;GACtC,IAAI,SAAS,KAAA,GAOX;GAIF,MAAM,oBAA4B,KAAK,KAAI,MAAK,WAAW,EAAE;GAC7D,OAAO,KAAKC,wBAAwB,MAAM,iBAAiB;EAC7D;CACF;CAEA,cACE,KACA,gBACA,eACA,SACwB;EACxB,MAAM,eAAyC,CAAC;EAChD,KAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK,0BAC7C,aAAa,KACX,KAAKhB,QAAQ,MAAM;GACjB,GAAG;GACH,kBAAkB,CAChB,GAAG,gBACH,cAAc,MAAM,GAAG,IAAI,wBAAwB,CACrD;EACF,CAAC,CACH;EAEF,OAAO,mBAAmB,cAAc,OAAO;CACjD;CAEA,CAACgB,wBACC,eACA,mBACc;EACd,IAAI,4BAA4B;EAEhC,IAAI;EACJ,IAAI,KAAKT,gBAAgB;GACvB,MAAM,sBAAsB,KAAKD,sBAC7B,OAAO,YACL,KAAKA,oBAAoB,KAAI,MAAK,CAAC,GAAG,cAAc,IAAI,EAAE,CAAC,CAC7D,IACA,KAAA;GACJ,MAAM,QAAQ,KAAKC,eAAe,SAAS,mBAAmB;GAC9D,sBACE,UAAU,KAAA,KACV,KAAKU,mCAAmC,KAAA,KACxC,KAAKjB,QACF,UAAU,EACV,YAAY,cAAc,KAAK,KAAKiB,8BAA8B,IACnE,KACF,KAAKjB,QAAQ,UAAU,EAAE,YAAY,cAAc,KAAK,KAAK,KAAK;EACtE,OACE,sBACE,KAAKiB,mCAAmC,KAAA,KACxC,KAAKjB,QACF,UAAU,EACV,YAAY,cAAc,KAAK,KAAKiB,8BAA8B,IACnE;EAGN,IACE,KAAKJ,0BACL,KAAKI,kCACL,YACE,KAAKJ,uBAAuB,GAAkB,KAC9C,KAAKV,WACL,cAAc,KACd,KAAKD,UACP;OAEI,KAAKW,uBAAuB,OAAsB;QAChD,CAAC,qBAGH,4BAA4B,kBAAkB,QAC5C,MAAK,MAAM,KAAKA,yBAAyB,EAC3C;GAAA,OAEG,IAAI,qBACT,4BAA4B,CAC1B,GAAG,2BACD,mBACA,KAAKA,wBACL,KAAKZ,OAAO,UAAU,CACxB,CACF;EAAA;EAKJ,IAAI,0BAA0B,SAAS,GAAG;GACxC,KAAKiB,gBAAgB,cAAc,GAAG;GACtC,MAAM;IACJ,GAAG;IACH,eAAe;KACb,GAAG,cAAc;MAChB,KAAKd,0BAA0B;IAClC;GACF;EACF;CACF;CAEA,CAACO,WAAW,QAAiC;EAC3C,QAAQ,OAAO,IAAf;GACE,KAAK;GACL,KAAK;IACH,OAAO,KAAKQ,iBAAiB,MAAM;IACnC;GACF,KAAK;IACH,OACE,wBACE,OAAO,GAAsB,KAC7B,OAAO,GAAkB,KACzB,KAAKhB,SACP,GACA,0CACF;IACA,OAAO,KAAKgB,iBAAiB,QAAQ,IAAI;IACzC;GAEF,KAAK;IACH,OAAO,KAAKA,iBAAiB,QAAQ,IAAI;IACzC;EACJ;CACF;CAEA,CAACA,iBAAiB,QAAgB,QAAmC;EACnE,KAAKN,yBAAyB;EAC9B,KAAKI,iCAAiC,KAAA;EACtC,IAAI;GACF,MAAM,aAAa,oBACjB,OAAO,GAAkB,KACzB,KAAKd,WACL,KAAKD,UACP;GACA,IAAI,CAAC,YACH;GAEF,MAAM,WAAW,OAAO,GAAkB;GAC1C,MAAM,aAAa,OAAO;GAE1B,MAAM,WAAW,yBACf,KAAKM,UACL,UACA,KAAKL,WACL,KAAKG,mBACP;GACA,IAAI,CAAC;QAIC,eAAe,KAAkB,eAAe,GAClD;GAAA;GAIJ,IAAI;GACJ,IAAI,eAAe,KAAkB,eAAe,GAAkB;IACpE,OACE,UACA,sDACF;IACA,IAAI,SAAS,WAAW,GAAG;KACzB,MAAM,CAAC,SAAS;KAChB,mBAAmB,KAAKN,QAAQ,MAAM,EACpC,YAAY,MAAM,sBACd;MAAC,GAAG;MAAY,GAAG,MAAM;KAAmB,IAC5C,WACN,CAAC;IACH,OAAO;KACL,MAAM,UAAU,SAAS,KAAI,UAC3B,KAAKA,QAAQ,MAAM,EACjB,YAAY,MAAM,sBACd;MAAC,GAAG;MAAY,GAAG,MAAM;KAAmB,IAC5C,WACN,CAAC,CACH;KACA,MAAM,WAAW,GAAS,MACxB,KAAKK,QAAQ,YAAY,EAAE,KAAK,EAAE,GAAG;KACvC,mBAAmB,mBAAmB,SAAS,OAAO;IACxD;GACF,OACE,mBAAmB,KAAKL,QAAQ,MAAM,EAAC,WAAU,CAAC;GAGpD,KAAK,MAAM,cAAc,kBAAkB;IACzC,IAAI,eAAe,SAAS;KAC1B,MAAM;KACN;IACF;IACA,KAAKa,yBAAyB;IAC9B,KAAKI,iCAAiC,WAAW;IACjD,MAAM,wBAAwB;KAC5B,MAAM,aAAa,oBACjB,WAAW,KACX,KAAKf,YACL,KAAKC,SACP;KACA,OAAO,aAAa,KAAKF,OAAO,MAAM,EAAC,WAAU,CAAC,IAAI,CAAC;IACzD;IACA,IAAI,eAAe;IACnB,IAAI,CAAC,cACH,KAAK,MAAM,aAAa,gBAAgB,GAAG;KACzC,IAAI,cAAc,SAAS;MACzB,MAAM;MACN;KACF;KACA,IACE,KAAKA,OACF,UAAU,EACV,YAAY,UAAU,KAAK,OAAO,GAAkB,GAAG,MAAM,GAChE;MACA,eAAe;MACf;KACF;IACF;IAEF,IAAI,cACF,OAAO,KAAKW,QAAQ,KAClB,gBACE;KACE,GAAG;KACH,eAAe;MACb,GAAG,WAAW;OACb,KAAKR,oBAAoB;KAC5B;IACF,GACA;KACE,kBAAkB,KAAKA;KACvB;IACF,CACF,GACA,IACF;SACK;KACL,MAAM,UAAU;MACd,GAAG;MACH,eAAe;OACb,GAAG,WAAW;QACb,KAAKA,0BAA0B,CAAC,OAAO,EAAiB;MAC3D;KACF;KACA,IAAI,OAAO,OAAsB,GAAgB;MAC/C,KAAKc,gBAAgB,WAAW,GAAG;MACnC,OAAO,KAAKN,QAAQ,KAAK,cAAc,OAAO,GAAG,IAAI;KACvD,OAAO;MACL,KAAKQ,kBAAkB,WAAW,GAAG;MACrC,OAAO,KAAKR,QAAQ,KAAK,iBAAiB,OAAO,GAAG,IAAI;KAC1D;IACF;GACF;EACF,UAAU;GACR,KAAKC,yBAAyB,KAAA;GAC9B,KAAKI,iCAAiC,KAAA;EACxC;CACF;CAEA,gBAAgB,KAAgB;EAC9B,qBACE,KAAKT,UACL,KACA,KAAKN,YACL,KAAKF,QAAQ,UAAU,EAAE,YACzB,KAAKM,mBACP;CACF;CAEA,kBAAkB,KAAgB;EAChC,uBACE,KAAKE,UACL,KACA,KAAKN,YACL,KAAKF,QAAQ,UAAU,EAAE,YACzB,KAAKM,mBACP;CACF;CAEA,CAACG,YAAY,QAAiC;EAC5C,MAAM,mBAAmB,eAAqB;GAC5C,MAAM,aAAa,oBACjB,KAAK,KACL,KAAKP,YACL,KAAKC,SACP;GACA,OAAO,aAAa,KAAKF,OAAO,MAAM,EAAC,WAAU,CAAC,IAAI,CAAC;EACzD;EAEA,MAAM,QAAQ,UAAgB;GAC5B,GAAG;GACH,eAAe;IACb,GAAG,KAAK;KACP,KAAKG,oBAAoB,gBAAgB,IAAI;GAChD;EACF;EAGA,IAAI,kBAAkB;EACtB,KAAK,MAAM,QAAQ,gBAAgB,OAAO,EAAiB,EAAE,GAC3D,IAAI,SAAS,SAAS;GACpB,MAAM;GACN;EACF,OAAO;GACL,kBAAkB;GAClB;EACF;EAEF,IAAI,CAAC,iBACH;EAGF,QAAQ,OAAO,IAAf;GACE,KAAK;IACH,KAAKc,gBAAgB,OAAO,GAAkB,GAAG;IACjD,OAAO,KAAKN,QAAQ,KAClB,cAAc,KAAK,OAAO,EAAiB,CAAC,GAC5C,IACF;IACA;GACF,KAAK;IACH,KAAKQ,kBAAkB,OAAO,GAAkB,GAAG;IACnD,OAAO,KAAKR,QAAQ,KAClB,iBAAiB,KAAK,OAAO,EAAiB,CAAC,GAC/C,IACF;IACA;GACF,KAAK;IACH,OAAO,KAAKA,QAAQ,KAClB,gBACE,KAAK,OAAO,EAAiB,GAC7B,OAAO,EACT,GACA,IACF;IACA;GAEF,KAAK;IACH,OACE,wBACE,OAAO,GAAsB,KAC7B,OAAO,GAAkB,KACzB,KAAKV,UACP,GACA,2CACF;IACA,KAAKkB,kBAAkB,OAAO,GAAsB,GAAG;IACvD,KAAKF,gBAAgB,OAAO,GAAkB,GAAG;IACjD,OAAO,KAAKN,QAAQ,KAClB,eACE,KAAK,OAAO,EAAiB,GAC7B,KAAK,OAAO,EAAqB,CACnC,GACA,IACF;IACA;GAEF,SACE,YAAY,MAAM;EACtB;CACF;AACF"}
+{"version":3,"file":"flipped-join.js","names":["#parent","#child","#parentKey","#childKey","#relationshipName","#schema","#parentPartitionKey","#boundProvider","#storage","#pushParent","#reconcile","#pushChild","#output","#inprogressChildChange","#fetchBatched","#fetchChunked","#yieldParentWithOverlay","#inprogressChildChangePosition","#inprogressParentFetchBounds","#indexParentRow","#pushChildChange","#unindexParentRow"],"sources":["../../../../../zql/src/ivm/flipped-join.ts"],"sourcesContent":["import {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport {binarySearch} from '../../../shared/src/binary-search.ts';\nimport type {CompoundKey, System} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.ts';\nimport {\n  makeAddChange,\n  makeChildChange,\n  makeEditChange,\n  makeRemoveChange,\n  type Change,\n} from './change.ts';\nimport {constraintsAreCompatible, type Constraint} from './constraint.ts';\nimport type {Node} from './data.ts';\nimport {\n  buildJoinConstraint,\n  canonicalKey,\n  canonicalKeyForTest,\n  generateWithOverlayNoYield,\n  getMatchingParentEntries,\n  indexParentInStorage,\n  isJoinMatch,\n  rowEqualsForCompoundKey,\n  unindexParentInStorage,\n  type JoinStorage,\n} from './join-utils.ts';\nimport {mergeSortedStreams} from './memory-source.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type MultiConstraint,\n  type Output,\n  type Storage,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.ts';\nimport {\n  isInParentFetch,\n  readParentFetchBounds,\n  type ParentFetchBound,\n  type TakeBoundProvider,\n} from './take-gate.ts';\n\n/**\n * Maximum number of entries sent in a single batched `parent.fetch`\n * call. Larger child-node sets are split into multiple fetches whose\n * sorted streams are merged in JS.\n *\n * Why bound this:\n *  - **Bounded fetch on early termination.** `mergeSortedStreams` primes\n *    one row from every chunk before yielding the first output, so all\n *    chunks open their cursors up front. Smaller chunks cap the\n *    worst-case overfetch when downstream `Take` consumes only a few\n *    rows — at chunk N, we may waste up to ~N index seeks before\n *    `.return()` propagates.\n *  - **Parameter limit.** Well under SQLite's default\n *    `SQLITE_MAX_VARIABLE_NUMBER` (32766). Compound keys multiply the\n *    parameter count by key length, so we leave headroom.\n *\n * Tested 64/128/256; 256 had the best worst-case across planner suites\n * and perf tests.\n *\n * We should, however, start doing shadow tests of the planner\n * against cloudzero queries.\n */\nconst MULTI_CONSTRAINT_CHUNK_SIZE = 256;\n\n// Mutable test seam — production code reads this via the getter.\nlet multiConstraintChunkSize: number = MULTI_CONSTRAINT_CHUNK_SIZE;\n\nexport function getMultiConstraintChunkSize(): number {\n  return multiConstraintChunkSize;\n}\n\n/** Test only. Returns a restore function. */\nexport function setMultiConstraintChunkSizeForTest(size: number): () => void {\n  const prev = multiConstraintChunkSize;\n  multiConstraintChunkSize = size;\n  return () => {\n    multiConstraintChunkSize = prev;\n  };\n}\n\ntype Args = {\n  parent: Input;\n  child: Input;\n  // The nth key in childKey corresponds to the nth key in parentKey.\n  parentKey: CompoundKey;\n  childKey: CompoundKey;\n\n  relationshipName: string;\n  hidden: boolean;\n  system: System;\n  parentPartitionKey?: CompoundKey | undefined;\n  boundProvider?: TakeBoundProvider | undefined;\n  storage: Storage;\n};\n\n/**\n * An *inner* join which fetches nodes from its child input first and then\n * fetches their related nodes from its parent input.  Output nodes are the\n * nodes from parent input (in parent input order), which have at least one\n * related child.  These output nodes have a new relationship added to them,\n * which has the name `relationshipName`. The value of the relationship is a\n * stream of related nodes from the child input (in child input order).\n */\nexport class FlippedJoin implements Input {\n  readonly #parent: Input;\n  readonly #child: Input;\n  readonly #parentKey: CompoundKey;\n  readonly #childKey: CompoundKey;\n  readonly #relationshipName: string;\n  readonly #schema: SourceSchema;\n  readonly #parentPartitionKey: CompoundKey | undefined;\n  readonly #boundProvider: TakeBoundProvider | undefined;\n  readonly #storage: JoinStorage;\n\n  #output: Output = throwOutput;\n\n  #inprogressChildChange: Change | undefined;\n  #inprogressChildChangePosition: Row | undefined;\n  #inprogressParentFetchBounds: ParentFetchBound[] | undefined;\n\n  constructor({\n    parent,\n    child,\n    parentKey,\n    childKey,\n    relationshipName,\n    hidden,\n    system,\n    parentPartitionKey,\n    boundProvider,\n    storage,\n  }: Args) {\n    assert(parent !== child, 'Parent and child must be different operators');\n    assert(\n      parentKey.length === childKey.length,\n      'The parentKey and childKey keys must have same length',\n    );\n    this.#parent = parent;\n    this.#child = child;\n    this.#parentKey = parentKey;\n    this.#childKey = childKey;\n    this.#relationshipName = relationshipName;\n    this.#parentPartitionKey = parentPartitionKey;\n    this.#boundProvider = boundProvider;\n    this.#storage = storage as unknown as JoinStorage;\n\n    const parentSchema = parent.getSchema();\n    const childSchema = child.getSchema();\n    this.#schema = {\n      ...parentSchema,\n      relationships: {\n        ...parentSchema.relationships,\n        [relationshipName]: {\n          ...childSchema,\n          isHidden: hidden,\n          system,\n        },\n      },\n    };\n\n    parent.setOutput({\n      push: (change: Change) => this.#pushParent(change),\n      reconcile: () => this.#reconcile(),\n    });\n    child.setOutput({\n      push: (change: Change) => this.#pushChild(change),\n      reconcile: () => this.#reconcile(),\n    });\n  }\n\n  *#reconcile(): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n\n  destroy(): void {\n    this.#child.destroy();\n    this.#parent.destroy();\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  getSchema(): SourceSchema {\n    return this.#schema;\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    // Translate constraints for the parent on parts of the join key to\n    // constraints for the child.\n    const childConstraint: Record<string, Value> = {};\n    let hasChildConstraint = false;\n    if (req.constraint) {\n      for (const [key, value] of Object.entries(req.constraint)) {\n        const index = this.#parentKey.indexOf(key);\n        if (index !== -1) {\n          hasChildConstraint = true;\n          childConstraint[this.#childKey[index]] = value;\n        }\n      }\n    }\n\n    const childNodes: Node[] = [];\n    for (const node of this.#child.fetch(\n      hasChildConstraint ? {constraint: childConstraint} : {},\n    )) {\n      if (node === 'yield') {\n        yield node;\n        continue;\n      }\n      childNodes.push(node);\n    }\n\n    // FlippedJoin's split-push change overlay logic is largely\n    // the same as Join's with the exception of remove.  For remove,\n    // the change is undone here, and then re-applied to parents with order\n    // less than or equal to change.position below.  This is necessary\n    // because if the removed node was the last related child, the\n    // related parents with position greater than change.position\n    // (which should not yet have the node removed), would not even\n    // be fetched here, and would be absent from the output all together.\n    if (this.#inprogressChildChange?.[ChangeIndex.TYPE] === ChangeType.REMOVE) {\n      const removedNode = this.#inprogressChildChange[ChangeIndex.NODE];\n      const compare = this.#child.getSchema().compareRows;\n      const insertPos = binarySearch(childNodes.length, i =>\n        compare(removedNode.row, childNodes[i].row),\n      );\n      childNodes.splice(insertPos, 0, removedNode);\n    }\n\n    yield* this.#fetchBatched(req, childNodes);\n  }\n\n  /**\n   * Fetches parents for `childNodes` in batched calls, using\n   * `multiConstraint` so the source can issue one query per chunk (e.g.\n   * SQL `IN` with index-aware seek) instead of N per-child cursors.\n   *\n   * Multi-constraint values are split into chunks of `CHUNK_SIZE`, so\n   * SQL `IN` lists stay bounded — predictable plans, statement-cache\n   * hits across calls of the same chunk size, well below SQLite's\n   * parameter limit.\n   *\n   * Within each chunk, the source returns parents in `compareRows` order.\n   * Across chunks, we merge with `mergeSortedStreams` so the overall\n   * stream is also in order. Note: the merge primes one row from every\n   * chunk before yielding the first output, so all chunks open their\n   * cursors up front. Early termination downstream then prevents any\n   * further work on un-advanced chunks (cursors get `.return()`'d via\n   * `mergeSortedStreams`'s finally block).\n   *\n   * Replaces the previous split between `#fetchMergeSort` and\n   * `#fetchQuicksort`. The unique-vs-not distinction is no longer needed:\n   * the source handles cardinality (single index seek for each value) and\n   * ordering (SQL `ORDER BY` / index walk).\n   */\n  *#fetchBatched(\n    req: FetchRequest,\n    childNodes: Node[],\n  ): Stream<Node | 'yield'> {\n    const parentReqConstraint = req.constraint;\n    const parentKey = this.#parentKey;\n    const childKey = this.#childKey;\n\n    // Build (deduped) multi-constraint and a key→child-indexes map. Same\n    // parent-key value across multiple children groups them together.\n    const computedMulti: Constraint[] = [];\n    const childIndexesByKey = new Map<string, number[]>();\n    for (let i = 0; i < childNodes.length; i++) {\n      const constraintFromChild = buildJoinConstraint(\n        childNodes[i].row,\n        childKey,\n        parentKey,\n      );\n      if (\n        !constraintFromChild ||\n        (parentReqConstraint &&\n          !constraintsAreCompatible(constraintFromChild, parentReqConstraint))\n      ) {\n        continue;\n      }\n      const key = canonicalKey(constraintFromChild, parentKey);\n      const existing = childIndexesByKey.get(key);\n      if (existing === undefined) {\n        childIndexesByKey.set(key, [i]);\n        computedMulti.push(constraintFromChild);\n      } else {\n        existing.push(i);\n      }\n    }\n\n    if (computedMulti.length === 0) {\n      return;\n    }\n\n    // Source returns parents in compareRows order within each chunk.\n    // Merge across chunks to yield a globally ordered stream.\n    const compareRows = this.#schema.compareRows;\n    const compare: (a: Node, b: Node) => number = req.reverse\n      ? (a, b) => compareRows(b.row, a.row)\n      : (a, b) => compareRows(a.row, b.row);\n\n    // Append our computed multi to whatever req.multiConstraints already\n    // contained — chained FlippedJoins each contribute one entry, so the\n    // source ANDs them all (e.g. `assigneeID IN (…) AND creatorID IN (…)`).\n    const incoming = req.multiConstraints ?? [];\n    const parentStream =\n      computedMulti.length <= multiConstraintChunkSize\n        ? this.#parent.fetch({\n            ...req,\n            multiConstraints: [...incoming, computedMulti],\n          })\n        : this.#fetchChunked(req, incoming, computedMulti, compare);\n\n    for (const node of parentStream) {\n      if (node === 'yield') {\n        yield 'yield';\n        continue;\n      }\n      const key = canonicalKey(node.row, parentKey);\n      const idxs = childIndexesByKey.get(key);\n      if (idxs === undefined) {\n        // This row's parent-key doesn't match any of our computed\n        // multi-constraint entries. Happens when our parent is an\n        // intermediate operator (e.g. a chained FlippedJoin) that passes\n        // multiConstraints through unchanged instead of filtering — see\n        // FetchRequest.multiConstraints contract. The lookup miss here\n        // performs the required filter, so just skip the row.\n        continue;\n      }\n      // Children retain their original input order within the group\n      // because we appended to `idxs` in iteration order.\n      const relatedChildNodes: Node[] = idxs.map(i => childNodes[i]);\n      yield* this.#yieldParentWithOverlay(node, relatedChildNodes);\n    }\n  }\n\n  #fetchChunked(\n    req: FetchRequest,\n    incomingMultis: readonly MultiConstraint[],\n    computedMulti: MultiConstraint,\n    compare: (a: Node, b: Node) => number,\n  ): Stream<Node | 'yield'> {\n    const chunkStreams: Stream<Node | 'yield'>[] = [];\n    for (let i = 0; i < computedMulti.length; i += multiConstraintChunkSize) {\n      chunkStreams.push(\n        this.#parent.fetch({\n          ...req,\n          multiConstraints: [\n            ...incomingMultis,\n            computedMulti.slice(i, i + multiConstraintChunkSize),\n          ],\n        }),\n      );\n    }\n    return mergeSortedStreams(chunkStreams, compare);\n  }\n\n  *#yieldParentWithOverlay(\n    minParentNode: Node,\n    relatedChildNodes: Node[],\n  ): Stream<Node> {\n    let overlaidRelatedChildNodes = relatedChildNodes;\n\n    // The parent has yet to get the in-progress child change if it comes\n    // after the current position and a parent fetch of the push yields it.\n    // With a TakeGate the fetches are capped at the bounds read when they\n    // started.\n    const {compareRows} = this.#parent.getSchema();\n    const isParentInPushQueue =\n      this.#inprogressChildChangePosition !== undefined &&\n      compareRows(minParentNode.row, this.#inprogressChildChangePosition) > 0 &&\n      (this.#inprogressParentFetchBounds === undefined ||\n        isInParentFetch(\n          this.#inprogressParentFetchBounds,\n          minParentNode.row,\n          compareRows,\n        ));\n\n    if (\n      this.#inprogressChildChange &&\n      this.#inprogressChildChangePosition &&\n      isJoinMatch(\n        this.#inprogressChildChange[ChangeIndex.NODE].row,\n        this.#childKey,\n        minParentNode.row,\n        this.#parentKey,\n      )\n    ) {\n      if (this.#inprogressChildChange[ChangeIndex.TYPE] === ChangeType.REMOVE) {\n        if (!isParentInPushQueue) {\n          // Remove from relatedChildNodes since the removed child\n          // was inserted into childNodes above.\n          overlaidRelatedChildNodes = relatedChildNodes.filter(\n            n => n !== this.#inprogressChildChange?.[ChangeIndex.NODE],\n          );\n        }\n      } else if (isParentInPushQueue) {\n        overlaidRelatedChildNodes = [\n          ...generateWithOverlayNoYield(\n            relatedChildNodes,\n            this.#inprogressChildChange,\n            this.#child.getSchema(),\n          ),\n        ];\n      }\n    }\n\n    // yield node if after the overlay it still has relationship nodes\n    if (overlaidRelatedChildNodes.length > 0) {\n      this.#indexParentRow(minParentNode.row);\n      yield {\n        ...minParentNode,\n        relationships: {\n          ...minParentNode.relationships,\n          [this.#relationshipName]: () => overlaidRelatedChildNodes,\n        },\n      };\n    }\n  }\n\n  *#pushChild(change: Change): Stream<'yield'> {\n    switch (change[ChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n      case ChangeType.REMOVE:\n        yield* this.#pushChildChange(change);\n        break;\n      case ChangeType.EDIT: {\n        assert(\n          rowEqualsForCompoundKey(\n            change[ChangeIndex.OLD_NODE].row,\n            change[ChangeIndex.NODE].row,\n            this.#childKey,\n          ),\n          `Child edit must not change relationship.`,\n        );\n        yield* this.#pushChildChange(change, true);\n        break;\n      }\n      case ChangeType.CHILD:\n        yield* this.#pushChildChange(change, true);\n        break;\n    }\n  }\n\n  *#pushChildChange(change: Change, exists?: boolean): Stream<'yield'> {\n    this.#inprogressChildChange = change;\n    this.#inprogressChildChangePosition = undefined;\n    try {\n      const constraint = buildJoinConstraint(\n        change[ChangeIndex.NODE].row,\n        this.#childKey,\n        this.#parentKey,\n      );\n      if (!constraint) {\n        return;\n      }\n      const childRow = change[ChangeIndex.NODE].row;\n      const changeType = change[ChangeIndex.TYPE];\n\n      const matching = getMatchingParentEntries(\n        this.#storage,\n        childRow,\n        this.#childKey,\n        this.#parentPartitionKey,\n      );\n      if (!matching) {\n        // If no matching parent is resident in the view, REMOVE and EDIT\n        // cannot affect any view-resident parent. (ADD and CHILD can qualify\n        // previously absent parents).\n        if (changeType !== ChangeType.ADD && changeType !== ChangeType.CHILD) {\n          return;\n        }\n      }\n\n      let fetchConstraints: Constraint[];\n      if (changeType !== ChangeType.ADD && changeType !== ChangeType.CHILD) {\n        assert(\n          matching,\n          'Matching entries must exist for non-add child change',\n        );\n        fetchConstraints = matching.map(entry =>\n          entry.partitionConstraint\n            ? {...constraint, ...entry.partitionConstraint}\n            : constraint,\n        );\n      } else {\n        fetchConstraints = [constraint];\n      }\n      if (this.#boundProvider) {\n        this.#inprogressParentFetchBounds = readParentFetchBounds(\n          this.#boundProvider,\n          fetchConstraints,\n        );\n      }\n\n      let parentNodeStream: Stream<Node | 'yield'>;\n      if (fetchConstraints.length === 1) {\n        parentNodeStream = this.#parent.fetch({\n          constraint: fetchConstraints[0],\n        });\n      } else {\n        const streams = fetchConstraints.map(c =>\n          this.#parent.fetch({constraint: c}),\n        );\n        const compare = (a: Node, b: Node) =>\n          this.#schema.compareRows(a.row, b.row);\n        parentNodeStream = mergeSortedStreams(streams, compare);\n      }\n\n      for (const parentNode of parentNodeStream) {\n        if (parentNode === 'yield') {\n          yield 'yield';\n          continue;\n        }\n        this.#inprogressChildChange = change;\n        this.#inprogressChildChangePosition = parentNode.row;\n        const childNodeStream = () => {\n          const constraint = buildJoinConstraint(\n            parentNode.row,\n            this.#parentKey,\n            this.#childKey,\n          );\n          return constraint ? this.#child.fetch({constraint}) : [];\n        };\n        let parentExists = exists;\n        if (!parentExists) {\n          for (const childNode of childNodeStream()) {\n            if (childNode === 'yield') {\n              yield 'yield';\n              continue;\n            }\n            if (\n              this.#child\n                .getSchema()\n                .compareRows(childNode.row, change[ChangeIndex.NODE].row) !== 0\n            ) {\n              parentExists = true;\n              break;\n            }\n          }\n        }\n        if (parentExists) {\n          yield* this.#output.push(\n            makeChildChange(\n              {\n                ...parentNode,\n                relationships: {\n                  ...parentNode.relationships,\n                  [this.#relationshipName]: childNodeStream,\n                },\n              },\n              {\n                relationshipName: this.#relationshipName,\n                change,\n              },\n            ),\n            this,\n          );\n        } else {\n          const newNode = {\n            ...parentNode,\n            relationships: {\n              ...parentNode.relationships,\n              [this.#relationshipName]: () => [change[ChangeIndex.NODE]],\n            },\n          };\n          if (change[ChangeIndex.TYPE] === ChangeType.ADD) {\n            this.#indexParentRow(parentNode.row);\n            yield* this.#output.push(makeAddChange(newNode), this);\n          } else {\n            this.#unindexParentRow(parentNode.row);\n            yield* this.#output.push(makeRemoveChange(newNode), this);\n          }\n        }\n      }\n    } finally {\n      this.#inprogressChildChange = undefined;\n      this.#inprogressChildChangePosition = undefined;\n      this.#inprogressParentFetchBounds = undefined;\n    }\n  }\n\n  #indexParentRow(row: Row): void {\n    indexParentInStorage(\n      this.#storage,\n      row,\n      this.#parentKey,\n      this.#parent.getSchema().primaryKey,\n      this.#parentPartitionKey,\n    );\n  }\n\n  #unindexParentRow(row: Row): void {\n    unindexParentInStorage(\n      this.#storage,\n      row,\n      this.#parentKey,\n      this.#parent.getSchema().primaryKey,\n      this.#parentPartitionKey,\n    );\n  }\n\n  *#pushParent(change: Change): Stream<'yield'> {\n    const childNodeStream = (node: Node) => () => {\n      const constraint = buildJoinConstraint(\n        node.row,\n        this.#parentKey,\n        this.#childKey,\n      );\n      return constraint ? this.#child.fetch({constraint}) : [];\n    };\n\n    const flip = (node: Node) => ({\n      ...node,\n      relationships: {\n        ...node.relationships,\n        [this.#relationshipName]: childNodeStream(node),\n      },\n    });\n\n    // If no related child don't push as this is an inner join.\n    let hasRelatedChild = false;\n    for (const node of childNodeStream(change[ChangeIndex.NODE])()) {\n      if (node === 'yield') {\n        yield 'yield';\n        continue;\n      } else {\n        hasRelatedChild = true;\n        break;\n      }\n    }\n    if (!hasRelatedChild) {\n      return;\n    }\n\n    switch (change[ChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n        this.#indexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeAddChange(flip(change[ChangeIndex.NODE])),\n          this,\n        );\n        break;\n      case ChangeType.REMOVE:\n        this.#unindexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeRemoveChange(flip(change[ChangeIndex.NODE])),\n          this,\n        );\n        break;\n      case ChangeType.CHILD: {\n        yield* this.#output.push(\n          makeChildChange(\n            flip(change[ChangeIndex.NODE]),\n            change[ChangeIndex.CHILD_DATA],\n          ),\n          this,\n        );\n        break;\n      }\n      case ChangeType.EDIT: {\n        assert(\n          rowEqualsForCompoundKey(\n            change[ChangeIndex.OLD_NODE].row,\n            change[ChangeIndex.NODE].row,\n            this.#parentKey,\n          ),\n          'Parent edit must not change relationship.',\n        );\n        this.#unindexParentRow(change[ChangeIndex.OLD_NODE].row);\n        this.#indexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeEditChange(\n            flip(change[ChangeIndex.NODE]),\n            flip(change[ChangeIndex.OLD_NODE]),\n          ),\n          this,\n        );\n        break;\n      }\n      default:\n        unreachable(change);\n    }\n  }\n}\n\nexport {canonicalKeyForTest};\n"],"mappings":";;;;;;;;;AAsEA,IAAI,2BAAmC;AAEvC,SAAgB,8BAAsC;CACpD,OAAO;AACT;;;;;;;;;AAkCA,IAAa,cAAb,MAA0C;CACxC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA,UAAkB;CAElB;CACA;CACA;CAEA,YAAY,EACV,QACA,OACA,WACA,UACA,kBACA,QACA,QACA,oBACA,eACA,WACO;EACP,OAAO,WAAW,OAAO,8CAA8C;EACvE,OACE,UAAU,WAAW,SAAS,QAC9B,uDACF;EACA,KAAKA,UAAU;EACf,KAAKC,SAAS;EACd,KAAKC,aAAa;EAClB,KAAKC,YAAY;EACjB,KAAKC,oBAAoB;EACzB,KAAKE,sBAAsB;EAC3B,KAAKC,iBAAiB;EACtB,KAAKC,WAAW;EAEhB,MAAM,eAAe,OAAO,UAAU;EACtC,MAAM,cAAc,MAAM,UAAU;EACpC,KAAKH,UAAU;GACb,GAAG;GACH,eAAe;IACb,GAAG,aAAa;KACf,mBAAmB;KAClB,GAAG;KACH,UAAU;KACV;IACF;GACF;EACF;EAEA,OAAO,UAAU;GACf,OAAO,WAAmB,KAAKI,YAAY,MAAM;GACjD,iBAAiB,KAAKC,WAAW;EACnC,CAAC;EACD,MAAM,UAAU;GACd,OAAO,WAAmB,KAAKC,WAAW,MAAM;GAChD,iBAAiB,KAAKD,WAAW;EACnC,CAAC;CACH;CAEA,CAACA,aAA8B;EAC7B,IAAI,KAAKE,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;CAEA,UAAgB;EACd,KAAKX,OAAO,QAAQ;EACpB,KAAKD,QAAQ,QAAQ;CACvB;CAEA,UAAU,QAAsB;EAC9B,KAAKY,UAAU;CACjB;CAEA,YAA0B;EACxB,OAAO,KAAKP;CACd;CAEA,CAAC,MAAM,KAA2C;EAGhD,MAAM,kBAAyC,CAAC;EAChD,IAAI,qBAAqB;EACzB,IAAI,IAAI,YACN,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAAI,UAAU,GAAG;GACzD,MAAM,QAAQ,KAAKH,WAAW,QAAQ,GAAG;GACzC,IAAI,UAAU,IAAI;IAChB,qBAAqB;IACrB,gBAAgB,KAAKC,UAAU,UAAU;GAC3C;EACF;EAGF,MAAM,aAAqB,CAAC;EAC5B,KAAK,MAAM,QAAQ,KAAKF,OAAO,MAC7B,qBAAqB,EAAC,YAAY,gBAAe,IAAI,CAAC,CACxD,GAAG;GACD,IAAI,SAAS,SAAS;IACpB,MAAM;IACN;GACF;GACA,WAAW,KAAK,IAAI;EACtB;EAUA,IAAI,KAAKY,yBAAyB,OAAsB,GAAmB;GACzE,MAAM,cAAc,KAAKA,uBAAuB;GAChD,MAAM,UAAU,KAAKZ,OAAO,UAAU,EAAE;GACxC,MAAM,YAAY,aAAa,WAAW,SAAQ,MAChD,QAAQ,YAAY,KAAK,WAAW,GAAG,GAAG,CAC5C;GACA,WAAW,OAAO,WAAW,GAAG,WAAW;EAC7C;EAEA,OAAO,KAAKa,cAAc,KAAK,UAAU;CAC3C;;;;;;;;;;;;;;;;;;;;;;;;CAyBA,CAACA,cACC,KACA,YACwB;EACxB,MAAM,sBAAsB,IAAI;EAChC,MAAM,YAAY,KAAKZ;EACvB,MAAM,WAAW,KAAKC;EAItB,MAAM,gBAA8B,CAAC;EACrC,MAAM,oCAAoB,IAAI,IAAsB;EACpD,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;GAC1C,MAAM,sBAAsB,oBAC1B,WAAW,GAAG,KACd,UACA,SACF;GACA,IACE,CAAC,uBACA,uBACC,CAAC,yBAAyB,qBAAqB,mBAAmB,GAEpE;GAEF,MAAM,MAAM,aAAa,qBAAqB,SAAS;GACvD,MAAM,WAAW,kBAAkB,IAAI,GAAG;GAC1C,IAAI,aAAa,KAAA,GAAW;IAC1B,kBAAkB,IAAI,KAAK,CAAC,CAAC,CAAC;IAC9B,cAAc,KAAK,mBAAmB;GACxC,OACE,SAAS,KAAK,CAAC;EAEnB;EAEA,IAAI,cAAc,WAAW,GAC3B;EAKF,MAAM,cAAc,KAAKE,QAAQ;EACjC,MAAM,UAAwC,IAAI,WAC7C,GAAG,MAAM,YAAY,EAAE,KAAK,EAAE,GAAG,KACjC,GAAG,MAAM,YAAY,EAAE,KAAK,EAAE,GAAG;EAKtC,MAAM,WAAW,IAAI,oBAAoB,CAAC;EAC1C,MAAM,eACJ,cAAc,UAAU,2BACpB,KAAKL,QAAQ,MAAM;GACjB,GAAG;GACH,kBAAkB,CAAC,GAAG,UAAU,aAAa;EAC/C,CAAC,IACD,KAAKe,cAAc,KAAK,UAAU,eAAe,OAAO;EAE9D,KAAK,MAAM,QAAQ,cAAc;GAC/B,IAAI,SAAS,SAAS;IACpB,MAAM;IACN;GACF;GACA,MAAM,MAAM,aAAa,KAAK,KAAK,SAAS;GAC5C,MAAM,OAAO,kBAAkB,IAAI,GAAG;GACtC,IAAI,SAAS,KAAA,GAOX;GAIF,MAAM,oBAA4B,KAAK,KAAI,MAAK,WAAW,EAAE;GAC7D,OAAO,KAAKC,wBAAwB,MAAM,iBAAiB;EAC7D;CACF;CAEA,cACE,KACA,gBACA,eACA,SACwB;EACxB,MAAM,eAAyC,CAAC;EAChD,KAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK,0BAC7C,aAAa,KACX,KAAKhB,QAAQ,MAAM;GACjB,GAAG;GACH,kBAAkB,CAChB,GAAG,gBACH,cAAc,MAAM,GAAG,IAAI,wBAAwB,CACrD;EACF,CAAC,CACH;EAEF,OAAO,mBAAmB,cAAc,OAAO;CACjD;CAEA,CAACgB,wBACC,eACA,mBACc;EACd,IAAI,4BAA4B;EAMhC,MAAM,EAAC,gBAAe,KAAKhB,QAAQ,UAAU;EAC7C,MAAM,sBACJ,KAAKiB,mCAAmC,KAAA,KACxC,YAAY,cAAc,KAAK,KAAKA,8BAA8B,IAAI,MACrE,KAAKC,iCAAiC,KAAA,KACrC,gBACE,KAAKA,8BACL,cAAc,KACd,WACF;EAEJ,IACE,KAAKL,0BACL,KAAKI,kCACL,YACE,KAAKJ,uBAAuB,GAAkB,KAC9C,KAAKV,WACL,cAAc,KACd,KAAKD,UACP;OAEI,KAAKW,uBAAuB,OAAsB;QAChD,CAAC,qBAGH,4BAA4B,kBAAkB,QAC5C,MAAK,MAAM,KAAKA,yBAAyB,EAC3C;GAAA,OAEG,IAAI,qBACT,4BAA4B,CAC1B,GAAG,2BACD,mBACA,KAAKA,wBACL,KAAKZ,OAAO,UAAU,CACxB,CACF;EAAA;EAKJ,IAAI,0BAA0B,SAAS,GAAG;GACxC,KAAKkB,gBAAgB,cAAc,GAAG;GACtC,MAAM;IACJ,GAAG;IACH,eAAe;KACb,GAAG,cAAc;MAChB,KAAKf,0BAA0B;IAClC;GACF;EACF;CACF;CAEA,CAACO,WAAW,QAAiC;EAC3C,QAAQ,OAAO,IAAf;GACE,KAAK;GACL,KAAK;IACH,OAAO,KAAKS,iBAAiB,MAAM;IACnC;GACF,KAAK;IACH,OACE,wBACE,OAAO,GAAsB,KAC7B,OAAO,GAAkB,KACzB,KAAKjB,SACP,GACA,0CACF;IACA,OAAO,KAAKiB,iBAAiB,QAAQ,IAAI;IACzC;GAEF,KAAK;IACH,OAAO,KAAKA,iBAAiB,QAAQ,IAAI;IACzC;EACJ;CACF;CAEA,CAACA,iBAAiB,QAAgB,QAAmC;EACnE,KAAKP,yBAAyB;EAC9B,KAAKI,iCAAiC,KAAA;EACtC,IAAI;GACF,MAAM,aAAa,oBACjB,OAAO,GAAkB,KACzB,KAAKd,WACL,KAAKD,UACP;GACA,IAAI,CAAC,YACH;GAEF,MAAM,WAAW,OAAO,GAAkB;GAC1C,MAAM,aAAa,OAAO;GAE1B,MAAM,WAAW,yBACf,KAAKM,UACL,UACA,KAAKL,WACL,KAAKG,mBACP;GACA,IAAI,CAAC;QAIC,eAAe,KAAkB,eAAe,GAClD;GAAA;GAIJ,IAAI;GACJ,IAAI,eAAe,KAAkB,eAAe,GAAkB;IACpE,OACE,UACA,sDACF;IACA,mBAAmB,SAAS,KAAI,UAC9B,MAAM,sBACF;KAAC,GAAG;KAAY,GAAG,MAAM;IAAmB,IAC5C,UACN;GACF,OACE,mBAAmB,CAAC,UAAU;GAEhC,IAAI,KAAKC,gBACP,KAAKW,+BAA+B,sBAClC,KAAKX,gBACL,gBACF;GAGF,IAAI;GACJ,IAAI,iBAAiB,WAAW,GAC9B,mBAAmB,KAAKP,QAAQ,MAAM,EACpC,YAAY,iBAAiB,GAC/B,CAAC;QACI;IACL,MAAM,UAAU,iBAAiB,KAAI,MACnC,KAAKA,QAAQ,MAAM,EAAC,YAAY,EAAC,CAAC,CACpC;IACA,MAAM,WAAW,GAAS,MACxB,KAAKK,QAAQ,YAAY,EAAE,KAAK,EAAE,GAAG;IACvC,mBAAmB,mBAAmB,SAAS,OAAO;GACxD;GAEA,KAAK,MAAM,cAAc,kBAAkB;IACzC,IAAI,eAAe,SAAS;KAC1B,MAAM;KACN;IACF;IACA,KAAKQ,yBAAyB;IAC9B,KAAKI,iCAAiC,WAAW;IACjD,MAAM,wBAAwB;KAC5B,MAAM,aAAa,oBACjB,WAAW,KACX,KAAKf,YACL,KAAKC,SACP;KACA,OAAO,aAAa,KAAKF,OAAO,MAAM,EAAC,WAAU,CAAC,IAAI,CAAC;IACzD;IACA,IAAI,eAAe;IACnB,IAAI,CAAC,cACH,KAAK,MAAM,aAAa,gBAAgB,GAAG;KACzC,IAAI,cAAc,SAAS;MACzB,MAAM;MACN;KACF;KACA,IACE,KAAKA,OACF,UAAU,EACV,YAAY,UAAU,KAAK,OAAO,GAAkB,GAAG,MAAM,GAChE;MACA,eAAe;MACf;KACF;IACF;IAEF,IAAI,cACF,OAAO,KAAKW,QAAQ,KAClB,gBACE;KACE,GAAG;KACH,eAAe;MACb,GAAG,WAAW;OACb,KAAKR,oBAAoB;KAC5B;IACF,GACA;KACE,kBAAkB,KAAKA;KACvB;IACF,CACF,GACA,IACF;SACK;KACL,MAAM,UAAU;MACd,GAAG;MACH,eAAe;OACb,GAAG,WAAW;QACb,KAAKA,0BAA0B,CAAC,OAAO,EAAiB;MAC3D;KACF;KACA,IAAI,OAAO,OAAsB,GAAgB;MAC/C,KAAKe,gBAAgB,WAAW,GAAG;MACnC,OAAO,KAAKP,QAAQ,KAAK,cAAc,OAAO,GAAG,IAAI;KACvD,OAAO;MACL,KAAKS,kBAAkB,WAAW,GAAG;MACrC,OAAO,KAAKT,QAAQ,KAAK,iBAAiB,OAAO,GAAG,IAAI;KAC1D;IACF;GACF;EACF,UAAU;GACR,KAAKC,yBAAyB,KAAA;GAC9B,KAAKI,iCAAiC,KAAA;GACtC,KAAKC,+BAA+B,KAAA;EACtC;CACF;CAEA,gBAAgB,KAAgB;EAC9B,qBACE,KAAKV,UACL,KACA,KAAKN,YACL,KAAKF,QAAQ,UAAU,EAAE,YACzB,KAAKM,mBACP;CACF;CAEA,kBAAkB,KAAgB;EAChC,uBACE,KAAKE,UACL,KACA,KAAKN,YACL,KAAKF,QAAQ,UAAU,EAAE,YACzB,KAAKM,mBACP;CACF;CAEA,CAACG,YAAY,QAAiC;EAC5C,MAAM,mBAAmB,eAAqB;GAC5C,MAAM,aAAa,oBACjB,KAAK,KACL,KAAKP,YACL,KAAKC,SACP;GACA,OAAO,aAAa,KAAKF,OAAO,MAAM,EAAC,WAAU,CAAC,IAAI,CAAC;EACzD;EAEA,MAAM,QAAQ,UAAgB;GAC5B,GAAG;GACH,eAAe;IACb,GAAG,KAAK;KACP,KAAKG,oBAAoB,gBAAgB,IAAI;GAChD;EACF;EAGA,IAAI,kBAAkB;EACtB,KAAK,MAAM,QAAQ,gBAAgB,OAAO,EAAiB,EAAE,GAC3D,IAAI,SAAS,SAAS;GACpB,MAAM;GACN;EACF,OAAO;GACL,kBAAkB;GAClB;EACF;EAEF,IAAI,CAAC,iBACH;EAGF,QAAQ,OAAO,IAAf;GACE,KAAK;IACH,KAAKe,gBAAgB,OAAO,GAAkB,GAAG;IACjD,OAAO,KAAKP,QAAQ,KAClB,cAAc,KAAK,OAAO,EAAiB,CAAC,GAC5C,IACF;IACA;GACF,KAAK;IACH,KAAKS,kBAAkB,OAAO,GAAkB,GAAG;IACnD,OAAO,KAAKT,QAAQ,KAClB,iBAAiB,KAAK,OAAO,EAAiB,CAAC,GAC/C,IACF;IACA;GACF,KAAK;IACH,OAAO,KAAKA,QAAQ,KAClB,gBACE,KAAK,OAAO,EAAiB,GAC7B,OAAO,EACT,GACA,IACF;IACA;GAEF,KAAK;IACH,OACE,wBACE,OAAO,GAAsB,KAC7B,OAAO,GAAkB,KACzB,KAAKV,UACP,GACA,2CACF;IACA,KAAKmB,kBAAkB,OAAO,GAAsB,GAAG;IACvD,KAAKF,gBAAgB,OAAO,GAAkB,GAAG;IACjD,OAAO,KAAKP,QAAQ,KAClB,eACE,KAAK,OAAO,EAAiB,GAC7B,KAAK,OAAO,EAAqB,CACnC,GACA,IACF;IACA;GAEF,SACE,YAAY,MAAM;EACtB;CACF;AACF"}

package/out/zql/src/ivm/join.d.ts

@@ -3,7 +3,7 @@ import type { Node } from './data.ts';
 import { type FetchRequest, type Input, type Output, type Storage } from './operator.ts';
 import type { SourceSchema } from './schema.ts';
 import { type Stream } from './stream.ts';
-import type { TakeBoundProvider } from './take-gate.ts';
+import { type TakeBoundProvider } from './take-gate.ts';
 type Args = {
     parent: Input;
     child: Input;

package/out/zql/src/ivm/join.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"join.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/join.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,WAAW,EAAE,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAW3E,OAAO,KAAK,EAAC,IAAI,EAAC,MAAM,WAAW,CAAC;AAapC,OAAO,EAEL,KAAK,YAAY,EACjB,KAAK,KAAK,EACV,KAAK,MAAM,EACX,KAAK,OAAO,EACb,MAAM,eAAe,CAAC;AACvB,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAC,KAAK,MAAM,EAAC,MAAM,aAAa,CAAC;AACxC,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,gBAAgB,CAAC;AAEtD,KAAK,IAAI,GAAG;IACV,MAAM,EAAE,KAAK,CAAC;IACd,KAAK,EAAE,KAAK,CAAC;IAEb,SAAS,EAAE,WAAW,CAAC;IACvB,QAAQ,EAAE,WAAW,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;IACzB,MAAM,EAAE,OAAO,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,kBAAkB,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC7C,aAAa,CAAC,EAAE,iBAAiB,GAAG,SAAS,CAAC;IAC9C,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC;AAEF;;;;;;;;;GASG;AACH,qBAAa,IAAK,YAAW,KAAK;;IAgBhC,YAAY,EACV,MAAM,EACN,KAAK,EACL,SAAS,EACT,QAAQ,EACR,gBAAgB,EAChB,MAAM,EACN,MAAM,EACN,kBAAkB,EAClB,aAAa,EACb,OAAO,GACR,EAAE,IAAI,EAqCN;IAQD,OAAO,IAAI,IAAI,CAGd;IAED,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAE9B;IAED,SAAS,IAAI,YAAY,CAExB;IAEA,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,CAShD;CA6PF"}
+{"version":3,"file":"join.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/join.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,WAAW,EAAE,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAW3E,OAAO,KAAK,EAAC,IAAI,EAAC,MAAM,WAAW,CAAC;AAcpC,OAAO,EAEL,KAAK,YAAY,EACjB,KAAK,KAAK,EACV,KAAK,MAAM,EACX,KAAK,OAAO,EACb,MAAM,eAAe,CAAC;AACvB,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAC,KAAK,MAAM,EAAC,MAAM,aAAa,CAAC;AACxC,OAAO,EAIL,KAAK,iBAAiB,EACvB,MAAM,gBAAgB,CAAC;AAExB,KAAK,IAAI,GAAG;IACV,MAAM,EAAE,KAAK,CAAC;IACd,KAAK,EAAE,KAAK,CAAC;IAEb,SAAS,EAAE,WAAW,CAAC;IACvB,QAAQ,EAAE,WAAW,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;IACzB,MAAM,EAAE,OAAO,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,kBAAkB,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC7C,aAAa,CAAC,EAAE,iBAAiB,GAAG,SAAS,CAAC;IAC9C,OAAO,EAAE,OAAO,CAAC;CAClB,CAAC;AAEF;;;;;;;;;GASG;AACH,qBAAa,IAAK,YAAW,KAAK;;IAyBhC,YAAY,EACV,MAAM,EACN,KAAK,EACL,SAAS,EACT,QAAQ,EACR,gBAAgB,EAChB,MAAM,EACN,MAAM,EACN,kBAAkB,EAClB,aAAa,EACb,OAAO,GACR,EAAE,IAAI,EAqCN;IAQD,OAAO,IAAI,IAAI,CAGd;IAED,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAE9B;IAED,SAAS,IAAI,YAAY,CAExB;IAEA,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,CAShD;CAmRF"}

package/out/zql/src/ivm/join.js

@@ -1,8 +1,9 @@
 import { assert, unreachable } from "../../../shared/src/asserts.js";
 import { throwOutput } from "./operator.js";
 import { makeAddChange, makeChildChange, makeEditChange, makeRemoveChange } from "./change.js";
-import { buildJoinConstraint, generateWithOverlay, generateWithOverlayUnordered, getMatchingParentEntries, indexParentInStorage, isJoinMatch, rowEqualsForCompoundKey, unindexParentInStorage } from "./join-utils.js";
+import { buildJoinConstraint, canonicalKey, generateWithOverlay, generateWithOverlayUnordered, getMatchingParentEntries, indexParentInStorage, isJoinMatch, rowEqualsForCompoundKey, unindexParentInStorage } from "./join-utils.js";
 import { mergeSortedStreams } from "./memory-source.js";
+import { isInParentFetch, readParentFetchBounds } from "./take-gate.js";
 //#region ../zql/src/ivm/join.ts
 /**
 * The Join operator joins the output from two upstream inputs. Zero's join
@@ -27,6 +28,15 @@ var Join = class {
 	#output = throwOutput;
 	#inprogressChildChange;
 	#inprogressChildChangePosition;
+	/**
+	* Primary keys of the parents #inprogressChildChange has reached so far,
+	* kept only when the parent input is unordered. An unordered stream is not
+	* in `compareRows` order (SQLite returns it in whatever order its plan
+	* visits, e.g. rowid order), so whether a parent is still in the push queue
+	* cannot be decided by comparing it to #inprogressChildChangePosition.
+	*/
+	#inprogressReachedParents;
+	#inprogressParentFetchBounds;
 	constructor({ parent, child, parentKey, childKey, relationshipName, hidden, system, parentPartitionKey, boundProvider, storage }) {
 		assert(parent !== child, "Parent and child must be different operators");
 		assert(parentKey.length === childKey.length, "The parentKey and childKey keys must have same length");
@@ -127,23 +137,21 @@ var Join = class {
 	*#pushChildChange(childRow, change) {
 		this.#inprogressChildChange = change;
 		this.#inprogressChildChangePosition = void 0;
+		this.#inprogressReachedParents = this.#parent.getSchema().sort === void 0 ? /* @__PURE__ */ new Set() : void 0;
 		try {
 			const constraint = buildJoinConstraint(childRow, this.#childKey, this.#parentKey);
 			if (constraint) {
 				const matching = getMatchingParentEntries(this.#storage, childRow, this.#childKey, this.#parentPartitionKey);
 				if (!matching) return;
+				const fetchConstraints = matching.map((entry) => entry.partitionConstraint ? {
+					...constraint,
+					...entry.partitionConstraint
+				} : constraint);
+				if (this.#boundProvider) this.#inprogressParentFetchBounds = readParentFetchBounds(this.#boundProvider, fetchConstraints);
 				let parentNodeStream;
-				if (matching.length === 1) {
-					const [entry] = matching;
-					parentNodeStream = this.#parent.fetch({ constraint: entry.partitionConstraint ? {
-						...constraint,
-						...entry.partitionConstraint
-					} : constraint });
-				} else {
-					const streams = matching.map((entry) => this.#parent.fetch({ constraint: entry.partitionConstraint ? {
-						...constraint,
-						...entry.partitionConstraint
-					} : constraint }));
+				if (fetchConstraints.length === 1) parentNodeStream = this.#parent.fetch({ constraint: fetchConstraints[0] });
+				else {
+					const streams = fetchConstraints.map((c) => this.#parent.fetch({ constraint: c }));
 					const compare = (a, b) => this.#schema.compareRows(a.row, b.row);
 					parentNodeStream = mergeSortedStreams(streams, compare);
 				}
@@ -153,6 +161,7 @@ var Join = class {
 						continue;
 					}
 					this.#inprogressChildChangePosition = parentNode.row;
+					this.#inprogressReachedParents?.add(canonicalKey(parentNode.row, this.#schema.primaryKey));
 					const childChange = makeChildChange(this.#processParentNode(parentNode.row, parentNode.relationships), {
 						relationshipName: this.#relationshipName,
 						change
@@ -163,8 +172,20 @@ var Join = class {
 		} finally {
 			this.#inprogressChildChange = void 0;
 			this.#inprogressChildChangePosition = void 0;
+			this.#inprogressReachedParents = void 0;
+			this.#inprogressParentFetchBounds = void 0;
 		}
 	}
+	/**
+	* Whether the in-progress child change has yet to reach `parentNodeRow`,
+	* i.e. the row comes after #inprogressChildChangePosition in the parent
+	* stream.
+	*/
+	#isAfterInprogressPosition(parentNodeRow) {
+		if (this.#inprogressChildChangePosition === void 0) return false;
+		if (this.#inprogressReachedParents) return !this.#inprogressReachedParents.has(canonicalKey(parentNodeRow, this.#schema.primaryKey));
+		return this.#schema.compareRows(parentNodeRow, this.#inprogressChildChangePosition) > 0;
+	}
 	#indexParentRow(row) {
 		indexParentInStorage(this.#storage, row, this.#parentKey, this.#parent.getSchema().primaryKey, this.#parentPartitionKey);
 	}
@@ -175,12 +196,7 @@ var Join = class {
 		const childStream = () => {
 			const constraint = buildJoinConstraint(parentNodeRow, this.#parentKey, this.#childKey);
 			const stream = constraint ? this.#child.fetch({ constraint }) : [];
-			let inPushQueue;
-			if (this.#boundProvider) {
-				const partitionConstraint = this.#parentPartitionKey ? Object.fromEntries(this.#parentPartitionKey.map((k) => [k, parentNodeRow[k]])) : void 0;
-				const bound = this.#boundProvider.getBound(partitionConstraint);
-				inPushQueue = bound !== void 0 && this.#inprogressChildChangePosition !== void 0 && this.#schema.compareRows(parentNodeRow, this.#inprogressChildChangePosition) > 0 && this.#schema.compareRows(parentNodeRow, bound) <= 0;
-			} else inPushQueue = this.#inprogressChildChangePosition !== void 0 && this.#schema.compareRows(parentNodeRow, this.#inprogressChildChangePosition) > 0;
+			const inPushQueue = this.#isAfterInprogressPosition(parentNodeRow) && (this.#inprogressParentFetchBounds === void 0 || isInParentFetch(this.#inprogressParentFetchBounds, parentNodeRow, this.#schema.compareRows));
 			if (this.#inprogressChildChange && isJoinMatch(parentNodeRow, this.#parentKey, this.#inprogressChildChange[1].row, this.#childKey) && inPushQueue) {
 				const childSchema = this.#child.getSchema();
 				if (childSchema.sort === void 0) return generateWithOverlayUnordered(stream, this.#inprogressChildChange, childSchema);

package/out/zql/src/ivm/join.js.map

@@ -1 +1 @@
-{"version":3,"file":"join.js","names":["#parent","#child","#parentKey","#childKey","#relationshipName","#schema","#parentPartitionKey","#storage","#boundProvider","#pushParent","#reconcile","#pushChild","#output","#indexParentRow","#processParentNode","#unindexParentRow","#pushChildChange","#inprogressChildChange","#inprogressChildChangePosition"],"sources":["../../../../../zql/src/ivm/join.ts"],"sourcesContent":["import {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport type {CompoundKey, System} from '../../../zero-protocol/src/ast.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.ts';\nimport {\n  makeAddChange,\n  makeChildChange,\n  makeEditChange,\n  makeRemoveChange,\n  type Change,\n} from './change.ts';\nimport type {Node} from './data.ts';\nimport {\n  buildJoinConstraint,\n  generateWithOverlay,\n  generateWithOverlayUnordered,\n  getMatchingParentEntries,\n  indexParentInStorage,\n  isJoinMatch,\n  rowEqualsForCompoundKey,\n  unindexParentInStorage,\n  type JoinStorage,\n} from './join-utils.ts';\nimport {mergeSortedStreams} from './memory-source.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type Output,\n  type Storage,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.ts';\nimport type {TakeBoundProvider} from './take-gate.ts';\n\ntype Args = {\n  parent: Input;\n  child: Input;\n  // The nth key in parentKey corresponds to the nth key in childKey.\n  parentKey: CompoundKey;\n  childKey: CompoundKey;\n  relationshipName: string;\n  hidden: boolean;\n  system: System;\n  parentPartitionKey?: CompoundKey | undefined;\n  boundProvider?: TakeBoundProvider | undefined;\n  storage: Storage;\n};\n\n/**\n * The Join operator joins the output from two upstream inputs. Zero's join\n * is a little different from SQL's join in that we output hierarchical data,\n * not a flat table. This makes it a lot more useful for UI programming and\n * avoids duplicating tons of data like left join would.\n *\n * The Nodes output from Join have a new relationship added to them, which has\n * the name #relationshipName. The value of the relationship is a stream of\n * child nodes which are the corresponding values from the child source.\n */\nexport class Join implements Input {\n  readonly #parent: Input;\n  readonly #child: Input;\n  readonly #parentKey: CompoundKey;\n  readonly #childKey: CompoundKey;\n  readonly #relationshipName: string;\n  readonly #schema: SourceSchema;\n  readonly #parentPartitionKey: CompoundKey | undefined;\n  readonly #storage: JoinStorage;\n  readonly #boundProvider: TakeBoundProvider | undefined;\n\n  #output: Output = throwOutput;\n\n  #inprogressChildChange: Change | undefined;\n  #inprogressChildChangePosition: Row | undefined;\n\n  constructor({\n    parent,\n    child,\n    parentKey,\n    childKey,\n    relationshipName,\n    hidden,\n    system,\n    parentPartitionKey,\n    boundProvider,\n    storage,\n  }: Args) {\n    assert(parent !== child, 'Parent and child must be different operators');\n    assert(\n      parentKey.length === childKey.length,\n      'The parentKey and childKey keys must have same length',\n    );\n    this.#parent = parent;\n    this.#child = child;\n    this.#parentKey = parentKey;\n    this.#childKey = childKey;\n    this.#relationshipName = relationshipName;\n    this.#parentPartitionKey = parentPartitionKey;\n    this.#storage = storage as unknown as JoinStorage;\n    this.#boundProvider = boundProvider;\n\n    const parentSchema = parent.getSchema();\n    const childSchema = child.getSchema();\n    this.#schema = {\n      ...parentSchema,\n      relationships: {\n        ...parentSchema.relationships,\n        [relationshipName]: {\n          ...childSchema,\n          isHidden: hidden,\n          system,\n        },\n      },\n    };\n\n    parent.setOutput({\n      push: (change: Change) => this.#pushParent(change),\n      reconcile: () => this.#reconcile(),\n    });\n    child.setOutput({\n      push: (change: Change) => this.#pushChild(change),\n      reconcile: () => this.#reconcile(),\n    });\n  }\n\n  *#reconcile(): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n\n  destroy(): void {\n    this.#parent.destroy();\n    this.#child.destroy();\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  getSchema(): SourceSchema {\n    return this.#schema;\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    for (const parentNode of this.#parent.fetch(req)) {\n      if (parentNode === 'yield') {\n        yield parentNode;\n        continue;\n      }\n      this.#indexParentRow(parentNode.row);\n      yield this.#processParentNode(parentNode.row, parentNode.relationships);\n    }\n  }\n\n  *#pushParent(change: Change): Stream<'yield'> {\n    switch (change[ChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n        this.#indexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeAddChange(\n            this.#processParentNode(\n              change[ChangeIndex.NODE].row,\n              change[ChangeIndex.NODE].relationships,\n            ),\n          ),\n          this,\n        );\n        break;\n      case ChangeType.REMOVE:\n        this.#unindexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeRemoveChange(\n            this.#processParentNode(\n              change[ChangeIndex.NODE].row,\n              change[ChangeIndex.NODE].relationships,\n            ),\n          ),\n          this,\n        );\n        break;\n      case ChangeType.CHILD:\n        yield* this.#output.push(\n          makeChildChange(\n            this.#processParentNode(\n              change[ChangeIndex.NODE].row,\n              change[ChangeIndex.NODE].relationships,\n            ),\n            change[ChangeIndex.CHILD_DATA],\n          ),\n          this,\n        );\n        break;\n      case ChangeType.EDIT: {\n        // Assert the edit could not change the relationship.\n        assert(\n          rowEqualsForCompoundKey(\n            change[ChangeIndex.OLD_NODE].row,\n            change[ChangeIndex.NODE].row,\n            this.#parentKey,\n          ),\n          `Parent edit must not change relationship.`,\n        );\n        this.#unindexParentRow(change[ChangeIndex.OLD_NODE].row);\n        this.#indexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeEditChange(\n            this.#processParentNode(\n              change[ChangeIndex.NODE].row,\n              change[ChangeIndex.NODE].relationships,\n            ),\n            this.#processParentNode(\n              change[ChangeIndex.OLD_NODE].row,\n              change[ChangeIndex.OLD_NODE].relationships,\n            ),\n          ),\n          this,\n        );\n        break;\n      }\n      default:\n        unreachable(change);\n    }\n  }\n\n  *#pushChild(change: Change): Stream<'yield'> {\n    switch (change[ChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n      case ChangeType.REMOVE:\n        yield* this.#pushChildChange(change[ChangeIndex.NODE].row, change);\n        break;\n      case ChangeType.CHILD:\n        yield* this.#pushChildChange(change[ChangeIndex.NODE].row, change);\n        break;\n      case ChangeType.EDIT: {\n        const childRow = change[ChangeIndex.NODE].row;\n        const oldChildRow = change[ChangeIndex.OLD_NODE].row;\n        // Assert the edit could not change the relationship.\n        assert(\n          rowEqualsForCompoundKey(oldChildRow, childRow, this.#childKey),\n          'Child edit must not change relationship.',\n        );\n        yield* this.#pushChildChange(childRow, change);\n        break;\n      }\n\n      default:\n        unreachable(change);\n    }\n  }\n\n  *#pushChildChange(childRow: Row, change: Change): Stream<'yield'> {\n    this.#inprogressChildChange = change;\n    this.#inprogressChildChangePosition = undefined;\n    try {\n      const constraint = buildJoinConstraint(\n        childRow,\n        this.#childKey,\n        this.#parentKey,\n      );\n      if (constraint) {\n        const matching = getMatchingParentEntries(\n          this.#storage,\n          childRow,\n          this.#childKey,\n          this.#parentPartitionKey,\n        );\n        if (!matching) {\n          return;\n        }\n\n        let parentNodeStream: Stream<Node | 'yield'>;\n        if (matching.length === 1) {\n          const [entry] = matching;\n          parentNodeStream = this.#parent.fetch({\n            constraint: entry.partitionConstraint\n              ? {...constraint, ...entry.partitionConstraint}\n              : constraint,\n          });\n        } else {\n          const streams = matching.map(entry =>\n            this.#parent.fetch({\n              constraint: entry.partitionConstraint\n                ? {...constraint, ...entry.partitionConstraint}\n                : constraint,\n            }),\n          );\n          const compare = (a: Node, b: Node) =>\n            this.#schema.compareRows(a.row, b.row);\n          parentNodeStream = mergeSortedStreams(streams, compare);\n        }\n\n        for (const parentNode of parentNodeStream) {\n          if (parentNode === 'yield') {\n            yield parentNode;\n            continue;\n          }\n          this.#inprogressChildChangePosition = parentNode.row;\n          const childChange = makeChildChange(\n            this.#processParentNode(parentNode.row, parentNode.relationships),\n            {\n              relationshipName: this.#relationshipName,\n              change,\n            },\n          );\n          yield* this.#output.push(childChange, this);\n        }\n      }\n    } finally {\n      this.#inprogressChildChange = undefined;\n      this.#inprogressChildChangePosition = undefined;\n    }\n  }\n\n  #indexParentRow(row: Row): void {\n    indexParentInStorage(\n      this.#storage,\n      row,\n      this.#parentKey,\n      this.#parent.getSchema().primaryKey,\n      this.#parentPartitionKey,\n    );\n  }\n\n  #unindexParentRow(row: Row): void {\n    unindexParentInStorage(\n      this.#storage,\n      row,\n      this.#parentKey,\n      this.#parent.getSchema().primaryKey,\n      this.#parentPartitionKey,\n    );\n  }\n\n  #processParentNode(\n    parentNodeRow: Row,\n    parentNodeRelations: Record<string, () => Stream<Node | 'yield'>>,\n  ): Node {\n    const childStream = () => {\n      const constraint = buildJoinConstraint(\n        parentNodeRow,\n        this.#parentKey,\n        this.#childKey,\n      );\n      const stream = constraint ? this.#child.fetch({constraint}) : [];\n\n      let inPushQueue: boolean;\n      if (this.#boundProvider) {\n        const partitionConstraint = this.#parentPartitionKey\n          ? Object.fromEntries(\n              this.#parentPartitionKey.map(k => [k, parentNodeRow[k]]),\n            )\n          : undefined;\n        const bound = this.#boundProvider.getBound(partitionConstraint);\n        inPushQueue =\n          bound !== undefined &&\n          this.#inprogressChildChangePosition !== undefined &&\n          this.#schema.compareRows(\n            parentNodeRow,\n            this.#inprogressChildChangePosition,\n          ) > 0 &&\n          this.#schema.compareRows(parentNodeRow, bound) <= 0;\n      } else {\n        inPushQueue =\n          this.#inprogressChildChangePosition !== undefined &&\n          this.#schema.compareRows(\n            parentNodeRow,\n            this.#inprogressChildChangePosition,\n          ) > 0;\n      }\n\n      if (\n        this.#inprogressChildChange &&\n        isJoinMatch(\n          parentNodeRow,\n          this.#parentKey,\n          this.#inprogressChildChange[ChangeIndex.NODE].row,\n          this.#childKey,\n        ) &&\n        inPushQueue\n      ) {\n        const childSchema = this.#child.getSchema();\n        if (childSchema.sort === undefined) {\n          return generateWithOverlayUnordered(\n            stream,\n            this.#inprogressChildChange,\n            childSchema,\n          );\n        }\n        return generateWithOverlay(\n          stream,\n          this.#inprogressChildChange,\n          childSchema,\n        );\n      }\n      return stream;\n    };\n\n    return {\n      row: parentNodeRow,\n      relationships: {\n        ...parentNodeRelations,\n        [this.#relationshipName]: childStream,\n      },\n    };\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AA4DA,IAAa,OAAb,MAAmC;CACjC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA,UAAkB;CAElB;CACA;CAEA,YAAY,EACV,QACA,OACA,WACA,UACA,kBACA,QACA,QACA,oBACA,eACA,WACO;EACP,OAAO,WAAW,OAAO,8CAA8C;EACvE,OACE,UAAU,WAAW,SAAS,QAC9B,uDACF;EACA,KAAKA,UAAU;EACf,KAAKC,SAAS;EACd,KAAKC,aAAa;EAClB,KAAKC,YAAY;EACjB,KAAKC,oBAAoB;EACzB,KAAKE,sBAAsB;EAC3B,KAAKC,WAAW;EAChB,KAAKC,iBAAiB;EAEtB,MAAM,eAAe,OAAO,UAAU;EACtC,MAAM,cAAc,MAAM,UAAU;EACpC,KAAKH,UAAU;GACb,GAAG;GACH,eAAe;IACb,GAAG,aAAa;KACf,mBAAmB;KAClB,GAAG;KACH,UAAU;KACV;IACF;GACF;EACF;EAEA,OAAO,UAAU;GACf,OAAO,WAAmB,KAAKI,YAAY,MAAM;GACjD,iBAAiB,KAAKC,WAAW;EACnC,CAAC;EACD,MAAM,UAAU;GACd,OAAO,WAAmB,KAAKC,WAAW,MAAM;GAChD,iBAAiB,KAAKD,WAAW;EACnC,CAAC;CACH;CAEA,CAACA,aAA8B;EAC7B,IAAI,KAAKE,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;CAEA,UAAgB;EACd,KAAKZ,QAAQ,QAAQ;EACrB,KAAKC,OAAO,QAAQ;CACtB;CAEA,UAAU,QAAsB;EAC9B,KAAKW,UAAU;CACjB;CAEA,YAA0B;EACxB,OAAO,KAAKP;CACd;CAEA,CAAC,MAAM,KAA2C;EAChD,KAAK,MAAM,cAAc,KAAKL,QAAQ,MAAM,GAAG,GAAG;GAChD,IAAI,eAAe,SAAS;IAC1B,MAAM;IACN;GACF;GACA,KAAKa,gBAAgB,WAAW,GAAG;GACnC,MAAM,KAAKC,mBAAmB,WAAW,KAAK,WAAW,aAAa;EACxE;CACF;CAEA,CAACL,YAAY,QAAiC;EAC5C,QAAQ,OAAO,IAAf;GACE,KAAK;IACH,KAAKI,gBAAgB,OAAO,GAAkB,GAAG;IACjD,OAAO,KAAKD,QAAQ,KAClB,cACE,KAAKE,mBACH,OAAO,GAAkB,KACzB,OAAO,GAAkB,aAC3B,CACF,GACA,IACF;IACA;GACF,KAAK;IACH,KAAKC,kBAAkB,OAAO,GAAkB,GAAG;IACnD,OAAO,KAAKH,QAAQ,KAClB,iBACE,KAAKE,mBACH,OAAO,GAAkB,KACzB,OAAO,GAAkB,aAC3B,CACF,GACA,IACF;IACA;GACF,KAAK;IACH,OAAO,KAAKF,QAAQ,KAClB,gBACE,KAAKE,mBACH,OAAO,GAAkB,KACzB,OAAO,GAAkB,aAC3B,GACA,OAAO,EACT,GACA,IACF;IACA;GACF,KAAK;IAEH,OACE,wBACE,OAAO,GAAsB,KAC7B,OAAO,GAAkB,KACzB,KAAKZ,UACP,GACA,2CACF;IACA,KAAKa,kBAAkB,OAAO,GAAsB,GAAG;IACvD,KAAKF,gBAAgB,OAAO,GAAkB,GAAG;IACjD,OAAO,KAAKD,QAAQ,KAClB,eACE,KAAKE,mBACH,OAAO,GAAkB,KACzB,OAAO,GAAkB,aAC3B,GACA,KAAKA,mBACH,OAAO,GAAsB,KAC7B,OAAO,GAAsB,aAC/B,CACF,GACA,IACF;IACA;GAEF,SACE,YAAY,MAAM;EACtB;CACF;CAEA,CAACH,WAAW,QAAiC;EAC3C,QAAQ,OAAO,IAAf;GACE,KAAK;GACL,KAAK;IACH,OAAO,KAAKK,iBAAiB,OAAO,GAAkB,KAAK,MAAM;IACjE;GACF,KAAK;IACH,OAAO,KAAKA,iBAAiB,OAAO,GAAkB,KAAK,MAAM;IACjE;GACF,KAAK,GAAiB;IACpB,MAAM,WAAW,OAAO,GAAkB;IAC1C,MAAM,cAAc,OAAO,GAAsB;IAEjD,OACE,wBAAwB,aAAa,UAAU,KAAKb,SAAS,GAC7D,0CACF;IACA,OAAO,KAAKa,iBAAiB,UAAU,MAAM;IAC7C;GACF;GAEA,SACE,YAAY,MAAM;EACtB;CACF;CAEA,CAACA,iBAAiB,UAAe,QAAiC;EAChE,KAAKC,yBAAyB;EAC9B,KAAKC,iCAAiC,KAAA;EACtC,IAAI;GACF,MAAM,aAAa,oBACjB,UACA,KAAKf,WACL,KAAKD,UACP;GACA,IAAI,YAAY;IACd,MAAM,WAAW,yBACf,KAAKK,UACL,UACA,KAAKJ,WACL,KAAKG,mBACP;IACA,IAAI,CAAC,UACH;IAGF,IAAI;IACJ,IAAI,SAAS,WAAW,GAAG;KACzB,MAAM,CAAC,SAAS;KAChB,mBAAmB,KAAKN,QAAQ,MAAM,EACpC,YAAY,MAAM,sBACd;MAAC,GAAG;MAAY,GAAG,MAAM;KAAmB,IAC5C,WACN,CAAC;IACH,OAAO;KACL,MAAM,UAAU,SAAS,KAAI,UAC3B,KAAKA,QAAQ,MAAM,EACjB,YAAY,MAAM,sBACd;MAAC,GAAG;MAAY,GAAG,MAAM;KAAmB,IAC5C,WACN,CAAC,CACH;KACA,MAAM,WAAW,GAAS,MACxB,KAAKK,QAAQ,YAAY,EAAE,KAAK,EAAE,GAAG;KACvC,mBAAmB,mBAAmB,SAAS,OAAO;IACxD;IAEA,KAAK,MAAM,cAAc,kBAAkB;KACzC,IAAI,eAAe,SAAS;MAC1B,MAAM;MACN;KACF;KACA,KAAKa,iCAAiC,WAAW;KACjD,MAAM,cAAc,gBAClB,KAAKJ,mBAAmB,WAAW,KAAK,WAAW,aAAa,GAChE;MACE,kBAAkB,KAAKV;MACvB;KACF,CACF;KACA,OAAO,KAAKQ,QAAQ,KAAK,aAAa,IAAI;IAC5C;GACF;EACF,UAAU;GACR,KAAKK,yBAAyB,KAAA;GAC9B,KAAKC,iCAAiC,KAAA;EACxC;CACF;CAEA,gBAAgB,KAAgB;EAC9B,qBACE,KAAKX,UACL,KACA,KAAKL,YACL,KAAKF,QAAQ,UAAU,EAAE,YACzB,KAAKM,mBACP;CACF;CAEA,kBAAkB,KAAgB;EAChC,uBACE,KAAKC,UACL,KACA,KAAKL,YACL,KAAKF,QAAQ,UAAU,EAAE,YACzB,KAAKM,mBACP;CACF;CAEA,mBACE,eACA,qBACM;EACN,MAAM,oBAAoB;GACxB,MAAM,aAAa,oBACjB,eACA,KAAKJ,YACL,KAAKC,SACP;GACA,MAAM,SAAS,aAAa,KAAKF,OAAO,MAAM,EAAC,WAAU,CAAC,IAAI,CAAC;GAE/D,IAAI;GACJ,IAAI,KAAKO,gBAAgB;IACvB,MAAM,sBAAsB,KAAKF,sBAC7B,OAAO,YACL,KAAKA,oBAAoB,KAAI,MAAK,CAAC,GAAG,cAAc,EAAE,CAAC,CACzD,IACA,KAAA;IACJ,MAAM,QAAQ,KAAKE,eAAe,SAAS,mBAAmB;IAC9D,cACE,UAAU,KAAA,KACV,KAAKU,mCAAmC,KAAA,KACxC,KAAKb,QAAQ,YACX,eACA,KAAKa,8BACP,IAAI,KACJ,KAAKb,QAAQ,YAAY,eAAe,KAAK,KAAK;GACtD,OACE,cACE,KAAKa,mCAAmC,KAAA,KACxC,KAAKb,QAAQ,YACX,eACA,KAAKa,8BACP,IAAI;GAGR,IACE,KAAKD,0BACL,YACE,eACA,KAAKf,YACL,KAAKe,uBAAuB,GAAkB,KAC9C,KAAKd,SACP,KACA,aACA;IACA,MAAM,cAAc,KAAKF,OAAO,UAAU;IAC1C,IAAI,YAAY,SAAS,KAAA,GACvB,OAAO,6BACL,QACA,KAAKgB,wBACL,WACF;IAEF,OAAO,oBACL,QACA,KAAKA,wBACL,WACF;GACF;GACA,OAAO;EACT;EAEA,OAAO;GACL,KAAK;GACL,eAAe;IACb,GAAG;KACF,KAAKb,oBAAoB;GAC5B;EACF;CACF;AACF"}
+{"version":3,"file":"join.js","names":["#parent","#child","#parentKey","#childKey","#relationshipName","#schema","#parentPartitionKey","#storage","#boundProvider","#pushParent","#reconcile","#pushChild","#output","#indexParentRow","#processParentNode","#unindexParentRow","#pushChildChange","#inprogressChildChange","#inprogressChildChangePosition","#inprogressReachedParents","#inprogressParentFetchBounds","#isAfterInprogressPosition"],"sources":["../../../../../zql/src/ivm/join.ts"],"sourcesContent":["import {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport type {CompoundKey, System} from '../../../zero-protocol/src/ast.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.ts';\nimport {\n  makeAddChange,\n  makeChildChange,\n  makeEditChange,\n  makeRemoveChange,\n  type Change,\n} from './change.ts';\nimport type {Node} from './data.ts';\nimport {\n  buildJoinConstraint,\n  canonicalKey,\n  generateWithOverlay,\n  generateWithOverlayUnordered,\n  getMatchingParentEntries,\n  indexParentInStorage,\n  isJoinMatch,\n  rowEqualsForCompoundKey,\n  unindexParentInStorage,\n  type JoinStorage,\n} from './join-utils.ts';\nimport {mergeSortedStreams} from './memory-source.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type Output,\n  type Storage,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.ts';\nimport {\n  isInParentFetch,\n  readParentFetchBounds,\n  type ParentFetchBound,\n  type TakeBoundProvider,\n} from './take-gate.ts';\n\ntype Args = {\n  parent: Input;\n  child: Input;\n  // The nth key in parentKey corresponds to the nth key in childKey.\n  parentKey: CompoundKey;\n  childKey: CompoundKey;\n  relationshipName: string;\n  hidden: boolean;\n  system: System;\n  parentPartitionKey?: CompoundKey | undefined;\n  boundProvider?: TakeBoundProvider | undefined;\n  storage: Storage;\n};\n\n/**\n * The Join operator joins the output from two upstream inputs. Zero's join\n * is a little different from SQL's join in that we output hierarchical data,\n * not a flat table. This makes it a lot more useful for UI programming and\n * avoids duplicating tons of data like left join would.\n *\n * The Nodes output from Join have a new relationship added to them, which has\n * the name #relationshipName. The value of the relationship is a stream of\n * child nodes which are the corresponding values from the child source.\n */\nexport class Join implements Input {\n  readonly #parent: Input;\n  readonly #child: Input;\n  readonly #parentKey: CompoundKey;\n  readonly #childKey: CompoundKey;\n  readonly #relationshipName: string;\n  readonly #schema: SourceSchema;\n  readonly #parentPartitionKey: CompoundKey | undefined;\n  readonly #storage: JoinStorage;\n  readonly #boundProvider: TakeBoundProvider | undefined;\n\n  #output: Output = throwOutput;\n\n  #inprogressChildChange: Change | undefined;\n  #inprogressChildChangePosition: Row | undefined;\n  /**\n   * Primary keys of the parents #inprogressChildChange has reached so far,\n   * kept only when the parent input is unordered. An unordered stream is not\n   * in `compareRows` order (SQLite returns it in whatever order its plan\n   * visits, e.g. rowid order), so whether a parent is still in the push queue\n   * cannot be decided by comparing it to #inprogressChildChangePosition.\n   */\n  #inprogressReachedParents: Set<string> | undefined;\n  #inprogressParentFetchBounds: ParentFetchBound[] | undefined;\n\n  constructor({\n    parent,\n    child,\n    parentKey,\n    childKey,\n    relationshipName,\n    hidden,\n    system,\n    parentPartitionKey,\n    boundProvider,\n    storage,\n  }: Args) {\n    assert(parent !== child, 'Parent and child must be different operators');\n    assert(\n      parentKey.length === childKey.length,\n      'The parentKey and childKey keys must have same length',\n    );\n    this.#parent = parent;\n    this.#child = child;\n    this.#parentKey = parentKey;\n    this.#childKey = childKey;\n    this.#relationshipName = relationshipName;\n    this.#parentPartitionKey = parentPartitionKey;\n    this.#storage = storage as unknown as JoinStorage;\n    this.#boundProvider = boundProvider;\n\n    const parentSchema = parent.getSchema();\n    const childSchema = child.getSchema();\n    this.#schema = {\n      ...parentSchema,\n      relationships: {\n        ...parentSchema.relationships,\n        [relationshipName]: {\n          ...childSchema,\n          isHidden: hidden,\n          system,\n        },\n      },\n    };\n\n    parent.setOutput({\n      push: (change: Change) => this.#pushParent(change),\n      reconcile: () => this.#reconcile(),\n    });\n    child.setOutput({\n      push: (change: Change) => this.#pushChild(change),\n      reconcile: () => this.#reconcile(),\n    });\n  }\n\n  *#reconcile(): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n\n  destroy(): void {\n    this.#parent.destroy();\n    this.#child.destroy();\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  getSchema(): SourceSchema {\n    return this.#schema;\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    for (const parentNode of this.#parent.fetch(req)) {\n      if (parentNode === 'yield') {\n        yield parentNode;\n        continue;\n      }\n      this.#indexParentRow(parentNode.row);\n      yield this.#processParentNode(parentNode.row, parentNode.relationships);\n    }\n  }\n\n  *#pushParent(change: Change): Stream<'yield'> {\n    switch (change[ChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n        this.#indexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeAddChange(\n            this.#processParentNode(\n              change[ChangeIndex.NODE].row,\n              change[ChangeIndex.NODE].relationships,\n            ),\n          ),\n          this,\n        );\n        break;\n      case ChangeType.REMOVE:\n        this.#unindexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeRemoveChange(\n            this.#processParentNode(\n              change[ChangeIndex.NODE].row,\n              change[ChangeIndex.NODE].relationships,\n            ),\n          ),\n          this,\n        );\n        break;\n      case ChangeType.CHILD:\n        yield* this.#output.push(\n          makeChildChange(\n            this.#processParentNode(\n              change[ChangeIndex.NODE].row,\n              change[ChangeIndex.NODE].relationships,\n            ),\n            change[ChangeIndex.CHILD_DATA],\n          ),\n          this,\n        );\n        break;\n      case ChangeType.EDIT: {\n        // Assert the edit could not change the relationship.\n        assert(\n          rowEqualsForCompoundKey(\n            change[ChangeIndex.OLD_NODE].row,\n            change[ChangeIndex.NODE].row,\n            this.#parentKey,\n          ),\n          `Parent edit must not change relationship.`,\n        );\n        this.#unindexParentRow(change[ChangeIndex.OLD_NODE].row);\n        this.#indexParentRow(change[ChangeIndex.NODE].row);\n        yield* this.#output.push(\n          makeEditChange(\n            this.#processParentNode(\n              change[ChangeIndex.NODE].row,\n              change[ChangeIndex.NODE].relationships,\n            ),\n            this.#processParentNode(\n              change[ChangeIndex.OLD_NODE].row,\n              change[ChangeIndex.OLD_NODE].relationships,\n            ),\n          ),\n          this,\n        );\n        break;\n      }\n      default:\n        unreachable(change);\n    }\n  }\n\n  *#pushChild(change: Change): Stream<'yield'> {\n    switch (change[ChangeIndex.TYPE]) {\n      case ChangeType.ADD:\n      case ChangeType.REMOVE:\n        yield* this.#pushChildChange(change[ChangeIndex.NODE].row, change);\n        break;\n      case ChangeType.CHILD:\n        yield* this.#pushChildChange(change[ChangeIndex.NODE].row, change);\n        break;\n      case ChangeType.EDIT: {\n        const childRow = change[ChangeIndex.NODE].row;\n        const oldChildRow = change[ChangeIndex.OLD_NODE].row;\n        // Assert the edit could not change the relationship.\n        assert(\n          rowEqualsForCompoundKey(oldChildRow, childRow, this.#childKey),\n          'Child edit must not change relationship.',\n        );\n        yield* this.#pushChildChange(childRow, change);\n        break;\n      }\n\n      default:\n        unreachable(change);\n    }\n  }\n\n  *#pushChildChange(childRow: Row, change: Change): Stream<'yield'> {\n    this.#inprogressChildChange = change;\n    this.#inprogressChildChangePosition = undefined;\n    this.#inprogressReachedParents =\n      this.#parent.getSchema().sort === undefined ? new Set() : undefined;\n    try {\n      const constraint = buildJoinConstraint(\n        childRow,\n        this.#childKey,\n        this.#parentKey,\n      );\n      if (constraint) {\n        const matching = getMatchingParentEntries(\n          this.#storage,\n          childRow,\n          this.#childKey,\n          this.#parentPartitionKey,\n        );\n        if (!matching) {\n          return;\n        }\n\n        const fetchConstraints = matching.map(entry =>\n          entry.partitionConstraint\n            ? {...constraint, ...entry.partitionConstraint}\n            : constraint,\n        );\n        if (this.#boundProvider) {\n          this.#inprogressParentFetchBounds = readParentFetchBounds(\n            this.#boundProvider,\n            fetchConstraints,\n          );\n        }\n\n        let parentNodeStream: Stream<Node | 'yield'>;\n        if (fetchConstraints.length === 1) {\n          parentNodeStream = this.#parent.fetch({\n            constraint: fetchConstraints[0],\n          });\n        } else {\n          const streams = fetchConstraints.map(c =>\n            this.#parent.fetch({constraint: c}),\n          );\n          const compare = (a: Node, b: Node) =>\n            this.#schema.compareRows(a.row, b.row);\n          parentNodeStream = mergeSortedStreams(streams, compare);\n        }\n\n        for (const parentNode of parentNodeStream) {\n          if (parentNode === 'yield') {\n            yield parentNode;\n            continue;\n          }\n          this.#inprogressChildChangePosition = parentNode.row;\n          this.#inprogressReachedParents?.add(\n            canonicalKey(parentNode.row, this.#schema.primaryKey),\n          );\n          const childChange = makeChildChange(\n            this.#processParentNode(parentNode.row, parentNode.relationships),\n            {\n              relationshipName: this.#relationshipName,\n              change,\n            },\n          );\n          yield* this.#output.push(childChange, this);\n        }\n      }\n    } finally {\n      this.#inprogressChildChange = undefined;\n      this.#inprogressChildChangePosition = undefined;\n      this.#inprogressReachedParents = undefined;\n      this.#inprogressParentFetchBounds = undefined;\n    }\n  }\n\n  /**\n   * Whether the in-progress child change has yet to reach `parentNodeRow`,\n   * i.e. the row comes after #inprogressChildChangePosition in the parent\n   * stream.\n   */\n  #isAfterInprogressPosition(parentNodeRow: Row): boolean {\n    if (this.#inprogressChildChangePosition === undefined) {\n      return false;\n    }\n    if (this.#inprogressReachedParents) {\n      return !this.#inprogressReachedParents.has(\n        canonicalKey(parentNodeRow, this.#schema.primaryKey),\n      );\n    }\n    return (\n      this.#schema.compareRows(\n        parentNodeRow,\n        this.#inprogressChildChangePosition,\n      ) > 0\n    );\n  }\n\n  #indexParentRow(row: Row): void {\n    indexParentInStorage(\n      this.#storage,\n      row,\n      this.#parentKey,\n      this.#parent.getSchema().primaryKey,\n      this.#parentPartitionKey,\n    );\n  }\n\n  #unindexParentRow(row: Row): void {\n    unindexParentInStorage(\n      this.#storage,\n      row,\n      this.#parentKey,\n      this.#parent.getSchema().primaryKey,\n      this.#parentPartitionKey,\n    );\n  }\n\n  #processParentNode(\n    parentNodeRow: Row,\n    parentNodeRelations: Record<string, () => Stream<Node | 'yield'>>,\n  ): Node {\n    const childStream = () => {\n      const constraint = buildJoinConstraint(\n        parentNodeRow,\n        this.#parentKey,\n        this.#childKey,\n      );\n      const stream = constraint ? this.#child.fetch({constraint}) : [];\n\n      // The parent has yet to get the in-progress child change if it comes\n      // after the current position and a parent fetch of the push yields it.\n      // With a TakeGate the fetches are capped at the bounds read when they\n      // started.\n      const inPushQueue =\n        this.#isAfterInprogressPosition(parentNodeRow) &&\n        (this.#inprogressParentFetchBounds === undefined ||\n          isInParentFetch(\n            this.#inprogressParentFetchBounds,\n            parentNodeRow,\n            this.#schema.compareRows,\n          ));\n\n      if (\n        this.#inprogressChildChange &&\n        isJoinMatch(\n          parentNodeRow,\n          this.#parentKey,\n          this.#inprogressChildChange[ChangeIndex.NODE].row,\n          this.#childKey,\n        ) &&\n        inPushQueue\n      ) {\n        const childSchema = this.#child.getSchema();\n        if (childSchema.sort === undefined) {\n          return generateWithOverlayUnordered(\n            stream,\n            this.#inprogressChildChange,\n            childSchema,\n          );\n        }\n        return generateWithOverlay(\n          stream,\n          this.#inprogressChildChange,\n          childSchema,\n        );\n      }\n      return stream;\n    };\n\n    return {\n      row: parentNodeRow,\n      relationships: {\n        ...parentNodeRelations,\n        [this.#relationshipName]: childStream,\n      },\n    };\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAkEA,IAAa,OAAb,MAAmC;CACjC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA,UAAkB;CAElB;CACA;;;;;;;;CAQA;CACA;CAEA,YAAY,EACV,QACA,OACA,WACA,UACA,kBACA,QACA,QACA,oBACA,eACA,WACO;EACP,OAAO,WAAW,OAAO,8CAA8C;EACvE,OACE,UAAU,WAAW,SAAS,QAC9B,uDACF;EACA,KAAKA,UAAU;EACf,KAAKC,SAAS;EACd,KAAKC,aAAa;EAClB,KAAKC,YAAY;EACjB,KAAKC,oBAAoB;EACzB,KAAKE,sBAAsB;EAC3B,KAAKC,WAAW;EAChB,KAAKC,iBAAiB;EAEtB,MAAM,eAAe,OAAO,UAAU;EACtC,MAAM,cAAc,MAAM,UAAU;EACpC,KAAKH,UAAU;GACb,GAAG;GACH,eAAe;IACb,GAAG,aAAa;KACf,mBAAmB;KAClB,GAAG;KACH,UAAU;KACV;IACF;GACF;EACF;EAEA,OAAO,UAAU;GACf,OAAO,WAAmB,KAAKI,YAAY,MAAM;GACjD,iBAAiB,KAAKC,WAAW;EACnC,CAAC;EACD,MAAM,UAAU;GACd,OAAO,WAAmB,KAAKC,WAAW,MAAM;GAChD,iBAAiB,KAAKD,WAAW;EACnC,CAAC;CACH;CAEA,CAACA,aAA8B;EAC7B,IAAI,KAAKE,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;CAEA,UAAgB;EACd,KAAKZ,QAAQ,QAAQ;EACrB,KAAKC,OAAO,QAAQ;CACtB;CAEA,UAAU,QAAsB;EAC9B,KAAKW,UAAU;CACjB;CAEA,YAA0B;EACxB,OAAO,KAAKP;CACd;CAEA,CAAC,MAAM,KAA2C;EAChD,KAAK,MAAM,cAAc,KAAKL,QAAQ,MAAM,GAAG,GAAG;GAChD,IAAI,eAAe,SAAS;IAC1B,MAAM;IACN;GACF;GACA,KAAKa,gBAAgB,WAAW,GAAG;GACnC,MAAM,KAAKC,mBAAmB,WAAW,KAAK,WAAW,aAAa;EACxE;CACF;CAEA,CAACL,YAAY,QAAiC;EAC5C,QAAQ,OAAO,IAAf;GACE,KAAK;IACH,KAAKI,gBAAgB,OAAO,GAAkB,GAAG;IACjD,OAAO,KAAKD,QAAQ,KAClB,cACE,KAAKE,mBACH,OAAO,GAAkB,KACzB,OAAO,GAAkB,aAC3B,CACF,GACA,IACF;IACA;GACF,KAAK;IACH,KAAKC,kBAAkB,OAAO,GAAkB,GAAG;IACnD,OAAO,KAAKH,QAAQ,KAClB,iBACE,KAAKE,mBACH,OAAO,GAAkB,KACzB,OAAO,GAAkB,aAC3B,CACF,GACA,IACF;IACA;GACF,KAAK;IACH,OAAO,KAAKF,QAAQ,KAClB,gBACE,KAAKE,mBACH,OAAO,GAAkB,KACzB,OAAO,GAAkB,aAC3B,GACA,OAAO,EACT,GACA,IACF;IACA;GACF,KAAK;IAEH,OACE,wBACE,OAAO,GAAsB,KAC7B,OAAO,GAAkB,KACzB,KAAKZ,UACP,GACA,2CACF;IACA,KAAKa,kBAAkB,OAAO,GAAsB,GAAG;IACvD,KAAKF,gBAAgB,OAAO,GAAkB,GAAG;IACjD,OAAO,KAAKD,QAAQ,KAClB,eACE,KAAKE,mBACH,OAAO,GAAkB,KACzB,OAAO,GAAkB,aAC3B,GACA,KAAKA,mBACH,OAAO,GAAsB,KAC7B,OAAO,GAAsB,aAC/B,CACF,GACA,IACF;IACA;GAEF,SACE,YAAY,MAAM;EACtB;CACF;CAEA,CAACH,WAAW,QAAiC;EAC3C,QAAQ,OAAO,IAAf;GACE,KAAK;GACL,KAAK;IACH,OAAO,KAAKK,iBAAiB,OAAO,GAAkB,KAAK,MAAM;IACjE;GACF,KAAK;IACH,OAAO,KAAKA,iBAAiB,OAAO,GAAkB,KAAK,MAAM;IACjE;GACF,KAAK,GAAiB;IACpB,MAAM,WAAW,OAAO,GAAkB;IAC1C,MAAM,cAAc,OAAO,GAAsB;IAEjD,OACE,wBAAwB,aAAa,UAAU,KAAKb,SAAS,GAC7D,0CACF;IACA,OAAO,KAAKa,iBAAiB,UAAU,MAAM;IAC7C;GACF;GAEA,SACE,YAAY,MAAM;EACtB;CACF;CAEA,CAACA,iBAAiB,UAAe,QAAiC;EAChE,KAAKC,yBAAyB;EAC9B,KAAKC,iCAAiC,KAAA;EACtC,KAAKC,4BACH,KAAKnB,QAAQ,UAAU,EAAE,SAAS,KAAA,oBAAY,IAAI,IAAI,IAAI,KAAA;EAC5D,IAAI;GACF,MAAM,aAAa,oBACjB,UACA,KAAKG,WACL,KAAKD,UACP;GACA,IAAI,YAAY;IACd,MAAM,WAAW,yBACf,KAAKK,UACL,UACA,KAAKJ,WACL,KAAKG,mBACP;IACA,IAAI,CAAC,UACH;IAGF,MAAM,mBAAmB,SAAS,KAAI,UACpC,MAAM,sBACF;KAAC,GAAG;KAAY,GAAG,MAAM;IAAmB,IAC5C,UACN;IACA,IAAI,KAAKE,gBACP,KAAKY,+BAA+B,sBAClC,KAAKZ,gBACL,gBACF;IAGF,IAAI;IACJ,IAAI,iBAAiB,WAAW,GAC9B,mBAAmB,KAAKR,QAAQ,MAAM,EACpC,YAAY,iBAAiB,GAC/B,CAAC;SACI;KACL,MAAM,UAAU,iBAAiB,KAAI,MACnC,KAAKA,QAAQ,MAAM,EAAC,YAAY,EAAC,CAAC,CACpC;KACA,MAAM,WAAW,GAAS,MACxB,KAAKK,QAAQ,YAAY,EAAE,KAAK,EAAE,GAAG;KACvC,mBAAmB,mBAAmB,SAAS,OAAO;IACxD;IAEA,KAAK,MAAM,cAAc,kBAAkB;KACzC,IAAI,eAAe,SAAS;MAC1B,MAAM;MACN;KACF;KACA,KAAKa,iCAAiC,WAAW;KACjD,KAAKC,2BAA2B,IAC9B,aAAa,WAAW,KAAK,KAAKd,QAAQ,UAAU,CACtD;KACA,MAAM,cAAc,gBAClB,KAAKS,mBAAmB,WAAW,KAAK,WAAW,aAAa,GAChE;MACE,kBAAkB,KAAKV;MACvB;KACF,CACF;KACA,OAAO,KAAKQ,QAAQ,KAAK,aAAa,IAAI;IAC5C;GACF;EACF,UAAU;GACR,KAAKK,yBAAyB,KAAA;GAC9B,KAAKC,iCAAiC,KAAA;GACtC,KAAKC,4BAA4B,KAAA;GACjC,KAAKC,+BAA+B,KAAA;EACtC;CACF;;;;;;CAOA,2BAA2B,eAA6B;EACtD,IAAI,KAAKF,mCAAmC,KAAA,GAC1C,OAAO;EAET,IAAI,KAAKC,2BACP,OAAO,CAAC,KAAKA,0BAA0B,IACrC,aAAa,eAAe,KAAKd,QAAQ,UAAU,CACrD;EAEF,OACE,KAAKA,QAAQ,YACX,eACA,KAAKa,8BACP,IAAI;CAER;CAEA,gBAAgB,KAAgB;EAC9B,qBACE,KAAKX,UACL,KACA,KAAKL,YACL,KAAKF,QAAQ,UAAU,EAAE,YACzB,KAAKM,mBACP;CACF;CAEA,kBAAkB,KAAgB;EAChC,uBACE,KAAKC,UACL,KACA,KAAKL,YACL,KAAKF,QAAQ,UAAU,EAAE,YACzB,KAAKM,mBACP;CACF;CAEA,mBACE,eACA,qBACM;EACN,MAAM,oBAAoB;GACxB,MAAM,aAAa,oBACjB,eACA,KAAKJ,YACL,KAAKC,SACP;GACA,MAAM,SAAS,aAAa,KAAKF,OAAO,MAAM,EAAC,WAAU,CAAC,IAAI,CAAC;GAM/D,MAAM,cACJ,KAAKoB,2BAA2B,aAAa,MAC5C,KAAKD,iCAAiC,KAAA,KACrC,gBACE,KAAKA,8BACL,eACA,KAAKf,QAAQ,WACf;GAEJ,IACE,KAAKY,0BACL,YACE,eACA,KAAKf,YACL,KAAKe,uBAAuB,GAAkB,KAC9C,KAAKd,SACP,KACA,aACA;IACA,MAAM,cAAc,KAAKF,OAAO,UAAU;IAC1C,IAAI,YAAY,SAAS,KAAA,GACvB,OAAO,6BACL,QACA,KAAKgB,wBACL,WACF;IAEF,OAAO,oBACL,QACA,KAAKA,wBACL,WACF;GACF;GACA,OAAO;EACT;EAEA,OAAO;GACL,KAAK;GACL,eAAe;IACb,GAAG;KACF,KAAKb,oBAAoB;GAC5B;EACF;CACF;AACF"}

package/out/zql/src/ivm/take-gate.d.ts

@@ -1,13 +1,34 @@
 import type { Row } from '../../../zero-protocol/src/data.ts';
 import type { Change } from './change.ts';
-import type { Constraint } from './constraint.ts';
-import type { Node } from './data.ts';
+import { type Constraint } from './constraint.ts';
+import type { Comparator, Node } from './data.ts';
 import { type FetchRequest, type Input, type InputBase, type Operator, type Output } from './operator.ts';
 import type { SourceSchema } from './schema.ts';
 import type { Stream } from './stream.ts';
 export interface TakeBoundProvider {
     getBound(constraint?: Constraint): Row | undefined;
 }
+/**
+ * The bound that a TakeGate caps one parent fetch of a join's child push at.
+ * `undefined` means the fetch is not capped.
+ */
+export type ParentFetchBound = {
+    readonly constraint: Constraint;
+    readonly bound: Row | undefined;
+};
+/**
+ * Reads the bounds for the parent fetches of a child push before the join
+ * starts them. TakeGate reads its bound once, when a fetch starts, so the set
+ * of parents that get the push stays fixed even when Take moves its bound
+ * during the push. Split-push overlays must use these bounds, not the bound
+ * Take reports later in the push.
+ */
+export declare function readParentFetchBounds(boundProvider: TakeBoundProvider, constraints: readonly Constraint[]): ParentFetchBound[];
+/**
+ * Returns true if one of the parent fetches of the push yields `row`: `row`
+ * matches the fetch's constraint and is not after the fetch's bound.
+ */
+export declare function isInParentFetch(bounds: readonly ParentFetchBound[], row: Row, compareRows: Comparator): boolean;
 /**
  * TakeGate bounds upstream parent fetches using the active bound from a
  * downstream Take operator.

package/out/zql/src/ivm/take-gate.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"take-gate.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/take-gate.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,oCAAoC,CAAC;AAC5D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AACxC,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,iBAAiB,CAAC;AAChD,OAAO,KAAK,EAAa,IAAI,EAAC,MAAM,WAAW,CAAC;AAChD,OAAO,EAEL,KAAK,YAAY,EACjB,KAAK,KAAK,EACV,KAAK,SAAS,EACd,KAAK,QAAQ,EACb,KAAK,MAAM,EACZ,MAAM,eAAe,CAAC;AACvB,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,aAAa,CAAC;AAC9C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AAExC,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,UAAU,CAAC,EAAE,UAAU,GAAG,GAAG,GAAG,SAAS,CAAC;CACpD;AAED;;;;;;;;GAQG;AACH,qBAAa,QAAS,YAAW,QAAQ,EAAE,iBAAiB;;IAO1D,YAAY,KAAK,EAAE,KAAK,EAMvB;IAED,IAAI,IAAI,IAAI,CAEX;IAED,KAAK,IAAI,IAAI,CAGZ;IAED,MAAM,IAAI,OAAO,CAEhB;IAED,gBAAgB,CAAC,QAAQ,EAAE,iBAAiB,GAAG,IAAI,CAElD;IAED,gBAAgB,IAAI,iBAAiB,GAAG,SAAS,CAEhD;IAED,QAAQ,CAAC,UAAU,CAAC,EAAE,UAAU,GAAG,GAAG,GAAG,SAAS,CAKjD;IAED,SAAS,IAAI,YAAY,CAExB;IAED,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAE9B;IAED,OAAO,IAAI,IAAI,CAEd;IAEA,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,CAEzD;IAEA,SAAS,CAAC,OAAO,EAAE,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,CAI9C;IAEA,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,CAsBhD;CACF"}
+{"version":3,"file":"take-gate.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/take-gate.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,oCAAoC,CAAC;AAC5D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AACxC,OAAO,EAAuB,KAAK,UAAU,EAAC,MAAM,iBAAiB,CAAC;AACtE,OAAO,KAAK,EAAC,UAAU,EAAE,IAAI,EAAC,MAAM,WAAW,CAAC;AAChD,OAAO,EAEL,KAAK,YAAY,EACjB,KAAK,KAAK,EACV,KAAK,SAAS,EACd,KAAK,QAAQ,EACb,KAAK,MAAM,EACZ,MAAM,eAAe,CAAC;AACvB,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,aAAa,CAAC;AAC9C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AAExC,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,UAAU,CAAC,EAAE,UAAU,GAAG,GAAG,GAAG,SAAS,CAAC;CACpD;AAED;;;GAGG;AACH,MAAM,MAAM,gBAAgB,GAAG;IAC7B,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,GAAG,GAAG,SAAS,CAAC;CACjC,CAAC;AAEF;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CACnC,aAAa,EAAE,iBAAiB,EAChC,WAAW,EAAE,SAAS,UAAU,EAAE,GACjC,gBAAgB,EAAE,CAKpB;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,MAAM,EAAE,SAAS,gBAAgB,EAAE,EACnC,GAAG,EAAE,GAAG,EACR,WAAW,EAAE,UAAU,GACtB,OAAO,CAOT;AAED;;;;;;;;GAQG;AACH,qBAAa,QAAS,YAAW,QAAQ,EAAE,iBAAiB;;IAO1D,YAAY,KAAK,EAAE,KAAK,EAMvB;IAED,IAAI,IAAI,IAAI,CAEX;IAED,KAAK,IAAI,IAAI,CAGZ;IAED,MAAM,IAAI,OAAO,CAEhB;IAED,gBAAgB,CAAC,QAAQ,EAAE,iBAAiB,GAAG,IAAI,CAElD;IAED,gBAAgB,IAAI,iBAAiB,GAAG,SAAS,CAEhD;IAED,QAAQ,CAAC,UAAU,CAAC,EAAE,UAAU,GAAG,GAAG,GAAG,SAAS,CAKjD;IAED,SAAS,IAAI,YAAY,CAExB;IAED,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAE9B;IAED,OAAO,IAAI,IAAI,CAEd;IAEA,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,CAEzD;IAEA,SAAS,CAAC,OAAO,EAAE,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,CAI9C;IAEA,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,CAsBhD;CACF"}

package/out/zql/src/ivm/take-gate.js

@@ -1,7 +1,29 @@
 import { assert } from "../../../shared/src/asserts.js";
 import { throwOutput } from "./operator.js";
+import { constraintMatchesRow } from "./constraint.js";
 //#region ../zql/src/ivm/take-gate.ts
 /**
+* Reads the bounds for the parent fetches of a child push before the join
+* starts them. TakeGate reads its bound once, when a fetch starts, so the set
+* of parents that get the push stays fixed even when Take moves its bound
+* during the push. Split-push overlays must use these bounds, not the bound
+* Take reports later in the push.
+*/
+function readParentFetchBounds(boundProvider, constraints) {
+	return constraints.map((constraint) => ({
+		constraint,
+		bound: boundProvider.getBound(constraint)
+	}));
+}
+/**
+* Returns true if one of the parent fetches of the push yields `row`: `row`
+* matches the fetch's constraint and is not after the fetch's bound.
+*/
+function isInParentFetch(bounds, row, compareRows) {
+	for (const { constraint, bound } of bounds) if (constraintMatchesRow(constraint, row)) return bound === void 0 || compareRows(row, bound) <= 0;
+	return false;
+}
+/**
 * TakeGate bounds upstream parent fetches using the active bound from a
 * downstream Take operator.
 *
@@ -79,6 +101,6 @@ var TakeGate = class {
 	}
 };
 //#endregion
-export { TakeGate };
+export { TakeGate, isInParentFetch, readParentFetchBounds };
 
 //# sourceMappingURL=take-gate.js.map

package/out/zql/src/ivm/take-gate.js.map

@@ -1 +1 @@
-{"version":3,"file":"take-gate.js","names":["#input","#comparator","#openDepth","#boundProvider","#output"],"sources":["../../../../../zql/src/ivm/take-gate.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport type {Change} from './change.ts';\nimport type {Constraint} from './constraint.ts';\nimport type {Comparator, Node} from './data.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type InputBase,\n  type Operator,\n  type Output,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Stream} from './stream.ts';\n\nexport interface TakeBoundProvider {\n  getBound(constraint?: Constraint): Row | undefined;\n}\n\n/**\n * TakeGate bounds upstream parent fetches using the active bound from a\n * downstream Take operator.\n *\n * When a child table changes, joins fetch matching parent rows. Without\n * TakeGate, this fetch scans all matching parent rows (which may be thousands)\n * even if downstream Take only needs a few. TakeGate intercepts this fetch and\n * stops the upstream stream once rows exceed Take's bound.\n */\nexport class TakeGate implements Operator, TakeBoundProvider {\n  readonly #input: Input;\n  readonly #comparator: Comparator;\n  #boundProvider: TakeBoundProvider | undefined;\n  #output: Output = throwOutput;\n  #openDepth = 0;\n\n  constructor(input: Input) {\n    const {sort, compareRows} = input.getSchema();\n    assert(sort !== undefined, 'TakeGate requires sorted input');\n    this.#input = input;\n    this.#comparator = compareRows;\n    input.setOutput(this);\n  }\n\n  open(): void {\n    this.#openDepth++;\n  }\n\n  close(): void {\n    assert(this.#openDepth > 0, 'TakeGate.close called without matching open');\n    this.#openDepth--;\n  }\n\n  isOpen(): boolean {\n    return this.#openDepth > 0;\n  }\n\n  setBoundProvider(provider: TakeBoundProvider): void {\n    this.#boundProvider = provider;\n  }\n\n  getBoundProvider(): TakeBoundProvider | undefined {\n    return this.#boundProvider;\n  }\n\n  getBound(constraint?: Constraint): Row | undefined {\n    if (this.#openDepth > 0) {\n      return undefined;\n    }\n    return this.#boundProvider?.getBound(constraint);\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  *push(change: Change, _pusher: InputBase): Stream<'yield'> {\n    yield* this.#output.push(change, this);\n  }\n\n  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    if (this.#openDepth > 0 || req.reverse) {\n      yield* this.#input.fetch(req);\n      return;\n    }\n\n    const bound = this.#boundProvider?.getBound(req.constraint);\n    if (!bound) {\n      yield* this.#input.fetch(req);\n      return;\n    }\n\n    for (const node of this.#input.fetch(req)) {\n      if (node === 'yield') {\n        yield 'yield';\n        continue;\n      }\n      if (this.#comparator(node.row, bound) > 0) {\n        return;\n      }\n      yield node;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;AA6BA,IAAa,WAAb,MAA6D;CAC3D;CACA;CACA;CACA,UAAkB;CAClB,aAAa;CAEb,YAAY,OAAc;EACxB,MAAM,EAAC,MAAM,gBAAe,MAAM,UAAU;EAC5C,OAAO,SAAS,KAAA,GAAW,gCAAgC;EAC3D,KAAKA,SAAS;EACd,KAAKC,cAAc;EACnB,MAAM,UAAU,IAAI;CACtB;CAEA,OAAa;EACX,KAAKC;CACP;CAEA,QAAc;EACZ,OAAO,KAAKA,aAAa,GAAG,6CAA6C;EACzE,KAAKA;CACP;CAEA,SAAkB;EAChB,OAAO,KAAKA,aAAa;CAC3B;CAEA,iBAAiB,UAAmC;EAClD,KAAKC,iBAAiB;CACxB;CAEA,mBAAkD;EAChD,OAAO,KAAKA;CACd;CAEA,SAAS,YAA0C;EACjD,IAAI,KAAKD,aAAa,GACpB;EAEF,OAAO,KAAKC,gBAAgB,SAAS,UAAU;CACjD;CAEA,YAA0B;EACxB,OAAO,KAAKH,OAAO,UAAU;CAC/B;CAEA,UAAU,QAAsB;EAC9B,KAAKI,UAAU;CACjB;CAEA,UAAgB;EACd,KAAKJ,OAAO,QAAQ;CACtB;CAEA,CAAC,KAAK,QAAgB,SAAqC;EACzD,OAAO,KAAKI,QAAQ,KAAK,QAAQ,IAAI;CACvC;CAEA,CAAC,UAAU,SAAqC;EAC9C,IAAI,KAAKA,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;CAEA,CAAC,MAAM,KAA2C;EAChD,IAAI,KAAKF,aAAa,KAAK,IAAI,SAAS;GACtC,OAAO,KAAKF,OAAO,MAAM,GAAG;GAC5B;EACF;EAEA,MAAM,QAAQ,KAAKG,gBAAgB,SAAS,IAAI,UAAU;EAC1D,IAAI,CAAC,OAAO;GACV,OAAO,KAAKH,OAAO,MAAM,GAAG;GAC5B;EACF;EAEA,KAAK,MAAM,QAAQ,KAAKA,OAAO,MAAM,GAAG,GAAG;GACzC,IAAI,SAAS,SAAS;IACpB,MAAM;IACN;GACF;GACA,IAAI,KAAKC,YAAY,KAAK,KAAK,KAAK,IAAI,GACtC;GAEF,MAAM;EACR;CACF;AACF"}
+{"version":3,"file":"take-gate.js","names":["#input","#comparator","#openDepth","#boundProvider","#output"],"sources":["../../../../../zql/src/ivm/take-gate.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport type {Change} from './change.ts';\nimport {constraintMatchesRow, type Constraint} from './constraint.ts';\nimport type {Comparator, Node} from './data.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type InputBase,\n  type Operator,\n  type Output,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Stream} from './stream.ts';\n\nexport interface TakeBoundProvider {\n  getBound(constraint?: Constraint): Row | undefined;\n}\n\n/**\n * The bound that a TakeGate caps one parent fetch of a join's child push at.\n * `undefined` means the fetch is not capped.\n */\nexport type ParentFetchBound = {\n  readonly constraint: Constraint;\n  readonly bound: Row | undefined;\n};\n\n/**\n * Reads the bounds for the parent fetches of a child push before the join\n * starts them. TakeGate reads its bound once, when a fetch starts, so the set\n * of parents that get the push stays fixed even when Take moves its bound\n * during the push. Split-push overlays must use these bounds, not the bound\n * Take reports later in the push.\n */\nexport function readParentFetchBounds(\n  boundProvider: TakeBoundProvider,\n  constraints: readonly Constraint[],\n): ParentFetchBound[] {\n  return constraints.map(constraint => ({\n    constraint,\n    bound: boundProvider.getBound(constraint),\n  }));\n}\n\n/**\n * Returns true if one of the parent fetches of the push yields `row`: `row`\n * matches the fetch's constraint and is not after the fetch's bound.\n */\nexport function isInParentFetch(\n  bounds: readonly ParentFetchBound[],\n  row: Row,\n  compareRows: Comparator,\n): boolean {\n  for (const {constraint, bound} of bounds) {\n    if (constraintMatchesRow(constraint, row)) {\n      return bound === undefined || compareRows(row, bound) <= 0;\n    }\n  }\n  return false;\n}\n\n/**\n * TakeGate bounds upstream parent fetches using the active bound from a\n * downstream Take operator.\n *\n * When a child table changes, joins fetch matching parent rows. Without\n * TakeGate, this fetch scans all matching parent rows (which may be thousands)\n * even if downstream Take only needs a few. TakeGate intercepts this fetch and\n * stops the upstream stream once rows exceed Take's bound.\n */\nexport class TakeGate implements Operator, TakeBoundProvider {\n  readonly #input: Input;\n  readonly #comparator: Comparator;\n  #boundProvider: TakeBoundProvider | undefined;\n  #output: Output = throwOutput;\n  #openDepth = 0;\n\n  constructor(input: Input) {\n    const {sort, compareRows} = input.getSchema();\n    assert(sort !== undefined, 'TakeGate requires sorted input');\n    this.#input = input;\n    this.#comparator = compareRows;\n    input.setOutput(this);\n  }\n\n  open(): void {\n    this.#openDepth++;\n  }\n\n  close(): void {\n    assert(this.#openDepth > 0, 'TakeGate.close called without matching open');\n    this.#openDepth--;\n  }\n\n  isOpen(): boolean {\n    return this.#openDepth > 0;\n  }\n\n  setBoundProvider(provider: TakeBoundProvider): void {\n    this.#boundProvider = provider;\n  }\n\n  getBoundProvider(): TakeBoundProvider | undefined {\n    return this.#boundProvider;\n  }\n\n  getBound(constraint?: Constraint): Row | undefined {\n    if (this.#openDepth > 0) {\n      return undefined;\n    }\n    return this.#boundProvider?.getBound(constraint);\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  *push(change: Change, _pusher: InputBase): Stream<'yield'> {\n    yield* this.#output.push(change, this);\n  }\n\n  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    if (this.#openDepth > 0 || req.reverse) {\n      yield* this.#input.fetch(req);\n      return;\n    }\n\n    const bound = this.#boundProvider?.getBound(req.constraint);\n    if (!bound) {\n      yield* this.#input.fetch(req);\n      return;\n    }\n\n    for (const node of this.#input.fetch(req)) {\n      if (node === 'yield') {\n        yield 'yield';\n        continue;\n      }\n      if (this.#comparator(node.row, bound) > 0) {\n        return;\n      }\n      yield node;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;AAoCA,SAAgB,sBACd,eACA,aACoB;CACpB,OAAO,YAAY,KAAI,gBAAe;EACpC;EACA,OAAO,cAAc,SAAS,UAAU;CAC1C,EAAE;AACJ;;;;;AAMA,SAAgB,gBACd,QACA,KACA,aACS;CACT,KAAK,MAAM,EAAC,YAAY,WAAU,QAChC,IAAI,qBAAqB,YAAY,GAAG,GACtC,OAAO,UAAU,KAAA,KAAa,YAAY,KAAK,KAAK,KAAK;CAG7D,OAAO;AACT;;;;;;;;;;AAWA,IAAa,WAAb,MAA6D;CAC3D;CACA;CACA;CACA,UAAkB;CAClB,aAAa;CAEb,YAAY,OAAc;EACxB,MAAM,EAAC,MAAM,gBAAe,MAAM,UAAU;EAC5C,OAAO,SAAS,KAAA,GAAW,gCAAgC;EAC3D,KAAKA,SAAS;EACd,KAAKC,cAAc;EACnB,MAAM,UAAU,IAAI;CACtB;CAEA,OAAa;EACX,KAAKC;CACP;CAEA,QAAc;EACZ,OAAO,KAAKA,aAAa,GAAG,6CAA6C;EACzE,KAAKA;CACP;CAEA,SAAkB;EAChB,OAAO,KAAKA,aAAa;CAC3B;CAEA,iBAAiB,UAAmC;EAClD,KAAKC,iBAAiB;CACxB;CAEA,mBAAkD;EAChD,OAAO,KAAKA;CACd;CAEA,SAAS,YAA0C;EACjD,IAAI,KAAKD,aAAa,GACpB;EAEF,OAAO,KAAKC,gBAAgB,SAAS,UAAU;CACjD;CAEA,YAA0B;EACxB,OAAO,KAAKH,OAAO,UAAU;CAC/B;CAEA,UAAU,QAAsB;EAC9B,KAAKI,UAAU;CACjB;CAEA,UAAgB;EACd,KAAKJ,OAAO,QAAQ;CACtB;CAEA,CAAC,KAAK,QAAgB,SAAqC;EACzD,OAAO,KAAKI,QAAQ,KAAK,QAAQ,IAAI;CACvC;CAEA,CAAC,UAAU,SAAqC;EAC9C,IAAI,KAAKA,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;CAEA,CAAC,MAAM,KAA2C;EAChD,IAAI,KAAKF,aAAa,KAAK,IAAI,SAAS;GACtC,OAAO,KAAKF,OAAO,MAAM,GAAG;GAC5B;EACF;EAEA,MAAM,QAAQ,KAAKG,gBAAgB,SAAS,IAAI,UAAU;EAC1D,IAAI,CAAC,OAAO;GACV,OAAO,KAAKH,OAAO,MAAM,GAAG;GAC5B;EACF;EAEA,KAAK,MAAM,QAAQ,KAAKA,OAAO,MAAM,GAAG,GAAG;GACzC,IAAI,SAAS,SAAS;IACpB,MAAM;IACN;GACF;GACA,IAAI,KAAKC,YAAY,KAAK,KAAK,KAAK,IAAI,GACtC;GAEF,MAAM;EACR;CACF;AACF"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@rocicorp/zero",
-  "version": "1.11.0-canary.12",
+  "version": "1.11.0-canary.13",
   "description": "Zero is a web framework for serverless web development.",
   "homepage": "https://zero.rocicorp.dev",
   "bugs": {