@azure/cosmos 4.8.0 → 4.9.0

package/dist/browser/queryExecutionContext/EndpointComponent/OrderByEndpointComponent.js.map

@@ -1 +1 @@
-{"version":3,"file":"OrderByEndpointComponent.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/OrderByEndpointComponent.ts"],"names":[],"mappings":"AAMA,cAAc;AACd,MAAM,OAAO,wBAAwB;IASzB;IACA;IATV;;;;;;OAMG;IACH,YACU,gBAAkC,EAClC,wBAAiC,KAAK;QADtC,qBAAgB,GAAhB,gBAAgB,CAAkB;QAClC,0BAAqB,GAArB,qBAAqB,CAAiB;IAC7C,CAAC;IACJ;;;OAGG;IACI,cAAc;QACnB,OAAO,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC;IAChD,CAAC;IAEM,KAAK,CAAC,SAAS,CAAC,cAAuC;QAC5D,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACvE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC5D,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC1D,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YACnC,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;gBAC/B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;IACvD,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { DiagnosticNodeInternal } from \"../../diagnostics/DiagnosticNodeInternal.js\";\nimport type { Response } from \"../../request/index.js\";\nimport type { ExecutionContext } from \"../ExecutionContext.js\";\n\n/** @hidden */\nexport class OrderByEndpointComponent implements ExecutionContext {\n  /**\n   * Represents an endpoint in handling an order by query. For each processed orderby\n   * result it returns 'payload' item of the result\n   *\n   * @param executionContext - Underlying Execution Context\n   * @hidden\n   */\n  constructor(\n    private executionContext: ExecutionContext,\n    private emitRawOrderByPayload: boolean = false,\n  ) {}\n  /**\n   * Determine if there are still remaining resources to processs.\n   * @returns true if there is other elements to process in the OrderByEndpointComponent.\n   */\n  public hasMoreResults(): boolean {\n    return this.executionContext.hasMoreResults();\n  }\n\n  public async fetchMore(diagnosticNode?: DiagnosticNodeInternal): Promise<Response<any>> {\n    const buffer: any[] = [];\n    const response = await this.executionContext.fetchMore(diagnosticNode);\n    if (response === undefined || response.result === undefined) {\n      return { result: undefined, headers: response.headers };\n    }\n    for (const item of response.result) {\n      if (this.emitRawOrderByPayload) {\n        buffer.push(item);\n      } else {\n        buffer.push(item.payload);\n      }\n    }\n\n    return { result: buffer, headers: response.headers };\n  }\n}\n"]}
+{"version":3,"file":"OrderByEndpointComponent.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/OrderByEndpointComponent.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,yBAAyB,EAAE,MAAM,2BAA2B,CAAC;AAGtE,cAAc;AACd,MAAM,OAAO,wBAAwB;IAUzB;IACA;IAVV;;;;;;;OAOG;IACH,YACU,gBAAkC,EAClC,wBAAiC,KAAK;QADtC,qBAAgB,GAAhB,gBAAgB,CAAkB;QAClC,0BAAqB,GAArB,qBAAqB,CAAiB;IAC7C,CAAC;IACJ;;;OAGG;IACI,cAAc;QACnB,OAAO,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC;IAChD,CAAC;IAEM,KAAK,CAAC,SAAS,CAAC,cAAuC;QAC5D,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,MAAM,iBAAiB,GAAyB,EAAE,CAAC,CAAC,qCAAqC;QAEzF,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACvE,IACE,CAAC,QAAQ;YACT,CAAC,QAAQ,CAAC,MAAM;YAChB,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;YACtC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;YACD,6FAA6F;YAC7F,gFAAgF;YAChF,MAAM,cAAc,GAAG,QAAQ,EAAE,MAA6B,CAAC;YAC/D,MAAM,MAAM,GAAG,yBAAyB,CACtC,EAAE,EACF,cAAc,EAAE,oBAAoB,IAAI,IAAI,GAAG,EAAE,EACjD,cAAc,EAAE,yBAAyB,IAAI,EAAE,EAC/C,EAAE,CACH,CAAC;YACF,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;QAChD,CAAC;QAED,MAAM,cAAc,GAAG,QAAQ,CAAC,MAA6B,CAAC;QAC9D,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,CAAC;QACxC,MAAM,oBAAoB,GAAG,cAAc,CAAC,oBAAoB,CAAC;QACjE,MAAM,yBAAyB,GAAG,cAAc,CAAC,yBAAyB,CAAC;QAE3E,gEAAgE;QAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;gBAC/B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC5B,CAAC;YACD,iBAAiB,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/E,CAAC;QAED,MAAM,MAAM,GAAG,yBAAyB,CACtC,MAAM,EACN,oBAAoB,EACpB,yBAAyB,EACzB,iBAAiB,CAClB,CAAC;QAEF,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;IAC/C,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { DiagnosticNodeInternal } from \"../../diagnostics/DiagnosticNodeInternal.js\";\nimport type { Response } from \"../../request/index.js\";\nimport type { ExecutionContext } from \"../ExecutionContext.js\";\nimport type { ParallelQueryResult } from \"../parallelQueryResult.js\";\nimport { createParallelQueryResult } from \"../parallelQueryResult.js\";\nimport type { OrderByItemWithRid } from \"../parallelQueryResult.js\";\n\n/** @hidden */\nexport class OrderByEndpointComponent implements ExecutionContext {\n  /**\n   * Represents an endpoint in handling an order by query. For each processed orderby\n   * result it returns 'payload' item of the result\n   *\n   * @param executionContext - Underlying Execution Context\n   * @param emitRawOrderByPayload - Whether to emit raw order by payload\n   * @hidden\n   */\n  constructor(\n    private executionContext: ExecutionContext,\n    private emitRawOrderByPayload: boolean = false,\n  ) {}\n  /**\n   * Determine if there are still remaining resources to processs.\n   * @returns true if there is other elements to process in the OrderByEndpointComponent.\n   */\n  public hasMoreResults(): boolean {\n    return this.executionContext.hasMoreResults();\n  }\n\n  public async fetchMore(diagnosticNode?: DiagnosticNodeInternal): Promise<Response<any>> {\n    const buffer: any[] = [];\n    const orderByItemsArray: OrderByItemWithRid[] = []; // Store order by items for each item\n\n    const response = await this.executionContext.fetchMore(diagnosticNode);\n    if (\n      !response ||\n      !response.result ||\n      !Array.isArray(response.result.buffer) ||\n      response.result.buffer.length === 0\n    ) {\n      // Preserve the partitionKeyRangeMap and updatedContinuationRanges from the original response\n      // even when the buffer is empty, as they contain continuation token information\n      const originalResult = response?.result as ParallelQueryResult;\n      const result = createParallelQueryResult(\n        [],\n        originalResult?.partitionKeyRangeMap || new Map(),\n        originalResult?.updatedContinuationRanges || {},\n        [],\n      );\n      return { result, headers: response?.headers };\n    }\n\n    const parallelResult = response.result as ParallelQueryResult;\n    const rawBuffer = parallelResult.buffer;\n    const partitionKeyRangeMap = parallelResult.partitionKeyRangeMap;\n    const updatedContinuationRanges = parallelResult.updatedContinuationRanges;\n\n    // Process buffer items and collect order by items for each item\n    for (let i = 0; i < rawBuffer.length; i++) {\n      const item = rawBuffer[i];\n      if (this.emitRawOrderByPayload) {\n        buffer.push(item);\n      } else {\n        buffer.push(item.payload);\n      }\n      orderByItemsArray.push({ orderByItems: item.orderByItems, _rid: item._rid });\n    }\n\n    const result = createParallelQueryResult(\n      buffer,\n      partitionKeyRangeMap,\n      updatedContinuationRanges,\n      orderByItemsArray,\n    );\n\n    return { result, headers: response.headers };\n  }\n}\n"]}

