@rocicorp/zero 0.26.1 → 0.26.2-canary.1

package/out/replicache/src/subscriptions.js.map

@@ -1 +1 @@
-{"version":3,"file":"subscriptions.js","sources":["../../../../replicache/src/subscriptions.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {compareUTF8, greaterThan, lessThan, lessThanEq} from 'compare-utf8';\nimport {assert} from '../../shared/src/asserts.ts';\nimport {binarySearch} from '../../shared/src/binary-search.ts';\nimport type {Enum} from '../../shared/src/enum.ts';\nimport {deepEqual} from '../../shared/src/json.ts';\nimport type {\n  Diff,\n  DiffOperation,\n  IndexDiff,\n  InternalDiff,\n  InternalDiffOperation,\n  NoIndexDiff,\n} from './btree/node.ts';\nimport type {IndexKey} from './db/index.ts';\nimport {decodeIndexKey} from './db/index.ts';\nimport type {ScanOptions} from './db/scan.ts';\nimport * as InvokeKind from './invoke-kind-enum.ts';\nimport type {DiffComputationConfig, DiffsMap} from './sync/diff.ts';\nimport {\n  type ReadTransaction,\n  SubscriptionTransactionWrapper,\n} from './transactions.ts';\nimport type {QueryInternal} from './types.ts';\n\ntype InvokeKind = Enum<typeof InvokeKind>;\n\nexport interface Subscription<R> {\n  hasIndexSubscription(indexName: string): boolean;\n\n  invoke(\n    tx: ReadTransaction,\n    kind: InvokeKind,\n    diffs: DiffsMap | undefined,\n  ): Promise<R>;\n\n  matches(diffs: DiffsMap): boolean;\n\n  updateDeps(\n    keys: ReadonlySet<string>,\n    scans: ReadonlyArray<Readonly<ScanSubscriptionInfo>>,\n  ): void;\n\n  readonly onData: (result: R) => void;\n  readonly onError: ((error: unknown) => void) | undefined;\n  readonly onDone: (() => void) | undefined;\n}\n\nconst emptySet: ReadonlySet<string> = new Set();\n\nconst unitializedLastValue = Symbol();\ntype UnitializedLastValue = typeof unitializedLastValue;\n\nexport class SubscriptionImpl<R> implements Subscription<R> {\n  readonly #body: (tx: ReadTransaction) => Promise<R>;\n  readonly #onData: (result: R) => void;\n  #lastValue: R | UnitializedLastValue = unitializedLastValue;\n  #keys = emptySet;\n  #scans: readonly Readonly<ScanSubscriptionInfo>[] = [];\n\n  readonly onError: ((error: unknown) => void) | undefined;\n  readonly onDone: (() => void) | undefined;\n  readonly #isEqual: (a: R, b: R) => boolean;\n\n  constructor(\n    body: (tx: ReadTransaction) => Promise<R>,\n    onData: (result: R) => void,\n    onError: ((error: unknown) => void) | undefined,\n    onDone: (() => void) | undefined,\n    // deepEqual operates on any JSON value but argument might be more specific.\n    isEqual: (a: R, b: R) => boolean = deepEqual as (a: R, b: R) => boolean,\n  ) {\n    this.#body = body;\n    this.#onData = onData;\n    this.onError = onError;\n    this.onDone = onDone;\n    this.#isEqual = isEqual;\n  }\n\n  hasIndexSubscription(indexName: string): boolean {\n    for (const scan of this.#scans) {\n      if (scan.options.indexName === indexName) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  invoke(\n    tx: ReadTransaction,\n    _kind: InvokeKind,\n    _diffs: DiffsMap | undefined,\n  ): Promise<R> {\n    return this.#body(tx);\n  }\n\n  matches(diffs: DiffsMap): boolean {\n    for (const [indexName, diff] of diffs) {\n      if (diffMatchesSubscription(this.#keys, this.#scans, indexName, diff)) {\n        return true;\n      }\n    }\n\n    return false;\n  }\n\n  updateDeps(\n    keys: ReadonlySet<string>,\n    scans: readonly Readonly<ScanSubscriptionInfo>[],\n  ): void {\n    this.#keys = keys;\n    this.#scans = scans;\n  }\n\n  onData(result: R): void {\n    if (\n      this.#lastValue === unitializedLastValue ||\n      !this.#isEqual(this.#lastValue, result)\n    ) {\n      this.#lastValue = result;\n      this.#onData(result);\n    }\n  }\n}\n\nexport {SubscriptionImpl as SubscriptionImplForTesting};\n\n/**\n * Function that gets passed into {@link Replicache.experimentalWatch} and gets\n * called when the data in Replicache changes.\n *\n * @experimental This type is experimental and may change in the future.\n */\nexport type WatchNoIndexCallback = (diff: NoIndexDiff) => void;\n\nexport type WatchCallbackForOptions<Options extends WatchOptions> =\n  Options extends WatchIndexOptions ? WatchIndexCallback : WatchNoIndexCallback;\n\n/**\n * Function that gets passed into {@link Replicache.experimentalWatch} when doing a\n * watch on a secondary index map and gets called when the data in Replicache\n * changes.\n *\n * @experimental This type is experimental and may change in the future.\n */\nexport type WatchIndexCallback = (diff: IndexDiff) => void;\n\n/**\n * Options for {@link Replicache.experimentalWatch}.\n *\n * @experimental This interface is experimental and may change in the future.\n */\nexport type WatchOptions = WatchIndexOptions | WatchNoIndexOptions;\n\n/**\n * Options object passed to {@link Replicache.experimentalWatch}. This is for an\n * index watch.\n */\nexport type WatchIndexOptions = WatchNoIndexOptions & {\n  /**\n   * When provided, the `watch` is limited to the changes that apply to the index map.\n   */\n  indexName: string;\n};\n\n/**\n * Options object passed to {@link Replicache.experimentalWatch}. This is for a non\n * index watch.\n */\nexport type WatchNoIndexOptions = {\n  /**\n   * When provided, the `watch` is limited to changes where the `key` starts\n   * with `prefix`.\n   */\n  prefix?: string | undefined;\n\n  /**\n   * When this is set to `true` (default is `false`), the `watch` callback will\n   * be called once asynchronously when watch is called. The arguments in that\n   * case is a diff where we consider all the existing values in Replicache as\n   * being added.\n   */\n  initialValuesInFirstDiff?: boolean | undefined;\n};\n\nexport type WatchCallback = (diff: Diff) => void;\n\nexport class WatchSubscription implements Subscription<Diff | undefined> {\n  readonly #callback: WatchCallback;\n  readonly #prefix: string;\n  readonly #indexName: string | undefined;\n  readonly #initialValuesInFirstDiff: boolean;\n\n  readonly onError: ((error: unknown) => void) | undefined = undefined;\n  readonly onDone: (() => void) | undefined = undefined;\n\n  constructor(callback: WatchCallback, options?: WatchOptions) {\n    this.#callback = callback;\n    this.#prefix = options?.prefix ?? '';\n    this.#indexName = (options as WatchIndexOptions)?.indexName;\n    this.#initialValuesInFirstDiff = options?.initialValuesInFirstDiff ?? false;\n  }\n\n  hasIndexSubscription(indexName: string): boolean {\n    return this.#indexName === indexName;\n  }\n\n  onData(result: Diff | undefined): void {\n    if (result !== undefined) {\n      this.#callback(result);\n    }\n  }\n\n  invoke(\n    tx: ReadTransaction,\n    kind: InvokeKind,\n    diffs: DiffsMap | undefined,\n  ): Promise<Diff | undefined> {\n    const invoke = async <Key extends IndexKey | string>(\n      indexName: string | undefined,\n      prefix: string,\n      compareKey: (diff: DiffOperation<Key>) => string,\n      convertInternalDiff: (\n        diff: InternalDiff,\n      ) => readonly DiffOperation<Key>[],\n    ): Promise<readonly DiffOperation<Key>[] | undefined> => {\n      let diff: readonly DiffOperation<Key>[];\n      if (kind === InvokeKind.InitialRun) {\n        if (!this.#initialValuesInFirstDiff) {\n          // We are using `undefined` here as a sentinel value to indicate that we\n          // should not call the callback in `onDone`.\n          return undefined;\n        }\n\n        // For the initial run, we need to get the \"diffs\" for the whole tree.\n        assert(\n          diffs === undefined,\n          'Expected diffs to be undefined on initial run',\n        );\n\n        const newDiff: DiffOperation<Key>[] = [];\n        for await (const entry of tx.scan({prefix, indexName}).entries()) {\n          newDiff.push({\n            op: 'add',\n            key: entry[0] as Key,\n            newValue: entry[1],\n          });\n        }\n        diff = newDiff;\n      } else {\n        assert(diffs, 'Expected diffs to be defined for non-initial run');\n        const maybeDiff = diffs.get(indexName ?? '') ?? [];\n        diff = convertInternalDiff(maybeDiff);\n      }\n      const newDiff: DiffOperation<Key>[] = [];\n      const {length} = diff;\n      for (\n        let i = diffBinarySearch(diff, prefix, compareKey);\n        i < length;\n        i++\n      ) {\n        if (compareKey(diff[i]).startsWith(prefix)) {\n          newDiff.push(diff[i]);\n        } else {\n          break;\n        }\n      }\n\n      // For initial run we should always return something.\n      return kind === InvokeKind.InitialRun || newDiff.length > 0\n        ? newDiff\n        : undefined;\n    };\n\n    if (this.#indexName) {\n      return invoke<IndexKey>(\n        this.#indexName,\n        this.#prefix,\n        diff => diff.key[0],\n        internalDiff => convertDiffValues(internalDiff, decodeIndexKey),\n      );\n    }\n\n    return invoke<string>(\n      undefined,\n      this.#prefix,\n      diff => diff.key,\n      internalDiff => convertDiffValues(internalDiff, k => k),\n    );\n  }\n\n  matches(diffs: DiffsMap): boolean {\n    const diff = diffs.get(this.#indexName ?? '');\n    if (diff === undefined) {\n      return false;\n    }\n\n    return watcherMatchesDiff(diff, this.#prefix, this.#indexName);\n  }\n\n  updateDeps(\n    _keys: ReadonlySet<string>,\n    _scans: readonly Readonly<ScanSubscriptionInfo>[],\n  ): void {\n    // not used\n  }\n}\n\nfunction convertDiffValues<Key>(\n  diff: InternalDiff,\n  convertKey: (k: string) => Key,\n): DiffOperation<Key>[] {\n  return diff.map(op => {\n    const key = convertKey(op.key);\n    switch (op.op) {\n      case 'add':\n        return {\n          op: 'add',\n          key,\n          newValue: op.newValue,\n        };\n      case 'change':\n        return {\n          op: 'change',\n          key,\n          oldValue: op.oldValue,\n          newValue: op.newValue,\n        };\n      case 'del':\n        return {\n          op: 'del',\n          key,\n          oldValue: op.oldValue,\n        };\n    }\n  });\n}\n\n/**\n * The options passed to {@link Replicache.subscribe}.\n */\nexport interface SubscribeOptions<R> {\n  /**\n   * Called when the return value of the body function changes.\n   */\n  onData: (result: R) => void;\n\n  /**\n   * If present, called when an error occurs.\n   */\n  onError?: ((error: unknown) => void) | undefined;\n\n  /**\n   * If present, called when the subscription is removed/done.\n   */\n  onDone?: (() => void) | undefined;\n\n  /**\n   * If present this function is used to determine if the value returned by the\n   * body function has changed. If not provided a JSON deep equality check is\n   * used.\n   */\n  isEqual?: ((a: R, b: R) => boolean) | undefined;\n}\n\nexport type UnknownSubscription = Subscription<unknown>;\n\ntype SubscriptionSet = Set<UnknownSubscription>;\n\nexport interface SubscriptionsManager extends DiffComputationConfig {\n  clear(): void;\n  fire(diffs: DiffsMap): Promise<void>;\n  hasPendingSubscriptionRuns: boolean;\n  add<R>(subscription: Subscription<R>): () => void;\n}\n\nexport class SubscriptionsManagerImpl implements SubscriptionsManager {\n  readonly #subscriptions: SubscriptionSet = new Set();\n  readonly #pendingSubscriptions: SubscriptionSet = new Set();\n  readonly #queryInternal: QueryInternal;\n  readonly #lc: LogContext;\n  hasPendingSubscriptionRuns = false;\n  readonly #signal: AbortSignal;\n\n  constructor(\n    queryInternal: QueryInternal,\n    lc: LogContext,\n    signal: AbortSignal,\n  ) {\n    this.#queryInternal = queryInternal;\n    this.#lc = lc;\n    this.#signal = signal;\n  }\n\n  add<R>(subscription: Subscription<R>): () => void {\n    this.#subscriptions.add(subscription as UnknownSubscription);\n    void this.#scheduleInitialSubscriptionRun(\n      subscription as UnknownSubscription,\n    );\n    return () =>\n      this.#subscriptions.delete(subscription as UnknownSubscription);\n  }\n\n  clear(): void {\n    for (const subscription of this.#subscriptions) {\n      subscription.onDone?.();\n    }\n    this.#subscriptions.clear();\n  }\n\n  fire(diffs: DiffsMap): Promise<void> {\n    const subscriptions = subscriptionsForDiffs(this.#subscriptions, diffs);\n    return this.#fireSubscriptions(subscriptions, InvokeKind.Regular, diffs);\n  }\n\n  async #fireSubscriptions(\n    subscriptions: Iterable<UnknownSubscription>,\n    kind: InvokeKind,\n    diffs: DiffsMap | undefined,\n  ) {\n    if (this.#signal.aborted) {\n      return;\n    }\n\n    const subs = [...subscriptions] as readonly Subscription<unknown>[];\n    if (subs.length === 0) {\n      return;\n    }\n\n    // Use allSettled to gather fulfilled and rejected promises.\n    const results = await this.#queryInternal(tx =>\n      Promise.allSettled(\n        subs.map(async s => {\n          const stx = new SubscriptionTransactionWrapper(tx);\n          try {\n            return await s.invoke(stx, kind, diffs);\n          } finally {\n            // We need to keep track of the subscription keys even if there was an\n            // exception because changes to the keys can make the subscription\n            // body succeed.\n            s.updateDeps(stx.keys, stx.scans);\n          }\n        }),\n      ),\n    );\n\n    this.callCallbacks(subs, results);\n  }\n\n  // Public method so that ZQL can wrap it in a transaction.\n  callCallbacks(\n    subs: readonly Subscription<unknown>[],\n    results: PromiseSettledResult<unknown>[],\n  ) {\n    for (let i = 0; i < subs.length; i++) {\n      const s = subs[i];\n      const result = results[i];\n      if (result.status === 'fulfilled') {\n        s.onData(result.value);\n      } else {\n        if (s.onError) {\n          s.onError(result.reason);\n        } else {\n          this.#lc.error?.('Error in subscription body:', result.reason);\n        }\n      }\n    }\n  }\n\n  async #scheduleInitialSubscriptionRun(s: UnknownSubscription) {\n    this.#pendingSubscriptions.add(s);\n\n    if (!this.hasPendingSubscriptionRuns) {\n      this.hasPendingSubscriptionRuns = true;\n      await Promise.resolve();\n      this.hasPendingSubscriptionRuns = false;\n      const subscriptions = [...this.#pendingSubscriptions];\n      this.#pendingSubscriptions.clear();\n      await this.#fireSubscriptions(\n        subscriptions,\n        InvokeKind.InitialRun,\n        undefined,\n      );\n    }\n  }\n\n  shouldComputeDiffs(): boolean {\n    return this.#subscriptions.size > 0;\n  }\n\n  shouldComputeDiffsForIndex(indexName: string): boolean {\n    for (const s of this.#subscriptions) {\n      if (s.hasIndexSubscription(indexName)) {\n        return true;\n      }\n    }\n    return false;\n  }\n}\n\nexport type ScanSubscriptionInfo = {\n  options: ScanOptions;\n  inclusiveLimitKey?: string | undefined;\n};\n\nfunction diffMatchesSubscription(\n  keys: ReadonlySet<string>,\n  scans: Iterable<Readonly<ScanSubscriptionInfo>>,\n  indexName: string,\n  diff: InternalDiff,\n): boolean {\n  // Keys can only match for non index scans.\n  if (indexName === '') {\n    for (const diffEntry of diff) {\n      if (keys.has(diffEntry.key)) {\n        return true;\n      }\n    }\n  }\n\n  for (const scanInfo of scans) {\n    if (scanInfoMatchesDiff(scanInfo, indexName, diff)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nfunction scanInfoMatchesDiff(\n  scanInfo: ScanSubscriptionInfo,\n  changeIndexName: string,\n  diff: InternalDiff,\n): boolean {\n  // TODO(arv): Use binary search\n  for (const diffEntry of diff) {\n    if (scanInfoMatchesKey(scanInfo, changeIndexName, diffEntry.key)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\nexport function scanInfoMatchesKey(\n  scanInfo: ScanSubscriptionInfo,\n  changeIndexName: string,\n  changedKey: string,\n): boolean {\n  const {\n    indexName = '',\n    limit,\n    prefix,\n    startKey,\n    startExclusive,\n    startSecondaryKey,\n  } = scanInfo.options;\n\n  if (changeIndexName !== indexName) {\n    return false;\n  }\n\n  if (!indexName) {\n    // A scan with limit <= 0 can have no matches\n    if (limit !== undefined && limit <= 0) {\n      return false;\n    }\n\n    // No prefix and no start. Must recompute the subscription because all keys\n    // will have an effect on the subscription.\n    if (!prefix && !startKey) {\n      return true;\n    }\n\n    if (\n      prefix &&\n      (!changedKey.startsWith(prefix) ||\n        isKeyPastInclusiveLimit(scanInfo, changedKey))\n    ) {\n      return false;\n    }\n\n    if (\n      startKey &&\n      ((startExclusive && lessThanEq(changedKey, startKey)) ||\n        lessThan(changedKey, startKey) ||\n        isKeyPastInclusiveLimit(scanInfo, changedKey))\n    ) {\n      return false;\n    }\n\n    return true;\n  }\n\n  // No prefix and no start. Must recompute the subscription because all keys\n  // will have an effect on the subscription.\n  if (!prefix && !startKey && !startSecondaryKey) {\n    return true;\n  }\n\n  const [changedKeySecondary, changedKeyPrimary] = decodeIndexKey(changedKey);\n\n  if (prefix) {\n    if (!changedKeySecondary.startsWith(prefix)) {\n      return false;\n    }\n  }\n\n  if (\n    startSecondaryKey &&\n    ((startExclusive && lessThanEq(changedKeySecondary, startSecondaryKey)) ||\n      lessThan(changedKeySecondary, startSecondaryKey))\n  ) {\n    return false;\n  }\n\n  if (\n    startKey &&\n    ((startExclusive && lessThanEq(changedKeyPrimary, startKey)) ||\n      lessThan(changedKeyPrimary, startKey))\n  ) {\n    return false;\n  }\n\n  return true;\n}\n\nfunction isKeyPastInclusiveLimit(\n  scanInfo: ScanSubscriptionInfo,\n  changedKey: string,\n): boolean {\n  const {inclusiveLimitKey} = scanInfo;\n  return (\n    scanInfo.options.limit !== undefined &&\n    inclusiveLimitKey !== undefined &&\n    greaterThan(changedKey, inclusiveLimitKey)\n  );\n}\n\nfunction* subscriptionsForDiffs<V>(\n  subscriptions: Set<Subscription<V>>,\n  diffs: DiffsMap,\n): Generator<Subscription<V>> {\n  for (const subscription of subscriptions) {\n    if (subscription.matches(diffs)) {\n      yield subscription;\n    }\n  }\n}\n\nfunction watcherMatchesDiff(\n  diff: InternalDiff,\n  prefix: string,\n  indexName: string | undefined,\n): boolean {\n  if (prefix === '') {\n    return true;\n  }\n\n  const compareKey = indexName\n    ? (diffOp: InternalDiffOperation) => decodeIndexKey(diffOp.key)[0]\n    : (diffOp: InternalDiffOperation) => diffOp.key;\n  const i = diffBinarySearch(diff, prefix, compareKey);\n  return i < diff.length && compareKey(diff[i]).startsWith(prefix);\n}\n\nexport function diffBinarySearch<Key, Value>(\n  diff: readonly InternalDiffOperation<Key, Value>[],\n  prefix: string,\n  compareKey: (diff: InternalDiffOperation<Key, Value>) => string,\n): number {\n  return binarySearch(diff.length, i =>\n    compareUTF8(prefix, compareKey(diff[i])),\n  );\n}\n"],"names":["InvokeKind.InitialRun","newDiff","InvokeKind.Regular"],"mappings":";;;;;;;AAgDA,MAAM,+BAAoC,IAAA;AAE1C,MAAM,uBAAuB,OAAA;AAGtB,MAAM,iBAA+C;AAAA,EACjD;AAAA,EACA;AAAA,EACT,aAAuC;AAAA,EACvC,QAAQ;AAAA,EACR,SAAoD,CAAA;AAAA,EAE3C;AAAA,EACA;AAAA,EACA;AAAA,EAET,YACE,MACA,QACA,SACA,QAEA,UAAmC,WACnC;AACA,SAAK,QAAQ;AACb,SAAK,UAAU;AACf,SAAK,UAAU;AACf,SAAK,SAAS;AACd,SAAK,WAAW;AAAA,EAClB;AAAA,EAEA,qBAAqB,WAA4B;AAC/C,eAAW,QAAQ,KAAK,QAAQ;AAC9B,UAAI,KAAK,QAAQ,cAAc,WAAW;AACxC,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,OACE,IACA,OACA,QACY;AACZ,WAAO,KAAK,MAAM,EAAE;AAAA,EACtB;AAAA,EAEA,QAAQ,OAA0B;AAChC,eAAW,CAAC,WAAW,IAAI,KAAK,OAAO;AACrC,UAAI,wBAAwB,KAAK,OAAO,KAAK,QAAQ,WAAW,IAAI,GAAG;AACrE,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,WACE,MACA,OACM;AACN,SAAK,QAAQ;AACb,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,OAAO,QAAiB;AACtB,QACE,KAAK,eAAe,wBACpB,CAAC,KAAK,SAAS,KAAK,YAAY,MAAM,GACtC;AACA,WAAK,aAAa;AAClB,WAAK,QAAQ,MAAM;AAAA,IACrB;AAAA,EACF;AACF;AAgEO,MAAM,kBAA4D;AAAA,EAC9D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA,UAAkD;AAAA,EAClD,SAAmC;AAAA,EAE5C,YAAY,UAAyB,SAAwB;AAC3D,SAAK,YAAY;AACjB,SAAK,UAAU,SAAS,UAAU;AAClC,SAAK,aAAc,SAA+B;AAClD,SAAK,4BAA4B,SAAS,4BAA4B;AAAA,EACxE;AAAA,EAEA,qBAAqB,WAA4B;AAC/C,WAAO,KAAK,eAAe;AAAA,EAC7B;AAAA,EAEA,OAAO,QAAgC;AACrC,QAAI,WAAW,QAAW;AACxB,WAAK,UAAU,MAAM;AAAA,IACvB;AAAA,EACF;AAAA,EAEA,OACE,IACA,MACA,OAC2B;AAC3B,UAAM,SAAS,OACb,WACA,QACA,YACA,wBAGuD;AACvD,UAAI;AACJ,UAAI,SAASA,YAAuB;AAClC,YAAI,CAAC,KAAK,2BAA2B;AAGnC,iBAAO;AAAA,QACT;AAGA;AAAA,UACE,UAAU;AAAA,UACV;AAAA,QAAA;AAGF,cAAMC,WAAgC,CAAA;AACtC,yBAAiB,SAAS,GAAG,KAAK,EAAC,QAAQ,UAAA,CAAU,EAAE,WAAW;AAChEA,mBAAQ,KAAK;AAAA,YACX,IAAI;AAAA,YACJ,KAAK,MAAM,CAAC;AAAA,YACZ,UAAU,MAAM,CAAC;AAAA,UAAA,CAClB;AAAA,QACH;AACA,eAAOA;AAAAA,MACT,OAAO;AACL,eAAO,OAAO,kDAAkD;AAChE,cAAM,YAAY,MAAM,IAAI,aAAa,EAAE,KAAK,CAAA;AAChD,eAAO,oBAAoB,SAAS;AAAA,MACtC;AACA,YAAM,UAAgC,CAAA;AACtC,YAAM,EAAC,WAAU;AACjB,eACM,IAAI,iBAAiB,MAAM,QAAQ,UAAU,GACjD,IAAI,QACJ,KACA;AACA,YAAI,WAAW,KAAK,CAAC,CAAC,EAAE,WAAW,MAAM,GAAG;AAC1C,kBAAQ,KAAK,KAAK,CAAC,CAAC;AAAA,QACtB,OAAO;AACL;AAAA,QACF;AAAA,MACF;AAGA,aAAO,SAASD,cAAyB,QAAQ,SAAS,IACtD,UACA;AAAA,IACN;AAEA,QAAI,KAAK,YAAY;AACnB,aAAO;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,CAAA,SAAQ,KAAK,IAAI,CAAC;AAAA,QAClB,CAAA,iBAAgB,kBAAkB,cAAc,cAAc;AAAA,MAAA;AAAA,IAElE;AAEA,WAAO;AAAA,MACL;AAAA,MACA,KAAK;AAAA,MACL,UAAQ,KAAK;AAAA,MACb,CAAA,iBAAgB,kBAAkB,cAAc,CAAA,MAAK,CAAC;AAAA,IAAA;AAAA,EAE1D;AAAA,EAEA,QAAQ,OAA0B;AAChC,UAAM,OAAO,MAAM,IAAI,KAAK,cAAc,EAAE;AAC5C,QAAI,SAAS,QAAW;AACtB,aAAO;AAAA,IACT;AAEA,WAAO,mBAAmB,MAAM,KAAK,SAAS,KAAK,UAAU;AAAA,EAC/D;AAAA,EAEA,WACE,OACA,QACM;AAAA,EAER;AACF;AAEA,SAAS,kBACP,MACA,YACsB;AACtB,SAAO,KAAK,IAAI,CAAA,OAAM;AACpB,UAAM,MAAM,WAAW,GAAG,GAAG;AAC7B,YAAQ,GAAG,IAAA;AAAA,MACT,KAAK;AACH,eAAO;AAAA,UACL,IAAI;AAAA,UACJ;AAAA,UACA,UAAU,GAAG;AAAA,QAAA;AAAA,MAEjB,KAAK;AACH,eAAO;AAAA,UACL,IAAI;AAAA,UACJ;AAAA,UACA,UAAU,GAAG;AAAA,UACb,UAAU,GAAG;AAAA,QAAA;AAAA,MAEjB,KAAK;AACH,eAAO;AAAA,UACL,IAAI;AAAA,UACJ;AAAA,UACA,UAAU,GAAG;AAAA,QAAA;AAAA,IACf;AAAA,EAEN,CAAC;AACH;AAwCO,MAAM,yBAAyD;AAAA,EAC3D,qCAAsC,IAAA;AAAA,EACtC,4CAA6C,IAAA;AAAA,EAC7C;AAAA,EACA;AAAA,EACT,6BAA6B;AAAA,EACpB;AAAA,EAET,YACE,eACA,IACA,QACA;AACA,SAAK,iBAAiB;AACtB,SAAK,MAAM;AACX,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,IAAO,cAA2C;AAChD,SAAK,eAAe,IAAI,YAAmC;AAC3D,SAAK,KAAK;AAAA,MACR;AAAA,IAAA;AAEF,WAAO,MACL,KAAK,eAAe,OAAO,YAAmC;AAAA,EAClE;AAAA,EAEA,QAAc;AACZ,eAAW,gBAAgB,KAAK,gBAAgB;AAC9C,mBAAa,SAAA;AAAA,IACf;AACA,SAAK,eAAe,MAAA;AAAA,EACtB;AAAA,EAEA,KAAK,OAAgC;AACnC,UAAM,gBAAgB,sBAAsB,KAAK,gBAAgB,KAAK;AACtE,WAAO,KAAK,mBAAmB,eAAeE,SAAoB,KAAK;AAAA,EACzE;AAAA,EAEA,MAAM,mBACJ,eACA,MACA,OACA;AACA,QAAI,KAAK,QAAQ,SAAS;AACxB;AAAA,IACF;AAEA,UAAM,OAAO,CAAC,GAAG,aAAa;AAC9B,QAAI,KAAK,WAAW,GAAG;AACrB;AAAA,IACF;AAGA,UAAM,UAAU,MAAM,KAAK;AAAA,MAAe,QACxC,QAAQ;AAAA,QACN,KAAK,IAAI,OAAM,MAAK;AAClB,gBAAM,MAAM,IAAI,+BAA+B,EAAE;AACjD,cAAI;AACF,mBAAO,MAAM,EAAE,OAAO,KAAK,MAAM,KAAK;AAAA,UACxC,UAAA;AAIE,cAAE,WAAW,IAAI,MAAM,IAAI,KAAK;AAAA,UAClC;AAAA,QACF,CAAC;AAAA,MAAA;AAAA,IACH;AAGF,SAAK,cAAc,MAAM,OAAO;AAAA,EAClC;AAAA;AAAA,EAGA,cACE,MACA,SACA;AACA,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,IAAI,KAAK,CAAC;AAChB,YAAM,SAAS,QAAQ,CAAC;AACxB,UAAI,OAAO,WAAW,aAAa;AACjC,UAAE,OAAO,OAAO,KAAK;AAAA,MACvB,OAAO;AACL,YAAI,EAAE,SAAS;AACb,YAAE,QAAQ,OAAO,MAAM;AAAA,QACzB,OAAO;AACL,eAAK,IAAI,QAAQ,+BAA+B,OAAO,MAAM;AAAA,QAC/D;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,gCAAgC,GAAwB;AAC5D,SAAK,sBAAsB,IAAI,CAAC;AAEhC,QAAI,CAAC,KAAK,4BAA4B;AACpC,WAAK,6BAA6B;AAClC,YAAM,QAAQ,QAAA;AACd,WAAK,6BAA6B;AAClC,YAAM,gBAAgB,CAAC,GAAG,KAAK,qBAAqB;AACpD,WAAK,sBAAsB,MAAA;AAC3B,YAAM,KAAK;AAAA,QACT;AAAA,QACAF;AAAAA,QACA;AAAA,MAAA;AAAA,IAEJ;AAAA,EACF;AAAA,EAEA,qBAA8B;AAC5B,WAAO,KAAK,eAAe,OAAO;AAAA,EACpC;AAAA,EAEA,2BAA2B,WAA4B;AACrD,eAAW,KAAK,KAAK,gBAAgB;AACnC,UAAI,EAAE,qBAAqB,SAAS,GAAG;AACrC,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAOA,SAAS,wBACP,MACA,OACA,WACA,MACS;AAET,MAAI,cAAc,IAAI;AACpB,eAAW,aAAa,MAAM;AAC5B,UAAI,KAAK,IAAI,UAAU,GAAG,GAAG;AAC3B,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,aAAW,YAAY,OAAO;AAC5B,QAAI,oBAAoB,UAAU,WAAW,IAAI,GAAG;AAClD,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,oBACP,UACA,iBACA,MACS;AAET,aAAW,aAAa,MAAM;AAC5B,QAAI,mBAAmB,UAAU,iBAAiB,UAAU,GAAG,GAAG;AAChE,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,mBACd,UACA,iBACA,YACS;AACT,QAAM;AAAA,IACJ,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA,IACE,SAAS;AAEb,MAAI,oBAAoB,WAAW;AACjC,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,WAAW;AAEd,QAAI,UAAU,UAAa,SAAS,GAAG;AACrC,aAAO;AAAA,IACT;AAIA,QAAI,CAAC,UAAU,CAAC,UAAU;AACxB,aAAO;AAAA,IACT;AAEA,QACE,WACC,CAAC,WAAW,WAAW,MAAM,KAC5B,wBAAwB,UAAU,UAAU,IAC9C;AACA,aAAO;AAAA,IACT;AAEA,QACE,aACE,kBAAkB,WAAW,YAAY,QAAQ,KACjD,SAAS,YAAY,QAAQ,KAC7B,wBAAwB,UAAU,UAAU,IAC9C;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAIA,MAAI,CAAC,UAAU,CAAC,YAAY,CAAC,mBAAmB;AAC9C,WAAO;AAAA,EACT;AAEA,QAAM,CAAC,qBAAqB,iBAAiB,IAAI,eAAe,UAAU;AAE1E,MAAI,QAAQ;AACV,QAAI,CAAC,oBAAoB,WAAW,MAAM,GAAG;AAC3C,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MACE,sBACE,kBAAkB,WAAW,qBAAqB,iBAAiB,KACnE,SAAS,qBAAqB,iBAAiB,IACjD;AACA,WAAO;AAAA,EACT;AAEA,MACE,aACE,kBAAkB,WAAW,mBAAmB,QAAQ,KACxD,SAAS,mBAAmB,QAAQ,IACtC;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEA,SAAS,wBACP,UACA,YACS;AACT,QAAM,EAAC,sBAAqB;AAC5B,SACE,SAAS,QAAQ,UAAU,UAC3B,sBAAsB,UACtB,YAAY,YAAY,iBAAiB;AAE7C;AAEA,UAAU,sBACR,eACA,OAC4B;AAC5B,aAAW,gBAAgB,eAAe;AACxC,QAAI,aAAa,QAAQ,KAAK,GAAG;AAC/B,YAAM;AAAA,IACR;AAAA,EACF;AACF;AAEA,SAAS,mBACP,MACA,QACA,WACS;AACT,MAAI,WAAW,IAAI;AACjB,WAAO;AAAA,EACT;AAEA,QAAM,aAAa,YACf,CAAC,WAAkC,eAAe,OAAO,GAAG,EAAE,CAAC,IAC/D,CAAC,WAAkC,OAAO;AAC9C,QAAM,IAAI,iBAAiB,MAAM,QAAQ,UAAU;AACnD,SAAO,IAAI,KAAK,UAAU,WAAW,KAAK,CAAC,CAAC,EAAE,WAAW,MAAM;AACjE;AAEO,SAAS,iBACd,MACA,QACA,YACQ;AACR,SAAO;AAAA,IAAa,KAAK;AAAA,IAAQ,OAC/B,YAAY,QAAQ,WAAW,KAAK,CAAC,CAAC,CAAC;AAAA,EAAA;AAE3C;"}
+{"version":3,"file":"subscriptions.js","names":["#body","#onData","#isEqual","#scans","#keys","#lastValue","#callback","#prefix","#indexName","#initialValuesInFirstDiff","#subscriptions","#pendingSubscriptions","#queryInternal","#lc","#signal","#scheduleInitialSubscriptionRun","#fireSubscriptions"],"sources":["../../../../replicache/src/subscriptions.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {compareUTF8, greaterThan, lessThan, lessThanEq} from 'compare-utf8';\nimport {assert} from '../../shared/src/asserts.ts';\nimport {binarySearch} from '../../shared/src/binary-search.ts';\nimport type {Enum} from '../../shared/src/enum.ts';\nimport {deepEqual} from '../../shared/src/json.ts';\nimport type {\n  Diff,\n  DiffOperation,\n  IndexDiff,\n  InternalDiff,\n  InternalDiffOperation,\n  NoIndexDiff,\n} from './btree/node.ts';\nimport type {IndexKey} from './db/index.ts';\nimport {decodeIndexKey} from './db/index.ts';\nimport type {ScanOptions} from './db/scan.ts';\nimport * as InvokeKind from './invoke-kind-enum.ts';\nimport type {DiffComputationConfig, DiffsMap} from './sync/diff.ts';\nimport {\n  type ReadTransaction,\n  SubscriptionTransactionWrapper,\n} from './transactions.ts';\nimport type {QueryInternal} from './types.ts';\n\ntype InvokeKind = Enum<typeof InvokeKind>;\n\nexport interface Subscription<R> {\n  hasIndexSubscription(indexName: string): boolean;\n\n  invoke(\n    tx: ReadTransaction,\n    kind: InvokeKind,\n    diffs: DiffsMap | undefined,\n  ): Promise<R>;\n\n  matches(diffs: DiffsMap): boolean;\n\n  updateDeps(\n    keys: ReadonlySet<string>,\n    scans: ReadonlyArray<Readonly<ScanSubscriptionInfo>>,\n  ): void;\n\n  readonly onData: (result: R) => void;\n  readonly onError: ((error: unknown) => void) | undefined;\n  readonly onDone: (() => void) | undefined;\n}\n\nconst emptySet: ReadonlySet<string> = new Set();\n\nconst unitializedLastValue = Symbol();\ntype UnitializedLastValue = typeof unitializedLastValue;\n\nexport class SubscriptionImpl<R> implements Subscription<R> {\n  readonly #body: (tx: ReadTransaction) => Promise<R>;\n  readonly #onData: (result: R) => void;\n  #lastValue: R | UnitializedLastValue = unitializedLastValue;\n  #keys = emptySet;\n  #scans: readonly Readonly<ScanSubscriptionInfo>[] = [];\n\n  readonly onError: ((error: unknown) => void) | undefined;\n  readonly onDone: (() => void) | undefined;\n  readonly #isEqual: (a: R, b: R) => boolean;\n\n  constructor(\n    body: (tx: ReadTransaction) => Promise<R>,\n    onData: (result: R) => void,\n    onError: ((error: unknown) => void) | undefined,\n    onDone: (() => void) | undefined,\n    // deepEqual operates on any JSON value but argument might be more specific.\n    isEqual: (a: R, b: R) => boolean = deepEqual as (a: R, b: R) => boolean,\n  ) {\n    this.#body = body;\n    this.#onData = onData;\n    this.onError = onError;\n    this.onDone = onDone;\n    this.#isEqual = isEqual;\n  }\n\n  hasIndexSubscription(indexName: string): boolean {\n    for (const scan of this.#scans) {\n      if (scan.options.indexName === indexName) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  invoke(\n    tx: ReadTransaction,\n    _kind: InvokeKind,\n    _diffs: DiffsMap | undefined,\n  ): Promise<R> {\n    return this.#body(tx);\n  }\n\n  matches(diffs: DiffsMap): boolean {\n    for (const [indexName, diff] of diffs) {\n      if (diffMatchesSubscription(this.#keys, this.#scans, indexName, diff)) {\n        return true;\n      }\n    }\n\n    return false;\n  }\n\n  updateDeps(\n    keys: ReadonlySet<string>,\n    scans: readonly Readonly<ScanSubscriptionInfo>[],\n  ): void {\n    this.#keys = keys;\n    this.#scans = scans;\n  }\n\n  onData(result: R): void {\n    if (\n      this.#lastValue === unitializedLastValue ||\n      !this.#isEqual(this.#lastValue, result)\n    ) {\n      this.#lastValue = result;\n      this.#onData(result);\n    }\n  }\n}\n\nexport {SubscriptionImpl as SubscriptionImplForTesting};\n\n/**\n * Function that gets passed into {@link Replicache.experimentalWatch} and gets\n * called when the data in Replicache changes.\n *\n * @experimental This type is experimental and may change in the future.\n */\nexport type WatchNoIndexCallback = (diff: NoIndexDiff) => void;\n\nexport type WatchCallbackForOptions<Options extends WatchOptions> =\n  Options extends WatchIndexOptions ? WatchIndexCallback : WatchNoIndexCallback;\n\n/**\n * Function that gets passed into {@link Replicache.experimentalWatch} when doing a\n * watch on a secondary index map and gets called when the data in Replicache\n * changes.\n *\n * @experimental This type is experimental and may change in the future.\n */\nexport type WatchIndexCallback = (diff: IndexDiff) => void;\n\n/**\n * Options for {@link Replicache.experimentalWatch}.\n *\n * @experimental This interface is experimental and may change in the future.\n */\nexport type WatchOptions = WatchIndexOptions | WatchNoIndexOptions;\n\n/**\n * Options object passed to {@link Replicache.experimentalWatch}. This is for an\n * index watch.\n */\nexport type WatchIndexOptions = WatchNoIndexOptions & {\n  /**\n   * When provided, the `watch` is limited to the changes that apply to the index map.\n   */\n  indexName: string;\n};\n\n/**\n * Options object passed to {@link Replicache.experimentalWatch}. This is for a non\n * index watch.\n */\nexport type WatchNoIndexOptions = {\n  /**\n   * When provided, the `watch` is limited to changes where the `key` starts\n   * with `prefix`.\n   */\n  prefix?: string | undefined;\n\n  /**\n   * When this is set to `true` (default is `false`), the `watch` callback will\n   * be called once asynchronously when watch is called. The arguments in that\n   * case is a diff where we consider all the existing values in Replicache as\n   * being added.\n   */\n  initialValuesInFirstDiff?: boolean | undefined;\n};\n\nexport type WatchCallback = (diff: Diff) => void;\n\nexport class WatchSubscription implements Subscription<Diff | undefined> {\n  readonly #callback: WatchCallback;\n  readonly #prefix: string;\n  readonly #indexName: string | undefined;\n  readonly #initialValuesInFirstDiff: boolean;\n\n  readonly onError: ((error: unknown) => void) | undefined = undefined;\n  readonly onDone: (() => void) | undefined = undefined;\n\n  constructor(callback: WatchCallback, options?: WatchOptions) {\n    this.#callback = callback;\n    this.#prefix = options?.prefix ?? '';\n    this.#indexName = (options as WatchIndexOptions)?.indexName;\n    this.#initialValuesInFirstDiff = options?.initialValuesInFirstDiff ?? false;\n  }\n\n  hasIndexSubscription(indexName: string): boolean {\n    return this.#indexName === indexName;\n  }\n\n  onData(result: Diff | undefined): void {\n    if (result !== undefined) {\n      this.#callback(result);\n    }\n  }\n\n  invoke(\n    tx: ReadTransaction,\n    kind: InvokeKind,\n    diffs: DiffsMap | undefined,\n  ): Promise<Diff | undefined> {\n    const invoke = async <Key extends IndexKey | string>(\n      indexName: string | undefined,\n      prefix: string,\n      compareKey: (diff: DiffOperation<Key>) => string,\n      convertInternalDiff: (\n        diff: InternalDiff,\n      ) => readonly DiffOperation<Key>[],\n    ): Promise<readonly DiffOperation<Key>[] | undefined> => {\n      let diff: readonly DiffOperation<Key>[];\n      if (kind === InvokeKind.InitialRun) {\n        if (!this.#initialValuesInFirstDiff) {\n          // We are using `undefined` here as a sentinel value to indicate that we\n          // should not call the callback in `onDone`.\n          return undefined;\n        }\n\n        // For the initial run, we need to get the \"diffs\" for the whole tree.\n        assert(\n          diffs === undefined,\n          'Expected diffs to be undefined on initial run',\n        );\n\n        const newDiff: DiffOperation<Key>[] = [];\n        for await (const entry of tx.scan({prefix, indexName}).entries()) {\n          newDiff.push({\n            op: 'add',\n            key: entry[0] as Key,\n            newValue: entry[1],\n          });\n        }\n        diff = newDiff;\n      } else {\n        assert(diffs, 'Expected diffs to be defined for non-initial run');\n        const maybeDiff = diffs.get(indexName ?? '') ?? [];\n        diff = convertInternalDiff(maybeDiff);\n      }\n      const newDiff: DiffOperation<Key>[] = [];\n      const {length} = diff;\n      for (\n        let i = diffBinarySearch(diff, prefix, compareKey);\n        i < length;\n        i++\n      ) {\n        if (compareKey(diff[i]).startsWith(prefix)) {\n          newDiff.push(diff[i]);\n        } else {\n          break;\n        }\n      }\n\n      // For initial run we should always return something.\n      return kind === InvokeKind.InitialRun || newDiff.length > 0\n        ? newDiff\n        : undefined;\n    };\n\n    if (this.#indexName) {\n      return invoke<IndexKey>(\n        this.#indexName,\n        this.#prefix,\n        diff => diff.key[0],\n        internalDiff => convertDiffValues(internalDiff, decodeIndexKey),\n      );\n    }\n\n    return invoke<string>(\n      undefined,\n      this.#prefix,\n      diff => diff.key,\n      internalDiff => convertDiffValues(internalDiff, k => k),\n    );\n  }\n\n  matches(diffs: DiffsMap): boolean {\n    const diff = diffs.get(this.#indexName ?? '');\n    if (diff === undefined) {\n      return false;\n    }\n\n    return watcherMatchesDiff(diff, this.#prefix, this.#indexName);\n  }\n\n  updateDeps(\n    _keys: ReadonlySet<string>,\n    _scans: readonly Readonly<ScanSubscriptionInfo>[],\n  ): void {\n    // not used\n  }\n}\n\nfunction convertDiffValues<Key>(\n  diff: InternalDiff,\n  convertKey: (k: string) => Key,\n): DiffOperation<Key>[] {\n  return diff.map(op => {\n    const key = convertKey(op.key);\n    switch (op.op) {\n      case 'add':\n        return {\n          op: 'add',\n          key,\n          newValue: op.newValue,\n        };\n      case 'change':\n        return {\n          op: 'change',\n          key,\n          oldValue: op.oldValue,\n          newValue: op.newValue,\n        };\n      case 'del':\n        return {\n          op: 'del',\n          key,\n          oldValue: op.oldValue,\n        };\n    }\n  });\n}\n\n/**\n * The options passed to {@link Replicache.subscribe}.\n */\nexport interface SubscribeOptions<R> {\n  /**\n   * Called when the return value of the body function changes.\n   */\n  onData: (result: R) => void;\n\n  /**\n   * If present, called when an error occurs.\n   */\n  onError?: ((error: unknown) => void) | undefined;\n\n  /**\n   * If present, called when the subscription is removed/done.\n   */\n  onDone?: (() => void) | undefined;\n\n  /**\n   * If present this function is used to determine if the value returned by the\n   * body function has changed. If not provided a JSON deep equality check is\n   * used.\n   */\n  isEqual?: ((a: R, b: R) => boolean) | undefined;\n}\n\nexport type UnknownSubscription = Subscription<unknown>;\n\ntype SubscriptionSet = Set<UnknownSubscription>;\n\nexport interface SubscriptionsManager extends DiffComputationConfig {\n  clear(): void;\n  fire(diffs: DiffsMap): Promise<void>;\n  hasPendingSubscriptionRuns: boolean;\n  add<R>(subscription: Subscription<R>): () => void;\n}\n\nexport class SubscriptionsManagerImpl implements SubscriptionsManager {\n  readonly #subscriptions: SubscriptionSet = new Set();\n  readonly #pendingSubscriptions: SubscriptionSet = new Set();\n  readonly #queryInternal: QueryInternal;\n  readonly #lc: LogContext;\n  hasPendingSubscriptionRuns = false;\n  readonly #signal: AbortSignal;\n\n  constructor(\n    queryInternal: QueryInternal,\n    lc: LogContext,\n    signal: AbortSignal,\n  ) {\n    this.#queryInternal = queryInternal;\n    this.#lc = lc;\n    this.#signal = signal;\n  }\n\n  add<R>(subscription: Subscription<R>): () => void {\n    this.#subscriptions.add(subscription as UnknownSubscription);\n    void this.#scheduleInitialSubscriptionRun(\n      subscription as UnknownSubscription,\n    );\n    return () =>\n      this.#subscriptions.delete(subscription as UnknownSubscription);\n  }\n\n  clear(): void {\n    for (const subscription of this.#subscriptions) {\n      subscription.onDone?.();\n    }\n    this.#subscriptions.clear();\n  }\n\n  fire(diffs: DiffsMap): Promise<void> {\n    const subscriptions = subscriptionsForDiffs(this.#subscriptions, diffs);\n    return this.#fireSubscriptions(subscriptions, InvokeKind.Regular, diffs);\n  }\n\n  async #fireSubscriptions(\n    subscriptions: Iterable<UnknownSubscription>,\n    kind: InvokeKind,\n    diffs: DiffsMap | undefined,\n  ) {\n    if (this.#signal.aborted) {\n      return;\n    }\n\n    const subs = [...subscriptions] as readonly Subscription<unknown>[];\n    if (subs.length === 0) {\n      return;\n    }\n\n    // Use allSettled to gather fulfilled and rejected promises.\n    const results = await this.#queryInternal(tx =>\n      Promise.allSettled(\n        subs.map(async s => {\n          const stx = new SubscriptionTransactionWrapper(tx);\n          try {\n            return await s.invoke(stx, kind, diffs);\n          } finally {\n            // We need to keep track of the subscription keys even if there was an\n            // exception because changes to the keys can make the subscription\n            // body succeed.\n            s.updateDeps(stx.keys, stx.scans);\n          }\n        }),\n      ),\n    );\n\n    this.callCallbacks(subs, results);\n  }\n\n  // Public method so that ZQL can wrap it in a transaction.\n  callCallbacks(\n    subs: readonly Subscription<unknown>[],\n    results: PromiseSettledResult<unknown>[],\n  ) {\n    for (let i = 0; i < subs.length; i++) {\n      const s = subs[i];\n      const result = results[i];\n      if (result.status === 'fulfilled') {\n        s.onData(result.value);\n      } else {\n        if (s.onError) {\n          s.onError(result.reason);\n        } else {\n          this.#lc.error?.('Error in subscription body:', result.reason);\n        }\n      }\n    }\n  }\n\n  async #scheduleInitialSubscriptionRun(s: UnknownSubscription) {\n    this.#pendingSubscriptions.add(s);\n\n    if (!this.hasPendingSubscriptionRuns) {\n      this.hasPendingSubscriptionRuns = true;\n      await Promise.resolve();\n      this.hasPendingSubscriptionRuns = false;\n      const subscriptions = [...this.#pendingSubscriptions];\n      this.#pendingSubscriptions.clear();\n      await this.#fireSubscriptions(\n        subscriptions,\n        InvokeKind.InitialRun,\n        undefined,\n      );\n    }\n  }\n\n  shouldComputeDiffs(): boolean {\n    return this.#subscriptions.size > 0;\n  }\n\n  shouldComputeDiffsForIndex(indexName: string): boolean {\n    for (const s of this.#subscriptions) {\n      if (s.hasIndexSubscription(indexName)) {\n        return true;\n      }\n    }\n    return false;\n  }\n}\n\nexport type ScanSubscriptionInfo = {\n  options: ScanOptions;\n  inclusiveLimitKey?: string | undefined;\n};\n\nfunction diffMatchesSubscription(\n  keys: ReadonlySet<string>,\n  scans: Iterable<Readonly<ScanSubscriptionInfo>>,\n  indexName: string,\n  diff: InternalDiff,\n): boolean {\n  // Keys can only match for non index scans.\n  if (indexName === '') {\n    for (const diffEntry of diff) {\n      if (keys.has(diffEntry.key)) {\n        return true;\n      }\n    }\n  }\n\n  for (const scanInfo of scans) {\n    if (scanInfoMatchesDiff(scanInfo, indexName, diff)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nfunction scanInfoMatchesDiff(\n  scanInfo: ScanSubscriptionInfo,\n  changeIndexName: string,\n  diff: InternalDiff,\n): boolean {\n  // TODO(arv): Use binary search\n  for (const diffEntry of diff) {\n    if (scanInfoMatchesKey(scanInfo, changeIndexName, diffEntry.key)) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\nexport function scanInfoMatchesKey(\n  scanInfo: ScanSubscriptionInfo,\n  changeIndexName: string,\n  changedKey: string,\n): boolean {\n  const {\n    indexName = '',\n    limit,\n    prefix,\n    startKey,\n    startExclusive,\n    startSecondaryKey,\n  } = scanInfo.options;\n\n  if (changeIndexName !== indexName) {\n    return false;\n  }\n\n  if (!indexName) {\n    // A scan with limit <= 0 can have no matches\n    if (limit !== undefined && limit <= 0) {\n      return false;\n    }\n\n    // No prefix and no start. Must recompute the subscription because all keys\n    // will have an effect on the subscription.\n    if (!prefix && !startKey) {\n      return true;\n    }\n\n    if (\n      prefix &&\n      (!changedKey.startsWith(prefix) ||\n        isKeyPastInclusiveLimit(scanInfo, changedKey))\n    ) {\n      return false;\n    }\n\n    if (\n      startKey &&\n      ((startExclusive && lessThanEq(changedKey, startKey)) ||\n        lessThan(changedKey, startKey) ||\n        isKeyPastInclusiveLimit(scanInfo, changedKey))\n    ) {\n      return false;\n    }\n\n    return true;\n  }\n\n  // No prefix and no start. Must recompute the subscription because all keys\n  // will have an effect on the subscription.\n  if (!prefix && !startKey && !startSecondaryKey) {\n    return true;\n  }\n\n  const [changedKeySecondary, changedKeyPrimary] = decodeIndexKey(changedKey);\n\n  if (prefix) {\n    if (!changedKeySecondary.startsWith(prefix)) {\n      return false;\n    }\n  }\n\n  if (\n    startSecondaryKey &&\n    ((startExclusive && lessThanEq(changedKeySecondary, startSecondaryKey)) ||\n      lessThan(changedKeySecondary, startSecondaryKey))\n  ) {\n    return false;\n  }\n\n  if (\n    startKey &&\n    ((startExclusive && lessThanEq(changedKeyPrimary, startKey)) ||\n      lessThan(changedKeyPrimary, startKey))\n  ) {\n    return false;\n  }\n\n  return true;\n}\n\nfunction isKeyPastInclusiveLimit(\n  scanInfo: ScanSubscriptionInfo,\n  changedKey: string,\n): boolean {\n  const {inclusiveLimitKey} = scanInfo;\n  return (\n    scanInfo.options.limit !== undefined &&\n    inclusiveLimitKey !== undefined &&\n    greaterThan(changedKey, inclusiveLimitKey)\n  );\n}\n\nfunction* subscriptionsForDiffs<V>(\n  subscriptions: Set<Subscription<V>>,\n  diffs: DiffsMap,\n): Generator<Subscription<V>> {\n  for (const subscription of subscriptions) {\n    if (subscription.matches(diffs)) {\n      yield subscription;\n    }\n  }\n}\n\nfunction watcherMatchesDiff(\n  diff: InternalDiff,\n  prefix: string,\n  indexName: string | undefined,\n): boolean {\n  if (prefix === '') {\n    return true;\n  }\n\n  const compareKey = indexName\n    ? (diffOp: InternalDiffOperation) => decodeIndexKey(diffOp.key)[0]\n    : (diffOp: InternalDiffOperation) => diffOp.key;\n  const i = diffBinarySearch(diff, prefix, compareKey);\n  return i < diff.length && compareKey(diff[i]).startsWith(prefix);\n}\n\nexport function diffBinarySearch<Key, Value>(\n  diff: readonly InternalDiffOperation<Key, Value>[],\n  prefix: string,\n  compareKey: (diff: InternalDiffOperation<Key, Value>) => string,\n): number {\n  return binarySearch(diff.length, i =>\n    compareUTF8(prefix, compareKey(diff[i])),\n  );\n}\n"],"mappings":";;;;;;;AAgDA,IAAM,2BAAgC,IAAI,KAAK;AAE/C,IAAM,uBAAuB,QAAQ;AAGrC,IAAa,mBAAb,MAA4D;CAC1D;CACA;CACA,aAAuC;CACvC,QAAQ;CACR,SAAoD,EAAE;CAEtD;CACA;CACA;CAEA,YACE,MACA,QACA,SACA,QAEA,UAAmC,WACnC;AACA,QAAA,OAAa;AACb,QAAA,SAAe;AACf,OAAK,UAAU;AACf,OAAK,SAAS;AACd,QAAA,UAAgB;;CAGlB,qBAAqB,WAA4B;AAC/C,OAAK,MAAM,QAAQ,MAAA,MACjB,KAAI,KAAK,QAAQ,cAAc,UAC7B,QAAO;AAGX,SAAO;;CAGT,OACE,IACA,OACA,QACY;AACZ,SAAO,MAAA,KAAW,GAAG;;CAGvB,QAAQ,OAA0B;AAChC,OAAK,MAAM,CAAC,WAAW,SAAS,MAC9B,KAAI,wBAAwB,MAAA,MAAY,MAAA,OAAa,WAAW,KAAK,CACnE,QAAO;AAIX,SAAO;;CAGT,WACE,MACA,OACM;AACN,QAAA,OAAa;AACb,QAAA,QAAc;;CAGhB,OAAO,QAAiB;AACtB,MACE,MAAA,cAAoB,wBACpB,CAAC,MAAA,QAAc,MAAA,WAAiB,OAAO,EACvC;AACA,SAAA,YAAkB;AAClB,SAAA,OAAa,OAAO;;;;AAmE1B,IAAa,oBAAb,MAAyE;CACvE;CACA;CACA;CACA;CAEA,UAA2D,KAAA;CAC3D,SAA4C,KAAA;CAE5C,YAAY,UAAyB,SAAwB;AAC3D,QAAA,WAAiB;AACjB,QAAA,SAAe,SAAS,UAAU;AAClC,QAAA,YAAmB,SAA+B;AAClD,QAAA,2BAAiC,SAAS,4BAA4B;;CAGxE,qBAAqB,WAA4B;AAC/C,SAAO,MAAA,cAAoB;;CAG7B,OAAO,QAAgC;AACrC,MAAI,WAAW,KAAA,EACb,OAAA,SAAe,OAAO;;CAI1B,OACE,IACA,MACA,OAC2B;EAC3B,MAAM,SAAS,OACb,WACA,QACA,YACA,wBAGuD;GACvD,IAAI;AACJ,OAAI,SAAS,GAAuB;AAClC,QAAI,CAAC,MAAA,yBAGH;AAIF,WACE,UAAU,KAAA,GACV,gDACD;IAED,MAAM,UAAgC,EAAE;AACxC,eAAW,MAAM,SAAS,GAAG,KAAK;KAAC;KAAQ;KAAU,CAAC,CAAC,SAAS,CAC9D,SAAQ,KAAK;KACX,IAAI;KACJ,KAAK,MAAM;KACX,UAAU,MAAM;KACjB,CAAC;AAEJ,WAAO;UACF;AACL,WAAO,OAAO,mDAAmD;AAEjE,WAAO,oBADW,MAAM,IAAI,aAAa,GAAG,IAAI,EAAE,CACb;;GAEvC,MAAM,UAAgC,EAAE;GACxC,MAAM,EAAC,WAAU;AACjB,QACE,IAAI,IAAI,iBAAiB,MAAM,QAAQ,WAAW,EAClD,IAAI,QACJ,IAEA,KAAI,WAAW,KAAK,GAAG,CAAC,WAAW,OAAO,CACxC,SAAQ,KAAK,KAAK,GAAG;OAErB;AAKJ,UAAO,SAAS,KAAyB,QAAQ,SAAS,IACtD,UACA,KAAA;;AAGN,MAAI,MAAA,UACF,QAAO,OACL,MAAA,WACA,MAAA,SACA,SAAQ,KAAK,IAAI,KACjB,iBAAgB,kBAAkB,cAAc,eAAe,CAChE;AAGH,SAAO,OACL,KAAA,GACA,MAAA,SACA,SAAQ,KAAK,MACb,iBAAgB,kBAAkB,eAAc,MAAK,EAAE,CACxD;;CAGH,QAAQ,OAA0B;EAChC,MAAM,OAAO,MAAM,IAAI,MAAA,aAAmB,GAAG;AAC7C,MAAI,SAAS,KAAA,EACX,QAAO;AAGT,SAAO,mBAAmB,MAAM,MAAA,QAAc,MAAA,UAAgB;;CAGhE,WACE,OACA,QACM;;AAKV,SAAS,kBACP,MACA,YACsB;AACtB,QAAO,KAAK,KAAI,OAAM;EACpB,MAAM,MAAM,WAAW,GAAG,IAAI;AAC9B,UAAQ,GAAG,IAAX;GACE,KAAK,MACH,QAAO;IACL,IAAI;IACJ;IACA,UAAU,GAAG;IACd;GACH,KAAK,SACH,QAAO;IACL,IAAI;IACJ;IACA,UAAU,GAAG;IACb,UAAU,GAAG;IACd;GACH,KAAK,MACH,QAAO;IACL,IAAI;IACJ;IACA,UAAU,GAAG;IACd;;GAEL;;AAyCJ,IAAa,2BAAb,MAAsE;CACpE,iCAA2C,IAAI,KAAK;CACpD,wCAAkD,IAAI,KAAK;CAC3D;CACA;CACA,6BAA6B;CAC7B;CAEA,YACE,eACA,IACA,QACA;AACA,QAAA,gBAAsB;AACtB,QAAA,KAAW;AACX,QAAA,SAAe;;CAGjB,IAAO,cAA2C;AAChD,QAAA,cAAoB,IAAI,aAAoC;AACvD,QAAA,+BACH,aACD;AACD,eACE,MAAA,cAAoB,OAAO,aAAoC;;CAGnE,QAAc;AACZ,OAAK,MAAM,gBAAgB,MAAA,cACzB,cAAa,UAAU;AAEzB,QAAA,cAAoB,OAAO;;CAG7B,KAAK,OAAgC;EACnC,MAAM,gBAAgB,sBAAsB,MAAA,eAAqB,MAAM;AACvE,SAAO,MAAA,kBAAwB,eAAe,GAAoB,MAAM;;CAG1E,OAAA,kBACE,eACA,MACA,OACA;AACA,MAAI,MAAA,OAAa,QACf;EAGF,MAAM,OAAO,CAAC,GAAG,cAAc;AAC/B,MAAI,KAAK,WAAW,EAClB;EAIF,MAAM,UAAU,MAAM,MAAA,eAAoB,OACxC,QAAQ,WACN,KAAK,IAAI,OAAM,MAAK;GAClB,MAAM,MAAM,IAAI,+BAA+B,GAAG;AAClD,OAAI;AACF,WAAO,MAAM,EAAE,OAAO,KAAK,MAAM,MAAM;aAC/B;AAIR,MAAE,WAAW,IAAI,MAAM,IAAI,MAAM;;IAEnC,CACH,CACF;AAED,OAAK,cAAc,MAAM,QAAQ;;CAInC,cACE,MACA,SACA;AACA,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GACpC,MAAM,IAAI,KAAK;GACf,MAAM,SAAS,QAAQ;AACvB,OAAI,OAAO,WAAW,YACpB,GAAE,OAAO,OAAO,MAAM;YAElB,EAAE,QACJ,GAAE,QAAQ,OAAO,OAAO;OAExB,OAAA,GAAS,QAAQ,+BAA+B,OAAO,OAAO;;;CAMtE,OAAA,+BAAsC,GAAwB;AAC5D,QAAA,qBAA2B,IAAI,EAAE;AAEjC,MAAI,CAAC,KAAK,4BAA4B;AACpC,QAAK,6BAA6B;AAClC,SAAM,QAAQ,SAAS;AACvB,QAAK,6BAA6B;GAClC,MAAM,gBAAgB,CAAC,GAAG,MAAA,qBAA2B;AACrD,SAAA,qBAA2B,OAAO;AAClC,SAAM,MAAA,kBACJ,eACA,GACA,KAAA,EACD;;;CAIL,qBAA8B;AAC5B,SAAO,MAAA,cAAoB,OAAO;;CAGpC,2BAA2B,WAA4B;AACrD,OAAK,MAAM,KAAK,MAAA,cACd,KAAI,EAAE,qBAAqB,UAAU,CACnC,QAAO;AAGX,SAAO;;;AASX,SAAS,wBACP,MACA,OACA,WACA,MACS;AAET,KAAI,cAAc;OACX,MAAM,aAAa,KACtB,KAAI,KAAK,IAAI,UAAU,IAAI,CACzB,QAAO;;AAKb,MAAK,MAAM,YAAY,MACrB,KAAI,oBAAoB,UAAU,WAAW,KAAK,CAChD,QAAO;AAGX,QAAO;;AAGT,SAAS,oBACP,UACA,iBACA,MACS;AAET,MAAK,MAAM,aAAa,KACtB,KAAI,mBAAmB,UAAU,iBAAiB,UAAU,IAAI,CAC9D,QAAO;AAIX,QAAO;;AAGT,SAAgB,mBACd,UACA,iBACA,YACS;CACT,MAAM,EACJ,YAAY,IACZ,OACA,QACA,UACA,gBACA,sBACE,SAAS;AAEb,KAAI,oBAAoB,UACtB,QAAO;AAGT,KAAI,CAAC,WAAW;AAEd,MAAI,UAAU,KAAA,KAAa,SAAS,EAClC,QAAO;AAKT,MAAI,CAAC,UAAU,CAAC,SACd,QAAO;AAGT,MACE,WACC,CAAC,WAAW,WAAW,OAAO,IAC7B,wBAAwB,UAAU,WAAW,EAE/C,QAAO;AAGT,MACE,aACE,kBAAkB,WAAW,YAAY,SAAS,IAClD,SAAS,YAAY,SAAS,IAC9B,wBAAwB,UAAU,WAAW,EAE/C,QAAO;AAGT,SAAO;;AAKT,KAAI,CAAC,UAAU,CAAC,YAAY,CAAC,kBAC3B,QAAO;CAGT,MAAM,CAAC,qBAAqB,qBAAqB,eAAe,WAAW;AAE3E,KAAI;MACE,CAAC,oBAAoB,WAAW,OAAO,CACzC,QAAO;;AAIX,KACE,sBACE,kBAAkB,WAAW,qBAAqB,kBAAkB,IACpE,SAAS,qBAAqB,kBAAkB,EAElD,QAAO;AAGT,KACE,aACE,kBAAkB,WAAW,mBAAmB,SAAS,IACzD,SAAS,mBAAmB,SAAS,EAEvC,QAAO;AAGT,QAAO;;AAGT,SAAS,wBACP,UACA,YACS;CACT,MAAM,EAAC,sBAAqB;AAC5B,QACE,SAAS,QAAQ,UAAU,KAAA,KAC3B,sBAAsB,KAAA,KACtB,YAAY,YAAY,kBAAkB;;AAI9C,UAAU,sBACR,eACA,OAC4B;AAC5B,MAAK,MAAM,gBAAgB,cACzB,KAAI,aAAa,QAAQ,MAAM,CAC7B,OAAM;;AAKZ,SAAS,mBACP,MACA,QACA,WACS;AACT,KAAI,WAAW,GACb,QAAO;CAGT,MAAM,aAAa,aACd,WAAkC,eAAe,OAAO,IAAI,CAAC,MAC7D,WAAkC,OAAO;CAC9C,MAAM,IAAI,iBAAiB,MAAM,QAAQ,WAAW;AACpD,QAAO,IAAI,KAAK,UAAU,WAAW,KAAK,GAAG,CAAC,WAAW,OAAO;;AAGlE,SAAgB,iBACd,MACA,QACA,YACQ;AACR,QAAO,aAAa,KAAK,SAAQ,MAC/B,YAAY,QAAQ,WAAW,KAAK,GAAG,CAAC,CACzC"}

