@azure/cosmos 4.9.1 → 4.9.3

package/dist/browser/queryExecutionContext/queryFilteringStrategy/OrderByQueryRangeStrategy.js

@@ -255,7 +255,8 @@ export class OrderByQueryRangeStrategy {
         return condition;
     }
     /**
-     * Formats a value for use in SQL condition
+     * Formats a value for use in SQL condition.
+     * We escape single quotes as \\u0027 to avoid ambiguity with \\\\ followed by '
      */
     formatValueForSQL(value) {
         if (value === null || value === undefined) {
@@ -264,8 +265,8 @@ export class OrderByQueryRangeStrategy {
         const valueType = typeof value;
         switch (valueType) {
             case "string":
-                // Escape single quotes and wrap in quotes
-                return `'${value.toString().replace(/'/g, "''")}'`;
+                // Escape backslashes first, then single quotes as unicode escape
+                return `'${value.toString().replace(/\\/g, "\\\\").replace(/'/g, "\\u0027")}'`;
             case "number":
             case "bigint":
                 return value.toString();
@@ -274,9 +275,9 @@ export class OrderByQueryRangeStrategy {
             default:
                 // For objects and arrays, convert to JSON string
                 if (typeof value === "object") {
-                    return `'${JSON.stringify(value).replace(/'/g, "''")}'`;
+                    return `'${JSON.stringify(value).replace(/\\/g, "\\\\").replace(/'/g, "\\u0027")}'`;
                 }
-                return `'${value.toString().replace(/'/g, "''")}'`;
+                return `'${value.toString().replace(/\\/g, "\\\\").replace(/'/g, "\\u0027")}'`;
         }
     }
     /**

package/dist/browser/queryExecutionContext/queryFilteringStrategy/OrderByQueryRangeStrategy.js.map

@@ -1 +1 @@
-{"version":3,"file":"OrderByQueryRangeStrategy.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/queryFilteringStrategy/OrderByQueryRangeStrategy.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AASlC;;;;GAIG;AACH,MAAM,OAAO,yBAAyB;IACpC,eAAe;QACb,OAAO,cAAc,CAAC;IACxB,CAAC;IAED,qBAAqB,CACnB,YAAiC,EACjC,kBAA0D,EAC1D,SAAmC;QAEnC,IACE,CAAC,YAAY;YACb,YAAY,CAAC,MAAM,KAAK,CAAC;YACzB,CAAC,kBAAkB;YACnB,kBAAkB,CAAC,MAAM,KAAK,CAAC,EAC/B,CAAC;YACD,OAAO;gBACL,eAAe,EAAE,EAAE;aACpB,CAAC;QACJ,CAAC;QAED,IACE,CAAC,SAAS,EAAE,YAAY;YACxB,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,YAAY,CAAC;YACtC,SAAS,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;YACD,MAAM,IAAI,KAAK,CACb,yGAAyG,CAC1G,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAA+B;YACzC,eAAe,EAAE,EAAE;SACpB,CAAC;QACF,IAAI,cAAc,GAAwB,EAAE,CAAC;QAC7C,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAE7B,IAAI,kBAAkB,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,gBAAgB,GAAG,IAAI,CAAC;YACxB,6DAA6D;YAC7D,MAAM,kBAAkB,GAAG,kBAAkB,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;YACnF,wEAAwE;YACxE,MAAM,WAAW,GAAsB,kBAAkB,CAAC;YAE1D,MAAM,uBAAuB,GAC3B,kBAAkB,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC;YAEtE,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CACjD,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,YAAY,EAAE,kBAAkB,CAAC,YAAY,CAAC,CACjF,CAAC;YAEF,MAAM,YAAY,GAAG,SAAS,CAAC,YAAY,CAAC;YAE5C,qFAAqF;YACrF,MAAM,UAAU,GAAG,IAAI,CAAC,0BAA0B,CAAC,YAAY,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;YAEpF,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAClD,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,YAAY,EAAE,kBAAkB,CAAC,YAAY,CAAC,CAChF,CAAC;YAEF,sFAAsF;YACtF,MAAM,WAAW,GAAG,IAAI,CAAC,0BAA0B,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YAEtF,wCAAwC;YACxC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,UAAU,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;oBAC3B,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;wBAC1B,KAAK,EAAE,KAAK;wBACZ,iBAAiB,EAAE,SAAS;wBAC5B,kBAAkB,EAAE,UAAU;qBAC/B,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;YACL,CAAC;YAED,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;gBAC1B,KAAK,EAAE,WAAW;gBAClB,iBAAiB,EAAE,uBAAuB;gBAC1C,kBAAkB,EAAE,WAAW;aAChC,CAAC,CAAC;YAEH,yCAAyC;YACzC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3B,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;oBAC5B,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;wBAC1B,KAAK,EAAE,KAAK;wBACZ,iBAAiB,EAAE,SAAS;wBAC5B,kBAAkB,EAAE,WAAW;qBAChC,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,kEAAkE;QAClE,qEAAqE;QACrE,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACtB,cAAc,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC;YACnC,cAAc,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;gBAC/B,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;oBAC1B,KAAK,EAAE,KAAK;oBACZ,iBAAiB,EAAE,SAAS;oBAC5B,kBAAkB,EAAE,SAAS;iBAC9B,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;OAOG;IACK,0BAA0B,CAChC,YAAmB,EACnB,SAA8C,EAC9C,aAA+B;QAE/B,sCAAsC;QACtC,IAAI,UAAoB,CAAC;QACzB,IAAI,CAAC;YACH,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;QACjD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,+EAA+E;YAC/E,MAAM,IAAI,KAAK,CACb,qGAAqG;gBACnG,wHAAwH;gBACxH,wEAAwE,KAAK,EAAE,CAClF,CAAC;QACJ,CAAC;QAED,mDAAmD;QACnD,IAAI,kBAAqC,CAAC;QAC1C,IACE,SAAS;YACT,SAAS,CAAC,SAAS;YACnB,OAAO,SAAS,CAAC,SAAS,KAAK,QAAQ;YACtC,SAAS,CAAC,SAAiB,CAAC,SAAS;YACrC,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB;YACzD,KAAK,CAAC,OAAO,CAAE,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB,CAAC,EACxE,CAAC;YACD,kBAAkB,GAAI,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB,CAAC;QACjF,CAAC;QAED,IAAI,CAAC,kBAAkB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC;YAC9D,MAAM,IAAI,KAAK,CACb,4FAA4F;gBAC1F,wHAAwH;gBACxH,sDAAsD,CACzD,CAAC;QACJ,CAAC;QAED,MAAM,gBAAgB,GAAa,EAAE,CAAC;QAEtC,yDAAyD;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtE,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAEhC,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBACnD,SAAS;YACX,CAAC;YAED,IAAI,CAAC;gBACH,mEAAmE;gBACnE,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;gBAEtD,yEAAyE;gBACzE,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAC9C,SAAS,EACT,WAAW,CAAC,IAAI,EAChB,SAAS,EACT,aAAa,CACd,CAAC;gBAEF,IAAI,SAAS,EAAE,CAAC;oBACd,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,2GAA2G;gBAC3G,iFAAiF;gBACjF,MAAM,IAAI,KAAK,CACb,4FAA4F;oBAC1F,mFAAmF;oBACnF,+EAA+E;oBAC/E,wEAAwE,KAAK,EAAE,CAClF,CAAC;YACJ,CAAC;QACH,CAAC;QAED,gEAAgE;QAChE,MAAM,cAAc,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAChG,OAAO,cAAc,CAAC;IACxB,CAAC;IAED;;;OAGG;IACK,iBAAiB,CAAC,SAAmC;QAC3D,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,qEAAqE,CAAC,CAAC;QACzF,CAAC;QAED,mFAAmF;QACnF,IAAI,OAA0B,CAAC;QAE/B,IACE,SAAS,CAAC,SAAS;YACnB,OAAO,SAAS,CAAC,SAAS,KAAK,QAAQ;YACtC,SAAS,CAAC,SAAiB,CAAC,SAAS;YACtC,OAAQ,SAAS,CAAC,SAAiB,CAAC,SAAS,KAAK,QAAQ;YACzD,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,OAAO;YAC9C,KAAK,CAAC,OAAO,CAAE,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,OAAO,CAAC,EAC7D,CAAC;YACD,OAAO,GAAI,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,OAAO,CAAC;QAC3D,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC,CAAC;QACpF,CAAC;QAED,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YAClC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC9B,OAAO,KAAK,CAAC;YACf,CAAC;YACD,iCAAiC;YACjC,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBACvC,MAAM,SAAS,GACZ,KAAa,CAAC,SAAS,IAAK,KAAa,CAAC,KAAK,IAAK,KAAa,CAAC,SAAS,CAAC;gBAC/E,IAAI,SAAS,EAAE,CAAC;oBACd,OAAO,SAAS,CAAC;gBACnB,CAAC;YACH,CAAC;YACD,MAAM,IAAI,KAAK,CACb,uCAAuC,KAAK,GAAG,CAAC,0CAA0C,CAC3F,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACK,gBAAgB,CAAC,SAA8C,EAAE,KAAa;QACpF,wEAAwE;QACxE,IAAI,kBAAqC,CAAC;QAE1C,IAAI,SAAS,EAAE,CAAC;YACd,cAAc;YACd,IAAI,SAAS,CAAC,kBAAkB,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;gBAChF,kBAAkB,GAAG,SAAS,CAAC,kBAAkB,CAAC;YACpD,CAAC;YACD,gEAAgE;iBAC3D,IACH,SAAS,CAAC,SAAS;gBACnB,OAAO,SAAS,CAAC,SAAS,KAAK,QAAQ;gBACtC,SAAS,CAAC,SAAiB,CAAC,SAAS;gBACrC,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB;gBACzD,KAAK,CAAC,OAAO,CAAE,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB,CAAC,EACxE,CAAC;gBACD,kBAAkB,GAAI,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB,CAAC;YACjF,CAAC;QACH,CAAC;QAED,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;QAC3E,CAAC;QAED,IAAI,KAAK,IAAI,kBAAkB,CAAC,MAAM,EAAE,CAAC;YACvC,MAAM,IAAI,KAAK,CACb,4DAA4D,KAAK,GAAG,CAAC,qBAAqB,kBAAkB,CAAC,MAAM,EAAE,CACtH,CAAC;QACJ,CAAC;QAED,MAAM,UAAU,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAE7C,mDAAmD;QACnD,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE,CAAC;YACnC,gEAAgE;YAChE,OAAO,UAAU,CAAC;QACpB,CAAC;QAED,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE,CAAC;YACjD,iEAAiE;YACjE,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;gBAC1B,OAAO,UAAU,CAAC,UAAU,CAAC;YAC/B,CAAC;YACD,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC;gBACpB,OAAO,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,uBAAuB;YACpE,CAAC;YACD,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;gBACrB,OAAO,UAAU,CAAC,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,MAAM,IAAI,KAAK,CACb,8BAA8B,KAAK,GAAG,CAAC,+CAA+C,CACvF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,yBAAyB,CAC/B,SAAiB,EACjB,KAAU,EACV,SAAiB,EACjB,aAA+B;QAE/B,MAAM,YAAY,GAChB,SAAS,CAAC,WAAW,EAAE,KAAK,YAAY,IAAI,SAAS,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC;QAEjF,wDAAwD;QACxD,kFAAkF;QAClF,oFAAoF;QAEpF,wDAAwD;QACxD,yEAAyE;QACzE,yFAAyF;QAEzF,IAAI,QAAgB,CAAC;QAErB,IAAI,aAAa,KAAK,MAAM,EAAE,CAAC;YAC7B,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,QAAQ;YACR,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACxC,CAAC;QAED,qCAAqC;QACrC,MAAM,cAAc,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAErD,mDAAmD;QACnD,MAAM,SAAS,GAAG,GAAG,SAAS,IAAI,QAAQ,IAAI,cAAc,EAAE,CAAC;QAC/D,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,KAAU;QAClC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAC1C,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,SAAS,GAAG,OAAO,KAAK,CAAC;QAE/B,QAAQ,SAAS,EAAE,CAAC;YAClB,KAAK,QAAQ;gBACX,0CAA0C;gBAC1C,OAAO,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC;YACrD,KAAK,QAAQ,CAAC;YACd,KAAK,QAAQ;gBACX,OAAO,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC1B,KAAK,SAAS;gBACZ,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;YAClC;gBACE,iDAAiD;gBACjD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;oBAC9B,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC;gBAC1D,CAAC;gBACD,OAAO,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC;QACvD,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,6BAA6B,CAAC,SAAiB,EAAE,SAAiB;QACxE,2EAA2E;QAC3E,IAAI,SAAS,KAAK,EAAE,IAAI,SAAS,KAAK,EAAE;YAAE,OAAO,CAAC,CAAC;QACnD,IAAI,SAAS,KAAK,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY;QAC7C,IAAI,SAAS,KAAK,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC,YAAY;QAE5C,iEAAiE;QACjE,OAAO,SAAS,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;IAC5C,CAAC;IAEO,oBAAoB,CAAC,kBAA0B,EAAE,kBAA0B;QACjF,8FAA8F;QAC9F,2EAA2E;QAC3E,OAAO,IAAI,CAAC,6BAA6B,CAAC,kBAAkB,EAAE,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACzF,CAAC;IAEO,mBAAmB,CAAC,kBAA0B,EAAE,kBAA0B;QAChF,8FAA8F;QAC9F,0EAA0E;QAC1E,OAAO,IAAI,CAAC,6BAA6B,CAAC,kBAAkB,EAAE,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACzF,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport type { PartitionKeyRange } from \"../../index.js\";\nimport type {\n  TargetPartitionRangeStrategy,\n  PartitionRangeFilterResult,\n} from \"./TargetPartitionRangeStrategy.js\";\nimport type { PartitionRangeWithContinuationToken } from \"./TargetPartitionRangeManager.js\";\n\n/**\n * Strategy for filtering partition ranges in ORDER BY query execution context\n * Supports resuming from continuation tokens with proper range-token pair management\n * @hidden\n */\nexport class OrderByQueryRangeStrategy implements TargetPartitionRangeStrategy {\n  getStrategyType(): string {\n    return \"OrderByQuery\";\n  }\n\n  filterPartitionRanges(\n    targetRanges: PartitionKeyRange[],\n    continuationRanges?: PartitionRangeWithContinuationToken[],\n    queryInfo?: Record<string, unknown>,\n  ): PartitionRangeFilterResult {\n    if (\n      !targetRanges ||\n      targetRanges.length === 0 ||\n      !continuationRanges ||\n      continuationRanges.length === 0\n    ) {\n      return {\n        rangeTokenPairs: [],\n      };\n    }\n\n    if (\n      !queryInfo?.orderByItems ||\n      !Array.isArray(queryInfo.orderByItems) ||\n      queryInfo.orderByItems.length === 0\n    ) {\n      throw new Error(\n        \"Unable to resume ORDER BY query from continuation token. orderByItems is required for ORDER BY queries.\",\n      );\n    }\n\n    const result: PartitionRangeFilterResult = {\n      rangeTokenPairs: [],\n    };\n    let filteredRanges: PartitionKeyRange[] = [];\n    let resumeRangeFound = false;\n\n    if (continuationRanges && continuationRanges.length > 0) {\n      resumeRangeFound = true;\n      // Find the range to resume from based on the composite token\n      const targetRangeMapping = continuationRanges[continuationRanges.length - 1].range;\n      // It is assumed that range mapping array is going to contain only range\n      const targetRange: PartitionKeyRange = targetRangeMapping;\n\n      const targetContinuationToken =\n        continuationRanges[continuationRanges.length - 1].continuationToken;\n\n      const leftRanges = targetRanges.filter((mapping) =>\n        this.isRangeBeforeAnother(mapping.maxExclusive, targetRangeMapping.minInclusive),\n      );\n\n      const orderByItems = queryInfo.orderByItems;\n\n      // Create filtering condition for left ranges based on ORDER BY items and sort orders\n      const leftFilter = this.createRangeFilterCondition(orderByItems, queryInfo, \"left\");\n\n      const rightRanges = targetRanges.filter((mapping) =>\n        this.isRangeAfterAnother(mapping.minInclusive, targetRangeMapping.maxExclusive),\n      );\n\n      // Create filtering condition for right ranges based on ORDER BY items and sort orders\n      const rightFilter = this.createRangeFilterCondition(orderByItems, queryInfo, \"right\");\n\n      // Apply filtering logic for left ranges\n      if (leftRanges.length > 0) {\n        leftRanges.forEach((range) => {\n          result.rangeTokenPairs.push({\n            range: range,\n            continuationToken: undefined,\n            filteringCondition: leftFilter,\n          });\n        });\n      }\n\n      result.rangeTokenPairs.push({\n        range: targetRange,\n        continuationToken: targetContinuationToken,\n        filteringCondition: rightFilter,\n      });\n\n      // Apply filtering logic for right ranges\n      if (rightRanges.length > 0) {\n        rightRanges.forEach((range) => {\n          result.rangeTokenPairs.push({\n            range: range,\n            continuationToken: undefined,\n            filteringCondition: rightFilter,\n          });\n        });\n      }\n    }\n\n    // If we couldn't find a specific resume point, include all ranges\n    // This can happen with certain types of ORDER BY continuation tokens\n    if (!resumeRangeFound) {\n      filteredRanges = [...targetRanges];\n      filteredRanges.forEach((range) => {\n        result.rangeTokenPairs.push({\n          range: range,\n          continuationToken: undefined,\n          filteringCondition: undefined,\n        });\n      });\n    }\n    return result;\n  }\n\n  /**\n   * Creates a filter condition for ranges based on ORDER BY items and sort orders\n   * This filter ensures that ranges only return documents based on their position relative to the continuation point\n   * @param orderByItems - Array of order by items from the continuation token\n   * @param queryInfo - Query information containing sort orders and other metadata\n   * @param rangePosition - Whether this is for \"left\" or \"right\" ranges relative to continuation point\n   * @returns SQL filter condition string for the specified range position\n   */\n  private createRangeFilterCondition(\n    orderByItems: any[],\n    queryInfo: Record<string, unknown> | undefined,\n    rangePosition: \"left\" | \"right\",\n  ): string {\n    // Extract sort orders from query info\n    let sortOrders: string[];\n    try {\n      sortOrders = this.extractSortOrders(queryInfo);\n    } catch (error) {\n      // If we can't extract sort orders, we cannot create reliable filter conditions\n      throw new Error(\n        `Unable to resume ORDER BY query from continuation token. The ORDER BY sort direction configuration ` +\n          `in the query plan is invalid or missing. This may indicate a client version mismatch or corrupted continuation token. ` +\n          `Please retry the query without a continuation token. Original error: ${error}`,\n      );\n    }\n\n    // Extract orderByExpressions from nested structure\n    let orderByExpressions: any[] | undefined;\n    if (\n      queryInfo &&\n      queryInfo.queryInfo &&\n      typeof queryInfo.queryInfo === \"object\" &&\n      (queryInfo.queryInfo as any).queryInfo &&\n      (queryInfo.queryInfo as any).queryInfo.orderByExpressions &&\n      Array.isArray((queryInfo.queryInfo as any).queryInfo.orderByExpressions)\n    ) {\n      orderByExpressions = (queryInfo.queryInfo as any).queryInfo.orderByExpressions;\n    }\n\n    if (!orderByExpressions || !Array.isArray(orderByExpressions)) {\n      throw new Error(\n        \"Unable to resume ORDER BY query from continuation token. The ORDER BY field configuration \" +\n          \"in the query plan is invalid or missing. This may indicate a client version mismatch or corrupted continuation token. \" +\n          \"Please retry the query without a continuation token.\",\n      );\n    }\n\n    const filterConditions: string[] = [];\n\n    // Process each order by item to create filter conditions\n    for (let i = 0; i < orderByItems.length && i < sortOrders.length; i++) {\n      const orderByItem = orderByItems[i];\n      const sortOrder = sortOrders[i];\n\n      if (!orderByItem || orderByItem.item === undefined) {\n        continue;\n      }\n\n      try {\n        // Determine the field path from ORDER BY expressions in query plan\n        const fieldPath = this.extractFieldPath(queryInfo, i);\n\n        // Create the comparison condition based on sort order and range position\n        const condition = this.createComparisonCondition(\n          fieldPath,\n          orderByItem.item,\n          sortOrder,\n          rangePosition,\n        );\n\n        if (condition) {\n          filterConditions.push(condition);\n        }\n      } catch (error) {\n        // If we can't extract field path for ORDER BY expressions, we cannot safely resume from continuation token\n        // This would lead to incorrect query results, so we must fail the entire request\n        throw new Error(\n          `Unable to resume ORDER BY query from continuation token. The ORDER BY field configuration ` +\n            `in the query plan is invalid or incompatible with the continuation token format. ` +\n            `This may indicate a client version mismatch or corrupted continuation token. ` +\n            `Please retry the query without a continuation token. Original error: ${error}`,\n        );\n      }\n    }\n\n    // Combine multiple conditions with AND for multi-field ORDER BY\n    const combinedFilter = filterConditions.length > 0 ? `(${filterConditions.join(\" AND \")})` : \"\";\n    return combinedFilter;\n  }\n\n  /**\n   * Extracts sort orders from query info\n   * @throws Error if sort order information is missing or invalid\n   */\n  private extractSortOrders(queryInfo?: Record<string, unknown>): string[] {\n    if (!queryInfo) {\n      throw new Error(\"Query information is required to determine ORDER BY sort directions\");\n    }\n\n    // Extract orderBy from the nested structure: queryInfo.queryInfo.queryInfo.orderBy\n    let orderBy: any[] | undefined;\n\n    if (\n      queryInfo.queryInfo &&\n      typeof queryInfo.queryInfo === \"object\" &&\n      (queryInfo.queryInfo as any).queryInfo &&\n      typeof (queryInfo.queryInfo as any).queryInfo === \"object\" &&\n      (queryInfo.queryInfo as any).queryInfo.orderBy &&\n      Array.isArray((queryInfo.queryInfo as any).queryInfo.orderBy)\n    ) {\n      orderBy = (queryInfo.queryInfo as any).queryInfo.orderBy;\n    }\n\n    if (!orderBy) {\n      throw new Error(\"ORDER BY sort direction information is missing from query plan\");\n    }\n\n    return orderBy.map((order, index) => {\n      if (typeof order === \"string\") {\n        return order;\n      }\n      // Handle object format if needed\n      if (order && typeof order === \"object\") {\n        const sortOrder =\n          (order as any).direction || (order as any).order || (order as any).sortOrder;\n        if (sortOrder) {\n          return sortOrder;\n        }\n      }\n      throw new Error(\n        `ORDER BY sort direction at position ${index + 1} has an invalid format in the query plan`,\n      );\n    });\n  }\n\n  /**\n   * Extracts field path from ORDER BY expressions in query plan\n   * @throws Error if orderByExpressions are not found or index is out of bounds or expression format is invalid\n   */\n  private extractFieldPath(queryInfo: Record<string, unknown> | undefined, index: number): string {\n    // Try multiple paths to find orderByExpressions due to nested structure\n    let orderByExpressions: any[] | undefined;\n\n    if (queryInfo) {\n      // Direct path\n      if (queryInfo.orderByExpressions && Array.isArray(queryInfo.orderByExpressions)) {\n        orderByExpressions = queryInfo.orderByExpressions;\n      }\n      // Nested path: queryInfo.queryInfo.queryInfo.orderByExpressions\n      else if (\n        queryInfo.queryInfo &&\n        typeof queryInfo.queryInfo === \"object\" &&\n        (queryInfo.queryInfo as any).queryInfo &&\n        (queryInfo.queryInfo as any).queryInfo.orderByExpressions &&\n        Array.isArray((queryInfo.queryInfo as any).queryInfo.orderByExpressions)\n      ) {\n        orderByExpressions = (queryInfo.queryInfo as any).queryInfo.orderByExpressions;\n      }\n    }\n\n    if (!orderByExpressions) {\n      throw new Error(\"ORDER BY field information is missing from query plan\");\n    }\n\n    if (index >= orderByExpressions.length) {\n      throw new Error(\n        `ORDER BY field configuration mismatch: expected at least ${index + 1} fields but found ${orderByExpressions.length}`,\n      );\n    }\n\n    const expression = orderByExpressions[index];\n\n    // Handle different formats of ORDER BY expressions\n    if (typeof expression === \"string\") {\n      // Simple string expression like \"c.id\" or \"_FullTextScore(...)\"\n      return expression;\n    }\n\n    if (expression && typeof expression === \"object\") {\n      // Object format like { expression: \"c.id\", type: \"PropertyRef\" }\n      if (expression.expression) {\n        return expression.expression;\n      }\n      if (expression.path) {\n        return expression.path.replace(/^\\//, \"\"); // Remove leading slash\n      }\n      if (expression.field) {\n        return expression.field;\n      }\n    }\n\n    throw new Error(\n      `ORDER BY field at position ${index + 1} has an unrecognized format in the query plan`,\n    );\n  }\n\n  /**\n   * Creates a comparison condition based on the field, value, sort order, and range position\n   */\n  private createComparisonCondition(\n    fieldPath: string,\n    value: any,\n    sortOrder: string,\n    rangePosition: \"left\" | \"right\",\n  ): string {\n    const isDescending =\n      sortOrder.toLowerCase() === \"descending\" || sortOrder.toLowerCase() === \"desc\";\n\n    // For left ranges (ranges that come before the target):\n    // - In ascending order: field > value (left ranges should seek for larger values)\n    // - In descending order: field < value (left ranges should seek for smaller values)\n\n    // For right ranges (ranges that come after the target):\n    // - In ascending order: field >= value (right ranges have larger values)\n    // - In descending order: field <= value (right ranges have smaller values in desc order)\n\n    let operator: string;\n\n    if (rangePosition === \"left\") {\n      operator = isDescending ? \"<\" : \">\";\n    } else {\n      // right\n      operator = isDescending ? \"<=\" : \">=\";\n    }\n\n    // Format the value based on its type\n    const formattedValue = this.formatValueForSQL(value);\n\n    // Create the condition with proper field reference\n    const condition = `${fieldPath} ${operator} ${formattedValue}`;\n    return condition;\n  }\n\n  /**\n   * Formats a value for use in SQL condition\n   */\n  private formatValueForSQL(value: any): string {\n    if (value === null || value === undefined) {\n      return \"null\";\n    }\n\n    const valueType = typeof value;\n\n    switch (valueType) {\n      case \"string\":\n        // Escape single quotes and wrap in quotes\n        return `'${value.toString().replace(/'/g, \"''\")}'`;\n      case \"number\":\n      case \"bigint\":\n        return value.toString();\n      case \"boolean\":\n        return value ? \"true\" : \"false\";\n      default:\n        // For objects and arrays, convert to JSON string\n        if (typeof value === \"object\") {\n          return `'${JSON.stringify(value).replace(/'/g, \"''\")}'`;\n        }\n        return `'${value.toString().replace(/'/g, \"''\")}'`;\n    }\n  }\n\n  /**\n   * Compares partition key range boundaries with proper handling for inclusive/exclusive semantics\n   * @param boundary1 - First boundary to compare\n   * @param boundary2 - Second boundary to compare\n   * @returns negative if boundary1 is less than boundary2, positive if boundary1 is greater than boundary2, 0 if equal\n   */\n  private comparePartitionKeyBoundaries(boundary1: string, boundary2: string): number {\n    // Handle empty string cases (empty string represents the minimum boundary)\n    if (boundary1 === \"\" && boundary2 === \"\") return 0;\n    if (boundary1 === \"\") return -1; // \"\" < \"AA\"\n    if (boundary2 === \"\") return 1; // \"AA\" > \"\"\n\n    // Use standard lexicographic comparison for non-empty boundaries\n    return boundary1.localeCompare(boundary2);\n  }\n\n  private isRangeBeforeAnother(range1MaxExclusive: string, range2MinInclusive: string): boolean {\n    // Since range1.maxExclusive is NOT part of range1, and range2.minInclusive IS part of range2,\n    // range1 comes before range2 if range1.maxExclusive <= range2.minInclusive\n    return this.comparePartitionKeyBoundaries(range1MaxExclusive, range2MinInclusive) <= 0;\n  }\n\n  private isRangeAfterAnother(range1MinInclusive: string, range2MaxExclusive: string): boolean {\n    // Since range2.maxExclusive is NOT part of range2, and range1.minInclusive IS part of range1,\n    // range1 comes after range2 if range1.minInclusive >= range2.maxExclusive\n    return this.comparePartitionKeyBoundaries(range1MinInclusive, range2MaxExclusive) >= 0;\n  }\n}\n"]}
+{"version":3,"file":"OrderByQueryRangeStrategy.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/queryFilteringStrategy/OrderByQueryRangeStrategy.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AASlC;;;;GAIG;AACH,MAAM,OAAO,yBAAyB;IACpC,eAAe;QACb,OAAO,cAAc,CAAC;IACxB,CAAC;IAED,qBAAqB,CACnB,YAAiC,EACjC,kBAA0D,EAC1D,SAAmC;QAEnC,IACE,CAAC,YAAY;YACb,YAAY,CAAC,MAAM,KAAK,CAAC;YACzB,CAAC,kBAAkB;YACnB,kBAAkB,CAAC,MAAM,KAAK,CAAC,EAC/B,CAAC;YACD,OAAO;gBACL,eAAe,EAAE,EAAE;aACpB,CAAC;QACJ,CAAC;QAED,IACE,CAAC,SAAS,EAAE,YAAY;YACxB,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,YAAY,CAAC;YACtC,SAAS,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;YACD,MAAM,IAAI,KAAK,CACb,yGAAyG,CAC1G,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAA+B;YACzC,eAAe,EAAE,EAAE;SACpB,CAAC;QACF,IAAI,cAAc,GAAwB,EAAE,CAAC;QAC7C,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAE7B,IAAI,kBAAkB,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,gBAAgB,GAAG,IAAI,CAAC;YACxB,6DAA6D;YAC7D,MAAM,kBAAkB,GAAG,kBAAkB,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;YACnF,wEAAwE;YACxE,MAAM,WAAW,GAAsB,kBAAkB,CAAC;YAE1D,MAAM,uBAAuB,GAC3B,kBAAkB,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC;YAEtE,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CACjD,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,YAAY,EAAE,kBAAkB,CAAC,YAAY,CAAC,CACjF,CAAC;YAEF,MAAM,YAAY,GAAG,SAAS,CAAC,YAAY,CAAC;YAE5C,qFAAqF;YACrF,MAAM,UAAU,GAAG,IAAI,CAAC,0BAA0B,CAAC,YAAY,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;YAEpF,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAClD,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,YAAY,EAAE,kBAAkB,CAAC,YAAY,CAAC,CAChF,CAAC;YAEF,sFAAsF;YACtF,MAAM,WAAW,GAAG,IAAI,CAAC,0BAA0B,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YAEtF,wCAAwC;YACxC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,UAAU,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;oBAC3B,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;wBAC1B,KAAK,EAAE,KAAK;wBACZ,iBAAiB,EAAE,SAAS;wBAC5B,kBAAkB,EAAE,UAAU;qBAC/B,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;YACL,CAAC;YAED,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;gBAC1B,KAAK,EAAE,WAAW;gBAClB,iBAAiB,EAAE,uBAAuB;gBAC1C,kBAAkB,EAAE,WAAW;aAChC,CAAC,CAAC;YAEH,yCAAyC;YACzC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3B,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;oBAC5B,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;wBAC1B,KAAK,EAAE,KAAK;wBACZ,iBAAiB,EAAE,SAAS;wBAC5B,kBAAkB,EAAE,WAAW;qBAChC,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,kEAAkE;QAClE,qEAAqE;QACrE,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACtB,cAAc,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC;YACnC,cAAc,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;gBAC/B,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;oBAC1B,KAAK,EAAE,KAAK;oBACZ,iBAAiB,EAAE,SAAS;oBAC5B,kBAAkB,EAAE,SAAS;iBAC9B,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;OAOG;IACK,0BAA0B,CAChC,YAAmB,EACnB,SAA8C,EAC9C,aAA+B;QAE/B,sCAAsC;QACtC,IAAI,UAAoB,CAAC;QACzB,IAAI,CAAC;YACH,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;QACjD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,+EAA+E;YAC/E,MAAM,IAAI,KAAK,CACb,qGAAqG;gBACnG,wHAAwH;gBACxH,wEAAwE,KAAK,EAAE,CAClF,CAAC;QACJ,CAAC;QAED,mDAAmD;QACnD,IAAI,kBAAqC,CAAC;QAC1C,IACE,SAAS;YACT,SAAS,CAAC,SAAS;YACnB,OAAO,SAAS,CAAC,SAAS,KAAK,QAAQ;YACtC,SAAS,CAAC,SAAiB,CAAC,SAAS;YACrC,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB;YACzD,KAAK,CAAC,OAAO,CAAE,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB,CAAC,EACxE,CAAC;YACD,kBAAkB,GAAI,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB,CAAC;QACjF,CAAC;QAED,IAAI,CAAC,kBAAkB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC;YAC9D,MAAM,IAAI,KAAK,CACb,4FAA4F;gBAC1F,wHAAwH;gBACxH,sDAAsD,CACzD,CAAC;QACJ,CAAC;QAED,MAAM,gBAAgB,GAAa,EAAE,CAAC;QAEtC,yDAAyD;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtE,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAEhC,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBACnD,SAAS;YACX,CAAC;YAED,IAAI,CAAC;gBACH,mEAAmE;gBACnE,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;gBAEtD,yEAAyE;gBACzE,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAC9C,SAAS,EACT,WAAW,CAAC,IAAI,EAChB,SAAS,EACT,aAAa,CACd,CAAC;gBAEF,IAAI,SAAS,EAAE,CAAC;oBACd,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,2GAA2G;gBAC3G,iFAAiF;gBACjF,MAAM,IAAI,KAAK,CACb,4FAA4F;oBAC1F,mFAAmF;oBACnF,+EAA+E;oBAC/E,wEAAwE,KAAK,EAAE,CAClF,CAAC;YACJ,CAAC;QACH,CAAC;QAED,gEAAgE;QAChE,MAAM,cAAc,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAChG,OAAO,cAAc,CAAC;IACxB,CAAC;IAED;;;OAGG;IACK,iBAAiB,CAAC,SAAmC;QAC3D,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,qEAAqE,CAAC,CAAC;QACzF,CAAC;QAED,mFAAmF;QACnF,IAAI,OAA0B,CAAC;QAE/B,IACE,SAAS,CAAC,SAAS;YACnB,OAAO,SAAS,CAAC,SAAS,KAAK,QAAQ;YACtC,SAAS,CAAC,SAAiB,CAAC,SAAS;YACtC,OAAQ,SAAS,CAAC,SAAiB,CAAC,SAAS,KAAK,QAAQ;YACzD,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,OAAO;YAC9C,KAAK,CAAC,OAAO,CAAE,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,OAAO,CAAC,EAC7D,CAAC;YACD,OAAO,GAAI,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,OAAO,CAAC;QAC3D,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC,CAAC;QACpF,CAAC;QAED,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YAClC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC9B,OAAO,KAAK,CAAC;YACf,CAAC;YACD,iCAAiC;YACjC,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBACvC,MAAM,SAAS,GACZ,KAAa,CAAC,SAAS,IAAK,KAAa,CAAC,KAAK,IAAK,KAAa,CAAC,SAAS,CAAC;gBAC/E,IAAI,SAAS,EAAE,CAAC;oBACd,OAAO,SAAS,CAAC;gBACnB,CAAC;YACH,CAAC;YACD,MAAM,IAAI,KAAK,CACb,uCAAuC,KAAK,GAAG,CAAC,0CAA0C,CAC3F,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACK,gBAAgB,CAAC,SAA8C,EAAE,KAAa;QACpF,wEAAwE;QACxE,IAAI,kBAAqC,CAAC;QAE1C,IAAI,SAAS,EAAE,CAAC;YACd,cAAc;YACd,IAAI,SAAS,CAAC,kBAAkB,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;gBAChF,kBAAkB,GAAG,SAAS,CAAC,kBAAkB,CAAC;YACpD,CAAC;YACD,gEAAgE;iBAC3D,IACH,SAAS,CAAC,SAAS;gBACnB,OAAO,SAAS,CAAC,SAAS,KAAK,QAAQ;gBACtC,SAAS,CAAC,SAAiB,CAAC,SAAS;gBACrC,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB;gBACzD,KAAK,CAAC,OAAO,CAAE,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB,CAAC,EACxE,CAAC;gBACD,kBAAkB,GAAI,SAAS,CAAC,SAAiB,CAAC,SAAS,CAAC,kBAAkB,CAAC;YACjF,CAAC;QACH,CAAC;QAED,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;QAC3E,CAAC;QAED,IAAI,KAAK,IAAI,kBAAkB,CAAC,MAAM,EAAE,CAAC;YACvC,MAAM,IAAI,KAAK,CACb,4DAA4D,KAAK,GAAG,CAAC,qBAAqB,kBAAkB,CAAC,MAAM,EAAE,CACtH,CAAC;QACJ,CAAC;QAED,MAAM,UAAU,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAE7C,mDAAmD;QACnD,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE,CAAC;YACnC,gEAAgE;YAChE,OAAO,UAAU,CAAC;QACpB,CAAC;QAED,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE,CAAC;YACjD,iEAAiE;YACjE,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;gBAC1B,OAAO,UAAU,CAAC,UAAU,CAAC;YAC/B,CAAC;YACD,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC;gBACpB,OAAO,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,uBAAuB;YACpE,CAAC;YACD,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;gBACrB,OAAO,UAAU,CAAC,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,MAAM,IAAI,KAAK,CACb,8BAA8B,KAAK,GAAG,CAAC,+CAA+C,CACvF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,yBAAyB,CAC/B,SAAiB,EACjB,KAAU,EACV,SAAiB,EACjB,aAA+B;QAE/B,MAAM,YAAY,GAChB,SAAS,CAAC,WAAW,EAAE,KAAK,YAAY,IAAI,SAAS,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC;QAEjF,wDAAwD;QACxD,kFAAkF;QAClF,oFAAoF;QAEpF,wDAAwD;QACxD,yEAAyE;QACzE,yFAAyF;QAEzF,IAAI,QAAgB,CAAC;QAErB,IAAI,aAAa,KAAK,MAAM,EAAE,CAAC;YAC7B,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,QAAQ;YACR,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACxC,CAAC;QAED,qCAAqC;QACrC,MAAM,cAAc,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAErD,mDAAmD;QACnD,MAAM,SAAS,GAAG,GAAG,SAAS,IAAI,QAAQ,IAAI,cAAc,EAAE,CAAC;QAC/D,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACK,iBAAiB,CAAC,KAAU;QAClC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAC1C,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,SAAS,GAAG,OAAO,KAAK,CAAC;QAE/B,QAAQ,SAAS,EAAE,CAAC;YAClB,KAAK,QAAQ;gBACX,iEAAiE;gBACjE,OAAO,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC;YACjF,KAAK,QAAQ,CAAC;YACd,KAAK,QAAQ;gBACX,OAAO,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC1B,KAAK,SAAS;gBACZ,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;YAClC;gBACE,iDAAiD;gBACjD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;oBAC9B,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC;gBACtF,CAAC;gBACD,OAAO,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC;QACnF,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,6BAA6B,CAAC,SAAiB,EAAE,SAAiB;QACxE,2EAA2E;QAC3E,IAAI,SAAS,KAAK,EAAE,IAAI,SAAS,KAAK,EAAE;YAAE,OAAO,CAAC,CAAC;QACnD,IAAI,SAAS,KAAK,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY;QAC7C,IAAI,SAAS,KAAK,EAAE;YAAE,OAAO,CAAC,CAAC,CAAC,YAAY;QAE5C,iEAAiE;QACjE,OAAO,SAAS,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;IAC5C,CAAC;IAEO,oBAAoB,CAAC,kBAA0B,EAAE,kBAA0B;QACjF,8FAA8F;QAC9F,2EAA2E;QAC3E,OAAO,IAAI,CAAC,6BAA6B,CAAC,kBAAkB,EAAE,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACzF,CAAC;IAEO,mBAAmB,CAAC,kBAA0B,EAAE,kBAA0B;QAChF,8FAA8F;QAC9F,0EAA0E;QAC1E,OAAO,IAAI,CAAC,6BAA6B,CAAC,kBAAkB,EAAE,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACzF,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport type { PartitionKeyRange } from \"../../index.js\";\nimport type {\n  TargetPartitionRangeStrategy,\n  PartitionRangeFilterResult,\n} from \"./TargetPartitionRangeStrategy.js\";\nimport type { PartitionRangeWithContinuationToken } from \"./TargetPartitionRangeManager.js\";\n\n/**\n * Strategy for filtering partition ranges in ORDER BY query execution context\n * Supports resuming from continuation tokens with proper range-token pair management\n * @hidden\n */\nexport class OrderByQueryRangeStrategy implements TargetPartitionRangeStrategy {\n  getStrategyType(): string {\n    return \"OrderByQuery\";\n  }\n\n  filterPartitionRanges(\n    targetRanges: PartitionKeyRange[],\n    continuationRanges?: PartitionRangeWithContinuationToken[],\n    queryInfo?: Record<string, unknown>,\n  ): PartitionRangeFilterResult {\n    if (\n      !targetRanges ||\n      targetRanges.length === 0 ||\n      !continuationRanges ||\n      continuationRanges.length === 0\n    ) {\n      return {\n        rangeTokenPairs: [],\n      };\n    }\n\n    if (\n      !queryInfo?.orderByItems ||\n      !Array.isArray(queryInfo.orderByItems) ||\n      queryInfo.orderByItems.length === 0\n    ) {\n      throw new Error(\n        \"Unable to resume ORDER BY query from continuation token. orderByItems is required for ORDER BY queries.\",\n      );\n    }\n\n    const result: PartitionRangeFilterResult = {\n      rangeTokenPairs: [],\n    };\n    let filteredRanges: PartitionKeyRange[] = [];\n    let resumeRangeFound = false;\n\n    if (continuationRanges && continuationRanges.length > 0) {\n      resumeRangeFound = true;\n      // Find the range to resume from based on the composite token\n      const targetRangeMapping = continuationRanges[continuationRanges.length - 1].range;\n      // It is assumed that range mapping array is going to contain only range\n      const targetRange: PartitionKeyRange = targetRangeMapping;\n\n      const targetContinuationToken =\n        continuationRanges[continuationRanges.length - 1].continuationToken;\n\n      const leftRanges = targetRanges.filter((mapping) =>\n        this.isRangeBeforeAnother(mapping.maxExclusive, targetRangeMapping.minInclusive),\n      );\n\n      const orderByItems = queryInfo.orderByItems;\n\n      // Create filtering condition for left ranges based on ORDER BY items and sort orders\n      const leftFilter = this.createRangeFilterCondition(orderByItems, queryInfo, \"left\");\n\n      const rightRanges = targetRanges.filter((mapping) =>\n        this.isRangeAfterAnother(mapping.minInclusive, targetRangeMapping.maxExclusive),\n      );\n\n      // Create filtering condition for right ranges based on ORDER BY items and sort orders\n      const rightFilter = this.createRangeFilterCondition(orderByItems, queryInfo, \"right\");\n\n      // Apply filtering logic for left ranges\n      if (leftRanges.length > 0) {\n        leftRanges.forEach((range) => {\n          result.rangeTokenPairs.push({\n            range: range,\n            continuationToken: undefined,\n            filteringCondition: leftFilter,\n          });\n        });\n      }\n\n      result.rangeTokenPairs.push({\n        range: targetRange,\n        continuationToken: targetContinuationToken,\n        filteringCondition: rightFilter,\n      });\n\n      // Apply filtering logic for right ranges\n      if (rightRanges.length > 0) {\n        rightRanges.forEach((range) => {\n          result.rangeTokenPairs.push({\n            range: range,\n            continuationToken: undefined,\n            filteringCondition: rightFilter,\n          });\n        });\n      }\n    }\n\n    // If we couldn't find a specific resume point, include all ranges\n    // This can happen with certain types of ORDER BY continuation tokens\n    if (!resumeRangeFound) {\n      filteredRanges = [...targetRanges];\n      filteredRanges.forEach((range) => {\n        result.rangeTokenPairs.push({\n          range: range,\n          continuationToken: undefined,\n          filteringCondition: undefined,\n        });\n      });\n    }\n    return result;\n  }\n\n  /**\n   * Creates a filter condition for ranges based on ORDER BY items and sort orders\n   * This filter ensures that ranges only return documents based on their position relative to the continuation point\n   * @param orderByItems - Array of order by items from the continuation token\n   * @param queryInfo - Query information containing sort orders and other metadata\n   * @param rangePosition - Whether this is for \"left\" or \"right\" ranges relative to continuation point\n   * @returns SQL filter condition string for the specified range position\n   */\n  private createRangeFilterCondition(\n    orderByItems: any[],\n    queryInfo: Record<string, unknown> | undefined,\n    rangePosition: \"left\" | \"right\",\n  ): string {\n    // Extract sort orders from query info\n    let sortOrders: string[];\n    try {\n      sortOrders = this.extractSortOrders(queryInfo);\n    } catch (error) {\n      // If we can't extract sort orders, we cannot create reliable filter conditions\n      throw new Error(\n        `Unable to resume ORDER BY query from continuation token. The ORDER BY sort direction configuration ` +\n          `in the query plan is invalid or missing. This may indicate a client version mismatch or corrupted continuation token. ` +\n          `Please retry the query without a continuation token. Original error: ${error}`,\n      );\n    }\n\n    // Extract orderByExpressions from nested structure\n    let orderByExpressions: any[] | undefined;\n    if (\n      queryInfo &&\n      queryInfo.queryInfo &&\n      typeof queryInfo.queryInfo === \"object\" &&\n      (queryInfo.queryInfo as any).queryInfo &&\n      (queryInfo.queryInfo as any).queryInfo.orderByExpressions &&\n      Array.isArray((queryInfo.queryInfo as any).queryInfo.orderByExpressions)\n    ) {\n      orderByExpressions = (queryInfo.queryInfo as any).queryInfo.orderByExpressions;\n    }\n\n    if (!orderByExpressions || !Array.isArray(orderByExpressions)) {\n      throw new Error(\n        \"Unable to resume ORDER BY query from continuation token. The ORDER BY field configuration \" +\n          \"in the query plan is invalid or missing. This may indicate a client version mismatch or corrupted continuation token. \" +\n          \"Please retry the query without a continuation token.\",\n      );\n    }\n\n    const filterConditions: string[] = [];\n\n    // Process each order by item to create filter conditions\n    for (let i = 0; i < orderByItems.length && i < sortOrders.length; i++) {\n      const orderByItem = orderByItems[i];\n      const sortOrder = sortOrders[i];\n\n      if (!orderByItem || orderByItem.item === undefined) {\n        continue;\n      }\n\n      try {\n        // Determine the field path from ORDER BY expressions in query plan\n        const fieldPath = this.extractFieldPath(queryInfo, i);\n\n        // Create the comparison condition based on sort order and range position\n        const condition = this.createComparisonCondition(\n          fieldPath,\n          orderByItem.item,\n          sortOrder,\n          rangePosition,\n        );\n\n        if (condition) {\n          filterConditions.push(condition);\n        }\n      } catch (error) {\n        // If we can't extract field path for ORDER BY expressions, we cannot safely resume from continuation token\n        // This would lead to incorrect query results, so we must fail the entire request\n        throw new Error(\n          `Unable to resume ORDER BY query from continuation token. The ORDER BY field configuration ` +\n            `in the query plan is invalid or incompatible with the continuation token format. ` +\n            `This may indicate a client version mismatch or corrupted continuation token. ` +\n            `Please retry the query without a continuation token. Original error: ${error}`,\n        );\n      }\n    }\n\n    // Combine multiple conditions with AND for multi-field ORDER BY\n    const combinedFilter = filterConditions.length > 0 ? `(${filterConditions.join(\" AND \")})` : \"\";\n    return combinedFilter;\n  }\n\n  /**\n   * Extracts sort orders from query info\n   * @throws Error if sort order information is missing or invalid\n   */\n  private extractSortOrders(queryInfo?: Record<string, unknown>): string[] {\n    if (!queryInfo) {\n      throw new Error(\"Query information is required to determine ORDER BY sort directions\");\n    }\n\n    // Extract orderBy from the nested structure: queryInfo.queryInfo.queryInfo.orderBy\n    let orderBy: any[] | undefined;\n\n    if (\n      queryInfo.queryInfo &&\n      typeof queryInfo.queryInfo === \"object\" &&\n      (queryInfo.queryInfo as any).queryInfo &&\n      typeof (queryInfo.queryInfo as any).queryInfo === \"object\" &&\n      (queryInfo.queryInfo as any).queryInfo.orderBy &&\n      Array.isArray((queryInfo.queryInfo as any).queryInfo.orderBy)\n    ) {\n      orderBy = (queryInfo.queryInfo as any).queryInfo.orderBy;\n    }\n\n    if (!orderBy) {\n      throw new Error(\"ORDER BY sort direction information is missing from query plan\");\n    }\n\n    return orderBy.map((order, index) => {\n      if (typeof order === \"string\") {\n        return order;\n      }\n      // Handle object format if needed\n      if (order && typeof order === \"object\") {\n        const sortOrder =\n          (order as any).direction || (order as any).order || (order as any).sortOrder;\n        if (sortOrder) {\n          return sortOrder;\n        }\n      }\n      throw new Error(\n        `ORDER BY sort direction at position ${index + 1} has an invalid format in the query plan`,\n      );\n    });\n  }\n\n  /**\n   * Extracts field path from ORDER BY expressions in query plan\n   * @throws Error if orderByExpressions are not found or index is out of bounds or expression format is invalid\n   */\n  private extractFieldPath(queryInfo: Record<string, unknown> | undefined, index: number): string {\n    // Try multiple paths to find orderByExpressions due to nested structure\n    let orderByExpressions: any[] | undefined;\n\n    if (queryInfo) {\n      // Direct path\n      if (queryInfo.orderByExpressions && Array.isArray(queryInfo.orderByExpressions)) {\n        orderByExpressions = queryInfo.orderByExpressions;\n      }\n      // Nested path: queryInfo.queryInfo.queryInfo.orderByExpressions\n      else if (\n        queryInfo.queryInfo &&\n        typeof queryInfo.queryInfo === \"object\" &&\n        (queryInfo.queryInfo as any).queryInfo &&\n        (queryInfo.queryInfo as any).queryInfo.orderByExpressions &&\n        Array.isArray((queryInfo.queryInfo as any).queryInfo.orderByExpressions)\n      ) {\n        orderByExpressions = (queryInfo.queryInfo as any).queryInfo.orderByExpressions;\n      }\n    }\n\n    if (!orderByExpressions) {\n      throw new Error(\"ORDER BY field information is missing from query plan\");\n    }\n\n    if (index >= orderByExpressions.length) {\n      throw new Error(\n        `ORDER BY field configuration mismatch: expected at least ${index + 1} fields but found ${orderByExpressions.length}`,\n      );\n    }\n\n    const expression = orderByExpressions[index];\n\n    // Handle different formats of ORDER BY expressions\n    if (typeof expression === \"string\") {\n      // Simple string expression like \"c.id\" or \"_FullTextScore(...)\"\n      return expression;\n    }\n\n    if (expression && typeof expression === \"object\") {\n      // Object format like { expression: \"c.id\", type: \"PropertyRef\" }\n      if (expression.expression) {\n        return expression.expression;\n      }\n      if (expression.path) {\n        return expression.path.replace(/^\\//, \"\"); // Remove leading slash\n      }\n      if (expression.field) {\n        return expression.field;\n      }\n    }\n\n    throw new Error(\n      `ORDER BY field at position ${index + 1} has an unrecognized format in the query plan`,\n    );\n  }\n\n  /**\n   * Creates a comparison condition based on the field, value, sort order, and range position\n   */\n  private createComparisonCondition(\n    fieldPath: string,\n    value: any,\n    sortOrder: string,\n    rangePosition: \"left\" | \"right\",\n  ): string {\n    const isDescending =\n      sortOrder.toLowerCase() === \"descending\" || sortOrder.toLowerCase() === \"desc\";\n\n    // For left ranges (ranges that come before the target):\n    // - In ascending order: field > value (left ranges should seek for larger values)\n    // - In descending order: field < value (left ranges should seek for smaller values)\n\n    // For right ranges (ranges that come after the target):\n    // - In ascending order: field >= value (right ranges have larger values)\n    // - In descending order: field <= value (right ranges have smaller values in desc order)\n\n    let operator: string;\n\n    if (rangePosition === \"left\") {\n      operator = isDescending ? \"<\" : \">\";\n    } else {\n      // right\n      operator = isDescending ? \"<=\" : \">=\";\n    }\n\n    // Format the value based on its type\n    const formattedValue = this.formatValueForSQL(value);\n\n    // Create the condition with proper field reference\n    const condition = `${fieldPath} ${operator} ${formattedValue}`;\n    return condition;\n  }\n\n  /**\n   * Formats a value for use in SQL condition.\n   * We escape single quotes as \\\\u0027 to avoid ambiguity with \\\\\\\\ followed by '\n   */\n  private formatValueForSQL(value: any): string {\n    if (value === null || value === undefined) {\n      return \"null\";\n    }\n\n    const valueType = typeof value;\n\n    switch (valueType) {\n      case \"string\":\n        // Escape backslashes first, then single quotes as unicode escape\n        return `'${value.toString().replace(/\\\\/g, \"\\\\\\\\\").replace(/'/g, \"\\\\u0027\")}'`;\n      case \"number\":\n      case \"bigint\":\n        return value.toString();\n      case \"boolean\":\n        return value ? \"true\" : \"false\";\n      default:\n        // For objects and arrays, convert to JSON string\n        if (typeof value === \"object\") {\n          return `'${JSON.stringify(value).replace(/\\\\/g, \"\\\\\\\\\").replace(/'/g, \"\\\\u0027\")}'`;\n        }\n        return `'${value.toString().replace(/\\\\/g, \"\\\\\\\\\").replace(/'/g, \"\\\\u0027\")}'`;\n    }\n  }\n\n  /**\n   * Compares partition key range boundaries with proper handling for inclusive/exclusive semantics\n   * @param boundary1 - First boundary to compare\n   * @param boundary2 - Second boundary to compare\n   * @returns negative if boundary1 is less than boundary2, positive if boundary1 is greater than boundary2, 0 if equal\n   */\n  private comparePartitionKeyBoundaries(boundary1: string, boundary2: string): number {\n    // Handle empty string cases (empty string represents the minimum boundary)\n    if (boundary1 === \"\" && boundary2 === \"\") return 0;\n    if (boundary1 === \"\") return -1; // \"\" < \"AA\"\n    if (boundary2 === \"\") return 1; // \"AA\" > \"\"\n\n    // Use standard lexicographic comparison for non-empty boundaries\n    return boundary1.localeCompare(boundary2);\n  }\n\n  private isRangeBeforeAnother(range1MaxExclusive: string, range2MinInclusive: string): boolean {\n    // Since range1.maxExclusive is NOT part of range1, and range2.minInclusive IS part of range2,\n    // range1 comes before range2 if range1.maxExclusive <= range2.minInclusive\n    return this.comparePartitionKeyBoundaries(range1MaxExclusive, range2MinInclusive) <= 0;\n  }\n\n  private isRangeAfterAnother(range1MinInclusive: string, range2MaxExclusive: string): boolean {\n    // Since range2.maxExclusive is NOT part of range2, and range1.minInclusive IS part of range1,\n    // range1 comes after range2 if range1.minInclusive >= range2.maxExclusive\n    return this.comparePartitionKeyBoundaries(range1MinInclusive, range2MaxExclusive) >= 0;\n  }\n}\n"]}

package/dist/browser/queryExecutionContext/queryFilteringStrategy/ParallelQueryRangeStrategy.d.ts

@@ -10,9 +10,5 @@ export declare class ParallelQueryRangeStrategy implements TargetPartitionRangeS
     getStrategyType(): string;
     validateContinuationToken(continuationToken: string): boolean;
     filterPartitionRanges(targetRanges: PartitionKeyRange[], continuationRanges?: PartitionRangeWithContinuationToken[]): PartitionRangeFilterResult;
-    /**
-     * Checks if a partition is exhausted based on its continuation token
-     */
-    private isPartitionExhausted;
 }
 //# sourceMappingURL=ParallelQueryRangeStrategy.d.ts.map

package/dist/browser/queryExecutionContext/queryFilteringStrategy/ParallelQueryRangeStrategy.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ParallelQueryRangeStrategy.d.ts","sourceRoot":"","sources":["../../../../src/queryExecutionContext/queryFilteringStrategy/ParallelQueryRangeStrategy.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,KAAK,EACV,4BAA4B,EAC5B,0BAA0B,EAC3B,MAAM,mCAAmC,CAAC;AAC3C,OAAO,KAAK,EAAE,mCAAmC,EAAE,MAAM,kCAAkC,CAAC;AAE5F;;;;GAIG;AACH,qBAAa,0BAA2B,YAAW,4BAA4B;IAC7E,eAAe,IAAI,MAAM;IAIzB,yBAAyB,CAAC,iBAAiB,EAAE,MAAM,GAAG,OAAO;IA0B7D,qBAAqB,CACnB,YAAY,EAAE,iBAAiB,EAAE,EACjC,kBAAkB,CAAC,EAAE,mCAAmC,EAAE,GACzD,0BAA0B;IAgE7B;;OAEG;IACH,OAAO,CAAC,oBAAoB;CAQ7B"}
+{"version":3,"file":"ParallelQueryRangeStrategy.d.ts","sourceRoot":"","sources":["../../../../src/queryExecutionContext/queryFilteringStrategy/ParallelQueryRangeStrategy.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,KAAK,EACV,4BAA4B,EAC5B,0BAA0B,EAC3B,MAAM,mCAAmC,CAAC;AAC3C,OAAO,KAAK,EAAE,mCAAmC,EAAE,MAAM,kCAAkC,CAAC;AAG5F;;;;GAIG;AACH,qBAAa,0BAA2B,YAAW,4BAA4B;IAC7E,eAAe,IAAI,MAAM;IAIzB,yBAAyB,CAAC,iBAAiB,EAAE,MAAM,GAAG,OAAO;IA0B7D,qBAAqB,CACnB,YAAY,EAAE,iBAAiB,EAAE,EACjC,kBAAkB,CAAC,EAAE,mCAAmC,EAAE,GACzD,0BAA0B;CA+D9B"}

package/dist/browser/queryExecutionContext/queryFilteringStrategy/ParallelQueryRangeStrategy.js

@@ -1,5 +1,6 @@
 // Copyright (c) Microsoft Corporation.
 // Licensed under the MIT License.
+import { isPartitionExhausted } from "../PartitionRangeManager.js";
 /**
  * Strategy for filtering partition ranges in parallel query execution context
  * Supports resuming from composite continuation tokens with multi-range aggregation
@@ -54,7 +55,7 @@ export class ParallelQueryRangeStrategy {
         for (const range of continuationRanges) {
             // Always track the last processed range, even if it's exhausted
             lastProcessedRange = range.range;
-            if (range && !this.isPartitionExhausted(range.continuationToken)) {
+            if (range && !isPartitionExhausted(range.continuationToken)) {
                 rangeTokenPairs.push({
                     range: range.range,
                     continuationToken: range.continuationToken,
@@ -89,14 +90,5 @@ export class ParallelQueryRangeStrategy {
             rangeTokenPairs,
         };
     }
-    /**
-     * Checks if a partition is exhausted based on its continuation token
-     */
-    isPartitionExhausted(continuationToken) {
-        return (!continuationToken ||
-            continuationToken === "" ||
-            continuationToken === "null" ||
-            continuationToken.toLowerCase() === "null");
-    }
 }
 //# sourceMappingURL=ParallelQueryRangeStrategy.js.map

package/dist/browser/queryExecutionContext/queryFilteringStrategy/ParallelQueryRangeStrategy.js.map

@@ -1 +1 @@
-{"version":3,"file":"ParallelQueryRangeStrategy.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/queryFilteringStrategy/ParallelQueryRangeStrategy.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AASlC;;;;GAIG;AACH,MAAM,OAAO,0BAA0B;IACrC,eAAe;QACb,OAAO,eAAe,CAAC;IACzB,CAAC;IAED,yBAAyB,CAAC,iBAAyB;QACjD,oDAAoD;QACpD,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;YAC7C,mEAAmE;YACnE,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;gBACpD,OAAO,KAAK,CAAC;YACf,CAAC;YAED,+DAA+D;YAC/D,KAAK,MAAM,YAAY,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;gBAChD,IAAI,CAAC,YAAY,IAAI,CAAC,YAAY,CAAC,iBAAiB,EAAE,CAAC;oBACrD,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED,qBAAqB,CACnB,YAAiC,EACjC,kBAA0D;QAE1D,IAAI,CAAC,YAAY,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/C,OAAO,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;QACjC,CAAC;QAED,oEAAoE;QACpE,IAAI,CAAC,kBAAkB,IAAI,kBAAkB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3D,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;gBACnD,KAAK;gBACL,iBAAiB,EAAE,SAA+B;gBAClD,kBAAkB,EAAE,SAA+B;aACpD,CAAC,CAAC,CAAC;YACJ,OAAO,EAAE,eAAe,EAAE,CAAC;QAC7B,CAAC;QAED,MAAM,eAAe,GAA0C,EAAE,CAAC;QAClE,IAAI,kBAAkB,GAA6B,IAAI,CAAC;QAExD,6EAA6E;QAC7E,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC/B,OAAO,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;QAEH,KAAK,MAAM,KAAK,IAAI,kBAAkB,EAAE,CAAC;YACvC,gEAAgE;YAChE,kBAAkB,GAAG,KAAK,CAAC,KAAK,CAAC;YAEjC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,CAAC;gBACjE,eAAe,CAAC,IAAI,CAAC;oBACnB,KAAK,EAAE,KAAK,CAAC,KAAK;oBAClB,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;oBAC1C,kBAAkB,EAAE,KAAK,CAAC,kBAAkB;iBAC7C,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,qEAAqE;QACrE,IAAI,kBAAkB,EAAE,CAAC;YACvB,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;gBACvC,8GAA8G;gBAC9G,IAAI,WAAW,CAAC,YAAY,IAAI,kBAAkB,CAAC,YAAY,EAAE,CAAC;oBAChE,eAAe,CAAC,IAAI,CAAC;wBACnB,KAAK,EAAE,WAAW;wBAClB,iBAAiB,EAAE,SAA+B;wBAClD,kBAAkB,EAAE,SAA+B;qBACpD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,6EAA6E;YAC7E,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;gBACvC,eAAe,CAAC,IAAI,CAAC;oBACnB,KAAK,EAAE,WAAW;oBAClB,iBAAiB,EAAE,SAA+B;oBAClD,kBAAkB,EAAE,SAA+B;iBACpD,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO;YACL,eAAe;SAChB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,iBAAqC;QAChE,OAAO,CACL,CAAC,iBAAiB;YAClB,iBAAiB,KAAK,EAAE;YACxB,iBAAiB,KAAK,MAAM;YAC5B,iBAAiB,CAAC,WAAW,EAAE,KAAK,MAAM,CAC3C,CAAC;IACJ,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport type { PartitionKeyRange } from \"../../index.js\";\nimport type {\n  TargetPartitionRangeStrategy,\n  PartitionRangeFilterResult,\n} from \"./TargetPartitionRangeStrategy.js\";\nimport type { PartitionRangeWithContinuationToken } from \"./TargetPartitionRangeManager.js\";\n\n/**\n * Strategy for filtering partition ranges in parallel query execution context\n * Supports resuming from composite continuation tokens with multi-range aggregation\n * @hidden\n */\nexport class ParallelQueryRangeStrategy implements TargetPartitionRangeStrategy {\n  getStrategyType(): string {\n    return \"ParallelQuery\";\n  }\n\n  validateContinuationToken(continuationToken: string): boolean {\n    // Check for null, undefined, or empty string inputs\n    if (!continuationToken) {\n      return false;\n    }\n\n    try {\n      const parsed = JSON.parse(continuationToken);\n      // Check if it's a composite continuation token (has rangeMappings)\n      if (!parsed || !Array.isArray(parsed.rangeMappings)) {\n        return false;\n      }\n\n      // Validate each range mapping has a non-null partitionKeyRange\n      for (const rangeMapping of parsed.rangeMappings) {\n        if (!rangeMapping || !rangeMapping.partitionKeyRange) {\n          return false;\n        }\n      }\n\n      return true;\n    } catch {\n      return false;\n    }\n  }\n\n  filterPartitionRanges(\n    targetRanges: PartitionKeyRange[],\n    continuationRanges?: PartitionRangeWithContinuationToken[],\n  ): PartitionRangeFilterResult {\n    if (!targetRanges || targetRanges.length === 0) {\n      return { rangeTokenPairs: [] };\n    }\n\n    // If no continuation ranges, return all ranges as range-token pairs\n    if (!continuationRanges || continuationRanges.length === 0) {\n      const rangeTokenPairs = targetRanges.map((range) => ({\n        range,\n        continuationToken: undefined as string | undefined,\n        filteringCondition: undefined as string | undefined,\n      }));\n      return { rangeTokenPairs };\n    }\n\n    const rangeTokenPairs: PartitionRangeWithContinuationToken[] = [];\n    let lastProcessedRange: PartitionKeyRange | null = null;\n\n    // sort continuationRanges in ascending order using their minInclusive values\n    continuationRanges.sort((a, b) => {\n      return a.range.minInclusive.localeCompare(b.range.minInclusive);\n    });\n\n    for (const range of continuationRanges) {\n      // Always track the last processed range, even if it's exhausted\n      lastProcessedRange = range.range;\n\n      if (range && !this.isPartitionExhausted(range.continuationToken)) {\n        rangeTokenPairs.push({\n          range: range.range,\n          continuationToken: range.continuationToken,\n          filteringCondition: range.filteringCondition,\n        });\n      }\n    }\n\n    // Add any new target ranges that come after the last processed range\n    if (lastProcessedRange) {\n      for (const targetRange of targetRanges) {\n        // Only include ranges whose minInclusive value is greater than or equal to maxExclusive of lastProcessedRange\n        if (targetRange.minInclusive >= lastProcessedRange.maxExclusive) {\n          rangeTokenPairs.push({\n            range: targetRange,\n            continuationToken: undefined as string | undefined,\n            filteringCondition: undefined as string | undefined,\n          });\n        }\n      }\n    } else {\n      // If no ranges were processed from continuation token, add all target ranges\n      for (const targetRange of targetRanges) {\n        rangeTokenPairs.push({\n          range: targetRange,\n          continuationToken: undefined as string | undefined,\n          filteringCondition: undefined as string | undefined,\n        });\n      }\n    }\n\n    return {\n      rangeTokenPairs,\n    };\n  }\n\n  /**\n   * Checks if a partition is exhausted based on its continuation token\n   */\n  private isPartitionExhausted(continuationToken: string | undefined): boolean {\n    return (\n      !continuationToken ||\n      continuationToken === \"\" ||\n      continuationToken === \"null\" ||\n      continuationToken.toLowerCase() === \"null\"\n    );\n  }\n}\n"]}
+{"version":3,"file":"ParallelQueryRangeStrategy.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/queryFilteringStrategy/ParallelQueryRangeStrategy.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAQlC,OAAO,EAAE,oBAAoB,EAAE,MAAM,6BAA6B,CAAC;AAEnE;;;;GAIG;AACH,MAAM,OAAO,0BAA0B;IACrC,eAAe;QACb,OAAO,eAAe,CAAC;IACzB,CAAC;IAED,yBAAyB,CAAC,iBAAyB;QACjD,oDAAoD;QACpD,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;YAC7C,mEAAmE;YACnE,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;gBACpD,OAAO,KAAK,CAAC;YACf,CAAC;YAED,+DAA+D;YAC/D,KAAK,MAAM,YAAY,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;gBAChD,IAAI,CAAC,YAAY,IAAI,CAAC,YAAY,CAAC,iBAAiB,EAAE,CAAC;oBACrD,OAAO,KAAK,CAAC;gBACf,CAAC;YACH,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED,qBAAqB,CACnB,YAAiC,EACjC,kBAA0D;QAE1D,IAAI,CAAC,YAAY,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/C,OAAO,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;QACjC,CAAC;QAED,oEAAoE;QACpE,IAAI,CAAC,kBAAkB,IAAI,kBAAkB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3D,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;gBACnD,KAAK;gBACL,iBAAiB,EAAE,SAA+B;gBAClD,kBAAkB,EAAE,SAA+B;aACpD,CAAC,CAAC,CAAC;YACJ,OAAO,EAAE,eAAe,EAAE,CAAC;QAC7B,CAAC;QAED,MAAM,eAAe,GAA0C,EAAE,CAAC;QAClE,IAAI,kBAAkB,GAA6B,IAAI,CAAC;QAExD,6EAA6E;QAC7E,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC/B,OAAO,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;QAEH,KAAK,MAAM,KAAK,IAAI,kBAAkB,EAAE,CAAC;YACvC,gEAAgE;YAChE,kBAAkB,GAAG,KAAK,CAAC,KAAK,CAAC;YAEjC,IAAI,KAAK,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,CAAC;gBAC5D,eAAe,CAAC,IAAI,CAAC;oBACnB,KAAK,EAAE,KAAK,CAAC,KAAK;oBAClB,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;oBAC1C,kBAAkB,EAAE,KAAK,CAAC,kBAAkB;iBAC7C,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,qEAAqE;QACrE,IAAI,kBAAkB,EAAE,CAAC;YACvB,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;gBACvC,8GAA8G;gBAC9G,IAAI,WAAW,CAAC,YAAY,IAAI,kBAAkB,CAAC,YAAY,EAAE,CAAC;oBAChE,eAAe,CAAC,IAAI,CAAC;wBACnB,KAAK,EAAE,WAAW;wBAClB,iBAAiB,EAAE,SAA+B;wBAClD,kBAAkB,EAAE,SAA+B;qBACpD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,6EAA6E;YAC7E,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;gBACvC,eAAe,CAAC,IAAI,CAAC;oBACnB,KAAK,EAAE,WAAW;oBAClB,iBAAiB,EAAE,SAA+B;oBAClD,kBAAkB,EAAE,SAA+B;iBACpD,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO;YACL,eAAe;SAChB,CAAC;IACJ,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport type { PartitionKeyRange } from \"../../index.js\";\nimport type {\n  TargetPartitionRangeStrategy,\n  PartitionRangeFilterResult,\n} from \"./TargetPartitionRangeStrategy.js\";\nimport type { PartitionRangeWithContinuationToken } from \"./TargetPartitionRangeManager.js\";\nimport { isPartitionExhausted } from \"../PartitionRangeManager.js\";\n\n/**\n * Strategy for filtering partition ranges in parallel query execution context\n * Supports resuming from composite continuation tokens with multi-range aggregation\n * @hidden\n */\nexport class ParallelQueryRangeStrategy implements TargetPartitionRangeStrategy {\n  getStrategyType(): string {\n    return \"ParallelQuery\";\n  }\n\n  validateContinuationToken(continuationToken: string): boolean {\n    // Check for null, undefined, or empty string inputs\n    if (!continuationToken) {\n      return false;\n    }\n\n    try {\n      const parsed = JSON.parse(continuationToken);\n      // Check if it's a composite continuation token (has rangeMappings)\n      if (!parsed || !Array.isArray(parsed.rangeMappings)) {\n        return false;\n      }\n\n      // Validate each range mapping has a non-null partitionKeyRange\n      for (const rangeMapping of parsed.rangeMappings) {\n        if (!rangeMapping || !rangeMapping.partitionKeyRange) {\n          return false;\n        }\n      }\n\n      return true;\n    } catch {\n      return false;\n    }\n  }\n\n  filterPartitionRanges(\n    targetRanges: PartitionKeyRange[],\n    continuationRanges?: PartitionRangeWithContinuationToken[],\n  ): PartitionRangeFilterResult {\n    if (!targetRanges || targetRanges.length === 0) {\n      return { rangeTokenPairs: [] };\n    }\n\n    // If no continuation ranges, return all ranges as range-token pairs\n    if (!continuationRanges || continuationRanges.length === 0) {\n      const rangeTokenPairs = targetRanges.map((range) => ({\n        range,\n        continuationToken: undefined as string | undefined,\n        filteringCondition: undefined as string | undefined,\n      }));\n      return { rangeTokenPairs };\n    }\n\n    const rangeTokenPairs: PartitionRangeWithContinuationToken[] = [];\n    let lastProcessedRange: PartitionKeyRange | null = null;\n\n    // sort continuationRanges in ascending order using their minInclusive values\n    continuationRanges.sort((a, b) => {\n      return a.range.minInclusive.localeCompare(b.range.minInclusive);\n    });\n\n    for (const range of continuationRanges) {\n      // Always track the last processed range, even if it's exhausted\n      lastProcessedRange = range.range;\n\n      if (range && !isPartitionExhausted(range.continuationToken)) {\n        rangeTokenPairs.push({\n          range: range.range,\n          continuationToken: range.continuationToken,\n          filteringCondition: range.filteringCondition,\n        });\n      }\n    }\n\n    // Add any new target ranges that come after the last processed range\n    if (lastProcessedRange) {\n      for (const targetRange of targetRanges) {\n        // Only include ranges whose minInclusive value is greater than or equal to maxExclusive of lastProcessedRange\n        if (targetRange.minInclusive >= lastProcessedRange.maxExclusive) {\n          rangeTokenPairs.push({\n            range: targetRange,\n            continuationToken: undefined as string | undefined,\n            filteringCondition: undefined as string | undefined,\n          });\n        }\n      }\n    } else {\n      // If no ranges were processed from continuation token, add all target ranges\n      for (const targetRange of targetRanges) {\n        rangeTokenPairs.push({\n          range: targetRange,\n          continuationToken: undefined as string | undefined,\n          filteringCondition: undefined as string | undefined,\n        });\n      }\n    }\n\n    return {\n      rangeTokenPairs,\n    };\n  }\n}\n"]}

