@mui/x-charts-vendor 8.21.0 → 8.22.0

package/es/flatqueue.mjs

@@ -0,0 +1,8 @@
+
+// `x-charts-vendor/flatqueue` (ESM)
+// See upstream license: git+https://github.com/mourner/flatqueue/blob/main/LICENSE
+//
+// Our ESM package uses the underlying installed dependencies of `node_modules/flatqueue`
+export * from "flatqueue";
+
+export { default } from "flatqueue";

package/lib/flatqueue.js

@@ -0,0 +1,6 @@
+
+// `x-charts-vendor/flatqueue` (CommonJS)
+// See upstream license: git+https://github.com/mourner/flatqueue/blob/main/LICENSE
+//
+// Our CommonJS package relies on transpiled vendor files in `lib-vendor/flatqueue`
+module.exports = require("../lib-vendor/flatqueue/index.js");

package/lib-vendor/flatqueue/LICENSE

@@ -0,0 +1,15 @@
+ISC License
+
+Copyright (c) 2025, Volodymyr Agafonkin
+
+Permission to use, copy, modify, and/or distribute this software for any purpose
+with or without fee is hereby granted, provided that the above copyright notice
+and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
+FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
+OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
+TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
+THIS SOFTWARE.

package/lib-vendor/flatqueue/index.js

@@ -0,0 +1,102 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+/** @template T */
+class FlatQueue {
+  constructor() {
+    /** @type T[] */
+    this.ids = [];
+
+    /** @type number[] */
+    this.values = [];
+
+    /** Number of items in the queue. */
+    this.length = 0;
+  }
+
+  /** Removes all items from the queue. */
+  clear() {
+    this.length = 0;
+  }
+
+  /**
+   * Adds `item` to the queue with the specified `priority`.
+   *
+   * `priority` must be a number. Items are sorted and returned from low to high priority. Multiple items
+   * with the same priority value can be added to the queue, but there is no guaranteed order between these items.
+   *
+   * @param {T} item
+   * @param {number} priority
+   */
+  push(item, priority) {
+    let pos = this.length++;
+    while (pos > 0) {
+      const parent = pos - 1 >> 1;
+      const parentValue = this.values[parent];
+      if (priority >= parentValue) break;
+      this.ids[pos] = this.ids[parent];
+      this.values[pos] = parentValue;
+      pos = parent;
+    }
+    this.ids[pos] = item;
+    this.values[pos] = priority;
+  }
+
+  /**
+   * Removes and returns the item from the head of this queue, which is one of
+   * the items with the lowest priority. If this queue is empty, returns `undefined`.
+   */
+  pop() {
+    if (this.length === 0) return undefined;
+    const ids = this.ids,
+      values = this.values,
+      top = ids[0],
+      last = --this.length;
+    if (last > 0) {
+      const id = ids[last];
+      const value = values[last];
+      let pos = 0;
+      const halfLen = last >> 1;
+      while (pos < halfLen) {
+        const left = (pos << 1) + 1;
+        const right = left + 1;
+        const child = left + (+(right < last) & +(values[right] < values[left]));
+        if (values[child] >= value) break;
+        ids[pos] = ids[child];
+        values[pos] = values[child];
+        pos = child;
+      }
+      ids[pos] = id;
+      values[pos] = value;
+    }
+    return top;
+  }
+
+  /** Returns the item from the head of this queue without removing it. If this queue is empty, returns `undefined`. */
+  peek() {
+    return this.length > 0 ? this.ids[0] : undefined;
+  }
+
+  /**
+   * Returns the priority value of the item at the head of this queue without
+   * removing it. If this queue is empty, returns `undefined`.
+   */
+  peekValue() {
+    return this.length > 0 ? this.values[0] : undefined;
+  }
+
+  /**
+   * Shrinks the internal arrays to `this.length`.
+   *
+   * `pop()` and `clear()` calls don't free memory automatically to avoid unnecessary resize operations.
+   * This also means that items that have been added to the queue can't be garbage collected until
+   * a new item is pushed in their place, or this method is called.
+   */
+  shrink() {
+    this.ids.length = this.values.length = this.length;
+  }
+}
+exports.default = FlatQueue;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@mui/x-charts-vendor",
-  "version": "8.21.0",
+  "version": "8.22.0",
   "author": "MUI Team",
   "description": "Vendored dependencies for MUI X Charts.",
   "keywords": [
@@ -27,19 +27,20 @@
     "@babel/runtime": "^7.28.4",
     "@types/d3-color": "^3.1.3",
     "@types/d3-interpolate": "^3.0.4",
+    "@types/d3-path": "^3.1.1",
     "@types/d3-sankey": "^0.12.5",
     "@types/d3-scale": "^4.0.9",
     "@types/d3-shape": "^3.1.7",
     "@types/d3-time": "^3.0.4",
     "@types/d3-timer": "^3.0.2",
-    "@types/d3-path": "^3.1.1",
     "d3-color": "^3.1.0",
     "d3-interpolate": "^3.0.1",
+    "d3-path": "^3.1.0",
     "d3-scale": "^4.0.2",
     "d3-shape": "^3.2.0",
     "d3-time": "^3.1.0",
     "d3-timer": "^3.0.1",
-    "d3-path": "^3.1.0"
+    "flatqueue": "^3.0.0"
   },
   "devDependencies": {
     "@babel/cli": "^7.28.3",