package/out/replicache/src/sync/diff.js

@@ -1,75 +1,62 @@
 import { assert } from "../../../shared/src/asserts.js";
-import { diff as diff$1 } from "../btree/diff.js";
 import { BTreeRead, allEntriesAsDiff } from "../btree/read.js";
 import { commitFromHash } from "../db/commit.js";
+import { diff as diff$1 } from "../btree/diff.js";
 import { readIndexesForRead } from "../db/read.js";
-class DiffsMap extends Map {
-  set(key, value) {
-    if (value.length === 0) {
-      return this;
-    }
-    return super.set(key, value);
-  }
-}
+//#region ../replicache/src/sync/diff.ts
+/**
+* The diffs in different indexes. The key of the map is the index name.
+* "" is used for the primary index.
+*/
+var DiffsMap = class extends Map {
+	set(key, value) {
+		if (value.length === 0) return this;
+		return super.set(key, value);
+	}
+};
+/**
+* Diffs the state of the db at two different hashes.
+* It will include the primary indexes as well as all the secondary indexes.
+*/
 async function diff(oldHash, newHash, read, diffConfig, formatVersion) {
-  const [oldCommit, newCommit] = await Promise.all([
-    commitFromHash(oldHash, read),
-    commitFromHash(newHash, read)
-  ]);
-  return diffCommits(oldCommit, newCommit, read, diffConfig, formatVersion);
+	const [oldCommit, newCommit] = await Promise.all([commitFromHash(oldHash, read), commitFromHash(newHash, read)]);
+	return diffCommits(oldCommit, newCommit, read, diffConfig, formatVersion);
 }
