@rocicorp/zero 0.25.0-canary.7 → 0.25.0-canary.9

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

@@ -1,252 +1,245 @@
 import { areEqual } from "../../../shared/src/arrays.js";
 import { assert, unreachable } from "../../../shared/src/asserts.js";
-import {} from "./change.js";
 import { normalizeUndefined } from "./data.js";
-import { throwFilterOutput, } from "./filter-operators.js";
-import {} from "./operator.js";
+import { throwFilterOutput } from "./filter-operators.js";
 import { first } from "./stream.js";
-/**
- * The Exists operator filters data based on whether or not a relationship is
- * non-empty.
- */
-export class Exists {
-    #input;
-    #relationshipName;
-    #storage;
-    #not;
-    #parentJoinKey;
-    #noSizeReuse;
-    #output = throwFilterOutput;
-    /**
-     * This instance variable is `true` when this operator is processing a `push`,
-     * and is used to disable reuse of cached sizes across rows with the
-     * same parent join key value.
-     * This is necessary because during a push relationships can be inconsistent
-     * due to push communicating changes (which may change multiple Nodes) one
-     * Node at a time.
-     */
-    #inPush = false;
-    constructor(input, storage, relationshipName, parentJoinKey, type) {
-        this.#input = input;
-        this.#relationshipName = relationshipName;
-        this.#input.setFilterOutput(this);
-        this.#storage = storage;
-        assert(this.#input.getSchema().relationships[relationshipName], `Input schema missing ${relationshipName}`);
-        this.#not = type === 'NOT EXISTS';
-        this.#parentJoinKey = parentJoinKey;
-        // If the parentJoinKey is the primary key, no sense in trying to reuse.
-        this.#noSizeReuse = areEqual(parentJoinKey, this.#input.getSchema().primaryKey);
-    }
-    setFilterOutput(output) {
-        this.#output = output;
-    }
-    filter(node, cleanup) {
-        const result = this.#filter(node) && this.#output.filter(node, cleanup);
-        if (cleanup) {
-            this.#delSize(node);
+class Exists {
+  #input;
+  #relationshipName;
+  #storage;
+  #not;
+  #parentJoinKey;
+  #noSizeReuse;
+  #output = throwFilterOutput;
+  /**
+   * This instance variable is `true` when this operator is processing a `push`,
+   * and is used to disable reuse of cached sizes across rows with the
+   * same parent join key value.
+   * This is necessary because during a push relationships can be inconsistent
+   * due to push communicating changes (which may change multiple Nodes) one
+   * Node at a time.
+   */
+  #inPush = false;
+  constructor(input, storage, relationshipName, parentJoinKey, type) {
+    this.#input = input;
+    this.#relationshipName = relationshipName;
+    this.#input.setFilterOutput(this);
+    this.#storage = storage;
+    assert(
+      this.#input.getSchema().relationships[relationshipName],
+      `Input schema missing ${relationshipName}`
+    );
+    this.#not = type === "NOT EXISTS";
+    this.#parentJoinKey = parentJoinKey;
+    this.#noSizeReuse = areEqual(
+      parentJoinKey,
+      this.#input.getSchema().primaryKey
+    );
+  }
+  setFilterOutput(output) {
+    this.#output = output;
+  }
+  filter(node, cleanup) {
+    const result = this.#filter(node) && this.#output.filter(node, cleanup);
+    if (cleanup) {
+      this.#delSize(node);
+    }
+    return result;
+  }
+  destroy() {
+    this.#input.destroy();
+  }
+  getSchema() {
+    return this.#input.getSchema();
+  }
+  push(change) {
+    assert(!this.#inPush, "Unexpected re-entrancy");
+    this.#inPush = true;
+    try {
+      switch (change.type) {
+        // add, remove and edit cannot change the size of the
+        // this.#relationshipName relationship, so simply #pushWithFilter
+        case "add":
+        case "edit": {
+          this.#pushWithFilter(change);
+          return;
         }
-        return result;
-    }
-    destroy() {
-        this.#input.destroy();
-    }
-    getSchema() {
-        return this.#input.getSchema();
-    }
-    push(change) {
-        assert(!this.#inPush, 'Unexpected re-entrancy');
-        this.#inPush = true;
-        try {
-            switch (change.type) {
-                // add, remove and edit cannot change the size of the
-                // this.#relationshipName relationship, so simply #pushWithFilter
-                case 'add':
-                case 'edit': {
-                    this.#pushWithFilter(change);
-                    return;
-                }
-                case 'remove': {
-                    const size = this.#getSize(change.node);
-                    // If size is undefined, this operator has not output
-                    // this row before and so it is unnecessary to output a remove for
-                    // it.
-                    if (size === undefined) {
-                        return;
-                    }
-                    this.#pushWithFilter(change, size);
-                    this.#delSize(change.node);
-                    return;
-                }
-                case 'child':
-                    // Only add and remove child changes for the
-                    // this.#relationshipName relationship, can change the size
-                    // of the this.#relationshipName relationship, for other
-                    // child changes simply #pushWithFilter
-                    if (change.child.relationshipName !== this.#relationshipName ||
-                        change.child.change.type === 'edit' ||
-                        change.child.change.type === 'child') {
-                        this.#pushWithFilter(change);
-                        return;
-                    }
-                    switch (change.child.change.type) {
-                        case 'add': {
-                            let size = this.#getSize(change.node);
-                            if (size !== undefined) {
-                                size++;
-                                this.#setSize(change.node, size);
-                            }
-                            else {
-                                size = this.#fetchSize(change.node);
-                            }
-                            if (size === 1) {
-                                if (this.#not) {
-                                    // Since the add child change currently being processed is not
-                                    // pushed to output, the added child needs to be excluded from
-                                    // the remove being pushed to output (since the child has
-                                    // never been added to the output).
-                                    this.#output.push({
-                                        type: 'remove',
-                                        node: {
-                                            row: change.node.row,
-                                            relationships: {
-                                                ...change.node.relationships,
-                                                [this.#relationshipName]: () => [],
-                                            },
-                                        },
-                                    }, this);
-                                }
-                                else {
-                                    this.#output.push({
-                                        type: 'add',
-                                        node: change.node,
-                                    }, this);
-                                }
-                            }
-                            else {
-                                this.#pushWithFilter(change, size);
-                            }
-                            return;
-                        }
-                        case 'remove': {
-                            let size = this.#getSize(change.node);
-                            if (size !== undefined) {
-                                assert(size > 0);
-                                size--;
-                                this.#setSize(change.node, size);
-                            }
-                            else {
-                                size = this.#fetchSize(change.node);
-                            }
-                            if (size === 0) {
-                                if (this.#not) {
-                                    this.#output.push({
-                                        type: 'add',
-                                        node: change.node,
-                                    }, this);
-                                }
-                                else {
-                                    // Since the remove child change currently being processed is
-                                    // not pushed to output, the removed child needs to be added to
-                                    // the remove being pushed to output.
-                                    this.#output.push({
-                                        type: 'remove',
-                                        node: {
-                                            row: change.node.row,
-                                            relationships: {
-                                                ...change.node.relationships,
-                                                [this.#relationshipName]: () => [
-                                                    change.child.change.node,
-                                                ],
-                                            },
-                                        },
-                                    }, this);
-                                }
-                            }
-                            else {
-                                this.#pushWithFilter(change, size);
-                            }
-                            return;
+        case "remove": {
+          const size = this.#getSize(change.node);
+          if (size === void 0) {
+            return;
+          }
+          this.#pushWithFilter(change, size);
+          this.#delSize(change.node);
+          return;
+        }
+        case "child":
+          if (change.child.relationshipName !== this.#relationshipName || change.child.change.type === "edit" || change.child.change.type === "child") {
+            this.#pushWithFilter(change);
+            return;
+          }
+          switch (change.child.change.type) {
+            case "add": {
+              let size = this.#getSize(change.node);
+              if (size !== void 0) {
+                size++;
+                this.#setSize(change.node, size);
+              } else {
+                size = this.#fetchSize(change.node);
+              }
+              if (size === 1) {
+                if (this.#not) {
+                  this.#output.push(
+                    {
+                      type: "remove",
+                      node: {
+                        row: change.node.row,
+                        relationships: {
+                          ...change.node.relationships,
+                          [this.#relationshipName]: () => []
                         }
-                    }
-                    return;
-                default:
-                    unreachable(change);
+                      }
+                    },
+                    this
+                  );
+                } else {
+                  this.#output.push(
+                    {
+                      type: "add",
+                      node: change.node
+                    },
+                    this
+                  );
+                }
+              } else {
+                this.#pushWithFilter(change, size);
+              }
+              return;
             }
-        }
-        finally {
-            this.#inPush = false;
-        }
-    }
-    /**
-     * Returns whether or not the node's this.#relationshipName
-     * relationship passes the exist/not exists filter condition.
-     * If the optional `size` is passed it is used.
-     * Otherwise, if there is a stored size for the row it is used.
-     * Otherwise the size is computed by streaming the node's
-     * relationship with this.#relationshipName (this computed size is also
-     * stored).
-     */
-    #filter(node, size) {
-        const exists = (size ?? this.#getOrFetchSize(node)) > 0;
-        return this.#not ? !exists : exists;
-    }
-    /**
-     * Pushes a change if this.#filter is true for its row.
-     */
-    #pushWithFilter(change, size) {
-        if (this.#filter(change.node, size)) {
-            this.#output.push(change, this);
-        }
-    }
-    #getSize(node) {
-        return this.#storage.get(this.#makeSizeStorageKey(node));
-    }
-    #setSize(node, size) {
-        this.#storage.set(this.#makeSizeStorageKey(node), size);
-    }
-    #delSize(node) {
-        this.#storage.del(this.#makeSizeStorageKey(node));
-    }
-    #getOrFetchSize(node) {
-        const size = this.#getSize(node);
-        if (size !== undefined) {
-            return size;
-        }
-        return this.#fetchSize(node);
-    }
-    #fetchSize(node) {
-        if (!this.#noSizeReuse && !this.#inPush) {
-            const cachedSizeEntry = first(this.#storage.scan({
-                prefix: this.#makeSizeStorageKeyPrefix(node),
-            }));
-            if (cachedSizeEntry !== undefined) {
-                this.#setSize(node, cachedSizeEntry[1]);
-                return cachedSizeEntry[1];
+            case "remove": {
+              let size = this.#getSize(change.node);
+              if (size !== void 0) {
+                assert(size > 0);
+                size--;
+                this.#setSize(change.node, size);
+              } else {
+                size = this.#fetchSize(change.node);
+              }
+              if (size === 0) {
+                if (this.#not) {
+                  this.#output.push(
+                    {
+                      type: "add",
+                      node: change.node
+                    },
+                    this
+                  );
+                } else {
+                  this.#output.push(
+                    {
+                      type: "remove",
+                      node: {
+                        row: change.node.row,
+                        relationships: {
+                          ...change.node.relationships,
+                          [this.#relationshipName]: () => [
+                            change.child.change.node
+                          ]
+                        }
+                      }
+                    },
+                    this
+                  );
+                }
+              } else {
+                this.#pushWithFilter(change, size);
+              }
+              return;
             }
