@azure/cosmos 4.8.0 → 4.9.0

package/dist/commonjs/queryExecutionContext/LegacyFetchImplementation.js

@@ -0,0 +1,59 @@
+"use strict";
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LegacyFetchImplementation = void 0;
+const headerUtils_js_1 = require("./headerUtils.js");
+/**
+ * Legacy fetch implementation for when enableQueryControl is false
+ * @hidden
+ */
+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 = (0, headerUtils_js_1.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);
+                (0, headerUtils_js_1.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) {
+            (0, headerUtils_js_1.mergeHeaders)(fetchMoreRespHeaders, err.headers);
+            err.headers = fetchMoreRespHeaders;
+            throw err;
+        }
+    }
+}
+exports.LegacyFetchImplementation = LegacyFetchImplementation;
+//# sourceMappingURL=LegacyFetchImplementation.js.map

package/dist/commonjs/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,qDAAkE;AAGlE;;;GAGG;AACH,MAAa,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,IAAA,iCAAgB,GAAE,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,IAAA,6BAAY,EAAC,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,IAAA,6BAAY,EAAC,oBAAoB,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;YAChD,GAAG,CAAC,OAAO,GAAG,oBAAoB,CAAC;YACnC,MAAM,GAAG,CAAC;QACZ,CAAC;IACH,CAAC;CACF;AAlDD,8DAkDC","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/commonjs/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/commonjs/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/commonjs/queryExecutionContext/PartitionRangeManager.js

@@ -0,0 +1,160 @@
+"use strict";
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PartitionRangeManager = void 0;
+/**
+ * Manages partition key range mappings for query execution.
+ * Handles range operations, offset/limit processing, and distinct query logic.
+ * @hidden
+ */
+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 };
+    }
+}
+exports.PartitionRangeManager = PartitionRangeManager;
+//# sourceMappingURL=PartitionRangeManager.js.map

package/dist/commonjs/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,MAAa,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;AArLD,sDAqLC","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/commonjs/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/commonjs/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"}

package/dist/commonjs/queryExecutionContext/PartitionRangeUtils.js

@@ -0,0 +1,109 @@
+"use strict";
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.calculateOffsetLimitForPartitionRanges = calculateOffsetLimitForPartitionRanges;
+exports.processDistinctQueryAndUpdateRangeMap = processDistinctQueryAndUpdateRangeMap;
+/**
+ * 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
+ */
+function calculateOffsetLimitForPartitionRanges(partitionKeyRangeMap, initialOffset, initialLimit) {
+    if (!partitionKeyRangeMap || partitionKeyRangeMap.size === 0) {
+        return partitionKeyRangeMap;
+    }
+    const updatedMap = new Map();
+    let currentOffset = initialOffset;
+    let currentLimit = initialLimit;
+    for (const [rangeId, rangeMapping] of partitionKeyRangeMap) {
+        const { itemCount } = rangeMapping;
+        let offsetAfterThisRange = currentOffset;
+        let limitAfterThisRange = currentLimit;
+        let updatedItemCount = itemCount;
+        if (itemCount > 0) {
+            if (currentOffset > 0) {
+                // Calculate how much offset this range consumes
+                const offsetConsumption = Math.min(currentOffset, itemCount);
+                offsetAfterThisRange = currentOffset - offsetConsumption;
+                // Calculate remaining items after offset consumption
+                const remainingItems = itemCount - offsetConsumption;
+                if (remainingItems > 0 && currentLimit > 0) {
+                    // Apply limit to remaining items
+                    const limitConsumption = Math.min(currentLimit, remainingItems);
+                    limitAfterThisRange = currentLimit - limitConsumption;
+                    // Update item count to reflect actual items that will be returned from this range
+                    updatedItemCount = limitConsumption;
+                }
+                else {
+                    // No items left after offset, or no limit remaining
+                    updatedItemCount = 0;
+                    limitAfterThisRange = currentLimit;
+                }
+            }
+            else if (currentLimit > 0) {
+                // No offset, but limit applies
+                const limitConsumption = Math.min(currentLimit, itemCount);
+                limitAfterThisRange = currentLimit - limitConsumption;
+                offsetAfterThisRange = 0;
+                // Update item count to reflect actual items that will be returned from this range
+                updatedItemCount = limitConsumption;
+            }
+            else {
+                // No limit remaining - this range contributes 0 items
+                updatedItemCount = 0;
+            }
+            // Update running totals for next iteration
+            currentOffset = offsetAfterThisRange;
+            currentLimit = limitAfterThisRange;
+        }
+        else {
+            // Range has no items to begin with
+            updatedItemCount = 0;
+        }
+        updatedMap.set(rangeId, {
+            ...rangeMapping,
+            offset: offsetAfterThisRange,
+            limit: limitAfterThisRange,
+            itemCount: updatedItemCount,
+        });
+    }
+    return updatedMap;
+}
+/**
+ * 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
+ */
+async function processDistinctQueryAndUpdateRangeMap(originalBuffer, partitionKeyRangeMap, hashFunction) {
+    if (!partitionKeyRangeMap || partitionKeyRangeMap.size === 0) {
+        return partitionKeyRangeMap;
+    }
+    const updatedMap = new Map();
+    let bufferIndex = 0;
+    for (const [rangeId, rangeMapping] of partitionKeyRangeMap) {
+        const { itemCount } = rangeMapping;
+        let lastHashForThisRange;
+        if (itemCount > 0 && bufferIndex <= originalBuffer.length) {
+            const rangeEndIndex = Math.min(bufferIndex + itemCount, originalBuffer.length);
+            const lastItemIndex = rangeEndIndex - 1;
+            const lastItem = originalBuffer[lastItemIndex];
+            if (lastItem) {
+                lastHashForThisRange = await hashFunction(lastItem);
+            }
+            bufferIndex = rangeEndIndex;
+        }
+        updatedMap.set(rangeId, {
+            ...rangeMapping,
+            hashedLastResult: lastHashForThisRange,
+        });
+    }
+    return updatedMap;
+}
+//# sourceMappingURL=PartitionRangeUtils.js.map