+/**
+* Diffs the state of the db at two different commits.
+* It will include the primary indexes as well as all the secondary indexes.
+*/
 async function diffCommits(oldCommit, newCommit, read, diffConfig, formatVersion) {
-  const diffsMap = new DiffsMap();
-  if (!diffConfig.shouldComputeDiffs()) {
-    return diffsMap;
-  }
-  const oldMap = new BTreeRead(read, formatVersion, oldCommit.valueHash);
-  const newMap = new BTreeRead(read, formatVersion, newCommit.valueHash);
-  const valueDiff = await diff$1(oldMap, newMap);
-  diffsMap.set("", valueDiff);
-  await addDiffsForIndexes(
-    oldCommit,
-    newCommit,
-    read,
-    diffsMap,
-    diffConfig,
-    formatVersion
-  );
-  return diffsMap;
+	const diffsMap = new DiffsMap();
+	if (!diffConfig.shouldComputeDiffs()) return diffsMap;
+	const valueDiff = await diff$1(new BTreeRead(read, formatVersion, oldCommit.valueHash), new BTreeRead(read, formatVersion, newCommit.valueHash));
+	diffsMap.set("", valueDiff);
+	await addDiffsForIndexes(oldCommit, newCommit, read, diffsMap, diffConfig, formatVersion);
+	return diffsMap;
 }
 async function addDiffsForIndexes(mainCommit, syncCommit, read, diffsMap, diffConfig, formatVersion) {
-  const oldIndexes = readIndexesForRead(mainCommit, read, formatVersion);
-  const newIndexes = readIndexesForRead(syncCommit, read, formatVersion);
-  for (const [oldIndexName, oldIndex] of oldIndexes) {
-    if (!diffConfig.shouldComputeDiffsForIndex(oldIndexName)) {
-      continue;
-    }
-    const newIndex = newIndexes.get(oldIndexName);
-    if (newIndex !== void 0) {
-      assert(
-        newIndex !== oldIndex,
-        "Expected newIndex to differ from oldIndex"
-      );
-      const diffs = await diff$1(oldIndex.map, newIndex.map);
-      newIndexes.delete(oldIndexName);
-      diffsMap.set(oldIndexName, diffs);
-    } else {
-      const diffs = await allEntriesAsDiff(oldIndex.map, "del");
-      diffsMap.set(oldIndexName, diffs);
-    }
-  }
-  for (const [newIndexName, newIndex] of newIndexes) {
-    if (!diffConfig.shouldComputeDiffsForIndex(newIndexName)) {
-      continue;
-    }
-    const diffs = await allEntriesAsDiff(newIndex.map, "add");
-    diffsMap.set(newIndexName, diffs);
-  }
+	const oldIndexes = readIndexesForRead(mainCommit, read, formatVersion);
+	const newIndexes = readIndexesForRead(syncCommit, read, formatVersion);
+	for (const [oldIndexName, oldIndex] of oldIndexes) {
+		if (!diffConfig.shouldComputeDiffsForIndex(oldIndexName)) continue;
+		const newIndex = newIndexes.get(oldIndexName);
+		if (newIndex !== void 0) {
+			assert(newIndex !== oldIndex, "Expected newIndex to differ from oldIndex");
+			const diffs = await diff$1(oldIndex.map, newIndex.map);
+			newIndexes.delete(oldIndexName);
+			diffsMap.set(oldIndexName, diffs);
+		} else {
+			const diffs = await allEntriesAsDiff(oldIndex.map, "del");
+			diffsMap.set(oldIndexName, diffs);
+		}
+	}
+	for (const [newIndexName, newIndex] of newIndexes) {
+		if (!diffConfig.shouldComputeDiffsForIndex(newIndexName)) continue;
+		const diffs = await allEntriesAsDiff(newIndex.map, "add");
+		diffsMap.set(newIndexName, diffs);
+	}
 }
