@azure/cosmos 4.3.0 → 4.4.0

package/dist/browser/bulk/Limiter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Limiter.js","sourceRoot":"","sources":["../../../src/bulk/Limiter.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAevD,MAAM,QAAQ;IAIZ,YAAY,KAAQ;QAFb,SAAI,GAAuB,IAAI,CAAC;QAChC,SAAI,GAAuB,IAAI,CAAC;QAErC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;CACF;AAED,MAAM,gBAAgB;IAAtB;QACS,SAAI,GAAuB,IAAI,CAAC;QAChC,SAAI,GAAuB,IAAI,CAAC;QAChC,WAAM,GAAG,CAAC,CAAC;IAoCpB,CAAC;IAlCQ,IAAI,CAAC,KAAQ;QAClB,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEM,KAAK;QACV,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;QAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAC3B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,KAAK;QACV,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAEM,OAAO;QACZ,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAC3B,CAAC;CACF;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,EAAc;IACtC,IAAI,OAAO,OAAO,KAAK,WAAW,IAAI,OAAO,OAAO,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;QAC7E,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;SAAM,IAAI,OAAO,YAAY,KAAK,UAAU,EAAE,CAAC;QAC9C,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;SAAM,CAAC;QACN,mDAAmD;QACnD,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,OAAO,YAAY;IAsBvB;;OAEG;IACH,YACE,WAAmB,EACnB,eAAgC,EAChC,OAAsB,EACtB,6BAAqE;QA1BvE,sCAAsC;QAC9B,YAAO,GAAG,CAAC,CAAC;QACpB,uFAAuF;QAC/E,UAAK,GAAgC,IAAI,gBAAgB,EAAE,CAAC;QACpE,4EAA4E;QACpE,eAAU,GAAG,KAAK,CAAC;QAG3B,sFAAsF;QAC9E,cAAS,GAAG,KAAK,CAAC;QAC1B,4FAA4F;QACpF,eAAU,GAAG,KAAK,CAAC;QAOnB,+BAA0B,GAA8B,SAAS,CAAC;QAUxE,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,6BAA6B,GAAG,6BAA6B,CAAC;IACrE,CAAC;IAED;;;OAGG;IACI,IAAI,CAAC,OAAgB;QAC1B,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;YACpC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC,CAAC;YAC1E,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,IAAI,OAAO,CAAM,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YAC1C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;YAC9C,IAAI,CAAC,eAAe,EAAE,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,aAAa,CACxB,WAAc,EACd,cAAuC;QAEvC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,eAAe,GAAG,WAAW,CAAC;QACnC,MAAM,cAAc,GAAoB,EAAE,CAAC;QAC3C,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACrC,IAAI,CAAC,SAAS;gBAAE,MAAM;YACtB,IAAI,WAAW,KAAK,WAAW,CAAC,IAAI,EAAE,CAAC;gBACrC,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;gBACrD,cAAc,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;YACrC,CAAC;YACD,SAAS,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,WAAW,KAAK,WAAW,CAAC,IAAI,EAAE,CAAC;YACrC,gGAAgG;YAChG,+GAA+G;YAC/G,gCAAgC;YAChC,IAAI,IAAI,CAAC,0BAA0B,EAAE,CAAC;gBACpC,MAAM,IAAI,CAAC,0BAA0B,CAAC;YACxC,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,0BAA0B,GAAG,IAAI,CAAC,6BAA6B,CAAC,cAAc,CAAC,CAAC;gBACrF,MAAM,IAAI,CAAC,0BAA0B,CAAC;YACxC,CAAC;YACD,KAAK,MAAM,SAAS,IAAI,cAAc,EAAE,CAAC;gBACvC,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,eAAe;QACrB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU;YAAE,OAAO;QACjE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,gBAAgB,CAAC,GAAG,EAAE;YACpB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,OAAO;QACb,IAAI,IAAI,CAAC,UAAU;YAAE,OAAO;QAC5B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QAEvB,IAAI,CAAC;YACH,OAAO,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBACpF,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;gBACrC,IAAI,CAAC,SAAS;oBAAE,MAAM;gBAEtB,IAAI,CAAC,OAAO,EAAE,CAAC;gBAEf,gCAAgC;gBAChC,IAAI,eAA6B,CAAC;gBAClC,IAAI,CAAC;oBACH,eAAe,GAAG,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBACrE,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,4BAA4B;oBAC5B,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBACtB,IAAI,CAAC,OAAO,EAAE,CAAC;oBACf,SAAS;gBACX,CAAC;gBAED,KAAK,eAAe;oBAClB,iDAAiD;qBAChD,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE;oBACf,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC5B,CAAC,CAAC;qBACD,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;oBACb,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACxB,CAAC,CAAC;qBACD,OAAO,CAAC,GAAG,EAAE;oBACZ,IAAI,CAAC,OAAO,EAAE,CAAC;oBACf,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;wBACjF,IAAI,CAAC,eAAe,EAAE,CAAC;oBACzB,CAAC;gBACH,CAAC,CAAC,CAAC;YACP,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,4CAA4C,EAAE,GAAG,CAAC,CAAC;QACnE,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QAC1B,CAAC;IACH,CAAC;IAED;;OAEG;IACI,cAAc,CAAC,cAAsB;QAC1C,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,CAAC,WAAW,GAAG,cAAc,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACxD,kDAAkD;YAClD,IAAI,CAAC,eAAe,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { StatusCodes } from \"../common/statusCodes.js\";\nimport type { DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport type { RetryCallback } from \"../utils/batch.js\";\nimport type { Batcher } from \"./Batcher.js\";\nimport type { PartitionMetric } from \"./PartitionMetric.js\";\nimport type { ItemOperation } from \"./ItemOperation.js\";\n\nexport type Task<T = any> = () => Promise<T>;\n\ninterface QueueItem {\n  batcher: Batcher;\n  resolve: (value: any) => void;\n  reject: (reason?: any) => void;\n}\n\nclass ListNode<T> {\n  public value: T;\n  public next: ListNode<T> | null = null;\n  public prev: ListNode<T> | null = null;\n  constructor(value: T) {\n    this.value = value;\n  }\n}\n\nclass DoublyLinkedList<T> {\n  public head: ListNode<T> | null = null;\n  public tail: ListNode<T> | null = null;\n  public length = 0;\n\n  public push(value: T): void {\n    const node = new ListNode(value);\n    if (!this.head) {\n      this.head = this.tail = node;\n    } else {\n      this.tail!.next = node;\n      node.prev = this.tail;\n      this.tail = node;\n    }\n    this.length++;\n  }\n\n  public shift(): T | null {\n    if (!this.head) return null;\n    const value = this.head.value;\n    this.head = this.head.next;\n    if (this.head) {\n      this.head.prev = null;\n    } else {\n      this.tail = null;\n    }\n    this.length--;\n    return value;\n  }\n\n  public clear(): void {\n    this.head = null;\n    this.tail = null;\n    this.length = 0;\n  }\n\n  public isEmpty(): boolean {\n    return this.length === 0;\n  }\n}\n\n/**\n * Returns a function that will schedule the given callback using the best available method.\n */\nfunction scheduleCallback(fn: () => void): void {\n  if (typeof process !== \"undefined\" && typeof process.nextTick === \"function\") {\n    process.nextTick(fn);\n  } else if (typeof setImmediate === \"function\") {\n    setImmediate(fn);\n  } else {\n    // eslint-disable-next-line promise/catch-or-return\n    Promise.resolve().then(fn);\n  }\n}\n\n/**\n * HighPerformanceQueue processes tasks concurrently.\n * If pauseAndClear() is called, it permanently halts processing,\n * clears queued tasks (resolving them with a custom value), and\n * any subsequent push() calls will immediately resolve with that value.\n */\nexport class LimiterQueue {\n  // maximum number of tasks allowed to run concurrently\n  public concurrency: number;\n  // number of tasks currently executing\n  private running = 0;\n  // doubly linked list to store batchers and resolve/reject functions for dispatch tasks\n  private tasks: DoublyLinkedList<QueueItem> = new DoublyLinkedList();\n  // boolean flag that indicates whether the queue has been permanently paused\n  private terminated = false;\n  // value to resolve with when the queue is terminated\n  private terminatedValue: any;\n  // indicates if the processing cycle has been scheduled via the asynchronous scheduler\n  private scheduled = false;\n  // indicates whether the queue is currently in the process of dequeueing and executing tasks\n  private processing = false;\n  // retry callback to retry all the queued operations in case of split/merge error\n  private retrier: RetryCallback;\n  // partiton metric for collecting metrics for the requests\n  private partitionMetric: PartitionMetric;\n  // callback used to refresh the partition key range cache in case of split/merge error\n  private readonly refreshPartitionKeyRangeCache: (diagnosticNode: any) => Promise<void>;\n  private refreshPKRangeCachePromise: Promise<void> | undefined = undefined;\n  /**\n   * Creates a new HighPerformanceQueue.\n   */\n  constructor(\n    concurrency: number,\n    partitionMetric: PartitionMetric,\n    retrier: RetryCallback,\n    refreshPartitionKeyRangeCache: (diagnosticNode: any) => Promise<void>,\n  ) {\n    this.concurrency = concurrency;\n    this.partitionMetric = partitionMetric;\n    this.retrier = retrier;\n    this.refreshPartitionKeyRangeCache = refreshPartitionKeyRangeCache;\n  }\n\n  /**\n   * Enqueue a task and return a Promise that resolves or rejects when the task completes.\n   * If the queue has been terminated via pauseAndClear, the promise resolves immediately with the terminated value.\n   */\n  public push(batcher: Batcher): Promise<any> {\n    if (this.terminated) {\n      const ops = batcher.getOperations();\n      ops.forEach((op) => this.retrier(op, op.operationContext.diagnosticNode));\n      return Promise.resolve(this.terminatedValue);\n    }\n    return new Promise<any>((resolve, reject) => {\n      this.tasks.push({ batcher, resolve, reject });\n      this.scheduleProcess();\n    });\n  }\n\n  /**\n   * Permanently pauses processing and clears the queue.\n   * All queued tasks and subsequent push() calls will immediately resolve with the provided custom value.\n   */\n  public async pauseAndClear<T = any>(\n    customValue: T,\n    diagnosticNode?: DiagnosticNodeInternal,\n  ): Promise<void> {\n    this.terminated = true;\n    this.terminatedValue = customValue;\n    const operationsList: ItemOperation[] = [];\n    while (!this.tasks.isEmpty()) {\n      const queueItem = this.tasks.shift();\n      if (!queueItem) break;\n      if (customValue === StatusCodes.Gone) {\n        const operations = queueItem.batcher.getOperations();\n        operationsList.push(...operations);\n      }\n      queueItem.resolve(customValue);\n    }\n    if (customValue === StatusCodes.Gone) {\n      // Multiple requests could result in 410 error for one partition based on degree of concurrency.\n      // The refreshPKRangeCachePromise is added to ensure that only one refreshPartitionKeyRangeCache() call is made\n      // to backend for one partition.\n      if (this.refreshPKRangeCachePromise) {\n        await this.refreshPKRangeCachePromise;\n      } else {\n        this.refreshPKRangeCachePromise = this.refreshPartitionKeyRangeCache(diagnosticNode);\n        await this.refreshPKRangeCachePromise;\n      }\n      for (const operation of operationsList) {\n        await this.retrier(operation, operation.operationContext.diagnosticNode);\n      }\n    }\n  }\n\n  /**\n   * Schedules the processing loop using the best available asynchronous scheduler.\n   */\n  private scheduleProcess(): void {\n    if (this.scheduled || this.processing || this.terminated) return;\n    this.scheduled = true;\n    scheduleCallback(() => {\n      this.scheduled = false;\n      this.process();\n    });\n  }\n\n  /**\n   * Processes tasks up to the concurrency limit.\n   */\n  private process(): void {\n    if (this.terminated) return;\n    this.processing = true;\n\n    try {\n      while (!this.terminated && this.running < this.concurrency && !this.tasks.isEmpty()) {\n        const queueItem = this.tasks.shift();\n        if (!queueItem) break;\n\n        this.running++;\n\n        // Handle synchronous exceptions\n        let dispatchPromise: Promise<any>;\n        try {\n          dispatchPromise = queueItem.batcher.dispatch(this.partitionMetric);\n        } catch (err) {\n          // Handle synchronous errors\n          queueItem.reject(err);\n          this.running--;\n          continue;\n        }\n\n        void dispatchPromise\n          // eslint-disable-next-line promise/always-return\n          .then((result) => {\n            queueItem.resolve(result);\n          })\n          .catch((err) => {\n            queueItem.reject(err);\n          })\n          .finally(() => {\n            this.running--;\n            if (!this.terminated && this.running < this.concurrency && !this.tasks.isEmpty()) {\n              this.scheduleProcess();\n            }\n          });\n      }\n    } catch (err) {\n      console.error(\"Unexpected error in task queue processing:\", err);\n    } finally {\n      this.processing = false;\n    }\n  }\n\n  /**\n   * Dynamically updates the concurrency limit.\n   */\n  public setConcurrency(newConcurrency: number): void {\n    if (newConcurrency < 1) {\n      throw new Error(\"Concurrency must be at least 1\");\n    }\n    this.concurrency = newConcurrency;\n    if (!this.terminated && this.running < this.concurrency) {\n      // Use the scheduleCallback helper for consistency\n      this.scheduleProcess();\n    }\n  }\n}\n"]}

