@azure/cosmos 4.9.1 → 4.9.3

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

@@ -1 +1,7 @@
-{"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"]}
+{
+  "version": 3,
+  "sources": ["../../../src/bulk/CongestionAlgorithm.ts"],
+  "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"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAGA,uBAA0B;AAgBnB,MAAM,oBAAoB;AAAA;AAAA,EAEvB;AAAA;AAAA,EAEA;AAAA;AAAA,EAEA;AAAA;AAAA,EAEA,yBAAiC;AAAA,EACjC,2BAAmC;AAAA,EACnC,2BAAmC;AAAA,EACnC;AAAA,EAER,YACE,cACA,iBACA,oBACA;AACA,SAAK,eAAe;AACpB,SAAK,qBAAqB;AAC1B,SAAK,kBAAkB;AACvB,SAAK,6BAA6B;AAAA,EACpC;AAAA,EAEA,MAAY;AACV,UAAM,kBACJ,KAAK,gBAAgB,gBAAgB,KAAK,mBAAmB;AAE/D,QAAI,mBAAmB,KAAK,wBAAwB;AAClD,YAAM,eACJ,KAAK,gBAAgB,oBAAoB,KAAK,mBAAmB;AACnE,YAAM,mBACJ,KAAK,gBAAgB,0BACrB,KAAK,mBAAmB;AAE1B,WAAK,mBAAmB,IAAI,kBAAkB,iBAAiB,YAAY;AAE3E,UAAI,eAAe,GAAG;AACpB,aAAK,oBAAoB;AAAA,MAC3B;AAEA,UAAI,mBAAmB,KAAK,iBAAiB,GAAG;AAC9C,aAAK,oBAAoB;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,sBAA4B;AAElC,UAAM,gBAAgB,KAAK;AAAA,MACzB,KAAK;AAAA,MACL,KAAK,MAAM,KAAK,6BAA6B,CAAC;AAAA,IAChD;AACA,SAAK,8BAA8B;AACnC,SAAK,aAAa,eAAe,KAAK,0BAA0B;AAEhE,SAAK,0BAA0B;AAAA,EACjC;AAAA,EAEQ,sBAA4B;AAClC,QACE,KAAK,6BAA6B,KAAK,4BACvC,2BAAU,4BACV;AACA,WAAK,8BAA8B,KAAK;AACxC,WAAK,aAAa,eAAe,KAAK,0BAA0B;AAAA,IAClE;AAAA,EACF;AACF;",
+  "names": []
+}

package/dist/commonjs/bulk/HelperPerPartition.js

@@ -1,133 +1,171 @@
-"use strict";
-// Copyright (c) Microsoft Corporation.
-// Licensed under the MIT License.
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.HelperPerPartition = void 0;
-const tslib_1 = require("tslib");
-const semaphore_1 = tslib_1.__importDefault(require("semaphore"));
-const statusCodes_js_1 = require("../common/statusCodes.js");
-const Batcher_js_1 = require("./Batcher.js");
-const CongestionAlgorithm_js_1 = require("./CongestionAlgorithm.js");
-const PartitionMetric_js_1 = require("./PartitionMetric.js");
-const Limiter_js_1 = require("./Limiter.js");
-/**
- * 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
- * dispatch queue and a new batch is created.
- * @hidden
- */
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var HelperPerPartition_exports = {};
+__export(HelperPerPartition_exports, {
+  HelperPerPartition: () => HelperPerPartition
+});
+module.exports = __toCommonJS(HelperPerPartition_exports);
+var import_semaphore = __toESM(require("semaphore"));
+var import_statusCodes = require("../common/statusCodes.js");
+var import_Batcher = require("./Batcher.js");
+var import_CongestionAlgorithm = require("./CongestionAlgorithm.js");
+var import_PartitionMetric = require("./PartitionMetric.js");
+var import_Limiter = require("./Limiter.js");
 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.executor = executor;
