@azure/cosmos 4.9.1 → 4.9.3

package/dist/commonjs/routing/index.js

@@ -1,10 +1,28 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const tslib_1 = require("tslib");
-// Copyright (c) Microsoft Corporation.
-// Licensed under the MIT License.
-tslib_1.__exportStar(require("./QueryRange.js"), exports);
-tslib_1.__exportStar(require("./inMemoryCollectionRoutingMap.js"), exports);
-tslib_1.__exportStar(require("./partitionKeyRangeCache.js"), exports);
-tslib_1.__exportStar(require("./smartRoutingMapProvider.js"), exports);
-//# sourceMappingURL=index.js.map
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __reExport = (target, mod, secondTarget) => (__copyProps(target, mod, "default"), secondTarget && __copyProps(secondTarget, mod, "default"));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var routing_exports = {};
+module.exports = __toCommonJS(routing_exports);
+__reExport(routing_exports, require("./QueryRange.js"), module.exports);
+__reExport(routing_exports, require("./inMemoryCollectionRoutingMap.js"), module.exports);
+__reExport(routing_exports, require("./partitionKeyRangeCache.js"), module.exports);
+__reExport(routing_exports, require("./smartRoutingMapProvider.js"), module.exports);
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  ...require("./QueryRange.js"),
+  ...require("./inMemoryCollectionRoutingMap.js"),
+  ...require("./partitionKeyRangeCache.js"),
+  ...require("./smartRoutingMapProvider.js")
+});
+//# sourceMappingURL=index.js.map

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

@@ -1 +1,7 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/routing/index.ts"],"names":[],"mappings":";;;AAAA,uCAAuC;AACvC,kCAAkC;AAClC,0DAAgC;AAChC,4EAAkD;AAClD,sEAA4C;AAC5C,uEAA6C","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nexport * from \"./QueryRange.js\";\nexport * from \"./inMemoryCollectionRoutingMap.js\";\nexport * from \"./partitionKeyRangeCache.js\";\nexport * from \"./smartRoutingMapProvider.js\";\n"]}
+{
+  "version": 3,
+  "sources": ["../../../src/routing/index.ts"],
+  "sourcesContent": ["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nexport * from \"./QueryRange.js\";\nexport * from \"./inMemoryCollectionRoutingMap.js\";\nexport * from \"./partitionKeyRangeCache.js\";\nexport * from \"./smartRoutingMapProvider.js\";\n"],
+  "mappings": ";;;;;;;;;;;;;;AAAA;AAAA;AAEA,4BAAc,4BAFd;AAGA,4BAAc,8CAHd;AAIA,4BAAc,wCAJd;AAKA,4BAAc,yCALd;",
+  "names": []
+}

package/dist/commonjs/routing/partitionKeyRangeCache.js

@@ -1,59 +1,86 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PartitionKeyRangeCache = void 0;
-// Copyright (c) Microsoft Corporation.
-// Licensed under the MIT License.
-const CosmosDiagnostics_js_1 = require("../CosmosDiagnostics.js");
-const helper_js_1 = require("../common/helper.js");
-const diagnostics_js_1 = require("../utils/diagnostics.js");
-const CollectionRoutingMapFactory_js_1 = require("./CollectionRoutingMapFactory.js");
-const hash_js_1 = require("../utils/hashing/hash.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 partitionKeyRangeCache_exports = {};
+__export(partitionKeyRangeCache_exports, {
+  PartitionKeyRangeCache: () => PartitionKeyRangeCache
+});
+module.exports = __toCommonJS(partitionKeyRangeCache_exports);
+var import_CosmosDiagnostics = require("../CosmosDiagnostics.js");
+var import_helper = require("../common/helper.js");
+var import_diagnostics = require("../utils/diagnostics.js");
+var import_CollectionRoutingMapFactory = require("./CollectionRoutingMapFactory.js");
+var import_hash = require("../utils/hashing/hash.js");
 class PartitionKeyRangeCache {
-    clientContext;
-    collectionRoutingMapByCollectionId;
-    constructor(clientContext) {
-        this.clientContext = clientContext;
-        this.collectionRoutingMapByCollectionId = {};
-    }
-    /**
-     * Finds or Instantiates the requested Collection Routing Map
-     * @param collectionLink - Requested collectionLink
-     * @hidden
-     */
-    async onCollectionRoutingMap(collectionLink, diagnosticNode, forceRefresh = false) {
-        const collectionId = (0, helper_js_1.getIdFromLink)(collectionLink);
-        if (this.collectionRoutingMapByCollectionId[collectionId] === undefined || forceRefresh) {
-            this.collectionRoutingMapByCollectionId[collectionId] = this.requestCollectionRoutingMap(collectionLink, diagnosticNode);
-        }
-        return this.collectionRoutingMapByCollectionId[collectionId];
-    }
-    /**
-     * Given the query ranges and a collection, invokes the callback on the list of overlapping partition key ranges
-     * @hidden
-     */
-    async getOverlappingRanges(collectionLink, queryRange, diagnosticNode, forceRefresh = false) {
-        const crm = await this.onCollectionRoutingMap(collectionLink, diagnosticNode, forceRefresh);
-        return crm.getOverlappingRanges(queryRange);
-    }
-    async requestCollectionRoutingMap(collectionLink, diagnosticNode) {
-        const { resources } = await (0, diagnostics_js_1.withMetadataDiagnostics)(async (metadataDiagnostics) => {
-            return this.clientContext
-                .queryPartitionKeyRanges(collectionLink)
-                .fetchAllInternal(metadataDiagnostics);
-        }, diagnosticNode, CosmosDiagnostics_js_1.MetadataLookUpType.PartitionKeyRangeLookUp);
-        return (0, CollectionRoutingMapFactory_js_1.createCompleteRoutingMap)(resources.map((r) => [r, true]));
-    }
-    /**
-     * Given a partition key, returns the partition key range id
-     * @internal
-     */
-    async getPartitionKeyRangeIdFromPartitionKey(collectionLink, partitionKey, partitionKeyDefinition, diagnosticNode) {
-        const hashedPartitionKey = (0, hash_js_1.hashPartitionKey)(partitionKey, partitionKeyDefinition);
-        const partitionKeyRanges = (await this.onCollectionRoutingMap(collectionLink, diagnosticNode)).getOrderedParitionKeyRanges();
-        const partitionKeyRangeId = (0, hash_js_1.binarySearchOnPartitionKeyRanges)(partitionKeyRanges, hashedPartitionKey);
-        return partitionKeyRangeId;
+  constructor(clientContext) {
+    this.clientContext = clientContext;
+    this.collectionRoutingMapByCollectionId = {};
+  }
+  clientContext;
+  collectionRoutingMapByCollectionId;
+  /**
+   * Finds or Instantiates the requested Collection Routing Map
+   * @param collectionLink - Requested collectionLink
+   * @hidden
+   */
+  async onCollectionRoutingMap(collectionLink, diagnosticNode, forceRefresh = false) {
+    const collectionId = (0, import_helper.getIdFromLink)(collectionLink);
+    if (this.collectionRoutingMapByCollectionId[collectionId] === void 0 || forceRefresh) {
+      this.collectionRoutingMapByCollectionId[collectionId] = this.requestCollectionRoutingMap(
+        collectionLink,
+        diagnosticNode
+      );
     }
+    return this.collectionRoutingMapByCollectionId[collectionId];
+  }
+  /**
+   * Given the query ranges and a collection, invokes the callback on the list of overlapping partition key ranges
+   * @hidden
+   */
+  async getOverlappingRanges(collectionLink, queryRange, diagnosticNode, forceRefresh = false) {
+    const crm = await this.onCollectionRoutingMap(collectionLink, diagnosticNode, forceRefresh);
+    return crm.getOverlappingRanges(queryRange);
+  }
+  async requestCollectionRoutingMap(collectionLink, diagnosticNode) {
+    const { resources } = await (0, import_diagnostics.withMetadataDiagnostics)(
+      async (metadataDiagnostics) => {
+        return this.clientContext.queryPartitionKeyRanges(collectionLink).fetchAllInternal(metadataDiagnostics);
+      },
+      diagnosticNode,
+      import_CosmosDiagnostics.MetadataLookUpType.PartitionKeyRangeLookUp
+    );
+    return (0, import_CollectionRoutingMapFactory.createCompleteRoutingMap)(resources.map((r) => [r, true]));
+  }
+  /**
+   * Given a partition key, returns the partition key range id
+   * @internal
+   */
+  async getPartitionKeyRangeIdFromPartitionKey(collectionLink, partitionKey, partitionKeyDefinition, diagnosticNode) {
+    const hashedPartitionKey = (0, import_hash.hashPartitionKey)(partitionKey, partitionKeyDefinition);
+    const partitionKeyRanges = (await this.onCollectionRoutingMap(collectionLink, diagnosticNode)).getOrderedParitionKeyRanges();
+    const partitionKeyRangeId = (0, import_hash.binarySearchOnPartitionKeyRanges)(
+      partitionKeyRanges,
+      hashedPartitionKey
+    );
+    return partitionKeyRangeId;
+  }
 }
-exports.PartitionKeyRangeCache = PartitionKeyRangeCache;
-//# sourceMappingURL=partitionKeyRangeCache.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  PartitionKeyRangeCache
+});
+//# sourceMappingURL=partitionKeyRangeCache.js.map

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

