@rocicorp/zero 1.12.0-canary.3 → 1.12.0-canary.4

package/out/zero-cache/src/services/view-syncer/batch-pacer.js.map

@@ -1 +1 @@
-{"version":3,"file":"batch-pacer.js","names":["#shareTarget","#maxIntervalMs","#now","#utilization","#lc","#waiting","#intervalStart","#update","#multiplier","#waitsBelowMax","#waitsAtMax","#share","#saturatedSeconds","#logPacing","#notPacingSince","#pacingLoggedAt","#handingOutSlices","#nextSlice","#hydrationSlices"],"sources":["../../../../../../zero-cache/src/services/view-syncer/batch-pacer.ts"],"sourcesContent":["import {performance} from 'node:perf_hooks';\nimport type {LogContext} from '@rocicorp/logger';\n\n/** How often the multiplier is updated. */\nconst UPDATE_INTERVAL_MS = 1000;\n\n/**\n * The weight of the latest second in the worker's smoothed busy share.\n * Client groups that wait for seconds between batches make the share of\n * any one second jump between idle and saturated, and a worker that keeps\n * up has the odd busy second. Neither says what the load is.\n */\nconst SHARE_SMOOTHING = 0.3;\n\n/**\n * How much of the difference between the smoothed busy share and the target\n * each update corrects for. The smoothed share only shows part of what the\n * previous updates did, so correcting for all of the difference each time\n * would overshoot and oscillate.\n */\nconst CORRECTION_EXPONENT = 0.3;\n\n/**\n * The share of its time above which a worker has no time to spare. A share\n * target has to stay well clear of this to be held, which is why\n * `syncUpdateShareTarget` is at most 0.9 (or 1, which no worker is over).\n */\nconst SATURATED_SHARE = 0.95;\n\n/** The seconds that a worker has to be saturated for to be treated as such. */\nconst SATURATED_SECONDS = 2;\n\n/**\n * How much `1 + k` is scaled by each second that the worker is saturated.\n * A saturated worker does not show how much more its client groups would\n * use, which can be many times what it has, so the multiplier is raised by\n * more than the difference from the target calls for until it does.\n */\nconst SATURATED_CORRECTION = 1.3;\n\n/**\n * How often a worker that is pacing its client groups says so in its log,\n * and how long it has to have stopped for to say that it has.\n */\nconst PACING_LOG_INTERVAL_MS = 60_000;\n\n/**\n * The most updates that are made up for when nothing has asked the pacer\n * for a wait in a while, which is enough for the multiplier to get to 0.\n */\nconst MAX_CATCH_UP_UPDATES = 60;\n\n/**\n * Bounds the multiplier, which otherwise has no limit while a worker stays\n * over the target however long its client groups wait.\n */\nconst MAX_MULTIPLIER = 1_000_000;\n\nexport type BatchPacerOptions = {\n  /**\n   * The largest share of the worker's time that it may be busy before its\n   * client groups are paced.\n   */\n  readonly shareTarget: number;\n  /** The longest a client group waits between batches. */\n  readonly maxIntervalMs: number;\n  readonly now?: (() => number) | undefined;\n  /**\n   * The share of the time since the previous call that the worker was busy.\n   * By default, the utilization of the event loop.\n   */\n  readonly utilization?: (() => number) | undefined;\n  /** Where the worker says that it is pacing its client groups. */\n  readonly lc?: LogContext | undefined;\n};\n\nfunction eventLoopUtilization(): () => number {\n  let last = performance.eventLoopUtilization();\n  return () => {\n    const current = performance.eventLoopUtilization();\n    const {utilization} = performance.eventLoopUtilization(current, last);\n    last = current;\n    return utilization;\n  };\n}\n\n/**\n * Paces the batches (advancements, including the queries they hydrate\n * again) of the client groups of a sync worker, so that the worker is left\n * with time for new hydrations and connections, and gives the hydrations of\n * new queries priority over the batches.\n *\n * **Pacing.** After each batch, a client group waits {@link waitMs} before\n * it starts the next. The wait is a multiple of the batch's processing\n * time, so a client group that always has changes waiting is busy at most\n * `1 / (1 + k)` of the time, where `k` is the {@link multiplier}. Because\n * the wait is in proportion to a client group's own processing time, those\n * that cause the load are slowed the most, and cheap ones barely at all.\n *\n * The multiplier is shared by the client groups of the worker. Once per\n * second, it is scaled by how far the share of its time that the worker was\n * busy, smoothed over a few seconds, is from the target, and by more while\n * the worker has no time to spare. It never goes below 0, where no client\n * group waits. The share is the utilization of the worker's event loop, i.e. all\n * of what the worker does: what a batch costs is spread over the pipelines,\n * the CVR, the pokes and garbage collection, and is not measurable batch by\n * batch.\n *\n * **Priority of new hydrations.** The worker's time slices are handed out\n * by the pacer (see {@link yieldSlice}), and while the hydration of new\n * queries is waiting for one, most of them go to it rather than to batches.\n */\nexport class BatchPacer {\n  readonly #shareTarget: number;\n  readonly #maxIntervalMs: number;\n  readonly #now: () => number;\n  readonly #utilization: () => number;\n  readonly #lc: LogContext | undefined;\n\n  /** When the worker last logged that it is pacing, while it still is. */\n  #pacingLoggedAt: number | undefined;\n  /** Since when the worker has not been pacing, after it logged that it was. */\n  #notPacingSince: number | undefined;\n\n  #intervalStart: number;\n  #multiplier = 0;\n  /** The smoothed share of its time that the worker was busy. */\n  #share = 0;\n  #saturatedSeconds = 0;\n  /** The waits handed out since the last update, by whether at the cap. */\n  #waitsBelowMax = 0;\n  #waitsAtMax = 0;\n\n  /** The work that is waiting for a time slice, in the order it yielded. */\n  readonly #waiting = {\n    hydration: [] as (() => void)[],\n    batch: [] as (() => void)[],\n  };\n  #handingOutSlices = false;\n  /** The slices that have gone to hydrations since one went to a batch. */\n  #hydrationSlices = 0;\n\n  constructor({\n    shareTarget,\n    maxIntervalMs,\n    now,\n    utilization,\n    lc,\n  }: BatchPacerOptions) {\n    this.#shareTarget = shareTarget;\n    this.#maxIntervalMs = maxIntervalMs;\n    this.#now = now ?? (() => performance.now());\n    this.#utilization = utilization ?? eventLoopUtilization();\n    this.#lc = lc;\n    this.#intervalStart = this.#now();\n  }\n\n  /**\n   * How long a client group should wait before its next batch, after one\n   * that took `processingMs` to process. The multiplier changes while a\n   * client group waits, so a long wait should be taken in steps, asking\n   * again after each.\n   */\n  waitMs(processingMs: number): number {\n    this.#update();\n    const wait = this.#multiplier * processingMs;\n    if (wait < this.#maxIntervalMs) {\n      this.#waitsBelowMax++;\n      return wait;\n    }\n    this.#waitsAtMax++;\n    return this.#maxIntervalMs;\n  }\n\n  /** `k`: a client group waits `k` times the processing time of a batch. */\n  get multiplier(): number {\n    this.#update();\n    return this.#multiplier;\n  }\n\n  /**\n   * The share of its time that the worker was busy, smoothed over the last\n   * few seconds, as of the last update of the multiplier.\n   */\n  get share(): number {\n    this.#update();\n    return this.#share;\n  }\n\n  /** Updates the multiplier for each interval that has ended. */\n  #update(): void {\n    const now = this.#now();\n    const ended = Math.floor((now - this.#intervalStart) / UPDATE_INTERVAL_MS);\n    if (ended <= 0) {\n      return;\n    }\n    this.#intervalStart += ended * UPDATE_INTERVAL_MS;\n    // If more than one interval has ended, nothing asked the pacer for a\n    // wait in the meantime, and the utilization since then is that of each.\n    const latest = this.#utilization();\n    // Once every client group is told to wait the longest it can, raising\n    // the multiplier changes nothing, and only makes it take longer to come\n    // back down. A worker that is still over its target then is busy with\n    // something that making its client groups wait does not relieve.\n    const allAtMax = this.#waitsAtMax > 0 && this.#waitsBelowMax === 0;\n    this.#waitsAtMax = 0;\n    this.#waitsBelowMax = 0;\n    for (let i = Math.min(ended, MAX_CATCH_UP_UPDATES); i > 0; i--) {\n      this.#share += SHARE_SMOOTHING * (latest - this.#share);\n      // A worker that is allowed to be this busy is only raised the\n      // multiplier for what it is over its target by.\n      this.#saturatedSeconds =\n        latest >= SATURATED_SHARE && latest > this.#shareTarget\n          ? this.#saturatedSeconds + 1\n          : 0;\n      let correction =\n        this.#saturatedSeconds >= SATURATED_SECONDS\n          ? SATURATED_CORRECTION\n          : (this.#share / this.#shareTarget) ** CORRECTION_EXPONENT;\n      if (allAtMax && correction > 1) {\n        correction = 1;\n      }\n      this.#multiplier = Math.min(\n        Math.max((1 + this.#multiplier) * correction - 1, 0),\n        MAX_MULTIPLIER,\n      );\n    }\n    this.#logPacing(now, allAtMax);\n  }\n\n  /**\n   * Says in the worker's log when it starts to pace its client groups, once\n   * a minute while it does, and when it has stopped. The pacing of a client\n   * group is logged by its view syncer.\n   */\n  #logPacing(now: number, allAtMax: boolean): void {\n    const lc = this.#lc;\n    if (lc === undefined) {\n      return;\n    }\n    const state = {\n      busyShare: this.#share,\n      shareTarget: this.#shareTarget,\n      waitMultiplier: this.#multiplier,\n      maxBatchIntervalMs: this.#maxIntervalMs,\n    };\n    if (this.#multiplier > 0) {\n      this.#notPacingSince = undefined;\n      if (this.#pacingLoggedAt === undefined) {\n        lc.info?.(\n          'Sync worker is over its share target: its client groups wait between batches',\n          state,\n        );\n        this.#pacingLoggedAt = now;\n      } else if (now - this.#pacingLoggedAt >= PACING_LOG_INTERVAL_MS) {\n        if (allAtMax && this.#share > this.#shareTarget) {\n          // Waiting longer is not an option, so pacing cannot bring the\n          // worker to its target: it has more to do than it has time for.\n          lc.warn?.(\n            'Sync worker is over its share target although every client group waits the longest it may',\n            state,\n          );\n        } else {\n          lc.info?.('Sync worker is pacing its client groups', state);\n        }\n        this.#pacingLoggedAt = now;\n      }\n    } else if (this.#pacingLoggedAt !== undefined) {\n      // A worker around its target goes in and out of pacing. It only says\n      // that it has stopped once it has stayed out.\n      this.#notPacingSince ??= now;\n      if (now - this.#notPacingSince >= PACING_LOG_INTERVAL_MS) {\n        lc.info?.(\n          'Sync worker is under its share target: its client groups no longer wait',\n          state,\n        );\n        this.#pacingLoggedAt = undefined;\n        this.#notPacingSince = undefined;\n      }\n    }\n  }\n\n  /**\n   * Yields the worker to the other work that is waiting for a time slice,\n   * and resolves when it is the caller's turn again. One piece of work runs\n   * per turn of the event loop, as when the work of a worker's client groups\n   * simply takes turns, except that the hydration of new queries goes first:\n   * while both kinds of work are waiting, `HYDRATION_PRIORITY` slices go to\n   * hydrations for each one that goes to a batch.\n   *\n   * Batches are never made to wait for anything but a slice. If no\n   * hydration is waiting for one (because none is running, or because those\n   * that are running are waiting for I/O), batches get every slice. And\n   * however many hydrations there are, batches keep a share of the slices,\n   * so they keep moving, and so do the snapshots of the replica that they\n   * hold.\n   */\n  yieldSlice(kind: 'hydration' | 'batch'): Promise<void> {\n    return new Promise(resolve => {\n      this.#waiting[kind].push(resolve);\n      if (!this.#handingOutSlices) {\n        this.#handingOutSlices = true;\n        setImmediate(this.#nextSlice);\n      }\n    });\n  }\n\n  readonly #nextSlice = () => {\n    const {hydration, batch} = this.#waiting;\n    let next: (() => void) | undefined;\n    if (\n      hydration.length > 0 &&\n      (batch.length === 0 || this.#hydrationSlices < HYDRATION_PRIORITY)\n    ) {\n      next = hydration.shift();\n      this.#hydrationSlices++;\n    } else if (batch.length > 0) {\n      next = batch.shift();\n      this.#hydrationSlices = 0;\n    }\n    if (next === undefined) {\n      this.#handingOutSlices = false;\n      return;\n    }\n    next();\n    // After the work that was just resumed has run its slice.\n    setImmediate(this.#nextSlice);\n  };\n}\n\n/**\n * How many time slices go to the hydration of new queries for each one that\n * goes to a batch, while both are waiting for one.\n */\nconst HYDRATION_PRIORITY = 9;\n"],"mappings":";;;AAIA,IAAM,qBAAqB;;;;;;;AAQ3B,IAAM,kBAAkB;;;;;;;AAQxB,IAAM,sBAAsB;;;;;;AAO5B,IAAM,kBAAkB;;AAGxB,IAAM,oBAAoB;;;;;;;AAQ1B,IAAM,uBAAuB;;;;;AAM7B,IAAM,yBAAyB;;;;;AAM/B,IAAM,uBAAuB;;;;;AAM7B,IAAM,iBAAiB;AAoBvB,SAAS,uBAAqC;CAC5C,IAAI,OAAO,YAAY,qBAAqB;CAC5C,aAAa;EACX,MAAM,UAAU,YAAY,qBAAqB;EACjD,MAAM,EAAC,gBAAe,YAAY,qBAAqB,SAAS,IAAI;EACpE,OAAO;EACP,OAAO;CACT;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,IAAa,aAAb,MAAwB;CACtB;CACA;CACA;CACA;CACA;;CAGA;;CAEA;CAEA;CACA,cAAc;;CAEd,SAAS;CACT,oBAAoB;;CAEpB,iBAAiB;CACjB,cAAc;;CAGd,WAAoB;EAClB,WAAW,CAAC;EACZ,OAAO,CAAC;CACV;CACA,oBAAoB;;CAEpB,mBAAmB;CAEnB,YAAY,EACV,aACA,eACA,KACA,aACA,MACoB;EACpB,KAAKA,eAAe;EACpB,KAAKC,iBAAiB;EACtB,KAAKC,OAAO,cAAc,YAAY,IAAI;EAC1C,KAAKC,eAAe,eAAe,qBAAqB;EACxD,KAAKC,MAAM;EACX,KAAKE,iBAAiB,KAAKJ,KAAK;CAClC;;;;;;;CAQA,OAAO,cAA8B;EACnC,KAAKK,QAAQ;EACb,MAAM,OAAO,KAAKC,cAAc;EAChC,IAAI,OAAO,KAAKP,gBAAgB;GAC9B,KAAKQ;GACL,OAAO;EACT;EACA,KAAKC;EACL,OAAO,KAAKT;CACd;;CAGA,IAAI,aAAqB;EACvB,KAAKM,QAAQ;EACb,OAAO,KAAKC;CACd;;;;;CAMA,IAAI,QAAgB;EAClB,KAAKD,QAAQ;EACb,OAAO,KAAKI;CACd;;CAGA,UAAgB;EACd,MAAM,MAAM,KAAKT,KAAK;EACtB,MAAM,QAAQ,KAAK,OAAO,MAAM,KAAKI,kBAAkB,kBAAkB;EACzE,IAAI,SAAS,GACX;EAEF,KAAKA,kBAAkB,QAAQ;EAG/B,MAAM,SAAS,KAAKH,aAAa;EAKjC,MAAM,WAAW,KAAKO,cAAc,KAAK,KAAKD,mBAAmB;EACjE,KAAKC,cAAc;EACnB,KAAKD,iBAAiB;EACtB,KAAK,IAAI,IAAI,KAAK,IAAI,OAAO,oBAAoB,GAAG,IAAI,GAAG,KAAK;GAC9D,KAAKE,UAAU,mBAAmB,SAAS,KAAKA;GAGhD,KAAKC,oBACH,UAAU,mBAAmB,SAAS,KAAKZ,eACvC,KAAKY,oBAAoB,IACzB;GACN,IAAI,aACF,KAAKA,qBAAqB,oBACtB,wBACC,KAAKD,SAAS,KAAKX,iBAAiB;GAC3C,IAAI,YAAY,aAAa,GAC3B,aAAa;GAEf,KAAKQ,cAAc,KAAK,IACtB,KAAK,KAAK,IAAI,KAAKA,eAAe,aAAa,GAAG,CAAC,GACnD,cACF;EACF;EACA,KAAKK,WAAW,KAAK,QAAQ;CAC/B;;;;;;CAOA,WAAW,KAAa,UAAyB;EAC/C,MAAM,KAAK,KAAKT;EAChB,IAAI,OAAO,KAAA,GACT;EAEF,MAAM,QAAQ;GACZ,WAAW,KAAKO;GAChB,aAAa,KAAKX;GAClB,gBAAgB,KAAKQ;GACrB,oBAAoB,KAAKP;EAC3B;EACA,IAAI,KAAKO,cAAc,GAAG;GACxB,KAAKM,kBAAkB,KAAA;GACvB,IAAI,KAAKC,oBAAoB,KAAA,GAAW;IACtC,GAAG,OACD,gFACA,KACF;IACA,KAAKA,kBAAkB;GACzB,OAAO,IAAI,MAAM,KAAKA,mBAAmB,wBAAwB;IAC/D,IAAI,YAAY,KAAKJ,SAAS,KAAKX,cAGjC,GAAG,OACD,6FACA,KACF;SAEA,GAAG,OAAO,2CAA2C,KAAK;IAE5D,KAAKe,kBAAkB;GACzB;EACF,OAAO,IAAI,KAAKA,oBAAoB,KAAA,GAAW;GAG7C,KAAKD,oBAAoB;GACzB,IAAI,MAAM,KAAKA,mBAAmB,wBAAwB;IACxD,GAAG,OACD,2EACA,KACF;IACA,KAAKC,kBAAkB,KAAA;IACvB,KAAKD,kBAAkB,KAAA;GACzB;EACF;CACF;;;;;;;;;;;;;;;;CAiBA,WAAW,MAA4C;EACrD,OAAO,IAAI,SAAQ,YAAW;GAC5B,KAAKT,SAAS,MAAM,KAAK,OAAO;GAChC,IAAI,CAAC,KAAKW,mBAAmB;IAC3B,KAAKA,oBAAoB;IACzB,aAAa,KAAKC,UAAU;GAC9B;EACF,CAAC;CACH;CAEA,mBAA4B;EAC1B,MAAM,EAAC,WAAW,UAAS,KAAKZ;EAChC,IAAI;EACJ,IACE,UAAU,SAAS,MAClB,MAAM,WAAW,KAAK,KAAKa,mBAAmB,qBAC/C;GACA,OAAO,UAAU,MAAM;GACvB,KAAKA;EACP,OAAO,IAAI,MAAM,SAAS,GAAG;GAC3B,OAAO,MAAM,MAAM;GACnB,KAAKA,mBAAmB;EAC1B;EACA,IAAI,SAAS,KAAA,GAAW;GACtB,KAAKF,oBAAoB;GACzB;EACF;EACA,KAAK;EAEL,aAAa,KAAKC,UAAU;CAC9B;AACF;;;;;AAMA,IAAM,qBAAqB"}
+{"version":3,"file":"batch-pacer.js","names":[],"sources":["../../../../../../zero-cache/src/services/view-syncer/batch-pacer.ts"],"sourcesContent":["import {performance} from 'node:perf_hooks';\nimport type {LogContext} from '@rocicorp/logger';\n\n/** How often the multiplier is updated. */\nconst UPDATE_INTERVAL_MS = 1000;\n\n/**\n * The weight of the latest second in the worker's smoothed busy share.\n * Client groups that wait for seconds between batches make the share of\n * any one second jump between idle and saturated, and a worker that keeps\n * up has the odd busy second. Neither says what the load is.\n */\nconst SHARE_SMOOTHING = 0.3;\n\n/**\n * How much of the difference between the smoothed busy share and the target\n * each update corrects for. The smoothed share only shows part of what the\n * previous updates did, so correcting for all of the difference each time\n * would overshoot and oscillate.\n */\nconst CORRECTION_EXPONENT = 0.3;\n\n/**\n * The share of its time above which a worker has no time to spare. A share\n * target has to stay well clear of this to be held, which is why\n * `syncUpdateShareTarget` is at most 0.9 (or 1, which no worker is over).\n */\nconst SATURATED_SHARE = 0.95;\n\n/** The seconds that a worker has to be saturated for to be treated as such. */\nconst SATURATED_SECONDS = 2;\n\n/**\n * How much `1 + k` is scaled by each second that the worker is saturated.\n * A saturated worker does not show how much more its client groups would\n * use, which can be many times what it has, so the multiplier is raised by\n * more than the difference from the target calls for until it does.\n */\nconst SATURATED_CORRECTION = 1.3;\n\n/**\n * How often a worker that is pacing its client groups says so in its log,\n * and how long it has to have stopped for to say that it has.\n */\nconst PACING_LOG_INTERVAL_MS = 60_000;\n\n/**\n * The most updates that are made up for when nothing has asked the pacer\n * for a wait in a while, which is enough for the multiplier to get to 0.\n */\nconst MAX_CATCH_UP_UPDATES = 60;\n\n/**\n * Bounds the multiplier, which otherwise has no limit while a worker stays\n * over the target however long its client groups wait.\n */\nconst MAX_MULTIPLIER = 1_000_000;\n\nexport type BatchPacerOptions = {\n  /**\n   * The largest share of the worker's time that it may be busy before its\n   * client groups are paced.\n   */\n  readonly shareTarget: number;\n  /** The longest a client group waits between batches. */\n  readonly maxIntervalMs: number;\n  readonly now?: (() => number) | undefined;\n  /**\n   * The share of the time since the previous call that the worker was busy.\n   * By default, the utilization of the event loop.\n   */\n  readonly utilization?: (() => number) | undefined;\n  /** Where the worker says that it is pacing its client groups. */\n  readonly lc?: LogContext | undefined;\n};\n\nfunction eventLoopUtilization(): () => number {\n  let last = performance.eventLoopUtilization();\n  return () => {\n    const current = performance.eventLoopUtilization();\n    const {utilization} = performance.eventLoopUtilization(current, last);\n    last = current;\n    return utilization;\n  };\n}\n\n/**\n * Paces the batches (advancements, including the queries they hydrate\n * again) of the client groups of a sync worker, so that the worker is left\n * with time for new hydrations and connections, and gives the hydrations of\n * new queries priority over the batches.\n *\n * **Pacing.** After each batch, a client group waits {@link waitMs} before\n * it starts the next. The wait is a multiple of the batch's processing\n * time, so a client group that always has changes waiting is busy at most\n * `1 / (1 + k)` of the time, where `k` is the {@link multiplier}. Because\n * the wait is in proportion to a client group's own processing time, those\n * that cause the load are slowed the most, and cheap ones barely at all.\n *\n * The multiplier is shared by the client groups of the worker. Once per\n * second, it is scaled by how far the share of its time that the worker was\n * busy, smoothed over a few seconds, is from the target, and by more while\n * the worker has no time to spare. It never goes below 0, where no client\n * group waits. The share is the utilization of the worker's event loop, i.e. all\n * of what the worker does: what a batch costs is spread over the pipelines,\n * the CVR, the pokes and garbage collection, and is not measurable batch by\n * batch.\n *\n * **Priority of new hydrations.** The worker's time slices are handed out\n * by the pacer (see {@link yieldSlice}), and while the hydration of new\n * queries is waiting for one, most of them go to it rather than to batches.\n */\nexport class BatchPacer {\n  readonly #shareTarget: number;\n  readonly #maxIntervalMs: number;\n  readonly #now: () => number;\n  readonly #utilization: () => number;\n  readonly #lc: LogContext | undefined;\n\n  /** When the worker last logged that it is pacing, while it still is. */\n  #pacingLoggedAt: number | undefined;\n  /** Since when the worker has not been pacing, after it logged that it was. */\n  #notPacingSince: number | undefined;\n\n  #intervalStart: number;\n  #multiplier = 0;\n  /** The smoothed share of its time that the worker was busy. */\n  #share = 0;\n  #saturatedSeconds = 0;\n  /** The waits handed out since the last update, by whether at the cap. */\n  #waitsBelowMax = 0;\n  #waitsAtMax = 0;\n\n  /** The work that is waiting for a time slice, in the order it yielded. */\n  readonly #waiting = {\n    hydration: [] as (() => void)[],\n    batch: [] as (() => void)[],\n  };\n  #handingOutSlices = false;\n  /** The slices that have gone to hydrations since one went to a batch. */\n  #hydrationSlices = 0;\n\n  constructor({\n    shareTarget,\n    maxIntervalMs,\n    now,\n    utilization,\n    lc,\n  }: BatchPacerOptions) {\n    this.#shareTarget = shareTarget;\n    this.#maxIntervalMs = maxIntervalMs;\n    this.#now = now ?? (() => performance.now());\n    this.#utilization = utilization ?? eventLoopUtilization();\n    this.#lc = lc;\n    this.#intervalStart = this.#now();\n  }\n\n  /**\n   * How long a client group should wait before its next batch, after one\n   * that took `processingMs` to process. The multiplier changes while a\n   * client group waits, so a long wait should be taken in steps, asking\n   * again after each.\n   */\n  waitMs(processingMs: number): number {\n    this.#update();\n    const wait = this.#multiplier * processingMs;\n    if (wait < this.#maxIntervalMs) {\n      this.#waitsBelowMax++;\n      return wait;\n    }\n    this.#waitsAtMax++;\n    return this.#maxIntervalMs;\n  }\n\n  /** `k`: a client group waits `k` times the processing time of a batch. */\n  get multiplier(): number {\n    this.#update();\n    return this.#multiplier;\n  }\n\n  /**\n   * The share of its time that the worker was busy, smoothed over the last\n   * few seconds, as of the last update of the multiplier.\n   */\n  get share(): number {\n    this.#update();\n    return this.#share;\n  }\n\n  /** Updates the multiplier for each interval that has ended. */\n  #update(): void {\n    const now = this.#now();\n    const ended = Math.floor((now - this.#intervalStart) / UPDATE_INTERVAL_MS);\n    if (ended <= 0) {\n      return;\n    }\n    this.#intervalStart += ended * UPDATE_INTERVAL_MS;\n    // If more than one interval has ended, nothing asked the pacer for a\n    // wait in the meantime, and the utilization since then is that of each.\n    const latest = this.#utilization();\n    // Once every client group is told to wait the longest it can, raising\n    // the multiplier changes nothing, and only makes it take longer to come\n    // back down. A worker that is still over its target then is busy with\n    // something that making its client groups wait does not relieve.\n    const allAtMax = this.#waitsAtMax > 0 && this.#waitsBelowMax === 0;\n    this.#waitsAtMax = 0;\n    this.#waitsBelowMax = 0;\n    for (let i = Math.min(ended, MAX_CATCH_UP_UPDATES); i > 0; i--) {\n      this.#share += SHARE_SMOOTHING * (latest - this.#share);\n      // A worker that is allowed to be this busy is only raised the\n      // multiplier for what it is over its target by.\n      this.#saturatedSeconds =\n        latest >= SATURATED_SHARE && latest > this.#shareTarget\n          ? this.#saturatedSeconds + 1\n          : 0;\n      let correction =\n        this.#saturatedSeconds >= SATURATED_SECONDS\n          ? SATURATED_CORRECTION\n          : (this.#share / this.#shareTarget) ** CORRECTION_EXPONENT;\n      if (allAtMax && correction > 1) {\n        correction = 1;\n      }\n      this.#multiplier = Math.min(\n        Math.max((1 + this.#multiplier) * correction - 1, 0),\n        MAX_MULTIPLIER,\n      );\n    }\n    this.#logPacing(now, allAtMax);\n  }\n\n  /**\n   * Says in the worker's log when it starts to pace its client groups, once\n   * a minute while it does, and when it has stopped. The pacing of a client\n   * group is logged by its view syncer.\n   */\n  #logPacing(now: number, allAtMax: boolean): void {\n    const lc = this.#lc;\n    if (lc === undefined) {\n      return;\n    }\n    const state = {\n      busyShare: this.#share,\n      shareTarget: this.#shareTarget,\n      waitMultiplier: this.#multiplier,\n      maxBatchIntervalMs: this.#maxIntervalMs,\n    };\n    if (this.#multiplier > 0) {\n      this.#notPacingSince = undefined;\n      if (this.#pacingLoggedAt === undefined) {\n        lc.info?.(\n          'Sync worker is over its share target: its client groups wait between batches',\n          state,\n        );\n        this.#pacingLoggedAt = now;\n      } else if (now - this.#pacingLoggedAt >= PACING_LOG_INTERVAL_MS) {\n        if (allAtMax && this.#share > this.#shareTarget) {\n          // Waiting longer is not an option, so pacing cannot bring the\n          // worker to its target: it has more to do than it has time for.\n          lc.warn?.(\n            'Sync worker is over its share target although every client group waits the longest it may',\n            state,\n          );\n        } else {\n          lc.info?.('Sync worker is pacing its client groups', state);\n        }\n        this.#pacingLoggedAt = now;\n      }\n    } else if (this.#pacingLoggedAt !== undefined) {\n      // A worker around its target goes in and out of pacing. It only says\n      // that it has stopped once it has stayed out.\n      this.#notPacingSince ??= now;\n      if (now - this.#notPacingSince >= PACING_LOG_INTERVAL_MS) {\n        lc.info?.(\n          'Sync worker is under its share target: its client groups no longer wait',\n          state,\n        );\n        this.#pacingLoggedAt = undefined;\n        this.#notPacingSince = undefined;\n      }\n    }\n  }\n\n  /**\n   * Yields the worker to the other work that is waiting for a time slice,\n   * and resolves when it is the caller's turn again. One piece of work runs\n   * per turn of the event loop, as when the work of a worker's client groups\n   * simply takes turns, except that the hydration of new queries goes first:\n   * while both kinds of work are waiting, `HYDRATION_PRIORITY` slices go to\n   * hydrations for each one that goes to a batch.\n   *\n   * Batches are never made to wait for anything but a slice. If no\n   * hydration is waiting for one (because none is running, or because those\n   * that are running are waiting for I/O), batches get every slice. And\n   * however many hydrations there are, batches keep a share of the slices,\n   * so they keep moving, and so do the snapshots of the replica that they\n   * hold.\n   */\n  yieldSlice(kind: 'hydration' | 'batch'): Promise<void> {\n    return new Promise(resolve => {\n      this.#waiting[kind].push(resolve);\n      if (!this.#handingOutSlices) {\n        this.#handingOutSlices = true;\n        setImmediate(this.#nextSlice);\n      }\n    });\n  }\n\n  readonly #nextSlice = () => {\n    const {hydration, batch} = this.#waiting;\n    let next: (() => void) | undefined;\n    if (\n      hydration.length > 0 &&\n      (batch.length === 0 || this.#hydrationSlices < HYDRATION_PRIORITY)\n    ) {\n      next = hydration.shift();\n      this.#hydrationSlices++;\n    } else if (batch.length > 0) {\n      next = batch.shift();\n      this.#hydrationSlices = 0;\n    }\n    if (next === undefined) {\n      this.#handingOutSlices = false;\n      return;\n    }\n    next();\n    // After the work that was just resumed has run its slice.\n    setImmediate(this.#nextSlice);\n  };\n}\n\n/**\n * How many time slices go to the hydration of new queries for each one that\n * goes to a batch, while both are waiting for one.\n */\nconst HYDRATION_PRIORITY = 9;\n"],"mappings":";;;AAIA,IAAM,qBAAqB;;;;;;;AAQ3B,IAAM,kBAAkB;;;;;;;AAQxB,IAAM,sBAAsB;;;;;;AAO5B,IAAM,kBAAkB;;AAGxB,IAAM,oBAAoB;;;;;;;AAQ1B,IAAM,uBAAuB;;;;;AAM7B,IAAM,yBAAyB;;;;;AAM/B,IAAM,uBAAuB;;;;;AAM7B,IAAM,iBAAiB;AAoBvB,SAAS,uBAAqC;CAC5C,IAAI,OAAO,YAAY,qBAAqB;CAC5C,aAAa;EACX,MAAM,UAAU,YAAY,qBAAqB;EACjD,MAAM,EAAC,gBAAe,YAAY,qBAAqB,SAAS,IAAI;EACpE,OAAO;EACP,OAAO;CACT;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,IAAa,aAAb,MAAwB;CACtB;CACA;CACA;CACA;CACA;;CAGA;;CAEA;CAEA;CACA,cAAc;;CAEd,SAAS;CACT,oBAAoB;;CAEpB,iBAAiB;CACjB,cAAc;;CAGd,WAAoB;EAClB,WAAW,CAAC;EACZ,OAAO,CAAC;CACV;CACA,oBAAoB;;CAEpB,mBAAmB;CAEnB,YAAY,EACV,aACA,eACA,KACA,aACA,MACoB;EACpB,KAAK,eAAe;EACpB,KAAK,iBAAiB;EACtB,KAAK,OAAO,cAAc,YAAY,IAAI;EAC1C,KAAK,eAAe,eAAe,qBAAqB;EACxD,KAAK,MAAM;EACX,KAAK,iBAAiB,KAAK,KAAK;CAClC;;;;;;;CAQA,OAAO,cAA8B;EACnC,KAAK,QAAQ;EACb,MAAM,OAAO,KAAK,cAAc;EAChC,IAAI,OAAO,KAAK,gBAAgB;GAC9B,KAAK;GACL,OAAO;EACT;EACA,KAAK;EACL,OAAO,KAAK;CACd;;CAGA,IAAI,aAAqB;EACvB,KAAK,QAAQ;EACb,OAAO,KAAK;CACd;;;;;CAMA,IAAI,QAAgB;EAClB,KAAK,QAAQ;EACb,OAAO,KAAK;CACd;;CAGA,UAAgB;EACd,MAAM,MAAM,KAAK,KAAK;EACtB,MAAM,QAAQ,KAAK,OAAO,MAAM,KAAK,kBAAkB,kBAAkB;EACzE,IAAI,SAAS,GACX;EAEF,KAAK,kBAAkB,QAAQ;EAG/B,MAAM,SAAS,KAAK,aAAa;EAKjC,MAAM,WAAW,KAAK,cAAc,KAAK,KAAK,mBAAmB;EACjE,KAAK,cAAc;EACnB,KAAK,iBAAiB;EACtB,KAAK,IAAI,IAAI,KAAK,IAAI,OAAO,oBAAoB,GAAG,IAAI,GAAG,KAAK;GAC9D,KAAK,UAAU,mBAAmB,SAAS,KAAK;GAGhD,KAAK,oBACH,UAAU,mBAAmB,SAAS,KAAK,eACvC,KAAK,oBAAoB,IACzB;GACN,IAAI,aACF,KAAK,qBAAqB,oBACtB,wBACC,KAAK,SAAS,KAAK,iBAAiB;GAC3C,IAAI,YAAY,aAAa,GAC3B,aAAa;GAEf,KAAK,cAAc,KAAK,IACtB,KAAK,KAAK,IAAI,KAAK,eAAe,aAAa,GAAG,CAAC,GACnD,cACF;EACF;EACA,KAAK,WAAW,KAAK,QAAQ;CAC/B;;;;;;CAOA,WAAW,KAAa,UAAyB;EAC/C,MAAM,KAAK,KAAK;EAChB,IAAI,OAAO,KAAA,GACT;EAEF,MAAM,QAAQ;GACZ,WAAW,KAAK;GAChB,aAAa,KAAK;GAClB,gBAAgB,KAAK;GACrB,oBAAoB,KAAK;EAC3B;EACA,IAAI,KAAK,cAAc,GAAG;GACxB,KAAK,kBAAkB,KAAA;GACvB,IAAI,KAAK,oBAAoB,KAAA,GAAW;IACtC,GAAG,OACD,gFACA,KACF;IACA,KAAK,kBAAkB;GACzB,OAAO,IAAI,MAAM,KAAK,mBAAmB,wBAAwB;IAC/D,IAAI,YAAY,KAAK,SAAS,KAAK,cAGjC,GAAG,OACD,6FACA,KACF;SAEA,GAAG,OAAO,2CAA2C,KAAK;IAE5D,KAAK,kBAAkB;GACzB;EACF,OAAO,IAAI,KAAK,oBAAoB,KAAA,GAAW;GAG7C,KAAK,oBAAoB;GACzB,IAAI,MAAM,KAAK,mBAAmB,wBAAwB;IACxD,GAAG,OACD,2EACA,KACF;IACA,KAAK,kBAAkB,KAAA;IACvB,KAAK,kBAAkB,KAAA;GACzB;EACF;CACF;;;;;;;;;;;;;;;;CAiBA,WAAW,MAA4C;EACrD,OAAO,IAAI,SAAQ,YAAW;GAC5B,KAAK,SAAS,KAAK,CAAC,KAAK,OAAO;GAChC,IAAI,CAAC,KAAK,mBAAmB;IAC3B,KAAK,oBAAoB;IACzB,aAAa,KAAK,UAAU;GAC9B;EACF,CAAC;CACH;CAEA,mBAA4B;EAC1B,MAAM,EAAC,WAAW,UAAS,KAAK;EAChC,IAAI;EACJ,IACE,UAAU,SAAS,MAClB,MAAM,WAAW,KAAK,KAAK,mBAAmB,qBAC/C;GACA,OAAO,UAAU,MAAM;GACvB,KAAK;EACP,OAAO,IAAI,MAAM,SAAS,GAAG;GAC3B,OAAO,MAAM,MAAM;GACnB,KAAK,mBAAmB;EAC1B;EACA,IAAI,SAAS,KAAA,GAAW;GACtB,KAAK,oBAAoB;GACzB;EACF;EACA,KAAK;EAEL,aAAa,KAAK,UAAU;CAC9B;AACF;;;;;AAMA,IAAM,qBAAqB"}