-        this.retrier = retrier;
-        this.diagnosticLevel = diagnosticLevel;
-        this.encryptionEnabled = encryptionEnabled;
-        this.encryptionProcessor = encryptionProcessor;
-        this.clientConfigDiagnostics = clientConfig;
-        this.oldPartitionMetric = new PartitionMetric_js_1.PartitionMetric();
-        this.partitionMetric = new PartitionMetric_js_1.PartitionMetric();
-        this.processedOperationCountRef = processedOperationCountRef;
-        this.lock = (0, semaphore_1.default)(1);
-        this.dispatchLimiterQueue = new Limiter_js_1.LimiterQueue(this.initialConcurrency, this.partitionMetric, this.retrier, refreshpartitionKeyRangeCache);
-        this.congestionControlAlgorithm = new CongestionAlgorithm_js_1.CongestionAlgorithm(this.dispatchLimiterQueue, this.partitionMetric, this.oldPartitionMetric);
-        this.currentBatcher = this.createBatcher();
-    }
-    /**
-     * Enqueues an operation into the current batch.
-     * If the operation does not fit because the batch is full, the full batch is enqueued in the dispatch queue
-     * and a new batch is created. The promise resolves when the operation has been successfully added.
-     */
-    async add(operation) {
-        return new Promise((resolve, reject) => {
-            this.lock.take(() => {
-                try {
-                    // If the current batch is full, move it to the dispatch queue until the operation fits.
-                    while (!this.currentBatcher.tryAdd(operation)) {
-                        const fullBatch = this.getBatchToQueueAndCreate();
-                        if (fullBatch) {
-                            this.dispatchLimiterQueue.push(fullBatch);
-                        }
-                    }
-                    // At this point the operation was added.
-                    resolve();
-                }
-                catch (err) {
-                    const response = {
-                        operationInput: operation.unencryptedOperationInput,
-                        error: Object.assign(new Error(err.message), {
-                            code: statusCodes_js_1.StatusCodes.InternalServerError,
-                            diagnostics: operation.operationContext.diagnosticNode.toDiagnostic(this.clientConfigDiagnostics),
-                        }),
-                    };
-                    operation.operationContext.fail(response);
-                    this.processedOperationCountRef.count++;
-                    reject(err);
-                }
-                finally {
-                    this.lock.leave();
-                }
-            });
-        });
-    }
-    /**
-     * @returns the batch to be dispatched and creates a new one
-     */
-    getBatchToQueueAndCreate() {
-        if (this.currentBatcher.isEmpty())
-            return null;
-        const previousBatcher = this.currentBatcher;
-        this.currentBatcher = this.createBatcher();
-        return previousBatcher;
-    }
-    /**
-     * In case there are leftover operations that did not fill a full batch,
-     * dispatchUnfilledBatch will add those operations as a batch in the dispatch queue.
-     */
-    addPartialBatchToQueue() {
-        this.lock.take(() => {
-            try {
-                if (!this.currentBatcher.isEmpty()) {
-                    const batch = this.currentBatcher;
-                    this.currentBatcher = this.createBatcher();
-                    this.dispatchLimiterQueue.push(batch);
-                }
+  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.executor = executor;
+    this.retrier = retrier;
+    this.diagnosticLevel = diagnosticLevel;
+    this.encryptionEnabled = encryptionEnabled;
+    this.encryptionProcessor = encryptionProcessor;
+    this.clientConfigDiagnostics = clientConfig;
+    this.oldPartitionMetric = new import_PartitionMetric.PartitionMetric();
+    this.partitionMetric = new import_PartitionMetric.PartitionMetric();
+    this.processedOperationCountRef = processedOperationCountRef;
+    this.lock = (0, import_semaphore.default)(1);
+    this.dispatchLimiterQueue = new import_Limiter.LimiterQueue(
+      this.initialConcurrency,
+      this.partitionMetric,
+      this.retrier,
+      refreshpartitionKeyRangeCache
+    );
+    this.congestionControlAlgorithm = new import_CongestionAlgorithm.CongestionAlgorithm(
+      this.dispatchLimiterQueue,
+      this.partitionMetric,
+      this.oldPartitionMetric
+    );
+    this.currentBatcher = this.createBatcher();
+  }
+  /**
+   * Enqueues an operation into the current batch.
+   * If the operation does not fit because the batch is full, the full batch is enqueued in the dispatch queue
+   * and a new batch is created. The promise resolves when the operation has been successfully added.
+   */
+  async add(operation) {
+    return new Promise((resolve, reject) => {
+      this.lock.take(() => {
+        try {
+          while (!this.currentBatcher.tryAdd(operation)) {
+            const fullBatch = this.getBatchToQueueAndCreate();
+            if (fullBatch) {
+              this.dispatchLimiterQueue.push(fullBatch);
             }
-            finally {
-                this.lock.leave();
-            }
-        });
-    }
-    createBatcher() {
-        return new Batcher_js_1.Batcher(this.dispatchLimiterQueue, this.executor, this.retrier, this.diagnosticLevel, this.encryptionEnabled, this.clientConfigDiagnostics, this.encryptionProcessor, this.processedOperationCountRef);
-    }
-    /**
-     * Runs congestion algo for a partition.
-     * Controlled by a single timer for all the partitions.
-     */
-    runCongestionAlgorithm() {
-        this.congestionControlAlgorithm.run();
-    }
-    /**
-     * Empties the dispatch queue and clears the current batch.
-     * This is used in case of stale container Rid detected for encryption operations
-     */
-    async dispose() {
-        await this.dispatchLimiterQueue.pauseAndClear(null);
-        this.currentBatcher = undefined;
-    }
+          }
+          resolve();
+        } catch (err) {
+          const response = {
+            operationInput: operation.unencryptedOperationInput,
+            error: Object.assign(new Error(err.message), {
+              code: import_statusCodes.StatusCodes.InternalServerError,
+              diagnostics: operation.operationContext.diagnosticNode.toDiagnostic(
+                this.clientConfigDiagnostics
+              )
+            })
+          };
+          operation.operationContext.fail(response);
+          this.processedOperationCountRef.count++;
+          reject(err);
+        } finally {
+          this.lock.leave();
+        }
+      });
+    });
+  }
+  /**
+   * @returns the batch to be dispatched and creates a new one
+   */
+  getBatchToQueueAndCreate() {
+    if (this.currentBatcher.isEmpty()) return null;
+    const previousBatcher = this.currentBatcher;
+    this.currentBatcher = this.createBatcher();
+    return previousBatcher;
+  }
+  /**
+   * In case there are leftover operations that did not fill a full batch,
+   * dispatchUnfilledBatch will add those operations as a batch in the dispatch queue.
+   */
+  addPartialBatchToQueue() {
+    this.lock.take(() => {
+      try {
+        if (!this.currentBatcher.isEmpty()) {
+          const batch = this.currentBatcher;
+          this.currentBatcher = this.createBatcher();
+          this.dispatchLimiterQueue.push(batch);
+        }
+      } finally {
+        this.lock.leave();
+      }
+    });
+  }
+  createBatcher() {
+    return new import_Batcher.Batcher(
+      this.dispatchLimiterQueue,
+      this.executor,
+      this.retrier,
+      this.diagnosticLevel,
+      this.encryptionEnabled,
+      this.clientConfigDiagnostics,
+      this.encryptionProcessor,
+      this.processedOperationCountRef
+    );
+  }
+  /**
+   * Runs congestion algo for a partition.
+   * Controlled by a single timer for all the partitions.
+   */
+  runCongestionAlgorithm() {
+    this.congestionControlAlgorithm.run();
+  }
+  /**
+   * Empties the dispatch queue and clears the current batch.
+   * This is used in case of stale container Rid detected for encryption operations
+   */
+  async dispose() {
+    await this.dispatchLimiterQueue.pauseAndClear(null);
+    this.currentBatcher = void 0;
+  }
 }
