@azure/cosmos 4.9.1 → 4.9.2

package/dist/commonjs/routing/CollectionRoutingMapFactory.js

@@ -1,75 +1,77 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createCompleteRoutingMap = createCompleteRoutingMap;
-// Copyright (c) Microsoft Corporation.
-// Licensed under the MIT License.
-const constants_js_1 = require("../common/constants.js");
-const inMemoryCollectionRoutingMap_js_1 = require("./inMemoryCollectionRoutingMap.js");
-/**
- * @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 CollectionRoutingMapFactory_exports = {};
+__export(CollectionRoutingMapFactory_exports, {
+  createCompleteRoutingMap: () => createCompleteRoutingMap
+});
+module.exports = __toCommonJS(CollectionRoutingMapFactory_exports);
+var import_constants = require("../common/constants.js");
+var import_inMemoryCollectionRoutingMap = require("./inMemoryCollectionRoutingMap.js");
 function compareRanges(a, b) {
-    const aVal = a[0][constants_js_1.Constants.PartitionKeyRange.MinInclusive];
-    const bVal = b[0][constants_js_1.Constants.PartitionKeyRange.MinInclusive];
-    if (aVal > bVal) {
-        return 1;
-    }
-    if (aVal < bVal) {
-        return -1;
-    }
-    return 0;
+  const aVal = a[0][import_constants.Constants.PartitionKeyRange.MinInclusive];
+  const bVal = b[0][import_constants.Constants.PartitionKeyRange.MinInclusive];
+  if (aVal > bVal) {
+    return 1;
+  }
+  if (aVal < bVal) {
+    return -1;
+  }
+  return 0;
 }
-/** @hidden */
 function createCompleteRoutingMap(partitionKeyRangeInfoTuppleList) {
-    const rangeById = {}; // TODO: any
-    const rangeByInfo = {}; // TODO: any
-    let sortedRanges = [];
-    // the for loop doesn't invoke any async callback
-    for (const r of partitionKeyRangeInfoTuppleList) {
-        rangeById[r[0][constants_js_1.Constants.PartitionKeyRange.Id]] = r;
-        rangeByInfo[r[1]] = r[0];
-        sortedRanges.push(r);
-    }
-    sortedRanges = sortedRanges.sort(compareRanges);
-    const partitionKeyOrderedRange = sortedRanges.map((r) => r[0]);
-    const orderedPartitionInfo = sortedRanges.map((r) => r[1]);
-    if (!isCompleteSetOfRange(partitionKeyOrderedRange)) {
-        return undefined;
-    }
-    return new inMemoryCollectionRoutingMap_js_1.InMemoryCollectionRoutingMap(partitionKeyOrderedRange, orderedPartitionInfo);
+  const rangeById = {};
+  const rangeByInfo = {};
+  let sortedRanges = [];
+  for (const r of partitionKeyRangeInfoTuppleList) {
+    rangeById[r[0][import_constants.Constants.PartitionKeyRange.Id]] = r;
+    rangeByInfo[r[1]] = r[0];
+    sortedRanges.push(r);
+  }
+  sortedRanges = sortedRanges.sort(compareRanges);
+  const partitionKeyOrderedRange = sortedRanges.map((r) => r[0]);
+  const orderedPartitionInfo = sortedRanges.map((r) => r[1]);
+  if (!isCompleteSetOfRange(partitionKeyOrderedRange)) {
+    return void 0;
+  }
+  return new import_inMemoryCollectionRoutingMap.InMemoryCollectionRoutingMap(partitionKeyOrderedRange, orderedPartitionInfo);
 }
-/**
- * @hidden
- */
 function isCompleteSetOfRange(partitionKeyOrderedRange) {
-    // TODO: any
-    let isComplete = false;
-    if (partitionKeyOrderedRange.length > 0) {
-        const firstRange = partitionKeyOrderedRange[0];
-        const lastRange = partitionKeyOrderedRange[partitionKeyOrderedRange.length - 1];
-        isComplete =
-            firstRange[constants_js_1.Constants.PartitionKeyRange.MinInclusive] ===
-                constants_js_1.Constants.EffectivePartitionKeyConstants.MinimumInclusiveEffectivePartitionKey;
-        isComplete =
-            isComplete &&
-                lastRange[constants_js_1.Constants.PartitionKeyRange.MaxExclusive] ===
-                    constants_js_1.Constants.EffectivePartitionKeyConstants.MaximumExclusiveEffectivePartitionKey;
-        for (let i = 1; i < partitionKeyOrderedRange.length; i++) {
-            const previousRange = partitionKeyOrderedRange[i - 1];
-            const currentRange = partitionKeyOrderedRange[i];
-            isComplete =
-                isComplete &&
-                    previousRange[constants_js_1.Constants.PartitionKeyRange.MaxExclusive] ===
-                        currentRange[constants_js_1.Constants.PartitionKeyRange.MinInclusive];
-            if (!isComplete) {
-                if (previousRange[constants_js_1.Constants.PartitionKeyRange.MaxExclusive] >
-                    currentRange[constants_js_1.Constants.PartitionKeyRange.MinInclusive]) {
-                    throw Error("Ranges overlap");
-                }
-                break;
-            }
+  let isComplete = false;
+  if (partitionKeyOrderedRange.length > 0) {
+    const firstRange = partitionKeyOrderedRange[0];
+    const lastRange = partitionKeyOrderedRange[partitionKeyOrderedRange.length - 1];
+    isComplete = firstRange[import_constants.Constants.PartitionKeyRange.MinInclusive] === import_constants.Constants.EffectivePartitionKeyConstants.MinimumInclusiveEffectivePartitionKey;
+    isComplete = isComplete && lastRange[import_constants.Constants.PartitionKeyRange.MaxExclusive] === import_constants.Constants.EffectivePartitionKeyConstants.MaximumExclusiveEffectivePartitionKey;
+    for (let i = 1; i < partitionKeyOrderedRange.length; i++) {
+      const previousRange = partitionKeyOrderedRange[i - 1];
+      const currentRange = partitionKeyOrderedRange[i];
+      isComplete = isComplete && previousRange[import_constants.Constants.PartitionKeyRange.MaxExclusive] === currentRange[import_constants.Constants.PartitionKeyRange.MinInclusive];
+      if (!isComplete) {
+        if (previousRange[import_constants.Constants.PartitionKeyRange.MaxExclusive] > currentRange[import_constants.Constants.PartitionKeyRange.MinInclusive]) {
+          throw Error("Ranges overlap");
         }
+        break;
+      }
     }
-    return isComplete;
+  }
+  return isComplete;
 }
-//# sourceMappingURL=CollectionRoutingMapFactory.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  createCompleteRoutingMap
+});

package/dist/commonjs/routing/CollectionRoutingMapFactory.js.map

