@azure/cosmos 4.5.0 → 4.5.1

package/dist/commonjs/bulk/BulkResponse.js

@@ -12,8 +12,13 @@ const batch_js_1 = require("../utils/batch.js");
  * @hidden
  */
 class BulkResponse {
+    statusCode;
+    subStatusCode;
+    headers;
+    operations;
+    results = [];
+    diagnostics;
     constructor(statusCode, subStatusCode, headers, operations) {
-        this.results = [];
         this.statusCode = statusCode;
         this.subStatusCode = subStatusCode;
         this.headers = headers;
@@ -31,7 +36,6 @@ class BulkResponse {
      * static method to create BulkResponse from Response object
      */
     static fromResponseMessage(responseMessage, operations) {
-        var _a;
         // Create and populate the response object
         let bulkResponse = this.populateFromResponse(responseMessage, operations);
         if (!bulkResponse.results || bulkResponse.results.length !== operations.length) {
@@ -43,7 +47,7 @@ class BulkResponse {
             // When the overall response status code is TooManyRequests, propagate the RetryAfter into the individual operations.
             let retryAfterMilliseconds = 0;
             if (responseMessage.code === statusCodes_js_1.StatusCodes.TooManyRequests) {
-                const retryAfter = (_a = responseMessage.headers) === null || _a === void 0 ? void 0 : _a[constants_js_1.Constants.HttpHeaders.RetryAfterInMs];
+                const retryAfter = responseMessage.headers?.[constants_js_1.Constants.HttpHeaders.RetryAfterInMs];
                 retryAfterMilliseconds = !retryAfter || isNaN(Number(retryAfter)) ? 0 : Number(retryAfter);
             }
             bulkResponse.createAndPopulateResults(operations, retryAfterMilliseconds, responseMessage);
@@ -51,19 +55,18 @@ class BulkResponse {
         return bulkResponse;
     }
     static populateFromResponse(responseMessage, operations) {
-        var _a, _b, _c;
         const results = [];
         if (responseMessage.result) {
             for (let i = 0; i < operations.length; i++) {
                 const itemResponse = responseMessage.result[i];
-                if ((0, batch_js_1.isSuccessStatusCode)(itemResponse === null || itemResponse === void 0 ? void 0 : itemResponse.statusCode)) {
+                if ((0, batch_js_1.isSuccessStatusCode)(itemResponse?.statusCode)) {
                     const result = {
-                        statusCode: itemResponse === null || itemResponse === void 0 ? void 0 : itemResponse.statusCode,
-                        eTag: itemResponse === null || itemResponse === void 0 ? void 0 : itemResponse.eTag,
-                        activityId: (_a = responseMessage.headers) === null || _a === void 0 ? void 0 : _a[constants_js_1.Constants.HttpHeaders.ActivityId],
-                        sessionToken: (_b = responseMessage.headers) === null || _b === void 0 ? void 0 : _b[constants_js_1.Constants.HttpHeaders.SessionToken],
-                        requestCharge: itemResponse === null || itemResponse === void 0 ? void 0 : itemResponse.requestCharge,
-                        resourceBody: itemResponse === null || itemResponse === void 0 ? void 0 : itemResponse.resourceBody,
+                        statusCode: itemResponse?.statusCode,
+                        eTag: itemResponse?.eTag,
+                        activityId: responseMessage.headers?.[constants_js_1.Constants.HttpHeaders.ActivityId],
+                        sessionToken: responseMessage.headers?.[constants_js_1.Constants.HttpHeaders.SessionToken],
+                        requestCharge: itemResponse?.requestCharge,
+                        resourceBody: itemResponse?.resourceBody,
                         // diagnostics will be filled in Batcher dispatch to capture the complete diagnostics(e.g. decryption)
                         diagnostics: null,
                         headers: responseMessage.headers,
@@ -72,14 +75,14 @@ class BulkResponse {
                 }
                 else {
                     const error = new index_js_1.ErrorResponse();
-                    error.code = itemResponse === null || itemResponse === void 0 ? void 0 : itemResponse.statusCode;
-                    error.substatus = itemResponse === null || itemResponse === void 0 ? void 0 : itemResponse.subStatusCode;
-                    error.message = itemResponse === null || itemResponse === void 0 ? void 0 : itemResponse.message;
-                    error.requestCharge = itemResponse === null || itemResponse === void 0 ? void 0 : itemResponse.requestCharge;
-                    error.body = itemResponse === null || itemResponse === void 0 ? void 0 : itemResponse.resourceBody;
+                    error.code = itemResponse?.statusCode;
+                    error.substatus = itemResponse?.subStatusCode;
+                    error.message = itemResponse?.message;
+                    error.requestCharge = itemResponse?.requestCharge;
+                    error.body = itemResponse?.resourceBody;
                     error.headers = responseMessage.headers;
-                    error.activityId = (_c = responseMessage.headers) === null || _c === void 0 ? void 0 : _c[constants_js_1.Constants.HttpHeaders.ActivityId];
-                    error.retryAfterInMs = itemResponse === null || itemResponse === void 0 ? void 0 : itemResponse.retryAfterMilliseconds;
+                    error.activityId = responseMessage.headers?.[constants_js_1.Constants.HttpHeaders.ActivityId];
+                    error.retryAfterInMs = itemResponse?.retryAfterMilliseconds;
                     error.diagnostics = responseMessage.diagnostics;
                     results.push(error);
                 }
@@ -104,13 +107,12 @@ class BulkResponse {
     }
     createAndPopulateResults(operations, retryAfterInMs, error) {
         this.results = operations.map(() => {
-            var _a;
             const errorResponse = new index_js_1.ErrorResponse();
             errorResponse.message = error.message;
             errorResponse.code = this.statusCode;
             errorResponse.substatus = this.subStatusCode;
             errorResponse.retryAfterInMs = retryAfterInMs;
-            errorResponse.activityId = (_a = this.headers) === null || _a === void 0 ? void 0 : _a[constants_js_1.Constants.HttpHeaders.ActivityId];
+            errorResponse.activityId = this.headers?.[constants_js_1.Constants.HttpHeaders.ActivityId];
             errorResponse.body = error.body;
             errorResponse.diagnostics = error.diagnostics;
             errorResponse.headers = this.headers;

package/dist/commonjs/bulk/BulkResponse.js.map

@@ -1 +1 @@
-{"version":3,"file":"BulkResponse.js","sourceRoot":"","sources":["../../../src/bulk/BulkResponse.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;AAElC,yDAAmD;AACnD,6DAAuE;AAEvE,0CAA4C;AAI5C,gDAAwD;AAGxD;;;GAGG;AAEH,MAAa,YAAY;IAQvB,YACE,UAAsB,EACtB,aAA4B,EAC5B,OAAsB,EACtB,UAA2B;QAP7B,YAAO,GAAkD,EAAE,CAAC;QAS1D,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,mBAAmB,CACxB,UAA2B,EAC3B,UAAsB,EACtB,aAA4B,EAC5B,OAAsB;QAEtB,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,UAAU,EAAE,aAAa,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QACtF,YAAY,CAAC,wBAAwB,CAAC,UAAU,EAAE,CAAC,EAAE,IAAI,wBAAa,EAAE,CAAC,CAAC;QAC1E,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,mBAAmB,CACxB,eAA8B,EAC9B,UAA2B;;QAE3B,0CAA0C;QAC1C,IAAI,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,eAAe,EAAE,UAAU,CAAC,CAAC;QAE1E,IAAI,CAAC,YAAY,CAAC,OAAO,IAAI,YAAY,CAAC,OAAO,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,EAAE,CAAC;YAC/E,2EAA2E;YAC3E,wFAAwF;YACxF,IAAI,IAAA,8BAAmB,EAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9C,YAAY,GAAG,IAAI,YAAY,CAC7B,4BAAW,CAAC,mBAAmB,EAC/B,+BAAc,CAAC,OAAO,EACtB,eAAe,CAAC,OAAO,EACvB,UAAU,CACX,CAAC;YACJ,CAAC;YAED,qHAAqH;YACrH,IAAI,sBAAsB,GAAG,CAAC,CAAC;YAE/B,IAAI,eAAe,CAAC,IAAI,KAAK,4BAAW,CAAC,eAAe,EAAE,CAAC;gBACzD,MAAM,UAAU,GAAG,MAAA,eAAe,CAAC,OAAO,0CAAG,wBAAS,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;gBACnF,sBAAsB,GAAG,CAAC,UAAU,IAAI,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC7F,CAAC;YAED,YAAY,CAAC,wBAAwB,CACnC,UAAU,EACV,sBAAsB,EACtB,eAAgC,CACjC,CAAC;QACJ,CAAC;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAEO,MAAM,CAAC,oBAAoB,CACjC,eAA8B,EAC9B,UAA2B;;QAE3B,MAAM,OAAO,GAAkD,EAAE,CAAC;QAElE,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,YAAY,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAE/C,IAAI,IAAA,8BAAmB,EAAC,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,UAAU,CAAC,EAAE,CAAC;oBAClD,MAAM,MAAM,GAA8B;wBACxC,UAAU,EAAE,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,UAAU;wBACpC,IAAI,EAAE,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,IAAI;wBACxB,UAAU,EAAE,MAAA,eAAe,CAAC,OAAO,0CAAG,wBAAS,CAAC,WAAW,CAAC,UAAU,CAAC;wBACvE,YAAY,EAAE,MAAA,eAAe,CAAC,OAAO,0CAAG,wBAAS,CAAC,WAAW,CAAC,YAAY,CAAC;wBAC3E,aAAa,EAAE,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,aAAa;wBAC1C,YAAY,EAAE,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,YAAY;wBACxC,sGAAsG;wBACtG,WAAW,EAAE,IAAI;wBACjB,OAAO,EAAE,eAAe,CAAC,OAAO;qBACjC,CAAC;oBACF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvB,CAAC;qBAAM,CAAC;oBACN,MAAM,KAAK,GAAkB,IAAI,wBAAa,EAAE,CAAC;oBACjD,KAAK,CAAC,IAAI,GAAG,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,UAAU,CAAC;oBACtC,KAAK,CAAC,SAAS,GAAG,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,aAAa,CAAC;oBAC9C,KAAK,CAAC,OAAO,GAAG,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,OAAO,CAAC;oBACtC,KAAK,CAAC,aAAa,GAAG,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,aAAa,CAAC;oBAClD,KAAK,CAAC,IAAI,GAAG,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,YAAY,CAAC;oBACxC,KAAK,CAAC,OAAO,GAAG,eAAe,CAAC,OAAO,CAAC;oBACxC,KAAK,CAAC,UAAU,GAAG,MAAA,eAAe,CAAC,OAAO,0CAAG,wBAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;oBAC/E,KAAK,CAAC,cAAc,GAAG,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAE,sBAAsB,CAAC;oBAC5D,KAAK,CAAC,WAAW,GAAG,eAAe,CAAC,WAAW,CAAC;oBAChD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,UAAU,GAAG,eAAe,CAAC,IAAI,CAAC;QACtC,IAAI,aAAa,GAAG,eAAe,CAAC,SAAS,CAAC;QAE9C,IAAI,eAAe,CAAC,IAAI,KAAK,4BAAW,CAAC,WAAW,EAAE,CAAC;YACrD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IACE,MAAM,YAAY,wBAAa;oBAC/B,MAAM,CAAC,UAAU,KAAK,4BAAW,CAAC,gBAAgB;oBAClD,MAAM,CAAC,UAAU,IAAI,4BAAW,CAAC,UAAU,EAC3C,CAAC;oBACD,UAAU,GAAG,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBACjF,aAAa,GAAG,MAAM,CAAC,SAAS,CAAC;oBACjC,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,YAAY,CACnC,UAAU,EACV,aAAa,EACb,eAAe,CAAC,OAAO,EACvB,UAAU,CACX,CAAC;QACF,YAAY,CAAC,OAAO,GAAG,OAAO,CAAC;QAC/B,OAAO,YAAY,CAAC;IACtB,CAAC;IAEO,wBAAwB,CAC9B,UAA2B,EAC3B,cAAsB,EACtB,KAAoB;QAEpB,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE;;YACjC,MAAM,aAAa,GAAG,IAAI,wBAAa,EAAE,CAAC;YAC1C,aAAa,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;YACtC,aAAa,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;YACrC,aAAa,CAAC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;YAC7C,aAAa,CAAC,cAAc,GAAG,cAAc,CAAC;YAC9C,aAAa,CAAC,UAAU,GAAG,MAAA,IAAI,CAAC,OAAO,0CAAG,wBAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAC5E,aAAa,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;YAChC,aAAa,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;YAC9C,aAAa,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;YACrC,aAAa,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC;YAClD,OAAO,aAAa,CAAC;QACvB,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AA7JD,oCA6JC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { Constants } from \"../common/constants.js\";\nimport { StatusCodes, SubStatusCodes } from \"../common/statusCodes.js\";\nimport type { CosmosDiagnostics, Response } from \"../index.js\";\nimport { ErrorResponse } from \"../index.js\";\nimport type { CosmosHeaders } from \"../queryExecutionContext/headerUtils.js\";\nimport type { StatusCode, SubStatusCode } from \"../request/StatusCodes.js\";\nimport type { ExtendedOperationResponse } from \"../utils/batch.js\";\nimport { isSuccessStatusCode } from \"../utils/batch.js\";\nimport type { ItemOperation } from \"./index.js\";\n\n/**\n * Represents a batch response for bulk request.\n * @hidden\n */\n\nexport class BulkResponse {\n  statusCode: StatusCode;\n  subStatusCode: SubStatusCode;\n  headers: CosmosHeaders;\n  operations: ItemOperation[];\n  results: (ExtendedOperationResponse | ErrorResponse)[] = [];\n  diagnostics: CosmosDiagnostics;\n\n  constructor(\n    statusCode: StatusCode,\n    subStatusCode: SubStatusCode,\n    headers: CosmosHeaders,\n    operations: ItemOperation[],\n  ) {\n    this.statusCode = statusCode;\n    this.subStatusCode = subStatusCode;\n    this.headers = headers;\n    this.operations = operations;\n  }\n\n  /**\n   * Generate empty response object\n   */\n  static createEmptyResponse(\n    operations: ItemOperation[],\n    statusCode: StatusCode,\n    subStatusCode: SubStatusCode,\n    headers: CosmosHeaders,\n  ): BulkResponse {\n    const bulkResponse = new BulkResponse(statusCode, subStatusCode, headers, operations);\n    bulkResponse.createAndPopulateResults(operations, 0, new ErrorResponse());\n    return bulkResponse;\n  }\n\n  /**\n   * static method to create BulkResponse from Response object\n   */\n  static fromResponseMessage(\n    responseMessage: Response<any>,\n    operations: ItemOperation[],\n  ): BulkResponse {\n    // Create and populate the response object\n    let bulkResponse = this.populateFromResponse(responseMessage, operations);\n\n    if (!bulkResponse.results || bulkResponse.results.length !== operations.length) {\n      // Server should be guaranteeing number of results equal to operations when\n      // batch request is successful - so fail as InternalServerError if this is not the case.\n      if (isSuccessStatusCode(responseMessage.code)) {\n        bulkResponse = new BulkResponse(\n          StatusCodes.InternalServerError,\n          SubStatusCodes.Unknown,\n          responseMessage.headers,\n          operations,\n        );\n      }\n\n      // When the overall response status code is TooManyRequests, propagate the RetryAfter into the individual operations.\n      let retryAfterMilliseconds = 0;\n\n      if (responseMessage.code === StatusCodes.TooManyRequests) {\n        const retryAfter = responseMessage.headers?.[Constants.HttpHeaders.RetryAfterInMs];\n        retryAfterMilliseconds = !retryAfter || isNaN(Number(retryAfter)) ? 0 : Number(retryAfter);\n      }\n\n      bulkResponse.createAndPopulateResults(\n        operations,\n        retryAfterMilliseconds,\n        responseMessage as ErrorResponse,\n      );\n    }\n    return bulkResponse;\n  }\n\n  private static populateFromResponse(\n    responseMessage: Response<any>,\n    operations: ItemOperation[],\n  ): BulkResponse {\n    const results: (ExtendedOperationResponse | ErrorResponse)[] = [];\n\n    if (responseMessage.result) {\n      for (let i = 0; i < operations.length; i++) {\n        const itemResponse = responseMessage.result[i];\n\n        if (isSuccessStatusCode(itemResponse?.statusCode)) {\n          const result: ExtendedOperationResponse = {\n            statusCode: itemResponse?.statusCode,\n            eTag: itemResponse?.eTag,\n            activityId: responseMessage.headers?.[Constants.HttpHeaders.ActivityId],\n            sessionToken: responseMessage.headers?.[Constants.HttpHeaders.SessionToken],\n            requestCharge: itemResponse?.requestCharge,\n            resourceBody: itemResponse?.resourceBody,\n            // diagnostics will be filled in Batcher dispatch to capture the complete diagnostics(e.g. decryption)\n            diagnostics: null,\n            headers: responseMessage.headers,\n          };\n          results.push(result);\n        } else {\n          const error: ErrorResponse = new ErrorResponse();\n          error.code = itemResponse?.statusCode;\n          error.substatus = itemResponse?.subStatusCode;\n          error.message = itemResponse?.message;\n          error.requestCharge = itemResponse?.requestCharge;\n          error.body = itemResponse?.resourceBody;\n          error.headers = responseMessage.headers;\n          error.activityId = responseMessage.headers?.[Constants.HttpHeaders.ActivityId];\n          error.retryAfterInMs = itemResponse?.retryAfterMilliseconds;\n          error.diagnostics = responseMessage.diagnostics;\n          results.push(error);\n        }\n      }\n    }\n    let statusCode = responseMessage.code;\n    let subStatusCode = responseMessage.substatus;\n\n    if (responseMessage.code === StatusCodes.MultiStatus) {\n      for (const result of results) {\n        if (\n          result instanceof ErrorResponse &&\n          result.statusCode !== StatusCodes.FailedDependency &&\n          result.statusCode >= StatusCodes.BadRequest\n        ) {\n          statusCode = typeof result.code === \"number\" ? result.code : Number(result.code);\n          subStatusCode = result.substatus;\n          break;\n        }\n      }\n    }\n\n    const bulkResponse = new BulkResponse(\n      statusCode,\n      subStatusCode,\n      responseMessage.headers,\n      operations,\n    );\n    bulkResponse.results = results;\n    return bulkResponse;\n  }\n\n  private createAndPopulateResults(\n    operations: ItemOperation[],\n    retryAfterInMs: number,\n    error: ErrorResponse,\n  ): void {\n    this.results = operations.map(() => {\n      const errorResponse = new ErrorResponse();\n      errorResponse.message = error.message;\n      errorResponse.code = this.statusCode;\n      errorResponse.substatus = this.subStatusCode;\n      errorResponse.retryAfterInMs = retryAfterInMs;\n      errorResponse.activityId = this.headers?.[Constants.HttpHeaders.ActivityId];\n      errorResponse.body = error.body;\n      errorResponse.diagnostics = error.diagnostics;\n      errorResponse.headers = this.headers;\n      errorResponse.requestCharge = error.requestCharge;\n      return errorResponse;\n    });\n  }\n}\n"]}
+{"version":3,"file":"BulkResponse.js","sourceRoot":"","sources":["../../../src/bulk/BulkResponse.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;AAElC,yDAAmD;AACnD,6DAAuE;AAEvE,0CAA4C;AAI5C,gDAAwD;AAGxD;;;GAGG;AAEH,MAAa,YAAY;IACvB,UAAU,CAAa;IACvB,aAAa,CAAgB;IAC7B,OAAO,CAAgB;IACvB,UAAU,CAAkB;IAC5B,OAAO,GAAkD,EAAE,CAAC;IAC5D,WAAW,CAAoB;IAE/B,YACE,UAAsB,EACtB,aAA4B,EAC5B,OAAsB,EACtB,UAA2B;QAE3B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,mBAAmB,CACxB,UAA2B,EAC3B,UAAsB,EACtB,aAA4B,EAC5B,OAAsB;QAEtB,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,UAAU,EAAE,aAAa,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QACtF,YAAY,CAAC,wBAAwB,CAAC,UAAU,EAAE,CAAC,EAAE,IAAI,wBAAa,EAAE,CAAC,CAAC;QAC1E,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,mBAAmB,CACxB,eAA8B,EAC9B,UAA2B;QAE3B,0CAA0C;QAC1C,IAAI,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,eAAe,EAAE,UAAU,CAAC,CAAC;QAE1E,IAAI,CAAC,YAAY,CAAC,OAAO,IAAI,YAAY,CAAC,OAAO,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,EAAE,CAAC;YAC/E,2EAA2E;YAC3E,wFAAwF;YACxF,IAAI,IAAA,8BAAmB,EAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9C,YAAY,GAAG,IAAI,YAAY,CAC7B,4BAAW,CAAC,mBAAmB,EAC/B,+BAAc,CAAC,OAAO,EACtB,eAAe,CAAC,OAAO,EACvB,UAAU,CACX,CAAC;YACJ,CAAC;YAED,qHAAqH;YACrH,IAAI,sBAAsB,GAAG,CAAC,CAAC;YAE/B,IAAI,eAAe,CAAC,IAAI,KAAK,4BAAW,CAAC,eAAe,EAAE,CAAC;gBACzD,MAAM,UAAU,GAAG,eAAe,CAAC,OAAO,EAAE,CAAC,wBAAS,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;gBACnF,sBAAsB,GAAG,CAAC,UAAU,IAAI,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC7F,CAAC;YAED,YAAY,CAAC,wBAAwB,CACnC,UAAU,EACV,sBAAsB,EACtB,eAAgC,CACjC,CAAC;QACJ,CAAC;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAEO,MAAM,CAAC,oBAAoB,CACjC,eAA8B,EAC9B,UAA2B;QAE3B,MAAM,OAAO,GAAkD,EAAE,CAAC;QAElE,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,YAAY,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAE/C,IAAI,IAAA,8BAAmB,EAAC,YAAY,EAAE,UAAU,CAAC,EAAE,CAAC;oBAClD,MAAM,MAAM,GAA8B;wBACxC,UAAU,EAAE,YAAY,EAAE,UAAU;wBACpC,IAAI,EAAE,YAAY,EAAE,IAAI;wBACxB,UAAU,EAAE,eAAe,CAAC,OAAO,EAAE,CAAC,wBAAS,CAAC,WAAW,CAAC,UAAU,CAAC;wBACvE,YAAY,EAAE,eAAe,CAAC,OAAO,EAAE,CAAC,wBAAS,CAAC,WAAW,CAAC,YAAY,CAAC;wBAC3E,aAAa,EAAE,YAAY,EAAE,aAAa;wBAC1C,YAAY,EAAE,YAAY,EAAE,YAAY;wBACxC,sGAAsG;wBACtG,WAAW,EAAE,IAAI;wBACjB,OAAO,EAAE,eAAe,CAAC,OAAO;qBACjC,CAAC;oBACF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvB,CAAC;qBAAM,CAAC;oBACN,MAAM,KAAK,GAAkB,IAAI,wBAAa,EAAE,CAAC;oBACjD,KAAK,CAAC,IAAI,GAAG,YAAY,EAAE,UAAU,CAAC;oBACtC,KAAK,CAAC,SAAS,GAAG,YAAY,EAAE,aAAa,CAAC;oBAC9C,KAAK,CAAC,OAAO,GAAG,YAAY,EAAE,OAAO,CAAC;oBACtC,KAAK,CAAC,aAAa,GAAG,YAAY,EAAE,aAAa,CAAC;oBAClD,KAAK,CAAC,IAAI,GAAG,YAAY,EAAE,YAAY,CAAC;oBACxC,KAAK,CAAC,OAAO,GAAG,eAAe,CAAC,OAAO,CAAC;oBACxC,KAAK,CAAC,UAAU,GAAG,eAAe,CAAC,OAAO,EAAE,CAAC,wBAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;oBAC/E,KAAK,CAAC,cAAc,GAAG,YAAY,EAAE,sBAAsB,CAAC;oBAC5D,KAAK,CAAC,WAAW,GAAG,eAAe,CAAC,WAAW,CAAC;oBAChD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,UAAU,GAAG,eAAe,CAAC,IAAI,CAAC;QACtC,IAAI,aAAa,GAAG,eAAe,CAAC,SAAS,CAAC;QAE9C,IAAI,eAAe,CAAC,IAAI,KAAK,4BAAW,CAAC,WAAW,EAAE,CAAC;YACrD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IACE,MAAM,YAAY,wBAAa;oBAC/B,MAAM,CAAC,UAAU,KAAK,4BAAW,CAAC,gBAAgB;oBAClD,MAAM,CAAC,UAAU,IAAI,4BAAW,CAAC,UAAU,EAC3C,CAAC;oBACD,UAAU,GAAG,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBACjF,aAAa,GAAG,MAAM,CAAC,SAAS,CAAC;oBACjC,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,YAAY,CACnC,UAAU,EACV,aAAa,EACb,eAAe,CAAC,OAAO,EACvB,UAAU,CACX,CAAC;QACF,YAAY,CAAC,OAAO,GAAG,OAAO,CAAC;QAC/B,OAAO,YAAY,CAAC;IACtB,CAAC;IAEO,wBAAwB,CAC9B,UAA2B,EAC3B,cAAsB,EACtB,KAAoB;QAEpB,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE;YACjC,MAAM,aAAa,GAAG,IAAI,wBAAa,EAAE,CAAC;YAC1C,aAAa,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;YACtC,aAAa,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;YACrC,aAAa,CAAC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;YAC7C,aAAa,CAAC,cAAc,GAAG,cAAc,CAAC;YAC9C,aAAa,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,wBAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAC5E,aAAa,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;YAChC,aAAa,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;YAC9C,aAAa,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;YACrC,aAAa,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC;YAClD,OAAO,aAAa,CAAC;QACvB,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AA7JD,oCA6JC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { Constants } from \"../common/constants.js\";\nimport { StatusCodes, SubStatusCodes } from \"../common/statusCodes.js\";\nimport type { CosmosDiagnostics, Response } from \"../index.js\";\nimport { ErrorResponse } from \"../index.js\";\nimport type { CosmosHeaders } from \"../queryExecutionContext/headerUtils.js\";\nimport type { StatusCode, SubStatusCode } from \"../request/StatusCodes.js\";\nimport type { ExtendedOperationResponse } from \"../utils/batch.js\";\nimport { isSuccessStatusCode } from \"../utils/batch.js\";\nimport type { ItemOperation } from \"./index.js\";\n\n/**\n * Represents a batch response for bulk request.\n * @hidden\n */\n\nexport class BulkResponse {\n  statusCode: StatusCode;\n  subStatusCode: SubStatusCode;\n  headers: CosmosHeaders;\n  operations: ItemOperation[];\n  results: (ExtendedOperationResponse | ErrorResponse)[] = [];\n  diagnostics: CosmosDiagnostics;\n\n  constructor(\n    statusCode: StatusCode,\n    subStatusCode: SubStatusCode,\n    headers: CosmosHeaders,\n    operations: ItemOperation[],\n  ) {\n    this.statusCode = statusCode;\n    this.subStatusCode = subStatusCode;\n    this.headers = headers;\n    this.operations = operations;\n  }\n\n  /**\n   * Generate empty response object\n   */\n  static createEmptyResponse(\n    operations: ItemOperation[],\n    statusCode: StatusCode,\n    subStatusCode: SubStatusCode,\n    headers: CosmosHeaders,\n  ): BulkResponse {\n    const bulkResponse = new BulkResponse(statusCode, subStatusCode, headers, operations);\n    bulkResponse.createAndPopulateResults(operations, 0, new ErrorResponse());\n    return bulkResponse;\n  }\n\n  /**\n   * static method to create BulkResponse from Response object\n   */\n  static fromResponseMessage(\n    responseMessage: Response<any>,\n    operations: ItemOperation[],\n  ): BulkResponse {\n    // Create and populate the response object\n    let bulkResponse = this.populateFromResponse(responseMessage, operations);\n\n    if (!bulkResponse.results || bulkResponse.results.length !== operations.length) {\n      // Server should be guaranteeing number of results equal to operations when\n      // batch request is successful - so fail as InternalServerError if this is not the case.\n      if (isSuccessStatusCode(responseMessage.code)) {\n        bulkResponse = new BulkResponse(\n          StatusCodes.InternalServerError,\n          SubStatusCodes.Unknown,\n          responseMessage.headers,\n          operations,\n        );\n      }\n\n      // When the overall response status code is TooManyRequests, propagate the RetryAfter into the individual operations.\n      let retryAfterMilliseconds = 0;\n\n      if (responseMessage.code === StatusCodes.TooManyRequests) {\n        const retryAfter = responseMessage.headers?.[Constants.HttpHeaders.RetryAfterInMs];\n        retryAfterMilliseconds = !retryAfter || isNaN(Number(retryAfter)) ? 0 : Number(retryAfter);\n      }\n\n      bulkResponse.createAndPopulateResults(\n        operations,\n        retryAfterMilliseconds,\n        responseMessage as ErrorResponse,\n      );\n    }\n    return bulkResponse;\n  }\n\n  private static populateFromResponse(\n    responseMessage: Response<any>,\n    operations: ItemOperation[],\n  ): BulkResponse {\n    const results: (ExtendedOperationResponse | ErrorResponse)[] = [];\n\n    if (responseMessage.result) {\n      for (let i = 0; i < operations.length; i++) {\n        const itemResponse = responseMessage.result[i];\n\n        if (isSuccessStatusCode(itemResponse?.statusCode)) {\n          const result: ExtendedOperationResponse = {\n            statusCode: itemResponse?.statusCode,\n            eTag: itemResponse?.eTag,\n            activityId: responseMessage.headers?.[Constants.HttpHeaders.ActivityId],\n            sessionToken: responseMessage.headers?.[Constants.HttpHeaders.SessionToken],\n            requestCharge: itemResponse?.requestCharge,\n            resourceBody: itemResponse?.resourceBody,\n            // diagnostics will be filled in Batcher dispatch to capture the complete diagnostics(e.g. decryption)\n            diagnostics: null,\n            headers: responseMessage.headers,\n          };\n          results.push(result);\n        } else {\n          const error: ErrorResponse = new ErrorResponse();\n          error.code = itemResponse?.statusCode;\n          error.substatus = itemResponse?.subStatusCode;\n          error.message = itemResponse?.message;\n          error.requestCharge = itemResponse?.requestCharge;\n          error.body = itemResponse?.resourceBody;\n          error.headers = responseMessage.headers;\n          error.activityId = responseMessage.headers?.[Constants.HttpHeaders.ActivityId];\n          error.retryAfterInMs = itemResponse?.retryAfterMilliseconds;\n          error.diagnostics = responseMessage.diagnostics;\n          results.push(error);\n        }\n      }\n    }\n    let statusCode = responseMessage.code;\n    let subStatusCode = responseMessage.substatus;\n\n    if (responseMessage.code === StatusCodes.MultiStatus) {\n      for (const result of results) {\n        if (\n          result instanceof ErrorResponse &&\n          result.statusCode !== StatusCodes.FailedDependency &&\n          result.statusCode >= StatusCodes.BadRequest\n        ) {\n          statusCode = typeof result.code === \"number\" ? result.code : Number(result.code);\n          subStatusCode = result.substatus;\n          break;\n        }\n      }\n    }\n\n    const bulkResponse = new BulkResponse(\n      statusCode,\n      subStatusCode,\n      responseMessage.headers,\n      operations,\n    );\n    bulkResponse.results = results;\n    return bulkResponse;\n  }\n\n  private createAndPopulateResults(\n    operations: ItemOperation[],\n    retryAfterInMs: number,\n    error: ErrorResponse,\n  ): void {\n    this.results = operations.map(() => {\n      const errorResponse = new ErrorResponse();\n      errorResponse.message = error.message;\n      errorResponse.code = this.statusCode;\n      errorResponse.substatus = this.subStatusCode;\n      errorResponse.retryAfterInMs = retryAfterInMs;\n      errorResponse.activityId = this.headers?.[Constants.HttpHeaders.ActivityId];\n      errorResponse.body = error.body;\n      errorResponse.diagnostics = error.diagnostics;\n      errorResponse.headers = this.headers;\n      errorResponse.requestCharge = error.requestCharge;\n      return errorResponse;\n    });\n  }\n}\n"]}

package/dist/commonjs/bulk/CongestionAlgorithm.js

@@ -16,11 +16,18 @@ const constants_js_1 = require("../common/constants.js");
  * @hidden
  */
 class CongestionAlgorithm {
+    // The semaphore to control the degree of concurrency.
+    limiterQueue;
+    // captures metrics upto previous requests for a partition.
+    oldPartitionMetric;
+    // captures metrics upto current request for a partition.
+    partitionMetric;
+    // time to wait before adjusting the degree of concurrency.
+    congestionWaitTimeInMs = 1000;
+    congestionIncreaseFactor = 1;
+    congestionDecreaseFactor = 5;
+    currentDegreeOfConcurrency;
     constructor(limiterQueue, partitionMetric, oldPartitionMetric) {
-        // time to wait before adjusting the degree of concurrency.
-        this.congestionWaitTimeInMs = 1000;
-        this.congestionIncreaseFactor = 1;
-        this.congestionDecreaseFactor = 5;
         this.limiterQueue = limiterQueue;
         this.oldPartitionMetric = oldPartitionMetric;
         this.partitionMetric = partitionMetric;

package/dist/commonjs/bulk/CongestionAlgorithm.js.map

@@ -1 +1 @@
-{"version":3,"file":"CongestionAlgorithm.js","sourceRoot":"","sources":["../../../src/bulk/CongestionAlgorithm.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;AAElC,yDAAmD;AAInD;;;;;;;;;;GAUG;AAEH,MAAa,mBAAmB;IAa9B,YACE,YAA0B,EAC1B,eAAgC,EAChC,kBAAmC;QATrC,2DAA2D;QACnD,2BAAsB,GAAW,IAAI,CAAC;QACtC,6BAAwB,GAAW,CAAC,CAAC;QACrC,6BAAwB,GAAW,CAAC,CAAC;QAQ3C,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;QAC7C,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,0BAA0B,GAAG,CAAC,CAAC;IACtC,CAAC;IAED,GAAG;QACD,MAAM,eAAe,GACnB,IAAI,CAAC,eAAe,CAAC,aAAa,GAAG,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC;QAE7E,IAAI,eAAe,IAAI,IAAI,CAAC,sBAAsB,EAAE,CAAC;YACnD,MAAM,YAAY,GAChB,IAAI,CAAC,eAAe,CAAC,iBAAiB,GAAG,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC;YACrF,MAAM,gBAAgB,GACpB,IAAI,CAAC,eAAe,CAAC,uBAAuB;gBAC5C,IAAI,CAAC,kBAAkB,CAAC,uBAAuB,CAAC;YAElD,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,gBAAgB,EAAE,eAAe,EAAE,YAAY,CAAC,CAAC;YAC7E,4EAA4E;YAC5E,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;gBACrB,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,CAAC;YACD,4GAA4G;YAC5G,IAAI,gBAAgB,GAAG,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;gBAC/C,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IAEO,mBAAmB;QACzB,2DAA2D;QAC3D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAC5B,IAAI,CAAC,wBAAwB,EAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,0BAA0B,GAAG,CAAC,CAAC,CAChD,CAAC;QACF,IAAI,CAAC,0BAA0B,IAAI,aAAa,CAAC;QACjD,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;QAClE,oFAAoF;QACpF,IAAI,CAAC,sBAAsB,IAAI,IAAI,CAAC;IACtC,CAAC;IAEO,mBAAmB;QACzB,IACE,IAAI,CAAC,0BAA0B,GAAG,IAAI,CAAC,wBAAwB;YAC/D,wBAAS,CAAC,0BAA0B,EACpC,CAAC;YACD,IAAI,CAAC,0BAA0B,IAAI,IAAI,CAAC,wBAAwB,CAAC;YACjE,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;CACF;AApED,kDAoEC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { Constants } from \"../common/constants.js\";\nimport type { PartitionMetric } from \"./PartitionMetric.js\";\nimport type { LimiterQueue } from \"./Limiter.js\";\n\n/**\n * This class implements a congestion control algorithm which dynamically adjusts the degree\n * of concurrency based on the throttling and number of processed items.\n * For example, if it sees any throttling in requests from the last time the algorithm ran, it will decrease the\n * degree of concurrency (either by a factor of 5 or half the current degree of concurrency, whichever is smaller)\n * and increase the wait time to run the algorithm again by 1 second.\n * If it sees no throttling and the number of items processed increased, it will increase the degree of concurrency\n * (by a factor of 1) which cannot exceed the max degree of concurrency (Min(20, concurrency set by user)).\n * It uses the @see {@link PartitionMetric} to capture the metrics.\n * @hidden\n */\n\nexport class CongestionAlgorithm {\n  // The semaphore to control the degree of concurrency.\n  private limiterQueue: LimiterQueue;\n  // captures metrics upto previous requests for a partition.\n  private oldPartitionMetric: PartitionMetric;\n  // captures metrics upto current request for a partition.\n  private partitionMetric: PartitionMetric;\n  // time to wait before adjusting the degree of concurrency.\n  private congestionWaitTimeInMs: number = 1000;\n  private congestionIncreaseFactor: number = 1;\n  private congestionDecreaseFactor: number = 5;\n  private currentDegreeOfConcurrency: number;\n\n  constructor(\n    limiterQueue: LimiterQueue,\n    partitionMetric: PartitionMetric,\n    oldPartitionMetric: PartitionMetric,\n  ) {\n    this.limiterQueue = limiterQueue;\n    this.oldPartitionMetric = oldPartitionMetric;\n    this.partitionMetric = partitionMetric;\n    this.currentDegreeOfConcurrency = 1;\n  }\n\n  run(): void {\n    const elapsedTimeInMs =\n      this.partitionMetric.timeTakenInMs - this.oldPartitionMetric.timeTakenInMs;\n\n    if (elapsedTimeInMs >= this.congestionWaitTimeInMs) {\n      const diffThrottle =\n        this.partitionMetric.numberOfThrottles - this.oldPartitionMetric.numberOfThrottles;\n      const changeItemsCount =\n        this.partitionMetric.numberOfItemsOperatedOn -\n        this.oldPartitionMetric.numberOfItemsOperatedOn;\n\n      this.oldPartitionMetric.add(changeItemsCount, elapsedTimeInMs, diffThrottle);\n      // if the number of throttles increased, decrease the degree of concurrency.\n      if (diffThrottle > 0) {\n        this.decreaseConcurrency();\n      }\n      // if there's no throttling and the number of items processed increased, increase the degree of concurrency.\n      if (changeItemsCount > 0 && diffThrottle === 0) {\n        this.increaseConcurrency();\n      }\n    }\n  }\n\n  private decreaseConcurrency(): void {\n    // decrease should not lead the degree of concurrency as 0.\n    const decreaseCount = Math.min(\n      this.congestionDecreaseFactor,\n      Math.floor(this.currentDegreeOfConcurrency / 2),\n    );\n    this.currentDegreeOfConcurrency -= decreaseCount;\n    this.limiterQueue.setConcurrency(this.currentDegreeOfConcurrency);\n    // In case of throttling increase the wait time to adjust the degree of concurrency.\n    this.congestionWaitTimeInMs += 1000;\n  }\n\n  private increaseConcurrency(): void {\n    if (\n      this.currentDegreeOfConcurrency + this.congestionIncreaseFactor <=\n      Constants.BulkMaxDegreeOfConcurrency\n    ) {\n      this.currentDegreeOfConcurrency += this.congestionIncreaseFactor;\n      this.limiterQueue.setConcurrency(this.currentDegreeOfConcurrency);\n    }\n  }\n}\n"]}
+{"version":3,"file":"CongestionAlgorithm.js","sourceRoot":"","sources":["../../../src/bulk/CongestionAlgorithm.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;AAElC,yDAAmD;AAInD;;;;;;;;;;GAUG;AAEH,MAAa,mBAAmB;IAC9B,sDAAsD;IAC9C,YAAY,CAAe;IACnC,2DAA2D;IACnD,kBAAkB,CAAkB;IAC5C,yDAAyD;IACjD,eAAe,CAAkB;IACzC,2DAA2D;IACnD,sBAAsB,GAAW,IAAI,CAAC;IACtC,wBAAwB,GAAW,CAAC,CAAC;IACrC,wBAAwB,GAAW,CAAC,CAAC;IACrC,0BAA0B,CAAS;IAE3C,YACE,YAA0B,EAC1B,eAAgC,EAChC,kBAAmC;QAEnC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;QAC7C,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,0BAA0B,GAAG,CAAC,CAAC;IACtC,CAAC;IAED,GAAG;QACD,MAAM,eAAe,GACnB,IAAI,CAAC,eAAe,CAAC,aAAa,GAAG,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC;QAE7E,IAAI,eAAe,IAAI,IAAI,CAAC,sBAAsB,EAAE,CAAC;YACnD,MAAM,YAAY,GAChB,IAAI,CAAC,eAAe,CAAC,iBAAiB,GAAG,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC;YACrF,MAAM,gBAAgB,GACpB,IAAI,CAAC,eAAe,CAAC,uBAAuB;gBAC5C,IAAI,CAAC,kBAAkB,CAAC,uBAAuB,CAAC;YAElD,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,gBAAgB,EAAE,eAAe,EAAE,YAAY,CAAC,CAAC;YAC7E,4EAA4E;YAC5E,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;gBACrB,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,CAAC;YACD,4GAA4G;YAC5G,IAAI,gBAAgB,GAAG,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;gBAC/C,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IAEO,mBAAmB;QACzB,2DAA2D;QAC3D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAC5B,IAAI,CAAC,wBAAwB,EAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,0BAA0B,GAAG,CAAC,CAAC,CAChD,CAAC;QACF,IAAI,CAAC,0BAA0B,IAAI,aAAa,CAAC;QACjD,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;QAClE,oFAAoF;QACpF,IAAI,CAAC,sBAAsB,IAAI,IAAI,CAAC;IACtC,CAAC;IAEO,mBAAmB;QACzB,IACE,IAAI,CAAC,0BAA0B,GAAG,IAAI,CAAC,wBAAwB;YAC/D,wBAAS,CAAC,0BAA0B,EACpC,CAAC;YACD,IAAI,CAAC,0BAA0B,IAAI,IAAI,CAAC,wBAAwB,CAAC;YACjE,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;CACF;AApED,kDAoEC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { Constants } from \"../common/constants.js\";\nimport type { PartitionMetric } from \"./PartitionMetric.js\";\nimport type { LimiterQueue } from \"./Limiter.js\";\n\n/**\n * This class implements a congestion control algorithm which dynamically adjusts the degree\n * of concurrency based on the throttling and number of processed items.\n * For example, if it sees any throttling in requests from the last time the algorithm ran, it will decrease the\n * degree of concurrency (either by a factor of 5 or half the current degree of concurrency, whichever is smaller)\n * and increase the wait time to run the algorithm again by 1 second.\n * If it sees no throttling and the number of items processed increased, it will increase the degree of concurrency\n * (by a factor of 1) which cannot exceed the max degree of concurrency (Min(20, concurrency set by user)).\n * It uses the @see {@link PartitionMetric} to capture the metrics.\n * @hidden\n */\n\nexport class CongestionAlgorithm {\n  // The semaphore to control the degree of concurrency.\n  private limiterQueue: LimiterQueue;\n  // captures metrics upto previous requests for a partition.\n  private oldPartitionMetric: PartitionMetric;\n  // captures metrics upto current request for a partition.\n  private partitionMetric: PartitionMetric;\n  // time to wait before adjusting the degree of concurrency.\n  private congestionWaitTimeInMs: number = 1000;\n  private congestionIncreaseFactor: number = 1;\n  private congestionDecreaseFactor: number = 5;\n  private currentDegreeOfConcurrency: number;\n\n  constructor(\n    limiterQueue: LimiterQueue,\n    partitionMetric: PartitionMetric,\n    oldPartitionMetric: PartitionMetric,\n  ) {\n    this.limiterQueue = limiterQueue;\n    this.oldPartitionMetric = oldPartitionMetric;\n    this.partitionMetric = partitionMetric;\n    this.currentDegreeOfConcurrency = 1;\n  }\n\n  run(): void {\n    const elapsedTimeInMs =\n      this.partitionMetric.timeTakenInMs - this.oldPartitionMetric.timeTakenInMs;\n\n    if (elapsedTimeInMs >= this.congestionWaitTimeInMs) {\n      const diffThrottle =\n        this.partitionMetric.numberOfThrottles - this.oldPartitionMetric.numberOfThrottles;\n      const changeItemsCount =\n        this.partitionMetric.numberOfItemsOperatedOn -\n        this.oldPartitionMetric.numberOfItemsOperatedOn;\n\n      this.oldPartitionMetric.add(changeItemsCount, elapsedTimeInMs, diffThrottle);\n      // if the number of throttles increased, decrease the degree of concurrency.\n      if (diffThrottle > 0) {\n        this.decreaseConcurrency();\n      }\n      // if there's no throttling and the number of items processed increased, increase the degree of concurrency.\n      if (changeItemsCount > 0 && diffThrottle === 0) {\n        this.increaseConcurrency();\n      }\n    }\n  }\n\n  private decreaseConcurrency(): void {\n    // decrease should not lead the degree of concurrency as 0.\n    const decreaseCount = Math.min(\n      this.congestionDecreaseFactor,\n      Math.floor(this.currentDegreeOfConcurrency / 2),\n    );\n    this.currentDegreeOfConcurrency -= decreaseCount;\n    this.limiterQueue.setConcurrency(this.currentDegreeOfConcurrency);\n    // In case of throttling increase the wait time to adjust the degree of concurrency.\n    this.congestionWaitTimeInMs += 1000;\n  }\n\n  private increaseConcurrency(): void {\n    if (\n      this.currentDegreeOfConcurrency + this.congestionIncreaseFactor <=\n      Constants.BulkMaxDegreeOfConcurrency\n    ) {\n      this.currentDegreeOfConcurrency += this.congestionIncreaseFactor;\n      this.limiterQueue.setConcurrency(this.currentDegreeOfConcurrency);\n    }\n  }\n}\n"]}

package/dist/commonjs/bulk/HelperPerPartition.js

@@ -16,8 +16,21 @@ const Limiter_js_1 = require("./Limiter.js");
  * @hidden
  */
 class HelperPerPartition {
+    executor;
+    retrier;
+    currentBatcher;
+    lock;
+    partitionMetric;
+    oldPartitionMetric;
+    diagnosticLevel;
+    encryptionEnabled;
+    encryptionProcessor;
+    clientConfigDiagnostics;
+    congestionControlAlgorithm;
+    dispatchLimiterQueue;
+    initialConcurrency = 1;
+    processedOperationCountRef;
     constructor(executor, retrier, refreshpartitionKeyRangeCache, diagnosticLevel, encryptionEnabled, clientConfig, encryptionProcessor, processedOperationCountRef) {
-        this.initialConcurrency = 1;
         this.executor = executor;
         this.retrier = retrier;
         this.diagnosticLevel = diagnosticLevel;

package/dist/commonjs/bulk/HelperPerPartition.js.map

@@ -1 +1 @@
-{"version":3,"file":"HelperPerPartition.js","sourceRoot":"","sources":["../../../src/bulk/HelperPerPartition.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;;AAElC,kEAAkC;AAClC,6DAAuD;AAKvD,6CAAuC;AACvC,qEAA+D;AAC/D,6DAAuD;AAEvD,6CAA4C;AAE5C;;;;GAIG;AAEH,MAAa,kBAAkB;IAgB7B,YACE,QAAyB,EACzB,OAAsB,EACtB,6BAAwF,EACxF,eAAwC,EACxC,iBAA0B,EAC1B,YAAoC,EACpC,mBAAwC,EACxC,0BAA6C;QAXvC,uBAAkB,GAAW,CAAC,CAAC;QAarC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;QAC3C,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,CAAC;QAC/C,IAAI,CAAC,uBAAuB,GAAG,YAAY,CAAC;QAC5C,IAAI,CAAC,kBAAkB,GAAG,IAAI,oCAAe,EAAE,CAAC;QAChD,IAAI,CAAC,eAAe,GAAG,IAAI,oCAAe,EAAE,CAAC;QAC7C,IAAI,CAAC,0BAA0B,GAAG,0BAA0B,CAAC;QAC7D,IAAI,CAAC,IAAI,GAAG,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,oBAAoB,GAAG,IAAI,yBAAY,CAC1C,IAAI,CAAC,kBAAkB,EACvB,IAAI,CAAC,eAAe,EACpB,IAAI,CAAC,OAAO,EACZ,6BAA6B,CAC9B,CAAC;QACF,IAAI,CAAC,0BAA0B,GAAG,IAAI,4CAAmB,CACvD,IAAI,CAAC,oBAAoB,EACzB,IAAI,CAAC,eAAe,EACpB,IAAI,CAAC,kBAAkB,CACxB,CAAC;QACF,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IAC7C,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,GAAG,CAAC,SAAwB;QAChC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;gBAClB,IAAI,CAAC;oBACH,wFAAwF;oBACxF,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,wBAAwB,EAAE,CAAC;wBAClD,IAAI,SAAS,EAAE,CAAC;4BACd,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBAC5C,CAAC;oBACH,CAAC;oBACD,yCAAyC;oBACzC,OAAO,EAAE,CAAC;gBACZ,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,MAAM,QAAQ,GAAwB;wBACpC,cAAc,EAAE,SAAS,CAAC,yBAAyB;wBACnD,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;4BAC3C,IAAI,EAAE,4BAAW,CAAC,mBAAmB;4BACrC,WAAW,EAAE,SAAS,CAAC,gBAAgB,CAAC,cAAc,CAAC,YAAY,CACjE,IAAI,CAAC,uBAAuB,CAC7B;yBACF,CAAC;qBACH,CAAC;oBACF,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAC1C,IAAI,CAAC,0BAA0B,CAAC,KAAK,EAAE,CAAC;oBACxC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACd,CAAC;wBAAS,CAAC;oBACT,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACpB,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,wBAAwB;QAC9B,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE;YAAE,OAAO,IAAI,CAAC;QAC/C,MAAM,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC;QAC5C,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAC3C,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,sBAAsB;QACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;YAClB,IAAI,CAAC;gBACH,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC;oBACnC,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC;oBAClC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;oBAC3C,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;oBAAS,CAAC;gBACT,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACpB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,aAAa;QACnB,OAAO,IAAI,oBAAO,CAChB,IAAI,CAAC,oBAAoB,EACzB,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,eAAe,EACpB,IAAI,CAAC,iBAAiB,EACtB,IAAI,CAAC,uBAAuB,EAC5B,IAAI,CAAC,mBAAmB,EACxB,IAAI,CAAC,0BAA0B,CAChC,CAAC;IACJ,CAAC;IACD;;;OAGG;IACI,sBAAsB;QAC3B,IAAI,CAAC,0BAA0B,CAAC,GAAG,EAAE,CAAC;IACxC,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,OAAO;QAClB,MAAM,IAAI,CAAC,oBAAoB,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;IAClC,CAAC;CACF;AAhJD,gDAgJC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport semaphore from \"semaphore\";\nimport { StatusCodes } from \"../common/statusCodes.js\";\nimport type { CosmosDbDiagnosticLevel } from \"../diagnostics/CosmosDbDiagnosticLevel.js\";\nimport type { EncryptionProcessor } from \"../encryption/EncryptionProcessor.js\";\nimport type { ClientConfigDiagnostic, DiagnosticNodeInternal } from \"../index.js\";\nimport type { ExecuteCallback, RetryCallback, BulkOperationResult } from \"../utils/batch.js\";\nimport { Batcher } from \"./Batcher.js\";\nimport { CongestionAlgorithm } from \"./CongestionAlgorithm.js\";\nimport { PartitionMetric } from \"./PartitionMetric.js\";\nimport type { ItemOperation } from \"./index.js\";\nimport { LimiterQueue } from \"./Limiter.js\";\n\n/**\n * Handles operations batching and queuing for dispatch. Fills batches efficiently. There is always one batch at a time being filled. When the batch is full, it is added to the\n * dispatch queue and a new batch is created.\n * @hidden\n */\n\nexport class HelperPerPartition {\n  private readonly executor: ExecuteCallback;\n  private readonly retrier: RetryCallback;\n  private currentBatcher: Batcher;\n  private readonly lock: semaphore.Semaphore;\n  private readonly partitionMetric: PartitionMetric;\n  private readonly oldPartitionMetric: PartitionMetric;\n  private readonly diagnosticLevel: CosmosDbDiagnosticLevel;\n  private readonly encryptionEnabled: boolean;\n  private readonly encryptionProcessor: EncryptionProcessor;\n  private readonly clientConfigDiagnostics: ClientConfigDiagnostic;\n  private readonly congestionControlAlgorithm: CongestionAlgorithm;\n  private readonly dispatchLimiterQueue: LimiterQueue;\n  private initialConcurrency: number = 1;\n  private processedOperationCountRef: { count: number };\n\n  constructor(\n    executor: ExecuteCallback,\n    retrier: RetryCallback,\n    refreshpartitionKeyRangeCache: (diagnosticNode: DiagnosticNodeInternal) => Promise<void>,\n    diagnosticLevel: CosmosDbDiagnosticLevel,\n    encryptionEnabled: boolean,\n    clientConfig: ClientConfigDiagnostic,\n    encryptionProcessor: EncryptionProcessor,\n    processedOperationCountRef: { count: number },\n  ) {\n    this.executor = executor;\n    this.retrier = retrier;\n    this.diagnosticLevel = diagnosticLevel;\n    this.encryptionEnabled = encryptionEnabled;\n    this.encryptionProcessor = encryptionProcessor;\n    this.clientConfigDiagnostics = clientConfig;\n    this.oldPartitionMetric = new PartitionMetric();\n    this.partitionMetric = new PartitionMetric();\n    this.processedOperationCountRef = processedOperationCountRef;\n    this.lock = semaphore(1);\n    this.dispatchLimiterQueue = new LimiterQueue(\n      this.initialConcurrency,\n      this.partitionMetric,\n      this.retrier,\n      refreshpartitionKeyRangeCache,\n    );\n    this.congestionControlAlgorithm = new CongestionAlgorithm(\n      this.dispatchLimiterQueue,\n      this.partitionMetric,\n      this.oldPartitionMetric,\n    );\n    this.currentBatcher = this.createBatcher();\n  }\n\n  /**\n   * Enqueues an operation into the current batch.\n   * If the operation does not fit because the batch is full, the full batch is enqueued in the dispatch queue\n   * and a new batch is created. The promise resolves when the operation has been successfully added.\n   */\n  async add(operation: ItemOperation): Promise<void> {\n    return new Promise((resolve, reject) => {\n      this.lock.take(() => {\n        try {\n          // If the current batch is full, move it to the dispatch queue until the operation fits.\n          while (!this.currentBatcher.tryAdd(operation)) {\n            const fullBatch = this.getBatchToQueueAndCreate();\n            if (fullBatch) {\n              this.dispatchLimiterQueue.push(fullBatch);\n            }\n          }\n          // At this point the operation was added.\n          resolve();\n        } catch (err) {\n          const response: BulkOperationResult = {\n            operationInput: operation.unencryptedOperationInput,\n            error: Object.assign(new Error(err.message), {\n              code: StatusCodes.InternalServerError,\n              diagnostics: operation.operationContext.diagnosticNode.toDiagnostic(\n                this.clientConfigDiagnostics,\n              ),\n            }),\n          };\n          operation.operationContext.fail(response);\n          this.processedOperationCountRef.count++;\n          reject(err);\n        } finally {\n          this.lock.leave();\n        }\n      });\n    });\n  }\n\n  /**\n   * @returns the batch to be dispatched and creates a new one\n   */\n  private getBatchToQueueAndCreate(): Batcher {\n    if (this.currentBatcher.isEmpty()) return null;\n    const previousBatcher = this.currentBatcher;\n    this.currentBatcher = this.createBatcher();\n    return previousBatcher;\n  }\n\n  /**\n   * In case there are leftover operations that did not fill a full batch,\n   * dispatchUnfilledBatch will add those operations as a batch in the dispatch queue.\n   */\n  addPartialBatchToQueue(): void {\n    this.lock.take(() => {\n      try {\n        if (!this.currentBatcher.isEmpty()) {\n          const batch = this.currentBatcher;\n          this.currentBatcher = this.createBatcher();\n          this.dispatchLimiterQueue.push(batch);\n        }\n      } finally {\n        this.lock.leave();\n      }\n    });\n  }\n\n  private createBatcher(): Batcher {\n    return new Batcher(\n      this.dispatchLimiterQueue,\n      this.executor,\n      this.retrier,\n      this.diagnosticLevel,\n      this.encryptionEnabled,\n      this.clientConfigDiagnostics,\n      this.encryptionProcessor,\n      this.processedOperationCountRef,\n    );\n  }\n  /**\n   * Runs congestion algo for a partition.\n   * Controlled by a single timer for all the partitions.\n   */\n  public runCongestionAlgorithm(): void {\n    this.congestionControlAlgorithm.run();\n  }\n\n  /**\n   * Empties the dispatch queue and clears the current batch.\n   * This is used in case of stale container Rid detected for encryption operations\n   */\n  public async dispose(): Promise<void> {\n    await this.dispatchLimiterQueue.pauseAndClear(null);\n    this.currentBatcher = undefined;\n  }\n}\n"]}
+{"version":3,"file":"HelperPerPartition.js","sourceRoot":"","sources":["../../../src/bulk/HelperPerPartition.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;;AAElC,kEAAkC;AAClC,6DAAuD;AAKvD,6CAAuC;AACvC,qEAA+D;AAC/D,6DAAuD;AAEvD,6CAA4C;AAE5C;;;;GAIG;AAEH,MAAa,kBAAkB;IACZ,QAAQ,CAAkB;IAC1B,OAAO,CAAgB;IAChC,cAAc,CAAU;IACf,IAAI,CAAsB;IAC1B,eAAe,CAAkB;IACjC,kBAAkB,CAAkB;IACpC,eAAe,CAA0B;IACzC,iBAAiB,CAAU;IAC3B,mBAAmB,CAAsB;IACzC,uBAAuB,CAAyB;IAChD,0BAA0B,CAAsB;IAChD,oBAAoB,CAAe;IAC5C,kBAAkB,GAAW,CAAC,CAAC;IAC/B,0BAA0B,CAAoB;IAEtD,YACE,QAAyB,EACzB,OAAsB,EACtB,6BAAwF,EACxF,eAAwC,EACxC,iBAA0B,EAC1B,YAAoC,EACpC,mBAAwC,EACxC,0BAA6C;QAE7C,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;QAC3C,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,CAAC;QAC/C,IAAI,CAAC,uBAAuB,GAAG,YAAY,CAAC;QAC5C,IAAI,CAAC,kBAAkB,GAAG,IAAI,oCAAe,EAAE,CAAC;QAChD,IAAI,CAAC,eAAe,GAAG,IAAI,oCAAe,EAAE,CAAC;QAC7C,IAAI,CAAC,0BAA0B,GAAG,0BAA0B,CAAC;QAC7D,IAAI,CAAC,IAAI,GAAG,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,oBAAoB,GAAG,IAAI,yBAAY,CAC1C,IAAI,CAAC,kBAAkB,EACvB,IAAI,CAAC,eAAe,EACpB,IAAI,CAAC,OAAO,EACZ,6BAA6B,CAC9B,CAAC;QACF,IAAI,CAAC,0BAA0B,GAAG,IAAI,4CAAmB,CACvD,IAAI,CAAC,oBAAoB,EACzB,IAAI,CAAC,eAAe,EACpB,IAAI,CAAC,kBAAkB,CACxB,CAAC;QACF,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IAC7C,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,GAAG,CAAC,SAAwB;QAChC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;gBAClB,IAAI,CAAC;oBACH,wFAAwF;oBACxF,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,wBAAwB,EAAE,CAAC;wBAClD,IAAI,SAAS,EAAE,CAAC;4BACd,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBAC5C,CAAC;oBACH,CAAC;oBACD,yCAAyC;oBACzC,OAAO,EAAE,CAAC;gBACZ,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,MAAM,QAAQ,GAAwB;wBACpC,cAAc,EAAE,SAAS,CAAC,yBAAyB;wBACnD,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;4BAC3C,IAAI,EAAE,4BAAW,CAAC,mBAAmB;4BACrC,WAAW,EAAE,SAAS,CAAC,gBAAgB,CAAC,cAAc,CAAC,YAAY,CACjE,IAAI,CAAC,uBAAuB,CAC7B;yBACF,CAAC;qBACH,CAAC;oBACF,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAC1C,IAAI,CAAC,0BAA0B,CAAC,KAAK,EAAE,CAAC;oBACxC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACd,CAAC;wBAAS,CAAC;oBACT,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACpB,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,wBAAwB;QAC9B,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE;YAAE,OAAO,IAAI,CAAC;QAC/C,MAAM,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC;QAC5C,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAC3C,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,sBAAsB;QACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;YAClB,IAAI,CAAC;gBACH,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC;oBACnC,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC;oBAClC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;oBAC3C,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;oBAAS,CAAC;gBACT,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACpB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,aAAa;QACnB,OAAO,IAAI,oBAAO,CAChB,IAAI,CAAC,oBAAoB,EACzB,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,eAAe,EACpB,IAAI,CAAC,iBAAiB,EACtB,IAAI,CAAC,uBAAuB,EAC5B,IAAI,CAAC,mBAAmB,EACxB,IAAI,CAAC,0BAA0B,CAChC,CAAC;IACJ,CAAC;IACD;;;OAGG;IACI,sBAAsB;QAC3B,IAAI,CAAC,0BAA0B,CAAC,GAAG,EAAE,CAAC;IACxC,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,OAAO;QAClB,MAAM,IAAI,CAAC,oBAAoB,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;IAClC,CAAC;CACF;AAhJD,gDAgJC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport semaphore from \"semaphore\";\nimport { StatusCodes } from \"../common/statusCodes.js\";\nimport type { CosmosDbDiagnosticLevel } from \"../diagnostics/CosmosDbDiagnosticLevel.js\";\nimport type { EncryptionProcessor } from \"../encryption/EncryptionProcessor.js\";\nimport type { ClientConfigDiagnostic, DiagnosticNodeInternal } from \"../index.js\";\nimport type { ExecuteCallback, RetryCallback, BulkOperationResult } from \"../utils/batch.js\";\nimport { Batcher } from \"./Batcher.js\";\nimport { CongestionAlgorithm } from \"./CongestionAlgorithm.js\";\nimport { PartitionMetric } from \"./PartitionMetric.js\";\nimport type { ItemOperation } from \"./index.js\";\nimport { LimiterQueue } from \"./Limiter.js\";\n\n/**\n * Handles operations batching and queuing for dispatch. Fills batches efficiently. There is always one batch at a time being filled. When the batch is full, it is added to the\n * dispatch queue and a new batch is created.\n * @hidden\n */\n\nexport class HelperPerPartition {\n  private readonly executor: ExecuteCallback;\n  private readonly retrier: RetryCallback;\n  private currentBatcher: Batcher;\n  private readonly lock: semaphore.Semaphore;\n  private readonly partitionMetric: PartitionMetric;\n  private readonly oldPartitionMetric: PartitionMetric;\n  private readonly diagnosticLevel: CosmosDbDiagnosticLevel;\n  private readonly encryptionEnabled: boolean;\n  private readonly encryptionProcessor: EncryptionProcessor;\n  private readonly clientConfigDiagnostics: ClientConfigDiagnostic;\n  private readonly congestionControlAlgorithm: CongestionAlgorithm;\n  private readonly dispatchLimiterQueue: LimiterQueue;\n  private initialConcurrency: number = 1;\n  private processedOperationCountRef: { count: number };\n\n  constructor(\n    executor: ExecuteCallback,\n    retrier: RetryCallback,\n    refreshpartitionKeyRangeCache: (diagnosticNode: DiagnosticNodeInternal) => Promise<void>,\n    diagnosticLevel: CosmosDbDiagnosticLevel,\n    encryptionEnabled: boolean,\n    clientConfig: ClientConfigDiagnostic,\n    encryptionProcessor: EncryptionProcessor,\n    processedOperationCountRef: { count: number },\n  ) {\n    this.executor = executor;\n    this.retrier = retrier;\n    this.diagnosticLevel = diagnosticLevel;\n    this.encryptionEnabled = encryptionEnabled;\n    this.encryptionProcessor = encryptionProcessor;\n    this.clientConfigDiagnostics = clientConfig;\n    this.oldPartitionMetric = new PartitionMetric();\n    this.partitionMetric = new PartitionMetric();\n    this.processedOperationCountRef = processedOperationCountRef;\n    this.lock = semaphore(1);\n    this.dispatchLimiterQueue = new LimiterQueue(\n      this.initialConcurrency,\n      this.partitionMetric,\n      this.retrier,\n      refreshpartitionKeyRangeCache,\n    );\n    this.congestionControlAlgorithm = new CongestionAlgorithm(\n      this.dispatchLimiterQueue,\n      this.partitionMetric,\n      this.oldPartitionMetric,\n    );\n    this.currentBatcher = this.createBatcher();\n  }\n\n  /**\n   * Enqueues an operation into the current batch.\n   * If the operation does not fit because the batch is full, the full batch is enqueued in the dispatch queue\n   * and a new batch is created. The promise resolves when the operation has been successfully added.\n   */\n  async add(operation: ItemOperation): Promise<void> {\n    return new Promise((resolve, reject) => {\n      this.lock.take(() => {\n        try {\n          // If the current batch is full, move it to the dispatch queue until the operation fits.\n          while (!this.currentBatcher.tryAdd(operation)) {\n            const fullBatch = this.getBatchToQueueAndCreate();\n            if (fullBatch) {\n              this.dispatchLimiterQueue.push(fullBatch);\n            }\n          }\n          // At this point the operation was added.\n          resolve();\n        } catch (err) {\n          const response: BulkOperationResult = {\n            operationInput: operation.unencryptedOperationInput,\n            error: Object.assign(new Error(err.message), {\n              code: StatusCodes.InternalServerError,\n              diagnostics: operation.operationContext.diagnosticNode.toDiagnostic(\n                this.clientConfigDiagnostics,\n              ),\n            }),\n          };\n          operation.operationContext.fail(response);\n          this.processedOperationCountRef.count++;\n          reject(err);\n        } finally {\n          this.lock.leave();\n        }\n      });\n    });\n  }\n\n  /**\n   * @returns the batch to be dispatched and creates a new one\n   */\n  private getBatchToQueueAndCreate(): Batcher {\n    if (this.currentBatcher.isEmpty()) return null;\n    const previousBatcher = this.currentBatcher;\n    this.currentBatcher = this.createBatcher();\n    return previousBatcher;\n  }\n\n  /**\n   * In case there are leftover operations that did not fill a full batch,\n   * dispatchUnfilledBatch will add those operations as a batch in the dispatch queue.\n   */\n  addPartialBatchToQueue(): void {\n    this.lock.take(() => {\n      try {\n        if (!this.currentBatcher.isEmpty()) {\n          const batch = this.currentBatcher;\n          this.currentBatcher = this.createBatcher();\n          this.dispatchLimiterQueue.push(batch);\n        }\n      } finally {\n        this.lock.leave();\n      }\n    });\n  }\n\n  private createBatcher(): Batcher {\n    return new Batcher(\n      this.dispatchLimiterQueue,\n      this.executor,\n      this.retrier,\n      this.diagnosticLevel,\n      this.encryptionEnabled,\n      this.clientConfigDiagnostics,\n      this.encryptionProcessor,\n      this.processedOperationCountRef,\n    );\n  }\n  /**\n   * Runs congestion algo for a partition.\n   * Controlled by a single timer for all the partitions.\n   */\n  public runCongestionAlgorithm(): void {\n    this.congestionControlAlgorithm.run();\n  }\n\n  /**\n   * Empties the dispatch queue and clears the current batch.\n   * This is used in case of stale container Rid detected for encryption operations\n   */\n  public async dispose(): Promise<void> {\n    await this.dispatchLimiterQueue.pauseAndClear(null);\n    this.currentBatcher = undefined;\n  }\n}\n"]}

package/dist/commonjs/bulk/ItemOperationContext.js

@@ -9,6 +9,10 @@ const batch_js_1 = require("../utils/batch.js");
  * @hidden
  */
 class ItemOperationContext {
+    pkRangeId;
+    retryPolicy;
+    diagnosticNode;
+    taskCompletionSource;
     constructor(pkRangeId, retryPolicy, diagnosticNode) {
         this.pkRangeId = pkRangeId;
         this.retryPolicy = retryPolicy;

package/dist/commonjs/bulk/ItemOperationContext.js.map

@@ -1 +1 @@
-{"version":3,"file":"ItemOperationContext.js","sourceRoot":"","sources":["../../../src/bulk/ItemOperationContext.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;AAKlC,gDAAyD;AAEzD;;;GAGG;AACH,MAAa,oBAAoB;IAM/B,YAAY,SAAiB,EAAE,WAAwB,EAAE,cAAsC;QAC7F,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,oBAAoB,GAAG,IAAI,+BAAoB,EAAuB,CAAC;IAC9E,CAAC;IAED,IAAW,gBAAgB;QACzB,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC;IACxC,CAAC;IAED,kBAAkB,CAAC,cAAsC;QACvD,IAAI,CAAC,cAAc,CAAC,gBAAgB,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,CAAC,eAAe,CAAC,CAAC;QAC1F,cAAc,CAAC,eAAe,EAAE,CAAC;IACnC,CAAC;IAED,eAAe,CAAC,SAAiB;QAC/B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,QAAQ,CAAC,MAA2B;QAClC,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,CAAC,KAA0B;QAC7B,IAAI,CAAC,oBAAoB,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC;CACF;AAjCD,oDAiCC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { type DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport type { RetryPolicy } from \"../retry/RetryPolicy.js\";\nimport type { BulkOperationResult } from \"../utils/batch.js\";\nimport { TaskCompletionSource } from \"../utils/batch.js\";\n\n/**\n * Context for a particular @see {@link ItemOperation}.\n * @hidden\n */\nexport class ItemOperationContext {\n  pkRangeId: string;\n  retryPolicy: RetryPolicy;\n  diagnosticNode: DiagnosticNodeInternal;\n  private readonly taskCompletionSource: TaskCompletionSource<BulkOperationResult>;\n\n  constructor(pkRangeId: string, retryPolicy: RetryPolicy, diagnosticNode: DiagnosticNodeInternal) {\n    this.pkRangeId = pkRangeId;\n    this.retryPolicy = retryPolicy;\n    this.diagnosticNode = diagnosticNode;\n    this.taskCompletionSource = new TaskCompletionSource<BulkOperationResult>();\n  }\n\n  public get operationPromise(): Promise<BulkOperationResult> {\n    return this.taskCompletionSource.task;\n  }\n\n  addDiagnosticChild(diagnosticNode: DiagnosticNodeInternal): void {\n    this.diagnosticNode.addBulkChildNode(diagnosticNode, this.diagnosticNode.diagnosticLevel);\n    diagnosticNode.updateTimestamp();\n  }\n\n  updatePKRangeId(pkRangeId: string): void {\n    this.pkRangeId = pkRangeId;\n  }\n\n  complete(result: BulkOperationResult): void {\n    this.taskCompletionSource.setResult(result);\n  }\n\n  fail(error: BulkOperationResult): void {\n    this.taskCompletionSource.setException(error.error);\n  }\n}\n"]}
+{"version":3,"file":"ItemOperationContext.js","sourceRoot":"","sources":["../../../src/bulk/ItemOperationContext.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;AAKlC,gDAAyD;AAEzD;;;GAGG;AACH,MAAa,oBAAoB;IAC/B,SAAS,CAAS;IAClB,WAAW,CAAc;IACzB,cAAc,CAAyB;IACtB,oBAAoB,CAA4C;IAEjF,YAAY,SAAiB,EAAE,WAAwB,EAAE,cAAsC;QAC7F,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,oBAAoB,GAAG,IAAI,+BAAoB,EAAuB,CAAC;IAC9E,CAAC;IAED,IAAW,gBAAgB;QACzB,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC;IACxC,CAAC;IAED,kBAAkB,CAAC,cAAsC;QACvD,IAAI,CAAC,cAAc,CAAC,gBAAgB,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,CAAC,eAAe,CAAC,CAAC;QAC1F,cAAc,CAAC,eAAe,EAAE,CAAC;IACnC,CAAC;IAED,eAAe,CAAC,SAAiB;QAC/B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,QAAQ,CAAC,MAA2B;QAClC,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,CAAC,KAA0B;QAC7B,IAAI,CAAC,oBAAoB,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC;CACF;AAjCD,oDAiCC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { type DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport type { RetryPolicy } from \"../retry/RetryPolicy.js\";\nimport type { BulkOperationResult } from \"../utils/batch.js\";\nimport { TaskCompletionSource } from \"../utils/batch.js\";\n\n/**\n * Context for a particular @see {@link ItemOperation}.\n * @hidden\n */\nexport class ItemOperationContext {\n  pkRangeId: string;\n  retryPolicy: RetryPolicy;\n  diagnosticNode: DiagnosticNodeInternal;\n  private readonly taskCompletionSource: TaskCompletionSource<BulkOperationResult>;\n\n  constructor(pkRangeId: string, retryPolicy: RetryPolicy, diagnosticNode: DiagnosticNodeInternal) {\n    this.pkRangeId = pkRangeId;\n    this.retryPolicy = retryPolicy;\n    this.diagnosticNode = diagnosticNode;\n    this.taskCompletionSource = new TaskCompletionSource<BulkOperationResult>();\n  }\n\n  public get operationPromise(): Promise<BulkOperationResult> {\n    return this.taskCompletionSource.task;\n  }\n\n  addDiagnosticChild(diagnosticNode: DiagnosticNodeInternal): void {\n    this.diagnosticNode.addBulkChildNode(diagnosticNode, this.diagnosticNode.diagnosticLevel);\n    diagnosticNode.updateTimestamp();\n  }\n\n  updatePKRangeId(pkRangeId: string): void {\n    this.pkRangeId = pkRangeId;\n  }\n\n  complete(result: BulkOperationResult): void {\n    this.taskCompletionSource.setResult(result);\n  }\n\n  fail(error: BulkOperationResult): void {\n    this.taskCompletionSource.setException(error.error);\n  }\n}\n"]}

package/dist/commonjs/bulk/Limiter.js

@@ -5,18 +5,17 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.LimiterQueue = void 0;
 const statusCodes_js_1 = require("../common/statusCodes.js");
 class ListNode {
+    value;
+    next = null;
+    prev = null;
     constructor(value) {
-        this.next = null;
-        this.prev = null;
         this.value = value;
     }
 }
 class DoublyLinkedList {
-    constructor() {
-        this.head = null;
-        this.tail = null;
-        this.length = 0;
-    }
+    head = null;
+    tail = null;
+    length = 0;
     push(value) {
         const node = new ListNode(value);
         if (!this.head) {
@@ -74,21 +73,31 @@ function scheduleCallback(fn) {
  * any subsequent push() calls will immediately resolve with that value.
  */
 class LimiterQueue {
+    // maximum number of tasks allowed to run concurrently
+    concurrency;
+    // number of tasks currently executing
+    running = 0;
+    // doubly linked list to store batchers and resolve/reject functions for dispatch tasks
+    tasks = new DoublyLinkedList();
+    // boolean flag that indicates whether the queue has been permanently paused
+    terminated = false;
+    // value to resolve with when the queue is terminated
+    terminatedValue;
+    // indicates if the processing cycle has been scheduled via the asynchronous scheduler
+    scheduled = false;
+    // indicates whether the queue is currently in the process of dequeueing and executing tasks
+    processing = false;
+    // retry callback to retry all the queued operations in case of split/merge error
+    retrier;
+    // partiton metric for collecting metrics for the requests
+    partitionMetric;
+    // callback used to refresh the partition key range cache in case of split/merge error
+    refreshPartitionKeyRangeCache;
+    refreshPKRangeCachePromise = undefined;
     /**
      * Creates a new HighPerformanceQueue.
      */
     constructor(concurrency, partitionMetric, retrier, refreshPartitionKeyRangeCache) {
-        // number of tasks currently executing
-        this.running = 0;
-        // doubly linked list to store batchers and resolve/reject functions for dispatch tasks
-        this.tasks = new DoublyLinkedList();
-        // boolean flag that indicates whether the queue has been permanently paused
-        this.terminated = false;
-        // indicates if the processing cycle has been scheduled via the asynchronous scheduler
-        this.scheduled = false;
-        // indicates whether the queue is currently in the process of dequeueing and executing tasks
-        this.processing = false;
-        this.refreshPKRangeCachePromise = undefined;
         this.concurrency = concurrency;
         this.partitionMetric = partitionMetric;
         this.retrier = retrier;

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

@@ -1 +1 @@
-{"version":3,"file":"Limiter.js","sourceRoot":"","sources":["../../../src/bulk/Limiter.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;AAElC,6DAAuD;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,MAAa,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,4BAAW,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,4BAAW,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;AAjKD,oCAiKC","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"]}
+{"version":3,"file":"Limiter.js","sourceRoot":"","sources":["../../../src/bulk/Limiter.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;AAElC,6DAAuD;AAevD,MAAM,QAAQ;IACL,KAAK,CAAI;IACT,IAAI,GAAuB,IAAI,CAAC;IAChC,IAAI,GAAuB,IAAI,CAAC;IACvC,YAAY,KAAQ;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;CACF;AAED,MAAM,gBAAgB;IACb,IAAI,GAAuB,IAAI,CAAC;IAChC,IAAI,GAAuB,IAAI,CAAC;IAChC,MAAM,GAAG,CAAC,CAAC;IAEX,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,MAAa,YAAY;IACvB,sDAAsD;IAC/C,WAAW,CAAS;IAC3B,sCAAsC;IAC9B,OAAO,GAAG,CAAC,CAAC;IACpB,uFAAuF;IAC/E,KAAK,GAAgC,IAAI,gBAAgB,EAAE,CAAC;IACpE,4EAA4E;IACpE,UAAU,GAAG,KAAK,CAAC;IAC3B,qDAAqD;IAC7C,eAAe,CAAM;IAC7B,sFAAsF;IAC9E,SAAS,GAAG,KAAK,CAAC;IAC1B,4FAA4F;IACpF,UAAU,GAAG,KAAK,CAAC;IAC3B,iFAAiF;IACzE,OAAO,CAAgB;IAC/B,0DAA0D;IAClD,eAAe,CAAkB;IACzC,sFAAsF;IACrE,6BAA6B,CAAyC;IAC/E,0BAA0B,GAA8B,SAAS,CAAC;IAC1E;;OAEG;IACH,YACE,WAAmB,EACnB,eAAgC,EAChC,OAAsB,EACtB,6BAAqE;QAErE,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,4BAAW,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,4BAAW,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;AAjKD,oCAiKC","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/commonjs/bulk/PartitionMetric.js

@@ -9,6 +9,10 @@ const semaphore_1 = tslib_1.__importDefault(require("semaphore"));
  * Captures the metrics for the requests made for bulk.
  */
 class PartitionMetric {
+    numberOfItemsOperatedOn;
+    timeTakenInMs;
+    numberOfThrottles;
+    semaphore;
     constructor() {
         this.numberOfItemsOperatedOn = 0;
         this.timeTakenInMs = 0;

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

@@ -1 +1 @@
-{"version":3,"file":"PartitionMetric.js","sourceRoot":"","sources":["../../../src/bulk/PartitionMetric.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;;AAElC,kEAAkC;AAElC;;GAEG;AACH,MAAa,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,IAAA,mBAAS,EAAC,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;AAzBD,0CAyBC","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"]}
+{"version":3,"file":"PartitionMetric.js","sourceRoot":"","sources":["../../../src/bulk/PartitionMetric.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;;AAElC,kEAAkC;AAElC;;GAEG;AACH,MAAa,eAAe;IAC1B,uBAAuB,CAAS;IAChC,aAAa,CAAS;IACtB,iBAAiB,CAAS;IAClB,SAAS,CAAsB;IAEvC;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,IAAA,mBAAS,EAAC,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;AAzBD,0CAyBC","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/commonjs/client/ChangeFeed/ChangeFeedForEpkRange.js

@@ -1,7 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ChangeFeedForEpkRange = void 0;
-const tslib_1 = require("tslib");
 // Copyright (c) Microsoft Corporation.
 // Licensed under the MIT License.
 const ChangeFeedRange_js_1 = require("./ChangeFeedRange.js");
@@ -21,6 +20,20 @@ const ChangeFeedMode_js_1 = require("./ChangeFeedMode.js");
  * Use `Items.getChangeFeedIterator()` to get an instance of the iterator.
  */
 class ChangeFeedForEpkRange {
+    clientContext;
+    container;
+    partitionKeyRangeCache;
+    resourceId;
+    resourceLink;
+    url;
+    changeFeedOptions;
+    epkRange;
+    continuationToken;
+    queue;
+    startTime;
+    isInstantiated;
+    rId;
+    startFromNow;
     /**
      * @internal
      */
@@ -33,9 +46,6 @@ class ChangeFeedForEpkRange {
         this.url = url;
         this.changeFeedOptions = changeFeedOptions;
         this.epkRange = epkRange;
-        this.generateContinuationToken = () => {
-            return JSON.stringify(new CompositeContinuationToken_js_1.CompositeContinuationToken(this.rId, this.queue.returnSnapshot()));
-        };
         this.queue = new FeedRangeQueue_js_1.FeedRangeQueue();
         this.continuationToken = changeFeedOptions.continuationToken
             ? JSON.parse(changeFeedOptions.continuationToken)
@@ -124,13 +134,11 @@ class ChangeFeedForEpkRange {
     /**
      * Gets an async iterator which will yield change feed results.
      */
-    getAsyncIterator() {
-        return tslib_1.__asyncGenerator(this, arguments, function* getAsyncIterator_1() {
-            do {
-                const result = yield tslib_1.__await(this.readNext());
-                yield yield tslib_1.__await(result);
-            } while (this.hasMoreResults);
-        });
+    async *getAsyncIterator() {
+        do {
+            const result = await this.readNext();
+            yield result;
+        } while (this.hasMoreResults);
     }
     /**
      * Gets an async iterator which will yield pages of results from Azure Cosmos DB.
@@ -177,6 +185,9 @@ class ChangeFeedForEpkRange {
             return result;
         }, this.clientContext);
     }
+    generateContinuationToken = () => {
+        return JSON.stringify(new CompositeContinuationToken_js_1.CompositeContinuationToken(this.rId, this.queue.returnSnapshot()));
+    };
     /**
      * Read feed and retrieves the next page of results in Azure Cosmos DB.
      */
@@ -209,10 +220,10 @@ class ChangeFeedForEpkRange {
             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));
+        return (firstNotModifiedFeedRange.minInclusive === feedRangeQueueFirstElement?.minInclusive &&
+            firstNotModifiedFeedRange.maxExclusive === feedRangeQueueFirstElement?.maxExclusive &&
+            firstNotModifiedFeedRange.epkMinHeader === feedRangeQueueFirstElement?.epkMinHeader &&
+            firstNotModifiedFeedRange.epkMaxHeader === feedRangeQueueFirstElement?.epkMaxHeader);
     }
     /**
      * Checks whether the current EpkRange is split into multiple ranges or not.