-exports.HelperPerPartition = HelperPerPartition;
-//# sourceMappingURL=HelperPerPartition.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  HelperPerPartition
+});
+//# sourceMappingURL=HelperPerPartition.js.map

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

@@ -1 +1,7 @@
-{"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"]}
+{
+  "version": 3,
+  "sources": ["../../../src/bulk/HelperPerPartition.ts"],
+  "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"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAGA,uBAAsB;AACtB,yBAA4B;AAK5B,qBAAwB;AACxB,iCAAoC;AACpC,6BAAgC;AAEhC,qBAA6B;AAQtB,MAAM,mBAAmB;AAAA,EACb;AAAA,EACA;AAAA,EACT;AAAA,EACS;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACT,qBAA6B;AAAA,EAC7B;AAAA,EAER,YACE,UACA,SACA,+BACA,iBACA,mBACA,cACA,qBACA,4BACA;AACA,SAAK,WAAW;AAChB,SAAK,UAAU;AACf,SAAK,kBAAkB;AACvB,SAAK,oBAAoB;AACzB,SAAK,sBAAsB;AAC3B,SAAK,0BAA0B;AAC/B,SAAK,qBAAqB,IAAI,uCAAgB;AAC9C,SAAK,kBAAkB,IAAI,uCAAgB;AAC3C,SAAK,6BAA6B;AAClC,SAAK,WAAO,iBAAAA,SAAU,CAAC;AACvB,SAAK,uBAAuB,IAAI;AAAA,MAC9B,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,IACF;AACA,SAAK,6BAA6B,IAAI;AAAA,MACpC,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AACA,SAAK,iBAAiB,KAAK,cAAc;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,IAAI,WAAyC;AACjD,WAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,WAAK,KAAK,KAAK,MAAM;AACnB,YAAI;AAEF,iBAAO,CAAC,KAAK,eAAe,OAAO,SAAS,GAAG;AAC7C,kBAAM,YAAY,KAAK,yBAAyB;AAChD,gBAAI,WAAW;AACb,mBAAK,qBAAqB,KAAK,SAAS;AAAA,YAC1C;AAAA,UACF;AAEA,kBAAQ;AAAA,QACV,SAAS,KAAK;AACZ,gBAAM,WAAgC;AAAA,YACpC,gBAAgB,UAAU;AAAA,YAC1B,OAAO,OAAO,OAAO,IAAI,MAAM,IAAI,OAAO,GAAG;AAAA,cAC3C,MAAM,+BAAY;AAAA,cAClB,aAAa,UAAU,iBAAiB,eAAe;AAAA,gBACrD,KAAK;AAAA,cACP;AAAA,YACF,CAAC;AAAA,UACH;AACA,oBAAU,iBAAiB,KAAK,QAAQ;AACxC,eAAK,2BAA2B;AAChC,iBAAO,GAAG;AAAA,QACZ,UAAE;AACA,eAAK,KAAK,MAAM;AAAA,QAClB;AAAA,MACF,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKQ,2BAAoC;AAC1C,QAAI,KAAK,eAAe,QAAQ,EAAG,QAAO;AAC1C,UAAM,kBAAkB,KAAK;AAC7B,SAAK,iBAAiB,KAAK,cAAc;AACzC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,yBAA+B;AAC7B,SAAK,KAAK,KAAK,MAAM;AACnB,UAAI;AACF,YAAI,CAAC,KAAK,eAAe,QAAQ,GAAG;AAClC,gBAAM,QAAQ,KAAK;AACnB,eAAK,iBAAiB,KAAK,cAAc;AACzC,eAAK,qBAAqB,KAAK,KAAK;AAAA,QACtC;AAAA,MACF,UAAE;AACA,aAAK,KAAK,MAAM;AAAA,MAClB;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEQ,gBAAyB;AAC/B,WAAO,IAAI;AAAA,MACT,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAKO,yBAA+B;AACpC,SAAK,2BAA2B,IAAI;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAa,UAAyB;AACpC,UAAM,KAAK,qBAAqB,cAAc,IAAI;AAClD,SAAK,iBAAiB;AAAA,EACxB;AACF;",
+  "names": ["semaphore"]
+}

