@rocicorp/zero 0.26.1 → 0.26.2-canary.1

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

@@ -1 +1 @@
-{"version":3,"file":"flipped-join.js","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 {emptyArray} from '../../../shared/src/sentinels.ts';\nimport type {CompoundKey, System} from '../../../zero-protocol/src/ast.ts';\nimport type {Value} from '../../../zero-protocol/src/data.ts';\nimport type {Change} from './change.ts';\nimport {constraintsAreCompatible} from './constraint.ts';\nimport type {Node} from './data.ts';\nimport {\n  buildJoinConstraint,\n  generateWithOverlayNoYield,\n  isJoinMatch,\n  rowEqualsForCompoundKey,\n  type JoinChangeOverlay,\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 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};\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\n  #output: Output = throwOutput;\n\n  #inprogressChildChange: JoinChangeOverlay | 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.#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  // TODO: When parentKey is the parent's primary key (or more\n  // generally when the parent cardinality is expected to be small) a different\n  // algorithm should be used:  For each child node, fetch all parent nodes\n  // eagerly and then sort using quicksort.\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?.change.type === 'remove') {\n      const removedNode = this.#inprogressChildChange.change.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    const parentIterators: Iterator<Node | 'yield'>[] = [];\n    let threw = false;\n    try {\n      for (const childNode of childNodes) {\n        // TODO: consider adding the ability to pass a set of\n        // ids to fetch, and have them applied to sqlite using IN.\n        const constraintFromChild = buildJoinConstraint(\n          childNode.row,\n          this.#childKey,\n          this.#parentKey,\n        );\n        if (\n          !constraintFromChild ||\n          (req.constraint &&\n            !constraintsAreCompatible(constraintFromChild, req.constraint))\n        ) {\n          parentIterators.push(emptyArray[Symbol.iterator]());\n        } else {\n          const stream = this.#parent.fetch({\n            ...req,\n            constraint: {\n              ...req.constraint,\n              ...constraintFromChild,\n            },\n          });\n          const iterator = stream[Symbol.iterator]();\n          parentIterators.push(iterator);\n        }\n      }\n      const nextParentNodes: (Node | null)[] = [];\n      for (let i = 0; i < parentIterators.length; i++) {\n        const iter = parentIterators[i];\n        let result = iter.next();\n        // yield yields when initializing\n        while (!result.done && result.value === 'yield') {\n          yield result.value;\n          result = iter.next();\n        }\n        nextParentNodes[i] = result.done ? null : (result.value as Node);\n      }\n\n      while (true) {\n        let minParentNode = null;\n        let minParentNodeChildIndexes: number[] = [];\n        for (let i = 0; i < nextParentNodes.length; i++) {\n          const parentNode = nextParentNodes[i];\n          if (parentNode === null) {\n            continue;\n          }\n          if (minParentNode === null) {\n            minParentNode = parentNode;\n            minParentNodeChildIndexes.push(i);\n          } else {\n            const compareResult =\n              this.#schema.compareRows(parentNode.row, minParentNode.row) *\n              (req.reverse ? -1 : 1);\n            if (compareResult === 0) {\n              minParentNodeChildIndexes.push(i);\n            } else if (compareResult < 0) {\n              minParentNode = parentNode;\n              minParentNodeChildIndexes = [i];\n            }\n          }\n        }\n        if (minParentNode === null) {\n          return;\n        }\n        const relatedChildNodes: Node[] = [];\n        for (const minParentNodeChildIndex of minParentNodeChildIndexes) {\n          relatedChildNodes.push(childNodes[minParentNodeChildIndex]);\n          const iter = parentIterators[minParentNodeChildIndex];\n          let result = iter.next();\n          // yield yields when advancing\n          while (!result.done && result.value === 'yield') {\n            yield result.value;\n            result = iter.next();\n          }\n          nextParentNodes[minParentNodeChildIndex] = result.done\n            ? null\n            : (result.value as Node);\n        }\n        let overlaidRelatedChildNodes = relatedChildNodes;\n        if (\n          this.#inprogressChildChange &&\n          this.#inprogressChildChange.position &&\n          isJoinMatch(\n            this.#inprogressChildChange.change.node.row,\n            this.#childKey,\n            minParentNode.row,\n            this.#parentKey,\n          )\n        ) {\n          const hasInprogressChildChangeBeenPushedForMinParentNode =\n            this.#parent\n              .getSchema()\n              .compareRows(\n                minParentNode.row,\n                this.#inprogressChildChange.position,\n              ) <= 0;\n          if (this.#inprogressChildChange.change.type === 'remove') {\n            if (hasInprogressChildChangeBeenPushedForMinParentNode) {\n              // Remove form relatedChildNodes since the removed child\n              // was inserted into childNodes above.\n              overlaidRelatedChildNodes = relatedChildNodes.filter(\n                n => n !== this.#inprogressChildChange?.change.node,\n              );\n            }\n          } else if (!hasInprogressChildChangeBeenPushedForMinParentNode) {\n            overlaidRelatedChildNodes = [\n              ...generateWithOverlayNoYield(\n                relatedChildNodes,\n                this.#inprogressChildChange.change,\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          yield {\n            ...minParentNode,\n            relationships: {\n              ...minParentNode.relationships,\n              [this.#relationshipName]: () => overlaidRelatedChildNodes,\n            },\n          };\n        }\n      }\n    } catch (e) {\n      threw = true;\n      for (const iter of parentIterators) {\n        try {\n          iter.throw?.(e);\n        } catch (_cleanupError) {\n          // error in the iter.throw cleanup,\n          // catch so other iterators are cleaned up\n        }\n      }\n      throw e;\n    } finally {\n      if (!threw) {\n        for (const iter of parentIterators) {\n          try {\n            iter.return?.();\n          } catch (_cleanupError) {\n            // error in the iter.return cleanup,\n            // catch so other iterators are cleaned up\n          }\n        }\n      }\n    }\n  }\n\n  *#pushChild(change: Change): Stream<'yield'> {\n    switch (change.type) {\n      case 'add':\n      case 'remove':\n        yield* this.#pushChildChange(change);\n        break;\n      case 'edit': {\n        assert(\n          rowEqualsForCompoundKey(\n            change.oldNode.row,\n            change.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 'child':\n        yield* this.#pushChildChange(change, true);\n        break;\n    }\n  }\n\n  *#pushChildChange(change: Change, exists?: boolean): Stream<'yield'> {\n    this.#inprogressChildChange = {\n      change,\n      position: undefined,\n    };\n    try {\n      const constraint = buildJoinConstraint(\n        change.node.row,\n        this.#childKey,\n        this.#parentKey,\n      );\n      const parentNodeStream = constraint\n        ? this.#parent.fetch({constraint})\n        : [];\n      for (const parentNode of parentNodeStream) {\n        if (parentNode === 'yield') {\n          yield 'yield';\n          continue;\n        }\n        this.#inprogressChildChange = {\n          change,\n          position: parentNode.row,\n        };\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        if (!exists) {\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.node.row) !== 0\n            ) {\n              exists = true;\n              break;\n            }\n          }\n        }\n        if (exists) {\n          yield* this.#output.push(\n            {\n              type: 'child',\n              node: {\n                ...parentNode,\n                relationships: {\n                  ...parentNode.relationships,\n                  [this.#relationshipName]: childNodeStream,\n                },\n              },\n              child: {\n                relationshipName: this.#relationshipName,\n                change,\n              },\n            },\n            this,\n          );\n        } else {\n          yield* this.#output.push(\n            {\n              ...change,\n              node: {\n                ...parentNode,\n                relationships: {\n                  ...parentNode.relationships,\n                  [this.#relationshipName]: () => [change.node],\n                },\n              },\n            },\n            this,\n          );\n        }\n      }\n    } finally {\n      this.#inprogressChildChange = undefined;\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.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.type) {\n      case 'add':\n      case 'remove':\n      case 'child': {\n        yield* this.#output.push(\n          {\n            ...change,\n            node: flip(change.node),\n          },\n          this,\n        );\n        break;\n      }\n      case 'edit': {\n        assert(\n          rowEqualsForCompoundKey(\n            change.oldNode.row,\n            change.node.row,\n            this.#parentKey,\n          ),\n          `Parent edit must not change relationship.`,\n        );\n        yield* this.#output.push(\n          {\n            type: 'edit',\n            oldNode: flip(change.oldNode),\n            node: flip(change.node),\n          },\n          this,\n        );\n        break;\n      }\n      default:\n        unreachable(change);\n    }\n  }\n}\n"],"names":["constraint"],"mappings":";;;;;;AA4CO,MAAM,YAA6B;AAAA,EAC/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,UAAkB;AAAA,EAElB;AAAA,EAEA,YAAY;AAAA,IACV;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA,GACO;AACP,WAAO,WAAW,OAAO,8CAA8C;AACvE;AAAA,MACE,UAAU,WAAW,SAAS;AAAA,MAC9B;AAAA,IAAA;AAEF,SAAK,UAAU;AACf,SAAK,SAAS;AACd,SAAK,aAAa;AAClB,SAAK,YAAY;AACjB,SAAK,oBAAoB;AAEzB,UAAM,eAAe,OAAO,UAAA;AAC5B,UAAM,cAAc,MAAM,UAAA;AAC1B,SAAK,UAAU;AAAA,MACb,GAAG;AAAA,MACH,eAAe;AAAA,QACb,GAAG,aAAa;AAAA,QAChB,CAAC,gBAAgB,GAAG;AAAA,UAClB,GAAG;AAAA,UACH,UAAU;AAAA,UACV;AAAA,QAAA;AAAA,MACF;AAAA,IACF;AAGF,WAAO,UAAU;AAAA,MACf,MAAM,CAAC,WAAmB,KAAK,YAAY,MAAM;AAAA,IAAA,CAClD;AACD,UAAM,UAAU;AAAA,MACd,MAAM,CAAC,WAAmB,KAAK,WAAW,MAAM;AAAA,IAAA,CACjD;AAAA,EACH;AAAA,EAEA,UAAgB;AACd,SAAK,OAAO,QAAA;AACZ,SAAK,QAAQ,QAAA;AAAA,EACf;AAAA,EAEA,UAAU,QAAsB;AAC9B,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,MAAM,KAA2C;AAGhD,UAAM,kBAAyC,CAAA;AAC/C,QAAI,qBAAqB;AACzB,QAAI,IAAI,YAAY;AAClB,iBAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAAI,UAAU,GAAG;AACzD,cAAM,QAAQ,KAAK,WAAW,QAAQ,GAAG;AACzC,YAAI,UAAU,IAAI;AAChB,+BAAqB;AACrB,0BAAgB,KAAK,UAAU,KAAK,CAAC,IAAI;AAAA,QAC3C;AAAA,MACF;AAAA,IACF;AAEA,UAAM,aAAqB,CAAA;AAC3B,eAAW,QAAQ,KAAK,OAAO;AAAA,MAC7B,qBAAqB,EAAC,YAAY,oBAAmB,CAAA;AAAA,IAAC,GACrD;AACD,UAAI,SAAS,SAAS;AACpB,cAAM;AACN;AAAA,MACF;AACA,iBAAW,KAAK,IAAI;AAAA,IACtB;AAUA,QAAI,KAAK,wBAAwB,OAAO,SAAS,UAAU;AACzD,YAAM,cAAc,KAAK,uBAAuB,OAAO;AACvD,YAAM,UAAU,KAAK,OAAO,UAAA,EAAY;AACxC,YAAM,YAAY;AAAA,QAAa,WAAW;AAAA,QAAQ,OAChD,QAAQ,YAAY,KAAK,WAAW,CAAC,EAAE,GAAG;AAAA,MAAA;AAE5C,iBAAW,OAAO,WAAW,GAAG,WAAW;AAAA,IAC7C;AACA,UAAM,kBAA8C,CAAA;AACpD,QAAI,QAAQ;AACZ,QAAI;AACF,iBAAW,aAAa,YAAY;AAGlC,cAAM,sBAAsB;AAAA,UAC1B,UAAU;AAAA,UACV,KAAK;AAAA,UACL,KAAK;AAAA,QAAA;AAEP,YACE,CAAC,uBACA,IAAI,cACH,CAAC,yBAAyB,qBAAqB,IAAI,UAAU,GAC/D;AACA,0BAAgB,KAAK,WAAW,OAAO,QAAQ,GAAG;AAAA,QACpD,OAAO;AACL,gBAAM,SAAS,KAAK,QAAQ,MAAM;AAAA,YAChC,GAAG;AAAA,YACH,YAAY;AAAA,cACV,GAAG,IAAI;AAAA,cACP,GAAG;AAAA,YAAA;AAAA,UACL,CACD;AACD,gBAAM,WAAW,OAAO,OAAO,QAAQ,EAAA;AACvC,0BAAgB,KAAK,QAAQ;AAAA,QAC/B;AAAA,MACF;AACA,YAAM,kBAAmC,CAAA;AACzC,eAAS,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;AAC/C,cAAM,OAAO,gBAAgB,CAAC;AAC9B,YAAI,SAAS,KAAK,KAAA;AAElB,eAAO,CAAC,OAAO,QAAQ,OAAO,UAAU,SAAS;AAC/C,gBAAM,OAAO;AACb,mBAAS,KAAK,KAAA;AAAA,QAChB;AACA,wBAAgB,CAAC,IAAI,OAAO,OAAO,OAAQ,OAAO;AAAA,MACpD;AAEA,aAAO,MAAM;AACX,YAAI,gBAAgB;AACpB,YAAI,4BAAsC,CAAA;AAC1C,iBAAS,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;AAC/C,gBAAM,aAAa,gBAAgB,CAAC;AACpC,cAAI,eAAe,MAAM;AACvB;AAAA,UACF;AACA,cAAI,kBAAkB,MAAM;AAC1B,4BAAgB;AAChB,sCAA0B,KAAK,CAAC;AAAA,UAClC,OAAO;AACL,kBAAM,gBACJ,KAAK,QAAQ,YAAY,WAAW,KAAK,cAAc,GAAG,KACzD,IAAI,UAAU,KAAK;AACtB,gBAAI,kBAAkB,GAAG;AACvB,wCAA0B,KAAK,CAAC;AAAA,YAClC,WAAW,gBAAgB,GAAG;AAC5B,8BAAgB;AAChB,0CAA4B,CAAC,CAAC;AAAA,YAChC;AAAA,UACF;AAAA,QACF;AACA,YAAI,kBAAkB,MAAM;AAC1B;AAAA,QACF;AACA,cAAM,oBAA4B,CAAA;AAClC,mBAAW,2BAA2B,2BAA2B;AAC/D,4BAAkB,KAAK,WAAW,uBAAuB,CAAC;AAC1D,gBAAM,OAAO,gBAAgB,uBAAuB;AACpD,cAAI,SAAS,KAAK,KAAA;AAElB,iBAAO,CAAC,OAAO,QAAQ,OAAO,UAAU,SAAS;AAC/C,kBAAM,OAAO;AACb,qBAAS,KAAK,KAAA;AAAA,UAChB;AACA,0BAAgB,uBAAuB,IAAI,OAAO,OAC9C,OACC,OAAO;AAAA,QACd;AACA,YAAI,4BAA4B;AAChC,YACE,KAAK,0BACL,KAAK,uBAAuB,YAC5B;AAAA,UACE,KAAK,uBAAuB,OAAO,KAAK;AAAA,UACxC,KAAK;AAAA,UACL,cAAc;AAAA,UACd,KAAK;AAAA,QAAA,GAEP;AACA,gBAAM,qDACJ,KAAK,QACF,UAAA,EACA;AAAA,YACC,cAAc;AAAA,YACd,KAAK,uBAAuB;AAAA,UAAA,KACzB;AACT,cAAI,KAAK,uBAAuB,OAAO,SAAS,UAAU;AACxD,gBAAI,oDAAoD;AAGtD,0CAA4B,kBAAkB;AAAA,gBAC5C,CAAA,MAAK,MAAM,KAAK,wBAAwB,OAAO;AAAA,cAAA;AAAA,YAEnD;AAAA,UACF,WAAW,CAAC,oDAAoD;AAC9D,wCAA4B;AAAA,cAC1B,GAAG;AAAA,gBACD;AAAA,gBACA,KAAK,uBAAuB;AAAA,gBAC5B,KAAK,OAAO,UAAA;AAAA,cAAU;AAAA,YACxB;AAAA,UAEJ;AAAA,QACF;AAGA,YAAI,0BAA0B,SAAS,GAAG;AACxC,gBAAM;AAAA,YACJ,GAAG;AAAA,YACH,eAAe;AAAA,cACb,GAAG,cAAc;AAAA,cACjB,CAAC,KAAK,iBAAiB,GAAG,MAAM;AAAA,YAAA;AAAA,UAClC;AAAA,QAEJ;AAAA,MACF;AAAA,IACF,SAAS,GAAG;AACV,cAAQ;AACR,iBAAW,QAAQ,iBAAiB;AAClC,YAAI;AACF,eAAK,QAAQ,CAAC;AAAA,QAChB,SAAS,eAAe;AAAA,QAGxB;AAAA,MACF;AACA,YAAM;AAAA,IACR,UAAA;AACE,UAAI,CAAC,OAAO;AACV,mBAAW,QAAQ,iBAAiB;AAClC,cAAI;AACF,iBAAK,SAAA;AAAA,UACP,SAAS,eAAe;AAAA,UAGxB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,CAAC,WAAW,QAAiC;AAC3C,YAAQ,OAAO,MAAA;AAAA,MACb,KAAK;AAAA,MACL,KAAK;AACH,eAAO,KAAK,iBAAiB,MAAM;AACnC;AAAA,MACF,KAAK,QAAQ;AACX;AAAA,UACE;AAAA,YACE,OAAO,QAAQ;AAAA,YACf,OAAO,KAAK;AAAA,YACZ,KAAK;AAAA,UAAA;AAAA,UAEP;AAAA,QAAA;AAEF,eAAO,KAAK,iBAAiB,QAAQ,IAAI;AACzC;AAAA,MACF;AAAA,MACA,KAAK;AACH,eAAO,KAAK,iBAAiB,QAAQ,IAAI;AACzC;AAAA,IAAA;AAAA,EAEN;AAAA,EAEA,CAAC,iBAAiB,QAAgB,QAAmC;AACnE,SAAK,yBAAyB;AAAA,MAC5B;AAAA,MACA,UAAU;AAAA,IAAA;AAEZ,QAAI;AACF,YAAM,aAAa;AAAA,QACjB,OAAO,KAAK;AAAA,QACZ,KAAK;AAAA,QACL,KAAK;AAAA,MAAA;AAEP,YAAM,mBAAmB,aACrB,KAAK,QAAQ,MAAM,EAAC,WAAA,CAAW,IAC/B,CAAA;AACJ,iBAAW,cAAc,kBAAkB;AACzC,YAAI,eAAe,SAAS;AAC1B,gBAAM;AACN;AAAA,QACF;AACA,aAAK,yBAAyB;AAAA,UAC5B;AAAA,UACA,UAAU,WAAW;AAAA,QAAA;AAEvB,cAAM,kBAAkB,MAAM;AAC5B,gBAAMA,cAAa;AAAA,YACjB,WAAW;AAAA,YACX,KAAK;AAAA,YACL,KAAK;AAAA,UAAA;AAEP,iBAAOA,cAAa,KAAK,OAAO,MAAM,EAAC,YAAAA,YAAAA,CAAW,IAAI,CAAA;AAAA,QACxD;AACA,YAAI,CAAC,QAAQ;AACX,qBAAW,aAAa,mBAAmB;AACzC,gBAAI,cAAc,SAAS;AACzB,oBAAM;AACN;AAAA,YACF;AACA,gBACE,KAAK,OACF,UAAA,EACA,YAAY,UAAU,KAAK,OAAO,KAAK,GAAG,MAAM,GACnD;AACA,uBAAS;AACT;AAAA,YACF;AAAA,UACF;AAAA,QACF;AACA,YAAI,QAAQ;AACV,iBAAO,KAAK,QAAQ;AAAA,YAClB;AAAA,cACE,MAAM;AAAA,cACN,MAAM;AAAA,gBACJ,GAAG;AAAA,gBACH,eAAe;AAAA,kBACb,GAAG,WAAW;AAAA,kBACd,CAAC,KAAK,iBAAiB,GAAG;AAAA,gBAAA;AAAA,cAC5B;AAAA,cAEF,OAAO;AAAA,gBACL,kBAAkB,KAAK;AAAA,gBACvB;AAAA,cAAA;AAAA,YACF;AAAA,YAEF;AAAA,UAAA;AAAA,QAEJ,OAAO;AACL,iBAAO,KAAK,QAAQ;AAAA,YAClB;AAAA,cACE,GAAG;AAAA,cACH,MAAM;AAAA,gBACJ,GAAG;AAAA,gBACH,eAAe;AAAA,kBACb,GAAG,WAAW;AAAA,kBACd,CAAC,KAAK,iBAAiB,GAAG,MAAM,CAAC,OAAO,IAAI;AAAA,gBAAA;AAAA,cAC9C;AAAA,YACF;AAAA,YAEF;AAAA,UAAA;AAAA,QAEJ;AAAA,MACF;AAAA,IACF,UAAA;AACE,WAAK,yBAAyB;AAAA,IAChC;AAAA,EACF;AAAA,EAEA,CAAC,YAAY,QAAiC;AAC5C,UAAM,kBAAkB,CAAC,SAAe,MAAM;AAC5C,YAAM,aAAa;AAAA,QACjB,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,MAAA;AAEP,aAAO,aAAa,KAAK,OAAO,MAAM,EAAC,WAAA,CAAW,IAAI,CAAA;AAAA,IACxD;AAEA,UAAM,OAAO,CAAC,UAAgB;AAAA,MAC5B,GAAG;AAAA,MACH,eAAe;AAAA,QACb,GAAG,KAAK;AAAA,QACR,CAAC,KAAK,iBAAiB,GAAG,gBAAgB,IAAI;AAAA,MAAA;AAAA,IAChD;AAIF,QAAI,kBAAkB;AACtB,eAAW,QAAQ,gBAAgB,OAAO,IAAI,KAAK;AACjD,UAAI,SAAS,SAAS;AACpB,cAAM;AACN;AAAA,MACF,OAAO;AACL,0BAAkB;AAClB;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,iBAAiB;AACpB;AAAA,IACF;AAEA,YAAQ,OAAO,MAAA;AAAA,MACb,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,SAAS;AACZ,eAAO,KAAK,QAAQ;AAAA,UAClB;AAAA,YACE,GAAG;AAAA,YACH,MAAM,KAAK,OAAO,IAAI;AAAA,UAAA;AAAA,UAExB;AAAA,QAAA;AAEF;AAAA,MACF;AAAA,MACA,KAAK,QAAQ;AACX;AAAA,UACE;AAAA,YACE,OAAO,QAAQ;AAAA,YACf,OAAO,KAAK;AAAA,YACZ,KAAK;AAAA,UAAA;AAAA,UAEP;AAAA,QAAA;AAEF,eAAO,KAAK,QAAQ;AAAA,UAClB;AAAA,YACE,MAAM;AAAA,YACN,SAAS,KAAK,OAAO,OAAO;AAAA,YAC5B,MAAM,KAAK,OAAO,IAAI;AAAA,UAAA;AAAA,UAExB;AAAA,QAAA;AAEF;AAAA,MACF;AAAA,MACA;AACE,oBAAkB;AAAA,IAAA;AAAA,EAExB;AACF;"}
+{"version":3,"file":"flipped-join.js","names":["#parent","#child","#parentKey","#childKey","#relationshipName","#schema","#pushParent","#pushChild","#output","#inprogressChildChange","#pushChildChange"],"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 {emptyArray} from '../../../shared/src/sentinels.ts';\nimport type {CompoundKey, System} from '../../../zero-protocol/src/ast.ts';\nimport type {Value} from '../../../zero-protocol/src/data.ts';\nimport type {Change} from './change.ts';\nimport {constraintsAreCompatible} from './constraint.ts';\nimport type {Node} from './data.ts';\nimport {\n  buildJoinConstraint,\n  generateWithOverlayNoYield,\n  isJoinMatch,\n  rowEqualsForCompoundKey,\n  type JoinChangeOverlay,\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 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};\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\n  #output: Output = throwOutput;\n\n  #inprogressChildChange: JoinChangeOverlay | 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.#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  // TODO: When parentKey is the parent's primary key (or more\n  // generally when the parent cardinality is expected to be small) a different\n  // algorithm should be used:  For each child node, fetch all parent nodes\n  // eagerly and then sort using quicksort.\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?.change.type === 'remove') {\n      const removedNode = this.#inprogressChildChange.change.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    const parentIterators: Iterator<Node | 'yield'>[] = [];\n    let threw = false;\n    try {\n      for (const childNode of childNodes) {\n        // TODO: consider adding the ability to pass a set of\n        // ids to fetch, and have them applied to sqlite using IN.\n        const constraintFromChild = buildJoinConstraint(\n          childNode.row,\n          this.#childKey,\n          this.#parentKey,\n        );\n        if (\n          !constraintFromChild ||\n          (req.constraint &&\n            !constraintsAreCompatible(constraintFromChild, req.constraint))\n        ) {\n          parentIterators.push(emptyArray[Symbol.iterator]());\n        } else {\n          const stream = this.#parent.fetch({\n            ...req,\n            constraint: {\n              ...req.constraint,\n              ...constraintFromChild,\n            },\n          });\n          const iterator = stream[Symbol.iterator]();\n          parentIterators.push(iterator);\n        }\n      }\n      const nextParentNodes: (Node | null)[] = [];\n      for (let i = 0; i < parentIterators.length; i++) {\n        const iter = parentIterators[i];\n        let result = iter.next();\n        // yield yields when initializing\n        while (!result.done && result.value === 'yield') {\n          yield result.value;\n          result = iter.next();\n        }\n        nextParentNodes[i] = result.done ? null : (result.value as Node);\n      }\n\n      while (true) {\n        let minParentNode = null;\n        let minParentNodeChildIndexes: number[] = [];\n        for (let i = 0; i < nextParentNodes.length; i++) {\n          const parentNode = nextParentNodes[i];\n          if (parentNode === null) {\n            continue;\n          }\n          if (minParentNode === null) {\n            minParentNode = parentNode;\n            minParentNodeChildIndexes.push(i);\n          } else {\n            const compareResult =\n              this.#schema.compareRows(parentNode.row, minParentNode.row) *\n              (req.reverse ? -1 : 1);\n            if (compareResult === 0) {\n              minParentNodeChildIndexes.push(i);\n            } else if (compareResult < 0) {\n              minParentNode = parentNode;\n              minParentNodeChildIndexes = [i];\n            }\n          }\n        }\n        if (minParentNode === null) {\n          return;\n        }\n        const relatedChildNodes: Node[] = [];\n        for (const minParentNodeChildIndex of minParentNodeChildIndexes) {\n          relatedChildNodes.push(childNodes[minParentNodeChildIndex]);\n          const iter = parentIterators[minParentNodeChildIndex];\n          let result = iter.next();\n          // yield yields when advancing\n          while (!result.done && result.value === 'yield') {\n            yield result.value;\n            result = iter.next();\n          }\n          nextParentNodes[minParentNodeChildIndex] = result.done\n            ? null\n            : (result.value as Node);\n        }\n        let overlaidRelatedChildNodes = relatedChildNodes;\n        if (\n          this.#inprogressChildChange &&\n          this.#inprogressChildChange.position &&\n          isJoinMatch(\n            this.#inprogressChildChange.change.node.row,\n            this.#childKey,\n            minParentNode.row,\n            this.#parentKey,\n          )\n        ) {\n          const hasInprogressChildChangeBeenPushedForMinParentNode =\n            this.#parent\n              .getSchema()\n              .compareRows(\n                minParentNode.row,\n                this.#inprogressChildChange.position,\n              ) <= 0;\n          if (this.#inprogressChildChange.change.type === 'remove') {\n            if (hasInprogressChildChangeBeenPushedForMinParentNode) {\n              // Remove form relatedChildNodes since the removed child\n              // was inserted into childNodes above.\n              overlaidRelatedChildNodes = relatedChildNodes.filter(\n                n => n !== this.#inprogressChildChange?.change.node,\n              );\n            }\n          } else if (!hasInprogressChildChangeBeenPushedForMinParentNode) {\n            overlaidRelatedChildNodes = [\n              ...generateWithOverlayNoYield(\n                relatedChildNodes,\n                this.#inprogressChildChange.change,\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          yield {\n            ...minParentNode,\n            relationships: {\n              ...minParentNode.relationships,\n              [this.#relationshipName]: () => overlaidRelatedChildNodes,\n            },\n          };\n        }\n      }\n    } catch (e) {\n      threw = true;\n      for (const iter of parentIterators) {\n        try {\n          iter.throw?.(e);\n        } catch (_cleanupError) {\n          // error in the iter.throw cleanup,\n          // catch so other iterators are cleaned up\n        }\n      }\n      throw e;\n    } finally {\n      if (!threw) {\n        for (const iter of parentIterators) {\n          try {\n            iter.return?.();\n          } catch (_cleanupError) {\n            // error in the iter.return cleanup,\n            // catch so other iterators are cleaned up\n          }\n        }\n      }\n    }\n  }\n\n  *#pushChild(change: Change): Stream<'yield'> {\n    switch (change.type) {\n      case 'add':\n      case 'remove':\n        yield* this.#pushChildChange(change);\n        break;\n      case 'edit': {\n        assert(\n          rowEqualsForCompoundKey(\n            change.oldNode.row,\n            change.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 'child':\n        yield* this.#pushChildChange(change, true);\n        break;\n    }\n  }\n\n  *#pushChildChange(change: Change, exists?: boolean): Stream<'yield'> {\n    this.#inprogressChildChange = {\n      change,\n      position: undefined,\n    };\n    try {\n      const constraint = buildJoinConstraint(\n        change.node.row,\n        this.#childKey,\n        this.#parentKey,\n      );\n      const parentNodeStream = constraint\n        ? this.#parent.fetch({constraint})\n        : [];\n      for (const parentNode of parentNodeStream) {\n        if (parentNode === 'yield') {\n          yield 'yield';\n          continue;\n        }\n        this.#inprogressChildChange = {\n          change,\n          position: parentNode.row,\n        };\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        if (!exists) {\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.node.row) !== 0\n            ) {\n              exists = true;\n              break;\n            }\n          }\n        }\n        if (exists) {\n          yield* this.#output.push(\n            {\n              type: 'child',\n              node: {\n                ...parentNode,\n                relationships: {\n                  ...parentNode.relationships,\n                  [this.#relationshipName]: childNodeStream,\n                },\n              },\n              child: {\n                relationshipName: this.#relationshipName,\n                change,\n              },\n            },\n            this,\n          );\n        } else {\n          yield* this.#output.push(\n            {\n              ...change,\n              node: {\n                ...parentNode,\n                relationships: {\n                  ...parentNode.relationships,\n                  [this.#relationshipName]: () => [change.node],\n                },\n              },\n            },\n            this,\n          );\n        }\n      }\n    } finally {\n      this.#inprogressChildChange = undefined;\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.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.type) {\n      case 'add':\n      case 'remove':\n      case 'child': {\n        yield* this.#output.push(\n          {\n            ...change,\n            node: flip(change.node),\n          },\n          this,\n        );\n        break;\n      }\n      case 'edit': {\n        assert(\n          rowEqualsForCompoundKey(\n            change.oldNode.row,\n            change.node.row,\n            this.#parentKey,\n          ),\n          `Parent edit must not change relationship.`,\n        );\n        yield* this.#output.push(\n          {\n            type: 'edit',\n            oldNode: flip(change.oldNode),\n            node: flip(change.node),\n          },\n          this,\n        );\n        break;\n      }\n      default:\n        unreachable(change);\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;AA4CA,IAAa,cAAb,MAA0C;CACxC;CACA;CACA;CACA;CACA;CACA;CAEA,UAAkB;CAElB;CAEA,YAAY,EACV,QACA,OACA,WACA,UACA,kBACA,QACA,UACO;AACP,SAAO,WAAW,OAAO,+CAA+C;AACxE,SACE,UAAU,WAAW,SAAS,QAC9B,wDACD;AACD,QAAA,SAAe;AACf,QAAA,QAAc;AACd,QAAA,YAAkB;AAClB,QAAA,WAAiB;AACjB,QAAA,mBAAyB;EAEzB,MAAM,eAAe,OAAO,WAAW;EACvC,MAAM,cAAc,MAAM,WAAW;AACrC,QAAA,SAAe;GACb,GAAG;GACH,eAAe;IACb,GAAG,aAAa;KACf,mBAAmB;KAClB,GAAG;KACH,UAAU;KACV;KACD;IACF;GACF;AAED,SAAO,UAAU,EACf,OAAO,WAAmB,MAAA,WAAiB,OAAO,EACnD,CAAC;AACF,QAAM,UAAU,EACd,OAAO,WAAmB,MAAA,UAAgB,OAAO,EAClD,CAAC;;CAGJ,UAAgB;AACd,QAAA,MAAY,SAAS;AACrB,QAAA,OAAa,SAAS;;CAGxB,UAAU,QAAsB;AAC9B,QAAA,SAAe;;CAGjB,YAA0B;AACxB,SAAO,MAAA;;CAOT,CAAC,MAAM,KAA2C;EAGhD,MAAM,kBAAyC,EAAE;EACjD,IAAI,qBAAqB;AACzB,MAAI,IAAI,WACN,MAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,IAAI,WAAW,EAAE;GACzD,MAAM,QAAQ,MAAA,UAAgB,QAAQ,IAAI;AAC1C,OAAI,UAAU,IAAI;AAChB,yBAAqB;AACrB,oBAAgB,MAAA,SAAe,UAAU;;;EAK/C,MAAM,aAAqB,EAAE;AAC7B,OAAK,MAAM,QAAQ,MAAA,MAAY,MAC7B,qBAAqB,EAAC,YAAY,iBAAgB,GAAG,EAAE,CACxD,EAAE;AACD,OAAI,SAAS,SAAS;AACpB,UAAM;AACN;;AAEF,cAAW,KAAK,KAAK;;AAWvB,MAAI,MAAA,uBAA6B,OAAO,SAAS,UAAU;GACzD,MAAM,cAAc,MAAA,sBAA4B,OAAO;GACvD,MAAM,UAAU,MAAA,MAAY,WAAW,CAAC;GACxC,MAAM,YAAY,aAAa,WAAW,SAAQ,MAChD,QAAQ,YAAY,KAAK,WAAW,GAAG,IAAI,CAC5C;AACD,cAAW,OAAO,WAAW,GAAG,YAAY;;EAE9C,MAAM,kBAA8C,EAAE;EACtD,IAAI,QAAQ;AACZ,MAAI;AACF,QAAK,MAAM,aAAa,YAAY;IAGlC,MAAM,sBAAsB,oBAC1B,UAAU,KACV,MAAA,UACA,MAAA,UACD;AACD,QACE,CAAC,uBACA,IAAI,cACH,CAAC,yBAAyB,qBAAqB,IAAI,WAAW,CAEhE,iBAAgB,KAAK,WAAW,OAAO,WAAW,CAAC;SAC9C;KAQL,MAAM,WAPS,MAAA,OAAa,MAAM;MAChC,GAAG;MACH,YAAY;OACV,GAAG,IAAI;OACP,GAAG;OACJ;MACF,CAAC,CACsB,OAAO,WAAW;AAC1C,qBAAgB,KAAK,SAAS;;;GAGlC,MAAM,kBAAmC,EAAE;AAC3C,QAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;IAC/C,MAAM,OAAO,gBAAgB;IAC7B,IAAI,SAAS,KAAK,MAAM;AAExB,WAAO,CAAC,OAAO,QAAQ,OAAO,UAAU,SAAS;AAC/C,WAAM,OAAO;AACb,cAAS,KAAK,MAAM;;AAEtB,oBAAgB,KAAK,OAAO,OAAO,OAAQ,OAAO;;AAGpD,UAAO,MAAM;IACX,IAAI,gBAAgB;IACpB,IAAI,4BAAsC,EAAE;AAC5C,SAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;KAC/C,MAAM,aAAa,gBAAgB;AACnC,SAAI,eAAe,KACjB;AAEF,SAAI,kBAAkB,MAAM;AAC1B,sBAAgB;AAChB,gCAA0B,KAAK,EAAE;YAC5B;MACL,MAAM,gBACJ,MAAA,OAAa,YAAY,WAAW,KAAK,cAAc,IAAI,IAC1D,IAAI,UAAU,KAAK;AACtB,UAAI,kBAAkB,EACpB,2BAA0B,KAAK,EAAE;eACxB,gBAAgB,GAAG;AAC5B,uBAAgB;AAChB,mCAA4B,CAAC,EAAE;;;;AAIrC,QAAI,kBAAkB,KACpB;IAEF,MAAM,oBAA4B,EAAE;AACpC,SAAK,MAAM,2BAA2B,2BAA2B;AAC/D,uBAAkB,KAAK,WAAW,yBAAyB;KAC3D,MAAM,OAAO,gBAAgB;KAC7B,IAAI,SAAS,KAAK,MAAM;AAExB,YAAO,CAAC,OAAO,QAAQ,OAAO,UAAU,SAAS;AAC/C,YAAM,OAAO;AACb,eAAS,KAAK,MAAM;;AAEtB,qBAAgB,2BAA2B,OAAO,OAC9C,OACC,OAAO;;IAEd,IAAI,4BAA4B;AAChC,QACE,MAAA,yBACA,MAAA,sBAA4B,YAC5B,YACE,MAAA,sBAA4B,OAAO,KAAK,KACxC,MAAA,UACA,cAAc,KACd,MAAA,UACD,EACD;KACA,MAAM,qDACJ,MAAA,OACG,WAAW,CACX,YACC,cAAc,KACd,MAAA,sBAA4B,SAC7B,IAAI;AACT,SAAI,MAAA,sBAA4B,OAAO,SAAS;UAC1C,mDAGF,6BAA4B,kBAAkB,QAC5C,MAAK,MAAM,MAAA,uBAA6B,OAAO,KAChD;gBAEM,CAAC,mDACV,6BAA4B,CAC1B,GAAG,2BACD,mBACA,MAAA,sBAA4B,QAC5B,MAAA,MAAY,WAAW,CACxB,CACF;;AAKL,QAAI,0BAA0B,SAAS,EACrC,OAAM;KACJ,GAAG;KACH,eAAe;MACb,GAAG,cAAc;OAChB,MAAA,yBAA+B;MACjC;KACF;;WAGE,GAAG;AACV,WAAQ;AACR,QAAK,MAAM,QAAQ,gBACjB,KAAI;AACF,SAAK,QAAQ,EAAE;YACR,eAAe;AAK1B,SAAM;YACE;AACR,OAAI,CAAC,MACH,MAAK,MAAM,QAAQ,gBACjB,KAAI;AACF,SAAK,UAAU;YACR,eAAe;;;CAShC,EAAA,UAAY,QAAiC;AAC3C,UAAQ,OAAO,MAAf;GACE,KAAK;GACL,KAAK;AACH,WAAO,MAAA,gBAAsB,OAAO;AACpC;GACF,KAAK;AACH,WACE,wBACE,OAAO,QAAQ,KACf,OAAO,KAAK,KACZ,MAAA,SACD,EACD,2CACD;AACD,WAAO,MAAA,gBAAsB,QAAQ,KAAK;AAC1C;GAEF,KAAK;AACH,WAAO,MAAA,gBAAsB,QAAQ,KAAK;AAC1C;;;CAIN,EAAA,gBAAkB,QAAgB,QAAmC;AACnE,QAAA,wBAA8B;GAC5B;GACA,UAAU,KAAA;GACX;AACD,MAAI;GACF,MAAM,aAAa,oBACjB,OAAO,KAAK,KACZ,MAAA,UACA,MAAA,UACD;GACD,MAAM,mBAAmB,aACrB,MAAA,OAAa,MAAM,EAAC,YAAW,CAAC,GAChC,EAAE;AACN,QAAK,MAAM,cAAc,kBAAkB;AACzC,QAAI,eAAe,SAAS;AAC1B,WAAM;AACN;;AAEF,UAAA,wBAA8B;KAC5B;KACA,UAAU,WAAW;KACtB;IACD,MAAM,wBAAwB;KAC5B,MAAM,aAAa,oBACjB,WAAW,KACX,MAAA,WACA,MAAA,SACD;AACD,YAAO,aAAa,MAAA,MAAY,MAAM,EAAC,YAAW,CAAC,GAAG,EAAE;;AAE1D,QAAI,CAAC,OACH,MAAK,MAAM,aAAa,iBAAiB,EAAE;AACzC,SAAI,cAAc,SAAS;AACzB,YAAM;AACN;;AAEF,SACE,MAAA,MACG,WAAW,CACX,YAAY,UAAU,KAAK,OAAO,KAAK,IAAI,KAAK,GACnD;AACA,eAAS;AACT;;;AAIN,QAAI,OACF,QAAO,MAAA,OAAa,KAClB;KACE,MAAM;KACN,MAAM;MACJ,GAAG;MACH,eAAe;OACb,GAAG,WAAW;QACb,MAAA,mBAAyB;OAC3B;MACF;KACD,OAAO;MACL,kBAAkB,MAAA;MAClB;MACD;KACF,EACD,KACD;QAED,QAAO,MAAA,OAAa,KAClB;KACE,GAAG;KACH,MAAM;MACJ,GAAG;MACH,eAAe;OACb,GAAG,WAAW;QACb,MAAA,yBAA+B,CAAC,OAAO,KAAK;OAC9C;MACF;KACF,EACD,KACD;;YAGG;AACR,SAAA,wBAA8B,KAAA;;;CAIlC,EAAA,WAAa,QAAiC;EAC5C,MAAM,mBAAmB,eAAqB;GAC5C,MAAM,aAAa,oBACjB,KAAK,KACL,MAAA,WACA,MAAA,SACD;AACD,UAAO,aAAa,MAAA,MAAY,MAAM,EAAC,YAAW,CAAC,GAAG,EAAE;;EAG1D,MAAM,QAAQ,UAAgB;GAC5B,GAAG;GACH,eAAe;IACb,GAAG,KAAK;KACP,MAAA,mBAAyB,gBAAgB,KAAK;IAChD;GACF;EAGD,IAAI,kBAAkB;AACtB,OAAK,MAAM,QAAQ,gBAAgB,OAAO,KAAK,EAAE,CAC/C,KAAI,SAAS,SAAS;AACpB,SAAM;AACN;SACK;AACL,qBAAkB;AAClB;;AAGJ,MAAI,CAAC,gBACH;AAGF,UAAQ,OAAO,MAAf;GACE,KAAK;GACL,KAAK;GACL,KAAK;AACH,WAAO,MAAA,OAAa,KAClB;KACE,GAAG;KACH,MAAM,KAAK,OAAO,KAAK;KACxB,EACD,KACD;AACD;GAEF,KAAK;AACH,WACE,wBACE,OAAO,QAAQ,KACf,OAAO,KAAK,KACZ,MAAA,UACD,EACD,4CACD;AACD,WAAO,MAAA,OAAa,KAClB;KACE,MAAM;KACN,SAAS,KAAK,OAAO,QAAQ;KAC7B,MAAM,KAAK,OAAO,KAAK;KACxB,EACD,KACD;AACD;GAEF,QACE,aAAY,OAAO"}

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