-export {
-  DiffsMap,
-  addDiffsForIndexes,
-  diff,
-  diffCommits
-};
-//# sourceMappingURL=diff.js.map
+//#endregion
+export { DiffsMap, addDiffsForIndexes, diff, diffCommits };
+
+//# sourceMappingURL=diff.js.map

package/out/replicache/src/sync/diff.js.map

@@ -1 +1 @@
-{"version":3,"file":"diff.js","sources":["../../../../../replicache/src/sync/diff.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {Enum} from '../../../shared/src/enum.ts';\nimport {diff as btreeDiff} from '../btree/diff.ts';\nimport type {InternalDiff} from '../btree/node.ts';\nimport {allEntriesAsDiff, BTreeRead} from '../btree/read.ts';\nimport type {Read} from '../dag/store.ts';\nimport type {Commit} from '../db/commit.ts';\nimport {commitFromHash, type Meta} from '../db/commit.ts';\nimport {readIndexesForRead} from '../db/read.ts';\nimport type * as FormatVersion from '../format-version-enum.ts';\nimport type {Hash} from '../hash.ts';\n\ntype FormatVersion = Enum<typeof FormatVersion>;\n\n/**\n * Interface allowing different diff functions to skip costly diff computations.\n */\nexport interface DiffComputationConfig {\n  shouldComputeDiffs(): boolean;\n  shouldComputeDiffsForIndex(name: string): boolean;\n}\n\n/**\n * The diffs in different indexes. The key of the map is the index name.\n * \"\" is used for the primary index.\n */\nexport class DiffsMap extends Map<string, InternalDiff> {\n  override set(key: string, value: InternalDiff): this {\n    if (value.length === 0) {\n      return this;\n    }\n    return super.set(key, value);\n  }\n}\n\n/**\n * Diffs the state of the db at two different hashes.\n * It will include the primary indexes as well as all the secondary indexes.\n */\nexport async function diff(\n  oldHash: Hash,\n  newHash: Hash,\n  read: Read,\n  diffConfig: DiffComputationConfig,\n  formatVersion: FormatVersion,\n): Promise<DiffsMap> {\n  const [oldCommit, newCommit] = await Promise.all([\n    commitFromHash(oldHash, read),\n    commitFromHash(newHash, read),\n  ]);\n\n  return diffCommits(oldCommit, newCommit, read, diffConfig, formatVersion);\n}\n\n/**\n * Diffs the state of the db at two different commits.\n * It will include the primary indexes as well as all the secondary indexes.\n */\n// TODO: this should probably move to db/\nexport async function diffCommits(\n  oldCommit: Commit<Meta>,\n  newCommit: Commit<Meta>,\n  read: Read,\n  diffConfig: DiffComputationConfig,\n  formatVersion: FormatVersion,\n): Promise<DiffsMap> {\n  const diffsMap = new DiffsMap();\n  if (!diffConfig.shouldComputeDiffs()) {\n    return diffsMap;\n  }\n\n  const oldMap = new BTreeRead(read, formatVersion, oldCommit.valueHash);\n  const newMap = new BTreeRead(read, formatVersion, newCommit.valueHash);\n  const valueDiff = await btreeDiff(oldMap, newMap);\n  diffsMap.set('', valueDiff);\n\n  await addDiffsForIndexes(\n    oldCommit,\n    newCommit,\n    read,\n    diffsMap,\n    diffConfig,\n    formatVersion,\n  );\n\n  return diffsMap;\n}\n\nexport async function addDiffsForIndexes(\n  mainCommit: Commit<Meta>,\n  syncCommit: Commit<Meta>,\n  read: Read,\n  diffsMap: DiffsMap,\n  diffConfig: DiffComputationConfig,\n  formatVersion: FormatVersion,\n) {\n  const oldIndexes = readIndexesForRead(mainCommit, read, formatVersion);\n  const newIndexes = readIndexesForRead(syncCommit, read, formatVersion);\n\n  for (const [oldIndexName, oldIndex] of oldIndexes) {\n    if (!diffConfig.shouldComputeDiffsForIndex(oldIndexName)) {\n      continue;\n    }\n\n    const newIndex = newIndexes.get(oldIndexName);\n    if (newIndex !== undefined) {\n      assert(\n        newIndex !== oldIndex,\n        'Expected newIndex to differ from oldIndex',\n      );\n      const diffs = await btreeDiff(oldIndex.map, newIndex.map);\n      newIndexes.delete(oldIndexName);\n      diffsMap.set(oldIndexName, diffs);\n    } else {\n      // old index name is not in the new indexes. All entries removed!\n      const diffs = await allEntriesAsDiff(oldIndex.map, 'del');\n      diffsMap.set(oldIndexName, diffs);\n    }\n  }\n\n  for (const [newIndexName, newIndex] of newIndexes) {\n    if (!diffConfig.shouldComputeDiffsForIndex(newIndexName)) {\n      continue;\n    }\n    // new index name is not in the old indexes. All keys added!\n    const diffs = await allEntriesAsDiff(newIndex.map, 'add');\n    diffsMap.set(newIndexName, diffs);\n  }\n}\n"],"names":["btreeDiff"],"mappings":";;;;;AA0BO,MAAM,iBAAiB,IAA0B;AAAA,EAC7C,IAAI,KAAa,OAA2B;AACnD,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO;AAAA,IACT;AACA,WAAO,MAAM,IAAI,KAAK,KAAK;AAAA,EAC7B;AACF;AAMA,eAAsB,KACpB,SACA,SACA,MACA,YACA,eACmB;AACnB,QAAM,CAAC,WAAW,SAAS,IAAI,MAAM,QAAQ,IAAI;AAAA,IAC/C,eAAe,SAAS,IAAI;AAAA,IAC5B,eAAe,SAAS,IAAI;AAAA,EAAA,CAC7B;AAED,SAAO,YAAY,WAAW,WAAW,MAAM,YAAY,aAAa;AAC1E;AAOA,eAAsB,YACpB,WACA,WACA,MACA,YACA,eACmB;AACnB,QAAM,WAAW,IAAI,SAAA;AACrB,MAAI,CAAC,WAAW,sBAAsB;AACpC,WAAO;AAAA,EACT;AAEA,QAAM,SAAS,IAAI,UAAU,MAAM,eAAe,UAAU,SAAS;AACrE,QAAM,SAAS,IAAI,UAAU,MAAM,eAAe,UAAU,SAAS;AACrE,QAAM,YAAY,MAAMA,OAAU,QAAQ,MAAM;AAChD,WAAS,IAAI,IAAI,SAAS;AAE1B,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAGF,SAAO;AACT;AAEA,eAAsB,mBACpB,YACA,YACA,MACA,UACA,YACA,eACA;AACA,QAAM,aAAa,mBAAmB,YAAY,MAAM,aAAa;AACrE,QAAM,aAAa,mBAAmB,YAAY,MAAM,aAAa;AAErE,aAAW,CAAC,cAAc,QAAQ,KAAK,YAAY;AACjD,QAAI,CAAC,WAAW,2BAA2B,YAAY,GAAG;AACxD;AAAA,IACF;AAEA,UAAM,WAAW,WAAW,IAAI,YAAY;AAC5C,QAAI,aAAa,QAAW;AAC1B;AAAA,QACE,aAAa;AAAA,QACb;AAAA,MAAA;AAEF,YAAM,QAAQ,MAAMA,OAAU,SAAS,KAAK,SAAS,GAAG;AACxD,iBAAW,OAAO,YAAY;AAC9B,eAAS,IAAI,cAAc,KAAK;AAAA,IAClC,OAAO;AAEL,YAAM,QAAQ,MAAM,iBAAiB,SAAS,KAAK,KAAK;AACxD,eAAS,IAAI,cAAc,KAAK;AAAA,IAClC;AAAA,EACF;AAEA,aAAW,CAAC,cAAc,QAAQ,KAAK,YAAY;AACjD,QAAI,CAAC,WAAW,2BAA2B,YAAY,GAAG;AACxD;AAAA,IACF;AAEA,UAAM,QAAQ,MAAM,iBAAiB,SAAS,KAAK,KAAK;AACxD,aAAS,IAAI,cAAc,KAAK;AAAA,EAClC;AACF;"}
+{"version":3,"file":"diff.js","names":[],"sources":["../../../../../replicache/src/sync/diff.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {Enum} from '../../../shared/src/enum.ts';\nimport {diff as btreeDiff} from '../btree/diff.ts';\nimport type {InternalDiff} from '../btree/node.ts';\nimport {allEntriesAsDiff, BTreeRead} from '../btree/read.ts';\nimport type {Read} from '../dag/store.ts';\nimport type {Commit} from '../db/commit.ts';\nimport {commitFromHash, type Meta} from '../db/commit.ts';\nimport {readIndexesForRead} from '../db/read.ts';\nimport type * as FormatVersion from '../format-version-enum.ts';\nimport type {Hash} from '../hash.ts';\n\ntype FormatVersion = Enum<typeof FormatVersion>;\n\n/**\n * Interface allowing different diff functions to skip costly diff computations.\n */\nexport interface DiffComputationConfig {\n  shouldComputeDiffs(): boolean;\n  shouldComputeDiffsForIndex(name: string): boolean;\n}\n\n/**\n * The diffs in different indexes. The key of the map is the index name.\n * \"\" is used for the primary index.\n */\nexport class DiffsMap extends Map<string, InternalDiff> {\n  override set(key: string, value: InternalDiff): this {\n    if (value.length === 0) {\n      return this;\n    }\n    return super.set(key, value);\n  }\n}\n\n/**\n * Diffs the state of the db at two different hashes.\n * It will include the primary indexes as well as all the secondary indexes.\n */\nexport async function diff(\n  oldHash: Hash,\n  newHash: Hash,\n  read: Read,\n  diffConfig: DiffComputationConfig,\n  formatVersion: FormatVersion,\n): Promise<DiffsMap> {\n  const [oldCommit, newCommit] = await Promise.all([\n    commitFromHash(oldHash, read),\n    commitFromHash(newHash, read),\n  ]);\n\n  return diffCommits(oldCommit, newCommit, read, diffConfig, formatVersion);\n}\n\n/**\n * Diffs the state of the db at two different commits.\n * It will include the primary indexes as well as all the secondary indexes.\n */\n// TODO: this should probably move to db/\nexport async function diffCommits(\n  oldCommit: Commit<Meta>,\n  newCommit: Commit<Meta>,\n  read: Read,\n  diffConfig: DiffComputationConfig,\n  formatVersion: FormatVersion,\n): Promise<DiffsMap> {\n  const diffsMap = new DiffsMap();\n  if (!diffConfig.shouldComputeDiffs()) {\n    return diffsMap;\n  }\n\n  const oldMap = new BTreeRead(read, formatVersion, oldCommit.valueHash);\n  const newMap = new BTreeRead(read, formatVersion, newCommit.valueHash);\n  const valueDiff = await btreeDiff(oldMap, newMap);\n  diffsMap.set('', valueDiff);\n\n  await addDiffsForIndexes(\n    oldCommit,\n    newCommit,\n    read,\n    diffsMap,\n    diffConfig,\n    formatVersion,\n  );\n\n  return diffsMap;\n}\n\nexport async function addDiffsForIndexes(\n  mainCommit: Commit<Meta>,\n  syncCommit: Commit<Meta>,\n  read: Read,\n  diffsMap: DiffsMap,\n  diffConfig: DiffComputationConfig,\n  formatVersion: FormatVersion,\n) {\n  const oldIndexes = readIndexesForRead(mainCommit, read, formatVersion);\n  const newIndexes = readIndexesForRead(syncCommit, read, formatVersion);\n\n  for (const [oldIndexName, oldIndex] of oldIndexes) {\n    if (!diffConfig.shouldComputeDiffsForIndex(oldIndexName)) {\n      continue;\n    }\n\n    const newIndex = newIndexes.get(oldIndexName);\n    if (newIndex !== undefined) {\n      assert(\n        newIndex !== oldIndex,\n        'Expected newIndex to differ from oldIndex',\n      );\n      const diffs = await btreeDiff(oldIndex.map, newIndex.map);\n      newIndexes.delete(oldIndexName);\n      diffsMap.set(oldIndexName, diffs);\n    } else {\n      // old index name is not in the new indexes. All entries removed!\n      const diffs = await allEntriesAsDiff(oldIndex.map, 'del');\n      diffsMap.set(oldIndexName, diffs);\n    }\n  }\n\n  for (const [newIndexName, newIndex] of newIndexes) {\n    if (!diffConfig.shouldComputeDiffsForIndex(newIndexName)) {\n      continue;\n    }\n    // new index name is not in the old indexes. All keys added!\n    const diffs = await allEntriesAsDiff(newIndex.map, 'add');\n    diffsMap.set(newIndexName, diffs);\n  }\n}\n"],"mappings":";;;;;;;;;;AA0BA,IAAa,WAAb,cAA8B,IAA0B;CACtD,IAAa,KAAa,OAA2B;AACnD,MAAI,MAAM,WAAW,EACnB,QAAO;AAET,SAAO,MAAM,IAAI,KAAK,MAAM;;;;;;;AAQhC,eAAsB,KACpB,SACA,SACA,MACA,YACA,eACmB;CACnB,MAAM,CAAC,WAAW,aAAa,MAAM,QAAQ,IAAI,CAC/C,eAAe,SAAS,KAAK,EAC7B,eAAe,SAAS,KAAK,CAC9B,CAAC;AAEF,QAAO,YAAY,WAAW,WAAW,MAAM,YAAY,cAAc;;;;;;AAQ3E,eAAsB,YACpB,WACA,WACA,MACA,YACA,eACmB;CACnB,MAAM,WAAW,IAAI,UAAU;AAC/B,KAAI,CAAC,WAAW,oBAAoB,CAClC,QAAO;CAKT,MAAM,YAAY,MAAM,OAFT,IAAI,UAAU,MAAM,eAAe,UAAU,UAAU,EACvD,IAAI,UAAU,MAAM,eAAe,UAAU,UAAU,CACrB;AACjD,UAAS,IAAI,IAAI,UAAU;AAE3B,OAAM,mBACJ,WACA,WACA,MACA,UACA,YACA,cACD;AAED,QAAO;;AAGT,eAAsB,mBACpB,YACA,YACA,MACA,UACA,YACA,eACA;CACA,MAAM,aAAa,mBAAmB,YAAY,MAAM,cAAc;CACtE,MAAM,aAAa,mBAAmB,YAAY,MAAM,cAAc;AAEtE,MAAK,MAAM,CAAC,cAAc,aAAa,YAAY;AACjD,MAAI,CAAC,WAAW,2BAA2B,aAAa,CACtD;EAGF,MAAM,WAAW,WAAW,IAAI,aAAa;AAC7C,MAAI,aAAa,KAAA,GAAW;AAC1B,UACE,aAAa,UACb,4CACD;GACD,MAAM,QAAQ,MAAM,OAAU,SAAS,KAAK,SAAS,IAAI;AACzD,cAAW,OAAO,aAAa;AAC/B,YAAS,IAAI,cAAc,MAAM;SAC5B;GAEL,MAAM,QAAQ,MAAM,iBAAiB,SAAS,KAAK,MAAM;AACzD,YAAS,IAAI,cAAc,MAAM;;;AAIrC,MAAK,MAAM,CAAC,cAAc,aAAa,YAAY;AACjD,MAAI,CAAC,WAAW,2BAA2B,aAAa,CACtD;EAGF,MAAM,QAAQ,MAAM,iBAAiB,SAAS,KAAK,MAAM;AACzD,WAAS,IAAI,cAAc,MAAM"}

