@rocicorp/zero 1.6.0-canary.12 → 1.6.0-canary.13

package/out/replicache/src/scan-iterator.js.map

@@ -1 +1 @@
-{"version":3,"file":"scan-iterator.js","names":["#iter","#options","#dbDelegateOptions","#onLimitKey","#newIterator","#it"],"sources":["../../../../replicache/src/scan-iterator.ts"],"sourcesContent":["import {greaterThan} from 'compare-utf8';\nimport type {ReadonlyJSONValue} from '../../shared/src/json.ts';\nimport {asyncIterableToArray} from './async-iterable-to-array.ts';\nimport {type IndexKey, encodeIndexScanKey} from './db/index.ts';\nimport type {IterableUnion} from './iterable-union.ts';\nimport {\n  type KeyTypeForScanOptions,\n  type ScanIndexOptions,\n  type ScanOptionIndexedStartKey,\n  type ScanOptions,\n  isScanIndexOptions,\n  normalizeScanOptionIndexedStartKey,\n} from './scan-options.ts';\nimport {type Closed, throwIfClosed} from './transaction-closed-error.ts';\nimport {type EntryForOptions, fromKeyForNonIndexScan} from './transactions.ts';\n\ntype ScanKey = string | IndexKey;\n\ntype ToValue<Options extends ScanOptions, Value> = (\n  entry: EntryForOptions<Options, ReadonlyJSONValue>,\n) => Value;\n\n/**\n * This class is used for the results of {@link ReadTransaction.scan | scan}. It\n * implements `AsyncIterable<JSONValue>` which allows you to use it in a `for\n * await` loop. There are also methods to iterate over the {@link keys},\n * {@link entries} or {@link values}.\n */\nexport class ScanResultImpl<\n  Options extends ScanOptions,\n  V,\n> implements ScanResult<KeyTypeForScanOptions<Options>, V> {\n  readonly #iter: AsyncIterable<EntryForOptions<Options, ReadonlyJSONValue>>;\n  readonly #options: Options;\n  readonly #dbDelegateOptions: Closed;\n  readonly #onLimitKey: (inclusiveLimitKey: string) => void;\n\n  constructor(\n    iter: AsyncIterable<EntryForOptions<Options, ReadonlyJSONValue>>,\n    options: Options,\n    dbDelegateOptions: Closed,\n    onLimitKey: (inclusiveLimitKey: string) => void,\n  ) {\n    this.#iter = iter;\n    this.#options = options;\n    this.#dbDelegateOptions = dbDelegateOptions;\n    this.#onLimitKey = onLimitKey;\n  }\n\n  /** The default AsyncIterable. This is the same as {@link values}. */\n  [Symbol.asyncIterator](): AsyncIterableIteratorToArray<V> {\n    return this.values();\n  }\n\n  /** Async iterator over the values of the {@link ReadTransaction.scan | scan} call. */\n  values(): AsyncIterableIteratorToArray<V> {\n    return new AsyncIterableIteratorToArrayWrapperImpl(\n      this.#newIterator(e => e[1] as V),\n    );\n  }\n\n  /**\n   * Async iterator over the keys of the {@link ReadTransaction.scan | scan}\n   * call. If the {@link ReadTransaction.scan | scan} is over an index the key\n   * is a tuple of `[secondaryKey: string, primaryKey]`\n   */\n  keys(): AsyncIterableIteratorToArray<KeyTypeForScanOptions<Options>> {\n    type K = KeyTypeForScanOptions<Options>;\n    return new AsyncIterableIteratorToArrayWrapperImpl<K>(\n      this.#newIterator<K>(e => e[0] as K),\n    );\n  }\n\n  /**\n   * Async iterator over the entries of the {@link ReadTransaction.scan | scan}\n   * call. An entry is a tuple of key values. If the\n   * {@link ReadTransaction.scan | scan} is over an index the key is a tuple of\n   * `[secondaryKey: string, primaryKey]`\n   */\n  entries(): AsyncIterableIteratorToArray<\n    readonly [KeyTypeForScanOptions<Options>, V]\n  > {\n    type Key = KeyTypeForScanOptions<Options>;\n    type Entry = readonly [Key, V];\n    return new AsyncIterableIteratorToArrayWrapperImpl(\n      this.#newIterator<Entry>(e => [e[0] as Key, e[1] as V]),\n    );\n  }\n\n  /** Returns all the values as an array. Same as `values().toArray()` */\n  toArray(): Promise<V[]> {\n    return this.values().toArray();\n  }\n\n  #newIterator<T>(toValue: ToValue<Options, T>): AsyncIterableIterator<T> {\n    return scanIterator(\n      toValue,\n      this.#iter,\n      this.#options,\n      this.#dbDelegateOptions,\n      this.#onLimitKey,\n    );\n  }\n}\n\nexport interface ScanResult<K extends ScanKey, V> extends AsyncIterable<V> {\n  /** The default AsyncIterable. This is the same as {@link values}. */\n  [Symbol.asyncIterator](): AsyncIterableIteratorToArray<V>;\n\n  /** Async iterator over the values of the {@link ReadTransaction.scan | scan} call. */\n  values(): AsyncIterableIteratorToArray<V>;\n\n  /**\n   * Async iterator over the keys of the {@link ReadTransaction.scan | scan}\n   * call. If the {@link ReadTransaction.scan | scan} is over an index the key\n   * is a tuple of `[secondaryKey: string, primaryKey]`\n   */\n  keys(): AsyncIterableIteratorToArray<K>;\n\n  /**\n   * Async iterator over the entries of the {@link ReadTransaction.scan | scan}\n   * call. An entry is a tuple of key values. If the\n   * {@link ReadTransaction.scan | scan} is over an index the key is a tuple of\n   * `[secondaryKey: string, primaryKey]`\n   */\n  entries(): AsyncIterableIteratorToArray<readonly [K, V]>;\n\n  /** Returns all the values as an array. Same as `values().toArray()` */\n  toArray(): Promise<V[]>;\n}\n\n/**\n * An interface that adds a {@link toArray} method to `AsyncIterableIterator`.\n *\n * Usage:\n *\n * ```ts\n * const keys: string[] = await rep.scan().keys().toArray();\n * ```\n */\nexport interface AsyncIterableIteratorToArray<\n  V,\n> extends AsyncIterableIterator<V> {\n  toArray(): Promise<V[]>;\n}\n\nclass AsyncIterableIteratorToArrayWrapperImpl<\n  V,\n> implements AsyncIterableIterator<V> {\n  readonly #it: AsyncIterableIterator<V>;\n\n  constructor(it: AsyncIterableIterator<V>) {\n    this.#it = it;\n  }\n\n  next() {\n    return this.#it.next();\n  }\n\n  [Symbol.asyncIterator](): AsyncIterableIterator<V> {\n    return this.#it[Symbol.asyncIterator]();\n  }\n\n  toArray(): Promise<V[]> {\n    return asyncIterableToArray(this.#it);\n  }\n}\n\nasync function* scanIterator<Options extends ScanOptions, Value>(\n  toValue: ToValue<Options, Value>,\n  iter: AsyncIterable<EntryForOptions<Options, ReadonlyJSONValue>>,\n  options: Options,\n  closed: Closed,\n  onLimitKey: (inclusiveLimitKey: string) => void,\n): AsyncIterableIterator<Value> {\n  throwIfClosed(closed);\n\n  let {limit = Infinity} = options;\n  const {prefix = ''} = options;\n  let exclusive = options.start?.exclusive;\n\n  const isIndexScan = isScanIndexOptions(options);\n\n  // iter has already been moved to the first entry\n  for await (const entry of iter) {\n    const key = entry[0];\n    const keyToMatch: string = isIndexScan ? key[0] : (key as string);\n    if (!keyToMatch.startsWith(prefix)) {\n      return;\n    }\n\n    if (exclusive) {\n      exclusive = true;\n      if (isIndexScan) {\n        // oxlint-disable-next-line @typescript-eslint/no-non-null-assertion\n        if (shouldSkipIndexScan(key as IndexKey, options.start!.key)) {\n          continue;\n        }\n      } else {\n        // oxlint-disable-next-line @typescript-eslint/no-non-null-assertion\n        if (shouldSkipNonIndexScan(key as string, options.start!.key)) {\n          continue;\n        }\n      }\n    }\n\n    yield toValue(entry);\n\n    if (--limit === 0) {\n      // We do not do the limit optimization for index scans in subscriptions.\n      if (!isIndexScan) {\n        onLimitKey(key as string);\n      }\n      return;\n    }\n  }\n}\n\nfunction shouldSkipIndexScan(\n  key: IndexKey,\n  startKey: ScanOptionIndexedStartKey,\n): boolean {\n  const [secondaryStartKey, primaryStartKey] =\n    normalizeScanOptionIndexedStartKey(startKey);\n  const [secondaryKey, primaryKey] = normalizeScanOptionIndexedStartKey(key);\n  if (secondaryKey !== secondaryStartKey) {\n    return false;\n  }\n  if (primaryStartKey === undefined) {\n    return true;\n  }\n  return primaryKey === primaryStartKey;\n}\n\nfunction shouldSkipNonIndexScan(key: string, startKey: string): boolean {\n  return key === startKey;\n}\n\nexport type Entry<V> = readonly [key: string, value: V];\n\n/**\n * This is called when doing a {@link ReadTransaction.scan | scan} without an\n * `indexName`.\n *\n * @param fromKey The `fromKey` is computed by `scan` and is the key of the\n * first entry to return in the iterator. It is based on `prefix` and\n * `start.key` of the {@link ScanNoIndexOptions}.\n */\nexport type GetScanIterator = (\n  fromKey: string,\n) => IterableUnion<Entry<ReadonlyJSONValue>>;\n\n/**\n * When using {@link makeScanResult} this is the type used for the function called when doing a {@link ReadTransaction.scan | scan} with an\n * `indexName`.\n *\n * @param indexName The name of the index we are scanning over.\n * @param fromSecondaryKey The `fromSecondaryKey` is computed by `scan` and is\n * the secondary key of the first entry to return in the iterator. It is based\n * on `prefix` and `start.key` of the {@link ScanIndexOptions}.\n * @param fromPrimaryKey The `fromPrimaryKey` is computed by `scan` and is the\n * primary key of the first entry to return in the iterator. It is based on\n * `prefix` and `start.key` of the {@link ScanIndexOptions}.\n */\nexport type GetIndexScanIterator = (\n  indexName: string,\n  fromSecondaryKey: string,\n  fromPrimaryKey: string | undefined,\n) => IterableUnion<readonly [key: IndexKey, value: ReadonlyJSONValue]>;\n\n/**\n * A helper function that makes it easier to implement {@link ReadTransaction.scan}\n * with a custom backend.\n *\n * If you are implementing a custom backend and have an in memory pending async\n * iterable we provide two helper functions to make it easier to merge these\n * together. {@link mergeAsyncIterables} and {@link filterAsyncIterable}.\n *\n * For example:\n *\n * ```ts\n * const scanResult = makeScanResult(\n *   options,\n *   options.indexName\n *     ? () => {\n *         throw Error('not implemented');\n *       }\n *     : fromKey => {\n *         const persisted: AsyncIterable<Entry<ReadonlyJSONValue>> = ...;\n *         const pending: AsyncIterable<Entry<ReadonlyJSONValue | undefined>> = ...;\n *         const iter = await mergeAsyncIterables(persisted, pending);\n *         const filteredIter = await filterAsyncIterable(\n *           iter,\n *           entry => entry[1] !== undefined,\n *         );\n *         return filteredIter;\n *       },\n * );\n * ```\n */\nexport function makeScanResult<Options extends ScanOptions>(\n  options: Options,\n  getScanIterator: Options extends ScanIndexOptions\n    ? GetIndexScanIterator\n    : GetScanIterator,\n): ScanResult<KeyTypeForScanOptions<Options>, ReadonlyJSONValue> {\n  type AsyncIter = AsyncIterable<EntryForOptions<Options, ReadonlyJSONValue>>;\n\n  if (isScanIndexOptions(options)) {\n    const [fromSecondaryKey, fromPrimaryKey] = fromKeyForIndexScan(options);\n    return new ScanResultImpl(\n      (getScanIterator as GetIndexScanIterator)(\n        options.indexName,\n        fromSecondaryKey,\n        fromPrimaryKey,\n      ) as AsyncIter,\n      options,\n      {closed: false},\n      _ => {\n        // noop\n      },\n    );\n  }\n  const fromKey = fromKeyForNonIndexScan(options);\n  return new ScanResultImpl(\n    (getScanIterator as GetScanIterator)(fromKey) as AsyncIter,\n    options,\n    {closed: false},\n    _ => {\n      // noop\n    },\n  );\n}\n\nexport function fromKeyForIndexScan(\n  options: ScanIndexOptions,\n): readonly [secondary: string, primary?: string | undefined] {\n  const {prefix, start} = options;\n  const prefixNormalized: [secondary: string, primary?: string | undefined] = [\n    prefix ?? '',\n    undefined,\n  ];\n\n  if (!start) {\n    return prefixNormalized;\n  }\n\n  const startKeyNormalized = normalizeScanOptionIndexedStartKey(start.key);\n  if (greaterThan(startKeyNormalized[0], prefixNormalized[0])) {\n    return startKeyNormalized;\n  }\n  if (\n    startKeyNormalized[0] === prefixNormalized[0] &&\n    startKeyNormalized[1] !== undefined\n  ) {\n    return startKeyNormalized;\n  }\n\n  return prefixNormalized;\n}\n\nexport function fromKeyForIndexScanInternal(options: ScanIndexOptions): string {\n  const {prefix, start} = options;\n  let prefix2 = '';\n  if (prefix !== undefined) {\n    prefix2 = encodeIndexScanKey(prefix, undefined);\n  }\n  if (!start) {\n    return prefix2;\n  }\n\n  const {key} = start;\n  const [secondary, primary] = normalizeScanOptionIndexedStartKey(key);\n  const startKey = encodeIndexScanKey(secondary, primary);\n\n  if (greaterThan(startKey, prefix2)) {\n    return startKey;\n  }\n\n  return prefix2;\n}\n"],"mappings":";;;;;;;;;;;;;AA4BA,IAAa,iBAAb,MAG2D;CACzD;CACA;CACA;CACA;CAEA,YACE,MACA,SACA,mBACA,YACA;EACA,KAAKA,QAAQ;EACb,KAAKC,WAAW;EAChB,KAAKC,qBAAqB;EAC1B,KAAKC,cAAc;CACrB;;CAGA,CAAC,OAAO,iBAAkD;EACxD,OAAO,KAAK,OAAO;CACrB;;CAGA,SAA0C;EACxC,OAAO,IAAI,wCACT,KAAKC,cAAa,MAAK,EAAE,EAAO,CAClC;CACF;;;;;;CAOA,OAAqE;EAEnE,OAAO,IAAI,wCACT,KAAKA,cAAgB,MAAK,EAAE,EAAO,CACrC;CACF;;;;;;;CAQA,UAEE;EAGA,OAAO,IAAI,wCACT,KAAKA,cAAoB,MAAK,CAAC,EAAE,IAAW,EAAE,EAAO,CAAC,CACxD;CACF;;CAGA,UAAwB;EACtB,OAAO,KAAK,OAAO,EAAE,QAAQ;CAC/B;CAEA,aAAgB,SAAwD;EACtE,OAAO,aACL,SACA,KAAKJ,OACL,KAAKC,UACL,KAAKC,oBACL,KAAKC,WACP;CACF;AACF;AA2CA,IAAM,0CAAN,MAEsC;CACpC;CAEA,YAAY,IAA8B;EACxC,KAAKE,MAAM;CACb;CAEA,OAAO;EACL,OAAO,KAAKA,IAAI,KAAK;CACvB;CAEA,CAAC,OAAO,iBAA2C;EACjD,OAAO,KAAKA,IAAI,OAAO,eAAe;CACxC;CAEA,UAAwB;EACtB,OAAO,qBAAqB,KAAKA,GAAG;CACtC;AACF;AAEA,gBAAgB,aACd,SACA,MACA,SACA,QACA,YAC8B;CAC9B,cAAc,MAAM;CAEpB,IAAI,EAAC,QAAQ,aAAY;CACzB,MAAM,EAAC,SAAS,OAAM;CACtB,IAAI,YAAY,QAAQ,OAAO;CAE/B,MAAM,cAAc,mBAAmB,OAAO;CAG9C,WAAW,MAAM,SAAS,MAAM;EAC9B,MAAM,MAAM,MAAM;EAElB,IAAI,EADuB,cAAc,IAAI,KAAM,KACnC,WAAW,MAAM,GAC/B;EAGF,IAAI,WAAW;GACb,YAAY;GACZ,IAAI;QAEE,oBAAoB,KAAiB,QAAQ,MAAO,GAAG,GACzD;GAAA,OAIF,IAAI,uBAAuB,KAAe,QAAQ,MAAO,GAAG,GAC1D;EAGN;EAEA,MAAM,QAAQ,KAAK;EAEnB,IAAI,EAAE,UAAU,GAAG;GAEjB,IAAI,CAAC,aACH,WAAW,GAAa;GAE1B;EACF;CACF;AACF;AAEA,SAAS,oBACP,KACA,UACS;CACT,MAAM,CAAC,mBAAmB,mBACxB,mCAAmC,QAAQ;CAC7C,MAAM,CAAC,cAAc,cAAc,mCAAmC,GAAG;CACzE,IAAI,iBAAiB,mBACnB,OAAO;CAET,IAAI,oBAAoB,KAAA,GACtB,OAAO;CAET,OAAO,eAAe;AACxB;AAEA,SAAS,uBAAuB,KAAa,UAA2B;CACtE,OAAO,QAAQ;AACjB;AA6HA,SAAgB,4BAA4B,SAAmC;CAC7E,MAAM,EAAC,QAAQ,UAAS;CACxB,IAAI,UAAU;CACd,IAAI,WAAW,KAAA,GACb,UAAU,mBAAmB,QAAQ,KAAA,CAAS;CAEhD,IAAI,CAAC,OACH,OAAO;CAGT,MAAM,EAAC,QAAO;CACd,MAAM,CAAC,WAAW,WAAW,mCAAmC,GAAG;CACnE,MAAM,WAAW,mBAAmB,WAAW,OAAO;CAEtD,IAAI,YAAY,UAAU,OAAO,GAC/B,OAAO;CAGT,OAAO;AACT"}
+{"version":3,"file":"scan-iterator.js","names":["#iter","#options","#dbDelegateOptions","#onLimitKey","#newIterator","#it"],"sources":["../../../../replicache/src/scan-iterator.ts"],"sourcesContent":["import {greaterThan} from 'compare-utf8';\nimport type {ReadonlyJSONValue} from '../../shared/src/json.ts';\nimport {asyncIterableToArray} from './async-iterable-to-array.ts';\nimport {type IndexKey, encodeIndexScanKey} from './db/index.ts';\nimport type {IterableUnion} from './iterable-union.ts';\nimport {\n  type KeyTypeForScanOptions,\n  type ScanIndexOptions,\n  type ScanOptionIndexedStartKey,\n  type ScanOptions,\n  isScanIndexOptions,\n  normalizeScanOptionIndexedStartKey,\n} from './scan-options.ts';\nimport {type Closed, throwIfClosed} from './transaction-closed-error.ts';\nimport {type EntryForOptions, fromKeyForNonIndexScan} from './transactions.ts';\n\ntype ScanKey = string | IndexKey;\n\ntype ToValue<Options extends ScanOptions, Value> = (\n  entry: EntryForOptions<Options, ReadonlyJSONValue>,\n) => Value;\n\n/**\n * This class is used for the results of {@link ReadTransaction.scan | scan}. It\n * implements `AsyncIterable<JSONValue>` which allows you to use it in a `for\n * await` loop. There are also methods to iterate over the {@link keys},\n * {@link entries} or {@link values}.\n */\nexport class ScanResultImpl<\n  Options extends ScanOptions,\n  V,\n> implements ScanResult<KeyTypeForScanOptions<Options>, V> {\n  readonly #iter: AsyncIterable<EntryForOptions<Options, ReadonlyJSONValue>>;\n  readonly #options: Options;\n  readonly #dbDelegateOptions: Closed;\n  readonly #onLimitKey: (inclusiveLimitKey: string) => void;\n\n  constructor(\n    iter: AsyncIterable<EntryForOptions<Options, ReadonlyJSONValue>>,\n    options: Options,\n    dbDelegateOptions: Closed,\n    onLimitKey: (inclusiveLimitKey: string) => void,\n  ) {\n    this.#iter = iter;\n    this.#options = options;\n    this.#dbDelegateOptions = dbDelegateOptions;\n    this.#onLimitKey = onLimitKey;\n  }\n\n  /** The default AsyncIterable. This is the same as {@link values}. */\n  [Symbol.asyncIterator](): AsyncIterableIteratorToArray<V> {\n    return this.values();\n  }\n\n  /** Async iterator over the values of the {@link ReadTransaction.scan | scan} call. */\n  values(): AsyncIterableIteratorToArray<V> {\n    return new AsyncIterableIteratorToArrayWrapperImpl(\n      this.#newIterator(e => e[1] as V),\n    );\n  }\n\n  /**\n   * Async iterator over the keys of the {@link ReadTransaction.scan | scan}\n   * call. If the {@link ReadTransaction.scan | scan} is over an index the key\n   * is a tuple of `[secondaryKey: string, primaryKey]`\n   */\n  keys(): AsyncIterableIteratorToArray<KeyTypeForScanOptions<Options>> {\n    type K = KeyTypeForScanOptions<Options>;\n    return new AsyncIterableIteratorToArrayWrapperImpl<K>(\n      this.#newIterator<K>(e => e[0] as K),\n    );\n  }\n\n  /**\n   * Async iterator over the entries of the {@link ReadTransaction.scan | scan}\n   * call. An entry is a tuple of key values. If the\n   * {@link ReadTransaction.scan | scan} is over an index the key is a tuple of\n   * `[secondaryKey: string, primaryKey]`\n   */\n  entries(): AsyncIterableIteratorToArray<\n    readonly [KeyTypeForScanOptions<Options>, V]\n  > {\n    type Key = KeyTypeForScanOptions<Options>;\n    type Entry = readonly [Key, V];\n    return new AsyncIterableIteratorToArrayWrapperImpl(\n      this.#newIterator<Entry>(e => [e[0] as Key, e[1] as V]),\n    );\n  }\n\n  /** Returns all the values as an array. Same as `values().toArray()` */\n  toArray(): Promise<V[]> {\n    return this.values().toArray();\n  }\n\n  #newIterator<T>(toValue: ToValue<Options, T>): AsyncIterableIterator<T> {\n    return scanIterator(\n      toValue,\n      this.#iter,\n      this.#options,\n      this.#dbDelegateOptions,\n      this.#onLimitKey,\n    );\n  }\n}\n\nexport interface ScanResult<K extends ScanKey, V> extends AsyncIterable<V> {\n  /** The default AsyncIterable. This is the same as {@link values}. */\n  [Symbol.asyncIterator](): AsyncIterableIteratorToArray<V>;\n\n  /** Async iterator over the values of the {@link ReadTransaction.scan | scan} call. */\n  values(): AsyncIterableIteratorToArray<V>;\n\n  /**\n   * Async iterator over the keys of the {@link ReadTransaction.scan | scan}\n   * call. If the {@link ReadTransaction.scan | scan} is over an index the key\n   * is a tuple of `[secondaryKey: string, primaryKey]`\n   */\n  keys(): AsyncIterableIteratorToArray<K>;\n\n  /**\n   * Async iterator over the entries of the {@link ReadTransaction.scan | scan}\n   * call. An entry is a tuple of key values. If the\n   * {@link ReadTransaction.scan | scan} is over an index the key is a tuple of\n   * `[secondaryKey: string, primaryKey]`\n   */\n  entries(): AsyncIterableIteratorToArray<readonly [K, V]>;\n\n  /** Returns all the values as an array. Same as `values().toArray()` */\n  toArray(): Promise<V[]>;\n}\n\n/**\n * An interface that adds a {@link toArray} method to `AsyncIterableIterator`.\n *\n * Usage:\n *\n * ```ts\n * const keys: string[] = await rep.scan().keys().toArray();\n * ```\n */\nexport interface AsyncIterableIteratorToArray<\n  V,\n> extends AsyncIterableIterator<V> {\n  toArray(): Promise<V[]>;\n}\n\nclass AsyncIterableIteratorToArrayWrapperImpl<\n  V,\n> implements AsyncIterableIterator<V> {\n  readonly #it: AsyncIterableIterator<V>;\n\n  constructor(it: AsyncIterableIterator<V>) {\n    this.#it = it;\n  }\n\n  next() {\n    return this.#it.next();\n  }\n\n  [Symbol.asyncIterator](): AsyncIterableIterator<V> {\n    return this.#it[Symbol.asyncIterator]();\n  }\n\n  toArray(): Promise<V[]> {\n    return asyncIterableToArray(this.#it);\n  }\n}\n\nasync function* scanIterator<Options extends ScanOptions, Value>(\n  toValue: ToValue<Options, Value>,\n  iter: AsyncIterable<EntryForOptions<Options, ReadonlyJSONValue>>,\n  options: Options,\n  closed: Closed,\n  onLimitKey: (inclusiveLimitKey: string) => void,\n): AsyncIterableIterator<Value> {\n  throwIfClosed(closed);\n\n  let {limit = Infinity} = options;\n  const {prefix = ''} = options;\n  let exclusive = options.start?.exclusive;\n\n  const isIndexScan = isScanIndexOptions(options);\n\n  // iter has already been moved to the first entry\n  for await (const entry of iter) {\n    const key = entry[0];\n    const keyToMatch: string = isIndexScan ? key[0] : (key as string);\n    if (!keyToMatch.startsWith(prefix)) {\n      return;\n    }\n\n    if (exclusive) {\n      exclusive = true;\n      if (isIndexScan) {\n        // oxlint-disable-next-line @typescript-eslint/no-non-null-assertion\n        if (shouldSkipIndexScan(key as IndexKey, options.start!.key)) {\n          continue;\n        }\n      } else {\n        // oxlint-disable-next-line @typescript-eslint/no-non-null-assertion\n        if (shouldSkipNonIndexScan(key as string, options.start!.key)) {\n          continue;\n        }\n      }\n    }\n\n    yield toValue(entry);\n\n    if (--limit === 0) {\n      // We do not do the limit optimization for index scans in subscriptions.\n      if (!isIndexScan) {\n        onLimitKey(key as string);\n      }\n      return;\n    }\n  }\n}\n\nfunction shouldSkipIndexScan(\n  key: IndexKey,\n  startKey: ScanOptionIndexedStartKey,\n): boolean {\n  const [secondaryStartKey, primaryStartKey] =\n    normalizeScanOptionIndexedStartKey(startKey);\n  const [secondaryKey, primaryKey] = normalizeScanOptionIndexedStartKey(key);\n  if (secondaryKey !== secondaryStartKey) {\n    return false;\n  }\n  if (primaryStartKey === undefined) {\n    return true;\n  }\n  return primaryKey === primaryStartKey;\n}\n\nfunction shouldSkipNonIndexScan(key: string, startKey: string): boolean {\n  return key === startKey;\n}\n\nexport type Entry<V> = readonly [key: string, value: V];\n\n/**\n * This is called when doing a {@link ReadTransaction.scan | scan} without an\n * `indexName`.\n *\n * @param fromKey The `fromKey` is computed by `scan` and is the key of the\n * first entry to return in the iterator. It is based on `prefix` and\n * `start.key` of the {@link ScanNoIndexOptions}.\n */\nexport type GetScanIterator = (\n  fromKey: string,\n) => IterableUnion<Entry<ReadonlyJSONValue>>;\n\n/**\n * When using {@link makeScanResult} this is the type used for the function called when doing a {@link ReadTransaction.scan | scan} with an\n * `indexName`.\n *\n * @param indexName The name of the index we are scanning over.\n * @param fromSecondaryKey The `fromSecondaryKey` is computed by `scan` and is\n * the secondary key of the first entry to return in the iterator. It is based\n * on `prefix` and `start.key` of the {@link ScanIndexOptions}.\n * @param fromPrimaryKey The `fromPrimaryKey` is computed by `scan` and is the\n * primary key of the first entry to return in the iterator. It is based on\n * `prefix` and `start.key` of the {@link ScanIndexOptions}.\n */\nexport type GetIndexScanIterator = (\n  indexName: string,\n  fromSecondaryKey: string,\n  fromPrimaryKey: string | undefined,\n) => IterableUnion<readonly [key: IndexKey, value: ReadonlyJSONValue]>;\n\n/**\n * A helper function that makes it easier to implement {@link ReadTransaction.scan}\n * with a custom backend.\n *\n * If you are implementing a custom backend and have an in memory pending async\n * iterable we provide two helper functions to make it easier to merge these\n * together. {@link mergeAsyncIterables} and {@link filterAsyncIterable}.\n *\n * For example:\n *\n * ```ts\n * const scanResult = makeScanResult(\n *   options,\n *   options.indexName\n *     ? () => {\n *         throw Error('not implemented');\n *       }\n *     : fromKey => {\n *         const persisted: AsyncIterable<Entry<ReadonlyJSONValue>> = ...;\n *         const pending: AsyncIterable<Entry<ReadonlyJSONValue | undefined>> = ...;\n *         const iter = await mergeAsyncIterables(persisted, pending);\n *         const filteredIter = await filterAsyncIterable(\n *           iter,\n *           entry => entry[1] !== undefined,\n *         );\n *         return filteredIter;\n *       },\n * );\n * ```\n */\nexport function makeScanResult<Options extends ScanOptions>(\n  options: Options,\n  getScanIterator: Options extends ScanIndexOptions\n    ? GetIndexScanIterator\n    : GetScanIterator,\n): ScanResult<KeyTypeForScanOptions<Options>, ReadonlyJSONValue> {\n  type AsyncIter = AsyncIterable<EntryForOptions<Options, ReadonlyJSONValue>>;\n\n  if (isScanIndexOptions(options)) {\n    const [fromSecondaryKey, fromPrimaryKey] = fromKeyForIndexScan(options);\n    return new ScanResultImpl(\n      (getScanIterator as GetIndexScanIterator)(\n        options.indexName,\n        fromSecondaryKey,\n        fromPrimaryKey,\n      ) as AsyncIter,\n      options,\n      {closed: false},\n      _ => {\n        // noop\n      },\n    );\n  }\n  const fromKey = fromKeyForNonIndexScan(options);\n  return new ScanResultImpl(\n    (getScanIterator as GetScanIterator)(fromKey) as AsyncIter,\n    options,\n    {closed: false},\n    _ => {\n      // noop\n    },\n  );\n}\n\nexport function fromKeyForIndexScan(\n  options: ScanIndexOptions,\n): readonly [secondary: string, primary?: string | undefined] {\n  const {prefix, start} = options;\n  const prefixNormalized: [secondary: string, primary?: string | undefined] = [\n    prefix ?? '',\n    undefined,\n  ];\n\n  if (!start) {\n    return prefixNormalized;\n  }\n\n  const startKeyNormalized = normalizeScanOptionIndexedStartKey(start.key);\n  if (greaterThan(startKeyNormalized[0], prefixNormalized[0])) {\n    return startKeyNormalized;\n  }\n  if (\n    startKeyNormalized[0] === prefixNormalized[0] &&\n    startKeyNormalized[1] !== undefined\n  ) {\n    return startKeyNormalized;\n  }\n\n  return prefixNormalized;\n}\n\nexport function fromKeyForIndexScanInternal(options: ScanIndexOptions): string {\n  const {prefix, start} = options;\n  let prefix2 = '';\n  if (prefix !== undefined) {\n    prefix2 = encodeIndexScanKey(prefix, undefined);\n  }\n  if (!start) {\n    return prefix2;\n  }\n\n  const {key} = start;\n  const [secondary, primary] = normalizeScanOptionIndexedStartKey(key);\n  const startKey = encodeIndexScanKey(secondary, primary);\n\n  if (greaterThan(startKey, prefix2)) {\n    return startKey;\n  }\n\n  return prefix2;\n}\n"],"mappings":";;;;;;;;;;;;;AA4BA,IAAa,iBAAb,MAG2D;CACzD;CACA;CACA;CACA;CAEA,YACE,MACA,SACA,mBACA,YACA;AACA,QAAA,OAAa;AACb,QAAA,UAAgB;AAChB,QAAA,oBAA0B;AAC1B,QAAA,aAAmB;;;CAIrB,CAAC,OAAO,iBAAkD;AACxD,SAAO,KAAK,QAAQ;;;CAItB,SAA0C;AACxC,SAAO,IAAI,wCACT,MAAA,aAAkB,MAAK,EAAE,GAAQ,CAClC;;;;;;;CAQH,OAAqE;AAEnE,SAAO,IAAI,wCACT,MAAA,aAAqB,MAAK,EAAE,GAAQ,CACrC;;;;;;;;CASH,UAEE;AAGA,SAAO,IAAI,wCACT,MAAA,aAAyB,MAAK,CAAC,EAAE,IAAW,EAAE,GAAQ,CAAC,CACxD;;;CAIH,UAAwB;AACtB,SAAO,KAAK,QAAQ,CAAC,SAAS;;CAGhC,aAAgB,SAAwD;AACtE,SAAO,aACL,SACA,MAAA,MACA,MAAA,SACA,MAAA,mBACA,MAAA,WACD;;;AA6CL,IAAM,0CAAN,MAEsC;CACpC;CAEA,YAAY,IAA8B;AACxC,QAAA,KAAW;;CAGb,OAAO;AACL,SAAO,MAAA,GAAS,MAAM;;CAGxB,CAAC,OAAO,iBAA2C;AACjD,SAAO,MAAA,GAAS,OAAO,gBAAgB;;CAGzC,UAAwB;AACtB,SAAO,qBAAqB,MAAA,GAAS;;;AAIzC,gBAAgB,aACd,SACA,MACA,SACA,QACA,YAC8B;AAC9B,eAAc,OAAO;CAErB,IAAI,EAAC,QAAQ,aAAY;CACzB,MAAM,EAAC,SAAS,OAAM;CACtB,IAAI,YAAY,QAAQ,OAAO;CAE/B,MAAM,cAAc,mBAAmB,QAAQ;AAG/C,YAAW,MAAM,SAAS,MAAM;EAC9B,MAAM,MAAM,MAAM;AAElB,MAAI,EADuB,cAAc,IAAI,KAAM,KACnC,WAAW,OAAO,CAChC;AAGF,MAAI,WAAW;AACb,eAAY;AACZ,OAAI;QAEE,oBAAoB,KAAiB,QAAQ,MAAO,IAAI,CAC1D;cAIE,uBAAuB,KAAe,QAAQ,MAAO,IAAI,CAC3D;;AAKN,QAAM,QAAQ,MAAM;AAEpB,MAAI,EAAE,UAAU,GAAG;AAEjB,OAAI,CAAC,YACH,YAAW,IAAc;AAE3B;;;;AAKN,SAAS,oBACP,KACA,UACS;CACT,MAAM,CAAC,mBAAmB,mBACxB,mCAAmC,SAAS;CAC9C,MAAM,CAAC,cAAc,cAAc,mCAAmC,IAAI;AAC1E,KAAI,iBAAiB,kBACnB,QAAO;AAET,KAAI,oBAAoB,KAAA,EACtB,QAAO;AAET,QAAO,eAAe;;AAGxB,SAAS,uBAAuB,KAAa,UAA2B;AACtE,QAAO,QAAQ;;AA8HjB,SAAgB,4BAA4B,SAAmC;CAC7E,MAAM,EAAC,QAAQ,UAAS;CACxB,IAAI,UAAU;AACd,KAAI,WAAW,KAAA,EACb,WAAU,mBAAmB,QAAQ,KAAA,EAAU;AAEjD,KAAI,CAAC,MACH,QAAO;CAGT,MAAM,EAAC,QAAO;CACd,MAAM,CAAC,WAAW,WAAW,mCAAmC,IAAI;CACpE,MAAM,WAAW,mBAAmB,WAAW,QAAQ;AAEvD,KAAI,YAAY,UAAU,QAAQ,CAChC,QAAO;AAGT,QAAO"}