package/dist/browser/request/defaultAgent.d.ts

@@ -7,4 +7,4 @@ export declare let defaultHttpAgent: Agent;
  * @hidden
  */
 export declare let defaultHttpsAgent: Agent;
-//# sourceMappingURL=defaultAgent-browser.d.mts.map
+//# sourceMappingURL=defaultAgent.d.ts.map

package/dist/browser/request/defaultAgent.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"defaultAgent.d.ts","sourceRoot":"","sources":["../../../src/request/defaultAgent.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AACvC;;GAEG;AACH,eAAO,IAAI,gBAAgB,EAAE,KAAK,CAAC;AACnC;;GAEG;AACH,eAAO,IAAI,iBAAiB,EAAE,KAAK,CAAC"}

package/dist/browser/request/defaultAgent.js

@@ -6,4 +6,4 @@ export let defaultHttpAgent;
  * @hidden
  */
 export let defaultHttpsAgent;
-//# sourceMappingURL=defaultAgent-browser.mjs.map
+//# sourceMappingURL=defaultAgent.js.map

package/dist/browser/request/defaultAgent.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"defaultAgent.js","sourceRoot":"","sources":["../../../src/request/defaultAgent.ts"],"names":[],"mappings":"AAGA;;GAEG;AACH,MAAM,CAAC,IAAI,gBAAuB,CAAC;AACnC;;GAEG;AACH,MAAM,CAAC,IAAI,iBAAwB,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { Agent } from \"node:http\";\n/**\n * @hidden\n */\nexport let defaultHttpAgent: Agent;\n/**\n * @hidden\n */\nexport let defaultHttpsAgent: Agent;\n"]}