package/out/replicache/src/sync/ids.js

@@ -1,9 +1,8 @@
-import "../../../shared/src/valita.js";
-import { string } from "@badrap/valita";
-const clientGroupIDSchema = string();
-const clientIDSchema = string();
-export {
-  clientGroupIDSchema,
-  clientIDSchema
-};
-//# sourceMappingURL=ids.js.map
+import { valita_exports } from "../../../shared/src/valita.js";
+//#region ../replicache/src/sync/ids.ts
+var clientGroupIDSchema = valita_exports.string();
+var clientIDSchema = valita_exports.string();
+//#endregion
+export { clientGroupIDSchema, clientIDSchema };
+
+//# sourceMappingURL=ids.js.map

package/out/replicache/src/sync/ids.js.map

@@ -1 +1 @@
-{"version":3,"file":"ids.js","sources":["../../../../../replicache/src/sync/ids.ts"],"sourcesContent":["import * as valita from '../../../shared/src/valita.ts';\n\n/**\n * The ID describing a group of clients. All clients in the same group share a\n * persistent storage (IDB).\n */\nexport type ClientGroupID = string;\n\nexport const clientGroupIDSchema: valita.Type<ClientGroupID> = valita.string();\n\n/**\n * The ID describing a client.\n */\nexport type ClientID = string;\n\nexport const clientIDSchema: valita.Type<ClientID> = valita.string();\n"],"names":["valita.string"],"mappings":";;AAQO,MAAM,sBAAkDA,OAAO;AAO/D,MAAM,iBAAwCA,OAAO;"}
+{"version":3,"file":"ids.js","names":[],"sources":["../../../../../replicache/src/sync/ids.ts"],"sourcesContent":["import * as valita from '../../../shared/src/valita.ts';\n\n/**\n * The ID describing a group of clients. All clients in the same group share a\n * persistent storage (IDB).\n */\nexport type ClientGroupID = string;\n\nexport const clientGroupIDSchema: valita.Type<ClientGroupID> = valita.string();\n\n/**\n * The ID describing a client.\n */\nexport type ClientID = string;\n\nexport const clientIDSchema: valita.Type<ClientID> = valita.string();\n"],"mappings":";;AAQA,IAAa,sBAAkD,eAAO,QAAQ;AAO9E,IAAa,iBAAwC,eAAO,QAAQ"}