package/out/replicache/src/scan-options.js.map

@@ -1 +1 @@
-{"version":3,"file":"scan-options.js","names":[],"sources":["../../../../replicache/src/scan-options.ts"],"sourcesContent":["import type {IndexKey} from './db/index.ts';\nimport type {ScanOptions as DbScanOptions} from './db/scan.ts';\n\n/**\n * Options for {@link ReadTransaction.scan | scan}\n */\nexport type ScanOptions = ScanIndexOptions | ScanNoIndexOptions;\n\n/**\n * Options for {@link ReadTransaction.scan | scan} when scanning over the entire key\n * space.\n */\nexport type ScanNoIndexOptions = {\n  /** Only include keys starting with `prefix`. */\n  prefix?: string | undefined;\n\n  /** Only include up to `limit` results. */\n  limit?: number | undefined;\n\n  /** When provided the scan starts at this key. */\n  start?:\n    | {\n        key: string;\n\n        /** Whether the `key` is exclusive or inclusive. */\n        exclusive?: boolean | undefined;\n      }\n    | undefined;\n};\n\n/**\n * Options for {@link ReadTransaction.scan | scan} when scanning over an index. When\n * scanning over and index you need to provide the `indexName` and the `start`\n * `key` is now a tuple consisting of secondary and primary key\n */\nexport type ScanIndexOptions = {\n  /** Only include results starting with the *secondary* keys starting with `prefix`. */\n  prefix?: string | undefined;\n\n  /** Only include up to `limit` results. */\n  limit?: number | undefined;\n\n  /** Do a {@link ReadTransaction.scan | scan} over a named index. The `indexName` is\n   * the name of an index defined when creating the {@link Replicache} instance using\n   * {@link ReplicacheOptions.indexes}. */\n  indexName: string;\n\n  /** When provided the scan starts at this key. */\n  start?:\n    | {\n        key: ScanOptionIndexedStartKey;\n\n        /** Whether the `key` is exclusive or inclusive. */\n        exclusive?: boolean | undefined;\n      }\n    | undefined;\n};\n\n/**\n * Type narrowing of {@link ScanOptions}.\n */\nexport function isScanIndexOptions(\n  options: ScanOptions,\n): options is ScanIndexOptions {\n  return (options as ScanIndexOptions).indexName !== undefined;\n}\n\n/**\n * If the options contains an `indexName` then the key type is a tuple of\n * secondary and primary.\n */\nexport type KeyTypeForScanOptions<O extends ScanOptions> =\n  O extends ScanIndexOptions ? IndexKey : string;\n\n/**\n * The key to start scanning at.\n *\n * If you are scanning the primary index (i.e., you did not specify\n * `indexName`), then pass a single string for this field, which is the key in\n * the primary index to scan at.\n *\n * If you are scanning a secondary index (i.e., you specified `indexName`), then\n * use the tuple form. In that case, `secondary` is the secondary key to start\n * scanning at, and `primary` (if any) is the primary key to start scanning at.\n */\nexport type ScanOptionIndexedStartKey =\n  | readonly [secondary: string, primary?: string | undefined]\n  | string;\n\nexport function normalizeScanOptionIndexedStartKey(\n  startKey: string | readonly [secondary: string, primary?: string | undefined],\n): readonly [secondary: string, primary?: string | undefined] {\n  if (typeof startKey === 'string') {\n    return [startKey];\n  }\n  return startKey;\n}\n\nexport function toDbScanOptions(options?: ScanOptions): DbScanOptions {\n  if (!options) {\n    return {};\n  }\n  let key: string | ScanOptionIndexedStartKey | undefined;\n  let exclusive: boolean | undefined;\n  let primary: string | undefined;\n  let secondary: string | undefined;\n  type MaybeIndexName = {indexName?: string};\n  if (options.start) {\n    ({key, exclusive} = options.start);\n    if ((options as MaybeIndexName).indexName) {\n      if (typeof key === 'string') {\n        secondary = key;\n      } else {\n        secondary = key[0];\n        primary = key[1];\n      }\n    } else {\n      primary = key as string;\n    }\n  }\n\n  return {\n    prefix: options.prefix,\n    startSecondaryKey: secondary,\n    startKey: primary,\n    startExclusive: exclusive,\n    limit: options.limit,\n    indexName: (options as MaybeIndexName).indexName,\n  };\n}\n"],"mappings":";;;;AA6DA,SAAgB,mBACd,SAC6B;CAC7B,OAAQ,QAA6B,cAAc,KAAA;AACrD;AAwBA,SAAgB,mCACd,UAC4D;CAC5D,IAAI,OAAO,aAAa,UACtB,OAAO,CAAC,QAAQ;CAElB,OAAO;AACT;AAEA,SAAgB,gBAAgB,SAAsC;CACpE,IAAI,CAAC,SACH,OAAO,CAAC;CAEV,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CAEJ,IAAI,QAAQ,OAAO;EACjB,CAAC,CAAC,KAAK,aAAa,QAAQ;EAC5B,IAAK,QAA2B,WAC9B,IAAI,OAAO,QAAQ,UACjB,YAAY;OACP;GACL,YAAY,IAAI;GAChB,UAAU,IAAI;EAChB;OAEA,UAAU;CAEd;CAEA,OAAO;EACL,QAAQ,QAAQ;EAChB,mBAAmB;EACnB,UAAU;EACV,gBAAgB;EAChB,OAAO,QAAQ;EACf,WAAY,QAA2B;CACzC;AACF"}
+{"version":3,"file":"scan-options.js","names":[],"sources":["../../../../replicache/src/scan-options.ts"],"sourcesContent":["import type {IndexKey} from './db/index.ts';\nimport type {ScanOptions as DbScanOptions} from './db/scan.ts';\n\n/**\n * Options for {@link ReadTransaction.scan | scan}\n */\nexport type ScanOptions = ScanIndexOptions | ScanNoIndexOptions;\n\n/**\n * Options for {@link ReadTransaction.scan | scan} when scanning over the entire key\n * space.\n */\nexport type ScanNoIndexOptions = {\n  /** Only include keys starting with `prefix`. */\n  prefix?: string | undefined;\n\n  /** Only include up to `limit` results. */\n  limit?: number | undefined;\n\n  /** When provided the scan starts at this key. */\n  start?:\n    | {\n        key: string;\n\n        /** Whether the `key` is exclusive or inclusive. */\n        exclusive?: boolean | undefined;\n      }\n    | undefined;\n};\n\n/**\n * Options for {@link ReadTransaction.scan | scan} when scanning over an index. When\n * scanning over and index you need to provide the `indexName` and the `start`\n * `key` is now a tuple consisting of secondary and primary key\n */\nexport type ScanIndexOptions = {\n  /** Only include results starting with the *secondary* keys starting with `prefix`. */\n  prefix?: string | undefined;\n\n  /** Only include up to `limit` results. */\n  limit?: number | undefined;\n\n  /** Do a {@link ReadTransaction.scan | scan} over a named index. The `indexName` is\n   * the name of an index defined when creating the {@link Replicache} instance using\n   * {@link ReplicacheOptions.indexes}. */\n  indexName: string;\n\n  /** When provided the scan starts at this key. */\n  start?:\n    | {\n        key: ScanOptionIndexedStartKey;\n\n        /** Whether the `key` is exclusive or inclusive. */\n        exclusive?: boolean | undefined;\n      }\n    | undefined;\n};\n\n/**\n * Type narrowing of {@link ScanOptions}.\n */\nexport function isScanIndexOptions(\n  options: ScanOptions,\n): options is ScanIndexOptions {\n  return (options as ScanIndexOptions).indexName !== undefined;\n}\n\n/**\n * If the options contains an `indexName` then the key type is a tuple of\n * secondary and primary.\n */\nexport type KeyTypeForScanOptions<O extends ScanOptions> =\n  O extends ScanIndexOptions ? IndexKey : string;\n\n/**\n * The key to start scanning at.\n *\n * If you are scanning the primary index (i.e., you did not specify\n * `indexName`), then pass a single string for this field, which is the key in\n * the primary index to scan at.\n *\n * If you are scanning a secondary index (i.e., you specified `indexName`), then\n * use the tuple form. In that case, `secondary` is the secondary key to start\n * scanning at, and `primary` (if any) is the primary key to start scanning at.\n */\nexport type ScanOptionIndexedStartKey =\n  | readonly [secondary: string, primary?: string | undefined]\n  | string;\n\nexport function normalizeScanOptionIndexedStartKey(\n  startKey: string | readonly [secondary: string, primary?: string | undefined],\n): readonly [secondary: string, primary?: string | undefined] {\n  if (typeof startKey === 'string') {\n    return [startKey];\n  }\n  return startKey;\n}\n\nexport function toDbScanOptions(options?: ScanOptions): DbScanOptions {\n  if (!options) {\n    return {};\n  }\n  let key: string | ScanOptionIndexedStartKey | undefined;\n  let exclusive: boolean | undefined;\n  let primary: string | undefined;\n  let secondary: string | undefined;\n  type MaybeIndexName = {indexName?: string};\n  if (options.start) {\n    ({key, exclusive} = options.start);\n    if ((options as MaybeIndexName).indexName) {\n      if (typeof key === 'string') {\n        secondary = key;\n      } else {\n        secondary = key[0];\n        primary = key[1];\n      }\n    } else {\n      primary = key as string;\n    }\n  }\n\n  return {\n    prefix: options.prefix,\n    startSecondaryKey: secondary,\n    startKey: primary,\n    startExclusive: exclusive,\n    limit: options.limit,\n    indexName: (options as MaybeIndexName).indexName,\n  };\n}\n"],"mappings":";;;;AA6DA,SAAgB,mBACd,SAC6B;AAC7B,QAAQ,QAA6B,cAAc,KAAA;;AAyBrD,SAAgB,mCACd,UAC4D;AAC5D,KAAI,OAAO,aAAa,SACtB,QAAO,CAAC,SAAS;AAEnB,QAAO;;AAGT,SAAgB,gBAAgB,SAAsC;AACpE,KAAI,CAAC,QACH,QAAO,EAAE;CAEX,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;AAEJ,KAAI,QAAQ,OAAO;AACjB,GAAC,CAAC,KAAK,aAAa,QAAQ;AAC5B,MAAK,QAA2B,UAC9B,KAAI,OAAO,QAAQ,SACjB,aAAY;OACP;AACL,eAAY,IAAI;AAChB,aAAU,IAAI;;MAGhB,WAAU;;AAId,QAAO;EACL,QAAQ,QAAQ;EAChB,mBAAmB;EACnB,UAAU;EACV,gBAAgB;EAChB,OAAO,QAAQ;EACf,WAAY,QAA2B;EACxC"}

package/out/replicache/src/set-interval-with-signal.js.map

@@ -1 +1 @@
-{"version":3,"file":"set-interval-with-signal.js","names":[],"sources":["../../../../replicache/src/set-interval-with-signal.ts"],"sourcesContent":["export function setIntervalWithSignal(\n  fn: () => void,\n  ms: number,\n  signal: AbortSignal,\n): void {\n  if (!signal.aborted) {\n    const interval = setInterval(fn, ms);\n    signal.addEventListener('abort', () => {\n      clearInterval(interval);\n    });\n  }\n}\n"],"mappings":";AAAA,SAAgB,sBACd,IACA,IACA,QACM;CACN,IAAI,CAAC,OAAO,SAAS;EACnB,MAAM,WAAW,YAAY,IAAI,EAAE;EACnC,OAAO,iBAAiB,eAAe;GACrC,cAAc,QAAQ;EACxB,CAAC;CACH;AACF"}
+{"version":3,"file":"set-interval-with-signal.js","names":[],"sources":["../../../../replicache/src/set-interval-with-signal.ts"],"sourcesContent":["export function setIntervalWithSignal(\n  fn: () => void,\n  ms: number,\n  signal: AbortSignal,\n): void {\n  if (!signal.aborted) {\n    const interval = setInterval(fn, ms);\n    signal.addEventListener('abort', () => {\n      clearInterval(interval);\n    });\n  }\n}\n"],"mappings":";AAAA,SAAgB,sBACd,IACA,IACA,QACM;AACN,KAAI,CAAC,OAAO,SAAS;EACnB,MAAM,WAAW,YAAY,IAAI,GAAG;AACpC,SAAO,iBAAiB,eAAe;AACrC,iBAAc,SAAS;IACvB"}

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

