@rocicorp/zero 0.12.2025012601 → 0.12.2025012800

package/out/{chunk-I5GSZARI.js → chunk-QAAJZ32T.js}

@@ -293,4 +293,4 @@ export {
   must,
   applyChange
 };
-//# sourceMappingURL=chunk-I5GSZARI.js.map
+//# sourceMappingURL=chunk-QAAJZ32T.js.map

package/out/{chunk-I5GSZARI.js.map → chunk-QAAJZ32T.js.map}

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../shared/src/asserts.ts", "../../shared/src/must.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    const msgStr = typeof msg === 'string' ? msg : msg();\n    throw new Error(msgStr);\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 {\n  assert,\n  assertArray,\n  assertObject,\n  assertUndefined,\n  unreachable,\n} from '../../../shared/src/asserts.js';\nimport {must} from '../../../shared/src/must.js';\nimport type {Row} from '../../../zero-protocol/src/data.js';\nimport type {Change} from './change.js';\nimport type {Comparator, Node} from './data.js';\nimport type {SourceSchema} from './schema.js';\nimport type {Entry, EntryList, Format} from './view.js';\n\nexport function applyChange(\n  parentEntry: Entry,\n  change: Change,\n  schema: SourceSchema,\n  relationship: string,\n  format: Format,\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            );\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        );\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        assertUndefined(\n          parentEntry[relationship],\n          'single output already exists',\n        );\n        parentEntry[relationship] = newEntry;\n      } else {\n        const view = getChildEntryList(parentEntry, relationship);\n        const {pos, found} = binarySearch(view, newEntry, schema.compareRows);\n        assert(!found, 'node already exists');\n        // @ts-expect-error view is readonly\n        view.splice(pos, 0, newEntry);\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        newEntry[relationship] = newView;\n        for (const node of children) {\n          applyChange(\n            newEntry,\n            {type: 'add', node},\n            childSchema,\n            relationship,\n            childFormat,\n          );\n        }\n      }\n      break;\n    }\n    case 'remove': {\n      if (singular) {\n        assertObject(parentEntry[relationship]);\n        parentEntry[relationship] = undefined;\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        // @ts-expect-error view is readonly\n        view.splice(pos, 1);\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(view, change.row, schema.compareRows);\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        );\n      }\n      break;\n    }\n    case 'edit': {\n      if (singular) {\n        assertObject(parentEntry[relationship]);\n        parentEntry[relationship] = {\n          ...parentEntry[relationship],\n          ...change.node.row,\n        };\n      } else {\n        const view = parentEntry[relationship] as EntryList | undefined;\n        assertArray(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          view[pos] = makeEntryPreserveRelationships(\n            change.node.row,\n            view[pos],\n            schema.relationships,\n          );\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          view.splice(pos, 1);\n\n          // Insert\n          {\n            const {pos, found} = binarySearch(\n              view,\n              change.node.row,\n              schema.compareRows,\n            );\n            assert(!found, 'node already exists');\n            view.splice(\n              pos,\n              0,\n              makeEntryPreserveRelationships(\n                change.node.row,\n                oldEntry,\n                schema.relationships,\n              ),\n            );\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]: SourceSchema},\n): Entry {\n  const result: Entry = {...row};\n  for (const relationship in relationships) {\n    assert(!(relationship in row), 'Relationship already exists');\n    result[relationship] = entry[relationship];\n  }\n  return result;\n}\n\nfunction 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\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"],
+  "sourcesContent": ["export function assert(\n  b: unknown,\n  msg: string | (() => string) = 'Assertion failed',\n): asserts b {\n  if (!b) {\n    const msgStr = typeof msg === 'string' ? msg : msg();\n    throw new Error(msgStr);\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 {\n  assert,\n  assertArray,\n  assertObject,\n  assertUndefined,\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 type {Change} from './change.ts';\nimport type {Comparator, Node} from './data.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Entry, EntryList, Format} from './view.ts';\n\nexport function applyChange(\n  parentEntry: Entry,\n  change: Change,\n  schema: SourceSchema,\n  relationship: string,\n  format: Format,\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            );\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        );\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        assertUndefined(\n          parentEntry[relationship],\n          'single output already exists',\n        );\n        parentEntry[relationship] = newEntry;\n      } else {\n        const view = getChildEntryList(parentEntry, relationship);\n        const {pos, found} = binarySearch(view, newEntry, schema.compareRows);\n        assert(!found, 'node already exists');\n        // @ts-expect-error view is readonly\n        view.splice(pos, 0, newEntry);\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        newEntry[relationship] = newView;\n        for (const node of children) {\n          applyChange(\n            newEntry,\n            {type: 'add', node},\n            childSchema,\n            relationship,\n            childFormat,\n          );\n        }\n      }\n      break;\n    }\n    case 'remove': {\n      if (singular) {\n        assertObject(parentEntry[relationship]);\n        parentEntry[relationship] = undefined;\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        // @ts-expect-error view is readonly\n        view.splice(pos, 1);\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(view, change.row, schema.compareRows);\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        );\n      }\n      break;\n    }\n    case 'edit': {\n      if (singular) {\n        assertObject(parentEntry[relationship]);\n        parentEntry[relationship] = {\n          ...parentEntry[relationship],\n          ...change.node.row,\n        };\n      } else {\n        const view = parentEntry[relationship] as EntryList | undefined;\n        assertArray(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          view[pos] = makeEntryPreserveRelationships(\n            change.node.row,\n            view[pos],\n            schema.relationships,\n          );\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          view.splice(pos, 1);\n\n          // Insert\n          {\n            const {pos, found} = binarySearch(\n              view,\n              change.node.row,\n              schema.compareRows,\n            );\n            assert(!found, 'node already exists');\n            view.splice(\n              pos,\n              0,\n              makeEntryPreserveRelationships(\n                change.node.row,\n                oldEntry,\n                schema.relationships,\n              ),\n            );\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]: SourceSchema},\n): Entry {\n  const result: Entry = {...row};\n  for (const relationship in relationships) {\n    assert(!(relationship in row), 'Relationship already exists');\n    result[relationship] = entry[relationship];\n  }\n  return result;\n}\n\nfunction 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\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"],
   "mappings": ";AAAO,SAAS,OACd,GACA,MAA+B,oBACpB;AACX,MAAI,CAAC,GAAG;AACN,UAAM,SAAS,OAAO,QAAQ,WAAW,MAAM,IAAI;AACnD,UAAM,IAAI,MAAM,MAAM;AAAA,EACxB;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;AAEO,SAAS,gBACd,GACA,MAAM,4BACU;AAChB,MAAI,MAAM,QAAW;AACnB,UAAM,IAAI,MAAM,GAAG;AAAA,EACrB;AACF;AA0BO,SAAS,YAAY,GAAkB;AAC5C,QAAM,IAAI,MAAM,aAAa;AAC/B;;;AChGO,SAAS,KAAQ,GAAyB,KAAiB;AAEhE,MAAI,KAAK,MAAM;AACb,UAAM,IAAI,MAAM,OAAO,cAAc,CAAC,QAAQ;AAAA,EAChD;AACA,SAAO;AACT;;;ACQO,SAAS,YACd,aACA,QACA,QACA,cACA,QACA;AACA,MAAI,OAAO,UAAU;AACnB,YAAQ,OAAO,MAAM;AAAA,MACnB,KAAK;AAAA,MACL,KAAK;AACH,mBAAW,CAACA,eAAc,QAAQ,KAAK,OAAO;AAAA,UAC5C,OAAO,KAAK;AAAA,QACd,GAAG;AACD,gBAAM,cAAc,KAAK,OAAO,cAAcA,aAAY,CAAC;AAC3D,qBAAW,QAAQ,UAAU;AAC3B;AAAA,cACE;AAAA,cACA,EAAC,MAAM,OAAO,MAAM,KAAI;AAAA,cACxB;AAAA,cACAA;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,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;AAAA,UACE,YAAY,YAAY;AAAA,UACxB;AAAA,QACF;AACA,oBAAY,YAAY,IAAI;AAAA,MAC9B,OAAO;AACL,cAAM,OAAO,kBAAkB,aAAa,YAAY;AACxD,cAAM,EAAC,KAAK,MAAK,IAAI,aAAa,MAAM,UAAU,OAAO,WAAW;AACpE,eAAO,CAAC,OAAO,qBAAqB;AAEpC,aAAK,OAAO,KAAK,GAAG,QAAQ;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;AACrD,iBAASA,aAAY,IAAI;AACzB,mBAAW,QAAQ,UAAU;AAC3B;AAAA,YACE;AAAA,YACA,EAAC,MAAM,OAAO,KAAI;AAAA,YAClB;AAAA,YACAA;AAAA,YACA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA,KAAK,UAAU;AACb,UAAI,UAAU;AACZ,qBAAa,YAAY,YAAY,CAAC;AACtC,oBAAY,YAAY,IAAI;AAAA,MAC9B,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;AAEnC,aAAK,OAAO,KAAK,CAAC;AAAA,MACpB;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,MAAM,OAAO,KAAK,OAAO,WAAW;AACtE,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,QACF;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA,KAAK,QAAQ;AACX,UAAI,UAAU;AACZ,qBAAa,YAAY,YAAY,CAAC;AACtC,oBAAY,YAAY,IAAI;AAAA,UAC1B,GAAG,YAAY,YAAY;AAAA,UAC3B,GAAG,OAAO,KAAK;AAAA,QACjB;AAAA,MACF,OAAO;AACL,cAAM,OAAO,YAAY,YAAY;AACrC,oBAAY,IAAI;AAEhB,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,eAAK,GAAG,IAAI;AAAA,YACV,OAAO,KAAK;AAAA,YACZ,KAAK,GAAG;AAAA,YACR,OAAO;AAAA,UACT;AAAA,QACF,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,eAAK,OAAO,KAAK,CAAC;AAGlB;AACE,kBAAM,EAAC,KAAAC,MAAK,OAAAC,OAAK,IAAI;AAAA,cACnB;AAAA,cACA,OAAO,KAAK;AAAA,cACZ,OAAO;AAAA,YACT;AACA,mBAAO,CAACA,QAAO,qBAAqB;AACpC,iBAAK;AAAA,cACHD;AAAA,cACA;AAAA,cACA;AAAA,gBACE,OAAO,KAAK;AAAA,gBACZ;AAAA,gBACA,OAAO;AAAA,cACT;AAAA,YACF;AAAA,UACF;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;AAC5D,WAAO,YAAY,IAAI,MAAM,YAAY;AAAA,EAC3C;AACA,SAAO;AACT;AAEA,SAAS,aAAa,MAAY;AAChC,aAAW,UAAU,OAAO,OAAO,KAAK,aAAa,GAAG;AACtD,eAAWE,SAAQ,QAAQ;AACzB,mBAAaA,KAAI;AAAA,IACnB;AAAA,EACF;AACF;AAEA,SAAS,kBACP,aACA,cACW;AACX,QAAM,OAAO,YAAY,YAAY;AACrC,cAAY,IAAI;AAChB,SAAO;AACT;",
   "names": ["relationship", "pos", "found", "node"]
 }