package/dist/browser/bulk/PartitionMetric.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Captures the metrics for the requests made for bulk.
+ */
+export declare class PartitionMetric {
+    numberOfItemsOperatedOn: number;
+    timeTakenInMs: number;
+    numberOfThrottles: number;
+    private semaphore;
+    constructor();
+    add(numberOfDoc: number, timeTakenInMs: number, numOfThrottles: number): void;
+}
+//# sourceMappingURL=PartitionMetric.d.ts.map

package/dist/browser/bulk/PartitionMetric.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PartitionMetric.d.ts","sourceRoot":"","sources":["../../../src/bulk/PartitionMetric.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,qBAAa,eAAe;IAC1B,uBAAuB,EAAE,MAAM,CAAC;IAChC,aAAa,EAAE,MAAM,CAAC;IACtB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,OAAO,CAAC,SAAS,CAAsB;;IASvC,GAAG,CAAC,WAAW,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,IAAI;CAY9E"}

package/dist/browser/bulk/PartitionMetric.js

@@ -0,0 +1,28 @@
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+import semaphore from "semaphore";
+/**
+ * Captures the metrics for the requests made for bulk.
+ */
+export class PartitionMetric {
+    constructor() {
+        this.numberOfItemsOperatedOn = 0;
+        this.timeTakenInMs = 0;
+        this.numberOfThrottles = 0;
+        this.semaphore = semaphore(1);
+    }
+    add(numberOfDoc, timeTakenInMs, numOfThrottles) {
+        // these operations should be atomic as multiple dispatch could be updating these values
+        this.semaphore.take(() => {
+            try {
+                this.numberOfItemsOperatedOn += numberOfDoc;
+                this.timeTakenInMs += timeTakenInMs;
+                this.numberOfThrottles += numOfThrottles;
+            }
+            finally {
+                this.semaphore.leave();
+            }
+        });
+    }
+}
+//# sourceMappingURL=PartitionMetric.js.map

package/dist/browser/bulk/PartitionMetric.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PartitionMetric.js","sourceRoot":"","sources":["../../../src/bulk/PartitionMetric.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC,OAAO,SAAS,MAAM,WAAW,CAAC;AAElC;;GAEG;AACH,MAAM,OAAO,eAAe;IAM1B;QACE,IAAI,CAAC,uBAAuB,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,GAAG,CAAC,WAAmB,EAAE,aAAqB,EAAE,cAAsB;QACpE,wFAAwF;QACxF,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE;YACvB,IAAI,CAAC;gBACH,IAAI,CAAC,uBAAuB,IAAI,WAAW,CAAC;gBAC5C,IAAI,CAAC,aAAa,IAAI,aAAa,CAAC;gBACpC,IAAI,CAAC,iBAAiB,IAAI,cAAc,CAAC;YAC3C,CAAC;oBAAS,CAAC;gBACT,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;YACzB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport semaphore from \"semaphore\";\n\n/**\n * Captures the metrics for the requests made for bulk.\n */\nexport class PartitionMetric {\n  numberOfItemsOperatedOn: number;\n  timeTakenInMs: number;\n  numberOfThrottles: number;\n  private semaphore: semaphore.Semaphore;\n\n  constructor() {\n    this.numberOfItemsOperatedOn = 0;\n    this.timeTakenInMs = 0;\n    this.numberOfThrottles = 0;\n    this.semaphore = semaphore(1);\n  }\n\n  add(numberOfDoc: number, timeTakenInMs: number, numOfThrottles: number): void {\n    // these operations should be atomic as multiple dispatch could be updating these values\n    this.semaphore.take(() => {\n      try {\n        this.numberOfItemsOperatedOn += numberOfDoc;\n        this.timeTakenInMs += timeTakenInMs;\n        this.numberOfThrottles += numOfThrottles;\n      } finally {\n        this.semaphore.leave();\n      }\n    });\n  }\n}\n"]}

package/dist/browser/bulk/index.d.ts

@@ -0,0 +1,4 @@
+export { ItemOperationContext } from "./ItemOperationContext.js";
+export { ItemOperation } from "./ItemOperation.js";
+export { BulkResponse } from "./BulkResponse.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/browser/bulk/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/bulk/index.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AACjE,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/browser/bulk/index.js

@@ -0,0 +1,5 @@
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+export { ItemOperationContext } from "./ItemOperationContext.js";
+export { BulkResponse } from "./BulkResponse.js";
+//# sourceMappingURL=index.js.map

package/dist/browser/bulk/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/bulk/index.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAEjE,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nexport { ItemOperationContext } from \"./ItemOperationContext.js\";\nexport { ItemOperation } from \"./ItemOperation.js\";\nexport { BulkResponse } from \"./BulkResponse.js\";\n"]}

package/dist/browser/client/ChangeFeed/ChangeFeedForEpkRange.d.ts

@@ -0,0 +1,74 @@
+import { ChangeFeedIteratorResponse } from "./ChangeFeedIteratorResponse.js";
+import type { Resource } from "../../client/index.js";
+import type { ChangeFeedPullModelIterator } from "./ChangeFeedPullModelIterator.js";
+/**
+ * @hidden
+ * Provides iterator for change feed for entire container or an epk range.
+ *
+ * Use `Items.getChangeFeedIterator()` to get an instance of the iterator.
+ */
+export declare class ChangeFeedForEpkRange<T> implements ChangeFeedPullModelIterator<T> {
+    private clientContext;
+    private container;
+    private partitionKeyRangeCache;
+    private resourceId;
+    private resourceLink;
+    private url;
+    private changeFeedOptions;
+    private epkRange;
+    private continuationToken?;
+    private queue;
+    private startTime;
+    private isInstantiated;
+    private rId;
+    private startFromNow;
+    private setIteratorRid;
+    private continuationTokenRidMatchContainerRid;
+    private fillChangeFeedQueue;
+    /**
+     * Fill the queue with the feed ranges overlapping with the given epk range.
+     */
+    private fetchOverLappingFeedRanges;
+    /**
+     * Fill the queue with feed ranges from continuation token
+     */
+    private fetchContinuationTokenFeedRanges;
+    /**
+     * Change feed is an infinite feed. hasMoreResults is always true.
+     */
+    get hasMoreResults(): boolean;
+    /**
+     * Gets an async iterator which will yield change feed results.
+     */
+    getAsyncIterator(): AsyncIterable<ChangeFeedIteratorResponse<Array<T & Resource>>>;
+    /**
+     * Gets an async iterator which will yield pages of results from Azure Cosmos DB.
+     *
+     * Keeps iterating over the feedranges and checks if any feed range has new result. Keeps note of the last feed range which returned non 304 result.
+     *
+     * When same feed range is reached and no new changes are found, a 304 (not Modified) is returned to the end user. Then starts process all over again.
+     */
+    readNext(): Promise<ChangeFeedIteratorResponse<Array<T & Resource>>>;
+    private generateContinuationToken;
+    /**
+     * Read feed and retrieves the next page of results in Azure Cosmos DB.
+     */
+    private fetchNext;
+    private checkedAllFeedRanges;
+    /**
+     * Checks whether the current EpkRange is split into multiple ranges or not.
+     *
+     * If yes, it force refreshes the partitionKeyRange cache and enqueue children epk ranges.
+     */
+    private shouldRetryOnFailure;
+    private handleSplitOrMerge;
+    /**
+     * Fetch the partitionKeyRangeId for the given feed range.
+     *
+     * This partitionKeyRangeId is passed to queryFeed to fetch the results.
+     */
+    private getPartitionRangeId;
+    private getFeedResponse;
+    private fetchFinalFeedRange;
+}
+//# sourceMappingURL=ChangeFeedForEpkRange.d.ts.map