package/dist/commonjs/queryExecutionContext/PartitionRangeUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PartitionRangeUtils.js","sourceRoot":"","sources":["../../../src/queryExecutionContext/PartitionRangeUtils.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;AAUlC,wFAqEC;AAUD,sFAkCC;AAzHD;;;;;;;GAOG;AACH,SAAgB,sCAAsC,CACpD,oBAAsC,EACtC,aAAqB,EACrB,YAAoB;IAEpB,IAAI,CAAC,oBAAoB,IAAI,oBAAoB,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC7D,OAAO,oBAAoB,CAAC;IAC9B,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAe,CAAC;IAC1C,IAAI,aAAa,GAAG,aAAa,CAAC;IAClC,IAAI,YAAY,GAAG,YAAY,CAAC;IAEhC,KAAK,MAAM,CAAC,OAAO,EAAE,YAAY,CAAC,IAAI,oBAAoB,EAAE,CAAC;QAC3D,MAAM,EAAE,SAAS,EAAE,GAAG,YAAY,CAAC;QAEnC,IAAI,oBAAoB,GAAG,aAAa,CAAC;QACzC,IAAI,mBAAmB,GAAG,YAAY,CAAC;QACvC,IAAI,gBAAgB,GAAG,SAAS,CAAC;QAEjC,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAClB,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;gBACtB,gDAAgD;gBAChD,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;gBAC7D,oBAAoB,GAAG,aAAa,GAAG,iBAAiB,CAAC;gBAEzD,qDAAqD;gBACrD,MAAM,cAAc,GAAG,SAAS,GAAG,iBAAiB,CAAC;gBAErD,IAAI,cAAc,GAAG,CAAC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;oBAC3C,iCAAiC;oBACjC,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;oBAChE,mBAAmB,GAAG,YAAY,GAAG,gBAAgB,CAAC;oBACtD,kFAAkF;oBAClF,gBAAgB,GAAG,gBAAgB,CAAC;gBACtC,CAAC;qBAAM,CAAC;oBACN,oDAAoD;oBACpD,gBAAgB,GAAG,CAAC,CAAC;oBACrB,mBAAmB,GAAG,YAAY,CAAC;gBACrC,CAAC;YACH,CAAC;iBAAM,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;gBAC5B,+BAA+B;gBAC/B,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;gBAC3D,mBAAmB,GAAG,YAAY,GAAG,gBAAgB,CAAC;gBACtD,oBAAoB,GAAG,CAAC,CAAC;gBACzB,kFAAkF;gBAClF,gBAAgB,GAAG,gBAAgB,CAAC;YACtC,CAAC;iBAAM,CAAC;gBACN,sDAAsD;gBACtD,gBAAgB,GAAG,CAAC,CAAC;YACvB,CAAC;YAED,2CAA2C;YAC3C,aAAa,GAAG,oBAAoB,CAAC;YACrC,YAAY,GAAG,mBAAmB,CAAC;QACrC,CAAC;aAAM,CAAC;YACN,mCAAmC;YACnC,gBAAgB,GAAG,CAAC,CAAC;QACvB,CAAC;QAED,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE;YACtB,GAAG,YAAY;YACf,MAAM,EAAE,oBAAoB;YAC5B,KAAK,EAAE,mBAAmB;YAC1B,SAAS,EAAE,gBAAgB;SAC5B,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;GAOG;AACI,KAAK,UAAU,qCAAqC,CACzD,cAAqB,EACrB,oBAAsC,EACtC,YAA4C;IAE5C,IAAI,CAAC,oBAAoB,IAAI,oBAAoB,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC7D,OAAO,oBAAoB,CAAC;IAC9B,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAe,CAAC;IAC1C,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,CAAC,OAAO,EAAE,YAAY,CAAC,IAAI,oBAAoB,EAAE,CAAC;QAC3D,MAAM,EAAE,SAAS,EAAE,GAAG,YAAY,CAAC;QAEnC,IAAI,oBAAwC,CAAC;QAC7C,IAAI,SAAS,GAAG,CAAC,IAAI,WAAW,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;YAC1D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,SAAS,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC;YAC/E,MAAM,aAAa,GAAG,aAAa,GAAG,CAAC,CAAC;YAExC,MAAM,QAAQ,GAAG,cAAc,CAAC,aAAa,CAAC,CAAC;YAC/C,IAAI,QAAQ,EAAE,CAAC;gBACb,oBAAoB,GAAG,MAAM,YAAY,CAAC,QAAQ,CAAC,CAAC;YACtD,CAAC;YACD,WAAW,GAAG,aAAa,CAAC;QAC9B,CAAC;QAED,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE;YACtB,GAAG,YAAY;YACf,gBAAgB,EAAE,oBAAoB;SACvC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\n/**\n * Calculates offset/limit values after consuming each partition range sequentially\n * @param partitionKeyRangeMap - Map of range IDs to range mappings\n * @param initialOffset - Initial offset value\n * @param initialLimit - Initial limit value\n * @returns Updated partition key range map with calculated offset/limit values and updated itemCount\n * @hidden\n */\nexport function calculateOffsetLimitForPartitionRanges(\n  partitionKeyRangeMap: Map<string, any>,\n  initialOffset: number,\n  initialLimit: number,\n): Map<string, any> {\n  if (!partitionKeyRangeMap || partitionKeyRangeMap.size === 0) {\n    return partitionKeyRangeMap;\n  }\n\n  const updatedMap = new Map<string, any>();\n  let currentOffset = initialOffset;\n  let currentLimit = initialLimit;\n\n  for (const [rangeId, rangeMapping] of partitionKeyRangeMap) {\n    const { itemCount } = rangeMapping;\n\n    let offsetAfterThisRange = currentOffset;\n    let limitAfterThisRange = currentLimit;\n    let updatedItemCount = itemCount;\n\n    if (itemCount > 0) {\n      if (currentOffset > 0) {\n        // Calculate how much offset this range consumes\n        const offsetConsumption = Math.min(currentOffset, itemCount);\n        offsetAfterThisRange = currentOffset - offsetConsumption;\n\n        // Calculate remaining items after offset consumption\n        const remainingItems = itemCount - offsetConsumption;\n\n        if (remainingItems > 0 && currentLimit > 0) {\n          // Apply limit to remaining items\n          const limitConsumption = Math.min(currentLimit, remainingItems);\n          limitAfterThisRange = currentLimit - limitConsumption;\n          // Update item count to reflect actual items that will be returned from this range\n          updatedItemCount = limitConsumption;\n        } else {\n          // No items left after offset, or no limit remaining\n          updatedItemCount = 0;\n          limitAfterThisRange = currentLimit;\n        }\n      } else if (currentLimit > 0) {\n        // No offset, but limit applies\n        const limitConsumption = Math.min(currentLimit, itemCount);\n        limitAfterThisRange = currentLimit - limitConsumption;\n        offsetAfterThisRange = 0;\n        // Update item count to reflect actual items that will be returned from this range\n        updatedItemCount = limitConsumption;\n      } else {\n        // No limit remaining - this range contributes 0 items\n        updatedItemCount = 0;\n      }\n\n      // Update running totals for next iteration\n      currentOffset = offsetAfterThisRange;\n      currentLimit = limitAfterThisRange;\n    } else {\n      // Range has no items to begin with\n      updatedItemCount = 0;\n    }\n\n    updatedMap.set(rangeId, {\n      ...rangeMapping,\n      offset: offsetAfterThisRange,\n      limit: limitAfterThisRange,\n      itemCount: updatedItemCount,\n    });\n  }\n\n  return updatedMap;\n}\n\n/**\n * Processes distinct query logic and updates partition key range map with hashedLastResult\n * @param originalBuffer - Original buffer containing query results\n * @param partitionKeyRangeMap - Map of partition key ranges\n * @param hashFunction - Hash function for items\n * @returns Updated partition key range map with hashedLastResult for each range\n * @hidden\n */\nexport async function processDistinctQueryAndUpdateRangeMap(\n  originalBuffer: any[],\n  partitionKeyRangeMap: Map<string, any>,\n  hashFunction: (item: any) => Promise<string>,\n): Promise<Map<string, any>> {\n  if (!partitionKeyRangeMap || partitionKeyRangeMap.size === 0) {\n    return partitionKeyRangeMap;\n  }\n\n  const updatedMap = new Map<string, any>();\n  let bufferIndex = 0;\n\n  for (const [rangeId, rangeMapping] of partitionKeyRangeMap) {\n    const { itemCount } = rangeMapping;\n\n    let lastHashForThisRange: string | undefined;\n    if (itemCount > 0 && bufferIndex <= originalBuffer.length) {\n      const rangeEndIndex = Math.min(bufferIndex + itemCount, originalBuffer.length);\n      const lastItemIndex = rangeEndIndex - 1;\n\n      const lastItem = originalBuffer[lastItemIndex];\n      if (lastItem) {\n        lastHashForThisRange = await hashFunction(lastItem);\n      }\n      bufferIndex = rangeEndIndex;\n    }\n\n    updatedMap.set(rangeId, {\n      ...rangeMapping,\n      hashedLastResult: lastHashForThisRange,\n    });\n  }\n\n  return updatedMap;\n}\n"]}

package/dist/commonjs/queryExecutionContext/QueryControlFetchImplementation.d.ts

@@ -0,0 +1,20 @@
+import type { Response } from "../request/index.js";
+import type { DiagnosticNodeInternal } from "../diagnostics/DiagnosticNodeInternal.js";
+import type { ExecutionContext } from "./ExecutionContext.js";
+/**
+ * Query control enabled fetch implementation with continuation token support
+ * @hidden
+ */
+export declare class QueryControlFetchImplementation {
+    private endpoint;
+    private pageSize;
+    private readonly continuationTokenManager;
+    private readonly querySupportsTokens;
+    constructor(endpoint: ExecutionContext, pageSize: number, collectionLink: string, continuationToken: string | undefined, isOrderByQuery: boolean, querySupportsTokens: boolean);
+    fetchMore(diagnosticNode: DiagnosticNodeInternal, fetchBuffer: any[]): Promise<Response<any>>;
+    private _handleSimpleBufferFetch;
+    private _handleQueryFetch;
+    private _setContinuationTokenInHeaders;
+    private _createEmptyResult;
+}
+//# sourceMappingURL=QueryControlFetchImplementation.d.ts.map

package/dist/commonjs/queryExecutionContext/QueryControlFetchImplementation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryControlFetchImplementation.d.ts","sourceRoot":"","sources":["../../../src/queryExecutionContext/QueryControlFetchImplementation.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,0CAA0C,CAAC;AAKvF,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAE9D;;;GAGG;AACH,qBAAa,+BAA+B;IAMxC,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,QAAQ;IALlB,OAAO,CAAC,QAAQ,CAAC,wBAAwB,CAA+B;IACxE,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAU;gBAGpC,QAAQ,EAAE,gBAAgB,EAC1B,QAAQ,EAAE,MAAM,EACxB,cAAc,EAAE,MAAM,EACtB,iBAAiB,EAAE,MAAM,GAAG,SAAS,EACrC,cAAc,EAAE,OAAO,EACvB,mBAAmB,EAAE,OAAO;IAYxB,SAAS,CACb,cAAc,EAAE,sBAAsB,EACtC,WAAW,EAAE,GAAG,EAAE,GACjB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAaX,wBAAwB;YA6BxB,iBAAiB;IA8C/B,OAAO,CAAC,8BAA8B;IAWtC,OAAO,CAAC,kBAAkB;CAI3B"}

package/dist/commonjs/queryExecutionContext/QueryControlFetchImplementation.js

@@ -0,0 +1,97 @@
+"use strict";
+// Copyright (c) Microsoft Corporation.
+// Licensed under the MIT License.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.QueryControlFetchImplementation = void 0;
+const headerUtils_js_1 = require("./headerUtils.js");
+const ContinuationTokenManagerFactory_js_1 = require("./ContinuationTokenManager/ContinuationTokenManagerFactory.js");
+const index_js_1 = require("../common/index.js");
+/**
+ * Query control enabled fetch implementation with continuation token support
+ * @hidden
+ */
+class QueryControlFetchImplementation {
+    endpoint;
+    pageSize;
+    // Required fields for query control - not optional
+    continuationTokenManager;
+    querySupportsTokens;
+    constructor(endpoint, pageSize, collectionLink, continuationToken, isOrderByQuery, querySupportsTokens) {
+        this.endpoint = endpoint;
+        this.pageSize = pageSize;
+        this.querySupportsTokens = querySupportsTokens;
+        // Initialize continuation token manager immediately for query control
+        this.continuationTokenManager = ContinuationTokenManagerFactory_js_1.ContinuationTokenManagerFactory.create(collectionLink, continuationToken, isOrderByQuery);
+    }
+    async fetchMore(diagnosticNode, fetchBuffer) {
+        // Initialize headers fresh for each fetchMore call
+        const fetchMoreRespHeaders = (0, headerUtils_js_1.getInitialHeader)();
+        // Use continuation token logic for supported queries when query control is enabled
+        // Otherwise use simplified buffer-only logic
+        if (this.querySupportsTokens) {
+            return this._handleQueryFetch(diagnosticNode, fetchBuffer, fetchMoreRespHeaders);
+        }
+        else {
+            return this._handleSimpleBufferFetch(diagnosticNode, fetchBuffer, fetchMoreRespHeaders);
+        }
+    }
+    async _handleSimpleBufferFetch(diagnosticNode, fetchBuffer, fetchMoreRespHeaders) {
+        // Return buffered data if available
+        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 };
+        }
+        // Fetch new data from endpoint
+        const response = await this.endpoint.fetchMore(diagnosticNode);
+        (0, headerUtils_js_1.mergeHeaders)(fetchMoreRespHeaders, response.headers);
+        if (!response?.result?.buffer?.length) {
+            return this._createEmptyResult(response?.headers);
+        }
+        // Buffer new data and return up to pageSize
+        fetchBuffer.length = 0; // Clear existing items
+        fetchBuffer.push(...response.result.buffer); // Add new items
+        const temp = fetchBuffer.slice(0, this.pageSize);
+        fetchBuffer.splice(0, this.pageSize); // Remove returned items in place
+        return { result: temp, headers: fetchMoreRespHeaders };
+    }
+    async _handleQueryFetch(diagnosticNode, fetchBuffer, fetchMoreRespHeaders) {
+        if (fetchBuffer.length > 0) {
+            const { endIndex, continuationToken } = this.continuationTokenManager.paginateResults(this.pageSize, false);
+            const temp = fetchBuffer.slice(0, endIndex);
+            fetchBuffer.splice(0, endIndex); // Remove returned items in place
+            this._setContinuationTokenInHeaders(continuationToken, fetchMoreRespHeaders);
+            return { result: temp, headers: fetchMoreRespHeaders };
+        }
+        // Fetch new data from endpoint
+        fetchBuffer.length = 0; // Clear existing items in place
+        const response = await this.endpoint.fetchMore(diagnosticNode);
+        (0, headerUtils_js_1.mergeHeaders)(fetchMoreRespHeaders, response.headers);
+        if (!response?.result?.buffer || response.result.buffer.length === 0) {
+            const { continuationToken } = this.continuationTokenManager.paginateResults(this.pageSize, true, // isResponseEmpty = true
+            response?.result);
+            this._setContinuationTokenInHeaders(continuationToken, fetchMoreRespHeaders);
+            return this._createEmptyResult(fetchMoreRespHeaders);
+        }
+        fetchBuffer.push(...response.result.buffer); // Add new items to existing buffer
+        const { endIndex, continuationToken } = this.continuationTokenManager.paginateResults(this.pageSize, false, // isResponseEmpty = false
+        response.result);
+        const temp = fetchBuffer.slice(0, endIndex);
+        fetchBuffer.splice(0, endIndex); // Remove returned items in place
+        this._setContinuationTokenInHeaders(continuationToken, fetchMoreRespHeaders);
+        return { result: temp, headers: fetchMoreRespHeaders };
+    }
+    _setContinuationTokenInHeaders(continuationToken, fetchMoreRespHeaders) {
+        if (continuationToken) {
+            Object.assign(fetchMoreRespHeaders, {
+                [index_js_1.Constants.HttpHeaders.Continuation]: continuationToken,
+            });
+        }
+    }
+    _createEmptyResult(headers) {
+        const hdrs = headers || (0, headerUtils_js_1.getInitialHeader)();
+        return { result: [], headers: hdrs };
+    }
+}
+exports.QueryControlFetchImplementation = QueryControlFetchImplementation;
+//# sourceMappingURL=QueryControlFetchImplementation.js.map

package/dist/commonjs/queryExecutionContext/QueryControlFetchImplementation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryControlFetchImplementation.js","sourceRoot":"","sources":["../../../src/queryExecutionContext/QueryControlFetchImplementation.ts"],"names":[],"mappings":";AAAA,uCAAuC;AACvC,kCAAkC;;;AAIlC,qDAAkE;AAElE,sHAAgH;AAChH,iDAA+C;AAG/C;;;GAGG;AACH,MAAa,+BAA+B;IAMhC;IACA;IANV,mDAAmD;IAClC,wBAAwB,CAA+B;IACvD,mBAAmB,CAAU;IAE9C,YACU,QAA0B,EAC1B,QAAgB,EACxB,cAAsB,EACtB,iBAAqC,EACrC,cAAuB,EACvB,mBAA4B;QALpB,aAAQ,GAAR,QAAQ,CAAkB;QAC1B,aAAQ,GAAR,QAAQ,CAAQ;QAMxB,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,CAAC;QAE/C,sEAAsE;QACtE,IAAI,CAAC,wBAAwB,GAAG,oEAA+B,CAAC,MAAM,CACpE,cAAc,EACd,iBAAiB,EACjB,cAAc,CACf,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,SAAS,CACb,cAAsC,EACtC,WAAkB;QAElB,mDAAmD;QACnD,MAAM,oBAAoB,GAAG,IAAA,iCAAgB,GAAE,CAAC;QAEhD,mFAAmF;QACnF,6CAA6C;QAC7C,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,iBAAiB,CAAC,cAAc,EAAE,WAAW,EAAE,oBAAoB,CAAC,CAAC;QACnF,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,wBAAwB,CAAC,cAAc,EAAE,WAAW,EAAE,oBAAoB,CAAC,CAAC;QAC1F,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,wBAAwB,CACpC,cAAsC,EACtC,WAAkB,EAClB,oBAAyC;QAEzC,oCAAoC;QACpC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACjD,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,wBAAwB;YAC9D,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,oBAAoB,EAAE,CAAC;QACzD,CAAC;QAED,+BAA+B;QAC/B,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,SAAU,CAAC,cAAc,CAAC,CAAC;QAChE,IAAA,6BAAY,EAAC,oBAAoB,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;QAErD,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;YACtC,OAAO,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACpD,CAAC;QAED,4CAA4C;QAC5C,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,uBAAuB;QAC/C,WAAW,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,gBAAgB;QAC7D,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjD,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,iCAAiC;QAEvE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,oBAAoB,EAAE,CAAC;IACzD,CAAC;IAEO,KAAK,CAAC,iBAAiB,CAC7B,cAAsC,EACtC,WAAkB,EAClB,oBAAyC;QAEzC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,EAAE,QAAQ,EAAE,iBAAiB,EAAE,GAAG,IAAI,CAAC,wBAAwB,CAAC,eAAe,CACnF,IAAI,CAAC,QAAQ,EACb,KAAK,CACN,CAAC;YACF,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC5C,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,iCAAiC;YAClE,IAAI,CAAC,8BAA8B,CAAC,iBAAiB,EAAE,oBAAoB,CAAC,CAAC;YAE7E,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,oBAAoB,EAAE,CAAC;QACzD,CAAC;QAED,+BAA+B;QAC/B,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,gCAAgC;QACxD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,SAAU,CAAC,cAAc,CAAC,CAAC;QAChE,IAAA,6BAAY,EAAC,oBAAoB,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;QAErD,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrE,MAAM,EAAE,iBAAiB,EAAE,GAAG,IAAI,CAAC,wBAAwB,CAAC,eAAe,CACzE,IAAI,CAAC,QAAQ,EACb,IAAI,EAAE,yBAAyB;YAC/B,QAAQ,EAAE,MAAM,CACjB,CAAC;YACF,IAAI,CAAC,8BAA8B,CAAC,iBAAiB,EAAE,oBAAoB,CAAC,CAAC;YAC7E,OAAO,IAAI,CAAC,kBAAkB,CAAC,oBAAoB,CAAC,CAAC;QACvD,CAAC;QAED,WAAW,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,mCAAmC;QAChF,MAAM,EAAE,QAAQ,EAAE,iBAAiB,EAAE,GAAG,IAAI,CAAC,wBAAwB,CAAC,eAAe,CACnF,IAAI,CAAC,QAAQ,EACb,KAAK,EAAE,0BAA0B;QACjC,QAAQ,CAAC,MAAM,CAChB,CAAC;QAEF,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC5C,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,iCAAiC;QAClE,IAAI,CAAC,8BAA8B,CAAC,iBAAiB,EAAE,oBAAoB,CAAC,CAAC;QAE7E,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,oBAAoB,EAAE,CAAC;IACzD,CAAC;IAEO,8BAA8B,CACpC,iBAAqC,EACrC,oBAAyC;QAEzC,IAAI,iBAAiB,EAAE,CAAC;YACtB,MAAM,CAAC,MAAM,CAAC,oBAAoB,EAAE;gBAClC,CAAC,oBAAS,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,iBAAiB;aACxD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAEO,kBAAkB,CAAC,OAAa;QACtC,MAAM,IAAI,GAAG,OAAO,IAAI,IAAA,iCAAgB,GAAE,CAAC;QAC3C,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IACvC,CAAC;CACF;AAjID,0EAiIC","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 { BaseContinuationTokenManager } from \"./ContinuationTokenManager/BaseContinuationTokenManager.js\";\nimport { ContinuationTokenManagerFactory } from \"./ContinuationTokenManager/ContinuationTokenManagerFactory.js\";\nimport { Constants } from \"../common/index.js\";\nimport type { ExecutionContext } from \"./ExecutionContext.js\";\n\n/**\n * Query control enabled fetch implementation with continuation token support\n * @hidden\n */\nexport class QueryControlFetchImplementation {\n  // Required fields for query control - not optional\n  private readonly continuationTokenManager: BaseContinuationTokenManager;\n  private readonly querySupportsTokens: boolean;\n\n  constructor(\n    private endpoint: ExecutionContext,\n    private pageSize: number,\n    collectionLink: string,\n    continuationToken: string | undefined,\n    isOrderByQuery: boolean,\n    querySupportsTokens: boolean,\n  ) {\n    this.querySupportsTokens = querySupportsTokens;\n\n    // Initialize continuation token manager immediately for query control\n    this.continuationTokenManager = ContinuationTokenManagerFactory.create(\n      collectionLink,\n      continuationToken,\n      isOrderByQuery,\n    );\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    // Use continuation token logic for supported queries when query control is enabled\n    // Otherwise use simplified buffer-only logic\n    if (this.querySupportsTokens) {\n      return this._handleQueryFetch(diagnosticNode, fetchBuffer, fetchMoreRespHeaders);\n    } else {\n      return this._handleSimpleBufferFetch(diagnosticNode, fetchBuffer, fetchMoreRespHeaders);\n    }\n  }\n\n  private async _handleSimpleBufferFetch(\n    diagnosticNode: DiagnosticNodeInternal,\n    fetchBuffer: any[],\n    fetchMoreRespHeaders: Record<string, any>,\n  ): Promise<Response<any>> {\n    // Return buffered data if available\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    }\n\n    // Fetch new data from endpoint\n    const response = await this.endpoint.fetchMore!(diagnosticNode);\n    mergeHeaders(fetchMoreRespHeaders, response.headers);\n\n    if (!response?.result?.buffer?.length) {\n      return this._createEmptyResult(response?.headers);\n    }\n\n    // Buffer new data and return up to pageSize\n    fetchBuffer.length = 0; // Clear existing items\n    fetchBuffer.push(...response.result.buffer); // Add new items\n    const temp = fetchBuffer.slice(0, this.pageSize);\n    fetchBuffer.splice(0, this.pageSize); // Remove returned items in place\n\n    return { result: temp, headers: fetchMoreRespHeaders };\n  }\n\n  private async _handleQueryFetch(\n    diagnosticNode: DiagnosticNodeInternal,\n    fetchBuffer: any[],\n    fetchMoreRespHeaders: Record<string, any>,\n  ): Promise<Response<any>> {\n    if (fetchBuffer.length > 0) {\n      const { endIndex, continuationToken } = this.continuationTokenManager.paginateResults(\n        this.pageSize,\n        false,\n      );\n      const temp = fetchBuffer.slice(0, endIndex);\n      fetchBuffer.splice(0, endIndex); // Remove returned items in place\n      this._setContinuationTokenInHeaders(continuationToken, fetchMoreRespHeaders);\n\n      return { result: temp, headers: fetchMoreRespHeaders };\n    }\n\n    // Fetch new data from endpoint\n    fetchBuffer.length = 0; // Clear existing items in place\n    const response = await this.endpoint.fetchMore!(diagnosticNode);\n    mergeHeaders(fetchMoreRespHeaders, response.headers);\n\n    if (!response?.result?.buffer || response.result.buffer.length === 0) {\n      const { continuationToken } = this.continuationTokenManager.paginateResults(\n        this.pageSize,\n        true, // isResponseEmpty = true\n        response?.result, // Pass response data for processing\n      );\n      this._setContinuationTokenInHeaders(continuationToken, fetchMoreRespHeaders);\n      return this._createEmptyResult(fetchMoreRespHeaders);\n    }\n\n    fetchBuffer.push(...response.result.buffer); // Add new items to existing buffer\n    const { endIndex, continuationToken } = this.continuationTokenManager.paginateResults(\n      this.pageSize,\n      false, // isResponseEmpty = false\n      response.result, // Pass response data for processing\n    );\n\n    const temp = fetchBuffer.slice(0, endIndex);\n    fetchBuffer.splice(0, endIndex); // Remove returned items in place\n    this._setContinuationTokenInHeaders(continuationToken, fetchMoreRespHeaders);\n\n    return { result: temp, headers: fetchMoreRespHeaders };\n  }\n\n  private _setContinuationTokenInHeaders(\n    continuationToken: string | undefined,\n    fetchMoreRespHeaders: Record<string, any>,\n  ): void {\n    if (continuationToken) {\n      Object.assign(fetchMoreRespHeaders, {\n        [Constants.HttpHeaders.Continuation]: continuationToken,\n      });\n    }\n  }\n\n  private _createEmptyResult(headers?: any): Response<any> {\n    const hdrs = headers || getInitialHeader();\n    return { result: [], headers: hdrs };\n  }\n}\n"]}

package/dist/commonjs/queryExecutionContext/QueryValidationHelper.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Rejects continuation token usage for unsupported query types
+ * @param continuationToken - The continuation token if provided
+ * @param unsupportedQueryTypes - Array of query types that don't support continuation tokens
+ * @throws ErrorResponse if continuation token is provided for any unsupported query type
+ * @hidden
+ */
+export declare function rejectContinuationTokenForUnsupportedQueries(continuationToken: string | undefined, unsupportedQueryTypes: UnsupportedQueryType[]): void;
+//# sourceMappingURL=QueryValidationHelper.d.ts.map

package/dist/commonjs/queryExecutionContext/QueryValidationHelper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryValidationHelper.d.ts","sourceRoot":"","sources":["../../../src/queryExecutionContext/QueryValidationHelper.ts"],"names":[],"mappings":"AAcA;;;;;;GAMG;AACH,wBAAgB,4CAA4C,CAC1D,iBAAiB,EAAE,MAAM,GAAG,SAAS,EACrC,qBAAqB,EAAE,oBAAoB,EAAE,GAC5C,IAAI,CAWN"}