package/out/replicache/src/sync/patch.js

@@ -1,49 +1,38 @@
 import { assertObject } from "../../../shared/src/asserts.js";
 import { deepFreeze } from "../frozen-json.js";
+//#region ../replicache/src/sync/patch.ts
 async function apply(lc, dbWrite, patch) {
-  for (const p of patch) {
-    switch (p.op) {
-      case "put": {
-        const frozen = deepFreeze(p.value);
-        await dbWrite.put(lc, p.key, frozen);
-        break;
-      }
-      case "update": {
-        const existing = await dbWrite.get(p.key);
-        const entries = [];
-        const addToEntries = (toAdd) => {
-          for (const [key, value] of Object.entries(toAdd)) {
-            if (!p.constrain || p.constrain.length === 0 || p.constrain.indexOf(key) > -1) {
-              entries.push([key, value]);
-            }
-          }
-        };
-        if (existing !== void 0) {
-          assertObject(existing);
-          addToEntries(existing);
-        }
-        if (p.merge) {
-          addToEntries(p.merge);
-        }
-        const frozen = deepFreeze(Object.fromEntries(entries));
-        await dbWrite.put(lc, p.key, frozen);
-        break;
-      }
-      case "del": {
-        const existing = await dbWrite.get(p.key);
-        if (existing === void 0) {
-          continue;
-        }
-        await dbWrite.del(lc, p.key);
-        break;
-      }
-      case "clear":
-        await dbWrite.clear();
-        break;
-    }
-  }
+	for (const p of patch) switch (p.op) {
+		case "put": {
+			const frozen = deepFreeze(p.value);
+			await dbWrite.put(lc, p.key, frozen);
+			break;
+		}
+		case "update": {
+			const existing = await dbWrite.get(p.key);
+			const entries = [];
+			const addToEntries = (toAdd) => {
+				for (const [key, value] of Object.entries(toAdd)) if (!p.constrain || p.constrain.length === 0 || p.constrain.indexOf(key) > -1) entries.push([key, value]);
+			};
+			if (existing !== void 0) {
+				assertObject(existing);
+				addToEntries(existing);
+			}
+			if (p.merge) addToEntries(p.merge);
+			const frozen = deepFreeze(Object.fromEntries(entries));
+			await dbWrite.put(lc, p.key, frozen);
+			break;
+		}
+		case "del":
+			if (await dbWrite.get(p.key) === void 0) continue;
+			await dbWrite.del(lc, p.key);
+			break;
+		case "clear":
+			await dbWrite.clear();
+			break;
+	}
 }