package/dist/browser/client/ChangeFeed/ChangeFeedForEpkRange.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ChangeFeedForEpkRange.d.ts","sourceRoot":"","sources":["../../../../src/client/ChangeFeed/ChangeFeedForEpkRange.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,0BAA0B,EAAE,MAAM,iCAAiC,CAAC;AAK7E,OAAO,KAAK,EAAa,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAKjE,OAAO,KAAK,EAAE,2BAA2B,EAAE,MAAM,kCAAkC,CAAC;AAMpF;;;;;GAKG;AACH,qBAAa,qBAAqB,CAAC,CAAC,CAAE,YAAW,2BAA2B,CAAC,CAAC,CAAC;IAW3E,OAAO,CAAC,aAAa;IACrB,OAAO,CAAC,SAAS;IACjB,OAAO,CAAC,sBAAsB;IAC9B,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,YAAY;IACpB,OAAO,CAAC,GAAG;IACX,OAAO,CAAC,iBAAiB;IACzB,OAAO,CAAC,QAAQ;IAjBlB,OAAO,CAAC,iBAAiB,CAAC,CAA6B;IACvD,OAAO,CAAC,KAAK,CAAkC;IAC/C,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,cAAc,CAAU;IAChC,OAAO,CAAC,GAAG,CAAS;IACpB,OAAO,CAAC,YAAY,CAAU;YA2BhB,cAAc;IAK5B,OAAO,CAAC,qCAAqC;YAO/B,mBAAmB;IAWjC;;OAEG;YACW,0BAA0B;IAyBxC;;OAEG;YACW,gCAAgC;IAwC9C;;OAEG;IACH,IAAI,cAAc,IAAI,OAAO,CAE5B;IAED;;OAEG;IACW,gBAAgB,IAAI,aAAa,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAOhG;;;;;;OAMG;IACU,QAAQ,IAAI,OAAO,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IA+CjF,OAAO,CAAC,yBAAyB,CAE/B;IAEF;;OAEG;YACW,SAAS;IA+BvB,OAAO,CAAC,oBAAoB;IAa5B;;;;OAIG;YACW,oBAAoB;YAgDpB,kBAAkB;IA2ChC;;;;OAIG;YACW,mBAAmB;YA4BnB,eAAe;IAwF7B,OAAO,CAAC,mBAAmB;CAU5B"}

package/dist/browser/client/ChangeFeed/ChangeFeedForEpkRange.js