@@ -1 +1,7 @@
-{"version":3,"file":"partitionKeyRangeCache.js","sourceRoot":"","sources":["../../../src/routing/partitionKeyRangeCache.ts"],"names":[],"mappings":";;;AAAA,uCAAuC;AACvC,kCAAkC;AAClC,kEAA6D;AAG7D,mDAAoD;AAEpD,4DAAkE;AAClE,qFAA4E;AAK5E,sDAA8F;AAE9F,cAAc;AACd,MAAa,sBAAsB;IAKb;IAJZ,kCAAkC,CAExC;IAEF,YAAoB,aAA4B;QAA5B,kBAAa,GAAb,aAAa,CAAe;QAC9C,IAAI,CAAC,kCAAkC,GAAG,EAAE,CAAC;IAC/C,CAAC;IACD;;;;OAIG;IACI,KAAK,CAAC,sBAAsB,CACjC,cAAsB,EACtB,cAAsC,EACtC,eAAwB,KAAK;QAE7B,MAAM,YAAY,GAAG,IAAA,yBAAa,EAAC,cAAc,CAAC,CAAC;QACnD,IAAI,IAAI,CAAC,kCAAkC,CAAC,YAAY,CAAC,KAAK,SAAS,IAAI,YAAY,EAAE,CAAC;YACxF,IAAI,CAAC,kCAAkC,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,2BAA2B,CACtF,cAAc,EACd,cAAc,CACf,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC,kCAAkC,CAAC,YAAY,CAAC,CAAC;IAC/D,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,oBAAoB,CAC/B,cAAsB,EACtB,UAAsB,EACtB,cAAsC,EACtC,eAAwB,KAAK;QAE7B,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,cAAc,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;QAC5F,OAAO,GAAG,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC;IAC9C,CAAC;IAEO,KAAK,CAAC,2BAA2B,CACvC,cAAsB,EACtB,cAAsC;QAEtC,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,IAAA,wCAAuB,EACjD,KAAK,EAAE,mBAA2C,EAAE,EAAE;YACpD,OAAO,IAAI,CAAC,aAAa;iBACtB,uBAAuB,CAAC,cAAc,CAAC;iBACvC,gBAAgB,CAAC,mBAAmB,CAAC,CAAC;QAC3C,CAAC,EACD,cAAc,EACd,yCAAkB,CAAC,uBAAuB,CAC3C,CAAC;QACF,OAAO,IAAA,yDAAwB,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,sCAAsC,CACjD,cAAsB,EACtB,YAAkC,EAClC,sBAA8C,EAC9C,cAAsC;QAEtC,MAAM,kBAAkB,GAAG,IAAA,0BAAgB,EAAC,YAAY,EAAE,sBAAsB,CAAC,CAAC;QAClF,MAAM,kBAAkB,GAAG,CACzB,MAAM,IAAI,CAAC,sBAAsB,CAAC,cAAc,EAAE,cAAc,CAAC,CAClE,CAAC,2BAA2B,EAAE,CAAC;QAEhC,MAAM,mBAAmB,GAAG,IAAA,0CAAgC,EAC1D,kBAAkB,EAClB,kBAAkB,CACnB,CAAC;QACF,OAAO,mBAAmB,CAAC;IAC7B,CAAC;CACF;AA/ED,wDA+EC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport { MetadataLookUpType } from \"../CosmosDiagnostics.js\";\nimport type { PartitionKeyRange } from \"../client/Container/PartitionKeyRange.js\";\nimport type { ClientContext } from \"../ClientContext.js\";\nimport { getIdFromLink } from \"../common/helper.js\";\nimport type { DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport { withMetadataDiagnostics } from \"../utils/diagnostics.js\";\nimport { createCompleteRoutingMap } from \"./CollectionRoutingMapFactory.js\";\nimport type { InMemoryCollectionRoutingMap } from \"./inMemoryCollectionRoutingMap.js\";\nimport type { QueryRange } from \"./QueryRange.js\";\nimport type { PartitionKeyDefinition } from \"../documents/PartitionKeyDefinition.js\";\nimport type { PartitionKeyInternal } from \"../documents/PartitionKeyInternal.js\";\nimport { hashPartitionKey, binarySearchOnPartitionKeyRanges } from \"../utils/hashing/hash.js\";\n\n/** @hidden */\nexport class PartitionKeyRangeCache {\n  private collectionRoutingMapByCollectionId: {\n    [key: string]: Promise<InMemoryCollectionRoutingMap>;\n  };\n\n  constructor(private clientContext: ClientContext) {\n    this.collectionRoutingMapByCollectionId = {};\n  }\n  /**\n   * Finds or Instantiates the requested Collection Routing Map\n   * @param collectionLink - Requested collectionLink\n   * @hidden\n   */\n  public async onCollectionRoutingMap(\n    collectionLink: string,\n    diagnosticNode: DiagnosticNodeInternal,\n    forceRefresh: boolean = false,\n  ): Promise<InMemoryCollectionRoutingMap> {\n    const collectionId = getIdFromLink(collectionLink);\n    if (this.collectionRoutingMapByCollectionId[collectionId] === undefined || forceRefresh) {\n      this.collectionRoutingMapByCollectionId[collectionId] = this.requestCollectionRoutingMap(\n        collectionLink,\n        diagnosticNode,\n      );\n    }\n    return this.collectionRoutingMapByCollectionId[collectionId];\n  }\n\n  /**\n   * Given the query ranges and a collection, invokes the callback on the list of overlapping partition key ranges\n   * @hidden\n   */\n  public async getOverlappingRanges(\n    collectionLink: string,\n    queryRange: QueryRange,\n    diagnosticNode: DiagnosticNodeInternal,\n    forceRefresh: boolean = false,\n  ): Promise<PartitionKeyRange[]> {\n    const crm = await this.onCollectionRoutingMap(collectionLink, diagnosticNode, forceRefresh);\n    return crm.getOverlappingRanges(queryRange);\n  }\n\n  private async requestCollectionRoutingMap(\n    collectionLink: string,\n    diagnosticNode: DiagnosticNodeInternal,\n  ): Promise<InMemoryCollectionRoutingMap> {\n    const { resources } = await withMetadataDiagnostics(\n      async (metadataDiagnostics: DiagnosticNodeInternal) => {\n        return this.clientContext\n          .queryPartitionKeyRanges(collectionLink)\n          .fetchAllInternal(metadataDiagnostics);\n      },\n      diagnosticNode,\n      MetadataLookUpType.PartitionKeyRangeLookUp,\n    );\n    return createCompleteRoutingMap(resources.map((r) => [r, true]));\n  }\n\n  /**\n   * Given a partition key, returns the partition key range id\n   * @internal\n   */\n  public async getPartitionKeyRangeIdFromPartitionKey(\n    collectionLink: string,\n    partitionKey: PartitionKeyInternal,\n    partitionKeyDefinition: PartitionKeyDefinition,\n    diagnosticNode: DiagnosticNodeInternal,\n  ): Promise<string | undefined> {\n    const hashedPartitionKey = hashPartitionKey(partitionKey, partitionKeyDefinition);\n    const partitionKeyRanges = (\n      await this.onCollectionRoutingMap(collectionLink, diagnosticNode)\n    ).getOrderedParitionKeyRanges();\n\n    const partitionKeyRangeId = binarySearchOnPartitionKeyRanges(\n      partitionKeyRanges,\n      hashedPartitionKey,\n    );\n    return partitionKeyRangeId;\n  }\n}\n"]}
+{
+  "version": 3,
+  "sources": ["../../../src/routing/partitionKeyRangeCache.ts"],
+  "sourcesContent": ["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport { MetadataLookUpType } from \"../CosmosDiagnostics.js\";\nimport type { PartitionKeyRange } from \"../client/Container/PartitionKeyRange.js\";\nimport type { ClientContext } from \"../ClientContext.js\";\nimport { getIdFromLink } from \"../common/helper.js\";\nimport type { DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport { withMetadataDiagnostics } from \"../utils/diagnostics.js\";\nimport { createCompleteRoutingMap } from \"./CollectionRoutingMapFactory.js\";\nimport type { InMemoryCollectionRoutingMap } from \"./inMemoryCollectionRoutingMap.js\";\nimport type { QueryRange } from \"./QueryRange.js\";\nimport type { PartitionKeyDefinition } from \"../documents/PartitionKeyDefinition.js\";\nimport type { PartitionKeyInternal } from \"../documents/PartitionKeyInternal.js\";\nimport { hashPartitionKey, binarySearchOnPartitionKeyRanges } from \"../utils/hashing/hash.js\";\n\n/** @hidden */\nexport class PartitionKeyRangeCache {\n  private collectionRoutingMapByCollectionId: {\n    [key: string]: Promise<InMemoryCollectionRoutingMap>;\n  };\n\n  constructor(private clientContext: ClientContext) {\n    this.collectionRoutingMapByCollectionId = {};\n  }\n  /**\n   * Finds or Instantiates the requested Collection Routing Map\n   * @param collectionLink - Requested collectionLink\n   * @hidden\n   */\n  public async onCollectionRoutingMap(\n    collectionLink: string,\n    diagnosticNode: DiagnosticNodeInternal,\n    forceRefresh: boolean = false,\n  ): Promise<InMemoryCollectionRoutingMap> {\n    const collectionId = getIdFromLink(collectionLink);\n    if (this.collectionRoutingMapByCollectionId[collectionId] === undefined || forceRefresh) {\n      this.collectionRoutingMapByCollectionId[collectionId] = this.requestCollectionRoutingMap(\n        collectionLink,\n        diagnosticNode,\n      );\n    }\n    return this.collectionRoutingMapByCollectionId[collectionId];\n  }\n\n  /**\n   * Given the query ranges and a collection, invokes the callback on the list of overlapping partition key ranges\n   * @hidden\n   */\n  public async getOverlappingRanges(\n    collectionLink: string,\n    queryRange: QueryRange,\n    diagnosticNode: DiagnosticNodeInternal,\n    forceRefresh: boolean = false,\n  ): Promise<PartitionKeyRange[]> {\n    const crm = await this.onCollectionRoutingMap(collectionLink, diagnosticNode, forceRefresh);\n    return crm.getOverlappingRanges(queryRange);\n  }\n\n  private async requestCollectionRoutingMap(\n    collectionLink: string,\n    diagnosticNode: DiagnosticNodeInternal,\n  ): Promise<InMemoryCollectionRoutingMap> {\n    const { resources } = await withMetadataDiagnostics(\n      async (metadataDiagnostics: DiagnosticNodeInternal) => {\n        return this.clientContext\n          .queryPartitionKeyRanges(collectionLink)\n          .fetchAllInternal(metadataDiagnostics);\n      },\n      diagnosticNode,\n      MetadataLookUpType.PartitionKeyRangeLookUp,\n    );\n    return createCompleteRoutingMap(resources.map((r) => [r, true]));\n  }\n\n  /**\n   * Given a partition key, returns the partition key range id\n   * @internal\n   */\n  public async getPartitionKeyRangeIdFromPartitionKey(\n    collectionLink: string,\n    partitionKey: PartitionKeyInternal,\n    partitionKeyDefinition: PartitionKeyDefinition,\n    diagnosticNode: DiagnosticNodeInternal,\n  ): Promise<string | undefined> {\n    const hashedPartitionKey = hashPartitionKey(partitionKey, partitionKeyDefinition);\n    const partitionKeyRanges = (\n      await this.onCollectionRoutingMap(collectionLink, diagnosticNode)\n    ).getOrderedParitionKeyRanges();\n\n    const partitionKeyRangeId = binarySearchOnPartitionKeyRanges(\n      partitionKeyRanges,\n      hashedPartitionKey,\n    );\n    return partitionKeyRangeId;\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAEA,+BAAmC;AAGnC,oBAA8B;AAE9B,yBAAwC;AACxC,yCAAyC;AAKzC,kBAAmE;AAG5D,MAAM,uBAAuB;AAAA,EAKlC,YAAoB,eAA8B;AAA9B;AAClB,SAAK,qCAAqC,CAAC;AAAA,EAC7C;AAAA,EAFoB;AAAA,EAJZ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYR,MAAa,uBACX,gBACA,gBACA,eAAwB,OACe;AACvC,UAAM,mBAAe,6BAAc,cAAc;AACjD,QAAI,KAAK,mCAAmC,YAAY,MAAM,UAAa,cAAc;AACvF,WAAK,mCAAmC,YAAY,IAAI,KAAK;AAAA,QAC3D;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,WAAO,KAAK,mCAAmC,YAAY;AAAA,EAC7D;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAa,qBACX,gBACA,YACA,gBACA,eAAwB,OACM;AAC9B,UAAM,MAAM,MAAM,KAAK,uBAAuB,gBAAgB,gBAAgB,YAAY;AAC1F,WAAO,IAAI,qBAAqB,UAAU;AAAA,EAC5C;AAAA,EAEA,MAAc,4BACZ,gBACA,gBACuC;AACvC,UAAM,EAAE,UAAU,IAAI,UAAM;AAAA,MAC1B,OAAO,wBAAgD;AACrD,eAAO,KAAK,cACT,wBAAwB,cAAc,EACtC,iBAAiB,mBAAmB;AAAA,MACzC;AAAA,MACA;AAAA,MACA,4CAAmB;AAAA,IACrB;AACA,eAAO,6DAAyB,UAAU,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC;AAAA,EACjE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAa,uCACX,gBACA,cACA,wBACA,gBAC6B;AAC7B,UAAM,yBAAqB,8BAAiB,cAAc,sBAAsB;AAChF,UAAM,sBACJ,MAAM,KAAK,uBAAuB,gBAAgB,cAAc,GAChE,4BAA4B;AAE9B,UAAM,0BAAsB;AAAA,MAC1B;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;",
+  "names": []
+}

package/dist/commonjs/routing/smartRoutingMapProvider.js

@@ -1,121 +1,142 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SmartRoutingMapProvider = exports.PARITIONKEYRANGE = void 0;
-const constants_js_1 = require("../common/constants.js");
-const partitionKeyRangeCache_js_1 = require("./partitionKeyRangeCache.js");
-const QueryRange_js_1 = require("./QueryRange.js");
-/** @hidden */
-exports.PARITIONKEYRANGE = constants_js_1.Constants.PartitionKeyRange;
-/** @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 smartRoutingMapProvider_exports = {};
+__export(smartRoutingMapProvider_exports, {
+  PARITIONKEYRANGE: () => PARITIONKEYRANGE,
+  SmartRoutingMapProvider: () => SmartRoutingMapProvider
+});
+module.exports = __toCommonJS(smartRoutingMapProvider_exports);
+var import_constants = require("../common/constants.js");
+var import_partitionKeyRangeCache = require("./partitionKeyRangeCache.js");
+var import_QueryRange = require("./QueryRange.js");
+const PARITIONKEYRANGE = import_constants.Constants.PartitionKeyRange;
 class SmartRoutingMapProvider {
-    partitionKeyRangeCache;
-    constructor(clientContext) {
-        this.partitionKeyRangeCache = new partitionKeyRangeCache_js_1.PartitionKeyRangeCache(clientContext);
+  partitionKeyRangeCache;
+  constructor(clientContext) {
+    this.partitionKeyRangeCache = new import_partitionKeyRangeCache.PartitionKeyRangeCache(clientContext);
+  }
+  static _secondRangeIsAfterFirstRange(range1, range2) {
+    if (typeof range1.max === "undefined") {
+      throw new Error("range1 must have max");
     }
-    static _secondRangeIsAfterFirstRange(range1, range2) {
-        if (typeof range1.max === "undefined") {
-            throw new Error("range1 must have max");
-        }
-        if (typeof range2.min === "undefined") {
-            throw new Error("range2 must have min");
-        }
-        if (range1.max > range2.min) {
-            // r.min < #previous_r.max
-            return false;
-        }
-        else {
-            if (range1.max === range2.min && range1.isMaxInclusive && range2.isMinInclusive) {
-                // the inclusive ending endpoint of previous_r is the same as the inclusive beginning endpoint of r
-                // they share a point
-                return false;
-            }
-            return true;
-        }
+    if (typeof range2.min === "undefined") {
+      throw new Error("range2 must have min");
     }
-    static _isSortedAndNonOverlapping(ranges) {
-        for (let idx = 1; idx < ranges.length; idx++) {
-            const previousR = ranges[idx - 1];
-            const r = ranges[idx];
-            if (!this._secondRangeIsAfterFirstRange(previousR, r)) {
-                return false;
-            }
-        }
-        return true;
+    if (range1.max > range2.min) {
+      return false;
+    } else {
+      if (range1.max === range2.min && range1.isMaxInclusive && range2.isMinInclusive) {
+        return false;
+      }
+      return true;
     }
-    static _stringMax(a, b) {
-        return a >= b ? a : b;
+  }
+  static _isSortedAndNonOverlapping(ranges) {
+    for (let idx = 1; idx < ranges.length; idx++) {
+      const previousR = ranges[idx - 1];
+      const r = ranges[idx];
+      if (!this._secondRangeIsAfterFirstRange(previousR, r)) {
+        return false;
+      }
     }
-    static _stringCompare(a, b) {
-        return a === b ? 0 : a > b ? 1 : -1;
+    return true;
+  }
+  static _stringMax(a, b) {
+    return a >= b ? a : b;
+  }
+  static _stringCompare(a, b) {
+    return a === b ? 0 : a > b ? 1 : -1;
+  }
+  static _subtractRange(r, partitionKeyRange) {
+    const left = this._stringMax(partitionKeyRange[PARITIONKEYRANGE.MaxExclusive], r.min);
+    const leftInclusive = this._stringCompare(left, r.min) === 0 ? r.isMinInclusive : false;
+    return new import_QueryRange.QueryRange(left, r.max, leftInclusive, r.isMaxInclusive);
+  }
+  /**
+   * Given the sorted ranges and a collection, invokes the callback on the list of overlapping partition key ranges
+   * @param callback - Function execute on the overlapping partition key ranges result,
+   *                   takes two parameters error, partition key ranges
+   * @hidden
+   */
+  async getOverlappingRanges(collectionLink, sortedRanges, diagnosticNode) {
+    if (!SmartRoutingMapProvider._isSortedAndNonOverlapping(sortedRanges)) {
+      throw new Error("the list of ranges is not a non-overlapping sorted ranges");
     }
-    static _subtractRange(r, partitionKeyRange) {
-        const left = this._stringMax(partitionKeyRange[exports.PARITIONKEYRANGE.MaxExclusive], r.min);
-        const leftInclusive = this._stringCompare(left, r.min) === 0 ? r.isMinInclusive : false;
-        return new QueryRange_js_1.QueryRange(left, r.max, leftInclusive, r.isMaxInclusive);
+    let partitionKeyRanges = [];
+    if (sortedRanges.length === 0) {
+      return partitionKeyRanges;
     }
-    /**
-     * Given the sorted ranges and a collection, invokes the callback on the list of overlapping partition key ranges
-     * @param callback - Function execute on the overlapping partition key ranges result,
-     *                   takes two parameters error, partition key ranges
-     * @hidden
-     */
-    async getOverlappingRanges(collectionLink, sortedRanges, diagnosticNode) {
-        // validate if the list is non- overlapping and sorted                             TODO: any PartitionKeyRanges
-        if (!SmartRoutingMapProvider._isSortedAndNonOverlapping(sortedRanges)) {
-            throw new Error("the list of ranges is not a non-overlapping sorted ranges");
-        }
-        let partitionKeyRanges = []; // TODO: any ParitionKeyRanges
-        if (sortedRanges.length === 0) {
-            return partitionKeyRanges;
+    const collectionRoutingMap = await this.partitionKeyRangeCache.onCollectionRoutingMap(
+      collectionLink,
+      diagnosticNode
+    );
+    let index = 0;
+    let currentProvidedRange = sortedRanges[index];
+    for (; ; ) {
+      if (currentProvidedRange.isEmpty()) {
+        if (++index >= sortedRanges.length) {
+          return partitionKeyRanges;
         }
-        const collectionRoutingMap = await this.partitionKeyRangeCache.onCollectionRoutingMap(collectionLink, diagnosticNode);
-        let index = 0;
-        let currentProvidedRange = sortedRanges[index];
-        for (;;) {
-            if (currentProvidedRange.isEmpty()) {
-                // skip and go to the next item
-                if (++index >= sortedRanges.length) {
-                    return partitionKeyRanges;
-                }
-                currentProvidedRange = sortedRanges[index];
-                continue;
-            }
-            let queryRange;
-            if (partitionKeyRanges.length > 0) {
-                queryRange = SmartRoutingMapProvider._subtractRange(currentProvidedRange, partitionKeyRanges[partitionKeyRanges.length - 1]);
-            }
-            else {
-                queryRange = currentProvidedRange;
-            }
-            const overlappingRanges = collectionRoutingMap.getOverlappingRanges(queryRange);
-            if (overlappingRanges.length <= 0) {
-                throw new Error(`error: returned overlapping ranges for queryRange ${queryRange} is empty`);
-            }
-            partitionKeyRanges = partitionKeyRanges.concat(overlappingRanges);
-            const lastKnownTargetRange = QueryRange_js_1.QueryRange.parsePartitionKeyRange(partitionKeyRanges[partitionKeyRanges.length - 1]);
-            if (!lastKnownTargetRange) {
-                throw new Error("expected lastKnowTargetRange to be truthy");
-            }
-            // the overlapping ranges must contain the requested range
-            if (SmartRoutingMapProvider._stringCompare(currentProvidedRange.max, lastKnownTargetRange.max) >
-                0) {
-                throw new Error(`error: returned overlapping ranges ${overlappingRanges} \
-        does not contain the requested range ${queryRange}`);
-            }
-            // the current range is contained in partitionKeyRanges just move forward
-            if (++index >= sortedRanges.length) {
-                return partitionKeyRanges;
-            }
-            currentProvidedRange = sortedRanges[index];
-            while (SmartRoutingMapProvider._stringCompare(currentProvidedRange.max, lastKnownTargetRange.max) <= 0) {
-                // the current range is covered too.just move forward
-                if (++index >= sortedRanges.length) {
-                    return partitionKeyRanges;
-                }
-                currentProvidedRange = sortedRanges[index];
-            }
+        currentProvidedRange = sortedRanges[index];
+        continue;
+      }
+      let queryRange;
+      if (partitionKeyRanges.length > 0) {
+        queryRange = SmartRoutingMapProvider._subtractRange(
+          currentProvidedRange,
+          partitionKeyRanges[partitionKeyRanges.length - 1]
+        );
+      } else {
+        queryRange = currentProvidedRange;
+      }
+      const overlappingRanges = collectionRoutingMap.getOverlappingRanges(queryRange);
+      if (overlappingRanges.length <= 0) {
+        throw new Error(`error: returned overlapping ranges for queryRange ${queryRange} is empty`);
+      }
+      partitionKeyRanges = partitionKeyRanges.concat(overlappingRanges);
+      const lastKnownTargetRange = import_QueryRange.QueryRange.parsePartitionKeyRange(
+        partitionKeyRanges[partitionKeyRanges.length - 1]
+      );
+      if (!lastKnownTargetRange) {
+        throw new Error("expected lastKnowTargetRange to be truthy");
+      }
+      if (SmartRoutingMapProvider._stringCompare(currentProvidedRange.max, lastKnownTargetRange.max) > 0) {
+        throw new Error(`error: returned overlapping ranges ${overlappingRanges}         does not contain the requested range ${queryRange}`);
+      }
+      if (++index >= sortedRanges.length) {
+        return partitionKeyRanges;
+      }
+      currentProvidedRange = sortedRanges[index];
+      while (SmartRoutingMapProvider._stringCompare(
+        currentProvidedRange.max,
+        lastKnownTargetRange.max
+      ) <= 0) {
+        if (++index >= sortedRanges.length) {
+          return partitionKeyRanges;
         }
+        currentProvidedRange = sortedRanges[index];
+      }
     }
+  }
 }
-exports.SmartRoutingMapProvider = SmartRoutingMapProvider;
-//# sourceMappingURL=smartRoutingMapProvider.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  PARITIONKEYRANGE,
+  SmartRoutingMapProvider
+});
+//# sourceMappingURL=smartRoutingMapProvider.js.map

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

@@ -1 +1,7 @@
-{"version":3,"file":"smartRoutingMapProvider.js","sourceRoot":"","sources":["../../../src/routing/smartRoutingMapProvider.ts"],"names":[],"mappings":";;;AAGA,yDAAmD;AAEnD,2EAAqE;AACrE,mDAA6C;AAE7C,cAAc;AACD,QAAA,gBAAgB,GAAG,wBAAS,CAAC,iBAAiB,CAAC;AAE5D,cAAc;AACd,MAAa,uBAAuB;IAC1B,sBAAsB,CAAyB;IAEvD,YAAY,aAA4B;QACtC,IAAI,CAAC,sBAAsB,GAAG,IAAI,kDAAsB,CAAC,aAAa,CAAC,CAAC;IAC1E,CAAC;IACO,MAAM,CAAC,6BAA6B,CAAC,MAAkB,EAAE,MAAkB;QACjF,IAAI,OAAO,MAAM,CAAC,GAAG,KAAK,WAAW,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,OAAO,MAAM,CAAC,GAAG,KAAK,WAAW,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;YAC5B,0BAA0B;YAC1B,OAAO,KAAK,CAAC;QACf,CAAC;aAAM,CAAC;YACN,IAAI,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,cAAc,IAAI,MAAM,CAAC,cAAc,EAAE,CAAC;gBAChF,mGAAmG;gBACnG,qBAAqB;gBACrB,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,0BAA0B,CAAC,MAAoB;QAC5D,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;YAC7C,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,6BAA6B,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC;gBACtD,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,MAAM,CAAC,UAAU,CAAC,CAAS,EAAE,CAAS;QAC5C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IAEO,MAAM,CAAC,cAAc,CAAC,CAAS,EAAE,CAAS;QAChD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IAEO,MAAM,CAAC,cAAc,CAAC,CAAa,EAAE,iBAAsB;QACjE,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,iBAAiB,CAAC,wBAAgB,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACtF,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC;QACxF,OAAO,IAAI,0BAAU,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,aAAa,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC;IACtE,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,oBAAoB,CAC/B,cAAsB,EACtB,YAA0B,EAC1B,cAAsC;QAEtC,+GAA+G;QAC/G,IAAI,CAAC,uBAAuB,CAAC,0BAA0B,CAAC,YAAY,CAAC,EAAE,CAAC;YACtE,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAC;QAC/E,CAAC;QAED,IAAI,kBAAkB,GAAU,EAAE,CAAC,CAAC,8BAA8B;QAElE,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,kBAAkB,CAAC;QAC5B,CAAC;QAED,MAAM,oBAAoB,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,sBAAsB,CACnF,cAAc,EACd,cAAc,CACf,CAAC;QAEF,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,oBAAoB,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QAC/C,SAAS,CAAC;YACR,IAAI,oBAAoB,CAAC,OAAO,EAAE,EAAE,CAAC;gBACnC,+BAA+B;gBAC/B,IAAI,EAAE,KAAK,IAAI,YAAY,CAAC,MAAM,EAAE,CAAC;oBACnC,OAAO,kBAAkB,CAAC;gBAC5B,CAAC;gBACD,oBAAoB,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;gBAC3C,SAAS;YACX,CAAC;YAED,IAAI,UAAU,CAAC;YACf,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAClC,UAAU,GAAG,uBAAuB,CAAC,cAAc,CACjD,oBAAoB,EACpB,kBAAkB,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAClD,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,UAAU,GAAG,oBAAoB,CAAC;YACpC,CAAC;YAED,MAAM,iBAAiB,GAAG,oBAAoB,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC;YAChF,IAAI,iBAAiB,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAClC,MAAM,IAAI,KAAK,CAAC,qDAAqD,UAAU,WAAW,CAAC,CAAC;YAC9F,CAAC;YACD,kBAAkB,GAAG,kBAAkB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YAElE,MAAM,oBAAoB,GAAG,0BAAU,CAAC,sBAAsB,CAC5D,kBAAkB,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAClD,CAAC;YACF,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBAC1B,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;YAC/D,CAAC;YACD,0DAA0D;YAE1D,IACE,uBAAuB,CAAC,cAAc,CAAC,oBAAoB,CAAC,GAAG,EAAE,oBAAoB,CAAC,GAAG,CAAC;gBAC1F,CAAC,EACD,CAAC;gBACD,MAAM,IAAI,KAAK,CAAC,sCAAsC,iBAAiB;+CAChC,UAAU,EAAE,CAAC,CAAC;YACvD,CAAC;YAED,yEAAyE;YACzE,IAAI,EAAE,KAAK,IAAI,YAAY,CAAC,MAAM,EAAE,CAAC;gBACnC,OAAO,kBAAkB,CAAC;YAC5B,CAAC;YACD,oBAAoB,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;YAE3C,OACE,uBAAuB,CAAC,cAAc,CACpC,oBAAoB,CAAC,GAAG,EACxB,oBAAoB,CAAC,GAAG,CACzB,IAAI,CAAC,EACN,CAAC;gBACD,qDAAqD;gBACrD,IAAI,EAAE,KAAK,IAAI,YAAY,CAAC,MAAM,EAAE,CAAC;oBACnC,OAAO,kBAAkB,CAAC;gBAC5B,CAAC;gBACD,oBAAoB,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAhJD,0DAgJC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { ClientContext } from \"../ClientContext.js\";\nimport { Constants } from \"../common/constants.js\";\nimport type { DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport { PartitionKeyRangeCache } from \"./partitionKeyRangeCache.js\";\nimport { QueryRange } from \"./QueryRange.js\";\n\n/** @hidden */\nexport const PARITIONKEYRANGE = Constants.PartitionKeyRange;\n\n/** @hidden */\nexport class SmartRoutingMapProvider {\n  private partitionKeyRangeCache: PartitionKeyRangeCache;\n\n  constructor(clientContext: ClientContext) {\n    this.partitionKeyRangeCache = new PartitionKeyRangeCache(clientContext);\n  }\n  private static _secondRangeIsAfterFirstRange(range1: QueryRange, range2: QueryRange): boolean {\n    if (typeof range1.max === \"undefined\") {\n      throw new Error(\"range1 must have max\");\n    }\n\n    if (typeof range2.min === \"undefined\") {\n      throw new Error(\"range2 must have min\");\n    }\n\n    if (range1.max > range2.min) {\n      // r.min < #previous_r.max\n      return false;\n    } else {\n      if (range1.max === range2.min && range1.isMaxInclusive && range2.isMinInclusive) {\n        // the inclusive ending endpoint of previous_r is the same as the inclusive beginning endpoint of r\n        // they share a point\n        return false;\n      }\n      return true;\n    }\n  }\n\n  private static _isSortedAndNonOverlapping(ranges: QueryRange[]): boolean {\n    for (let idx = 1; idx < ranges.length; idx++) {\n      const previousR = ranges[idx - 1];\n      const r = ranges[idx];\n      if (!this._secondRangeIsAfterFirstRange(previousR, r)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private static _stringMax(a: string, b: string): string {\n    return a >= b ? a : b;\n  }\n\n  private static _stringCompare(a: string, b: string): 1 | 0 | -1 {\n    return a === b ? 0 : a > b ? 1 : -1;\n  }\n\n  private static _subtractRange(r: QueryRange, partitionKeyRange: any): QueryRange {\n    const left = this._stringMax(partitionKeyRange[PARITIONKEYRANGE.MaxExclusive], r.min);\n    const leftInclusive = this._stringCompare(left, r.min) === 0 ? r.isMinInclusive : false;\n    return new QueryRange(left, r.max, leftInclusive, r.isMaxInclusive);\n  }\n\n  /**\n   * Given the sorted ranges and a collection, invokes the callback on the list of overlapping partition key ranges\n   * @param callback - Function execute on the overlapping partition key ranges result,\n   *                   takes two parameters error, partition key ranges\n   * @hidden\n   */\n  public async getOverlappingRanges(\n    collectionLink: string,\n    sortedRanges: QueryRange[],\n    diagnosticNode: DiagnosticNodeInternal,\n  ): Promise<any[]> {\n    // validate if the list is non- overlapping and sorted                             TODO: any PartitionKeyRanges\n    if (!SmartRoutingMapProvider._isSortedAndNonOverlapping(sortedRanges)) {\n      throw new Error(\"the list of ranges is not a non-overlapping sorted ranges\");\n    }\n\n    let partitionKeyRanges: any[] = []; // TODO: any ParitionKeyRanges\n\n    if (sortedRanges.length === 0) {\n      return partitionKeyRanges;\n    }\n\n    const collectionRoutingMap = await this.partitionKeyRangeCache.onCollectionRoutingMap(\n      collectionLink,\n      diagnosticNode,\n    );\n\n    let index = 0;\n    let currentProvidedRange = sortedRanges[index];\n    for (;;) {\n      if (currentProvidedRange.isEmpty()) {\n        // skip and go to the next item\n        if (++index >= sortedRanges.length) {\n          return partitionKeyRanges;\n        }\n        currentProvidedRange = sortedRanges[index];\n        continue;\n      }\n\n      let queryRange;\n      if (partitionKeyRanges.length > 0) {\n        queryRange = SmartRoutingMapProvider._subtractRange(\n          currentProvidedRange,\n          partitionKeyRanges[partitionKeyRanges.length - 1],\n        );\n      } else {\n        queryRange = currentProvidedRange;\n      }\n\n      const overlappingRanges = collectionRoutingMap.getOverlappingRanges(queryRange);\n      if (overlappingRanges.length <= 0) {\n        throw new Error(`error: returned overlapping ranges for queryRange ${queryRange} is empty`);\n      }\n      partitionKeyRanges = partitionKeyRanges.concat(overlappingRanges);\n\n      const lastKnownTargetRange = QueryRange.parsePartitionKeyRange(\n        partitionKeyRanges[partitionKeyRanges.length - 1],\n      );\n      if (!lastKnownTargetRange) {\n        throw new Error(\"expected lastKnowTargetRange to be truthy\");\n      }\n      // the overlapping ranges must contain the requested range\n\n      if (\n        SmartRoutingMapProvider._stringCompare(currentProvidedRange.max, lastKnownTargetRange.max) >\n        0\n      ) {\n        throw new Error(`error: returned overlapping ranges ${overlappingRanges} \\\n        does not contain the requested range ${queryRange}`);\n      }\n\n      // the current range is contained in partitionKeyRanges just move forward\n      if (++index >= sortedRanges.length) {\n        return partitionKeyRanges;\n      }\n      currentProvidedRange = sortedRanges[index];\n\n      while (\n        SmartRoutingMapProvider._stringCompare(\n          currentProvidedRange.max,\n          lastKnownTargetRange.max,\n        ) <= 0\n      ) {\n        // the current range is covered too.just move forward\n        if (++index >= sortedRanges.length) {\n          return partitionKeyRanges;\n        }\n        currentProvidedRange = sortedRanges[index];\n      }\n    }\n  }\n}\n"]}
+{
+  "version": 3,
+  "sources": ["../../../src/routing/smartRoutingMapProvider.ts"],
+  "sourcesContent": ["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { ClientContext } from \"../ClientContext.js\";\nimport { Constants } from \"../common/constants.js\";\nimport type { DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport { PartitionKeyRangeCache } from \"./partitionKeyRangeCache.js\";\nimport { QueryRange } from \"./QueryRange.js\";\n\n/** @hidden */\nexport const PARITIONKEYRANGE = Constants.PartitionKeyRange;\n\n/** @hidden */\nexport class SmartRoutingMapProvider {\n  private partitionKeyRangeCache: PartitionKeyRangeCache;\n\n  constructor(clientContext: ClientContext) {\n    this.partitionKeyRangeCache = new PartitionKeyRangeCache(clientContext);\n  }\n  private static _secondRangeIsAfterFirstRange(range1: QueryRange, range2: QueryRange): boolean {\n    if (typeof range1.max === \"undefined\") {\n      throw new Error(\"range1 must have max\");\n    }\n\n    if (typeof range2.min === \"undefined\") {\n      throw new Error(\"range2 must have min\");\n    }\n\n    if (range1.max > range2.min) {\n      // r.min < #previous_r.max\n      return false;\n    } else {\n      if (range1.max === range2.min && range1.isMaxInclusive && range2.isMinInclusive) {\n        // the inclusive ending endpoint of previous_r is the same as the inclusive beginning endpoint of r\n        // they share a point\n        return false;\n      }\n      return true;\n    }\n  }\n\n  private static _isSortedAndNonOverlapping(ranges: QueryRange[]): boolean {\n    for (let idx = 1; idx < ranges.length; idx++) {\n      const previousR = ranges[idx - 1];\n      const r = ranges[idx];\n      if (!this._secondRangeIsAfterFirstRange(previousR, r)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  private static _stringMax(a: string, b: string): string {\n    return a >= b ? a : b;\n  }\n\n  private static _stringCompare(a: string, b: string): 1 | 0 | -1 {\n    return a === b ? 0 : a > b ? 1 : -1;\n  }\n\n  private static _subtractRange(r: QueryRange, partitionKeyRange: any): QueryRange {\n    const left = this._stringMax(partitionKeyRange[PARITIONKEYRANGE.MaxExclusive], r.min);\n    const leftInclusive = this._stringCompare(left, r.min) === 0 ? r.isMinInclusive : false;\n    return new QueryRange(left, r.max, leftInclusive, r.isMaxInclusive);\n  }\n\n  /**\n   * Given the sorted ranges and a collection, invokes the callback on the list of overlapping partition key ranges\n   * @param callback - Function execute on the overlapping partition key ranges result,\n   *                   takes two parameters error, partition key ranges\n   * @hidden\n   */\n  public async getOverlappingRanges(\n    collectionLink: string,\n    sortedRanges: QueryRange[],\n    diagnosticNode: DiagnosticNodeInternal,\n  ): Promise<any[]> {\n    // validate if the list is non- overlapping and sorted                             TODO: any PartitionKeyRanges\n    if (!SmartRoutingMapProvider._isSortedAndNonOverlapping(sortedRanges)) {\n      throw new Error(\"the list of ranges is not a non-overlapping sorted ranges\");\n    }\n\n    let partitionKeyRanges: any[] = []; // TODO: any ParitionKeyRanges\n\n    if (sortedRanges.length === 0) {\n      return partitionKeyRanges;\n    }\n\n    const collectionRoutingMap = await this.partitionKeyRangeCache.onCollectionRoutingMap(\n      collectionLink,\n      diagnosticNode,\n    );\n\n    let index = 0;\n    let currentProvidedRange = sortedRanges[index];\n    for (;;) {\n      if (currentProvidedRange.isEmpty()) {\n        // skip and go to the next item\n        if (++index >= sortedRanges.length) {\n          return partitionKeyRanges;\n        }\n        currentProvidedRange = sortedRanges[index];\n        continue;\n      }\n\n      let queryRange;\n      if (partitionKeyRanges.length > 0) {\n        queryRange = SmartRoutingMapProvider._subtractRange(\n          currentProvidedRange,\n          partitionKeyRanges[partitionKeyRanges.length - 1],\n        );\n      } else {\n        queryRange = currentProvidedRange;\n      }\n\n      const overlappingRanges = collectionRoutingMap.getOverlappingRanges(queryRange);\n      if (overlappingRanges.length <= 0) {\n        throw new Error(`error: returned overlapping ranges for queryRange ${queryRange} is empty`);\n      }\n      partitionKeyRanges = partitionKeyRanges.concat(overlappingRanges);\n\n      const lastKnownTargetRange = QueryRange.parsePartitionKeyRange(\n        partitionKeyRanges[partitionKeyRanges.length - 1],\n      );\n      if (!lastKnownTargetRange) {\n        throw new Error(\"expected lastKnowTargetRange to be truthy\");\n      }\n      // the overlapping ranges must contain the requested range\n\n      if (\n        SmartRoutingMapProvider._stringCompare(currentProvidedRange.max, lastKnownTargetRange.max) >\n        0\n      ) {\n        throw new Error(`error: returned overlapping ranges ${overlappingRanges} \\\n        does not contain the requested range ${queryRange}`);\n      }\n\n      // the current range is contained in partitionKeyRanges just move forward\n      if (++index >= sortedRanges.length) {\n        return partitionKeyRanges;\n      }\n      currentProvidedRange = sortedRanges[index];\n\n      while (\n        SmartRoutingMapProvider._stringCompare(\n          currentProvidedRange.max,\n          lastKnownTargetRange.max,\n        ) <= 0\n      ) {\n        // the current range is covered too.just move forward\n        if (++index >= sortedRanges.length) {\n          return partitionKeyRanges;\n        }\n        currentProvidedRange = sortedRanges[index];\n      }\n    }\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAGA,uBAA0B;AAE1B,oCAAuC;AACvC,wBAA2B;AAGpB,MAAM,mBAAmB,2BAAU;AAGnC,MAAM,wBAAwB;AAAA,EAC3B;AAAA,EAER,YAAY,eAA8B;AACxC,SAAK,yBAAyB,IAAI,qDAAuB,aAAa;AAAA,EACxE;AAAA,EACA,OAAe,8BAA8B,QAAoB,QAA6B;AAC5F,QAAI,OAAO,OAAO,QAAQ,aAAa;AACrC,YAAM,IAAI,MAAM,sBAAsB;AAAA,IACxC;AAEA,QAAI,OAAO,OAAO,QAAQ,aAAa;AACrC,YAAM,IAAI,MAAM,sBAAsB;AAAA,IACxC;AAEA,QAAI,OAAO,MAAM,OAAO,KAAK;AAE3B,aAAO;AAAA,IACT,OAAO;AACL,UAAI,OAAO,QAAQ,OAAO,OAAO,OAAO,kBAAkB,OAAO,gBAAgB;AAG/E,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,OAAe,2BAA2B,QAA+B;AACvE,aAAS,MAAM,GAAG,MAAM,OAAO,QAAQ,OAAO;AAC5C,YAAM,YAAY,OAAO,MAAM,CAAC;AAChC,YAAM,IAAI,OAAO,GAAG;AACpB,UAAI,CAAC,KAAK,8BAA8B,WAAW,CAAC,GAAG;AACrD,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,OAAe,WAAW,GAAW,GAAmB;AACtD,WAAO,KAAK,IAAI,IAAI;AAAA,EACtB;AAAA,EAEA,OAAe,eAAe,GAAW,GAAuB;AAC9D,WAAO,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI;AAAA,EACnC;AAAA,EAEA,OAAe,eAAe,GAAe,mBAAoC;AAC/E,UAAM,OAAO,KAAK,WAAW,kBAAkB,iBAAiB,YAAY,GAAG,EAAE,GAAG;AACpF,UAAM,gBAAgB,KAAK,eAAe,MAAM,EAAE,GAAG,MAAM,IAAI,EAAE,iBAAiB;AAClF,WAAO,IAAI,6BAAW,MAAM,EAAE,KAAK,eAAe,EAAE,cAAc;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAa,qBACX,gBACA,cACA,gBACgB;AAEhB,QAAI,CAAC,wBAAwB,2BAA2B,YAAY,GAAG;AACrE,YAAM,IAAI,MAAM,2DAA2D;AAAA,IAC7E;AAEA,QAAI,qBAA4B,CAAC;AAEjC,QAAI,aAAa,WAAW,GAAG;AAC7B,aAAO;AAAA,IACT;AAEA,UAAM,uBAAuB,MAAM,KAAK,uBAAuB;AAAA,MAC7D;AAAA,MACA;AAAA,IACF;AAEA,QAAI,QAAQ;AACZ,QAAI,uBAAuB,aAAa,KAAK;AAC7C,eAAS;AACP,UAAI,qBAAqB,QAAQ,GAAG;AAElC,YAAI,EAAE,SAAS,aAAa,QAAQ;AAClC,iBAAO;AAAA,QACT;AACA,+BAAuB,aAAa,KAAK;AACzC;AAAA,MACF;AAEA,UAAI;AACJ,UAAI,mBAAmB,SAAS,GAAG;AACjC,qBAAa,wBAAwB;AAAA,UACnC;AAAA,UACA,mBAAmB,mBAAmB,SAAS,CAAC;AAAA,QAClD;AAAA,MACF,OAAO;AACL,qBAAa;AAAA,MACf;AAEA,YAAM,oBAAoB,qBAAqB,qBAAqB,UAAU;AAC9E,UAAI,kBAAkB,UAAU,GAAG;AACjC,cAAM,IAAI,MAAM,qDAAqD,UAAU,WAAW;AAAA,MAC5F;AACA,2BAAqB,mBAAmB,OAAO,iBAAiB;AAEhE,YAAM,uBAAuB,6BAAW;AAAA,QACtC,mBAAmB,mBAAmB,SAAS,CAAC;AAAA,MAClD;AACA,UAAI,CAAC,sBAAsB;AACzB,cAAM,IAAI,MAAM,2CAA2C;AAAA,MAC7D;AAGA,UACE,wBAAwB,eAAe,qBAAqB,KAAK,qBAAqB,GAAG,IACzF,GACA;AACA,cAAM,IAAI,MAAM,sCAAsC,iBAAiB,iDAChC,UAAU,EAAE;AAAA,MACrD;AAGA,UAAI,EAAE,SAAS,aAAa,QAAQ;AAClC,eAAO;AAAA,MACT;AACA,6BAAuB,aAAa,KAAK;AAEzC,aACE,wBAAwB;AAAA,QACtB,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,MACvB,KAAK,GACL;AAEA,YAAI,EAAE,SAAS,aAAa,QAAQ;AAClC,iBAAO;AAAA,QACT;AACA,+BAAuB,aAAa,KAAK;AAAA,MAC3C;AAAA,IACF;AAAA,EACF;AACF;",
+  "names": []
+}

package/dist/commonjs/session/SessionContext.js

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

package/dist/commonjs/session/SessionContext.js.map

@@ -1 +1,7 @@
-{"version":3,"file":"SessionContext.js","sourceRoot":"","sources":["../../../src/session/SessionContext.ts"],"names":[],"mappings":"","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { OperationType, ResourceType } from \"../common/index.js\";\n\n/**\n * @hidden\n */\nexport interface SessionContext {\n  resourceId?: string;\n  resourceAddress?: string;\n  resourceType?: ResourceType;\n  isNameBased?: boolean;\n  operationType?: OperationType;\n}\n"]}
+{
+  "version": 3,
+  "sources": ["../../../src/session/SessionContext.ts"],
+  "sourcesContent": ["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { OperationType, ResourceType } from \"../common/index.js\";\n\n/**\n * @hidden\n */\nexport interface SessionContext {\n  resourceId?: string;\n  resourceAddress?: string;\n  resourceType?: ResourceType;\n  isNameBased?: boolean;\n  operationType?: OperationType;\n}\n"],
+  "mappings": ";;;;;;;;;;;;;AAAA;AAAA;",
+  "names": []
+}