@@ -1 +1 @@
-{"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,IAAI;AAE9C,IAAM,uBAAuB,OAAO;AAGpC,IAAa,mBAAb,MAA4D;CAC1D;CACA;CACA,aAAuC;CACvC,QAAQ;CACR,SAAoD,CAAC;CAErD;CACA;CACA;CAEA,YACE,MACA,QACA,SACA,QAEA,UAAmC,WACnC;EACA,KAAKA,QAAQ;EACb,KAAKC,UAAU;EACf,KAAK,UAAU;EACf,KAAK,SAAS;EACd,KAAKC,WAAW;CAClB;CAEA,qBAAqB,WAA4B;EAC/C,KAAK,MAAM,QAAQ,KAAKC,QACtB,IAAI,KAAK,QAAQ,cAAc,WAC7B,OAAO;EAGX,OAAO;CACT;CAEA,OACE,IACA,OACA,QACY;EACZ,OAAO,KAAKH,MAAM,EAAE;CACtB;CAEA,QAAQ,OAA0B;EAChC,KAAK,MAAM,CAAC,WAAW,SAAS,OAC9B,IAAI,wBAAwB,KAAKI,OAAO,KAAKD,QAAQ,WAAW,IAAI,GAClE,OAAO;EAIX,OAAO;CACT;CAEA,WACE,MACA,OACM;EACN,KAAKC,QAAQ;EACb,KAAKD,SAAS;CAChB;CAEA,OAAO,QAAiB;EACtB,IACE,KAAKE,eAAe,wBACpB,CAAC,KAAKH,SAAS,KAAKG,YAAY,MAAM,GACtC;GACA,KAAKA,aAAa;GAClB,KAAKJ,QAAQ,MAAM;EACrB;CACF;AACF;AAgEA,IAAa,oBAAb,MAAyE;CACvE;CACA;CACA;CACA;CAEA,UAA2D,KAAA;CAC3D,SAA4C,KAAA;CAE5C,YAAY,UAAyB,SAAwB;EAC3D,KAAKK,YAAY;EACjB,KAAKC,UAAU,SAAS,UAAU;EAClC,KAAKC,aAAc,SAA+B;EAClD,KAAKC,4BAA4B,SAAS,4BAA4B;CACxE;CAEA,qBAAqB,WAA4B;EAC/C,OAAO,KAAKD,eAAe;CAC7B;CAEA,OAAO,QAAgC;EACrC,IAAI,WAAW,KAAA,GACb,KAAKF,UAAU,MAAM;CAEzB;CAEA,OACE,IACA,MACA,OAC2B;EAC3B,MAAM,SAAS,OACb,WACA,QACA,YACA,wBAGuD;GACvD,IAAI;GACJ,IAAI,SAAS,GAAuB;IAClC,IAAI,CAAC,KAAKG,2BAGR;IAIF,OACE,UAAU,KAAA,GACV,+CACF;IAEA,MAAM,UAAgC,CAAC;IACvC,WAAW,MAAM,SAAS,GAAG,KAAK;KAAC;KAAQ;IAAS,CAAC,EAAE,QAAQ,GAC7D,QAAQ,KAAK;KACX,IAAI;KACJ,KAAK,MAAM;KACX,UAAU,MAAM;IAClB,CAAC;IAEH,OAAO;GACT,OAAO;IACL,OAAO,OAAO,kDAAkD;IAEhE,OAAO,oBADW,MAAM,IAAI,aAAa,EAAE,KAAK,CAAC,CACb;GACtC;GACA,MAAM,UAAgC,CAAC;GACvC,MAAM,EAAC,WAAU;GACjB,KACE,IAAI,IAAI,iBAAiB,MAAM,QAAQ,UAAU,GACjD,IAAI,QACJ,KAEA,IAAI,WAAW,KAAK,EAAE,EAAE,WAAW,MAAM,GACvC,QAAQ,KAAK,KAAK,EAAE;QAEpB;GAKJ,OAAO,SAAS,KAAyB,QAAQ,SAAS,IACtD,UACA,KAAA;EACN;EAEA,IAAI,KAAKD,YACP,OAAO,OACL,KAAKA,YACL,KAAKD,UACL,SAAQ,KAAK,IAAI,KACjB,iBAAgB,kBAAkB,cAAc,cAAc,CAChE;EAGF,OAAO,OACL,KAAA,GACA,KAAKA,UACL,SAAQ,KAAK,MACb,iBAAgB,kBAAkB,eAAc,MAAK,CAAC,CACxD;CACF;CAEA,QAAQ,OAA0B;EAChC,MAAM,OAAO,MAAM,IAAI,KAAKC,cAAc,EAAE;EAC5C,IAAI,SAAS,KAAA,GACX,OAAO;EAGT,OAAO,mBAAmB,MAAM,KAAKD,SAAS,KAAKC,UAAU;CAC/D;CAEA,WACE,OACA,QACM,CAER;AACF;AAEA,SAAS,kBACP,MACA,YACsB;CACtB,OAAO,KAAK,KAAI,OAAM;EACpB,MAAM,MAAM,WAAW,GAAG,GAAG;EAC7B,QAAQ,GAAG,IAAX;GACE,KAAK,OACH,OAAO;IACL,IAAI;IACJ;IACA,UAAU,GAAG;GACf;GACF,KAAK,UACH,OAAO;IACL,IAAI;IACJ;IACA,UAAU,GAAG;IACb,UAAU,GAAG;GACf;GACF,KAAK,OACH,OAAO;IACL,IAAI;IACJ;IACA,UAAU,GAAG;GACf;EACJ;CACF,CAAC;AACH;AAwCA,IAAa,2BAAb,MAAsE;CACpE,iCAA2C,IAAI,IAAI;CACnD,wCAAkD,IAAI,IAAI;CAC1D;CACA;CACA,6BAA6B;CAC7B;CAEA,YACE,eACA,IACA,QACA;EACA,KAAKI,iBAAiB;EACtB,KAAKC,MAAM;EACX,KAAKC,UAAU;CACjB;CAEA,IAAO,cAA2C;EAChD,KAAKJ,eAAe,IAAI,YAAmC;EAC3D,KAAUK,gCACR,YACF;EACA,aACE,KAAKL,eAAe,OAAO,YAAmC;CAClE;CAEA,QAAc;EACZ,KAAK,MAAM,gBAAgB,KAAKA,gBAC9B,aAAa,SAAS;EAExB,KAAKA,eAAe,MAAM;CAC5B;CAEA,KAAK,OAAgC;EACnC,MAAM,gBAAgB,sBAAsB,KAAKA,gBAAgB,KAAK;EACtE,OAAO,KAAKM,mBAAmB,eAAe,GAAoB,KAAK;CACzE;CAEA,MAAMA,mBACJ,eACA,MACA,OACA;EACA,IAAI,KAAKF,QAAQ,SACf;EAGF,MAAM,OAAO,CAAC,GAAG,aAAa;EAC9B,IAAI,KAAK,WAAW,GAClB;EAIF,MAAM,UAAU,MAAM,KAAKF,gBAAe,OACxC,QAAQ,WACN,KAAK,IAAI,OAAM,MAAK;GAClB,MAAM,MAAM,IAAI,+BAA+B,EAAE;GACjD,IAAI;IACF,OAAO,MAAM,EAAE,OAAO,KAAK,MAAM,KAAK;GACxC,UAAU;IAIR,EAAE,WAAW,IAAI,MAAM,IAAI,KAAK;GAClC;EACF,CAAC,CACH,CACF;EAEA,KAAK,cAAc,MAAM,OAAO;CAClC;CAGA,cACE,MACA,SACA;EACA,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GACpC,MAAM,IAAI,KAAK;GACf,MAAM,SAAS,QAAQ;GACvB,IAAI,OAAO,WAAW,aACpB,EAAE,OAAO,OAAO,KAAK;QAErB,IAAI,EAAE,SACJ,EAAE,QAAQ,OAAO,MAAM;QAEvB,KAAKC,IAAI,QAAQ,+BAA+B,OAAO,MAAM;EAGnE;CACF;CAEA,MAAME,gCAAgC,GAAwB;EAC5D,KAAKJ,sBAAsB,IAAI,CAAC;EAEhC,IAAI,CAAC,KAAK,4BAA4B;GACpC,KAAK,6BAA6B;GAClC,MAAM,QAAQ,QAAQ;GACtB,KAAK,6BAA6B;GAClC,MAAM,gBAAgB,CAAC,GAAG,KAAKA,qBAAqB;GACpD,KAAKA,sBAAsB,MAAM;GACjC,MAAM,KAAKK,mBACT,eACA,GACA,KAAA,CACF;EACF;CACF;CAEA,qBAA8B;EAC5B,OAAO,KAAKN,eAAe,OAAO;CACpC;CAEA,2BAA2B,WAA4B;EACrD,KAAK,MAAM,KAAK,KAAKA,gBACnB,IAAI,EAAE,qBAAqB,SAAS,GAClC,OAAO;EAGX,OAAO;CACT;AACF;AAOA,SAAS,wBACP,MACA,OACA,WACA,MACS;CAET,IAAI,cAAc;OACX,MAAM,aAAa,MACtB,IAAI,KAAK,IAAI,UAAU,GAAG,GACxB,OAAO;CAAA;CAKb,KAAK,MAAM,YAAY,OACrB,IAAI,oBAAoB,UAAU,WAAW,IAAI,GAC/C,OAAO;CAGX,OAAO;AACT;AAEA,SAAS,oBACP,UACA,iBACA,MACS;CAET,KAAK,MAAM,aAAa,MACtB,IAAI,mBAAmB,UAAU,iBAAiB,UAAU,GAAG,GAC7D,OAAO;CAIX,OAAO;AACT;AAEA,SAAgB,mBACd,UACA,iBACA,YACS;CACT,MAAM,EACJ,YAAY,IACZ,OACA,QACA,UACA,gBACA,sBACE,SAAS;CAEb,IAAI,oBAAoB,WACtB,OAAO;CAGT,IAAI,CAAC,WAAW;EAEd,IAAI,UAAU,KAAA,KAAa,SAAS,GAClC,OAAO;EAKT,IAAI,CAAC,UAAU,CAAC,UACd,OAAO;EAGT,IACE,WACC,CAAC,WAAW,WAAW,MAAM,KAC5B,wBAAwB,UAAU,UAAU,IAE9C,OAAO;EAGT,IACE,aACE,kBAAkB,WAAW,YAAY,QAAQ,KACjD,SAAS,YAAY,QAAQ,KAC7B,wBAAwB,UAAU,UAAU,IAE9C,OAAO;EAGT,OAAO;CACT;CAIA,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,mBAC3B,OAAO;CAGT,MAAM,CAAC,qBAAqB,qBAAqB,eAAe,UAAU;CAE1E,IAAI;MACE,CAAC,oBAAoB,WAAW,MAAM,GACxC,OAAO;CAAA;CAIX,IACE,sBACE,kBAAkB,WAAW,qBAAqB,iBAAiB,KACnE,SAAS,qBAAqB,iBAAiB,IAEjD,OAAO;CAGT,IACE,aACE,kBAAkB,WAAW,mBAAmB,QAAQ,KACxD,SAAS,mBAAmB,QAAQ,IAEtC,OAAO;CAGT,OAAO;AACT;AAEA,SAAS,wBACP,UACA,YACS;CACT,MAAM,EAAC,sBAAqB;CAC5B,OACE,SAAS,QAAQ,UAAU,KAAA,KAC3B,sBAAsB,KAAA,KACtB,YAAY,YAAY,iBAAiB;AAE7C;AAEA,UAAU,sBACR,eACA,OAC4B;CAC5B,KAAK,MAAM,gBAAgB,eACzB,IAAI,aAAa,QAAQ,KAAK,GAC5B,MAAM;AAGZ;AAEA,SAAS,mBACP,MACA,QACA,WACS;CACT,IAAI,WAAW,IACb,OAAO;CAGT,MAAM,aAAa,aACd,WAAkC,eAAe,OAAO,GAAG,EAAE,MAC7D,WAAkC,OAAO;CAC9C,MAAM,IAAI,iBAAiB,MAAM,QAAQ,UAAU;CACnD,OAAO,IAAI,KAAK,UAAU,WAAW,KAAK,EAAE,EAAE,WAAW,MAAM;AACjE;AAEA,SAAgB,iBACd,MACA,QACA,YACQ;CACR,OAAO,aAAa,KAAK,SAAQ,MAC/B,YAAY,QAAQ,WAAW,KAAK,EAAE,CAAC,CACzC;AACF"}
+{"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.map

@@ -1 +1 @@
-{"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;EACnD,IAAI,MAAM,WAAW,GACnB,OAAO;EAET,OAAO,MAAM,IAAI,KAAK,KAAK;CAC7B;AACF;;;;;AAMA,eAAsB,KACpB,SACA,SACA,MACA,YACA,eACmB;CACnB,MAAM,CAAC,WAAW,aAAa,MAAM,QAAQ,IAAI,CAC/C,eAAe,SAAS,IAAI,GAC5B,eAAe,SAAS,IAAI,CAC9B,CAAC;CAED,OAAO,YAAY,WAAW,WAAW,MAAM,YAAY,aAAa;AAC1E;;;;;AAOA,eAAsB,YACpB,WACA,WACA,MACA,YACA,eACmB;CACnB,MAAM,WAAW,IAAI,SAAS;CAC9B,IAAI,CAAC,WAAW,mBAAmB,GACjC,OAAO;CAKT,MAAM,YAAY,MAAM,OAAU,IAFf,UAAU,MAAM,eAAe,UAAU,SAE1B,GAAQ,IADvB,UAAU,MAAM,eAAe,UAAU,SAClB,CAAM;CAChD,SAAS,IAAI,IAAI,SAAS;CAE1B,MAAM,mBACJ,WACA,WACA,MACA,UACA,YACA,aACF;CAEA,OAAO;AACT;AAEA,eAAsB,mBACpB,YACA,YACA,MACA,UACA,YACA,eACA;CACA,MAAM,aAAa,mBAAmB,YAAY,MAAM,aAAa;CACrE,MAAM,aAAa,mBAAmB,YAAY,MAAM,aAAa;CAErE,KAAK,MAAM,CAAC,cAAc,aAAa,YAAY;EACjD,IAAI,CAAC,WAAW,2BAA2B,YAAY,GACrD;EAGF,MAAM,WAAW,WAAW,IAAI,YAAY;EAC5C,IAAI,aAAa,KAAA,GAAW;GAC1B,OACE,aAAa,UACb,2CACF;GACA,MAAM,QAAQ,MAAM,OAAU,SAAS,KAAK,SAAS,GAAG;GACxD,WAAW,OAAO,YAAY;GAC9B,SAAS,IAAI,cAAc,KAAK;EAClC,OAAO;GAEL,MAAM,QAAQ,MAAM,iBAAiB,SAAS,KAAK,KAAK;GACxD,SAAS,IAAI,cAAc,KAAK;EAClC;CACF;CAEA,KAAK,MAAM,CAAC,cAAc,aAAa,YAAY;EACjD,IAAI,CAAC,WAAW,2BAA2B,YAAY,GACrD;EAGF,MAAM,QAAQ,MAAM,iBAAiB,SAAS,KAAK,KAAK;EACxD,SAAS,IAAI,cAAc,KAAK;CAClC;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.map

@@ -1 +1 @@
-{"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,OAAO;AAO7E,IAAa,iBAAwC,eAAO,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.map

@@ -1 +1 @@
-{"version":3,"file":"patch.js","names":[],"sources":["../../../../../replicache/src/sync/patch.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {compareUTF8} from 'compare-utf8';\nimport {assertObject} from '../../../shared/src/asserts.ts';\nimport type {\n  ReadonlyJSONObject,\n  ReadonlyJSONValue,\n} from '../../../shared/src/json.ts';\nimport type {DiffOperation} from '../btree/node.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';\n\nexport type Diff =\n  | DiffOperation<string>\n  | {\n      op: 'clear';\n    };\n\n/**\n * Optimizes a patch array by:\n * 1. Dropping all operations before the last 'clear'\n * 2. For each key: put/del replace all previous operations\n * 3. Removing standalone 'del' operations after a clear (deleting from empty tree)\n * 4. Update are not used in Zero/Replicache so just return original patch.\n * Note: Order is preserved for operations on the same key, but operations\n * on different keys can be reordered.\n */\nexport function optimizePatch(\n  patch: readonly PatchOperationInternal[],\n): readonly PatchOperationInternal[] {\n  if (patch.length === 0) {\n    return [];\n  }\n\n  // Build result array\n  const result: PatchOperationInternal[] = [];\n\n  // Find the last clear operation, add it to result, and track start index\n  let i = 0;\n  let clearIndex = -1;\n  for (i = patch.length - 1; i >= 0; i--) {\n    if (patch[i].op === 'clear') {\n      result.push(patch[i]);\n      clearIndex = i;\n      break;\n    }\n  }\n  // After loop: i is either the clear index (if found) or -1 (if not found)\n  // Increment to get the start index for processing remaining operations\n  i++;\n\n  // Track operations for each key\n  // del and put replace all previous operations\n  // updates are not used so if we see one we return the original patch.\n  const keyOps = new Map<string, PatchOperationInternal>();\n\n  for (; i < patch.length; i++) {\n    const p = patch[i];\n\n    switch (p.op) {\n      case 'put':\n      case 'del': {\n        // put and del replaces all previous operations on that key\n        keyOps.set(p.key, p);\n        break;\n      }\n      case 'update': {\n        // 'update' is not used but to be safe just exit early.\n        return clearIndex === -1 ? patch : patch.slice(clearIndex);\n      }\n    }\n  }\n\n  // Add all remaining key operations, but skip standalone del after clear\n  for (const op of keyOps.values()) {\n    // Skip standalone del operations after clear (deleting from empty tree is pointless)\n    if (clearIndex !== -1 && op.op === 'del') {\n      continue;\n    }\n    result.push(op);\n  }\n\n  return result.sort((a, b) => {\n    if (a.op === 'clear') return -1;\n    if (b.op === 'clear') return 1;\n    return compareUTF8(a.key, b.key);\n  });\n}\n\nexport async function apply(\n  lc: LogContext,\n  dbWrite: Write,\n  patch: readonly PatchOperationInternal[],\n): Promise<void> {\n  // Optimize the patch to remove redundant operations\n  const optimized = optimizePatch(patch);\n\n  let i = 0;\n\n  // Handle clear if present (always at index 0 after optimization)\n  if (optimized.length > 0 && optimized[0].op === 'clear') {\n    await dbWrite.clear();\n    i = 1;\n  }\n\n  // Check if we can bulk load put some operations\n  const bulkLoadStart = i;\n  while (i < optimized.length && optimized[i].op === 'put') {\n    i++;\n  }\n\n  if (i > bulkLoadStart) {\n    await bulkLoadPuts(lc, dbWrite, optimized.slice(bulkLoadStart, i));\n  }\n\n  // Apply remaining operations individually\n  for (; i < optimized.length; i++) {\n    const op = optimized[i];\n\n    switch (op.op) {\n      case 'put': {\n        const frozen = deepFreeze(op.value);\n        await dbWrite.put(lc, op.key, frozen);\n        break;\n      }\n      case 'update': {\n        const existing = await dbWrite.get(op.key);\n        if (existing !== undefined) {\n          assertObject(existing);\n        }\n        const frozen = mergeUpdate(op, existing);\n        await dbWrite.put(lc, op.key, frozen);\n        break;\n      }\n      case 'del': {\n        const existing = await dbWrite.get(op.key);\n        if (existing !== undefined) {\n          await dbWrite.del(lc, op.key);\n        }\n        break;\n      }\n    }\n  }\n}\n\nexport function mergeUpdate(\n  op: Extract<PatchOperationInternal, {op: 'update'}>,\n  existing: ReadonlyJSONObject | undefined,\n) {\n  const entries: [string, FrozenJSONValue | ReadonlyJSONValue | undefined][] =\n    [];\n  const addToEntries = (toAdd: FrozenJSONObject | ReadonlyJSONObject) => {\n    for (const [key, value] of Object.entries(toAdd)) {\n      if (\n        !op.constrain ||\n        op.constrain.length === 0 ||\n        op.constrain.includes(key)\n      ) {\n        entries.push([key, value]);\n      }\n    }\n  };\n  if (existing !== undefined) {\n    addToEntries(existing);\n  }\n  if (op.merge) {\n    addToEntries(op.merge);\n  }\n  return deepFreeze(Object.fromEntries(entries));\n}\n\nasync function bulkLoadPuts(\n  lc: LogContext,\n  dbWrite: Write,\n  puts: readonly PatchOperationInternal[],\n): Promise<void> {\n  if (puts.length === 0) {\n    return;\n  }\n\n  // Sort entries by key for bulk loading\n  const entries: [string, FrozenJSONValue][] = puts.map(p => {\n    if (p.op !== 'put') {\n      throw new Error('Expected put operation');\n    }\n    return [p.key, deepFreeze(p.value)];\n  });\n\n  // already sorted\n\n  await dbWrite.putMany(lc, entries);\n}\n"],"mappings":";;;;;;;;;;;;;AA+BA,SAAgB,cACd,OACmC;CACnC,IAAI,MAAM,WAAW,GACnB,OAAO,CAAC;CAIV,MAAM,SAAmC,CAAC;CAG1C,IAAI,IAAI;CACR,IAAI,aAAa;CACjB,KAAK,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KACjC,IAAI,MAAM,GAAG,OAAO,SAAS;EAC3B,OAAO,KAAK,MAAM,EAAE;EACpB,aAAa;EACb;CACF;CAIF;CAKA,MAAM,yBAAS,IAAI,IAAoC;CAEvD,OAAO,IAAI,MAAM,QAAQ,KAAK;EAC5B,MAAM,IAAI,MAAM;EAEhB,QAAQ,EAAE,IAAV;GACE,KAAK;GACL,KAAK;IAEH,OAAO,IAAI,EAAE,KAAK,CAAC;IACnB;GAEF,KAAK,UAEH,OAAO,eAAe,KAAK,QAAQ,MAAM,MAAM,UAAU;EAE7D;CACF;CAGA,KAAK,MAAM,MAAM,OAAO,OAAO,GAAG;EAEhC,IAAI,eAAe,MAAM,GAAG,OAAO,OACjC;EAEF,OAAO,KAAK,EAAE;CAChB;CAEA,OAAO,OAAO,MAAM,GAAG,MAAM;EAC3B,IAAI,EAAE,OAAO,SAAS,OAAO;EAC7B,IAAI,EAAE,OAAO,SAAS,OAAO;EAC7B,OAAO,YAAY,EAAE,KAAK,EAAE,GAAG;CACjC,CAAC;AACH;AAEA,eAAsB,MACpB,IACA,SACA,OACe;CAEf,MAAM,YAAY,cAAc,KAAK;CAErC,IAAI,IAAI;CAGR,IAAI,UAAU,SAAS,KAAK,UAAU,GAAG,OAAO,SAAS;EACvD,MAAM,QAAQ,MAAM;EACpB,IAAI;CACN;CAGA,MAAM,gBAAgB;CACtB,OAAO,IAAI,UAAU,UAAU,UAAU,GAAG,OAAO,OACjD;CAGF,IAAI,IAAI,eACN,MAAM,aAAa,IAAI,SAAS,UAAU,MAAM,eAAe,CAAC,CAAC;CAInE,OAAO,IAAI,UAAU,QAAQ,KAAK;EAChC,MAAM,KAAK,UAAU;EAErB,QAAQ,GAAG,IAAX;GACE,KAAK,OAAO;IACV,MAAM,SAAS,WAAW,GAAG,KAAK;IAClC,MAAM,QAAQ,IAAI,IAAI,GAAG,KAAK,MAAM;IACpC;GACF;GACA,KAAK,UAAU;IACb,MAAM,WAAW,MAAM,QAAQ,IAAI,GAAG,GAAG;IACzC,IAAI,aAAa,KAAA,GACf,aAAa,QAAQ;IAEvB,MAAM,SAAS,YAAY,IAAI,QAAQ;IACvC,MAAM,QAAQ,IAAI,IAAI,GAAG,KAAK,MAAM;IACpC;GACF;GACA,KAAK;IAEH,IAAI,MADmB,QAAQ,IAAI,GAAG,GAAG,MACxB,KAAA,GACf,MAAM,QAAQ,IAAI,IAAI,GAAG,GAAG;IAE9B;EAEJ;CACF;AACF;AAEA,SAAgB,YACd,IACA,UACA;CACA,MAAM,UACJ,CAAC;CACH,MAAM,gBAAgB,UAAiD;EACrE,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAC7C,IACE,CAAC,GAAG,aACJ,GAAG,UAAU,WAAW,KACxB,GAAG,UAAU,SAAS,GAAG,GAEzB,QAAQ,KAAK,CAAC,KAAK,KAAK,CAAC;CAG/B;CACA,IAAI,aAAa,KAAA,GACf,aAAa,QAAQ;CAEvB,IAAI,GAAG,OACL,aAAa,GAAG,KAAK;CAEvB,OAAO,WAAW,OAAO,YAAY,OAAO,CAAC;AAC/C;AAEA,eAAe,aACb,IACA,SACA,MACe;CACf,IAAI,KAAK,WAAW,GAClB;CAIF,MAAM,UAAuC,KAAK,KAAI,MAAK;EACzD,IAAI,EAAE,OAAO,OACX,MAAM,IAAI,MAAM,wBAAwB;EAE1C,OAAO,CAAC,EAAE,KAAK,WAAW,EAAE,KAAK,CAAC;CACpC,CAAC;CAID,MAAM,QAAQ,QAAQ,IAAI,OAAO;AACnC"}
+{"version":3,"file":"patch.js","names":[],"sources":["../../../../../replicache/src/sync/patch.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {compareUTF8} from 'compare-utf8';\nimport {assertObject} from '../../../shared/src/asserts.ts';\nimport type {\n  ReadonlyJSONObject,\n  ReadonlyJSONValue,\n} from '../../../shared/src/json.ts';\nimport type {DiffOperation} from '../btree/node.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';\n\nexport type Diff =\n  | DiffOperation<string>\n  | {\n      op: 'clear';\n    };\n\n/**\n * Optimizes a patch array by:\n * 1. Dropping all operations before the last 'clear'\n * 2. For each key: put/del replace all previous operations\n * 3. Removing standalone 'del' operations after a clear (deleting from empty tree)\n * 4. Update are not used in Zero/Replicache so just return original patch.\n * Note: Order is preserved for operations on the same key, but operations\n * on different keys can be reordered.\n */\nexport function optimizePatch(\n  patch: readonly PatchOperationInternal[],\n): readonly PatchOperationInternal[] {\n  if (patch.length === 0) {\n    return [];\n  }\n\n  // Build result array\n  const result: PatchOperationInternal[] = [];\n\n  // Find the last clear operation, add it to result, and track start index\n  let i = 0;\n  let clearIndex = -1;\n  for (i = patch.length - 1; i >= 0; i--) {\n    if (patch[i].op === 'clear') {\n      result.push(patch[i]);\n      clearIndex = i;\n      break;\n    }\n  }\n  // After loop: i is either the clear index (if found) or -1 (if not found)\n  // Increment to get the start index for processing remaining operations\n  i++;\n\n  // Track operations for each key\n  // del and put replace all previous operations\n  // updates are not used so if we see one we return the original patch.\n  const keyOps = new Map<string, PatchOperationInternal>();\n\n  for (; i < patch.length; i++) {\n    const p = patch[i];\n\n    switch (p.op) {\n      case 'put':\n      case 'del': {\n        // put and del replaces all previous operations on that key\n        keyOps.set(p.key, p);\n        break;\n      }\n      case 'update': {\n        // 'update' is not used but to be safe just exit early.\n        return clearIndex === -1 ? patch : patch.slice(clearIndex);\n      }\n    }\n  }\n\n  // Add all remaining key operations, but skip standalone del after clear\n  for (const op of keyOps.values()) {\n    // Skip standalone del operations after clear (deleting from empty tree is pointless)\n    if (clearIndex !== -1 && op.op === 'del') {\n      continue;\n    }\n    result.push(op);\n  }\n\n  return result.sort((a, b) => {\n    if (a.op === 'clear') return -1;\n    if (b.op === 'clear') return 1;\n    return compareUTF8(a.key, b.key);\n  });\n}\n\nexport async function apply(\n  lc: LogContext,\n  dbWrite: Write,\n  patch: readonly PatchOperationInternal[],\n): Promise<void> {\n  // Optimize the patch to remove redundant operations\n  const optimized = optimizePatch(patch);\n\n  let i = 0;\n\n  // Handle clear if present (always at index 0 after optimization)\n  if (optimized.length > 0 && optimized[0].op === 'clear') {\n    await dbWrite.clear();\n    i = 1;\n  }\n\n  // Check if we can bulk load put some operations\n  const bulkLoadStart = i;\n  while (i < optimized.length && optimized[i].op === 'put') {\n    i++;\n  }\n\n  if (i > bulkLoadStart) {\n    await bulkLoadPuts(lc, dbWrite, optimized.slice(bulkLoadStart, i));\n  }\n\n  // Apply remaining operations individually\n  for (; i < optimized.length; i++) {\n    const op = optimized[i];\n\n    switch (op.op) {\n      case 'put': {\n        const frozen = deepFreeze(op.value);\n        await dbWrite.put(lc, op.key, frozen);\n        break;\n      }\n      case 'update': {\n        const existing = await dbWrite.get(op.key);\n        if (existing !== undefined) {\n          assertObject(existing);\n        }\n        const frozen = mergeUpdate(op, existing);\n        await dbWrite.put(lc, op.key, frozen);\n        break;\n      }\n      case 'del': {\n        const existing = await dbWrite.get(op.key);\n        if (existing !== undefined) {\n          await dbWrite.del(lc, op.key);\n        }\n        break;\n      }\n    }\n  }\n}\n\nexport function mergeUpdate(\n  op: Extract<PatchOperationInternal, {op: 'update'}>,\n  existing: ReadonlyJSONObject | undefined,\n) {\n  const entries: [string, FrozenJSONValue | ReadonlyJSONValue | undefined][] =\n    [];\n  const addToEntries = (toAdd: FrozenJSONObject | ReadonlyJSONObject) => {\n    for (const [key, value] of Object.entries(toAdd)) {\n      if (\n        !op.constrain ||\n        op.constrain.length === 0 ||\n        op.constrain.includes(key)\n      ) {\n        entries.push([key, value]);\n      }\n    }\n  };\n  if (existing !== undefined) {\n    addToEntries(existing);\n  }\n  if (op.merge) {\n    addToEntries(op.merge);\n  }\n  return deepFreeze(Object.fromEntries(entries));\n}\n\nasync function bulkLoadPuts(\n  lc: LogContext,\n  dbWrite: Write,\n  puts: readonly PatchOperationInternal[],\n): Promise<void> {\n  if (puts.length === 0) {\n    return;\n  }\n\n  // Sort entries by key for bulk loading\n  const entries: [string, FrozenJSONValue][] = puts.map(p => {\n    if (p.op !== 'put') {\n      throw new Error('Expected put operation');\n    }\n    return [p.key, deepFreeze(p.value)];\n  });\n\n  // already sorted\n\n  await dbWrite.putMany(lc, entries);\n}\n"],"mappings":";;;;;;;;;;;;;AA+BA,SAAgB,cACd,OACmC;AACnC,KAAI,MAAM,WAAW,EACnB,QAAO,EAAE;CAIX,MAAM,SAAmC,EAAE;CAG3C,IAAI,IAAI;CACR,IAAI,aAAa;AACjB,MAAK,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,IACjC,KAAI,MAAM,GAAG,OAAO,SAAS;AAC3B,SAAO,KAAK,MAAM,GAAG;AACrB,eAAa;AACb;;AAKJ;CAKA,MAAM,yBAAS,IAAI,KAAqC;AAExD,QAAO,IAAI,MAAM,QAAQ,KAAK;EAC5B,MAAM,IAAI,MAAM;AAEhB,UAAQ,EAAE,IAAV;GACE,KAAK;GACL,KAAK;AAEH,WAAO,IAAI,EAAE,KAAK,EAAE;AACpB;GAEF,KAAK,SAEH,QAAO,eAAe,KAAK,QAAQ,MAAM,MAAM,WAAW;;;AAMhE,MAAK,MAAM,MAAM,OAAO,QAAQ,EAAE;AAEhC,MAAI,eAAe,MAAM,GAAG,OAAO,MACjC;AAEF,SAAO,KAAK,GAAG;;AAGjB,QAAO,OAAO,MAAM,GAAG,MAAM;AAC3B,MAAI,EAAE,OAAO,QAAS,QAAO;AAC7B,MAAI,EAAE,OAAO,QAAS,QAAO;AAC7B,SAAO,YAAY,EAAE,KAAK,EAAE,IAAI;GAChC;;AAGJ,eAAsB,MACpB,IACA,SACA,OACe;CAEf,MAAM,YAAY,cAAc,MAAM;CAEtC,IAAI,IAAI;AAGR,KAAI,UAAU,SAAS,KAAK,UAAU,GAAG,OAAO,SAAS;AACvD,QAAM,QAAQ,OAAO;AACrB,MAAI;;CAIN,MAAM,gBAAgB;AACtB,QAAO,IAAI,UAAU,UAAU,UAAU,GAAG,OAAO,MACjD;AAGF,KAAI,IAAI,cACN,OAAM,aAAa,IAAI,SAAS,UAAU,MAAM,eAAe,EAAE,CAAC;AAIpE,QAAO,IAAI,UAAU,QAAQ,KAAK;EAChC,MAAM,KAAK,UAAU;AAErB,UAAQ,GAAG,IAAX;GACE,KAAK,OAAO;IACV,MAAM,SAAS,WAAW,GAAG,MAAM;AACnC,UAAM,QAAQ,IAAI,IAAI,GAAG,KAAK,OAAO;AACrC;;GAEF,KAAK,UAAU;IACb,MAAM,WAAW,MAAM,QAAQ,IAAI,GAAG,IAAI;AAC1C,QAAI,aAAa,KAAA,EACf,cAAa,SAAS;IAExB,MAAM,SAAS,YAAY,IAAI,SAAS;AACxC,UAAM,QAAQ,IAAI,IAAI,GAAG,KAAK,OAAO;AACrC;;GAEF,KAAK;AAEH,QADiB,MAAM,QAAQ,IAAI,GAAG,IAAI,KACzB,KAAA,EACf,OAAM,QAAQ,IAAI,IAAI,GAAG,IAAI;AAE/B;;;;AAMR,SAAgB,YACd,IACA,UACA;CACA,MAAM,UACJ,EAAE;CACJ,MAAM,gBAAgB,UAAiD;AACrE,OAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,CAC9C,KACE,CAAC,GAAG,aACJ,GAAG,UAAU,WAAW,KACxB,GAAG,UAAU,SAAS,IAAI,CAE1B,SAAQ,KAAK,CAAC,KAAK,MAAM,CAAC;;AAIhC,KAAI,aAAa,KAAA,EACf,cAAa,SAAS;AAExB,KAAI,GAAG,MACL,cAAa,GAAG,MAAM;AAExB,QAAO,WAAW,OAAO,YAAY,QAAQ,CAAC;;AAGhD,eAAe,aACb,IACA,SACA,MACe;AACf,KAAI,KAAK,WAAW,EAClB;CAIF,MAAM,UAAuC,KAAK,KAAI,MAAK;AACzD,MAAI,EAAE,OAAO,MACX,OAAM,IAAI,MAAM,yBAAyB;AAE3C,SAAO,CAAC,EAAE,KAAK,WAAW,EAAE,MAAM,CAAC;GACnC;AAIF,OAAM,QAAQ,QAAQ,IAAI,QAAQ"}

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

@@ -1 +1 @@
-{"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;EAC5B,MAAM,gBAAgB;EACtB,KAAK,WAAW;CAClB;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"}

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

@@ -1 +1 @@
-{"version":3,"file":"pull.js","names":[],"sources":["../../../../../replicache/src/sync/pull.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assert} from '../../../shared/src/asserts.ts';\nimport {deepEqual} from '../../../shared/src/json.ts';\nimport {diff} from '../btree/diff.ts';\nimport {BTreeRead} from '../btree/read.ts';\nimport {compareCookies, type Cookie} from '../cookies.ts';\nimport type {Store} from '../dag/store.ts';\nimport type {Commit} from '../db/commit.ts';\nimport {\n  assertSnapshotMetaDD31,\n  baseSnapshotFromHash,\n  commitFromHash,\n  commitIsLocalDD31,\n  DEFAULT_HEAD_NAME,\n  type LocalMeta,\n  localMutations,\n  snapshotMetaParts,\n} from '../db/commit.ts';\nimport {newWriteSnapshotDD31} from '../db/write.ts';\nimport {isErrorResponse} from '../error-responses.ts';\nimport type * as FormatVersion from '../format-version-enum.ts';\nimport {deepFreeze, type FrozenJSONValue} from '../frozen-json.ts';\nimport {assertPullerResultV1} from '../get-default-puller.ts';\nimport {emptyHash, type Hash} from '../hash.ts';\nimport type {HTTPRequestInfo} from '../http-request-info.ts';\nimport type {\n  Puller,\n  PullerResult,\n  PullResponseOKV1Internal,\n  PullResponseV1,\n} from '../puller.ts';\nimport {ReportError} from '../report-error.ts';\nimport {toError} from '../to-error.ts';\nimport {withRead, withWriteNoImplicitCommit} from '../with-transactions.ts';\nimport {\n  addDiffsForIndexes,\n  type DiffComputationConfig,\n  DiffsMap,\n} from './diff.ts';\nimport * as HandlePullResponseResultType from './handle-pull-response-result-type-enum.ts';\nimport type {ClientGroupID, ClientID} from './ids.ts';\nimport * as patch from './patch.ts';\nimport {PullError} from './pull-error.ts';\nimport {SYNC_HEAD_NAME} from './sync-head-name.ts';\n\ntype FormatVersion = (typeof FormatVersion)[keyof typeof FormatVersion];\n\nexport const PULL_VERSION_SDD = 0;\nexport const PULL_VERSION_DD31 = 1;\n\n/**\n * The JSON value used as the body when doing a POST to the [pull\n * endpoint](/reference/server-pull).\n */\nexport type PullRequest = PullRequestV1;\n\n/**\n * The JSON value used as the body when doing a POST to the [pull\n * endpoint](/reference/server-pull).\n */\nexport type PullRequestV1 = {\n  pullVersion: 1;\n  // schemaVersion can optionally be used by the customer's app\n  // to indicate to the data layer what format of Client View the\n  // app understands.\n  schemaVersion: string;\n  profileID: string;\n  cookie: Cookie;\n\n  clientGroupID: ClientGroupID;\n};\n\nexport function isPullRequestV1(pr: PullRequest): pr is PullRequestV1 {\n  return pr.pullVersion === PULL_VERSION_DD31;\n}\n\nexport type BeginPullResponseV1 = {\n  httpRequestInfo: HTTPRequestInfo;\n  pullResponse?: PullResponseV1;\n  syncHead: Hash;\n};\n\nexport async function beginPullV1(\n  profileID: string,\n  clientID: ClientID,\n  clientGroupID: ClientGroupID,\n  schemaVersion: string,\n  puller: Puller,\n  requestID: string,\n  store: Store,\n  formatVersion: FormatVersion,\n  lc: LogContext,\n  createSyncBranch = true,\n): Promise<BeginPullResponseV1> {\n  const baseCookie = await withRead(store, async dagRead => {\n    const mainHeadHash = await dagRead.getHead(DEFAULT_HEAD_NAME);\n    if (!mainHeadHash) {\n      throw new Error('Internal no main head found');\n    }\n    const baseSnapshot = await baseSnapshotFromHash(mainHeadHash, dagRead);\n    const baseSnapshotMeta = baseSnapshot.meta;\n    assertSnapshotMetaDD31(baseSnapshotMeta);\n    return baseSnapshotMeta.cookieJSON;\n  });\n\n  const pullReq: PullRequestV1 = {\n    profileID,\n    clientGroupID,\n    cookie: baseCookie,\n    pullVersion: PULL_VERSION_DD31,\n    schemaVersion,\n  };\n\n  const {response, httpRequestInfo} = await callPuller(\n    lc,\n    puller,\n    pullReq,\n    requestID,\n  );\n\n  // If Puller did not get a pull response we still want to return the HTTP\n  // request info.\n  if (!response) {\n    return {\n      httpRequestInfo,\n      syncHead: emptyHash,\n    };\n  }\n\n  if (!createSyncBranch || isErrorResponse(response)) {\n    return {\n      httpRequestInfo,\n      pullResponse: response,\n      syncHead: emptyHash,\n    };\n  }\n\n  const result = await handlePullResponseV1(\n    lc,\n    store,\n    baseCookie,\n    response,\n    clientID,\n    formatVersion,\n  );\n\n  return {\n    httpRequestInfo,\n    pullResponse: response,\n    syncHead:\n      result.type === HandlePullResponseResultType.Applied\n        ? result.syncHead\n        : emptyHash,\n  };\n}\n\nasync function callPuller(\n  lc: LogContext,\n  puller: Puller,\n  pullReq: PullRequest,\n  requestID: string,\n): Promise<PullerResult> {\n  lc.debug?.('Starting pull...');\n  const pullStart = Date.now();\n  let pullerResult: PullerResult;\n  try {\n    pullerResult = await puller(pullReq, requestID);\n    lc.debug?.(\n      `...Pull ${pullerResult.response ? 'complete' : 'failed'} in `,\n      Date.now() - pullStart,\n      'ms',\n    );\n  } catch (e) {\n    throw new PullError(toError(e));\n  }\n  try {\n    assertPullerResultV1(pullerResult);\n    return pullerResult;\n  } catch (e) {\n    throw new ReportError('Invalid puller result', toError(e));\n  }\n}\n\ntype HandlePullResponseResult =\n  | {\n      type: HandlePullResponseResultType.Applied;\n      syncHead: Hash;\n    }\n  | {\n      type:\n        | HandlePullResponseResultType.NoOp\n        | HandlePullResponseResultType.CookieMismatch;\n    };\n\nfunction badOrderMessage(\n  name: string,\n  receivedValue: string,\n  lastSnapshotValue: string,\n) {\n  return `Received ${name} ${receivedValue} is < than last snapshot ${name} ${lastSnapshotValue}; ignoring client view`;\n}\n\nexport function handlePullResponseV1(\n  lc: LogContext,\n  store: Store,\n  expectedBaseCookie: FrozenJSONValue,\n  response: PullResponseOKV1Internal,\n  clientID: ClientID,\n  formatVersion: FormatVersion,\n): Promise<HandlePullResponseResult> {\n  // It is possible that another sync completed while we were pulling. Ensure\n  // that is not the case by re-checking the base snapshot.\n  return withWriteNoImplicitCommit(store, async dagWrite => {\n    const dagRead = dagWrite;\n    const mainHead = await dagRead.getHead(DEFAULT_HEAD_NAME);\n    if (mainHead === undefined) {\n      throw new Error('Main head disappeared');\n    }\n    const baseSnapshot = await baseSnapshotFromHash(mainHead, dagRead);\n    const baseSnapshotMeta = baseSnapshot.meta;\n    assertSnapshotMetaDD31(baseSnapshotMeta);\n    const baseCookie = baseSnapshotMeta.cookieJSON;\n\n    // TODO(MP) Here we are using whether the cookie has changed as a proxy for whether\n    // the base snapshot changed, which is the check we used to do. I don't think this\n    // is quite right. We need to firm up under what conditions we will/not accept an\n    // update from the server: https://github.com/rocicorp/replicache/issues/713.\n    // In DD31 this is expected to happen if a refresh occurs during a pull.\n    if (!deepEqual(expectedBaseCookie, baseCookie)) {\n      lc.debug?.(\n        'handlePullResponse: cookie mismatch, response is not applicable',\n      );\n      return {\n        type: HandlePullResponseResultType.CookieMismatch,\n      };\n    }\n\n    // Check that the lastMutationIDs are not going backwards.\n    for (const [clientID, lmidChange] of Object.entries(\n      response.lastMutationIDChanges,\n    )) {\n      const lastMutationID = baseSnapshotMeta.lastMutationIDs[clientID];\n      if (lastMutationID !== undefined && lmidChange < lastMutationID) {\n        throw new Error(\n          badOrderMessage(\n            `${clientID} lastMutationID`,\n            String(lmidChange),\n            String(lastMutationID),\n          ),\n        );\n      }\n    }\n\n    const frozenResponseCookie = deepFreeze(response.cookie);\n    if (compareCookies(frozenResponseCookie, baseCookie) < 0) {\n      throw new Error(\n        badOrderMessage(\n          'cookie',\n          JSON.stringify(frozenResponseCookie),\n          JSON.stringify(baseCookie),\n        ),\n      );\n    }\n\n    if (deepEqual(frozenResponseCookie, baseCookie)) {\n      if (response.patch.length > 0) {\n        lc.error?.(\n          `handlePullResponse: cookie ${JSON.stringify(\n            baseCookie,\n          )} did not change, but patch is not empty`,\n        );\n      }\n      if (Object.keys(response.lastMutationIDChanges).length > 0) {\n        lc.error?.(\n          `handlePullResponse: cookie ${JSON.stringify(\n            baseCookie,\n          )} did not change, but lastMutationIDChanges is not empty`,\n        );\n      }\n      // If the cookie doesn't change, it's a nop.\n      return {\n        type: HandlePullResponseResultType.NoOp,\n      };\n    }\n\n    const dbWrite = await newWriteSnapshotDD31(\n      baseSnapshot.chunk.hash,\n      {...baseSnapshotMeta.lastMutationIDs, ...response.lastMutationIDChanges},\n      frozenResponseCookie,\n      dagWrite,\n      clientID,\n      formatVersion,\n    );\n\n    await patch.apply(lc, dbWrite, response.patch);\n\n    return {\n      type: HandlePullResponseResultType.Applied,\n      syncHead: await dbWrite.commit(SYNC_HEAD_NAME),\n    };\n  });\n}\n\nexport function maybeEndPull<M extends LocalMeta>(\n  store: Store,\n  lc: LogContext,\n  expectedSyncHead: Hash,\n  clientID: ClientID,\n  diffConfig: DiffComputationConfig,\n  formatVersion: FormatVersion,\n): Promise<{\n  syncHead: Hash;\n  mainHead: Hash;\n  oldMainHead: Hash;\n  replayMutations: Commit<M>[];\n  diffs: DiffsMap;\n}> {\n  return withWriteNoImplicitCommit(store, async dagWrite => {\n    const dagRead = dagWrite;\n    // Ensure sync head is what the caller thinks it is.\n    const syncHeadHash = await dagRead.getHead(SYNC_HEAD_NAME);\n    if (syncHeadHash === undefined) {\n      throw new Error('Missing sync head');\n    }\n    if (syncHeadHash !== expectedSyncHead) {\n      lc.error?.(\n        'maybeEndPull, Wrong sync head. Expecting:',\n        expectedSyncHead,\n        'got:',\n        syncHeadHash,\n      );\n      throw new Error('Wrong sync head');\n    }\n\n    // Ensure another sync has not landed a new snapshot on the main chain.\n    // TODO: In DD31, it is expected that a newer snapshot might have appeared\n    // on the main chain. In that case, we just abort this pull.\n    const syncSnapshot = await baseSnapshotFromHash(syncHeadHash, dagRead);\n    const mainHeadHash = await dagRead.getHead(DEFAULT_HEAD_NAME);\n    if (mainHeadHash === undefined) {\n      throw new Error('Missing main head');\n    }\n    const mainSnapshot = await baseSnapshotFromHash(mainHeadHash, dagRead);\n\n    const {meta} = syncSnapshot;\n    const syncSnapshotBasis = meta.basisHash;\n    if (syncSnapshot === null) {\n      throw new Error('Sync snapshot with no basis');\n    }\n    if (syncSnapshotBasis !== mainSnapshot.chunk.hash) {\n      throw new Error('Overlapping syncs');\n    }\n\n    // Collect pending commits from the main chain and determine which\n    // of them if any need to be replayed.\n    const [syncHead, commits] = await Promise.all([\n      commitFromHash(syncHeadHash, dagRead),\n      localMutations(mainHeadHash, dagRead),\n    ]);\n    const syncHeadMutationIDs = new Map<ClientID, Promise<number>>();\n    const pending: Commit<M>[] = [];\n    // Kick off all mutation ID loads before awaiting.\n    for (const commit of commits) {\n      assert(\n        commitIsLocalDD31(commit),\n        'Expected commit to be a local DD31 commit',\n      );\n      const cid = commit.meta.clientID;\n      if (!syncHeadMutationIDs.has(cid)) {\n        syncHeadMutationIDs.set(cid, syncHead.getMutationID(cid, dagRead));\n      }\n    }\n    for (const commit of commits) {\n      const cid = commit.meta.clientID;\n      if (commit.meta.mutationID > (await syncHeadMutationIDs.get(cid)!)) {\n        // We know that the dag can only contain either LocalMetaSDD or LocalMetaDD31\n        pending.push(commit as Commit<M>);\n      }\n    }\n    // pending() gave us the pending mutations in sync-head-first order whereas\n    // caller wants them in the order to replay (lower mutation ids first).\n    pending.reverse();\n\n    // We return the keys that changed due to this pull. This is used by\n    // subscriptions in the JS API when there are no more pending mutations.\n    const diffsMap = new DiffsMap();\n\n    // Return replay commits if any.\n    if (pending.length > 0) {\n      return {\n        syncHead: syncHeadHash,\n        oldMainHead: mainHeadHash,\n        mainHead: mainHeadHash,\n        replayMutations: pending,\n        // The changed keys are not reported when further replays are\n        // needed. The diffs will be reported at the end when there\n        // are no more mutations to be replay and then it will be reported\n        // relative to DEFAULT_HEAD_NAME.\n        diffs: diffsMap,\n      };\n    }\n\n    // TODO check invariants\n\n    // Compute diffs (changed keys) for value map and index maps.\n    const mainHead = await commitFromHash(mainHeadHash, dagRead);\n    if (diffConfig.shouldComputeDiffs()) {\n      const mainHeadMap = new BTreeRead(\n        dagRead,\n        formatVersion,\n        mainHead.valueHash,\n      );\n      const syncHeadMap = new BTreeRead(\n        dagRead,\n        formatVersion,\n        syncHead.valueHash,\n      );\n      const valueDiff = await diff(mainHeadMap, syncHeadMap);\n      diffsMap.set('', valueDiff);\n      await addDiffsForIndexes(\n        mainHead,\n        syncHead,\n        dagRead,\n        diffsMap,\n        diffConfig,\n        formatVersion,\n      );\n    }\n\n    // No mutations to replay so set the main head to the sync head and sync complete!\n    await Promise.all([\n      dagWrite.setHead(DEFAULT_HEAD_NAME, syncHeadHash),\n      dagWrite.removeHead(SYNC_HEAD_NAME),\n    ]);\n    await dagWrite.commit();\n    // main head was set to sync head\n    const newMainHeadHash = syncHeadHash;\n\n    if (lc.debug) {\n      const [oldLastMutationID, oldCookie] = snapshotMetaParts(\n        mainSnapshot,\n        clientID,\n      );\n      const [newLastMutationID, newCookie] = snapshotMetaParts(\n        syncSnapshot,\n        clientID,\n      );\n      lc.debug(\n        `Successfully pulled new snapshot with lastMutationID:`,\n        newLastMutationID,\n        `(prev:`,\n        oldLastMutationID,\n        `), cookie: `,\n        newCookie,\n        `(prev:`,\n        oldCookie,\n        `), sync head hash:`,\n        syncHeadHash,\n        ', main head hash:',\n        mainHeadHash,\n        `, valueHash:`,\n        syncHead.valueHash,\n        `(prev:`,\n        mainSnapshot.valueHash,\n      );\n    }\n\n    return {\n      syncHead: syncHeadHash,\n      oldMainHead: mainHeadHash,\n      mainHead: newMainHeadHash,\n      replayMutations: [],\n      diffs: diffsMap,\n    };\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAkFA,eAAsB,YACpB,WACA,UACA,eACA,eACA,QACA,WACA,OACA,eACA,IACA,mBAAmB,MACW;CAC9B,MAAM,aAAa,MAAM,SAAS,OAAO,OAAM,YAAW;EACxD,MAAM,eAAe,MAAM,QAAQ,QAAQ,iBAAiB;EAC5D,IAAI,CAAC,cACH,MAAM,IAAI,MAAM,6BAA6B;EAG/C,MAAM,oBAAmB,MADE,qBAAqB,cAAc,OAAO,GAC/B;EACtC,uBAAuB,gBAAgB;EACvC,OAAO,iBAAiB;CAC1B,CAAC;CAUD,MAAM,EAAC,UAAU,oBAAmB,MAAM,WACxC,IACA,QACA;EAVA;EACA;EACA,QAAQ;EACR,aAAA;EACA;CAMA,GACA,SACF;CAIA,IAAI,CAAC,UACH,OAAO;EACL;EACA,UAAU;CACZ;CAGF,IAAI,CAAC,oBAAoB,gBAAgB,QAAQ,GAC/C,OAAO;EACL;EACA,cAAc;EACd,UAAU;CACZ;CAGF,MAAM,SAAS,MAAM,qBACnB,IACA,OACA,YACA,UACA,UACA,aACF;CAEA,OAAO;EACL;EACA,cAAc;EACd,UACE,OAAO,SAAS,IACZ,OAAO,WACP;CACR;AACF;AAEA,eAAe,WACb,IACA,QACA,SACA,WACuB;CACvB,GAAG,QAAQ,kBAAkB;CAC7B,MAAM,YAAY,KAAK,IAAI;CAC3B,IAAI;CACJ,IAAI;EACF,eAAe,MAAM,OAAO,SAAS,SAAS;EAC9C,GAAG,QACD,WAAW,aAAa,WAAW,aAAa,SAAS,OACzD,KAAK,IAAI,IAAI,WACb,IACF;CACF,SAAS,GAAG;EACV,MAAM,IAAI,UAAU,QAAQ,CAAC,CAAC;CAChC;CACA,IAAI;EACF,qBAAqB,YAAY;EACjC,OAAO;CACT,SAAS,GAAG;EACV,MAAM,IAAI,YAAY,yBAAyB,QAAQ,CAAC,CAAC;CAC3D;AACF;AAaA,SAAS,gBACP,MACA,eACA,mBACA;CACA,OAAO,YAAY,KAAK,GAAG,cAAc,2BAA2B,KAAK,GAAG,kBAAkB;AAChG;AAEA,SAAgB,qBACd,IACA,OACA,oBACA,UACA,UACA,eACmC;CAGnC,OAAO,0BAA0B,OAAO,OAAM,aAAY;EACxD,MAAM,UAAU;EAChB,MAAM,WAAW,MAAM,QAAQ,QAAQ,iBAAiB;EACxD,IAAI,aAAa,KAAA,GACf,MAAM,IAAI,MAAM,uBAAuB;EAEzC,MAAM,eAAe,MAAM,qBAAqB,UAAU,OAAO;EACjE,MAAM,mBAAmB,aAAa;EACtC,uBAAuB,gBAAgB;EACvC,MAAM,aAAa,iBAAiB;EAOpC,IAAI,CAAC,UAAU,oBAAoB,UAAU,GAAG;GAC9C,GAAG,QACD,iEACF;GACA,OAAO,EACL,MAAM,EACR;EACF;EAGA,KAAK,MAAM,CAAC,UAAU,eAAe,OAAO,QAC1C,SAAS,qBACX,GAAG;GACD,MAAM,iBAAiB,iBAAiB,gBAAgB;GACxD,IAAI,mBAAmB,KAAA,KAAa,aAAa,gBAC/C,MAAM,IAAI,MACR,gBACE,GAAG,SAAS,kBACZ,OAAO,UAAU,GACjB,OAAO,cAAc,CACvB,CACF;EAEJ;EAEA,MAAM,uBAAuB,WAAW,SAAS,MAAM;EACvD,IAAI,eAAe,sBAAsB,UAAU,IAAI,GACrD,MAAM,IAAI,MACR,gBACE,UACA,KAAK,UAAU,oBAAoB,GACnC,KAAK,UAAU,UAAU,CAC3B,CACF;EAGF,IAAI,UAAU,sBAAsB,UAAU,GAAG;GAC/C,IAAI,SAAS,MAAM,SAAS,GAC1B,GAAG,QACD,8BAA8B,KAAK,UACjC,UACF,EAAE,wCACJ;GAEF,IAAI,OAAO,KAAK,SAAS,qBAAqB,EAAE,SAAS,GACvD,GAAG,QACD,8BAA8B,KAAK,UACjC,UACF,EAAE,wDACJ;GAGF,OAAO,EACL,MAAM,EACR;EACF;EAEA,MAAM,UAAU,MAAM,qBACpB,aAAa,MAAM,MACnB;GAAC,GAAG,iBAAiB;GAAiB,GAAG,SAAS;EAAqB,GACvE,sBACA,UACA,UACA,aACF;EAEA,MAAM,MAAY,IAAI,SAAS,SAAS,KAAK;EAE7C,OAAO;GACL,MAAM;GACN,UAAU,MAAM,QAAQ,OAAO,cAAc;EAC/C;CACF,CAAC;AACH;AAEA,SAAgB,aACd,OACA,IACA,kBACA,UACA,YACA,eAOC;CACD,OAAO,0BAA0B,OAAO,OAAM,aAAY;EACxD,MAAM,UAAU;EAEhB,MAAM,eAAe,MAAM,QAAQ,QAAQ,cAAc;EACzD,IAAI,iBAAiB,KAAA,GACnB,MAAM,IAAI,MAAM,mBAAmB;EAErC,IAAI,iBAAiB,kBAAkB;GACrC,GAAG,QACD,6CACA,kBACA,QACA,YACF;GACA,MAAM,IAAI,MAAM,iBAAiB;EACnC;EAKA,MAAM,eAAe,MAAM,qBAAqB,cAAc,OAAO;EACrE,MAAM,eAAe,MAAM,QAAQ,QAAQ,iBAAiB;EAC5D,IAAI,iBAAiB,KAAA,GACnB,MAAM,IAAI,MAAM,mBAAmB;EAErC,MAAM,eAAe,MAAM,qBAAqB,cAAc,OAAO;EAErE,MAAM,EAAC,SAAQ;EACf,MAAM,oBAAoB,KAAK;EAC/B,IAAI,iBAAiB,MACnB,MAAM,IAAI,MAAM,6BAA6B;EAE/C,IAAI,sBAAsB,aAAa,MAAM,MAC3C,MAAM,IAAI,MAAM,mBAAmB;EAKrC,MAAM,CAAC,UAAU,WAAW,MAAM,QAAQ,IAAI,CAC5C,eAAe,cAAc,OAAO,GACpC,eAAe,cAAc,OAAO,CACtC,CAAC;EACD,MAAM,sCAAsB,IAAI,IAA+B;EAC/D,MAAM,UAAuB,CAAC;EAE9B,KAAK,MAAM,UAAU,SAAS;GAC5B,OACE,kBAAkB,MAAM,GACxB,2CACF;GACA,MAAM,MAAM,OAAO,KAAK;GACxB,IAAI,CAAC,oBAAoB,IAAI,GAAG,GAC9B,oBAAoB,IAAI,KAAK,SAAS,cAAc,KAAK,OAAO,CAAC;EAErE;EACA,KAAK,MAAM,UAAU,SAAS;GAC5B,MAAM,MAAM,OAAO,KAAK;GACxB,IAAI,OAAO,KAAK,aAAc,MAAM,oBAAoB,IAAI,GAAG,GAE7D,QAAQ,KAAK,MAAmB;EAEpC;EAGA,QAAQ,QAAQ;EAIhB,MAAM,WAAW,IAAI,SAAS;EAG9B,IAAI,QAAQ,SAAS,GACnB,OAAO;GACL,UAAU;GACV,aAAa;GACb,UAAU;GACV,iBAAiB;GAKjB,OAAO;EACT;EAMF,MAAM,WAAW,MAAM,eAAe,cAAc,OAAO;EAC3D,IAAI,WAAW,mBAAmB,GAAG;GAWnC,MAAM,YAAY,MAAM,KAAK,IAVL,UACtB,SACA,eACA,SAAS,SAOkB,GAAa,IALlB,UACtB,SACA,eACA,SAAS,SAE+B,CAAW;GACrD,SAAS,IAAI,IAAI,SAAS;GAC1B,MAAM,mBACJ,UACA,UACA,SACA,UACA,YACA,aACF;EACF;EAGA,MAAM,QAAQ,IAAI,CAChB,SAAS,QAAQ,mBAAmB,YAAY,GAChD,SAAS,WAAW,cAAc,CACpC,CAAC;EACD,MAAM,SAAS,OAAO;EAEtB,MAAM,kBAAkB;EAExB,IAAI,GAAG,OAAO;GACZ,MAAM,CAAC,mBAAmB,aAAa,kBACrC,cACA,QACF;GACA,MAAM,CAAC,mBAAmB,aAAa,kBACrC,cACA,QACF;GACA,GAAG,MACD,yDACA,mBACA,UACA,mBACA,eACA,WACA,UACA,WACA,sBACA,cACA,qBACA,cACA,gBACA,SAAS,WACT,UACA,aAAa,SACf;EACF;EAEA,OAAO;GACL,UAAU;GACV,aAAa;GACb,UAAU;GACV,iBAAiB,CAAC;GAClB,OAAO;EACT;CACF,CAAC;AACH"}
+{"version":3,"file":"pull.js","names":[],"sources":["../../../../../replicache/src/sync/pull.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assert} from '../../../shared/src/asserts.ts';\nimport {deepEqual} from '../../../shared/src/json.ts';\nimport {diff} from '../btree/diff.ts';\nimport {BTreeRead} from '../btree/read.ts';\nimport {compareCookies, type Cookie} from '../cookies.ts';\nimport type {Store} from '../dag/store.ts';\nimport type {Commit} from '../db/commit.ts';\nimport {\n  assertSnapshotMetaDD31,\n  baseSnapshotFromHash,\n  commitFromHash,\n  commitIsLocalDD31,\n  DEFAULT_HEAD_NAME,\n  type LocalMeta,\n  localMutations,\n  snapshotMetaParts,\n} from '../db/commit.ts';\nimport {newWriteSnapshotDD31} from '../db/write.ts';\nimport {isErrorResponse} from '../error-responses.ts';\nimport type * as FormatVersion from '../format-version-enum.ts';\nimport {deepFreeze, type FrozenJSONValue} from '../frozen-json.ts';\nimport {assertPullerResultV1} from '../get-default-puller.ts';\nimport {emptyHash, type Hash} from '../hash.ts';\nimport type {HTTPRequestInfo} from '../http-request-info.ts';\nimport type {\n  Puller,\n  PullerResult,\n  PullResponseOKV1Internal,\n  PullResponseV1,\n} from '../puller.ts';\nimport {ReportError} from '../report-error.ts';\nimport {toError} from '../to-error.ts';\nimport {withRead, withWriteNoImplicitCommit} from '../with-transactions.ts';\nimport {\n  addDiffsForIndexes,\n  type DiffComputationConfig,\n  DiffsMap,\n} from './diff.ts';\nimport * as HandlePullResponseResultType from './handle-pull-response-result-type-enum.ts';\nimport type {ClientGroupID, ClientID} from './ids.ts';\nimport * as patch from './patch.ts';\nimport {PullError} from './pull-error.ts';\nimport {SYNC_HEAD_NAME} from './sync-head-name.ts';\n\ntype FormatVersion = (typeof FormatVersion)[keyof typeof FormatVersion];\n\nexport const PULL_VERSION_SDD = 0;\nexport const PULL_VERSION_DD31 = 1;\n\n/**\n * The JSON value used as the body when doing a POST to the [pull\n * endpoint](/reference/server-pull).\n */\nexport type PullRequest = PullRequestV1;\n\n/**\n * The JSON value used as the body when doing a POST to the [pull\n * endpoint](/reference/server-pull).\n */\nexport type PullRequestV1 = {\n  pullVersion: 1;\n  // schemaVersion can optionally be used by the customer's app\n  // to indicate to the data layer what format of Client View the\n  // app understands.\n  schemaVersion: string;\n  profileID: string;\n  cookie: Cookie;\n\n  clientGroupID: ClientGroupID;\n};\n\nexport function isPullRequestV1(pr: PullRequest): pr is PullRequestV1 {\n  return pr.pullVersion === PULL_VERSION_DD31;\n}\n\nexport type BeginPullResponseV1 = {\n  httpRequestInfo: HTTPRequestInfo;\n  pullResponse?: PullResponseV1;\n  syncHead: Hash;\n};\n\nexport async function beginPullV1(\n  profileID: string,\n  clientID: ClientID,\n  clientGroupID: ClientGroupID,\n  schemaVersion: string,\n  puller: Puller,\n  requestID: string,\n  store: Store,\n  formatVersion: FormatVersion,\n  lc: LogContext,\n  createSyncBranch = true,\n): Promise<BeginPullResponseV1> {\n  const baseCookie = await withRead(store, async dagRead => {\n    const mainHeadHash = await dagRead.getHead(DEFAULT_HEAD_NAME);\n    if (!mainHeadHash) {\n      throw new Error('Internal no main head found');\n    }\n    const baseSnapshot = await baseSnapshotFromHash(mainHeadHash, dagRead);\n    const baseSnapshotMeta = baseSnapshot.meta;\n    assertSnapshotMetaDD31(baseSnapshotMeta);\n    return baseSnapshotMeta.cookieJSON;\n  });\n\n  const pullReq: PullRequestV1 = {\n    profileID,\n    clientGroupID,\n    cookie: baseCookie,\n    pullVersion: PULL_VERSION_DD31,\n    schemaVersion,\n  };\n\n  const {response, httpRequestInfo} = await callPuller(\n    lc,\n    puller,\n    pullReq,\n    requestID,\n  );\n\n  // If Puller did not get a pull response we still want to return the HTTP\n  // request info.\n  if (!response) {\n    return {\n      httpRequestInfo,\n      syncHead: emptyHash,\n    };\n  }\n\n  if (!createSyncBranch || isErrorResponse(response)) {\n    return {\n      httpRequestInfo,\n      pullResponse: response,\n      syncHead: emptyHash,\n    };\n  }\n\n  const result = await handlePullResponseV1(\n    lc,\n    store,\n    baseCookie,\n    response,\n    clientID,\n    formatVersion,\n  );\n\n  return {\n    httpRequestInfo,\n    pullResponse: response,\n    syncHead:\n      result.type === HandlePullResponseResultType.Applied\n        ? result.syncHead\n        : emptyHash,\n  };\n}\n\nasync function callPuller(\n  lc: LogContext,\n  puller: Puller,\n  pullReq: PullRequest,\n  requestID: string,\n): Promise<PullerResult> {\n  lc.debug?.('Starting pull...');\n  const pullStart = Date.now();\n  let pullerResult: PullerResult;\n  try {\n    pullerResult = await puller(pullReq, requestID);\n    lc.debug?.(\n      `...Pull ${pullerResult.response ? 'complete' : 'failed'} in `,\n      Date.now() - pullStart,\n      'ms',\n    );\n  } catch (e) {\n    throw new PullError(toError(e));\n  }\n  try {\n    assertPullerResultV1(pullerResult);\n    return pullerResult;\n  } catch (e) {\n    throw new ReportError('Invalid puller result', toError(e));\n  }\n}\n\ntype HandlePullResponseResult =\n  | {\n      type: HandlePullResponseResultType.Applied;\n      syncHead: Hash;\n    }\n  | {\n      type:\n        | HandlePullResponseResultType.NoOp\n        | HandlePullResponseResultType.CookieMismatch;\n    };\n\nfunction badOrderMessage(\n  name: string,\n  receivedValue: string,\n  lastSnapshotValue: string,\n) {\n  return `Received ${name} ${receivedValue} is < than last snapshot ${name} ${lastSnapshotValue}; ignoring client view`;\n}\n\nexport function handlePullResponseV1(\n  lc: LogContext,\n  store: Store,\n  expectedBaseCookie: FrozenJSONValue,\n  response: PullResponseOKV1Internal,\n  clientID: ClientID,\n  formatVersion: FormatVersion,\n): Promise<HandlePullResponseResult> {\n  // It is possible that another sync completed while we were pulling. Ensure\n  // that is not the case by re-checking the base snapshot.\n  return withWriteNoImplicitCommit(store, async dagWrite => {\n    const dagRead = dagWrite;\n    const mainHead = await dagRead.getHead(DEFAULT_HEAD_NAME);\n    if (mainHead === undefined) {\n      throw new Error('Main head disappeared');\n    }\n    const baseSnapshot = await baseSnapshotFromHash(mainHead, dagRead);\n    const baseSnapshotMeta = baseSnapshot.meta;\n    assertSnapshotMetaDD31(baseSnapshotMeta);\n    const baseCookie = baseSnapshotMeta.cookieJSON;\n\n    // TODO(MP) Here we are using whether the cookie has changed as a proxy for whether\n    // the base snapshot changed, which is the check we used to do. I don't think this\n    // is quite right. We need to firm up under what conditions we will/not accept an\n    // update from the server: https://github.com/rocicorp/replicache/issues/713.\n    // In DD31 this is expected to happen if a refresh occurs during a pull.\n    if (!deepEqual(expectedBaseCookie, baseCookie)) {\n      lc.debug?.(\n        'handlePullResponse: cookie mismatch, response is not applicable',\n      );\n      return {\n        type: HandlePullResponseResultType.CookieMismatch,\n      };\n    }\n\n    // Check that the lastMutationIDs are not going backwards.\n    for (const [clientID, lmidChange] of Object.entries(\n      response.lastMutationIDChanges,\n    )) {\n      const lastMutationID = baseSnapshotMeta.lastMutationIDs[clientID];\n      if (lastMutationID !== undefined && lmidChange < lastMutationID) {\n        throw new Error(\n          badOrderMessage(\n            `${clientID} lastMutationID`,\n            String(lmidChange),\n            String(lastMutationID),\n          ),\n        );\n      }\n    }\n\n    const frozenResponseCookie = deepFreeze(response.cookie);\n    if (compareCookies(frozenResponseCookie, baseCookie) < 0) {\n      throw new Error(\n        badOrderMessage(\n          'cookie',\n          JSON.stringify(frozenResponseCookie),\n          JSON.stringify(baseCookie),\n        ),\n      );\n    }\n\n    if (deepEqual(frozenResponseCookie, baseCookie)) {\n      if (response.patch.length > 0) {\n        lc.error?.(\n          `handlePullResponse: cookie ${JSON.stringify(\n            baseCookie,\n          )} did not change, but patch is not empty`,\n        );\n      }\n      if (Object.keys(response.lastMutationIDChanges).length > 0) {\n        lc.error?.(\n          `handlePullResponse: cookie ${JSON.stringify(\n            baseCookie,\n          )} did not change, but lastMutationIDChanges is not empty`,\n        );\n      }\n      // If the cookie doesn't change, it's a nop.\n      return {\n        type: HandlePullResponseResultType.NoOp,\n      };\n    }\n\n    const dbWrite = await newWriteSnapshotDD31(\n      baseSnapshot.chunk.hash,\n      {...baseSnapshotMeta.lastMutationIDs, ...response.lastMutationIDChanges},\n      frozenResponseCookie,\n      dagWrite,\n      clientID,\n      formatVersion,\n    );\n\n    await patch.apply(lc, dbWrite, response.patch);\n\n    return {\n      type: HandlePullResponseResultType.Applied,\n      syncHead: await dbWrite.commit(SYNC_HEAD_NAME),\n    };\n  });\n}\n\nexport function maybeEndPull<M extends LocalMeta>(\n  store: Store,\n  lc: LogContext,\n  expectedSyncHead: Hash,\n  clientID: ClientID,\n  diffConfig: DiffComputationConfig,\n  formatVersion: FormatVersion,\n): Promise<{\n  syncHead: Hash;\n  mainHead: Hash;\n  oldMainHead: Hash;\n  replayMutations: Commit<M>[];\n  diffs: DiffsMap;\n}> {\n  return withWriteNoImplicitCommit(store, async dagWrite => {\n    const dagRead = dagWrite;\n    // Ensure sync head is what the caller thinks it is.\n    const syncHeadHash = await dagRead.getHead(SYNC_HEAD_NAME);\n    if (syncHeadHash === undefined) {\n      throw new Error('Missing sync head');\n    }\n    if (syncHeadHash !== expectedSyncHead) {\n      lc.error?.(\n        'maybeEndPull, Wrong sync head. Expecting:',\n        expectedSyncHead,\n        'got:',\n        syncHeadHash,\n      );\n      throw new Error('Wrong sync head');\n    }\n\n    // Ensure another sync has not landed a new snapshot on the main chain.\n    // TODO: In DD31, it is expected that a newer snapshot might have appeared\n    // on the main chain. In that case, we just abort this pull.\n    const syncSnapshot = await baseSnapshotFromHash(syncHeadHash, dagRead);\n    const mainHeadHash = await dagRead.getHead(DEFAULT_HEAD_NAME);\n    if (mainHeadHash === undefined) {\n      throw new Error('Missing main head');\n    }\n    const mainSnapshot = await baseSnapshotFromHash(mainHeadHash, dagRead);\n\n    const {meta} = syncSnapshot;\n    const syncSnapshotBasis = meta.basisHash;\n    if (syncSnapshot === null) {\n      throw new Error('Sync snapshot with no basis');\n    }\n    if (syncSnapshotBasis !== mainSnapshot.chunk.hash) {\n      throw new Error('Overlapping syncs');\n    }\n\n    // Collect pending commits from the main chain and determine which\n    // of them if any need to be replayed.\n    const [syncHead, commits] = await Promise.all([\n      commitFromHash(syncHeadHash, dagRead),\n      localMutations(mainHeadHash, dagRead),\n    ]);\n    const syncHeadMutationIDs = new Map<ClientID, Promise<number>>();\n    const pending: Commit<M>[] = [];\n    // Kick off all mutation ID loads before awaiting.\n    for (const commit of commits) {\n      assert(\n        commitIsLocalDD31(commit),\n        'Expected commit to be a local DD31 commit',\n      );\n      const cid = commit.meta.clientID;\n      if (!syncHeadMutationIDs.has(cid)) {\n        syncHeadMutationIDs.set(cid, syncHead.getMutationID(cid, dagRead));\n      }\n    }\n    for (const commit of commits) {\n      const cid = commit.meta.clientID;\n      if (commit.meta.mutationID > (await syncHeadMutationIDs.get(cid)!)) {\n        // We know that the dag can only contain either LocalMetaSDD or LocalMetaDD31\n        pending.push(commit as Commit<M>);\n      }\n    }\n    // pending() gave us the pending mutations in sync-head-first order whereas\n    // caller wants them in the order to replay (lower mutation ids first).\n    pending.reverse();\n\n    // We return the keys that changed due to this pull. This is used by\n    // subscriptions in the JS API when there are no more pending mutations.\n    const diffsMap = new DiffsMap();\n\n    // Return replay commits if any.\n    if (pending.length > 0) {\n      return {\n        syncHead: syncHeadHash,\n        oldMainHead: mainHeadHash,\n        mainHead: mainHeadHash,\n        replayMutations: pending,\n        // The changed keys are not reported when further replays are\n        // needed. The diffs will be reported at the end when there\n        // are no more mutations to be replay and then it will be reported\n        // relative to DEFAULT_HEAD_NAME.\n        diffs: diffsMap,\n      };\n    }\n\n    // TODO check invariants\n\n    // Compute diffs (changed keys) for value map and index maps.\n    const mainHead = await commitFromHash(mainHeadHash, dagRead);\n    if (diffConfig.shouldComputeDiffs()) {\n      const mainHeadMap = new BTreeRead(\n        dagRead,\n        formatVersion,\n        mainHead.valueHash,\n      );\n      const syncHeadMap = new BTreeRead(\n        dagRead,\n        formatVersion,\n        syncHead.valueHash,\n      );\n      const valueDiff = await diff(mainHeadMap, syncHeadMap);\n      diffsMap.set('', valueDiff);\n      await addDiffsForIndexes(\n        mainHead,\n        syncHead,\n        dagRead,\n        diffsMap,\n        diffConfig,\n        formatVersion,\n      );\n    }\n\n    // No mutations to replay so set the main head to the sync head and sync complete!\n    await Promise.all([\n      dagWrite.setHead(DEFAULT_HEAD_NAME, syncHeadHash),\n      dagWrite.removeHead(SYNC_HEAD_NAME),\n    ]);\n    await dagWrite.commit();\n    // main head was set to sync head\n    const newMainHeadHash = syncHeadHash;\n\n    if (lc.debug) {\n      const [oldLastMutationID, oldCookie] = snapshotMetaParts(\n        mainSnapshot,\n        clientID,\n      );\n      const [newLastMutationID, newCookie] = snapshotMetaParts(\n        syncSnapshot,\n        clientID,\n      );\n      lc.debug(\n        `Successfully pulled new snapshot with lastMutationID:`,\n        newLastMutationID,\n        `(prev:`,\n        oldLastMutationID,\n        `), cookie: `,\n        newCookie,\n        `(prev:`,\n        oldCookie,\n        `), sync head hash:`,\n        syncHeadHash,\n        ', main head hash:',\n        mainHeadHash,\n        `, valueHash:`,\n        syncHead.valueHash,\n        `(prev:`,\n        mainSnapshot.valueHash,\n      );\n    }\n\n    return {\n      syncHead: syncHeadHash,\n      oldMainHead: mainHeadHash,\n      mainHead: newMainHeadHash,\n      replayMutations: [],\n      diffs: diffsMap,\n    };\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAkFA,eAAsB,YACpB,WACA,UACA,eACA,eACA,QACA,WACA,OACA,eACA,IACA,mBAAmB,MACW;CAC9B,MAAM,aAAa,MAAM,SAAS,OAAO,OAAM,YAAW;EACxD,MAAM,eAAe,MAAM,QAAQ,QAAQ,kBAAkB;AAC7D,MAAI,CAAC,aACH,OAAM,IAAI,MAAM,8BAA8B;EAGhD,MAAM,oBADe,MAAM,qBAAqB,cAAc,QAAQ,EAChC;AACtC,yBAAuB,iBAAiB;AACxC,SAAO,iBAAiB;GACxB;CAUF,MAAM,EAAC,UAAU,oBAAmB,MAAM,WACxC,IACA,QAV6B;EAC7B;EACA;EACA,QAAQ;EACR,aAAA;EACA;EACD,EAMC,UACD;AAID,KAAI,CAAC,SACH,QAAO;EACL;EACA,UAAU;EACX;AAGH,KAAI,CAAC,oBAAoB,gBAAgB,SAAS,CAChD,QAAO;EACL;EACA,cAAc;EACd,UAAU;EACX;CAGH,MAAM,SAAS,MAAM,qBACnB,IACA,OACA,YACA,UACA,UACA,cACD;AAED,QAAO;EACL;EACA,cAAc;EACd,UACE,OAAO,SAAS,IACZ,OAAO,WACP;EACP;;AAGH,eAAe,WACb,IACA,QACA,SACA,WACuB;AACvB,IAAG,QAAQ,mBAAmB;CAC9B,MAAM,YAAY,KAAK,KAAK;CAC5B,IAAI;AACJ,KAAI;AACF,iBAAe,MAAM,OAAO,SAAS,UAAU;AAC/C,KAAG,QACD,WAAW,aAAa,WAAW,aAAa,SAAS,OACzD,KAAK,KAAK,GAAG,WACb,KACD;UACM,GAAG;AACV,QAAM,IAAI,UAAU,QAAQ,EAAE,CAAC;;AAEjC,KAAI;AACF,uBAAqB,aAAa;AAClC,SAAO;UACA,GAAG;AACV,QAAM,IAAI,YAAY,yBAAyB,QAAQ,EAAE,CAAC;;;AAe9D,SAAS,gBACP,MACA,eACA,mBACA;AACA,QAAO,YAAY,KAAK,GAAG,cAAc,2BAA2B,KAAK,GAAG,kBAAkB;;AAGhG,SAAgB,qBACd,IACA,OACA,oBACA,UACA,UACA,eACmC;AAGnC,QAAO,0BAA0B,OAAO,OAAM,aAAY;EACxD,MAAM,UAAU;EAChB,MAAM,WAAW,MAAM,QAAQ,QAAQ,kBAAkB;AACzD,MAAI,aAAa,KAAA,EACf,OAAM,IAAI,MAAM,wBAAwB;EAE1C,MAAM,eAAe,MAAM,qBAAqB,UAAU,QAAQ;EAClE,MAAM,mBAAmB,aAAa;AACtC,yBAAuB,iBAAiB;EACxC,MAAM,aAAa,iBAAiB;AAOpC,MAAI,CAAC,UAAU,oBAAoB,WAAW,EAAE;AAC9C,MAAG,QACD,kEACD;AACD,UAAO,EACL,MAAM,GACP;;AAIH,OAAK,MAAM,CAAC,UAAU,eAAe,OAAO,QAC1C,SAAS,sBACV,EAAE;GACD,MAAM,iBAAiB,iBAAiB,gBAAgB;AACxD,OAAI,mBAAmB,KAAA,KAAa,aAAa,eAC/C,OAAM,IAAI,MACR,gBACE,GAAG,SAAS,kBACZ,OAAO,WAAW,EAClB,OAAO,eAAe,CACvB,CACF;;EAIL,MAAM,uBAAuB,WAAW,SAAS,OAAO;AACxD,MAAI,eAAe,sBAAsB,WAAW,GAAG,EACrD,OAAM,IAAI,MACR,gBACE,UACA,KAAK,UAAU,qBAAqB,EACpC,KAAK,UAAU,WAAW,CAC3B,CACF;AAGH,MAAI,UAAU,sBAAsB,WAAW,EAAE;AAC/C,OAAI,SAAS,MAAM,SAAS,EAC1B,IAAG,QACD,8BAA8B,KAAK,UACjC,WACD,CAAC,yCACH;AAEH,OAAI,OAAO,KAAK,SAAS,sBAAsB,CAAC,SAAS,EACvD,IAAG,QACD,8BAA8B,KAAK,UACjC,WACD,CAAC,yDACH;AAGH,UAAO,EACL,MAAM,GACP;;EAGH,MAAM,UAAU,MAAM,qBACpB,aAAa,MAAM,MACnB;GAAC,GAAG,iBAAiB;GAAiB,GAAG,SAAS;GAAsB,EACxE,sBACA,UACA,UACA,cACD;AAED,QAAM,MAAY,IAAI,SAAS,SAAS,MAAM;AAE9C,SAAO;GACL,MAAM;GACN,UAAU,MAAM,QAAQ,OAAO,eAAe;GAC/C;GACD;;AAGJ,SAAgB,aACd,OACA,IACA,kBACA,UACA,YACA,eAOC;AACD,QAAO,0BAA0B,OAAO,OAAM,aAAY;EACxD,MAAM,UAAU;EAEhB,MAAM,eAAe,MAAM,QAAQ,QAAQ,eAAe;AAC1D,MAAI,iBAAiB,KAAA,EACnB,OAAM,IAAI,MAAM,oBAAoB;AAEtC,MAAI,iBAAiB,kBAAkB;AACrC,MAAG,QACD,6CACA,kBACA,QACA,aACD;AACD,SAAM,IAAI,MAAM,kBAAkB;;EAMpC,MAAM,eAAe,MAAM,qBAAqB,cAAc,QAAQ;EACtE,MAAM,eAAe,MAAM,QAAQ,QAAQ,kBAAkB;AAC7D,MAAI,iBAAiB,KAAA,EACnB,OAAM,IAAI,MAAM,oBAAoB;EAEtC,MAAM,eAAe,MAAM,qBAAqB,cAAc,QAAQ;EAEtE,MAAM,EAAC,SAAQ;EACf,MAAM,oBAAoB,KAAK;AAC/B,MAAI,iBAAiB,KACnB,OAAM,IAAI,MAAM,8BAA8B;AAEhD,MAAI,sBAAsB,aAAa,MAAM,KAC3C,OAAM,IAAI,MAAM,oBAAoB;EAKtC,MAAM,CAAC,UAAU,WAAW,MAAM,QAAQ,IAAI,CAC5C,eAAe,cAAc,QAAQ,EACrC,eAAe,cAAc,QAAQ,CACtC,CAAC;EACF,MAAM,sCAAsB,IAAI,KAAgC;EAChE,MAAM,UAAuB,EAAE;AAE/B,OAAK,MAAM,UAAU,SAAS;AAC5B,UACE,kBAAkB,OAAO,EACzB,4CACD;GACD,MAAM,MAAM,OAAO,KAAK;AACxB,OAAI,CAAC,oBAAoB,IAAI,IAAI,CAC/B,qBAAoB,IAAI,KAAK,SAAS,cAAc,KAAK,QAAQ,CAAC;;AAGtE,OAAK,MAAM,UAAU,SAAS;GAC5B,MAAM,MAAM,OAAO,KAAK;AACxB,OAAI,OAAO,KAAK,aAAc,MAAM,oBAAoB,IAAI,IAAI,CAE9D,SAAQ,KAAK,OAAoB;;AAKrC,UAAQ,SAAS;EAIjB,MAAM,WAAW,IAAI,UAAU;AAG/B,MAAI,QAAQ,SAAS,EACnB,QAAO;GACL,UAAU;GACV,aAAa;GACb,UAAU;GACV,iBAAiB;GAKjB,OAAO;GACR;EAMH,MAAM,WAAW,MAAM,eAAe,cAAc,QAAQ;AAC5D,MAAI,WAAW,oBAAoB,EAAE;GAWnC,MAAM,YAAY,MAAM,KAVJ,IAAI,UACtB,SACA,eACA,SAAS,UACV,EACmB,IAAI,UACtB,SACA,eACA,SAAS,UACV,CACqD;AACtD,YAAS,IAAI,IAAI,UAAU;AAC3B,SAAM,mBACJ,UACA,UACA,SACA,UACA,YACA,cACD;;AAIH,QAAM,QAAQ,IAAI,CAChB,SAAS,QAAQ,mBAAmB,aAAa,EACjD,SAAS,WAAW,eAAe,CACpC,CAAC;AACF,QAAM,SAAS,QAAQ;EAEvB,MAAM,kBAAkB;AAExB,MAAI,GAAG,OAAO;GACZ,MAAM,CAAC,mBAAmB,aAAa,kBACrC,cACA,SACD;GACD,MAAM,CAAC,mBAAmB,aAAa,kBACrC,cACA,SACD;AACD,MAAG,MACD,yDACA,mBACA,UACA,mBACA,eACA,WACA,UACA,WACA,sBACA,cACA,qBACA,cACA,gBACA,SAAS,WACT,UACA,aAAa,UACd;;AAGH,SAAO;GACL,UAAU;GACV,aAAa;GACb,UAAU;GACV,iBAAiB,EAAE;GACnB,OAAO;GACR;GACD"}

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

@@ -1 +1 @@
-{"version":3,"file":"push.js","names":[],"sources":["../../../../../replicache/src/sync/push.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assert} from '../../../shared/src/asserts.ts';\nimport {jsonSchema} from '../../../shared/src/json-schema.ts';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport * as valita from '../../../shared/src/valita.ts';\nimport type {Store} from '../dag/store.ts';\nimport {\n  DEFAULT_HEAD_NAME,\n  type LocalMetaDD31,\n  commitIsLocalDD31,\n  localMutations,\n} from '../db/commit.ts';\nimport type {FrozenJSONValue} from '../frozen-json.ts';\nimport {\n  PushError,\n  type Pusher,\n  type PusherResult,\n  assertPusherResult,\n} from '../pusher.ts';\nimport {ReportError} from '../report-error.ts';\nimport {toError} from '../to-error.ts';\nimport {withRead} from '../with-transactions.ts';\nimport {\n  type ClientGroupID,\n  type ClientID,\n  clientGroupIDSchema,\n  clientIDSchema,\n} from './ids.ts';\n\nexport const PUSH_VERSION_SDD = 0;\nexport const PUSH_VERSION_DD31 = 1;\n\n/**\n * Mutation describes a single mutation done on the client.\n */\nexport type MutationV1 = {\n  readonly id: number;\n  readonly name: string;\n  readonly args: ReadonlyJSONValue;\n  readonly timestamp: number;\n  readonly clientID: ClientID;\n};\n\nexport type Mutation = MutationV1;\n\nconst mutationV1Schema: valita.Type<MutationV1> = valita.readonlyObject({\n  id: valita.number(),\n  name: valita.string(),\n  args: jsonSchema,\n  timestamp: valita.number(),\n  clientID: clientIDSchema,\n});\n\n/**\n * The JSON value used as the body when doing a POST to the [push\n * endpoint](/reference/server-push).\n */\nexport type PushRequestV1 = {\n  pushVersion: 1;\n  /**\n   * `schemaVersion` can optionally be used to specify to the push endpoint\n   * version information about the mutators the app is using (e.g., format of\n   * mutator args).\n   */\n  schemaVersion: string;\n  profileID: string;\n\n  clientGroupID: ClientGroupID;\n  mutations: MutationV1[];\n};\n\nconst pushRequestV1Schema = valita.object({\n  pushVersion: valita.literal(1),\n  schemaVersion: valita.string(),\n  profileID: valita.string(),\n  clientGroupID: clientGroupIDSchema,\n  mutations: valita.array(mutationV1Schema),\n});\n\nexport type PushRequest = PushRequestV1;\n\nexport function assertPushRequestV1(\n  value: unknown,\n): asserts value is PushRequestV1 {\n  valita.assert(value, pushRequestV1Schema);\n}\n\n/**\n * Mutation describes a single mutation done on the client.\n */\ntype FrozenMutationV1 = {\n  readonly id: number;\n  readonly name: string;\n  readonly args: FrozenJSONValue;\n  readonly timestamp: number;\n  readonly clientID: ClientID;\n};\n\nfunction convertDD31(lm: LocalMetaDD31): FrozenMutationV1 {\n  return {\n    id: lm.mutationID,\n    name: lm.mutatorName,\n    args: lm.mutatorArgsJSON,\n    timestamp: lm.timestamp,\n    clientID: lm.clientID,\n  };\n}\n\nexport async function push(\n  requestID: string,\n  store: Store,\n  lc: LogContext,\n  profileID: string,\n  clientGroupID: ClientGroupID | undefined,\n  _clientID: ClientID,\n  pusher: Pusher,\n  schemaVersion: string,\n  pushVersion: typeof PUSH_VERSION_SDD | typeof PUSH_VERSION_DD31,\n): Promise<PusherResult | undefined> {\n  // Find pending commits between the base snapshot and the main head and push\n  // them to the data layer.\n  const pending = await withRead(store, async dagRead => {\n    const mainHeadHash = await dagRead.getHead(DEFAULT_HEAD_NAME);\n    if (!mainHeadHash) {\n      throw new Error('Internal no main head');\n    }\n    return localMutations(mainHeadHash, dagRead);\n    // Important! Don't hold the lock through an HTTP request!\n  });\n\n  if (pending.length === 0) {\n    return undefined;\n  }\n\n  // Commit.pending gave us commits in head-first order; the bindings\n  // want tail first (in mutation id order).\n  pending.reverse();\n\n  assert(\n    pushVersion === PUSH_VERSION_DD31,\n    'Expected pushVersion to be PUSH_VERSION_DD31',\n  );\n\n  const pushMutations: FrozenMutationV1[] = [];\n  for (const commit of pending) {\n    if (commitIsLocalDD31(commit)) {\n      pushMutations.push(convertDD31(commit.meta));\n    } else {\n      throw new Error('Internal non local pending commit');\n    }\n  }\n  assert(clientGroupID, 'Expected clientGroupID to be defined');\n  const pushReq: PushRequestV1 = {\n    profileID,\n    clientGroupID,\n    mutations: pushMutations,\n    pushVersion: PUSH_VERSION_DD31,\n    schemaVersion,\n  };\n\n  lc.debug?.('Starting push...');\n  const pushStart = Date.now();\n  const pusherResult = await callPusher(pusher, pushReq, requestID);\n  lc.debug?.('...Push complete in ', Date.now() - pushStart, 'ms');\n  return pusherResult;\n}\n\nasync function callPusher(\n  pusher: Pusher,\n  body: PushRequestV1,\n  requestID: string,\n): Promise<PusherResult> {\n  let pusherResult: PusherResult;\n  try {\n    pusherResult = await pusher(body, requestID);\n  } catch (e) {\n    throw new PushError(toError(e));\n  }\n  try {\n    assertPusherResult(pusherResult);\n    return pusherResult;\n  } catch (e) {\n    throw new ReportError('Invalid pusher result', toError(e));\n  }\n}\n"],"mappings":";;;;;;;;;AA6CA,IAAM,mBAA4C,eAAsB;CACtE,IAAI,eAAO,OAAO;CAClB,MAAM,eAAO,OAAO;CACpB,MAAM;CACN,WAAW,eAAO,OAAO;CACzB,UAAU;AACZ,CAAC;AAoB2B,eAAO,OAAO;CACxC,aAAa,eAAO,QAAQ,CAAC;CAC7B,eAAe,eAAO,OAAO;CAC7B,WAAW,eAAO,OAAO;CACzB,eAAe;CACf,WAAW,eAAO,MAAM,gBAAgB;AAC1C,CAAC;AAqBD,SAAS,YAAY,IAAqC;CACxD,OAAO;EACL,IAAI,GAAG;EACP,MAAM,GAAG;EACT,MAAM,GAAG;EACT,WAAW,GAAG;EACd,UAAU,GAAG;CACf;AACF;AAEA,eAAsB,KACpB,WACA,OACA,IACA,WACA,eACA,WACA,QACA,eACA,aACmC;CAGnC,MAAM,UAAU,MAAM,SAAS,OAAO,OAAM,YAAW;EACrD,MAAM,eAAe,MAAM,QAAQ,QAAQ,iBAAiB;EAC5D,IAAI,CAAC,cACH,MAAM,IAAI,MAAM,uBAAuB;EAEzC,OAAO,eAAe,cAAc,OAAO;CAE7C,CAAC;CAED,IAAI,QAAQ,WAAW,GACrB;CAKF,QAAQ,QAAQ;CAEhB,OACE,gBAAA,GACA,8CACF;CAEA,MAAM,gBAAoC,CAAC;CAC3C,KAAK,MAAM,UAAU,SACnB,IAAI,kBAAkB,MAAM,GAC1B,cAAc,KAAK,YAAY,OAAO,IAAI,CAAC;MAE3C,MAAM,IAAI,MAAM,mCAAmC;CAGvD,OAAO,eAAe,sCAAsC;CAC5D,MAAM,UAAyB;EAC7B;EACA;EACA,WAAW;EACX,aAAA;EACA;CACF;CAEA,GAAG,QAAQ,kBAAkB;CAC7B,MAAM,YAAY,KAAK,IAAI;CAC3B,MAAM,eAAe,MAAM,WAAW,QAAQ,SAAS,SAAS;CAChE,GAAG,QAAQ,wBAAwB,KAAK,IAAI,IAAI,WAAW,IAAI;CAC/D,OAAO;AACT;AAEA,eAAe,WACb,QACA,MACA,WACuB;CACvB,IAAI;CACJ,IAAI;EACF,eAAe,MAAM,OAAO,MAAM,SAAS;CAC7C,SAAS,GAAG;EACV,MAAM,IAAI,UAAU,QAAQ,CAAC,CAAC;CAChC;CACA,IAAI;EACF,mBAAmB,YAAY;EAC/B,OAAO;CACT,SAAS,GAAG;EACV,MAAM,IAAI,YAAY,yBAAyB,QAAQ,CAAC,CAAC;CAC3D;AACF"}
+{"version":3,"file":"push.js","names":[],"sources":["../../../../../replicache/src/sync/push.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assert} from '../../../shared/src/asserts.ts';\nimport {jsonSchema} from '../../../shared/src/json-schema.ts';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport * as valita from '../../../shared/src/valita.ts';\nimport type {Store} from '../dag/store.ts';\nimport {\n  DEFAULT_HEAD_NAME,\n  type LocalMetaDD31,\n  commitIsLocalDD31,\n  localMutations,\n} from '../db/commit.ts';\nimport type {FrozenJSONValue} from '../frozen-json.ts';\nimport {\n  PushError,\n  type Pusher,\n  type PusherResult,\n  assertPusherResult,\n} from '../pusher.ts';\nimport {ReportError} from '../report-error.ts';\nimport {toError} from '../to-error.ts';\nimport {withRead} from '../with-transactions.ts';\nimport {\n  type ClientGroupID,\n  type ClientID,\n  clientGroupIDSchema,\n  clientIDSchema,\n} from './ids.ts';\n\nexport const PUSH_VERSION_SDD = 0;\nexport const PUSH_VERSION_DD31 = 1;\n\n/**\n * Mutation describes a single mutation done on the client.\n */\nexport type MutationV1 = {\n  readonly id: number;\n  readonly name: string;\n  readonly args: ReadonlyJSONValue;\n  readonly timestamp: number;\n  readonly clientID: ClientID;\n};\n\nexport type Mutation = MutationV1;\n\nconst mutationV1Schema: valita.Type<MutationV1> = valita.readonlyObject({\n  id: valita.number(),\n  name: valita.string(),\n  args: jsonSchema,\n  timestamp: valita.number(),\n  clientID: clientIDSchema,\n});\n\n/**\n * The JSON value used as the body when doing a POST to the [push\n * endpoint](/reference/server-push).\n */\nexport type PushRequestV1 = {\n  pushVersion: 1;\n  /**\n   * `schemaVersion` can optionally be used to specify to the push endpoint\n   * version information about the mutators the app is using (e.g., format of\n   * mutator args).\n   */\n  schemaVersion: string;\n  profileID: string;\n\n  clientGroupID: ClientGroupID;\n  mutations: MutationV1[];\n};\n\nconst pushRequestV1Schema = valita.object({\n  pushVersion: valita.literal(1),\n  schemaVersion: valita.string(),\n  profileID: valita.string(),\n  clientGroupID: clientGroupIDSchema,\n  mutations: valita.array(mutationV1Schema),\n});\n\nexport type PushRequest = PushRequestV1;\n\nexport function assertPushRequestV1(\n  value: unknown,\n): asserts value is PushRequestV1 {\n  valita.assert(value, pushRequestV1Schema);\n}\n\n/**\n * Mutation describes a single mutation done on the client.\n */\ntype FrozenMutationV1 = {\n  readonly id: number;\n  readonly name: string;\n  readonly args: FrozenJSONValue;\n  readonly timestamp: number;\n  readonly clientID: ClientID;\n};\n\nfunction convertDD31(lm: LocalMetaDD31): FrozenMutationV1 {\n  return {\n    id: lm.mutationID,\n    name: lm.mutatorName,\n    args: lm.mutatorArgsJSON,\n    timestamp: lm.timestamp,\n    clientID: lm.clientID,\n  };\n}\n\nexport async function push(\n  requestID: string,\n  store: Store,\n  lc: LogContext,\n  profileID: string,\n  clientGroupID: ClientGroupID | undefined,\n  _clientID: ClientID,\n  pusher: Pusher,\n  schemaVersion: string,\n  pushVersion: typeof PUSH_VERSION_SDD | typeof PUSH_VERSION_DD31,\n): Promise<PusherResult | undefined> {\n  // Find pending commits between the base snapshot and the main head and push\n  // them to the data layer.\n  const pending = await withRead(store, async dagRead => {\n    const mainHeadHash = await dagRead.getHead(DEFAULT_HEAD_NAME);\n    if (!mainHeadHash) {\n      throw new Error('Internal no main head');\n    }\n    return localMutations(mainHeadHash, dagRead);\n    // Important! Don't hold the lock through an HTTP request!\n  });\n\n  if (pending.length === 0) {\n    return undefined;\n  }\n\n  // Commit.pending gave us commits in head-first order; the bindings\n  // want tail first (in mutation id order).\n  pending.reverse();\n\n  assert(\n    pushVersion === PUSH_VERSION_DD31,\n    'Expected pushVersion to be PUSH_VERSION_DD31',\n  );\n\n  const pushMutations: FrozenMutationV1[] = [];\n  for (const commit of pending) {\n    if (commitIsLocalDD31(commit)) {\n      pushMutations.push(convertDD31(commit.meta));\n    } else {\n      throw new Error('Internal non local pending commit');\n    }\n  }\n  assert(clientGroupID, 'Expected clientGroupID to be defined');\n  const pushReq: PushRequestV1 = {\n    profileID,\n    clientGroupID,\n    mutations: pushMutations,\n    pushVersion: PUSH_VERSION_DD31,\n    schemaVersion,\n  };\n\n  lc.debug?.('Starting push...');\n  const pushStart = Date.now();\n  const pusherResult = await callPusher(pusher, pushReq, requestID);\n  lc.debug?.('...Push complete in ', Date.now() - pushStart, 'ms');\n  return pusherResult;\n}\n\nasync function callPusher(\n  pusher: Pusher,\n  body: PushRequestV1,\n  requestID: string,\n): Promise<PusherResult> {\n  let pusherResult: PusherResult;\n  try {\n    pusherResult = await pusher(body, requestID);\n  } catch (e) {\n    throw new PushError(toError(e));\n  }\n  try {\n    assertPusherResult(pusherResult);\n    return pusherResult;\n  } catch (e) {\n    throw new ReportError('Invalid pusher result', toError(e));\n  }\n}\n"],"mappings":";;;;;;;;;AA6CA,IAAM,mBAA4C,eAAsB;CACtE,IAAI,eAAO,QAAQ;CACnB,MAAM,eAAO,QAAQ;CACrB,MAAM;CACN,WAAW,eAAO,QAAQ;CAC1B,UAAU;CACX,CAAC;AAoB0B,eAAO,OAAO;CACxC,aAAa,eAAO,QAAQ,EAAE;CAC9B,eAAe,eAAO,QAAQ;CAC9B,WAAW,eAAO,QAAQ;CAC1B,eAAe;CACf,WAAW,eAAO,MAAM,iBAAiB;CAC1C,CAAC;AAqBF,SAAS,YAAY,IAAqC;AACxD,QAAO;EACL,IAAI,GAAG;EACP,MAAM,GAAG;EACT,MAAM,GAAG;EACT,WAAW,GAAG;EACd,UAAU,GAAG;EACd;;AAGH,eAAsB,KACpB,WACA,OACA,IACA,WACA,eACA,WACA,QACA,eACA,aACmC;CAGnC,MAAM,UAAU,MAAM,SAAS,OAAO,OAAM,YAAW;EACrD,MAAM,eAAe,MAAM,QAAQ,QAAQ,kBAAkB;AAC7D,MAAI,CAAC,aACH,OAAM,IAAI,MAAM,wBAAwB;AAE1C,SAAO,eAAe,cAAc,QAAQ;GAE5C;AAEF,KAAI,QAAQ,WAAW,EACrB;AAKF,SAAQ,SAAS;AAEjB,QACE,gBAAA,GACA,+CACD;CAED,MAAM,gBAAoC,EAAE;AAC5C,MAAK,MAAM,UAAU,QACnB,KAAI,kBAAkB,OAAO,CAC3B,eAAc,KAAK,YAAY,OAAO,KAAK,CAAC;KAE5C,OAAM,IAAI,MAAM,oCAAoC;AAGxD,QAAO,eAAe,uCAAuC;CAC7D,MAAM,UAAyB;EAC7B;EACA;EACA,WAAW;EACX,aAAA;EACA;EACD;AAED,IAAG,QAAQ,mBAAmB;CAC9B,MAAM,YAAY,KAAK,KAAK;CAC5B,MAAM,eAAe,MAAM,WAAW,QAAQ,SAAS,UAAU;AACjE,IAAG,QAAQ,wBAAwB,KAAK,KAAK,GAAG,WAAW,KAAK;AAChE,QAAO;;AAGT,eAAe,WACb,QACA,MACA,WACuB;CACvB,IAAI;AACJ,KAAI;AACF,iBAAe,MAAM,OAAO,MAAM,UAAU;UACrC,GAAG;AACV,QAAM,IAAI,UAAU,QAAQ,EAAE,CAAC;;AAEjC,KAAI;AACF,qBAAmB,aAAa;AAChC,SAAO;UACA,GAAG;AACV,QAAM,IAAI,YAAY,yBAAyB,QAAQ,EAAE,CAAC"}

package/out/replicache/src/sync/request-id.js.map

@@ -1 +1 @@
-{"version":3,"file":"request-id.js","names":[],"sources":["../../../../../replicache/src/sync/request-id.ts"],"sourcesContent":["import {getNonCryptoRandomValues} from '../../../shared/src/random-values.ts';\nimport type {ClientID} from './ids.ts';\n\nlet sessionID = '';\nfunction getSessionID() {\n  if (sessionID === '') {\n    const buf = new Uint8Array(4);\n    getNonCryptoRandomValues(buf);\n    sessionID = Array.from(buf, x => x.toString(16)).join('');\n  }\n  return sessionID;\n}\n\nconst REQUEST_COUNTERS: Map<string, number> = new Map();\n\n/**\n * Returns a new requestID of the form <client ID>-<session ID>-<request\n * count>. The request count enables one to find the request following or\n * preceding a given request. The sessionid scopes the request count, ensuring\n * the requestID is probabilistically unique across restarts (which is good\n * enough).\n */\nexport function newRequestID(clientID: ClientID): string {\n  const counter = REQUEST_COUNTERS.get(clientID) ?? 0;\n  REQUEST_COUNTERS.set(clientID, counter + 1);\n  return `${clientID}-${getSessionID()}-${counter}`;\n}\n"],"mappings":";;AAGA,IAAI,YAAY;AAChB,SAAS,eAAe;CACtB,IAAI,cAAc,IAAI;EACpB,MAAM,MAAM,IAAI,WAAW,CAAC;EAC5B,yBAAyB,GAAG;EAC5B,YAAY,MAAM,KAAK,MAAK,MAAK,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE;CAC1D;CACA,OAAO;AACT;AAEA,IAAM,mCAAwC,IAAI,IAAI;;;;;;;;AAStD,SAAgB,aAAa,UAA4B;CACvD,MAAM,UAAU,iBAAiB,IAAI,QAAQ,KAAK;CAClD,iBAAiB,IAAI,UAAU,UAAU,CAAC;CAC1C,OAAO,GAAG,SAAS,GAAG,aAAa,EAAE,GAAG;AAC1C"}
+{"version":3,"file":"request-id.js","names":[],"sources":["../../../../../replicache/src/sync/request-id.ts"],"sourcesContent":["import {getNonCryptoRandomValues} from '../../../shared/src/random-values.ts';\nimport type {ClientID} from './ids.ts';\n\nlet sessionID = '';\nfunction getSessionID() {\n  if (sessionID === '') {\n    const buf = new Uint8Array(4);\n    getNonCryptoRandomValues(buf);\n    sessionID = Array.from(buf, x => x.toString(16)).join('');\n  }\n  return sessionID;\n}\n\nconst REQUEST_COUNTERS: Map<string, number> = new Map();\n\n/**\n * Returns a new requestID of the form <client ID>-<session ID>-<request\n * count>. The request count enables one to find the request following or\n * preceding a given request. The sessionid scopes the request count, ensuring\n * the requestID is probabilistically unique across restarts (which is good\n * enough).\n */\nexport function newRequestID(clientID: ClientID): string {\n  const counter = REQUEST_COUNTERS.get(clientID) ?? 0;\n  REQUEST_COUNTERS.set(clientID, counter + 1);\n  return `${clientID}-${getSessionID()}-${counter}`;\n}\n"],"mappings":";;AAGA,IAAI,YAAY;AAChB,SAAS,eAAe;AACtB,KAAI,cAAc,IAAI;EACpB,MAAM,MAAM,IAAI,WAAW,EAAE;AAC7B,2BAAyB,IAAI;AAC7B,cAAY,MAAM,KAAK,MAAK,MAAK,EAAE,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG;;AAE3D,QAAO;;AAGT,IAAM,mCAAwC,IAAI,KAAK;;;;;;;;AASvD,SAAgB,aAAa,UAA4B;CACvD,MAAM,UAAU,iBAAiB,IAAI,SAAS,IAAI;AAClD,kBAAiB,IAAI,UAAU,UAAU,EAAE;AAC3C,QAAO,GAAG,SAAS,GAAG,cAAc,CAAC,GAAG"}

package/out/replicache/src/to-error.js.map

@@ -1 +1 @@
-{"version":3,"file":"to-error.js","names":[],"sources":["../../../../replicache/src/to-error.ts"],"sourcesContent":["export function toError(e: unknown): Error {\n  if (e instanceof Error) {\n    return e;\n  }\n  return new Error(String(e));\n}\n"],"mappings":";AAAA,SAAgB,QAAQ,GAAmB;CACzC,IAAI,aAAa,OACf,OAAO;CAET,OAAO,IAAI,MAAM,OAAO,CAAC,CAAC;AAC5B"}
+{"version":3,"file":"to-error.js","names":[],"sources":["../../../../replicache/src/to-error.ts"],"sourcesContent":["export function toError(e: unknown): Error {\n  if (e instanceof Error) {\n    return e;\n  }\n  return new Error(String(e));\n}\n"],"mappings":";AAAA,SAAgB,QAAQ,GAAmB;AACzC,KAAI,aAAa,MACf,QAAO;AAET,QAAO,IAAI,MAAM,OAAO,EAAE,CAAC"}

package/out/replicache/src/transaction-closed-error.js.map

@@ -1 +1 @@
-{"version":3,"file":"transaction-closed-error.js","names":[],"sources":["../../../../replicache/src/transaction-closed-error.ts"],"sourcesContent":["/**\n * This error is thrown when you try to call methods on a closed transaction.\n */\nexport class TransactionClosedError extends Error {\n  constructor() {\n    super('Transaction is closed');\n  }\n}\n\nexport type Closed = {closed: boolean};\n\nexport function throwIfClosed(tx: Closed): void {\n  if (tx.closed) {\n    throw new TransactionClosedError();\n  }\n}\n\nexport function rejectIfClosed(tx: Closed): undefined | Promise<never> {\n  return tx.closed ? Promise.reject(new TransactionClosedError()) : undefined;\n}\n"],"mappings":";;;;AAGA,IAAa,yBAAb,cAA4C,MAAM;CAChD,cAAc;EACZ,MAAM,uBAAuB;CAC/B;AACF;AAIA,SAAgB,cAAc,IAAkB;CAC9C,IAAI,GAAG,QACL,MAAM,IAAI,uBAAuB;AAErC;AAEA,SAAgB,eAAe,IAAwC;CACrE,OAAO,GAAG,SAAS,QAAQ,OAAO,IAAI,uBAAuB,CAAC,IAAI,KAAA;AACpE"}
+{"version":3,"file":"transaction-closed-error.js","names":[],"sources":["../../../../replicache/src/transaction-closed-error.ts"],"sourcesContent":["/**\n * This error is thrown when you try to call methods on a closed transaction.\n */\nexport class TransactionClosedError extends Error {\n  constructor() {\n    super('Transaction is closed');\n  }\n}\n\nexport type Closed = {closed: boolean};\n\nexport function throwIfClosed(tx: Closed): void {\n  if (tx.closed) {\n    throw new TransactionClosedError();\n  }\n}\n\nexport function rejectIfClosed(tx: Closed): undefined | Promise<never> {\n  return tx.closed ? Promise.reject(new TransactionClosedError()) : undefined;\n}\n"],"mappings":";;;;AAGA,IAAa,yBAAb,cAA4C,MAAM;CAChD,cAAc;AACZ,QAAM,wBAAwB;;;AAMlC,SAAgB,cAAc,IAAkB;AAC9C,KAAI,GAAG,OACL,OAAM,IAAI,wBAAwB;;AAItC,SAAgB,eAAe,IAAwC;AACrE,QAAO,GAAG,SAAS,QAAQ,OAAO,IAAI,wBAAwB,CAAC,GAAG,KAAA"}

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

@@ -1 +1 @@
-{"version":3,"file":"transactions.js","names":["#keys","#scans","#tx"],"sources":["../../../../replicache/src/transactions.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {greaterThan} from 'compare-utf8';\nimport type {JSONValue, ReadonlyJSONValue} from '../../shared/src/json.ts';\nimport {type IndexKey, decodeIndexKey} from './db/index.ts';\nimport type {Read} from './db/read.ts';\nimport type {Write} from './db/write.ts';\nimport {deepFreeze} from './frozen-json.ts';\nimport type {IndexDefinition} from './index-defs.ts';\nimport type {ZeroTxData} from './replicache-options.ts';\nimport type {ScanResult} from './scan-iterator.ts';\nimport {ScanResultImpl, fromKeyForIndexScanInternal} from './scan-iterator.ts';\nimport {\n  type KeyTypeForScanOptions,\n  type ScanIndexOptions,\n  type ScanNoIndexOptions,\n  type ScanOptions,\n  isScanIndexOptions,\n  toDbScanOptions,\n} from './scan-options.ts';\nimport type {ScanSubscriptionInfo} from './subscriptions.ts';\nimport type {ClientID} from './sync/ids.ts';\nimport {rejectIfClosed, throwIfClosed} from './transaction-closed-error.ts';\n\nexport type TransactionEnvironment = 'client' | 'server';\nexport type TransactionLocation = TransactionEnvironment;\nexport type TransactionReason = 'initial' | 'rebase' | 'authoritative';\n\n/**\n * Basic deep readonly type. It works for {@link JSONValue}.\n */\nexport type DeepReadonly<T> = T extends\n  | null\n  | boolean\n  | string\n  | number\n  | undefined\n  ? T\n  : DeepReadonlyObject<T>;\n\nexport type DeepReadonlyObject<T> = {\n  readonly [K in keyof T]: DeepReadonly<T[K]>;\n};\n\n/**\n * ReadTransactions are used with {@link Replicache.query} and\n * {@link Replicache.subscribe} and allows read operations on the\n * database.\n */\nexport interface ReadTransaction {\n  readonly clientID: ClientID;\n  /** @deprecated Use {@link ReadTransaction.location} instead. */\n  readonly environment: TransactionLocation;\n  readonly location: TransactionLocation;\n\n  /**\n   * Get a single value from the database. If the `key` is not present this\n   * returns `undefined`.\n   *\n   * Important: The returned JSON is readonly and should not be modified. This\n   * is only enforced statically by TypeScript and there are no runtime checks\n   * for performance reasons. If you mutate the return value you will get\n   * undefined behavior.\n   */\n\n  get(key: string): Promise<ReadonlyJSONValue | undefined>;\n  get<T extends JSONValue>(key: string): Promise<DeepReadonly<T> | undefined>;\n\n  /** Determines if a single `key` is present in the database. */\n  has(key: string): Promise<boolean>;\n\n  /** Whether the database is empty. */\n  isEmpty(): Promise<boolean>;\n\n  /**\n   * Gets many values from the database. This returns a {@link ScanResult} which\n   * implements `AsyncIterable`. It also has methods to iterate over the\n   * {@link ScanResult.keys | keys} and {@link ScanResult.entries | entries}.\n   *\n   * If `options` has an `indexName`, then this does a scan over an index with\n   * that name. A scan over an index uses a tuple for the key consisting of\n   * `[secondary: string, primary: string]`.\n   *\n   * If the {@link ScanResult} is used after the `ReadTransaction` has been closed\n   * it will throw a {@link TransactionClosedError}.\n   *\n   * Important: The returned JSON is readonly and should not be modified. This\n   * is only enforced statically by TypeScript and there are no runtime checks\n   * for performance reasons. If you mutate the return value you will get\n   * undefined behavior.\n   */\n  scan(options: ScanIndexOptions): ScanResult<IndexKey, ReadonlyJSONValue>;\n  scan(options?: ScanNoIndexOptions): ScanResult<string, ReadonlyJSONValue>;\n  scan(options?: ScanOptions): ScanResult<IndexKey | string, ReadonlyJSONValue>;\n\n  scan<V extends ReadonlyJSONValue>(\n    options: ScanIndexOptions,\n  ): ScanResult<IndexKey, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanNoIndexOptions,\n  ): ScanResult<string, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanOptions,\n  ): ScanResult<IndexKey | string, DeepReadonly<V>>;\n}\n\nlet transactionIDCounter = 0;\n\nexport class ReadTransactionImpl implements ReadTransaction {\n  readonly clientID: ClientID;\n  readonly dbtx: Read;\n  protected readonly _lc: LogContext;\n\n  /**\n   * The location in which this transaction is being used. This is either `client` or `server`.\n   */\n  readonly location: TransactionLocation;\n  /** @deprecated Use {@link ReadTransaction.location} instead. */\n  readonly environment: TransactionLocation;\n\n  constructor(\n    clientID: ClientID,\n    dbRead: Read,\n    lc: LogContext,\n    rpcName = 'openReadTransaction',\n  ) {\n    this.clientID = clientID;\n    this.dbtx = dbRead;\n    this._lc = lc\n      .withContext(rpcName)\n      .withContext('txid', transactionIDCounter++);\n    this.environment = 'client';\n    this.location = 'client';\n  }\n\n  get(key: string): Promise<ReadonlyJSONValue | undefined>;\n  get<V extends JSONValue>(key: string): Promise<DeepReadonly<V> | undefined> {\n    return (\n      rejectIfClosed(this.dbtx) ||\n      (this.dbtx.get(key) as Promise<DeepReadonly<V> | undefined>)\n    );\n  }\n\n  // oxlint-disable-next-line require-await\n  async has(key: string): Promise<boolean> {\n    throwIfClosed(this.dbtx);\n    return this.dbtx.has(key);\n  }\n\n  // oxlint-disable-next-line require-await\n  async isEmpty(): Promise<boolean> {\n    throwIfClosed(this.dbtx);\n    return this.dbtx.isEmpty();\n  }\n\n  scan(options: ScanIndexOptions): ScanResult<IndexKey, ReadonlyJSONValue>;\n  scan(options?: ScanNoIndexOptions): ScanResult<string, ReadonlyJSONValue>;\n  scan(options?: ScanOptions): ScanResult<IndexKey | string, ReadonlyJSONValue>;\n\n  scan<V extends ReadonlyJSONValue>(\n    options: ScanIndexOptions,\n  ): ScanResult<IndexKey, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanNoIndexOptions,\n  ): ScanResult<string, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanOptions,\n  ): ScanResult<IndexKey | string, DeepReadonly<V>>;\n\n  scan(\n    options?: ScanOptions,\n  ): ScanResult<IndexKey | string, ReadonlyJSONValue> {\n    return scan(options, this.dbtx, noop);\n  }\n}\n\nfunction noop(_: unknown): void {\n  // empty\n}\n\nfunction scan<Options extends ScanOptions, V extends JSONValue>(\n  options: Options | undefined,\n  dbRead: Read,\n  onLimitKey: (inclusiveLimitKey: string) => void,\n): ScanResult<KeyTypeForScanOptions<Options>, V> {\n  const iter = getScanIterator<Options, V>(dbRead, options);\n  return makeScanResultFromScanIteratorInternal(\n    iter,\n    options ?? ({} as Options),\n    dbRead,\n    onLimitKey,\n  );\n}\n\n// An implementation of ReadTransaction that keeps track of `keys` and `scans`\n// for use with Subscriptions.\nexport class SubscriptionTransactionWrapper implements ReadTransaction {\n  readonly #keys: Set<string> = new Set();\n  readonly #scans: ScanSubscriptionInfo[] = [];\n  readonly #tx: ReadTransactionImpl;\n\n  constructor(tx: ReadTransactionImpl) {\n    this.#tx = tx;\n  }\n\n  get environment(): TransactionLocation {\n    return this.#tx.location;\n  }\n\n  get location(): TransactionLocation {\n    return this.#tx.location;\n  }\n\n  get clientID(): string {\n    return this.#tx.clientID;\n  }\n\n  isEmpty(): Promise<boolean> {\n    // Any change to the subscription requires rerunning it.\n    this.#scans.push({options: {}});\n    return this.#tx.isEmpty();\n  }\n\n  get(key: string): Promise<ReadonlyJSONValue | undefined>;\n  get<T extends JSONValue>(key: string): Promise<DeepReadonly<T> | undefined> {\n    this.#keys.add(key);\n    return this.#tx.get(key) as Promise<DeepReadonly<T> | undefined>;\n  }\n\n  has(key: string): Promise<boolean> {\n    this.#keys.add(key);\n    return this.#tx.has(key);\n  }\n\n  scan(options: ScanIndexOptions): ScanResult<IndexKey, ReadonlyJSONValue>;\n  scan(options?: ScanNoIndexOptions): ScanResult<string, ReadonlyJSONValue>;\n  scan(options?: ScanOptions): ScanResult<IndexKey | string, ReadonlyJSONValue>;\n\n  scan<V extends ReadonlyJSONValue>(\n    options: ScanIndexOptions,\n  ): ScanResult<IndexKey, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanNoIndexOptions,\n  ): ScanResult<string, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanOptions,\n  ): ScanResult<IndexKey | string, DeepReadonly<V>>;\n\n  scan(\n    options?: ScanOptions,\n  ): ScanResult<IndexKey | string, ReadonlyJSONValue> {\n    const scanInfo: ScanSubscriptionInfo = {\n      options: toDbScanOptions(options),\n      inclusiveLimitKey: undefined,\n    };\n    this.#scans.push(scanInfo);\n    return scan(options, this.#tx.dbtx, inclusiveLimitKey => {\n      scanInfo.inclusiveLimitKey = inclusiveLimitKey;\n    });\n  }\n\n  get keys(): ReadonlySet<string> {\n    return this.#keys;\n  }\n\n  get scans(): ScanSubscriptionInfo[] {\n    return this.#scans;\n  }\n}\n\n/**\n * WriteTransactions are used with *mutators* which are registered using\n * {@link ReplicacheOptions.mutators} and allows read and write operations on the\n * database.\n */\nexport interface WriteTransaction extends ReadTransaction {\n  /**\n   * The ID of the mutation that is being applied.\n   */\n  readonly mutationID: number;\n\n  /**\n   * The reason for the transaction. This can be `initial`, `rebase` or `authoriative`.\n   */\n  readonly reason: TransactionReason;\n\n  /**\n   * Sets a single `value` in the database. The value will be frozen (using\n   * `Object.freeze`) in debug mode.\n   */\n  set(key: string, value: ReadonlyJSONValue): Promise<void>;\n\n  /**\n   * @deprecated Use {@link WriteTransaction.set} instead.\n   */\n  put(key: string, value: ReadonlyJSONValue): Promise<void>;\n\n  /**\n   * Removes a `key` and its value from the database. Returns `true` if there was a\n   * `key` to remove.\n   */\n  del(key: string): Promise<boolean>;\n}\n\n// Internal symbol, not exported by Replicache\n// but accessible to Zero.\nexport const zeroData = Symbol();\n\nexport class WriteTransactionImpl\n  extends ReadTransactionImpl\n  implements WriteTransaction\n{\n  // use `declare` to specialize the type.\n  declare readonly dbtx: Write;\n  readonly reason: TransactionReason;\n  readonly mutationID: number;\n  readonly [zeroData]: ZeroTxData | undefined;\n\n  constructor(\n    clientID: ClientID,\n    mutationID: number,\n    reason: TransactionReason,\n    zData: ZeroTxData | undefined,\n    dbWrite: Write,\n    lc: LogContext,\n    rpcName = 'openWriteTransaction',\n  ) {\n    super(clientID, dbWrite, lc, rpcName);\n    this.mutationID = mutationID;\n    this.reason = reason;\n    this[zeroData] = zData;\n  }\n\n  put(key: string, value: ReadonlyJSONValue): Promise<void> {\n    return this.set(key, value);\n  }\n\n  async set(key: string, value: ReadonlyJSONValue): Promise<void> {\n    throwIfClosed(this.dbtx);\n    await this.dbtx.put(this._lc, key, deepFreeze(value));\n  }\n\n  del(key: string): Promise<boolean> {\n    return rejectIfClosed(this.dbtx) ?? this.dbtx.del(this._lc, key);\n  }\n}\n\nexport type CreateIndexDefinition = IndexDefinition & {name: string};\n\ntype Entry<Key, Value> = readonly [key: Key, value: Value];\n\ntype IndexKeyEntry<Value> = Entry<IndexKey, Value>;\n\ntype StringKeyEntry<Value> = Entry<string, Value>;\n\nexport type EntryForOptions<\n  Options extends ScanOptions,\n  V,\n> = Options extends ScanIndexOptions ? IndexKeyEntry<V> : StringKeyEntry<V>;\n\nfunction getScanIterator<Options extends ScanOptions, V>(\n  dbRead: Read,\n  options: Options | undefined,\n): AsyncIterable<EntryForOptions<Options, V>> {\n  if (options && isScanIndexOptions(options)) {\n    return getScanIteratorForIndexMap(dbRead, options) as AsyncIterable<\n      EntryForOptions<Options, V>\n    >;\n  }\n\n  return dbRead.map.scan(fromKeyForNonIndexScan(options)) as AsyncIterable<\n    EntryForOptions<Options, V>\n  >;\n}\n\nexport function fromKeyForNonIndexScan(\n  options: ScanNoIndexOptions | undefined,\n): string {\n  if (!options) {\n    return '';\n  }\n\n  const {prefix = '', start} = options;\n  if (start && greaterThan(start.key, prefix)) {\n    return start.key;\n  }\n  return prefix;\n}\n\nfunction makeScanResultFromScanIteratorInternal<\n  Options extends ScanOptions,\n  V extends JSONValue,\n>(\n  iter: AsyncIterable<EntryForOptions<Options, V>>,\n  options: Options,\n  dbRead: Read,\n  onLimitKey: (inclusiveLimitKey: string) => void,\n): ScanResult<KeyTypeForScanOptions<Options>, V> {\n  return new ScanResultImpl(iter, options, dbRead, onLimitKey);\n}\n\nasync function* getScanIteratorForIndexMap(\n  dbRead: Read,\n  options: ScanIndexOptions,\n): AsyncIterable<IndexKeyEntry<ReadonlyJSONValue>> {\n  const map = dbRead.getMapForIndex(options.indexName);\n  for await (const entry of map.scan(fromKeyForIndexScanInternal(options))) {\n    yield [decodeIndexKey(entry[0]), entry[1]];\n  }\n}\n"],"mappings":";;;;;;;AAyGA,IAAI,uBAAuB;AAE3B,IAAa,sBAAb,MAA4D;CAC1D;CACA;CACA;;;;CAKA;;CAEA;CAEA,YACE,UACA,QACA,IACA,UAAU,uBACV;EACA,KAAK,WAAW;EAChB,KAAK,OAAO;EACZ,KAAK,MAAM,GACR,YAAY,OAAO,EACnB,YAAY,QAAQ,sBAAsB;EAC7C,KAAK,cAAc;EACnB,KAAK,WAAW;CAClB;CAGA,IAAyB,KAAmD;EAC1E,OACE,eAAe,KAAK,IAAI,KACvB,KAAK,KAAK,IAAI,GAAG;CAEtB;CAGA,MAAM,IAAI,KAA+B;EACvC,cAAc,KAAK,IAAI;EACvB,OAAO,KAAK,KAAK,IAAI,GAAG;CAC1B;CAGA,MAAM,UAA4B;EAChC,cAAc,KAAK,IAAI;EACvB,OAAO,KAAK,KAAK,QAAQ;CAC3B;CAgBA,KACE,SACkD;EAClD,OAAO,KAAK,SAAS,KAAK,MAAM,IAAI;CACtC;AACF;AAEA,SAAS,KAAK,GAAkB,CAEhC;AAEA,SAAS,KACP,SACA,QACA,YAC+C;CAE/C,OAAO,uCADM,gBAA4B,QAAQ,OAE/C,GACA,WAAY,CAAC,GACb,QACA,UACF;AACF;AAIA,IAAa,iCAAb,MAAuE;CACrE,wBAA8B,IAAI,IAAI;CACtC,SAA0C,CAAC;CAC3C;CAEA,YAAY,IAAyB;EACnC,KAAKE,MAAM;CACb;CAEA,IAAI,cAAmC;EACrC,OAAO,KAAKA,IAAI;CAClB;CAEA,IAAI,WAAgC;EAClC,OAAO,KAAKA,IAAI;CAClB;CAEA,IAAI,WAAmB;EACrB,OAAO,KAAKA,IAAI;CAClB;CAEA,UAA4B;EAE1B,KAAKD,OAAO,KAAK,EAAC,SAAS,CAAC,EAAC,CAAC;EAC9B,OAAO,KAAKC,IAAI,QAAQ;CAC1B;CAGA,IAAyB,KAAmD;EAC1E,KAAKF,MAAM,IAAI,GAAG;EAClB,OAAO,KAAKE,IAAI,IAAI,GAAG;CACzB;CAEA,IAAI,KAA+B;EACjC,KAAKF,MAAM,IAAI,GAAG;EAClB,OAAO,KAAKE,IAAI,IAAI,GAAG;CACzB;CAgBA,KACE,SACkD;EAClD,MAAM,WAAiC;GACrC,SAAS,gBAAgB,OAAO;GAChC,mBAAmB,KAAA;EACrB;EACA,KAAKD,OAAO,KAAK,QAAQ;EACzB,OAAO,KAAK,SAAS,KAAKC,IAAI,OAAM,sBAAqB;GACvD,SAAS,oBAAoB;EAC/B,CAAC;CACH;CAEA,IAAI,OAA4B;EAC9B,OAAO,KAAKF;CACd;CAEA,IAAI,QAAgC;EAClC,OAAO,KAAKC;CACd;AACF;AAsCA,IAAa,WAAW,OAAO;AAE/B,IAAa,uBAAb,cACU,oBAEV;CAGE;CACA;CACA,CAAU;CAEV,YACE,UACA,YACA,QACA,OACA,SACA,IACA,UAAU,wBACV;EACA,MAAM,UAAU,SAAS,IAAI,OAAO;EACpC,KAAK,aAAa;EAClB,KAAK,SAAS;EACd,KAAK,YAAY;CACnB;CAEA,IAAI,KAAa,OAAyC;EACxD,OAAO,KAAK,IAAI,KAAK,KAAK;CAC5B;CAEA,MAAM,IAAI,KAAa,OAAyC;EAC9D,cAAc,KAAK,IAAI;EACvB,MAAM,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,WAAW,KAAK,CAAC;CACtD;CAEA,IAAI,KAA+B;EACjC,OAAO,eAAe,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,GAAG;CACjE;AACF;AAeA,SAAS,gBACP,QACA,SAC4C;CAC5C,IAAI,WAAW,mBAAmB,OAAO,GACvC,OAAO,2BAA2B,QAAQ,OAAO;CAKnD,OAAO,OAAO,IAAI,KAAK,uBAAuB,OAAO,CAAC;AAGxD;AAEA,SAAgB,uBACd,SACQ;CACR,IAAI,CAAC,SACH,OAAO;CAGT,MAAM,EAAC,SAAS,IAAI,UAAS;CAC7B,IAAI,SAAS,YAAY,MAAM,KAAK,MAAM,GACxC,OAAO,MAAM;CAEf,OAAO;AACT;AAEA,SAAS,uCAIP,MACA,SACA,QACA,YAC+C;CAC/C,OAAO,IAAI,eAAe,MAAM,SAAS,QAAQ,UAAU;AAC7D;AAEA,gBAAgB,2BACd,QACA,SACiD;CACjD,MAAM,MAAM,OAAO,eAAe,QAAQ,SAAS;CACnD,WAAW,MAAM,SAAS,IAAI,KAAK,4BAA4B,OAAO,CAAC,GACrE,MAAM,CAAC,eAAe,MAAM,EAAE,GAAG,MAAM,EAAE;AAE7C"}
+{"version":3,"file":"transactions.js","names":["#keys","#scans","#tx"],"sources":["../../../../replicache/src/transactions.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {greaterThan} from 'compare-utf8';\nimport type {JSONValue, ReadonlyJSONValue} from '../../shared/src/json.ts';\nimport {type IndexKey, decodeIndexKey} from './db/index.ts';\nimport type {Read} from './db/read.ts';\nimport type {Write} from './db/write.ts';\nimport {deepFreeze} from './frozen-json.ts';\nimport type {IndexDefinition} from './index-defs.ts';\nimport type {ZeroTxData} from './replicache-options.ts';\nimport type {ScanResult} from './scan-iterator.ts';\nimport {ScanResultImpl, fromKeyForIndexScanInternal} from './scan-iterator.ts';\nimport {\n  type KeyTypeForScanOptions,\n  type ScanIndexOptions,\n  type ScanNoIndexOptions,\n  type ScanOptions,\n  isScanIndexOptions,\n  toDbScanOptions,\n} from './scan-options.ts';\nimport type {ScanSubscriptionInfo} from './subscriptions.ts';\nimport type {ClientID} from './sync/ids.ts';\nimport {rejectIfClosed, throwIfClosed} from './transaction-closed-error.ts';\n\nexport type TransactionEnvironment = 'client' | 'server';\nexport type TransactionLocation = TransactionEnvironment;\nexport type TransactionReason = 'initial' | 'rebase' | 'authoritative';\n\n/**\n * Basic deep readonly type. It works for {@link JSONValue}.\n */\nexport type DeepReadonly<T> = T extends\n  | null\n  | boolean\n  | string\n  | number\n  | undefined\n  ? T\n  : DeepReadonlyObject<T>;\n\nexport type DeepReadonlyObject<T> = {\n  readonly [K in keyof T]: DeepReadonly<T[K]>;\n};\n\n/**\n * ReadTransactions are used with {@link Replicache.query} and\n * {@link Replicache.subscribe} and allows read operations on the\n * database.\n */\nexport interface ReadTransaction {\n  readonly clientID: ClientID;\n  /** @deprecated Use {@link ReadTransaction.location} instead. */\n  readonly environment: TransactionLocation;\n  readonly location: TransactionLocation;\n\n  /**\n   * Get a single value from the database. If the `key` is not present this\n   * returns `undefined`.\n   *\n   * Important: The returned JSON is readonly and should not be modified. This\n   * is only enforced statically by TypeScript and there are no runtime checks\n   * for performance reasons. If you mutate the return value you will get\n   * undefined behavior.\n   */\n\n  get(key: string): Promise<ReadonlyJSONValue | undefined>;\n  get<T extends JSONValue>(key: string): Promise<DeepReadonly<T> | undefined>;\n\n  /** Determines if a single `key` is present in the database. */\n  has(key: string): Promise<boolean>;\n\n  /** Whether the database is empty. */\n  isEmpty(): Promise<boolean>;\n\n  /**\n   * Gets many values from the database. This returns a {@link ScanResult} which\n   * implements `AsyncIterable`. It also has methods to iterate over the\n   * {@link ScanResult.keys | keys} and {@link ScanResult.entries | entries}.\n   *\n   * If `options` has an `indexName`, then this does a scan over an index with\n   * that name. A scan over an index uses a tuple for the key consisting of\n   * `[secondary: string, primary: string]`.\n   *\n   * If the {@link ScanResult} is used after the `ReadTransaction` has been closed\n   * it will throw a {@link TransactionClosedError}.\n   *\n   * Important: The returned JSON is readonly and should not be modified. This\n   * is only enforced statically by TypeScript and there are no runtime checks\n   * for performance reasons. If you mutate the return value you will get\n   * undefined behavior.\n   */\n  scan(options: ScanIndexOptions): ScanResult<IndexKey, ReadonlyJSONValue>;\n  scan(options?: ScanNoIndexOptions): ScanResult<string, ReadonlyJSONValue>;\n  scan(options?: ScanOptions): ScanResult<IndexKey | string, ReadonlyJSONValue>;\n\n  scan<V extends ReadonlyJSONValue>(\n    options: ScanIndexOptions,\n  ): ScanResult<IndexKey, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanNoIndexOptions,\n  ): ScanResult<string, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanOptions,\n  ): ScanResult<IndexKey | string, DeepReadonly<V>>;\n}\n\nlet transactionIDCounter = 0;\n\nexport class ReadTransactionImpl implements ReadTransaction {\n  readonly clientID: ClientID;\n  readonly dbtx: Read;\n  protected readonly _lc: LogContext;\n\n  /**\n   * The location in which this transaction is being used. This is either `client` or `server`.\n   */\n  readonly location: TransactionLocation;\n  /** @deprecated Use {@link ReadTransaction.location} instead. */\n  readonly environment: TransactionLocation;\n\n  constructor(\n    clientID: ClientID,\n    dbRead: Read,\n    lc: LogContext,\n    rpcName = 'openReadTransaction',\n  ) {\n    this.clientID = clientID;\n    this.dbtx = dbRead;\n    this._lc = lc\n      .withContext(rpcName)\n      .withContext('txid', transactionIDCounter++);\n    this.environment = 'client';\n    this.location = 'client';\n  }\n\n  get(key: string): Promise<ReadonlyJSONValue | undefined>;\n  get<V extends JSONValue>(key: string): Promise<DeepReadonly<V> | undefined> {\n    return (\n      rejectIfClosed(this.dbtx) ||\n      (this.dbtx.get(key) as Promise<DeepReadonly<V> | undefined>)\n    );\n  }\n\n  // oxlint-disable-next-line require-await\n  async has(key: string): Promise<boolean> {\n    throwIfClosed(this.dbtx);\n    return this.dbtx.has(key);\n  }\n\n  // oxlint-disable-next-line require-await\n  async isEmpty(): Promise<boolean> {\n    throwIfClosed(this.dbtx);\n    return this.dbtx.isEmpty();\n  }\n\n  scan(options: ScanIndexOptions): ScanResult<IndexKey, ReadonlyJSONValue>;\n  scan(options?: ScanNoIndexOptions): ScanResult<string, ReadonlyJSONValue>;\n  scan(options?: ScanOptions): ScanResult<IndexKey | string, ReadonlyJSONValue>;\n\n  scan<V extends ReadonlyJSONValue>(\n    options: ScanIndexOptions,\n  ): ScanResult<IndexKey, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanNoIndexOptions,\n  ): ScanResult<string, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanOptions,\n  ): ScanResult<IndexKey | string, DeepReadonly<V>>;\n\n  scan(\n    options?: ScanOptions,\n  ): ScanResult<IndexKey | string, ReadonlyJSONValue> {\n    return scan(options, this.dbtx, noop);\n  }\n}\n\nfunction noop(_: unknown): void {\n  // empty\n}\n\nfunction scan<Options extends ScanOptions, V extends JSONValue>(\n  options: Options | undefined,\n  dbRead: Read,\n  onLimitKey: (inclusiveLimitKey: string) => void,\n): ScanResult<KeyTypeForScanOptions<Options>, V> {\n  const iter = getScanIterator<Options, V>(dbRead, options);\n  return makeScanResultFromScanIteratorInternal(\n    iter,\n    options ?? ({} as Options),\n    dbRead,\n    onLimitKey,\n  );\n}\n\n// An implementation of ReadTransaction that keeps track of `keys` and `scans`\n// for use with Subscriptions.\nexport class SubscriptionTransactionWrapper implements ReadTransaction {\n  readonly #keys: Set<string> = new Set();\n  readonly #scans: ScanSubscriptionInfo[] = [];\n  readonly #tx: ReadTransactionImpl;\n\n  constructor(tx: ReadTransactionImpl) {\n    this.#tx = tx;\n  }\n\n  get environment(): TransactionLocation {\n    return this.#tx.location;\n  }\n\n  get location(): TransactionLocation {\n    return this.#tx.location;\n  }\n\n  get clientID(): string {\n    return this.#tx.clientID;\n  }\n\n  isEmpty(): Promise<boolean> {\n    // Any change to the subscription requires rerunning it.\n    this.#scans.push({options: {}});\n    return this.#tx.isEmpty();\n  }\n\n  get(key: string): Promise<ReadonlyJSONValue | undefined>;\n  get<T extends JSONValue>(key: string): Promise<DeepReadonly<T> | undefined> {\n    this.#keys.add(key);\n    return this.#tx.get(key) as Promise<DeepReadonly<T> | undefined>;\n  }\n\n  has(key: string): Promise<boolean> {\n    this.#keys.add(key);\n    return this.#tx.has(key);\n  }\n\n  scan(options: ScanIndexOptions): ScanResult<IndexKey, ReadonlyJSONValue>;\n  scan(options?: ScanNoIndexOptions): ScanResult<string, ReadonlyJSONValue>;\n  scan(options?: ScanOptions): ScanResult<IndexKey | string, ReadonlyJSONValue>;\n\n  scan<V extends ReadonlyJSONValue>(\n    options: ScanIndexOptions,\n  ): ScanResult<IndexKey, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanNoIndexOptions,\n  ): ScanResult<string, DeepReadonly<V>>;\n  scan<V extends ReadonlyJSONValue>(\n    options?: ScanOptions,\n  ): ScanResult<IndexKey | string, DeepReadonly<V>>;\n\n  scan(\n    options?: ScanOptions,\n  ): ScanResult<IndexKey | string, ReadonlyJSONValue> {\n    const scanInfo: ScanSubscriptionInfo = {\n      options: toDbScanOptions(options),\n      inclusiveLimitKey: undefined,\n    };\n    this.#scans.push(scanInfo);\n    return scan(options, this.#tx.dbtx, inclusiveLimitKey => {\n      scanInfo.inclusiveLimitKey = inclusiveLimitKey;\n    });\n  }\n\n  get keys(): ReadonlySet<string> {\n    return this.#keys;\n  }\n\n  get scans(): ScanSubscriptionInfo[] {\n    return this.#scans;\n  }\n}\n\n/**\n * WriteTransactions are used with *mutators* which are registered using\n * {@link ReplicacheOptions.mutators} and allows read and write operations on the\n * database.\n */\nexport interface WriteTransaction extends ReadTransaction {\n  /**\n   * The ID of the mutation that is being applied.\n   */\n  readonly mutationID: number;\n\n  /**\n   * The reason for the transaction. This can be `initial`, `rebase` or `authoriative`.\n   */\n  readonly reason: TransactionReason;\n\n  /**\n   * Sets a single `value` in the database. The value will be frozen (using\n   * `Object.freeze`) in debug mode.\n   */\n  set(key: string, value: ReadonlyJSONValue): Promise<void>;\n\n  /**\n   * @deprecated Use {@link WriteTransaction.set} instead.\n   */\n  put(key: string, value: ReadonlyJSONValue): Promise<void>;\n\n  /**\n   * Removes a `key` and its value from the database. Returns `true` if there was a\n   * `key` to remove.\n   */\n  del(key: string): Promise<boolean>;\n}\n\n// Internal symbol, not exported by Replicache\n// but accessible to Zero.\nexport const zeroData = Symbol();\n\nexport class WriteTransactionImpl\n  extends ReadTransactionImpl\n  implements WriteTransaction\n{\n  // use `declare` to specialize the type.\n  declare readonly dbtx: Write;\n  readonly reason: TransactionReason;\n  readonly mutationID: number;\n  readonly [zeroData]: ZeroTxData | undefined;\n\n  constructor(\n    clientID: ClientID,\n    mutationID: number,\n    reason: TransactionReason,\n    zData: ZeroTxData | undefined,\n    dbWrite: Write,\n    lc: LogContext,\n    rpcName = 'openWriteTransaction',\n  ) {\n    super(clientID, dbWrite, lc, rpcName);\n    this.mutationID = mutationID;\n    this.reason = reason;\n    this[zeroData] = zData;\n  }\n\n  put(key: string, value: ReadonlyJSONValue): Promise<void> {\n    return this.set(key, value);\n  }\n\n  async set(key: string, value: ReadonlyJSONValue): Promise<void> {\n    throwIfClosed(this.dbtx);\n    await this.dbtx.put(this._lc, key, deepFreeze(value));\n  }\n\n  del(key: string): Promise<boolean> {\n    return rejectIfClosed(this.dbtx) ?? this.dbtx.del(this._lc, key);\n  }\n}\n\nexport type CreateIndexDefinition = IndexDefinition & {name: string};\n\ntype Entry<Key, Value> = readonly [key: Key, value: Value];\n\ntype IndexKeyEntry<Value> = Entry<IndexKey, Value>;\n\ntype StringKeyEntry<Value> = Entry<string, Value>;\n\nexport type EntryForOptions<\n  Options extends ScanOptions,\n  V,\n> = Options extends ScanIndexOptions ? IndexKeyEntry<V> : StringKeyEntry<V>;\n\nfunction getScanIterator<Options extends ScanOptions, V>(\n  dbRead: Read,\n  options: Options | undefined,\n): AsyncIterable<EntryForOptions<Options, V>> {\n  if (options && isScanIndexOptions(options)) {\n    return getScanIteratorForIndexMap(dbRead, options) as AsyncIterable<\n      EntryForOptions<Options, V>\n    >;\n  }\n\n  return dbRead.map.scan(fromKeyForNonIndexScan(options)) as AsyncIterable<\n    EntryForOptions<Options, V>\n  >;\n}\n\nexport function fromKeyForNonIndexScan(\n  options: ScanNoIndexOptions | undefined,\n): string {\n  if (!options) {\n    return '';\n  }\n\n  const {prefix = '', start} = options;\n  if (start && greaterThan(start.key, prefix)) {\n    return start.key;\n  }\n  return prefix;\n}\n\nfunction makeScanResultFromScanIteratorInternal<\n  Options extends ScanOptions,\n  V extends JSONValue,\n>(\n  iter: AsyncIterable<EntryForOptions<Options, V>>,\n  options: Options,\n  dbRead: Read,\n  onLimitKey: (inclusiveLimitKey: string) => void,\n): ScanResult<KeyTypeForScanOptions<Options>, V> {\n  return new ScanResultImpl(iter, options, dbRead, onLimitKey);\n}\n\nasync function* getScanIteratorForIndexMap(\n  dbRead: Read,\n  options: ScanIndexOptions,\n): AsyncIterable<IndexKeyEntry<ReadonlyJSONValue>> {\n  const map = dbRead.getMapForIndex(options.indexName);\n  for await (const entry of map.scan(fromKeyForIndexScanInternal(options))) {\n    yield [decodeIndexKey(entry[0]), entry[1]];\n  }\n}\n"],"mappings":";;;;;;;AAyGA,IAAI,uBAAuB;AAE3B,IAAa,sBAAb,MAA4D;CAC1D;CACA;CACA;;;;CAKA;;CAEA;CAEA,YACE,UACA,QACA,IACA,UAAU,uBACV;AACA,OAAK,WAAW;AAChB,OAAK,OAAO;AACZ,OAAK,MAAM,GACR,YAAY,QAAQ,CACpB,YAAY,QAAQ,uBAAuB;AAC9C,OAAK,cAAc;AACnB,OAAK,WAAW;;CAIlB,IAAyB,KAAmD;AAC1E,SACE,eAAe,KAAK,KAAK,IACxB,KAAK,KAAK,IAAI,IAAI;;CAKvB,MAAM,IAAI,KAA+B;AACvC,gBAAc,KAAK,KAAK;AACxB,SAAO,KAAK,KAAK,IAAI,IAAI;;CAI3B,MAAM,UAA4B;AAChC,gBAAc,KAAK,KAAK;AACxB,SAAO,KAAK,KAAK,SAAS;;CAiB5B,KACE,SACkD;AAClD,SAAO,KAAK,SAAS,KAAK,MAAM,KAAK;;;AAIzC,SAAS,KAAK,GAAkB;AAIhC,SAAS,KACP,SACA,QACA,YAC+C;AAE/C,QAAO,uCADM,gBAA4B,QAAQ,QAAQ,EAGvD,WAAY,EAAE,EACd,QACA,WACD;;AAKH,IAAa,iCAAb,MAAuE;CACrE,wBAA8B,IAAI,KAAK;CACvC,SAA0C,EAAE;CAC5C;CAEA,YAAY,IAAyB;AACnC,QAAA,KAAW;;CAGb,IAAI,cAAmC;AACrC,SAAO,MAAA,GAAS;;CAGlB,IAAI,WAAgC;AAClC,SAAO,MAAA,GAAS;;CAGlB,IAAI,WAAmB;AACrB,SAAO,MAAA,GAAS;;CAGlB,UAA4B;AAE1B,QAAA,MAAY,KAAK,EAAC,SAAS,EAAE,EAAC,CAAC;AAC/B,SAAO,MAAA,GAAS,SAAS;;CAI3B,IAAyB,KAAmD;AAC1E,QAAA,KAAW,IAAI,IAAI;AACnB,SAAO,MAAA,GAAS,IAAI,IAAI;;CAG1B,IAAI,KAA+B;AACjC,QAAA,KAAW,IAAI,IAAI;AACnB,SAAO,MAAA,GAAS,IAAI,IAAI;;CAiB1B,KACE,SACkD;EAClD,MAAM,WAAiC;GACrC,SAAS,gBAAgB,QAAQ;GACjC,mBAAmB,KAAA;GACpB;AACD,QAAA,MAAY,KAAK,SAAS;AAC1B,SAAO,KAAK,SAAS,MAAA,GAAS,OAAM,sBAAqB;AACvD,YAAS,oBAAoB;IAC7B;;CAGJ,IAAI,OAA4B;AAC9B,SAAO,MAAA;;CAGT,IAAI,QAAgC;AAClC,SAAO,MAAA;;;AAwCX,IAAa,WAAW,QAAQ;AAEhC,IAAa,uBAAb,cACU,oBAEV;CAGE;CACA;CACA,CAAU;CAEV,YACE,UACA,YACA,QACA,OACA,SACA,IACA,UAAU,wBACV;AACA,QAAM,UAAU,SAAS,IAAI,QAAQ;AACrC,OAAK,aAAa;AAClB,OAAK,SAAS;AACd,OAAK,YAAY;;CAGnB,IAAI,KAAa,OAAyC;AACxD,SAAO,KAAK,IAAI,KAAK,MAAM;;CAG7B,MAAM,IAAI,KAAa,OAAyC;AAC9D,gBAAc,KAAK,KAAK;AACxB,QAAM,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,WAAW,MAAM,CAAC;;CAGvD,IAAI,KAA+B;AACjC,SAAO,eAAe,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI;;;AAiBpE,SAAS,gBACP,QACA,SAC4C;AAC5C,KAAI,WAAW,mBAAmB,QAAQ,CACxC,QAAO,2BAA2B,QAAQ,QAAQ;AAKpD,QAAO,OAAO,IAAI,KAAK,uBAAuB,QAAQ,CAAC;;AAKzD,SAAgB,uBACd,SACQ;AACR,KAAI,CAAC,QACH,QAAO;CAGT,MAAM,EAAC,SAAS,IAAI,UAAS;AAC7B,KAAI,SAAS,YAAY,MAAM,KAAK,OAAO,CACzC,QAAO,MAAM;AAEf,QAAO;;AAGT,SAAS,uCAIP,MACA,SACA,QACA,YAC+C;AAC/C,QAAO,IAAI,eAAe,MAAM,SAAS,QAAQ,WAAW;;AAG9D,gBAAgB,2BACd,QACA,SACiD;CACjD,MAAM,MAAM,OAAO,eAAe,QAAQ,UAAU;AACpD,YAAW,MAAM,SAAS,IAAI,KAAK,4BAA4B,QAAQ,CAAC,CACtE,OAAM,CAAC,eAAe,MAAM,GAAG,EAAE,MAAM,GAAG"}