@@ -0,0 +1,363 @@
+import { __asyncGenerator, __await } from "tslib";
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+import { ChangeFeedRange } from "./ChangeFeedRange.js";
+import { ChangeFeedIteratorResponse } from "./ChangeFeedIteratorResponse.js";
+import { QueryRange } from "../../routing/index.js";
+import { FeedRangeQueue } from "./FeedRangeQueue.js";
+import { Constants, SubStatusCodes, StatusCodes, ResourceType } from "../../common/index.js";
+import { ErrorResponse } from "../../request/index.js";
+import { CompositeContinuationToken } from "./CompositeContinuationToken.js";
+import { decryptChangeFeedResponse, extractOverlappingRanges } from "./changeFeedUtils.js";
+import { getEmptyCosmosDiagnostics, withDiagnostics } from "../../utils/diagnostics.js";
+import { ChangeFeedMode } from "./ChangeFeedMode.js";
+/**
+ * @hidden
+ * Provides iterator for change feed for entire container or an epk range.
+ *
+ * Use `Items.getChangeFeedIterator()` to get an instance of the iterator.
+ */
+export class ChangeFeedForEpkRange {
+    /**
+     * @internal
+     */
+    constructor(clientContext, container, partitionKeyRangeCache, resourceId, resourceLink, url, changeFeedOptions, epkRange) {
+        this.clientContext = clientContext;
+        this.container = container;
+        this.partitionKeyRangeCache = partitionKeyRangeCache;
+        this.resourceId = resourceId;
+        this.resourceLink = resourceLink;
+        this.url = url;
+        this.changeFeedOptions = changeFeedOptions;
+        this.epkRange = epkRange;
+        this.generateContinuationToken = () => {
+            return JSON.stringify(new CompositeContinuationToken(this.rId, this.queue.returnSnapshot()));
+        };
+        this.queue = new FeedRangeQueue();
+        this.continuationToken = changeFeedOptions.continuationToken
+            ? JSON.parse(changeFeedOptions.continuationToken)
+            : undefined;
+        this.isInstantiated = false;
+        // startTime is used to store and specify time from which change feed should start reading new changes. StartFromNow flag is used to indicate fetching changes from now.
+        if (changeFeedOptions.startFromNow) {
+            this.startFromNow = true;
+        }
+        else if (changeFeedOptions.startTime) {
+            this.startTime = changeFeedOptions.startTime.toUTCString();
+        }
+    }
+    async setIteratorRid(diagnosticNode) {
+        const { resource } = await this.container.readInternal(diagnosticNode);
+        this.rId = resource._rid;
+    }
+    continuationTokenRidMatchContainerRid() {
+        if (this.continuationToken.rid !== this.rId) {
+            return false;
+        }
+        return true;
+    }
+    async fillChangeFeedQueue(diagnosticNode) {
+        if (this.continuationToken) {
+            // fill the queue with feed ranges in continuation token.
+            await this.fetchContinuationTokenFeedRanges(diagnosticNode);
+        }
+        else {
+            // fill the queue with feed ranges overlapping the given epk range.
+            await this.fetchOverLappingFeedRanges(diagnosticNode);
+        }
+        this.isInstantiated = true;
+    }
+    /**
+     * Fill the queue with the feed ranges overlapping with the given epk range.
+     */
+    async fetchOverLappingFeedRanges(diagnosticNode) {
+        try {
+            const overLappingRanges = await this.partitionKeyRangeCache.getOverlappingRanges(this.url, this.epkRange, diagnosticNode);
+            for (const overLappingRange of overLappingRanges) {
+                const [epkMinHeader, epkMaxHeader] = await extractOverlappingRanges(this.epkRange, overLappingRange);
+                const feedRange = new ChangeFeedRange(overLappingRange.minInclusive, overLappingRange.maxExclusive, "", epkMinHeader, epkMaxHeader);
+                this.queue.enqueue(feedRange);
+            }
+        }
+        catch (err) {
+            throw new ErrorResponse(err.message);
+        }
+    }
+    /**
+     * Fill the queue with feed ranges from continuation token
+     */
+    async fetchContinuationTokenFeedRanges(diagnosticNode) {
+        const contToken = this.continuationToken;
+        if (!this.continuationTokenRidMatchContainerRid()) {
+            throw new ErrorResponse("The continuation token is not for the current container definition");
+        }
+        else {
+            for (const cToken of contToken.Continuation) {
+                const queryRange = new QueryRange(cToken.minInclusive, cToken.maxExclusive, true, false);
+                try {
+                    const overLappingRanges = await this.partitionKeyRangeCache.getOverlappingRanges(this.url, queryRange, diagnosticNode);
+                    for (const overLappingRange of overLappingRanges) {
+                        // check if the epk range present in continuation token entirely covers the overlapping range.
+                        // If yes, minInclusive and maxExclusive of the overlapping range will be set.
+                        // If no, i.e. there is only partial overlap, epkMinHeader and epkMaxHeader are set as min and max of overlap.
+                        // This will be used when we make a call to fetch change feed.
+                        const [epkMinHeader, epkMaxHeader] = await extractOverlappingRanges(queryRange, overLappingRange);
+                        const feedRange = new ChangeFeedRange(overLappingRange.minInclusive, overLappingRange.maxExclusive, cToken.continuationToken, epkMinHeader, epkMaxHeader);
+                        this.queue.enqueue(feedRange);
+                    }
+                }
+                catch (err) {
+                    throw new ErrorResponse(err.message);
+                }
+            }
+        }
+    }
+    /**
+     * Change feed is an infinite feed. hasMoreResults is always true.
+     */
+    get hasMoreResults() {
+        return true;
+    }
+    /**
+     * Gets an async iterator which will yield change feed results.
+     */
+    getAsyncIterator() {
+        return __asyncGenerator(this, arguments, function* getAsyncIterator_1() {
+            do {
+                const result = yield __await(this.readNext());
+                yield yield __await(result);
+            } while (this.hasMoreResults);
+        });
+    }
+    /**
+     * Gets an async iterator which will yield pages of results from Azure Cosmos DB.
+     *
+     * Keeps iterating over the feedranges and checks if any feed range has new result. Keeps note of the last feed range which returned non 304 result.
+     *
+     * When same feed range is reached and no new changes are found, a 304 (not Modified) is returned to the end user. Then starts process all over again.
+     */
+    async readNext() {
+        return withDiagnostics(async (diagnosticNode) => {
+            // validate if the internal queue is filled up with feed ranges.
+            if (!this.isInstantiated) {
+                await this.setIteratorRid(diagnosticNode);
+                await this.fillChangeFeedQueue(diagnosticNode);
+            }
+            // stores the last feedRange for which statusCode is not 304 i.e. there were new changes in that feed range.
+            let firstNotModifiedFeedRange = undefined;
+            let result;
+            do {
+                const [processedFeedRange, response] = await this.fetchNext(diagnosticNode);
+                result = response;
+                if (result !== undefined) {
+                    {
+                        if (firstNotModifiedFeedRange === undefined) {
+                            firstNotModifiedFeedRange = processedFeedRange;
+                        }
+                        // move current feed range to end of queue to fetch result of next feed range.
+                        // This is done to fetch changes in breadth first manner and avoid starvation.
+                        this.queue.moveFirstElementToTheEnd();
+                        // check if there are new results for the given feed range.
+                        if (result.statusCode === StatusCodes.Ok) {
+                            result.headers[Constants.HttpHeaders.ContinuationToken] =
+                                this.generateContinuationToken();
+                            if (this.clientContext.enableEncryption) {
+                                await decryptChangeFeedResponse(result, diagnosticNode, this.changeFeedOptions.changeFeedMode, this.container.encryptionProcessor);
+                            }
+                            return result;
+                        }
+                    }
+                }
+            } while (!this.checkedAllFeedRanges(firstNotModifiedFeedRange));
+            // set the continuation token after processing.
+            result.headers[Constants.HttpHeaders.ContinuationToken] = this.generateContinuationToken();
+            return result;
+        }, this.clientContext);
+    }
+    /**
+     * Read feed and retrieves the next page of results in Azure Cosmos DB.
+     */
+    async fetchNext(diagnosticNode) {
+        const feedRange = this.queue.peek();
+        if (feedRange) {
+            // fetch results for feed range at the beginning of the queue.
+            const result = await this.getFeedResponse(feedRange, diagnosticNode);
+            // check if results need to be fetched again depending on status code returned.
+            // Eg. in case of paritionSplit, results need to be fetched for the child partitions.
+            const shouldRetry = await this.shouldRetryOnFailure(feedRange, result, diagnosticNode);
+            if (shouldRetry) {
+                this.queue.dequeue();
+                return this.fetchNext(diagnosticNode);
+            }
+            else {
+                // update the continuation value for the current feed range.
+                const continuationValueForFeedRange = result.headers[Constants.HttpHeaders.ETag];
+                const newFeedRange = this.queue.peek();
+                newFeedRange.continuationToken = continuationValueForFeedRange;
+                return [newFeedRange, result];
+            }
+        }
+        else {
+            return [undefined, undefined];
+        }
+    }
+    checkedAllFeedRanges(firstNotModifiedFeedRange) {
+        if (firstNotModifiedFeedRange === undefined) {
+            return false;
+        }
+        const feedRangeQueueFirstElement = this.queue.peek();
+        return (firstNotModifiedFeedRange.minInclusive === (feedRangeQueueFirstElement === null || feedRangeQueueFirstElement === void 0 ? void 0 : feedRangeQueueFirstElement.minInclusive) &&
+            firstNotModifiedFeedRange.maxExclusive === (feedRangeQueueFirstElement === null || feedRangeQueueFirstElement === void 0 ? void 0 : feedRangeQueueFirstElement.maxExclusive) &&
+            firstNotModifiedFeedRange.epkMinHeader === (feedRangeQueueFirstElement === null || feedRangeQueueFirstElement === void 0 ? void 0 : feedRangeQueueFirstElement.epkMinHeader) &&
+            firstNotModifiedFeedRange.epkMaxHeader === (feedRangeQueueFirstElement === null || feedRangeQueueFirstElement === void 0 ? void 0 : feedRangeQueueFirstElement.epkMaxHeader));
+    }
+    /**
+     * Checks whether the current EpkRange is split into multiple ranges or not.
+     *
+     * If yes, it force refreshes the partitionKeyRange cache and enqueue children epk ranges.
+     */
+    async shouldRetryOnFailure(feedRange, response, diagnosticNode) {
+        if (response.statusCode === StatusCodes.Ok || response.statusCode === StatusCodes.NotModified) {
+            return false;
+        }
+        const partitionSplit = response.statusCode === StatusCodes.Gone &&
+            (response.subStatusCode === SubStatusCodes.PartitionKeyRangeGone ||
+                response.subStatusCode === SubStatusCodes.CompletingSplit);
+        if (partitionSplit) {
+            const queryRange = new QueryRange(feedRange.epkMinHeader ? feedRange.epkMinHeader : feedRange.minInclusive, feedRange.epkMaxHeader ? feedRange.epkMaxHeader : feedRange.maxExclusive, true, false);
+            const resolvedRanges = await this.partitionKeyRangeCache.getOverlappingRanges(this.url, queryRange, diagnosticNode, true);
+            if (resolvedRanges.length < 1) {
+                throw new ErrorResponse("Partition split/merge detected but no overlapping ranges found.");
+            }
+            // This covers both cases of merge and split.
+            // resolvedRanges.length > 1 in case of split.
+            // resolvedRanges.length === 1 in case of merge. EpkRange headers will be added in this case.
+            if (resolvedRanges.length >= 1) {
+                await this.handleSplitOrMerge(false, resolvedRanges, queryRange, feedRange.continuationToken);
+            }
+            return true;
+        }
+        return false;
+    }
+    /*
+     * Enqueues all the children feed ranges for the given feed range.
+     */
+    async handleSplitOrMerge(shiftLeft, resolvedRanges, oldFeedRange, continuationToken) {
+        let flag = 0;
+        if (shiftLeft) {
+            // This section is only applicable when handleSplitOrMerge is called by getPartitionRangeId().
+            // used only when existing partition key range cache is used to check for any overlapping ranges.
+            // Modifies the first element with the first overlapping range.
+            const [epkMinHeader, epkMaxHeader] = await extractOverlappingRanges(oldFeedRange, resolvedRanges[0]);
+            const newFeedRange = new ChangeFeedRange(resolvedRanges[0].minInclusive, resolvedRanges[0].maxExclusive, continuationToken, epkMinHeader, epkMaxHeader);
+            this.queue.modifyFirstElement(newFeedRange);
+            flag = 1;
+        }
+        // Enqueue the overlapping ranges.
+        for (let i = flag; i < resolvedRanges.length; i++) {
+            const [epkMinHeader, epkMaxHeader] = await extractOverlappingRanges(oldFeedRange, resolvedRanges[i]);
+            const newFeedRange = new ChangeFeedRange(resolvedRanges[i].minInclusive, resolvedRanges[i].maxExclusive, continuationToken, epkMinHeader, epkMaxHeader);
+            this.queue.enqueue(newFeedRange);
+        }
+    }
+    /**
+     * Fetch the partitionKeyRangeId for the given feed range.
+     *
+     * This partitionKeyRangeId is passed to queryFeed to fetch the results.
+     */
+    async getPartitionRangeId(feedRange, diagnosticNode) {
+        const min = feedRange.epkMinHeader ? feedRange.epkMinHeader : feedRange.minInclusive;
+        const max = feedRange.epkMaxHeader ? feedRange.epkMaxHeader : feedRange.maxExclusive;
+        const queryRange = new QueryRange(min, max, true, false);
+        const resolvedRanges = await this.partitionKeyRangeCache.getOverlappingRanges(this.url, queryRange, diagnosticNode, false);
+        if (resolvedRanges.length < 1) {
+            throw new ErrorResponse("No overlapping ranges found.");
+        }
+        const firstResolvedRange = resolvedRanges[0];
+        const isPartitionRangeChanged = feedRange.minInclusive !== firstResolvedRange.minInclusive ||
+            feedRange.maxExclusive !== firstResolvedRange.maxExclusive ||
+            resolvedRanges.length > 1;
+        // If the partition range is changed, we need to handle split/merge
+        if (isPartitionRangeChanged) {
+            await this.handleSplitOrMerge(true, resolvedRanges, queryRange, feedRange.continuationToken);
+        }
+        return firstResolvedRange.id;
+    }
+    async getFeedResponse(feedRange, diagnosticNode) {
+        const feedOptions = {
+            initialHeaders: {},
+            useLatestVersionFeed: true,
+            useAllVersionsAndDeletesFeed: false,
+        };
+        if (typeof this.changeFeedOptions.maxItemCount === "number") {
+            feedOptions.maxItemCount = this.changeFeedOptions.maxItemCount;
+        }
+        if (this.changeFeedOptions.sessionToken) {
+            feedOptions.sessionToken = this.changeFeedOptions.sessionToken;
+        }
+        if (feedRange.continuationToken) {
+            feedOptions.accessCondition = {
+                type: Constants.HttpHeaders.IfNoneMatch,
+                condition: feedRange.continuationToken,
+            };
+        }
+        else if (this.startFromNow) {
+            feedOptions.initialHeaders[Constants.HttpHeaders.IfNoneMatch] =
+                Constants.ChangeFeedIfNoneMatchStartFromNowHeader;
+        }
+        if (this.startTime) {
+            feedOptions.initialHeaders[Constants.HttpHeaders.IfModifiedSince] = this.startTime;
+        }
+        if (this.changeFeedOptions.changeFeedMode &&
+            this.changeFeedOptions.changeFeedMode === ChangeFeedMode.AllVersionsAndDeletes) {
+            feedOptions.useAllVersionsAndDeletesFeed = true;
+            feedOptions.useLatestVersionFeed = false;
+        }
+        const rangeId = await this.getPartitionRangeId(feedRange, diagnosticNode);
+        if (this.clientContext.enableEncryption) {
+            await this.container.checkAndInitializeEncryption();
+            feedOptions.containerRid = this.container._rid;
+        }
+        try {
+            // startEpk and endEpk are only valid in case we want to fetch result for a part of partition and not the entire partition.
+            const finalFeedRange = this.fetchFinalFeedRange();
+            const response = await this.clientContext.queryFeed({
+                path: this.resourceLink,
+                resourceType: ResourceType.item,
+                resourceId: this.resourceId,
+                resultFn: (result) => (result ? result.Documents : []),
+                query: undefined,
+                options: feedOptions,
+                diagnosticNode,
+                partitionKey: undefined,
+                partitionKeyRangeId: rangeId,
+                startEpk: finalFeedRange.epkMinHeader,
+                endEpk: finalFeedRange.epkMaxHeader,
+            });
+            return new ChangeFeedIteratorResponse(response.result, response.result ? response.result.length : 0, response.code, response.headers, getEmptyCosmosDiagnostics());
+        }
+        catch (err) {
+            // If partition split/merge is encountered, handle it gracefully and continue fetching results.
+            if (err.code === StatusCodes.Gone) {
+                return new ChangeFeedIteratorResponse([], 0, err.code, err.headers, getEmptyCosmosDiagnostics(), err.substatus);
+            }
+            // If any other errors are encountered, throw the error.
+            const errorResponse = new ErrorResponse(err.message);
+            errorResponse.code = err.code;
+            errorResponse.headers = err.headers;
+            throw errorResponse;
+        }
+    }
+    fetchFinalFeedRange() {
+        // this is used to fetch the final feed range before making a call to fetch the results.
+        // In case of merge, the final updated feed range is present in the queue and needs to be returned.
+        const feedRange = this.queue.peek();
+        if (feedRange) {
+            return feedRange;
+        }
+        else {
+            throw new ErrorResponse("No feed range found.");
+        }
+    }
+}
+//# sourceMappingURL=ChangeFeedForEpkRange.js.map