-export {
-  apply
-};
-//# sourceMappingURL=patch.js.map
+//#endregion
+export { apply };
+
+//# sourceMappingURL=patch.js.map

package/out/replicache/src/sync/patch.js.map

@@ -1 +1 @@
-{"version":3,"file":"patch.js","sources":["../../../../../replicache/src/sync/patch.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assertObject} from '../../../shared/src/asserts.ts';\nimport type {\n  ReadonlyJSONObject,\n  ReadonlyJSONValue,\n} from '../../../shared/src/json.ts';\nimport type {Write} from '../db/write.ts';\nimport {\n  type FrozenJSONObject,\n  type FrozenJSONValue,\n  deepFreeze,\n} from '../frozen-json.ts';\nimport type {PatchOperationInternal} from '../patch-operation.ts';\nimport type {DiffOperation} from '../btree/node.ts';\n\nexport type Diff =\n  | DiffOperation<string>\n  | {\n      op: 'clear';\n    };\n\nexport async function apply(\n  lc: LogContext,\n  dbWrite: Write,\n  patch: readonly PatchOperationInternal[],\n): Promise<void> {\n  for (const p of patch) {\n    switch (p.op) {\n      case 'put': {\n        const frozen = deepFreeze(p.value);\n        await dbWrite.put(lc, p.key, frozen);\n        break;\n      }\n      case 'update': {\n        const existing = await dbWrite.get(p.key);\n        const entries: [\n          string,\n          FrozenJSONValue | ReadonlyJSONValue | undefined,\n        ][] = [];\n        const addToEntries = (toAdd: FrozenJSONObject | ReadonlyJSONObject) => {\n          for (const [key, value] of Object.entries(toAdd)) {\n            if (\n              !p.constrain ||\n              p.constrain.length === 0 ||\n              p.constrain.indexOf(key) > -1\n            ) {\n              entries.push([key, value]);\n            }\n          }\n        };\n        if (existing !== undefined) {\n          assertObject(existing);\n          addToEntries(existing);\n        }\n        if (p.merge) {\n          addToEntries(p.merge);\n        }\n        const frozen = deepFreeze(Object.fromEntries(entries));\n        await dbWrite.put(lc, p.key, frozen);\n\n        break;\n      }\n      case 'del': {\n        const existing = await dbWrite.get(p.key);\n        if (existing === undefined) {\n          continue;\n        }\n        await dbWrite.del(lc, p.key);\n        break;\n      }\n      case 'clear':\n        await dbWrite.clear();\n        break;\n    }\n  }\n}\n"],"names":[],"mappings":";;AAqBA,eAAsB,MACpB,IACA,SACA,OACe;AACf,aAAW,KAAK,OAAO;AACrB,YAAQ,EAAE,IAAA;AAAA,MACR,KAAK,OAAO;AACV,cAAM,SAAS,WAAW,EAAE,KAAK;AACjC,cAAM,QAAQ,IAAI,IAAI,EAAE,KAAK,MAAM;AACnC;AAAA,MACF;AAAA,MACA,KAAK,UAAU;AACb,cAAM,WAAW,MAAM,QAAQ,IAAI,EAAE,GAAG;AACxC,cAAM,UAGA,CAAA;AACN,cAAM,eAAe,CAAC,UAAiD;AACrE,qBAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AAChD,gBACE,CAAC,EAAE,aACH,EAAE,UAAU,WAAW,KACvB,EAAE,UAAU,QAAQ,GAAG,IAAI,IAC3B;AACA,sBAAQ,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,YAC3B;AAAA,UACF;AAAA,QACF;AACA,YAAI,aAAa,QAAW;AAC1B,uBAAa,QAAQ;AACrB,uBAAa,QAAQ;AAAA,QACvB;AACA,YAAI,EAAE,OAAO;AACX,uBAAa,EAAE,KAAK;AAAA,QACtB;AACA,cAAM,SAAS,WAAW,OAAO,YAAY,OAAO,CAAC;AACrD,cAAM,QAAQ,IAAI,IAAI,EAAE,KAAK,MAAM;AAEnC;AAAA,MACF;AAAA,MACA,KAAK,OAAO;AACV,cAAM,WAAW,MAAM,QAAQ,IAAI,EAAE,GAAG;AACxC,YAAI,aAAa,QAAW;AAC1B;AAAA,QACF;AACA,cAAM,QAAQ,IAAI,IAAI,EAAE,GAAG;AAC3B;AAAA,MACF;AAAA,MACA,KAAK;AACH,cAAM,QAAQ,MAAA;AACd;AAAA,IAAA;AAAA,EAEN;AACF;"}
+{"version":3,"file":"patch.js","names":[],"sources":["../../../../../replicache/src/sync/patch.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assertObject} from '../../../shared/src/asserts.ts';\nimport type {\n  ReadonlyJSONObject,\n  ReadonlyJSONValue,\n} from '../../../shared/src/json.ts';\nimport type {Write} from '../db/write.ts';\nimport {\n  type FrozenJSONObject,\n  type FrozenJSONValue,\n  deepFreeze,\n} from '../frozen-json.ts';\nimport type {PatchOperationInternal} from '../patch-operation.ts';\nimport type {DiffOperation} from '../btree/node.ts';\n\nexport type Diff =\n  | DiffOperation<string>\n  | {\n      op: 'clear';\n    };\n\nexport async function apply(\n  lc: LogContext,\n  dbWrite: Write,\n  patch: readonly PatchOperationInternal[],\n): Promise<void> {\n  for (const p of patch) {\n    switch (p.op) {\n      case 'put': {\n        const frozen = deepFreeze(p.value);\n        await dbWrite.put(lc, p.key, frozen);\n        break;\n      }\n      case 'update': {\n        const existing = await dbWrite.get(p.key);\n        const entries: [\n          string,\n          FrozenJSONValue | ReadonlyJSONValue | undefined,\n        ][] = [];\n        const addToEntries = (toAdd: FrozenJSONObject | ReadonlyJSONObject) => {\n          for (const [key, value] of Object.entries(toAdd)) {\n            if (\n              !p.constrain ||\n              p.constrain.length === 0 ||\n              p.constrain.indexOf(key) > -1\n            ) {\n              entries.push([key, value]);\n            }\n          }\n        };\n        if (existing !== undefined) {\n          assertObject(existing);\n          addToEntries(existing);\n        }\n        if (p.merge) {\n          addToEntries(p.merge);\n        }\n        const frozen = deepFreeze(Object.fromEntries(entries));\n        await dbWrite.put(lc, p.key, frozen);\n\n        break;\n      }\n      case 'del': {\n        const existing = await dbWrite.get(p.key);\n        if (existing === undefined) {\n          continue;\n        }\n        await dbWrite.del(lc, p.key);\n        break;\n      }\n      case 'clear':\n        await dbWrite.clear();\n        break;\n    }\n  }\n}\n"],"mappings":";;;AAqBA,eAAsB,MACpB,IACA,SACA,OACe;AACf,MAAK,MAAM,KAAK,MACd,SAAQ,EAAE,IAAV;EACE,KAAK,OAAO;GACV,MAAM,SAAS,WAAW,EAAE,MAAM;AAClC,SAAM,QAAQ,IAAI,IAAI,EAAE,KAAK,OAAO;AACpC;;EAEF,KAAK,UAAU;GACb,MAAM,WAAW,MAAM,QAAQ,IAAI,EAAE,IAAI;GACzC,MAAM,UAGA,EAAE;GACR,MAAM,gBAAgB,UAAiD;AACrE,SAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,CAC9C,KACE,CAAC,EAAE,aACH,EAAE,UAAU,WAAW,KACvB,EAAE,UAAU,QAAQ,IAAI,GAAG,GAE3B,SAAQ,KAAK,CAAC,KAAK,MAAM,CAAC;;AAIhC,OAAI,aAAa,KAAA,GAAW;AAC1B,iBAAa,SAAS;AACtB,iBAAa,SAAS;;AAExB,OAAI,EAAE,MACJ,cAAa,EAAE,MAAM;GAEvB,MAAM,SAAS,WAAW,OAAO,YAAY,QAAQ,CAAC;AACtD,SAAM,QAAQ,IAAI,IAAI,EAAE,KAAK,OAAO;AAEpC;;EAEF,KAAK;AAEH,OADiB,MAAM,QAAQ,IAAI,EAAE,IAAI,KACxB,KAAA,EACf;AAEF,SAAM,QAAQ,IAAI,IAAI,EAAE,IAAI;AAC5B;EAEF,KAAK;AACH,SAAM,QAAQ,OAAO;AACrB"}