package/dist/browser/queryExecutionContext/EndpointComponent/OrderedDistinctEndpointComponent.d.ts

@@ -5,7 +5,7 @@ import type { DiagnosticNodeInternal } from "../../diagnostics/DiagnosticNodeInt
 export declare class OrderedDistinctEndpointComponent implements ExecutionContext {
     private executionContext;
     private hashedLastResult;
-    constructor(executionContext: ExecutionContext);
+    constructor(executionContext: ExecutionContext, hashedLastResult?: string);
     hasMoreResults(): boolean;
     fetchMore(diagnosticNode?: DiagnosticNodeInternal): Promise<Response<any>>;
 }

package/dist/browser/queryExecutionContext/EndpointComponent/OrderedDistinctEndpointComponent.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"OrderedDistinctEndpointComponent.d.ts","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/OrderedDistinctEndpointComponent.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE/D,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,6CAA6C,CAAC;AAE1F,cAAc;AACd,qBAAa,gCAAiC,YAAW,gBAAgB;IAE3D,OAAO,CAAC,gBAAgB;IADpC,OAAO,CAAC,gBAAgB,CAAS;gBACb,gBAAgB,EAAE,gBAAgB;IAE/C,cAAc,IAAI,OAAO;IAInB,SAAS,CAAC,cAAc,CAAC,EAAE,sBAAsB,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;CAiBxF"}
+{"version":3,"file":"OrderedDistinctEndpointComponent.d.ts","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/OrderedDistinctEndpointComponent.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE/D,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,6CAA6C,CAAC;AAI1F,cAAc;AACd,qBAAa,gCAAiC,YAAW,gBAAgB;IAIrE,OAAO,CAAC,gBAAgB;IAH1B,OAAO,CAAC,gBAAgB,CAAS;gBAGvB,gBAAgB,EAAE,gBAAgB,EAC1C,gBAAgB,CAAC,EAAE,MAAM;IAKpB,cAAc,IAAI,OAAO;IAInB,SAAS,CAAC,cAAc,CAAC,EAAE,sBAAsB,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;CAiDxF"}

package/dist/browser/queryExecutionContext/EndpointComponent/OrderedDistinctEndpointComponent.js

@@ -1,10 +1,13 @@
 import { hashObject } from "../../utils/hashObject.js";
