@azure/cosmos 4.3.0 → 4.4.0

package/dist/browser/routing/CollectionRoutingMapFactory.d.ts

@@ -0,0 +1,4 @@
+import { InMemoryCollectionRoutingMap } from "./inMemoryCollectionRoutingMap.js";
+/** @hidden */
+export declare function createCompleteRoutingMap(partitionKeyRangeInfoTuppleList: any[]): InMemoryCollectionRoutingMap;
+//# sourceMappingURL=CollectionRoutingMapFactory.d.ts.map

package/dist/browser/routing/CollectionRoutingMapFactory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CollectionRoutingMapFactory.d.ts","sourceRoot":"","sources":["../../../src/routing/CollectionRoutingMapFactory.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,4BAA4B,EAAE,MAAM,mCAAmC,CAAC;AAiBjF,cAAc;AACd,wBAAgB,wBAAwB,CACtC,+BAA+B,EAAE,GAAG,EAAE,GACrC,4BAA4B,CAqB9B"}

package/dist/browser/routing/CollectionRoutingMapFactory.js

@@ -0,0 +1,72 @@
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+import { Constants } from "../common/constants.js";
+import { InMemoryCollectionRoutingMap } from "./inMemoryCollectionRoutingMap.js";
+/**
+ * @hidden
+ */
+function compareRanges(a, b) {
+    const aVal = a[0][Constants.PartitionKeyRange.MinInclusive];
+    const bVal = b[0][Constants.PartitionKeyRange.MinInclusive];
+    if (aVal > bVal) {
+        return 1;
+    }
+    if (aVal < bVal) {
+        return -1;
+    }
+    return 0;
+}
+/** @hidden */
+export 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.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(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.PartitionKeyRange.MinInclusive] ===
+                Constants.EffectivePartitionKeyConstants.MinimumInclusiveEffectivePartitionKey;
+        isComplete =
+            isComplete &&
+                lastRange[Constants.PartitionKeyRange.MaxExclusive] ===
+                    Constants.EffectivePartitionKeyConstants.MaximumExclusiveEffectivePartitionKey;
+        for (let i = 1; i < partitionKeyOrderedRange.length; i++) {
+            const previousRange = partitionKeyOrderedRange[i - 1];
+            const currentRange = partitionKeyOrderedRange[i];
+            isComplete =
+                isComplete &&
+                    previousRange[Constants.PartitionKeyRange.MaxExclusive] ===
+                        currentRange[Constants.PartitionKeyRange.MinInclusive];
+            if (!isComplete) {
+                if (previousRange[Constants.PartitionKeyRange.MaxExclusive] >
+                    currentRange[Constants.PartitionKeyRange.MinInclusive]) {
+                    throw Error("Ranges overlap");
+                }
+                break;
+            }
+        }
+    }
+    return isComplete;
+}
+//# sourceMappingURL=CollectionRoutingMapFactory.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CollectionRoutingMapFactory.js","sourceRoot":"","sources":["../../../src/routing/CollectionRoutingMapFactory.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAClC,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACnD,OAAO,EAAE,4BAA4B,EAAE,MAAM,mCAAmC,CAAC;AAEjF;;GAEG;AACH,SAAS,aAAa,CAAC,CAAM,EAAE,CAAM;IACnC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;IAC5D,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,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,MAAM,UAAU,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,SAAS,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,4BAA4B,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,SAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC;gBACpD,SAAS,CAAC,8BAA8B,CAAC,qCAAqC,CAAC;QACjF,UAAU;YACR,UAAU;gBACV,SAAS,CAAC,SAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC;oBACjD,SAAS,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,SAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC;wBACrD,YAAY,CAAC,SAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;YAE3D,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,IACE,aAAa,CAAC,SAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC;oBACvD,YAAY,CAAC,SAAS,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"]}

package/dist/browser/routing/QueryRange.d.ts