package/out/datadog/src/mod.d.ts

@@ -1,2 +1,2 @@
-export { DatadogLogSink, type DatadogLogSinkOptions, } from './datadog-log-sink.js';
+export { DatadogLogSink, type DatadogLogSinkOptions, } from './datadog-log-sink.ts';
 //# sourceMappingURL=mod.d.ts.map

package/out/react.js

@@ -1,7 +1,7 @@
 import {
   hasOwn
 } from "./chunk-HARIWJ2J.js";
-import "./chunk-F5QR3K72.js";
+import "./chunk-424PT5DM.js";
 
 // ../zero-react/src/use-query.tsx
 import { useSyncExternalStore } from "react";

package/out/react.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../zero-react/src/use-query.tsx", "../../shared/src/deep-clone.ts", "../../zero-react/src/use-zero.tsx"],
-  "sourcesContent": ["import {useSyncExternalStore} from 'react';\nimport {deepClone} from '../../shared/src/deep-clone.js';\nimport type {Immutable} from '../../shared/src/immutable.js';\nimport type {\n  Query,\n  ReadonlyJSONValue,\n  Schema,\n  TypedView,\n} from '../../zero-client/src/mod.js';\nimport type {AdvancedQuery} from '../../zql/src/query/query-internal.js';\nimport type {HumanReadable} from '../../zql/src/query/query.js';\nimport type {ResultType} from '../../zql/src/query/typed-view.js';\nimport {useZero} from './use-zero.js';\n\nexport type QueryResultDetails = Readonly<{\n  type: ResultType;\n}>;\n\nexport type QueryResult<TReturn> = readonly [\n  HumanReadable<TReturn>,\n  QueryResultDetails,\n];\n\nexport function useQuery<\n  TSchema extends Schema,\n  TTable extends keyof TSchema['tables'] & string,\n  TReturn,\n>(\n  q: Query<TSchema, TTable, TReturn>,\n  enable: boolean = true,\n): QueryResult<TReturn> {\n  const z = useZero();\n  const view = viewStore.getView(\n    z.clientID,\n    q as AdvancedQuery<TSchema, TTable, TReturn>,\n    enable && z.server !== null,\n  );\n  // https://react.dev/reference/react/useSyncExternalStore\n  return useSyncExternalStore(\n    view.subscribeReactInternals,\n    view.getSnapshot,\n    view.getSnapshot,\n  );\n}\n\nconst emptyArray: unknown[] = [];\nconst disabledSubscriber = () => () => {};\n\nconst resultTypeUnknown = {type: 'unknown'} as const;\nconst resultTypeComplete = {type: 'complete'} as const;\n\nconst emptySnapshotSingularUnknown = [undefined, resultTypeUnknown] as const;\nconst emptySnapshotSingularComplete = [undefined, resultTypeComplete] as const;\nconst emptySnapshotPluralUnknown = [emptyArray, resultTypeUnknown] as const;\nconst emptySnapshotPluralComplete = [emptyArray, resultTypeComplete] as const;\n\nfunction getDefaultSnapshot<TReturn>(singular: boolean): QueryResult<TReturn> {\n  return (\n    singular ? emptySnapshotSingularUnknown : emptySnapshotPluralUnknown\n  ) as QueryResult<TReturn>;\n}\n\n/**\n * Returns a new snapshot or one of the empty predefined ones. Returning the\n * predefined ones is important to prevent unnecessary re-renders in React.\n */\nfunction getSnapshot<TReturn>(\n  singular: boolean,\n  data: HumanReadable<TReturn>,\n  resultType: string,\n): QueryResult<TReturn> {\n  if (singular && data === undefined) {\n    return (resultType === 'complete'\n      ? emptySnapshotSingularComplete\n      : emptySnapshotSingularUnknown) as unknown as QueryResult<TReturn>;\n  }\n\n  if (!singular && (data as unknown[]).length === 0) {\n    return (\n      resultType === 'complete'\n        ? emptySnapshotPluralComplete\n        : emptySnapshotPluralUnknown\n    ) as QueryResult<TReturn>;\n  }\n\n  return [\n    data,\n    resultType === 'complete' ? resultTypeComplete : resultTypeUnknown,\n  ];\n}\n\ndeclare const TESTING: boolean;\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ntype ViewWrapperAny = ViewWrapper<any, any, any>;\n\nconst allViews = new WeakMap<ViewStore, Map<string, ViewWrapperAny>>();\n\nexport function getAllViewsSizeForTesting(store: ViewStore): number {\n  if (TESTING) {\n    return allViews.get(store)?.size ?? 0;\n  }\n  return 0;\n}\n\n/**\n * A global store of all active views.\n *\n * React subscribes and unsubscribes to these views\n * via `useSyncExternalStore`.\n *\n * Managing views through `useEffect` or `useLayoutEffect` causes\n * inconsistencies because effects run after render.\n *\n * For example, if useQuery used use*Effect in the component below:\n * ```ts\n * function Foo({issueID}) {\n *   const issue = useQuery(z.query.issue.where('id', issueID).one());\n *   if (issue?.id !== undefined && issue.id !== issueID) {\n *     console.log('MISMATCH!', issue.id, issueID);\n *   }\n * }\n * ```\n *\n * `MISMATCH` will be printed whenever the `issueID` prop changes.\n *\n * This is because the component will render once with\n * the old state returned from `useQuery`. Then the effect inside\n * `useQuery` will run. The component will render again with the new\n * state. This inconsistent transition can cause unexpected results.\n *\n * Emulating `useEffect` via `useState` and `if` causes resource leaks.\n * That is:\n *\n * ```ts\n * function useQuery(q) {\n *   const [oldHash, setOldHash] = useState();\n *   if (hash(q) !== oldHash) {\n *      // make new view\n *   }\n *\n *   useEffect(() => {\n *     return () => view.destroy();\n *   }, []);\n * }\n * ```\n *\n * I'm not sure why but in strict mode the cleanup function\n * fails to be called for the first instance of the view and only\n * cleans up later instances.\n *\n * Swapping `useState` to `useRef` has similar problems.\n */\nexport class ViewStore {\n  #views = new Map<string, ViewWrapperAny>();\n\n  constructor() {\n    if (TESTING) {\n      allViews.set(this, this.#views);\n    }\n  }\n\n  getView<\n    TSchema extends Schema,\n    TTable extends keyof TSchema['tables'] & string,\n    TReturn,\n  >(\n    clientID: string,\n    query: AdvancedQuery<TSchema, TTable, TReturn>,\n    enabled: boolean,\n  ): {\n    getSnapshot: () => QueryResult<TReturn>;\n    subscribeReactInternals: (internals: () => void) => () => void;\n  } {\n    if (!enabled) {\n      return {\n        getSnapshot: () => getDefaultSnapshot(query.format.singular),\n        subscribeReactInternals: disabledSubscriber,\n      };\n    }\n\n    const hash = query.hash() + clientID;\n    let existing = this.#views.get(hash);\n    if (!existing) {\n      existing = new ViewWrapper(\n        query,\n        view => {\n          const lastView = this.#views.get(hash);\n          // I don't think this can happen\n          // but lets guard against it so we don't\n          // leak resources.\n          if (lastView && lastView !== view) {\n            throw new Error('View already exists');\n          }\n          this.#views.set(hash, view);\n        },\n        () => {\n          this.#views.delete(hash);\n        },\n      ) as ViewWrapper<TSchema, TTable, TReturn>;\n      this.#views.set(hash, existing);\n    }\n    return existing as ViewWrapper<TSchema, TTable, TReturn>;\n  }\n}\n\nconst viewStore = new ViewStore();\n\n/**\n * This wraps and ref counts a view.\n *\n * The only signal we have from React as to whether or not it is\n * done with a view is when it calls `unsubscribe`.\n *\n * In non-strict-mode we can clean up the view as soon\n * as the listener count goes to 0.\n *\n * In strict-mode, the listener count will go to 0 then a\n * new listener for the same view is immediately added back.\n *\n * This is why the `onMaterialized` and `onDematerialized` callbacks exist --\n * they allow a view which React is still referencing to be added\n * back into the store when React re-subscribes to it.\n *\n * This wrapper also exists to deal with the various\n * `useSyncExternalStore` caveats that cause excessive\n * re-renders and materializations.\n *\n * See: https://react.dev/reference/react/useSyncExternalStore#caveats\n * Especially:\n * 1. The store snapshot returned by getSnapshot must be immutable. If the underlying store has mutable data, return a new immutable snapshot if the data has changed. Otherwise, return a cached last snapshot.\n * 2. If a different subscribe function is passed during a re-render, React will re-subscribe to the store using the newly passed subscribe function. You can prevent this by declaring subscribe outside the component.\n */\nclass ViewWrapper<\n  TSchema extends Schema,\n  TTable extends keyof TSchema['tables'] & string,\n  TReturn,\n> {\n  #view: TypedView<HumanReadable<TReturn>> | undefined;\n  readonly #onDematerialized;\n  readonly #onMaterialized;\n  readonly #query: AdvancedQuery<TSchema, TTable, TReturn>;\n  #snapshot: QueryResult<TReturn>;\n  #reactInternals: Set<() => void>;\n\n  constructor(\n    query: AdvancedQuery<TSchema, TTable, TReturn>,\n    onMaterialized: (view: ViewWrapper<TSchema, TTable, TReturn>) => void,\n    onDematerialized: () => void,\n  ) {\n    this.#snapshot = getDefaultSnapshot(query.format.singular);\n    this.#onMaterialized = onMaterialized;\n    this.#onDematerialized = onDematerialized;\n    this.#reactInternals = new Set();\n    this.#query = query;\n    this.#materializeIfNeeded();\n  }\n\n  #onData = (\n    snap: Immutable<HumanReadable<TReturn>>,\n    resultType: ResultType,\n  ) => {\n    const data =\n      snap === undefined\n        ? snap\n        : (deepClone(snap as ReadonlyJSONValue) as HumanReadable<TReturn>);\n    this.#snapshot = getSnapshot(this.#query.format.singular, data, resultType);\n    for (const internals of this.#reactInternals) {\n      internals();\n    }\n  };\n\n  #materializeIfNeeded = () => {\n    if (this.#view) {\n      return;\n    }\n\n    this.#view = this.#query.materialize();\n    this.#view.addListener(this.#onData);\n\n    this.#onMaterialized(this);\n  };\n\n  getSnapshot = () => this.#snapshot;\n\n  subscribeReactInternals = (internals: () => void): (() => void) => {\n    this.#reactInternals.add(internals);\n    this.#materializeIfNeeded();\n    return () => {\n      this.#reactInternals.delete(internals);\n\n      // only schedule a cleanup task if we have no listeners left\n      if (this.#reactInternals.size === 0) {\n        setTimeout(() => {\n          // Someone re-registered a listener on this view before the timeout elapsed.\n          // This happens often in strict-mode which forces a component\n          // to mount, unmount, remount.\n          if (this.#reactInternals.size > 0) {\n            return;\n          }\n          // We already destroyed the view\n          if (this.#view === undefined) {\n            return;\n          }\n          this.#view?.destroy();\n          this.#view = undefined;\n          this.#onDematerialized();\n        }, 10);\n      }\n    };\n  };\n}\n", "import {hasOwn} from './has-own.js';\nimport type {JSONValue, ReadonlyJSONValue} from './json.js';\n\nexport function deepClone(value: ReadonlyJSONValue): JSONValue {\n  const seen: Array<ReadonlyJSONValue> = [];\n  return internalDeepClone(value, seen);\n}\n\nexport function internalDeepClone(\n  value: ReadonlyJSONValue,\n  seen: Array<ReadonlyJSONValue>,\n): JSONValue {\n  switch (typeof value) {\n    case 'boolean':\n    case 'number':\n    case 'string':\n    case 'undefined':\n      return value;\n    case 'object': {\n      if (value === null) {\n        return null;\n      }\n      if (seen.includes(value)) {\n        throw new Error('Cyclic object');\n      }\n      seen.push(value);\n      if (Array.isArray(value)) {\n        const rv = value.map(v => internalDeepClone(v, seen));\n        seen.pop();\n        return rv;\n      }\n\n      const obj: JSONValue = {};\n\n      for (const k in value) {\n        if (hasOwn(value, k)) {\n          const v = (value as Record<string, ReadonlyJSONValue>)[k];\n          if (v !== undefined) {\n            obj[k] = internalDeepClone(v, seen);\n          }\n        }\n      }\n      seen.pop();\n      return obj;\n    }\n\n    default:\n      throw new Error(`Invalid type: ${typeof value}`);\n  }\n}\n", "import {createContext, useContext} from 'react';\nimport type {Zero} from '../../zero-client/src/mod.js';\nimport type {Schema} from '../../zero-schema/src/mod.js';\n\n// eslint-disable-next-line @typescript-eslint/naming-convention\nconst ZeroContext = createContext<unknown | undefined>(undefined);\n\nexport function useZero<S extends Schema>(): Zero<S> {\n  const zero = useContext(ZeroContext);\n  if (zero === undefined) {\n    throw new Error('useZero must be used within a ZeroProvider');\n  }\n  return zero as Zero<S>;\n}\n\nexport function createUseZero<S extends Schema>() {\n  return () => useZero<S>();\n}\n\nexport function ZeroProvider<S extends Schema>({\n  children,\n  zero,\n}: {\n  children: React.ReactNode;\n  zero: Zero<S>;\n}) {\n  return <ZeroContext.Provider value={zero}>{children}</ZeroContext.Provider>;\n}\n"],
+  "sourcesContent": ["import {useSyncExternalStore} from 'react';\nimport {deepClone} from '../../shared/src/deep-clone.ts';\nimport type {Immutable} from '../../shared/src/immutable.ts';\nimport type {\n  Query,\n  ReadonlyJSONValue,\n  Schema,\n  TypedView,\n} from '../../zero-client/src/mod.ts';\nimport type {AdvancedQuery} from '../../zql/src/query/query-internal.ts';\nimport type {HumanReadable} from '../../zql/src/query/query.ts';\nimport type {ResultType} from '../../zql/src/query/typed-view.ts';\nimport {useZero} from './use-zero.tsx';\n\nexport type QueryResultDetails = Readonly<{\n  type: ResultType;\n}>;\n\nexport type QueryResult<TReturn> = readonly [\n  HumanReadable<TReturn>,\n  QueryResultDetails,\n];\n\nexport function useQuery<\n  TSchema extends Schema,\n  TTable extends keyof TSchema['tables'] & string,\n  TReturn,\n>(\n  q: Query<TSchema, TTable, TReturn>,\n  enable: boolean = true,\n): QueryResult<TReturn> {\n  const z = useZero();\n  const view = viewStore.getView(\n    z.clientID,\n    q as AdvancedQuery<TSchema, TTable, TReturn>,\n    enable && z.server !== null,\n  );\n  // https://react.dev/reference/react/useSyncExternalStore\n  return useSyncExternalStore(\n    view.subscribeReactInternals,\n    view.getSnapshot,\n    view.getSnapshot,\n  );\n}\n\nconst emptyArray: unknown[] = [];\nconst disabledSubscriber = () => () => {};\n\nconst resultTypeUnknown = {type: 'unknown'} as const;\nconst resultTypeComplete = {type: 'complete'} as const;\n\nconst emptySnapshotSingularUnknown = [undefined, resultTypeUnknown] as const;\nconst emptySnapshotSingularComplete = [undefined, resultTypeComplete] as const;\nconst emptySnapshotPluralUnknown = [emptyArray, resultTypeUnknown] as const;\nconst emptySnapshotPluralComplete = [emptyArray, resultTypeComplete] as const;\n\nfunction getDefaultSnapshot<TReturn>(singular: boolean): QueryResult<TReturn> {\n  return (\n    singular ? emptySnapshotSingularUnknown : emptySnapshotPluralUnknown\n  ) as QueryResult<TReturn>;\n}\n\n/**\n * Returns a new snapshot or one of the empty predefined ones. Returning the\n * predefined ones is important to prevent unnecessary re-renders in React.\n */\nfunction getSnapshot<TReturn>(\n  singular: boolean,\n  data: HumanReadable<TReturn>,\n  resultType: string,\n): QueryResult<TReturn> {\n  if (singular && data === undefined) {\n    return (resultType === 'complete'\n      ? emptySnapshotSingularComplete\n      : emptySnapshotSingularUnknown) as unknown as QueryResult<TReturn>;\n  }\n\n  if (!singular && (data as unknown[]).length === 0) {\n    return (\n      resultType === 'complete'\n        ? emptySnapshotPluralComplete\n        : emptySnapshotPluralUnknown\n    ) as QueryResult<TReturn>;\n  }\n\n  return [\n    data,\n    resultType === 'complete' ? resultTypeComplete : resultTypeUnknown,\n  ];\n}\n\ndeclare const TESTING: boolean;\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ntype ViewWrapperAny = ViewWrapper<any, any, any>;\n\nconst allViews = new WeakMap<ViewStore, Map<string, ViewWrapperAny>>();\n\nexport function getAllViewsSizeForTesting(store: ViewStore): number {\n  if (TESTING) {\n    return allViews.get(store)?.size ?? 0;\n  }\n  return 0;\n}\n\n/**\n * A global store of all active views.\n *\n * React subscribes and unsubscribes to these views\n * via `useSyncExternalStore`.\n *\n * Managing views through `useEffect` or `useLayoutEffect` causes\n * inconsistencies because effects run after render.\n *\n * For example, if useQuery used use*Effect in the component below:\n * ```ts\n * function Foo({issueID}) {\n *   const issue = useQuery(z.query.issue.where('id', issueID).one());\n *   if (issue?.id !== undefined && issue.id !== issueID) {\n *     console.log('MISMATCH!', issue.id, issueID);\n *   }\n * }\n * ```\n *\n * `MISMATCH` will be printed whenever the `issueID` prop changes.\n *\n * This is because the component will render once with\n * the old state returned from `useQuery`. Then the effect inside\n * `useQuery` will run. The component will render again with the new\n * state. This inconsistent transition can cause unexpected results.\n *\n * Emulating `useEffect` via `useState` and `if` causes resource leaks.\n * That is:\n *\n * ```ts\n * function useQuery(q) {\n *   const [oldHash, setOldHash] = useState();\n *   if (hash(q) !== oldHash) {\n *      // make new view\n *   }\n *\n *   useEffect(() => {\n *     return () => view.destroy();\n *   }, []);\n * }\n * ```\n *\n * I'm not sure why but in strict mode the cleanup function\n * fails to be called for the first instance of the view and only\n * cleans up later instances.\n *\n * Swapping `useState` to `useRef` has similar problems.\n */\nexport class ViewStore {\n  #views = new Map<string, ViewWrapperAny>();\n\n  constructor() {\n    if (TESTING) {\n      allViews.set(this, this.#views);\n    }\n  }\n\n  getView<\n    TSchema extends Schema,\n    TTable extends keyof TSchema['tables'] & string,\n    TReturn,\n  >(\n    clientID: string,\n    query: AdvancedQuery<TSchema, TTable, TReturn>,\n    enabled: boolean,\n  ): {\n    getSnapshot: () => QueryResult<TReturn>;\n    subscribeReactInternals: (internals: () => void) => () => void;\n  } {\n    if (!enabled) {\n      return {\n        getSnapshot: () => getDefaultSnapshot(query.format.singular),\n        subscribeReactInternals: disabledSubscriber,\n      };\n    }\n\n    const hash = query.hash() + clientID;\n    let existing = this.#views.get(hash);\n    if (!existing) {\n      existing = new ViewWrapper(\n        query,\n        view => {\n          const lastView = this.#views.get(hash);\n          // I don't think this can happen\n          // but lets guard against it so we don't\n          // leak resources.\n          if (lastView && lastView !== view) {\n            throw new Error('View already exists');\n          }\n          this.#views.set(hash, view);\n        },\n        () => {\n          this.#views.delete(hash);\n        },\n      ) as ViewWrapper<TSchema, TTable, TReturn>;\n      this.#views.set(hash, existing);\n    }\n    return existing as ViewWrapper<TSchema, TTable, TReturn>;\n  }\n}\n\nconst viewStore = new ViewStore();\n\n/**\n * This wraps and ref counts a view.\n *\n * The only signal we have from React as to whether or not it is\n * done with a view is when it calls `unsubscribe`.\n *\n * In non-strict-mode we can clean up the view as soon\n * as the listener count goes to 0.\n *\n * In strict-mode, the listener count will go to 0 then a\n * new listener for the same view is immediately added back.\n *\n * This is why the `onMaterialized` and `onDematerialized` callbacks exist --\n * they allow a view which React is still referencing to be added\n * back into the store when React re-subscribes to it.\n *\n * This wrapper also exists to deal with the various\n * `useSyncExternalStore` caveats that cause excessive\n * re-renders and materializations.\n *\n * See: https://react.dev/reference/react/useSyncExternalStore#caveats\n * Especially:\n * 1. The store snapshot returned by getSnapshot must be immutable. If the underlying store has mutable data, return a new immutable snapshot if the data has changed. Otherwise, return a cached last snapshot.\n * 2. If a different subscribe function is passed during a re-render, React will re-subscribe to the store using the newly passed subscribe function. You can prevent this by declaring subscribe outside the component.\n */\nclass ViewWrapper<\n  TSchema extends Schema,\n  TTable extends keyof TSchema['tables'] & string,\n  TReturn,\n> {\n  #view: TypedView<HumanReadable<TReturn>> | undefined;\n  readonly #onDematerialized;\n  readonly #onMaterialized;\n  readonly #query: AdvancedQuery<TSchema, TTable, TReturn>;\n  #snapshot: QueryResult<TReturn>;\n  #reactInternals: Set<() => void>;\n\n  constructor(\n    query: AdvancedQuery<TSchema, TTable, TReturn>,\n    onMaterialized: (view: ViewWrapper<TSchema, TTable, TReturn>) => void,\n    onDematerialized: () => void,\n  ) {\n    this.#snapshot = getDefaultSnapshot(query.format.singular);\n    this.#onMaterialized = onMaterialized;\n    this.#onDematerialized = onDematerialized;\n    this.#reactInternals = new Set();\n    this.#query = query;\n    this.#materializeIfNeeded();\n  }\n\n  #onData = (\n    snap: Immutable<HumanReadable<TReturn>>,\n    resultType: ResultType,\n  ) => {\n    const data =\n      snap === undefined\n        ? snap\n        : (deepClone(snap as ReadonlyJSONValue) as HumanReadable<TReturn>);\n    this.#snapshot = getSnapshot(this.#query.format.singular, data, resultType);\n    for (const internals of this.#reactInternals) {\n      internals();\n    }\n  };\n\n  #materializeIfNeeded = () => {\n    if (this.#view) {\n      return;\n    }\n\n    this.#view = this.#query.materialize();\n    this.#view.addListener(this.#onData);\n\n    this.#onMaterialized(this);\n  };\n\n  getSnapshot = () => this.#snapshot;\n\n  subscribeReactInternals = (internals: () => void): (() => void) => {\n    this.#reactInternals.add(internals);\n    this.#materializeIfNeeded();\n    return () => {\n      this.#reactInternals.delete(internals);\n\n      // only schedule a cleanup task if we have no listeners left\n      if (this.#reactInternals.size === 0) {\n        setTimeout(() => {\n          // Someone re-registered a listener on this view before the timeout elapsed.\n          // This happens often in strict-mode which forces a component\n          // to mount, unmount, remount.\n          if (this.#reactInternals.size > 0) {\n            return;\n          }\n          // We already destroyed the view\n          if (this.#view === undefined) {\n            return;\n          }\n          this.#view?.destroy();\n          this.#view = undefined;\n          this.#onDematerialized();\n        }, 10);\n      }\n    };\n  };\n}\n", "import {hasOwn} from './has-own.ts';\nimport type {JSONValue, ReadonlyJSONValue} from './json.ts';\n\nexport function deepClone(value: ReadonlyJSONValue): JSONValue {\n  const seen: Array<ReadonlyJSONValue> = [];\n  return internalDeepClone(value, seen);\n}\n\nexport function internalDeepClone(\n  value: ReadonlyJSONValue,\n  seen: Array<ReadonlyJSONValue>,\n): JSONValue {\n  switch (typeof value) {\n    case 'boolean':\n    case 'number':\n    case 'string':\n    case 'undefined':\n      return value;\n    case 'object': {\n      if (value === null) {\n        return null;\n      }\n      if (seen.includes(value)) {\n        throw new Error('Cyclic object');\n      }\n      seen.push(value);\n      if (Array.isArray(value)) {\n        const rv = value.map(v => internalDeepClone(v, seen));\n        seen.pop();\n        return rv;\n      }\n\n      const obj: JSONValue = {};\n\n      for (const k in value) {\n        if (hasOwn(value, k)) {\n          const v = (value as Record<string, ReadonlyJSONValue>)[k];\n          if (v !== undefined) {\n            obj[k] = internalDeepClone(v, seen);\n          }\n        }\n      }\n      seen.pop();\n      return obj;\n    }\n\n    default:\n      throw new Error(`Invalid type: ${typeof value}`);\n  }\n}\n", "import {createContext, useContext} from 'react';\nimport type {Zero} from '../../zero-client/src/mod.ts';\nimport type {Schema} from '../../zero-schema/src/mod.ts';\n\n// eslint-disable-next-line @typescript-eslint/naming-convention\nconst ZeroContext = createContext<unknown | undefined>(undefined);\n\nexport function useZero<S extends Schema>(): Zero<S> {\n  const zero = useContext(ZeroContext);\n  if (zero === undefined) {\n    throw new Error('useZero must be used within a ZeroProvider');\n  }\n  return zero as Zero<S>;\n}\n\nexport function createUseZero<S extends Schema>() {\n  return () => useZero<S>();\n}\n\nexport function ZeroProvider<S extends Schema>({\n  children,\n  zero,\n}: {\n  children: React.ReactNode;\n  zero: Zero<S>;\n}) {\n  return <ZeroContext.Provider value={zero}>{children}</ZeroContext.Provider>;\n}\n"],
   "mappings": ";;;;;;AAAA,SAAQ,4BAA2B;;;ACG5B,SAAS,UAAU,OAAqC;AAC7D,QAAM,OAAiC,CAAC;AACxC,SAAO,kBAAkB,OAAO,IAAI;AACtC;AAEO,SAAS,kBACd,OACA,MACW;AACX,UAAQ,OAAO,OAAO;AAAA,IACpB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT,KAAK,UAAU;AACb,UAAI,UAAU,MAAM;AAClB,eAAO;AAAA,MACT;AACA,UAAI,KAAK,SAAS,KAAK,GAAG;AACxB,cAAM,IAAI,MAAM,eAAe;AAAA,MACjC;AACA,WAAK,KAAK,KAAK;AACf,UAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,cAAM,KAAK,MAAM,IAAI,OAAK,kBAAkB,GAAG,IAAI,CAAC;AACpD,aAAK,IAAI;AACT,eAAO;AAAA,MACT;AAEA,YAAM,MAAiB,CAAC;AAExB,iBAAW,KAAK,OAAO;AACrB,YAAI,OAAO,OAAO,CAAC,GAAG;AACpB,gBAAM,IAAK,MAA4C,CAAC;AACxD,cAAI,MAAM,QAAW;AACnB,gBAAI,CAAC,IAAI,kBAAkB,GAAG,IAAI;AAAA,UACpC;AAAA,QACF;AAAA,MACF;AACA,WAAK,IAAI;AACT,aAAO;AAAA,IACT;AAAA,IAEA;AACE,YAAM,IAAI,MAAM,iBAAiB,OAAO,KAAK,EAAE;AAAA,EACnD;AACF;;;ACjDA,SAAQ,eAAe,kBAAiB;AA0B/B;AArBT,IAAM,cAAc,cAAmC,MAAS;AAEzD,SAAS,UAAqC;AACnD,QAAM,OAAO,WAAW,WAAW;AACnC,MAAI,SAAS,QAAW;AACtB,UAAM,IAAI,MAAM,4CAA4C;AAAA,EAC9D;AACA,SAAO;AACT;AAEO,SAAS,gBAAkC;AAChD,SAAO,MAAM,QAAW;AAC1B;AAEO,SAAS,aAA+B;AAAA,EAC7C;AAAA,EACA;AACF,GAGG;AACD,SAAO,oBAAC,YAAY,UAAZ,EAAqB,OAAO,MAAO,UAAS;AACtD;;;AFJO,SAAS,SAKd,GACA,SAAkB,MACI;AACtB,QAAM,IAAI,QAAQ;AAClB,QAAM,OAAO,UAAU;AAAA,IACrB,EAAE;AAAA,IACF;AAAA,IACA,UAAU,EAAE,WAAW;AAAA,EACzB;AAEA,SAAO;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,EACP;AACF;AAEA,IAAM,aAAwB,CAAC;AAC/B,IAAM,qBAAqB,MAAM,MAAM;AAAC;AAExC,IAAM,oBAAoB,EAAC,MAAM,UAAS;AAC1C,IAAM,qBAAqB,EAAC,MAAM,WAAU;AAE5C,IAAM,+BAA+B,CAAC,QAAW,iBAAiB;AAClE,IAAM,gCAAgC,CAAC,QAAW,kBAAkB;AACpE,IAAM,6BAA6B,CAAC,YAAY,iBAAiB;AACjE,IAAM,8BAA8B,CAAC,YAAY,kBAAkB;AAEnE,SAAS,mBAA4B,UAAyC;AAC5E,SACE,WAAW,+BAA+B;AAE9C;AAMA,SAAS,YACP,UACA,MACA,YACsB;AACtB,MAAI,YAAY,SAAS,QAAW;AAClC,WAAQ,eAAe,aACnB,gCACA;AAAA,EACN;AAEA,MAAI,CAAC,YAAa,KAAmB,WAAW,GAAG;AACjD,WACE,eAAe,aACX,8BACA;AAAA,EAER;AAEA,SAAO;AAAA,IACL;AAAA,IACA,eAAe,aAAa,qBAAqB;AAAA,EACnD;AACF;AAgEO,IAAM,YAAN,MAAgB;AAAA,EACrB,SAAS,oBAAI,IAA4B;AAAA,EAEzC,cAAc;AACZ,QAAI,OAAS;AACX,eAAS,IAAI,MAAM,KAAK,MAAM;AAAA,IAChC;AAAA,EACF;AAAA,EAEA,QAKE,UACA,OACA,SAIA;AACA,QAAI,CAAC,SAAS;AACZ,aAAO;AAAA,QACL,aAAa,MAAM,mBAAmB,MAAM,OAAO,QAAQ;AAAA,QAC3D,yBAAyB;AAAA,MAC3B;AAAA,IACF;AAEA,UAAM,OAAO,MAAM,KAAK,IAAI;AAC5B,QAAI,WAAW,KAAK,OAAO,IAAI,IAAI;AACnC,QAAI,CAAC,UAAU;AACb,iBAAW,IAAI;AAAA,QACb;AAAA,QACA,UAAQ;AACN,gBAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAIrC,cAAI,YAAY,aAAa,MAAM;AACjC,kBAAM,IAAI,MAAM,qBAAqB;AAAA,UACvC;AACA,eAAK,OAAO,IAAI,MAAM,IAAI;AAAA,QAC5B;AAAA,QACA,MAAM;AACJ,eAAK,OAAO,OAAO,IAAI;AAAA,QACzB;AAAA,MACF;AACA,WAAK,OAAO,IAAI,MAAM,QAAQ;AAAA,IAChC;AACA,WAAO;AAAA,EACT;AACF;AAEA,IAAM,YAAY,IAAI,UAAU;AA2BhC,IAAM,cAAN,MAIE;AAAA,EACA;AAAA,EACS;AAAA,EACA;AAAA,EACA;AAAA,EACT;AAAA,EACA;AAAA,EAEA,YACE,OACA,gBACA,kBACA;AACA,SAAK,YAAY,mBAAmB,MAAM,OAAO,QAAQ;AACzD,SAAK,kBAAkB;AACvB,SAAK,oBAAoB;AACzB,SAAK,kBAAkB,oBAAI,IAAI;AAC/B,SAAK,SAAS;AACd,SAAK,qBAAqB;AAAA,EAC5B;AAAA,EAEA,UAAU,CACR,MACA,eACG;AACH,UAAM,OACJ,SAAS,SACL,OACC,UAAU,IAAyB;AAC1C,SAAK,YAAY,YAAY,KAAK,OAAO,OAAO,UAAU,MAAM,UAAU;AAC1E,eAAW,aAAa,KAAK,iBAAiB;AAC5C,gBAAU;AAAA,IACZ;AAAA,EACF;AAAA,EAEA,uBAAuB,MAAM;AAC3B,QAAI,KAAK,OAAO;AACd;AAAA,IACF;AAEA,SAAK,QAAQ,KAAK,OAAO,YAAY;AACrC,SAAK,MAAM,YAAY,KAAK,OAAO;AAEnC,SAAK,gBAAgB,IAAI;AAAA,EAC3B;AAAA,EAEA,cAAc,MAAM,KAAK;AAAA,EAEzB,0BAA0B,CAAC,cAAwC;AACjE,SAAK,gBAAgB,IAAI,SAAS;AAClC,SAAK,qBAAqB;AAC1B,WAAO,MAAM;AACX,WAAK,gBAAgB,OAAO,SAAS;AAGrC,UAAI,KAAK,gBAAgB,SAAS,GAAG;AACnC,mBAAW,MAAM;AAIf,cAAI,KAAK,gBAAgB,OAAO,GAAG;AACjC;AAAA,UACF;AAEA,cAAI,KAAK,UAAU,QAAW;AAC5B;AAAA,UACF;AACA,eAAK,OAAO,QAAQ;AACpB,eAAK,QAAQ;AACb,eAAK,kBAAkB;AAAA,QACzB,GAAG,EAAE;AAAA,MACP;AAAA,IACF;AAAA,EACF;AACF;",
   "names": []
 }