package/dist/browser/request/hybridSearchQueryResult.d.ts

@@ -1,4 +1,4 @@
-import { ItemDefinition } from "../client/index.js";
+import type { ItemDefinition } from "../client/index.js";
 export declare class HybridSearchQueryResult {
     rid: string;
     componentScores: number[];

package/dist/browser/request/hybridSearchQueryResult.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hybridSearchQueryResult.d.ts","sourceRoot":"","sources":["../../../src/request/hybridSearchQueryResult.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAQpD,qBAAa,uBAAuB;IAClC,GAAG,EAAE,MAAM,CAAC;IACZ,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,IAAI,EAAE,GAAG,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,EAAE,CAAC;gBAEJ,GAAG,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;WAMnE,MAAM,CAAC,CAAC,SAAS,cAAc,EAAE,QAAQ,EAAE,CAAC,GAAG,uBAAuB;CA8BrF"}
+{"version":3,"file":"hybridSearchQueryResult.d.ts","sourceRoot":"","sources":["../../../src/request/hybridSearchQueryResult.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAQzD,qBAAa,uBAAuB;IAClC,GAAG,EAAE,MAAM,CAAC;IACZ,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,IAAI,EAAE,GAAG,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,EAAE,CAAC;gBAEJ,GAAG,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;WAMnE,MAAM,CAAC,CAAC,SAAS,cAAc,EAAE,QAAQ,EAAE,CAAC,GAAG,uBAAuB;CA8BrF"}

package/dist/browser/request/hybridSearchQueryResult.js.map

@@ -1 +1 @@
-{"version":3,"file":"hybridSearchQueryResult.js","sourceRoot":"","sources":["../../../src/request/hybridSearchQueryResult.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAIlC,MAAM,UAAU,GAAG;IACjB,GAAG,EAAE,MAAM;IACX,OAAO,EAAE,SAAS;IAClB,eAAe,EAAE,iBAAiB;CACnC,CAAC;AAEF,MAAM,OAAO,uBAAuB;IAClC,GAAG,CAAS;IACZ,eAAe,CAAW;IAC1B,IAAI,CAAM;IACV,KAAK,CAAS;IACd,KAAK,CAAW;IAEhB,YAAY,GAAW,EAAE,eAAyB,EAAE,IAA6B;QAC/E,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAEM,MAAM,CAAC,MAAM,CAA2B,QAAW;QACxD,MAAM,GAAG,GAAG,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,IAAI,KAAK,CAAC,GAAG,UAAU,CAAC,GAAG,cAAc,CAAC,CAAC;QACnD,CAAC;QAED,MAAM,YAAY,GAAG,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,eAAyB,CAAC;QAC9B,IAAI,IAA6B,CAAC;QAElC,IAAI,CAAC,YAAY,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE,CAAC;YACtD,MAAM,IAAI,KAAK,CAAC,GAAG,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;QACvD,CAAC;QAED,MAAM,YAAY,GAAG,YAAY,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAEtD,IAAI,YAAY,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE,CAAC;YACrD,+CAA+C;YAC/C,eAAe,GAAG,YAAY,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;YAC3D,IAAI,GAAG,YAAY,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,qCAAqC;YACrC,eAAe,GAAG,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;YACvD,IAAI,GAAG,YAAY,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,GAAG,UAAU,CAAC,eAAe,cAAc,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,IAAI,uBAAuB,CAAC,GAAG,EAAE,eAAe,EAAE,IAAI,CAAC,CAAC;IACjE,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { ItemDefinition } from \"../client/index.js\";\n\nconst FieldNames = {\n  Rid: \"_rid\",\n  Payload: \"payload\",\n  ComponentScores: \"componentScores\",\n};\n\nexport class HybridSearchQueryResult {\n  rid: string;\n  componentScores: number[];\n  data: any;\n  score: number;\n  ranks: number[];\n\n  constructor(rid: string, componentScores: number[], data: Record<string, unknown>) {\n    this.rid = rid;\n    this.componentScores = componentScores;\n    this.data = data;\n  }\n\n  public static create<T extends ItemDefinition>(document: T): HybridSearchQueryResult {\n    const rid = document[FieldNames.Rid];\n    if (!rid) {\n      throw new Error(`${FieldNames.Rid} must exist.`);\n    }\n\n    const outerPayload = document[FieldNames.Payload];\n    let componentScores: number[];\n    let data: Record<string, unknown>;\n\n    if (!outerPayload || typeof outerPayload !== \"object\") {\n      throw new Error(`${FieldNames.Payload} must exist.`);\n    }\n\n    const innerPayload = outerPayload[FieldNames.Payload];\n\n    if (innerPayload && typeof innerPayload === \"object\") {\n      // older format without query plan optimization\n      componentScores = outerPayload[FieldNames.ComponentScores];\n      data = innerPayload;\n    } else {\n      // newer format with the optimization\n      componentScores = document[FieldNames.ComponentScores];\n      data = outerPayload;\n    }\n    if (!Array.isArray(componentScores)) {\n      throw new Error(`${FieldNames.ComponentScores} must exist.`);\n    }\n    return new HybridSearchQueryResult(rid, componentScores, data);\n  }\n}\n"]}
+{"version":3,"file":"hybridSearchQueryResult.js","sourceRoot":"","sources":["../../../src/request/hybridSearchQueryResult.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAIlC,MAAM,UAAU,GAAG;IACjB,GAAG,EAAE,MAAM;IACX,OAAO,EAAE,SAAS;IAClB,eAAe,EAAE,iBAAiB;CACnC,CAAC;AAEF,MAAM,OAAO,uBAAuB;IAClC,GAAG,CAAS;IACZ,eAAe,CAAW;IAC1B,IAAI,CAAM;IACV,KAAK,CAAS;IACd,KAAK,CAAW;IAEhB,YAAY,GAAW,EAAE,eAAyB,EAAE,IAA6B;QAC/E,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAEM,MAAM,CAAC,MAAM,CAA2B,QAAW;QACxD,MAAM,GAAG,GAAG,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,IAAI,KAAK,CAAC,GAAG,UAAU,CAAC,GAAG,cAAc,CAAC,CAAC;QACnD,CAAC;QAED,MAAM,YAAY,GAAG,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,eAAyB,CAAC;QAC9B,IAAI,IAA6B,CAAC;QAElC,IAAI,CAAC,YAAY,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE,CAAC;YACtD,MAAM,IAAI,KAAK,CAAC,GAAG,UAAU,CAAC,OAAO,cAAc,CAAC,CAAC;QACvD,CAAC;QAED,MAAM,YAAY,GAAG,YAAY,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAEtD,IAAI,YAAY,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE,CAAC;YACrD,+CAA+C;YAC/C,eAAe,GAAG,YAAY,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;YAC3D,IAAI,GAAG,YAAY,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,qCAAqC;YACrC,eAAe,GAAG,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;YACvD,IAAI,GAAG,YAAY,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,GAAG,UAAU,CAAC,eAAe,cAAc,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,IAAI,uBAAuB,CAAC,GAAG,EAAE,eAAe,EAAE,IAAI,CAAC,CAAC;IACjE,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport type { ItemDefinition } from \"../client/index.js\";\n\nconst FieldNames = {\n  Rid: \"_rid\",\n  Payload: \"payload\",\n  ComponentScores: \"componentScores\",\n};\n\nexport class HybridSearchQueryResult {\n  rid: string;\n  componentScores: number[];\n  data: any;\n  score: number;\n  ranks: number[];\n\n  constructor(rid: string, componentScores: number[], data: Record<string, unknown>) {\n    this.rid = rid;\n    this.componentScores = componentScores;\n    this.data = data;\n  }\n\n  public static create<T extends ItemDefinition>(document: T): HybridSearchQueryResult {\n    const rid = document[FieldNames.Rid];\n    if (!rid) {\n      throw new Error(`${FieldNames.Rid} must exist.`);\n    }\n\n    const outerPayload = document[FieldNames.Payload];\n    let componentScores: number[];\n    let data: Record<string, unknown>;\n\n    if (!outerPayload || typeof outerPayload !== \"object\") {\n      throw new Error(`${FieldNames.Payload} must exist.`);\n    }\n\n    const innerPayload = outerPayload[FieldNames.Payload];\n\n    if (innerPayload && typeof innerPayload === \"object\") {\n      // older format without query plan optimization\n      componentScores = outerPayload[FieldNames.ComponentScores];\n      data = innerPayload;\n    } else {\n      // newer format with the optimization\n      componentScores = document[FieldNames.ComponentScores];\n      data = outerPayload;\n    }\n    if (!Array.isArray(componentScores)) {\n      throw new Error(`${FieldNames.ComponentScores} must exist.`);\n    }\n    return new HybridSearchQueryResult(rid, componentScores, data);\n  }\n}\n"]}

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

@@ -1,12 +1,12 @@
-export { ErrorResponse, ErrorBody, PartitionedQueryExecutionInfo, QueryInfo, QueryRange, AggregateType, GroupByExpressions, GroupByAliasToAggregateType, HybridSearchQueryInfo, } from "./ErrorResponse.js";
-export { FeedOptions } from "./FeedOptions.js";
-export { RequestOptions } from "./RequestOptions.js";
-export { Response } from "./Response.js";
+export { ErrorResponse, type ErrorBody, type PartitionedQueryExecutionInfo, type QueryInfo, type QueryRange, type AggregateType, type GroupByExpressions, type GroupByAliasToAggregateType, type HybridSearchQueryInfo, } from "./ErrorResponse.js";
+export type { FeedOptions } from "./FeedOptions.js";
+export type { RequestOptions } from "./RequestOptions.js";
+export type { Response } from "./Response.js";
 export { ResourceResponse } from "./ResourceResponse.js";
-export { SharedOptions } from "./SharedOptions.js";
-export { StatusCode, SubStatusCode } from "./StatusCodes.js";
+export type { SharedOptions } from "./SharedOptions.js";
+export type { StatusCode, SubStatusCode } from "./StatusCodes.js";
 export { FeedResponse } from "./FeedResponse.js";
-export { RequestContext } from "./RequestContext.js";
+export type { RequestContext } from "./RequestContext.js";
 export { TimeoutError } from "./TimeoutError.js";
-export * from "./globalStatistics.js";
+export type * from "./globalStatistics.js";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/request/index.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,aAAa,EACb,SAAS,EACT,6BAA6B,EAC7B,SAAS,EACT,UAAU,EACV,aAAa,EACb,kBAAkB,EAClB,2BAA2B,EAC3B,qBAAqB,GACtB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,cAAc,uBAAuB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/request/index.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,aAAa,EACb,KAAK,SAAS,EACd,KAAK,6BAA6B,EAClC,KAAK,SAAS,EACd,KAAK,UAAU,EACf,KAAK,aAAa,EAClB,KAAK,kBAAkB,EACvB,KAAK,2BAA2B,EAChC,KAAK,qBAAqB,GAC3B,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,YAAY,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAC1D,YAAY,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACxD,YAAY,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,YAAY,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,mBAAmB,uBAAuB,CAAC"}

package/dist/browser/request/index.js

@@ -4,5 +4,4 @@ export { ErrorResponse, } from "./ErrorResponse.js";
 export { ResourceResponse } from "./ResourceResponse.js";
 export { FeedResponse } from "./FeedResponse.js";
 export { TimeoutError } from "./TimeoutError.js";
-export * from "./globalStatistics.js";
 //# sourceMappingURL=index.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/request/index.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAClC,OAAO,EACL,aAAa,GASd,MAAM,oBAAoB,CAAC;AAI5B,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAGzD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEjD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,cAAc,uBAAuB,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nexport {\n  ErrorResponse,\n  ErrorBody,\n  PartitionedQueryExecutionInfo,\n  QueryInfo,\n  QueryRange,\n  AggregateType,\n  GroupByExpressions,\n  GroupByAliasToAggregateType,\n  HybridSearchQueryInfo,\n} from \"./ErrorResponse.js\";\nexport { FeedOptions } from \"./FeedOptions.js\";\nexport { RequestOptions } from \"./RequestOptions.js\";\nexport { Response } from \"./Response.js\";\nexport { ResourceResponse } from \"./ResourceResponse.js\";\nexport { SharedOptions } from \"./SharedOptions.js\";\nexport { StatusCode, SubStatusCode } from \"./StatusCodes.js\";\nexport { FeedResponse } from \"./FeedResponse.js\";\nexport { RequestContext } from \"./RequestContext.js\";\nexport { TimeoutError } from \"./TimeoutError.js\";\nexport * from \"./globalStatistics.js\";\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/request/index.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAClC,OAAO,EACL,aAAa,GASd,MAAM,oBAAoB,CAAC;AAI5B,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAGzD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEjD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nexport {\n  ErrorResponse,\n  type ErrorBody,\n  type PartitionedQueryExecutionInfo,\n  type QueryInfo,\n  type QueryRange,\n  type AggregateType,\n  type GroupByExpressions,\n  type GroupByAliasToAggregateType,\n  type HybridSearchQueryInfo,\n} from \"./ErrorResponse.js\";\nexport type { FeedOptions } from \"./FeedOptions.js\";\nexport type { RequestOptions } from \"./RequestOptions.js\";\nexport type { Response } from \"./Response.js\";\nexport { ResourceResponse } from \"./ResourceResponse.js\";\nexport type { SharedOptions } from \"./SharedOptions.js\";\nexport type { StatusCode, SubStatusCode } from \"./StatusCodes.js\";\nexport { FeedResponse } from \"./FeedResponse.js\";\nexport type { RequestContext } from \"./RequestContext.js\";\nexport { TimeoutError } from \"./TimeoutError.js\";\nexport type * from \"./globalStatistics.js\";\n"]}

package/dist/browser/retry/endpointDiscoveryRetryPolicy.d.ts

@@ -4,7 +4,7 @@ import type { GlobalEndpointManager } from "../globalEndpointManager.js";
 import type { ErrorResponse, RequestContext } from "../request/index.js";
 import type { RetryContext } from "./RetryContext.js";
 import type { RetryPolicy } from "./RetryPolicy.js";
-import { GlobalPartitionEndpointManager } from "../globalPartitionEndpointManager.js";
+import type { GlobalPartitionEndpointManager } from "../globalPartitionEndpointManager.js";
 /**
  * This class implements the retry policy for endpoint discovery.
  * @hidden

package/dist/browser/retry/endpointDiscoveryRetryPolicy.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"endpointDiscoveryRetryPolicy.d.ts","sourceRoot":"","sources":["../../../src/retry/endpointDiscoveryRetryPolicy.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,0CAA0C,CAAC;AACvF,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAEjE,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AACzE,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACzE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,8BAA8B,EAAE,MAAM,sCAAsC,CAAC;AAEtF;;;GAGG;AACH,qBAAa,4BAA6B,YAAW,WAAW;IAe5D,OAAO,CAAC,qBAAqB;IAC7B,OAAO,CAAC,YAAY;IACpB,OAAO,CAAC,aAAa;IACrB,OAAO,CAAC,8BAA8B,CAAC;IAjBzC,mCAAmC;IAC5B,wBAAwB,EAAE,MAAM,CAAC;IACxC,sCAAsC;IAC/B,cAAc,EAAE,MAAM,CAAC;IAE9B,+CAA+C;IAC/C,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAO;IACvC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAQ;IAE9C;;OAEG;gBAEO,qBAAqB,EAAE,qBAAqB,EAC5C,YAAY,EAAE,YAAY,EAC1B,aAAa,EAAE,aAAa,EAC5B,8BAA8B,CAAC,EAAE,8BAA8B;IAOzE;;;OAGG;IACU,WAAW,CACtB,GAAG,EAAE,aAAa,EAClB,cAAc,EAAE,sBAAsB,EACtC,YAAY,CAAC,EAAE,YAAY,EAC3B,gBAAgB,CAAC,EAAE,MAAM,EACzB,cAAc,CAAC,EAAE,cAAc,GAC9B,OAAO,CAAC,OAAO,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;CAoDxC"}
+{"version":3,"file":"endpointDiscoveryRetryPolicy.d.ts","sourceRoot":"","sources":["../../../src/retry/endpointDiscoveryRetryPolicy.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,0CAA0C,CAAC;AACvF,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAEjE,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AACzE,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACzE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EAAE,8BAA8B,EAAE,MAAM,sCAAsC,CAAC;AAE3F;;;GAGG;AACH,qBAAa,4BAA6B,YAAW,WAAW;IAe5D,OAAO,CAAC,qBAAqB;IAC7B,OAAO,CAAC,YAAY;IACpB,OAAO,CAAC,aAAa;IACrB,OAAO,CAAC,8BAA8B,CAAC;IAjBzC,mCAAmC;IAC5B,wBAAwB,EAAE,MAAM,CAAC;IACxC,sCAAsC;IAC/B,cAAc,EAAE,MAAM,CAAC;IAE9B,+CAA+C;IAC/C,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAO;IACvC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAQ;IAE9C;;OAEG;gBAEO,qBAAqB,EAAE,qBAAqB,EAC5C,YAAY,EAAE,YAAY,EAC1B,aAAa,EAAE,aAAa,EAC5B,8BAA8B,CAAC,EAAE,8BAA8B;IAOzE;;;OAGG;IACU,WAAW,CACtB,GAAG,EAAE,aAAa,EAClB,cAAc,EAAE,sBAAsB,EACtC,YAAY,CAAC,EAAE,YAAY,EAC3B,gBAAgB,CAAC,EAAE,MAAM,EACzB,cAAc,CAAC,EAAE,cAAc,GAC9B,OAAO,CAAC,OAAO,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;CAoDxC"}

package/dist/browser/retry/endpointDiscoveryRetryPolicy.js.map

@@ -1 +1 @@
-{"version":3,"file":"endpointDiscoveryRetryPolicy.js","sourceRoot":"","sources":["../../../src/retry/endpointDiscoveryRetryPolicy.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAOpD;;;GAGG;AACH,MAAM,OAAO,4BAA4B;IAe7B;IACA;IACA;IACA;IAjBV,mCAAmC;IAC5B,wBAAwB,CAAS;IACxC,sCAAsC;IAC/B,cAAc,CAAS;IAE9B,+CAA+C;IACvC,QAAQ,CAAS;IACjB,MAAM,CAAU,QAAQ,GAAG,GAAG,CAAC,CAAC,kBAAkB;IAClD,MAAM,CAAU,cAAc,GAAG,IAAI,CAAC;IAE9C;;OAEG;IACH,YACU,qBAA4C,EAC5C,YAA0B,EAC1B,aAA4B,EAC5B,8BAA+D;QAH/D,0BAAqB,GAArB,qBAAqB,CAAuB;QAC5C,iBAAY,GAAZ,YAAY,CAAc;QAC1B,kBAAa,GAAb,aAAa,CAAe;QAC5B,mCAA8B,GAA9B,8BAA8B,CAAiC;QAEvE,IAAI,CAAC,QAAQ,GAAG,4BAA4B,CAAC,QAAQ,CAAC;QACtD,IAAI,CAAC,wBAAwB,GAAG,CAAC,CAAC;QAClC,IAAI,CAAC,cAAc,GAAG,4BAA4B,CAAC,cAAc,CAAC;IACpE,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,WAAW,CACtB,GAAkB,EAClB,cAAsC,EACtC,YAA2B,EAC3B,gBAAyB,EACzB,cAA+B;QAE/B,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,YAAY,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACvC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,uBAAuB,EAAE,CAAC;YACxD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,IAAI,CAAC,8BAA8B,EAAE,CAAC;YACxC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,8BAA8B,CAAC,yBAAyB,CACrF,cAAc,EACd,cAAc,CACf,CAAC;YACF,IAAI,WAAW,EAAE,CAAC;gBAChB,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,wBAAwB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,wBAAwB,EAAE,CAAC;QAChC,YAAY,CAAC,UAAU,GAAG,IAAI,CAAC,wBAAwB,CAAC;QACxD,YAAY,CAAC,6BAA6B,GAAG,KAAK,CAAC;QACnD,YAAY,CAAC,gCAAgC,GAAG,KAAK,CAAC;QACtD,cAAc,CAAC,OAAO,CAAC,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,CAAC,CAAC;QAEvE,8CAA8C;QAC9C,2FAA2F;QAC3F,IAAI,IAAI,CAAC,YAAY,KAAK,YAAY,CAAC,IAAI,IAAI,IAAI,CAAC,aAAa,KAAK,aAAa,CAAC,IAAI,EAAE,CAAC;YACzF,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,CAAC,qBAAqB,CAAC,qCAAqC,CACpE,cAAc,EACd,gBAAgB,CACjB,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,CAAC,qBAAqB,CAAC,sCAAsC,CACrE,cAAc,EACd,gBAAgB,CACjB,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport { OperationType, ResourceType } from \"../common/index.js\";\nimport { isReadRequest } from \"../common/helper.js\";\nimport type { GlobalEndpointManager } from \"../globalEndpointManager.js\";\nimport type { ErrorResponse, RequestContext } from \"../request/index.js\";\nimport type { RetryContext } from \"./RetryContext.js\";\nimport type { RetryPolicy } from \"./RetryPolicy.js\";\nimport { GlobalPartitionEndpointManager } from \"../globalPartitionEndpointManager.js\";\n\n/**\n * This class implements the retry policy for endpoint discovery.\n * @hidden\n */\nexport class EndpointDiscoveryRetryPolicy implements RetryPolicy {\n  /** Current retry attempt count. */\n  public currentRetryAttemptCount: number;\n  /** Retry interval in milliseconds. */\n  public retryAfterInMs: number;\n\n  /** Max number of retry attempts to perform. */\n  private maxTries: number;\n  private static readonly maxTries = 120; // TODO: Constant?\n  private static readonly retryAfterInMs = 1000;\n\n  /**\n   * @param globalEndpointManager - The GlobalEndpointManager instance.\n   */\n  constructor(\n    private globalEndpointManager: GlobalEndpointManager,\n    private resourceType: ResourceType,\n    private operationType: OperationType,\n    private globalPartitionEndpointManager?: GlobalPartitionEndpointManager,\n  ) {\n    this.maxTries = EndpointDiscoveryRetryPolicy.maxTries;\n    this.currentRetryAttemptCount = 0;\n    this.retryAfterInMs = EndpointDiscoveryRetryPolicy.retryAfterInMs;\n  }\n\n  /**\n   * Determines whether the request should be retried or not.\n   * @param err - Error returned by the request.\n   */\n  public async shouldRetry(\n    err: ErrorResponse,\n    diagnosticNode: DiagnosticNodeInternal,\n    retryContext?: RetryContext,\n    locationEndpoint?: string,\n    requestContext?: RequestContext,\n  ): Promise<boolean | [boolean, string]> {\n    if (!err) {\n      return false;\n    }\n\n    if (!retryContext || !locationEndpoint) {\n      return false;\n    }\n\n    if (!this.globalEndpointManager.enableEndpointDiscovery) {\n      return false;\n    }\n\n    if (this.globalPartitionEndpointManager) {\n      const didFailover = await this.globalPartitionEndpointManager.tryPartitionLevelFailover(\n        requestContext,\n        diagnosticNode,\n      );\n      if (didFailover) {\n        return true;\n      }\n    }\n\n    if (this.currentRetryAttemptCount >= this.maxTries) {\n      return false;\n    }\n\n    this.currentRetryAttemptCount++;\n    retryContext.retryCount = this.currentRetryAttemptCount;\n    retryContext.clearSessionTokenNotAvailable = false;\n    retryContext.retryRequestOnPreferredLocations = false;\n    diagnosticNode.addData({ successfulRetryPolicy: \"endpointDiscovery\" });\n\n    // check if this is a readDatabaseAccount call\n    // If yes, then simply return true (avoid recursive call triggered for readDatabaseAccount)\n    if (this.resourceType === ResourceType.none && this.operationType === OperationType.Read) {\n      return true;\n    }\n\n    if (isReadRequest(this.operationType)) {\n      await this.globalEndpointManager.markCurrentLocationUnavailableForRead(\n        diagnosticNode,\n        locationEndpoint,\n      );\n    } else {\n      await this.globalEndpointManager.markCurrentLocationUnavailableForWrite(\n        diagnosticNode,\n        locationEndpoint,\n      );\n    }\n    return true;\n  }\n}\n"]}
+{"version":3,"file":"endpointDiscoveryRetryPolicy.js","sourceRoot":"","sources":["../../../src/retry/endpointDiscoveryRetryPolicy.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAOpD;;;GAGG;AACH,MAAM,OAAO,4BAA4B;IAe7B;IACA;IACA;IACA;IAjBV,mCAAmC;IAC5B,wBAAwB,CAAS;IACxC,sCAAsC;IAC/B,cAAc,CAAS;IAE9B,+CAA+C;IACvC,QAAQ,CAAS;IACjB,MAAM,CAAU,QAAQ,GAAG,GAAG,CAAC,CAAC,kBAAkB;IAClD,MAAM,CAAU,cAAc,GAAG,IAAI,CAAC;IAE9C;;OAEG;IACH,YACU,qBAA4C,EAC5C,YAA0B,EAC1B,aAA4B,EAC5B,8BAA+D;QAH/D,0BAAqB,GAArB,qBAAqB,CAAuB;QAC5C,iBAAY,GAAZ,YAAY,CAAc;QAC1B,kBAAa,GAAb,aAAa,CAAe;QAC5B,mCAA8B,GAA9B,8BAA8B,CAAiC;QAEvE,IAAI,CAAC,QAAQ,GAAG,4BAA4B,CAAC,QAAQ,CAAC;QACtD,IAAI,CAAC,wBAAwB,GAAG,CAAC,CAAC;QAClC,IAAI,CAAC,cAAc,GAAG,4BAA4B,CAAC,cAAc,CAAC;IACpE,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,WAAW,CACtB,GAAkB,EAClB,cAAsC,EACtC,YAA2B,EAC3B,gBAAyB,EACzB,cAA+B;QAE/B,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,YAAY,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACvC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,uBAAuB,EAAE,CAAC;YACxD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,IAAI,CAAC,8BAA8B,EAAE,CAAC;YACxC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,8BAA8B,CAAC,yBAAyB,CACrF,cAAc,EACd,cAAc,CACf,CAAC;YACF,IAAI,WAAW,EAAE,CAAC;gBAChB,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,wBAAwB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,wBAAwB,EAAE,CAAC;QAChC,YAAY,CAAC,UAAU,GAAG,IAAI,CAAC,wBAAwB,CAAC;QACxD,YAAY,CAAC,6BAA6B,GAAG,KAAK,CAAC;QACnD,YAAY,CAAC,gCAAgC,GAAG,KAAK,CAAC;QACtD,cAAc,CAAC,OAAO,CAAC,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,CAAC,CAAC;QAEvE,8CAA8C;QAC9C,2FAA2F;QAC3F,IAAI,IAAI,CAAC,YAAY,KAAK,YAAY,CAAC,IAAI,IAAI,IAAI,CAAC,aAAa,KAAK,aAAa,CAAC,IAAI,EAAE,CAAC;YACzF,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,CAAC,qBAAqB,CAAC,qCAAqC,CACpE,cAAc,EACd,gBAAgB,CACjB,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,CAAC,qBAAqB,CAAC,sCAAsC,CACrE,cAAc,EACd,gBAAgB,CACjB,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport { OperationType, ResourceType } from \"../common/index.js\";\nimport { isReadRequest } from \"../common/helper.js\";\nimport type { GlobalEndpointManager } from \"../globalEndpointManager.js\";\nimport type { ErrorResponse, RequestContext } from \"../request/index.js\";\nimport type { RetryContext } from \"./RetryContext.js\";\nimport type { RetryPolicy } from \"./RetryPolicy.js\";\nimport type { GlobalPartitionEndpointManager } from \"../globalPartitionEndpointManager.js\";\n\n/**\n * This class implements the retry policy for endpoint discovery.\n * @hidden\n */\nexport class EndpointDiscoveryRetryPolicy implements RetryPolicy {\n  /** Current retry attempt count. */\n  public currentRetryAttemptCount: number;\n  /** Retry interval in milliseconds. */\n  public retryAfterInMs: number;\n\n  /** Max number of retry attempts to perform. */\n  private maxTries: number;\n  private static readonly maxTries = 120; // TODO: Constant?\n  private static readonly retryAfterInMs = 1000;\n\n  /**\n   * @param globalEndpointManager - The GlobalEndpointManager instance.\n   */\n  constructor(\n    private globalEndpointManager: GlobalEndpointManager,\n    private resourceType: ResourceType,\n    private operationType: OperationType,\n    private globalPartitionEndpointManager?: GlobalPartitionEndpointManager,\n  ) {\n    this.maxTries = EndpointDiscoveryRetryPolicy.maxTries;\n    this.currentRetryAttemptCount = 0;\n    this.retryAfterInMs = EndpointDiscoveryRetryPolicy.retryAfterInMs;\n  }\n\n  /**\n   * Determines whether the request should be retried or not.\n   * @param err - Error returned by the request.\n   */\n  public async shouldRetry(\n    err: ErrorResponse,\n    diagnosticNode: DiagnosticNodeInternal,\n    retryContext?: RetryContext,\n    locationEndpoint?: string,\n    requestContext?: RequestContext,\n  ): Promise<boolean | [boolean, string]> {\n    if (!err) {\n      return false;\n    }\n\n    if (!retryContext || !locationEndpoint) {\n      return false;\n    }\n\n    if (!this.globalEndpointManager.enableEndpointDiscovery) {\n      return false;\n    }\n\n    if (this.globalPartitionEndpointManager) {\n      const didFailover = await this.globalPartitionEndpointManager.tryPartitionLevelFailover(\n        requestContext,\n        diagnosticNode,\n      );\n      if (didFailover) {\n        return true;\n      }\n    }\n\n    if (this.currentRetryAttemptCount >= this.maxTries) {\n      return false;\n    }\n\n    this.currentRetryAttemptCount++;\n    retryContext.retryCount = this.currentRetryAttemptCount;\n    retryContext.clearSessionTokenNotAvailable = false;\n    retryContext.retryRequestOnPreferredLocations = false;\n    diagnosticNode.addData({ successfulRetryPolicy: \"endpointDiscovery\" });\n\n    // check if this is a readDatabaseAccount call\n    // If yes, then simply return true (avoid recursive call triggered for readDatabaseAccount)\n    if (this.resourceType === ResourceType.none && this.operationType === OperationType.Read) {\n      return true;\n    }\n\n    if (isReadRequest(this.operationType)) {\n      await this.globalEndpointManager.markCurrentLocationUnavailableForRead(\n        diagnosticNode,\n        locationEndpoint,\n      );\n    } else {\n      await this.globalEndpointManager.markCurrentLocationUnavailableForWrite(\n        diagnosticNode,\n        locationEndpoint,\n      );\n    }\n    return true;\n  }\n}\n"]}

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

@@ -1,4 +1,4 @@
-export * from "./retryOptions.js";
+export type * from "./retryOptions.js";
 export * from "./endpointDiscoveryRetryPolicy.js";
 export * from "./resourceThrottleRetryPolicy.js";
 export * from "./sessionRetryPolicy.js";

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/retry/index.ts"],"names":[],"mappings":"AAEA,cAAc,mBAAmB,CAAC;AAClC,cAAc,mCAAmC,CAAC;AAClD,cAAc,kCAAkC,CAAC;AACjD,cAAc,yBAAyB,CAAC;AACxC,cAAc,mBAAmB,CAAC;AAClC,cAAc,iCAAiC,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/retry/index.ts"],"names":[],"mappings":"AAEA,mBAAmB,mBAAmB,CAAC;AACvC,cAAc,mCAAmC,CAAC;AAClD,cAAc,kCAAkC,CAAC;AACjD,cAAc,yBAAyB,CAAC;AACxC,cAAc,mBAAmB,CAAC;AAClC,cAAc,iCAAiC,CAAC"}

package/dist/browser/retry/index.js

@@ -1,6 +1,3 @@
-// Copyright (c) Microsoft Corporation.
-// Licensed under the MIT License.
-export * from "./retryOptions.js";
 export * from "./endpointDiscoveryRetryPolicy.js";
 export * from "./resourceThrottleRetryPolicy.js";
 export * from "./sessionRetryPolicy.js";

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

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/retry/index.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAClC,cAAc,mBAAmB,CAAC;AAClC,cAAc,mCAAmC,CAAC;AAClD,cAAc,kCAAkC,CAAC;AACjD,cAAc,yBAAyB,CAAC;AACxC,cAAc,mBAAmB,CAAC;AAClC,cAAc,iCAAiC,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nexport * from \"./retryOptions.js\";\nexport * from \"./endpointDiscoveryRetryPolicy.js\";\nexport * from \"./resourceThrottleRetryPolicy.js\";\nexport * from \"./sessionRetryPolicy.js\";\nexport * from \"./retryUtility.js\";\nexport * from \"./timeoutFailoverRetryPolicy.js\";\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/retry/index.ts"],"names":[],"mappings":"AAGA,cAAc,mCAAmC,CAAC;AAClD,cAAc,kCAAkC,CAAC;AACjD,cAAc,yBAAyB,CAAC;AACxC,cAAc,mBAAmB,CAAC;AAClC,cAAc,iCAAiC,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nexport type * from \"./retryOptions.js\";\nexport * from \"./endpointDiscoveryRetryPolicy.js\";\nexport * from \"./resourceThrottleRetryPolicy.js\";\nexport * from \"./sessionRetryPolicy.js\";\nexport * from \"./retryUtility.js\";\nexport * from \"./timeoutFailoverRetryPolicy.js\";\n"]}