@@ -0,0 +1,35 @@
+import type { PartitionKeyRange } from "../client/Container/PartitionKeyRange.js";
+import type { QueryRange as ResponseQueryRange } from "../request/ErrorResponse.js";
+/** @hidden */
+export declare class QueryRange {
+    min: string;
+    max: string;
+    isMinInclusive: boolean;
+    isMaxInclusive: boolean;
+    /**
+     * Represents a QueryRange.
+     *
+     * @param rangeMin                - min
+     * @param rangeMin                - max
+     * @param isMinInclusive         - isMinInclusive
+     * @param isMaxInclusive         - isMaxInclusive
+     * @hidden
+     */
+    constructor(rangeMin: string, rangeMax: string, isMinInclusive: boolean, isMaxInclusive: boolean);
+    overlaps(other: QueryRange): boolean;
+    isFullRange(): boolean;
+    isEmpty(): boolean;
+    /**
+     * Parse a QueryRange from a partitionKeyRange
+     * @returns QueryRange
+     * @hidden
+     */
+    static parsePartitionKeyRange(partitionKeyRange: PartitionKeyRange): QueryRange;
+    /**
+     * Parse a QueryRange from a dictionary
+     * @returns QueryRange
+     * @hidden
+     */
+    static parseFromDict(queryRangeDict: ResponseQueryRange): QueryRange;
+}
+//# sourceMappingURL=QueryRange.d.ts.map

package/dist/browser/routing/QueryRange.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryRange.d.ts","sourceRoot":"","sources":["../../../src/routing/QueryRange.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,0CAA0C,CAAC;AAElF,OAAO,KAAK,EAAE,UAAU,IAAI,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAEpF,cAAc;AACd,qBAAa,UAAU;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,MAAM,CAAC;IACZ,cAAc,EAAE,OAAO,CAAC;IACxB,cAAc,EAAE,OAAO,CAAC;IAE/B;;;;;;;;OAQG;gBAED,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,OAAO,EACvB,cAAc,EAAE,OAAO;IAOlB,QAAQ,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO;IAsBpC,WAAW,IAAI,OAAO;IAStB,OAAO,IAAI,OAAO;IAGzB;;;;OAIG;WACW,sBAAsB,CAAC,iBAAiB,EAAE,iBAAiB,GAAG,UAAU;IAQtF;;;;OAIG;WACW,aAAa,CAAC,cAAc,EAAE,kBAAkB,GAAG,UAAU;CAQ5E"}

package/dist/browser/routing/QueryRange.js