@@ -1 +1,7 @@
-{"version":3,"file":"CollectionRoutingMapFactory.js","sourceRoot":"","sources":["../../../src/routing/CollectionRoutingMapFactory.ts"],"names":[],"mappings":";;AAqBA,4DAuBC;AA5CD,uCAAuC;AACvC,kCAAkC;AAClC,yDAAmD;AACnD,uFAAiF;AAEjF;;GAEG;AACH,SAAS,aAAa,CAAC,CAAM,EAAE,CAAM;IACnC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;IAC5D,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;IAC5D,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;QAChB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;QAChB,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,cAAc;AACd,SAAgB,wBAAwB,CACtC,+BAAsC;IAEtC,MAAM,SAAS,GAAQ,EAAE,CAAC,CAAC,YAAY;IACvC,MAAM,WAAW,GAAQ,EAAE,CAAC,CAAC,YAAY;IAEzC,IAAI,YAAY,GAAG,EAAE,CAAC;IAEtB,iDAAiD;IACjD,KAAK,MAAM,CAAC,IAAI,+BAA+B,EAAE,CAAC;QAChD,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAS,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACpD,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAChD,MAAM,wBAAwB,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,MAAM,oBAAoB,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3D,IAAI,CAAC,oBAAoB,CAAC,wBAAwB,CAAC,EAAE,CAAC;QACpD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,IAAI,8DAA4B,CAAC,wBAAwB,EAAE,oBAAoB,CAAC,CAAC;AAC1F,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,wBAA6B;IACzD,YAAY;IACZ,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,IAAI,wBAAwB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,MAAM,UAAU,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,wBAAwB,CAAC,wBAAwB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChF,UAAU;YACR,UAAU,CAAC,wBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC;gBACpD,wBAAS,CAAC,8BAA8B,CAAC,qCAAqC,CAAC;QACjF,UAAU;YACR,UAAU;gBACV,SAAS,CAAC,wBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC;oBACjD,wBAAS,CAAC,8BAA8B,CAAC,qCAAqC,CAAC;QAEnF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,wBAAwB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,MAAM,aAAa,GAAG,wBAAwB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,MAAM,YAAY,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAAC;YACjD,UAAU;gBACR,UAAU;oBACV,aAAa,CAAC,wBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC;wBACrD,YAAY,CAAC,wBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;YAE3D,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,IACE,aAAa,CAAC,wBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC;oBACvD,YAAY,CAAC,wBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,EACtD,CAAC;oBACD,MAAM,KAAK,CAAC,gBAAgB,CAAC,CAAC;gBAChC,CAAC;gBACD,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport { Constants } from \"../common/constants.js\";\nimport { InMemoryCollectionRoutingMap } from \"./inMemoryCollectionRoutingMap.js\";\n\n/**\n * @hidden\n */\nfunction compareRanges(a: any, b: any): 0 | 1 | -1 {\n  const aVal = a[0][Constants.PartitionKeyRange.MinInclusive];\n  const bVal = b[0][Constants.PartitionKeyRange.MinInclusive];\n  if (aVal > bVal) {\n    return 1;\n  }\n  if (aVal < bVal) {\n    return -1;\n  }\n  return 0;\n}\n\n/** @hidden */\nexport function createCompleteRoutingMap(\n  partitionKeyRangeInfoTuppleList: any[],\n): InMemoryCollectionRoutingMap {\n  const rangeById: any = {}; // TODO: any\n  const rangeByInfo: any = {}; // TODO: any\n\n  let sortedRanges = [];\n\n  // the for loop doesn't invoke any async callback\n  for (const r of partitionKeyRangeInfoTuppleList) {\n    rangeById[r[0][Constants.PartitionKeyRange.Id]] = r;\n    rangeByInfo[r[1]] = r[0];\n    sortedRanges.push(r);\n  }\n\n  sortedRanges = sortedRanges.sort(compareRanges);\n  const partitionKeyOrderedRange = sortedRanges.map((r) => r[0]);\n  const orderedPartitionInfo = sortedRanges.map((r) => r[1]);\n\n  if (!isCompleteSetOfRange(partitionKeyOrderedRange)) {\n    return undefined;\n  }\n  return new InMemoryCollectionRoutingMap(partitionKeyOrderedRange, orderedPartitionInfo);\n}\n\n/**\n * @hidden\n */\nfunction isCompleteSetOfRange(partitionKeyOrderedRange: any): boolean {\n  // TODO: any\n  let isComplete = false;\n  if (partitionKeyOrderedRange.length > 0) {\n    const firstRange = partitionKeyOrderedRange[0];\n    const lastRange = partitionKeyOrderedRange[partitionKeyOrderedRange.length - 1];\n    isComplete =\n      firstRange[Constants.PartitionKeyRange.MinInclusive] ===\n      Constants.EffectivePartitionKeyConstants.MinimumInclusiveEffectivePartitionKey;\n    isComplete =\n      isComplete &&\n      lastRange[Constants.PartitionKeyRange.MaxExclusive] ===\n        Constants.EffectivePartitionKeyConstants.MaximumExclusiveEffectivePartitionKey;\n\n    for (let i = 1; i < partitionKeyOrderedRange.length; i++) {\n      const previousRange = partitionKeyOrderedRange[i - 1];\n      const currentRange = partitionKeyOrderedRange[i];\n      isComplete =\n        isComplete &&\n        previousRange[Constants.PartitionKeyRange.MaxExclusive] ===\n          currentRange[Constants.PartitionKeyRange.MinInclusive];\n\n      if (!isComplete) {\n        if (\n          previousRange[Constants.PartitionKeyRange.MaxExclusive] >\n          currentRange[Constants.PartitionKeyRange.MinInclusive]\n        ) {\n          throw Error(\"Ranges overlap\");\n        }\n        break;\n      }\n    }\n  }\n  return isComplete;\n}\n"]}
+{
+  "version": 3,
+  "sources": ["/mnt/vss/_work/1/s/sdk/cosmosdb/cosmos/src/routing/CollectionRoutingMapFactory.ts"],
+  "sourcesContent": ["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport { Constants } from \"../common/constants.js\";\nimport { InMemoryCollectionRoutingMap } from \"./inMemoryCollectionRoutingMap.js\";\n\n/**\n * @hidden\n */\nfunction compareRanges(a: any, b: any): 0 | 1 | -1 {\n  const aVal = a[0][Constants.PartitionKeyRange.MinInclusive];\n  const bVal = b[0][Constants.PartitionKeyRange.MinInclusive];\n  if (aVal > bVal) {\n    return 1;\n  }\n  if (aVal < bVal) {\n    return -1;\n  }\n  return 0;\n}\n\n/** @hidden */\nexport function createCompleteRoutingMap(\n  partitionKeyRangeInfoTuppleList: any[],\n): InMemoryCollectionRoutingMap {\n  const rangeById: any = {}; // TODO: any\n  const rangeByInfo: any = {}; // TODO: any\n\n  let sortedRanges = [];\n\n  // the for loop doesn't invoke any async callback\n  for (const r of partitionKeyRangeInfoTuppleList) {\n    rangeById[r[0][Constants.PartitionKeyRange.Id]] = r;\n    rangeByInfo[r[1]] = r[0];\n    sortedRanges.push(r);\n  }\n\n  sortedRanges = sortedRanges.sort(compareRanges);\n  const partitionKeyOrderedRange = sortedRanges.map((r) => r[0]);\n  const orderedPartitionInfo = sortedRanges.map((r) => r[1]);\n\n  if (!isCompleteSetOfRange(partitionKeyOrderedRange)) {\n    return undefined;\n  }\n  return new InMemoryCollectionRoutingMap(partitionKeyOrderedRange, orderedPartitionInfo);\n}\n\n/**\n * @hidden\n */\nfunction isCompleteSetOfRange(partitionKeyOrderedRange: any): boolean {\n  // TODO: any\n  let isComplete = false;\n  if (partitionKeyOrderedRange.length > 0) {\n    const firstRange = partitionKeyOrderedRange[0];\n    const lastRange = partitionKeyOrderedRange[partitionKeyOrderedRange.length - 1];\n    isComplete =\n      firstRange[Constants.PartitionKeyRange.MinInclusive] ===\n      Constants.EffectivePartitionKeyConstants.MinimumInclusiveEffectivePartitionKey;\n    isComplete =\n      isComplete &&\n      lastRange[Constants.PartitionKeyRange.MaxExclusive] ===\n        Constants.EffectivePartitionKeyConstants.MaximumExclusiveEffectivePartitionKey;\n\n    for (let i = 1; i < partitionKeyOrderedRange.length; i++) {\n      const previousRange = partitionKeyOrderedRange[i - 1];\n      const currentRange = partitionKeyOrderedRange[i];\n      isComplete =\n        isComplete &&\n        previousRange[Constants.PartitionKeyRange.MaxExclusive] ===\n          currentRange[Constants.PartitionKeyRange.MinInclusive];\n\n      if (!isComplete) {\n        if (\n          previousRange[Constants.PartitionKeyRange.MaxExclusive] >\n          currentRange[Constants.PartitionKeyRange.MinInclusive]\n        ) {\n          throw Error(\"Ranges overlap\");\n        }\n        break;\n      }\n    }\n  }\n  return isComplete;\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAEA,uBAA0B;AAC1B,0CAA6C;AAK7C,SAAS,cAAc,GAAQ,GAAoB;AACjD,QAAM,OAAO,EAAE,CAAC,EAAE,2BAAU,kBAAkB,YAAY;AAC1D,QAAM,OAAO,EAAE,CAAC,EAAE,2BAAU,kBAAkB,YAAY;AAC1D,MAAI,OAAO,MAAM;AACf,WAAO;AAAA,EACT;AACA,MAAI,OAAO,MAAM;AACf,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGO,SAAS,yBACd,iCAC8B;AAC9B,QAAM,YAAiB,CAAC;AACxB,QAAM,cAAmB,CAAC;AAE1B,MAAI,eAAe,CAAC;AAGpB,aAAW,KAAK,iCAAiC;AAC/C,cAAU,EAAE,CAAC,EAAE,2BAAU,kBAAkB,EAAE,CAAC,IAAI;AAClD,gBAAY,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;AACvB,iBAAa,KAAK,CAAC;AAAA,EACrB;AAEA,iBAAe,aAAa,KAAK,aAAa;AAC9C,QAAM,2BAA2B,aAAa,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAC7D,QAAM,uBAAuB,aAAa,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAEzD,MAAI,CAAC,qBAAqB,wBAAwB,GAAG;AACnD,WAAO;AAAA,EACT;AACA,SAAO,IAAI,iEAA6B,0BAA0B,oBAAoB;AACxF;AAKA,SAAS,qBAAqB,0BAAwC;AAEpE,MAAI,aAAa;AACjB,MAAI,yBAAyB,SAAS,GAAG;AACvC,UAAM,aAAa,yBAAyB,CAAC;AAC7C,UAAM,YAAY,yBAAyB,yBAAyB,SAAS,CAAC;AAC9E,iBACE,WAAW,2BAAU,kBAAkB,YAAY,MACnD,2BAAU,+BAA+B;AAC3C,iBACE,cACA,UAAU,2BAAU,kBAAkB,YAAY,MAChD,2BAAU,+BAA+B;AAE7C,aAAS,IAAI,GAAG,IAAI,yBAAyB,QAAQ,KAAK;AACxD,YAAM,gBAAgB,yBAAyB,IAAI,CAAC;AACpD,YAAM,eAAe,yBAAyB,CAAC;AAC/C,mBACE,cACA,cAAc,2BAAU,kBAAkB,YAAY,MACpD,aAAa,2BAAU,kBAAkB,YAAY;AAEzD,UAAI,CAAC,YAAY;AACf,YACE,cAAc,2BAAU,kBAAkB,YAAY,IACtD,aAAa,2BAAU,kBAAkB,YAAY,GACrD;AACA,gBAAM,MAAM,gBAAgB;AAAA,QAC9B;AACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;",
+  "names": []
+}

package/dist/commonjs/routing/QueryRange.js

@@ -1,71 +1,97 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.QueryRange = void 0;
-const index_js_1 = require("../common/index.js");
-/** @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 QueryRange_exports = {};
+__export(QueryRange_exports, {
+  QueryRange: () => QueryRange
+});
+module.exports = __toCommonJS(QueryRange_exports);
+var import_common = require("../common/index.js");
 class QueryRange {
-    min;
-    max;
-    isMinInclusive;
-    isMaxInclusive;
-    /**
-     * Represents a QueryRange.
-     *
-     * @param rangeMin                - min
-     * @param rangeMin                - max
-     * @param isMinInclusive         - isMinInclusive
-     * @param isMaxInclusive         - isMaxInclusive
-     * @hidden
-     */
-    constructor(rangeMin, rangeMax, isMinInclusive, isMaxInclusive) {
-        this.min = rangeMin;
-        this.max = rangeMax;
-        this.isMinInclusive = isMinInclusive;
-        this.isMaxInclusive = isMaxInclusive;
+  min;
+  max;
+  isMinInclusive;
+  isMaxInclusive;
+  /**
+   * Represents a QueryRange.
+   *
+   * @param rangeMin                - min
+   * @param rangeMin                - max
+   * @param isMinInclusive         - isMinInclusive
+   * @param isMaxInclusive         - isMaxInclusive
+   * @hidden
+   */
+  constructor(rangeMin, rangeMax, isMinInclusive, isMaxInclusive) {
+    this.min = rangeMin;
+    this.max = rangeMax;
+    this.isMinInclusive = isMinInclusive;
+    this.isMaxInclusive = isMaxInclusive;
+  }
+  overlaps(other) {
+    const range1 = this;
+    const range2 = other;
+    if (range1 === void 0 || range2 === void 0) {
+      return false;
     }
-    overlaps(other) {
-        const range1 = this; // eslint-disable-line @typescript-eslint/no-this-alias
-        const range2 = other;
-        if (range1 === undefined || range2 === undefined) {
-            return false;
-        }
-        if (range1.isEmpty() || range2.isEmpty()) {
-            return false;
-        }
-        if (range1.min <= range2.max || range2.min <= range1.max) {
-            if ((range1.min === range2.max && !(range1.isMinInclusive && range2.isMaxInclusive)) ||
-                (range2.min === range1.max && !(range2.isMinInclusive && range1.isMaxInclusive))) {
-                return false;
-            }
-            return true;
-        }
-        return false;
-    }
-    isFullRange() {
-        return (this.min === index_js_1.Constants.EffectivePartitionKeyConstants.MinimumInclusiveEffectivePartitionKey &&
-            this.max === index_js_1.Constants.EffectivePartitionKeyConstants.MaximumExclusiveEffectivePartitionKey &&
-            this.isMinInclusive === true &&
-            this.isMaxInclusive === false);
-    }
-    isEmpty() {
-        return !(this.isMinInclusive && this.isMaxInclusive) && this.min === this.max;
+    if (range1.isEmpty() || range2.isEmpty()) {
+      return false;
     }
-    /**
-     * Parse a QueryRange from a partitionKeyRange
-     * @returns QueryRange
-     * @hidden
-     */
-    static parsePartitionKeyRange(partitionKeyRange) {
-        return new QueryRange(partitionKeyRange[index_js_1.Constants.PartitionKeyRange.MinInclusive], partitionKeyRange[index_js_1.Constants.PartitionKeyRange.MaxExclusive], true, false);
-    }
-    /**
-     * Parse a QueryRange from a dictionary
-     * @returns QueryRange
-     * @hidden
-     */
-    static parseFromDict(queryRangeDict) {
-        return new QueryRange(queryRangeDict.min, queryRangeDict.max, queryRangeDict.isMinInclusive, queryRangeDict.isMaxInclusive);
+    if (range1.min <= range2.max || range2.min <= range1.max) {
+      if (range1.min === range2.max && !(range1.isMinInclusive && range2.isMaxInclusive) || range2.min === range1.max && !(range2.isMinInclusive && range1.isMaxInclusive)) {
+        return false;
+      }
+      return true;
     }
+    return false;
+  }
+  isFullRange() {
+    return this.min === import_common.Constants.EffectivePartitionKeyConstants.MinimumInclusiveEffectivePartitionKey && this.max === import_common.Constants.EffectivePartitionKeyConstants.MaximumExclusiveEffectivePartitionKey && this.isMinInclusive === true && this.isMaxInclusive === false;
+  }
+  isEmpty() {
+    return !(this.isMinInclusive && this.isMaxInclusive) && this.min === this.max;
+  }
+  /**
+   * Parse a QueryRange from a partitionKeyRange
+   * @returns QueryRange
+   * @hidden
+   */
+  static parsePartitionKeyRange(partitionKeyRange) {
+    return new QueryRange(
+      partitionKeyRange[import_common.Constants.PartitionKeyRange.MinInclusive],
+      partitionKeyRange[import_common.Constants.PartitionKeyRange.MaxExclusive],
+      true,
+      false
+    );
+  }
+  /**
+   * Parse a QueryRange from a dictionary
+   * @returns QueryRange
+   * @hidden
+   */
+  static parseFromDict(queryRangeDict) {
+    return new QueryRange(
+      queryRangeDict.min,
+      queryRangeDict.max,
+      queryRangeDict.isMinInclusive,
+      queryRangeDict.isMaxInclusive
+    );
+  }
 }
-exports.QueryRange = QueryRange;
-//# sourceMappingURL=QueryRange.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  QueryRange
+});

package/dist/commonjs/routing/QueryRange.js.map

@@ -1 +1,7 @@
-{"version":3,"file":"QueryRange.js","sourceRoot":"","sources":["../../../src/routing/QueryRange.ts"],"names":[],"mappings":";;;AAGA,iDAA+C;AAG/C,cAAc;AACd,MAAa,UAAU;IACd,GAAG,CAAS;IACZ,GAAG,CAAS;IACZ,cAAc,CAAU;IACxB,cAAc,CAAU;IAE/B;;;;;;;;OAQG;IACH,YACE,QAAgB,EAChB,QAAgB,EAChB,cAAuB,EACvB,cAAuB;QAEvB,IAAI,CAAC,GAAG,GAAG,QAAQ,CAAC;QACpB,IAAI,CAAC,GAAG,GAAG,QAAQ,CAAC;QACpB,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACvC,CAAC;IACM,QAAQ,CAAC,KAAiB;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,uDAAuD;QAC5E,MAAM,MAAM,GAAG,KAAK,CAAC;QACrB,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACjD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,MAAM,CAAC,OAAO,EAAE,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YACzC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC;YACzD,IACE,CAAC,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,cAAc,IAAI,MAAM,CAAC,cAAc,CAAC,CAAC;gBAChF,CAAC,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,cAAc,IAAI,MAAM,CAAC,cAAc,CAAC,CAAC,EAChF,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,WAAW;QAChB,OAAO,CACL,IAAI,CAAC,GAAG,KAAK,oBAAS,CAAC,8BAA8B,CAAC,qCAAqC;YAC3F,IAAI,CAAC,GAAG,KAAK,oBAAS,CAAC,8BAA8B,CAAC,qCAAqC;YAC3F,IAAI,CAAC,cAAc,KAAK,IAAI;YAC5B,IAAI,CAAC,cAAc,KAAK,KAAK,CAC9B,CAAC;IACJ,CAAC;IAEM,OAAO;QACZ,OAAO,CAAC,CAAC,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC;IAChF,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,sBAAsB,CAAC,iBAAoC;QACvE,OAAO,IAAI,UAAU,CACnB,iBAAiB,CAAC,oBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,EAC3D,iBAAiB,CAAC,oBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,EAC3D,IAAI,EACJ,KAAK,CACN,CAAC;IACJ,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,aAAa,CAAC,cAAkC;QAC5D,OAAO,IAAI,UAAU,CACnB,cAAc,CAAC,GAAG,EAClB,cAAc,CAAC,GAAG,EAClB,cAAc,CAAC,cAAc,EAC7B,cAAc,CAAC,cAAc,CAC9B,CAAC;IACJ,CAAC;CACF;AAtFD,gCAsFC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { PartitionKeyRange } from \"../client/Container/PartitionKeyRange.js\";\nimport { Constants } from \"../common/index.js\";\nimport type { QueryRange as ResponseQueryRange } from \"../request/ErrorResponse.js\";\n\n/** @hidden */\nexport class QueryRange {\n  public min: string;\n  public max: string;\n  public isMinInclusive: boolean;\n  public isMaxInclusive: boolean;\n\n  /**\n   * Represents a QueryRange.\n   *\n   * @param rangeMin                - min\n   * @param rangeMin                - max\n   * @param isMinInclusive         - isMinInclusive\n   * @param isMaxInclusive         - isMaxInclusive\n   * @hidden\n   */\n  constructor(\n    rangeMin: string,\n    rangeMax: string,\n    isMinInclusive: boolean,\n    isMaxInclusive: boolean,\n  ) {\n    this.min = rangeMin;\n    this.max = rangeMax;\n    this.isMinInclusive = isMinInclusive;\n    this.isMaxInclusive = isMaxInclusive;\n  }\n  public overlaps(other: QueryRange): boolean {\n    const range1 = this; // eslint-disable-line @typescript-eslint/no-this-alias\n    const range2 = other;\n    if (range1 === undefined || range2 === undefined) {\n      return false;\n    }\n    if (range1.isEmpty() || range2.isEmpty()) {\n      return false;\n    }\n\n    if (range1.min <= range2.max || range2.min <= range1.max) {\n      if (\n        (range1.min === range2.max && !(range1.isMinInclusive && range2.isMaxInclusive)) ||\n        (range2.min === range1.max && !(range2.isMinInclusive && range1.isMaxInclusive))\n      ) {\n        return false;\n      }\n      return true;\n    }\n    return false;\n  }\n\n  public isFullRange(): boolean {\n    return (\n      this.min === Constants.EffectivePartitionKeyConstants.MinimumInclusiveEffectivePartitionKey &&\n      this.max === Constants.EffectivePartitionKeyConstants.MaximumExclusiveEffectivePartitionKey &&\n      this.isMinInclusive === true &&\n      this.isMaxInclusive === false\n    );\n  }\n\n  public isEmpty(): boolean {\n    return !(this.isMinInclusive && this.isMaxInclusive) && this.min === this.max;\n  }\n  /**\n   * Parse a QueryRange from a partitionKeyRange\n   * @returns QueryRange\n   * @hidden\n   */\n  public static parsePartitionKeyRange(partitionKeyRange: PartitionKeyRange): QueryRange {\n    return new QueryRange(\n      partitionKeyRange[Constants.PartitionKeyRange.MinInclusive],\n      partitionKeyRange[Constants.PartitionKeyRange.MaxExclusive],\n      true,\n      false,\n    );\n  }\n  /**\n   * Parse a QueryRange from a dictionary\n   * @returns QueryRange\n   * @hidden\n   */\n  public static parseFromDict(queryRangeDict: ResponseQueryRange): QueryRange {\n    return new QueryRange(\n      queryRangeDict.min,\n      queryRangeDict.max,\n      queryRangeDict.isMinInclusive,\n      queryRangeDict.isMaxInclusive,\n    );\n  }\n}\n"]}
+{
+  "version": 3,
+  "sources": ["/mnt/vss/_work/1/s/sdk/cosmosdb/cosmos/src/routing/QueryRange.ts"],
+  "sourcesContent": ["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { PartitionKeyRange } from \"../client/Container/PartitionKeyRange.js\";\nimport { Constants } from \"../common/index.js\";\nimport type { QueryRange as ResponseQueryRange } from \"../request/ErrorResponse.js\";\n\n/** @hidden */\nexport class QueryRange {\n  public min: string;\n  public max: string;\n  public isMinInclusive: boolean;\n  public isMaxInclusive: boolean;\n\n  /**\n   * Represents a QueryRange.\n   *\n   * @param rangeMin                - min\n   * @param rangeMin                - max\n   * @param isMinInclusive         - isMinInclusive\n   * @param isMaxInclusive         - isMaxInclusive\n   * @hidden\n   */\n  constructor(\n    rangeMin: string,\n    rangeMax: string,\n    isMinInclusive: boolean,\n    isMaxInclusive: boolean,\n  ) {\n    this.min = rangeMin;\n    this.max = rangeMax;\n    this.isMinInclusive = isMinInclusive;\n    this.isMaxInclusive = isMaxInclusive;\n  }\n  public overlaps(other: QueryRange): boolean {\n    const range1 = this; // eslint-disable-line @typescript-eslint/no-this-alias\n    const range2 = other;\n    if (range1 === undefined || range2 === undefined) {\n      return false;\n    }\n    if (range1.isEmpty() || range2.isEmpty()) {\n      return false;\n    }\n\n    if (range1.min <= range2.max || range2.min <= range1.max) {\n      if (\n        (range1.min === range2.max && !(range1.isMinInclusive && range2.isMaxInclusive)) ||\n        (range2.min === range1.max && !(range2.isMinInclusive && range1.isMaxInclusive))\n      ) {\n        return false;\n      }\n      return true;\n    }\n    return false;\n  }\n\n  public isFullRange(): boolean {\n    return (\n      this.min === Constants.EffectivePartitionKeyConstants.MinimumInclusiveEffectivePartitionKey &&\n      this.max === Constants.EffectivePartitionKeyConstants.MaximumExclusiveEffectivePartitionKey &&\n      this.isMinInclusive === true &&\n      this.isMaxInclusive === false\n    );\n  }\n\n  public isEmpty(): boolean {\n    return !(this.isMinInclusive && this.isMaxInclusive) && this.min === this.max;\n  }\n  /**\n   * Parse a QueryRange from a partitionKeyRange\n   * @returns QueryRange\n   * @hidden\n   */\n  public static parsePartitionKeyRange(partitionKeyRange: PartitionKeyRange): QueryRange {\n    return new QueryRange(\n      partitionKeyRange[Constants.PartitionKeyRange.MinInclusive],\n      partitionKeyRange[Constants.PartitionKeyRange.MaxExclusive],\n      true,\n      false,\n    );\n  }\n  /**\n   * Parse a QueryRange from a dictionary\n   * @returns QueryRange\n   * @hidden\n   */\n  public static parseFromDict(queryRangeDict: ResponseQueryRange): QueryRange {\n    return new QueryRange(\n      queryRangeDict.min,\n      queryRangeDict.max,\n      queryRangeDict.isMinInclusive,\n      queryRangeDict.isMaxInclusive,\n    );\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAGA,oBAA0B;AAInB,MAAM,WAAW;AAAA,EACf;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWP,YACE,UACA,UACA,gBACA,gBACA;AACA,SAAK,MAAM;AACX,SAAK,MAAM;AACX,SAAK,iBAAiB;AACtB,SAAK,iBAAiB;AAAA,EACxB;AAAA,EACO,SAAS,OAA4B;AAC1C,UAAM,SAAS;AACf,UAAM,SAAS;AACf,QAAI,WAAW,UAAa,WAAW,QAAW;AAChD,aAAO;AAAA,IACT;AACA,QAAI,OAAO,QAAQ,KAAK,OAAO,QAAQ,GAAG;AACxC,aAAO;AAAA,IACT;AAEA,QAAI,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;AACxD,UACG,OAAO,QAAQ,OAAO,OAAO,EAAE,OAAO,kBAAkB,OAAO,mBAC/D,OAAO,QAAQ,OAAO,OAAO,EAAE,OAAO,kBAAkB,OAAO,iBAChE;AACA,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EAEO,cAAuB;AAC5B,WACE,KAAK,QAAQ,wBAAU,+BAA+B,yCACtD,KAAK,QAAQ,wBAAU,+BAA+B,yCACtD,KAAK,mBAAmB,QACxB,KAAK,mBAAmB;AAAA,EAE5B;AAAA,EAEO,UAAmB;AACxB,WAAO,EAAE,KAAK,kBAAkB,KAAK,mBAAmB,KAAK,QAAQ,KAAK;AAAA,EAC5E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAc,uBAAuB,mBAAkD;AACrF,WAAO,IAAI;AAAA,MACT,kBAAkB,wBAAU,kBAAkB,YAAY;AAAA,MAC1D,kBAAkB,wBAAU,kBAAkB,YAAY;AAAA,MAC1D;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,OAAc,cAAc,gBAAgD;AAC1E,WAAO,IAAI;AAAA,MACT,eAAe;AAAA,MACf,eAAe;AAAA,MACf,eAAe;AAAA,MACf,eAAe;AAAA,IACjB;AAAA,EACF;AACF;",
+  "names": []
+}

package/dist/commonjs/routing/inMemoryCollectionRoutingMap.js

@@ -1,89 +1,116 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.InMemoryCollectionRoutingMap = void 0;
-const index_js_1 = require("../common/index.js");
-const QueryRange_js_1 = require("./QueryRange.js");
-/** @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 inMemoryCollectionRoutingMap_exports = {};
+__export(inMemoryCollectionRoutingMap_exports, {
+  InMemoryCollectionRoutingMap: () => InMemoryCollectionRoutingMap
+});
+module.exports = __toCommonJS(inMemoryCollectionRoutingMap_exports);
+var import_common = require("../common/index.js");
+var import_QueryRange = require("./QueryRange.js");
 class InMemoryCollectionRoutingMap {
-    orderedPartitionKeyRanges;
-    orderedRanges;
-    // TODO: chrande made this public, even though it is implementation detail for a test
-    orderedPartitionInfo;
-    /**
-     * Represents a InMemoryCollectionRoutingMap Object,
-     * Stores partition key ranges in an efficient way with some additional information and provides
-     * convenience methods for working with set of ranges.
-     */
-    constructor(orderedPartitionKeyRanges, orderedPartitionInfo) {
-        this.orderedPartitionKeyRanges = orderedPartitionKeyRanges;
-        this.orderedRanges = orderedPartitionKeyRanges.map((pkr) => {
-            return new QueryRange_js_1.QueryRange(pkr[index_js_1.Constants.PartitionKeyRange.MinInclusive], pkr[index_js_1.Constants.PartitionKeyRange.MaxExclusive], true, false);
-        });
-        this.orderedPartitionInfo = orderedPartitionInfo;
-    }
-    getOrderedParitionKeyRanges() {
+  orderedPartitionKeyRanges;
+  orderedRanges;
+  // TODO: chrande made this public, even though it is implementation detail for a test
+  orderedPartitionInfo;
+  /**
+   * Represents a InMemoryCollectionRoutingMap Object,
+   * Stores partition key ranges in an efficient way with some additional information and provides
+   * convenience methods for working with set of ranges.
+   */
+  constructor(orderedPartitionKeyRanges, orderedPartitionInfo) {
+    this.orderedPartitionKeyRanges = orderedPartitionKeyRanges;
+    this.orderedRanges = orderedPartitionKeyRanges.map((pkr) => {
+      return new import_QueryRange.QueryRange(
+        pkr[import_common.Constants.PartitionKeyRange.MinInclusive],
+        pkr[import_common.Constants.PartitionKeyRange.MaxExclusive],
+        true,
+        false
+      );
+    });
+    this.orderedPartitionInfo = orderedPartitionInfo;
+  }
+  getOrderedParitionKeyRanges() {
+    return this.orderedPartitionKeyRanges;
+  }
+  getOverlappingRanges(providedQueryRanges) {
+    const pqr = Array.isArray(providedQueryRanges) ? providedQueryRanges : [providedQueryRanges];
+    const minToPartitionRange = {};
+    for (const queryRange of pqr) {
+      if (queryRange.isEmpty()) {
+        continue;
+      }
+      if (queryRange.isFullRange()) {
         return this.orderedPartitionKeyRanges;
-    }
-    getOverlappingRanges(providedQueryRanges) {
-        // TODO This code has all kinds of smells. Multiple iterations and sorts just to grab overlapping ranges
-        // stfaul attempted to bring it down to one for-loop and failed
-        const pqr = Array.isArray(providedQueryRanges)
-            ? providedQueryRanges
-            : [providedQueryRanges];
-        const minToPartitionRange = {}; // TODO: any
-        // this for loop doesn't invoke any async callback
-        for (const queryRange of pqr) {
-            if (queryRange.isEmpty()) {
-                continue;
-            }
-            if (queryRange.isFullRange()) {
-                return this.orderedPartitionKeyRanges;
-            }
-            const minIndex = this.orderedRanges.findIndex((range) => {
-                if (queryRange.min > range.min && queryRange.min < range.max) {
-                    return true;
-                }
-                if (queryRange.min === range.min) {
-                    return true;
-                }
-                if (queryRange.min === range.max) {
-                    return true;
-                }
-            });
-            if (minIndex < 0) {
-                throw new Error("error in collection routing map, queried value is less than the start range.");
-            }
-            // Start at the end and work backwards
-            let maxIndex;
-            for (let i = this.orderedRanges.length - 1; i >= 0; i--) {
-                const range = this.orderedRanges[i];
-                if (queryRange.max > range.min && queryRange.max < range.max) {
-                    maxIndex = i;
-                    break;
-                }
-                if (queryRange.max === range.min) {
-                    maxIndex = i;
-                    break;
-                }
-                if (queryRange.max === range.max) {
-                    maxIndex = i;
-                    break;
-                }
-            }
-            if (maxIndex > this.orderedRanges.length) {
-                throw new Error("error in collection routing map, queried value is greater than the end range.");
-            }
-            for (let j = minIndex; j < maxIndex + 1; j++) {
-                if (queryRange.overlaps(this.orderedRanges[j])) {
-                    minToPartitionRange[this.orderedPartitionKeyRanges[j][index_js_1.Constants.PartitionKeyRange.MinInclusive]] = this.orderedPartitionKeyRanges[j];
-                }
-            }
+      }
+      const minIndex = this.orderedRanges.findIndex((range) => {
+        if (queryRange.min > range.min && queryRange.min < range.max) {
+          return true;
+        }
+        if (queryRange.min === range.min) {
+          return true;
+        }
+        if (queryRange.min === range.max) {
+          return true;
+        }
+      });
+      if (minIndex < 0) {
+        throw new Error(
+          "error in collection routing map, queried value is less than the start range."
+        );
+      }
+      let maxIndex;
+      for (let i = this.orderedRanges.length - 1; i >= 0; i--) {
+        const range = this.orderedRanges[i];
+        if (queryRange.max > range.min && queryRange.max < range.max) {
+          maxIndex = i;
+          break;
+        }
+        if (queryRange.max === range.min) {
+          maxIndex = i;
+          break;
+        }
+        if (queryRange.max === range.max) {
+          maxIndex = i;
+          break;
+        }
+      }
+      if (maxIndex > this.orderedRanges.length) {
+        throw new Error(
+          "error in collection routing map, queried value is greater than the end range."
+        );
+      }
+      for (let j = minIndex; j < maxIndex + 1; j++) {
+        if (queryRange.overlaps(this.orderedRanges[j])) {
+          minToPartitionRange[this.orderedPartitionKeyRanges[j][import_common.Constants.PartitionKeyRange.MinInclusive]] = this.orderedPartitionKeyRanges[j];
         }
-        const overlappingPartitionKeyRanges = Object.keys(minToPartitionRange).map((k) => minToPartitionRange[k]);
-        return overlappingPartitionKeyRanges.sort((a, b) => {
-            return a[index_js_1.Constants.PartitionKeyRange.MinInclusive].localeCompare(b[index_js_1.Constants.PartitionKeyRange.MinInclusive]);
-        });
+      }
     }
+    const overlappingPartitionKeyRanges = Object.keys(minToPartitionRange).map(
+      (k) => minToPartitionRange[k]
+    );
+    return overlappingPartitionKeyRanges.sort((a, b) => {
+      return a[import_common.Constants.PartitionKeyRange.MinInclusive].localeCompare(
+        b[import_common.Constants.PartitionKeyRange.MinInclusive]
+      );
+    });
+  }
 }
-exports.InMemoryCollectionRoutingMap = InMemoryCollectionRoutingMap;
-//# sourceMappingURL=inMemoryCollectionRoutingMap.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  InMemoryCollectionRoutingMap
+});