+import { createParallelQueryResult } from "../parallelQueryResult.js";
+import { processDistinctQueryAndUpdateRangeMap } from "../PartitionRangeUtils.js";
 /** @hidden */
 export class OrderedDistinctEndpointComponent {
     executionContext;
     hashedLastResult;
-    constructor(executionContext) {
+    constructor(executionContext, hashedLastResult) {
         this.executionContext = executionContext;
+        this.hashedLastResult = hashedLastResult;
     }
     hasMoreResults() {
         return this.executionContext.hasMoreResults();
@@ -12,10 +15,19 @@ export class OrderedDistinctEndpointComponent {
     async fetchMore(diagnosticNode) {
         const buffer = [];
         const response = await this.executionContext.fetchMore(diagnosticNode);
-        if (response === undefined || response.result === undefined) {
-            return { result: undefined, headers: response.headers };
+        if (!response ||
+            !response.result ||
+            !Array.isArray(response.result.buffer) ||
+            response.result.buffer.length === 0) {
+            return { result: response.result, headers: response.headers };
         }
-        for (const item of response.result) {
+        const parallelResult = response.result;
+        const dataToProcess = parallelResult.buffer;
+        const partitionKeyRangeMap = parallelResult.partitionKeyRangeMap;
+        const updatedContinuationRanges = parallelResult.updatedContinuationRanges;
+        const orderByItems = parallelResult.orderByItems;
+        // Process each item and maintain hashedLastResult for distinct filtering
+        for (const item of dataToProcess) {
             if (item) {
                 const hashedResult = await hashObject(item);
                 if (hashedResult !== this.hashedLastResult) {
@@ -24,7 +36,14 @@ export class OrderedDistinctEndpointComponent {
                 }
             }
         }
-        return { result: buffer, headers: response.headers };
+        // Process distinct query logic and update partition key range map with hashedLastResult
+        const updatedPartitionKeyRangeMap = await processDistinctQueryAndUpdateRangeMap(dataToProcess, partitionKeyRangeMap, hashObject);
+        // Return in the new structure format using the utility function
+        const result = createParallelQueryResult(buffer, updatedPartitionKeyRangeMap, updatedContinuationRanges, orderByItems);
+        return {
+            result,
+            headers: response.headers,
+        };
     }
 }
 //# sourceMappingURL=OrderedDistinctEndpointComponent.js.map

package/dist/browser/queryExecutionContext/EndpointComponent/OrderedDistinctEndpointComponent.js.map

@@ -1 +1 @@
-{"version":3,"file":"OrderedDistinctEndpointComponent.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/OrderedDistinctEndpointComponent.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAGvD,cAAc;AACd,MAAM,OAAO,gCAAgC;IAEvB;IADZ,gBAAgB,CAAS;IACjC,YAAoB,gBAAkC;QAAlC,qBAAgB,GAAhB,gBAAgB,CAAkB;IAAG,CAAC;IAEnD,cAAc;QACnB,OAAO,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC;IAChD,CAAC;IAEM,KAAK,CAAC,SAAS,CAAC,cAAuC;QAC5D,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACvE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC5D,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC1D,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YACnC,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,CAAC;gBAC5C,IAAI,YAAY,KAAK,IAAI,CAAC,gBAAgB,EAAE,CAAC;oBAC3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAClB,IAAI,CAAC,gBAAgB,GAAG,YAAY,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;IACvD,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { Response } from \"../../request/index.js\";\nimport type { ExecutionContext } from \"../ExecutionContext.js\";\nimport { hashObject } from \"../../utils/hashObject.js\";\nimport type { DiagnosticNodeInternal } from \"../../diagnostics/DiagnosticNodeInternal.js\";\n\n/** @hidden */\nexport class OrderedDistinctEndpointComponent implements ExecutionContext {\n  private hashedLastResult: string;\n  constructor(private executionContext: ExecutionContext) {}\n\n  public hasMoreResults(): boolean {\n    return this.executionContext.hasMoreResults();\n  }\n\n  public async fetchMore(diagnosticNode?: DiagnosticNodeInternal): Promise<Response<any>> {\n    const buffer: any[] = [];\n    const response = await this.executionContext.fetchMore(diagnosticNode);\n    if (response === undefined || response.result === undefined) {\n      return { result: undefined, headers: response.headers };\n    }\n    for (const item of response.result) {\n      if (item) {\n        const hashedResult = await hashObject(item);\n        if (hashedResult !== this.hashedLastResult) {\n          buffer.push(item);\n          this.hashedLastResult = hashedResult;\n        }\n      }\n    }\n    return { result: buffer, headers: response.headers };\n  }\n}\n"]}
+{"version":3,"file":"OrderedDistinctEndpointComponent.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/OrderedDistinctEndpointComponent.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAEvD,OAAO,EAAE,yBAAyB,EAA4B,MAAM,2BAA2B,CAAC;AAChG,OAAO,EAAE,qCAAqC,EAAE,MAAM,2BAA2B,CAAC;AAElF,cAAc;AACd,MAAM,OAAO,gCAAgC;IAIjC;IAHF,gBAAgB,CAAS;IAEjC,YACU,gBAAkC,EAC1C,gBAAyB;QADjB,qBAAgB,GAAhB,gBAAgB,CAAkB;QAG1C,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;IAC3C,CAAC;IAEM,cAAc;QACnB,OAAO,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC;IAChD,CAAC;IAEM,KAAK,CAAC,SAAS,CAAC,cAAuC;QAC5D,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACvE,IACE,CAAC,QAAQ;YACT,CAAC,QAAQ,CAAC,MAAM;YAChB,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;YACtC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;YACD,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;QAChE,CAAC;QAED,MAAM,cAAc,GAAG,QAAQ,CAAC,MAA6B,CAAC;QAC9D,MAAM,aAAa,GAAU,cAAc,CAAC,MAAM,CAAC;QACnD,MAAM,oBAAoB,GAAG,cAAc,CAAC,oBAAoB,CAAC;QACjE,MAAM,yBAAyB,GAAG,cAAc,CAAC,yBAAyB,CAAC;QAC3E,MAAM,YAAY,GAAG,cAAc,CAAC,YAAY,CAAC;QAEjD,yEAAyE;QACzE,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,CAAC;gBAC5C,IAAI,YAAY,KAAK,IAAI,CAAC,gBAAgB,EAAE,CAAC;oBAC3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAClB,IAAI,CAAC,gBAAgB,GAAG,YAAY,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QAED,wFAAwF;QACxF,MAAM,2BAA2B,GAAG,MAAM,qCAAqC,CAC7E,aAAa,EACb,oBAAoB,EACpB,UAAU,CACX,CAAC;QAEF,gEAAgE;QAChE,MAAM,MAAM,GAAG,yBAAyB,CACtC,MAAM,EACN,2BAA2B,EAC3B,yBAAyB,EACzB,YAAY,CACb,CAAC;QAEF,OAAO;YACL,MAAM;YACN,OAAO,EAAE,QAAQ,CAAC,OAAO;SAC1B,CAAC;IACJ,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { Response } from \"../../request/index.js\";\nimport type { ExecutionContext } from \"../ExecutionContext.js\";\nimport { hashObject } from \"../../utils/hashObject.js\";\nimport type { DiagnosticNodeInternal } from \"../../diagnostics/DiagnosticNodeInternal.js\";\nimport { createParallelQueryResult, type ParallelQueryResult } from \"../parallelQueryResult.js\";\nimport { processDistinctQueryAndUpdateRangeMap } from \"../PartitionRangeUtils.js\";\n\n/** @hidden */\nexport class OrderedDistinctEndpointComponent implements ExecutionContext {\n  private hashedLastResult: string;\n\n  constructor(\n    private executionContext: ExecutionContext,\n    hashedLastResult?: string,\n  ) {\n    this.hashedLastResult = hashedLastResult;\n  }\n\n  public hasMoreResults(): boolean {\n    return this.executionContext.hasMoreResults();\n  }\n\n  public async fetchMore(diagnosticNode?: DiagnosticNodeInternal): Promise<Response<any>> {\n    const buffer: any[] = [];\n    const response = await this.executionContext.fetchMore(diagnosticNode);\n    if (\n      !response ||\n      !response.result ||\n      !Array.isArray(response.result.buffer) ||\n      response.result.buffer.length === 0\n    ) {\n      return { result: response.result, headers: response.headers };\n    }\n\n    const parallelResult = response.result as ParallelQueryResult;\n    const dataToProcess: any[] = parallelResult.buffer;\n    const partitionKeyRangeMap = parallelResult.partitionKeyRangeMap;\n    const updatedContinuationRanges = parallelResult.updatedContinuationRanges;\n    const orderByItems = parallelResult.orderByItems;\n\n    // Process each item and maintain hashedLastResult for distinct filtering\n    for (const item of dataToProcess) {\n      if (item) {\n        const hashedResult = await hashObject(item);\n        if (hashedResult !== this.hashedLastResult) {\n          buffer.push(item);\n          this.hashedLastResult = hashedResult;\n        }\n      }\n    }\n\n    // Process distinct query logic and update partition key range map with hashedLastResult\n    const updatedPartitionKeyRangeMap = await processDistinctQueryAndUpdateRangeMap(\n      dataToProcess,\n      partitionKeyRangeMap,\n      hashObject,\n    );\n\n    // Return in the new structure format using the utility function\n    const result = createParallelQueryResult(\n      buffer,\n      updatedPartitionKeyRangeMap,\n      updatedContinuationRanges,\n      orderByItems,\n    );\n\n    return {\n      result,\n      headers: response.headers,\n    };\n  }\n}\n"]}

package/dist/browser/queryExecutionContext/EndpointComponent/UnorderedDistinctEndpointComponent.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"UnorderedDistinctEndpointComponent.d.ts","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/UnorderedDistinctEndpointComponent.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE/D,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,6CAA6C,CAAC;AAE1F,cAAc;AACd,qBAAa,kCAAmC,YAAW,gBAAgB;IAE7D,OAAO,CAAC,gBAAgB;IADpC,OAAO,CAAC,aAAa,CAAc;gBACf,gBAAgB,EAAE,gBAAgB;IAI/C,cAAc,IAAI,OAAO;IAInB,SAAS,CAAC,cAAc,CAAC,EAAE,sBAAsB,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;CAiBxF"}
+{"version":3,"file":"UnorderedDistinctEndpointComponent.d.ts","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/UnorderedDistinctEndpointComponent.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE/D,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,6CAA6C,CAAC;AAK1F,cAAc;AACd,qBAAa,kCAAmC,YAAW,gBAAgB;IAE7D,OAAO,CAAC,gBAAgB;IADpC,OAAO,CAAC,aAAa,CAAc;gBACf,gBAAgB,EAAE,gBAAgB;IAI/C,cAAc,IAAI,OAAO;IAKnB,SAAS,CAAC,cAAc,CAAC,EAAE,sBAAsB,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;CAiCxF"}

package/dist/browser/queryExecutionContext/EndpointComponent/UnorderedDistinctEndpointComponent.js

@@ -1,4 +1,6 @@
 import { hashObject } from "../../utils/hashObject.js";
+import { createParallelQueryResult } from "../parallelQueryResult.js";
+import { getInitialHeader } from "../headerUtils.js";
 /** @hidden */
 export class UnorderedDistinctEndpointComponent {
     executionContext;
@@ -8,15 +10,25 @@ export class UnorderedDistinctEndpointComponent {
         this.hashedResults = new Set();
     }
     hasMoreResults() {
-        return this.executionContext.hasMoreResults();
+        const result = this.executionContext.hasMoreResults();
+        return result;
     }
     async fetchMore(diagnosticNode) {
         const buffer = [];
         const response = await this.executionContext.fetchMore(diagnosticNode);
-        if (response === undefined || response.result === undefined) {
-            return { result: undefined, headers: response.headers };
+        if (!response) {
+            const result = createParallelQueryResult([], new Map(), {}, undefined);
+            return { result, headers: getInitialHeader() };
         }
-        for (const item of response.result) {
+        if (response.result === undefined ||
+            !Array.isArray(response.result.buffer) ||
+            response.result.buffer.length === 0) {
+            const result = createParallelQueryResult([], new Map(), {}, undefined);
+            return { result, headers: response.headers };
+        }
+        const parallelResult = response.result;
+        const dataToProcess = parallelResult.buffer;
+        for (const item of dataToProcess) {
             if (item) {
                 const hashedResult = await hashObject(item);
                 if (!this.hashedResults.has(hashedResult)) {
@@ -25,7 +37,8 @@ export class UnorderedDistinctEndpointComponent {
                 }
             }
         }
-        return { result: buffer, headers: response.headers };
+        const result = createParallelQueryResult(buffer, new Map(), undefined, undefined);
+        return { result, headers: response.headers };
     }
 }
 //# sourceMappingURL=UnorderedDistinctEndpointComponent.js.map

package/dist/browser/queryExecutionContext/EndpointComponent/UnorderedDistinctEndpointComponent.js.map

@@ -1 +1 @@
-{"version":3,"file":"UnorderedDistinctEndpointComponent.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/UnorderedDistinctEndpointComponent.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAGvD,cAAc;AACd,MAAM,OAAO,kCAAkC;IAEzB;IADZ,aAAa,CAAc;IACnC,YAAoB,gBAAkC;QAAlC,qBAAgB,GAAhB,gBAAgB,CAAkB;QACpD,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;IACjC,CAAC;IAEM,cAAc;QACnB,OAAO,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC;IAChD,CAAC;IAEM,KAAK,CAAC,SAAS,CAAC,cAAuC;QAC5D,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACvE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC5D,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC1D,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YACnC,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,CAAC;gBAC5C,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;oBAC1C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAClB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;IACvD,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { Response } from \"../../request/index.js\";\nimport type { ExecutionContext } from \"../ExecutionContext.js\";\nimport { hashObject } from \"../../utils/hashObject.js\";\nimport type { DiagnosticNodeInternal } from \"../../diagnostics/DiagnosticNodeInternal.js\";\n\n/** @hidden */\nexport class UnorderedDistinctEndpointComponent implements ExecutionContext {\n  private hashedResults: Set<string>;\n  constructor(private executionContext: ExecutionContext) {\n    this.hashedResults = new Set();\n  }\n\n  public hasMoreResults(): boolean {\n    return this.executionContext.hasMoreResults();\n  }\n\n  public async fetchMore(diagnosticNode?: DiagnosticNodeInternal): Promise<Response<any>> {\n    const buffer: any[] = [];\n    const response = await this.executionContext.fetchMore(diagnosticNode);\n    if (response === undefined || response.result === undefined) {\n      return { result: undefined, headers: response.headers };\n    }\n    for (const item of response.result) {\n      if (item) {\n        const hashedResult = await hashObject(item);\n        if (!this.hashedResults.has(hashedResult)) {\n          buffer.push(item);\n          this.hashedResults.add(hashedResult);\n        }\n      }\n    }\n    return { result: buffer, headers: response.headers };\n  }\n}\n"]}
+{"version":3,"file":"UnorderedDistinctEndpointComponent.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/UnorderedDistinctEndpointComponent.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAGvD,OAAO,EAAE,yBAAyB,EAAE,MAAM,2BAA2B,CAAC;AACtE,OAAO,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAErD,cAAc;AACd,MAAM,OAAO,kCAAkC;IAEzB;IADZ,aAAa,CAAc;IACnC,YAAoB,gBAAkC;QAAlC,qBAAgB,GAAhB,gBAAgB,CAAkB;QACpD,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;IACjC,CAAC;IAEM,cAAc;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC;QACtD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,SAAS,CAAC,cAAuC;QAC5D,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QAEvE,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,MAAM,GAAG,yBAAyB,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;YACvE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,gBAAgB,EAAE,EAAE,CAAC;QACjD,CAAC;QAED,IACE,QAAQ,CAAC,MAAM,KAAK,SAAS;YAC7B,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;YACtC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;YACD,MAAM,MAAM,GAAG,yBAAyB,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;YACvE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC/C,CAAC;QAED,MAAM,cAAc,GAAG,QAAQ,CAAC,MAA6B,CAAC;QAC9D,MAAM,aAAa,GAAU,cAAc,CAAC,MAAM,CAAC;QAEnD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,CAAC;gBAC5C,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;oBAC1C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAClB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAG,yBAAyB,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QAClF,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;IAC/C,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\nimport type { Response } from \"../../request/index.js\";\nimport type { ExecutionContext } from \"../ExecutionContext.js\";\nimport { hashObject } from \"../../utils/hashObject.js\";\nimport type { DiagnosticNodeInternal } from \"../../diagnostics/DiagnosticNodeInternal.js\";\nimport type { ParallelQueryResult } from \"../parallelQueryResult.js\";\nimport { createParallelQueryResult } from \"../parallelQueryResult.js\";\nimport { getInitialHeader } from \"../headerUtils.js\";\n\n/** @hidden */\nexport class UnorderedDistinctEndpointComponent implements ExecutionContext {\n  private hashedResults: Set<string>;\n  constructor(private executionContext: ExecutionContext) {\n    this.hashedResults = new Set();\n  }\n\n  public hasMoreResults(): boolean {\n    const result = this.executionContext.hasMoreResults();\n    return result;\n  }\n\n  public async fetchMore(diagnosticNode?: DiagnosticNodeInternal): Promise<Response<any>> {\n    const buffer: any[] = [];\n    const response = await this.executionContext.fetchMore(diagnosticNode);\n\n    if (!response) {\n      const result = createParallelQueryResult([], new Map(), {}, undefined);\n      return { result, headers: getInitialHeader() };\n    }\n\n    if (\n      response.result === undefined ||\n      !Array.isArray(response.result.buffer) ||\n      response.result.buffer.length === 0\n    ) {\n      const result = createParallelQueryResult([], new Map(), {}, undefined);\n      return { result, headers: response.headers };\n    }\n\n    const parallelResult = response.result as ParallelQueryResult;\n    const dataToProcess: any[] = parallelResult.buffer;\n\n    for (const item of dataToProcess) {\n      if (item) {\n        const hashedResult = await hashObject(item);\n        if (!this.hashedResults.has(hashedResult)) {\n          buffer.push(item);\n          this.hashedResults.add(hashedResult);\n        }\n      }\n    }\n    const result = createParallelQueryResult(buffer, new Map(), undefined, undefined);\n    return { result, headers: response.headers };\n  }\n}\n"]}

package/dist/browser/queryExecutionContext/LegacyFetchImplementation.d.ts

@@ -0,0 +1,14 @@
+import type { Response } from "../request/index.js";
+import type { DiagnosticNodeInternal } from "../diagnostics/DiagnosticNodeInternal.js";
+import type { ExecutionContext } from "./ExecutionContext.js";
+/**
+ * Legacy fetch implementation for when enableQueryControl is false
+ * @hidden
+ */
+export declare class LegacyFetchImplementation {
+    private endpoint;
+    private pageSize;
+    constructor(endpoint: ExecutionContext, pageSize: number);
+    fetchMore(diagnosticNode: DiagnosticNodeInternal, fetchBuffer: any[]): Promise<Response<any>>;
+}
+//# sourceMappingURL=LegacyFetchImplementation.d.ts.map

package/dist/browser/queryExecutionContext/LegacyFetchImplementation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"LegacyFetchImplementation.d.ts","sourceRoot":"","sources":["../../../src/queryExecutionContext/LegacyFetchImplementation.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,0CAA0C,CAAC;AAEvF,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAE9D;;;GAGG;AACH,qBAAa,yBAAyB;IAElC,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,QAAQ;gBADR,QAAQ,EAAE,gBAAgB,EAC1B,QAAQ,EAAE,MAAM;IAGpB,SAAS,CACb,cAAc,EAAE,sBAAsB,EACtC,WAAW,EAAE,GAAG,EAAE,GACjB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;CAyC1B"}

package/dist/browser/queryExecutionContext/LegacyFetchImplementation.js

@@ -0,0 +1,55 @@
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+import { mergeHeaders, getInitialHeader } from "./headerUtils.js";
+/**
+ * Legacy fetch implementation for when enableQueryControl is false
+ * @hidden
+ */
+export class LegacyFetchImplementation {
+    endpoint;
+    pageSize;
+    constructor(endpoint, pageSize) {
+        this.endpoint = endpoint;
+        this.pageSize = pageSize;
+    }
+    async fetchMore(diagnosticNode, fetchBuffer) {
+        // Initialize headers fresh for each fetchMore call
+        const fetchMoreRespHeaders = getInitialHeader();
+        try {
+            // Keep fetching until we have enough items or no more results
+            while (fetchBuffer.length < this.pageSize && this.endpoint.hasMoreResults()) {
+                const response = await this.endpoint.fetchMore(diagnosticNode);
+                mergeHeaders(fetchMoreRespHeaders, response.headers);
+                if (!response ||
+                    !response.result ||
+                    !response.result.buffer ||
+                    response.result.buffer.length === 0) {
+                    if (fetchBuffer.length > 0) {
+                        const copiedFetchBuffer = [...fetchBuffer];
+                        fetchBuffer.length = 0; // Clear array in place
+                        return { result: copiedFetchBuffer, headers: fetchMoreRespHeaders };
+                    }
+                    else {
+                        return { result: undefined, headers: fetchMoreRespHeaders };
+                    }
+                }
+                fetchBuffer.push(...response.result.buffer);
+            }
+            // Return collected items up to pageSize
+            if (fetchBuffer.length > 0) {
+                const temp = fetchBuffer.slice(0, this.pageSize);
+                fetchBuffer.splice(0, this.pageSize); // Remove items in place
+                return { result: temp, headers: fetchMoreRespHeaders };
+            }
+            else {
+                return { result: undefined, headers: fetchMoreRespHeaders };
+            }
+        }
+        catch (err) {
+            mergeHeaders(fetchMoreRespHeaders, err.headers);
+            err.headers = fetchMoreRespHeaders;
+            throw err;
+        }
+    }
+}
+//# sourceMappingURL=LegacyFetchImplementation.js.map

package/dist/browser/queryExecutionContext/LegacyFetchImplementation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LegacyFetchImplementation.js","sourceRoot":"","sources":["../../../src/queryExecutionContext/LegacyFetchImplementation.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAIlC,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AAGlE;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IAE1B;IACA;IAFV,YACU,QAA0B,EAC1B,QAAgB;QADhB,aAAQ,GAAR,QAAQ,CAAkB;QAC1B,aAAQ,GAAR,QAAQ,CAAQ;IACvB,CAAC;IAEJ,KAAK,CAAC,SAAS,CACb,cAAsC,EACtC,WAAkB;QAElB,mDAAmD;QACnD,MAAM,oBAAoB,GAAG,gBAAgB,EAAE,CAAC;QAEhD,IAAI,CAAC;YACH,8DAA8D;YAC9D,OAAO,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,CAAC;gBAC5E,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,SAAU,CAAC,cAAc,CAAC,CAAC;gBAChE,YAAY,CAAC,oBAAoB,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;gBAErD,IACE,CAAC,QAAQ;oBACT,CAAC,QAAQ,CAAC,MAAM;oBAChB,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM;oBACvB,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;oBACD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC3B,MAAM,iBAAiB,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;wBAC3C,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,uBAAuB;wBAC/C,OAAO,EAAE,MAAM,EAAE,iBAAiB,EAAE,OAAO,EAAE,oBAAoB,EAAE,CAAC;oBACtE,CAAC;yBAAM,CAAC;wBACN,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,oBAAoB,EAAE,CAAC;oBAC9D,CAAC;gBACH,CAAC;gBACD,WAAW,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC9C,CAAC;YAED,wCAAwC;YACxC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACjD,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,wBAAwB;gBAC9D,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,oBAAoB,EAAE,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,oBAAoB,EAAE,CAAC;YAC9D,CAAC;QACH,CAAC;QAAC,OAAO,GAAQ,EAAE,CAAC;YAClB,YAAY,CAAC,oBAAoB,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;YAChD,GAAG,CAAC,OAAO,GAAG,oBAAoB,CAAC;YACnC,MAAM,GAAG,CAAC;QACZ,CAAC;IACH,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport type { Response } from \"../request/index.js\";\nimport type { DiagnosticNodeInternal } from \"../diagnostics/DiagnosticNodeInternal.js\";\nimport { mergeHeaders, getInitialHeader } from \"./headerUtils.js\";\nimport type { ExecutionContext } from \"./ExecutionContext.js\";\n\n/**\n * Legacy fetch implementation for when enableQueryControl is false\n * @hidden\n */\nexport class LegacyFetchImplementation {\n  constructor(\n    private endpoint: ExecutionContext,\n    private pageSize: number,\n  ) {}\n\n  async fetchMore(\n    diagnosticNode: DiagnosticNodeInternal,\n    fetchBuffer: any[],\n  ): Promise<Response<any>> {\n    // Initialize headers fresh for each fetchMore call\n    const fetchMoreRespHeaders = getInitialHeader();\n\n    try {\n      // Keep fetching until we have enough items or no more results\n      while (fetchBuffer.length < this.pageSize && this.endpoint.hasMoreResults()) {\n        const response = await this.endpoint.fetchMore!(diagnosticNode);\n        mergeHeaders(fetchMoreRespHeaders, response.headers);\n\n        if (\n          !response ||\n          !response.result ||\n          !response.result.buffer ||\n          response.result.buffer.length === 0\n        ) {\n          if (fetchBuffer.length > 0) {\n            const copiedFetchBuffer = [...fetchBuffer];\n            fetchBuffer.length = 0; // Clear array in place\n            return { result: copiedFetchBuffer, headers: fetchMoreRespHeaders };\n          } else {\n            return { result: undefined, headers: fetchMoreRespHeaders };\n          }\n        }\n        fetchBuffer.push(...response.result.buffer);\n      }\n\n      // Return collected items up to pageSize\n      if (fetchBuffer.length > 0) {\n        const temp = fetchBuffer.slice(0, this.pageSize);\n        fetchBuffer.splice(0, this.pageSize); // Remove items in place\n        return { result: temp, headers: fetchMoreRespHeaders };\n      } else {\n        return { result: undefined, headers: fetchMoreRespHeaders };\n      }\n    } catch (err: any) {\n      mergeHeaders(fetchMoreRespHeaders, err.headers);\n      err.headers = fetchMoreRespHeaders;\n      throw err;\n    }\n  }\n}\n"]}

package/dist/browser/queryExecutionContext/PartitionRangeManager.d.ts

@@ -0,0 +1,73 @@
+import { QueryRangeWithContinuationToken } from "../documents/ContinuationToken/CompositeQueryContinuationToken.js";
+import type { QueryRangeMapping } from "./queryRangeMapping.js";
+/**
+ * Manages partition key range mappings for query execution.
+ * Handles range operations, offset/limit processing, and distinct query logic.
+ * @hidden
+ */
+export declare class PartitionRangeManager {
+    private partitionKeyRangeMap;
+    constructor(initialPartitionKeyRangeMap?: Map<string, QueryRangeMapping>);
+    /**
+     * Gets a copy of the current partition key range map for constructor pattern
+     */
+    getPartitionKeyRangeMap(): Map<string, QueryRangeMapping>;
+    /**
+     * Checks if a continuation token indicates an exhausted partition
+     * @param continuationToken - The continuation token to check
+     * @returns true if the partition is exhausted (null, empty, or "null" string)
+     */
+    private isPartitionExhausted;
+    /**
+     * Adds a range mapping to the partition key range map
+     * Does not allow updates to existing keys - only new additions
+     * @param rangeId - Unique identifier for the partition range
+     * @param mapping - The QueryRangeMapping to add
+     */
+    private addPartitionRangeMapping;
+    /**
+     * Removes a range mapping from the partition key range map
+     */
+    removePartitionRangeMapping(rangeId: string): void;
+    /**
+     * Updates the partition key range map with new mappings from the endpoint response
+     * @param partitionKeyRangeMap - Map of range IDs to QueryRangeMapping objects
+     */
+    addPartitionKeyRangeMap(partitionKeyRangeMap: Map<string, QueryRangeMapping>): void;
+    /**
+     * Checks if there are any unprocessed ranges in the sliding window
+     */
+    hasUnprocessedRanges(): boolean;
+    /**
+     * Removes exhausted(fully drained) ranges from the given range mappings
+     * @param rangeMappings - Array of range mappings to filter
+     * @returns Filtered array without exhausted ranges
+     */
+    removeExhaustedRanges(rangeMappings: QueryRangeMapping[]): QueryRangeMapping[];
+    /**
+     * Processes ranges for ORDER BY queries
+     */
+    processOrderByRanges(pageSize: number): {
+        endIndex: number;
+        processedRanges: string[];
+        lastRangeBeforePageLimit: QueryRangeMapping | null;
+    };
+    processEmptyOrderByRanges(ranges: QueryRangeWithContinuationToken[]): {
+        endIndex: number;
+        processedRanges: string[];
+        lastRangeBeforePageLimit: QueryRangeMapping | undefined;
+    };
+    /**
+     * Processes ranges for parallel queries - multi-range aggregation
+     */
+    processParallelRanges(pageSize: number): {
+        endIndex: number;
+        processedRanges: string[];
+        processedRangeMappings: QueryRangeMapping[];
+        lastPartitionBeforeCutoff?: {
+            rangeId: string;
+            mapping: QueryRangeMapping;
+        };
+    };
+}
+//# sourceMappingURL=PartitionRangeManager.d.ts.map

package/dist/browser/queryExecutionContext/PartitionRangeManager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PartitionRangeManager.d.ts","sourceRoot":"","sources":["../../../src/queryExecutionContext/PartitionRangeManager.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,+BAA+B,EAAE,MAAM,mEAAmE,CAAC;AACpH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAEhE;;;;GAIG;AACH,qBAAa,qBAAqB;IAChC,OAAO,CAAC,oBAAoB,CAA6C;gBAE7D,2BAA2B,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC;IAMxE;;OAEG;IACI,uBAAuB,IAAI,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC;IAIhE;;;;OAIG;IACH,OAAO,CAAC,oBAAoB;IAS5B;;;;;OAKG;IACH,OAAO,CAAC,wBAAwB;IAMhC;;OAEG;IACI,2BAA2B,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAIzD;;;OAGG;IACI,uBAAuB,CAAC,oBAAoB,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,GAAG,IAAI;IAQ1F;;OAEG;IACI,oBAAoB,IAAI,OAAO;IAItC;;;;OAIG;IACI,qBAAqB,CAAC,aAAa,EAAE,iBAAiB,EAAE,GAAG,iBAAiB,EAAE;IAkBrF;;OAEG;IACI,oBAAoB,CAAC,QAAQ,EAAE,MAAM,GAAG;QAC7C,QAAQ,EAAE,MAAM,CAAC;QACjB,eAAe,EAAE,MAAM,EAAE,CAAC;QAC1B,wBAAwB,EAAE,iBAAiB,GAAG,IAAI,CAAC;KACpD;IAqBM,yBAAyB,CAAC,MAAM,EAAE,+BAA+B,EAAE,GAAG;QAC3E,QAAQ,EAAE,MAAM,CAAC;QACjB,eAAe,EAAE,MAAM,EAAE,CAAC;QAC1B,wBAAwB,EAAE,iBAAiB,GAAG,SAAS,CAAC;KACzD;IAsBD;;OAEG;IACI,qBAAqB,CAAC,QAAQ,EAAE,MAAM,GAAG;QAC9C,QAAQ,EAAE,MAAM,CAAC;QACjB,eAAe,EAAE,MAAM,EAAE,CAAC;QAC1B,sBAAsB,EAAE,iBAAiB,EAAE,CAAC;QAC5C,yBAAyB,CAAC,EAAE;YAAE,OAAO,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,iBAAiB,CAAA;SAAE,CAAC;KAC7E;CA4BF"}

package/dist/browser/queryExecutionContext/PartitionRangeManager.js

@@ -0,0 +1,156 @@
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+/**
+ * Manages partition key range mappings for query execution.
+ * Handles range operations, offset/limit processing, and distinct query logic.
+ * @hidden
+ */
+export class PartitionRangeManager {
+    partitionKeyRangeMap = new Map();
+    constructor(initialPartitionKeyRangeMap) {
+        if (initialPartitionKeyRangeMap) {
+            this.partitionKeyRangeMap = new Map(initialPartitionKeyRangeMap);
+        }
+    }
+    /**
+     * Gets a copy of the current partition key range map for constructor pattern
+     */
+    getPartitionKeyRangeMap() {
+        return new Map(this.partitionKeyRangeMap);
+    }
+    /**
+     * Checks if a continuation token indicates an exhausted partition
+     * @param continuationToken - The continuation token to check
+     * @returns true if the partition is exhausted (null, empty, or "null" string)
+     */
+    isPartitionExhausted(continuationToken) {
+        return (!continuationToken ||
+            continuationToken === "" ||
+            continuationToken === "null" ||
+            continuationToken.toLowerCase() === "null");
+    }
+    /**
+     * Adds a range mapping to the partition key range map
+     * Does not allow updates to existing keys - only new additions
+     * @param rangeId - Unique identifier for the partition range
+     * @param mapping - The QueryRangeMapping to add
+     */
+    addPartitionRangeMapping(rangeId, mapping) {
+        if (!this.partitionKeyRangeMap.has(rangeId)) {
+            this.partitionKeyRangeMap.set(rangeId, mapping);
+        }
+    }
+    /**
+     * Removes a range mapping from the partition key range map
+     */
+    removePartitionRangeMapping(rangeId) {
+        this.partitionKeyRangeMap.delete(rangeId);
+    }
+    /**
+     * Updates the partition key range map with new mappings from the endpoint response
+     * @param partitionKeyRangeMap - Map of range IDs to QueryRangeMapping objects
+     */
+    addPartitionKeyRangeMap(partitionKeyRangeMap) {
+        if (partitionKeyRangeMap) {
+            for (const [rangeId, mapping] of partitionKeyRangeMap) {
+                this.addPartitionRangeMapping(rangeId, mapping);
+            }
+        }
+    }
+    /**
+     * Checks if there are any unprocessed ranges in the sliding window
+     */
+    hasUnprocessedRanges() {
+        return this.partitionKeyRangeMap.size > 0;
+    }
+    /**
+     * Removes exhausted(fully drained) ranges from the given range mappings
+     * @param rangeMappings - Array of range mappings to filter
+     * @returns Filtered array without exhausted ranges
+     */
+    removeExhaustedRanges(rangeMappings) {
+        if (!rangeMappings || !Array.isArray(rangeMappings)) {
+            return [];
+        }
+        return rangeMappings.filter((mapping) => {
+            if (!mapping) {
+                return false;
+            }
+            const isExhausted = this.isPartitionExhausted(mapping.continuationToken);
+            if (isExhausted) {
+                return false;
+            }
+            return true;
+        });
+    }
+    /**
+     * Processes ranges for ORDER BY queries
+     */
+    processOrderByRanges(pageSize) {
+        let endIndex = 0;
+        const processedRanges = [];
+        let lastRangeBeforePageLimit = null;
+        let rangeIndex = 0;
+        for (const [rangeId, value] of this.partitionKeyRangeMap) {
+            rangeIndex++;
+            const { itemCount } = value;
+            // Check if this complete range fits within remaining page size capacity
+            if (endIndex + itemCount <= pageSize) {
+                lastRangeBeforePageLimit = value;
+                endIndex += itemCount;
+                processedRanges.push(rangeId);
+            }
+            else {
+                break;
+            }
+        }
+        return { endIndex, processedRanges, lastRangeBeforePageLimit };
+    }
+    processEmptyOrderByRanges(ranges) {
+        const endIndex = 0;
+        const processedRanges = [];
+        let lastRangeBeforePageLimit;
+        // since there is no data returned add all the ids to processed ranges
+        for (const [rangeId, _] of this.partitionKeyRangeMap) {
+            processedRanges.push(rangeId);
+        }
+        // search for matching range in the map(min max value exact match) and return that as lastRangeBeforePageLimit
+        for (const [_, mapping] of this.partitionKeyRangeMap) {
+            if (mapping.partitionKeyRange.minInclusive === ranges[0].queryRange.min &&
+                mapping.partitionKeyRange.maxExclusive === ranges[0].queryRange.max) {
+                lastRangeBeforePageLimit = mapping;
+                break;
+            }
+        }
+        return { endIndex, processedRanges, lastRangeBeforePageLimit };
+    }
+    /**
+     * Processes ranges for parallel queries - multi-range aggregation
+     */
+    processParallelRanges(pageSize) {
+        let endIndex = 0;
+        const processedRanges = [];
+        const processedRangeMappings = [];
+        let rangesAggregatedInCurrentToken = 0;
+        let lastPartitionBeforeCutoff;
+        for (const [rangeId, value] of this.partitionKeyRangeMap) {
+            rangesAggregatedInCurrentToken++;
+            // Validate range data
+            if (!value || value.itemCount === undefined) {
+                continue;
+            }
+            const { itemCount } = value;
+            if (endIndex + itemCount <= pageSize) {
+                lastPartitionBeforeCutoff = { rangeId, mapping: value };
+                endIndex += itemCount;
+                processedRanges.push(rangeId);
+                processedRangeMappings.push(value);
+            }
+            else {
+                break; // No more ranges can fit, exit loop
+            }
+        }
+        return { endIndex, processedRanges, processedRangeMappings, lastPartitionBeforeCutoff };
+    }
+}
+//# sourceMappingURL=PartitionRangeManager.js.map

package/dist/browser/queryExecutionContext/PartitionRangeManager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PartitionRangeManager.js","sourceRoot":"","sources":["../../../src/queryExecutionContext/PartitionRangeManager.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAKlC;;;;GAIG;AACH,MAAM,OAAO,qBAAqB;IACxB,oBAAoB,GAAmC,IAAI,GAAG,EAAE,CAAC;IAEzE,YAAY,2BAA4D;QACtE,IAAI,2BAA2B,EAAE,CAAC;YAChC,IAAI,CAAC,oBAAoB,GAAG,IAAI,GAAG,CAAC,2BAA2B,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IAED;;OAEG;IACI,uBAAuB;QAC5B,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC5C,CAAC;IAED;;;;OAIG;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;IAED;;;;;OAKG;IACK,wBAAwB,CAAC,OAAe,EAAE,OAA0B;QAC1E,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5C,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED;;OAEG;IACI,2BAA2B,CAAC,OAAe;QAChD,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACI,uBAAuB,CAAC,oBAAoD;QACjF,IAAI,oBAAoB,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,oBAAoB,EAAE,CAAC;gBACtD,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACI,oBAAoB;QACzB,OAAO,IAAI,CAAC,oBAAoB,CAAC,IAAI,GAAG,CAAC,CAAC;IAC5C,CAAC;IAED;;;;OAIG;IACI,qBAAqB,CAAC,aAAkC;QAC7D,IAAI,CAAC,aAAa,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;YACpD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,OAAO,aAAa,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE;YACtC,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,WAAW,GAAG,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;YAEzE,IAAI,WAAW,EAAE,CAAC;gBAChB,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACI,oBAAoB,CAAC,QAAgB;QAK1C,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,IAAI,wBAAwB,GAA6B,IAAI,CAAC;QAC9D,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YACzD,UAAU,EAAE,CAAC;YACb,MAAM,EAAE,SAAS,EAAE,GAAG,KAAK,CAAC;YAC5B,wEAAwE;YACxE,IAAI,QAAQ,GAAG,SAAS,IAAI,QAAQ,EAAE,CAAC;gBACrC,wBAAwB,GAAG,KAAK,CAAC;gBACjC,QAAQ,IAAI,SAAS,CAAC;gBACtB,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,wBAAwB,EAAE,CAAC;IACjE,CAAC;IAEM,yBAAyB,CAAC,MAAyC;QAKxE,MAAM,QAAQ,GAAG,CAAC,CAAC;QACnB,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,IAAI,wBAAuD,CAAC;QAE5D,sEAAsE;QACtE,KAAK,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YACrD,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;QACD,8GAA8G;QAC9G,KAAK,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YACrD,IACE,OAAO,CAAC,iBAAkB,CAAC,YAAY,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG;gBACpE,OAAO,CAAC,iBAAkB,CAAC,YAAY,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,EACpE,CAAC;gBACD,wBAAwB,GAAG,OAAO,CAAC;gBACnC,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,wBAAwB,EAAE,CAAC;IACjE,CAAC;IACD;;OAEG;IACI,qBAAqB,CAAC,QAAgB;QAM3C,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,MAAM,sBAAsB,GAAwB,EAAE,CAAC;QACvD,IAAI,8BAA8B,GAAG,CAAC,CAAC;QACvC,IAAI,yBAAsF,CAAC;QAE3F,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YACzD,8BAA8B,EAAE,CAAC;YAEjC,sBAAsB;YACtB,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5C,SAAS;YACX,CAAC;YAED,MAAM,EAAE,SAAS,EAAE,GAAG,KAAK,CAAC;YAC5B,IAAI,QAAQ,GAAG,SAAS,IAAI,QAAQ,EAAE,CAAC;gBACrC,yBAAyB,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;gBACxD,QAAQ,IAAI,SAAS,CAAC;gBACtB,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC9B,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,oCAAoC;YAC7C,CAAC;QACH,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,sBAAsB,EAAE,yBAAyB,EAAE,CAAC;IAC1F,CAAC;CACF","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { QueryRangeWithContinuationToken } from \"../documents/ContinuationToken/CompositeQueryContinuationToken.js\";\nimport type { QueryRangeMapping } from \"./queryRangeMapping.js\";\n\n/**\n * Manages partition key range mappings for query execution.\n * Handles range operations, offset/limit processing, and distinct query logic.\n * @hidden\n */\nexport class PartitionRangeManager {\n  private partitionKeyRangeMap: Map<string, QueryRangeMapping> = new Map();\n\n  constructor(initialPartitionKeyRangeMap?: Map<string, QueryRangeMapping>) {\n    if (initialPartitionKeyRangeMap) {\n      this.partitionKeyRangeMap = new Map(initialPartitionKeyRangeMap);\n    }\n  }\n\n  /**\n   * Gets a copy of the current partition key range map for constructor pattern\n   */\n  public getPartitionKeyRangeMap(): Map<string, QueryRangeMapping> {\n    return new Map(this.partitionKeyRangeMap);\n  }\n\n  /**\n   * Checks if a continuation token indicates an exhausted partition\n   * @param continuationToken - The continuation token to check\n   * @returns true if the partition is exhausted (null, empty, or \"null\" string)\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  /**\n   * Adds a range mapping to the partition key range map\n   * Does not allow updates to existing keys - only new additions\n   * @param rangeId - Unique identifier for the partition range\n   * @param mapping - The QueryRangeMapping to add\n   */\n  private addPartitionRangeMapping(rangeId: string, mapping: QueryRangeMapping): void {\n    if (!this.partitionKeyRangeMap.has(rangeId)) {\n      this.partitionKeyRangeMap.set(rangeId, mapping);\n    }\n  }\n\n  /**\n   * Removes a range mapping from the partition key range map\n   */\n  public removePartitionRangeMapping(rangeId: string): void {\n    this.partitionKeyRangeMap.delete(rangeId);\n  }\n\n  /**\n   * Updates the partition key range map with new mappings from the endpoint response\n   * @param partitionKeyRangeMap - Map of range IDs to QueryRangeMapping objects\n   */\n  public addPartitionKeyRangeMap(partitionKeyRangeMap: Map<string, QueryRangeMapping>): void {\n    if (partitionKeyRangeMap) {\n      for (const [rangeId, mapping] of partitionKeyRangeMap) {\n        this.addPartitionRangeMapping(rangeId, mapping);\n      }\n    }\n  }\n\n  /**\n   * Checks if there are any unprocessed ranges in the sliding window\n   */\n  public hasUnprocessedRanges(): boolean {\n    return this.partitionKeyRangeMap.size > 0;\n  }\n\n  /**\n   * Removes exhausted(fully drained) ranges from the given range mappings\n   * @param rangeMappings - Array of range mappings to filter\n   * @returns Filtered array without exhausted ranges\n   */\n  public removeExhaustedRanges(rangeMappings: QueryRangeMapping[]): QueryRangeMapping[] {\n    if (!rangeMappings || !Array.isArray(rangeMappings)) {\n      return [];\n    }\n\n    return rangeMappings.filter((mapping) => {\n      if (!mapping) {\n        return false;\n      }\n      const isExhausted = this.isPartitionExhausted(mapping.continuationToken);\n\n      if (isExhausted) {\n        return false;\n      }\n      return true;\n    });\n  }\n\n  /**\n   * Processes ranges for ORDER BY queries\n   */\n  public processOrderByRanges(pageSize: number): {\n    endIndex: number;\n    processedRanges: string[];\n    lastRangeBeforePageLimit: QueryRangeMapping | null;\n  } {\n    let endIndex = 0;\n    const processedRanges: string[] = [];\n    let lastRangeBeforePageLimit: QueryRangeMapping | null = null;\n    let rangeIndex = 0;\n    for (const [rangeId, value] of this.partitionKeyRangeMap) {\n      rangeIndex++;\n      const { itemCount } = value;\n      // Check if this complete range fits within remaining page size capacity\n      if (endIndex + itemCount <= pageSize) {\n        lastRangeBeforePageLimit = value;\n        endIndex += itemCount;\n        processedRanges.push(rangeId);\n      } else {\n        break;\n      }\n    }\n\n    return { endIndex, processedRanges, lastRangeBeforePageLimit };\n  }\n\n  public processEmptyOrderByRanges(ranges: QueryRangeWithContinuationToken[]): {\n    endIndex: number;\n    processedRanges: string[];\n    lastRangeBeforePageLimit: QueryRangeMapping | undefined;\n  } {\n    const endIndex = 0;\n    const processedRanges: string[] = [];\n    let lastRangeBeforePageLimit: QueryRangeMapping | undefined;\n\n    // since there is no data returned add all the ids to processed ranges\n    for (const [rangeId, _] of this.partitionKeyRangeMap) {\n      processedRanges.push(rangeId);\n    }\n    // search for matching range in the map(min max value exact match) and return that as lastRangeBeforePageLimit\n    for (const [_, mapping] of this.partitionKeyRangeMap) {\n      if (\n        mapping.partitionKeyRange!.minInclusive === ranges[0].queryRange.min &&\n        mapping.partitionKeyRange!.maxExclusive === ranges[0].queryRange.max\n      ) {\n        lastRangeBeforePageLimit = mapping;\n        break;\n      }\n    }\n\n    return { endIndex, processedRanges, lastRangeBeforePageLimit };\n  }\n  /**\n   * Processes ranges for parallel queries - multi-range aggregation\n   */\n  public processParallelRanges(pageSize: number): {\n    endIndex: number;\n    processedRanges: string[];\n    processedRangeMappings: QueryRangeMapping[];\n    lastPartitionBeforeCutoff?: { rangeId: string; mapping: QueryRangeMapping };\n  } {\n    let endIndex = 0;\n    const processedRanges: string[] = [];\n    const processedRangeMappings: QueryRangeMapping[] = [];\n    let rangesAggregatedInCurrentToken = 0;\n    let lastPartitionBeforeCutoff: { rangeId: string; mapping: QueryRangeMapping } | undefined;\n\n    for (const [rangeId, value] of this.partitionKeyRangeMap) {\n      rangesAggregatedInCurrentToken++;\n\n      // Validate range data\n      if (!value || value.itemCount === undefined) {\n        continue;\n      }\n\n      const { itemCount } = value;\n      if (endIndex + itemCount <= pageSize) {\n        lastPartitionBeforeCutoff = { rangeId, mapping: value };\n        endIndex += itemCount;\n        processedRanges.push(rangeId);\n        processedRangeMappings.push(value);\n      } else {\n        break; // No more ranges can fit, exit loop\n      }\n    }\n\n    return { endIndex, processedRanges, processedRangeMappings, lastPartitionBeforeCutoff };\n  }\n}\n"]}