package/dist/commonjs/bulk/ItemOperation.js

@@ -1,5 +1,16 @@
-"use strict";
-// Copyright (c) Microsoft Corporation.
-// Licensed under the MIT License.
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=ItemOperation.js.map
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var ItemOperation_exports = {};
+module.exports = __toCommonJS(ItemOperation_exports);
+//# sourceMappingURL=ItemOperation.js.map

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

@@ -1 +1,7 @@
-{"version":3,"file":"ItemOperation.js","sourceRoot":"","sources":["../../../src/bulk/ItemOperation.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport type { OperationInput } from \"../utils/batch.js\";\nimport type { ItemOperationContext } from \"./ItemOperationContext.js\";\n\n/**\n * Represents an operation and its context on an item which will be executed as part of a batch request.\n * @hidden\n */\n\nexport interface ItemOperation {\n  // stores unencrypted operationInput to avoid decryption of operationInput in bulk response.\n  unencryptedOperationInput: OperationInput;\n  operationInput: OperationInput;\n  operationContext: ItemOperationContext;\n}\n"]}
+{
+  "version": 3,
+  "sources": ["../../../src/bulk/ItemOperation.ts"],
+  "sourcesContent": ["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport type { OperationInput } from \"../utils/batch.js\";\nimport type { ItemOperationContext } from \"./ItemOperationContext.js\";\n\n/**\n * Represents an operation and its context on an item which will be executed as part of a batch request.\n * @hidden\n */\n\nexport interface ItemOperation {\n  // stores unencrypted operationInput to avoid decryption of operationInput in bulk response.\n  unencryptedOperationInput: OperationInput;\n  operationInput: OperationInput;\n  operationContext: ItemOperationContext;\n}\n"],
+  "mappings": ";;;;;;;;;;;;;AAAA;AAAA;",
+  "names": []
+}

