@rocicorp/zero 1.11.0-canary.3 → 1.11.0-canary.30

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

@@ -1 +1 @@
-{"version":3,"file":"join.js","names":["#parent","#child","#parentKey","#childKey","#relationshipName","#schema","#pushParent","#pushChild","#output","#processParentNode","#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  isJoinMatch,\n  rowEqualsForCompoundKey,\n} from './join-utils.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type Output,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.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};\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\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  }: 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\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    });\n    child.setOutput({\n      push: (change: Change) => this.#pushChild(change),\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      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        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        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        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        for (const parentNode of this.#parent.fetch({constraint})) {\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    }\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      if (\n        this.#inprogressChildChange &&\n        isJoinMatch(\n          parentNodeRow,\n          this.#parentKey,\n          this.#inprogressChildChange[ChangeIndex.NODE].row,\n          this.#childKey,\n        ) &&\n        this.#inprogressChildChangePosition &&\n        this.#schema.compareRows(\n          parentNodeRow,\n          this.#inprogressChildChangePosition,\n        ) > 0\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":";;;;;;;;;;;;;;;AAkDA,IAAa,OAAb,MAAmC;CACjC;CACA;CACA;CACA;CACA;CACA;CAEA,UAAkB;CAElB;CACA;CAEA,YAAY,EACV,QACA,OACA,WACA,UACA,kBACA,QACA,UACO;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;EAEzB,MAAM,eAAe,OAAO,UAAU;EACtC,MAAM,cAAc,MAAM,UAAU;EACpC,KAAKC,UAAU;GACb,GAAG;GACH,eAAe;IACb,GAAG,aAAa;KACf,mBAAmB;KAClB,GAAG;KACH,UAAU;KACV;IACF;GACF;EACF;EAEA,OAAO,UAAU,EACf,OAAO,WAAmB,KAAKC,YAAY,MAAM,EACnD,CAAC;EACD,MAAM,UAAU,EACd,OAAO,WAAmB,KAAKC,WAAW,MAAM,EAClD,CAAC;CACH;CAEA,UAAgB;EACd,KAAKP,QAAQ,QAAQ;EACrB,KAAKC,OAAO,QAAQ;CACtB;CAEA,UAAU,QAAsB;EAC9B,KAAKO,UAAU;CACjB;CAEA,YAA0B;EACxB,OAAO,KAAKH;CACd;CAEA,CAAC,MAAM,KAA2C;EAChD,KAAK,MAAM,cAAc,KAAKL,QAAQ,MAAM,GAAG,GAAG;GAChD,IAAI,eAAe,SAAS;IAC1B,MAAM;IACN;GACF;GACA,MAAM,KAAKS,mBAAmB,WAAW,KAAK,WAAW,aAAa;EACxE;CACF;CAEA,CAACH,YAAY,QAAiC;EAC5C,QAAQ,OAAO,IAAf;GACE,KAAK;IACH,OAAO,KAAKE,QAAQ,KAClB,cACE,KAAKC,mBACH,OAAO,GAAkB,KACzB,OAAO,GAAkB,aAC3B,CACF,GACA,IACF;IACA;GACF,KAAK;IACH,OAAO,KAAKD,QAAQ,KAClB,iBACE,KAAKC,mBACH,OAAO,GAAkB,KACzB,OAAO,GAAkB,aAC3B,CACF,GACA,IACF;IACA;GACF,KAAK;IACH,OAAO,KAAKD,QAAQ,KAClB,gBACE,KAAKC,mBACH,OAAO,GAAkB,KACzB,OAAO,GAAkB,aAC3B,GACA,OAAO,EACT,GACA,IACF;IACA;GACF,KAAK;IAEH,OACE,wBACE,OAAO,GAAsB,KAC7B,OAAO,GAAkB,KACzB,KAAKP,UACP,GACA,2CACF;IACA,OAAO,KAAKM,QAAQ,KAClB,eACE,KAAKC,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,CAACF,WAAW,QAAiC;EAC3C,QAAQ,OAAO,IAAf;GACE,KAAK;GACL,KAAK;IACH,OAAO,KAAKG,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,KAAKP,SAAS,GAC7D,0CACF;IACA,OAAO,KAAKO,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,KAAKT,WACL,KAAKD,UACP;GACA,IAAI,YACF,KAAK,MAAM,cAAc,KAAKF,QAAQ,MAAM,EAAC,WAAU,CAAC,GAAG;IACzD,IAAI,eAAe,SAAS;KAC1B,MAAM;KACN;IACF;IACA,KAAKY,iCAAiC,WAAW;IACjD,MAAM,cAAc,gBAClB,KAAKH,mBAAmB,WAAW,KAAK,WAAW,aAAa,GAChE;KACE,kBAAkB,KAAKL;KACvB;IACF,CACF;IACA,OAAO,KAAKI,QAAQ,KAAK,aAAa,IAAI;GAC5C;EAEJ,UAAU;GACR,KAAKG,yBAAyB,KAAA;EAChC;CACF;CAEA,mBACE,eACA,qBACM;EACN,MAAM,oBAAoB;GACxB,MAAM,aAAa,oBACjB,eACA,KAAKT,YACL,KAAKC,SACP;GACA,MAAM,SAAS,aAAa,KAAKF,OAAO,MAAM,EAAC,WAAU,CAAC,IAAI,CAAC;GAE/D,IACE,KAAKU,0BACL,YACE,eACA,KAAKT,YACL,KAAKS,uBAAuB,GAAkB,KAC9C,KAAKR,SACP,KACA,KAAKS,kCACL,KAAKP,QAAQ,YACX,eACA,KAAKO,8BACP,IAAI,GACJ;IACA,MAAM,cAAc,KAAKX,OAAO,UAAU;IAC1C,IAAI,YAAY,SAAS,KAAA,GACvB,OAAO,6BACL,QACA,KAAKU,wBACL,WACF;IAEF,OAAO,oBACL,QACA,KAAKA,wBACL,WACF;GACF;GACA,OAAO;EACT;EAEA,OAAO;GACL,KAAK;GACL,eAAe;IACb,GAAG;KACF,KAAKP,oBAAoB;GAC5B;EACF;CACF;AACF"}
+{"version":3,"file":"join.js","names":["#parent","#child","#parentKey","#childKey","#relationshipName","#schema","#parentIndex","#indexesParents","#qualifyingChildChange","#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, 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 type {Node} from './data.ts';\nimport {JoinIndex} from './join-index.ts';\nimport {\n  buildJoinConstraint,\n  canonicalKey,\n  generateWithOverlay,\n  generateWithOverlayUnordered,\n  isJoinMatch,\n  rowEqualsForCompoundKey,\n} from './join-utils.ts';\nimport {mergeSortedStreams} from './memory-source.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type Output,\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  /**\n   * Set when this join feeds an EXISTS or NOT EXISTS condition. Its parent\n   * index is then kept by a JoinIndexTap at the end of the pipeline, so it\n   * only holds the parents the pipeline emits, not every parent this join\n   * sees. A child change that misses the index is dropped unless it could\n   * make a parent pass the condition: an add for EXISTS, a remove for NOT\n   * EXISTS. Those still fetch the parents.\n   */\n  exists?: ExistsJoin | undefined;\n};\n\nexport type ExistsJoin = {\n  readonly op: 'EXISTS' | 'NOT EXISTS';\n  readonly parentIndex: JoinIndex;\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 #parentIndex: JoinIndex;\n  /**\n   * Whether this join adds and removes parents in #parentIndex itself. Not\n   * so for EXISTS joins, see Args.exists.\n   */\n  readonly #indexesParents: boolean;\n  /**\n   * The child change type that is still pushed to the parents when no\n   * indexed parent has its join key. See Args.exists.\n   */\n  readonly #qualifyingChildChange: ChangeType | undefined;\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    exists,\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    assert(!exists || !parentPartitionKey, 'EXISTS joins are not partitioned');\n    this.#parent = parent;\n    this.#child = child;\n    this.#parentKey = parentKey;\n    this.#childKey = childKey;\n    this.#relationshipName = relationshipName;\n    if (exists) {\n      this.#parentIndex = exists.parentIndex;\n      this.#indexesParents = false;\n      this.#qualifyingChildChange =\n        exists.op === 'EXISTS' ? ChangeType.ADD : ChangeType.REMOVE;\n    } else {\n      this.#parentIndex = new JoinIndex(\n        parentKey,\n        parent.getSchema().primaryKey,\n        parentPartitionKey,\n      );\n      this.#indexesParents = true;\n      this.#qualifyingChildChange = undefined;\n    }\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  get parentIndexForTest(): JoinIndex {\n    return this.#parentIndex;\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 partitions = this.#parentIndex.lookup(childRow, this.#childKey);\n        let fetchConstraints: Record<string, Value>[];\n        if (partitions) {\n          fetchConstraints = partitions.map(partitionConstraint =>\n            partitionConstraint\n              ? {...constraint, ...partitionConstraint}\n              : constraint,\n          );\n        } else if (change[ChangeIndex.TYPE] === this.#qualifyingChildChange) {\n          fetchConstraints = [constraint];\n        } else {\n          return;\n        }\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    if (this.#indexesParents) {\n      this.#parentIndex.add(row);\n    }\n  }\n\n  #unindexParentRow(row: Row): void {\n    if (this.#indexesParents) {\n      this.#parentIndex.remove(row);\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":";;;;;;;;;;;;;;;;;;AA2EA,IAAa,OAAb,MAAmC;CACjC;CACA;CACA;CACA;CACA;CACA;CACA;;;;;CAKA;;;;;CAKA;CACA;CAEA,UAAkB;CAElB;CACA;;;;;;;;CAQA;CACA;CAEA,YAAY,EACV,QACA,OACA,WACA,UACA,kBACA,QACA,QACA,oBACA,eACA,UACO;EACP,OAAO,WAAW,OAAO,8CAA8C;EACvE,OACE,UAAU,WAAW,SAAS,QAC9B,uDACF;EACA,OAAO,CAAC,UAAU,CAAC,oBAAoB,kCAAkC;EACzE,KAAKA,UAAU;EACf,KAAKC,SAAS;EACd,KAAKC,aAAa;EAClB,KAAKC,YAAY;EACjB,KAAKC,oBAAoB;EACzB,IAAI,QAAQ;GACV,KAAKE,eAAe,OAAO;GAC3B,KAAKC,kBAAkB;GACvB,KAAKC,yBACH,OAAO,OAAO,WAAW,IAAiB;EAC9C,OAAO;GACL,KAAKF,eAAe,IAAI,UACtB,WACA,OAAO,UAAU,EAAE,YACnB,kBACF;GACA,KAAKC,kBAAkB;GACvB,KAAKC,yBAAyB,KAAA;EAChC;EACA,KAAKC,iBAAiB;EAEtB,MAAM,eAAe,OAAO,UAAU;EACtC,MAAM,cAAc,MAAM,UAAU;EACpC,KAAKJ,UAAU;GACb,GAAG;GACH,eAAe;IACb,GAAG,aAAa;KACf,mBAAmB;KAClB,GAAG;KACH,UAAU;KACV;IACF;GACF;EACF;EAEA,OAAO,UAAU;GACf,OAAO,WAAmB,KAAKK,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,KAAKb,QAAQ,QAAQ;EACrB,KAAKC,OAAO,QAAQ;CACtB;CAEA,IAAI,qBAAgC;EAClC,OAAO,KAAKK;CACd;CAEA,UAAU,QAAsB;EAC9B,KAAKO,UAAU;CACjB;CAEA,YAA0B;EACxB,OAAO,KAAKR;CACd;CAEA,CAAC,MAAM,KAA2C;EAChD,KAAK,MAAM,cAAc,KAAKL,QAAQ,MAAM,GAAG,GAAG;GAChD,IAAI,eAAe,SAAS;IAC1B,MAAM;IACN;GACF;GACA,KAAKc,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,KAAKb,UACP,GACA,2CACF;IACA,KAAKc,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,KAAKd,SAAS,GAC7D,0CACF;IACA,OAAO,KAAKc,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,KAAKpB,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,aAAa,KAAKI,aAAa,OAAO,UAAU,KAAKH,SAAS;IACpE,IAAI;IACJ,IAAI,YACF,mBAAmB,WAAW,KAAI,wBAChC,sBACI;KAAC,GAAG;KAAY,GAAG;IAAmB,IACtC,UACN;SACK,IAAI,OAAO,OAAsB,KAAKK,wBAC3C,mBAAmB,CAAC,UAAU;SAE9B;IAGF,IAAI,KAAKC,gBACP,KAAKY,+BAA+B,sBAClC,KAAKZ,gBACL,gBACF;IAGF,IAAI;IACJ,IAAI,iBAAiB,WAAW,GAC9B,mBAAmB,KAAKT,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,KAAKc,iCAAiC,WAAW;KACjD,KAAKC,2BAA2B,IAC9B,aAAa,WAAW,KAAK,KAAKf,QAAQ,UAAU,CACtD;KACA,MAAM,cAAc,gBAClB,KAAKU,mBAAmB,WAAW,KAAK,WAAW,aAAa,GAChE;MACE,kBAAkB,KAAKX;MACvB;KACF,CACF;KACA,OAAO,KAAKS,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,KAAKf,QAAQ,UAAU,CACrD;EAEF,OACE,KAAKA,QAAQ,YACX,eACA,KAAKc,8BACP,IAAI;CAER;CAEA,gBAAgB,KAAgB;EAC9B,IAAI,KAAKZ,iBACP,KAAKD,aAAa,IAAI,GAAG;CAE7B;CAEA,kBAAkB,KAAgB;EAChC,IAAI,KAAKC,iBACP,KAAKD,aAAa,OAAO,GAAG;CAEhC;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,KAAKqB,2BAA2B,aAAa,MAC5C,KAAKD,iCAAiC,KAAA,KACrC,gBACE,KAAKA,8BACL,eACA,KAAKhB,QAAQ,WACf;GAEJ,IACE,KAAKa,0BACL,YACE,eACA,KAAKhB,YACL,KAAKgB,uBAAuB,GAAkB,KAC9C,KAAKf,SACP,KACA,aACA;IACA,MAAM,cAAc,KAAKF,OAAO,UAAU;IAC1C,IAAI,YAAY,SAAS,KAAA,GACvB,OAAO,6BACL,QACA,KAAKiB,wBACL,WACF;IAEF,OAAO,oBACL,QACA,KAAKA,wBACL,WACF;GACF;GACA,OAAO;EACT;EAEA,OAAO;GACL,KAAK;GACL,eAAe;IACb,GAAG;KACF,KAAKd,oBAAoB;GAC5B;EACF;CACF;AACF"}

package/out/zql/src/ivm/maybe-split-and-push-edit-change.d.ts

@@ -6,5 +6,5 @@ import type { InputBase, Output } from './operator.ts';
  * should be present based on the row's data. It then splits the change and
  * pushes the appropriate changes to the output based on the predicate.
  */
-export declare function maybeSplitAndPushEditChange(change: EditChange, predicate: (row: Row) => boolean, output: Output, pusher: InputBase): Generator<"yield", void, any>;
+export declare function maybeSplitAndPushEditChange(change: EditChange, predicate: (row: Row) => boolean, output: Output, pusher: InputBase): import("./stream.ts").Stream<"yield">;
 //# sourceMappingURL=maybe-split-and-push-edit-change.d.ts.map

package/out/zql/src/ivm/maybe-split-and-push-edit-change.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"maybe-split-and-push-edit-change.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/maybe-split-and-push-edit-change.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,oCAAoC,CAAC;AAE5D,OAAO,EAAkC,KAAK,UAAU,EAAC,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAC,SAAS,EAAE,MAAM,EAAC,MAAM,eAAe,CAAC;AAErD;;;;GAIG;AACH,wBAAiB,2BAA2B,CAC1C,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,EAChC,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,SAAS,iCAYlB"}
+{"version":3,"file":"maybe-split-and-push-edit-change.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/maybe-split-and-push-edit-change.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,oCAAoC,CAAC;AAE5D,OAAO,EAAkC,KAAK,UAAU,EAAC,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAC,SAAS,EAAE,MAAM,EAAC,MAAM,eAAe,CAAC;AAErD;;;;GAIG;AACH,wBAAgB,2BAA2B,CACzC,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,EAChC,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,SAAS,yCAgBlB"}

package/out/zql/src/ivm/maybe-split-and-push-edit-change.js

@@ -1,3 +1,4 @@
+import { emptyArray } from "../../../shared/src/sentinels.js";
 import { makeAddChange, makeRemoveChange } from "./change.js";
 //#region ../zql/src/ivm/maybe-split-and-push-edit-change.ts
 /**
@@ -5,12 +6,13 @@ import { makeAddChange, makeRemoveChange } from "./change.js";
 * should be present based on the row's data. It then splits the change and
 * pushes the appropriate changes to the output based on the predicate.
 */
-function* maybeSplitAndPushEditChange(change, predicate, output, pusher) {
+function maybeSplitAndPushEditChange(change, predicate, output, pusher) {
 	const oldWasPresent = predicate(change[2].row);
 	const newIsPresent = predicate(change[1].row);
-	if (oldWasPresent && newIsPresent) yield* output.push(change, pusher);
-	else if (oldWasPresent && !newIsPresent) yield* output.push(makeRemoveChange(change[2]), pusher);
-	else if (!oldWasPresent && newIsPresent) yield* output.push(makeAddChange(change[1]), pusher);
+	if (oldWasPresent && newIsPresent) return output.push(change, pusher);
+	if (oldWasPresent && !newIsPresent) return output.push(makeRemoveChange(change[2]), pusher);
+	if (!oldWasPresent && newIsPresent) return output.push(makeAddChange(change[1]), pusher);
+	return emptyArray;
 }
 //#endregion
 export { maybeSplitAndPushEditChange };

package/out/zql/src/ivm/maybe-split-and-push-edit-change.js.map

@@ -1 +1 @@
-{"version":3,"file":"maybe-split-and-push-edit-change.js","names":[],"sources":["../../../../../zql/src/ivm/maybe-split-and-push-edit-change.ts"],"sourcesContent":["import type {Row} from '../../../zero-protocol/src/data.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {makeAddChange, makeRemoveChange, type EditChange} from './change.ts';\nimport type {InputBase, Output} from './operator.ts';\n\n/**\n * This takes an {@linkcode EditChange} and a predicate that determines if a row\n * should be present based on the row's data. It then splits the change and\n * pushes the appropriate changes to the output based on the predicate.\n */\nexport function* maybeSplitAndPushEditChange(\n  change: EditChange,\n  predicate: (row: Row) => boolean,\n  output: Output,\n  pusher: InputBase,\n) {\n  const oldWasPresent = predicate(change[ChangeIndex.OLD_NODE].row);\n  const newIsPresent = predicate(change[ChangeIndex.NODE].row);\n\n  if (oldWasPresent && newIsPresent) {\n    yield* output.push(change, pusher);\n  } else if (oldWasPresent && !newIsPresent) {\n    yield* output.push(makeRemoveChange(change[ChangeIndex.OLD_NODE]), pusher);\n  } else if (!oldWasPresent && newIsPresent) {\n    yield* output.push(makeAddChange(change[ChangeIndex.NODE]), pusher);\n  }\n}\n"],"mappings":";;;;;;;AAUA,UAAiB,4BACf,QACA,WACA,QACA,QACA;CACA,MAAM,gBAAgB,UAAU,OAAO,GAAsB,GAAG;CAChE,MAAM,eAAe,UAAU,OAAO,GAAkB,GAAG;CAE3D,IAAI,iBAAiB,cACnB,OAAO,OAAO,KAAK,QAAQ,MAAM;MAC5B,IAAI,iBAAiB,CAAC,cAC3B,OAAO,OAAO,KAAK,iBAAiB,OAAO,EAAqB,GAAG,MAAM;MACpE,IAAI,CAAC,iBAAiB,cAC3B,OAAO,OAAO,KAAK,cAAc,OAAO,EAAiB,GAAG,MAAM;AAEtE"}
+{"version":3,"file":"maybe-split-and-push-edit-change.js","names":[],"sources":["../../../../../zql/src/ivm/maybe-split-and-push-edit-change.ts"],"sourcesContent":["import {emptyArray} from '../../../shared/src/sentinels.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {makeAddChange, makeRemoveChange, type EditChange} from './change.ts';\nimport type {InputBase, Output} from './operator.ts';\n\n/**\n * This takes an {@linkcode EditChange} and a predicate that determines if a row\n * should be present based on the row's data. It then splits the change and\n * pushes the appropriate changes to the output based on the predicate.\n */\nexport function maybeSplitAndPushEditChange(\n  change: EditChange,\n  predicate: (row: Row) => boolean,\n  output: Output,\n  pusher: InputBase,\n) {\n  const oldWasPresent = predicate(change[ChangeIndex.OLD_NODE].row);\n  const newIsPresent = predicate(change[ChangeIndex.NODE].row);\n\n  if (oldWasPresent && newIsPresent) {\n    return output.push(change, pusher);\n  }\n  if (oldWasPresent && !newIsPresent) {\n    return output.push(makeRemoveChange(change[ChangeIndex.OLD_NODE]), pusher);\n  }\n  if (!oldWasPresent && newIsPresent) {\n    return output.push(makeAddChange(change[ChangeIndex.NODE]), pusher);\n  }\n\n  return emptyArray;\n}\n"],"mappings":";;;;;;;;AAWA,SAAgB,4BACd,QACA,WACA,QACA,QACA;CACA,MAAM,gBAAgB,UAAU,OAAO,GAAsB,GAAG;CAChE,MAAM,eAAe,UAAU,OAAO,GAAkB,GAAG;CAE3D,IAAI,iBAAiB,cACnB,OAAO,OAAO,KAAK,QAAQ,MAAM;CAEnC,IAAI,iBAAiB,CAAC,cACpB,OAAO,OAAO,KAAK,iBAAiB,OAAO,EAAqB,GAAG,MAAM;CAE3E,IAAI,CAAC,iBAAiB,cACpB,OAAO,OAAO,KAAK,cAAc,OAAO,EAAiB,GAAG,MAAM;CAGpE,OAAO;AACT"}

package/out/zql/src/ivm/memory-source.d.ts

@@ -9,7 +9,7 @@ import { type Constraint } from './constraint.ts';
 import { type Comparator, type Node } from './data.ts';
 import { type Input, type MultiConstraint, type Output, type Start } from './operator.ts';
 import type { Source, SourceChange, SourceInput } from './source.ts';
-import type { Stream } from './stream.ts';
+import { type Stream } from './stream.ts';
 export type Overlay = {
     epoch: number;
     change: SourceChange;
@@ -50,10 +50,22 @@ export declare class MemorySource implements Source {
     get data(): BTreeSet<Row>;
     connect(sort: Ordering | undefined, filters?: Condition, splitEditKeys?: Set<string>): SourceInput;
     getIndexKeys(): string[];
+    /**
+     * Pushes an add for each of `rows`.
+     *
+     * When the source holds no rows and nothing is connected to it (loading the
+     * replica at startup) there is no output to notify and no secondary index to
+     * keep in step, so the primary index is built bottom-up in O(N) (plus a sort
+     * when `rows` are not already in primary key order) rather than doing one
+     * tree insert, and one trip through the push machinery, per row.
+     *
+     * `rows` may be sorted in place. Rows must have distinct primary keys.
+     */
+    pushAdds(rows: Row[]): void;
     push(change: SourceChange): Stream<'yield'>;
     genPush(change: SourceChange): Generator<"yield" | undefined, void, unknown>;
 }
-export declare function genPushAndWriteWithSplitEdit(connections: readonly Connection[], change: SourceChange, exists: (row: Row) => boolean, setOverlay: (o: Overlay | undefined) => Overlay | undefined, writeChange: (c: SourceChange) => void, getNextEpoch: () => number): Generator<"yield" | undefined, void, unknown>;
+export declare function genPushAndWriteWithSplitEdit(connections: readonly Connection[], change: SourceChange, exists: ((row: Row) => boolean) | undefined, setOverlay: (o: Overlay | undefined) => Overlay | undefined, writeChange: (c: SourceChange) => void, getNextEpoch: () => number): Generator<"yield" | undefined, void, unknown>;
 export declare function generateWithStart(nodes: Iterable<Node | 'yield'>, start: Start | undefined, compare: (r1: Row, r2: Row) => number): Stream<Node | 'yield'>;
 /**
  * Takes an iterator and overlay.
@@ -75,7 +87,7 @@ export declare function generateWithStart(nodes: Iterable<Node | 'yield'>, start
  * is what #4926 fixed for `generateWithStart`; this parameter is the same
  * distinction for the overlay's own `startAt` pruning.
  */
-export declare function generateWithOverlay(startAt: Row | undefined, rows: Iterable<Row>, constraint: Constraint | undefined, overlay: Overlay | undefined, lastPushedEpoch: number, compare: Comparator, startAtCompare: Comparator, filterPredicate?: (row: Row) => boolean | undefined, multiConstraints?: readonly MultiConstraint[] | undefined): Generator<{
+export declare function generateWithOverlay(startAt: Row | undefined, rows: Iterable<Row>, constraint: Constraint | undefined, overlay: Overlay | undefined, lastPushedEpoch: number, compare: Comparator, startAtCompare: Comparator, filterPredicate?: (row: Row) => boolean | undefined, multiConstraints?: readonly MultiConstraint[]): Generator<{
     row: Readonly<Record<string, Value>>;
     relationships: {};
 }, void, unknown>;
@@ -94,7 +106,7 @@ export declare function generateWithOverlayInner(rowIterator: Iterable<Row>, ove
  * No `startAt` or comparator needed. Injects remove/old-edit rows eagerly
  * at the start, and suppresses add/new-edit rows inline by PK match.
  */
-export declare function generateWithOverlayUnordered(rows: Iterable<Row>, constraint: Constraint | undefined, overlay: Overlay | undefined, lastPushedEpoch: number, primaryKey: PrimaryKey, filterPredicate?: (row: Row) => boolean, multiConstraints?: readonly MultiConstraint[] | undefined): Generator<{
+export declare function generateWithOverlayUnordered(rows: Iterable<Row>, constraint: Constraint | undefined, overlay: Overlay | undefined, lastPushedEpoch: number, primaryKey: PrimaryKey, filterPredicate?: (row: Row) => boolean, multiConstraints?: readonly MultiConstraint[]): Generator<{
     row: Readonly<Record<string, Value>>;
     relationships: {};
 }, void, unknown>;
@@ -102,6 +114,19 @@ export declare function generateWithOverlayInnerUnordered(rowIterator: Iterable<
     row: Readonly<Record<string, Value>>;
     relationships: {};
 }, void, unknown>;
+/**
+ * A location to begin scanning an index from. Can either be a specific value
+ * or the min or max possible value for the type. This is used to start a scan
+ * at the beginning of the rows matching a constraint.
+ */
+export type Bound = Value | MinValue | MaxValue;
+export type RowBound = Record<string, Bound>;
+export declare const minValue: unique symbol;
+type MinValue = typeof minValue;
+export declare const maxValue: unique symbol;
+type MaxValue = typeof maxValue;
+export declare function makeBoundComparator(sort: Ordering): Comparator;
+export declare function generateRows(data: BTreeSet<Row>, scanStart: RowBound | undefined, reverse: boolean | undefined): IterableIterator<Readonly<Record<string, Value>>>;
 export declare function stringify(change: SourceChange): string;
 /**
  * N-way merge of pre-sorted Node streams. Each input stream must yield

package/out/zql/src/ivm/memory-source.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"memory-source.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/memory-source.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,QAAQ,EAAC,MAAM,kCAAkC,CAAC;AAI1D,OAAO,KAAK,EACV,SAAS,EACT,QAAQ,EAET,MAAM,mCAAmC,CAAC;AAC3C,OAAO,KAAK,EAAC,GAAG,EAAE,KAAK,EAAC,MAAM,oCAAoC,CAAC;AACnE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,2CAA2C,CAAC;AAC1E,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,yCAAyC,CAAC;AACzE,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAGL,KAAK,mBAAmB,EACzB,MAAM,sBAAsB,CAAC;AAK9B,OAAO,EAIL,KAAK,UAAU,EAChB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAIL,KAAK,UAAU,EACf,KAAK,IAAI,EACV,MAAM,WAAW,CAAC;AAEnB,OAAO,EAGL,KAAK,KAAK,EACV,KAAK,eAAe,EACpB,KAAK,MAAM,EACX,KAAK,KAAK,EACX,MAAM,eAAe,CAAC;AAGvB,OAAO,KAAK,EACV,MAAM,EACN,YAAY,EAIZ,WAAW,EACZ,MAAM,aAAa,CAAC;AAErB,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AAExC,MAAM,MAAM,OAAO,GAAG;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,YAAY,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,QAAQ,GAAG;IACrB,GAAG,EAAE,GAAG,GAAG,SAAS,CAAC;IACrB,MAAM,EAAE,GAAG,GAAG,SAAS,CAAC;CACzB,CAAC;AAOF,MAAM,MAAM,UAAU,GAAG;IACvB,KAAK,EAAE,KAAK,CAAC;IACb,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,IAAI,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAC;IAC5B,aAAa,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;IACvC,WAAW,EAAE,UAAU,CAAC;IACxB,OAAO,EACH;QACE,SAAS,EAAE,mBAAmB,CAAC;QAC/B,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,CAAC;KAClC,GACD,SAAS,CAAC;IACd,QAAQ,CAAC,KAAK,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IAC3C,eAAe,EAAE,MAAM,CAAC;CACzB,CAAC;AAEF;;;;;;GAMG;AACH,qBAAa,YAAa,YAAW,MAAM;;IAWzC,YACE,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACpC,UAAU,EAAE,UAAU,EACtB,gBAAgB,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,EAWjC;IAED,IAAI,WAAW;QAEX,IAAI;QACJ,OAAO;QACP,UAAU;MAEb;IAED,IAAI,iBAQH;IAED,IAAI,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,CAExB;IAeD,OAAO,CACL,IAAI,EAAE,QAAQ,GAAG,SAAS,EAC1B,OAAO,CAAC,EAAE,SAAS,EACnB,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAC1B,WAAW,CAqCb;IAwDD,YAAY,IAAI,MAAM,EAAE,CAEvB;IAmOA,IAAI,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,CAM3C;IAEA,OAAO,CAAC,MAAM,EAAE,YAAY,iDAc5B;CA0CF;AAoCD,wBAAiB,4BAA4B,CAC3C,WAAW,EAAE,SAAS,UAAU,EAAE,EAClC,MAAM,EAAE,YAAY,EACpB,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,EAC7B,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,GAAG,SAAS,KAAK,OAAO,GAAG,SAAS,EAC3D,WAAW,EAAE,CAAC,CAAC,EAAE,YAAY,KAAK,IAAI,EACtC,YAAY,EAAE,MAAM,MAAM,iDAgD3B;AA0ED,wBAAiB,iBAAiB,CAChC,KAAK,EAAE,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC,EAC/B,KAAK,EAAE,KAAK,GAAG,SAAS,EACxB,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,KAAK,MAAM,GACpC,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,CA0BxB;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAiB,mBAAmB,CAClC,OAAO,EAAE,GAAG,GAAG,SAAS,EACxB,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,EACnB,UAAU,EAAE,UAAU,GAAG,SAAS,EAClC,OAAO,EAAE,OAAO,GAAG,SAAS,EAC5B,eAAe,EAAE,MAAM,EACvB,OAAO,EAAE,UAAU,EACnB,cAAc,EAAE,UAAU,EAC1B,eAAe,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,GAAG,SAAS,EACnD,gBAAgB,CAAC,EAAE,SAAS,eAAe,EAAE,GAAG,SAAS;;;kBAe1D;AAmED,OAAO,EAAC,0BAA0B,IAAI,iCAAiC,EAAC,CAAC;AAEzE,iBAAS,0BAA0B,CACjC,EAAC,GAAG,EAAE,MAAM,EAAC,EAAE,QAAQ,EACvB,eAAe,EAAE,eAAe,GAC/B,QAAQ,CAYV;AAED,OAAO,EAAC,kBAAkB,IAAI,yBAAyB,EAAC,CAAC;AAEzD,iBAAS,kBAAkB,CACzB,EAAC,GAAG,EAAE,MAAM,EAAC,EAAE,QAAQ,EACvB,OAAO,EAAE,GAAG,EACZ,OAAO,EAAE,UAAU,GAClB,QAAQ,CAOV;AAED,OAAO,EAAC,qBAAqB,IAAI,4BAA4B,EAAC,CAAC;AAE/D,iBAAS,qBAAqB,CAC5B,EAAC,GAAG,EAAE,MAAM,EAAC,EAAE,QAAQ,EACvB,UAAU,EAAE,UAAU,GACrB,QAAQ,CAUV;AAeD,wBAAiB,wBAAwB,CACvC,WAAW,EAAE,QAAQ,CAAC,GAAG,CAAC,EAC1B,QAAQ,EAAE,QAAQ,EAClB,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,KAAK,MAAM;;;kBA0BtC;AAED;;;;GAIG;AACH,wBAAiB,4BAA4B,CAC3C,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,EACnB,UAAU,EAAE,UAAU,GAAG,SAAS,EAClC,OAAO,EAAE,OAAO,GAAG,SAAS,EAC5B,eAAe,EAAE,MAAM,EACvB,UAAU,EAAE,UAAU,EACtB,eAAe,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,EACvC,gBAAgB,CAAC,EAAE,SAAS,eAAe,EAAE,GAAG,SAAS;;;kBAmC1D;AAED,wBAAiB,iCAAiC,CAChD,WAAW,EAAE,QAAQ,CAAC,GAAG,CAAC,EAC1B,QAAQ,EAAE,QAAQ,EAClB,UAAU,EAAE,UAAU;;;kBAmBvB;AA4ED,wBAAgB,SAAS,CAAC,MAAM,EAAE,YAAY,UAI7C;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAiB,kBAAkB,CACjC,OAAO,EAAE,SAAS,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,EAAE,EAC1C,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,KAAK,MAAM,GACpC,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,CAuGxB"}
+{"version":3,"file":"memory-source.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/memory-source.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,QAAQ,EAAC,MAAM,kCAAkC,CAAC;AAI1D,OAAO,KAAK,EACV,SAAS,EACT,QAAQ,EAET,MAAM,mCAAmC,CAAC;AAC3C,OAAO,KAAK,EAAC,GAAG,EAAE,KAAK,EAAC,MAAM,oCAAoC,CAAC;AACnE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,2CAA2C,CAAC;AAC1E,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,yCAAyC,CAAC;AACzE,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAGL,KAAK,mBAAmB,EACzB,MAAM,sBAAsB,CAAC;AAK9B,OAAO,EAIL,KAAK,UAAU,EAChB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAIL,KAAK,UAAU,EACf,KAAK,IAAI,EACV,MAAM,WAAW,CAAC;AAEnB,OAAO,EAGL,KAAK,KAAK,EACV,KAAK,eAAe,EACpB,KAAK,MAAM,EACX,KAAK,KAAK,EACX,MAAM,eAAe,CAAC;AAGvB,OAAO,KAAK,EACV,MAAM,EACN,YAAY,EAIZ,WAAW,EACZ,MAAM,aAAa,CAAC;AAErB,OAAO,EAAU,KAAK,MAAM,EAAC,MAAM,aAAa,CAAC;AAEjD,MAAM,MAAM,OAAO,GAAG;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,YAAY,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,QAAQ,GAAG;IACrB,GAAG,EAAE,GAAG,GAAG,SAAS,CAAC;IACrB,MAAM,EAAE,GAAG,GAAG,SAAS,CAAC;CACzB,CAAC;AAOF,MAAM,MAAM,UAAU,GAAG;IACvB,KAAK,EAAE,KAAK,CAAC;IACb,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;IAC3B,IAAI,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAC;IAC5B,aAAa,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;IACvC,WAAW,EAAE,UAAU,CAAC;IACxB,OAAO,EACH;QACE,SAAS,EAAE,mBAAmB,CAAC;QAC/B,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,CAAC;KAClC,GACD,SAAS,CAAC;IACd,QAAQ,CAAC,KAAK,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IAC3C,eAAe,EAAE,MAAM,CAAC;CACzB,CAAC;AAEF;;;;;;GAMG;AACH,qBAAa,YAAa,YAAW,MAAM;;IAWzC,YACE,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACpC,UAAU,EAAE,UAAU,EACtB,gBAAgB,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,EAWjC;IAED,IAAI,WAAW;QAEX,IAAI;QACJ,OAAO;QACP,UAAU;MAEb;IAED,IAAI,iBAQH;IAED,IAAI,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,CAExB;IAeD,OAAO,CACL,IAAI,EAAE,QAAQ,GAAG,SAAS,EAC1B,OAAO,CAAC,EAAE,SAAS,EACnB,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAC1B,WAAW,CAqCb;IAwDD,YAAY,IAAI,MAAM,EAAE,CAEvB;IAmOD;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,CAoB1B;IAEA,IAAI,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,CAM3C;IAED,OAAO,CAAC,MAAM,EAAE,YAAY,iDAc3B;CA0CF;AAoCD,wBAAiB,4BAA4B,CAC3C,WAAW,EAAE,SAAS,UAAU,EAAE,EAClC,MAAM,EAAE,YAAY,EACpB,MAAM,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,CAAC,GAAG,SAAS,EAC3C,UAAU,EAAE,CAAC,CAAC,EAAE,OAAO,GAAG,SAAS,KAAK,OAAO,GAAG,SAAS,EAC3D,WAAW,EAAE,CAAC,CAAC,EAAE,YAAY,KAAK,IAAI,EACtC,YAAY,EAAE,MAAM,MAAM,iDAgD3B;AAsFD,wBAAiB,iBAAiB,CAChC,KAAK,EAAE,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC,EAC/B,KAAK,EAAE,KAAK,GAAG,SAAS,EACxB,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,KAAK,MAAM,GACpC,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,CA0BxB;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,GAAG,GAAG,SAAS,EACxB,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,EACnB,UAAU,EAAE,UAAU,GAAG,SAAS,EAClC,OAAO,EAAE,OAAO,GAAG,SAAS,EAC5B,eAAe,EAAE,MAAM,EACvB,OAAO,EAAE,UAAU,EACnB,cAAc,EAAE,UAAU,EAC1B,eAAe,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,GAAG,SAAS,EACnD,gBAAgB,CAAC,EAAE,SAAS,eAAe,EAAE;;;kBAe9C;AAmED,OAAO,EAAC,0BAA0B,IAAI,iCAAiC,EAAC,CAAC;AAEzE,iBAAS,0BAA0B,CACjC,EAAC,GAAG,EAAE,MAAM,EAAC,EAAE,QAAQ,EACvB,eAAe,EAAE,eAAe,GAC/B,QAAQ,CAYV;AAED,OAAO,EAAC,kBAAkB,IAAI,yBAAyB,EAAC,CAAC;AAEzD,iBAAS,kBAAkB,CACzB,EAAC,GAAG,EAAE,MAAM,EAAC,EAAE,QAAQ,EACvB,OAAO,EAAE,GAAG,EACZ,OAAO,EAAE,UAAU,GAClB,QAAQ,CAOV;AAED,OAAO,EAAC,qBAAqB,IAAI,4BAA4B,EAAC,CAAC;AAE/D,iBAAS,qBAAqB,CAC5B,EAAC,GAAG,EAAE,MAAM,EAAC,EAAE,QAAQ,EACvB,UAAU,EAAE,UAAU,GACrB,QAAQ,CAUV;AAeD,wBAAiB,wBAAwB,CACvC,WAAW,EAAE,QAAQ,CAAC,GAAG,CAAC,EAC1B,QAAQ,EAAE,QAAQ,EAClB,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,KAAK,MAAM;;;kBA0BtC;AAED;;;;GAIG;AACH,wBAAgB,4BAA4B,CAC1C,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,EACnB,UAAU,EAAE,UAAU,GAAG,SAAS,EAClC,OAAO,EAAE,OAAO,GAAG,SAAS,EAC5B,eAAe,EAAE,MAAM,EACvB,UAAU,EAAE,UAAU,EACtB,eAAe,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,OAAO,EACvC,gBAAgB,CAAC,EAAE,SAAS,eAAe,EAAE;;;kBAmC9C;AAED,wBAAiB,iCAAiC,CAChD,WAAW,EAAE,QAAQ,CAAC,GAAG,CAAC,EAC1B,QAAQ,EAAE,QAAQ,EAClB,UAAU,EAAE,UAAU;;;kBAmBvB;AAWD;;;;GAIG;AACH,MAAM,MAAM,KAAK,GAAG,KAAK,GAAG,QAAQ,GAAG,QAAQ,CAAC;AAChD,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC7C,eAAO,MAAM,QAAQ,eAAsB,CAAC;AAC5C,KAAK,QAAQ,GAAG,OAAO,QAAQ,CAAC;AAChC,eAAO,MAAM,QAAQ,eAAsB,CAAC;AAC5C,KAAK,QAAQ,GAAG,OAAO,QAAQ,CAAC;AAWhC,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,QAAQ,GAAG,UAAU,CAwB9D;AAmBD,wBAAgB,YAAY,CAC1B,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,EACnB,SAAS,EAAE,QAAQ,GAAG,SAAS,EAC/B,OAAO,EAAE,OAAO,GAAG,SAAS,qDAK7B;AAED,wBAAgB,SAAS,CAAC,MAAM,EAAE,YAAY,UAI7C;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAiB,kBAAkB,CACjC,OAAO,EAAE,SAAS,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,EAAE,EAC1C,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,KAAK,MAAM,GACpC,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC,CAuGxB"}

package/out/zql/src/ivm/memory-source.js

@@ -4,6 +4,7 @@ import { once, toSorted } from "../../../shared/src/iterables.js";
 import { must } from "../../../shared/src/must.js";
 import { skipYields } from "./skip-yields.js";
 import { makeAddChange, makeEditChange, makeRemoveChange } from "./change.js";
+import { consume } from "./stream.js";
 import { assertOrderingIncludesPK } from "../query/complete-ordering.js";
 import { compareValues, makeComparator, valuesEqual } from "./data.js";
 import { filterPush } from "./filter-push.js";
@@ -208,15 +209,36 @@ var MemorySource = class MemorySource {
 			if (matchesAll) yield node;
 		}
 	}
+	/**
+	* Pushes an add for each of `rows`.
+	*
+	* When the source holds no rows and nothing is connected to it (loading the
+	* replica at startup) there is no output to notify and no secondary index to
+	* keep in step, so the primary index is built bottom-up in O(N) (plus a sort
+	* when `rows` are not already in primary key order) rather than doing one
+	* tree insert, and one trip through the push machinery, per row.
+	*
+	* `rows` may be sorted in place. Rows must have distinct primary keys.
+	*/
+	pushAdds(rows) {
+		const index = this.#getPrimaryIndex();
+		if (!(this.#connections.length === 0 && this.#indexes.size === 1 && index.data.size === 0)) {
+			for (const row of rows) consume(this.push(makeSourceChangeAdd(row)));
+			return;
+		}
+		const { comparator } = index;
+		if (!isAscending(rows, comparator)) rows.sort(comparator);
+		index.data = BTreeSet.fromSorted(comparator, rows);
+	}
 	*push(change) {
 		for (const result of this.genPush(change)) if (result === "yield") yield result;
 	}
-	*genPush(change) {
+	genPush(change) {
 		const { data } = this.#getPrimaryIndex();
 		const exists = (row) => data.has(row);
 		const setOverlay = (o) => this.#overlay = o;
 		const writeChange = (c) => this.#writeChange(c);
-		yield* genPushAndWriteWithSplitEdit(this.#connections, change, exists, setOverlay, writeChange, () => ++this.#pushEpoch);
+		return genPushAndWriteWithSplitEdit(this.#connections, change, exists, setOverlay, writeChange, () => ++this.#pushEpoch);
 	}
 	#writeChange(change) {
 		for (const { data } of this.#indexes.values()) switch (change[0]) {
@@ -269,7 +291,7 @@ function* genPushAndWrite(connections, change, exists, setOverlay, writeChange,
 	writeChange(change);
 }
 function* genPush(connections, change, exists, setOverlay, pushEpoch) {
-	switch (change[0]) {
+	if (exists) switch (change[0]) {
 		case 0:
 			assert(!exists(change[1]), () => `Row already exists ${stringify(change)}`);
 			break;
@@ -281,31 +303,41 @@ function* genPush(connections, change, exists, setOverlay, pushEpoch) {
 			break;
 		default: unreachable(change);
 	}
-	for (const conn of connections) {
-		const { output, filters, input } = conn;
-		if (output) {
-			conn.lastPushedEpoch = pushEpoch;
-			setOverlay({
-				epoch: pushEpoch,
-				change
-			});
-			yield* filterPush(change[0] === 2 ? makeEditChange({
-				row: change[1],
-				relationships: {}
-			}, {
-				row: change[2],
-				relationships: {}
-			}) : change[0] === 0 ? makeAddChange({
-				row: change[1],
-				relationships: {}
-			}) : makeRemoveChange({
-				row: change[1],
-				relationships: {}
-			}), output, input, filters?.predicate);
-			yield void 0;
+	setOverlay({
+		epoch: pushEpoch,
+		change
+	});
+	try {
+		for (const conn of connections) {
+			const { output, filters, input } = conn;
+			if (output) {
+				conn.lastPushedEpoch = pushEpoch;
+				yield* filterPush(change[0] === 2 ? makeEditChange({
+					row: change[1],
+					relationships: {}
+				}, {
+					row: change[2],
+					relationships: {}
+				}) : change[0] === 0 ? makeAddChange({
+					row: change[1],
+					relationships: {}
+				}) : makeRemoveChange({
+					row: change[1],
+					relationships: {}
+				}), output, input, filters?.predicate);
+				yield void 0;
+			}
+		}
+		for (const conn of connections) {
+			const { output, input } = conn;
+			if (output?.reconcile) {
+				yield* output.reconcile(input);
+				yield void 0;
+			}
 		}
+	} finally {
+		setOverlay(void 0);
 	}
-	setOverlay(void 0);
 }
 function* generateWithStart(nodes, start, compare) {
 	if (!start) {
@@ -348,10 +380,10 @@ function* generateWithStart(nodes, start, compare) {
 * is what #4926 fixed for `generateWithStart`; this parameter is the same
 * distinction for the overlay's own `startAt` pruning.
 */
-function* generateWithOverlay(startAt, rows, constraint, overlay, lastPushedEpoch, compare, startAtCompare, filterPredicate, multiConstraints) {
+function generateWithOverlay(startAt, rows, constraint, overlay, lastPushedEpoch, compare, startAtCompare, filterPredicate, multiConstraints) {
 	let overlayToApply = void 0;
 	if (overlay && lastPushedEpoch >= overlay.epoch) overlayToApply = overlay;
-	yield* generateWithOverlayInner(rows, computeOverlays(startAt, constraint, overlayToApply, startAtCompare, filterPredicate, multiConstraints), compare);
+	return generateWithOverlayInner(rows, computeOverlays(startAt, constraint, overlayToApply, startAtCompare, filterPredicate, multiConstraints), compare);
 }
 function computeOverlays(startAt, constraint, overlay, startAtCompare, filterPredicate, multiConstraints) {
 	let overlays = {
@@ -455,7 +487,7 @@ function* generateWithOverlayInner(rowIterator, overlays, compare) {
 * No `startAt` or comparator needed. Injects remove/old-edit rows eagerly
 * at the start, and suppresses add/new-edit rows inline by PK match.
 */
-function* generateWithOverlayUnordered(rows, constraint, overlay, lastPushedEpoch, primaryKey, filterPredicate, multiConstraints) {
+function generateWithOverlayUnordered(rows, constraint, overlay, lastPushedEpoch, primaryKey, filterPredicate, multiConstraints) {
 	let overlayToApply = void 0;
 	if (overlay && lastPushedEpoch >= overlay.epoch) overlayToApply = overlay;
 	let overlays = {
@@ -485,7 +517,7 @@ function* generateWithOverlayUnordered(rows, constraint, overlay, lastPushedEpoc
 	if (constraint) overlays = overlaysForConstraint(overlays, constraint);
 	overlays = applyMultiConstraintsToOverlays(overlays, multiConstraints);
 	if (filterPredicate) overlays = overlaysForFilterPredicate(overlays, filterPredicate);
-	yield* generateWithOverlayInnerUnordered(rows, overlays, primaryKey);
+	return generateWithOverlayInnerUnordered(rows, overlays, primaryKey);
 }
 function* generateWithOverlayInnerUnordered(rowIterator, overlays, primaryKey) {
 	if (overlays.add) yield {
@@ -510,6 +542,10 @@ function rowMatchesPK(a, b, primaryKey) {
 }
 var minValue = Symbol("min-value");
 var maxValue = Symbol("max-value");
+function isAscending(rows, comparator) {
+	for (let i = 1; i < rows.length; i++) if (comparator(rows[i - 1], rows[i]) > 0) return false;
+	return true;
+}
 function makeBoundComparator(sort) {
 	const len = sort.length;
 	const k0 = sort[0][0];
@@ -534,8 +570,8 @@ function compareBounds(a, b) {
 	if (typeof b === "symbol") return b === minValue ? 1 : -1;
 	return compareValues(a, b);
 }
-function* generateRows(data, scanStart, reverse) {
-	yield* data[reverse ? "valuesFromReversed" : "valuesFrom"](scanStart);
+function generateRows(data, scanStart, reverse) {
+	return reverse ? data.valuesFromReversed(scanStart) : data.valuesFrom(scanStart);
 }
 function stringify(change) {
 	return JSON.stringify(change, (_, v) => typeof v === "bigint" ? v.toString() : v);
@@ -560,7 +596,7 @@ function stringify(change) {
 */
 function* mergeSortedStreams(streams, compare) {
 	const iterators = streams.map((s) => s[Symbol.iterator]());
-	const active = new Array(iterators.length).fill(true);
+	const active = Array.from({ length: iterators.length }).fill(true);
 	const heap = [];
 	const siftUp = (start) => {
 		let i = start;
@@ -634,6 +670,6 @@ function* mergeSortedStreams(streams, compare) {
 	}
 }
 //#endregion
-export { MemorySource, genPushAndWriteWithSplitEdit, generateWithOverlay, generateWithOverlayUnordered, generateWithStart, mergeSortedStreams };
+export { MemorySource, genPushAndWriteWithSplitEdit, generateRows, generateWithOverlay, generateWithOverlayUnordered, generateWithStart, makeBoundComparator, maxValue, mergeSortedStreams, minValue };
 
 //# sourceMappingURL=memory-source.js.map