package/out/zero-cache/src/services/view-syncer/client-handler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"client-handler.d.ts","sourceRoot":"","sources":["../../../../../../zero-cache/src/services/view-syncer/client-handler.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,uCAAuC,CAAC;AAEtE,OAAO,EAEL,KAAK,UAAU,IAAI,cAAc,EAClC,MAAM,gCAAgC,CAAC;AAIxC,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,iDAAiD,CAAC;AAGlF,OAAO,EAEL,KAAK,mBAAmB,EACzB,MAAM,wCAAwC,CAAC;AAChD,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,+CAA+C,CAAC;AAQnF,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,4CAA4C,CAAC;AAK3E,OAAO,KAAK,EAAC,oBAAoB,EAAC,MAAM,2BAA2B,CAAC;AAKpE,OAAO,EAAiB,KAAK,OAAO,EAAC,MAAM,uBAAuB,CAAC;AACnE,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAKL,KAAK,UAAU,EACf,KAAK,aAAa,EAClB,KAAK,kBAAkB,EACvB,KAAK,aAAa,EAClB,KAAK,KAAK,EACX,MAAM,mBAAmB,CAAC;AAE3B,MAAM,MAAM,WAAW,GAAG;IACxB,IAAI,EAAE,KAAK,CAAC;IACZ,EAAE,EAAE,KAAK,CAAC;IACV,EAAE,EAAE,KAAK,CAAC;IACV,QAAQ,EAAE,UAAU,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,IAAI,EAAE,KAAK,CAAC;IACZ,EAAE,EAAE,KAAK,CAAC;IACV,EAAE,EAAE,KAAK,CAAC;CACX,CAAC;AAEF,MAAM,MAAM,QAAQ,GAAG,WAAW,GAAG,cAAc,CAAC;AACpD,MAAM,MAAM,WAAW,GAAG,aAAa,GAAG,aAAa,CAAC;AAExD,MAAM,MAAM,KAAK,GAAG,WAAW,GAAG,QAAQ,CAAC;AAE3C,MAAM,MAAM,cAAc,GAAG;IAC3B,KAAK,EAAE,KAAK,CAAC;IACb,SAAS,EAAE,UAAU,CAAC;CACvB,CAAC;AAEF,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACxB,GAAG,CAAC,YAAY,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC9C;AAED;;;GAGG;AACH,KAAK,kBAAkB,GAAG;IACxB,QAAQ,CAAC,QAAQ,EAAE,UAAU,CAAC;IAC9B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB,CAAC;AAEF;;;GAGG;AACH,KAAK,cAAc,GAAG;IAAC,UAAU,CAAC,EAAE,kBAAkB,GAAG,SAAS,CAAA;CAAC,CAAC;AAEpE,iDAAiD;AACjD,MAAM,WAAW,iBAAkB,SAAQ,WAAW;IACpD,QAAQ,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAExE;;;;OAIG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;CAC/B;AAED;;;GAGG;AACH,MAAM,WAAW,gBAAiB,SAAQ,WAAW;IACnD,2DAA2D;IAC3D,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;CAC/B;AASD,uEAAuE;AACvE,wBAAgB,SAAS,CACvB,EAAE,EAAE,UAAU,EACd,OAAO,EAAE,aAAa,EAAE,EACxB,gBAAgB,EAAE,UAAU,GAC3B,gBAAgB,CAwClB;AAKD,eAAO,MAAM,+BAA+B,QAAc,CAAC;AAG3D;;GAEG;AACH,qBAAa,aAAa;;IAExB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IA6BtB,YACE,EAAE,EAAE,UAAU,EACd,aAAa,EAAE,MAAM,EACrB,QAAQ,EAAE,MAAM,EAChB,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,OAAO,EACd,UAAU,EAAE,MAAM,GAAG,IAAI,EACzB,UAAU,EAAE,YAAY,CAAC,oBAAoB,CAAC,EAW/C;IAED,OAAO,IAAI,kBAAkB,CAE5B;IAOD,IAAI,CAAC,CAAC,EAAE,OAAO,QAMd;IAED,KAAK,CAAC,MAAM,EAAE,MAAM,QAGnB;IAED,SAAS,CAAC,gBAAgB,EAAE,UAAU,GAAG,iBAAiB,CA8MzD;IAEK,iBAAiB,CACrB,EAAE,EAAE,UAAU,EACd,gBAAgB,EAAE,MAAM,EAAE,EAC1B,qBAAqB,EAAE,MAAM,EAAE,iBAWhC;IAED,mCAAmC,CAAC,MAAM,EAAE,YAAY,EAAE,QAEzD;IAED,6BAA6B,CAAC,KAAK,EAAE,mBAAmB,QAEvD;IAED,mBAAmB,CAAC,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,eAAe,GAAG,IAAI,CAMnE;CAuBF;AAiDD;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,UAAU,GAAG,cAAc,CAiB9D"}
+{"version":3,"file":"client-handler.d.ts","sourceRoot":"","sources":["../../../../../../zero-cache/src/services/view-syncer/client-handler.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,uCAAuC,CAAC;AAGtE,OAAO,EAEL,KAAK,UAAU,IAAI,cAAc,EAClC,MAAM,gCAAgC,CAAC;AAIxC,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,iDAAiD,CAAC;AAKlF,OAAO,EAEL,KAAK,mBAAmB,EACzB,MAAM,wCAAwC,CAAC;AAChD,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,+CAA+C,CAAC;AAQnF,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,4CAA4C,CAAC;AAK3E,OAAO,KAAK,EAAC,oBAAoB,EAAC,MAAM,2BAA2B,CAAC;AAKpE,OAAO,EAAiB,KAAK,OAAO,EAAC,MAAM,uBAAuB,CAAC;AACnE,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAKL,KAAK,UAAU,EACf,KAAK,aAAa,EAClB,KAAK,kBAAkB,EACvB,KAAK,aAAa,EAClB,KAAK,KAAK,EACX,MAAM,mBAAmB,CAAC;AAE3B,MAAM,MAAM,WAAW,GAAG;IACxB,IAAI,EAAE,KAAK,CAAC;IACZ,EAAE,EAAE,KAAK,CAAC;IACV,EAAE,EAAE,KAAK,CAAC;IACV,QAAQ,EAAE,UAAU,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,IAAI,EAAE,KAAK,CAAC;IACZ,EAAE,EAAE,KAAK,CAAC;IACV,EAAE,EAAE,KAAK,CAAC;CACX,CAAC;AAEF,MAAM,MAAM,QAAQ,GAAG,WAAW,GAAG,cAAc,CAAC;AACpD,MAAM,MAAM,WAAW,GAAG,aAAa,GAAG,aAAa,CAAC;AAExD,MAAM,MAAM,KAAK,GAAG,WAAW,GAAG,QAAQ,CAAC;AAE3C,MAAM,MAAM,cAAc,GAAG;IAC3B,KAAK,EAAE,KAAK,CAAC;IACb,SAAS,EAAE,UAAU,CAAC;CACvB,CAAC;AAEF,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACxB,GAAG,CAAC,YAAY,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC9C;AAED;;;GAGG;AACH,KAAK,kBAAkB,GAAG;IACxB,QAAQ,CAAC,QAAQ,EAAE,UAAU,CAAC;IAC9B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB,CAAC;AAEF;;;GAGG;AACH,KAAK,cAAc,GAAG;IAAC,UAAU,CAAC,EAAE,kBAAkB,GAAG,SAAS,CAAA;CAAC,CAAC;AAEpE,iDAAiD;AACjD,MAAM,WAAW,iBAAkB,SAAQ,WAAW;IACpD,QAAQ,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAExE;;;;OAIG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;CAC/B;AAED;;;GAGG;AACH,MAAM,WAAW,gBAAiB,SAAQ,WAAW;IACnD,2DAA2D;IAC3D,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;CAC/B;AASD,uEAAuE;AACvE,wBAAgB,SAAS,CACvB,EAAE,EAAE,UAAU,EACd,OAAO,EAAE,aAAa,EAAE,EACxB,gBAAgB,EAAE,UAAU,GAC3B,gBAAgB,CAwClB;AAKD,eAAO,MAAM,+BAA+B,QAAc,CAAC;AAG3D;;GAEG;AACH,qBAAa,aAAa;;IAExB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IA6BtB,YACE,EAAE,EAAE,UAAU,EACd,aAAa,EAAE,MAAM,EACrB,QAAQ,EAAE,MAAM,EAChB,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,OAAO,EACd,UAAU,EAAE,MAAM,GAAG,IAAI,EACzB,UAAU,EAAE,YAAY,CAAC,oBAAoB,CAAC,EAW/C;IAED,OAAO,IAAI,kBAAkB,CAE5B;IAOD,IAAI,CAAC,CAAC,EAAE,OAAO,QAMd;IAED,KAAK,CAAC,MAAM,EAAE,MAAM,QAGnB;IAED,SAAS,CAAC,gBAAgB,EAAE,UAAU,GAAG,iBAAiB,CA8MzD;IAEK,iBAAiB,CACrB,EAAE,EAAE,UAAU,EACd,gBAAgB,EAAE,MAAM,EAAE,EAC1B,qBAAqB,EAAE,MAAM,EAAE,iBAWhC;IAED,mCAAmC,CAAC,MAAM,EAAE,YAAY,EAAE,QAEzD;IAED,6BAA6B,CAAC,KAAK,EAAE,mBAAmB,QAEvD;IAED,mBAAmB,CAAC,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,eAAe,GAAG,IAAI,CAMnE;CAuBF;AAiDD;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,UAAU,GAAG,cAAc,CAiB9D"}

package/out/zero-cache/src/services/view-syncer/client-handler.js

@@ -3,6 +3,9 @@ import { hasOwn } from "../../../../shared/src/has-own.js";
 import { assertJSONValue } from "../../../../shared/src/json.js";
 import { promiseVoid } from "../../../../shared/src/resolved-promises.js";
 import { parse, valita_exports } from "../../../../shared/src/valita.js";
+import { getErrorMessage } from "../../../../shared/src/error.js";
+import { InvalidConnectionRequestBaseCookie } from "../../../../zero-protocol/src/error-kind-enum.js";
+import { ZeroCache } from "../../../../zero-protocol/src/error-origin-enum.js";
 import { ProtocolError } from "../../../../zero-protocol/src/error.js";
 import { primaryKeyValueRecordSchema } from "../../../../zero-protocol/src/primary-key.js";
 import { mutationResultSchema } from "../../../../zero-protocol/src/mutation.js";
@@ -35,6 +38,7 @@ function startPoke(lc, clients, tentativeVersion) {
 		end: (finalVersion) => settle("end", pokers.map((poker) => poker.end(finalVersion)))
 	};
 }
