@rocicorp/zero 0.17.2025031400 → 0.17.2025031401

package/out/advanced.js

@@ -1,7 +1,7 @@
 import "./chunk-ULOTOBTC.js";
 import {
   applyChange
-} from "./chunk-7ARRNDLF.js";
+} from "./chunk-SVJISXWE.js";
 import "./chunk-424PT5DM.js";
 export {
   applyChange

package/out/{chunk-7ARRNDLF.js → chunk-SVJISXWE.js}

@@ -180,17 +180,12 @@ function applyChange(parentEntry, change, schema, relationship, format, refCount
           refCountMap.set(newEntry, 1);
         }
       } else {
-        const view = getChildEntryList(parentEntry, relationship);
-        const { pos, found } = binarySearch(view, newEntry, schema.compareRows);
-        let deleteCount = 0;
-        let rc = 1;
-        if (found) {
-          deleteCount = 1;
-          rc = must(refCountMap.get(view[pos])) + 1;
-          refCountMap.delete(view[pos]);
-        }
-        view.splice(pos, deleteCount, newEntry);
-        refCountMap.set(newEntry, rc);
+        insertAndUpdateRefCount(
+          refCountMap,
+          getChildEntryList(parentEntry, relationship),
+          newEntry,
+          schema.compareRows
+        );
       }
       for (const [relationship2, children] of Object.entries(
         change.node.relationships
@@ -227,20 +222,12 @@ function applyChange(parentEntry, change, schema, relationship, format, refCount
           refCountMap.set(oldEntry, rc - 1);
         }
       } else {
-        const view = getChildEntryList(parentEntry, relationship);
-        const { pos, found } = binarySearch(
-          view,
+        removeAndsUpdateRefCount(
+          refCountMap,
+          getChildEntryList(parentEntry, relationship),
           change.node.row,
           schema.compareRows
         );
-        assert(found, "node does not exist");
-        const rc = must(refCountMap.get(view[pos]));
-        if (rc === 1) {
-          refCountMap.delete(view[pos]);
-          view.splice(pos, 1);
-        } else {
-          refCountMap.set(view[pos], rc - 1);
-        }
       }
       drainStreams(change.node);
       break;
@@ -297,7 +284,7 @@ function applyChange(parentEntry, change, schema, relationship, format, refCount
             change.oldNode.row,
             schema.compareRows
           );
-          assert(found, "node does not exists");
+          assert(found, "node does not exist");
           const rc = must(refCountMap.get(view[pos]));
           refCountMap.delete(view[pos]);
           view[pos] = makeEntryPreserveRelationships(
@@ -307,42 +294,23 @@ function applyChange(parentEntry, change, schema, relationship, format, refCount
           );
           refCountMap.set(view[pos], rc);
         } else {
-          const { pos, found } = binarySearch(
+          const oldEntry = removeAndsUpdateRefCount(
+            refCountMap,
             view,
             change.oldNode.row,
             schema.compareRows
           );
-          assert(found, "node does not exists");
-          const oldEntry = view[pos];
-          const rc = must(refCountMap.get(oldEntry));
-          if (rc === 1) {
-            refCountMap.delete(oldEntry);
-            view.splice(pos, 1);
-          } else {
-            refCountMap.set(oldEntry, rc - 1);
-          }
-          {
-            const { pos: pos2, found: found2 } = binarySearch(
-              view,
-              change.node.row,
-              schema.compareRows
-            );
-            let rc2 = 1;
-            const newEntry = makeEntryPreserveRelationships(
-              change.node.row,
-              oldEntry,
-              format.relationships
-            );
-            let deleteCount = 0;
-            if (found2) {
-              deleteCount = 1;
-              const existing = view[pos2];
-              rc2 = must(refCountMap.get(existing)) + 1;
-              refCountMap.delete(existing);
-            }
-            view.splice(pos2, deleteCount, newEntry);
-            refCountMap.set(newEntry, rc2);
-          }
+          const newEntry = makeEntryPreserveRelationships(
+            change.node.row,
+            oldEntry,
+            format.relationships
+          );
+          insertAndUpdateRefCount(
+            refCountMap,
+            view,
+            newEntry,
+            schema.compareRows
+          );
         }
       }
       break;
@@ -351,6 +319,31 @@ function applyChange(parentEntry, change, schema, relationship, format, refCount
       unreachable(change);
   }
 }
+function insertAndUpdateRefCount(refCountMap, view, newEntry, compareRows) {
+  const { pos, found } = binarySearch(view, newEntry, compareRows);
+  let deleteCount = 0;
+  let rc = 1;
+  if (found) {
+    deleteCount = 1;
+    rc = must(refCountMap.get(view[pos])) + 1;
+    refCountMap.delete(view[pos]);
+  }
+  view.splice(pos, deleteCount, newEntry);
+  refCountMap.set(newEntry, rc);
+}
+function removeAndsUpdateRefCount(refCountMap, view, target, compareRows) {
+  const { pos, found } = binarySearch(view, target, compareRows);
+  assert(found, "node does not exist");
+  const oldEntry = view[pos];
+  const rc = must(refCountMap.get(oldEntry));
+  if (rc === 1) {
+    refCountMap.delete(oldEntry);
+    view.splice(pos, 1);
+  } else {
+    refCountMap.set(oldEntry, rc - 1);
+  }
+  return oldEntry;
+}
 function binarySearch(view, target, comparator) {
   let low = 0;
   let high = view.length - 1;
@@ -405,4 +398,4 @@ export {
   drainStreams,
   applyChange
 };
-//# sourceMappingURL=chunk-7ARRNDLF.js.map
+//# sourceMappingURL=chunk-SVJISXWE.js.map

package/out/{chunk-7ARRNDLF.js.map → chunk-SVJISXWE.js.map}

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../shared/src/asserts.ts", "../../shared/src/must.ts", "../../zql/src/ivm/data.ts", "../../zql/src/ivm/view-apply-change.ts"],
-  "sourcesContent": ["export function assert(\n  b: unknown,\n  msg: string | (() => string) = 'Assertion failed',\n): asserts b {\n  if (!b) {\n    throw new Error(typeof msg === 'string' ? msg : msg());\n  }\n}\n\nexport function assertString(v: unknown): asserts v is string {\n  assertType(v, 'string');\n}\n\nexport function assertNumber(v: unknown): asserts v is number {\n  assertType(v, 'number');\n}\n\nexport function assertBoolean(v: unknown): asserts v is boolean {\n  assertType(v, 'boolean');\n}\n\nfunction assertType(v: unknown, t: string) {\n  if (typeof v !== t) {\n    throwInvalidType(v, t);\n  }\n}\n\nexport function assertObject(v: unknown): asserts v is Record<string, unknown> {\n  if (v === null) {\n    throwInvalidType(v, 'object');\n  }\n  assertType(v, 'object');\n}\n\nexport function assertArray(v: unknown): asserts v is unknown[] {\n  if (!Array.isArray(v)) {\n    throwInvalidType(v, 'array');\n  }\n}\n\nexport function invalidType(v: unknown, t: string): string {\n  let s = 'Invalid type: ';\n  if (v === null || v === undefined) {\n    s += v;\n  } else {\n    s += `${typeof v} \\`${v}\\``;\n  }\n  return s + `, expected ${t}`;\n}\n\nexport function throwInvalidType(v: unknown, t: string): never {\n  throw new Error(invalidType(v, t));\n}\n\nexport function assertNotNull<T>(v: T | null): asserts v is T {\n  if (v === null) {\n    throw new Error('Expected non-null value');\n  }\n}\n\nexport function assertUndefined<T>(\n  v: T | undefined,\n  msg = 'Expected undefined value',\n): asserts v is T {\n  if (v !== undefined) {\n    throw new Error(msg);\n  }\n}\n\nexport function assertNotUndefined<T>(\n  v: T | undefined,\n  msg = 'Expected non undefined value',\n): asserts v is T {\n  if (v === undefined) {\n    throw new Error(msg);\n  }\n}\n\nexport function assertInstanceof<T>(\n  v: unknown,\n  t: new (...args: unknown[]) => T,\n): asserts v is T {\n  if (!(v instanceof t)) {\n    throw new Error(`Expected instanceof ${t.name}`);\n  }\n}\n\nexport function assertUint8Array(v: unknown): asserts v is Uint8Array {\n  assertInstanceof(v, Uint8Array);\n}\n\nexport function unreachable(): never;\nexport function unreachable(v: never): never;\nexport function unreachable(_?: never): never {\n  throw new Error('Unreachable');\n}\n\nexport function notImplemented(): never {\n  throw new Error('Not implemented');\n}\n", "export function must<T>(v: T | undefined | null, msg?: string): T {\n  // eslint-disable-next-line eqeqeq\n  if (v == null) {\n    throw new Error(msg ?? `Unexpected ${v} value`);\n  }\n  return v;\n}\n", "import {compareUTF8} from 'compare-utf8';\nimport {\n  assertBoolean,\n  assertNumber,\n  assertString,\n} from '../../../shared/src/asserts.ts';\nimport type {Ordering} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {Stream} from './stream.ts';\n\n/**\n * A row flowing through the pipeline, plus its relationships.\n * Relationships are generated lazily as read.\n */\nexport type Node = {\n  row: Row;\n  relationships: Record<string, () => Stream<Node>>;\n};\n\n/**\n * Compare two values. The values must be of the same type. This function\n * throws at runtime if the types differ.\n *\n * Note, this function considers `null === null` and\n * `undefined === undefined`. This is different than SQL. In join code,\n * null must be treated separately.\n *\n * See: https://github.com/rocicorp/mono/pull/2116/files#r1704811479\n *\n * @returns < 0 if a < b, 0 if a === b, > 0 if a > b\n */\nexport function compareValues(a: Value, b: Value): number {\n  a = normalizeUndefined(a);\n  b = normalizeUndefined(b);\n\n  if (a === b) {\n    return 0;\n  }\n  if (a === null) {\n    return -1;\n  }\n  if (b === null) {\n    return 1;\n  }\n  if (typeof a === 'boolean') {\n    assertBoolean(b);\n    return a ? 1 : -1;\n  }\n  if (typeof a === 'number') {\n    assertNumber(b);\n    return a - b;\n  }\n  if (typeof a === 'string') {\n    assertString(b);\n    // We compare all strings in Zero as UTF-8. This is the default on SQLite\n    // and we need to match it. See:\n    // https://blog.replicache.dev/blog/replicache-11-adventures-in-text-encoding.\n    //\n    // TODO: We could change this since SQLite supports UTF-16. Microbenchmark\n    // to see if there's a big win.\n    //\n    // https://www.sqlite.org/c3ref/create_collation.html\n    return compareUTF8(a, b);\n  }\n  throw new Error(`Unsupported type: ${a}`);\n}\n\nexport type NormalizedValue = Exclude<Value, undefined>;\n\n/**\n * We allow undefined to be passed for the convenience of developers, but we\n * treat it equivalently to null. It's better for perf to not create an copy\n * of input values, so we just normalize at use when necessary.\n */\nexport function normalizeUndefined(v: Value): NormalizedValue {\n  return v ?? null;\n}\n\nexport type Comparator = (r1: Row, r2: Row) => number;\n\nexport function makeComparator(\n  order: Ordering,\n  reverse?: boolean | undefined,\n): Comparator {\n  return (a, b) => {\n    // Skip destructuring here since it is hot code.\n    for (const ord of order) {\n      const field = ord[0];\n      const comp = compareValues(a[field], b[field]);\n      if (comp !== 0) {\n        const result = ord[1] === 'asc' ? comp : -comp;\n        return reverse ? -result : result;\n      }\n    }\n    return 0;\n  };\n}\n\n/**\n * Determine if two values are equal. Note that unlike compareValues() above,\n * this function treats `null` as unequal to itself (and same for `undefined`).\n * This is required to make joins work correctly, but may not be the right\n * semantic for your application.\n */\nexport function valuesEqual(a: Value, b: Value): boolean {\n  // eslint-disable-next-line eqeqeq\n  if (a == null || b == null) {\n    return false;\n  }\n  return a === b;\n}\n\nexport function drainStreams(node: Node) {\n  for (const stream of Object.values(node.relationships)) {\n    for (const node of stream()) {\n      drainStreams(node);\n    }\n  }\n}\n", "import {\n  assert,\n  assertArray,\n  assertObject,\n  unreachable,\n} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.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, EntryList, Format} from './view.ts';\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 */\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  refCountMap: RefCountMap,\n) {\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              refCountMap,\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          refCountMap,\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      // TODO: Only create a new entry if we need to mutate the existing one.\n      const newEntry: Entry = {\n        ...change.node.row,\n      };\n      if (singular) {\n        const oldEntry = parentEntry[relationship] as Entry | undefined;\n        if (oldEntry !== undefined) {\n          assert(\n            schema.compareRows(oldEntry, newEntry) === 0,\n            'single output already exists',\n          );\n          // adding same again.\n          const rc = must(refCountMap.get(oldEntry));\n          refCountMap.delete(oldEntry);\n          // @ts-expect-error parentEntry is readonly\n          parentEntry[relationship] = newEntry;\n          refCountMap.set(newEntry, rc + 1);\n        } else {\n          // @ts-expect-error parentEntry is readonly\n          parentEntry[relationship] = newEntry;\n          refCountMap.set(newEntry, 1);\n        }\n      } else {\n        const view = getChildEntryList(parentEntry, relationship);\n        const {pos, found} = binarySearch(view, newEntry, schema.compareRows);\n\n        let deleteCount = 0;\n        let rc = 1;\n        if (found) {\n          deleteCount = 1;\n          rc = must(refCountMap.get(view[pos])) + 1;\n          refCountMap.delete(view[pos]);\n        }\n\n        // @ts-expect-error view is readonly\n        view.splice(pos, deleteCount, newEntry);\n        refCountMap.set(newEntry, rc);\n      }\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 ? undefined : ([] as EntryList);\n        // @ts-expect-error newEntry is readonly\n        newEntry[relationship] = newView;\n        for (const node of children()) {\n          applyChange(\n            newEntry,\n            {type: 'add', node},\n            childSchema,\n            relationship,\n            childFormat,\n            refCountMap,\n          );\n        }\n      }\n      break;\n    }\n    case 'remove': {\n      if (singular) {\n        const oldEntry = parentEntry[relationship] as Entry | undefined;\n        assert(oldEntry !== undefined, 'node does not exist');\n        const rc = must(refCountMap.get(oldEntry));\n        if (rc === 1) {\n          refCountMap.delete(oldEntry);\n          // @ts-expect-error parentEntry is readonly\n          parentEntry[relationship] = undefined;\n        } else {\n          refCountMap.set(oldEntry, rc - 1);\n        }\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        const rc = must(refCountMap.get(view[pos]));\n        if (rc === 1) {\n          refCountMap.delete(view[pos]);\n          // @ts-expect-error view is readonly\n          view.splice(pos, 1);\n        } else {\n          refCountMap.set(view[pos], rc - 1);\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: Entry;\n      if (singular) {\n        assertObject(parentEntry[relationship]);\n        existing = 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          refCountMap,\n        );\n      }\n      break;\n    }\n    case 'edit': {\n      if (singular) {\n        const existing = parentEntry[relationship];\n        assertEntry(existing);\n        const rc = must(refCountMap.get(existing));\n        const newEntry = {\n          ...existing,\n          ...change.node.row,\n        };\n        refCountMap.set(newEntry, rc);\n        refCountMap.delete(existing);\n        // @ts-expect-error parentEntry is readonly\n        parentEntry[relationship] = newEntry;\n      } else {\n        const view = parentEntry[relationship];\n        assertEntryList(view);\n        // If the order changed due to the edit, we need to remove and reinsert.\n        if (schema.compareRows(change.oldNode.row, change.node.row) === 0) {\n          const {pos, found} = binarySearch(\n            view,\n            change.oldNode.row,\n            schema.compareRows,\n          );\n          assert(found, 'node does not exists');\n          const rc = must(refCountMap.get(view[pos]));\n          refCountMap.delete(view[pos]);\n          // @ts-expect-error view is readonly\n          view[pos] = makeEntryPreserveRelationships(\n            change.node.row,\n            view[pos],\n            format.relationships,\n          );\n          refCountMap.set(view[pos], rc);\n        } else {\n          // Remove\n          const {pos, found} = binarySearch(\n            view,\n            change.oldNode.row,\n            schema.compareRows,\n          );\n          assert(found, 'node does not exists');\n          const oldEntry = view[pos];\n          const rc = must(refCountMap.get(oldEntry));\n          if (rc === 1) {\n            refCountMap.delete(oldEntry);\n            // @ts-expect-error view is readonly\n            view.splice(pos, 1);\n          } else {\n            refCountMap.set(oldEntry, rc - 1);\n          }\n\n          // Insert\n          {\n            const {pos, found} = binarySearch(\n              view,\n              change.node.row,\n              schema.compareRows,\n            );\n            let rc = 1;\n            const newEntry = makeEntryPreserveRelationships(\n              change.node.row,\n              oldEntry,\n              format.relationships,\n            );\n            let deleteCount = 0;\n            if (found) {\n              // We changed a row to a row that already exists. The existing row\n              // should increase its ref count.\n              deleteCount = 1;\n              const existing = view[pos];\n              rc = must(refCountMap.get(existing)) + 1;\n              refCountMap.delete(existing);\n            }\n            // @ts-expect-error view is readonly\n            view.splice(pos, deleteCount, newEntry);\n            refCountMap.set(newEntry, rc);\n          }\n        }\n      }\n      break;\n    }\n    default:\n      unreachable(change);\n  }\n}\n\n// TODO: Do not return an object. It puts unnecessary pressure on the GC.\nfunction binarySearch(view: EntryList, target: Entry, comparator: Comparator) {\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 makeEntryPreserveRelationships(\n  row: Row,\n  entry: Entry,\n  relationships: {[key: string]: Format},\n): Entry {\n  const result: Entry = {...row};\n  for (const relationship in relationships) {\n    assert(!(relationship in row), 'Relationship already exists');\n    // @ts-expect-error entry is readonly\n    result[relationship] = entry[relationship];\n  }\n  return result;\n}\n\nfunction getChildEntryList(\n  parentEntry: Entry,\n  relationship: string,\n): EntryList {\n  const view = parentEntry[relationship] as unknown;\n  assertArray(view);\n  return view as EntryList;\n}\n\nfunction assertEntryList(v: unknown): asserts v is EntryList {\n  assertArray(v);\n}\n\nfunction assertEntry(v: unknown): asserts v is Entry {\n  assertObject(v);\n}\n"],
-  "mappings": ";AAAO,SAAS,OACd,GACA,MAA+B,oBACpB;AACX,MAAI,CAAC,GAAG;AACN,UAAM,IAAI,MAAM,OAAO,QAAQ,WAAW,MAAM,IAAI,CAAC;AAAA,EACvD;AACF;AAEO,SAAS,aAAa,GAAiC;AAC5D,aAAW,GAAG,QAAQ;AACxB;AAEO,SAAS,aAAa,GAAiC;AAC5D,aAAW,GAAG,QAAQ;AACxB;AAEO,SAAS,cAAc,GAAkC;AAC9D,aAAW,GAAG,SAAS;AACzB;AAEA,SAAS,WAAW,GAAY,GAAW;AACzC,MAAI,OAAO,MAAM,GAAG;AAClB,qBAAiB,GAAG,CAAC;AAAA,EACvB;AACF;AAEO,SAAS,aAAa,GAAkD;AAC7E,MAAI,MAAM,MAAM;AACd,qBAAiB,GAAG,QAAQ;AAAA,EAC9B;AACA,aAAW,GAAG,QAAQ;AACxB;AAEO,SAAS,YAAY,GAAoC;AAC9D,MAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,qBAAiB,GAAG,OAAO;AAAA,EAC7B;AACF;AAEO,SAAS,YAAY,GAAY,GAAmB;AACzD,MAAI,IAAI;AACR,MAAI,MAAM,QAAQ,MAAM,QAAW;AACjC,SAAK;AAAA,EACP,OAAO;AACL,SAAK,GAAG,OAAO,CAAC,MAAM,CAAC;AAAA,EACzB;AACA,SAAO,IAAI,cAAc,CAAC;AAC5B;AAEO,SAAS,iBAAiB,GAAY,GAAkB;AAC7D,QAAM,IAAI,MAAM,YAAY,GAAG,CAAC,CAAC;AACnC;AAEO,SAAS,cAAiB,GAA6B;AAC5D,MAAI,MAAM,MAAM;AACd,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC3C;AACF;AAmCO,SAAS,YAAY,GAAkB;AAC5C,QAAM,IAAI,MAAM,aAAa;AAC/B;;;AC/FO,SAAS,KAAQ,GAAyB,KAAiB;AAEhE,MAAI,KAAK,MAAM;AACb,UAAM,IAAI,MAAM,OAAO,cAAc,CAAC,QAAQ;AAAA,EAChD;AACA,SAAO;AACT;;;ACNA,SAAQ,mBAAkB;AA+BnB,SAAS,cAAc,GAAU,GAAkB;AACxD,MAAI,mBAAmB,CAAC;AACxB,MAAI,mBAAmB,CAAC;AAExB,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AACA,MAAI,MAAM,MAAM;AACd,WAAO;AAAA,EACT;AACA,MAAI,MAAM,MAAM;AACd,WAAO;AAAA,EACT;AACA,MAAI,OAAO,MAAM,WAAW;AAC1B,kBAAc,CAAC;AACf,WAAO,IAAI,IAAI;AAAA,EACjB;AACA,MAAI,OAAO,MAAM,UAAU;AACzB,iBAAa,CAAC;AACd,WAAO,IAAI;AAAA,EACb;AACA,MAAI,OAAO,MAAM,UAAU;AACzB,iBAAa,CAAC;AASd,WAAO,YAAY,GAAG,CAAC;AAAA,EACzB;AACA,QAAM,IAAI,MAAM,qBAAqB,CAAC,EAAE;AAC1C;AASO,SAAS,mBAAmB,GAA2B;AAC5D,SAAO,KAAK;AACd;AAIO,SAAS,eACd,OACA,SACY;AACZ,SAAO,CAAC,GAAG,MAAM;AAEf,eAAW,OAAO,OAAO;AACvB,YAAM,QAAQ,IAAI,CAAC;AACnB,YAAM,OAAO,cAAc,EAAE,KAAK,GAAG,EAAE,KAAK,CAAC;AAC7C,UAAI,SAAS,GAAG;AACd,cAAM,SAAS,IAAI,CAAC,MAAM,QAAQ,OAAO,CAAC;AAC1C,eAAO,UAAU,CAAC,SAAS;AAAA,MAC7B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAQO,SAAS,YAAY,GAAU,GAAmB;AAEvD,MAAI,KAAK,QAAQ,KAAK,MAAM;AAC1B,WAAO;AAAA,EACT;AACA,SAAO,MAAM;AACf;AAEO,SAAS,aAAa,MAAY;AACvC,aAAW,UAAU,OAAO,OAAO,KAAK,aAAa,GAAG;AACtD,eAAWA,SAAQ,OAAO,GAAG;AAC3B,mBAAaA,KAAI;AAAA,IACnB;AAAA,EACF;AACF;;;AC3DO,SAAS,YACd,aACA,QACA,QACA,cACA,QACA,aACA;AACA,MAAI,OAAO,UAAU;AACnB,YAAQ,OAAO,MAAM;AAAA,MACnB,KAAK;AAAA,MACL,KAAK;AACH,mBAAW,CAACC,eAAc,QAAQ,KAAK,OAAO;AAAA,UAC5C,OAAO,KAAK;AAAA,QACd,GAAG;AACD,gBAAM,cAAc,KAAK,OAAO,cAAcA,aAAY,CAAC;AAC3D,qBAAW,QAAQ,SAAS,GAAG;AAC7B;AAAA,cACE;AAAA,cACA,EAAC,MAAM,OAAO,MAAM,KAAI;AAAA,cACxB;AAAA,cACAA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AACA;AAAA,MACF,KAAK;AAKH;AAAA,MACF,KAAK,SAAS;AACZ,cAAM,cAAc;AAAA,UAClB,OAAO,cAAc,OAAO,MAAM,gBAAgB;AAAA,QACpD;AACA;AAAA,UACE;AAAA,UACA,OAAO,MAAM;AAAA,UACb;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA;AAAA,MACF;AAAA,MACA;AACE,oBAAY,MAAM;AAAA,IACtB;AAAA,EACF;AAEA,QAAM,EAAC,UAAU,eAAe,aAAY,IAAI;AAChD,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK,OAAO;AAEV,YAAM,WAAkB;AAAA,QACtB,GAAG,OAAO,KAAK;AAAA,MACjB;AACA,UAAI,UAAU;AACZ,cAAM,WAAW,YAAY,YAAY;AACzC,YAAI,aAAa,QAAW;AAC1B;AAAA,YACE,OAAO,YAAY,UAAU,QAAQ,MAAM;AAAA,YAC3C;AAAA,UACF;AAEA,gBAAM,KAAK,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,sBAAY,OAAO,QAAQ;AAE3B,sBAAY,YAAY,IAAI;AAC5B,sBAAY,IAAI,UAAU,KAAK,CAAC;AAAA,QAClC,OAAO;AAEL,sBAAY,YAAY,IAAI;AAC5B,sBAAY,IAAI,UAAU,CAAC;AAAA,QAC7B;AAAA,MACF,OAAO;AACL,cAAM,OAAO,kBAAkB,aAAa,YAAY;AACxD,cAAM,EAAC,KAAK,MAAK,IAAI,aAAa,MAAM,UAAU,OAAO,WAAW;AAEpE,YAAI,cAAc;AAClB,YAAI,KAAK;AACT,YAAI,OAAO;AACT,wBAAc;AACd,eAAK,KAAK,YAAY,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI;AACxC,sBAAY,OAAO,KAAK,GAAG,CAAC;AAAA,QAC9B;AAGA,aAAK,OAAO,KAAK,aAAa,QAAQ;AACtC,oBAAY,IAAI,UAAU,EAAE;AAAA,MAC9B;AACA,iBAAW,CAACA,eAAc,QAAQ,KAAK,OAAO;AAAA,QAC5C,OAAO,KAAK;AAAA,MACd,GAAG;AAED,cAAM,cAAc,KAAK,OAAO,cAAcA,aAAY,CAAC;AAC3D,cAAM,cAAc,aAAaA,aAAY;AAC7C,YAAI,gBAAgB,QAAW;AAC7B;AAAA,QACF;AAEA,cAAM,UAAU,YAAY,WAAW,SAAa,CAAC;AAErD,iBAASA,aAAY,IAAI;AACzB,mBAAW,QAAQ,SAAS,GAAG;AAC7B;AAAA,YACE;AAAA,YACA,EAAC,MAAM,OAAO,KAAI;AAAA,YAClB;AAAA,YACAA;AAAA,YACA;AAAA,YACA;AAAA,UACF;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,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,YAAI,OAAO,GAAG;AACZ,sBAAY,OAAO,QAAQ;AAE3B,sBAAY,YAAY,IAAI;AAAA,QAC9B,OAAO;AACL,sBAAY,IAAI,UAAU,KAAK,CAAC;AAAA,QAClC;AAAA,MACF,OAAO;AACL,cAAM,OAAO,kBAAkB,aAAa,YAAY;AACxD,cAAM,EAAC,KAAK,MAAK,IAAI;AAAA,UACnB;AAAA,UACA,OAAO,KAAK;AAAA,UACZ,OAAO;AAAA,QACT;AACA,eAAO,OAAO,qBAAqB;AACnC,cAAM,KAAK,KAAK,YAAY,IAAI,KAAK,GAAG,CAAC,CAAC;AAC1C,YAAI,OAAO,GAAG;AACZ,sBAAY,OAAO,KAAK,GAAG,CAAC;AAE5B,eAAK,OAAO,KAAK,CAAC;AAAA,QACpB,OAAO;AACL,sBAAY,IAAI,KAAK,GAAG,GAAG,KAAK,CAAC;AAAA,QACnC;AAAA,MACF;AAEA,mBAAa,OAAO,IAAI;AACxB;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,UAAI;AACJ,UAAI,UAAU;AACZ,qBAAa,YAAY,YAAY,CAAC;AACtC,mBAAW,YAAY,YAAY;AAAA,MACrC,OAAO;AACL,cAAM,OAAO,kBAAkB,aAAa,YAAY;AACxD,cAAM,EAAC,KAAK,MAAK,IAAI;AAAA,UACnB;AAAA,UACA,OAAO,KAAK;AAAA,UACZ,OAAO;AAAA,QACT;AACA,eAAO,OAAO,qBAAqB;AACnC,mBAAW,KAAK,GAAG;AAAA,MACrB;AAEA,YAAM,cAAc;AAAA,QAClB,OAAO,cAAc,OAAO,MAAM,gBAAgB;AAAA,MACpD;AACA,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,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA,KAAK,QAAQ;AACX,UAAI,UAAU;AACZ,cAAM,WAAW,YAAY,YAAY;AACzC,oBAAY,QAAQ;AACpB,cAAM,KAAK,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,cAAM,WAAW;AAAA,UACf,GAAG;AAAA,UACH,GAAG,OAAO,KAAK;AAAA,QACjB;AACA,oBAAY,IAAI,UAAU,EAAE;AAC5B,oBAAY,OAAO,QAAQ;AAE3B,oBAAY,YAAY,IAAI;AAAA,MAC9B,OAAO;AACL,cAAM,OAAO,YAAY,YAAY;AACrC,wBAAgB,IAAI;AAEpB,YAAI,OAAO,YAAY,OAAO,QAAQ,KAAK,OAAO,KAAK,GAAG,MAAM,GAAG;AACjE,gBAAM,EAAC,KAAK,MAAK,IAAI;AAAA,YACnB;AAAA,YACA,OAAO,QAAQ;AAAA,YACf,OAAO;AAAA,UACT;AACA,iBAAO,OAAO,sBAAsB;AACpC,gBAAM,KAAK,KAAK,YAAY,IAAI,KAAK,GAAG,CAAC,CAAC;AAC1C,sBAAY,OAAO,KAAK,GAAG,CAAC;AAE5B,eAAK,GAAG,IAAI;AAAA,YACV,OAAO,KAAK;AAAA,YACZ,KAAK,GAAG;AAAA,YACR,OAAO;AAAA,UACT;AACA,sBAAY,IAAI,KAAK,GAAG,GAAG,EAAE;AAAA,QAC/B,OAAO;AAEL,gBAAM,EAAC,KAAK,MAAK,IAAI;AAAA,YACnB;AAAA,YACA,OAAO,QAAQ;AAAA,YACf,OAAO;AAAA,UACT;AACA,iBAAO,OAAO,sBAAsB;AACpC,gBAAM,WAAW,KAAK,GAAG;AACzB,gBAAM,KAAK,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,cAAI,OAAO,GAAG;AACZ,wBAAY,OAAO,QAAQ;AAE3B,iBAAK,OAAO,KAAK,CAAC;AAAA,UACpB,OAAO;AACL,wBAAY,IAAI,UAAU,KAAK,CAAC;AAAA,UAClC;AAGA;AACE,kBAAM,EAAC,KAAAC,MAAK,OAAAC,OAAK,IAAI;AAAA,cACnB;AAAA,cACA,OAAO,KAAK;AAAA,cACZ,OAAO;AAAA,YACT;AACA,gBAAIC,MAAK;AACT,kBAAM,WAAW;AAAA,cACf,OAAO,KAAK;AAAA,cACZ;AAAA,cACA,OAAO;AAAA,YACT;AACA,gBAAI,cAAc;AAClB,gBAAID,QAAO;AAGT,4BAAc;AACd,oBAAM,WAAW,KAAKD,IAAG;AACzB,cAAAE,MAAK,KAAK,YAAY,IAAI,QAAQ,CAAC,IAAI;AACvC,0BAAY,OAAO,QAAQ;AAAA,YAC7B;AAEA,iBAAK,OAAOF,MAAK,aAAa,QAAQ;AACtC,wBAAY,IAAI,UAAUE,GAAE;AAAA,UAC9B;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA;AACE,kBAAY,MAAM;AAAA,EACtB;AACF;AAGA,SAAS,aAAa,MAAiB,QAAe,YAAwB;AAC5E,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,KAAI;AAAA,IAC/B;AAAA,EACF;AACA,SAAO,EAAC,KAAK,KAAK,OAAO,MAAK;AAChC;AAEA,SAAS,+BACP,KACA,OACA,eACO;AACP,QAAM,SAAgB,EAAC,GAAG,IAAG;AAC7B,aAAW,gBAAgB,eAAe;AACxC,WAAO,EAAE,gBAAgB,MAAM,6BAA6B;AAE5D,WAAO,YAAY,IAAI,MAAM,YAAY;AAAA,EAC3C;AACA,SAAO;AACT;AAEA,SAAS,kBACP,aACA,cACW;AACX,QAAM,OAAO,YAAY,YAAY;AACrC,cAAY,IAAI;AAChB,SAAO;AACT;AAEA,SAAS,gBAAgB,GAAoC;AAC3D,cAAY,CAAC;AACf;AAEA,SAAS,YAAY,GAAgC;AACnD,eAAa,CAAC;AAChB;",
-  "names": ["node", "relationship", "pos", "found", "rc"]
+  "sourcesContent": ["export function assert(\n  b: unknown,\n  msg: string | (() => string) = 'Assertion failed',\n): asserts b {\n  if (!b) {\n    throw new Error(typeof msg === 'string' ? msg : msg());\n  }\n}\n\nexport function assertString(v: unknown): asserts v is string {\n  assertType(v, 'string');\n}\n\nexport function assertNumber(v: unknown): asserts v is number {\n  assertType(v, 'number');\n}\n\nexport function assertBoolean(v: unknown): asserts v is boolean {\n  assertType(v, 'boolean');\n}\n\nfunction assertType(v: unknown, t: string) {\n  if (typeof v !== t) {\n    throwInvalidType(v, t);\n  }\n}\n\nexport function assertObject(v: unknown): asserts v is Record<string, unknown> {\n  if (v === null) {\n    throwInvalidType(v, 'object');\n  }\n  assertType(v, 'object');\n}\n\nexport function assertArray(v: unknown): asserts v is unknown[] {\n  if (!Array.isArray(v)) {\n    throwInvalidType(v, 'array');\n  }\n}\n\nexport function invalidType(v: unknown, t: string): string {\n  let s = 'Invalid type: ';\n  if (v === null || v === undefined) {\n    s += v;\n  } else {\n    s += `${typeof v} \\`${v}\\``;\n  }\n  return s + `, expected ${t}`;\n}\n\nexport function throwInvalidType(v: unknown, t: string): never {\n  throw new Error(invalidType(v, t));\n}\n\nexport function assertNotNull<T>(v: T | null): asserts v is T {\n  if (v === null) {\n    throw new Error('Expected non-null value');\n  }\n}\n\nexport function assertUndefined<T>(\n  v: T | undefined,\n  msg = 'Expected undefined value',\n): asserts v is T {\n  if (v !== undefined) {\n    throw new Error(msg);\n  }\n}\n\nexport function assertNotUndefined<T>(\n  v: T | undefined,\n  msg = 'Expected non undefined value',\n): asserts v is T {\n  if (v === undefined) {\n    throw new Error(msg);\n  }\n}\n\nexport function assertInstanceof<T>(\n  v: unknown,\n  t: new (...args: unknown[]) => T,\n): asserts v is T {\n  if (!(v instanceof t)) {\n    throw new Error(`Expected instanceof ${t.name}`);\n  }\n}\n\nexport function assertUint8Array(v: unknown): asserts v is Uint8Array {\n  assertInstanceof(v, Uint8Array);\n}\n\nexport function unreachable(): never;\nexport function unreachable(v: never): never;\nexport function unreachable(_?: never): never {\n  throw new Error('Unreachable');\n}\n\nexport function notImplemented(): never {\n  throw new Error('Not implemented');\n}\n", "export function must<T>(v: T | undefined | null, msg?: string): T {\n  // eslint-disable-next-line eqeqeq\n  if (v == null) {\n    throw new Error(msg ?? `Unexpected ${v} value`);\n  }\n  return v;\n}\n", "import {compareUTF8} from 'compare-utf8';\nimport {\n  assertBoolean,\n  assertNumber,\n  assertString,\n} from '../../../shared/src/asserts.ts';\nimport type {Ordering} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {Stream} from './stream.ts';\n\n/**\n * A row flowing through the pipeline, plus its relationships.\n * Relationships are generated lazily as read.\n */\nexport type Node = {\n  row: Row;\n  relationships: Record<string, () => Stream<Node>>;\n};\n\n/**\n * Compare two values. The values must be of the same type. This function\n * throws at runtime if the types differ.\n *\n * Note, this function considers `null === null` and\n * `undefined === undefined`. This is different than SQL. In join code,\n * null must be treated separately.\n *\n * See: https://github.com/rocicorp/mono/pull/2116/files#r1704811479\n *\n * @returns < 0 if a < b, 0 if a === b, > 0 if a > b\n */\nexport function compareValues(a: Value, b: Value): number {\n  a = normalizeUndefined(a);\n  b = normalizeUndefined(b);\n\n  if (a === b) {\n    return 0;\n  }\n  if (a === null) {\n    return -1;\n  }\n  if (b === null) {\n    return 1;\n  }\n  if (typeof a === 'boolean') {\n    assertBoolean(b);\n    return a ? 1 : -1;\n  }\n  if (typeof a === 'number') {\n    assertNumber(b);\n    return a - b;\n  }\n  if (typeof a === 'string') {\n    assertString(b);\n    // We compare all strings in Zero as UTF-8. This is the default on SQLite\n    // and we need to match it. See:\n    // https://blog.replicache.dev/blog/replicache-11-adventures-in-text-encoding.\n    //\n    // TODO: We could change this since SQLite supports UTF-16. Microbenchmark\n    // to see if there's a big win.\n    //\n    // https://www.sqlite.org/c3ref/create_collation.html\n    return compareUTF8(a, b);\n  }\n  throw new Error(`Unsupported type: ${a}`);\n}\n\nexport type NormalizedValue = Exclude<Value, undefined>;\n\n/**\n * We allow undefined to be passed for the convenience of developers, but we\n * treat it equivalently to null. It's better for perf to not create an copy\n * of input values, so we just normalize at use when necessary.\n */\nexport function normalizeUndefined(v: Value): NormalizedValue {\n  return v ?? null;\n}\n\nexport type Comparator = (r1: Row, r2: Row) => number;\n\nexport function makeComparator(\n  order: Ordering,\n  reverse?: boolean | undefined,\n): Comparator {\n  return (a, b) => {\n    // Skip destructuring here since it is hot code.\n    for (const ord of order) {\n      const field = ord[0];\n      const comp = compareValues(a[field], b[field]);\n      if (comp !== 0) {\n        const result = ord[1] === 'asc' ? comp : -comp;\n        return reverse ? -result : result;\n      }\n    }\n    return 0;\n  };\n}\n\n/**\n * Determine if two values are equal. Note that unlike compareValues() above,\n * this function treats `null` as unequal to itself (and same for `undefined`).\n * This is required to make joins work correctly, but may not be the right\n * semantic for your application.\n */\nexport function valuesEqual(a: Value, b: Value): boolean {\n  // eslint-disable-next-line eqeqeq\n  if (a == null || b == null) {\n    return false;\n  }\n  return a === b;\n}\n\nexport function drainStreams(node: Node) {\n  for (const stream of Object.values(node.relationships)) {\n    for (const node of stream()) {\n      drainStreams(node);\n    }\n  }\n}\n", "import {\n  assert,\n  assertArray,\n  assertObject,\n  unreachable,\n} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.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, EntryList, Format} from './view.ts';\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 */\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  refCountMap: RefCountMap,\n) {\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              refCountMap,\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          refCountMap,\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      // TODO: Only create a new entry if we need to mutate the existing one.\n      const newEntry: Entry = {\n        ...change.node.row,\n      };\n      if (singular) {\n        const oldEntry = parentEntry[relationship] as Entry | undefined;\n        if (oldEntry !== undefined) {\n          assert(\n            schema.compareRows(oldEntry, newEntry) === 0,\n            'single output already exists',\n          );\n          // adding same again.\n          const rc = must(refCountMap.get(oldEntry));\n          refCountMap.delete(oldEntry);\n          // @ts-expect-error parentEntry is readonly\n          parentEntry[relationship] = newEntry;\n          refCountMap.set(newEntry, rc + 1);\n        } else {\n          // @ts-expect-error parentEntry is readonly\n          parentEntry[relationship] = newEntry;\n          refCountMap.set(newEntry, 1);\n        }\n      } else {\n        insertAndUpdateRefCount(\n          refCountMap,\n          getChildEntryList(parentEntry, relationship),\n          newEntry,\n          schema.compareRows,\n        );\n      }\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 ? undefined : ([] as EntryList);\n        // @ts-expect-error newEntry is readonly\n        newEntry[relationship] = newView;\n        for (const node of children()) {\n          applyChange(\n            newEntry,\n            {type: 'add', node},\n            childSchema,\n            relationship,\n            childFormat,\n            refCountMap,\n          );\n        }\n      }\n      break;\n    }\n    case 'remove': {\n      if (singular) {\n        const oldEntry = parentEntry[relationship] as Entry | undefined;\n        assert(oldEntry !== undefined, 'node does not exist');\n        const rc = must(refCountMap.get(oldEntry));\n        if (rc === 1) {\n          refCountMap.delete(oldEntry);\n          // @ts-expect-error parentEntry is readonly\n          parentEntry[relationship] = undefined;\n        } else {\n          refCountMap.set(oldEntry, rc - 1);\n        }\n      } else {\n        removeAndsUpdateRefCount(\n          refCountMap,\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: Entry;\n      if (singular) {\n        assertObject(parentEntry[relationship]);\n        existing = 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          refCountMap,\n        );\n      }\n      break;\n    }\n    case 'edit': {\n      if (singular) {\n        const existing = parentEntry[relationship];\n        assertEntry(existing);\n        const rc = must(refCountMap.get(existing));\n        const newEntry = {\n          ...existing,\n          ...change.node.row,\n        };\n        refCountMap.set(newEntry, rc);\n        refCountMap.delete(existing);\n        // @ts-expect-error parentEntry is readonly\n        parentEntry[relationship] = newEntry;\n      } else {\n        const view = parentEntry[relationship];\n        assertEntryList(view);\n        // If the order changed due to the edit, we need to remove and reinsert.\n        if (schema.compareRows(change.oldNode.row, change.node.row) === 0) {\n          const {pos, found} = binarySearch(\n            view,\n            change.oldNode.row,\n            schema.compareRows,\n          );\n          assert(found, 'node does not exist');\n          const rc = must(refCountMap.get(view[pos]));\n          refCountMap.delete(view[pos]);\n          // @ts-expect-error view is readonly\n          view[pos] = makeEntryPreserveRelationships(\n            change.node.row,\n            view[pos],\n            format.relationships,\n          );\n          refCountMap.set(view[pos], rc);\n        } else {\n          // Remove\n          const oldEntry = removeAndsUpdateRefCount(\n            refCountMap,\n            view,\n            change.oldNode.row,\n            schema.compareRows,\n          );\n\n          // Insert\n          const newEntry = makeEntryPreserveRelationships(\n            change.node.row,\n            oldEntry,\n            format.relationships,\n          );\n          insertAndUpdateRefCount(\n            refCountMap,\n            view,\n            newEntry,\n            schema.compareRows,\n          );\n        }\n      }\n      break;\n    }\n    default:\n      unreachable(change);\n  }\n}\n\nfunction insertAndUpdateRefCount(\n  refCountMap: RefCountMap,\n  view: EntryList,\n  newEntry: Entry,\n  compareRows: Comparator,\n): void {\n  const {pos, found} = binarySearch(view, newEntry, compareRows);\n\n  let deleteCount = 0;\n  let rc = 1;\n  if (found) {\n    deleteCount = 1;\n    rc = must(refCountMap.get(view[pos])) + 1;\n    refCountMap.delete(view[pos]);\n  }\n\n  // @ts-expect-error view is readonly\n  view.splice(pos, deleteCount, newEntry);\n  refCountMap.set(newEntry, rc);\n}\n\nfunction removeAndsUpdateRefCount(\n  refCountMap: RefCountMap,\n  view: EntryList,\n  target: Row,\n  compareRows: Comparator,\n): Entry {\n  const {pos, found} = binarySearch(view, target, compareRows);\n  assert(found, 'node does not exist');\n  const oldEntry = view[pos];\n  const rc = must(refCountMap.get(oldEntry));\n  if (rc === 1) {\n    refCountMap.delete(oldEntry);\n    // @ts-expect-error view is readonly\n    view.splice(pos, 1);\n  } else {\n    refCountMap.set(oldEntry, rc - 1);\n  }\n\n  return oldEntry;\n}\n\n// TODO: Do not return an object. It puts unnecessary pressure on the GC.\nfunction binarySearch(view: EntryList, target: Entry, comparator: Comparator) {\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 makeEntryPreserveRelationships(\n  row: Row,\n  entry: Entry,\n  relationships: {[key: string]: Format},\n): Entry {\n  const result: Entry = {...row};\n  for (const relationship in relationships) {\n    assert(!(relationship in row), 'Relationship already exists');\n    // @ts-expect-error entry is readonly\n    result[relationship] = entry[relationship];\n  }\n  return result;\n}\n\nfunction getChildEntryList(\n  parentEntry: Entry,\n  relationship: string,\n): EntryList {\n  const view = parentEntry[relationship];\n  assertArray(view);\n  return view as EntryList;\n}\n\nfunction assertEntryList(v: unknown): asserts v is EntryList {\n  assertArray(v);\n}\n\nfunction assertEntry(v: unknown): asserts v is Entry {\n  assertObject(v);\n}\n"],
+  "mappings": ";AAAO,SAAS,OACd,GACA,MAA+B,oBACpB;AACX,MAAI,CAAC,GAAG;AACN,UAAM,IAAI,MAAM,OAAO,QAAQ,WAAW,MAAM,IAAI,CAAC;AAAA,EACvD;AACF;AAEO,SAAS,aAAa,GAAiC;AAC5D,aAAW,GAAG,QAAQ;AACxB;AAEO,SAAS,aAAa,GAAiC;AAC5D,aAAW,GAAG,QAAQ;AACxB;AAEO,SAAS,cAAc,GAAkC;AAC9D,aAAW,GAAG,SAAS;AACzB;AAEA,SAAS,WAAW,GAAY,GAAW;AACzC,MAAI,OAAO,MAAM,GAAG;AAClB,qBAAiB,GAAG,CAAC;AAAA,EACvB;AACF;AAEO,SAAS,aAAa,GAAkD;AAC7E,MAAI,MAAM,MAAM;AACd,qBAAiB,GAAG,QAAQ;AAAA,EAC9B;AACA,aAAW,GAAG,QAAQ;AACxB;AAEO,SAAS,YAAY,GAAoC;AAC9D,MAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,qBAAiB,GAAG,OAAO;AAAA,EAC7B;AACF;AAEO,SAAS,YAAY,GAAY,GAAmB;AACzD,MAAI,IAAI;AACR,MAAI,MAAM,QAAQ,MAAM,QAAW;AACjC,SAAK;AAAA,EACP,OAAO;AACL,SAAK,GAAG,OAAO,CAAC,MAAM,CAAC;AAAA,EACzB;AACA,SAAO,IAAI,cAAc,CAAC;AAC5B;AAEO,SAAS,iBAAiB,GAAY,GAAkB;AAC7D,QAAM,IAAI,MAAM,YAAY,GAAG,CAAC,CAAC;AACnC;AAEO,SAAS,cAAiB,GAA6B;AAC5D,MAAI,MAAM,MAAM;AACd,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC3C;AACF;AAmCO,SAAS,YAAY,GAAkB;AAC5C,QAAM,IAAI,MAAM,aAAa;AAC/B;;;AC/FO,SAAS,KAAQ,GAAyB,KAAiB;AAEhE,MAAI,KAAK,MAAM;AACb,UAAM,IAAI,MAAM,OAAO,cAAc,CAAC,QAAQ;AAAA,EAChD;AACA,SAAO;AACT;;;ACNA,SAAQ,mBAAkB;AA+BnB,SAAS,cAAc,GAAU,GAAkB;AACxD,MAAI,mBAAmB,CAAC;AACxB,MAAI,mBAAmB,CAAC;AAExB,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AACA,MAAI,MAAM,MAAM;AACd,WAAO;AAAA,EACT;AACA,MAAI,MAAM,MAAM;AACd,WAAO;AAAA,EACT;AACA,MAAI,OAAO,MAAM,WAAW;AAC1B,kBAAc,CAAC;AACf,WAAO,IAAI,IAAI;AAAA,EACjB;AACA,MAAI,OAAO,MAAM,UAAU;AACzB,iBAAa,CAAC;AACd,WAAO,IAAI;AAAA,EACb;AACA,MAAI,OAAO,MAAM,UAAU;AACzB,iBAAa,CAAC;AASd,WAAO,YAAY,GAAG,CAAC;AAAA,EACzB;AACA,QAAM,IAAI,MAAM,qBAAqB,CAAC,EAAE;AAC1C;AASO,SAAS,mBAAmB,GAA2B;AAC5D,SAAO,KAAK;AACd;AAIO,SAAS,eACd,OACA,SACY;AACZ,SAAO,CAAC,GAAG,MAAM;AAEf,eAAW,OAAO,OAAO;AACvB,YAAM,QAAQ,IAAI,CAAC;AACnB,YAAM,OAAO,cAAc,EAAE,KAAK,GAAG,EAAE,KAAK,CAAC;AAC7C,UAAI,SAAS,GAAG;AACd,cAAM,SAAS,IAAI,CAAC,MAAM,QAAQ,OAAO,CAAC;AAC1C,eAAO,UAAU,CAAC,SAAS;AAAA,MAC7B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAQO,SAAS,YAAY,GAAU,GAAmB;AAEvD,MAAI,KAAK,QAAQ,KAAK,MAAM;AAC1B,WAAO;AAAA,EACT;AACA,SAAO,MAAM;AACf;AAEO,SAAS,aAAa,MAAY;AACvC,aAAW,UAAU,OAAO,OAAO,KAAK,aAAa,GAAG;AACtD,eAAWA,SAAQ,OAAO,GAAG;AAC3B,mBAAaA,KAAI;AAAA,IACnB;AAAA,EACF;AACF;;;AC3DO,SAAS,YACd,aACA,QACA,QACA,cACA,QACA,aACA;AACA,MAAI,OAAO,UAAU;AACnB,YAAQ,OAAO,MAAM;AAAA,MACnB,KAAK;AAAA,MACL,KAAK;AACH,mBAAW,CAACC,eAAc,QAAQ,KAAK,OAAO;AAAA,UAC5C,OAAO,KAAK;AAAA,QACd,GAAG;AACD,gBAAM,cAAc,KAAK,OAAO,cAAcA,aAAY,CAAC;AAC3D,qBAAW,QAAQ,SAAS,GAAG;AAC7B;AAAA,cACE;AAAA,cACA,EAAC,MAAM,OAAO,MAAM,KAAI;AAAA,cACxB;AAAA,cACAA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AACA;AAAA,MACF,KAAK;AAKH;AAAA,MACF,KAAK,SAAS;AACZ,cAAM,cAAc;AAAA,UAClB,OAAO,cAAc,OAAO,MAAM,gBAAgB;AAAA,QACpD;AACA;AAAA,UACE;AAAA,UACA,OAAO,MAAM;AAAA,UACb;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA;AAAA,MACF;AAAA,MACA;AACE,oBAAY,MAAM;AAAA,IACtB;AAAA,EACF;AAEA,QAAM,EAAC,UAAU,eAAe,aAAY,IAAI;AAChD,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK,OAAO;AAEV,YAAM,WAAkB;AAAA,QACtB,GAAG,OAAO,KAAK;AAAA,MACjB;AACA,UAAI,UAAU;AACZ,cAAM,WAAW,YAAY,YAAY;AACzC,YAAI,aAAa,QAAW;AAC1B;AAAA,YACE,OAAO,YAAY,UAAU,QAAQ,MAAM;AAAA,YAC3C;AAAA,UACF;AAEA,gBAAM,KAAK,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,sBAAY,OAAO,QAAQ;AAE3B,sBAAY,YAAY,IAAI;AAC5B,sBAAY,IAAI,UAAU,KAAK,CAAC;AAAA,QAClC,OAAO;AAEL,sBAAY,YAAY,IAAI;AAC5B,sBAAY,IAAI,UAAU,CAAC;AAAA,QAC7B;AAAA,MACF,OAAO;AACL;AAAA,UACE;AAAA,UACA,kBAAkB,aAAa,YAAY;AAAA,UAC3C;AAAA,UACA,OAAO;AAAA,QACT;AAAA,MACF;AACA,iBAAW,CAACA,eAAc,QAAQ,KAAK,OAAO;AAAA,QAC5C,OAAO,KAAK;AAAA,MACd,GAAG;AAED,cAAM,cAAc,KAAK,OAAO,cAAcA,aAAY,CAAC;AAC3D,cAAM,cAAc,aAAaA,aAAY;AAC7C,YAAI,gBAAgB,QAAW;AAC7B;AAAA,QACF;AAEA,cAAM,UAAU,YAAY,WAAW,SAAa,CAAC;AAErD,iBAASA,aAAY,IAAI;AACzB,mBAAW,QAAQ,SAAS,GAAG;AAC7B;AAAA,YACE;AAAA,YACA,EAAC,MAAM,OAAO,KAAI;AAAA,YAClB;AAAA,YACAA;AAAA,YACA;AAAA,YACA;AAAA,UACF;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,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,YAAI,OAAO,GAAG;AACZ,sBAAY,OAAO,QAAQ;AAE3B,sBAAY,YAAY,IAAI;AAAA,QAC9B,OAAO;AACL,sBAAY,IAAI,UAAU,KAAK,CAAC;AAAA,QAClC;AAAA,MACF,OAAO;AACL;AAAA,UACE;AAAA,UACA,kBAAkB,aAAa,YAAY;AAAA,UAC3C,OAAO,KAAK;AAAA,UACZ,OAAO;AAAA,QACT;AAAA,MACF;AAEA,mBAAa,OAAO,IAAI;AACxB;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,UAAI;AACJ,UAAI,UAAU;AACZ,qBAAa,YAAY,YAAY,CAAC;AACtC,mBAAW,YAAY,YAAY;AAAA,MACrC,OAAO;AACL,cAAM,OAAO,kBAAkB,aAAa,YAAY;AACxD,cAAM,EAAC,KAAK,MAAK,IAAI;AAAA,UACnB;AAAA,UACA,OAAO,KAAK;AAAA,UACZ,OAAO;AAAA,QACT;AACA,eAAO,OAAO,qBAAqB;AACnC,mBAAW,KAAK,GAAG;AAAA,MACrB;AAEA,YAAM,cAAc;AAAA,QAClB,OAAO,cAAc,OAAO,MAAM,gBAAgB;AAAA,MACpD;AACA,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,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA,KAAK,QAAQ;AACX,UAAI,UAAU;AACZ,cAAM,WAAW,YAAY,YAAY;AACzC,oBAAY,QAAQ;AACpB,cAAM,KAAK,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,cAAM,WAAW;AAAA,UACf,GAAG;AAAA,UACH,GAAG,OAAO,KAAK;AAAA,QACjB;AACA,oBAAY,IAAI,UAAU,EAAE;AAC5B,oBAAY,OAAO,QAAQ;AAE3B,oBAAY,YAAY,IAAI;AAAA,MAC9B,OAAO;AACL,cAAM,OAAO,YAAY,YAAY;AACrC,wBAAgB,IAAI;AAEpB,YAAI,OAAO,YAAY,OAAO,QAAQ,KAAK,OAAO,KAAK,GAAG,MAAM,GAAG;AACjE,gBAAM,EAAC,KAAK,MAAK,IAAI;AAAA,YACnB;AAAA,YACA,OAAO,QAAQ;AAAA,YACf,OAAO;AAAA,UACT;AACA,iBAAO,OAAO,qBAAqB;AACnC,gBAAM,KAAK,KAAK,YAAY,IAAI,KAAK,GAAG,CAAC,CAAC;AAC1C,sBAAY,OAAO,KAAK,GAAG,CAAC;AAE5B,eAAK,GAAG,IAAI;AAAA,YACV,OAAO,KAAK;AAAA,YACZ,KAAK,GAAG;AAAA,YACR,OAAO;AAAA,UACT;AACA,sBAAY,IAAI,KAAK,GAAG,GAAG,EAAE;AAAA,QAC/B,OAAO;AAEL,gBAAM,WAAW;AAAA,YACf;AAAA,YACA;AAAA,YACA,OAAO,QAAQ;AAAA,YACf,OAAO;AAAA,UACT;AAGA,gBAAM,WAAW;AAAA,YACf,OAAO,KAAK;AAAA,YACZ;AAAA,YACA,OAAO;AAAA,UACT;AACA;AAAA,YACE;AAAA,YACA;AAAA,YACA;AAAA,YACA,OAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA;AACE,kBAAY,MAAM;AAAA,EACtB;AACF;AAEA,SAAS,wBACP,aACA,MACA,UACA,aACM;AACN,QAAM,EAAC,KAAK,MAAK,IAAI,aAAa,MAAM,UAAU,WAAW;AAE7D,MAAI,cAAc;AAClB,MAAI,KAAK;AACT,MAAI,OAAO;AACT,kBAAc;AACd,SAAK,KAAK,YAAY,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI;AACxC,gBAAY,OAAO,KAAK,GAAG,CAAC;AAAA,EAC9B;AAGA,OAAK,OAAO,KAAK,aAAa,QAAQ;AACtC,cAAY,IAAI,UAAU,EAAE;AAC9B;AAEA,SAAS,yBACP,aACA,MACA,QACA,aACO;AACP,QAAM,EAAC,KAAK,MAAK,IAAI,aAAa,MAAM,QAAQ,WAAW;AAC3D,SAAO,OAAO,qBAAqB;AACnC,QAAM,WAAW,KAAK,GAAG;AACzB,QAAM,KAAK,KAAK,YAAY,IAAI,QAAQ,CAAC;AACzC,MAAI,OAAO,GAAG;AACZ,gBAAY,OAAO,QAAQ;AAE3B,SAAK,OAAO,KAAK,CAAC;AAAA,EACpB,OAAO;AACL,gBAAY,IAAI,UAAU,KAAK,CAAC;AAAA,EAClC;AAEA,SAAO;AACT;AAGA,SAAS,aAAa,MAAiB,QAAe,YAAwB;AAC5E,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,KAAI;AAAA,IAC/B;AAAA,EACF;AACA,SAAO,EAAC,KAAK,KAAK,OAAO,MAAK;AAChC;AAEA,SAAS,+BACP,KACA,OACA,eACO;AACP,QAAM,SAAgB,EAAC,GAAG,IAAG;AAC7B,aAAW,gBAAgB,eAAe;AACxC,WAAO,EAAE,gBAAgB,MAAM,6BAA6B;AAE5D,WAAO,YAAY,IAAI,MAAM,YAAY;AAAA,EAC3C;AACA,SAAO;AACT;AAEA,SAAS,kBACP,aACA,cACW;AACX,QAAM,OAAO,YAAY,YAAY;AACrC,cAAY,IAAI;AAChB,SAAO;AACT;AAEA,SAAS,gBAAgB,GAAoC;AAC3D,cAAY,CAAC;AACf;AAEA,SAAS,YAAY,GAAgC;AACnD,eAAa,CAAC;AAChB;",
+  "names": ["node", "relationship"]
 }

package/out/{chunk-RUSVENO2.js → chunk-UZE45UK4.js}

@@ -21,7 +21,7 @@ import {
   throwInvalidType,
   unreachable,
   valuesEqual
-} from "./chunk-7ARRNDLF.js";
+} from "./chunk-SVJISXWE.js";
 import {
   __export,
   __reExport
@@ -6315,7 +6315,7 @@ async function persistDD31(lc, clientID, memdag, perdag, mutators, closed, forma
     return;
   }
   let memdagBaseSnapshotPersisted = false;
-  const zeroDataForMemdagBaseSnapshot = getZeroData && await getZeroData("rebase", memdagBaseSnapshot.chunk.hash);
+  const zeroDataForMemdagBaseSnapshot = getZeroData && await getZeroData(memdagBaseSnapshot.chunk.hash);
   await withWrite(perdag, async (perdagWrite) => {
     const [mainClientGroup, latestPerdagMainClientGroupHeadCommit] = await getClientGroupInfo(perdagWrite, mainClientGroupID);
     let newMainClientGroupHeadHash = latestPerdagMainClientGroupHeadCommit.chunk.hash;
@@ -6368,7 +6368,7 @@ async function persistDD31(lc, clientID, memdag, perdag, mutators, closed, forma
     }
     let zeroDataForPerdagHeadCommit;
     if (!memdagBaseSnapshotPersisted) {
-      zeroDataForPerdagHeadCommit = getZeroData && await getZeroData("rebase", newMainClientGroupHeadHash, {
+      zeroDataForPerdagHeadCommit = getZeroData && await getZeroData(newMainClientGroupHeadHash, {
         openLazySourceRead: perdagWrite
       });
     }
@@ -6575,13 +6575,9 @@ async function refresh(lc, memdag, perdag, clientID, mutators, diffConfig, close
       await Promise.all(ps);
       let newMemdagHeadHash = perdagClientGroupHeadHash;
       if (newMemdagMutations.length > 0) {
-        const zeroData2 = await zero?.getTxData?.(
-          "rebase",
-          newMemdagHeadHash,
-          {
-            openLazyRead: memdagWrite
-          }
-        );
+        const zeroData2 = await zero?.getTxData?.(newMemdagHeadHash, {
+          openLazyRead: memdagWrite
+        });
         for (let i = newMemdagMutations.length - 1; i >= 0; i--) {
           newMemdagHeadHash = (await rebaseMutationAndPutCommit(
             newMemdagMutations[i],
@@ -7624,7 +7620,7 @@ var ReplicacheImpl = class {
         void this.#schedulePersist();
         return;
       }
-      const zeroData2 = await this.#zero?.getTxData?.("rebase", syncHead);
+      const zeroData2 = await this.#zero?.getTxData?.(syncHead);
       for (const mutation of replayMutations) {
         if (this.#subscriptions.hasPendingSubscriptionRuns) {
           await Promise.resolve();
@@ -8190,7 +8186,7 @@ var ReplicacheImpl = class {
           clientID,
           await dbWrite.getMutationID(),
           "initial",
-          await this.#zero?.getTxData("initial", headHash, {
+          await this.#zero?.getTxData(headHash, {
             openLazyRead: dagWrite
           }),
           dbWrite,
@@ -13686,14 +13682,7 @@ var IVMSourceBranch = class _IVMSourceBranch {
   /**
    * Fork the branch and patch it up to match the desired head.
    */
-  async forkToHead(reason, store, desiredHead, readOptions) {
-    if (reason === "initial") {
-      assert(
-        this.hash === desiredHead,
-        "main branch must be at desired head for `initial`"
-      );
-      return this;
-    }
+  async forkToHead(store, desiredHead, readOptions) {
     const fork = this.fork();
     if (fork.hash === desiredHead) {
       return fork;
@@ -14114,12 +14103,7 @@ var TransactionImpl = class {
     this.mutate = makeSchemaCRUD(
       schema,
       repTx,
-      // CRUD operators should not mutate the IVM store directly
-      // for `initial`. The IVM store will be updated via calls to `advance`
-      // after the transaction has been committed to the Replicache b-tree.
-      // Mutating the IVM store in the mutator would cause us to synchronously
-      // notify listeners of IVM while we're inside of the Replicache DB transaction.
-      repTx.reason === "initial" ? void 0 : must(
+      must(
         castedRepTx[zeroData],
         "zero was not set on replicache internal options!"
       )
@@ -14515,7 +14499,7 @@ function makeMessage(message, context, logLevel) {
 }
 
 // ../zero-client/src/client/version.ts
-var version2 = "0.17.2025031400";
+var version2 = "0.17.2025031401";
 
 // ../zero-client/src/client/log-options.ts
 var LevelFilterLogSink = class {
@@ -15467,12 +15451,11 @@ var ZeroRep = class {
     this.#store = store;
     this.#context.processChanges(void 0, hash2, diffs);
   }
-  getTxData = (reason, desiredHead, readOptions) => {
+  getTxData = (desiredHead, readOptions) => {
     if (!this.#customMutatorsEnabled) {
       return;
     }
     return this.#ivmMain.forkToHead(
-      reason,
       must(this.#store),
       desiredHead,
       readOptions
@@ -15673,19 +15656,45 @@ var Zero = class {
       [CRUD_MUTATION_NAME]: makeCRUDMutator(schema)
     };
     this.#ivmMain = new IVMSourceBranch(schema.tables);
+    function assertUnique(key) {
+      assert(
+        replicacheMutators[key] === void 0,
+        `A mutator, or mutator namespace, has already been defined for ${key}`
+      );
+    }
     const lc = new LogContext4(logOptions.logLevel, {}, logOptions.logSink);
-    for (const [namespace, mutatorsForNamespace] of Object.entries(
-      options.mutators ?? {}
-    )) {
-      for (const [name, mutator] of Object.entries(
-        mutatorsForNamespace
+    if (options.mutators) {
+      for (const [namespaceOrKey, mutatorOrMutators] of Object.entries(
+        options.mutators
       )) {
-        replicacheMutators[customMutatorKey(namespace, name)] = makeReplicacheMutator(
-          lc,
-          mutator,
-          schema,
-          slowMaterializeThreshold
-        );
+        if (typeof mutatorOrMutators === "function") {
+          const key = namespaceOrKey;
+          assertUnique(key);
+          replicacheMutators[key] = makeReplicacheMutator(
+            lc,
+            mutatorOrMutators,
+            schema,
+            slowMaterializeThreshold
+          );
+          continue;
+        }
+        if (typeof mutatorOrMutators === "object") {
+          for (const [name, mutator] of Object.entries(mutatorOrMutators)) {
+            const key = customMutatorKey(
+              namespaceOrKey,
+              name
+            );
+            assertUnique(key);
+            replicacheMutators[key] = makeReplicacheMutator(
+              lc,
+              mutator,
+              schema,
+              slowMaterializeThreshold
+            );
+          }
+          continue;
+        }
+        unreachable(mutatorOrMutators);
       }
     }
     this.storageKey = storageKey ?? "";
@@ -15759,19 +15768,23 @@ var Zero = class {
     if (options.mutators) {
       mutate = {};
       mutateBatch = void 0;
-    }
-    for (const [namespace, mutatorsForNamespace] of Object.entries(
-      options.mutators ?? {}
-    )) {
-      let existing = mutate[namespace];
-      if (existing === void 0) {
-        existing = {};
-        mutate[namespace] = existing;
-      }
-      for (const name of Object.keys(
-        mutatorsForNamespace
+      for (const [namespaceOrKey, mutatorsOrMutator] of Object.entries(
+        options.mutators
       )) {
-        existing[name] = must(rep.mutate[customMutatorKey(namespace, name)]);
+        if (typeof mutatorsOrMutator === "function") {
+          mutate[namespaceOrKey] = must(rep.mutate[namespaceOrKey]);
+          continue;
+        }
+        let existing = mutate[namespaceOrKey];
+        if (existing === void 0) {
+          existing = {};
+          mutate[namespaceOrKey] = existing;
+        }
+        for (const name of Object.keys(mutatorsOrMutator)) {
+          existing[name] = must(
+            rep.mutate[customMutatorKey(namespaceOrKey, name)]
+          );
+        }
       }
     }
     this.mutate = mutate;
@@ -16791,4 +16804,4 @@ export {
   escapeLike,
   Zero
 };
-//# sourceMappingURL=chunk-RUSVENO2.js.map
+//# sourceMappingURL=chunk-UZE45UK4.js.map