@azure/cosmos 4.9.1 → 4.9.3

package/dist/commonjs/bulk/Limiter.js

@@ -1,229 +1,216 @@
-"use strict";
-// Copyright (c) Microsoft Corporation.
-// Licensed under the MIT License.
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LimiterQueue = void 0;
-const statusCodes_js_1 = require("../common/statusCodes.js");
+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 Limiter_exports = {};
+__export(Limiter_exports, {
+  LimiterQueue: () => LimiterQueue
+});
+module.exports = __toCommonJS(Limiter_exports);
+var import_statusCodes = require("../common/statusCodes.js");
 class ListNode {
-    value;
-    next = null;
-    prev = null;
-    constructor(value) {
-        this.value = value;
-    }
+  value;
+  next = null;
+  prev = null;
+  constructor(value) {
+    this.value = value;
+  }
 }
 class DoublyLinkedList {
-    head = null;
-    tail = null;
-    length = 0;
-    push(value) {
-        const node = new ListNode(value);
-        if (!this.head) {
-            this.head = this.tail = node;
-        }
-        else {
-            this.tail.next = node;
-            node.prev = this.tail;
-            this.tail = node;
-        }
-        this.length++;
-    }
-    shift() {
-        if (!this.head)
-            return null;
-        const value = this.head.value;
-        this.head = this.head.next;
-        if (this.head) {
-            this.head.prev = null;
-        }
-        else {
-            this.tail = null;
-        }
-        this.length--;
-        return value;
-    }
-    clear() {
-        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) {
+      this.head = this.tail = node;
+    } else {
+      this.tail.next = node;
+      node.prev = this.tail;
+      this.tail = node;
     }
-    isEmpty() {
-        return this.length === 0;
+    this.length++;
+  }
+  shift() {
+    if (!this.head) return null;
+    const value = this.head.value;
+    this.head = this.head.next;
+    if (this.head) {
+      this.head.prev = null;
+    } else {
+      this.tail = null;
     }
+    this.length--;
+    return value;
+  }
+  clear() {
+    this.head = null;
+    this.tail = null;
+    this.length = 0;
+  }
+  isEmpty() {
+    return this.length === 0;
+  }
 }
-/**
- * Returns a function that will schedule the given callback using the best available method.
- */
 function scheduleCallback(fn) {
-    if (typeof process !== "undefined" && typeof process.nextTick === "function") {
-        process.nextTick(fn);
-    }
-    else if (typeof setImmediate === "function") {
-        setImmediate(fn);
-    }
-    else {
-        // eslint-disable-next-line promise/catch-or-return
-        Promise.resolve().then(fn);
-    }
+  if (typeof process !== "undefined" && typeof process.nextTick === "function") {
+    process.nextTick(fn);
+  } else if (typeof setImmediate === "function") {
+    setImmediate(fn);
+  } else {
+    Promise.resolve().then(fn);
+  }
 }