@@ -0,0 +1,63 @@
+import { Constants } from "../common/index.js";
+/** @hidden */
+export class QueryRange {
+    /**
+     * 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; // 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 === Constants.EffectivePartitionKeyConstants.MinimumInclusiveEffectivePartitionKey &&
+            this.max === 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[Constants.PartitionKeyRange.MinInclusive], partitionKeyRange[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);
+    }
+}
+//# sourceMappingURL=QueryRange.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"QueryRange.js","sourceRoot":"","sources":["../../../src/routing/QueryRange.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAG/C,cAAc;AACd,MAAM,OAAO,UAAU;IAMrB;;;;;;;;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,SAAS,CAAC,8BAA8B,CAAC,qCAAqC;YAC3F,IAAI,CAAC,GAAG,KAAK,SAAS,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,SAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,EAC3D,iBAAiB,CAAC,SAAS,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","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"]}

package/dist/browser/routing/inMemoryCollectionRoutingMap.d.ts

@@ -0,0 +1,17 @@
+import type { PartitionKeyRange } from "../client/index.js";
+import { QueryRange } from "./QueryRange.js";
+/** @hidden */
+export declare class InMemoryCollectionRoutingMap {
+    private orderedPartitionKeyRanges;
+    private orderedRanges;
+    orderedPartitionInfo: unknown;
+    /**
+     * 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: PartitionKeyRange[], orderedPartitionInfo: unknown);
+    getOrderedParitionKeyRanges(): PartitionKeyRange[];
+    getOverlappingRanges(providedQueryRanges: QueryRange | QueryRange[]): PartitionKeyRange[];
+}
+//# sourceMappingURL=inMemoryCollectionRoutingMap.d.ts.map

package/dist/browser/routing/inMemoryCollectionRoutingMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inMemoryCollectionRoutingMap.d.ts","sourceRoot":"","sources":["../../../src/routing/inMemoryCollectionRoutingMap.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAE5D,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,cAAc;AACd,qBAAa,4BAA4B;IACvC,OAAO,CAAC,yBAAyB,CAAsB;IACvD,OAAO,CAAC,aAAa,CAAe;IAE7B,oBAAoB,EAAE,OAAO,CAAC;IAErC;;;;OAIG;gBACS,yBAAyB,EAAE,iBAAiB,EAAE,EAAE,oBAAoB,EAAE,OAAO;IAYlF,2BAA2B,IAAI,iBAAiB,EAAE;IAIlD,oBAAoB,CAAC,mBAAmB,EAAE,UAAU,GAAG,UAAU,EAAE,GAAG,iBAAiB,EAAE;CA+EjG"}

package/dist/browser/routing/inMemoryCollectionRoutingMap.js

@@ -0,0 +1,81 @@
+import { Constants } from "../common/index.js";
+import { QueryRange } from "./QueryRange.js";
+/** @hidden */
+export class InMemoryCollectionRoutingMap {
+    /**
+     * 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(pkr[Constants.PartitionKeyRange.MinInclusive], pkr[Constants.PartitionKeyRange.MaxExclusive], true, false);
+        });
+        this.orderedPartitionInfo = orderedPartitionInfo;
+    }
+    getOrderedParitionKeyRanges() {
+        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][Constants.PartitionKeyRange.MinInclusive]] = this.orderedPartitionKeyRanges[j];
+                }
+            }
+        }
+        const overlappingPartitionKeyRanges = Object.keys(minToPartitionRange).map((k) => minToPartitionRange[k]);
+        return overlappingPartitionKeyRanges.sort((a, b) => {
+            return a[Constants.PartitionKeyRange.MinInclusive].localeCompare(b[Constants.PartitionKeyRange.MinInclusive]);
+        });
+    }
+}
+//# sourceMappingURL=inMemoryCollectionRoutingMap.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"inMemoryCollectionRoutingMap.js","sourceRoot":"","sources":["../../../src/routing/inMemoryCollectionRoutingMap.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,cAAc;AACd,MAAM,OAAO,4BAA4B;IAMvC;;;;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,UAAU,CACnB,GAAG,CAAC,SAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,EAC7C,GAAG,CAAC,SAAS,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,SAAS,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,SAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC,aAAa,CAC9D,CAAC,CAAC,SAAS,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAC5C,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;CACF","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"]}

package/dist/browser/routing/index.d.ts

@@ -0,0 +1,5 @@
+export * from "./QueryRange.js";
+export * from "./inMemoryCollectionRoutingMap.js";
+export * from "./partitionKeyRangeCache.js";
+export * from "./smartRoutingMapProvider.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/browser/routing/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/routing/index.ts"],"names":[],"mappings":"AAEA,cAAc,iBAAiB,CAAC;AAChC,cAAc,mCAAmC,CAAC;AAClD,cAAc,6BAA6B,CAAC;AAC5C,cAAc,8BAA8B,CAAC"}

package/dist/browser/routing/index.js

@@ -0,0 +1,7 @@
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+export * from "./QueryRange.js";
+export * from "./inMemoryCollectionRoutingMap.js";
+export * from "./partitionKeyRangeCache.js";
+export * from "./smartRoutingMapProvider.js";
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/routing/index.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAClC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mCAAmC,CAAC;AAClD,cAAc,6BAA6B,CAAC;AAC5C,cAAc,8BAA8B,CAAC","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"]}

package/dist/browser/routing/partitionKeyRangeCache.d.ts

@@ -0,0 +1,24 @@
+import type { PartitionKeyRange } from "../client/Container/PartitionKeyRange.js";
+import type { ClientContext } from "../ClientContext.js";
+import type { DiagnosticNodeInternal } from "../diagnostics/DiagnosticNodeInternal.js";
+import type { InMemoryCollectionRoutingMap } from "./inMemoryCollectionRoutingMap.js";
+import type { QueryRange } from "./QueryRange.js";
+/** @hidden */
+export declare class PartitionKeyRangeCache {
+    private clientContext;
+    private collectionRoutingMapByCollectionId;
+    constructor(clientContext: ClientContext);
+    /**
+     * Finds or Instantiates the requested Collection Routing Map
+     * @param collectionLink - Requested collectionLink
+     * @hidden
+     */
+    onCollectionRoutingMap(collectionLink: string, diagnosticNode: DiagnosticNodeInternal, forceRefresh?: boolean): Promise<InMemoryCollectionRoutingMap>;
+    /**
+     * Given the query ranges and a collection, invokes the callback on the list of overlapping partition key ranges
+     * @hidden
+     */
+    getOverlappingRanges(collectionLink: string, queryRange: QueryRange, diagnosticNode: DiagnosticNodeInternal, forceRefresh?: boolean): Promise<PartitionKeyRange[]>;
+    private requestCollectionRoutingMap;
+}
+//# sourceMappingURL=partitionKeyRangeCache.d.ts.map

package/dist/browser/routing/partitionKeyRangeCache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"partitionKeyRangeCache.d.ts","sourceRoot":"","sources":["../../../src/routing/partitionKeyRangeCache.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,0CAA0C,CAAC;AAClF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEzD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,0CAA0C,CAAC;AAGvF,OAAO,KAAK,EAAE,4BAA4B,EAAE,MAAM,mCAAmC,CAAC;AACtF,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAElD,cAAc;AACd,qBAAa,sBAAsB;IAKrB,OAAO,CAAC,aAAa;IAJjC,OAAO,CAAC,kCAAkC,CAExC;gBAEkB,aAAa,EAAE,aAAa;IAGhD;;;;OAIG;IACU,sBAAsB,CACjC,cAAc,EAAE,MAAM,EACtB,cAAc,EAAE,sBAAsB,EACtC,YAAY,GAAE,OAAe,GAC5B,OAAO,CAAC,4BAA4B,CAAC;IAWxC;;;OAGG;IACU,oBAAoB,CAC/B,cAAc,EAAE,MAAM,EACtB,UAAU,EAAE,UAAU,EACtB,cAAc,EAAE,sBAAsB,EACtC,YAAY,GAAE,OAAe,GAC5B,OAAO,CAAC,iBAAiB,EAAE,CAAC;YAKjB,2BAA2B;CAe1C"}

package/dist/browser/routing/partitionKeyRangeCache.js

@@ -0,0 +1,42 @@
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+import { MetadataLookUpType } from "../CosmosDiagnostics.js";
+import { getIdFromLink } from "../common/helper.js";
+import { withMetadataDiagnostics } from "../utils/diagnostics.js";
+import { createCompleteRoutingMap } from "./CollectionRoutingMapFactory.js";
+/** @hidden */
+export class PartitionKeyRangeCache {
+    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 = 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 withMetadataDiagnostics(async (metadataDiagnostics) => {
+            return this.clientContext
+                .queryPartitionKeyRanges(collectionLink)
+                .fetchAllInternal(metadataDiagnostics);
+        }, diagnosticNode, MetadataLookUpType.PartitionKeyRangeLookUp);
+        return createCompleteRoutingMap(resources.map((r) => [r, true]));
+    }
+}
+//# sourceMappingURL=partitionKeyRangeCache.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"partitionKeyRangeCache.js","sourceRoot":"","sources":["../../../src/routing/partitionKeyRangeCache.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAClC,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAG7D,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEpD,OAAO,EAAE,uBAAuB,EAAE,MAAM,yBAAyB,CAAC;AAClE,OAAO,EAAE,wBAAwB,EAAE,MAAM,kCAAkC,CAAC;AAI5E,cAAc;AACd,MAAM,OAAO,sBAAsB;IAKjC,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,aAAa,CAAC,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,uBAAuB,CACjD,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,kBAAkB,CAAC,uBAAuB,CAC3C,CAAC;QACF,OAAO,wBAAwB,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;CACF","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\";\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"]}

package/dist/browser/routing/smartRoutingMapProvider.d.ts

@@ -0,0 +1,23 @@
+import type { ClientContext } from "../ClientContext.js";
+import type { DiagnosticNodeInternal } from "../diagnostics/DiagnosticNodeInternal.js";
+import { QueryRange } from "./QueryRange.js";
+/** @hidden */
+export declare const PARITIONKEYRANGE: import("../common/constants.js").PartitionKeyRangePropertiesNames;
+/** @hidden */
+export declare class SmartRoutingMapProvider {
+    private partitionKeyRangeCache;
+    constructor(clientContext: ClientContext);
+    private static _secondRangeIsAfterFirstRange;
+    private static _isSortedAndNonOverlapping;
+    private static _stringMax;
+    private static _stringCompare;
+    private static _subtractRange;
+    /**
+     * 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
+     */
+    getOverlappingRanges(collectionLink: string, sortedRanges: QueryRange[], diagnosticNode: DiagnosticNodeInternal): Promise<any[]>;
+}
+//# sourceMappingURL=smartRoutingMapProvider.d.ts.map

package/dist/browser/routing/smartRoutingMapProvider.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"smartRoutingMapProvider.d.ts","sourceRoot":"","sources":["../../../src/routing/smartRoutingMapProvider.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEzD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,0CAA0C,CAAC;AAEvF,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,cAAc;AACd,eAAO,MAAM,gBAAgB,mEAA8B,CAAC;AAE5D,cAAc;AACd,qBAAa,uBAAuB;IAClC,OAAO,CAAC,sBAAsB,CAAyB;gBAE3C,aAAa,EAAE,aAAa;IAGxC,OAAO,CAAC,MAAM,CAAC,6BAA6B;IAsB5C,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAWzC,OAAO,CAAC,MAAM,CAAC,UAAU;IAIzB,OAAO,CAAC,MAAM,CAAC,cAAc;IAI7B,OAAO,CAAC,MAAM,CAAC,cAAc;IAM7B;;;;;OAKG;IACU,oBAAoB,CAC/B,cAAc,EAAE,MAAM,EACtB,YAAY,EAAE,UAAU,EAAE,EAC1B,cAAc,EAAE,sBAAsB,GACrC,OAAO,CAAC,GAAG,EAAE,CAAC;CAiFlB"}

package/dist/browser/routing/smartRoutingMapProvider.js

@@ -0,0 +1,116 @@
+import { Constants } from "../common/constants.js";
+import { PartitionKeyRangeCache } from "./partitionKeyRangeCache.js";
+import { QueryRange } from "./QueryRange.js";
+/** @hidden */
+export const PARITIONKEYRANGE = Constants.PartitionKeyRange;
+/** @hidden */
+export class SmartRoutingMapProvider {
+    constructor(clientContext) {
+        this.partitionKeyRangeCache = new PartitionKeyRangeCache(clientContext);
+    }
+    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;
+        }
+    }
+    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;
+    }
+    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 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) {
+        // 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()) {
+                // 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.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];
+            }
+        }
+    }
+}
+//# sourceMappingURL=smartRoutingMapProvider.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"smartRoutingMapProvider.js","sourceRoot":"","sources":["../../../src/routing/smartRoutingMapProvider.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAEnD,OAAO,EAAE,sBAAsB,EAAE,MAAM,6BAA6B,CAAC;AACrE,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,cAAc;AACd,MAAM,CAAC,MAAM,gBAAgB,GAAG,SAAS,CAAC,iBAAiB,CAAC;AAE5D,cAAc;AACd,MAAM,OAAO,uBAAuB;IAGlC,YAAY,aAA4B;QACtC,IAAI,CAAC,sBAAsB,GAAG,IAAI,sBAAsB,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,gBAAgB,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,UAAU,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,UAAU,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","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"]}

package/dist/browser/session/SessionContext.d.ts

@@ -0,0 +1,12 @@
+import type { OperationType, ResourceType } from "../common/index.js";
+/**
+ * @hidden
+ */
+export interface SessionContext {
+    resourceId?: string;
+    resourceAddress?: string;
+    resourceType?: ResourceType;
+    isNameBased?: boolean;
+    operationType?: OperationType;
+}
+//# sourceMappingURL=SessionContext.d.ts.map

package/dist/browser/session/SessionContext.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SessionContext.d.ts","sourceRoot":"","sources":["../../../src/session/SessionContext.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAEtE;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,aAAa,CAAC,EAAE,aAAa,CAAC;CAC/B"}

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

@@ -0,0 +1 @@
+{"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"]}