@rocicorp/zero 0.25.0-canary.0 → 0.25.0-canary.10

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);
+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 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 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
+        );
+      }
+      drainStreams(change.node);
+      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

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

@@ -1 +1 @@
-{"version":3,"file":"view-apply-change.js","sourceRoot":"","sources":["../../../../../zql/src/ivm/view-apply-change.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,MAAM,EACN,WAAW,EACX,YAAY,EACZ,WAAW,GACZ,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAC,IAAI,EAAC,MAAM,6BAA6B,CAAC;AAGjD,OAAO,EAAC,YAAY,EAA6B,MAAM,WAAW,CAAC;AAInE,MAAM,CAAC,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;AAC3C,MAAM,CAAC,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;AAwDrC,MAAM,UAAU,WAAW,CACzB,WAAkB,EAClB,MAAkB,EAClB,MAAoB,EACpB,YAAoB,EACpB,MAAc,EACd,OAAO,GAAG,KAAK;IAEf,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACpB,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,KAAK,CAAC;YACX,KAAK,QAAQ;gBACX,KAAK,MAAM,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CACnD,MAAM,CAAC,IAAI,CAAC,aAAa,CAC1B,EAAE,CAAC;oBACF,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC;oBAC7D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,EAAE,CAAC;wBAC9B,WAAW,CACT,WAAW,EACX,EAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,EAAC,EACzB,WAAW,EACX,YAAY,EACZ,MAAM,EACN,OAAO,CACR,CAAC;oBACJ,CAAC;gBACH,CAAC;gBACD,OAAO;YACT,KAAK,MAAM;gBACT,uEAAuE;gBACvE,6DAA6D;gBAC7D,oEAAoE;gBACpE,OAAO;gBACP,OAAO;YACT,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,MAAM,WAAW,GAAG,IAAI,CACtB,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CACpD,CAAC;gBACF,WAAW,CACT,WAAW,EACX,MAAM,CAAC,KAAK,CAAC,MAAM,EACnB,WAAW,EACX,YAAY,EACZ,MAAM,EACN,OAAO,CACR,CAAC;gBACF,OAAO;YACT,CAAC;YACD;gBACE,WAAW,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,MAAM,EAAC,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAC,GAAG,MAAM,CAAC;IACvD,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,QAA+B,CAAC;YAEpC,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,CAA0B,CAAC;gBACpE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC3B,MAAM,CACJ,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EACnD,0BAA0B,YAAY,mJAAmJ,CAC1L,CAAC;oBACF,qBAAqB;oBACrB,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC7B,CAAC;qBAAM,CAAC;oBACN,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;oBAEhE,WAA+B,CAAC,YAAY,CAAC,GAAG,QAAQ,CAAC;gBAC5D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,QAAQ,GAAG,GAAG,CACZ,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,EAC5C,MAAM,EACN,OAAO,CACR,CAAC;YACJ,CAAC;YAED,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,MAAM,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CACnD,MAAM,CAAC,IAAI,CAAC,aAAa,CAC1B,EAAE,CAAC;oBACF,+FAA+F;oBAC/F,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC;oBAC7D,MAAM,WAAW,GAAG,YAAY,CAAC,YAAY,CAAC,CAAC;oBAC/C,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;wBAC9B,SAAS;oBACX,CAAC;oBAED,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ;wBAClC,CAAC,CAAC,SAAS;wBACX,CAAC,CAAE,EAAoB,CAAC;oBAC1B,QAAQ,CAAC,YAAY,CAAC,GAAG,OAAO,CAAC;oBAEjC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,EAAE,CAAC;wBAC9B,WAAW,CACT,QAAQ,EACR,EAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAC,EACnB,WAAW,EACX,YAAY,EACZ,WAAW,EACX,OAAO,CACR,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,CAA0B,CAAC;gBACpE,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,qBAAqB,CAAC,CAAC;gBACtD,MAAM,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC;gBACpC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;oBACZ,WAA+B,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC;gBAC7D,CAAC;gBACD,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,uBAAuB,CACrB,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,EAC5C,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,MAAM,CAAC,WAAW,CACnB,CAAC;YACJ,CAAC;YACD,4DAA4D;YAC5D,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,MAAM;QACR,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,QAAmB,CAAC;YACxB,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,GAAG,gBAAgB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,GAAG,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;gBAC1D,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAC/B,IAAI,EACJ,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,MAAM,CAAC,WAAW,CACnB,CAAC;gBACF,MAAM,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;gBACrC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;YAED,MAAM,WAAW,GAAG,IAAI,CACtB,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CACpD,CAAC;YACF,MAAM,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACxE,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC9B,WAAW,CACT,QAAQ,EACR,MAAM,CAAC,KAAK,CAAC,MAAM,EACnB,WAAW,EACX,MAAM,CAAC,KAAK,CAAC,gBAAgB,EAC7B,WAAW,EACX,OAAO,CACR,CAAC;YACJ,CAAC;YACD,MAAM;QACR,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,QAAQ,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;gBAC3C,eAAe,CAAC,QAAQ,CAAC,CAAC;gBAC1B,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;YAC/C,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,GAAG,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;gBAC1D,wEAAwE;gBACxE,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAClE,MAAM,EAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAC,GAAG,YAAY,CACjD,IAAI,EACJ,MAAM,CAAC,OAAO,CAAC,GAAG,EAClB,MAAM,CAAC,WAAW,CACnB,CAAC;oBACF,MAAM,CAAC,QAAQ,EAAE,yBAAyB,CAAC,CAAC;oBAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC9B,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAC/B,IAAI,EACJ,MAAM,CAAC,IAAI,CAAC,GAAG,EACf,MAAM,CAAC,WAAW,CACnB,CAAC;oBACF,kBAAkB;oBAClB,gDAAgD;oBAChD,4DAA4D;oBAC5D,sEAAsE;oBACtE,2CAA2C;oBAC3C,qEAAqE;oBACrE,IACE,QAAQ,CAAC,cAAc,CAAC,KAAK,CAAC;wBAC9B,CAAC,GAAG,KAAK,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,MAAM,CAAC,EACtC,CAAC;wBACD,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;oBAC/C,CAAC;yBAAM,CAAC;wBACN,8DAA8D;wBAC9D,mEAAmE;wBACnE,mEAAmE;wBACnE,8DAA8D;wBAC9D,6DAA6D;wBAC7D,iEAAiE;wBACjE,6DAA6D;wBAC7D,iEAAiE;wBACjE,iBAAiB;wBACjB,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;wBAC3B,IAAI,WAAW,GAAG,GAAG,CAAC;wBACtB,IAAI,QAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,CAAC;4BACnC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;4BACvB,WAAW,GAAG,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;wBAC7C,CAAC;wBAED,IAAI,WAAW,CAAC;wBAChB,IAAI,KAAK,EAAE,CAAC;4BACV,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;wBAClC,CAAC;6BAAM,CAAC;4BACN,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;4BACtC,WAAW,GAAG,QAAQ,CAAC;4BACvB,IAAI,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;gCACjC,MAAM,YAAY,GAAG,EAAC,GAAG,QAAQ,EAAC,CAAC;gCACnC,IAAI,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC;4BAC9B,CAAC;wBACH,CAAC;wBACD,WAAW,CAAC,cAAc,CAAC,EAAE,CAAC;wBAC9B,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;oBAClD,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,4DAA4D;oBAC5D,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAC/B,IAAI,EACJ,MAAM,CAAC,OAAO,CAAC,GAAG,EAClB,MAAM,CAAC,WAAW,CACnB,CAAC;oBACF,MAAM,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;oBACrC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBAChD,CAAC;YACH,CAAC;YAED,MAAM;QACR,CAAC;QACD;YACE,WAAW,CAAC,MAAM,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAChB,QAAmB,EACnB,MAAsB,EACtB,MAAoB,EACpB,OAAgB;IAEhB,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzC,IAAI,OAAO,EAAE,CAAC;QACZ,QAAQ,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACvD,CAAC;AACH,CAAC;AAED,SAAS,GAAG,CACV,GAAQ,EACR,IAAmB,EACnB,MAAoB,EACpB,OAAgB;IAEhB,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;IAEjE,IAAI,KAAK,EAAE,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,EAAE,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IAC3D,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC9B,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,uBAAuB,CAC9B,IAAmB,EACnB,GAAQ,EACR,WAAuB;IAEvB,MAAM,EAAC,GAAG,EAAE,KAAK,EAAC,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;IAC1D,MAAM,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC;IACpC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACb,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;IAE3B,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,yEAAyE;AACzE,SAAS,YAAY,CACnB,IAAmB,EACnB,MAAW,EACX,UAAsB;IAEtB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,OAAO,GAAG,IAAI,IAAI,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAQ,EAAE,MAAa,CAAC,CAAC;QAC/D,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAChB,CAAC;aAAM,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,OAAO,EAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,EAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAC,CAAC;AAClC,CAAC;AAED,SAAS,iBAAiB,CACxB,WAAkB,EAClB,YAAoB;IAEpB,MAAM,IAAI,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;IACvC,WAAW,CAAC,IAAI,CAAC,CAAC;IAClB,OAAO,IAAqB,CAAC;AAC/B,CAAC;AAED,SAAS,eAAe,CAAC,CAAU;IACjC,YAAY,CAAE,CAAwB,CAAC,cAAc,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,gBAAgB,CAAC,WAAkB,EAAE,YAAoB;IAChE,MAAM,CAAC,GAAG,WAAW,CAAC,YAAY,CAAC,CAAC;IACpC,YAAY,CAAE,CAAwB,CAAC,cAAc,CAAC,CAAC,CAAC;IACxD,OAAO,CAAc,CAAC;AACxB,CAAC;AAED,SAAS,gBAAgB,CACvB,GAAQ,EACR,MAAoB,EACpB,OAAgB,EAChB,EAAU;IAEV,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,EAAC,GAAG,GAAG,EAAE,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,EAAC,CAAC;IACzE,CAAC;IACD,OAAO,EAAC,GAAG,GAAG,EAAE,CAAC,cAAc,CAAC,EAAE,EAAE,EAAC,CAAC;AACxC,CAAC;AACD,SAAS,MAAM,CAAC,GAAQ,EAAE,MAAoB;IAC5C,oDAAoD;IACpD,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnC,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC"}
+{"version":3,"file":"view-apply-change.js","sources":["../../../../../zql/src/ivm/view-apply-change.ts"],"sourcesContent":["import {\n  assert,\n  assertArray,\n  assertNumber,\n  unreachable,\n} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {Writable} from '../../../shared/src/writable.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport {drainStreams, type Comparator, type Node} from './data.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Entry, Format} from './view.ts';\n\nexport const refCountSymbol = Symbol('rc');\nexport const idSymbol = Symbol('id');\n\ntype MetaEntry = Writable<Entry> & {\n  [refCountSymbol]: number;\n  [idSymbol]?: string | undefined;\n};\ntype MetaEntryList = MetaEntry[];\n\n/**\n * `applyChange` does not consume the `relationships` of `ChildChange#node`,\n * `EditChange#node` and `EditChange#oldNode`.  The `ViewChange` type\n * documents and enforces this via the type system.\n */\nexport type ViewChange =\n  | AddViewChange\n  | RemoveViewChange\n  | ChildViewChange\n  | EditViewChange;\n\nexport type RowOnlyNode = {row: Row};\n\nexport type AddViewChange = {\n  type: 'add';\n  node: Node;\n};\n\nexport type RemoveViewChange = {\n  type: 'remove';\n  node: Node;\n};\n\ntype ChildViewChange = {\n  type: 'child';\n  node: RowOnlyNode;\n  child: {\n    relationshipName: string;\n    change: ViewChange;\n  };\n};\n\ntype EditViewChange = {\n  type: 'edit';\n  node: RowOnlyNode;\n  oldNode: RowOnlyNode;\n};\n\n/**\n * This is a subset of WeakMap but restricted to what we need.\n * @deprecated Not used anymore. This will be removed in the future.\n */\nexport interface RefCountMap {\n  get(entry: Entry): number | undefined;\n  set(entry: Entry, refCount: number): void;\n  delete(entry: Entry): boolean;\n}\n\nexport function applyChange(\n  parentEntry: Entry,\n  change: ViewChange,\n  schema: SourceSchema,\n  relationship: string,\n  format: Format,\n  withIDs = false,\n): void {\n  if (schema.isHidden) {\n    switch (change.type) {\n      case 'add':\n      case 'remove':\n        for (const [relationship, children] of Object.entries(\n          change.node.relationships,\n        )) {\n          const childSchema = must(schema.relationships[relationship]);\n          for (const node of children()) {\n            applyChange(\n              parentEntry,\n              {type: change.type, node},\n              childSchema,\n              relationship,\n              format,\n              withIDs,\n            );\n          }\n        }\n        return;\n      case 'edit':\n        // If hidden at this level it means that the hidden row was changed. If\n        // the row was changed in such a way that it would change the\n        // relationships then the edit would have been split into remove and\n        // add.\n        return;\n      case 'child': {\n        const childSchema = must(\n          schema.relationships[change.child.relationshipName],\n        );\n        applyChange(\n          parentEntry,\n          change.child.change,\n          childSchema,\n          relationship,\n          format,\n          withIDs,\n        );\n        return;\n      }\n      default:\n        unreachable(change);\n    }\n  }\n\n  const {singular, relationships: childFormats} = format;\n  switch (change.type) {\n    case 'add': {\n      let newEntry: MetaEntry | undefined;\n\n      if (singular) {\n        const oldEntry = parentEntry[relationship] as MetaEntry | undefined;\n        if (oldEntry !== undefined) {\n          assert(\n            schema.compareRows(oldEntry, change.node.row) === 0,\n            `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.`,\n          );\n          // adding same again.\n          oldEntry[refCountSymbol]++;\n        } else {\n          newEntry = makeNewMetaEntry(change.node.row, schema, withIDs, 1);\n\n          (parentEntry as Writable<Entry>)[relationship] = newEntry;\n        }\n      } else {\n        newEntry = add(\n          change.node.row,\n          getChildEntryList(parentEntry, relationship),\n          schema,\n          withIDs,\n        );\n      }\n\n      if (newEntry) {\n        for (const [relationship, children] of Object.entries(\n          change.node.relationships,\n        )) {\n          // TODO: Is there a flag to make TypeScript complain that dictionary access might be undefined?\n          const childSchema = must(schema.relationships[relationship]);\n          const childFormat = childFormats[relationship];\n          if (childFormat === undefined) {\n            continue;\n          }\n\n          const newView = childFormat.singular\n            ? undefined\n            : ([] as MetaEntryList);\n          newEntry[relationship] = newView;\n\n          for (const node of children()) {\n            applyChange(\n              newEntry,\n              {type: 'add', node},\n              childSchema,\n              relationship,\n              childFormat,\n              withIDs,\n            );\n          }\n        }\n      }\n      break;\n    }\n    case 'remove': {\n      if (singular) {\n        const oldEntry = parentEntry[relationship] as MetaEntry | undefined;\n        assert(oldEntry !== undefined, 'node does not exist');\n        const rc = oldEntry[refCountSymbol];\n        if (rc === 1) {\n          (parentEntry as Writable<Entry>)[relationship] = undefined;\n        }\n        oldEntry[refCountSymbol]--;\n      } else {\n        removeAndUpdateRefCount(\n          getChildEntryList(parentEntry, relationship),\n          change.node.row,\n          schema.compareRows,\n        );\n      }\n      // Needed to ensure cleanup of operator state is fully done.\n      drainStreams(change.node);\n      break;\n    }\n    case 'child': {\n      let existing: MetaEntry;\n      if (singular) {\n        existing = getSingularEntry(parentEntry, relationship);\n      } else {\n        const view = getChildEntryList(parentEntry, relationship);\n        const {pos, found} = binarySearch(\n          view,\n          change.node.row,\n          schema.compareRows,\n        );\n        assert(found, 'node does not exist');\n        existing = view[pos];\n      }\n\n      const childSchema = must(\n        schema.relationships[change.child.relationshipName],\n      );\n      const childFormat = format.relationships[change.child.relationshipName];\n      if (childFormat !== undefined) {\n        applyChange(\n          existing,\n          change.child.change,\n          childSchema,\n          change.child.relationshipName,\n          childFormat,\n          withIDs,\n        );\n      }\n      break;\n    }\n    case 'edit': {\n      if (singular) {\n        const existing = parentEntry[relationship];\n        assertMetaEntry(existing);\n        applyEdit(existing, change, schema, withIDs);\n      } else {\n        const view = getChildEntryList(parentEntry, relationship);\n        // The position of the row in the list may have changed due to the edit.\n        if (schema.compareRows(change.oldNode.row, change.node.row) !== 0) {\n          const {pos: oldPos, found: oldFound} = binarySearch(\n            view,\n            change.oldNode.row,\n            schema.compareRows,\n          );\n          assert(oldFound, 'old node does not exist');\n          const oldEntry = view[oldPos];\n          const {pos, found} = binarySearch(\n            view,\n            change.node.row,\n            schema.compareRows,\n          );\n          // A special case:\n          // when refCount is 1 (so the row is being moved\n          // without leaving a placeholder behind), and the new pos is\n          // the same as the old, or directly after the old (so after the remove\n          // of the old it would be in the same pos):\n          // the row does not need to be moved, it can just be edited in place.\n          if (\n            oldEntry[refCountSymbol] === 1 &&\n            (pos === oldPos || pos - 1 === oldPos)\n          ) {\n            applyEdit(oldEntry, change, schema, withIDs);\n          } else {\n            // Move the row.  If the row has > 1 ref count, an edit should\n            // be received for each ref count.  On the first edit, the original\n            // row is moved, the edit is applied to it and its ref count is set\n            // to 1.  A shallow copy of the row is left at the old pos for\n            // processing of the remaining edit, and the copy's ref count\n            // is decremented.  As each edit is received the ref count of the\n            // copy is decrement, and the ref count of the row at the new\n            // position is incremented.  When the copy's ref count goes to 0,\n            // it is removed.\n            oldEntry[refCountSymbol]--;\n            let adjustedPos = pos;\n            if (oldEntry[refCountSymbol] === 0) {\n              view.splice(oldPos, 1);\n              adjustedPos = oldPos < pos ? pos - 1 : pos;\n            }\n\n            let entryToEdit;\n            if (found) {\n              entryToEdit = view[adjustedPos];\n            } else {\n              view.splice(adjustedPos, 0, oldEntry);\n              entryToEdit = oldEntry;\n              if (oldEntry[refCountSymbol] > 0) {\n                const oldEntryCopy = {...oldEntry};\n                view[oldPos] = oldEntryCopy;\n              }\n            }\n            entryToEdit[refCountSymbol]++;\n            applyEdit(entryToEdit, change, schema, withIDs);\n          }\n        } else {\n          // Position could not have changed, so simply edit in place.\n          const {pos, found} = binarySearch(\n            view,\n            change.oldNode.row,\n            schema.compareRows,\n          );\n          assert(found, 'node does not exist');\n          applyEdit(view[pos], change, schema, withIDs);\n        }\n      }\n\n      break;\n    }\n    default:\n      unreachable(change);\n  }\n}\n\nfunction applyEdit(\n  existing: MetaEntry,\n  change: EditViewChange,\n  schema: SourceSchema,\n  withIDs: boolean,\n) {\n  Object.assign(existing, change.node.row);\n  if (withIDs) {\n    existing[idSymbol] = makeID(change.node.row, schema);\n  }\n}\n\nfunction add(\n  row: Row,\n  view: MetaEntryList,\n  schema: SourceSchema,\n  withIDs: boolean,\n): MetaEntry | undefined {\n  const {pos, found} = binarySearch(view, row, schema.compareRows);\n\n  if (found) {\n    view[pos][refCountSymbol]++;\n    return undefined;\n  }\n  const newEntry = makeNewMetaEntry(row, schema, withIDs, 1);\n  view.splice(pos, 0, newEntry);\n  return newEntry;\n}\n\nfunction removeAndUpdateRefCount(\n  view: MetaEntryList,\n  row: Row,\n  compareRows: Comparator,\n): MetaEntry {\n  const {pos, found} = binarySearch(view, row, compareRows);\n  assert(found, 'node does not exist');\n  const oldEntry = view[pos];\n  const rc = oldEntry[refCountSymbol];\n  if (rc === 1) {\n    view.splice(pos, 1);\n  }\n  oldEntry[refCountSymbol]--;\n\n  return oldEntry;\n}\n\n// TODO: Do not return an object. It puts unnecessary pressure on the GC.\nfunction binarySearch(\n  view: MetaEntryList,\n  target: Row,\n  comparator: Comparator,\n) {\n  let low = 0;\n  let high = view.length - 1;\n  while (low <= high) {\n    const mid = (low + high) >>> 1;\n    const comparison = comparator(view[mid] as Row, target as Row);\n    if (comparison < 0) {\n      low = mid + 1;\n    } else if (comparison > 0) {\n      high = mid - 1;\n    } else {\n      return {pos: mid, found: true};\n    }\n  }\n  return {pos: low, found: false};\n}\n\nfunction getChildEntryList(\n  parentEntry: Entry,\n  relationship: string,\n): MetaEntryList {\n  const view = parentEntry[relationship];\n  assertArray(view);\n  return view as MetaEntryList;\n}\n\nfunction assertMetaEntry(v: unknown): asserts v is MetaEntry {\n  assertNumber((v as Partial<MetaEntry>)[refCountSymbol]);\n}\n\nfunction getSingularEntry(parentEntry: Entry, relationship: string): MetaEntry {\n  const e = parentEntry[relationship];\n  assertNumber((e as Partial<MetaEntry>)[refCountSymbol]);\n  return e as MetaEntry;\n}\n\nfunction makeNewMetaEntry(\n  row: Row,\n  schema: SourceSchema,\n  withIDs: boolean,\n  rc: number,\n): MetaEntry {\n  if (withIDs) {\n    return {...row, [refCountSymbol]: rc, [idSymbol]: makeID(row, schema)};\n  }\n  return {...row, [refCountSymbol]: rc};\n}\nfunction makeID(row: Row, schema: SourceSchema) {\n  // optimization for case of non-compound primary key\n  if (schema.primaryKey.length === 1) {\n    return JSON.stringify(row[schema.primaryKey[0]]);\n  }\n  return JSON.stringify(schema.primaryKey.map(k => row[k]));\n}\n"],"names":["relationship"],"mappings":";;;AAaO,MAAM,iBAAiB,OAAO,IAAI;AAClC,MAAM,WAAW,OAAO,IAAI;AAwD5B,SAAS,YACd,aACA,QACA,QACA,cACA,QACA,UAAU,OACJ;AACN,MAAI,OAAO,UAAU;AACnB,YAAQ,OAAO,MAAA;AAAA,MACb,KAAK;AAAA,MACL,KAAK;AACH,mBAAW,CAACA,eAAc,QAAQ,KAAK,OAAO;AAAA,UAC5C,OAAO,KAAK;AAAA,QAAA,GACX;AACD,gBAAM,cAAc,KAAK,OAAO,cAAcA,aAAY,CAAC;AAC3D,qBAAW,QAAQ,YAAY;AAC7B;AAAA,cACE;AAAA,cACA,EAAC,MAAM,OAAO,MAAM,KAAA;AAAA,cACpB;AAAA,cACAA;AAAAA,cACA;AAAA,cACA;AAAA,YAAA;AAAA,UAEJ;AAAA,QACF;AACA;AAAA,MACF,KAAK;AAKH;AAAA,MACF,KAAK,SAAS;AACZ,cAAM,cAAc;AAAA,UAClB,OAAO,cAAc,OAAO,MAAM,gBAAgB;AAAA,QAAA;AAEpD;AAAA,UACE;AAAA,UACA,OAAO,MAAM;AAAA,UACb;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAEF;AAAA,MACF;AAAA,MACA;AACE,oBAAkB;AAAA,IAAA;AAAA,EAExB;AAEA,QAAM,EAAC,UAAU,eAAe,aAAA,IAAgB;AAChD,UAAQ,OAAO,MAAA;AAAA,IACb,KAAK,OAAO;AACV,UAAI;AAEJ,UAAI,UAAU;AACZ,cAAM,WAAW,YAAY,YAAY;AACzC,YAAI,aAAa,QAAW;AAC1B;AAAA,YACE,OAAO,YAAY,UAAU,OAAO,KAAK,GAAG,MAAM;AAAA,YAClD,0BAA0B,YAAY;AAAA,UAAA;AAGxC,mBAAS,cAAc;AAAA,QACzB,OAAO;AACL,qBAAW,iBAAiB,OAAO,KAAK,KAAK,QAAQ,SAAS,CAAC;AAE9D,sBAAgC,YAAY,IAAI;AAAA,QACnD;AAAA,MACF,OAAO;AACL,mBAAW;AAAA,UACT,OAAO,KAAK;AAAA,UACZ,kBAAkB,aAAa,YAAY;AAAA,UAC3C;AAAA,UACA;AAAA,QAAA;AAAA,MAEJ;AAEA,UAAI,UAAU;AACZ,mBAAW,CAACA,eAAc,QAAQ,KAAK,OAAO;AAAA,UAC5C,OAAO,KAAK;AAAA,QAAA,GACX;AAED,gBAAM,cAAc,KAAK,OAAO,cAAcA,aAAY,CAAC;AAC3D,gBAAM,cAAc,aAAaA,aAAY;AAC7C,cAAI,gBAAgB,QAAW;AAC7B;AAAA,UACF;AAEA,gBAAM,UAAU,YAAY,WACxB,SACC,CAAA;AACL,mBAASA,aAAY,IAAI;AAEzB,qBAAW,QAAQ,YAAY;AAC7B;AAAA,cACE;AAAA,cACA,EAAC,MAAM,OAAO,KAAA;AAAA,cACd;AAAA,cACAA;AAAAA,cACA;AAAA,cACA;AAAA,YAAA;AAAA,UAEJ;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA,KAAK,UAAU;AACb,UAAI,UAAU;AACZ,cAAM,WAAW,YAAY,YAAY;AACzC,eAAO,aAAa,QAAW,qBAAqB;AACpD,cAAM,KAAK,SAAS,cAAc;AAClC,YAAI,OAAO,GAAG;AACX,sBAAgC,YAAY,IAAI;AAAA,QACnD;AACA,iBAAS,cAAc;AAAA,MACzB,OAAO;AACL;AAAA,UACE,kBAAkB,aAAa,YAAY;AAAA,UAC3C,OAAO,KAAK;AAAA,UACZ,OAAO;AAAA,QAAA;AAAA,MAEX;AAEA,mBAAa,OAAO,IAAI;AACxB;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,UAAI;AACJ,UAAI,UAAU;AACZ,mBAAW,iBAAiB,aAAa,YAAY;AAAA,MACvD,OAAO;AACL,cAAM,OAAO,kBAAkB,aAAa,YAAY;AACxD,cAAM,EAAC,KAAK,MAAA,IAAS;AAAA,UACnB;AAAA,UACA,OAAO,KAAK;AAAA,UACZ,OAAO;AAAA,QAAA;AAET,eAAO,OAAO,qBAAqB;AACnC,mBAAW,KAAK,GAAG;AAAA,MACrB;AAEA,YAAM,cAAc;AAAA,QAClB,OAAO,cAAc,OAAO,MAAM,gBAAgB;AAAA,MAAA;AAEpD,YAAM,cAAc,OAAO,cAAc,OAAO,MAAM,gBAAgB;AACtE,UAAI,gBAAgB,QAAW;AAC7B;AAAA,UACE;AAAA,UACA,OAAO,MAAM;AAAA,UACb;AAAA,UACA,OAAO,MAAM;AAAA,UACb;AAAA,UACA;AAAA,QAAA;AAAA,MAEJ;AACA;AAAA,IACF;AAAA,IACA,KAAK,QAAQ;AACX,UAAI,UAAU;AACZ,cAAM,WAAW,YAAY,YAAY;AACzC,wBAAgB,QAAQ;AACxB,kBAAU,UAAU,QAAQ,QAAQ,OAAO;AAAA,MAC7C,OAAO;AACL,cAAM,OAAO,kBAAkB,aAAa,YAAY;AAExD,YAAI,OAAO,YAAY,OAAO,QAAQ,KAAK,OAAO,KAAK,GAAG,MAAM,GAAG;AACjE,gBAAM,EAAC,KAAK,QAAQ,OAAO,aAAY;AAAA,YACrC;AAAA,YACA,OAAO,QAAQ;AAAA,YACf,OAAO;AAAA,UAAA;AAET,iBAAO,UAAU,yBAAyB;AAC1C,gBAAM,WAAW,KAAK,MAAM;AAC5B,gBAAM,EAAC,KAAK,MAAA,IAAS;AAAA,YACnB;AAAA,YACA,OAAO,KAAK;AAAA,YACZ,OAAO;AAAA,UAAA;AAQT,cACE,SAAS,cAAc,MAAM,MAC5B,QAAQ,UAAU,MAAM,MAAM,SAC/B;AACA,sBAAU,UAAU,QAAQ,QAAQ,OAAO;AAAA,UAC7C,OAAO;AAUL,qBAAS,cAAc;AACvB,gBAAI,cAAc;AAClB,gBAAI,SAAS,cAAc,MAAM,GAAG;AAClC,mBAAK,OAAO,QAAQ,CAAC;AACrB,4BAAc,SAAS,MAAM,MAAM,IAAI;AAAA,YACzC;AAEA,gBAAI;AACJ,gBAAI,OAAO;AACT,4BAAc,KAAK,WAAW;AAAA,YAChC,OAAO;AACL,mBAAK,OAAO,aAAa,GAAG,QAAQ;AACpC,4BAAc;AACd,kBAAI,SAAS,cAAc,IAAI,GAAG;AAChC,sBAAM,eAAe,EAAC,GAAG,SAAA;AACzB,qBAAK,MAAM,IAAI;AAAA,cACjB;AAAA,YACF;AACA,wBAAY,cAAc;AAC1B,sBAAU,aAAa,QAAQ,QAAQ,OAAO;AAAA,UAChD;AAAA,QACF,OAAO;AAEL,gBAAM,EAAC,KAAK,MAAA,IAAS;AAAA,YACnB;AAAA,YACA,OAAO,QAAQ;AAAA,YACf,OAAO;AAAA,UAAA;AAET,iBAAO,OAAO,qBAAqB;AACnC,oBAAU,KAAK,GAAG,GAAG,QAAQ,QAAQ,OAAO;AAAA,QAC9C;AAAA,MACF;AAEA;AAAA,IACF;AAAA,IACA;AACE,kBAAkB;AAAA,EAAA;AAExB;AAEA,SAAS,UACP,UACA,QACA,QACA,SACA;AACA,SAAO,OAAO,UAAU,OAAO,KAAK,GAAG;AACvC,MAAI,SAAS;AACX,aAAS,QAAQ,IAAI,OAAO,OAAO,KAAK,KAAK,MAAM;AAAA,EACrD;AACF;AAEA,SAAS,IACP,KACA,MACA,QACA,SACuB;AACvB,QAAM,EAAC,KAAK,UAAS,aAAa,MAAM,KAAK,OAAO,WAAW;AAE/D,MAAI,OAAO;AACT,SAAK,GAAG,EAAE,cAAc;AACxB,WAAO;AAAA,EACT;AACA,QAAM,WAAW,iBAAiB,KAAK,QAAQ,SAAS,CAAC;AACzD,OAAK,OAAO,KAAK,GAAG,QAAQ;AAC5B,SAAO;AACT;AAEA,SAAS,wBACP,MACA,KACA,aACW;AACX,QAAM,EAAC,KAAK,MAAA,IAAS,aAAa,MAAM,KAAK,WAAW;AACxD,SAAO,OAAO,qBAAqB;AACnC,QAAM,WAAW,KAAK,GAAG;AACzB,QAAM,KAAK,SAAS,cAAc;AAClC,MAAI,OAAO,GAAG;AACZ,SAAK,OAAO,KAAK,CAAC;AAAA,EACpB;AACA,WAAS,cAAc;AAEvB,SAAO;AACT;AAGA,SAAS,aACP,MACA,QACA,YACA;AACA,MAAI,MAAM;AACV,MAAI,OAAO,KAAK,SAAS;AACzB,SAAO,OAAO,MAAM;AAClB,UAAM,MAAO,MAAM,SAAU;AAC7B,UAAM,aAAa,WAAW,KAAK,GAAG,GAAU,MAAa;AAC7D,QAAI,aAAa,GAAG;AAClB,YAAM,MAAM;AAAA,IACd,WAAW,aAAa,GAAG;AACzB,aAAO,MAAM;AAAA,IACf,OAAO;AACL,aAAO,EAAC,KAAK,KAAK,OAAO,KAAA;AAAA,IAC3B;AAAA,EACF;AACA,SAAO,EAAC,KAAK,KAAK,OAAO,MAAA;AAC3B;AAEA,SAAS,kBACP,aACA,cACe;AACf,QAAM,OAAO,YAAY,YAAY;AACrC,cAAY,IAAI;AAChB,SAAO;AACT;AAEA,SAAS,gBAAgB,GAAoC;AAC3D,eAAc,EAAyB,cAAc,CAAC;AACxD;AAEA,SAAS,iBAAiB,aAAoB,cAAiC;AAC7E,QAAM,IAAI,YAAY,YAAY;AAClC,eAAc,EAAyB,cAAc,CAAC;AACtD,SAAO;AACT;AAEA,SAAS,iBACP,KACA,QACA,SACA,IACW;AACX,MAAI,SAAS;AACX,WAAO,EAAC,GAAG,KAAK,CAAC,cAAc,GAAG,IAAI,CAAC,QAAQ,GAAG,OAAO,KAAK,MAAM,EAAA;AAAA,EACtE;AACA,SAAO,EAAC,GAAG,KAAK,CAAC,cAAc,GAAG,GAAA;AACpC;AACA,SAAS,OAAO,KAAU,QAAsB;AAE9C,MAAI,OAAO,WAAW,WAAW,GAAG;AAClC,WAAO,KAAK,UAAU,IAAI,OAAO,WAAW,CAAC,CAAC,CAAC;AAAA,EACjD;AACA,SAAO,KAAK,UAAU,OAAO,WAAW,IAAI,CAAA,MAAK,IAAI,CAAC,CAAC,CAAC;AAC1D;"}

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

@@ -1,7 +1,7 @@
 import type { ErroredQuery } from '../../../zero-protocol/src/custom-queries.ts';
 import type { Value } from '../../../zero-protocol/src/data.ts';
-import type { Schema } from '../../../zero-types/src/schema.ts';
 import type { Format } from '../../../zero-types/src/format.ts';
+import type { Schema } from '../../../zero-types/src/schema.ts';
 import type { Query } from '../query/query.ts';
 import type { TTL } from '../query/ttl.ts';
 import type { Input } from './operator.ts';
@@ -11,5 +11,6 @@ export type Entry = {
     readonly [key: string]: Value | View;
 };
 export type { Format };
-export type ViewFactory<TSchema extends Schema, TTable extends keyof TSchema['tables'] & string, TReturn, T> = (query: Query<TSchema, TTable, TReturn>, input: Input, format: Format, onDestroy: () => void, onTransactionCommit: (cb: () => void) => void, queryComplete: true | ErroredQuery | Promise<true>, updateTTL: (ttl: TTL) => void) => T;
+export type ViewFactory<TTable extends keyof TSchema['tables'] & string, TSchema extends Schema, TReturn, T> = (query: Query<TTable, TSchema, TReturn>, input: Input, format: Format, onDestroy: () => void, onTransactionCommit: (cb: () => void) => void, queryComplete: true | ErroredQuery | Promise<true>, updateTTL: (ttl: TTL) => void) => T;
+export type AnyViewFactory = ViewFactory<string, Schema, any, any>;
 //# sourceMappingURL=view.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"view.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/view.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,8CAA8C,CAAC;AAC/E,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,oCAAoC,CAAC;AAC9D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAC9D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAC9D,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,mBAAmB,CAAC;AAC7C,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,iBAAiB,CAAC;AACzC,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,eAAe,CAAC;AAEzC,MAAM,MAAM,IAAI,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,CAAC;AACjD,MAAM,MAAM,SAAS,GAAG,SAAS,KAAK,EAAE,CAAC;AACzC,MAAM,MAAM,KAAK,GAAG;IAAC,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAAA;CAAC,CAAC;AAE3D,YAAY,EAAC,MAAM,EAAC,CAAC;AAErB,MAAM,MAAM,WAAW,CACrB,OAAO,SAAS,MAAM,EACtB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,EACP,CAAC,IACC,CACF,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EACtC,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,IAAI,EACrB,mBAAmB,EAAE,CAAC,EAAE,EAAE,MAAM,IAAI,KAAK,IAAI,EAC7C,aAAa,EAAE,IAAI,GAAG,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,EAClD,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,IAAI,KAC1B,CAAC,CAAC"}
+{"version":3,"file":"view.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/view.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,8CAA8C,CAAC;AAC/E,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,oCAAoC,CAAC;AAC9D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAC9D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAC9D,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,mBAAmB,CAAC;AAC7C,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,iBAAiB,CAAC;AACzC,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,eAAe,CAAC;AAEzC,MAAM,MAAM,IAAI,GAAG,SAAS,GAAG,KAAK,GAAG,SAAS,CAAC;AACjD,MAAM,MAAM,SAAS,GAAG,SAAS,KAAK,EAAE,CAAC;AACzC,MAAM,MAAM,KAAK,GAAG;IAAC,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAAA;CAAC,CAAC;AAE3D,YAAY,EAAC,MAAM,EAAC,CAAC;AAErB,MAAM,MAAM,WAAW,CACrB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,CAAC,IACC,CACF,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,EACtC,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,IAAI,EACrB,mBAAmB,EAAE,CAAC,EAAE,EAAE,MAAM,IAAI,KAAK,IAAI,EAC7C,aAAa,EAAE,IAAI,GAAG,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,EAClD,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,IAAI,KAC1B,CAAC,CAAC;AAGP,MAAM,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC"}