-/**
- * HighPerformanceQueue processes tasks concurrently.
- * If pauseAndClear() is called, it permanently halts processing,
- * clears queued tasks (resolving them with a custom value), and
- * 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) {
-        this.concurrency = concurrency;
-        this.partitionMetric = partitionMetric;
-        this.retrier = retrier;
-        this.refreshPartitionKeyRangeCache = refreshPartitionKeyRangeCache;
+  // 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 = void 0;
+  /**
+   * Creates a new HighPerformanceQueue.
+   */
+  constructor(concurrency, partitionMetric, retrier, refreshPartitionKeyRangeCache) {
+    this.concurrency = concurrency;
+    this.partitionMetric = partitionMetric;
+    this.retrier = retrier;
+    this.refreshPartitionKeyRangeCache = refreshPartitionKeyRangeCache;
+  }
+  /**
+   * Enqueue a task and return a Promise that resolves or rejects when the task completes.
+   * If the queue has been terminated via pauseAndClear, the promise resolves immediately with the terminated value.
+   */
+  push(batcher) {
+    if (this.terminated) {
+      const ops = batcher.getOperations();
+      ops.forEach((op) => this.retrier(op, op.operationContext.diagnosticNode));
+      return Promise.resolve(this.terminatedValue);
     }
-    /**
-     * Enqueue a task and return a Promise that resolves or rejects when the task completes.
-     * If the queue has been terminated via pauseAndClear, the promise resolves immediately with the terminated value.
-     */
-    push(batcher) {
-        if (this.terminated) {
-            const ops = batcher.getOperations();
-            ops.forEach((op) => this.retrier(op, op.operationContext.diagnosticNode));
-            return Promise.resolve(this.terminatedValue);
-        }
-        return new Promise((resolve, reject) => {
-            this.tasks.push({ batcher, resolve, reject });
-            this.scheduleProcess();
-        });
+    return new Promise((resolve, reject) => {
+      this.tasks.push({ batcher, resolve, reject });
+      this.scheduleProcess();
+    });
+  }
+  /**
+   * Permanently pauses processing and clears the queue.
+   * All queued tasks and subsequent push() calls will immediately resolve with the provided custom value.
+   */
+  async pauseAndClear(customValue, diagnosticNode) {
+    this.terminated = true;
+    this.terminatedValue = customValue;
+    const operationsList = [];
+    while (!this.tasks.isEmpty()) {
+      const queueItem = this.tasks.shift();
+      if (!queueItem) break;
+      if (customValue === import_statusCodes.StatusCodes.Gone) {
+        const operations = queueItem.batcher.getOperations();
+        operationsList.push(...operations);
+      }
+      queueItem.resolve(customValue);
     }
-    /**
-     * Permanently pauses processing and clears the queue.
-     * All queued tasks and subsequent push() calls will immediately resolve with the provided custom value.
-     */
-    async pauseAndClear(customValue, diagnosticNode) {
-        this.terminated = true;
-        this.terminatedValue = customValue;
-        const operationsList = [];
-        while (!this.tasks.isEmpty()) {
-            const queueItem = this.tasks.shift();
-            if (!queueItem)
-                break;
-            if (customValue === statusCodes_js_1.StatusCodes.Gone) {
-                const operations = queueItem.batcher.getOperations();
-                operationsList.push(...operations);
-            }
-            queueItem.resolve(customValue);
-        }
-        if (customValue === statusCodes_js_1.StatusCodes.Gone) {
-            // Multiple requests could result in 410 error for one partition based on degree of concurrency.
-            // The refreshPKRangeCachePromise is added to ensure that only one refreshPartitionKeyRangeCache() call is made
-            // to backend for one partition.
-            if (this.refreshPKRangeCachePromise) {
-                await this.refreshPKRangeCachePromise;
-            }
-            else {
-                this.refreshPKRangeCachePromise = this.refreshPartitionKeyRangeCache(diagnosticNode);
-                await this.refreshPKRangeCachePromise;
-            }
-            for (const operation of operationsList) {
-                await this.retrier(operation, operation.operationContext.diagnosticNode);
-            }
-        }
-    }
-    /**
-     * Schedules the processing loop using the best available asynchronous scheduler.
-     */
-    scheduleProcess() {
-        if (this.scheduled || this.processing || this.terminated)
-            return;
-        this.scheduled = true;
-        scheduleCallback(() => {
-            this.scheduled = false;
-            this.process();
-        });
+    if (customValue === import_statusCodes.StatusCodes.Gone) {
+      if (this.refreshPKRangeCachePromise) {
+        await this.refreshPKRangeCachePromise;
+      } else {
+        this.refreshPKRangeCachePromise = this.refreshPartitionKeyRangeCache(diagnosticNode);
+        await this.refreshPKRangeCachePromise;
+      }
+      for (const operation of operationsList) {
+        await this.retrier(operation, operation.operationContext.diagnosticNode);
+      }
     }
-    /**
-     * Processes tasks up to the concurrency limit.
-     */
-    process() {
-        if (this.terminated)
-            return;
-        this.processing = true;
+  }
+  /**
+   * Schedules the processing loop using the best available asynchronous scheduler.
+   */
+  scheduleProcess() {
+    if (this.scheduled || this.processing || this.terminated) return;
+    this.scheduled = true;
+    scheduleCallback(() => {
+      this.scheduled = false;
+      this.process();
+    });
+  }
+  /**
+   * Processes tasks up to the concurrency limit.
+   */
+  process() {
+    if (this.terminated) return;
+    this.processing = true;
+    try {
+      while (!this.terminated && this.running < this.concurrency && !this.tasks.isEmpty()) {
+        const queueItem = this.tasks.shift();
+        if (!queueItem) break;
+        this.running++;
+        let dispatchPromise;
         try {
-            while (!this.terminated && this.running < this.concurrency && !this.tasks.isEmpty()) {
-                const queueItem = this.tasks.shift();
-                if (!queueItem)
-                    break;
-                this.running++;
-                // Handle synchronous exceptions
-                let dispatchPromise;
-                try {
-                    dispatchPromise = queueItem.batcher.dispatch(this.partitionMetric);
-                }
-                catch (err) {
-                    // Handle synchronous errors
-                    queueItem.reject(err);
-                    this.running--;
-                    continue;
-                }
-                void dispatchPromise
-                    // eslint-disable-next-line promise/always-return
-                    .then((result) => {
-                    queueItem.resolve(result);
-                })
-                    .catch((err) => {
-                    queueItem.reject(err);
-                })
-                    .finally(() => {
-                    this.running--;
-                    if (!this.terminated && this.running < this.concurrency && !this.tasks.isEmpty()) {
-                        this.scheduleProcess();
-                    }
-                });
-            }
-        }
-        catch (err) {
-            console.error("Unexpected error in task queue processing:", err);
-        }
-        finally {
-            this.processing = false;
+          dispatchPromise = queueItem.batcher.dispatch(this.partitionMetric);
+        } catch (err) {
+          queueItem.reject(err);
+          this.running--;
+          continue;
         }
-    }
-    /**
-     * Dynamically updates the concurrency limit.
-     */
-    setConcurrency(newConcurrency) {
-        if (newConcurrency < 1) {
-            throw new Error("Concurrency must be at least 1");
-        }
-        this.concurrency = newConcurrency;
-        if (!this.terminated && this.running < this.concurrency) {
-            // Use the scheduleCallback helper for consistency
+        void dispatchPromise.then((result) => {
+          queueItem.resolve(result);
+        }).catch((err) => {
+          queueItem.reject(err);
+        }).finally(() => {
+          this.running--;
+          if (!this.terminated && this.running < this.concurrency && !this.tasks.isEmpty()) {
             this.scheduleProcess();
-        }
+          }
+        });
+      }
+    } catch (err) {
+      console.error("Unexpected error in task queue processing:", err);
+    } finally {
+      this.processing = false;
+    }
+  }
+  /**
+   * Dynamically updates the concurrency limit.
+   */
+  setConcurrency(newConcurrency) {
+    if (newConcurrency < 1) {
+      throw new Error("Concurrency must be at least 1");
+    }
+    this.concurrency = newConcurrency;
+    if (!this.terminated && this.running < this.concurrency) {
+      this.scheduleProcess();
     }
+  }
 }
-exports.LimiterQueue = LimiterQueue;
-//# sourceMappingURL=Limiter.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  LimiterQueue
+});
+//# sourceMappingURL=Limiter.js.map

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