package/dist/browser/retry/timeoutFailoverRetryPolicy.d.ts

@@ -6,7 +6,7 @@ import type { RetryContext } from "./RetryContext.js";
 import type { CosmosHeaders } from "../queryExecutionContext/CosmosHeaders.js";
 import type { ErrorResponse, RequestContext } from "../request/index.js";
 import type { DiagnosticNodeInternal } from "../diagnostics/DiagnosticNodeInternal.js";
-import { GlobalPartitionEndpointManager } from "../globalPartitionEndpointManager.js";
+import type { GlobalPartitionEndpointManager } from "../globalPartitionEndpointManager.js";
 /**
  * This class TimeoutFailoverRetryPolicy handles retries for read operations
  * (including data plane,metadata, and query plan) in case of request timeouts

package/dist/browser/retry/timeoutFailoverRetryPolicy.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"timeoutFailoverRetryPolicy.d.ts","sourceRoot":"","sources":["../../../src/retry/timeoutFailoverRetryPolicy.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AACzE,OAAO,EAAE,UAAU,EAAiB,MAAM,oBAAoB,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAE1E,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,2CAA2C,CAAC;AAE/E,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACzE,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,0CAA0C,CAAC;AACvF,OAAO,EAAE,8BAA8B,EAAE,MAAM,sCAAsC,CAAC;AAEtF;;;;;;GAMG;AACH,qBAAa,0BAA2B,YAAW,WAAW;IAS1D,OAAO,CAAC,qBAAqB;IAC7B,OAAO,CAAC,OAAO;IACf,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,YAAY;IACpB,OAAO,CAAC,aAAa;IACrB,OAAO,CAAC,uBAAuB;IAC/B,OAAO,CAAC,8BAA8B,CAAC;IAdzC,OAAO,CAAC,oBAAoB,CAAO;IACnC,OAAO,CAAC,+BAA+B,CAAK;IACrC,cAAc,SAAK;IACnB,kBAAkB,SAAK;IACvB,OAAO,EAAE,GAAG,CAAC;IACb,gBAAgB,EAAE,GAAG,CAAC;gBAGnB,qBAAqB,EAAE,qBAAqB,EAC5C,OAAO,EAAE,aAAa,EACtB,UAAU,EAAE,UAAU,EACtB,YAAY,EAAE,YAAY,EAC1B,aAAa,EAAE,aAAa,EAC5B,uBAAuB,EAAE,OAAO,EAChC,8BAA8B,CAAC,EAAE,8BAA8B;IAGzE;;;;OAIG;IACH,OAAO,CAAC,6BAA6B;IASxB,WAAW,CACtB,GAAG,EAAE,aAAa,EAClB,cAAc,EAAE,sBAAsB,EACtC,YAAY,CAAC,EAAE,YAAY,EAC3B,gBAAgB,CAAC,EAAE,MAAM,EACzB,cAAc,CAAC,EAAE,cAAc,GAC9B,OAAO,CAAC,OAAO,CAAC;IAsDnB;;;;OAIG;YACW,iBAAiB;CAyBhC"}
+{"version":3,"file":"timeoutFailoverRetryPolicy.d.ts","sourceRoot":"","sources":["../../../src/retry/timeoutFailoverRetryPolicy.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AACzE,OAAO,EAAE,UAAU,EAAiB,MAAM,oBAAoB,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAE1E,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,2CAA2C,CAAC;AAE/E,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACzE,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,0CAA0C,CAAC;AACvF,OAAO,KAAK,EAAE,8BAA8B,EAAE,MAAM,sCAAsC,CAAC;AAE3F;;;;;;GAMG;AACH,qBAAa,0BAA2B,YAAW,WAAW;IAS1D,OAAO,CAAC,qBAAqB;IAC7B,OAAO,CAAC,OAAO;IACf,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,YAAY;IACpB,OAAO,CAAC,aAAa;IACrB,OAAO,CAAC,uBAAuB;IAC/B,OAAO,CAAC,8BAA8B,CAAC;IAdzC,OAAO,CAAC,oBAAoB,CAAO;IACnC,OAAO,CAAC,+BAA+B,CAAK;IACrC,cAAc,SAAK;IACnB,kBAAkB,SAAK;IACvB,OAAO,EAAE,GAAG,CAAC;IACb,gBAAgB,EAAE,GAAG,CAAC;gBAGnB,qBAAqB,EAAE,qBAAqB,EAC5C,OAAO,EAAE,aAAa,EACtB,UAAU,EAAE,UAAU,EACtB,YAAY,EAAE,YAAY,EAC1B,aAAa,EAAE,aAAa,EAC5B,uBAAuB,EAAE,OAAO,EAChC,8BAA8B,CAAC,EAAE,8BAA8B;IAGzE;;;;OAIG;IACH,OAAO,CAAC,6BAA6B;IASxB,WAAW,CACtB,GAAG,EAAE,aAAa,EAClB,cAAc,EAAE,sBAAsB,EACtC,YAAY,CAAC,EAAE,YAAY,EAC3B,gBAAgB,CAAC,EAAE,MAAM,EACzB,cAAc,CAAC,EAAE,cAAc,GAC9B,OAAO,CAAC,OAAO,CAAC;IAsDnB;;;;OAIG;YACW,iBAAiB;CAyBhC"}

package/dist/browser/retry/timeoutFailoverRetryPolicy.js.map

@@ -1 +1 @@
-{"version":3,"file":"timeoutFailoverRetryPolicy.js","sourceRoot":"","sources":["../../../src/retry/timeoutFailoverRetryPolicy.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAEvD,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAE/D,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAGnD,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAK9D;;;;;;GAMG;AACH,MAAM,OAAO,0BAA0B;IAS3B;IACA;IACA;IACA;IACA;IACA;IACA;IAdF,oBAAoB,GAAG,GAAG,CAAC;IAC3B,+BAA+B,GAAG,CAAC,CAAC;IACrC,cAAc,GAAG,CAAC,CAAC;IACnB,kBAAkB,GAAG,CAAC,CAAC;IACvB,OAAO,CAAM;IACb,gBAAgB,CAAM;IAE7B,YACU,qBAA4C,EAC5C,OAAsB,EACtB,UAAsB,EACtB,YAA0B,EAC1B,aAA4B,EAC5B,uBAAgC,EAChC,8BAA+D;QAN/D,0BAAqB,GAArB,qBAAqB,CAAuB;QAC5C,YAAO,GAAP,OAAO,CAAe;QACtB,eAAU,GAAV,UAAU,CAAY;QACtB,iBAAY,GAAZ,YAAY,CAAc;QAC1B,kBAAa,GAAb,aAAa,CAAe;QAC5B,4BAAuB,GAAvB,uBAAuB,CAAS;QAChC,mCAA8B,GAA9B,8BAA8B,CAAiC;IACtE,CAAC;IAEJ;;;;OAIG;IACK,6BAA6B;QACnC,MAAM,OAAO,GAAG,SAAS,CAAC,WAAW,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC;QAC9D,MAAM,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC;QACtE,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,CAAC,GAAG,IAAI,OAAO,IAAI,WAAW,EAAE,CAAC;YACjE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,KAAK,CAAC,WAAW,CACtB,GAAkB,EAClB,cAAsC,EACtC,YAA2B,EAC3B,gBAAyB,EACzB,cAA+B;QAE/B,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,YAAY,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACvC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,uBAAuB,EAAE,CAAC;YAClC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,qCAAqC;QACrC,8DAA8D;QAC9D,IAAI,cAAc,IAAI,IAAI,CAAC,8BAA8B,EAAE,CAAC;YAC1D,MAAM,IAAI,CAAC,8BAA8B,CAAC,yBAAyB,CACjE,cAAc,EACd,cAAc,CACf,CAAC;QACJ,CAAC;QACD,iHAAiH;QACjH,IAAI,GAAG,CAAC,IAAI,KAAK,gBAAgB,IAAI,CAAC,IAAI,CAAC,6BAA6B,EAAE,EAAE,CAAC;YAC3E,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IACE,GAAG,CAAC,IAAI,KAAK,WAAW,CAAC,kBAAkB;YAC3C,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,+BAA+B,EAC/D,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YACzD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,4BAA4B,GAAG,IAAI,CAAC,qBAAqB,CAAC,4BAA4B,CAC1F,IAAI,CAAC,YAAY,EACjB,IAAI,CAAC,aAAa,CACnB,CAAC;QACF,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAEtD,IACE,CAAC,4BAA4B;YAC7B,CAAC,WAAW;YACZ,CAAC,IAAI,CAAC,8BAA8B,EAAE,wCAAwC,EAAE,EAChF,CAAC;YACD,6FAA6F;YAC7F,uEAAuE;YACvE,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC1B,2EAA2E;QAC3E,4FAA4F;QAC5F,YAAY,CAAC,wBAAwB,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC9F,cAAc,CAAC,OAAO,CAAC,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,iBAAiB,CAAC,kBAA0B;QACxD,iDAAiD;QACjD,MAAM,uBAAuB,GAAG,IAAI,CAAC,qBAAqB,CAAC,uBAAuB,CAAC;QACnF,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACtD,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,wGAAwG;QACxG,IAAI,uBAAuB,KAAK,CAAC,EAAE,CAAC;YAClC,yFAAyF;YACzF,aAAa,GAAG,kBAAkB,GAAG,uBAAuB,CAAC;QAC/D,CAAC;aAAM,CAAC;YACN,sIAAsI;YACtI,IAAI,WAAW,EAAE,CAAC;gBAChB,MAAM,gBAAgB,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,gBAAgB,EAAE,CAAC;gBAC7E,IAAI,gBAAgB,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpD,aAAa,GAAG,kBAAkB,GAAG,gBAAgB,CAAC,MAAM,CAAC;gBAC/D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,iBAAiB,EAAE,CAAC;gBAC/E,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACtD,aAAa,GAAG,kBAAkB,GAAG,iBAAiB,CAAC,MAAM,CAAC;gBAChE,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { RetryPolicy } from \"./RetryPolicy.js\";\nimport { StatusCodes } from \"../common/statusCodes.js\";\nimport type { GlobalEndpointManager } from \"../globalEndpointManager.js\";\nimport { HTTPMethod, isReadRequest } from \"../common/index.js\";\nimport type { OperationType, ResourceType } from \"../common/constants.js\";\nimport { Constants } from \"../common/constants.js\";\nimport type { RetryContext } from \"./RetryContext.js\";\nimport type { CosmosHeaders } from \"../queryExecutionContext/CosmosHeaders.js\";\nimport { TimeoutErrorCode } from \"../request/TimeoutError.js\";\nimport type { ErrorResponse, RequestContext } from \"../request/index.js\";\nimport type { DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport { GlobalPartitionEndpointManager } from \"../globalPartitionEndpointManager.js\";\n\n/**\n * This class TimeoutFailoverRetryPolicy handles retries for read operations\n * (including data plane,metadata, and query plan) in case of request timeouts\n * (TimeoutError) or service unavailability (503 status code) by performing failover\n * and retrying on other regions.\n * @hidden\n */\nexport class TimeoutFailoverRetryPolicy implements RetryPolicy {\n  private maxRetryAttemptCount = 120;\n  private maxServiceUnavailableRetryCount = 1;\n  public retryAfterInMs = 0;\n  public failoverRetryCount = 0;\n  public request: any;\n  public locationEndpoint: any;\n\n  constructor(\n    private globalEndpointManager: GlobalEndpointManager,\n    private headers: CosmosHeaders,\n    private methodType: HTTPMethod,\n    private resourceType: ResourceType,\n    private operationType: OperationType,\n    private enableEndPointDiscovery: boolean,\n    private globalPartitionEndpointManager?: GlobalPartitionEndpointManager,\n  ) {}\n\n  /**\n   * Checks if a timeout request is valid for the timeout failover retry policy.\n   * A valid request should be a data plane, metadata, or query plan request.\n   * @returns\n   */\n  private isValidRequestForTimeoutError(): boolean {\n    const isQuery = Constants.HttpHeaders.IsQuery in this.headers;\n    const isQueryPlan = Constants.HttpHeaders.IsQueryPlan in this.headers;\n    if (this.methodType === HTTPMethod.get || isQuery || isQueryPlan) {\n      return true;\n    }\n    return false;\n  }\n\n  public async shouldRetry(\n    err: ErrorResponse,\n    diagnosticNode: DiagnosticNodeInternal,\n    retryContext?: RetryContext,\n    locationEndpoint?: string,\n    requestContext?: RequestContext,\n  ): Promise<boolean> {\n    if (!err) {\n      return false;\n    }\n    if (!retryContext || !locationEndpoint) {\n      return false;\n    }\n    if (!this.enableEndPointDiscovery) {\n      return false;\n    }\n    // Mark the partition as unavailable.\n    // Let the Retry logic decide if the request should be retried\n    if (requestContext && this.globalPartitionEndpointManager) {\n      await this.globalPartitionEndpointManager.tryPartitionLevelFailover(\n        requestContext,\n        diagnosticNode,\n      );\n    }\n    // Check if the error is a timeout error (TimeoutErrorCode) and if it is not a valid HTTP network timeout request\n    if (err.code === TimeoutErrorCode && !this.isValidRequestForTimeoutError()) {\n      return false;\n    }\n    if (\n      err.code === StatusCodes.ServiceUnavailable &&\n      this.failoverRetryCount >= this.maxServiceUnavailableRetryCount\n    ) {\n      return false;\n    }\n    if (this.failoverRetryCount >= this.maxRetryAttemptCount) {\n      return false;\n    }\n    const canUseMultipleWriteLocations = this.globalEndpointManager.canUseMultipleWriteLocations(\n      this.resourceType,\n      this.operationType,\n    );\n    const readRequest = isReadRequest(this.operationType);\n\n    if (\n      !canUseMultipleWriteLocations &&\n      !readRequest &&\n      !this.globalPartitionEndpointManager?.isPartitionLevelAutomaticFailoverEnabled()\n    ) {\n      // Write requests on single master cannot be retried if partition level failover is disabled.\n      // This means there are no other regions available to serve the writes.\n      return false;\n    }\n    this.failoverRetryCount++;\n    // Setting the retryLocationIndex to the next available location for retry.\n    // The retryLocationIndex is determined based on the failoverRetryCount, starting from zero.\n    retryContext.retryLocationServerIndex = await this.findEndpointIndex(this.failoverRetryCount);\n    diagnosticNode.addData({ successfulRetryPolicy: \"timeout-failover\" });\n    return true;\n  }\n\n  /**\n   * Determines index of endpoint to be used for retry based upon failoverRetryCount and avalable locations\n   * @param failoverRetryCount - count of failovers\n   * @returns\n   */\n  private async findEndpointIndex(failoverRetryCount: number): Promise<number> {\n    // count of preferred locations specified by user\n    const preferredLocationsCount = this.globalEndpointManager.preferredLocationsCount;\n    const readRequest = isReadRequest(this.operationType);\n    let endpointIndex = 0;\n    // If preferredLocationsCount is not zero, it indicates that the user has specified preferred locations.\n    if (preferredLocationsCount !== 0) {\n      // The endpointIndex is set based on the preferred location and the failover retry count.\n      endpointIndex = failoverRetryCount % preferredLocationsCount;\n    } else {\n      // In the absence of preferred locations, the endpoint selection is based on the failover count and the number of available locations.\n      if (readRequest) {\n        const getReadEndpoints = await this.globalEndpointManager.getReadEndpoints();\n        if (getReadEndpoints && getReadEndpoints.length > 0) {\n          endpointIndex = failoverRetryCount % getReadEndpoints.length;\n        }\n      } else {\n        const getWriteEndpoints = await this.globalEndpointManager.getWriteEndpoints();\n        if (getWriteEndpoints && getWriteEndpoints.length > 0) {\n          endpointIndex = failoverRetryCount % getWriteEndpoints.length;\n        }\n      }\n    }\n    return endpointIndex;\n  }\n}\n"]}
+{"version":3,"file":"timeoutFailoverRetryPolicy.js","sourceRoot":"","sources":["../../../src/retry/timeoutFailoverRetryPolicy.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAEvD,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAE/D,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAGnD,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAK9D;;;;;;GAMG;AACH,MAAM,OAAO,0BAA0B;IAS3B;IACA;IACA;IACA;IACA;IACA;IACA;IAdF,oBAAoB,GAAG,GAAG,CAAC;IAC3B,+BAA+B,GAAG,CAAC,CAAC;IACrC,cAAc,GAAG,CAAC,CAAC;IACnB,kBAAkB,GAAG,CAAC,CAAC;IACvB,OAAO,CAAM;IACb,gBAAgB,CAAM;IAE7B,YACU,qBAA4C,EAC5C,OAAsB,EACtB,UAAsB,EACtB,YAA0B,EAC1B,aAA4B,EAC5B,uBAAgC,EAChC,8BAA+D;QAN/D,0BAAqB,GAArB,qBAAqB,CAAuB;QAC5C,YAAO,GAAP,OAAO,CAAe;QACtB,eAAU,GAAV,UAAU,CAAY;QACtB,iBAAY,GAAZ,YAAY,CAAc;QAC1B,kBAAa,GAAb,aAAa,CAAe;QAC5B,4BAAuB,GAAvB,uBAAuB,CAAS;QAChC,mCAA8B,GAA9B,8BAA8B,CAAiC;IACtE,CAAC;IAEJ;;;;OAIG;IACK,6BAA6B;QACnC,MAAM,OAAO,GAAG,SAAS,CAAC,WAAW,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC;QAC9D,MAAM,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC;QACtE,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,CAAC,GAAG,IAAI,OAAO,IAAI,WAAW,EAAE,CAAC;YACjE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,KAAK,CAAC,WAAW,CACtB,GAAkB,EAClB,cAAsC,EACtC,YAA2B,EAC3B,gBAAyB,EACzB,cAA+B;QAE/B,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,YAAY,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACvC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,uBAAuB,EAAE,CAAC;YAClC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,qCAAqC;QACrC,8DAA8D;QAC9D,IAAI,cAAc,IAAI,IAAI,CAAC,8BAA8B,EAAE,CAAC;YAC1D,MAAM,IAAI,CAAC,8BAA8B,CAAC,yBAAyB,CACjE,cAAc,EACd,cAAc,CACf,CAAC;QACJ,CAAC;QACD,iHAAiH;QACjH,IAAI,GAAG,CAAC,IAAI,KAAK,gBAAgB,IAAI,CAAC,IAAI,CAAC,6BAA6B,EAAE,EAAE,CAAC;YAC3E,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IACE,GAAG,CAAC,IAAI,KAAK,WAAW,CAAC,kBAAkB;YAC3C,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,+BAA+B,EAC/D,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YACzD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,4BAA4B,GAAG,IAAI,CAAC,qBAAqB,CAAC,4BAA4B,CAC1F,IAAI,CAAC,YAAY,EACjB,IAAI,CAAC,aAAa,CACnB,CAAC;QACF,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAEtD,IACE,CAAC,4BAA4B;YAC7B,CAAC,WAAW;YACZ,CAAC,IAAI,CAAC,8BAA8B,EAAE,wCAAwC,EAAE,EAChF,CAAC;YACD,6FAA6F;YAC7F,uEAAuE;YACvE,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC1B,2EAA2E;QAC3E,4FAA4F;QAC5F,YAAY,CAAC,wBAAwB,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC9F,cAAc,CAAC,OAAO,CAAC,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,iBAAiB,CAAC,kBAA0B;QACxD,iDAAiD;QACjD,MAAM,uBAAuB,GAAG,IAAI,CAAC,qBAAqB,CAAC,uBAAuB,CAAC;QACnF,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACtD,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,wGAAwG;QACxG,IAAI,uBAAuB,KAAK,CAAC,EAAE,CAAC;YAClC,yFAAyF;YACzF,aAAa,GAAG,kBAAkB,GAAG,uBAAuB,CAAC;QAC/D,CAAC;aAAM,CAAC;YACN,sIAAsI;YACtI,IAAI,WAAW,EAAE,CAAC;gBAChB,MAAM,gBAAgB,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,gBAAgB,EAAE,CAAC;gBAC7E,IAAI,gBAAgB,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpD,aAAa,GAAG,kBAAkB,GAAG,gBAAgB,CAAC,MAAM,CAAC;gBAC/D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,iBAAiB,EAAE,CAAC;gBAC/E,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACtD,aAAa,GAAG,kBAAkB,GAAG,iBAAiB,CAAC,MAAM,CAAC;gBAChE,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { RetryPolicy } from \"./RetryPolicy.js\";\nimport { StatusCodes } from \"../common/statusCodes.js\";\nimport type { GlobalEndpointManager } from \"../globalEndpointManager.js\";\nimport { HTTPMethod, isReadRequest } from \"../common/index.js\";\nimport type { OperationType, ResourceType } from \"../common/constants.js\";\nimport { Constants } from \"../common/constants.js\";\nimport type { RetryContext } from \"./RetryContext.js\";\nimport type { CosmosHeaders } from \"../queryExecutionContext/CosmosHeaders.js\";\nimport { TimeoutErrorCode } from \"../request/TimeoutError.js\";\nimport type { ErrorResponse, RequestContext } from \"../request/index.js\";\nimport type { DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport type { GlobalPartitionEndpointManager } from \"../globalPartitionEndpointManager.js\";\n\n/**\n * This class TimeoutFailoverRetryPolicy handles retries for read operations\n * (including data plane,metadata, and query plan) in case of request timeouts\n * (TimeoutError) or service unavailability (503 status code) by performing failover\n * and retrying on other regions.\n * @hidden\n */\nexport class TimeoutFailoverRetryPolicy implements RetryPolicy {\n  private maxRetryAttemptCount = 120;\n  private maxServiceUnavailableRetryCount = 1;\n  public retryAfterInMs = 0;\n  public failoverRetryCount = 0;\n  public request: any;\n  public locationEndpoint: any;\n\n  constructor(\n    private globalEndpointManager: GlobalEndpointManager,\n    private headers: CosmosHeaders,\n    private methodType: HTTPMethod,\n    private resourceType: ResourceType,\n    private operationType: OperationType,\n    private enableEndPointDiscovery: boolean,\n    private globalPartitionEndpointManager?: GlobalPartitionEndpointManager,\n  ) {}\n\n  /**\n   * Checks if a timeout request is valid for the timeout failover retry policy.\n   * A valid request should be a data plane, metadata, or query plan request.\n   * @returns\n   */\n  private isValidRequestForTimeoutError(): boolean {\n    const isQuery = Constants.HttpHeaders.IsQuery in this.headers;\n    const isQueryPlan = Constants.HttpHeaders.IsQueryPlan in this.headers;\n    if (this.methodType === HTTPMethod.get || isQuery || isQueryPlan) {\n      return true;\n    }\n    return false;\n  }\n\n  public async shouldRetry(\n    err: ErrorResponse,\n    diagnosticNode: DiagnosticNodeInternal,\n    retryContext?: RetryContext,\n    locationEndpoint?: string,\n    requestContext?: RequestContext,\n  ): Promise<boolean> {\n    if (!err) {\n      return false;\n    }\n    if (!retryContext || !locationEndpoint) {\n      return false;\n    }\n    if (!this.enableEndPointDiscovery) {\n      return false;\n    }\n    // Mark the partition as unavailable.\n    // Let the Retry logic decide if the request should be retried\n    if (requestContext && this.globalPartitionEndpointManager) {\n      await this.globalPartitionEndpointManager.tryPartitionLevelFailover(\n        requestContext,\n        diagnosticNode,\n      );\n    }\n    // Check if the error is a timeout error (TimeoutErrorCode) and if it is not a valid HTTP network timeout request\n    if (err.code === TimeoutErrorCode && !this.isValidRequestForTimeoutError()) {\n      return false;\n    }\n    if (\n      err.code === StatusCodes.ServiceUnavailable &&\n      this.failoverRetryCount >= this.maxServiceUnavailableRetryCount\n    ) {\n      return false;\n    }\n    if (this.failoverRetryCount >= this.maxRetryAttemptCount) {\n      return false;\n    }\n    const canUseMultipleWriteLocations = this.globalEndpointManager.canUseMultipleWriteLocations(\n      this.resourceType,\n      this.operationType,\n    );\n    const readRequest = isReadRequest(this.operationType);\n\n    if (\n      !canUseMultipleWriteLocations &&\n      !readRequest &&\n      !this.globalPartitionEndpointManager?.isPartitionLevelAutomaticFailoverEnabled()\n    ) {\n      // Write requests on single master cannot be retried if partition level failover is disabled.\n      // This means there are no other regions available to serve the writes.\n      return false;\n    }\n    this.failoverRetryCount++;\n    // Setting the retryLocationIndex to the next available location for retry.\n    // The retryLocationIndex is determined based on the failoverRetryCount, starting from zero.\n    retryContext.retryLocationServerIndex = await this.findEndpointIndex(this.failoverRetryCount);\n    diagnosticNode.addData({ successfulRetryPolicy: \"timeout-failover\" });\n    return true;\n  }\n\n  /**\n   * Determines index of endpoint to be used for retry based upon failoverRetryCount and avalable locations\n   * @param failoverRetryCount - count of failovers\n   * @returns\n   */\n  private async findEndpointIndex(failoverRetryCount: number): Promise<number> {\n    // count of preferred locations specified by user\n    const preferredLocationsCount = this.globalEndpointManager.preferredLocationsCount;\n    const readRequest = isReadRequest(this.operationType);\n    let endpointIndex = 0;\n    // If preferredLocationsCount is not zero, it indicates that the user has specified preferred locations.\n    if (preferredLocationsCount !== 0) {\n      // The endpointIndex is set based on the preferred location and the failover retry count.\n      endpointIndex = failoverRetryCount % preferredLocationsCount;\n    } else {\n      // In the absence of preferred locations, the endpoint selection is based on the failover count and the number of available locations.\n      if (readRequest) {\n        const getReadEndpoints = await this.globalEndpointManager.getReadEndpoints();\n        if (getReadEndpoints && getReadEndpoints.length > 0) {\n          endpointIndex = failoverRetryCount % getReadEndpoints.length;\n        }\n      } else {\n        const getWriteEndpoints = await this.globalEndpointManager.getWriteEndpoints();\n        if (getWriteEndpoints && getWriteEndpoints.length > 0) {\n          endpointIndex = failoverRetryCount % getWriteEndpoints.length;\n        }\n      }\n    }\n    return endpointIndex;\n  }\n}\n"]}

package/dist/browser/utils/atob.d.ts

@@ -1,3 +1,3 @@
 declare let safeatob: (data: string) => string;
 export default safeatob;
-//# sourceMappingURL=atob-browser.d.mts.map
+//# sourceMappingURL=atob.d.ts.map

package/dist/browser/utils/atob.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"atob.d.ts","sourceRoot":"","sources":["../../../src/utils/atob.ts"],"names":[],"mappings":"AAGA,QAAA,IAAI,QAAQ,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,CAAC;AA8CvC,eAAe,QAAQ,CAAC"}

package/dist/browser/utils/atob.js

@@ -41,4 +41,4 @@ else {
     safeatob = atob;
 }
 export default safeatob;
-//# sourceMappingURL=atob-browser.mjs.map
+//# sourceMappingURL=atob.js.map

package/dist/browser/utils/atob.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"atob.js","sourceRoot":"","sources":["../../../src/utils/atob.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC,IAAI,QAAkC,CAAC;AAEvC,mDAAmD;AACnD,MAAM,GAAG,GAAG,mEAAmE,CAAC;AAChF,2EAA2E;AAC3E,MAAM,KAAK,GAAG,sEAAsE,CAAC;AAErF,IAAI,UAAU,KAAK,OAAO,IAAI,EAAE,CAAC;IAC/B,uCAAuC;IACvC,QAAQ,GAAG,CAAC,GAAW,EAAU,EAAE;QACjC,6EAA6E;QAC7E,0DAA0D;QAC1D,IAAI,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;QACxD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,IAAI,SAAS,CACjB,0FAA0F,CAC3F,CAAC;QACJ,CAAC;QAED,gDAAgD;QAChD,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAClD,IAAI,MAAM,CAAC;QACX,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,CAAC;QACP,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAI,CAAC;YAC7B,MAAM;gBACJ,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;oBACzC,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;oBACzC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAC/C,CAAC,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAE3C,MAAM;gBACJ,EAAE,KAAK,EAAE;oBACP,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC;oBAC3C,CAAC,CAAC,EAAE,KAAK,EAAE;wBACT,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;wBAChE,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC;QACvF,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;AACJ,CAAC;KAAM,CAAC;IACN,QAAQ,GAAG,IAAI,CAAC;AAClB,CAAC;AAED,eAAe,QAAQ,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nlet safeatob: (data: string) => string;\n\n// base64 character set, plus padding character (=)\nconst b64 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=\";\n// Regular expression to check formal correctness of base64 encoded strings\nconst b64re = /^(?:[A-Za-z\\d+/]{4})*?(?:[A-Za-z\\d+/]{2}(?:==)?|[A-Za-z\\d+/]{3}=?)?$/;\n\nif (\"function\" !== typeof atob) {\n  // atob implementation for React Native\n  safeatob = (str: string): string => {\n    // atob can work with strings with whitespaces, even inside the encoded part,\n    // but only \\t, \\n, \\f, \\r and ' ', which can be stripped.\n    let fixedStr = String(str).replace(/[\\t\\n\\f\\r ]+/g, \"\");\n    if (!b64re.test(str)) {\n      throw new TypeError(\n        \"Failed to execute 'atob' on 'Window': The string to be decoded is not correctly encoded.\",\n      );\n    }\n\n    // Adding the padding if missing, for simplicity\n    fixedStr += \"==\".slice(2 - (fixedStr.length & 3));\n    let bitmap;\n    let result = \"\";\n    let r1;\n    let r2;\n    let i = 0;\n    for (; i < fixedStr.length; ) {\n      bitmap =\n        (b64.indexOf(fixedStr.charAt(i++)) << 18) |\n        (b64.indexOf(fixedStr.charAt(i++)) << 12) |\n        ((r1 = b64.indexOf(fixedStr.charAt(i++))) << 6) |\n        (r2 = b64.indexOf(fixedStr.charAt(i++)));\n\n      result +=\n        r1 === 64\n          ? String.fromCharCode((bitmap >> 16) & 255)\n          : r2 === 64\n            ? String.fromCharCode((bitmap >> 16) & 255, (bitmap >> 8) & 255)\n            : String.fromCharCode((bitmap >> 16) & 255, (bitmap >> 8) & 255, bitmap & 255);\n    }\n    return result;\n  };\n} else {\n  safeatob = atob;\n}\n\nexport default safeatob;\n"]}