-        }
-        const relationship = node.relationships[this.#relationshipName];
-        assert(relationship);
-        let size = 0;
-        for (const _relatedNode of relationship()) {
-            size++;
-        }
-        this.#setSize(node, size);
-        return size;
-    }
-    #makeSizeStorageKeyPrefix(node) {
-        return `row/${this.#noSizeReuse
-            ? ''
-            : JSON.stringify(this.#getKeyValues(node, this.#parentJoinKey))}/`;
-    }
-    #makeSizeStorageKey(node) {
-        return `${this.#makeSizeStorageKeyPrefix(node)}${JSON.stringify(this.#getKeyValues(node, this.#input.getSchema().primaryKey))}`;
-    }
-    #getKeyValues(node, def) {
-        const values = [];
-        for (const key of def) {
-            values.push(normalizeUndefined(node.row[key]));
-        }
-        return values;
-    }
+          }
+          return;
+        default:
+          unreachable(change);
+      }
+    } finally {
+      this.#inPush = false;
+    }
+  }
+  /**
+   * Returns whether or not the node's this.#relationshipName
+   * relationship passes the exist/not exists filter condition.
+   * If the optional `size` is passed it is used.
+   * Otherwise, if there is a stored size for the row it is used.
+   * Otherwise the size is computed by streaming the node's
+   * relationship with this.#relationshipName (this computed size is also
+   * stored).
+   */
+  #filter(node, size) {
+    const exists = (size ?? this.#getOrFetchSize(node)) > 0;
+    return this.#not ? !exists : exists;
+  }
+  /**
+   * Pushes a change if this.#filter is true for its row.
+   */
+  #pushWithFilter(change, size) {
+    if (this.#filter(change.node, size)) {
+      this.#output.push(change, this);
+    }
+  }
+  #getSize(node) {
+    return this.#storage.get(this.#makeSizeStorageKey(node));
+  }
+  #setSize(node, size) {
+    this.#storage.set(this.#makeSizeStorageKey(node), size);
+  }
+  #delSize(node) {
+    this.#storage.del(this.#makeSizeStorageKey(node));
+  }
+  #getOrFetchSize(node) {
+    const size = this.#getSize(node);
+    if (size !== void 0) {
+      return size;
+    }
+    return this.#fetchSize(node);
+  }
+  #fetchSize(node) {
+    if (!this.#noSizeReuse && !this.#inPush) {
+      const cachedSizeEntry = first(
+        this.#storage.scan({
+          prefix: this.#makeSizeStorageKeyPrefix(node)
+        })
+      );
+      if (cachedSizeEntry !== void 0) {
+        this.#setSize(node, cachedSizeEntry[1]);
+        return cachedSizeEntry[1];
+      }
+    }
+    const relationship = node.relationships[this.#relationshipName];
+    assert(relationship);
+    let size = 0;
+    for (const _relatedNode of relationship()) {
+      size++;
+    }
+    this.#setSize(node, size);
+    return size;
+  }
+  #makeSizeStorageKeyPrefix(node) {
+    return `row/${this.#noSizeReuse ? "" : JSON.stringify(this.#getKeyValues(node, this.#parentJoinKey))}/`;
+  }
+  #makeSizeStorageKey(node) {
+    return `${this.#makeSizeStorageKeyPrefix(node)}${JSON.stringify(
+      this.#getKeyValues(node, this.#input.getSchema().primaryKey)
+    )}`;
+  }
+  #getKeyValues(node, def) {
+    const values = [];
+    for (const key of def) {
+      values.push(normalizeUndefined(node.row[key]));
+    }
+    return values;
+  }
 }
