@rocicorp/zero 0.25.0 → 0.26.0-canary.0

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

@@ -1,48 +1,46 @@
 import { assert } from "../../../shared/src/asserts.js";
 import { must } from "../../../shared/src/must.js";
-export class UnionFanOut {
-    #destroyCount = 0;
-    #unionFanIn;
-    #input;
-    #outputs = [];
-    constructor(input) {
-        this.#input = input;
-        input.setOutput(this);
-    }
-    setFanIn(fanIn) {
-        assert(!this.#unionFanIn, 'FanIn already set for this FanOut');
-        this.#unionFanIn = fanIn;
-    }
-    push(change) {
-        must(this.#unionFanIn).fanOutStartedPushing();
-        for (const output of this.#outputs) {
-            output.push(change, this);
-        }
-        must(this.#unionFanIn).fanOutDonePushing(change.type);
-    }
-    setOutput(output) {
-        this.#outputs.push(output);
-    }
-    getSchema() {
-        return this.#input.getSchema();
-    }
-    fetch(req) {
-        return this.#input.fetch(req);
-    }
-    cleanup(_req) {
-        // Cleanup is going away. Not implemented.
-        return [];
-    }
-    destroy() {
-        if (this.#destroyCount < this.#outputs.length) {
-            ++this.#destroyCount;
-            if (this.#destroyCount === this.#outputs.length) {
-                this.#input.destroy();
-            }
-        }
-        else {
-            throw new Error('FanOut already destroyed once for each output');
-        }
-    }
+class UnionFanOut {
+  #destroyCount = 0;
+  #unionFanIn;
+  #input;
+  #outputs = [];
+  constructor(input) {
+    this.#input = input;
+    input.setOutput(this);
+  }
+  setFanIn(fanIn) {
+    assert(!this.#unionFanIn, "FanIn already set for this FanOut");
+    this.#unionFanIn = fanIn;
+  }
+  *push(change) {
+    must(this.#unionFanIn).fanOutStartedPushing();
+    for (const output of this.#outputs) {
+      yield* output.push(change, this);
+    }
+    yield* must(this.#unionFanIn).fanOutDonePushing(change.type);
+  }
+  setOutput(output) {
+    this.#outputs.push(output);
+  }
+  getSchema() {
+    return this.#input.getSchema();
+  }
+  fetch(req) {
+    return this.#input.fetch(req);
+  }
+  destroy() {
+    if (this.#destroyCount < this.#outputs.length) {
+      ++this.#destroyCount;
+      if (this.#destroyCount === this.#outputs.length) {
+        this.#input.destroy();
+      }
+    } else {
+      throw new Error("FanOut already destroyed once for each output");
+    }
+  }
 }
-//# sourceMappingURL=union-fan-out.js.map
+export {
+  UnionFanOut
+};
+//# sourceMappingURL=union-fan-out.js.map

package/out/zql/src/ivm/union-fan-out.js.map

@@ -1 +1 @@
-{"version":3,"file":"union-fan-out.js","sourceRoot":"","sources":["../../../../../zql/src/ivm/union-fan-out.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AACtD,OAAO,EAAC,IAAI,EAAC,MAAM,6BAA6B,CAAC;AAQjD,MAAM,OAAO,WAAW;IACtB,aAAa,GAAW,CAAC,CAAC;IAC1B,WAAW,CAAc;IAChB,MAAM,CAAQ;IACd,QAAQ,GAAa,EAAE,CAAC;IAEjC,YAAY,KAAY;QACtB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAED,QAAQ,CAAC,KAAiB;QACxB,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,mCAAmC,CAAC,CAAC;QAC/D,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;IAC3B,CAAC;IAED,IAAI,CAAC,MAAc;QACjB,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,oBAAoB,EAAE,CAAC;QAC9C,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC;IAED,SAAS,CAAC,MAAc;QACtB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;IACjC,CAAC;IAED,KAAK,CAAC,GAAiB;QACrB,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,CAAC,IAAkB;QACxB,0CAA0C;QAC1C,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,OAAO;QACL,IAAI,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC9C,EAAE,IAAI,CAAC,aAAa,CAAC;YACrB,IAAI,IAAI,CAAC,aAAa,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;gBAChD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;CACF"}
+{"version":3,"file":"union-fan-out.js","sources":["../../../../../zql/src/ivm/union-fan-out.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {Change} from './change.ts';\nimport type {Node} from './data.ts';\nimport type {FetchRequest, Input, Operator, Output} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Stream} from './stream.ts';\nimport type {UnionFanIn} from './union-fan-in.ts';\n\nexport class UnionFanOut implements Operator {\n  #destroyCount: number = 0;\n  #unionFanIn?: UnionFanIn;\n  readonly #input: Input;\n  readonly #outputs: Output[] = [];\n\n  constructor(input: Input) {\n    this.#input = input;\n    input.setOutput(this);\n  }\n\n  setFanIn(fanIn: UnionFanIn) {\n    assert(!this.#unionFanIn, 'FanIn already set for this FanOut');\n    this.#unionFanIn = fanIn;\n  }\n\n  *push(change: Change): Stream<'yield'> {\n    must(this.#unionFanIn).fanOutStartedPushing();\n    for (const output of this.#outputs) {\n      yield* output.push(change, this);\n    }\n    yield* must(this.#unionFanIn).fanOutDonePushing(change.type);\n  }\n\n  setOutput(output: Output): void {\n    this.#outputs.push(output);\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    return this.#input.fetch(req);\n  }\n\n  destroy(): void {\n    if (this.#destroyCount < this.#outputs.length) {\n      ++this.#destroyCount;\n      if (this.#destroyCount === this.#outputs.length) {\n        this.#input.destroy();\n      }\n    } else {\n      throw new Error('FanOut already destroyed once for each output');\n    }\n  }\n}\n"],"names":[],"mappings":";;AASO,MAAM,YAAgC;AAAA,EAC3C,gBAAwB;AAAA,EACxB;AAAA,EACS;AAAA,EACA,WAAqB,CAAA;AAAA,EAE9B,YAAY,OAAc;AACxB,SAAK,SAAS;AACd,UAAM,UAAU,IAAI;AAAA,EACtB;AAAA,EAEA,SAAS,OAAmB;AAC1B,WAAO,CAAC,KAAK,aAAa,mCAAmC;AAC7D,SAAK,cAAc;AAAA,EACrB;AAAA,EAEA,CAAC,KAAK,QAAiC;AACrC,SAAK,KAAK,WAAW,EAAE,qBAAA;AACvB,eAAW,UAAU,KAAK,UAAU;AAClC,aAAO,OAAO,KAAK,QAAQ,IAAI;AAAA,IACjC;AACA,WAAO,KAAK,KAAK,WAAW,EAAE,kBAAkB,OAAO,IAAI;AAAA,EAC7D;AAAA,EAEA,UAAU,QAAsB;AAC9B,SAAK,SAAS,KAAK,MAAM;AAAA,EAC3B;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK,OAAO,UAAA;AAAA,EACrB;AAAA,EAEA,MAAM,KAA2C;AAC/C,WAAO,KAAK,OAAO,MAAM,GAAG;AAAA,EAC9B;AAAA,EAEA,UAAgB;AACd,QAAI,KAAK,gBAAgB,KAAK,SAAS,QAAQ;AAC7C,QAAE,KAAK;AACP,UAAI,KAAK,kBAAkB,KAAK,SAAS,QAAQ;AAC/C,aAAK,OAAO,QAAA;AAAA,MACd;AAAA,IACF,OAAO;AACL,YAAM,IAAI,MAAM,+CAA+C;AAAA,IACjE;AAAA,EACF;AACF;"}

package/out/zql/src/ivm/view-apply-change.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"view-apply-change.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/view-apply-change.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,oCAAoC,CAAC;AAC5D,OAAO,EAAgC,KAAK,IAAI,EAAC,MAAM,WAAW,CAAC;AACnE,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,aAAa,CAAC;AAC9C,OAAO,KAAK,EAAC,KAAK,EAAE,MAAM,EAAC,MAAM,WAAW,CAAC;AAE7C,eAAO,MAAM,cAAc,eAAe,CAAC;AAC3C,eAAO,MAAM,QAAQ,eAAe,CAAC;AAQrC;;;;GAIG;AACH,MAAM,MAAM,UAAU,GAClB,aAAa,GACb,gBAAgB,GAChB,eAAe,GACf,cAAc,CAAC;AAEnB,MAAM,MAAM,WAAW,GAAG;IAAC,GAAG,EAAE,GAAG,CAAA;CAAC,CAAC;AAErC,MAAM,MAAM,aAAa,GAAG;IAC1B,IAAI,EAAE,KAAK,CAAC;IACZ,IAAI,EAAE,IAAI,CAAC;CACZ,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG;IAC7B,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,EAAE,IAAI,CAAC;CACZ,CAAC;AAEF,KAAK,eAAe,GAAG;IACrB,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,WAAW,CAAC;IAClB,KAAK,EAAE;QACL,gBAAgB,EAAE,MAAM,CAAC;QACzB,MAAM,EAAE,UAAU,CAAC;KACpB,CAAC;CACH,CAAC;AAEF,KAAK,cAAc,GAAG;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,WAAW,CAAC;IAClB,OAAO,EAAE,WAAW,CAAC;CACtB,CAAC;AAEF;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,GAAG,SAAS,CAAC;IACtC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1C,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAAC;CAC/B;AAED,wBAAgB,WAAW,CACzB,WAAW,EAAE,KAAK,EAClB,MAAM,EAAE,UAAU,EAClB,MAAM,EAAE,YAAY,EACpB,YAAY,EAAE,MAAM,EACpB,MAAM,EAAE,MAAM,EACd,OAAO,UAAQ,GACd,IAAI,CA2ON"}
+{"version":3,"file":"view-apply-change.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/view-apply-change.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,oCAAoC,CAAC;AAC5D,OAAO,EAAkB,KAAK,IAAI,EAAC,MAAM,WAAW,CAAC;AAErD,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,aAAa,CAAC;AAC9C,OAAO,KAAK,EAAC,KAAK,EAAE,MAAM,EAAC,MAAM,WAAW,CAAC;AAE7C,eAAO,MAAM,cAAc,eAAe,CAAC;AAC3C,eAAO,MAAM,QAAQ,eAAe,CAAC;AAQrC;;;;GAIG;AACH,MAAM,MAAM,UAAU,GAClB,aAAa,GACb,gBAAgB,GAChB,eAAe,GACf,cAAc,CAAC;AAEnB,MAAM,MAAM,WAAW,GAAG;IAAC,GAAG,EAAE,GAAG,CAAA;CAAC,CAAC;AAErC,MAAM,MAAM,aAAa,GAAG;IAC1B,IAAI,EAAE,KAAK,CAAC;IACZ,IAAI,EAAE,IAAI,CAAC;CACZ,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG;IAC7B,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,EAAE,IAAI,CAAC;CACZ,CAAC;AAEF,KAAK,eAAe,GAAG;IACrB,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,WAAW,CAAC;IAClB,KAAK,EAAE;QACL,gBAAgB,EAAE,MAAM,CAAC;QACzB,MAAM,EAAE,UAAU,CAAC;KACpB,CAAC;CACH,CAAC;AAEF,KAAK,cAAc,GAAG;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,WAAW,CAAC;IAClB,OAAO,EAAE,WAAW,CAAC;CACtB,CAAC;AAEF;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,GAAG,SAAS,CAAC;IACtC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1C,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAAC;CAC/B;AAED,wBAAgB,WAAW,CACzB,WAAW,EAAE,KAAK,EAClB,MAAM,EAAE,UAAU,EAClB,MAAM,EAAE,YAAY,EACpB,YAAY,EAAE,MAAM,EACpB,MAAM,EAAE,MAAM,EACd,OAAO,UAAQ,GACd,IAAI,CAyON"}

package/out/zql/src/ivm/view-apply-change.js

@@ -1,247 +1,277 @@
-import { assert, assertArray, assertNumber, unreachable, } from "../../../shared/src/asserts.js";
+import { unreachable, assert, assertNumber, assertArray } from "../../../shared/src/asserts.js";
 import { must } from "../../../shared/src/must.js";
-import { drainStreams } from "./data.js";
-export const refCountSymbol = Symbol('rc');
-export const idSymbol = Symbol('id');
-export function applyChange(parentEntry, change, schema, relationship, format, withIDs = false) {
-    if (schema.isHidden) {
-        switch (change.type) {
-            case 'add':
-            case 'remove':
-                for (const [relationship, children] of Object.entries(change.node.relationships)) {
-                    const childSchema = must(schema.relationships[relationship]);
-                    for (const node of children()) {
-                        applyChange(parentEntry, { type: change.type, node }, childSchema, relationship, format, withIDs);
-                    }
-                }
-                return;
-            case 'edit':
-                // If hidden at this level it means that the hidden row was changed. If
-                // the row was changed in such a way that it would change the
-                // relationships then the edit would have been split into remove and
-                // add.
-                return;
-            case 'child': {
-                const childSchema = must(schema.relationships[change.child.relationshipName]);
-                applyChange(parentEntry, change.child.change, childSchema, relationship, format, withIDs);
-                return;
-            }
-            default:
-                unreachable(change);
+import "compare-utf8";
+import { skipYields } from "./operator.js";
+const refCountSymbol = Symbol("rc");
+const idSymbol = Symbol("id");
+function applyChange(parentEntry, change, schema, relationship, format, withIDs = false) {
+  if (schema.isHidden) {
+    switch (change.type) {
+      case "add":
+      case "remove":
+        for (const [relationship2, children] of Object.entries(
+          change.node.relationships
+        )) {
+          const childSchema = must(schema.relationships[relationship2]);
+          for (const node of skipYields(children())) {
+            applyChange(
+              parentEntry,
+              { type: change.type, node },
+              childSchema,
+              relationship2,
+              format,
+              withIDs
+            );
+          }
         }
+        return;
+      case "edit":
+        return;
+      case "child": {
+        const childSchema = must(
+          schema.relationships[change.child.relationshipName]
+        );
+        applyChange(
+          parentEntry,
+          change.child.change,
+          childSchema,
+          relationship,
+          format,
+          withIDs
+        );
+        return;
+      }
+      default:
+        unreachable();
     }
-    const { singular, relationships: childFormats } = format;
-    switch (change.type) {
-        case 'add': {
-            let newEntry;
-            if (singular) {
-                const oldEntry = parentEntry[relationship];
-                if (oldEntry !== undefined) {
-                    assert(schema.compareRows(oldEntry, change.node.row) === 0, `Singular relationship '${relationship}' should not have multiple rows. You may need to declare this relationship with the \`many\` helper instead of the \`one\` helper in your schema.`);
-                    // adding same again.
-                    oldEntry[refCountSymbol]++;
-                }
-                else {
-                    newEntry = makeNewMetaEntry(change.node.row, schema, withIDs, 1);
-                    parentEntry[relationship] = newEntry;
-                }
-            }
-            else {
-                newEntry = add(change.node.row, getChildEntryList(parentEntry, relationship), schema, withIDs);
-            }
-            if (newEntry) {
-                for (const [relationship, children] of Object.entries(change.node.relationships)) {
-                    // TODO: Is there a flag to make TypeScript complain that dictionary access might be undefined?
-                    const childSchema = must(schema.relationships[relationship]);
-                    const childFormat = childFormats[relationship];
-                    if (childFormat === undefined) {
-                        continue;
-                    }
-                    const newView = childFormat.singular
-                        ? undefined
-                        : [];
-                    newEntry[relationship] = newView;
-                    for (const node of children()) {
-                        applyChange(newEntry, { type: 'add', node }, childSchema, relationship, childFormat, withIDs);
-                    }
-                }
-            }
-            break;
+  }
+  const { singular, relationships: childFormats } = format;
+  switch (change.type) {
+    case "add": {
+      let newEntry;
+      if (singular) {
+        const oldEntry = parentEntry[relationship];
+        if (oldEntry !== void 0) {
+          assert(
+            schema.compareRows(oldEntry, change.node.row) === 0,
+            `Singular relationship '${relationship}' should not have multiple rows. You may need to declare this relationship with the \`many\` helper instead of the \`one\` helper in your schema.`
+          );
+          oldEntry[refCountSymbol]++;
+        } else {
+          newEntry = makeNewMetaEntry(change.node.row, schema, withIDs, 1);
+          parentEntry[relationship] = newEntry;
         }
-        case 'remove': {
-            if (singular) {
-                const oldEntry = parentEntry[relationship];
-                assert(oldEntry !== undefined, 'node does not exist');
-                const rc = oldEntry[refCountSymbol];
-                if (rc === 1) {
-                    parentEntry[relationship] = undefined;
-                }
-                oldEntry[refCountSymbol]--;
-            }
-            else {
-                removeAndUpdateRefCount(getChildEntryList(parentEntry, relationship), change.node.row, schema.compareRows);
-            }
-            // Needed to ensure cleanup of operator state is fully done.
-            drainStreams(change.node);
-            break;
+      } else {
+        newEntry = add(
+          change.node.row,
+          getChildEntryList(parentEntry, relationship),
+          schema,
+          withIDs
+        );
+      }
+      if (newEntry) {
+        for (const [relationship2, children] of Object.entries(
+          change.node.relationships
+        )) {
+          const childSchema = must(schema.relationships[relationship2]);
+          const childFormat = childFormats[relationship2];
+          if (childFormat === void 0) {
+            continue;
+          }
+          const newView = childFormat.singular ? void 0 : [];
+          newEntry[relationship2] = newView;
+          for (const node of skipYields(children())) {
+            applyChange(
+              newEntry,
+              { type: "add", node },
+              childSchema,
+              relationship2,
+              childFormat,
+              withIDs
+            );
+          }
         }
-        case 'child': {
-            let existing;
-            if (singular) {
-                existing = getSingularEntry(parentEntry, relationship);
-            }
-            else {
-                const view = getChildEntryList(parentEntry, relationship);
-                const { pos, found } = binarySearch(view, change.node.row, schema.compareRows);
-                assert(found, 'node does not exist');
-                existing = view[pos];
-            }
-            const childSchema = must(schema.relationships[change.child.relationshipName]);
-            const childFormat = format.relationships[change.child.relationshipName];
-            if (childFormat !== undefined) {
-                applyChange(existing, change.child.change, childSchema, change.child.relationshipName, childFormat, withIDs);
-            }
-            break;
+      }
+      break;
+    }
+    case "remove": {
+      if (singular) {
+        const oldEntry = parentEntry[relationship];
+        assert(oldEntry !== void 0, "node does not exist");
+        const rc = oldEntry[refCountSymbol];
+        if (rc === 1) {
+          parentEntry[relationship] = void 0;
         }
-        case 'edit': {
-            if (singular) {
-                const existing = parentEntry[relationship];
-                assertMetaEntry(existing);
-                applyEdit(existing, change, schema, withIDs);
+        oldEntry[refCountSymbol]--;
+      } else {
+        removeAndUpdateRefCount(
+          getChildEntryList(parentEntry, relationship),
+          change.node.row,
+          schema.compareRows
+        );
+      }
+      break;
+    }
+    case "child": {
+      let existing;
+      if (singular) {
+        existing = getSingularEntry(parentEntry, relationship);
+      } else {
+        const view = getChildEntryList(parentEntry, relationship);
+        const { pos, found } = binarySearch(
+          view,
+          change.node.row,
+          schema.compareRows
+        );
+        assert(found, "node does not exist");
+        existing = view[pos];
+      }
+      const childSchema = must(
+        schema.relationships[change.child.relationshipName]
+      );
+      const childFormat = format.relationships[change.child.relationshipName];
+      if (childFormat !== void 0) {
+        applyChange(
+          existing,
+          change.child.change,
+          childSchema,
+          change.child.relationshipName,
+          childFormat,
+          withIDs
+        );
+      }
+      break;
+    }
+    case "edit": {
+      if (singular) {
+        const existing = parentEntry[relationship];
+        assertMetaEntry(existing);
+        applyEdit(existing, change, schema, withIDs);
+      } else {
+        const view = getChildEntryList(parentEntry, relationship);
+        if (schema.compareRows(change.oldNode.row, change.node.row) !== 0) {
+          const { pos: oldPos, found: oldFound } = binarySearch(
+            view,
+            change.oldNode.row,
+            schema.compareRows
+          );
+          assert(oldFound, "old node does not exist");
+          const oldEntry = view[oldPos];
+          const { pos, found } = binarySearch(
+            view,
+            change.node.row,
+            schema.compareRows
+          );
+          if (oldEntry[refCountSymbol] === 1 && (pos === oldPos || pos - 1 === oldPos)) {
+            applyEdit(oldEntry, change, schema, withIDs);
+          } else {
+            oldEntry[refCountSymbol]--;
+            let adjustedPos = pos;
+            if (oldEntry[refCountSymbol] === 0) {
+              view.splice(oldPos, 1);
+              adjustedPos = oldPos < pos ? pos - 1 : pos;
             }
-            else {
-                const view = getChildEntryList(parentEntry, relationship);
-                // The position of the row in the list may have changed due to the edit.
-                if (schema.compareRows(change.oldNode.row, change.node.row) !== 0) {
-                    const { pos: oldPos, found: oldFound } = binarySearch(view, change.oldNode.row, schema.compareRows);
-                    assert(oldFound, 'old node does not exist');
-                    const oldEntry = view[oldPos];
-                    const { pos, found } = binarySearch(view, change.node.row, schema.compareRows);
-                    // A special case:
-                    // when refCount is 1 (so the row is being moved
-                    // without leaving a placeholder behind), and the new pos is
-                    // the same as the old, or directly after the old (so after the remove
-                    // of the old it would be in the same pos):
-                    // the row does not need to be moved, it can just be edited in place.
-                    if (oldEntry[refCountSymbol] === 1 &&
-                        (pos === oldPos || pos - 1 === oldPos)) {
-                        applyEdit(oldEntry, change, schema, withIDs);
-                    }
-                    else {
-                        // Move the row.  If the row has > 1 ref count, an edit should
-                        // be received for each ref count.  On the first edit, the original
-                        // row is moved, the edit is applied to it and its ref count is set
-                        // to 1.  A shallow copy of the row is left at the old pos for
-                        // processing of the remaining edit, and the copy's ref count
-                        // is decremented.  As each edit is received the ref count of the
-                        // copy is decrement, and the ref count of the row at the new
-                        // position is incremented.  When the copy's ref count goes to 0,
-                        // it is removed.
-                        oldEntry[refCountSymbol]--;
-                        let adjustedPos = pos;
-                        if (oldEntry[refCountSymbol] === 0) {
-                            view.splice(oldPos, 1);
-                            adjustedPos = oldPos < pos ? pos - 1 : pos;
-                        }
-                        let entryToEdit;
-                        if (found) {
-                            entryToEdit = view[adjustedPos];
-                        }
-                        else {
-                            view.splice(adjustedPos, 0, oldEntry);
-                            entryToEdit = oldEntry;
-                            if (oldEntry[refCountSymbol] > 0) {
-                                const oldEntryCopy = { ...oldEntry };
-                                view[oldPos] = oldEntryCopy;
-                            }
-                        }
-                        entryToEdit[refCountSymbol]++;
-                        applyEdit(entryToEdit, change, schema, withIDs);
-                    }
-                }
-                else {
-                    // Position could not have changed, so simply edit in place.
-                    const { pos, found } = binarySearch(view, change.oldNode.row, schema.compareRows);
-                    assert(found, 'node does not exist');
-                    applyEdit(view[pos], change, schema, withIDs);
-                }
+            let entryToEdit;
+            if (found) {
+              entryToEdit = view[adjustedPos];
+            } else {
+              view.splice(adjustedPos, 0, oldEntry);
+              entryToEdit = oldEntry;
+              if (oldEntry[refCountSymbol] > 0) {
+                const oldEntryCopy = { ...oldEntry };
+                view[oldPos] = oldEntryCopy;
+              }
             }
-            break;
+            entryToEdit[refCountSymbol]++;
+            applyEdit(entryToEdit, change, schema, withIDs);
+          }
+        } else {
+          const { pos, found } = binarySearch(
+            view,
+            change.oldNode.row,
+            schema.compareRows
+          );
+          assert(found, "node does not exist");
+          applyEdit(view[pos], change, schema, withIDs);
         }
-        default:
-            unreachable(change);
+      }
+      break;
     }
+    default:
+      unreachable();
+  }
 }
 function applyEdit(existing, change, schema, withIDs) {
-    Object.assign(existing, change.node.row);
-    if (withIDs) {
-        existing[idSymbol] = makeID(change.node.row, schema);
-    }
+  Object.assign(existing, change.node.row);
+  if (withIDs) {
+    existing[idSymbol] = makeID(change.node.row, schema);
+  }
 }
 function add(row, view, schema, withIDs) {
-    const { pos, found } = binarySearch(view, row, schema.compareRows);
-    if (found) {
-        view[pos][refCountSymbol]++;
-        return undefined;
-    }
-    const newEntry = makeNewMetaEntry(row, schema, withIDs, 1);
-    view.splice(pos, 0, newEntry);
-    return newEntry;
+  const { pos, found } = binarySearch(view, row, schema.compareRows);
+  if (found) {
+    view[pos][refCountSymbol]++;
+    return void 0;
+  }
+  const newEntry = makeNewMetaEntry(row, schema, withIDs, 1);
+  view.splice(pos, 0, newEntry);
+  return newEntry;
 }
 function removeAndUpdateRefCount(view, row, compareRows) {
-    const { pos, found } = binarySearch(view, row, compareRows);
-    assert(found, 'node does not exist');
-    const oldEntry = view[pos];
-    const rc = oldEntry[refCountSymbol];
-    if (rc === 1) {
-        view.splice(pos, 1);
-    }
-    oldEntry[refCountSymbol]--;
-    return oldEntry;
+  const { pos, found } = binarySearch(view, row, compareRows);
+  assert(found, "node does not exist");
+  const oldEntry = view[pos];
+  const rc = oldEntry[refCountSymbol];
+  if (rc === 1) {
+    view.splice(pos, 1);
+  }
+  oldEntry[refCountSymbol]--;
+  return oldEntry;
 }
-// TODO: Do not return an object. It puts unnecessary pressure on the GC.
 function binarySearch(view, target, comparator) {
-    let low = 0;
-    let high = view.length - 1;
-    while (low <= high) {
-        const mid = (low + high) >>> 1;
-        const comparison = comparator(view[mid], target);
-        if (comparison < 0) {
-            low = mid + 1;
-        }
-        else if (comparison > 0) {
-            high = mid - 1;
-        }
-        else {
-            return { pos: mid, found: true };
-        }
+  let low = 0;
+  let high = view.length - 1;
+  while (low <= high) {
+    const mid = low + high >>> 1;
+    const comparison = comparator(view[mid], target);
+    if (comparison < 0) {
+      low = mid + 1;
+    } else if (comparison > 0) {
+      high = mid - 1;
+    } else {
+      return { pos: mid, found: true };
     }
-    return { pos: low, found: false };
+  }
+  return { pos: low, found: false };
 }
 function getChildEntryList(parentEntry, relationship) {
-    const view = parentEntry[relationship];
-    assertArray(view);
-    return view;
+  const view = parentEntry[relationship];
+  assertArray(view);
+  return view;
 }
 function assertMetaEntry(v) {
-    assertNumber(v[refCountSymbol]);
+  assertNumber(v[refCountSymbol]);
 }
 function getSingularEntry(parentEntry, relationship) {
-    const e = parentEntry[relationship];
-    assertNumber(e[refCountSymbol]);
-    return e;
+  const e = parentEntry[relationship];
+  assertNumber(e[refCountSymbol]);
+  return e;
 }
 function makeNewMetaEntry(row, schema, withIDs, rc) {
-    if (withIDs) {
-        return { ...row, [refCountSymbol]: rc, [idSymbol]: makeID(row, schema) };
-    }
-    return { ...row, [refCountSymbol]: rc };
+  if (withIDs) {
+    return { ...row, [refCountSymbol]: rc, [idSymbol]: makeID(row, schema) };
+  }
+  return { ...row, [refCountSymbol]: rc };
 }
 function makeID(row, schema) {
-    // optimization for case of non-compound primary key
-    if (schema.primaryKey.length === 1) {
-        return JSON.stringify(row[schema.primaryKey[0]]);
-    }
-    return JSON.stringify(schema.primaryKey.map(k => row[k]));
+  if (schema.primaryKey.length === 1) {
+    return JSON.stringify(row[schema.primaryKey[0]]);
+  }
+  return JSON.stringify(schema.primaryKey.map((k) => row[k]));
 }
-//# sourceMappingURL=view-apply-change.js.map
+export {
+  applyChange,
+  idSymbol,
+  refCountSymbol
+};
+//# sourceMappingURL=view-apply-change.js.map