@@ -1 +1,7 @@
-{"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"]}
+{
+  "version": 3,
+  "sources": ["../../../src/bulk/Limiter.ts"],
+  "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"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAGA,yBAA4B;AAe5B,MAAM,SAAY;AAAA,EACT;AAAA,EACA,OAA2B;AAAA,EAC3B,OAA2B;AAAA,EAClC,YAAY,OAAU;AACpB,SAAK,QAAQ;AAAA,EACf;AACF;AAEA,MAAM,iBAAoB;AAAA,EACjB,OAA2B;AAAA,EAC3B,OAA2B;AAAA,EAC3B,SAAS;AAAA,EAET,KAAK,OAAgB;AAC1B,UAAM,OAAO,IAAI,SAAS,KAAK;AAC/B,QAAI,CAAC,KAAK,MAAM;AACd,WAAK,OAAO,KAAK,OAAO;AAAA,IAC1B,OAAO;AACL,WAAK,KAAM,OAAO;AAClB,WAAK,OAAO,KAAK;AACjB,WAAK,OAAO;AAAA,IACd;AACA,SAAK;AAAA,EACP;AAAA,EAEO,QAAkB;AACvB,QAAI,CAAC,KAAK,KAAM,QAAO;AACvB,UAAM,QAAQ,KAAK,KAAK;AACxB,SAAK,OAAO,KAAK,KAAK;AACtB,QAAI,KAAK,MAAM;AACb,WAAK,KAAK,OAAO;AAAA,IACnB,OAAO;AACL,WAAK,OAAO;AAAA,IACd;AACA,SAAK;AACL,WAAO;AAAA,EACT;AAAA,EAEO,QAAc;AACnB,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,SAAS;AAAA,EAChB;AAAA,EAEO,UAAmB;AACxB,WAAO,KAAK,WAAW;AAAA,EACzB;AACF;AAKA,SAAS,iBAAiB,IAAsB;AAC9C,MAAI,OAAO,YAAY,eAAe,OAAO,QAAQ,aAAa,YAAY;AAC5E,YAAQ,SAAS,EAAE;AAAA,EACrB,WAAW,OAAO,iBAAiB,YAAY;AAC7C,iBAAa,EAAE;AAAA,EACjB,OAAO;AAEL,YAAQ,QAAQ,EAAE,KAAK,EAAE;AAAA,EAC3B;AACF;AAQO,MAAM,aAAa;AAAA;AAAA,EAEjB;AAAA;AAAA,EAEC,UAAU;AAAA;AAAA,EAEV,QAAqC,IAAI,iBAAiB;AAAA;AAAA,EAE1D,aAAa;AAAA;AAAA,EAEb;AAAA;AAAA,EAEA,YAAY;AAAA;AAAA,EAEZ,aAAa;AAAA;AAAA,EAEb;AAAA;AAAA,EAEA;AAAA;AAAA,EAES;AAAA,EACT,6BAAwD;AAAA;AAAA;AAAA;AAAA,EAIhE,YACE,aACA,iBACA,SACA,+BACA;AACA,SAAK,cAAc;AACnB,SAAK,kBAAkB;AACvB,SAAK,UAAU;AACf,SAAK,gCAAgC;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,KAAK,SAAgC;AAC1C,QAAI,KAAK,YAAY;AACnB,YAAM,MAAM,QAAQ,cAAc;AAClC,UAAI,QAAQ,CAAC,OAAO,KAAK,QAAQ,IAAI,GAAG,iBAAiB,cAAc,CAAC;AACxE,aAAO,QAAQ,QAAQ,KAAK,eAAe;AAAA,IAC7C;AACA,WAAO,IAAI,QAAa,CAAC,SAAS,WAAW;AAC3C,WAAK,MAAM,KAAK,EAAE,SAAS,SAAS,OAAO,CAAC;AAC5C,WAAK,gBAAgB;AAAA,IACvB,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAa,cACX,aACA,gBACe;AACf,SAAK,aAAa;AAClB,SAAK,kBAAkB;AACvB,UAAM,iBAAkC,CAAC;AACzC,WAAO,CAAC,KAAK,MAAM,QAAQ,GAAG;AAC5B,YAAM,YAAY,KAAK,MAAM,MAAM;AACnC,UAAI,CAAC,UAAW;AAChB,UAAI,gBAAgB,+BAAY,MAAM;AACpC,cAAM,aAAa,UAAU,QAAQ,cAAc;AACnD,uBAAe,KAAK,GAAG,UAAU;AAAA,MACnC;AACA,gBAAU,QAAQ,WAAW;AAAA,IAC/B;AACA,QAAI,gBAAgB,+BAAY,MAAM;AAIpC,UAAI,KAAK,4BAA4B;AACnC,cAAM,KAAK;AAAA,MACb,OAAO;AACL,aAAK,6BAA6B,KAAK,8BAA8B,cAAc;AACnF,cAAM,KAAK;AAAA,MACb;AACA,iBAAW,aAAa,gBAAgB;AACtC,cAAM,KAAK,QAAQ,WAAW,UAAU,iBAAiB,cAAc;AAAA,MACzE;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,kBAAwB;AAC9B,QAAI,KAAK,aAAa,KAAK,cAAc,KAAK,WAAY;AAC1D,SAAK,YAAY;AACjB,qBAAiB,MAAM;AACrB,WAAK,YAAY;AACjB,WAAK,QAAQ;AAAA,IACf,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKQ,UAAgB;AACtB,QAAI,KAAK,WAAY;AACrB,SAAK,aAAa;AAElB,QAAI;AACF,aAAO,CAAC,KAAK,cAAc,KAAK,UAAU,KAAK,eAAe,CAAC,KAAK,MAAM,QAAQ,GAAG;AACnF,cAAM,YAAY,KAAK,MAAM,MAAM;AACnC,YAAI,CAAC,UAAW;AAEhB,aAAK;AAGL,YAAI;AACJ,YAAI;AACF,4BAAkB,UAAU,QAAQ,SAAS,KAAK,eAAe;AAAA,QACnE,SAAS,KAAK;AAEZ,oBAAU,OAAO,GAAG;AACpB,eAAK;AACL;AAAA,QACF;AAEA,aAAK,gBAEF,KAAK,CAAC,WAAW;AAChB,oBAAU,QAAQ,MAAM;AAAA,QAC1B,CAAC,EACA,MAAM,CAAC,QAAQ;AACd,oBAAU,OAAO,GAAG;AAAA,QACtB,CAAC,EACA,QAAQ,MAAM;AACb,eAAK;AACL,cAAI,CAAC,KAAK,cAAc,KAAK,UAAU,KAAK,eAAe,CAAC,KAAK,MAAM,QAAQ,GAAG;AAChF,iBAAK,gBAAgB;AAAA,UACvB;AAAA,QACF,CAAC;AAAA,MACL;AAAA,IACF,SAAS,KAAK;AACZ,cAAQ,MAAM,8CAA8C,GAAG;AAAA,IACjE,UAAE;AACA,WAAK,aAAa;AAAA,IACpB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKO,eAAe,gBAA8B;AAClD,QAAI,iBAAiB,GAAG;AACtB,YAAM,IAAI,MAAM,gCAAgC;AAAA,IAClD;AACA,SAAK,cAAc;AACnB,QAAI,CAAC,KAAK,cAAc,KAAK,UAAU,KAAK,aAAa;AAEvD,WAAK,gBAAgB;AAAA,IACvB;AAAA,EACF;AACF;",
+  "names": []
+}