package/out/replicache/src/btree/diff.d.ts

@@ -1,4 +1,4 @@
-import type { InternalDiff } from './node.js';
-import type { BTreeRead } from './read.js';
+import type { InternalDiff } from './node.ts';
+import type { BTreeRead } from './read.ts';
 export declare function diff(oldMap: BTreeRead, newMap: BTreeRead): Promise<InternalDiff>;
 //# sourceMappingURL=diff.d.ts.map

package/out/replicache/src/btree/node.d.ts

@@ -1,11 +1,11 @@
-import type { Enum } from '../../../shared/src/enum.js';
-import { type ReadonlyJSONValue } from '../../../shared/src/json.js';
-import type { IndexKey } from '../db/index.js';
-import * as FormatVersion from '../format-version-enum.js';
-import { type FrozenJSONValue, type FrozenTag } from '../frozen-json.js';
-import { type Hash } from '../hash.js';
-import type { BTreeRead } from './read.js';
-import type { BTreeWrite } from './write.js';
+import type { Enum } from '../../../shared/src/enum.ts';
+import { type ReadonlyJSONValue } from '../../../shared/src/json.ts';
+import type { IndexKey } from '../db/index.ts';
+import * as FormatVersion from '../format-version-enum.ts';
+import { type FrozenJSONValue, type FrozenTag } from '../frozen-json.ts';
+import { type Hash } from '../hash.ts';
+import type { BTreeRead } from './read.ts';
+import type { BTreeWrite } from './write.ts';
 type FormatVersion = Enum<typeof FormatVersion>;
 export type Entry<V> = readonly [key: string, value: V, sizeOfEntry: number];
 export declare const NODE_LEVEL = 0;