@@ -1,126 +1,96 @@
-import { compareValues, valuesEqual } from "./data.js";
 import { assert } from "../../../shared/src/asserts.js";
+import { compareValues, valuesEqual } from "./data.js";
+//#region ../zql/src/ivm/join-utils.ts
 function generateWithOverlayNoYield(stream, overlay, schema) {
-  return generateWithOverlay(stream, overlay, schema);
+	return generateWithOverlay(stream, overlay, schema);
 }
 function* generateWithOverlay(stream, overlay, schema) {
-  let applied = false;
-  let editOldApplied = false;
-  let editNewApplied = false;
-  for (const node of stream) {
-    if (node === "yield") {
-      yield node;
-      continue;
-    }
-    let yieldNode = true;
-    if (!applied) {
-      switch (overlay.type) {
-        case "add": {
-          if (schema.compareRows(overlay.node.row, node.row) === 0) {
-            applied = true;
-            yieldNode = false;
-          }
-          break;
-        }
-        case "remove": {
-          if (schema.compareRows(overlay.node.row, node.row) < 0) {
-            applied = true;
-            yield overlay.node;
-          }
-          break;
-        }
-        case "edit": {
-          if (!editOldApplied && schema.compareRows(overlay.oldNode.row, node.row) < 0) {
-            editOldApplied = true;
-            if (editNewApplied) {
-              applied = true;
-            }
-            yield overlay.oldNode;
-          }
-          if (!editNewApplied && schema.compareRows(overlay.node.row, node.row) === 0) {
-            editNewApplied = true;
-            if (editOldApplied) {
-              applied = true;
-            }
-            yieldNode = false;
-          }
-          break;
-        }
-        case "child": {
-          if (schema.compareRows(overlay.node.row, node.row) === 0) {
-            applied = true;
-            yield {
-              row: node.row,
-              relationships: {
-                ...node.relationships,
-                [overlay.child.relationshipName]: () => generateWithOverlay(
-                  node.relationships[overlay.child.relationshipName](),
-                  overlay.child.change,
-                  schema.relationships[overlay.child.relationshipName]
-                )
-              }
-            };
-            yieldNode = false;
-          }
-          break;
-        }
-      }
-    }
-    if (yieldNode) {
-      yield node;
-    }
-  }
-  if (!applied) {
-    if (overlay.type === "remove") {
-      applied = true;
-      yield overlay.node;
-    } else if (overlay.type === "edit") {
-      assert(
-        editNewApplied,
-        "edit overlay: new node must be applied before old node"
-      );
-      editOldApplied = true;
-      applied = true;
-      yield overlay.oldNode;
-    }
-  }
-  assert(
-    applied,
-    "overlayGenerator: overlay was never applied to any fetched node"
-  );
+	let applied = false;
+	let editOldApplied = false;
+	let editNewApplied = false;
+	for (const node of stream) {
+		if (node === "yield") {
+			yield node;
+			continue;
+		}
+		let yieldNode = true;
+		if (!applied) switch (overlay.type) {
+			case "add":
+				if (schema.compareRows(overlay.node.row, node.row) === 0) {
+					applied = true;
+					yieldNode = false;
+				}
+				break;
+			case "remove":
+				if (schema.compareRows(overlay.node.row, node.row) < 0) {
+					applied = true;
+					yield overlay.node;
+				}
+				break;
+			case "edit":
+				if (!editOldApplied && schema.compareRows(overlay.oldNode.row, node.row) < 0) {
+					editOldApplied = true;
+					if (editNewApplied) applied = true;
+					yield overlay.oldNode;
+				}
+				if (!editNewApplied && schema.compareRows(overlay.node.row, node.row) === 0) {
+					editNewApplied = true;
+					if (editOldApplied) applied = true;
+					yieldNode = false;
+				}
+				break;
+			case "child":
+				if (schema.compareRows(overlay.node.row, node.row) === 0) {
+					applied = true;
+					yield {
+						row: node.row,
+						relationships: {
+							...node.relationships,
+							[overlay.child.relationshipName]: () => generateWithOverlay(node.relationships[overlay.child.relationshipName](), overlay.child.change, schema.relationships[overlay.child.relationshipName])
+						}
+					};
+					yieldNode = false;
+				}
+				break;
+		}
+		if (yieldNode) yield node;
+	}
+	if (!applied) {
+		if (overlay.type === "remove") {
+			applied = true;
+			yield overlay.node;
+		} else if (overlay.type === "edit") {
+			assert(editNewApplied, "edit overlay: new node must be applied before old node");
+			editOldApplied = true;
+			applied = true;
+			yield overlay.oldNode;
+		}
+	}
+	assert(applied, "overlayGenerator: overlay was never applied to any fetched node");
 }
 function rowEqualsForCompoundKey(a, b, key) {
-  for (let i = 0; i < key.length; i++) {
-    if (compareValues(a[key[i]], b[key[i]]) !== 0) {
-      return false;
-    }
-  }
-  return true;
+	for (let i = 0; i < key.length; i++) if (compareValues(a[key[i]], b[key[i]]) !== 0) return false;
+	return true;
 }
 function isJoinMatch(parent, parentKey, child, childKey) {
-  for (let i = 0; i < parentKey.length; i++) {
-    if (!valuesEqual(parent[parentKey[i]], child[childKey[i]])) {
-      return false;
-    }
-  }
-  return true;
+	for (let i = 0; i < parentKey.length; i++) if (!valuesEqual(parent[parentKey[i]], child[childKey[i]])) return false;
+	return true;
 }