package/dist/commonjs/bulk/PartitionMetric.js

@@ -1,37 +1,61 @@
-"use strict";
-// Copyright (c) Microsoft Corporation.
-// Licensed under the MIT License.
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PartitionMetric = void 0;
-const tslib_1 = require("tslib");
-const semaphore_1 = tslib_1.__importDefault(require("semaphore"));
-/**
- * Captures the metrics for the requests made for bulk.
- */
+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 PartitionMetric_exports = {};
+__export(PartitionMetric_exports, {
+  PartitionMetric: () => PartitionMetric
+});
+module.exports = __toCommonJS(PartitionMetric_exports);
+var import_semaphore = __toESM(require("semaphore"));
 class PartitionMetric {
-    numberOfItemsOperatedOn;
-    timeTakenInMs;
-    numberOfThrottles;
-    semaphore;
-    constructor() {
-        this.numberOfItemsOperatedOn = 0;
-        this.timeTakenInMs = 0;
-        this.numberOfThrottles = 0;
-        this.semaphore = (0, semaphore_1.default)(1);
-    }
-    add(numberOfDoc, timeTakenInMs, numOfThrottles) {
-        // these operations should be atomic as multiple dispatch could be updating these values
-        this.semaphore.take(() => {
-            try {
-                this.numberOfItemsOperatedOn += numberOfDoc;
-                this.timeTakenInMs += timeTakenInMs;
-                this.numberOfThrottles += numOfThrottles;
-            }
-            finally {
-                this.semaphore.leave();
-            }
-        });
-    }
+  numberOfItemsOperatedOn;
+  timeTakenInMs;
+  numberOfThrottles;
+  semaphore;
+  constructor() {
+    this.numberOfItemsOperatedOn = 0;
+    this.timeTakenInMs = 0;
+    this.numberOfThrottles = 0;
+    this.semaphore = (0, import_semaphore.default)(1);
+  }
+  add(numberOfDoc, timeTakenInMs, numOfThrottles) {
+    this.semaphore.take(() => {
+      try {
+        this.numberOfItemsOperatedOn += numberOfDoc;
+        this.timeTakenInMs += timeTakenInMs;
+        this.numberOfThrottles += numOfThrottles;
+      } finally {
+        this.semaphore.leave();
+      }
+    });
+  }
 }