package/out/replicache/src/btree/read.d.ts

@@ -1,9 +1,9 @@
-import type { Enum } from '../../../shared/src/enum.js';
-import type { Read } from '../dag/store.js';
-import * as FormatVersion from '../format-version-enum.js';
-import type { FrozenJSONValue } from '../frozen-json.js';
-import { type Hash } from '../hash.js';
-import { DataNodeImpl, type Entry, type InternalDiff, type InternalDiffOperation, InternalNodeImpl } from './node.js';
+import type { Enum } from '../../../shared/src/enum.ts';
+import type { Read } from '../dag/store.ts';
+import * as FormatVersion from '../format-version-enum.ts';
+import type { FrozenJSONValue } from '../frozen-json.ts';
+import { type Hash } from '../hash.ts';
+import { DataNodeImpl, type Entry, type InternalDiff, type InternalDiffOperation, InternalNodeImpl } from './node.ts';
 type FormatVersion = Enum<typeof FormatVersion>;
 /**
  * The size of the header of a node. (If we had compile time

package/out/replicache/src/btree/write.d.ts

@@ -1,10 +1,10 @@
-import type { Enum } from '../../../shared/src/enum.js';
-import type { Write } from '../dag/store.js';
-import * as FormatVersion from '../format-version-enum.js';
-import type { FrozenJSONValue } from '../frozen-json.js';
-import { type Hash } from '../hash.js';
-import { DataNodeImpl, type Entry, InternalNodeImpl } from './node.js';
-import { BTreeRead } from './read.js';
+import type { Enum } from '../../../shared/src/enum.ts';
+import type { Write } from '../dag/store.ts';
+import * as FormatVersion from '../format-version-enum.ts';
+import type { FrozenJSONValue } from '../frozen-json.ts';
+import { type Hash } from '../hash.ts';
+import { DataNodeImpl, type Entry, InternalNodeImpl } from './node.ts';
+import { BTreeRead } from './read.ts';
 type FormatVersion = Enum<typeof FormatVersion>;
 export declare class BTreeWrite extends BTreeRead {
     #private;

package/out/replicache/src/call-default-fetch.d.ts

@@ -1,4 +1,4 @@
-import type { HTTPRequestInfo } from './http-request-info.js';
+import type { HTTPRequestInfo } from './http-request-info.ts';
 /**
  * Helper function for {@link getDefaultPuller} and {@link getDefaultPusher}.
  */