+/**
+* Builds a constraint object by mapping values from `sourceRow` using `sourceKey`
+* to keys specified by `targetKey`. Returns `undefined` if any source value is `null`,
+* since null foreign keys cannot match any rows.
+*/
 function buildJoinConstraint(sourceRow, sourceKey, targetKey) {
-  const constraint = {};
-  for (let i = 0; i < targetKey.length; i++) {
-    const value = sourceRow[sourceKey[i]];
-    if (value === null) {
-      return void 0;
-    }
-    constraint[targetKey[i]] = value;
-  }
-  return constraint;
+	const constraint = {};
+	for (let i = 0; i < targetKey.length; i++) {
+		const value = sourceRow[sourceKey[i]];
+		if (value === null) return;
+		constraint[targetKey[i]] = value;
+	}
+	return constraint;
 }
-export {
-  buildJoinConstraint,
-  generateWithOverlay,
-  generateWithOverlayNoYield,
-  isJoinMatch,
-  rowEqualsForCompoundKey
-};
-//# sourceMappingURL=join-utils.js.map
+//#endregion
+export { buildJoinConstraint, generateWithOverlay, generateWithOverlayNoYield, isJoinMatch, rowEqualsForCompoundKey };
+
+//# sourceMappingURL=join-utils.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"join-utils.js","sources":["../../../../../zql/src/ivm/join-utils.ts"],"sourcesContent":["import type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {Change} from './change.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Stream} from './stream.ts';\nimport {compareValues, valuesEqual, type Node} from './data.ts';\nimport {assert} from '../../../shared/src/asserts.ts';\nimport type {CompoundKey} from '../../../zero-protocol/src/ast.ts';\n\nexport type JoinChangeOverlay = {\n  change: Change;\n  position: Row | undefined;\n};\n\nexport function generateWithOverlayNoYield(\n  stream: Stream<Node>,\n  overlay: Change,\n  schema: SourceSchema,\n): Stream<Node> {\n  return generateWithOverlay(stream, overlay, schema) as Stream<Node>;\n}\n\nexport function* generateWithOverlay(\n  stream: Stream<Node | 'yield'>,\n  overlay: Change,\n  schema: SourceSchema,\n): Stream<Node | 'yield'> {\n  let applied = false;\n  let editOldApplied = false;\n  let editNewApplied = false;\n  for (const node of stream) {\n    if (node === 'yield') {\n      yield node;\n      continue;\n    }\n    let yieldNode = true;\n    if (!applied) {\n      switch (overlay.type) {\n        case 'add': {\n          if (schema.compareRows(overlay.node.row, node.row) === 0) {\n            applied = true;\n            yieldNode = false;\n          }\n          break;\n        }\n        case 'remove': {\n          if (schema.compareRows(overlay.node.row, node.row) < 0) {\n            applied = true;\n            yield overlay.node;\n          }\n          break;\n        }\n        case 'edit': {\n          if (\n            !editOldApplied &&\n            schema.compareRows(overlay.oldNode.row, node.row) < 0\n          ) {\n            editOldApplied = true;\n            if (editNewApplied) {\n              applied = true;\n            }\n            yield overlay.oldNode;\n          }\n          if (\n            !editNewApplied &&\n            schema.compareRows(overlay.node.row, node.row) === 0\n          ) {\n            editNewApplied = true;\n            if (editOldApplied) {\n              applied = true;\n            }\n            yieldNode = false;\n          }\n          break;\n        }\n        case 'child': {\n          if (schema.compareRows(overlay.node.row, node.row) === 0) {\n            applied = true;\n            yield {\n              row: node.row,\n              relationships: {\n                ...node.relationships,\n                [overlay.child.relationshipName]: () =>\n                  generateWithOverlay(\n                    node.relationships[overlay.child.relationshipName](),\n                    overlay.child.change,\n                    schema.relationships[overlay.child.relationshipName],\n                  ),\n              },\n            };\n            yieldNode = false;\n          }\n          break;\n        }\n      }\n    }\n    if (yieldNode) {\n      yield node;\n    }\n  }\n  if (!applied) {\n    if (overlay.type === 'remove') {\n      applied = true;\n      yield overlay.node;\n    } else if (overlay.type === 'edit') {\n      assert(\n        editNewApplied,\n        'edit overlay: new node must be applied before old node',\n      );\n      editOldApplied = true;\n      applied = true;\n      yield overlay.oldNode;\n    }\n  }\n\n  assert(\n    applied,\n    'overlayGenerator: overlay was never applied to any fetched node',\n  );\n}\n\nexport function rowEqualsForCompoundKey(\n  a: Row,\n  b: Row,\n  key: CompoundKey,\n): boolean {\n  for (let i = 0; i < key.length; i++) {\n    if (compareValues(a[key[i]], b[key[i]]) !== 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function isJoinMatch(\n  parent: Row,\n  parentKey: CompoundKey,\n  child: Row,\n  childKey: CompoundKey,\n) {\n  for (let i = 0; i < parentKey.length; i++) {\n    if (!valuesEqual(parent[parentKey[i]], child[childKey[i]])) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * Builds a constraint object by mapping values from `sourceRow` using `sourceKey`\n * to keys specified by `targetKey`. Returns `undefined` if any source value is `null`,\n * since null foreign keys cannot match any rows.\n */\nexport function buildJoinConstraint(\n  sourceRow: Row,\n  sourceKey: CompoundKey,\n  targetKey: CompoundKey,\n): Record<string, Value> | undefined {\n  const constraint: Record<string, Value> = {};\n  for (let i = 0; i < targetKey.length; i++) {\n    const value = sourceRow[sourceKey[i]];\n    if (value === null) {\n      return undefined;\n    }\n    constraint[targetKey[i]] = value;\n  }\n  return constraint;\n}\n"],"names":[],"mappings":";;AAaO,SAAS,2BACd,QACA,SACA,QACc;AACd,SAAO,oBAAoB,QAAQ,SAAS,MAAM;AACpD;AAEO,UAAU,oBACf,QACA,SACA,QACwB;AACxB,MAAI,UAAU;AACd,MAAI,iBAAiB;AACrB,MAAI,iBAAiB;AACrB,aAAW,QAAQ,QAAQ;AACzB,QAAI,SAAS,SAAS;AACpB,YAAM;AACN;AAAA,IACF;AACA,QAAI,YAAY;AAChB,QAAI,CAAC,SAAS;AACZ,cAAQ,QAAQ,MAAA;AAAA,QACd,KAAK,OAAO;AACV,cAAI,OAAO,YAAY,QAAQ,KAAK,KAAK,KAAK,GAAG,MAAM,GAAG;AACxD,sBAAU;AACV,wBAAY;AAAA,UACd;AACA;AAAA,QACF;AAAA,QACA,KAAK,UAAU;AACb,cAAI,OAAO,YAAY,QAAQ,KAAK,KAAK,KAAK,GAAG,IAAI,GAAG;AACtD,sBAAU;AACV,kBAAM,QAAQ;AAAA,UAChB;AACA;AAAA,QACF;AAAA,QACA,KAAK,QAAQ;AACX,cACE,CAAC,kBACD,OAAO,YAAY,QAAQ,QAAQ,KAAK,KAAK,GAAG,IAAI,GACpD;AACA,6BAAiB;AACjB,gBAAI,gBAAgB;AAClB,wBAAU;AAAA,YACZ;AACA,kBAAM,QAAQ;AAAA,UAChB;AACA,cACE,CAAC,kBACD,OAAO,YAAY,QAAQ,KAAK,KAAK,KAAK,GAAG,MAAM,GACnD;AACA,6BAAiB;AACjB,gBAAI,gBAAgB;AAClB,wBAAU;AAAA,YACZ;AACA,wBAAY;AAAA,UACd;AACA;AAAA,QACF;AAAA,QACA,KAAK,SAAS;AACZ,cAAI,OAAO,YAAY,QAAQ,KAAK,KAAK,KAAK,GAAG,MAAM,GAAG;AACxD,sBAAU;AACV,kBAAM;AAAA,cACJ,KAAK,KAAK;AAAA,cACV,eAAe;AAAA,gBACb,GAAG,KAAK;AAAA,gBACR,CAAC,QAAQ,MAAM,gBAAgB,GAAG,MAChC;AAAA,kBACE,KAAK,cAAc,QAAQ,MAAM,gBAAgB,EAAA;AAAA,kBACjD,QAAQ,MAAM;AAAA,kBACd,OAAO,cAAc,QAAQ,MAAM,gBAAgB;AAAA,gBAAA;AAAA,cACrD;AAAA,YACJ;AAEF,wBAAY;AAAA,UACd;AACA;AAAA,QACF;AAAA,MAAA;AAAA,IAEJ;AACA,QAAI,WAAW;AACb,YAAM;AAAA,IACR;AAAA,EACF;AACA,MAAI,CAAC,SAAS;AACZ,QAAI,QAAQ,SAAS,UAAU;AAC7B,gBAAU;AACV,YAAM,QAAQ;AAAA,IAChB,WAAW,QAAQ,SAAS,QAAQ;AAClC;AAAA,QACE;AAAA,QACA;AAAA,MAAA;AAEF,uBAAiB;AACjB,gBAAU;AACV,YAAM,QAAQ;AAAA,IAChB;AAAA,EACF;AAEA;AAAA,IACE;AAAA,IACA;AAAA,EAAA;AAEJ;AAEO,SAAS,wBACd,GACA,GACA,KACS;AACT,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,QAAI,cAAc,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,GAAG;AAC7C,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,YACd,QACA,WACA,OACA,UACA;AACA,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,QAAI,CAAC,YAAY,OAAO,UAAU,CAAC,CAAC,GAAG,MAAM,SAAS,CAAC,CAAC,CAAC,GAAG;AAC1D,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAOO,SAAS,oBACd,WACA,WACA,WACmC;AACnC,QAAM,aAAoC,CAAA;AAC1C,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,UAAM,QAAQ,UAAU,UAAU,CAAC,CAAC;AACpC,QAAI,UAAU,MAAM;AAClB,aAAO;AAAA,IACT;AACA,eAAW,UAAU,CAAC,CAAC,IAAI;AAAA,EAC7B;AACA,SAAO;AACT;"}
+{"version":3,"file":"join-utils.js","names":[],"sources":["../../../../../zql/src/ivm/join-utils.ts"],"sourcesContent":["import type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {Change} from './change.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Stream} from './stream.ts';\nimport {compareValues, valuesEqual, type Node} from './data.ts';\nimport {assert} from '../../../shared/src/asserts.ts';\nimport type {CompoundKey} from '../../../zero-protocol/src/ast.ts';\n\nexport type JoinChangeOverlay = {\n  change: Change;\n  position: Row | undefined;\n};\n\nexport function generateWithOverlayNoYield(\n  stream: Stream<Node>,\n  overlay: Change,\n  schema: SourceSchema,\n): Stream<Node> {\n  return generateWithOverlay(stream, overlay, schema) as Stream<Node>;\n}\n\nexport function* generateWithOverlay(\n  stream: Stream<Node | 'yield'>,\n  overlay: Change,\n  schema: SourceSchema,\n): Stream<Node | 'yield'> {\n  let applied = false;\n  let editOldApplied = false;\n  let editNewApplied = false;\n  for (const node of stream) {\n    if (node === 'yield') {\n      yield node;\n      continue;\n    }\n    let yieldNode = true;\n    if (!applied) {\n      switch (overlay.type) {\n        case 'add': {\n          if (schema.compareRows(overlay.node.row, node.row) === 0) {\n            applied = true;\n            yieldNode = false;\n          }\n          break;\n        }\n        case 'remove': {\n          if (schema.compareRows(overlay.node.row, node.row) < 0) {\n            applied = true;\n            yield overlay.node;\n          }\n          break;\n        }\n        case 'edit': {\n          if (\n            !editOldApplied &&\n            schema.compareRows(overlay.oldNode.row, node.row) < 0\n          ) {\n            editOldApplied = true;\n            if (editNewApplied) {\n              applied = true;\n            }\n            yield overlay.oldNode;\n          }\n          if (\n            !editNewApplied &&\n            schema.compareRows(overlay.node.row, node.row) === 0\n          ) {\n            editNewApplied = true;\n            if (editOldApplied) {\n              applied = true;\n            }\n            yieldNode = false;\n          }\n          break;\n        }\n        case 'child': {\n          if (schema.compareRows(overlay.node.row, node.row) === 0) {\n            applied = true;\n            yield {\n              row: node.row,\n              relationships: {\n                ...node.relationships,\n                [overlay.child.relationshipName]: () =>\n                  generateWithOverlay(\n                    node.relationships[overlay.child.relationshipName](),\n                    overlay.child.change,\n                    schema.relationships[overlay.child.relationshipName],\n                  ),\n              },\n            };\n            yieldNode = false;\n          }\n          break;\n        }\n      }\n    }\n    if (yieldNode) {\n      yield node;\n    }\n  }\n  if (!applied) {\n    if (overlay.type === 'remove') {\n      applied = true;\n      yield overlay.node;\n    } else if (overlay.type === 'edit') {\n      assert(\n        editNewApplied,\n        'edit overlay: new node must be applied before old node',\n      );\n      editOldApplied = true;\n      applied = true;\n      yield overlay.oldNode;\n    }\n  }\n\n  assert(\n    applied,\n    'overlayGenerator: overlay was never applied to any fetched node',\n  );\n}\n\nexport function rowEqualsForCompoundKey(\n  a: Row,\n  b: Row,\n  key: CompoundKey,\n): boolean {\n  for (let i = 0; i < key.length; i++) {\n    if (compareValues(a[key[i]], b[key[i]]) !== 0) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function isJoinMatch(\n  parent: Row,\n  parentKey: CompoundKey,\n  child: Row,\n  childKey: CompoundKey,\n) {\n  for (let i = 0; i < parentKey.length; i++) {\n    if (!valuesEqual(parent[parentKey[i]], child[childKey[i]])) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * Builds a constraint object by mapping values from `sourceRow` using `sourceKey`\n * to keys specified by `targetKey`. Returns `undefined` if any source value is `null`,\n * since null foreign keys cannot match any rows.\n */\nexport function buildJoinConstraint(\n  sourceRow: Row,\n  sourceKey: CompoundKey,\n  targetKey: CompoundKey,\n): Record<string, Value> | undefined {\n  const constraint: Record<string, Value> = {};\n  for (let i = 0; i < targetKey.length; i++) {\n    const value = sourceRow[sourceKey[i]];\n    if (value === null) {\n      return undefined;\n    }\n    constraint[targetKey[i]] = value;\n  }\n  return constraint;\n}\n"],"mappings":";;;AAaA,SAAgB,2BACd,QACA,SACA,QACc;AACd,QAAO,oBAAoB,QAAQ,SAAS,OAAO;;AAGrD,UAAiB,oBACf,QACA,SACA,QACwB;CACxB,IAAI,UAAU;CACd,IAAI,iBAAiB;CACrB,IAAI,iBAAiB;AACrB,MAAK,MAAM,QAAQ,QAAQ;AACzB,MAAI,SAAS,SAAS;AACpB,SAAM;AACN;;EAEF,IAAI,YAAY;AAChB,MAAI,CAAC,QACH,SAAQ,QAAQ,MAAhB;GACE,KAAK;AACH,QAAI,OAAO,YAAY,QAAQ,KAAK,KAAK,KAAK,IAAI,KAAK,GAAG;AACxD,eAAU;AACV,iBAAY;;AAEd;GAEF,KAAK;AACH,QAAI,OAAO,YAAY,QAAQ,KAAK,KAAK,KAAK,IAAI,GAAG,GAAG;AACtD,eAAU;AACV,WAAM,QAAQ;;AAEhB;GAEF,KAAK;AACH,QACE,CAAC,kBACD,OAAO,YAAY,QAAQ,QAAQ,KAAK,KAAK,IAAI,GAAG,GACpD;AACA,sBAAiB;AACjB,SAAI,eACF,WAAU;AAEZ,WAAM,QAAQ;;AAEhB,QACE,CAAC,kBACD,OAAO,YAAY,QAAQ,KAAK,KAAK,KAAK,IAAI,KAAK,GACnD;AACA,sBAAiB;AACjB,SAAI,eACF,WAAU;AAEZ,iBAAY;;AAEd;GAEF,KAAK;AACH,QAAI,OAAO,YAAY,QAAQ,KAAK,KAAK,KAAK,IAAI,KAAK,GAAG;AACxD,eAAU;AACV,WAAM;MACJ,KAAK,KAAK;MACV,eAAe;OACb,GAAG,KAAK;QACP,QAAQ,MAAM,yBACb,oBACE,KAAK,cAAc,QAAQ,MAAM,mBAAmB,EACpD,QAAQ,MAAM,QACd,OAAO,cAAc,QAAQ,MAAM,kBACpC;OACJ;MACF;AACD,iBAAY;;AAEd;;AAIN,MAAI,UACF,OAAM;;AAGV,KAAI,CAAC;MACC,QAAQ,SAAS,UAAU;AAC7B,aAAU;AACV,SAAM,QAAQ;aACL,QAAQ,SAAS,QAAQ;AAClC,UACE,gBACA,yDACD;AACD,oBAAiB;AACjB,aAAU;AACV,SAAM,QAAQ;;;AAIlB,QACE,SACA,kEACD;;AAGH,SAAgB,wBACd,GACA,GACA,KACS;AACT,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,KAAI,cAAc,EAAE,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,EAC1C,QAAO;AAGX,QAAO;;AAGT,SAAgB,YACd,QACA,WACA,OACA,UACA;AACA,MAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,IACpC,KAAI,CAAC,YAAY,OAAO,UAAU,KAAK,MAAM,SAAS,IAAI,CACxD,QAAO;AAGX,QAAO;;;;;;;AAQT,SAAgB,oBACd,WACA,WACA,WACmC;CACnC,MAAM,aAAoC,EAAE;AAC5C,MAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;EACzC,MAAM,QAAQ,UAAU,UAAU;AAClC,MAAI,UAAU,KACZ;AAEF,aAAW,UAAU,MAAM;;AAE7B,QAAO"}