-//# sourceMappingURL=exists.js.map
+export {
+  Exists
+};
+//# sourceMappingURL=exists.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"exists.js","sourceRoot":"","sources":["../../../../../zql/src/ivm/exists.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,QAAQ,EAAC,MAAM,+BAA+B,CAAC;AACvD,OAAO,EAAC,MAAM,EAAE,WAAW,EAAC,MAAM,gCAAgC,CAAC;AAEnE,OAAO,EAAa,MAAM,aAAa,CAAC;AACxC,OAAO,EAAC,kBAAkB,EAAkC,MAAM,WAAW,CAAC;AAC9E,OAAO,EACL,iBAAiB,GAIlB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAc,MAAM,eAAe,CAAC;AAE3C,OAAO,EAAC,KAAK,EAAC,MAAM,aAAa,CAAC;AAwBlC;;;GAGG;AACH,MAAM,OAAO,MAAM;IACR,MAAM,CAAc;IACpB,iBAAiB,CAAS;IAC1B,QAAQ,CAAgB;IACxB,IAAI,CAAU;IACd,cAAc,CAAc;IAC5B,YAAY,CAAU;IAE/B,OAAO,GAAiB,iBAAiB,CAAC;IAE1C;;;;;;;OAOG;IACH,OAAO,GAAG,KAAK,CAAC;IAEhB,YACE,KAAkB,EAClB,OAAgB,EAChB,gBAAwB,EACxB,aAA0B,EAC1B,IAA6B;QAE7B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,iBAAiB,GAAG,gBAAgB,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,OAAwB,CAAC;QACzC,MAAM,CACJ,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,aAAa,CAAC,gBAAgB,CAAC,EACvD,wBAAwB,gBAAgB,EAAE,CAC3C,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,YAAY,CAAC;QAClC,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QAEpC,wEAAwE;QACxE,IAAI,CAAC,YAAY,GAAG,QAAQ,CAC1B,aAAa,EACb,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,UAAU,CACnC,CAAC;IACJ,CAAC;IAED,eAAe,CAAC,MAAoB;QAClC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED,MAAM,CAAC,IAAU,EAAE,OAAgB;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACxE,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,OAAO;QACL,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;IACjC,CAAC;IAED,IAAI,CAAC,MAAc;QACjB,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,wBAAwB,CAAC,CAAC;QAChD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC;YACH,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;gBACpB,qDAAqD;gBACrD,iEAAiE;gBACjE,KAAK,KAAK,CAAC;gBACX,KAAK,MAAM,CAAC,CAAC,CAAC;oBACZ,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;oBAC7B,OAAO;gBACT,CAAC;gBACD,KAAK,QAAQ,CAAC,CAAC,CAAC;oBACd,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBACxC,qDAAqD;oBACrD,kEAAkE;oBAClE,MAAM;oBACN,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;wBACvB,OAAO;oBACT,CAAC;oBACD,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBACnC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC3B,OAAO;gBACT,CAAC;gBACD,KAAK,OAAO;oBACV,4CAA4C;oBAC5C,2DAA2D;oBAC3D,wDAAwD;oBACxD,uCAAuC;oBACvC,IACE,MAAM,CAAC,KAAK,CAAC,gBAAgB,KAAK,IAAI,CAAC,iBAAiB;wBACxD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM;wBACnC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,OAAO,EACpC,CAAC;wBACD,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;wBAC7B,OAAO;oBACT,CAAC;oBACD,QAAQ,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;wBACjC,KAAK,KAAK,CAAC,CAAC,CAAC;4BACX,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;4BACtC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gCACvB,IAAI,EAAE,CAAC;gCACP,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;4BACnC,CAAC;iCAAM,CAAC;gCACN,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;4BACtC,CAAC;4BACD,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gCACf,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oCACd,8DAA8D;oCAC9D,8DAA8D;oCAC9D,yDAAyD;oCACzD,mCAAmC;oCACnC,IAAI,CAAC,OAAO,CAAC,IAAI,CACf;wCACE,IAAI,EAAE,QAAQ;wCACd,IAAI,EAAE;4CACJ,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG;4CACpB,aAAa,EAAE;gDACb,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa;gDAC5B,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;6CACnC;yCACF;qCACF,EACD,IAAI,CACL,CAAC;gCACJ,CAAC;qCAAM,CAAC;oCACN,IAAI,CAAC,OAAO,CAAC,IAAI,CACf;wCACE,IAAI,EAAE,KAAK;wCACX,IAAI,EAAE,MAAM,CAAC,IAAI;qCAClB,EACD,IAAI,CACL,CAAC;gCACJ,CAAC;4BACH,CAAC;iCAAM,CAAC;gCACN,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;4BACrC,CAAC;4BACD,OAAO;wBACT,CAAC;wBACD,KAAK,QAAQ,CAAC,CAAC,CAAC;4BACd,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;4BACtC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gCACvB,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gCACjB,IAAI,EAAE,CAAC;gCACP,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;4BACnC,CAAC;iCAAM,CAAC;gCACN,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;4BACtC,CAAC;4BACD,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gCACf,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oCACd,IAAI,CAAC,OAAO,CAAC,IAAI,CACf;wCACE,IAAI,EAAE,KAAK;wCACX,IAAI,EAAE,MAAM,CAAC,IAAI;qCAClB,EACD,IAAI,CACL,CAAC;gCACJ,CAAC;qCAAM,CAAC;oCACN,6DAA6D;oCAC7D,+DAA+D;oCAC/D,qCAAqC;oCACrC,IAAI,CAAC,OAAO,CAAC,IAAI,CACf;wCACE,IAAI,EAAE,QAAQ;wCACd,IAAI,EAAE;4CACJ,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG;4CACpB,aAAa,EAAE;gDACb,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa;gDAC5B,CAAC,IAAI,CAAC,iBAAiB,CAAC,EAAE,GAAG,EAAE,CAAC;oDAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI;iDACzB;6CACF;yCACF;qCACF,EACD,IAAI,CACL,CAAC;gCACJ,CAAC;4BACH,CAAC;iCAAM,CAAC;gCACN,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;4BACrC,CAAC;4BACD,OAAO;wBACT,CAAC;oBACH,CAAC;oBACD,OAAO;gBACT;oBACE,WAAW,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACvB,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,OAAO,CAAC,IAAU,EAAE,IAAa;QAC/B,MAAM,MAAM,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACxD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,MAAc,EAAE,IAAa;QAC3C,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,QAAQ,CAAC,IAAU;QACjB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,QAAQ,CAAC,IAAU,EAAE,IAAY;QAC/B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;IAC1D,CAAC;IAED,QAAQ,CAAC,IAAU;QACjB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC;IACpD,CAAC;IAED,eAAe,CAAC,IAAU;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,UAAU,CAAC,IAAU;QACnB,IAAI,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YACxC,MAAM,eAAe,GAAG,KAAK,CAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACjB,MAAM,EAAE,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC;aAC7C,CAAC,CACH,CAAC;YACF,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;gBAClC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxC,OAAO,eAAe,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAChE,MAAM,CAAC,YAAY,CAAC,CAAC;QACrB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,YAAY,IAAI,YAAY,EAAE,EAAE,CAAC;YAC1C,IAAI,EAAE,CAAC;QACT,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yBAAyB,CAAC,IAAU;QAClC,OAAO,OACL,IAAI,CAAC,YAAY;YACf,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,CAClE,GAAG,CAAC;IACN,CAAC;IAED,mBAAmB,CAAC,IAAU;QAC5B,OAAO,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAC7D,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,UAAU,CAAC,CAC7D,EAAE,CAAC;IACN,CAAC;IAED,aAAa,CAAC,IAAU,EAAE,GAAgB;QACxC,MAAM,MAAM,GAAsB,EAAE,CAAC;QACrC,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}
+{"version":3,"file":"exists.js","sources":["../../../../../zql/src/ivm/exists.ts"],"sourcesContent":["import {areEqual} from '../../../shared/src/arrays.ts';\nimport {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport type {CompoundKey} from '../../../zero-protocol/src/ast.ts';\nimport {type Change} from './change.ts';\nimport {normalizeUndefined, type Node, type NormalizedValue} from './data.ts';\nimport {\n  throwFilterOutput,\n  type FilterInput,\n  type FilterOperator,\n  type FilterOutput,\n} from './filter-operators.ts';\nimport {type Storage} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {first} from './stream.ts';\n\ntype SizeStorageKeyPrefix = `row/${string}/`;\n/**\n * Key is of format\n * `row/${JSON.stringify(parentJoinKeyValues)}/${JSON.stringify(primaryKeyValues)}`\n * This format allows us to look up an existing cached size for a given set of\n * `parentJoinKeyValues` by scanning for prefix\n * `row/${JSON.stringify(parentJoinKeyValues)}/` and using the first result, and\n * to look up the cached size for a specific row by the full key.\n * If the parent join and primary key are the same, then format is changed to\n * `row//${JSON.stringify(primaryKeyValues)}` to shorten the key, since there\n * is no point in looking up an existing cached size by\n * `parentJoinKeyValues` if the specific rows cached size is missing.\n */\ntype SizeStorageKey = `${SizeStorageKeyPrefix}${string}`;\n\ninterface ExistsStorage {\n  get(key: SizeStorageKey): number | undefined;\n  set(key: SizeStorageKey, value: number): void;\n  del(key: SizeStorageKey): void;\n  scan({prefix}: {prefix: SizeStorageKeyPrefix}): Iterable<[string, number]>;\n}\n\n/**\n * The Exists operator filters data based on whether or not a relationship is\n * non-empty.\n */\nexport class Exists implements FilterOperator {\n  readonly #input: FilterInput;\n  readonly #relationshipName: string;\n  readonly #storage: ExistsStorage;\n  readonly #not: boolean;\n  readonly #parentJoinKey: CompoundKey;\n  readonly #noSizeReuse: boolean;\n\n  #output: FilterOutput = throwFilterOutput;\n\n  /**\n   * This instance variable is `true` when this operator is processing a `push`,\n   * and is used to disable reuse of cached sizes across rows with the\n   * same parent join key value.\n   * This is necessary because during a push relationships can be inconsistent\n   * due to push communicating changes (which may change multiple Nodes) one\n   * Node at a time.\n   */\n  #inPush = false;\n\n  constructor(\n    input: FilterInput,\n    storage: Storage,\n    relationshipName: string,\n    parentJoinKey: CompoundKey,\n    type: 'EXISTS' | 'NOT EXISTS',\n  ) {\n    this.#input = input;\n    this.#relationshipName = relationshipName;\n    this.#input.setFilterOutput(this);\n    this.#storage = storage as ExistsStorage;\n    assert(\n      this.#input.getSchema().relationships[relationshipName],\n      `Input schema missing ${relationshipName}`,\n    );\n    this.#not = type === 'NOT EXISTS';\n    this.#parentJoinKey = parentJoinKey;\n\n    // If the parentJoinKey is the primary key, no sense in trying to reuse.\n    this.#noSizeReuse = areEqual(\n      parentJoinKey,\n      this.#input.getSchema().primaryKey,\n    );\n  }\n\n  setFilterOutput(output: FilterOutput): void {\n    this.#output = output;\n  }\n\n  filter(node: Node, cleanup: boolean): boolean {\n    const result = this.#filter(node) && this.#output.filter(node, cleanup);\n    if (cleanup) {\n      this.#delSize(node);\n    }\n    return result;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  push(change: Change) {\n    assert(!this.#inPush, 'Unexpected re-entrancy');\n    this.#inPush = true;\n    try {\n      switch (change.type) {\n        // add, remove and edit cannot change the size of the\n        // this.#relationshipName relationship, so simply #pushWithFilter\n        case 'add':\n        case 'edit': {\n          this.#pushWithFilter(change);\n          return;\n        }\n        case 'remove': {\n          const size = this.#getSize(change.node);\n          // If size is undefined, this operator has not output\n          // this row before and so it is unnecessary to output a remove for\n          // it.\n          if (size === undefined) {\n            return;\n          }\n          this.#pushWithFilter(change, size);\n          this.#delSize(change.node);\n          return;\n        }\n        case 'child':\n          // Only add and remove child changes for the\n          // this.#relationshipName relationship, can change the size\n          // of the this.#relationshipName relationship, for other\n          // child changes simply #pushWithFilter\n          if (\n            change.child.relationshipName !== this.#relationshipName ||\n            change.child.change.type === 'edit' ||\n            change.child.change.type === 'child'\n          ) {\n            this.#pushWithFilter(change);\n            return;\n          }\n          switch (change.child.change.type) {\n            case 'add': {\n              let size = this.#getSize(change.node);\n              if (size !== undefined) {\n                size++;\n                this.#setSize(change.node, size);\n              } else {\n                size = this.#fetchSize(change.node);\n              }\n              if (size === 1) {\n                if (this.#not) {\n                  // Since the add child change currently being processed is not\n                  // pushed to output, the added child needs to be excluded from\n                  // the remove being pushed to output (since the child has\n                  // never been added to the output).\n                  this.#output.push(\n                    {\n                      type: 'remove',\n                      node: {\n                        row: change.node.row,\n                        relationships: {\n                          ...change.node.relationships,\n                          [this.#relationshipName]: () => [],\n                        },\n                      },\n                    },\n                    this,\n                  );\n                } else {\n                  this.#output.push(\n                    {\n                      type: 'add',\n                      node: change.node,\n                    },\n                    this,\n                  );\n                }\n              } else {\n                this.#pushWithFilter(change, size);\n              }\n              return;\n            }\n            case 'remove': {\n              let size = this.#getSize(change.node);\n              if (size !== undefined) {\n                assert(size > 0);\n                size--;\n                this.#setSize(change.node, size);\n              } else {\n                size = this.#fetchSize(change.node);\n              }\n              if (size === 0) {\n                if (this.#not) {\n                  this.#output.push(\n                    {\n                      type: 'add',\n                      node: change.node,\n                    },\n                    this,\n                  );\n                } else {\n                  // Since the remove child change currently being processed is\n                  // not pushed to output, the removed child needs to be added to\n                  // the remove being pushed to output.\n                  this.#output.push(\n                    {\n                      type: 'remove',\n                      node: {\n                        row: change.node.row,\n                        relationships: {\n                          ...change.node.relationships,\n                          [this.#relationshipName]: () => [\n                            change.child.change.node,\n                          ],\n                        },\n                      },\n                    },\n                    this,\n                  );\n                }\n              } else {\n                this.#pushWithFilter(change, size);\n              }\n              return;\n            }\n          }\n          return;\n        default:\n          unreachable(change);\n      }\n    } finally {\n      this.#inPush = false;\n    }\n  }\n\n  /**\n   * Returns whether or not the node's this.#relationshipName\n   * relationship passes the exist/not exists filter condition.\n   * If the optional `size` is passed it is used.\n   * Otherwise, if there is a stored size for the row it is used.\n   * Otherwise the size is computed by streaming the node's\n   * relationship with this.#relationshipName (this computed size is also\n   * stored).\n   */\n  #filter(node: Node, size?: number): boolean {\n    const exists = (size ?? this.#getOrFetchSize(node)) > 0;\n    return this.#not ? !exists : exists;\n  }\n\n  /**\n   * Pushes a change if this.#filter is true for its row.\n   */\n  #pushWithFilter(change: Change, size?: number): void {\n    if (this.#filter(change.node, size)) {\n      this.#output.push(change, this);\n    }\n  }\n\n  #getSize(node: Node): number | undefined {\n    return this.#storage.get(this.#makeSizeStorageKey(node));\n  }\n\n  #setSize(node: Node, size: number) {\n    this.#storage.set(this.#makeSizeStorageKey(node), size);\n  }\n\n  #delSize(node: Node) {\n    this.#storage.del(this.#makeSizeStorageKey(node));\n  }\n\n  #getOrFetchSize(node: Node): number {\n    const size = this.#getSize(node);\n    if (size !== undefined) {\n      return size;\n    }\n    return this.#fetchSize(node);\n  }\n\n  #fetchSize(node: Node): number {\n    if (!this.#noSizeReuse && !this.#inPush) {\n      const cachedSizeEntry = first(\n        this.#storage.scan({\n          prefix: this.#makeSizeStorageKeyPrefix(node),\n        }),\n      );\n      if (cachedSizeEntry !== undefined) {\n        this.#setSize(node, cachedSizeEntry[1]);\n        return cachedSizeEntry[1];\n      }\n    }\n\n    const relationship = node.relationships[this.#relationshipName];\n    assert(relationship);\n    let size = 0;\n    for (const _relatedNode of relationship()) {\n      size++;\n    }\n\n    this.#setSize(node, size);\n    return size;\n  }\n\n  #makeSizeStorageKeyPrefix(node: Node): SizeStorageKeyPrefix {\n    return `row/${\n      this.#noSizeReuse\n        ? ''\n        : JSON.stringify(this.#getKeyValues(node, this.#parentJoinKey))\n    }/`;\n  }\n\n  #makeSizeStorageKey(node: Node): SizeStorageKey {\n    return `${this.#makeSizeStorageKeyPrefix(node)}${JSON.stringify(\n      this.#getKeyValues(node, this.#input.getSchema().primaryKey),\n    )}`;\n  }\n\n  #getKeyValues(node: Node, def: CompoundKey): NormalizedValue[] {\n    const values: NormalizedValue[] = [];\n    for (const key of def) {\n      values.push(normalizeUndefined(node.row[key]));\n    }\n    return values;\n  }\n}\n"],"names":[],"mappings":";;;;;AAyCO,MAAM,OAAiC;AAAA,EACnC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,UAAwB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUxB,UAAU;AAAA,EAEV,YACE,OACA,SACA,kBACA,eACA,MACA;AACA,SAAK,SAAS;AACd,SAAK,oBAAoB;AACzB,SAAK,OAAO,gBAAgB,IAAI;AAChC,SAAK,WAAW;AAChB;AAAA,MACE,KAAK,OAAO,YAAY,cAAc,gBAAgB;AAAA,MACtD,wBAAwB,gBAAgB;AAAA,IAAA;AAE1C,SAAK,OAAO,SAAS;AACrB,SAAK,iBAAiB;AAGtB,SAAK,eAAe;AAAA,MAClB;AAAA,MACA,KAAK,OAAO,YAAY;AAAA,IAAA;AAAA,EAE5B;AAAA,EAEA,gBAAgB,QAA4B;AAC1C,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,OAAO,MAAY,SAA2B;AAC5C,UAAM,SAAS,KAAK,QAAQ,IAAI,KAAK,KAAK,QAAQ,OAAO,MAAM,OAAO;AACtE,QAAI,SAAS;AACX,WAAK,SAAS,IAAI;AAAA,IACpB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,UAAgB;AACd,SAAK,OAAO,QAAA;AAAA,EACd;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK,OAAO,UAAA;AAAA,EACrB;AAAA,EAEA,KAAK,QAAgB;AACnB,WAAO,CAAC,KAAK,SAAS,wBAAwB;AAC9C,SAAK,UAAU;AACf,QAAI;AACF,cAAQ,OAAO,MAAA;AAAA;AAAA;AAAA,QAGb,KAAK;AAAA,QACL,KAAK,QAAQ;AACX,eAAK,gBAAgB,MAAM;AAC3B;AAAA,QACF;AAAA,QACA,KAAK,UAAU;AACb,gBAAM,OAAO,KAAK,SAAS,OAAO,IAAI;AAItC,cAAI,SAAS,QAAW;AACtB;AAAA,UACF;AACA,eAAK,gBAAgB,QAAQ,IAAI;AACjC,eAAK,SAAS,OAAO,IAAI;AACzB;AAAA,QACF;AAAA,QACA,KAAK;AAKH,cACE,OAAO,MAAM,qBAAqB,KAAK,qBACvC,OAAO,MAAM,OAAO,SAAS,UAC7B,OAAO,MAAM,OAAO,SAAS,SAC7B;AACA,iBAAK,gBAAgB,MAAM;AAC3B;AAAA,UACF;AACA,kBAAQ,OAAO,MAAM,OAAO,MAAA;AAAA,YAC1B,KAAK,OAAO;AACV,kBAAI,OAAO,KAAK,SAAS,OAAO,IAAI;AACpC,kBAAI,SAAS,QAAW;AACtB;AACA,qBAAK,SAAS,OAAO,MAAM,IAAI;AAAA,cACjC,OAAO;AACL,uBAAO,KAAK,WAAW,OAAO,IAAI;AAAA,cACpC;AACA,kBAAI,SAAS,GAAG;AACd,oBAAI,KAAK,MAAM;AAKb,uBAAK,QAAQ;AAAA,oBACX;AAAA,sBACE,MAAM;AAAA,sBACN,MAAM;AAAA,wBACJ,KAAK,OAAO,KAAK;AAAA,wBACjB,eAAe;AAAA,0BACb,GAAG,OAAO,KAAK;AAAA,0BACf,CAAC,KAAK,iBAAiB,GAAG,MAAM,CAAA;AAAA,wBAAC;AAAA,sBACnC;AAAA,oBACF;AAAA,oBAEF;AAAA,kBAAA;AAAA,gBAEJ,OAAO;AACL,uBAAK,QAAQ;AAAA,oBACX;AAAA,sBACE,MAAM;AAAA,sBACN,MAAM,OAAO;AAAA,oBAAA;AAAA,oBAEf;AAAA,kBAAA;AAAA,gBAEJ;AAAA,cACF,OAAO;AACL,qBAAK,gBAAgB,QAAQ,IAAI;AAAA,cACnC;AACA;AAAA,YACF;AAAA,YACA,KAAK,UAAU;AACb,kBAAI,OAAO,KAAK,SAAS,OAAO,IAAI;AACpC,kBAAI,SAAS,QAAW;AACtB,uBAAO,OAAO,CAAC;AACf;AACA,qBAAK,SAAS,OAAO,MAAM,IAAI;AAAA,cACjC,OAAO;AACL,uBAAO,KAAK,WAAW,OAAO,IAAI;AAAA,cACpC;AACA,kBAAI,SAAS,GAAG;AACd,oBAAI,KAAK,MAAM;AACb,uBAAK,QAAQ;AAAA,oBACX;AAAA,sBACE,MAAM;AAAA,sBACN,MAAM,OAAO;AAAA,oBAAA;AAAA,oBAEf;AAAA,kBAAA;AAAA,gBAEJ,OAAO;AAIL,uBAAK,QAAQ;AAAA,oBACX;AAAA,sBACE,MAAM;AAAA,sBACN,MAAM;AAAA,wBACJ,KAAK,OAAO,KAAK;AAAA,wBACjB,eAAe;AAAA,0BACb,GAAG,OAAO,KAAK;AAAA,0BACf,CAAC,KAAK,iBAAiB,GAAG,MAAM;AAAA,4BAC9B,OAAO,MAAM,OAAO;AAAA,0BAAA;AAAA,wBACtB;AAAA,sBACF;AAAA,oBACF;AAAA,oBAEF;AAAA,kBAAA;AAAA,gBAEJ;AAAA,cACF,OAAO;AACL,qBAAK,gBAAgB,QAAQ,IAAI;AAAA,cACnC;AACA;AAAA,YACF;AAAA,UAAA;AAEF;AAAA,QACF;AACE,sBAAY,MAAM;AAAA,MAAA;AAAA,IAExB,UAAA;AACE,WAAK,UAAU;AAAA,IACjB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,QAAQ,MAAY,MAAwB;AAC1C,UAAM,UAAU,QAAQ,KAAK,gBAAgB,IAAI,KAAK;AACtD,WAAO,KAAK,OAAO,CAAC,SAAS;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAgB,QAAgB,MAAqB;AACnD,QAAI,KAAK,QAAQ,OAAO,MAAM,IAAI,GAAG;AACnC,WAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,IAChC;AAAA,EACF;AAAA,EAEA,SAAS,MAAgC;AACvC,WAAO,KAAK,SAAS,IAAI,KAAK,oBAAoB,IAAI,CAAC;AAAA,EACzD;AAAA,EAEA,SAAS,MAAY,MAAc;AACjC,SAAK,SAAS,IAAI,KAAK,oBAAoB,IAAI,GAAG,IAAI;AAAA,EACxD;AAAA,EAEA,SAAS,MAAY;AACnB,SAAK,SAAS,IAAI,KAAK,oBAAoB,IAAI,CAAC;AAAA,EAClD;AAAA,EAEA,gBAAgB,MAAoB;AAClC,UAAM,OAAO,KAAK,SAAS,IAAI;AAC/B,QAAI,SAAS,QAAW;AACtB,aAAO;AAAA,IACT;AACA,WAAO,KAAK,WAAW,IAAI;AAAA,EAC7B;AAAA,EAEA,WAAW,MAAoB;AAC7B,QAAI,CAAC,KAAK,gBAAgB,CAAC,KAAK,SAAS;AACvC,YAAM,kBAAkB;AAAA,QACtB,KAAK,SAAS,KAAK;AAAA,UACjB,QAAQ,KAAK,0BAA0B,IAAI;AAAA,QAAA,CAC5C;AAAA,MAAA;AAEH,UAAI,oBAAoB,QAAW;AACjC,aAAK,SAAS,MAAM,gBAAgB,CAAC,CAAC;AACtC,eAAO,gBAAgB,CAAC;AAAA,MAC1B;AAAA,IACF;AAEA,UAAM,eAAe,KAAK,cAAc,KAAK,iBAAiB;AAC9D,WAAO,YAAY;AACnB,QAAI,OAAO;AACX,eAAW,gBAAgB,gBAAgB;AACzC;AAAA,IACF;AAEA,SAAK,SAAS,MAAM,IAAI;AACxB,WAAO;AAAA,EACT;AAAA,EAEA,0BAA0B,MAAkC;AAC1D,WAAO,OACL,KAAK,eACD,KACA,KAAK,UAAU,KAAK,cAAc,MAAM,KAAK,cAAc,CAAC,CAClE;AAAA,EACF;AAAA,EAEA,oBAAoB,MAA4B;AAC9C,WAAO,GAAG,KAAK,0BAA0B,IAAI,CAAC,GAAG,KAAK;AAAA,MACpD,KAAK,cAAc,MAAM,KAAK,OAAO,UAAA,EAAY,UAAU;AAAA,IAAA,CAC5D;AAAA,EACH;AAAA,EAEA,cAAc,MAAY,KAAqC;AAC7D,UAAM,SAA4B,CAAA;AAClC,eAAW,OAAO,KAAK;AACrB,aAAO,KAAK,mBAAmB,KAAK,IAAI,GAAG,CAAC,CAAC;AAAA,IAC/C;AACA,WAAO;AAAA,EACT;AACF;"}