package/out/replicache/src/config.d.ts

@@ -1,4 +1,4 @@
-import { isProd } from '../../shared/src/config.js';
+import { isProd } from '../../shared/src/config.ts';
 export { isProd as skipBTreeNodeAsserts, isProd as skipCommitDataAsserts, 
 /**
  * In debug mode we deeply freeze the values we read out of the IDB store and we

package/out/replicache/src/connection-loop-delegates.d.ts

@@ -1,5 +1,5 @@
-import type { ConnectionLoopDelegate } from './connection-loop.js';
-import type { ReplicacheImpl } from './replicache-impl.js';
+import type { ConnectionLoopDelegate } from './connection-loop.ts';
+import type { ReplicacheImpl } from './replicache-impl.ts';
 declare class ConnectionLoopDelegateImpl {
     readonly rep: ReplicacheImpl;
     readonly invokeSend: () => Promise<boolean>;

package/out/replicache/src/connection-loop.d.ts

@@ -1,5 +1,5 @@
 import type { LogContext } from '@rocicorp/logger';
-import type { DocumentVisibilityWatcher } from '../../shared/src/document-visible.js';
+import type { DocumentVisibilityWatcher } from '../../shared/src/document-visible.ts';
 export declare const DEBOUNCE_DELAY_MS = 10;
 export declare const MIN_DELAY_MS = 30;
 export declare const MAX_DELAY_MS = 60000;

package/out/replicache/src/cookies.d.ts

@@ -1,5 +1,5 @@
-import { type ReadonlyJSONValue } from '../../shared/src/json.js';
-import type { FrozenJSONValue } from './frozen-json.js';
+import { type ReadonlyJSONValue } from '../../shared/src/json.ts';
+import type { FrozenJSONValue } from './frozen-json.ts';
 /**
  * A cookie is a value that is used to determine the order of snapshots. It
  * needs to be comparable. This can be a `string`, `number` or if you want to

package/out/replicache/src/dag/chunk.d.ts

@@ -1,4 +1,4 @@
-import type { Hash } from '../hash.js';
+import type { Hash } from '../hash.ts';
 declare const refsTag: unique symbol;
 /**
  * Opaque type representing a Refs. The reason to use an opaque type here is to

package/out/replicache/src/dag/gc.d.ts

@@ -1,5 +1,5 @@
-import type { MaybePromise } from '../../../shared/src/types.js';
-import { type Hash } from '../hash.js';
+import type { MaybePromise } from '../../../shared/src/types.ts';
+import { type Hash } from '../hash.ts';
 export type HeadChange = {
     new: Hash | undefined;
     old: Hash | undefined;

package/out/replicache/src/dag/key.d.ts

@@ -1,5 +1,5 @@
-import { type Hash } from '../hash.js';
-import * as KeyType from './key-type-enum.js';
+import { type Hash } from '../hash.ts';
+import * as KeyType from './key-type-enum.ts';
 export declare function chunkDataKey(hash: Hash): string;
 export declare function chunkMetaKey(hash: Hash): string;
 export declare function chunkRefCountKey(hash: Hash): string;

package/out/replicache/src/dag/lazy-store.d.ts

@@ -1,8 +1,8 @@
-import type { MaybePromise } from '../../../shared/src/types.js';
-import type { Hash } from '../hash.js';
-import { Chunk, type ChunkHasher, type Refs } from './chunk.js';
-import { type HeadChange, type RefCountUpdatesDelegate } from './gc.js';
-import { type Read, type Store, type Write } from './store.js';
+import type { MaybePromise } from '../../../shared/src/types.ts';
+import type { Hash } from '../hash.ts';
+import { Chunk, type ChunkHasher, type Refs } from './chunk.ts';
+import { type HeadChange, type RefCountUpdatesDelegate } from './gc.ts';
+import { type Read, type Store, type Write } from './store.ts';
 /**
  * Dag Store which lazily loads values from a source store and then caches
  * them in an LRU cache.  The memory cache for chunks from the source store

package/out/replicache/src/dag/store-impl.d.ts

@@ -1,8 +1,8 @@
-import { type Hash } from '../hash.js';
-import type { Read as KVRead, Store as KVStore, Write as KVWrite } from '../kv/store.js';
-import { Chunk, type ChunkHasher, type Refs } from './chunk.js';
-import { type RefCountUpdatesDelegate } from './gc.js';
-import { type Read, type Store, type Write } from './store.js';
+import { type Hash } from '../hash.ts';
+import type { Read as KVRead, Store as KVStore, Write as KVWrite } from '../kv/store.ts';
+import { Chunk, type ChunkHasher, type Refs } from './chunk.ts';
+import { type RefCountUpdatesDelegate } from './gc.ts';
+import { type Read, type Store, type Write } from './store.ts';
 export declare class StoreImpl implements Store {
     #private;
     constructor(kv: KVStore, chunkHasher: ChunkHasher, assertValidHash: (hash: Hash) => void);

package/out/replicache/src/dag/store.d.ts

@@ -1,6 +1,6 @@
-import type { Hash } from '../hash.js';
-import type { Release } from '../with-transactions.js';
-import type { Chunk, Refs } from './chunk.js';
+import type { Hash } from '../hash.ts';
+import type { Release } from '../with-transactions.ts';
+import type { Chunk, Refs } from './chunk.ts';
 export interface Store {
     read(): Promise<Read>;
     write(): Promise<Write>;

package/out/replicache/src/dag/visitor.d.ts

@@ -1,6 +1,6 @@
-import type { Hash } from '../hash.js';
-import type { Chunk } from './chunk.js';
-import type { MustGetChunk } from './store.js';
+import type { Hash } from '../hash.ts';
+import type { Chunk } from './chunk.ts';
+import type { MustGetChunk } from './store.ts';
 /**
  * A visitor walks the DAG starting at a given root and visits each chunk.
  */

package/out/replicache/src/db/commit.d.ts

@@ -1,11 +1,11 @@
-import { type FrozenCookie } from '../cookies.js';
-import { type Chunk, type CreateChunk, type Refs } from '../dag/chunk.js';
-import { type MustGetChunk, type Read } from '../dag/store.js';
-import { type FrozenJSONValue, type FrozenTag } from '../frozen-json.js';
-import { type Hash } from '../hash.js';
-import type { IndexDefinition } from '../index-defs.js';
-import type { ClientID } from '../sync/ids.js';
-import * as MetaType from './meta-type-enum.js';
+import { type FrozenCookie } from '../cookies.ts';
+import { type Chunk, type CreateChunk, type Refs } from '../dag/chunk.ts';
+import { type MustGetChunk, type Read } from '../dag/store.ts';
+import { type FrozenJSONValue, type FrozenTag } from '../frozen-json.ts';
+import { type Hash } from '../hash.ts';
+import type { IndexDefinition } from '../index-defs.ts';
+import type { ClientID } from '../sync/ids.ts';
+import * as MetaType from './meta-type-enum.ts';
 export declare const DEFAULT_HEAD_NAME = "main";
 export declare function commitIsLocalDD31(commit: Commit<Meta>): commit is Commit<LocalMetaDD31>;
 export declare function commitIsLocal(commit: Commit<Meta>): commit is Commit<LocalMetaDD31>;

package/out/replicache/src/db/index.d.ts

@@ -1,11 +1,11 @@
 import type { LogContext } from '@rocicorp/logger';
-import type { Enum } from '../../../shared/src/enum.js';
-import type { BTreeRead } from '../btree/read.js';
-import type { BTreeWrite } from '../btree/write.js';
-import type { FrozenJSONValue } from '../frozen-json.js';
-import type { Hash } from '../hash.js';
-import type { IndexRecord } from './commit.js';
-import * as IndexOperation from './index-operation-enum.js';
+import type { Enum } from '../../../shared/src/enum.ts';
+import type { BTreeRead } from '../btree/read.ts';
+import type { BTreeWrite } from '../btree/write.ts';
+import type { FrozenJSONValue } from '../frozen-json.ts';
+import type { Hash } from '../hash.ts';
+import type { IndexRecord } from './commit.ts';
+import * as IndexOperation from './index-operation-enum.ts';
 type IndexOperation = Enum<typeof IndexOperation>;
 export declare class IndexRead<BTree = BTreeRead> {
     readonly meta: IndexRecord;

package/out/replicache/src/db/read.d.ts

@@ -1,11 +1,11 @@
-import type { Enum } from '../../../shared/src/enum.js';
-import { BTreeRead } from '../btree/read.js';
-import type { Read as DagRead } from '../dag/store.js';
-import * as FormatVersion from '../format-version-enum.js';
-import type { FrozenJSONValue } from '../frozen-json.js';
-import type { Hash } from '../hash.js';
-import { Commit, type Meta } from './commit.js';
-import { IndexRead } from './index.js';
+import type { Enum } from '../../../shared/src/enum.ts';
+import { BTreeRead } from '../btree/read.ts';
+import type { Read as DagRead } from '../dag/store.ts';
+import * as FormatVersion from '../format-version-enum.ts';
+import type { FrozenJSONValue } from '../frozen-json.ts';
+import type { Hash } from '../hash.ts';
+import { Commit, type Meta } from './commit.ts';
+import { IndexRead } from './index.ts';
 type FormatVersion = Enum<typeof FormatVersion>;
 export declare class Read {
     #private;

package/out/replicache/src/db/rebase.d.ts

@@ -1,11 +1,11 @@
 import type { LogContext } from '@rocicorp/logger';
-import type { Enum } from '../../../shared/src/enum.js';
-import type { Write as DagWrite } from '../dag/store.js';
-import * as FormatVersion from '../format-version-enum.js';
-import type { Hash } from '../hash.js';
-import type { ClientID } from '../sync/ids.js';
-import type { MutatorDefs } from '../types.js';
-import { Commit, type LocalMeta, type Meta } from './commit.js';
+import type { Enum } from '../../../shared/src/enum.ts';
+import type { Write as DagWrite } from '../dag/store.ts';
+import * as FormatVersion from '../format-version-enum.ts';
+import type { Hash } from '../hash.ts';
+import type { ClientID } from '../sync/ids.ts';
+import type { MutatorDefs } from '../types.ts';
+import { Commit, type LocalMeta, type Meta } from './commit.ts';
 type FormatVersion = Enum<typeof FormatVersion>;
 export declare function rebaseMutationAndPutCommit(mutation: Commit<LocalMeta>, dagWrite: DagWrite, basis: Hash, mutators: MutatorDefs, lc: LogContext, mutationClientID: ClientID, formatVersion: FormatVersion): Promise<Commit<Meta>>;
 export declare function rebaseMutationAndCommit(mutation: Commit<LocalMeta>, dagWrite: DagWrite, basis: Hash, headName: string, mutators: MutatorDefs, lc: LogContext, mutationClientID: ClientID, formatVersion: FormatVersion): Promise<Hash>;

package/out/replicache/src/db/scan.d.ts

@@ -1,4 +1,4 @@
-import type { ReadonlyJSONValue } from '../../../shared/src/json.js';
+import type { ReadonlyJSONValue } from '../../../shared/src/json.ts';
 export type ScanOptions = {
     prefix?: string | undefined;
     startSecondaryKey?: string | undefined;

package/out/replicache/src/db/write.d.ts

@@ -1,18 +1,18 @@
 import type { LogContext } from '@rocicorp/logger';
-import type { Enum } from '../../../shared/src/enum.js';
-import { BTreeRead } from '../btree/read.js';
-import { BTreeWrite } from '../btree/write.js';
-import type { FrozenCookie } from '../cookies.js';
-import type { Write as DagWrite } from '../dag/store.js';
-import * as FormatVersion from '../format-version-enum.js';
-import type { FrozenJSONValue } from '../frozen-json.js';
-import { type Hash } from '../hash.js';
-import type { DiffComputationConfig } from '../sync/diff.js';
-import { DiffsMap } from '../sync/diff.js';
-import type { ClientID } from '../sync/ids.js';
-import { Commit, type Meta as CommitMeta } from './commit.js';
-import { IndexWrite } from './index.js';
-import { Read } from './read.js';
+import type { Enum } from '../../../shared/src/enum.ts';
+import { BTreeRead } from '../btree/read.ts';
+import { BTreeWrite } from '../btree/write.ts';
+import type { FrozenCookie } from '../cookies.ts';
+import type { Write as DagWrite } from '../dag/store.ts';
+import * as FormatVersion from '../format-version-enum.ts';
+import type { FrozenJSONValue } from '../frozen-json.ts';
+import { type Hash } from '../hash.ts';
+import type { DiffComputationConfig } from '../sync/diff.ts';
+import { DiffsMap } from '../sync/diff.ts';
+import type { ClientID } from '../sync/ids.ts';
+import { Commit, type Meta as CommitMeta } from './commit.ts';
+import { IndexWrite } from './index.ts';
+import { Read } from './read.ts';
 type FormatVersion = Enum<typeof FormatVersion>;
 export declare class Write extends Read {
     #private;

package/out/replicache/src/filter-async-iterable.d.ts

@@ -1,4 +1,4 @@
-import type { IterableUnion } from './iterable-union.js';
+import type { IterableUnion } from './iterable-union.ts';
 /**
  * Filters an async iterable.
  *

package/out/replicache/src/format-version.d.ts

@@ -1,5 +1,5 @@
-import type { Enum } from '../../shared/src/enum.js';
-import * as FormatVersion from './format-version-enum.js';
+import type { Enum } from '../../shared/src/enum.ts';
+import * as FormatVersion from './format-version-enum.ts';
 type FormatVersion = Enum<typeof FormatVersion>;
 export declare function parseReplicacheFormatVersion(v: number): FormatVersion;
 export {};

package/out/replicache/src/frozen-json.d.ts

@@ -1,5 +1,5 @@
-import type { ReadonlyJSONValue } from '../../shared/src/json.js';
-import type { Cookie, FrozenCookie } from './cookies.js';
+import type { ReadonlyJSONValue } from '../../shared/src/json.ts';
+import type { Cookie, FrozenCookie } from './cookies.ts';
 declare const frozenJSONTag: unique symbol;
 /**
  * Used to mark a type as having been frozen.

package/out/replicache/src/get-default-puller.d.ts

@@ -1,4 +1,4 @@
-import type { PullResponseV1, Puller, PullerResultV1 } from './puller.js';
+import type { PullResponseV1, Puller, PullerResultV1 } from './puller.ts';
 /**
  * This creates a default puller which uses HTTP POST to send the pull request.
  */

package/out/replicache/src/get-default-pusher.d.ts

@@ -1,4 +1,4 @@
-import type { Pusher } from './pusher.js';
+import type { Pusher } from './pusher.ts';
 /**
  * This creates a default pusher which uses HTTP POST to send the push request.
  */

package/out/replicache/src/hash.d.ts

@@ -1,4 +1,4 @@
-import * as valita from '../../shared/src/valita.js';
+import * as valita from '../../shared/src/valita.ts';
 export declare const STRING_LENGTH = 22;
 declare const hashTag: unique symbol;
 /**

package/out/replicache/src/impl.d.ts

@@ -1,4 +1,4 @@
-export type { PatchOperationInternal } from './patch-operation.js';
-export { ReplicacheImpl, type ReplicacheImplOptions } from './replicache-impl.js';
-export type { PokeInternal } from './types.js';
+export type { PatchOperationInternal } from './patch-operation.ts';
+export { ReplicacheImpl, type ReplicacheImplOptions } from './replicache-impl.ts';
+export type { PokeInternal } from './types.ts';
 //# sourceMappingURL=impl.d.ts.map

package/out/replicache/src/index-defs.d.ts

@@ -1,4 +1,4 @@
-import * as valita from '../../shared/src/valita.js';
+import * as valita from '../../shared/src/valita.ts';
 /**
  * The definition of a single index.
  */

package/out/replicache/src/kv/idb-store-with-mem-fallback.d.ts

@@ -1,5 +1,5 @@
 import type { LogContext } from '@rocicorp/logger';
-import type { Read, Store, Write } from './store.js';
+import type { Read, Store, Write } from './store.ts';
 /**
  * This store uses an {@link IDBStore} by default. If the {@link IDBStore} fails
  * to open the DB with an exception that matches

package/out/replicache/src/kv/idb-store.d.ts

@@ -1,4 +1,4 @@
-import type { Read, Store, Write } from './store.js';
+import type { Read, Store, Write } from './store.ts';
 export declare class IDBStore implements Store {
     #private;
     constructor(name: string);

package/out/replicache/src/kv/idb-store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"idb-store.d.ts","sourceRoot":"","sources":["../../../../../replicache/src/kv/idb-store.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAC,MAAM,YAAY,CAAC;AAOnD,qBAAa,QAAS,YAAW,KAAK;;gBAKxB,IAAI,EAAE,MAAM;IAIxB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAIrB,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC;IAIjB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAQ5B,IAAI,MAAM,IAAI,OAAO,CAEpB;CAwDF;AA0GD;;;;GAIG;AACH,qBAAa,gBAAiB,SAAQ,KAAK;IACzC,IAAI,SAAsB;CAC3B"}
+{"version":3,"file":"idb-store.d.ts","sourceRoot":"","sources":["../../../../../replicache/src/kv/idb-store.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAC,MAAM,YAAY,CAAC;AAMnD,qBAAa,QAAS,YAAW,KAAK;;gBAKxB,IAAI,EAAE,MAAM;IAIxB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAIrB,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC;IAIjB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAQ5B,IAAI,MAAM,IAAI,OAAO,CAEpB;CAwDF;AA0GD;;;;GAIG;AACH,qBAAa,gBAAiB,SAAQ,KAAK;IACzC,IAAI,SAAsB;CAC3B"}

package/out/replicache/src/kv/mem-store.d.ts

@@ -1,4 +1,4 @@
-import type { Read, Store, Write } from './store.js';
+import type { Read, Store, Write } from './store.ts';
 export declare function clearAllNamedMemStoresForTesting(): void;
 export declare function dropMemStore(name: string): Promise<void>;
 export declare function hasMemStore(name: string): boolean;

package/out/replicache/src/kv/read-impl.d.ts

@@ -1,5 +1,5 @@
-import type { FrozenJSONValue } from '../frozen-json.js';
-import type { Read } from './store.js';
+import type { FrozenJSONValue } from '../frozen-json.ts';
+import type { Read } from './store.ts';
 export declare class ReadImpl implements Read {
     #private;
     constructor(map: Map<string, FrozenJSONValue>, release: () => void);

package/out/replicache/src/kv/store.d.ts

@@ -1,4 +1,4 @@
-import type { ReadonlyJSONValue } from '../../../shared/src/json.js';
+import type { ReadonlyJSONValue } from '../../../shared/src/json.ts';
 /**
  * Store defines a transactional key/value store that Replicache stores all data
  * within.