-exports.PartitionMetric = PartitionMetric;
-//# sourceMappingURL=PartitionMetric.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  PartitionMetric
+});
+//# sourceMappingURL=PartitionMetric.js.map

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

@@ -1 +1,7 @@
-{"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"]}
+{
+  "version": 3,
+  "sources": ["../../../src/bulk/PartitionMetric.ts"],
+  "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"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAGA,uBAAsB;AAKf,MAAM,gBAAgB;AAAA,EAC3B;AAAA,EACA;AAAA,EACA;AAAA,EACQ;AAAA,EAER,cAAc;AACZ,SAAK,0BAA0B;AAC/B,SAAK,gBAAgB;AACrB,SAAK,oBAAoB;AACzB,SAAK,gBAAY,iBAAAA,SAAU,CAAC;AAAA,EAC9B;AAAA,EAEA,IAAI,aAAqB,eAAuB,gBAA8B;AAE5E,SAAK,UAAU,KAAK,MAAM;AACxB,UAAI;AACF,aAAK,2BAA2B;AAChC,aAAK,iBAAiB;AACtB,aAAK,qBAAqB;AAAA,MAC5B,UAAE;AACA,aAAK,UAAU,MAAM;AAAA,MACvB;AAAA,IACF,CAAC;AAAA,EACH;AACF;",
+  "names": ["semaphore"]
+}

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

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

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

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