package/dist/commonjs/bulk/ItemOperationContext.js

@@ -1,40 +1,56 @@
-"use strict";
-// Copyright (c) Microsoft Corporation.
-// Licensed under the MIT License.
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ItemOperationContext = void 0;
-const batch_js_1 = require("../utils/batch.js");
-/**
- * Context for a particular @see {@link ItemOperation}.
- * @hidden
- */
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var ItemOperationContext_exports = {};
+__export(ItemOperationContext_exports, {
+  ItemOperationContext: () => ItemOperationContext
+});
+module.exports = __toCommonJS(ItemOperationContext_exports);
+var import_batch = require("../utils/batch.js");
 class ItemOperationContext {
-    pkRangeId;
-    retryPolicy;
-    diagnosticNode;
-    taskCompletionSource;
-    constructor(pkRangeId, retryPolicy, diagnosticNode) {
-        this.pkRangeId = pkRangeId;
-        this.retryPolicy = retryPolicy;
-        this.diagnosticNode = diagnosticNode;
-        this.taskCompletionSource = new batch_js_1.TaskCompletionSource();
-    }
-    get operationPromise() {
-        return this.taskCompletionSource.task;
-    }
-    addDiagnosticChild(diagnosticNode) {
-        this.diagnosticNode.addBulkChildNode(diagnosticNode, this.diagnosticNode.diagnosticLevel);
-        diagnosticNode.updateTimestamp();
-    }
-    updatePKRangeId(pkRangeId) {
-        this.pkRangeId = pkRangeId;
-    }
-    complete(result) {
-        this.taskCompletionSource.setResult(result);
-    }
-    fail(error) {
-        this.taskCompletionSource.setException(error.error);
-    }
+  pkRangeId;
+  retryPolicy;
+  diagnosticNode;
+  taskCompletionSource;
+  constructor(pkRangeId, retryPolicy, diagnosticNode) {
+    this.pkRangeId = pkRangeId;
+    this.retryPolicy = retryPolicy;
+    this.diagnosticNode = diagnosticNode;
+    this.taskCompletionSource = new import_batch.TaskCompletionSource();
+  }
+  get operationPromise() {
+    return this.taskCompletionSource.task;
+  }
+  addDiagnosticChild(diagnosticNode) {
+    this.diagnosticNode.addBulkChildNode(diagnosticNode, this.diagnosticNode.diagnosticLevel);
+    diagnosticNode.updateTimestamp();
+  }
+  updatePKRangeId(pkRangeId) {
+    this.pkRangeId = pkRangeId;
+  }
+  complete(result) {
+    this.taskCompletionSource.setResult(result);
+  }
+  fail(error) {
+    this.taskCompletionSource.setException(error.error);
+  }
 }
-exports.ItemOperationContext = ItemOperationContext;
-//# sourceMappingURL=ItemOperationContext.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  ItemOperationContext
+});
+//# sourceMappingURL=ItemOperationContext.js.map

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

@@ -1 +1,7 @@
-{"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"]}
+{
+  "version": 3,
+  "sources": ["../../../src/bulk/ItemOperationContext.ts"],
+  "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"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAMA,mBAAqC;AAM9B,MAAM,qBAAqB;AAAA,EAChC;AAAA,EACA;AAAA,EACA;AAAA,EACiB;AAAA,EAEjB,YAAY,WAAmB,aAA0B,gBAAwC;AAC/F,SAAK,YAAY;AACjB,SAAK,cAAc;AACnB,SAAK,iBAAiB;AACtB,SAAK,uBAAuB,IAAI,kCAA0C;AAAA,EAC5E;AAAA,EAEA,IAAW,mBAAiD;AAC1D,WAAO,KAAK,qBAAqB;AAAA,EACnC;AAAA,EAEA,mBAAmB,gBAA8C;AAC/D,SAAK,eAAe,iBAAiB,gBAAgB,KAAK,eAAe,eAAe;AACxF,mBAAe,gBAAgB;AAAA,EACjC;AAAA,EAEA,gBAAgB,WAAyB;AACvC,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,SAAS,QAAmC;AAC1C,SAAK,qBAAqB,UAAU,MAAM;AAAA,EAC5C;AAAA,EAEA,KAAK,OAAkC;AACrC,SAAK,qBAAqB,aAAa,MAAM,KAAK;AAAA,EACpD;AACF;",
+  "names": []
+}