package/dist/browser/utils/digest.d.ts

@@ -1,2 +1,2 @@
 export declare function digest(str: string): Promise<string>;
-//# sourceMappingURL=digest-browser.d.mts.map
+//# sourceMappingURL=digest.d.ts.map

package/dist/browser/utils/digest.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"digest.d.ts","sourceRoot":"","sources":["../../../src/utils/digest.ts"],"names":[],"mappings":"AAMA,wBAAsB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAIzD"}

package/dist/browser/utils/digest.js

@@ -12,4 +12,4 @@ function bufferToHex(buffer) {
         .call(new Uint8Array(buffer), (item) => ("00" + item.toString(16)).slice(-2))
         .join("");
 }
-//# sourceMappingURL=digest-browser.mjs.map
+//# sourceMappingURL=digest.js.map

package/dist/browser/utils/digest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"digest.js","sourceRoot":"","sources":["../../../src/utils/digest.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEjD,MAAM,CAAC,KAAK,UAAU,MAAM,CAAC,GAAW;IACtC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,MAAM,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IAC/D,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC;AAED,SAAS,WAAW,CAAC,MAAmB;IACtC,OAAO,KAAK,CAAC,SAAS,CAAC,GAAG;SACvB,IAAI,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,IAAY,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;SACpF,IAAI,CAAC,EAAE,CAAC,CAAC;AACd,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { encodeUTF8 } from \"./encode.js\";\nimport { globalCrypto } from \"./globalCrypto.js\";\n\nexport async function digest(str: string): Promise<string> {\n  const data = encodeUTF8(str);\n  const hash = await globalCrypto.subtle.digest(\"SHA-256\", data);\n  return bufferToHex(hash);\n}\n\nfunction bufferToHex(buffer: ArrayBuffer): string {\n  return Array.prototype.map\n    .call(new Uint8Array(buffer), (item: number) => (\"00\" + item.toString(16)).slice(-2))\n    .join(\"\");\n}\n"]}

