@azure/cosmos 4.9.1 → 4.9.3

package/dist/commonjs/queryExecutionContext/EndpointComponent/NonStreamingOrderByEndpointComponent.js

@@ -1,154 +1,169 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.NonStreamingOrderByEndpointComponent = void 0;
-const orderByComparator_js_1 = require("../orderByComparator.js");
-const fixedSizePriorityQueue_js_1 = require("../../utils/fixedSizePriorityQueue.js");
-const headerUtils_js_1 = require("../headerUtils.js");
-const parallelQueryResult_js_1 = require("../parallelQueryResult.js");
-/**
- * @hidden
- * Represents an endpoint in handling an non-streaming order by query.
- */
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var NonStreamingOrderByEndpointComponent_exports = {};
+__export(NonStreamingOrderByEndpointComponent_exports, {
+  NonStreamingOrderByEndpointComponent: () => NonStreamingOrderByEndpointComponent
+});
+module.exports = __toCommonJS(NonStreamingOrderByEndpointComponent_exports);
+var import_orderByComparator = require("../orderByComparator.js");
+var import_fixedSizePriorityQueue = require("../../utils/fixedSizePriorityQueue.js");
+var import_headerUtils = require("../headerUtils.js");
+var import_parallelQueryResult = require("../parallelQueryResult.js");
 class NonStreamingOrderByEndpointComponent {
-    executionContext;
-    sortOrders;
-    priorityQueueBufferSize;
-    offset;
-    emitRawOrderByPayload;
-    /**
-     * A priority queue to store the final sorted results.
-     */
-    nonStreamingOrderByPQ;
-    /**
-     * Flag to determine if all results are fetched from backend and results can be returned from priority queue.
-     */
-    isCompleted = false;
-    /**
-     * Represents an endpoint in handling an non-streaming order by query. For each processed orderby
-     * result it returns 'payload' item of the result
-     *
-     * @param executionContext - Underlying Execution Context
-     * @hidden
-     */
-    constructor(executionContext, sortOrders, priorityQueueBufferSize, offset = 0, emitRawOrderByPayload = false) {
-        this.executionContext = executionContext;
-        this.sortOrders = sortOrders;
-        this.priorityQueueBufferSize = priorityQueueBufferSize;
-        this.offset = offset;
-        this.emitRawOrderByPayload = emitRawOrderByPayload;
-        const comparator = new orderByComparator_js_1.OrderByComparator(this.sortOrders);
-        this.nonStreamingOrderByPQ = new fixedSizePriorityQueue_js_1.FixedSizePriorityQueue((a, b) => {
-            return comparator.compareItems(b, a);
-        }, this.priorityQueueBufferSize);
+  /**
+   * Represents an endpoint in handling an non-streaming order by query. For each processed orderby
+   * result it returns 'payload' item of the result
+   *
+   * @param executionContext - Underlying Execution Context
+   * @hidden
+   */
+  constructor(executionContext, sortOrders, priorityQueueBufferSize, offset = 0, emitRawOrderByPayload = false) {
+    this.executionContext = executionContext;
+    this.sortOrders = sortOrders;
+    this.priorityQueueBufferSize = priorityQueueBufferSize;
+    this.offset = offset;
+    this.emitRawOrderByPayload = emitRawOrderByPayload;
+    const comparator = new import_orderByComparator.OrderByComparator(this.sortOrders);
+    this.nonStreamingOrderByPQ = new import_fixedSizePriorityQueue.FixedSizePriorityQueue(
+      (a, b) => {
+        return comparator.compareItems(b, a);
+      },
+      this.priorityQueueBufferSize
+    );
+  }
+  executionContext;
+  sortOrders;
+  priorityQueueBufferSize;
+  offset;
+  emitRawOrderByPayload;
+  /**
+   * A priority queue to store the final sorted results.
+   */
+  nonStreamingOrderByPQ;
+  /**
+   * Flag to determine if all results are fetched from backend and results can be returned from priority queue.
+   */
+  isCompleted = false;
+  /**
+   * Determine if there are still remaining resources to processs.
+   * @returns true if there is other elements to process in the NonStreamingOrderByEndpointComponent.
+   */
+  hasMoreResults() {
+    return this.priorityQueueBufferSize > 0 && this.executionContext.hasMoreResults();
+  }
+  /**
+   * Fetches the next batch of the result from the target container.
+   * @param diagnosticNode - The diagnostic information for the request.
+   */
+  async fetchMore(diagnosticNode) {
+    if (this.isCompleted) {
+      return {
+        result: void 0,
+        headers: (0, import_headerUtils.getInitialHeader)()
+      };
     }
-    /**
-     * Determine if there are still remaining resources to processs.
-     * @returns true if there is other elements to process in the NonStreamingOrderByEndpointComponent.
-     */
-    hasMoreResults() {
-        return this.priorityQueueBufferSize > 0 && this.executionContext.hasMoreResults();
+    let resHeaders = (0, import_headerUtils.getInitialHeader)();
+    if (this.priorityQueueBufferSize <= 0) {
+      return {
+        result: void 0,
+        headers: resHeaders
+      };
     }
-    /**
-     * Fetches the next batch of the result from the target container.
-     * @param diagnosticNode - The diagnostic information for the request.
-     */
-    async fetchMore(diagnosticNode) {
-        if (this.isCompleted) {
-            return {
-                result: undefined,
-                headers: (0, headerUtils_js_1.getInitialHeader)(),
-            };
-        }
-        let resHeaders = (0, headerUtils_js_1.getInitialHeader)();
-        // if size is 0, just return undefined to signal to more results. Valid if query is TOP 0 or LIMIT 0
-        if (this.priorityQueueBufferSize <= 0) {
-            return {
-                result: undefined,
-                headers: resHeaders,
-            };
-        }
-        // If there are more results in backend, keep filling pq.
-        if (this.executionContext.hasMoreResults()) {
-            const response = await this.executionContext.fetchMore(diagnosticNode);
-            if (!response) {
-                this.isCompleted = true;
-                if (!this.nonStreamingOrderByPQ.isEmpty()) {
-                    return this.buildFinalResultArray(resHeaders);
-                }
-                return { result: undefined, headers: resHeaders };
-            }
-            resHeaders = response.headers;
-            if (response.result === undefined ||
-                !response.result.buffer ||
-                response.result.buffer.length === 0) {
-                this.isCompleted = true;
-                if (!this.nonStreamingOrderByPQ.isEmpty()) {
-                    return this.buildFinalResultArray(resHeaders);
-                }
-                return { result: undefined, headers: resHeaders };
-            }
-            const parallelResult = response.result;
-            const dataToProcess = parallelResult.buffer;
-            for (const item of dataToProcess) {
-                if (item !== undefined) {
-                    this.nonStreamingOrderByPQ.enqueue(item);
-                }
-            }
+    if (this.executionContext.hasMoreResults()) {
+      const response = await this.executionContext.fetchMore(diagnosticNode);
+      if (!response) {
+        this.isCompleted = true;
+        if (!this.nonStreamingOrderByPQ.isEmpty()) {
+          return this.buildFinalResultArray(resHeaders);
         }
-        // If the backend has more results to fetch, return [] to signal that there are more results to fetch.
-        if (this.executionContext.hasMoreResults()) {
-            const result = (0, parallelQueryResult_js_1.createParallelQueryResult)([], // empty buffer
-            new Map(), {});
-            return {
-                result,
-                headers: resHeaders,
-            };
+        return { result: void 0, headers: resHeaders };
+      }
+      resHeaders = response.headers;
+      if (response.result === void 0 || !response.result.buffer || response.result.buffer.length === 0) {
+        this.isCompleted = true;
+        if (!this.nonStreamingOrderByPQ.isEmpty()) {
+          return this.buildFinalResultArray(resHeaders);
         }
-        // If all results are fetched from backend, prepare final results
-        if (!this.executionContext.hasMoreResults() && !this.isCompleted) {
-            this.isCompleted = true;
-            return this.buildFinalResultArray(resHeaders, new Map(), {});
+        return { result: void 0, headers: resHeaders };
+      }
+      const parallelResult = response.result;
+      const dataToProcess = parallelResult.buffer;
+      for (const item of dataToProcess) {
+        if (item !== void 0) {
+          this.nonStreamingOrderByPQ.enqueue(item);
         }
-        // If pq is empty, return undefined to signal that there are no more results.
-        const result = (0, parallelQueryResult_js_1.createParallelQueryResult)([], new Map(), {});
-        return {
-            result,
-            headers: resHeaders,
-        };
+      }
     }
-    async buildFinalResultArray(resHeaders, partitionKeyRangeMap, updatedContinuationRanges) {
-        // Set isCompleted to true.
-        this.isCompleted = true;
-        // Reverse the priority queue to get the results in the correct order
-        this.nonStreamingOrderByPQ = this.nonStreamingOrderByPQ.reverse();
-        // For offset limit case we set the size of priority queue to offset + limit
-        // and we drain offset number of items from the priority queue
-        while (this.offset < this.priorityQueueBufferSize &&
-            this.offset > 0 &&
-            !this.nonStreamingOrderByPQ.isEmpty()) {
-            this.nonStreamingOrderByPQ.dequeue();
-            this.offset--;
+    if (this.executionContext.hasMoreResults()) {
+      const result2 = (0, import_parallelQueryResult.createParallelQueryResult)(
+        [],
+        // empty buffer
+        /* @__PURE__ */ new Map(),
+        {}
+      );
+      return {
+        result: result2,
+        headers: resHeaders
+      };
+    }
+    if (!this.executionContext.hasMoreResults() && !this.isCompleted) {
+      this.isCompleted = true;
+      return this.buildFinalResultArray(resHeaders, /* @__PURE__ */ new Map(), {});
+    }
+    const result = (0, import_parallelQueryResult.createParallelQueryResult)([], /* @__PURE__ */ new Map(), {});
+    return {
+      result,
+      headers: resHeaders
+    };
+  }
+  async buildFinalResultArray(resHeaders, partitionKeyRangeMap, updatedContinuationRanges) {
+    this.isCompleted = true;
+    this.nonStreamingOrderByPQ = this.nonStreamingOrderByPQ.reverse();
+    while (this.offset < this.priorityQueueBufferSize && this.offset > 0 && !this.nonStreamingOrderByPQ.isEmpty()) {
+      this.nonStreamingOrderByPQ.dequeue();
+      this.offset--;
+    }
+    if (!this.nonStreamingOrderByPQ.isEmpty()) {
+      const buffer = [];
+      if (this.emitRawOrderByPayload) {
+        while (!this.nonStreamingOrderByPQ.isEmpty()) {
+          buffer.push(this.nonStreamingOrderByPQ.dequeue());
         }
-        // If pq is not empty, return the result from pq.
-        if (!this.nonStreamingOrderByPQ.isEmpty()) {
-            const buffer = [];
-            if (this.emitRawOrderByPayload) {
-                while (!this.nonStreamingOrderByPQ.isEmpty()) {
-                    buffer.push(this.nonStreamingOrderByPQ.dequeue());
-                }
-            }
-            else {
-                while (!this.nonStreamingOrderByPQ.isEmpty()) {
-                    buffer.push(this.nonStreamingOrderByPQ.dequeue()?.payload);
-                }
-            }
-            const result = (0, parallelQueryResult_js_1.createParallelQueryResult)(buffer, partitionKeyRangeMap || new Map(), updatedContinuationRanges || {}, undefined);
-            return {
-                result,
-                headers: resHeaders,
-            };
+      } else {
+        while (!this.nonStreamingOrderByPQ.isEmpty()) {
+          buffer.push(this.nonStreamingOrderByPQ.dequeue()?.payload);
         }
+      }
+      const result = (0, import_parallelQueryResult.createParallelQueryResult)(
+        buffer,
+        partitionKeyRangeMap || /* @__PURE__ */ new Map(),
+        updatedContinuationRanges || {},
+        void 0
+      );
+      return {
+        result,
+        headers: resHeaders
+      };
     }
+  }
 }
-exports.NonStreamingOrderByEndpointComponent = NonStreamingOrderByEndpointComponent;
-//# sourceMappingURL=NonStreamingOrderByEndpointComponent.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  NonStreamingOrderByEndpointComponent
+});
+//# sourceMappingURL=NonStreamingOrderByEndpointComponent.js.map

package/dist/commonjs/queryExecutionContext/EndpointComponent/NonStreamingOrderByEndpointComponent.js.map

@@ -1 +1,7 @@
-{"version":3,"file":"NonStreamingOrderByEndpointComponent.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/NonStreamingOrderByEndpointComponent.ts"],"names":[],"mappings":";;;AAKA,kEAA4D;AAE5D,qFAA+E;AAE/E,sDAAqD;AAGrD,sEAAsE;AAEtE;;;GAGG;AACH,MAAa,oCAAoC;IAiBrC;IACA;IACA;IACA;IACA;IApBV;;OAEG;IACK,qBAAqB,CAAoD;IACjF;;OAEG;IACK,WAAW,GAAY,KAAK,CAAC;IACrC;;;;;;OAMG;IACH,YACU,gBAAkC,EAClC,UAAiB,EACjB,uBAA+B,EAC/B,SAAiB,CAAC,EAClB,wBAAiC,KAAK;QAJtC,qBAAgB,GAAhB,gBAAgB,CAAkB;QAClC,eAAU,GAAV,UAAU,CAAO;QACjB,4BAAuB,GAAvB,uBAAuB,CAAQ;QAC/B,WAAM,GAAN,MAAM,CAAY;QAClB,0BAAqB,GAArB,qBAAqB,CAAiB;QAE9C,MAAM,UAAU,GAAG,IAAI,wCAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1D,IAAI,CAAC,qBAAqB,GAAG,IAAI,kDAAsB,CACrD,CAAC,CAA4B,EAAE,CAA4B,EAAE,EAAE;YAC7D,OAAO,UAAU,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvC,CAAC,EACD,IAAI,CAAC,uBAAuB,CAC7B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACI,cAAc;QACnB,OAAO,IAAI,CAAC,uBAAuB,GAAG,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC;IACpF,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,SAAS,CAAC,cAAuC;QAC5D,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,OAAO;gBACL,MAAM,EAAE,SAAS;gBACjB,OAAO,EAAE,IAAA,iCAAgB,GAAE;aAC5B,CAAC;QACJ,CAAC;QACD,IAAI,UAAU,GAAG,IAAA,iCAAgB,GAAE,CAAC;QAEpC,oGAAoG;QACpG,IAAI,IAAI,CAAC,uBAAuB,IAAI,CAAC,EAAE,CAAC;YACtC,OAAO;gBACL,MAAM,EAAE,SAAS;gBACjB,OAAO,EAAE,UAAU;aACpB,CAAC;QACJ,CAAC;QACD,yDAAyD;QACzD,IAAI,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,EAAE,CAAC;YAC3C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;YAEvE,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC1C,OAAO,IAAI,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;gBAChD,CAAC;gBACD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;YACpD,CAAC;YAED,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC;YAC9B,IACE,QAAQ,CAAC,MAAM,KAAK,SAAS;gBAC7B,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM;gBACvB,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;gBACD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC1C,OAAO,IAAI,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;gBAChD,CAAC;gBACD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;YACpD,CAAC;YAED,MAAM,cAAc,GAAG,QAAQ,CAAC,MAA6B,CAAC;YAC9D,MAAM,aAAa,GACjB,cAAc,CAAC,MAAqC,CAAC;YAEvD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;gBACjC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;QACH,CAAC;QAED,sGAAsG;QACtG,IAAI,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,IAAA,kDAAyB,EACtC,EAAE,EAAE,eAAe;YACnB,IAAI,GAAG,EAAE,EACT,EAAE,CACH,CAAC;YAEF,OAAO;gBACL,MAAM;gBACN,OAAO,EAAE,UAAU;aACpB,CAAC;QACJ,CAAC;QAED,iEAAiE;QACjE,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,OAAO,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/D,CAAC;QAED,6EAA6E;QAC7E,MAAM,MAAM,GAAG,IAAA,kDAAyB,EAAC,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;QAE5D,OAAO;YACL,MAAM;YACN,OAAO,EAAE,UAAU;SACpB,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,qBAAqB,CACjC,UAAyB,EACzB,oBAAqD,EACrD,yBAA+C;QAE/C,2BAA2B;QAC3B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,qEAAqE;QACrE,IAAI,CAAC,qBAAqB,GAAG,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,CAAC;QAClE,4EAA4E;QAC5E,8DAA8D;QAC9D,OACE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,uBAAuB;YAC1C,IAAI,CAAC,MAAM,GAAG,CAAC;YACf,CAAC,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,EACrC,CAAC;YACD,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,CAAC;YACrC,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,CAAC;QAED,iDAAiD;QACjD,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1C,MAAM,MAAM,GAAU,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;gBAC/B,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC7C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,CAAC,CAAC;gBACpD,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC7C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,CAAC;gBAC7D,CAAC;YACH,CAAC;YACD,MAAM,MAAM,GAAG,IAAA,kDAAyB,EACtC,MAAM,EACN,oBAAoB,IAAI,IAAI,GAAG,EAAE,EACjC,yBAAyB,IAAI,EAAE,EAC/B,SAAS,CACV,CAAC;YAEF,OAAO;gBACL,MAAM;gBACN,OAAO,EAAE,UAAU;aACpB,CAAC;QACJ,CAAC;IACH,CAAC;CACF;AA1KD,oFA0KC","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 { OrderByComparator } from \"../orderByComparator.js\";\nimport type { NonStreamingOrderByResult } from \"../nonStreamingOrderByResult.js\";\nimport { FixedSizePriorityQueue } from \"../../utils/fixedSizePriorityQueue.js\";\nimport type { CosmosHeaders } from \"../headerUtils.js\";\nimport { getInitialHeader } from \"../headerUtils.js\";\nimport type { QueryRangeMapping } from \"../queryRangeMapping.js\";\nimport type { ParallelQueryResult } from \"../parallelQueryResult.js\";\nimport { createParallelQueryResult } from \"../parallelQueryResult.js\";\n\n/**\n * @hidden\n * Represents an endpoint in handling an non-streaming order by query.\n */\nexport class NonStreamingOrderByEndpointComponent implements ExecutionContext {\n  /**\n   * A priority queue to store the final sorted results.\n   */\n  private nonStreamingOrderByPQ: FixedSizePriorityQueue<NonStreamingOrderByResult>;\n  /**\n   * Flag to determine if all results are fetched from backend and results can be returned from priority queue.\n   */\n  private isCompleted: boolean = false;\n  /**\n   * Represents an endpoint in handling an non-streaming 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 sortOrders: any[],\n    private priorityQueueBufferSize: number,\n    private offset: number = 0,\n    private emitRawOrderByPayload: boolean = false,\n  ) {\n    const comparator = new OrderByComparator(this.sortOrders);\n    this.nonStreamingOrderByPQ = new FixedSizePriorityQueue<NonStreamingOrderByResult>(\n      (a: NonStreamingOrderByResult, b: NonStreamingOrderByResult) => {\n        return comparator.compareItems(b, a);\n      },\n      this.priorityQueueBufferSize,\n    );\n  }\n\n  /**\n   * Determine if there are still remaining resources to processs.\n   * @returns true if there is other elements to process in the NonStreamingOrderByEndpointComponent.\n   */\n  public hasMoreResults(): boolean {\n    return this.priorityQueueBufferSize > 0 && this.executionContext.hasMoreResults();\n  }\n\n  /**\n   * Fetches the next batch of the result from the target container.\n   * @param diagnosticNode - The diagnostic information for the request.\n   */\n  public async fetchMore(diagnosticNode?: DiagnosticNodeInternal): Promise<Response<any>> {\n    if (this.isCompleted) {\n      return {\n        result: undefined,\n        headers: getInitialHeader(),\n      };\n    }\n    let resHeaders = getInitialHeader();\n\n    // if size is 0, just return undefined to signal to more results. Valid if query is TOP 0 or LIMIT 0\n    if (this.priorityQueueBufferSize <= 0) {\n      return {\n        result: undefined,\n        headers: resHeaders,\n      };\n    }\n    // If there are more results in backend, keep filling pq.\n    if (this.executionContext.hasMoreResults()) {\n      const response = await this.executionContext.fetchMore(diagnosticNode);\n\n      if (!response) {\n        this.isCompleted = true;\n        if (!this.nonStreamingOrderByPQ.isEmpty()) {\n          return this.buildFinalResultArray(resHeaders);\n        }\n        return { result: undefined, headers: resHeaders };\n      }\n\n      resHeaders = response.headers;\n      if (\n        response.result === undefined ||\n        !response.result.buffer ||\n        response.result.buffer.length === 0\n      ) {\n        this.isCompleted = true;\n        if (!this.nonStreamingOrderByPQ.isEmpty()) {\n          return this.buildFinalResultArray(resHeaders);\n        }\n        return { result: undefined, headers: resHeaders };\n      }\n\n      const parallelResult = response.result as ParallelQueryResult;\n      const dataToProcess: NonStreamingOrderByResult[] =\n        parallelResult.buffer as NonStreamingOrderByResult[];\n\n      for (const item of dataToProcess) {\n        if (item !== undefined) {\n          this.nonStreamingOrderByPQ.enqueue(item);\n        }\n      }\n    }\n\n    // If the backend has more results to fetch, return [] to signal that there are more results to fetch.\n    if (this.executionContext.hasMoreResults()) {\n      const result = createParallelQueryResult(\n        [], // empty buffer\n        new Map(),\n        {},\n      );\n\n      return {\n        result,\n        headers: resHeaders,\n      };\n    }\n\n    // If all results are fetched from backend, prepare final results\n    if (!this.executionContext.hasMoreResults() && !this.isCompleted) {\n      this.isCompleted = true;\n      return this.buildFinalResultArray(resHeaders, new Map(), {});\n    }\n\n    // If pq is empty, return undefined to signal that there are no more results.\n    const result = createParallelQueryResult([], new Map(), {});\n\n    return {\n      result,\n      headers: resHeaders,\n    };\n  }\n\n  private async buildFinalResultArray(\n    resHeaders: CosmosHeaders,\n    partitionKeyRangeMap?: Map<string, QueryRangeMapping>,\n    updatedContinuationRanges?: Record<string, any>,\n  ): Promise<Response<any>> {\n    // Set isCompleted to true.\n    this.isCompleted = true;\n    // Reverse the priority queue to get the results in the correct order\n    this.nonStreamingOrderByPQ = this.nonStreamingOrderByPQ.reverse();\n    // For offset limit case we set the size of priority queue to offset + limit\n    // and we drain offset number of items from the priority queue\n    while (\n      this.offset < this.priorityQueueBufferSize &&\n      this.offset > 0 &&\n      !this.nonStreamingOrderByPQ.isEmpty()\n    ) {\n      this.nonStreamingOrderByPQ.dequeue();\n      this.offset--;\n    }\n\n    // If pq is not empty, return the result from pq.\n    if (!this.nonStreamingOrderByPQ.isEmpty()) {\n      const buffer: any[] = [];\n      if (this.emitRawOrderByPayload) {\n        while (!this.nonStreamingOrderByPQ.isEmpty()) {\n          buffer.push(this.nonStreamingOrderByPQ.dequeue());\n        }\n      } else {\n        while (!this.nonStreamingOrderByPQ.isEmpty()) {\n          buffer.push(this.nonStreamingOrderByPQ.dequeue()?.payload);\n        }\n      }\n      const result = createParallelQueryResult(\n        buffer,\n        partitionKeyRangeMap || new Map(),\n        updatedContinuationRanges || {},\n        undefined,\n      );\n\n      return {\n        result,\n        headers: resHeaders,\n      };\n    }\n  }\n}\n"]}
+{
+  "version": 3,
+  "sources": ["../../../../src/queryExecutionContext/EndpointComponent/NonStreamingOrderByEndpointComponent.ts"],
+  "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 { OrderByComparator } from \"../orderByComparator.js\";\nimport type { NonStreamingOrderByResult } from \"../nonStreamingOrderByResult.js\";\nimport { FixedSizePriorityQueue } from \"../../utils/fixedSizePriorityQueue.js\";\nimport type { CosmosHeaders } from \"../headerUtils.js\";\nimport { getInitialHeader } from \"../headerUtils.js\";\nimport type { QueryRangeMapping } from \"../queryRangeMapping.js\";\nimport type { ParallelQueryResult } from \"../parallelQueryResult.js\";\nimport { createParallelQueryResult } from \"../parallelQueryResult.js\";\n\n/**\n * @hidden\n * Represents an endpoint in handling an non-streaming order by query.\n */\nexport class NonStreamingOrderByEndpointComponent implements ExecutionContext {\n  /**\n   * A priority queue to store the final sorted results.\n   */\n  private nonStreamingOrderByPQ: FixedSizePriorityQueue<NonStreamingOrderByResult>;\n  /**\n   * Flag to determine if all results are fetched from backend and results can be returned from priority queue.\n   */\n  private isCompleted: boolean = false;\n  /**\n   * Represents an endpoint in handling an non-streaming 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 sortOrders: any[],\n    private priorityQueueBufferSize: number,\n    private offset: number = 0,\n    private emitRawOrderByPayload: boolean = false,\n  ) {\n    const comparator = new OrderByComparator(this.sortOrders);\n    this.nonStreamingOrderByPQ = new FixedSizePriorityQueue<NonStreamingOrderByResult>(\n      (a: NonStreamingOrderByResult, b: NonStreamingOrderByResult) => {\n        return comparator.compareItems(b, a);\n      },\n      this.priorityQueueBufferSize,\n    );\n  }\n\n  /**\n   * Determine if there are still remaining resources to processs.\n   * @returns true if there is other elements to process in the NonStreamingOrderByEndpointComponent.\n   */\n  public hasMoreResults(): boolean {\n    return this.priorityQueueBufferSize > 0 && this.executionContext.hasMoreResults();\n  }\n\n  /**\n   * Fetches the next batch of the result from the target container.\n   * @param diagnosticNode - The diagnostic information for the request.\n   */\n  public async fetchMore(diagnosticNode?: DiagnosticNodeInternal): Promise<Response<any>> {\n    if (this.isCompleted) {\n      return {\n        result: undefined,\n        headers: getInitialHeader(),\n      };\n    }\n    let resHeaders = getInitialHeader();\n\n    // if size is 0, just return undefined to signal to more results. Valid if query is TOP 0 or LIMIT 0\n    if (this.priorityQueueBufferSize <= 0) {\n      return {\n        result: undefined,\n        headers: resHeaders,\n      };\n    }\n    // If there are more results in backend, keep filling pq.\n    if (this.executionContext.hasMoreResults()) {\n      const response = await this.executionContext.fetchMore(diagnosticNode);\n\n      if (!response) {\n        this.isCompleted = true;\n        if (!this.nonStreamingOrderByPQ.isEmpty()) {\n          return this.buildFinalResultArray(resHeaders);\n        }\n        return { result: undefined, headers: resHeaders };\n      }\n\n      resHeaders = response.headers;\n      if (\n        response.result === undefined ||\n        !response.result.buffer ||\n        response.result.buffer.length === 0\n      ) {\n        this.isCompleted = true;\n        if (!this.nonStreamingOrderByPQ.isEmpty()) {\n          return this.buildFinalResultArray(resHeaders);\n        }\n        return { result: undefined, headers: resHeaders };\n      }\n\n      const parallelResult = response.result as ParallelQueryResult;\n      const dataToProcess: NonStreamingOrderByResult[] =\n        parallelResult.buffer as NonStreamingOrderByResult[];\n\n      for (const item of dataToProcess) {\n        if (item !== undefined) {\n          this.nonStreamingOrderByPQ.enqueue(item);\n        }\n      }\n    }\n\n    // If the backend has more results to fetch, return [] to signal that there are more results to fetch.\n    if (this.executionContext.hasMoreResults()) {\n      const result = createParallelQueryResult(\n        [], // empty buffer\n        new Map(),\n        {},\n      );\n\n      return {\n        result,\n        headers: resHeaders,\n      };\n    }\n\n    // If all results are fetched from backend, prepare final results\n    if (!this.executionContext.hasMoreResults() && !this.isCompleted) {\n      this.isCompleted = true;\n      return this.buildFinalResultArray(resHeaders, new Map(), {});\n    }\n\n    // If pq is empty, return undefined to signal that there are no more results.\n    const result = createParallelQueryResult([], new Map(), {});\n\n    return {\n      result,\n      headers: resHeaders,\n    };\n  }\n\n  private async buildFinalResultArray(\n    resHeaders: CosmosHeaders,\n    partitionKeyRangeMap?: Map<string, QueryRangeMapping>,\n    updatedContinuationRanges?: Record<string, any>,\n  ): Promise<Response<any>> {\n    // Set isCompleted to true.\n    this.isCompleted = true;\n    // Reverse the priority queue to get the results in the correct order\n    this.nonStreamingOrderByPQ = this.nonStreamingOrderByPQ.reverse();\n    // For offset limit case we set the size of priority queue to offset + limit\n    // and we drain offset number of items from the priority queue\n    while (\n      this.offset < this.priorityQueueBufferSize &&\n      this.offset > 0 &&\n      !this.nonStreamingOrderByPQ.isEmpty()\n    ) {\n      this.nonStreamingOrderByPQ.dequeue();\n      this.offset--;\n    }\n\n    // If pq is not empty, return the result from pq.\n    if (!this.nonStreamingOrderByPQ.isEmpty()) {\n      const buffer: any[] = [];\n      if (this.emitRawOrderByPayload) {\n        while (!this.nonStreamingOrderByPQ.isEmpty()) {\n          buffer.push(this.nonStreamingOrderByPQ.dequeue());\n        }\n      } else {\n        while (!this.nonStreamingOrderByPQ.isEmpty()) {\n          buffer.push(this.nonStreamingOrderByPQ.dequeue()?.payload);\n        }\n      }\n      const result = createParallelQueryResult(\n        buffer,\n        partitionKeyRangeMap || new Map(),\n        updatedContinuationRanges || {},\n        undefined,\n      );\n\n      return {\n        result,\n        headers: resHeaders,\n      };\n    }\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAKA,+BAAkC;AAElC,oCAAuC;AAEvC,yBAAiC;AAGjC,iCAA0C;AAMnC,MAAM,qCAAiE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgB5E,YACU,kBACA,YACA,yBACA,SAAiB,GACjB,wBAAiC,OACzC;AALQ;AACA;AACA;AACA;AACA;AAER,UAAM,aAAa,IAAI,2CAAkB,KAAK,UAAU;AACxD,SAAK,wBAAwB,IAAI;AAAA,MAC/B,CAAC,GAA8B,MAAiC;AAC9D,eAAO,WAAW,aAAa,GAAG,CAAC;AAAA,MACrC;AAAA,MACA,KAAK;AAAA,IACP;AAAA,EACF;AAAA,EAbU;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA,EAjBF;AAAA;AAAA;AAAA;AAAA,EAIA,cAAuB;AAAA;AAAA;AAAA;AAAA;AAAA,EA4BxB,iBAA0B;AAC/B,WAAO,KAAK,0BAA0B,KAAK,KAAK,iBAAiB,eAAe;AAAA,EAClF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAa,UAAU,gBAAiE;AACtF,QAAI,KAAK,aAAa;AACpB,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,aAAS,qCAAiB;AAAA,MAC5B;AAAA,IACF;AACA,QAAI,iBAAa,qCAAiB;AAGlC,QAAI,KAAK,2BAA2B,GAAG;AACrC,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,SAAS;AAAA,MACX;AAAA,IACF;AAEA,QAAI,KAAK,iBAAiB,eAAe,GAAG;AAC1C,YAAM,WAAW,MAAM,KAAK,iBAAiB,UAAU,cAAc;AAErE,UAAI,CAAC,UAAU;AACb,aAAK,cAAc;AACnB,YAAI,CAAC,KAAK,sBAAsB,QAAQ,GAAG;AACzC,iBAAO,KAAK,sBAAsB,UAAU;AAAA,QAC9C;AACA,eAAO,EAAE,QAAQ,QAAW,SAAS,WAAW;AAAA,MAClD;AAEA,mBAAa,SAAS;AACtB,UACE,SAAS,WAAW,UACpB,CAAC,SAAS,OAAO,UACjB,SAAS,OAAO,OAAO,WAAW,GAClC;AACA,aAAK,cAAc;AACnB,YAAI,CAAC,KAAK,sBAAsB,QAAQ,GAAG;AACzC,iBAAO,KAAK,sBAAsB,UAAU;AAAA,QAC9C;AACA,eAAO,EAAE,QAAQ,QAAW,SAAS,WAAW;AAAA,MAClD;AAEA,YAAM,iBAAiB,SAAS;AAChC,YAAM,gBACJ,eAAe;AAEjB,iBAAW,QAAQ,eAAe;AAChC,YAAI,SAAS,QAAW;AACtB,eAAK,sBAAsB,QAAQ,IAAI;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,iBAAiB,eAAe,GAAG;AAC1C,YAAMA,cAAS;AAAA,QACb,CAAC;AAAA;AAAA,QACD,oBAAI,IAAI;AAAA,QACR,CAAC;AAAA,MACH;AAEA,aAAO;AAAA,QACL,QAAAA;AAAA,QACA,SAAS;AAAA,MACX;AAAA,IACF;AAGA,QAAI,CAAC,KAAK,iBAAiB,eAAe,KAAK,CAAC,KAAK,aAAa;AAChE,WAAK,cAAc;AACnB,aAAO,KAAK,sBAAsB,YAAY,oBAAI,IAAI,GAAG,CAAC,CAAC;AAAA,IAC7D;AAGA,UAAM,aAAS,sDAA0B,CAAC,GAAG,oBAAI,IAAI,GAAG,CAAC,CAAC;AAE1D,WAAO;AAAA,MACL;AAAA,MACA,SAAS;AAAA,IACX;AAAA,EACF;AAAA,EAEA,MAAc,sBACZ,YACA,sBACA,2BACwB;AAExB,SAAK,cAAc;AAEnB,SAAK,wBAAwB,KAAK,sBAAsB,QAAQ;AAGhE,WACE,KAAK,SAAS,KAAK,2BACnB,KAAK,SAAS,KACd,CAAC,KAAK,sBAAsB,QAAQ,GACpC;AACA,WAAK,sBAAsB,QAAQ;AACnC,WAAK;AAAA,IACP;AAGA,QAAI,CAAC,KAAK,sBAAsB,QAAQ,GAAG;AACzC,YAAM,SAAgB,CAAC;AACvB,UAAI,KAAK,uBAAuB;AAC9B,eAAO,CAAC,KAAK,sBAAsB,QAAQ,GAAG;AAC5C,iBAAO,KAAK,KAAK,sBAAsB,QAAQ,CAAC;AAAA,QAClD;AAAA,MACF,OAAO;AACL,eAAO,CAAC,KAAK,sBAAsB,QAAQ,GAAG;AAC5C,iBAAO,KAAK,KAAK,sBAAsB,QAAQ,GAAG,OAAO;AAAA,QAC3D;AAAA,MACF;AACA,YAAM,aAAS;AAAA,QACb;AAAA,QACA,wBAAwB,oBAAI,IAAI;AAAA,QAChC,6BAA6B,CAAC;AAAA,QAC9B;AAAA,MACF;AAEA,aAAO;AAAA,QACL;AAAA,QACA,SAAS;AAAA,MACX;AAAA,IACF;AAAA,EACF;AACF;",
+  "names": ["result"]
+}

package/dist/commonjs/queryExecutionContext/EndpointComponent/OffsetLimitEndpointComponent.js

@@ -1,70 +1,91 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.OffsetLimitEndpointComponent = void 0;
-const headerUtils_js_1 = require("../headerUtils.js");
-const parallelQueryResult_js_1 = require("../parallelQueryResult.js");
-const PartitionRangeUtils_js_1 = require("../PartitionRangeUtils.js");
-/** @hidden */
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var OffsetLimitEndpointComponent_exports = {};
+__export(OffsetLimitEndpointComponent_exports, {
+  OffsetLimitEndpointComponent: () => OffsetLimitEndpointComponent
+});
+module.exports = __toCommonJS(OffsetLimitEndpointComponent_exports);
+var import_headerUtils = require("../headerUtils.js");
+var import_parallelQueryResult = require("../parallelQueryResult.js");
+var import_PartitionRangeUtils = require("../PartitionRangeUtils.js");
 class OffsetLimitEndpointComponent {
-    executionContext;
-    offset;
-    limit;
-    constructor(executionContext, offset, limit) {
-        this.executionContext = executionContext;
-        this.offset = offset;
-        this.limit = limit;
+  constructor(executionContext, offset, limit) {
+    this.executionContext = executionContext;
+    this.offset = offset;
+    this.limit = limit;
+  }
+  executionContext;
+  offset;
+  limit;
+  hasMoreResults() {
+    return (this.offset > 0 || this.limit > 0) && this.executionContext.hasMoreResults();
+  }
+  async fetchMore(diagnosticNode) {
+    const aggregateHeaders = (0, import_headerUtils.getInitialHeader)();
+    const buffer = [];
+    const response = await this.executionContext.fetchMore(diagnosticNode);
+    if (!response) {
+      return { result: void 0, headers: aggregateHeaders };
     }
-    hasMoreResults() {
-        return (this.offset > 0 || this.limit > 0) && this.executionContext.hasMoreResults();
+    (0, import_headerUtils.mergeHeaders)(aggregateHeaders, response.headers);
+    if (response.result === void 0 || !Array.isArray(response.result.buffer) || response.result.buffer.length === 0) {
+      return { result: response.result, headers: response.headers };
     }
-    async fetchMore(diagnosticNode) {
-        const aggregateHeaders = (0, headerUtils_js_1.getInitialHeader)();
-        const buffer = [];
-        const response = await this.executionContext.fetchMore(diagnosticNode);
-        if (!response) {
-            return { result: undefined, headers: aggregateHeaders };
+    const parallelResult = response.result;
+    const dataToProcess = parallelResult.buffer;
+    const partitionKeyRangeMap = parallelResult.partitionKeyRangeMap;
+    const updatedContinuationRanges = parallelResult.updatedContinuationRanges;
+    const orderByItems = parallelResult.orderByItems;
+    const initialOffset = this.offset;
+    const initialLimit = this.limit;
+    const filteredOrderByItems = [];
+    let itemIndex = 0;
+    for (const item of dataToProcess) {
+      if (this.offset > 0) {
+        this.offset--;
+      } else if (this.limit > 0) {
+        buffer.push(item);
+        if (orderByItems && itemIndex < orderByItems.length) {
+          filteredOrderByItems.push(orderByItems[itemIndex]);
         }
-        (0, headerUtils_js_1.mergeHeaders)(aggregateHeaders, response.headers);
-        if (response.result === undefined ||
-            !Array.isArray(response.result.buffer) ||
-            response.result.buffer.length === 0) {
-            return { result: response.result, headers: response.headers };
-        }
-        const parallelResult = response.result;
-        const dataToProcess = parallelResult.buffer;
-        const partitionKeyRangeMap = parallelResult.partitionKeyRangeMap;
-        const updatedContinuationRanges = parallelResult.updatedContinuationRanges;
-        const orderByItems = parallelResult.orderByItems;
-        const initialOffset = this.offset;
-        const initialLimit = this.limit;
-        const filteredOrderByItems = [];
-        let itemIndex = 0;
-        for (const item of dataToProcess) {
-            if (this.offset > 0) {
-                this.offset--;
-                // Skip this item AND its corresponding orderByItems entry
-            }
-            else if (this.limit > 0) {
-                buffer.push(item);
-                // Include the corresponding orderByItems entry
-                if (orderByItems && itemIndex < orderByItems.length) {
-                    filteredOrderByItems.push(orderByItems[itemIndex]);
-                }
-                this.limit--;
-            }
-            itemIndex++;
-        }
-        // Process offset/limit logic and update partition key range map
-        // Note: Pass initial offset/limit values (not current state) to calculateOffsetLimitForPartitionRanges
-        // This function updates partition metadata while the loop above processes actual data items
-        const updatedPartitionKeyRangeMap = (0, PartitionRangeUtils_js_1.calculateOffsetLimitForPartitionRanges)(partitionKeyRangeMap, initialOffset, initialLimit);
-        // Return in the new structure format using the utility function
-        const result = (0, parallelQueryResult_js_1.createParallelQueryResult)(buffer, updatedPartitionKeyRangeMap, updatedContinuationRanges, filteredOrderByItems.length > 0 ? filteredOrderByItems : undefined);
-        return {
-            result,
-            headers: aggregateHeaders,
-        };
+        this.limit--;
+      }
+      itemIndex++;
     }
+    const updatedPartitionKeyRangeMap = (0, import_PartitionRangeUtils.calculateOffsetLimitForPartitionRanges)(
+      partitionKeyRangeMap,
+      initialOffset,
+      initialLimit
+    );
+    const result = (0, import_parallelQueryResult.createParallelQueryResult)(
+      buffer,
+      updatedPartitionKeyRangeMap,
+      updatedContinuationRanges,
+      filteredOrderByItems.length > 0 ? filteredOrderByItems : void 0
+    );
+    return {
+      result,
+      headers: aggregateHeaders
+    };
+  }
 }
-exports.OffsetLimitEndpointComponent = OffsetLimitEndpointComponent;
-//# sourceMappingURL=OffsetLimitEndpointComponent.js.map
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  OffsetLimitEndpointComponent
+});
+//# sourceMappingURL=OffsetLimitEndpointComponent.js.map

package/dist/commonjs/queryExecutionContext/EndpointComponent/OffsetLimitEndpointComponent.js.map

@@ -1 +1,7 @@
-{"version":3,"file":"OffsetLimitEndpointComponent.js","sourceRoot":"","sources":["../../../../src/queryExecutionContext/EndpointComponent/OffsetLimitEndpointComponent.ts"],"names":[],"mappings":";;;AAKA,sDAAmE;AAEnE,sEAAsE;AACtE,sEAAmF;AAEnF,cAAc;AACd,MAAa,4BAA4B;IAE7B;IACA;IACA;IAHV,YACU,gBAAkC,EAClC,MAAc,EACd,KAAa;QAFb,qBAAgB,GAAhB,gBAAgB,CAAkB;QAClC,WAAM,GAAN,MAAM,CAAQ;QACd,UAAK,GAAL,KAAK,CAAQ;IACpB,CAAC;IAEG,cAAc;QACnB,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC;IACvF,CAAC;IAEM,KAAK,CAAC,SAAS,CAAC,cAAuC;QAC5D,MAAM,gBAAgB,GAAG,IAAA,iCAAgB,GAAE,CAAC;QAC5C,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACvE,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC;QAC1D,CAAC;QACD,IAAA,6BAAY,EAAC,gBAAgB,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;QACjD,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,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,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC;QAClC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC;QAEhC,MAAM,oBAAoB,GAAU,EAAE,CAAC;QACvC,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,0DAA0D;YAC5D,CAAC;iBAAM,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,+CAA+C;gBAC/C,IAAI,YAAY,IAAI,SAAS,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;oBACpD,oBAAoB,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC;gBACrD,CAAC;gBACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,CAAC;YACD,SAAS,EAAE,CAAC;QACd,CAAC;QAED,gEAAgE;QAChE,uGAAuG;QACvG,4FAA4F;QAC5F,MAAM,2BAA2B,GAAG,IAAA,+DAAsC,EACxE,oBAAoB,EACpB,aAAa,EACb,YAAY,CACb,CAAC;QAEF,gEAAgE;QAChE,MAAM,MAAM,GAAG,IAAA,kDAAyB,EACtC,MAAM,EACN,2BAA2B,EAC3B,yBAAyB,EACzB,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,SAAS,CACnE,CAAC;QAEF,OAAO;YACL,MAAM;YACN,OAAO,EAAE,gBAAgB;SAC1B,CAAC;IACJ,CAAC;CACF;AA5ED,oEA4EC","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 { getInitialHeader, mergeHeaders } from \"../headerUtils.js\";\nimport type { ParallelQueryResult } from \"../parallelQueryResult.js\";\nimport { createParallelQueryResult } from \"../parallelQueryResult.js\";\nimport { calculateOffsetLimitForPartitionRanges } from \"../PartitionRangeUtils.js\";\n\n/** @hidden */\nexport class OffsetLimitEndpointComponent implements ExecutionContext {\n  constructor(\n    private executionContext: ExecutionContext,\n    private offset: number,\n    private limit: number,\n  ) {}\n\n  public hasMoreResults(): boolean {\n    return (this.offset > 0 || this.limit > 0) && this.executionContext.hasMoreResults();\n  }\n\n  public async fetchMore(diagnosticNode?: DiagnosticNodeInternal): Promise<Response<any>> {\n    const aggregateHeaders = getInitialHeader();\n    const buffer: any[] = [];\n    const response = await this.executionContext.fetchMore(diagnosticNode);\n    if (!response) {\n      return { result: undefined, headers: aggregateHeaders };\n    }\n    mergeHeaders(aggregateHeaders, response.headers);\n    if (\n      response.result === undefined ||\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    const initialOffset = this.offset;\n    const initialLimit = this.limit;\n\n    const filteredOrderByItems: any[] = [];\n    let itemIndex = 0;\n\n    for (const item of dataToProcess) {\n      if (this.offset > 0) {\n        this.offset--;\n        // Skip this item AND its corresponding orderByItems entry\n      } else if (this.limit > 0) {\n        buffer.push(item);\n        // Include the corresponding orderByItems entry\n        if (orderByItems && itemIndex < orderByItems.length) {\n          filteredOrderByItems.push(orderByItems[itemIndex]);\n        }\n        this.limit--;\n      }\n      itemIndex++;\n    }\n\n    // Process offset/limit logic and update partition key range map\n    // Note: Pass initial offset/limit values (not current state) to calculateOffsetLimitForPartitionRanges\n    // This function updates partition metadata while the loop above processes actual data items\n    const updatedPartitionKeyRangeMap = calculateOffsetLimitForPartitionRanges(\n      partitionKeyRangeMap,\n      initialOffset,\n      initialLimit,\n    );\n\n    // Return in the new structure format using the utility function\n    const result = createParallelQueryResult(\n      buffer,\n      updatedPartitionKeyRangeMap,\n      updatedContinuationRanges,\n      filteredOrderByItems.length > 0 ? filteredOrderByItems : undefined,\n    );\n\n    return {\n      result,\n      headers: aggregateHeaders,\n    };\n  }\n}\n"]}
+{
+  "version": 3,
+  "sources": ["../../../../src/queryExecutionContext/EndpointComponent/OffsetLimitEndpointComponent.ts"],
+  "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 { getInitialHeader, mergeHeaders } from \"../headerUtils.js\";\nimport type { ParallelQueryResult } from \"../parallelQueryResult.js\";\nimport { createParallelQueryResult } from \"../parallelQueryResult.js\";\nimport { calculateOffsetLimitForPartitionRanges } from \"../PartitionRangeUtils.js\";\n\n/** @hidden */\nexport class OffsetLimitEndpointComponent implements ExecutionContext {\n  constructor(\n    private executionContext: ExecutionContext,\n    private offset: number,\n    private limit: number,\n  ) {}\n\n  public hasMoreResults(): boolean {\n    return (this.offset > 0 || this.limit > 0) && this.executionContext.hasMoreResults();\n  }\n\n  public async fetchMore(diagnosticNode?: DiagnosticNodeInternal): Promise<Response<any>> {\n    const aggregateHeaders = getInitialHeader();\n    const buffer: any[] = [];\n    const response = await this.executionContext.fetchMore(diagnosticNode);\n    if (!response) {\n      return { result: undefined, headers: aggregateHeaders };\n    }\n    mergeHeaders(aggregateHeaders, response.headers);\n    if (\n      response.result === undefined ||\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    const initialOffset = this.offset;\n    const initialLimit = this.limit;\n\n    const filteredOrderByItems: any[] = [];\n    let itemIndex = 0;\n\n    for (const item of dataToProcess) {\n      if (this.offset > 0) {\n        this.offset--;\n        // Skip this item AND its corresponding orderByItems entry\n      } else if (this.limit > 0) {\n        buffer.push(item);\n        // Include the corresponding orderByItems entry\n        if (orderByItems && itemIndex < orderByItems.length) {\n          filteredOrderByItems.push(orderByItems[itemIndex]);\n        }\n        this.limit--;\n      }\n      itemIndex++;\n    }\n\n    // Process offset/limit logic and update partition key range map\n    // Note: Pass initial offset/limit values (not current state) to calculateOffsetLimitForPartitionRanges\n    // This function updates partition metadata while the loop above processes actual data items\n    const updatedPartitionKeyRangeMap = calculateOffsetLimitForPartitionRanges(\n      partitionKeyRangeMap,\n      initialOffset,\n      initialLimit,\n    );\n\n    // Return in the new structure format using the utility function\n    const result = createParallelQueryResult(\n      buffer,\n      updatedPartitionKeyRangeMap,\n      updatedContinuationRanges,\n      filteredOrderByItems.length > 0 ? filteredOrderByItems : undefined,\n    );\n\n    return {\n      result,\n      headers: aggregateHeaders,\n    };\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAKA,yBAA+C;AAE/C,iCAA0C;AAC1C,iCAAuD;AAGhD,MAAM,6BAAyD;AAAA,EACpE,YACU,kBACA,QACA,OACR;AAHQ;AACA;AACA;AAAA,EACP;AAAA,EAHO;AAAA,EACA;AAAA,EACA;AAAA,EAGH,iBAA0B;AAC/B,YAAQ,KAAK,SAAS,KAAK,KAAK,QAAQ,MAAM,KAAK,iBAAiB,eAAe;AAAA,EACrF;AAAA,EAEA,MAAa,UAAU,gBAAiE;AACtF,UAAM,uBAAmB,qCAAiB;AAC1C,UAAM,SAAgB,CAAC;AACvB,UAAM,WAAW,MAAM,KAAK,iBAAiB,UAAU,cAAc;AACrE,QAAI,CAAC,UAAU;AACb,aAAO,EAAE,QAAQ,QAAW,SAAS,iBAAiB;AAAA,IACxD;AACA,yCAAa,kBAAkB,SAAS,OAAO;AAC/C,QACE,SAAS,WAAW,UACpB,CAAC,MAAM,QAAQ,SAAS,OAAO,MAAM,KACrC,SAAS,OAAO,OAAO,WAAW,GAClC;AACA,aAAO,EAAE,QAAQ,SAAS,QAAQ,SAAS,SAAS,QAAQ;AAAA,IAC9D;AAEA,UAAM,iBAAiB,SAAS;AAChC,UAAM,gBAAuB,eAAe;AAC5C,UAAM,uBAAuB,eAAe;AAC5C,UAAM,4BAA4B,eAAe;AACjD,UAAM,eAAe,eAAe;AAEpC,UAAM,gBAAgB,KAAK;AAC3B,UAAM,eAAe,KAAK;AAE1B,UAAM,uBAA8B,CAAC;AACrC,QAAI,YAAY;AAEhB,eAAW,QAAQ,eAAe;AAChC,UAAI,KAAK,SAAS,GAAG;AACnB,aAAK;AAAA,MAEP,WAAW,KAAK,QAAQ,GAAG;AACzB,eAAO,KAAK,IAAI;AAEhB,YAAI,gBAAgB,YAAY,aAAa,QAAQ;AACnD,+BAAqB,KAAK,aAAa,SAAS,CAAC;AAAA,QACnD;AACA,aAAK;AAAA,MACP;AACA;AAAA,IACF;AAKA,UAAM,kCAA8B;AAAA,MAClC;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAGA,UAAM,aAAS;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA,qBAAqB,SAAS,IAAI,uBAAuB;AAAA,IAC3D;AAEA,WAAO;AAAA,MACL;AAAA,MACA,SAAS;AAAA,IACX;AAAA,EACF;AACF;",
+  "names": []
+}