package/dist/browser/queryExecutionContext/PartitionRangeUtils.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Calculates offset/limit values after consuming each partition range sequentially
+ * @param partitionKeyRangeMap - Map of range IDs to range mappings
+ * @param initialOffset - Initial offset value
+ * @param initialLimit - Initial limit value
+ * @returns Updated partition key range map with calculated offset/limit values and updated itemCount
+ * @hidden
+ */
+export declare function calculateOffsetLimitForPartitionRanges(partitionKeyRangeMap: Map<string, any>, initialOffset: number, initialLimit: number): Map<string, any>;
+/**
+ * Processes distinct query logic and updates partition key range map with hashedLastResult
+ * @param originalBuffer - Original buffer containing query results
+ * @param partitionKeyRangeMap - Map of partition key ranges
+ * @param hashFunction - Hash function for items
+ * @returns Updated partition key range map with hashedLastResult for each range
+ * @hidden
+ */
+export declare function processDistinctQueryAndUpdateRangeMap(originalBuffer: any[], partitionKeyRangeMap: Map<string, any>, hashFunction: (item: any) => Promise<string>): Promise<Map<string, any>>;
+//# sourceMappingURL=PartitionRangeUtils.d.ts.map

package/dist/browser/queryExecutionContext/PartitionRangeUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PartitionRangeUtils.d.ts","sourceRoot":"","sources":["../../../src/queryExecutionContext/PartitionRangeUtils.ts"],"names":[],"mappings":"AAGA;;;;;;;GAOG;AACH,wBAAgB,sCAAsC,CACpD,oBAAoB,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,EACtC,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GACnB,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAiElB;AAED;;;;;;;GAOG;AACH,wBAAsB,qCAAqC,CACzD,cAAc,EAAE,GAAG,EAAE,EACrB,oBAAoB,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,EACtC,YAAY,EAAE,CAAC,IAAI,EAAE,GAAG,KAAK,OAAO,CAAC,MAAM,CAAC,GAC3C,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CA8B3B"}