package/out/zql/src/ivm/fan-in.js

@@ -1,58 +1,57 @@
 import { assert } from "../../../shared/src/asserts.js";
 import { identity } from "../../../shared/src/sentinels.js";
-import {} from "./data.js";
-import { throwFilterOutput, } from "./filter-operators.js";
+import "compare-utf8";
+import { throwFilterOutput } from "./filter-operators.js";
 import { pushAccumulatedChanges } from "./push-accumulated.js";
-/**
- * The FanIn operator merges multiple streams into one.
- * It eliminates duplicates and must be paired with a fan-out operator
- * somewhere upstream of the fan-in.
- *
- *  issue
- *    |
- * fan-out
- * /      \
- * a      b
- *  \    /
- * fan-in
- *   |
- */
-export class FanIn {
-    #inputs;
-    #schema;
-    #output = throwFilterOutput;
-    #accumulatedPushes = [];
-    constructor(fanOut, inputs) {
-        this.#inputs = inputs;
-        this.#schema = fanOut.getSchema();
-        for (const input of inputs) {
-            input.setFilterOutput(this);
-            assert(this.#schema === input.getSchema(), `Schema mismatch in fan-in`);
-        }
+class FanIn {
+  #inputs;
+  #schema;
+  #output = throwFilterOutput;
+  #accumulatedPushes = [];
+  constructor(fanOut, inputs) {
+    this.#inputs = inputs;
+    this.#schema = fanOut.getSchema();
+    for (const input of inputs) {
+      input.setFilterOutput(this);
+      assert(this.#schema === input.getSchema(), `Schema mismatch in fan-in`);
     }
-    setFilterOutput(output) {
-        this.#output = output;
+  }
+  setFilterOutput(output) {
+    this.#output = output;
+  }
+  destroy() {
+    for (const input of this.#inputs) {
+      input.destroy();
     }
-    destroy() {
-        for (const input of this.#inputs) {
-            input.destroy();
-        }
-    }
-    getSchema() {
-        return this.#schema;
-    }
-    filter(node, cleanup) {
-        return this.#output.filter(node, cleanup);
-    }
-    push(change) {
-        this.#accumulatedPushes.push(change);
-    }
-    fanOutDonePushingToAllBranches(fanOutChangeType) {
-        if (this.#inputs.length === 0) {
-            assert(this.#accumulatedPushes.length === 0, 'If there are no inputs then fan-in should not receive any pushes.');
-            return;
-        }
-        pushAccumulatedChanges(this.#accumulatedPushes, this.#output, this, fanOutChangeType, identity, identity);
+  }
+  getSchema() {
+    return this.#schema;
+  }
+  filter(node, cleanup) {
+    return this.#output.filter(node, cleanup);
+  }
+  push(change) {
+    this.#accumulatedPushes.push(change);
+  }
+  fanOutDonePushingToAllBranches(fanOutChangeType) {
+    if (this.#inputs.length === 0) {
+      assert(
+        this.#accumulatedPushes.length === 0,
+        "If there are no inputs then fan-in should not receive any pushes."
+      );
+      return;
     }
+    pushAccumulatedChanges(
+      this.#accumulatedPushes,
+      this.#output,
+      this,
+      fanOutChangeType,
+      identity,
+      identity
+    );
+  }
 }
-//# sourceMappingURL=fan-in.js.map
+export {
+  FanIn
+};
+//# sourceMappingURL=fan-in.js.map