package/dist/browser/client/ChangeFeed/ChangeFeedForEpkRange.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ChangeFeedForEpkRange.js","sourceRoot":"","sources":["../../../../src/client/ChangeFeed/ChangeFeedForEpkRange.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;AAClC,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,0BAA0B,EAAE,MAAM,iCAAiC,CAAC;AAE7E,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAGrD,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAE7F,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,0BAA0B,EAAE,MAAM,iCAAiC,CAAC;AAE7E,OAAO,EAAE,yBAAyB,EAAE,wBAAwB,EAAE,MAAM,sBAAsB,CAAC;AAG3F,OAAO,EAAE,yBAAyB,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AACxF,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD;;;;;GAKG;AACH,MAAM,OAAO,qBAAqB;IAOhC;;OAEG;IACH,YACU,aAA4B,EAC5B,SAAoB,EACpB,sBAA8C,EAC9C,UAAkB,EAClB,YAAoB,EACpB,GAAW,EACX,iBAAoD,EACpD,QAAoB;QAPpB,kBAAa,GAAb,aAAa,CAAe;QAC5B,cAAS,GAAT,SAAS,CAAW;QACpB,2BAAsB,GAAtB,sBAAsB,CAAwB;QAC9C,eAAU,GAAV,UAAU,CAAQ;QAClB,iBAAY,GAAZ,YAAY,CAAQ;QACpB,QAAG,GAAH,GAAG,CAAQ;QACX,sBAAiB,GAAjB,iBAAiB,CAAmC;QACpD,aAAQ,GAAR,QAAQ,CAAY;QAoLtB,8BAAyB,GAAG,GAAW,EAAE;YAC/C,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,0BAA0B,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;QAC/F,CAAC,CAAC;QApLA,IAAI,CAAC,KAAK,GAAG,IAAI,cAAc,EAAmB,CAAC;QACnD,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC,iBAAiB;YAC1D,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,iBAAiB,CAAC;YACjD,CAAC,CAAC,SAAS,CAAC;QACd,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC;QAC5B,wKAAwK;QACxK,IAAI,iBAAiB,CAAC,YAAY,EAAE,CAAC;YACnC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QAC3B,CAAC;aAAM,IAAI,iBAAiB,CAAC,SAAS,EAAE,CAAC;YACvC,IAAI,CAAC,SAAS,GAAG,iBAAiB,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC;QAC7D,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,cAAc,CAAC,cAAsC;QACjE,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;QACvE,IAAI,CAAC,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC;IAC3B,CAAC;IAEO,qCAAqC;QAC3C,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,mBAAmB,CAAC,cAAsC;QACtE,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC3B,yDAAyD;YACzD,MAAM,IAAI,CAAC,gCAAgC,CAAC,cAAc,CAAC,CAAC;QAC9D,CAAC;aAAM,CAAC;YACN,mEAAmE;YACnE,MAAM,IAAI,CAAC,0BAA0B,CAAC,cAAc,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;IAC7B,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,0BAA0B,CAAC,cAAsC;QAC7E,IAAI,CAAC;YACH,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,oBAAoB,CAC9E,IAAI,CAAC,GAAG,EACR,IAAI,CAAC,QAAQ,EACb,cAAc,CACf,CAAC;YACF,KAAK,MAAM,gBAAgB,IAAI,iBAAiB,EAAE,CAAC;gBACjD,MAAM,CAAC,YAAY,EAAE,YAAY,CAAC,GAAG,MAAM,wBAAwB,CACjE,IAAI,CAAC,QAAQ,EACb,gBAAgB,CACjB,CAAC;gBACF,MAAM,SAAS,GAAoB,IAAI,eAAe,CACpD,gBAAgB,CAAC,YAAY,EAC7B,gBAAgB,CAAC,YAAY,EAC7B,EAAE,EACF,YAAY,EACZ,YAAY,CACb,CAAC;gBACF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,IAAI,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD;;OAEG;IACK,KAAK,CAAC,gCAAgC,CAC5C,cAAsC;QAEtC,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,qCAAqC,EAAE,EAAE,CAAC;YAClD,MAAM,IAAI,aAAa,CAAC,oEAAoE,CAAC,CAAC;QAChG,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,YAAY,EAAE,CAAC;gBAC5C,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,YAAY,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;gBACzF,IAAI,CAAC;oBACH,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,oBAAoB,CAC9E,IAAI,CAAC,GAAG,EACR,UAAU,EACV,cAAc,CACf,CAAC;oBACF,KAAK,MAAM,gBAAgB,IAAI,iBAAiB,EAAE,CAAC;wBACjD,8FAA8F;wBAC9F,8EAA8E;wBAC9E,8GAA8G;wBAC9G,8DAA8D;wBAC9D,MAAM,CAAC,YAAY,EAAE,YAAY,CAAC,GAAG,MAAM,wBAAwB,CACjE,UAAU,EACV,gBAAgB,CACjB,CAAC;wBACF,MAAM,SAAS,GAAoB,IAAI,eAAe,CACpD,gBAAgB,CAAC,YAAY,EAC7B,gBAAgB,CAAC,YAAY,EAC7B,MAAM,CAAC,iBAAiB,EACxB,YAAY,EACZ,YAAY,CACb,CAAC;wBACF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAChC,CAAC;gBACH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,MAAM,IAAI,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI,cAAc;QAChB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACW,gBAAgB;;YAC5B,GAAG,CAAC;gBACF,MAAM,MAAM,GAAG,cAAM,IAAI,CAAC,QAAQ,EAAE,CAAA,CAAC;gBACrC,oBAAM,MAAM,CAAA,CAAC;YACf,CAAC,QAAQ,IAAI,CAAC,cAAc,EAAE;QAChC,CAAC;KAAA;IAED;;;;;;OAMG;IACI,KAAK,CAAC,QAAQ;QACnB,OAAO,eAAe,CAAC,KAAK,EAAE,cAAsC,EAAE,EAAE;YACtE,gEAAgE;YAChE,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;gBACzB,MAAM,IAAI,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC;gBAC1C,MAAM,IAAI,CAAC,mBAAmB,CAAC,cAAc,CAAC,CAAC;YACjD,CAAC;YAED,4GAA4G;YAC5G,IAAI,yBAAyB,GAAoB,SAAS,CAAC;YAC3D,IAAI,MAAuD,CAAC;YAC5D,GAAG,CAAC;gBACF,MAAM,CAAC,kBAAkB,EAAE,QAAQ,CAAC,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;gBAC5E,MAAM,GAAG,QAAQ,CAAC;gBAElB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACzB,CAAC;wBACC,IAAI,yBAAyB,KAAK,SAAS,EAAE,CAAC;4BAC5C,yBAAyB,GAAG,kBAAkB,CAAC;wBACjD,CAAC;wBACD,8EAA8E;wBAC9E,8EAA8E;wBAC9E,IAAI,CAAC,KAAK,CAAC,wBAAwB,EAAE,CAAC;wBACtC,2DAA2D;wBAC3D,IAAI,MAAM,CAAC,UAAU,KAAK,WAAW,CAAC,EAAE,EAAE,CAAC;4BACzC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,iBAAiB,CAAC;gCACrD,IAAI,CAAC,yBAAyB,EAAE,CAAC;4BAEnC,IAAI,IAAI,CAAC,aAAa,CAAC,gBAAgB,EAAE,CAAC;gCACxC,MAAM,yBAAyB,CAC7B,MAAM,EACN,cAAc,EACd,IAAI,CAAC,iBAAiB,CAAC,cAAc,EACrC,IAAI,CAAC,SAAS,CAAC,mBAAmB,CACnC,CAAC;4BACJ,CAAC;4BACD,OAAO,MAAM,CAAC;wBAChB,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC,QAAQ,CAAC,IAAI,CAAC,oBAAoB,CAAC,yBAAyB,CAAC,EAAE;YAChE,+CAA+C;YAC/C,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,iBAAiB,CAAC,GAAG,IAAI,CAAC,yBAAyB,EAAE,CAAC;YAC3F,OAAO,MAAM,CAAC;QAChB,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IACzB,CAAC;IAMD;;OAEG;IACK,KAAK,CAAC,SAAS,CACrB,cAAsC;QAEtC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACpC,IAAI,SAAS,EAAE,CAAC;YACd,8DAA8D;YAC9D,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;YAErE,+EAA+E;YAC/E,qFAAqF;YACrF,MAAM,WAAW,GAAY,MAAM,IAAI,CAAC,oBAAoB,CAC1D,SAAS,EACT,MAAM,EACN,cAAc,CACf,CAAC;YAEF,IAAI,WAAW,EAAE,CAAC;gBAChB,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;gBACrB,OAAO,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;YACxC,CAAC;iBAAM,CAAC;gBACN,4DAA4D;gBAC5D,MAAM,6BAA6B,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBACjF,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBACvC,YAAY,CAAC,iBAAiB,GAAG,6BAA6B,CAAC;gBAC/D,OAAO,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAEO,oBAAoB,CAAC,yBAAsD;QACjF,IAAI,yBAAyB,KAAK,SAAS,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,0BAA0B,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACrD,OAAO,CACL,yBAAyB,CAAC,YAAY,MAAK,0BAA0B,aAA1B,0BAA0B,uBAA1B,0BAA0B,CAAE,YAAY,CAAA;YACnF,yBAAyB,CAAC,YAAY,MAAK,0BAA0B,aAA1B,0BAA0B,uBAA1B,0BAA0B,CAAE,YAAY,CAAA;YACnF,yBAAyB,CAAC,YAAY,MAAK,0BAA0B,aAA1B,0BAA0B,uBAA1B,0BAA0B,CAAE,YAAY,CAAA;YACnF,yBAAyB,CAAC,YAAY,MAAK,0BAA0B,aAA1B,0BAA0B,uBAA1B,0BAA0B,CAAE,YAAY,CAAA,CACpF,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,oBAAoB,CAChC,SAA0B,EAC1B,QAAyD,EACzD,cAAsC;QAEtC,IAAI,QAAQ,CAAC,UAAU,KAAK,WAAW,CAAC,EAAE,IAAI,QAAQ,CAAC,UAAU,KAAK,WAAW,CAAC,WAAW,EAAE,CAAC;YAC9F,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,cAAc,GAClB,QAAQ,CAAC,UAAU,KAAK,WAAW,CAAC,IAAI;YACxC,CAAC,QAAQ,CAAC,aAAa,KAAK,cAAc,CAAC,qBAAqB;gBAC9D,QAAQ,CAAC,aAAa,KAAK,cAAc,CAAC,eAAe,CAAC,CAAC;QAE/D,IAAI,cAAc,EAAE,CAAC;YACnB,MAAM,UAAU,GAAG,IAAI,UAAU,CAC/B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,EACxE,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,EACxE,IAAI,EACJ,KAAK,CACN,CAAC;YACF,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,oBAAoB,CAC3E,IAAI,CAAC,GAAG,EACR,UAAU,EACV,cAAc,EACd,IAAI,CACL,CAAC;YACF,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,MAAM,IAAI,aAAa,CAAC,iEAAiE,CAAC,CAAC;YAC7F,CAAC;YACD,6CAA6C;YAC7C,8CAA8C;YAC9C,6FAA6F;YAC7F,IAAI,cAAc,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,CAAC,kBAAkB,CAC3B,KAAK,EACL,cAAc,EACd,UAAU,EACV,SAAS,CAAC,iBAAiB,CAC5B,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;OAEG;IACK,KAAK,CAAC,kBAAkB,CAC9B,SAAkB,EAClB,cAAmB,EACnB,YAAwB,EACxB,iBAAyB;QAEzB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,SAAS,EAAE,CAAC;YACd,8FAA8F;YAC9F,iGAAiG;YACjG,+DAA+D;YAC/D,MAAM,CAAC,YAAY,EAAE,YAAY,CAAC,GAAG,MAAM,wBAAwB,CACjE,YAAY,EACZ,cAAc,CAAC,CAAC,CAAC,CAClB,CAAC;YACF,MAAM,YAAY,GAAG,IAAI,eAAe,CACtC,cAAc,CAAC,CAAC,CAAC,CAAC,YAAY,EAC9B,cAAc,CAAC,CAAC,CAAC,CAAC,YAAY,EAC9B,iBAAiB,EACjB,YAAY,EACZ,YAAY,CACb,CAAC;YAEF,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC;YAC5C,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;QACD,kCAAkC;QAClC,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,CAAC,YAAY,EAAE,YAAY,CAAC,GAAG,MAAM,wBAAwB,CACjE,YAAY,EACZ,cAAc,CAAC,CAAC,CAAC,CAClB,CAAC;YACF,MAAM,YAAY,GAAG,IAAI,eAAe,CACtC,cAAc,CAAC,CAAC,CAAC,CAAC,YAAY,EAC9B,cAAc,CAAC,CAAC,CAAC,CAAC,YAAY,EAC9B,iBAAiB,EACjB,YAAY,EACZ,YAAY,CACb,CAAC;YACF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,mBAAmB,CAC/B,SAA0B,EAC1B,cAAsC;QAEtC,MAAM,GAAG,GAAG,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC;QACrF,MAAM,GAAG,GAAG,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC;QACrF,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACzD,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,oBAAoB,CAC3E,IAAI,CAAC,GAAG,EACR,UAAU,EACV,cAAc,EACd,KAAK,CACN,CAAC;QACF,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,aAAa,CAAC,8BAA8B,CAAC,CAAC;QAC1D,CAAC;QACD,MAAM,kBAAkB,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,uBAAuB,GAC3B,SAAS,CAAC,YAAY,KAAK,kBAAkB,CAAC,YAAY;YAC1D,SAAS,CAAC,YAAY,KAAK,kBAAkB,CAAC,YAAY;YAC1D,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,mEAAmE;QACnE,IAAI,uBAAuB,EAAE,CAAC;YAC5B,MAAM,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,cAAc,EAAE,UAAU,EAAE,SAAS,CAAC,iBAAiB,CAAC,CAAC;QAC/F,CAAC;QACD,OAAO,kBAAkB,CAAC,EAAE,CAAC;IAC/B,CAAC;IAEO,KAAK,CAAC,eAAe,CAC3B,SAA0B,EAC1B,cAAsC;QAEtC,MAAM,WAAW,GAAgB;YAC/B,cAAc,EAAE,EAAE;YAClB,oBAAoB,EAAE,IAAI;YAC1B,4BAA4B,EAAE,KAAK;SACpC,CAAC;QAEF,IAAI,OAAO,IAAI,CAAC,iBAAiB,CAAC,YAAY,KAAK,QAAQ,EAAE,CAAC;YAC5D,WAAW,CAAC,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC;QACjE,CAAC;QAED,IAAI,IAAI,CAAC,iBAAiB,CAAC,YAAY,EAAE,CAAC;YACxC,WAAW,CAAC,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC;QACjE,CAAC;QAED,IAAI,SAAS,CAAC,iBAAiB,EAAE,CAAC;YAChC,WAAW,CAAC,eAAe,GAAG;gBAC5B,IAAI,EAAE,SAAS,CAAC,WAAW,CAAC,WAAW;gBACvC,SAAS,EAAE,SAAS,CAAC,iBAAiB;aACvC,CAAC;QACJ,CAAC;aAAM,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAC7B,WAAW,CAAC,cAAc,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC;gBAC3D,SAAS,CAAC,uCAAuC,CAAC;QACtD,CAAC;QAED,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,WAAW,CAAC,cAAc,CAAC,SAAS,CAAC,WAAW,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;QACrF,CAAC;QAED,IACE,IAAI,CAAC,iBAAiB,CAAC,cAAc;YACrC,IAAI,CAAC,iBAAiB,CAAC,cAAc,KAAK,cAAc,CAAC,qBAAqB,EAC9E,CAAC;YACD,WAAW,CAAC,4BAA4B,GAAG,IAAI,CAAC;YAChD,WAAW,CAAC,oBAAoB,GAAG,KAAK,CAAC;QAC3C,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,aAAa,CAAC,gBAAgB,EAAE,CAAC;YACxC,MAAM,IAAI,CAAC,SAAS,CAAC,4BAA4B,EAAE,CAAC;YACpD,WAAW,CAAC,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;QACjD,CAAC;QACD,IAAI,CAAC;YACH,2HAA2H;YAC3H,MAAM,cAAc,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAClD,MAAM,QAAQ,GAAkC,MAAO,IAAI,CAAC,aAAa,CAAC,SAAS,CAAI;gBACrF,IAAI,EAAE,IAAI,CAAC,YAAY;gBACvB,YAAY,EAAE,YAAY,CAAC,IAAI;gBAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtD,KAAK,EAAE,SAAS;gBAChB,OAAO,EAAE,WAAW;gBACpB,cAAc;gBACd,YAAY,EAAE,SAAS;gBACvB,mBAAmB,EAAE,OAAO;gBAC5B,QAAQ,EAAE,cAAc,CAAC,YAAY;gBACrC,MAAM,EAAE,cAAc,CAAC,YAAY;aACpC,CAAkB,CAAC;YAEpB,OAAO,IAAI,0BAA0B,CACnC,QAAQ,CAAC,MAAM,EACf,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAC5C,QAAQ,CAAC,IAAI,EACb,QAAQ,CAAC,OAAO,EAChB,yBAAyB,EAAE,CAC5B,CAAC;QACJ,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,+FAA+F;YAC/F,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI,EAAE,CAAC;gBAClC,OAAO,IAAI,0BAA0B,CACnC,EAAE,EACF,CAAC,EACD,GAAG,CAAC,IAAI,EACR,GAAG,CAAC,OAAO,EACX,yBAAyB,EAAE,EAC3B,GAAG,CAAC,SAAS,CACd,CAAC;YACJ,CAAC;YACD,wDAAwD;YACxD,MAAM,aAAa,GAAG,IAAI,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrD,aAAa,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;YAC9B,aAAa,CAAC,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC;YACpC,MAAM,aAAa,CAAC;QACtB,CAAC;IACH,CAAC;IACO,mBAAmB;QACzB,wFAAwF;QACxF,mGAAmG;QACnG,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACpC,IAAI,SAAS,EAAE,CAAC;YACd,OAAO,SAAS,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,aAAa,CAAC,sBAAsB,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport { ChangeFeedRange } from \"./ChangeFeedRange.js\";\nimport { ChangeFeedIteratorResponse } from \"./ChangeFeedIteratorResponse.js\";\nimport type { PartitionKeyRangeCache } from \"../../routing/index.js\";\nimport { QueryRange } from \"../../routing/index.js\";\nimport { FeedRangeQueue } from \"./FeedRangeQueue.js\";\nimport type { ClientContext } from \"../../ClientContext.js\";\nimport type { Container, Resource } from \"../../client/index.js\";\nimport { Constants, SubStatusCodes, StatusCodes, ResourceType } from \"../../common/index.js\";\nimport type { Response, FeedOptions } from \"../../request/index.js\";\nimport { ErrorResponse } from \"../../request/index.js\";\nimport { CompositeContinuationToken } from \"./CompositeContinuationToken.js\";\nimport type { ChangeFeedPullModelIterator } from \"./ChangeFeedPullModelIterator.js\";\nimport { decryptChangeFeedResponse, extractOverlappingRanges } from \"./changeFeedUtils.js\";\nimport type { InternalChangeFeedIteratorOptions } from \"./InternalChangeFeedOptions.js\";\nimport type { DiagnosticNodeInternal } from \"../../diagnostics/DiagnosticNodeInternal.js\";\nimport { getEmptyCosmosDiagnostics, withDiagnostics } from \"../../utils/diagnostics.js\";\nimport { ChangeFeedMode } from \"./ChangeFeedMode.js\";\n/**\n * @hidden\n * Provides iterator for change feed for entire container or an epk range.\n *\n * Use `Items.getChangeFeedIterator()` to get an instance of the iterator.\n */\nexport class ChangeFeedForEpkRange<T> implements ChangeFeedPullModelIterator<T> {\n  private continuationToken?: CompositeContinuationToken;\n  private queue: FeedRangeQueue<ChangeFeedRange>;\n  private startTime: string;\n  private isInstantiated: boolean;\n  private rId: string;\n  private startFromNow: boolean;\n  /**\n   * @internal\n   */\n  constructor(\n    private clientContext: ClientContext,\n    private container: Container,\n    private partitionKeyRangeCache: PartitionKeyRangeCache,\n    private resourceId: string,\n    private resourceLink: string,\n    private url: string,\n    private changeFeedOptions: InternalChangeFeedIteratorOptions,\n    private epkRange: QueryRange,\n  ) {\n    this.queue = new FeedRangeQueue<ChangeFeedRange>();\n    this.continuationToken = changeFeedOptions.continuationToken\n      ? JSON.parse(changeFeedOptions.continuationToken)\n      : undefined;\n    this.isInstantiated = false;\n    // startTime is used to store and specify time from which change feed should start reading new changes. StartFromNow flag is used to indicate fetching changes from now.\n    if (changeFeedOptions.startFromNow) {\n      this.startFromNow = true;\n    } else if (changeFeedOptions.startTime) {\n      this.startTime = changeFeedOptions.startTime.toUTCString();\n    }\n  }\n\n  private async setIteratorRid(diagnosticNode: DiagnosticNodeInternal): Promise<void> {\n    const { resource } = await this.container.readInternal(diagnosticNode);\n    this.rId = resource._rid;\n  }\n\n  private continuationTokenRidMatchContainerRid(): boolean {\n    if (this.continuationToken.rid !== this.rId) {\n      return false;\n    }\n    return true;\n  }\n\n  private async fillChangeFeedQueue(diagnosticNode: DiagnosticNodeInternal): Promise<void> {\n    if (this.continuationToken) {\n      // fill the queue with feed ranges in continuation token.\n      await this.fetchContinuationTokenFeedRanges(diagnosticNode);\n    } else {\n      // fill the queue with feed ranges overlapping the given epk range.\n      await this.fetchOverLappingFeedRanges(diagnosticNode);\n    }\n    this.isInstantiated = true;\n  }\n\n  /**\n   * Fill the queue with the feed ranges overlapping with the given epk range.\n   */\n  private async fetchOverLappingFeedRanges(diagnosticNode: DiagnosticNodeInternal): Promise<void> {\n    try {\n      const overLappingRanges = await this.partitionKeyRangeCache.getOverlappingRanges(\n        this.url,\n        this.epkRange,\n        diagnosticNode,\n      );\n      for (const overLappingRange of overLappingRanges) {\n        const [epkMinHeader, epkMaxHeader] = await extractOverlappingRanges(\n          this.epkRange,\n          overLappingRange,\n        );\n        const feedRange: ChangeFeedRange = new ChangeFeedRange(\n          overLappingRange.minInclusive,\n          overLappingRange.maxExclusive,\n          \"\",\n          epkMinHeader,\n          epkMaxHeader,\n        );\n        this.queue.enqueue(feedRange);\n      }\n    } catch (err) {\n      throw new ErrorResponse(err.message);\n    }\n  }\n  /**\n   * Fill the queue with feed ranges from continuation token\n   */\n  private async fetchContinuationTokenFeedRanges(\n    diagnosticNode: DiagnosticNodeInternal,\n  ): Promise<void> {\n    const contToken = this.continuationToken;\n    if (!this.continuationTokenRidMatchContainerRid()) {\n      throw new ErrorResponse(\"The continuation token is not for the current container definition\");\n    } else {\n      for (const cToken of contToken.Continuation) {\n        const queryRange = new QueryRange(cToken.minInclusive, cToken.maxExclusive, true, false);\n        try {\n          const overLappingRanges = await this.partitionKeyRangeCache.getOverlappingRanges(\n            this.url,\n            queryRange,\n            diagnosticNode,\n          );\n          for (const overLappingRange of overLappingRanges) {\n            // check if the epk range present in continuation token entirely covers the overlapping range.\n            // If yes, minInclusive and maxExclusive of the overlapping range will be set.\n            // If no, i.e. there is only partial overlap, epkMinHeader and epkMaxHeader are set as min and max of overlap.\n            // This will be used when we make a call to fetch change feed.\n            const [epkMinHeader, epkMaxHeader] = await extractOverlappingRanges(\n              queryRange,\n              overLappingRange,\n            );\n            const feedRange: ChangeFeedRange = new ChangeFeedRange(\n              overLappingRange.minInclusive,\n              overLappingRange.maxExclusive,\n              cToken.continuationToken,\n              epkMinHeader,\n              epkMaxHeader,\n            );\n            this.queue.enqueue(feedRange);\n          }\n        } catch (err) {\n          throw new ErrorResponse(err.message);\n        }\n      }\n    }\n  }\n\n  /**\n   * Change feed is an infinite feed. hasMoreResults is always true.\n   */\n  get hasMoreResults(): boolean {\n    return true;\n  }\n\n  /**\n   * Gets an async iterator which will yield change feed results.\n   */\n  public async *getAsyncIterator(): AsyncIterable<ChangeFeedIteratorResponse<Array<T & Resource>>> {\n    do {\n      const result = await this.readNext();\n      yield result;\n    } while (this.hasMoreResults);\n  }\n\n  /**\n   * Gets an async iterator which will yield pages of results from Azure Cosmos DB.\n   *\n   * Keeps iterating over the feedranges and checks if any feed range has new result. Keeps note of the last feed range which returned non 304 result.\n   *\n   * When same feed range is reached and no new changes are found, a 304 (not Modified) is returned to the end user. Then starts process all over again.\n   */\n  public async readNext(): Promise<ChangeFeedIteratorResponse<Array<T & Resource>>> {\n    return withDiagnostics(async (diagnosticNode: DiagnosticNodeInternal) => {\n      // validate if the internal queue is filled up with feed ranges.\n      if (!this.isInstantiated) {\n        await this.setIteratorRid(diagnosticNode);\n        await this.fillChangeFeedQueue(diagnosticNode);\n      }\n\n      // stores the last feedRange for which statusCode is not 304 i.e. there were new changes in that feed range.\n      let firstNotModifiedFeedRange: ChangeFeedRange = undefined;\n      let result: ChangeFeedIteratorResponse<Array<T & Resource>>;\n      do {\n        const [processedFeedRange, response] = await this.fetchNext(diagnosticNode);\n        result = response;\n\n        if (result !== undefined) {\n          {\n            if (firstNotModifiedFeedRange === undefined) {\n              firstNotModifiedFeedRange = processedFeedRange;\n            }\n            // move current feed range to end of queue to fetch result of next feed range.\n            // This is done to fetch changes in breadth first manner and avoid starvation.\n            this.queue.moveFirstElementToTheEnd();\n            // check if there are new results for the given feed range.\n            if (result.statusCode === StatusCodes.Ok) {\n              result.headers[Constants.HttpHeaders.ContinuationToken] =\n                this.generateContinuationToken();\n\n              if (this.clientContext.enableEncryption) {\n                await decryptChangeFeedResponse(\n                  result,\n                  diagnosticNode,\n                  this.changeFeedOptions.changeFeedMode,\n                  this.container.encryptionProcessor,\n                );\n              }\n              return result;\n            }\n          }\n        }\n      } while (!this.checkedAllFeedRanges(firstNotModifiedFeedRange));\n      // set the continuation token after processing.\n      result.headers[Constants.HttpHeaders.ContinuationToken] = this.generateContinuationToken();\n      return result;\n    }, this.clientContext);\n  }\n\n  private generateContinuationToken = (): string => {\n    return JSON.stringify(new CompositeContinuationToken(this.rId, this.queue.returnSnapshot()));\n  };\n\n  /**\n   * Read feed and retrieves the next page of results in Azure Cosmos DB.\n   */\n  private async fetchNext(\n    diagnosticNode: DiagnosticNodeInternal,\n  ): Promise<[ChangeFeedRange | undefined, ChangeFeedIteratorResponse<Array<T & Resource>>]> {\n    const feedRange = this.queue.peek();\n    if (feedRange) {\n      // fetch results for feed range at the beginning of the queue.\n      const result = await this.getFeedResponse(feedRange, diagnosticNode);\n\n      // check if results need to be fetched again depending on status code returned.\n      // Eg. in case of paritionSplit, results need to be fetched for the child partitions.\n      const shouldRetry: boolean = await this.shouldRetryOnFailure(\n        feedRange,\n        result,\n        diagnosticNode,\n      );\n\n      if (shouldRetry) {\n        this.queue.dequeue();\n        return this.fetchNext(diagnosticNode);\n      } else {\n        // update the continuation value for the current feed range.\n        const continuationValueForFeedRange = result.headers[Constants.HttpHeaders.ETag];\n        const newFeedRange = this.queue.peek();\n        newFeedRange.continuationToken = continuationValueForFeedRange;\n        return [newFeedRange, result];\n      }\n    } else {\n      return [undefined, undefined];\n    }\n  }\n\n  private checkedAllFeedRanges(firstNotModifiedFeedRange: ChangeFeedRange | undefined): boolean {\n    if (firstNotModifiedFeedRange === undefined) {\n      return false;\n    }\n    const feedRangeQueueFirstElement = this.queue.peek();\n    return (\n      firstNotModifiedFeedRange.minInclusive === feedRangeQueueFirstElement?.minInclusive &&\n      firstNotModifiedFeedRange.maxExclusive === feedRangeQueueFirstElement?.maxExclusive &&\n      firstNotModifiedFeedRange.epkMinHeader === feedRangeQueueFirstElement?.epkMinHeader &&\n      firstNotModifiedFeedRange.epkMaxHeader === feedRangeQueueFirstElement?.epkMaxHeader\n    );\n  }\n\n  /**\n   * Checks whether the current EpkRange is split into multiple ranges or not.\n   *\n   * If yes, it force refreshes the partitionKeyRange cache and enqueue children epk ranges.\n   */\n  private async shouldRetryOnFailure(\n    feedRange: ChangeFeedRange,\n    response: ChangeFeedIteratorResponse<Array<T & Resource>>,\n    diagnosticNode: DiagnosticNodeInternal,\n  ): Promise<boolean> {\n    if (response.statusCode === StatusCodes.Ok || response.statusCode === StatusCodes.NotModified) {\n      return false;\n    }\n\n    const partitionSplit =\n      response.statusCode === StatusCodes.Gone &&\n      (response.subStatusCode === SubStatusCodes.PartitionKeyRangeGone ||\n        response.subStatusCode === SubStatusCodes.CompletingSplit);\n\n    if (partitionSplit) {\n      const queryRange = new QueryRange(\n        feedRange.epkMinHeader ? feedRange.epkMinHeader : feedRange.minInclusive,\n        feedRange.epkMaxHeader ? feedRange.epkMaxHeader : feedRange.maxExclusive,\n        true,\n        false,\n      );\n      const resolvedRanges = await this.partitionKeyRangeCache.getOverlappingRanges(\n        this.url,\n        queryRange,\n        diagnosticNode,\n        true,\n      );\n      if (resolvedRanges.length < 1) {\n        throw new ErrorResponse(\"Partition split/merge detected but no overlapping ranges found.\");\n      }\n      // This covers both cases of merge and split.\n      // resolvedRanges.length > 1 in case of split.\n      // resolvedRanges.length === 1 in case of merge. EpkRange headers will be added in this case.\n      if (resolvedRanges.length >= 1) {\n        await this.handleSplitOrMerge(\n          false,\n          resolvedRanges,\n          queryRange,\n          feedRange.continuationToken,\n        );\n      }\n      return true;\n    }\n    return false;\n  }\n  /*\n   * Enqueues all the children feed ranges for the given feed range.\n   */\n  private async handleSplitOrMerge(\n    shiftLeft: boolean,\n    resolvedRanges: any,\n    oldFeedRange: QueryRange,\n    continuationToken: string,\n  ): Promise<void> {\n    let flag = 0;\n    if (shiftLeft) {\n      // This section is only applicable when handleSplitOrMerge is called by getPartitionRangeId().\n      // used only when existing partition key range cache is used to check for any overlapping ranges.\n      // Modifies the first element with the first overlapping range.\n      const [epkMinHeader, epkMaxHeader] = await extractOverlappingRanges(\n        oldFeedRange,\n        resolvedRanges[0],\n      );\n      const newFeedRange = new ChangeFeedRange(\n        resolvedRanges[0].minInclusive,\n        resolvedRanges[0].maxExclusive,\n        continuationToken,\n        epkMinHeader,\n        epkMaxHeader,\n      );\n\n      this.queue.modifyFirstElement(newFeedRange);\n      flag = 1;\n    }\n    // Enqueue the overlapping ranges.\n    for (let i = flag; i < resolvedRanges.length; i++) {\n      const [epkMinHeader, epkMaxHeader] = await extractOverlappingRanges(\n        oldFeedRange,\n        resolvedRanges[i],\n      );\n      const newFeedRange = new ChangeFeedRange(\n        resolvedRanges[i].minInclusive,\n        resolvedRanges[i].maxExclusive,\n        continuationToken,\n        epkMinHeader,\n        epkMaxHeader,\n      );\n      this.queue.enqueue(newFeedRange);\n    }\n  }\n\n  /**\n   * Fetch the partitionKeyRangeId for the given feed range.\n   *\n   * This partitionKeyRangeId is passed to queryFeed to fetch the results.\n   */\n  private async getPartitionRangeId(\n    feedRange: ChangeFeedRange,\n    diagnosticNode: DiagnosticNodeInternal,\n  ): Promise<string> {\n    const min = feedRange.epkMinHeader ? feedRange.epkMinHeader : feedRange.minInclusive;\n    const max = feedRange.epkMaxHeader ? feedRange.epkMaxHeader : feedRange.maxExclusive;\n    const queryRange = new QueryRange(min, max, true, false);\n    const resolvedRanges = await this.partitionKeyRangeCache.getOverlappingRanges(\n      this.url,\n      queryRange,\n      diagnosticNode,\n      false,\n    );\n    if (resolvedRanges.length < 1) {\n      throw new ErrorResponse(\"No overlapping ranges found.\");\n    }\n    const firstResolvedRange = resolvedRanges[0];\n    const isPartitionRangeChanged =\n      feedRange.minInclusive !== firstResolvedRange.minInclusive ||\n      feedRange.maxExclusive !== firstResolvedRange.maxExclusive ||\n      resolvedRanges.length > 1;\n    // If the partition range is changed, we need to handle split/merge\n    if (isPartitionRangeChanged) {\n      await this.handleSplitOrMerge(true, resolvedRanges, queryRange, feedRange.continuationToken);\n    }\n    return firstResolvedRange.id;\n  }\n\n  private async getFeedResponse(\n    feedRange: ChangeFeedRange,\n    diagnosticNode: DiagnosticNodeInternal,\n  ): Promise<ChangeFeedIteratorResponse<Array<T & Resource>>> {\n    const feedOptions: FeedOptions = {\n      initialHeaders: {},\n      useLatestVersionFeed: true,\n      useAllVersionsAndDeletesFeed: false,\n    };\n\n    if (typeof this.changeFeedOptions.maxItemCount === \"number\") {\n      feedOptions.maxItemCount = this.changeFeedOptions.maxItemCount;\n    }\n\n    if (this.changeFeedOptions.sessionToken) {\n      feedOptions.sessionToken = this.changeFeedOptions.sessionToken;\n    }\n\n    if (feedRange.continuationToken) {\n      feedOptions.accessCondition = {\n        type: Constants.HttpHeaders.IfNoneMatch,\n        condition: feedRange.continuationToken,\n      };\n    } else if (this.startFromNow) {\n      feedOptions.initialHeaders[Constants.HttpHeaders.IfNoneMatch] =\n        Constants.ChangeFeedIfNoneMatchStartFromNowHeader;\n    }\n\n    if (this.startTime) {\n      feedOptions.initialHeaders[Constants.HttpHeaders.IfModifiedSince] = this.startTime;\n    }\n\n    if (\n      this.changeFeedOptions.changeFeedMode &&\n      this.changeFeedOptions.changeFeedMode === ChangeFeedMode.AllVersionsAndDeletes\n    ) {\n      feedOptions.useAllVersionsAndDeletesFeed = true;\n      feedOptions.useLatestVersionFeed = false;\n    }\n\n    const rangeId = await this.getPartitionRangeId(feedRange, diagnosticNode);\n    if (this.clientContext.enableEncryption) {\n      await this.container.checkAndInitializeEncryption();\n      feedOptions.containerRid = this.container._rid;\n    }\n    try {\n      // startEpk and endEpk are only valid in case we want to fetch result for a part of partition and not the entire partition.\n      const finalFeedRange = this.fetchFinalFeedRange();\n      const response: Response<Array<T & Resource>> = await (this.clientContext.queryFeed<T>({\n        path: this.resourceLink,\n        resourceType: ResourceType.item,\n        resourceId: this.resourceId,\n        resultFn: (result) => (result ? result.Documents : []),\n        query: undefined,\n        options: feedOptions,\n        diagnosticNode,\n        partitionKey: undefined,\n        partitionKeyRangeId: rangeId,\n        startEpk: finalFeedRange.epkMinHeader,\n        endEpk: finalFeedRange.epkMaxHeader,\n      }) as Promise<any>);\n\n      return new ChangeFeedIteratorResponse(\n        response.result,\n        response.result ? response.result.length : 0,\n        response.code,\n        response.headers,\n        getEmptyCosmosDiagnostics(),\n      );\n    } catch (err) {\n      // If partition split/merge is encountered, handle it gracefully and continue fetching results.\n      if (err.code === StatusCodes.Gone) {\n        return new ChangeFeedIteratorResponse(\n          [],\n          0,\n          err.code,\n          err.headers,\n          getEmptyCosmosDiagnostics(),\n          err.substatus,\n        );\n      }\n      // If any other errors are encountered, throw the error.\n      const errorResponse = new ErrorResponse(err.message);\n      errorResponse.code = err.code;\n      errorResponse.headers = err.headers;\n      throw errorResponse;\n    }\n  }\n  private fetchFinalFeedRange(): ChangeFeedRange {\n    // this is used to fetch the final feed range before making a call to fetch the results.\n    // In case of merge, the final updated feed range is present in the queue and needs to be returned.\n    const feedRange = this.queue.peek();\n    if (feedRange) {\n      return feedRange;\n    } else {\n      throw new ErrorResponse(\"No feed range found.\");\n    }\n  }\n}\n"]}