package/dist/commonjs/routing/inMemoryCollectionRoutingMap.js.map

@@ -1 +1,7 @@
-{"version":3,"file":"inMemoryCollectionRoutingMap.js","sourceRoot":"","sources":["../../../src/routing/inMemoryCollectionRoutingMap.ts"],"names":[],"mappings":";;;AAGA,iDAA+C;AAC/C,mDAA6C;AAE7C,cAAc;AACd,MAAa,4BAA4B;IAC/B,yBAAyB,CAAsB;IAC/C,aAAa,CAAe;IACpC,qFAAqF;IAC9E,oBAAoB,CAAU;IAErC;;;;OAIG;IACH,YAAY,yBAA8C,EAAE,oBAA6B;QACvF,IAAI,CAAC,yBAAyB,GAAG,yBAAyB,CAAC;QAC3D,IAAI,CAAC,aAAa,GAAG,yBAAyB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;YACzD,OAAO,IAAI,0BAAU,CACnB,GAAG,CAAC,oBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,EAC7C,GAAG,CAAC,oBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,EAC7C,IAAI,EACJ,KAAK,CACN,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,oBAAoB,GAAG,oBAAoB,CAAC;IACnD,CAAC;IACM,2BAA2B;QAChC,OAAO,IAAI,CAAC,yBAAyB,CAAC;IACxC,CAAC;IAEM,oBAAoB,CAAC,mBAA8C;QACxE,wGAAwG;QACxG,+DAA+D;QAC/D,MAAM,GAAG,GAAiB,KAAK,CAAC,OAAO,CAAC,mBAAmB,CAAC;YAC1D,CAAC,CAAC,mBAAmB;YACrB,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC;QAC1B,MAAM,mBAAmB,GAAQ,EAAE,CAAC,CAAC,YAAY;QAEjD,kDAAkD;QAClD,KAAK,MAAM,UAAU,IAAI,GAAG,EAAE,CAAC;YAC7B,IAAI,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;gBACzB,SAAS;YACX,CAAC;YAED,IAAI,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC;gBAC7B,OAAO,IAAI,CAAC,yBAAyB,CAAC;YACxC,CAAC;YAED,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE;gBACtD,IAAI,UAAU,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,IAAI,UAAU,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;oBAC7D,OAAO,IAAI,CAAC;gBACd,CAAC;gBACD,IAAI,UAAU,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE,CAAC;oBACjC,OAAO,IAAI,CAAC;gBACd,CAAC;gBACD,IAAI,UAAU,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE,CAAC;oBACjC,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;gBACjB,MAAM,IAAI,KAAK,CACb,8EAA8E,CAC/E,CAAC;YACJ,CAAC;YAED,sCAAsC;YACtC,IAAI,QAAgB,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxD,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;gBACpC,IAAI,UAAU,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,IAAI,UAAU,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;oBAC7D,QAAQ,GAAG,CAAC,CAAC;oBACb,MAAM;gBACR,CAAC;gBACD,IAAI,UAAU,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE,CAAC;oBACjC,QAAQ,GAAG,CAAC,CAAC;oBACb,MAAM;gBACR,CAAC;gBACD,IAAI,UAAU,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE,CAAC;oBACjC,QAAQ,GAAG,CAAC,CAAC;oBACb,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;gBACzC,MAAM,IAAI,KAAK,CACb,+EAA+E,CAChF,CAAC;YACJ,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC/C,mBAAmB,CACjB,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,oBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAC5E,GAAG,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,6BAA6B,GAAG,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,CACxE,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAC9B,CAAC;QAEF,OAAO,6BAA6B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACjD,OAAO,CAAC,CAAC,oBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC,aAAa,CAC9D,CAAC,CAAC,oBAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAC5C,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AA1GD,oEA0GC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { PartitionKeyRange } from \"../client/index.js\";\nimport { Constants } from \"../common/index.js\";\nimport { QueryRange } from \"./QueryRange.js\";\n\n/** @hidden */\nexport class InMemoryCollectionRoutingMap {\n  private orderedPartitionKeyRanges: PartitionKeyRange[];\n  private orderedRanges: QueryRange[];\n  // TODO: chrande made this public, even though it is implementation detail for a test\n  public orderedPartitionInfo: unknown;\n\n  /**\n   * Represents a InMemoryCollectionRoutingMap Object,\n   * Stores partition key ranges in an efficient way with some additional information and provides\n   * convenience methods for working with set of ranges.\n   */\n  constructor(orderedPartitionKeyRanges: PartitionKeyRange[], orderedPartitionInfo: unknown) {\n    this.orderedPartitionKeyRanges = orderedPartitionKeyRanges;\n    this.orderedRanges = orderedPartitionKeyRanges.map((pkr) => {\n      return new QueryRange(\n        pkr[Constants.PartitionKeyRange.MinInclusive],\n        pkr[Constants.PartitionKeyRange.MaxExclusive],\n        true,\n        false,\n      );\n    });\n    this.orderedPartitionInfo = orderedPartitionInfo;\n  }\n  public getOrderedParitionKeyRanges(): PartitionKeyRange[] {\n    return this.orderedPartitionKeyRanges;\n  }\n\n  public getOverlappingRanges(providedQueryRanges: QueryRange | QueryRange[]): PartitionKeyRange[] {\n    // TODO This code has all kinds of smells. Multiple iterations and sorts just to grab overlapping ranges\n    // stfaul attempted to bring it down to one for-loop and failed\n    const pqr: QueryRange[] = Array.isArray(providedQueryRanges)\n      ? providedQueryRanges\n      : [providedQueryRanges];\n    const minToPartitionRange: any = {}; // TODO: any\n\n    // this for loop doesn't invoke any async callback\n    for (const queryRange of pqr) {\n      if (queryRange.isEmpty()) {\n        continue;\n      }\n\n      if (queryRange.isFullRange()) {\n        return this.orderedPartitionKeyRanges;\n      }\n\n      const minIndex = this.orderedRanges.findIndex((range) => {\n        if (queryRange.min > range.min && queryRange.min < range.max) {\n          return true;\n        }\n        if (queryRange.min === range.min) {\n          return true;\n        }\n        if (queryRange.min === range.max) {\n          return true;\n        }\n      });\n\n      if (minIndex < 0) {\n        throw new Error(\n          \"error in collection routing map, queried value is less than the start range.\",\n        );\n      }\n\n      // Start at the end and work backwards\n      let maxIndex: number;\n      for (let i = this.orderedRanges.length - 1; i >= 0; i--) {\n        const range = this.orderedRanges[i];\n        if (queryRange.max > range.min && queryRange.max < range.max) {\n          maxIndex = i;\n          break;\n        }\n        if (queryRange.max === range.min) {\n          maxIndex = i;\n          break;\n        }\n        if (queryRange.max === range.max) {\n          maxIndex = i;\n          break;\n        }\n      }\n\n      if (maxIndex > this.orderedRanges.length) {\n        throw new Error(\n          \"error in collection routing map, queried value is greater than the end range.\",\n        );\n      }\n\n      for (let j = minIndex; j < maxIndex + 1; j++) {\n        if (queryRange.overlaps(this.orderedRanges[j])) {\n          minToPartitionRange[\n            this.orderedPartitionKeyRanges[j][Constants.PartitionKeyRange.MinInclusive]\n          ] = this.orderedPartitionKeyRanges[j];\n        }\n      }\n    }\n\n    const overlappingPartitionKeyRanges = Object.keys(minToPartitionRange).map(\n      (k) => minToPartitionRange[k],\n    );\n\n    return overlappingPartitionKeyRanges.sort((a, b) => {\n      return a[Constants.PartitionKeyRange.MinInclusive].localeCompare(\n        b[Constants.PartitionKeyRange.MinInclusive],\n      );\n    });\n  }\n}\n"]}
+{
+  "version": 3,
+  "sources": ["/mnt/vss/_work/1/s/sdk/cosmosdb/cosmos/src/routing/inMemoryCollectionRoutingMap.ts"],
+  "sourcesContent": ["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { PartitionKeyRange } from \"../client/index.js\";\nimport { Constants } from \"../common/index.js\";\nimport { QueryRange } from \"./QueryRange.js\";\n\n/** @hidden */\nexport class InMemoryCollectionRoutingMap {\n  private orderedPartitionKeyRanges: PartitionKeyRange[];\n  private orderedRanges: QueryRange[];\n  // TODO: chrande made this public, even though it is implementation detail for a test\n  public orderedPartitionInfo: unknown;\n\n  /**\n   * Represents a InMemoryCollectionRoutingMap Object,\n   * Stores partition key ranges in an efficient way with some additional information and provides\n   * convenience methods for working with set of ranges.\n   */\n  constructor(orderedPartitionKeyRanges: PartitionKeyRange[], orderedPartitionInfo: unknown) {\n    this.orderedPartitionKeyRanges = orderedPartitionKeyRanges;\n    this.orderedRanges = orderedPartitionKeyRanges.map((pkr) => {\n      return new QueryRange(\n        pkr[Constants.PartitionKeyRange.MinInclusive],\n        pkr[Constants.PartitionKeyRange.MaxExclusive],\n        true,\n        false,\n      );\n    });\n    this.orderedPartitionInfo = orderedPartitionInfo;\n  }\n  public getOrderedParitionKeyRanges(): PartitionKeyRange[] {\n    return this.orderedPartitionKeyRanges;\n  }\n\n  public getOverlappingRanges(providedQueryRanges: QueryRange | QueryRange[]): PartitionKeyRange[] {\n    // TODO This code has all kinds of smells. Multiple iterations and sorts just to grab overlapping ranges\n    // stfaul attempted to bring it down to one for-loop and failed\n    const pqr: QueryRange[] = Array.isArray(providedQueryRanges)\n      ? providedQueryRanges\n      : [providedQueryRanges];\n    const minToPartitionRange: any = {}; // TODO: any\n\n    // this for loop doesn't invoke any async callback\n    for (const queryRange of pqr) {\n      if (queryRange.isEmpty()) {\n        continue;\n      }\n\n      if (queryRange.isFullRange()) {\n        return this.orderedPartitionKeyRanges;\n      }\n\n      const minIndex = this.orderedRanges.findIndex((range) => {\n        if (queryRange.min > range.min && queryRange.min < range.max) {\n          return true;\n        }\n        if (queryRange.min === range.min) {\n          return true;\n        }\n        if (queryRange.min === range.max) {\n          return true;\n        }\n      });\n\n      if (minIndex < 0) {\n        throw new Error(\n          \"error in collection routing map, queried value is less than the start range.\",\n        );\n      }\n\n      // Start at the end and work backwards\n      let maxIndex: number;\n      for (let i = this.orderedRanges.length - 1; i >= 0; i--) {\n        const range = this.orderedRanges[i];\n        if (queryRange.max > range.min && queryRange.max < range.max) {\n          maxIndex = i;\n          break;\n        }\n        if (queryRange.max === range.min) {\n          maxIndex = i;\n          break;\n        }\n        if (queryRange.max === range.max) {\n          maxIndex = i;\n          break;\n        }\n      }\n\n      if (maxIndex > this.orderedRanges.length) {\n        throw new Error(\n          \"error in collection routing map, queried value is greater than the end range.\",\n        );\n      }\n\n      for (let j = minIndex; j < maxIndex + 1; j++) {\n        if (queryRange.overlaps(this.orderedRanges[j])) {\n          minToPartitionRange[\n            this.orderedPartitionKeyRanges[j][Constants.PartitionKeyRange.MinInclusive]\n          ] = this.orderedPartitionKeyRanges[j];\n        }\n      }\n    }\n\n    const overlappingPartitionKeyRanges = Object.keys(minToPartitionRange).map(\n      (k) => minToPartitionRange[k],\n    );\n\n    return overlappingPartitionKeyRanges.sort((a, b) => {\n      return a[Constants.PartitionKeyRange.MinInclusive].localeCompare(\n        b[Constants.PartitionKeyRange.MinInclusive],\n      );\n    });\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAGA,oBAA0B;AAC1B,wBAA2B;AAGpB,MAAM,6BAA6B;AAAA,EAChC;AAAA,EACA;AAAA;AAAA,EAED;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOP,YAAY,2BAAgD,sBAA+B;AACzF,SAAK,4BAA4B;AACjC,SAAK,gBAAgB,0BAA0B,IAAI,CAAC,QAAQ;AAC1D,aAAO,IAAI;AAAA,QACT,IAAI,wBAAU,kBAAkB,YAAY;AAAA,QAC5C,IAAI,wBAAU,kBAAkB,YAAY;AAAA,QAC5C;AAAA,QACA;AAAA,MACF;AAAA,IACF,CAAC;AACD,SAAK,uBAAuB;AAAA,EAC9B;AAAA,EACO,8BAAmD;AACxD,WAAO,KAAK;AAAA,EACd;AAAA,EAEO,qBAAqB,qBAAqE;AAG/F,UAAM,MAAoB,MAAM,QAAQ,mBAAmB,IACvD,sBACA,CAAC,mBAAmB;AACxB,UAAM,sBAA2B,CAAC;AAGlC,eAAW,cAAc,KAAK;AAC5B,UAAI,WAAW,QAAQ,GAAG;AACxB;AAAA,MACF;AAEA,UAAI,WAAW,YAAY,GAAG;AAC5B,eAAO,KAAK;AAAA,MACd;AAEA,YAAM,WAAW,KAAK,cAAc,UAAU,CAAC,UAAU;AACvD,YAAI,WAAW,MAAM,MAAM,OAAO,WAAW,MAAM,MAAM,KAAK;AAC5D,iBAAO;AAAA,QACT;AACA,YAAI,WAAW,QAAQ,MAAM,KAAK;AAChC,iBAAO;AAAA,QACT;AACA,YAAI,WAAW,QAAQ,MAAM,KAAK;AAChC,iBAAO;AAAA,QACT;AAAA,MACF,CAAC;AAED,UAAI,WAAW,GAAG;AAChB,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAGA,UAAI;AACJ,eAAS,IAAI,KAAK,cAAc,SAAS,GAAG,KAAK,GAAG,KAAK;AACvD,cAAM,QAAQ,KAAK,cAAc,CAAC;AAClC,YAAI,WAAW,MAAM,MAAM,OAAO,WAAW,MAAM,MAAM,KAAK;AAC5D,qBAAW;AACX;AAAA,QACF;AACA,YAAI,WAAW,QAAQ,MAAM,KAAK;AAChC,qBAAW;AACX;AAAA,QACF;AACA,YAAI,WAAW,QAAQ,MAAM,KAAK;AAChC,qBAAW;AACX;AAAA,QACF;AAAA,MACF;AAEA,UAAI,WAAW,KAAK,cAAc,QAAQ;AACxC,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAEA,eAAS,IAAI,UAAU,IAAI,WAAW,GAAG,KAAK;AAC5C,YAAI,WAAW,SAAS,KAAK,cAAc,CAAC,CAAC,GAAG;AAC9C,8BACE,KAAK,0BAA0B,CAAC,EAAE,wBAAU,kBAAkB,YAAY,CAC5E,IAAI,KAAK,0BAA0B,CAAC;AAAA,QACtC;AAAA,MACF;AAAA,IACF;AAEA,UAAM,gCAAgC,OAAO,KAAK,mBAAmB,EAAE;AAAA,MACrE,CAAC,MAAM,oBAAoB,CAAC;AAAA,IAC9B;AAEA,WAAO,8BAA8B,KAAK,CAAC,GAAG,MAAM;AAClD,aAAO,EAAE,wBAAU,kBAAkB,YAAY,EAAE;AAAA,QACjD,EAAE,wBAAU,kBAAkB,YAAY;AAAA,MAC5C;AAAA,IACF,CAAC;AAAA,EACH;AACF;",
+  "names": []
+}