package/dist/browser/utils/envUtils.d.ts

@@ -1,2 +1,2 @@
 export declare const diagnosticLevelFromEnv: string | undefined;
-//# sourceMappingURL=envUtils-browser.d.mts.map
+//# sourceMappingURL=envUtils.d.ts.map

package/dist/browser/utils/envUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"envUtils.d.ts","sourceRoot":"","sources":["../../../src/utils/envUtils.ts"],"names":[],"mappings":"AAGA,eAAO,MAAM,sBAAsB,EAAE,MAAM,GAAG,SAAqB,CAAC"}

package/dist/browser/utils/envUtils.js

@@ -1,4 +1,4 @@
 // Copyright (c) Microsoft Corporation.
 // Licensed under the MIT License.
 export const diagnosticLevelFromEnv = undefined;
-//# sourceMappingURL=envUtils-browser.mjs.map
+//# sourceMappingURL=envUtils.js.map

package/dist/browser/utils/envUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"envUtils.js","sourceRoot":"","sources":["../../../src/utils/envUtils.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC,MAAM,CAAC,MAAM,sBAAsB,GAAuB,SAAS,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nexport const diagnosticLevelFromEnv: string | undefined = undefined;\n"]}

package/dist/browser/utils/hashing/hash.d.ts

@@ -1,4 +1,4 @@
-import { PartitionKeyRange } from "../../client/index.js";
+import type { PartitionKeyRange } from "../../client/index.js";
 import type { PartitionKeyDefinition, PrimitivePartitionKeyValue } from "../../documents/index.js";
 /**
  * Generate hash of a PartitonKey based on it PartitionKeyDefinition.

package/dist/browser/utils/hashing/hash.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../../../src/utils/hashing/hash.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,KAAK,EAAE,sBAAsB,EAAE,0BAA0B,EAAE,MAAM,0BAA0B,CAAC;AAOnG;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,YAAY,EAAE,0BAA0B,EAAE,EAC1C,mBAAmB,EAAE,sBAAsB,GAC1C,MAAM,CAYR;AAED,wBAAgB,gCAAgC,CAC9C,kBAAkB,EAAE,iBAAiB,EAAE,EACvC,kBAAkB,EAAE,MAAM,GACzB,MAAM,GAAG,SAAS,CAiBpB"}
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../../../src/utils/hashing/hash.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC/D,OAAO,KAAK,EAAE,sBAAsB,EAAE,0BAA0B,EAAE,MAAM,0BAA0B,CAAC;AAOnG;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,YAAY,EAAE,0BAA0B,EAAE,EAC1C,mBAAmB,EAAE,sBAAsB,GAC1C,MAAM,CAYR;AAED,wBAAgB,gCAAgC,CAC9C,kBAAkB,EAAE,iBAAiB,EAAE,EACvC,kBAAkB,EAAE,MAAM,GACzB,MAAM,GAAG,SAAS,CAiBpB"}