+var POKE_PART_FLUSH_THRESHOLD_CHARS = 1048576;
 var PART_COUNT_FLUSH_THRESHOLD = 100;
 /**
 * Handles a single `ViewSyncer` connection.
@@ -61,7 +65,7 @@ var ClientHandler = class {
 		this.#zeroMutationsTable = `${upstreamSchema(shard)}.mutations`;
 		this.#lc = lc;
 		this.#downstream = downstream;
-		this.#baseVersion = cookieToVersion(baseCookie);
+		this.#baseVersion = parseBaseCookie(baseCookie);
 	}
 	version() {
 		return this.#baseVersion;
@@ -255,7 +259,8 @@ var ClientHandler = class {
 	}
 	#updateLMIDs(lmids, patch) {
 		if (patch.op === "put") {
-			const { clientGroupID, clientID, lastMutationID } = parse(ensureSafeJSON(patch.contents), lmidRowSchema, "passthrough");
+			const row = ensureSafeJSON(patch.contents);
+			const { clientGroupID, clientID, lastMutationID } = parse(row, lmidRowSchema, "passthrough");
 			if (clientGroupID !== this.#clientGroupID) this.#lc.error?.(`Received clients row for wrong clientGroupID. Ignoring.`, clientGroupID);
 			else lmids[clientID] = lastMutationID;
 		} else patch.op;
@@ -314,7 +319,23 @@ function ensureSafeJSON(row) {
 	}
 	return modified ?? row;
 }
+/**
+* The baseCookie comes from the connection URL so it is client input. A
+* malformed one is reported to the client as an invalid baseCookie (which
+* makes it reset its local state) rather than as an internal error.
+*/
+function parseBaseCookie(baseCookie) {
+	try {
+		return cookieToVersion(baseCookie);
+	} catch (e) {
+		throw new ProtocolError({
+			kind: InvalidConnectionRequestBaseCookie,
+			message: `Invalid baseCookie ${JSON.stringify(baseCookie)}: ${getErrorMessage(e)}`,
+			origin: ZeroCache
+		}, { cause: e });
+	}
+}
 //#endregion
-export { ClientHandler, startPoke };
+export { ClientHandler, POKE_PART_FLUSH_THRESHOLD_CHARS, ensureSafeJSON, startPoke };
 
 //# sourceMappingURL=client-handler.js.map

package/out/zero-cache/src/services/view-syncer/client-handler.js.map