package/out/replicache/src/sync/pull-error.js

@@ -1,16 +1,16 @@
-class PullError extends Error {
-  name = "PullError";
-  // causedBy is used instead of cause, because while cause has been proposed as a
-  // JavaScript language standard for this purpose (see
-  // https://github.com/tc39/proposal-error-cause) current browser behavior is
-  // inconsistent.
-  causedBy;
-  constructor(causedBy) {
-    super("Failed to pull");
-    this.causedBy = causedBy;
-  }
-}
-export {
-  PullError
+//#region ../replicache/src/sync/pull-error.ts
+/**
+* This error is thrown when the puller fails for any reason.
+*/
+var PullError = class extends Error {
+	name = "PullError";
+	causedBy;
+	constructor(causedBy) {
+		super("Failed to pull");
+		this.causedBy = causedBy;
+	}
 };
-//# sourceMappingURL=pull-error.js.map
+//#endregion
+export { PullError };
+
+//# sourceMappingURL=pull-error.js.map

package/out/replicache/src/sync/pull-error.js.map

@@ -1 +1 @@
-{"version":3,"file":"pull-error.js","sources":["../../../../../replicache/src/sync/pull-error.ts"],"sourcesContent":["/**\n * This error is thrown when the puller fails for any reason.\n */\n\nexport class PullError extends Error {\n  name = 'PullError';\n  // causedBy is used instead of cause, because while cause has been proposed as a\n  // JavaScript language standard for this purpose (see\n  // https://github.com/tc39/proposal-error-cause) current browser behavior is\n  // inconsistent.\n  causedBy?: Error | undefined;\n  constructor(causedBy?: Error) {\n    super('Failed to pull');\n    this.causedBy = causedBy;\n  }\n}\n"],"names":[],"mappings":"AAIO,MAAM,kBAAkB,MAAM;AAAA,EACnC,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,EAKP;AAAA,EACA,YAAY,UAAkB;AAC5B,UAAM,gBAAgB;AACtB,SAAK,WAAW;AAAA,EAClB;AACF;"}
+{"version":3,"file":"pull-error.js","names":[],"sources":["../../../../../replicache/src/sync/pull-error.ts"],"sourcesContent":["/**\n * This error is thrown when the puller fails for any reason.\n */\n\nexport class PullError extends Error {\n  name = 'PullError';\n  // causedBy is used instead of cause, because while cause has been proposed as a\n  // JavaScript language standard for this purpose (see\n  // https://github.com/tc39/proposal-error-cause) current browser behavior is\n  // inconsistent.\n  causedBy?: Error | undefined;\n  constructor(causedBy?: Error) {\n    super('Failed to pull');\n    this.causedBy = causedBy;\n  }\n}\n"],"mappings":";;;;AAIA,IAAa,YAAb,cAA+B,MAAM;CACnC,OAAO;CAKP;CACA,YAAY,UAAkB;AAC5B,QAAM,iBAAiB;AACvB,OAAK,WAAW"}