@@ -1 +1 @@
-{"version":3,"file":"client-handler.js","names":["#clientGroupID","#zeroClientsTable","#zeroMutationsTable","#lc","#downstream","#pokeTime","#pokeTransactions","#pokedRows","#baseVersion","#push","#everPoked","#updateLMIDs"],"sources":["../../../../../../zero-cache/src/services/view-syncer/client-handler.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assert, unreachable} from '../../../../shared/src/asserts.ts';\nimport type {JSONObject} from '../../../../shared/src/bigint-json.ts';\nimport {hasOwn} from '../../../../shared/src/has-own.ts';\nimport {\n  assertJSONValue,\n  type JSONObject as SafeJSONObject,\n} from '../../../../shared/src/json.ts';\nimport {promiseVoid} from '../../../../shared/src/resolved-promises.ts';\nimport * as v from '../../../../shared/src/valita.ts';\nimport type {Writable} from '../../../../shared/src/writable.ts';\nimport type {ErroredQuery} from '../../../../zero-protocol/src/custom-queries.ts';\nimport type {DeleteClientsBody} from '../../../../zero-protocol/src/delete-clients.ts';\nimport type {Downstream} from '../../../../zero-protocol/src/down.ts';\nimport {\n  ProtocolError,\n  type TransformFailedBody,\n} from '../../../../zero-protocol/src/error.ts';\nimport type {InspectDownBody} from '../../../../zero-protocol/src/inspect-down.ts';\nimport {mutationResultSchema} from '../../../../zero-protocol/src/mutation.ts';\nimport type {\n  PokePartBody,\n  PokePartMessage,\n  PokeStartBody,\n} from '../../../../zero-protocol/src/poke.ts';\nimport {primaryKeyValueRecordSchema} from '../../../../zero-protocol/src/primary-key.ts';\nimport type {RowPatchOp} from '../../../../zero-protocol/src/row-patch.ts';\nimport {\n  getOrCreateCounter,\n  getOrCreateLatencyHistogram,\n} from '../../observability/metrics.ts';\nimport type {ViewSyncerDownstream} from '../../types/downstream.ts';\nimport {\n  getLogLevel,\n  wrapWithProtocolError,\n} from '../../types/error-with-level.ts';\nimport {upstreamSchema, type ShardID} from '../../types/shards.ts';\nimport type {Subscription} from '../../types/subscription.ts';\nimport {\n  cmpVersions,\n  cookieToVersion,\n  versionToCookie,\n  versionToNullableCookie,\n  type CVRVersion,\n  type DelQueryPatch,\n  type NullableCVRVersion,\n  type PutQueryPatch,\n  type RowID,\n} from './schema/types.ts';\n\nexport type PutRowPatch = {\n  type: 'row';\n  op: 'put';\n  id: RowID;\n  contents: JSONObject;\n};\n\nexport type DeleteRowPatch = {\n  type: 'row';\n  op: 'del';\n  id: RowID;\n};\n\nexport type RowPatch = PutRowPatch | DeleteRowPatch;\nexport type ConfigPatch = DelQueryPatch | PutQueryPatch;\n\nexport type Patch = ConfigPatch | RowPatch;\n\nexport type PatchToVersion = {\n  patch: Patch;\n  toVersion: CVRVersion;\n};\n\nexport interface PokeHandler {\n  addPatch(patch: PatchToVersion): Promise<void>;\n  cancel(): Promise<void>;\n  end(finalVersion: CVRVersion): Promise<void>;\n}\n\n/**\n * A put/del row patch and its JSON serialization. Computed once per client\n * group and shared by all of the group's clients.\n */\ntype SerializedRowPatch = {\n  readonly rowPatch: RowPatchOp;\n  readonly json: string;\n};\n\n/**\n * Lazily holds the {@link SerializedRowPatch} of one patch so that it is\n * computed at most once, by the first client that needs it.\n */\ntype SharedRowPatch = {serialized?: SerializedRowPatch | undefined};\n\n/** A {@link PokeHandler} for a single client. */\nexport interface ClientPokeHandler extends PokeHandler {\n  addPatch(patch: PatchToVersion, shared?: SharedRowPatch): Promise<void>;\n\n  /**\n   * Whether a patch has been sent to the client. Once one has, the poke can\n   * only be ended with a `finalVersion` that is ahead of the client's base\n   * version.\n   */\n  readonly patchesSent: boolean;\n}\n\n/**\n * A {@link PokeHandler} for multiple clients, as returned by\n * {@link startPoke}.\n */\nexport interface MultiPokeHandler extends PokeHandler {\n  /** Whether a patch has been sent to any of the clients. */\n  readonly patchesSent: boolean;\n}\n\nconst NOOP: ClientPokeHandler = {\n  patchesSent: false,\n  addPatch: () => promiseVoid,\n  cancel: () => promiseVoid,\n  end: () => promiseVoid,\n};\n\n/** Wraps PokeHandlers for multiple clients in a single PokeHandler. */\nexport function startPoke(\n  lc: LogContext,\n  clients: ClientHandler[],\n  tentativeVersion: CVRVersion,\n): MultiPokeHandler {\n  const pokers = clients.map(c => c.startPoke(tentativeVersion));\n\n  // Promise.allSettled() ensures that a failed (e.g. disconnected) client\n  // does not prevent other clients from receiving the pokes. However, the\n  // rate (per client group) will be limited by the slowest connection.\n  //\n  // The individual pokers report their own failures (by failing the\n  // connection), so a rejection here is not expected. Log it rather than\n  // dropping it on the floor.\n  const settle = async (op: string, results: Promise<void>[]) => {\n    for (const result of await Promise.allSettled(results)) {\n      if (result.status === 'rejected') {\n        lc.error?.(`unhandled error poking client (${op})`, result.reason);\n      }\n    }\n  };\n\n  return {\n    get patchesSent() {\n      return pokers.some(poker => poker.patchesSent);\n    },\n    addPatch: patch => {\n      const shared: SharedRowPatch = {};\n      return settle(\n        'addPatch',\n        pokers.map(poker => poker.addPatch(patch, shared)),\n      );\n    },\n    cancel: () =>\n      settle(\n        'cancel',\n        pokers.map(poker => poker.cancel()),\n      ),\n    end: finalVersion =>\n      settle(\n        'end',\n        pokers.map(poker => poker.end(finalVersion)),\n      ),\n  };\n}\n\n// Soft limit on the serialized row characters accumulated in a poke part.\n// This bounds view-syncer memory and keeps legacy JSON messages reasonably\n// sized. PokeChunkEncoder separately enforces the binary frame limit in bytes.\nexport const POKE_PART_FLUSH_THRESHOLD_CHARS = 1024 * 1024;\nconst PART_COUNT_FLUSH_THRESHOLD = 100;\n\n/**\n * Handles a single `ViewSyncer` connection.\n */\nexport class ClientHandler {\n  readonly #clientGroupID: string;\n  readonly clientID: string;\n  readonly wsID: string;\n  readonly #zeroClientsTable: string;\n  readonly #zeroMutationsTable: string;\n  readonly #lc: LogContext;\n  readonly #downstream: Subscription<ViewSyncerDownstream>;\n  #baseVersion: NullableCVRVersion;\n  // We will send a poke on connect even if the client is already caught up, so that it can learn its\n  // got-queries state has been reconciled with the server. After that, we will only send a poke if\n  // the client is behind.\n  #everPoked = false;\n\n  readonly #pokeTime = getOrCreateLatencyHistogram(\n    'sync',\n    'poke.time',\n    'Time elapsed for each poke transaction. Canceled / noop pokes are excluded.',\n  );\n\n  readonly #pokeTransactions = getOrCreateCounter(\n    'sync',\n    'poke.transactions',\n    'Count of poke transactions.',\n  );\n\n  readonly #pokedRows = getOrCreateCounter(\n    'sync',\n    'poke.rows',\n    'Count of poked rows.',\n  );\n\n  constructor(\n    lc: LogContext,\n    clientGroupID: string,\n    clientID: string,\n    wsID: string,\n    shard: ShardID,\n    baseCookie: string | null,\n    downstream: Subscription<ViewSyncerDownstream>,\n  ) {\n    lc.debug?.('new client handler');\n    this.#clientGroupID = clientGroupID;\n    this.clientID = clientID;\n    this.wsID = wsID;\n    this.#zeroClientsTable = `${upstreamSchema(shard)}.clients`;\n    this.#zeroMutationsTable = `${upstreamSchema(shard)}.mutations`;\n    this.#lc = lc;\n    this.#downstream = downstream;\n    this.#baseVersion = cookieToVersion(baseCookie);\n  }\n\n  version(): NullableCVRVersion {\n    return this.#baseVersion;\n  }\n\n  async #push(msg: Downstream, serialized?: string | undefined): Promise<void> {\n    const {result} = this.#downstream.push({message: msg, serialized});\n    await result;\n  }\n\n  fail(e: unknown) {\n    this.#lc[getLogLevel(e)]?.(\n      `view-syncer closing connection with error: ${String(e)}`,\n      e,\n    );\n    this.#downstream.fail(wrapWithProtocolError(e));\n  }\n\n  close(reason: string) {\n    this.#lc.debug?.(`view-syncer closing connection: ${reason}`);\n    this.#downstream.cancel();\n  }\n\n  startPoke(tentativeVersion: CVRVersion): ClientPokeHandler {\n    const pokeID = versionToCookie(tentativeVersion);\n    const lc = this.#lc.withContext('pokeID', pokeID);\n\n    // Force an (empty) initial poke even when already caught up; see #everPoked.\n    const forceInitialPoke = !this.#everPoked;\n    const cmp = cmpVersions(this.#baseVersion, tentativeVersion);\n    if (cmp > 0 || (cmp === 0 && !forceInitialPoke)) {\n      lc.info?.(`already caught up, not sending poke.`);\n      return NOOP;\n    }\n\n    const baseCookie = versionToNullableCookie(this.#baseVersion);\n    const cookie = versionToCookie(tentativeVersion);\n    lc.debug?.(`starting poke from ${baseCookie} to ${cookie}`);\n\n    const start = performance.now();\n\n    const pokeStart: PokeStartBody = {pokeID, baseCookie};\n\n    let pokeStarted = false;\n    let body: PokePartBody | undefined;\n    // rowsPatch is kept out of `body` until it is flushed so that the poke\n    // part can be serialized by concatenating the pre-serialized rows.\n    let rowsPatch: RowPatchOp[] = [];\n    let rowsJSON: string[] = [];\n    let partCount = 0;\n    let serializedRowsLength = 0;\n\n    const ensureBody = async () => {\n      if (!pokeStarted) {\n        await this.#push(['pokeStart', pokeStart]);\n        pokeStarted = true;\n      }\n      return (body ??= {pokeID});\n    };\n\n    const flushBody = async () => {\n      if (body) {\n        let message: PokePartMessage;\n        let serialized: string;\n        if (rowsPatch.length === 0) {\n          message = ['pokePart', body];\n          serialized = JSON.stringify(message);\n        } else {\n          // Equivalent to JSON.stringify(message): rowsPatch is the last\n          // property of the body.\n          const prefix = JSON.stringify(['pokePart', body]);\n          message = ['pokePart', {...body, rowsPatch}];\n          serialized = `${prefix.slice(0, -2)},\"rowsPatch\":[${rowsJSON.join(',')}]}]`;\n          rowsPatch = [];\n          rowsJSON = [];\n        }\n        await this.#push(message, serialized);\n        body = undefined;\n        partCount = 0;\n        serializedRowsLength = 0;\n      }\n    };\n\n    const addPatch = async (\n      patchToVersion: PatchToVersion,\n      shared: SharedRowPatch,\n    ) => {\n      const {patch, toVersion} = patchToVersion;\n      if (cmpVersions(toVersion, this.#baseVersion) <= 0) {\n        return;\n      }\n      const target = await ensureBody();\n\n      const {type, op} = patch;\n      switch (type) {\n        case 'query': {\n          const patches = patch.clientID\n            ? ((target.desiredQueriesPatches ??= {})[patch.clientID] ??= [])\n            : (target.gotQueriesPatch ??= []);\n          patches.push({op, hash: patch.id});\n          break;\n        }\n        case 'row':\n          if (patch.id.table === this.#zeroClientsTable) {\n            this.#updateLMIDs((target.lastMutationIDChanges ??= {}), patch);\n          } else if (patch.id.table === this.#zeroMutationsTable) {\n            const patches = (target.mutationsPatch ??= []);\n            if (op === 'put') {\n              const row = v.parse(\n                ensureSafeJSON(patch.contents),\n                mutationRowSchema,\n                'passthrough',\n              );\n              patches.push({\n                op: 'put',\n                mutation: {\n                  id: {\n                    clientID: row.clientID,\n                    id: row.mutationID,\n                  },\n                  result: row.result,\n                },\n              });\n            } else {\n              const {clientID, mutationID} = patch.id.rowKey;\n              assert(\n                typeof clientID === 'string',\n                'client id must be a string',\n              );\n              const id = Number(mutationID);\n              assert(\n                !Number.isNaN(id) && Number.isFinite(id) && id >= 0,\n                'mutation id must be a finite number',\n              );\n              patches.push({\n                op: 'del',\n                id: {\n                  clientID,\n                  id,\n                },\n              });\n            }\n          } else {\n            const {rowPatch, json} = (shared.serialized ??=\n              serializeRowPatch(patch));\n            rowsPatch.push(rowPatch);\n            rowsJSON.push(json);\n            serializedRowsLength += json.length;\n          }\n          break;\n        default:\n          unreachable(patch);\n      }\n\n      partCount++;\n      if (\n        serializedRowsLength >= POKE_PART_FLUSH_THRESHOLD_CHARS ||\n        partCount >= PART_COUNT_FLUSH_THRESHOLD\n      ) {\n        await flushBody();\n      }\n    };\n\n    // A poke that was started must always be ended. If it isn't, the\n    // connection is left mid-poke and the *next* pokeStart fails the\n    // DownstreamSender's in-progress check, surfacing the error far from\n    // its cause. Fail the connection instead; the client reconnects and\n    // resyncs from its baseVersion.\n    return {\n      get patchesSent() {\n        return pokeStarted;\n      },\n      addPatch: async (\n        patchToVersion: PatchToVersion,\n        shared: SharedRowPatch = {},\n      ) => {\n        try {\n          await addPatch(patchToVersion, shared);\n          if (patchToVersion.patch.type === 'row') {\n            this.#pokedRows.add(1);\n          }\n        } catch (e) {\n          this.fail(e);\n        }\n      },\n\n      cancel: async () => {\n        try {\n          if (pokeStarted) {\n            await this.#push(['pokeEnd', {pokeID, cookie: '', cancel: true}]);\n          }\n        } catch (e) {\n          this.fail(e);\n        }\n      },\n\n      end: async (finalVersion: CVRVersion) => {\n        try {\n          const cookie = versionToCookie(finalVersion);\n          if (!pokeStarted) {\n            if (\n              cmpVersions(this.#baseVersion, finalVersion) === 0 &&\n              !forceInitialPoke\n            ) {\n              return; // Nothing changed and nothing was sent.\n            }\n            await this.#push(['pokeStart', pokeStart]);\n          } else if (cmpVersions(this.#baseVersion, finalVersion) >= 0) {\n            // Sanity check: If the poke was started, the finalVersion\n            // must be > #baseVersion.\n            throw new Error(\n              `Patches were sent but finalVersion ${cookie} is not ` +\n                `greater than baseVersion ` +\n                `${versionToNullableCookie(this.#baseVersion)}`,\n            );\n          }\n          await flushBody();\n          await this.#push(['pokeEnd', {pokeID, cookie}]);\n          this.#baseVersion = finalVersion;\n          this.#everPoked = true;\n\n          const elapsed = performance.now() - start;\n          this.#pokeTransactions.add(1);\n          this.#pokeTime.recordMs(elapsed);\n        } catch (e) {\n          this.fail(e);\n        }\n      },\n    };\n  }\n\n  async sendDeleteClients(\n    lc: LogContext,\n    deletedClientIDs: string[],\n    deletedClientGroupIDs: string[],\n  ) {\n    const deleteClientsBody: Writable<DeleteClientsBody> = {};\n    if (deletedClientIDs.length > 0) {\n      deleteClientsBody.clientIDs = deletedClientIDs;\n    }\n    if (deletedClientGroupIDs.length > 0) {\n      deleteClientsBody.clientGroupIDs = deletedClientGroupIDs;\n    }\n    lc.debug?.('sending deleteClients', deleteClientsBody);\n    await this.#push(['deleteClients', deleteClientsBody]);\n  }\n\n  sendQueryTransformApplicationErrors(errors: ErroredQuery[]) {\n    void this.#push(['transformError', errors]);\n  }\n\n  sendQueryTransformFailedError(error: TransformFailedBody) {\n    this.fail(new ProtocolError(error));\n  }\n\n  sendInspectResponse(lc: LogContext, response: InspectDownBody): void {\n    lc.debug?.('sending inspect response', response);\n    this.#downstream.push({\n      message: ['inspect', response],\n      serialized: undefined,\n    });\n  }\n\n  #updateLMIDs(lmids: Record<string, number>, patch: RowPatch) {\n    if (patch.op === 'put') {\n      const row = ensureSafeJSON(patch.contents);\n      const {clientGroupID, clientID, lastMutationID} = v.parse(\n        row,\n        lmidRowSchema,\n        'passthrough',\n      );\n      if (clientGroupID !== this.#clientGroupID) {\n        this.#lc.error?.(\n          `Received clients row for wrong clientGroupID. Ignoring.`,\n          clientGroupID,\n        );\n      } else {\n        lmids[clientID] = lastMutationID;\n      }\n    } else {\n      // The 'constrain' and 'del' ops for clients can be ignored.\n      patch.op satisfies 'constrain' | 'del';\n    }\n  }\n}\n\n// Note: The {APP_ID}_{SHARD_ID}.clients table is set up in replicator/initial-sync.ts.\nconst lmidRowSchema = v.object({\n  clientGroupID: v.string(),\n  clientID: v.string(),\n  lastMutationID: v.number(), // Actually returned as a bigint, but converted by ensureSafeJSON().\n});\n\nconst mutationRowSchema = v.object({\n  clientGroupID: v.string(),\n  clientID: v.string(),\n  mutationID: v.number(),\n  result: mutationResultSchema,\n});\n\nfunction serializeRowPatch(patch: RowPatch): SerializedRowPatch {\n  const rowPatch = makeRowPatch(patch);\n  return {rowPatch, json: JSON.stringify(rowPatch)};\n}\n\nfunction makeRowPatch(patch: RowPatch): RowPatchOp {\n  const {\n    op,\n    id: {table: tableName, rowKey: id},\n  } = patch;\n\n  switch (op) {\n    case 'put':\n      // ensureSafeJSON() converts bigints and asserts (outside of prod) that\n      // the values are JSON, which is all that rowSchema checks.\n      return {\n        op: 'put',\n        tableName,\n        value: ensureSafeJSON(patch.contents),\n      };\n\n    case 'del':\n      return {\n        op,\n        tableName,\n        id: v.parse(id, primaryKeyValueRecordSchema),\n      };\n\n    default:\n      unreachable(op);\n  }\n}\n\n/**\n * Column values of type INT8 are returned as the `bigint` from the\n * Postgres library. These are converted to `number` if they are within\n * the safe Number range, allowing the protocol to support numbers larger\n * than 32-bits. Values outside of the safe number range (e.g. > 2^53) will\n * result in an Error.\n */\nexport function ensureSafeJSON(row: JSONObject): SafeJSONObject {\n  let modified: Record<string, unknown> | undefined;\n  for (const k in row) {\n    if (!hasOwn(row, k)) {\n      continue;\n    }\n    const v = row[k];\n    if (typeof v === 'bigint') {\n      if (v < Number.MIN_SAFE_INTEGER || v > Number.MAX_SAFE_INTEGER) {\n        throw new Error(`Value of \"${k}\" exceeds safe Number range (${v})`);\n      }\n      (modified ??= {...row})[k] = Number(v);\n    } else if (typeof v === 'object') {\n      assertJSONValue(v);\n    }\n  }\n  return (modified ?? row) as SafeJSONObject;\n}\n"],"mappings":";;;;;;;;;;;;;AAmHA,IAAM,OAA0B;CAC9B,aAAa;CACb,gBAAgB;CAChB,cAAc;CACd,WAAW;AACb;;AAGA,SAAgB,UACd,IACA,SACA,kBACkB;CAClB,MAAM,SAAS,QAAQ,KAAI,MAAK,EAAE,UAAU,gBAAgB,CAAC;CAS7D,MAAM,SAAS,OAAO,IAAY,YAA6B;EAC7D,KAAK,MAAM,UAAU,MAAM,QAAQ,WAAW,OAAO,GACnD,IAAI,OAAO,WAAW,YACpB,GAAG,QAAQ,kCAAkC,GAAG,IAAI,OAAO,MAAM;CAGvE;CAEA,OAAO;EACL,IAAI,cAAc;GAChB,OAAO,OAAO,MAAK,UAAS,MAAM,WAAW;EAC/C;EACA,WAAU,UAAS;GACjB,MAAM,SAAyB,CAAC;GAChC,OAAO,OACL,YACA,OAAO,KAAI,UAAS,MAAM,SAAS,OAAO,MAAM,CAAC,CACnD;EACF;EACA,cACE,OACE,UACA,OAAO,KAAI,UAAS,MAAM,OAAO,CAAC,CACpC;EACF,MAAK,iBACH,OACE,OACA,OAAO,KAAI,UAAS,MAAM,IAAI,YAAY,CAAC,CAC7C;CACJ;AACF;AAMA,IAAM,6BAA6B;;;;AAKnC,IAAa,gBAAb,MAA2B;CACzB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAIA,aAAa;CAEb,YAAqB,4BACnB,QACA,aACA,6EACF;CAEA,oBAA6B,mBAC3B,QACA,qBACA,6BACF;CAEA,aAAsB,mBACpB,QACA,aACA,sBACF;CAEA,YACE,IACA,eACA,UACA,MACA,OACA,YACA,YACA;EACA,GAAG,QAAQ,oBAAoB;EAC/B,KAAKA,iBAAiB;EACtB,KAAK,WAAW;EAChB,KAAK,OAAO;EACZ,KAAKC,oBAAoB,GAAG,eAAe,KAAK,EAAE;EAClD,KAAKC,sBAAsB,GAAG,eAAe,KAAK,EAAE;EACpD,KAAKC,MAAM;EACX,KAAKC,cAAc;EACnB,KAAKI,eAAe,gBAAgB,UAAU;CAChD;CAEA,UAA8B;EAC5B,OAAO,KAAKA;CACd;CAEA,MAAMC,MAAM,KAAiB,YAAgD;EAC3E,MAAM,EAAC,WAAU,KAAKL,YAAY,KAAK;GAAC,SAAS;GAAK;EAAU,CAAC;EACjE,MAAM;CACR;CAEA,KAAK,GAAY;EACf,KAAKD,IAAI,YAAY,CAAC,KACpB,8CAA8C,OAAO,CAAC,KACtD,CACF;EACA,KAAKC,YAAY,KAAK,sBAAsB,CAAC,CAAC;CAChD;CAEA,MAAM,QAAgB;EACpB,KAAKD,IAAI,QAAQ,mCAAmC,QAAQ;EAC5D,KAAKC,YAAY,OAAO;CAC1B;CAEA,UAAU,kBAAiD;EACzD,MAAM,SAAS,gBAAgB,gBAAgB;EAC/C,MAAM,KAAK,KAAKD,IAAI,YAAY,UAAU,MAAM;EAGhD,MAAM,mBAAmB,CAAC,KAAKO;EAC/B,MAAM,MAAM,YAAY,KAAKF,cAAc,gBAAgB;EAC3D,IAAI,MAAM,KAAM,QAAQ,KAAK,CAAC,kBAAmB;GAC/C,GAAG,OAAO,sCAAsC;GAChD,OAAO;EACT;EAEA,MAAM,aAAa,wBAAwB,KAAKA,YAAY;EAC5D,MAAM,SAAS,gBAAgB,gBAAgB;EAC/C,GAAG,QAAQ,sBAAsB,WAAW,MAAM,QAAQ;EAE1D,MAAM,QAAQ,YAAY,IAAI;EAE9B,MAAM,YAA2B;GAAC;GAAQ;EAAU;EAEpD,IAAI,cAAc;EAClB,IAAI;EAGJ,IAAI,YAA0B,CAAC;EAC/B,IAAI,WAAqB,CAAC;EAC1B,IAAI,YAAY;EAChB,IAAI,uBAAuB;EAE3B,MAAM,aAAa,YAAY;GAC7B,IAAI,CAAC,aAAa;IAChB,MAAM,KAAKC,MAAM,CAAC,aAAa,SAAS,CAAC;IACzC,cAAc;GAChB;GACA,OAAQ,SAAS,EAAC,OAAM;EAC1B;EAEA,MAAM,YAAY,YAAY;GAC5B,IAAI,MAAM;IACR,IAAI;IACJ,IAAI;IACJ,IAAI,UAAU,WAAW,GAAG;KAC1B,UAAU,CAAC,YAAY,IAAI;KAC3B,aAAa,KAAK,UAAU,OAAO;IACrC,OAAO;KAGL,MAAM,SAAS,KAAK,UAAU,CAAC,YAAY,IAAI,CAAC;KAChD,UAAU,CAAC,YAAY;MAAC,GAAG;MAAM;KAAS,CAAC;KAC3C,aAAa,GAAG,OAAO,MAAM,GAAG,EAAE,EAAE,gBAAgB,SAAS,KAAK,GAAG,EAAE;KACvE,YAAY,CAAC;KACb,WAAW,CAAC;IACd;IACA,MAAM,KAAKA,MAAM,SAAS,UAAU;IACpC,OAAO,KAAA;IACP,YAAY;IACZ,uBAAuB;GACzB;EACF;EAEA,MAAM,WAAW,OACf,gBACA,WACG;GACH,MAAM,EAAC,OAAO,cAAa;GAC3B,IAAI,YAAY,WAAW,KAAKD,YAAY,KAAK,GAC/C;GAEF,MAAM,SAAS,MAAM,WAAW;GAEhC,MAAM,EAAC,MAAM,OAAM;GACnB,QAAQ,MAAR;IACE,KAAK;KAIH,CAHgB,MAAM,WACjB,CAAC,OAAO,0BAA0B,CAAC,GAAG,MAAM,cAAc,CAAC,IAC3D,OAAO,oBAAoB,CAAC,GACzB,KAAK;MAAC;MAAI,MAAM,MAAM;KAAE,CAAC;KACjC;IAEF,KAAK;KACH,IAAI,MAAM,GAAG,UAAU,KAAKP,mBAC1B,KAAKU,aAAc,OAAO,0BAA0B,CAAC,GAAI,KAAK;UACzD,IAAI,MAAM,GAAG,UAAU,KAAKT,qBAAqB;MACtD,MAAM,UAAW,OAAO,mBAAmB,CAAC;MAC5C,IAAI,OAAO,OAAO;OAChB,MAAM,MAAM,MACV,eAAe,MAAM,QAAQ,GAC7B,mBACA,aACF;OACA,QAAQ,KAAK;QACX,IAAI;QACJ,UAAU;SACR,IAAI;UACF,UAAU,IAAI;UACd,IAAI,IAAI;SACV;SACA,QAAQ,IAAI;QACd;OACF,CAAC;MACH,OAAO;OACL,MAAM,EAAC,UAAU,eAAc,MAAM,GAAG;OACxC,OACE,OAAO,aAAa,UACpB,4BACF;OACA,MAAM,KAAK,OAAO,UAAU;OAC5B,OACE,CAAC,OAAO,MAAM,EAAE,KAAK,OAAO,SAAS,EAAE,KAAK,MAAM,GAClD,qCACF;OACA,QAAQ,KAAK;QACX,IAAI;QACJ,IAAI;SACF;SACA;QACF;OACF,CAAC;MACH;KACF,OAAO;MACL,MAAM,EAAC,UAAU,SAAS,OAAO,eAC/B,kBAAkB,KAAK;MACzB,UAAU,KAAK,QAAQ;MACvB,SAAS,KAAK,IAAI;MAClB,wBAAwB,KAAK;KAC/B;KACA;IACF,SACE,YAAY,KAAK;GACrB;GAEA;GACA,IACE,wBAAA,WACA,aAAa,4BAEb,MAAM,UAAU;EAEpB;EAOA,OAAO;GACL,IAAI,cAAc;IAChB,OAAO;GACT;GACA,UAAU,OACR,gBACA,SAAyB,CAAC,MACvB;IACH,IAAI;KACF,MAAM,SAAS,gBAAgB,MAAM;KACrC,IAAI,eAAe,MAAM,SAAS,OAChC,KAAKK,WAAW,IAAI,CAAC;IAEzB,SAAS,GAAG;KACV,KAAK,KAAK,CAAC;IACb;GACF;GAEA,QAAQ,YAAY;IAClB,IAAI;KACF,IAAI,aACF,MAAM,KAAKE,MAAM,CAAC,WAAW;MAAC;MAAQ,QAAQ;MAAI,QAAQ;KAAI,CAAC,CAAC;IAEpE,SAAS,GAAG;KACV,KAAK,KAAK,CAAC;IACb;GACF;GAEA,KAAK,OAAO,iBAA6B;IACvC,IAAI;KACF,MAAM,SAAS,gBAAgB,YAAY;KAC3C,IAAI,CAAC,aAAa;MAChB,IACE,YAAY,KAAKD,cAAc,YAAY,MAAM,KACjD,CAAC,kBAED;MAEF,MAAM,KAAKC,MAAM,CAAC,aAAa,SAAS,CAAC;KAC3C,OAAO,IAAI,YAAY,KAAKD,cAAc,YAAY,KAAK,GAGzD,MAAM,IAAI,MACR,sCAAsC,OAAO,mCAExC,wBAAwB,KAAKA,YAAY,GAChD;KAEF,MAAM,UAAU;KAChB,MAAM,KAAKC,MAAM,CAAC,WAAW;MAAC;MAAQ;KAAM,CAAC,CAAC;KAC9C,KAAKD,eAAe;KACpB,KAAKE,aAAa;KAElB,MAAM,UAAU,YAAY,IAAI,IAAI;KACpC,KAAKJ,kBAAkB,IAAI,CAAC;KAC5B,KAAKD,UAAU,SAAS,OAAO;IACjC,SAAS,GAAG;KACV,KAAK,KAAK,CAAC;IACb;GACF;EACF;CACF;CAEA,MAAM,kBACJ,IACA,kBACA,uBACA;EACA,MAAM,oBAAiD,CAAC;EACxD,IAAI,iBAAiB,SAAS,GAC5B,kBAAkB,YAAY;EAEhC,IAAI,sBAAsB,SAAS,GACjC,kBAAkB,iBAAiB;EAErC,GAAG,QAAQ,yBAAyB,iBAAiB;EACrD,MAAM,KAAKI,MAAM,CAAC,iBAAiB,iBAAiB,CAAC;CACvD;CAEA,oCAAoC,QAAwB;EAC1D,KAAUA,MAAM,CAAC,kBAAkB,MAAM,CAAC;CAC5C;CAEA,8BAA8B,OAA4B;EACxD,KAAK,KAAK,IAAI,cAAc,KAAK,CAAC;CACpC;CAEA,oBAAoB,IAAgB,UAAiC;EACnE,GAAG,QAAQ,4BAA4B,QAAQ;EAC/C,KAAKL,YAAY,KAAK;GACpB,SAAS,CAAC,WAAW,QAAQ;GAC7B,YAAY,KAAA;EACd,CAAC;CACH;CAEA,aAAa,OAA+B,OAAiB;EAC3D,IAAI,MAAM,OAAO,OAAO;GAEtB,MAAM,EAAC,eAAe,UAAU,mBAAkB,MADtC,eAAe,MAAM,QAE/B,GACA,eACA,aACF;GACA,IAAI,kBAAkB,KAAKJ,gBACzB,KAAKG,IAAI,QACP,2DACA,aACF;QAEA,MAAM,YAAY;EAEtB,OAEE,MAAM;CAEV;AACF;AAGA,IAAM,gBAAgB,eAAE,OAAO;CAC7B,eAAe,eAAE,OAAO;CACxB,UAAU,eAAE,OAAO;CACnB,gBAAgB,eAAE,OAAO;AAC3B,CAAC;AAED,IAAM,oBAAoB,eAAE,OAAO;CACjC,eAAe,eAAE,OAAO;CACxB,UAAU,eAAE,OAAO;CACnB,YAAY,eAAE,OAAO;CACrB,QAAQ;AACV,CAAC;AAED,SAAS,kBAAkB,OAAqC;CAC9D,MAAM,WAAW,aAAa,KAAK;CACnC,OAAO;EAAC;EAAU,MAAM,KAAK,UAAU,QAAQ;CAAC;AAClD;AAEA,SAAS,aAAa,OAA6B;CACjD,MAAM,EACJ,IACA,IAAI,EAAC,OAAO,WAAW,QAAQ,SAC7B;CAEJ,QAAQ,IAAR;EACE,KAAK,OAGH,OAAO;GACL,IAAI;GACJ;GACA,OAAO,eAAe,MAAM,QAAQ;EACtC;EAEF,KAAK,OACH,OAAO;GACL;GACA;GACA,IAAI,MAAQ,IAAI,2BAA2B;EAC7C;EAEF,SACE,YAAY,EAAE;CAClB;AACF;;;;;;;;AASA,SAAgB,eAAe,KAAiC;CAC9D,IAAI;CACJ,KAAK,MAAM,KAAK,KAAK;EACnB,IAAI,CAAC,OAAO,KAAK,CAAC,GAChB;EAEF,MAAM,IAAI,IAAI;EACd,IAAI,OAAO,MAAM,UAAU;GACzB,IAAI,IAAI,OAAO,oBAAoB,IAAI,OAAO,kBAC5C,MAAM,IAAI,MAAM,aAAa,EAAE,+BAA+B,EAAE,EAAE;GAEpE,CAAC,aAAa,EAAC,GAAG,IAAG,GAAG,KAAK,OAAO,CAAC;EACvC,OAAO,IAAI,OAAO,MAAM,UACtB,gBAAgB,CAAC;CAErB;CACA,OAAQ,YAAY;AACtB"}
+{"version":3,"file":"client-handler.js","names":["v.parse","v","ErrorKind.InvalidConnectionRequestBaseCookie","ErrorOrigin.ZeroCache"],"sources":["../../../../../../zero-cache/src/services/view-syncer/client-handler.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assert, unreachable} from '../../../../shared/src/asserts.ts';\nimport type {JSONObject} from '../../../../shared/src/bigint-json.ts';\nimport {getErrorMessage} from '../../../../shared/src/error.ts';\nimport {hasOwn} from '../../../../shared/src/has-own.ts';\nimport {\n  assertJSONValue,\n  type JSONObject as SafeJSONObject,\n} from '../../../../shared/src/json.ts';\nimport {promiseVoid} from '../../../../shared/src/resolved-promises.ts';\nimport * as v from '../../../../shared/src/valita.ts';\nimport type {Writable} from '../../../../shared/src/writable.ts';\nimport type {ErroredQuery} from '../../../../zero-protocol/src/custom-queries.ts';\nimport type {DeleteClientsBody} from '../../../../zero-protocol/src/delete-clients.ts';\nimport type {Downstream} from '../../../../zero-protocol/src/down.ts';\nimport {ErrorKind} from '../../../../zero-protocol/src/error-kind.ts';\nimport {ErrorOrigin} from '../../../../zero-protocol/src/error-origin.ts';\nimport {\n  ProtocolError,\n  type TransformFailedBody,\n} from '../../../../zero-protocol/src/error.ts';\nimport type {InspectDownBody} from '../../../../zero-protocol/src/inspect-down.ts';\nimport {mutationResultSchema} from '../../../../zero-protocol/src/mutation.ts';\nimport type {\n  PokePartBody,\n  PokePartMessage,\n  PokeStartBody,\n} from '../../../../zero-protocol/src/poke.ts';\nimport {primaryKeyValueRecordSchema} from '../../../../zero-protocol/src/primary-key.ts';\nimport type {RowPatchOp} from '../../../../zero-protocol/src/row-patch.ts';\nimport {\n  getOrCreateCounter,\n  getOrCreateLatencyHistogram,\n} from '../../observability/metrics.ts';\nimport type {ViewSyncerDownstream} from '../../types/downstream.ts';\nimport {\n  getLogLevel,\n  wrapWithProtocolError,\n} from '../../types/error-with-level.ts';\nimport {upstreamSchema, type ShardID} from '../../types/shards.ts';\nimport type {Subscription} from '../../types/subscription.ts';\nimport {\n  cmpVersions,\n  cookieToVersion,\n  versionToCookie,\n  versionToNullableCookie,\n  type CVRVersion,\n  type DelQueryPatch,\n  type NullableCVRVersion,\n  type PutQueryPatch,\n  type RowID,\n} from './schema/types.ts';\n\nexport type PutRowPatch = {\n  type: 'row';\n  op: 'put';\n  id: RowID;\n  contents: JSONObject;\n};\n\nexport type DeleteRowPatch = {\n  type: 'row';\n  op: 'del';\n  id: RowID;\n};\n\nexport type RowPatch = PutRowPatch | DeleteRowPatch;\nexport type ConfigPatch = DelQueryPatch | PutQueryPatch;\n\nexport type Patch = ConfigPatch | RowPatch;\n\nexport type PatchToVersion = {\n  patch: Patch;\n  toVersion: CVRVersion;\n};\n\nexport interface PokeHandler {\n  addPatch(patch: PatchToVersion): Promise<void>;\n  cancel(): Promise<void>;\n  end(finalVersion: CVRVersion): Promise<void>;\n}\n\n/**\n * A put/del row patch and its JSON serialization. Computed once per client\n * group and shared by all of the group's clients.\n */\ntype SerializedRowPatch = {\n  readonly rowPatch: RowPatchOp;\n  readonly json: string;\n};\n\n/**\n * Lazily holds the {@link SerializedRowPatch} of one patch so that it is\n * computed at most once, by the first client that needs it.\n */\ntype SharedRowPatch = {serialized?: SerializedRowPatch | undefined};\n\n/** A {@link PokeHandler} for a single client. */\nexport interface ClientPokeHandler extends PokeHandler {\n  addPatch(patch: PatchToVersion, shared?: SharedRowPatch): Promise<void>;\n\n  /**\n   * Whether a patch has been sent to the client. Once one has, the poke can\n   * only be ended with a `finalVersion` that is ahead of the client's base\n   * version.\n   */\n  readonly patchesSent: boolean;\n}\n\n/**\n * A {@link PokeHandler} for multiple clients, as returned by\n * {@link startPoke}.\n */\nexport interface MultiPokeHandler extends PokeHandler {\n  /** Whether a patch has been sent to any of the clients. */\n  readonly patchesSent: boolean;\n}\n\nconst NOOP: ClientPokeHandler = {\n  patchesSent: false,\n  addPatch: () => promiseVoid,\n  cancel: () => promiseVoid,\n  end: () => promiseVoid,\n};\n\n/** Wraps PokeHandlers for multiple clients in a single PokeHandler. */\nexport function startPoke(\n  lc: LogContext,\n  clients: ClientHandler[],\n  tentativeVersion: CVRVersion,\n): MultiPokeHandler {\n  const pokers = clients.map(c => c.startPoke(tentativeVersion));\n\n  // Promise.allSettled() ensures that a failed (e.g. disconnected) client\n  // does not prevent other clients from receiving the pokes. However, the\n  // rate (per client group) will be limited by the slowest connection.\n  //\n  // The individual pokers report their own failures (by failing the\n  // connection), so a rejection here is not expected. Log it rather than\n  // dropping it on the floor.\n  const settle = async (op: string, results: Promise<void>[]) => {\n    for (const result of await Promise.allSettled(results)) {\n      if (result.status === 'rejected') {\n        lc.error?.(`unhandled error poking client (${op})`, result.reason);\n      }\n    }\n  };\n\n  return {\n    get patchesSent() {\n      return pokers.some(poker => poker.patchesSent);\n    },\n    addPatch: patch => {\n      const shared: SharedRowPatch = {};\n      return settle(\n        'addPatch',\n        pokers.map(poker => poker.addPatch(patch, shared)),\n      );\n    },\n    cancel: () =>\n      settle(\n        'cancel',\n        pokers.map(poker => poker.cancel()),\n      ),\n    end: finalVersion =>\n      settle(\n        'end',\n        pokers.map(poker => poker.end(finalVersion)),\n      ),\n  };\n}\n\n// Soft limit on the serialized row characters accumulated in a poke part.\n// This bounds view-syncer memory and keeps legacy JSON messages reasonably\n// sized. PokeChunkEncoder separately enforces the binary frame limit in bytes.\nexport const POKE_PART_FLUSH_THRESHOLD_CHARS = 1024 * 1024;\nconst PART_COUNT_FLUSH_THRESHOLD = 100;\n\n/**\n * Handles a single `ViewSyncer` connection.\n */\nexport class ClientHandler {\n  readonly #clientGroupID: string;\n  readonly clientID: string;\n  readonly wsID: string;\n  readonly #zeroClientsTable: string;\n  readonly #zeroMutationsTable: string;\n  readonly #lc: LogContext;\n  readonly #downstream: Subscription<ViewSyncerDownstream>;\n  #baseVersion: NullableCVRVersion;\n  // We will send a poke on connect even if the client is already caught up, so that it can learn its\n  // got-queries state has been reconciled with the server. After that, we will only send a poke if\n  // the client is behind.\n  #everPoked = false;\n\n  readonly #pokeTime = getOrCreateLatencyHistogram(\n    'sync',\n    'poke.time',\n    'Time elapsed for each poke transaction. Canceled / noop pokes are excluded.',\n  );\n\n  readonly #pokeTransactions = getOrCreateCounter(\n    'sync',\n    'poke.transactions',\n    'Count of poke transactions.',\n  );\n\n  readonly #pokedRows = getOrCreateCounter(\n    'sync',\n    'poke.rows',\n    'Count of poked rows.',\n  );\n\n  constructor(\n    lc: LogContext,\n    clientGroupID: string,\n    clientID: string,\n    wsID: string,\n    shard: ShardID,\n    baseCookie: string | null,\n    downstream: Subscription<ViewSyncerDownstream>,\n  ) {\n    lc.debug?.('new client handler');\n    this.#clientGroupID = clientGroupID;\n    this.clientID = clientID;\n    this.wsID = wsID;\n    this.#zeroClientsTable = `${upstreamSchema(shard)}.clients`;\n    this.#zeroMutationsTable = `${upstreamSchema(shard)}.mutations`;\n    this.#lc = lc;\n    this.#downstream = downstream;\n    this.#baseVersion = parseBaseCookie(baseCookie);\n  }\n\n  version(): NullableCVRVersion {\n    return this.#baseVersion;\n  }\n\n  async #push(msg: Downstream, serialized?: string | undefined): Promise<void> {\n    const {result} = this.#downstream.push({message: msg, serialized});\n    await result;\n  }\n\n  fail(e: unknown) {\n    this.#lc[getLogLevel(e)]?.(\n      `view-syncer closing connection with error: ${String(e)}`,\n      e,\n    );\n    this.#downstream.fail(wrapWithProtocolError(e));\n  }\n\n  close(reason: string) {\n    this.#lc.debug?.(`view-syncer closing connection: ${reason}`);\n    this.#downstream.cancel();\n  }\n\n  startPoke(tentativeVersion: CVRVersion): ClientPokeHandler {\n    const pokeID = versionToCookie(tentativeVersion);\n    const lc = this.#lc.withContext('pokeID', pokeID);\n\n    // Force an (empty) initial poke even when already caught up; see #everPoked.\n    const forceInitialPoke = !this.#everPoked;\n    const cmp = cmpVersions(this.#baseVersion, tentativeVersion);\n    if (cmp > 0 || (cmp === 0 && !forceInitialPoke)) {\n      lc.info?.(`already caught up, not sending poke.`);\n      return NOOP;\n    }\n\n    const baseCookie = versionToNullableCookie(this.#baseVersion);\n    const cookie = versionToCookie(tentativeVersion);\n    lc.debug?.(`starting poke from ${baseCookie} to ${cookie}`);\n\n    const start = performance.now();\n\n    const pokeStart: PokeStartBody = {pokeID, baseCookie};\n\n    let pokeStarted = false;\n    let body: PokePartBody | undefined;\n    // rowsPatch is kept out of `body` until it is flushed so that the poke\n    // part can be serialized by concatenating the pre-serialized rows.\n    let rowsPatch: RowPatchOp[] = [];\n    let rowsJSON: string[] = [];\n    let partCount = 0;\n    let serializedRowsLength = 0;\n\n    const ensureBody = async () => {\n      if (!pokeStarted) {\n        await this.#push(['pokeStart', pokeStart]);\n        pokeStarted = true;\n      }\n      return (body ??= {pokeID});\n    };\n\n    const flushBody = async () => {\n      if (body) {\n        let message: PokePartMessage;\n        let serialized: string;\n        if (rowsPatch.length === 0) {\n          message = ['pokePart', body];\n          serialized = JSON.stringify(message);\n        } else {\n          // Equivalent to JSON.stringify(message): rowsPatch is the last\n          // property of the body.\n          const prefix = JSON.stringify(['pokePart', body]);\n          message = ['pokePart', {...body, rowsPatch}];\n          serialized = `${prefix.slice(0, -2)},\"rowsPatch\":[${rowsJSON.join(',')}]}]`;\n          rowsPatch = [];\n          rowsJSON = [];\n        }\n        await this.#push(message, serialized);\n        body = undefined;\n        partCount = 0;\n        serializedRowsLength = 0;\n      }\n    };\n\n    const addPatch = async (\n      patchToVersion: PatchToVersion,\n      shared: SharedRowPatch,\n    ) => {\n      const {patch, toVersion} = patchToVersion;\n      if (cmpVersions(toVersion, this.#baseVersion) <= 0) {\n        return;\n      }\n      const target = await ensureBody();\n\n      const {type, op} = patch;\n      switch (type) {\n        case 'query': {\n          const patches = patch.clientID\n            ? ((target.desiredQueriesPatches ??= {})[patch.clientID] ??= [])\n            : (target.gotQueriesPatch ??= []);\n          patches.push({op, hash: patch.id});\n          break;\n        }\n        case 'row':\n          if (patch.id.table === this.#zeroClientsTable) {\n            this.#updateLMIDs((target.lastMutationIDChanges ??= {}), patch);\n          } else if (patch.id.table === this.#zeroMutationsTable) {\n            const patches = (target.mutationsPatch ??= []);\n            if (op === 'put') {\n              const row = v.parse(\n                ensureSafeJSON(patch.contents),\n                mutationRowSchema,\n                'passthrough',\n              );\n              patches.push({\n                op: 'put',\n                mutation: {\n                  id: {\n                    clientID: row.clientID,\n                    id: row.mutationID,\n                  },\n                  result: row.result,\n                },\n              });\n            } else {\n              const {clientID, mutationID} = patch.id.rowKey;\n              assert(\n                typeof clientID === 'string',\n                'client id must be a string',\n              );\n              const id = Number(mutationID);\n              assert(\n                !Number.isNaN(id) && Number.isFinite(id) && id >= 0,\n                'mutation id must be a finite number',\n              );\n              patches.push({\n                op: 'del',\n                id: {\n                  clientID,\n                  id,\n                },\n              });\n            }\n          } else {\n            const {rowPatch, json} = (shared.serialized ??=\n              serializeRowPatch(patch));\n            rowsPatch.push(rowPatch);\n            rowsJSON.push(json);\n            serializedRowsLength += json.length;\n          }\n          break;\n        default:\n          unreachable(patch);\n      }\n\n      partCount++;\n      if (\n        serializedRowsLength >= POKE_PART_FLUSH_THRESHOLD_CHARS ||\n        partCount >= PART_COUNT_FLUSH_THRESHOLD\n      ) {\n        await flushBody();\n      }\n    };\n\n    // A poke that was started must always be ended. If it isn't, the\n    // connection is left mid-poke and the *next* pokeStart fails the\n    // DownstreamSender's in-progress check, surfacing the error far from\n    // its cause. Fail the connection instead; the client reconnects and\n    // resyncs from its baseVersion.\n    return {\n      get patchesSent() {\n        return pokeStarted;\n      },\n      addPatch: async (\n        patchToVersion: PatchToVersion,\n        shared: SharedRowPatch = {},\n      ) => {\n        try {\n          await addPatch(patchToVersion, shared);\n          if (patchToVersion.patch.type === 'row') {\n            this.#pokedRows.add(1);\n          }\n        } catch (e) {\n          this.fail(e);\n        }\n      },\n\n      cancel: async () => {\n        try {\n          if (pokeStarted) {\n            await this.#push(['pokeEnd', {pokeID, cookie: '', cancel: true}]);\n          }\n        } catch (e) {\n          this.fail(e);\n        }\n      },\n\n      end: async (finalVersion: CVRVersion) => {\n        try {\n          const cookie = versionToCookie(finalVersion);\n          if (!pokeStarted) {\n            if (\n              cmpVersions(this.#baseVersion, finalVersion) === 0 &&\n              !forceInitialPoke\n            ) {\n              return; // Nothing changed and nothing was sent.\n            }\n            await this.#push(['pokeStart', pokeStart]);\n          } else if (cmpVersions(this.#baseVersion, finalVersion) >= 0) {\n            // Sanity check: If the poke was started, the finalVersion\n            // must be > #baseVersion.\n            throw new Error(\n              `Patches were sent but finalVersion ${cookie} is not ` +\n                `greater than baseVersion ` +\n                `${versionToNullableCookie(this.#baseVersion)}`,\n            );\n          }\n          await flushBody();\n          await this.#push(['pokeEnd', {pokeID, cookie}]);\n          this.#baseVersion = finalVersion;\n          this.#everPoked = true;\n\n          const elapsed = performance.now() - start;\n          this.#pokeTransactions.add(1);\n          this.#pokeTime.recordMs(elapsed);\n        } catch (e) {\n          this.fail(e);\n        }\n      },\n    };\n  }\n\n  async sendDeleteClients(\n    lc: LogContext,\n    deletedClientIDs: string[],\n    deletedClientGroupIDs: string[],\n  ) {\n    const deleteClientsBody: Writable<DeleteClientsBody> = {};\n    if (deletedClientIDs.length > 0) {\n      deleteClientsBody.clientIDs = deletedClientIDs;\n    }\n    if (deletedClientGroupIDs.length > 0) {\n      deleteClientsBody.clientGroupIDs = deletedClientGroupIDs;\n    }\n    lc.debug?.('sending deleteClients', deleteClientsBody);\n    await this.#push(['deleteClients', deleteClientsBody]);\n  }\n\n  sendQueryTransformApplicationErrors(errors: ErroredQuery[]) {\n    void this.#push(['transformError', errors]);\n  }\n\n  sendQueryTransformFailedError(error: TransformFailedBody) {\n    this.fail(new ProtocolError(error));\n  }\n\n  sendInspectResponse(lc: LogContext, response: InspectDownBody): void {\n    lc.debug?.('sending inspect response', response);\n    this.#downstream.push({\n      message: ['inspect', response],\n      serialized: undefined,\n    });\n  }\n\n  #updateLMIDs(lmids: Record<string, number>, patch: RowPatch) {\n    if (patch.op === 'put') {\n      const row = ensureSafeJSON(patch.contents);\n      const {clientGroupID, clientID, lastMutationID} = v.parse(\n        row,\n        lmidRowSchema,\n        'passthrough',\n      );\n      if (clientGroupID !== this.#clientGroupID) {\n        this.#lc.error?.(\n          `Received clients row for wrong clientGroupID. Ignoring.`,\n          clientGroupID,\n        );\n      } else {\n        lmids[clientID] = lastMutationID;\n      }\n    } else {\n      // The 'constrain' and 'del' ops for clients can be ignored.\n      patch.op satisfies 'constrain' | 'del';\n    }\n  }\n}\n\n// Note: The {APP_ID}_{SHARD_ID}.clients table is set up in replicator/initial-sync.ts.\nconst lmidRowSchema = v.object({\n  clientGroupID: v.string(),\n  clientID: v.string(),\n  lastMutationID: v.number(), // Actually returned as a bigint, but converted by ensureSafeJSON().\n});\n\nconst mutationRowSchema = v.object({\n  clientGroupID: v.string(),\n  clientID: v.string(),\n  mutationID: v.number(),\n  result: mutationResultSchema,\n});\n\nfunction serializeRowPatch(patch: RowPatch): SerializedRowPatch {\n  const rowPatch = makeRowPatch(patch);\n  return {rowPatch, json: JSON.stringify(rowPatch)};\n}\n\nfunction makeRowPatch(patch: RowPatch): RowPatchOp {\n  const {\n    op,\n    id: {table: tableName, rowKey: id},\n  } = patch;\n\n  switch (op) {\n    case 'put':\n      // ensureSafeJSON() converts bigints and asserts (outside of prod) that\n      // the values are JSON, which is all that rowSchema checks.\n      return {\n        op: 'put',\n        tableName,\n        value: ensureSafeJSON(patch.contents),\n      };\n\n    case 'del':\n      return {\n        op,\n        tableName,\n        id: v.parse(id, primaryKeyValueRecordSchema),\n      };\n\n    default:\n      unreachable(op);\n  }\n}\n\n/**\n * Column values of type INT8 are returned as the `bigint` from the\n * Postgres library. These are converted to `number` if they are within\n * the safe Number range, allowing the protocol to support numbers larger\n * than 32-bits. Values outside of the safe number range (e.g. > 2^53) will\n * result in an Error.\n */\nexport function ensureSafeJSON(row: JSONObject): SafeJSONObject {\n  let modified: Record<string, unknown> | undefined;\n  for (const k in row) {\n    if (!hasOwn(row, k)) {\n      continue;\n    }\n    const v = row[k];\n    if (typeof v === 'bigint') {\n      if (v < Number.MIN_SAFE_INTEGER || v > Number.MAX_SAFE_INTEGER) {\n        throw new Error(`Value of \"${k}\" exceeds safe Number range (${v})`);\n      }\n      (modified ??= {...row})[k] = Number(v);\n    } else if (typeof v === 'object') {\n      assertJSONValue(v);\n    }\n  }\n  return (modified ?? row) as SafeJSONObject;\n}\n\n/**\n * The baseCookie comes from the connection URL so it is client input. A\n * malformed one is reported to the client as an invalid baseCookie (which\n * makes it reset its local state) rather than as an internal error.\n */\nfunction parseBaseCookie(baseCookie: string | null): NullableCVRVersion {\n  try {\n    return cookieToVersion(baseCookie);\n  } catch (e) {\n    throw new ProtocolError(\n      {\n        kind: ErrorKind.InvalidConnectionRequestBaseCookie,\n        message: `Invalid baseCookie ${JSON.stringify(baseCookie)}: ${getErrorMessage(e)}`,\n        origin: ErrorOrigin.ZeroCache,\n      },\n      {cause: e},\n    );\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAsHA,IAAM,OAA0B;CAC9B,aAAa;CACb,gBAAgB;CAChB,cAAc;CACd,WAAW;AACb;;AAGA,SAAgB,UACd,IACA,SACA,kBACkB;CAClB,MAAM,SAAS,QAAQ,KAAI,MAAK,EAAE,UAAU,gBAAgB,CAAC;CAS7D,MAAM,SAAS,OAAO,IAAY,YAA6B;EAC7D,KAAK,MAAM,UAAU,MAAM,QAAQ,WAAW,OAAO,GACnD,IAAI,OAAO,WAAW,YACpB,GAAG,QAAQ,kCAAkC,GAAG,IAAI,OAAO,MAAM;CAGvE;CAEA,OAAO;EACL,IAAI,cAAc;GAChB,OAAO,OAAO,MAAK,UAAS,MAAM,WAAW;EAC/C;EACA,WAAU,UAAS;GACjB,MAAM,SAAyB,CAAC;GAChC,OAAO,OACL,YACA,OAAO,KAAI,UAAS,MAAM,SAAS,OAAO,MAAM,CAAC,CACnD;EACF;EACA,cACE,OACE,UACA,OAAO,KAAI,UAAS,MAAM,OAAO,CAAC,CACpC;EACF,MAAK,iBACH,OACE,OACA,OAAO,KAAI,UAAS,MAAM,IAAI,YAAY,CAAC,CAC7C;CACJ;AACF;AAKA,IAAa,kCAAkC;AAC/C,IAAM,6BAA6B;;;;AAKnC,IAAa,gBAAb,MAA2B;CACzB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAIA,aAAa;CAEb,YAAqB,4BACnB,QACA,aACA,6EACF;CAEA,oBAA6B,mBAC3B,QACA,qBACA,6BACF;CAEA,aAAsB,mBACpB,QACA,aACA,sBACF;CAEA,YACE,IACA,eACA,UACA,MACA,OACA,YACA,YACA;EACA,GAAG,QAAQ,oBAAoB;EAC/B,KAAK,iBAAiB;EACtB,KAAK,WAAW;EAChB,KAAK,OAAO;EACZ,KAAK,oBAAoB,GAAG,eAAe,KAAK,EAAE;EAClD,KAAK,sBAAsB,GAAG,eAAe,KAAK,EAAE;EACpD,KAAK,MAAM;EACX,KAAK,cAAc;EACnB,KAAK,eAAe,gBAAgB,UAAU;CAChD;CAEA,UAA8B;EAC5B,OAAO,KAAK;CACd;CAEA,MAAM,MAAM,KAAiB,YAAgD;EAC3E,MAAM,EAAC,WAAU,KAAK,YAAY,KAAK;GAAC,SAAS;GAAK;EAAU,CAAC;EACjE,MAAM;CACR;CAEA,KAAK,GAAY;EACf,KAAK,IAAI,YAAY,CAAC,EAAE,GACtB,8CAA8C,OAAO,CAAC,KACtD,CACF;EACA,KAAK,YAAY,KAAK,sBAAsB,CAAC,CAAC;CAChD;CAEA,MAAM,QAAgB;EACpB,KAAK,IAAI,QAAQ,mCAAmC,QAAQ;EAC5D,KAAK,YAAY,OAAO;CAC1B;CAEA,UAAU,kBAAiD;EACzD,MAAM,SAAS,gBAAgB,gBAAgB;EAC/C,MAAM,KAAK,KAAK,IAAI,YAAY,UAAU,MAAM;EAGhD,MAAM,mBAAmB,CAAC,KAAK;EAC/B,MAAM,MAAM,YAAY,KAAK,cAAc,gBAAgB;EAC3D,IAAI,MAAM,KAAM,QAAQ,KAAK,CAAC,kBAAmB;GAC/C,GAAG,OAAO,sCAAsC;GAChD,OAAO;EACT;EAEA,MAAM,aAAa,wBAAwB,KAAK,YAAY;EAC5D,MAAM,SAAS,gBAAgB,gBAAgB;EAC/C,GAAG,QAAQ,sBAAsB,WAAW,MAAM,QAAQ;EAE1D,MAAM,QAAQ,YAAY,IAAI;EAE9B,MAAM,YAA2B;GAAC;GAAQ;EAAU;EAEpD,IAAI,cAAc;EAClB,IAAI;EAGJ,IAAI,YAA0B,CAAC;EAC/B,IAAI,WAAqB,CAAC;EAC1B,IAAI,YAAY;EAChB,IAAI,uBAAuB;EAE3B,MAAM,aAAa,YAAY;GAC7B,IAAI,CAAC,aAAa;IAChB,MAAM,KAAK,MAAM,CAAC,aAAa,SAAS,CAAC;IACzC,cAAc;GAChB;GACA,OAAQ,SAAS,EAAC,OAAM;EAC1B;EAEA,MAAM,YAAY,YAAY;GAC5B,IAAI,MAAM;IACR,IAAI;IACJ,IAAI;IACJ,IAAI,UAAU,WAAW,GAAG;KAC1B,UAAU,CAAC,YAAY,IAAI;KAC3B,aAAa,KAAK,UAAU,OAAO;IACrC,OAAO;KAGL,MAAM,SAAS,KAAK,UAAU,CAAC,YAAY,IAAI,CAAC;KAChD,UAAU,CAAC,YAAY;MAAC,GAAG;MAAM;KAAS,CAAC;KAC3C,aAAa,GAAG,OAAO,MAAM,GAAG,EAAE,EAAE,gBAAgB,SAAS,KAAK,GAAG,EAAE;KACvE,YAAY,CAAC;KACb,WAAW,CAAC;IACd;IACA,MAAM,KAAK,MAAM,SAAS,UAAU;IACpC,OAAO,KAAA;IACP,YAAY;IACZ,uBAAuB;GACzB;EACF;EAEA,MAAM,WAAW,OACf,gBACA,WACG;GACH,MAAM,EAAC,OAAO,cAAa;GAC3B,IAAI,YAAY,WAAW,KAAK,YAAY,KAAK,GAC/C;GAEF,MAAM,SAAS,MAAM,WAAW;GAEhC,MAAM,EAAC,MAAM,OAAM;GACnB,QAAQ,MAAR;IACE,KAAK;KAIH,CAHgB,MAAM,WACjB,CAAC,OAAO,0BAA0B,CAAC,EAAA,CAAG,MAAM,cAAc,CAAC,IAC3D,OAAO,oBAAoB,CAAC,EAAA,CACzB,KAAK;MAAC;MAAI,MAAM,MAAM;KAAE,CAAC;KACjC;IAEF,KAAK;KACH,IAAI,MAAM,GAAG,UAAU,KAAK,mBAC1B,KAAK,aAAc,OAAO,0BAA0B,CAAC,GAAI,KAAK;UACzD,IAAI,MAAM,GAAG,UAAU,KAAK,qBAAqB;MACtD,MAAM,UAAW,OAAO,mBAAmB,CAAC;MAC5C,IAAI,OAAO,OAAO;OAChB,MAAM,MAAMA,MACV,eAAe,MAAM,QAAQ,GAC7B,mBACA,aACF;OACA,QAAQ,KAAK;QACX,IAAI;QACJ,UAAU;SACR,IAAI;UACF,UAAU,IAAI;UACd,IAAI,IAAI;SACV;SACA,QAAQ,IAAI;QACd;OACF,CAAC;MACH,OAAO;OACL,MAAM,EAAC,UAAU,eAAc,MAAM,GAAG;OACxC,OACE,OAAO,aAAa,UACpB,4BACF;OACA,MAAM,KAAK,OAAO,UAAU;OAC5B,OACE,CAAC,OAAO,MAAM,EAAE,KAAK,OAAO,SAAS,EAAE,KAAK,MAAM,GAClD,qCACF;OACA,QAAQ,KAAK;QACX,IAAI;QACJ,IAAI;SACF;SACA;QACF;OACF,CAAC;MACH;KACF,OAAO;MACL,MAAM,EAAC,UAAU,SAAS,OAAO,eAC/B,kBAAkB,KAAK;MACzB,UAAU,KAAK,QAAQ;MACvB,SAAS,KAAK,IAAI;MAClB,wBAAwB,KAAK;KAC/B;KACA;IACF,SACE,YAAY,KAAK;GACrB;GAEA;GACA,IACE,wBAAA,WACA,aAAa,4BAEb,MAAM,UAAU;EAEpB;EAOA,OAAO;GACL,IAAI,cAAc;IAChB,OAAO;GACT;GACA,UAAU,OACR,gBACA,SAAyB,CAAC,MACvB;IACH,IAAI;KACF,MAAM,SAAS,gBAAgB,MAAM;KACrC,IAAI,eAAe,MAAM,SAAS,OAChC,KAAK,WAAW,IAAI,CAAC;IAEzB,SAAS,GAAG;KACV,KAAK,KAAK,CAAC;IACb;GACF;GAEA,QAAQ,YAAY;IAClB,IAAI;KACF,IAAI,aACF,MAAM,KAAK,MAAM,CAAC,WAAW;MAAC;MAAQ,QAAQ;MAAI,QAAQ;KAAI,CAAC,CAAC;IAEpE,SAAS,GAAG;KACV,KAAK,KAAK,CAAC;IACb;GACF;GAEA,KAAK,OAAO,iBAA6B;IACvC,IAAI;KACF,MAAM,SAAS,gBAAgB,YAAY;KAC3C,IAAI,CAAC,aAAa;MAChB,IACE,YAAY,KAAK,cAAc,YAAY,MAAM,KACjD,CAAC,kBAED;MAEF,MAAM,KAAK,MAAM,CAAC,aAAa,SAAS,CAAC;KAC3C,OAAO,IAAI,YAAY,KAAK,cAAc,YAAY,KAAK,GAGzD,MAAM,IAAI,MACR,sCAAsC,OAAO,mCAExC,wBAAwB,KAAK,YAAY,GAChD;KAEF,MAAM,UAAU;KAChB,MAAM,KAAK,MAAM,CAAC,WAAW;MAAC;MAAQ;KAAM,CAAC,CAAC;KAC9C,KAAK,eAAe;KACpB,KAAK,aAAa;KAElB,MAAM,UAAU,YAAY,IAAI,IAAI;KACpC,KAAK,kBAAkB,IAAI,CAAC;KAC5B,KAAK,UAAU,SAAS,OAAO;IACjC,SAAS,GAAG;KACV,KAAK,KAAK,CAAC;IACb;GACF;EACF;CACF;CAEA,MAAM,kBACJ,IACA,kBACA,uBACA;EACA,MAAM,oBAAiD,CAAC;EACxD,IAAI,iBAAiB,SAAS,GAC5B,kBAAkB,YAAY;EAEhC,IAAI,sBAAsB,SAAS,GACjC,kBAAkB,iBAAiB;EAErC,GAAG,QAAQ,yBAAyB,iBAAiB;EACrD,MAAM,KAAK,MAAM,CAAC,iBAAiB,iBAAiB,CAAC;CACvD;CAEA,oCAAoC,QAAwB;EAC1D,KAAU,MAAM,CAAC,kBAAkB,MAAM,CAAC;CAC5C;CAEA,8BAA8B,OAA4B;EACxD,KAAK,KAAK,IAAI,cAAc,KAAK,CAAC;CACpC;CAEA,oBAAoB,IAAgB,UAAiC;EACnE,GAAG,QAAQ,4BAA4B,QAAQ;EAC/C,KAAK,YAAY,KAAK;GACpB,SAAS,CAAC,WAAW,QAAQ;GAC7B,YAAY,KAAA;EACd,CAAC;CACH;CAEA,aAAa,OAA+B,OAAiB;EAC3D,IAAI,MAAM,OAAO,OAAO;GACtB,MAAM,MAAM,eAAe,MAAM,QAAQ;GACzC,MAAM,EAAC,eAAe,UAAU,mBAAkBA,MAChD,KACA,eACA,aACF;GACA,IAAI,kBAAkB,KAAK,gBACzB,KAAK,IAAI,QACP,2DACA,aACF;QAEA,MAAM,YAAY;EAEtB,OAEE,MAAM;CAEV;AACF;AAGA,IAAM,gBAAgBC,eAAE,OAAO;CAC7B,eAAeA,eAAE,OAAO;CACxB,UAAUA,eAAE,OAAO;CACnB,gBAAgBA,eAAE,OAAO;AAC3B,CAAC;AAED,IAAM,oBAAoBA,eAAE,OAAO;CACjC,eAAeA,eAAE,OAAO;CACxB,UAAUA,eAAE,OAAO;CACnB,YAAYA,eAAE,OAAO;CACrB,QAAQ;AACV,CAAC;AAED,SAAS,kBAAkB,OAAqC;CAC9D,MAAM,WAAW,aAAa,KAAK;CACnC,OAAO;EAAC;EAAU,MAAM,KAAK,UAAU,QAAQ;CAAC;AAClD;AAEA,SAAS,aAAa,OAA6B;CACjD,MAAM,EACJ,IACA,IAAI,EAAC,OAAO,WAAW,QAAQ,SAC7B;CAEJ,QAAQ,IAAR;EACE,KAAK,OAGH,OAAO;GACL,IAAI;GACJ;GACA,OAAO,eAAe,MAAM,QAAQ;EACtC;EAEF,KAAK,OACH,OAAO;GACL;GACA;GACA,IAAID,MAAQ,IAAI,2BAA2B;EAC7C;EAEF,SACE,YAAY,EAAE;CAClB;AACF;;;;;;;;AASA,SAAgB,eAAe,KAAiC;CAC9D,IAAI;CACJ,KAAK,MAAM,KAAK,KAAK;EACnB,IAAI,CAAC,OAAO,KAAK,CAAC,GAChB;EAEF,MAAM,IAAI,IAAI;EACd,IAAI,OAAO,MAAM,UAAU;GACzB,IAAI,IAAI,OAAO,oBAAoB,IAAI,OAAO,kBAC5C,MAAM,IAAI,MAAM,aAAa,EAAE,+BAA+B,EAAE,EAAE;GAEpE,CAAC,aAAa,EAAC,GAAG,IAAG,EAAA,CAAG,KAAK,OAAO,CAAC;EACvC,OAAO,IAAI,OAAO,MAAM,UACtB,gBAAgB,CAAC;CAErB;CACA,OAAQ,YAAY;AACtB;;;;;;AAOA,SAAS,gBAAgB,YAA+C;CACtE,IAAI;EACF,OAAO,gBAAgB,UAAU;CACnC,SAAS,GAAG;EACV,MAAM,IAAI,cACR;GACE,MAAME;GACN,SAAS,sBAAsB,KAAK,UAAU,UAAU,EAAE,IAAI,gBAAgB,CAAC;GAC/E,QAAQC;EACV,GACA,EAAC,OAAO,EAAC,CACX;CACF;AACF"}

package/out/zero-cache/src/services/view-syncer/client-schema.d.ts

@@ -1,5 +1,18 @@
 import type { ClientSchema } from '../../../../zero-protocol/src/client-schema.ts';
-import type { LiteAndZqlSpec, LiteTableSpec } from '../../db/specs.ts';
+import type { LiteTableSpecWithReplicationStatus } from '../../db/lite-tables.ts';
+import type { LiteAndZqlSpec } from '../../db/specs.ts';
 import { type ShardID } from '../../types/shards.ts';
-export declare function checkClientSchema(shardID: ShardID, clientSchema: ClientSchema, tableSpecs: Map<string, LiteAndZqlSpec>, fullTables: Map<string, LiteTableSpec>): void;
+/**
+ * Throws a `SchemaVersionNotSupported` error if the client schema is not
+ * compatible with the replica, or a `ServerOverloaded` error (which clients
+ * retry with backoff) if the only incompatibilities are tables or columns
+ * that are still being backfilled.
+ *
+ * @param tableSpecsWithBackfills the table specs computed with backfilling
+ *     columns included. Permanent incompatibilities are checked against
+ *     these, so that a table or column that will not be syncable after its
+ *     backfill completes is not reported as retriable. Defaults to
+ *     `tableSpecs`, for replicas with nothing being backfilled.
+ */
+export declare function checkClientSchema(shardID: ShardID, clientSchema: ClientSchema, tableSpecs: Map<string, LiteAndZqlSpec>, fullTables: Map<string, LiteTableSpecWithReplicationStatus>, tableSpecsWithBackfills?: Map<string, LiteAndZqlSpec>): void;
 //# sourceMappingURL=client-schema.d.ts.map

package/out/zero-cache/src/services/view-syncer/client-schema.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"client-schema.d.ts","sourceRoot":"","sources":["../../../../../../zero-cache/src/services/view-syncer/client-schema.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,gDAAgD,CAAC;AAGjF,OAAO,KAAK,EAAC,cAAc,EAAE,aAAa,EAAC,MAAM,mBAAmB,CAAC;AAErE,OAAO,EAA4B,KAAK,OAAO,EAAC,MAAM,uBAAuB,CAAC;AAG9E,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,OAAO,EAChB,YAAY,EAAE,YAAY,EAC1B,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,EACvC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,QAyHvC"}
+{"version":3,"file":"client-schema.d.ts","sourceRoot":"","sources":["../../../../../../zero-cache/src/services/view-syncer/client-schema.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,gDAAgD,CAAC;AAIjF,OAAO,KAAK,EAAC,kCAAkC,EAAC,MAAM,yBAAyB,CAAC;AAChF,OAAO,KAAK,EAAC,cAAc,EAAC,MAAM,mBAAmB,CAAC;AAEtD,OAAO,EAA4B,KAAK,OAAO,EAAC,MAAM,uBAAuB,CAAC;AAQ9E;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,OAAO,EAChB,YAAY,EAAE,YAAY,EAC1B,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,EACvC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,kCAAkC,CAAC,EAC3D,uBAAuB,GAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAc,QAkClE"}

package/out/zero-cache/src/services/view-syncer/client-schema.js

@@ -1,5 +1,6 @@
 import { toSorted } from "../../../../shared/src/iterables.js";
 import { must } from "../../../../shared/src/must.js";
+import { ServerOverloaded } from "../../../../zero-protocol/src/error-kind-enum.js";
 import { ZeroCache } from "../../../../zero-protocol/src/error-origin-enum.js";
 import { ProtocolError } from "../../../../zero-protocol/src/error.js";
 import { difference, equals, intersection } from "../../../../shared/src/set-utils.js";
@@ -7,12 +8,55 @@ import { appSchema, upstreamSchema } from "../../types/shards.js";
 import { ZERO_VERSION_COLUMN_NAME } from "../replicator/schema/constants.js";
 import { liteTypeToZqlValueType } from "../../types/lite.js";
 //#region ../zero-cache/src/services/view-syncer/client-schema.ts
-function checkClientSchema(shardID, clientSchema, tableSpecs, fullTables) {
+var BACKFILL_MIN_BACKOFF_MS = 5e3;
+var BACKFILL_MAX_BACKOFF_MS = 3e4;
+/**
+* Throws a `SchemaVersionNotSupported` error if the client schema is not
+* compatible with the replica, or a `ServerOverloaded` error (which clients
+* retry with backoff) if the only incompatibilities are tables or columns
+* that are still being backfilled.
+*
+* @param tableSpecsWithBackfills the table specs computed with backfilling
+*     columns included. Permanent incompatibilities are checked against
+*     these, so that a table or column that will not be syncable after its
+*     backfill completes is not reported as retriable. Defaults to
+*     `tableSpecs`, for replicas with nothing being backfilled.
+*/
+function checkClientSchema(shardID, clientSchema, tableSpecs, fullTables, tableSpecsWithBackfills = tableSpecs) {
 	if (fullTables.size === 0) throw new ProtocolError({
 		kind: "Internal",
 		message: "No tables have been synced from upstream. Please check that the ZERO_UPSTREAM_DB has been properly set.",
 		origin: ZeroCache
 	});
+	const errors = findIncompatibilities(shardID, clientSchema, tableSpecsWithBackfills, fullTables);
+	if (errors.length) throw new ProtocolError({
+		kind: "SchemaVersionNotSupported",
+		message: errors.join("\n"),
+		origin: ZeroCache
+	});
+	const backfilling = findBackfilling(clientSchema, tableSpecs, fullTables);
+	if (backfilling.length) throw new ProtocolError({
+		kind: ServerOverloaded,
+		message: backfilling.join("\n"),
+		minBackoffMs: BACKFILL_MIN_BACKOFF_MS,
+		maxBackoffMs: BACKFILL_MAX_BACKOFF_MS,
+		origin: ZeroCache
+	});
+}
+function findBackfilling(clientSchema, tableSpecs, fullTables) {
+	const backfilling = [];
+	for (const table of toSorted(Object.keys(clientSchema.tables))) {
+		const columns = fullTables.get(table)?.backfilling;
+		if (!columns?.length) continue;
+		if (!tableSpecs.has(table)) {
+			backfilling.push(`The "${table}" table is being backfilled.`);
+			continue;
+		}
+		for (const column of toSorted(Object.keys(clientSchema.tables[table].columns))) if (columns.includes(column)) backfilling.push(`The "${table}"."${column}" column is being backfilled.`);
+	}
+	return backfilling;
+}
+function findIncompatibilities(shardID, clientSchema, tableSpecs, fullTables) {
 	const errors = [];
 	const clientTables = new Set(Object.keys(clientSchema.tables));
 	const missingTables = difference(clientTables, tableSpecs);
@@ -56,11 +100,7 @@ function checkClientSchema(shardID, clientSchema, tableSpecs, fullTables) {
 			if (!serverSpec.tableSpec.allPotentialPrimaryKeys.some((key) => equals(clientPrimaryKey, new Set(key)))) errors.push(`The "${table}" table's primaryKey <${clientSpec.primaryKey.join(",")}> is not associated with a non-null unique index.`);
 		}
 	}
-	if (errors.length) throw new ProtocolError({
-		kind: "SchemaVersionNotSupported",
-		message: errors.join("\n"),
-		origin: ZeroCache
-	});
+	return errors;
 }
 //#endregion
 export { checkClientSchema };

package/out/zero-cache/src/services/view-syncer/client-schema.js.map

@@ -1 +1 @@
-{"version":3,"file":"client-schema.js","names":[],"sources":["../../../../../../zero-cache/src/services/view-syncer/client-schema.ts"],"sourcesContent":["import {toSorted} from '../../../../shared/src/iterables.ts';\nimport {must} from '../../../../shared/src/must.ts';\nimport {\n  difference,\n  equals,\n  intersection,\n} from '../../../../shared/src/set-utils.ts';\nimport type {ClientSchema} from '../../../../zero-protocol/src/client-schema.ts';\nimport {ErrorOrigin} from '../../../../zero-protocol/src/error-origin.ts';\nimport {ProtocolError} from '../../../../zero-protocol/src/error.ts';\nimport type {LiteAndZqlSpec, LiteTableSpec} from '../../db/specs.ts';\nimport {liteTypeToZqlValueType} from '../../types/lite.ts';\nimport {appSchema, upstreamSchema, type ShardID} from '../../types/shards.ts';\nimport {ZERO_VERSION_COLUMN_NAME} from '../replicator/schema/constants.ts';\n\nexport function checkClientSchema(\n  shardID: ShardID,\n  clientSchema: ClientSchema,\n  tableSpecs: Map<string, LiteAndZqlSpec>,\n  fullTables: Map<string, LiteTableSpec>,\n) {\n  if (fullTables.size === 0) {\n    throw new ProtocolError({\n      kind: 'Internal',\n      message:\n        `No tables have been synced from upstream. ` +\n        `Please check that the ZERO_UPSTREAM_DB has been properly set.`,\n      origin: ErrorOrigin.ZeroCache,\n    });\n  }\n  const errors: string[] = [];\n  const clientTables = new Set(Object.keys(clientSchema.tables));\n  const missingTables = difference(clientTables, tableSpecs);\n  for (const missing of toSorted(missingTables)) {\n    if (fullTables.has(missing)) {\n      const fullTable = must(fullTables.get(missing));\n      const unsupportedPrimaryKeyColumns = (fullTable.primaryKey ?? []).filter(\n        col => !liteTypeToZqlValueType(fullTable.columns[col]?.dataType ?? ''),\n      );\n      if (unsupportedPrimaryKeyColumns.length) {\n        errors.push(\n          `The \"${missing}\" table's primary key contains unsupported columns: ` +\n            unsupportedPrimaryKeyColumns\n              .map(\n                col =>\n                  `\"${col}\" (${fullTable.columns[col]?.dataType ?? 'unknown'})`,\n              )\n              .join(', ') +\n            `. These columns must use Zero-supported data types to sync the table to the client.`,\n        );\n        continue;\n      }\n      errors.push(\n        `The \"${missing}\" table is missing a primary key or non-null ` +\n          `unique index and thus cannot be synced to the client`,\n      );\n    } else {\n      const app = appSchema(shardID) + '.';\n      const shard = upstreamSchema(shardID) + '.';\n      const syncedTables = [...tableSpecs.keys()]\n        .filter(t => !t.startsWith(app) && !t.startsWith(shard))\n        .sort()\n        .map(t => `\"${t}\"`)\n        .join(',');\n      const schemaTip =\n        missing.includes('.') && !syncedTables.includes('.')\n          ? ` Note that zero does not sync tables from non-public schemas ` +\n            `by default. Make sure you have defined a custom ` +\n            `ZERO_APP_PUBLICATION to sync tables from non-public schemas.`\n          : '';\n      errors.push(\n        `The \"${missing}\" table does not exist or is not ` +\n          `one of the replicated tables: ${syncedTables}.${schemaTip}`,\n      );\n    }\n  }\n  const tables = intersection(tableSpecs, clientTables);\n  for (const table of toSorted(tables)) {\n    const clientSpec = clientSchema.tables[table];\n    const serverSpec = must(tableSpecs.get(table)); // guaranteed by intersection\n    const fullSpec = must(fullTables.get(table));\n\n    const clientColumns = new Set(Object.keys(clientSpec.columns));\n    const syncedColumns = new Set(Object.keys(serverSpec.zqlSpec));\n    const missingColumns = difference(clientColumns, syncedColumns);\n    for (const missing of toSorted(missingColumns)) {\n      if (fullSpec.columns[missing]) {\n        errors.push(\n          `The \"${table}\".\"${missing}\" column cannot be synced because it ` +\n            `is of an unsupported data type \"${fullSpec.columns[missing].dataType}\"`,\n        );\n      } else {\n        const columns = [...syncedColumns]\n          .filter(c => c !== ZERO_VERSION_COLUMN_NAME)\n          .sort()\n          .map(c => `\"${c}\"`)\n          .join(',');\n\n        errors.push(\n          `The \"${table}\".\"${missing}\" column does not exist ` +\n            `or is not one of the replicated columns: ${columns}.`,\n        );\n      }\n    }\n    const columns = intersection(clientColumns, syncedColumns);\n    for (const column of columns) {\n      const clientType = clientSpec.columns[column].type;\n      const serverType = serverSpec.zqlSpec[column].type;\n      if (clientSpec.columns[column].type !== serverSpec.zqlSpec[column].type) {\n        errors.push(\n          `The \"${table}\".\"${column}\" column's upstream type \"${serverType}\" ` +\n            `does not match the client type \"${clientType}\"`,\n        );\n      }\n    }\n    if (!clientSpec.primaryKey) {\n      errors.push(\n        `The \"${table}\" table's client schema does not specify a primary key.`,\n      );\n    } else {\n      const clientPrimaryKey = new Set(clientSpec.primaryKey);\n      if (\n        !serverSpec.tableSpec.allPotentialPrimaryKeys.some(key =>\n          equals(clientPrimaryKey, new Set(key)),\n        )\n      ) {\n        errors.push(\n          `The \"${table}\" table's primaryKey <${clientSpec.primaryKey.join(',')}> ` +\n            `is not associated with a non-null unique index.`,\n        );\n      }\n    }\n  }\n  if (errors.length) {\n    throw new ProtocolError({\n      kind: 'SchemaVersionNotSupported',\n      message: errors.join('\\n'),\n      origin: ErrorOrigin.ZeroCache,\n    });\n  }\n}\n"],"mappings":";;;;;;;;;AAeA,SAAgB,kBACd,SACA,cACA,YACA,YACA;CACA,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,cAAc;EACtB,MAAM;EACN,SACE;EAEF,QAAQ;CACV,CAAC;CAEH,MAAM,SAAmB,CAAC;CAC1B,MAAM,eAAe,IAAI,IAAI,OAAO,KAAK,aAAa,MAAM,CAAC;CAC7D,MAAM,gBAAgB,WAAW,cAAc,UAAU;CACzD,KAAK,MAAM,WAAW,SAAS,aAAa,GAC1C,IAAI,WAAW,IAAI,OAAO,GAAG;EAC3B,MAAM,YAAY,KAAK,WAAW,IAAI,OAAO,CAAC;EAC9C,MAAM,gCAAgC,UAAU,cAAc,CAAC,GAAG,QAChE,QAAO,CAAC,uBAAuB,UAAU,QAAQ,MAAM,YAAY,EAAE,CACvE;EACA,IAAI,6BAA6B,QAAQ;GACvC,OAAO,KACL,QAAQ,QAAQ,wDACd,6BACG,KACC,QACE,IAAI,IAAI,KAAK,UAAU,QAAQ,MAAM,YAAY,UAAU,EAC/D,EACC,KAAK,IAAI,IACZ,qFACJ;GACA;EACF;EACA,OAAO,KACL,QAAQ,QAAQ,kGAElB;CACF,OAAO;EACL,MAAM,MAAM,UAAU,OAAO,IAAI;EACjC,MAAM,QAAQ,eAAe,OAAO,IAAI;EACxC,MAAM,eAAe,CAAC,GAAG,WAAW,KAAK,CAAC,EACvC,QAAO,MAAK,CAAC,EAAE,WAAW,GAAG,KAAK,CAAC,EAAE,WAAW,KAAK,CAAC,EACtD,KAAK,EACL,KAAI,MAAK,IAAI,EAAE,EAAE,EACjB,KAAK,GAAG;EACX,MAAM,YACJ,QAAQ,SAAS,GAAG,KAAK,CAAC,aAAa,SAAS,GAAG,IAC/C,8KAGA;EACN,OAAO,KACL,QAAQ,QAAQ,iEACmB,aAAa,GAAG,WACrD;CACF;CAEF,MAAM,SAAS,aAAa,YAAY,YAAY;CACpD,KAAK,MAAM,SAAS,SAAS,MAAM,GAAG;EACpC,MAAM,aAAa,aAAa,OAAO;EACvC,MAAM,aAAa,KAAK,WAAW,IAAI,KAAK,CAAC;EAC7C,MAAM,WAAW,KAAK,WAAW,IAAI,KAAK,CAAC;EAE3C,MAAM,gBAAgB,IAAI,IAAI,OAAO,KAAK,WAAW,OAAO,CAAC;EAC7D,MAAM,gBAAgB,IAAI,IAAI,OAAO,KAAK,WAAW,OAAO,CAAC;EAC7D,MAAM,iBAAiB,WAAW,eAAe,aAAa;EAC9D,KAAK,MAAM,WAAW,SAAS,cAAc,GAC3C,IAAI,SAAS,QAAQ,UACnB,OAAO,KACL,QAAQ,MAAM,KAAK,QAAQ,uEACU,SAAS,QAAQ,SAAS,SAAS,EAC1E;OACK;GACL,MAAM,UAAU,CAAC,GAAG,aAAa,EAC9B,QAAO,MAAK,MAAM,wBAAwB,EAC1C,KAAK,EACL,KAAI,MAAK,IAAI,EAAE,EAAE,EACjB,KAAK,GAAG;GAEX,OAAO,KACL,QAAQ,MAAM,KAAK,QAAQ,mEACmB,QAAQ,EACxD;EACF;EAEF,MAAM,UAAU,aAAa,eAAe,aAAa;EACzD,KAAK,MAAM,UAAU,SAAS;GAC5B,MAAM,aAAa,WAAW,QAAQ,QAAQ;GAC9C,MAAM,aAAa,WAAW,QAAQ,QAAQ;GAC9C,IAAI,WAAW,QAAQ,QAAQ,SAAS,WAAW,QAAQ,QAAQ,MACjE,OAAO,KACL,QAAQ,MAAM,KAAK,OAAO,4BAA4B,WAAW,oCAC5B,WAAW,EAClD;EAEJ;EACA,IAAI,CAAC,WAAW,YACd,OAAO,KACL,QAAQ,MAAM,wDAChB;OACK;GACL,MAAM,mBAAmB,IAAI,IAAI,WAAW,UAAU;GACtD,IACE,CAAC,WAAW,UAAU,wBAAwB,MAAK,QACjD,OAAO,kBAAkB,IAAI,IAAI,GAAG,CAAC,CACvC,GAEA,OAAO,KACL,QAAQ,MAAM,wBAAwB,WAAW,WAAW,KAAK,GAAG,EAAE,kDAExE;EAEJ;CACF;CACA,IAAI,OAAO,QACT,MAAM,IAAI,cAAc;EACtB,MAAM;EACN,SAAS,OAAO,KAAK,IAAI;EACzB,QAAQ;CACV,CAAC;AAEL"}
+{"version":3,"file":"client-schema.js","names":["ErrorOrigin.ZeroCache","ErrorKind.ServerOverloaded"],"sources":["../../../../../../zero-cache/src/services/view-syncer/client-schema.ts"],"sourcesContent":["import {toSorted} from '../../../../shared/src/iterables.ts';\nimport {must} from '../../../../shared/src/must.ts';\nimport {\n  difference,\n  equals,\n  intersection,\n} from '../../../../shared/src/set-utils.ts';\nimport type {ClientSchema} from '../../../../zero-protocol/src/client-schema.ts';\nimport {ErrorKind} from '../../../../zero-protocol/src/error-kind.ts';\nimport {ErrorOrigin} from '../../../../zero-protocol/src/error-origin.ts';\nimport {ProtocolError} from '../../../../zero-protocol/src/error.ts';\nimport type {LiteTableSpecWithReplicationStatus} from '../../db/lite-tables.ts';\nimport type {LiteAndZqlSpec} from '../../db/specs.ts';\nimport {liteTypeToZqlValueType} from '../../types/lite.ts';\nimport {appSchema, upstreamSchema, type ShardID} from '../../types/shards.ts';\nimport {ZERO_VERSION_COLUMN_NAME} from '../replicator/schema/constants.ts';\n\n// Backfills can take minutes, so clients waiting for one retry at a slower\n// pace than for a transient connection error.\nconst BACKFILL_MIN_BACKOFF_MS = 5_000;\nconst BACKFILL_MAX_BACKOFF_MS = 30_000;\n\n/**\n * Throws a `SchemaVersionNotSupported` error if the client schema is not\n * compatible with the replica, or a `ServerOverloaded` error (which clients\n * retry with backoff) if the only incompatibilities are tables or columns\n * that are still being backfilled.\n *\n * @param tableSpecsWithBackfills the table specs computed with backfilling\n *     columns included. Permanent incompatibilities are checked against\n *     these, so that a table or column that will not be syncable after its\n *     backfill completes is not reported as retriable. Defaults to\n *     `tableSpecs`, for replicas with nothing being backfilled.\n */\nexport function checkClientSchema(\n  shardID: ShardID,\n  clientSchema: ClientSchema,\n  tableSpecs: Map<string, LiteAndZqlSpec>,\n  fullTables: Map<string, LiteTableSpecWithReplicationStatus>,\n  tableSpecsWithBackfills: Map<string, LiteAndZqlSpec> = tableSpecs,\n) {\n  if (fullTables.size === 0) {\n    throw new ProtocolError({\n      kind: 'Internal',\n      message:\n        `No tables have been synced from upstream. ` +\n        `Please check that the ZERO_UPSTREAM_DB has been properly set.`,\n      origin: ErrorOrigin.ZeroCache,\n    });\n  }\n  const errors = findIncompatibilities(\n    shardID,\n    clientSchema,\n    tableSpecsWithBackfills,\n    fullTables,\n  );\n  if (errors.length) {\n    throw new ProtocolError({\n      kind: 'SchemaVersionNotSupported',\n      message: errors.join('\\n'),\n      origin: ErrorOrigin.ZeroCache,\n    });\n  }\n  const backfilling = findBackfilling(clientSchema, tableSpecs, fullTables);\n  if (backfilling.length) {\n    throw new ProtocolError({\n      kind: ErrorKind.ServerOverloaded,\n      message: backfilling.join('\\n'),\n      minBackoffMs: BACKFILL_MIN_BACKOFF_MS,\n      maxBackoffMs: BACKFILL_MAX_BACKOFF_MS,\n      origin: ErrorOrigin.ZeroCache,\n    });\n  }\n}\n\nfunction findBackfilling(\n  clientSchema: ClientSchema,\n  tableSpecs: Map<string, LiteAndZqlSpec>,\n  fullTables: Map<string, LiteTableSpecWithReplicationStatus>,\n): string[] {\n  const backfilling: string[] = [];\n  for (const table of toSorted(Object.keys(clientSchema.tables))) {\n    const columns = fullTables.get(table)?.backfilling;\n    if (!columns?.length) {\n      continue;\n    }\n    if (!tableSpecs.has(table)) {\n      backfilling.push(`The \"${table}\" table is being backfilled.`);\n      continue;\n    }\n    for (const column of toSorted(\n      Object.keys(clientSchema.tables[table].columns),\n    )) {\n      if (columns.includes(column)) {\n        backfilling.push(\n          `The \"${table}\".\"${column}\" column is being backfilled.`,\n        );\n      }\n    }\n  }\n  return backfilling;\n}\n\nfunction findIncompatibilities(\n  shardID: ShardID,\n  clientSchema: ClientSchema,\n  tableSpecs: Map<string, LiteAndZqlSpec>,\n  fullTables: Map<string, LiteTableSpecWithReplicationStatus>,\n): string[] {\n  const errors: string[] = [];\n  const clientTables = new Set(Object.keys(clientSchema.tables));\n  const missingTables = difference(clientTables, tableSpecs);\n  for (const missing of toSorted(missingTables)) {\n    if (fullTables.has(missing)) {\n      const fullTable = must(fullTables.get(missing));\n      const unsupportedPrimaryKeyColumns = (fullTable.primaryKey ?? []).filter(\n        col => !liteTypeToZqlValueType(fullTable.columns[col]?.dataType ?? ''),\n      );\n      if (unsupportedPrimaryKeyColumns.length) {\n        errors.push(\n          `The \"${missing}\" table's primary key contains unsupported columns: ` +\n            unsupportedPrimaryKeyColumns\n              .map(\n                col =>\n                  `\"${col}\" (${fullTable.columns[col]?.dataType ?? 'unknown'})`,\n              )\n              .join(', ') +\n            `. These columns must use Zero-supported data types to sync the table to the client.`,\n        );\n        continue;\n      }\n      errors.push(\n        `The \"${missing}\" table is missing a primary key or non-null ` +\n          `unique index and thus cannot be synced to the client`,\n      );\n    } else {\n      const app = appSchema(shardID) + '.';\n      const shard = upstreamSchema(shardID) + '.';\n      const syncedTables = [...tableSpecs.keys()]\n        .filter(t => !t.startsWith(app) && !t.startsWith(shard))\n        .sort()\n        .map(t => `\"${t}\"`)\n        .join(',');\n      const schemaTip =\n        missing.includes('.') && !syncedTables.includes('.')\n          ? ` Note that zero does not sync tables from non-public schemas ` +\n            `by default. Make sure you have defined a custom ` +\n            `ZERO_APP_PUBLICATION to sync tables from non-public schemas.`\n          : '';\n      errors.push(\n        `The \"${missing}\" table does not exist or is not ` +\n          `one of the replicated tables: ${syncedTables}.${schemaTip}`,\n      );\n    }\n  }\n  const tables = intersection(tableSpecs, clientTables);\n  for (const table of toSorted(tables)) {\n    const clientSpec = clientSchema.tables[table];\n    const serverSpec = must(tableSpecs.get(table)); // guaranteed by intersection\n    const fullSpec = must(fullTables.get(table));\n\n    const clientColumns = new Set(Object.keys(clientSpec.columns));\n    const syncedColumns = new Set(Object.keys(serverSpec.zqlSpec));\n    const missingColumns = difference(clientColumns, syncedColumns);\n    for (const missing of toSorted(missingColumns)) {\n      if (fullSpec.columns[missing]) {\n        errors.push(\n          `The \"${table}\".\"${missing}\" column cannot be synced because it ` +\n            `is of an unsupported data type \"${fullSpec.columns[missing].dataType}\"`,\n        );\n      } else {\n        const columns = [...syncedColumns]\n          .filter(c => c !== ZERO_VERSION_COLUMN_NAME)\n          .sort()\n          .map(c => `\"${c}\"`)\n          .join(',');\n\n        errors.push(\n          `The \"${table}\".\"${missing}\" column does not exist ` +\n            `or is not one of the replicated columns: ${columns}.`,\n        );\n      }\n    }\n    const columns = intersection(clientColumns, syncedColumns);\n    for (const column of columns) {\n      const clientType = clientSpec.columns[column].type;\n      const serverType = serverSpec.zqlSpec[column].type;\n      if (clientSpec.columns[column].type !== serverSpec.zqlSpec[column].type) {\n        errors.push(\n          `The \"${table}\".\"${column}\" column's upstream type \"${serverType}\" ` +\n            `does not match the client type \"${clientType}\"`,\n        );\n      }\n    }\n    if (!clientSpec.primaryKey) {\n      errors.push(\n        `The \"${table}\" table's client schema does not specify a primary key.`,\n      );\n    } else {\n      const clientPrimaryKey = new Set(clientSpec.primaryKey);\n      if (\n        !serverSpec.tableSpec.allPotentialPrimaryKeys.some(key =>\n          equals(clientPrimaryKey, new Set(key)),\n        )\n      ) {\n        errors.push(\n          `The \"${table}\" table's primaryKey <${clientSpec.primaryKey.join(',')}> ` +\n            `is not associated with a non-null unique index.`,\n        );\n      }\n    }\n  }\n  return errors;\n}\n"],"mappings":";;;;;;;;;;AAmBA,IAAM,0BAA0B;AAChC,IAAM,0BAA0B;;;;;;;;;;;;;AAchC,SAAgB,kBACd,SACA,cACA,YACA,YACA,0BAAuD,YACvD;CACA,IAAI,WAAW,SAAS,GACtB,MAAM,IAAI,cAAc;EACtB,MAAM;EACN,SACE;EAEF,QAAQA;CACV,CAAC;CAEH,MAAM,SAAS,sBACb,SACA,cACA,yBACA,UACF;CACA,IAAI,OAAO,QACT,MAAM,IAAI,cAAc;EACtB,MAAM;EACN,SAAS,OAAO,KAAK,IAAI;EACzB,QAAQA;CACV,CAAC;CAEH,MAAM,cAAc,gBAAgB,cAAc,YAAY,UAAU;CACxE,IAAI,YAAY,QACd,MAAM,IAAI,cAAc;EACtB,MAAMC;EACN,SAAS,YAAY,KAAK,IAAI;EAC9B,cAAc;EACd,cAAc;EACd,QAAQD;CACV,CAAC;AAEL;AAEA,SAAS,gBACP,cACA,YACA,YACU;CACV,MAAM,cAAwB,CAAC;CAC/B,KAAK,MAAM,SAAS,SAAS,OAAO,KAAK,aAAa,MAAM,CAAC,GAAG;EAC9D,MAAM,UAAU,WAAW,IAAI,KAAK,CAAC,EAAE;EACvC,IAAI,CAAC,SAAS,QACZ;EAEF,IAAI,CAAC,WAAW,IAAI,KAAK,GAAG;GAC1B,YAAY,KAAK,QAAQ,MAAM,6BAA6B;GAC5D;EACF;EACA,KAAK,MAAM,UAAU,SACnB,OAAO,KAAK,aAAa,OAAO,MAAM,CAAC,OAAO,CAChD,GACE,IAAI,QAAQ,SAAS,MAAM,GACzB,YAAY,KACV,QAAQ,MAAM,KAAK,OAAO,8BAC5B;CAGN;CACA,OAAO;AACT;AAEA,SAAS,sBACP,SACA,cACA,YACA,YACU;CACV,MAAM,SAAmB,CAAC;CAC1B,MAAM,eAAe,IAAI,IAAI,OAAO,KAAK,aAAa,MAAM,CAAC;CAC7D,MAAM,gBAAgB,WAAW,cAAc,UAAU;CACzD,KAAK,MAAM,WAAW,SAAS,aAAa,GAC1C,IAAI,WAAW,IAAI,OAAO,GAAG;EAC3B,MAAM,YAAY,KAAK,WAAW,IAAI,OAAO,CAAC;EAC9C,MAAM,gCAAgC,UAAU,cAAc,CAAC,EAAA,CAAG,QAChE,QAAO,CAAC,uBAAuB,UAAU,QAAQ,IAAI,EAAE,YAAY,EAAE,CACvE;EACA,IAAI,6BAA6B,QAAQ;GACvC,OAAO,KACL,QAAQ,QAAQ,wDACd,6BACG,KACC,QACE,IAAI,IAAI,KAAK,UAAU,QAAQ,IAAI,EAAE,YAAY,UAAU,EAC/D,CAAC,CACA,KAAK,IAAI,IACZ,qFACJ;GACA;EACF;EACA,OAAO,KACL,QAAQ,QAAQ,kGAElB;CACF,OAAO;EACL,MAAM,MAAM,UAAU,OAAO,IAAI;EACjC,MAAM,QAAQ,eAAe,OAAO,IAAI;EACxC,MAAM,eAAe,CAAC,GAAG,WAAW,KAAK,CAAC,CAAC,CACxC,QAAO,MAAK,CAAC,EAAE,WAAW,GAAG,KAAK,CAAC,EAAE,WAAW,KAAK,CAAC,CAAC,CACvD,KAAK,CAAC,CACN,KAAI,MAAK,IAAI,EAAE,EAAE,CAAC,CAClB,KAAK,GAAG;EACX,MAAM,YACJ,QAAQ,SAAS,GAAG,KAAK,CAAC,aAAa,SAAS,GAAG,IAC/C,8KAGA;EACN,OAAO,KACL,QAAQ,QAAQ,iEACmB,aAAa,GAAG,WACrD;CACF;CAEF,MAAM,SAAS,aAAa,YAAY,YAAY;CACpD,KAAK,MAAM,SAAS,SAAS,MAAM,GAAG;EACpC,MAAM,aAAa,aAAa,OAAO;EACvC,MAAM,aAAa,KAAK,WAAW,IAAI,KAAK,CAAC;EAC7C,MAAM,WAAW,KAAK,WAAW,IAAI,KAAK,CAAC;EAE3C,MAAM,gBAAgB,IAAI,IAAI,OAAO,KAAK,WAAW,OAAO,CAAC;EAC7D,MAAM,gBAAgB,IAAI,IAAI,OAAO,KAAK,WAAW,OAAO,CAAC;EAC7D,MAAM,iBAAiB,WAAW,eAAe,aAAa;EAC9D,KAAK,MAAM,WAAW,SAAS,cAAc,GAC3C,IAAI,SAAS,QAAQ,UACnB,OAAO,KACL,QAAQ,MAAM,KAAK,QAAQ,uEACU,SAAS,QAAQ,QAAQ,CAAC,SAAS,EAC1E;OACK;GACL,MAAM,UAAU,CAAC,GAAG,aAAa,CAAC,CAC/B,QAAO,MAAK,MAAM,wBAAwB,CAAC,CAC3C,KAAK,CAAC,CACN,KAAI,MAAK,IAAI,EAAE,EAAE,CAAC,CAClB,KAAK,GAAG;GAEX,OAAO,KACL,QAAQ,MAAM,KAAK,QAAQ,mEACmB,QAAQ,EACxD;EACF;EAEF,MAAM,UAAU,aAAa,eAAe,aAAa;EACzD,KAAK,MAAM,UAAU,SAAS;GAC5B,MAAM,aAAa,WAAW,QAAQ,OAAO,CAAC;GAC9C,MAAM,aAAa,WAAW,QAAQ,OAAO,CAAC;GAC9C,IAAI,WAAW,QAAQ,OAAO,CAAC,SAAS,WAAW,QAAQ,OAAO,CAAC,MACjE,OAAO,KACL,QAAQ,MAAM,KAAK,OAAO,4BAA4B,WAAW,oCAC5B,WAAW,EAClD;EAEJ;EACA,IAAI,CAAC,WAAW,YACd,OAAO,KACL,QAAQ,MAAM,wDAChB;OACK;GACL,MAAM,mBAAmB,IAAI,IAAI,WAAW,UAAU;GACtD,IACE,CAAC,WAAW,UAAU,wBAAwB,MAAK,QACjD,OAAO,kBAAkB,IAAI,IAAI,GAAG,CAAC,CACvC,GAEA,OAAO,KACL,QAAQ,MAAM,wBAAwB,WAAW,WAAW,KAAK,GAAG,EAAE,kDAExE;EAEJ;CACF;CACA,OAAO;AACT"}