@mui/x-charts-vendor 8.19.0 → 8.21.0

package/d3-path.d.ts

@@ -0,0 +1,5 @@
+
+// `x-charts-vendor/d3-path` (TypeScript)
+//
+// Export the type definitions for this package:
+export * from "d3-path";

package/d3-path.js

@@ -0,0 +1,7 @@
+
+// `x-charts-vendor/d3-path` (CommonJS)
+// See upstream license: https://github.com/d3/d3-path/blob/main/LICENSE
+//
+// This file only exists for tooling that doesn't work yet with package.json:exports
+// by proxying through the CommonJS version.
+module.exports = require("./lib/d3-path");

package/d3-sankey.d.ts

@@ -1,5 +0,0 @@
-
-// `x-charts-vendor/d3-sankey` (TypeScript)
-//
-// Export the type definitions for this package:
-export * from "d3-sankey";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@mui/x-charts-vendor",
-  "version": "8.19.0",
+  "version": "8.21.0",
   "author": "MUI Team",
   "description": "Vendored dependencies for MUI X Charts.",
   "keywords": [
@@ -27,34 +27,33 @@
     "@babel/runtime": "^7.28.4",
     "@types/d3-color": "^3.1.3",
     "@types/d3-interpolate": "^3.0.4",
-    "@types/d3-sankey": "^0.12.4",
+    "@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-sankey": "^0.12.3",
     "d3-scale": "^4.0.2",
     "d3-shape": "^3.2.0",
     "d3-time": "^3.1.0",
-    "d3-timer": "^3.0.1"
+    "d3-timer": "^3.0.1",
+    "d3-path": "^3.1.0"
   },
   "devDependencies": {
     "@babel/cli": "^7.28.3",
     "@babel/plugin-transform-runtime": "^7.28.5",
     "@types/d3-array": "^3.2.2",
     "@types/d3-format": "^3.0.4",
-    "@types/d3-path": "^3.1.1",
     "@types/d3-time-format": "^4.0.3",
     "babel-plugin-module-resolver": "^5.0.2",
     "d3-array": "^3.2.4",
     "d3-format": "^3.1.0",
-    "d3-path": "^3.1.0",
     "d3-time-format": "^4.1.0",
     "execa": "^9.6.0",
     "internmap": "^2.0.3",
-    "rimraf": "^6.1.0"
+    "rimraf": "^6.1.2"
   },
   "publishConfig": {
     "access": "public"

package/es/d3-sankey.mjs

@@ -1,6 +0,0 @@
-
-// `x-charts-vendor/d3-sankey` (ESM)
-// See upstream license: https://github.com/d3/d3-sankey/blob/main/LICENSE
-//
-// Our ESM package uses the underlying installed dependencies of `node_modules/d3-sankey`
-export * from "d3-sankey";

package/lib/d3-sankey.js

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

package/lib-vendor/d3-sankey/LICENSE

@@ -1,27 +0,0 @@
-Copyright 2015, Mike Bostock
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without modification,
-are permitted provided that the following conditions are met:
-
-* Redistributions of source code must retain the above copyright notice, this
-  list of conditions and the following disclaimer.
-
-* Redistributions in binary form must reproduce the above copyright notice,
-  this list of conditions and the following disclaimer in the documentation
-  and/or other materials provided with the distribution.
-
-* Neither the name of the author nor the names of contributors may be used to
-  endorse or promote products derived from this software without specific prior
-  written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
-ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

package/lib-vendor/d3-sankey/dist/d3-sankey.js

@@ -1,438 +0,0 @@
-"use strict";
-
-// https://github.com/d3/d3-sankey v0.12.3 Copyright 2019 Mike Bostock
-(function (global, factory) {
-  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require("../../../lib-vendor/d3-array/src/index.js"), require("../../../lib-vendor/d3-shape/src/index.js")) : typeof define === 'function' && define.amd ? define(['exports', 'd3-array', 'd3-shape'], factory) : (global = global || self, factory(global.d3 = global.d3 || {}, global.d3, global.d3));
-})(this, function (exports, d3Array, d3Shape) {
-  'use strict';
-
-  function targetDepth(d) {
-    return d.target.depth;
-  }
-  function left(node) {
-    return node.depth;
-  }
-  function right(node, n) {
-    return n - 1 - node.height;
-  }
-  function justify(node, n) {
-    return node.sourceLinks.length ? node.depth : n - 1;
-  }
-  function center(node) {
-    return node.targetLinks.length ? node.depth : node.sourceLinks.length ? d3Array.min(node.sourceLinks, targetDepth) - 1 : 0;
-  }
-  function constant(x) {
-    return function () {
-      return x;
-    };
-  }
-  function ascendingSourceBreadth(a, b) {
-    return ascendingBreadth(a.source, b.source) || a.index - b.index;
-  }
-  function ascendingTargetBreadth(a, b) {
-    return ascendingBreadth(a.target, b.target) || a.index - b.index;
-  }
-  function ascendingBreadth(a, b) {
-    return a.y0 - b.y0;
-  }
-  function value(d) {
-    return d.value;
-  }
-  function defaultId(d) {
-    return d.index;
-  }
-  function defaultNodes(graph) {
-    return graph.nodes;
-  }
-  function defaultLinks(graph) {
-    return graph.links;
-  }
-  function find(nodeById, id) {
-    const node = nodeById.get(id);
-    if (!node) throw new Error("missing: " + id);
-    return node;
-  }
-  function computeLinkBreadths({
-    nodes
-  }) {
-    for (const node of nodes) {
-      let y0 = node.y0;
-      let y1 = y0;
-      for (const link of node.sourceLinks) {
-        link.y0 = y0 + link.width / 2;
-        y0 += link.width;
-      }
-      for (const link of node.targetLinks) {
-        link.y1 = y1 + link.width / 2;
-        y1 += link.width;
-      }
-    }
-  }
-  function Sankey() {
-    let x0 = 0,
-      y0 = 0,
-      x1 = 1,
-      y1 = 1; // extent
-    let dx = 24; // nodeWidth
-    let dy = 8,
-      py; // nodePadding
-    let id = defaultId;
-    let align = justify;
-    let sort;
-    let linkSort;
-    let nodes = defaultNodes;
-    let links = defaultLinks;
-    let iterations = 6;
-    function sankey() {
-      const graph = {
-        nodes: nodes.apply(null, arguments),
-        links: links.apply(null, arguments)
-      };
-      computeNodeLinks(graph);
-      computeNodeValues(graph);
-      computeNodeDepths(graph);
-      computeNodeHeights(graph);
-      computeNodeBreadths(graph);
-      computeLinkBreadths(graph);
-      return graph;
-    }
-    sankey.update = function (graph) {
-      computeLinkBreadths(graph);
-      return graph;
-    };
-    sankey.nodeId = function (_) {
-      return arguments.length ? (id = typeof _ === "function" ? _ : constant(_), sankey) : id;
-    };
-    sankey.nodeAlign = function (_) {
-      return arguments.length ? (align = typeof _ === "function" ? _ : constant(_), sankey) : align;
-    };
-    sankey.nodeSort = function (_) {
-      return arguments.length ? (sort = _, sankey) : sort;
-    };
-    sankey.nodeWidth = function (_) {
-      return arguments.length ? (dx = +_, sankey) : dx;
-    };
-    sankey.nodePadding = function (_) {
-      return arguments.length ? (dy = py = +_, sankey) : dy;
-    };
-    sankey.nodes = function (_) {
-      return arguments.length ? (nodes = typeof _ === "function" ? _ : constant(_), sankey) : nodes;
-    };
-    sankey.links = function (_) {
-      return arguments.length ? (links = typeof _ === "function" ? _ : constant(_), sankey) : links;
-    };
-    sankey.linkSort = function (_) {
-      return arguments.length ? (linkSort = _, sankey) : linkSort;
-    };
-    sankey.size = function (_) {
-      return arguments.length ? (x0 = y0 = 0, x1 = +_[0], y1 = +_[1], sankey) : [x1 - x0, y1 - y0];
-    };
-    sankey.extent = function (_) {
-      return arguments.length ? (x0 = +_[0][0], x1 = +_[1][0], y0 = +_[0][1], y1 = +_[1][1], sankey) : [[x0, y0], [x1, y1]];
-    };
-    sankey.iterations = function (_) {
-      return arguments.length ? (iterations = +_, sankey) : iterations;
-    };
-    function computeNodeLinks({
-      nodes,
-      links
-    }) {
-      for (const [i, node] of nodes.entries()) {
-        node.index = i;
-        node.sourceLinks = [];
-        node.targetLinks = [];
-      }
-      const nodeById = new Map(nodes.map((d, i) => [id(d, i, nodes), d]));
-      for (const [i, link] of links.entries()) {
-        link.index = i;
-        let {
-          source,
-          target
-        } = link;
-        if (typeof source !== "object") source = link.source = find(nodeById, source);
-        if (typeof target !== "object") target = link.target = find(nodeById, target);
-        source.sourceLinks.push(link);
-        target.targetLinks.push(link);
-      }
-      if (linkSort != null) {
-        for (const {
-          sourceLinks,
-          targetLinks
-        } of nodes) {
-          sourceLinks.sort(linkSort);
-          targetLinks.sort(linkSort);
-        }
-      }
-    }
-    function computeNodeValues({
-      nodes
-    }) {
-      for (const node of nodes) {
-        node.value = node.fixedValue === undefined ? Math.max(d3Array.sum(node.sourceLinks, value), d3Array.sum(node.targetLinks, value)) : node.fixedValue;
-      }
-    }
-    function computeNodeDepths({
-      nodes
-    }) {
-      const n = nodes.length;
-      let current = new Set(nodes);
-      let next = new Set();
-      let x = 0;
-      while (current.size) {
-        for (const node of current) {
-          node.depth = x;
-          for (const {
-            target
-          } of node.sourceLinks) {
-            next.add(target);
-          }
-        }
-        if (++x > n) throw new Error("circular link");
-        current = next;
-        next = new Set();
-      }
-    }
-    function computeNodeHeights({
-      nodes
-    }) {
-      const n = nodes.length;
-      let current = new Set(nodes);
-      let next = new Set();
-      let x = 0;
-      while (current.size) {
-        for (const node of current) {
-          node.height = x;
-          for (const {
-            source
-          } of node.targetLinks) {
-            next.add(source);
-          }
-        }
-        if (++x > n) throw new Error("circular link");
-        current = next;
-        next = new Set();
-      }
-    }
-    function computeNodeLayers({
-      nodes
-    }) {
-      const x = d3Array.max(nodes, d => d.depth) + 1;
-      const kx = (x1 - x0 - dx) / (x - 1);
-      const columns = new Array(x);
-      for (const node of nodes) {
-        const i = Math.max(0, Math.min(x - 1, Math.floor(align.call(null, node, x))));
-        node.layer = i;
-        node.x0 = x0 + i * kx;
-        node.x1 = node.x0 + dx;
-        if (columns[i]) columns[i].push(node);else columns[i] = [node];
-      }
-      if (sort) for (const column of columns) {
-        column.sort(sort);
-      }
-      return columns;
-    }
-    function initializeNodeBreadths(columns) {
-      const ky = d3Array.min(columns, c => (y1 - y0 - (c.length - 1) * py) / d3Array.sum(c, value));
-      for (const nodes of columns) {
-        let y = y0;
-        for (const node of nodes) {
-          node.y0 = y;
-          node.y1 = y + node.value * ky;
-          y = node.y1 + py;
-          for (const link of node.sourceLinks) {
-            link.width = link.value * ky;
-          }
-        }
-        y = (y1 - y + py) / (nodes.length + 1);
-        for (let i = 0; i < nodes.length; ++i) {
-          const node = nodes[i];
-          node.y0 += y * (i + 1);
-          node.y1 += y * (i + 1);
-        }
-        reorderLinks(nodes);
-      }
-    }
-    function computeNodeBreadths(graph) {
-      const columns = computeNodeLayers(graph);
-      py = Math.min(dy, (y1 - y0) / (d3Array.max(columns, c => c.length) - 1));
-      initializeNodeBreadths(columns);
-      for (let i = 0; i < iterations; ++i) {
-        const alpha = Math.pow(0.99, i);
-        const beta = Math.max(1 - alpha, (i + 1) / iterations);
-        relaxRightToLeft(columns, alpha, beta);
-        relaxLeftToRight(columns, alpha, beta);
-      }
-    }
-
-    // Reposition each node based on its incoming (target) links.
-    function relaxLeftToRight(columns, alpha, beta) {
-      for (let i = 1, n = columns.length; i < n; ++i) {
-        const column = columns[i];
-        for (const target of column) {
-          let y = 0;
-          let w = 0;
-          for (const {
-            source,
-            value
-          } of target.targetLinks) {
-            let v = value * (target.layer - source.layer);
-            y += targetTop(source, target) * v;
-            w += v;
-          }
-          if (!(w > 0)) continue;
-          let dy = (y / w - target.y0) * alpha;
-          target.y0 += dy;
-          target.y1 += dy;
-          reorderNodeLinks(target);
-        }
-        if (sort === undefined) column.sort(ascendingBreadth);
-        resolveCollisions(column, beta);
-      }
-    }
-
-    // Reposition each node based on its outgoing (source) links.
-    function relaxRightToLeft(columns, alpha, beta) {
-      for (let n = columns.length, i = n - 2; i >= 0; --i) {
-        const column = columns[i];
-        for (const source of column) {
-          let y = 0;
-          let w = 0;
-          for (const {
-            target,
-            value
-          } of source.sourceLinks) {
-            let v = value * (target.layer - source.layer);
-            y += sourceTop(source, target) * v;
-            w += v;
-          }
-          if (!(w > 0)) continue;
-          let dy = (y / w - source.y0) * alpha;
-          source.y0 += dy;
-          source.y1 += dy;
-          reorderNodeLinks(source);
-        }
-        if (sort === undefined) column.sort(ascendingBreadth);
-        resolveCollisions(column, beta);
-      }
-    }
-    function resolveCollisions(nodes, alpha) {
-      const i = nodes.length >> 1;
-      const subject = nodes[i];
-      resolveCollisionsBottomToTop(nodes, subject.y0 - py, i - 1, alpha);
-      resolveCollisionsTopToBottom(nodes, subject.y1 + py, i + 1, alpha);
-      resolveCollisionsBottomToTop(nodes, y1, nodes.length - 1, alpha);
-      resolveCollisionsTopToBottom(nodes, y0, 0, alpha);
-    }
-
-    // Push any overlapping nodes down.
-    function resolveCollisionsTopToBottom(nodes, y, i, alpha) {
-      for (; i < nodes.length; ++i) {
-        const node = nodes[i];
-        const dy = (y - node.y0) * alpha;
-        if (dy > 1e-6) node.y0 += dy, node.y1 += dy;
-        y = node.y1 + py;
-      }
-    }
-
-    // Push any overlapping nodes up.
-    function resolveCollisionsBottomToTop(nodes, y, i, alpha) {
-      for (; i >= 0; --i) {
-        const node = nodes[i];
-        const dy = (node.y1 - y) * alpha;
-        if (dy > 1e-6) node.y0 -= dy, node.y1 -= dy;
-        y = node.y0 - py;
-      }
-    }
-    function reorderNodeLinks({
-      sourceLinks,
-      targetLinks
-    }) {
-      if (linkSort === undefined) {
-        for (const {
-          source: {
-            sourceLinks
-          }
-        } of targetLinks) {
-          sourceLinks.sort(ascendingTargetBreadth);
-        }
-        for (const {
-          target: {
-            targetLinks
-          }
-        } of sourceLinks) {
-          targetLinks.sort(ascendingSourceBreadth);
-        }
-      }
-    }
-    function reorderLinks(nodes) {
-      if (linkSort === undefined) {
-        for (const {
-          sourceLinks,
-          targetLinks
-        } of nodes) {
-          sourceLinks.sort(ascendingTargetBreadth);
-          targetLinks.sort(ascendingSourceBreadth);
-        }
-      }
-    }
-
-    // Returns the target.y0 that would produce an ideal link from source to target.
-    function targetTop(source, target) {
-      let y = source.y0 - (source.sourceLinks.length - 1) * py / 2;
-      for (const {
-        target: node,
-        width
-      } of source.sourceLinks) {
-        if (node === target) break;
-        y += width + py;
-      }
-      for (const {
-        source: node,
-        width
-      } of target.targetLinks) {
-        if (node === source) break;
-        y -= width;
-      }
-      return y;
-    }
-
-    // Returns the source.y0 that would produce an ideal link from source to target.
-    function sourceTop(source, target) {
-      let y = target.y0 - (target.targetLinks.length - 1) * py / 2;
-      for (const {
-        source: node,
-        width
-      } of target.targetLinks) {
-        if (node === source) break;
-        y += width + py;
-      }
-      for (const {
-        target: node,
-        width
-      } of source.sourceLinks) {
-        if (node === target) break;
-        y -= width;
-      }
-      return y;
-    }
-    return sankey;
-  }
-  function horizontalSource(d) {
-    return [d.source.x1, d.y0];
-  }
-  function horizontalTarget(d) {
-    return [d.target.x0, d.y1];
-  }
-  function sankeyLinkHorizontal() {
-    return d3Shape.linkHorizontal().source(horizontalSource).target(horizontalTarget);
-  }
-  exports.sankey = Sankey;
-  exports.sankeyCenter = center;
-  exports.sankeyJustify = justify;
-  exports.sankeyLeft = left;
-  exports.sankeyLinkHorizontal = sankeyLinkHorizontal;
-  exports.sankeyRight = right;
-  Object.defineProperty(exports, '__esModule', {
-    value: true
-  });
-});

package/lib-vendor/d3-sankey/dist/d3-sankey.min.js

@@ -1,329 +0,0 @@
-"use strict";
-
-// https://github.com/d3/d3-sankey v0.12.3 Copyright 2019 Mike Bostock
-!function (n, t) {
-  "object" == typeof exports && "undefined" != typeof module ? t(exports, require("../../../lib-vendor/d3-array/src/index.js"), require("../../../lib-vendor/d3-shape/src/index.js")) : "function" == typeof define && define.amd ? define(["exports", "d3-array", "d3-shape"], t) : t((n = n || self).d3 = n.d3 || {}, n.d3, n.d3);
-}(this, function (n, t, e) {
-  "use strict";
-
-  function o(n) {
-    return n.target.depth;
-  }
-  function r(n, t) {
-    return n.sourceLinks.length ? n.depth : t - 1;
-  }
-  function i(n) {
-    return function () {
-      return n;
-    };
-  }
-  function s(n, t) {
-    return u(n.source, t.source) || n.index - t.index;
-  }
-  function f(n, t) {
-    return u(n.target, t.target) || n.index - t.index;
-  }
-  function u(n, t) {
-    return n.y0 - t.y0;
-  }
-  function c(n) {
-    return n.value;
-  }
-  function l(n) {
-    return n.index;
-  }
-  function a(n) {
-    return n.nodes;
-  }
-  function d(n) {
-    return n.links;
-  }
-  function h(n, t) {
-    const e = n.get(t);
-    if (!e) throw new Error("missing: " + t);
-    return e;
-  }
-  function g({
-    nodes: n
-  }) {
-    for (const t of n) {
-      let n = t.y0,
-        e = n;
-      for (const e of t.sourceLinks) e.y0 = n + e.width / 2, n += e.width;
-      for (const n of t.targetLinks) n.y1 = e + n.width / 2, e += n.width;
-    }
-  }
-  function y(n) {
-    return [n.source.x1, n.y0];
-  }
-  function k(n) {
-    return [n.target.x0, n.y1];
-  }
-  n.sankey = function () {
-    let n,
-      e,
-      o,
-      y = 0,
-      k = 0,
-      L = 1,
-      p = 1,
-      w = 24,
-      x = 8,
-      m = l,
-      v = r,
-      M = a,
-      b = d,
-      S = 6;
-    function z() {
-      const r = {
-        nodes: M.apply(null, arguments),
-        links: b.apply(null, arguments)
-      };
-      return function ({
-        nodes: n,
-        links: t
-      }) {
-        for (const [t, e] of n.entries()) e.index = t, e.sourceLinks = [], e.targetLinks = [];
-        const e = new Map(n.map((t, e) => [m(t, e, n), t]));
-        for (const [n, o] of t.entries()) {
-          o.index = n;
-          let {
-            source: t,
-            target: r
-          } = o;
-          "object" != typeof t && (t = o.source = h(e, t)), "object" != typeof r && (r = o.target = h(e, r)), t.sourceLinks.push(o), r.targetLinks.push(o);
-        }
-        if (null != o) for (const {
-          sourceLinks: t,
-          targetLinks: e
-        } of n) t.sort(o), e.sort(o);
-      }(r), function ({
-        nodes: n
-      }) {
-        for (const e of n) e.value = void 0 === e.fixedValue ? Math.max(t.sum(e.sourceLinks, c), t.sum(e.targetLinks, c)) : e.fixedValue;
-      }(r), function ({
-        nodes: n
-      }) {
-        const t = n.length;
-        let e = new Set(n),
-          o = new Set(),
-          r = 0;
-        for (; e.size;) {
-          for (const n of e) {
-            n.depth = r;
-            for (const {
-              target: t
-            } of n.sourceLinks) o.add(t);
-          }
-          if (++r > t) throw new Error("circular link");
-          e = o, o = new Set();
-        }
-      }(r), function ({
-        nodes: n
-      }) {
-        const t = n.length;
-        let e = new Set(n),
-          o = new Set(),
-          r = 0;
-        for (; e.size;) {
-          for (const n of e) {
-            n.height = r;
-            for (const {
-              source: t
-            } of n.targetLinks) o.add(t);
-          }
-          if (++r > t) throw new Error("circular link");
-          e = o, o = new Set();
-        }
-      }(r), function (o) {
-        const r = function ({
-          nodes: n
-        }) {
-          const o = t.max(n, n => n.depth) + 1,
-            r = (L - y - w) / (o - 1),
-            i = new Array(o);
-          for (const t of n) {
-            const n = Math.max(0, Math.min(o - 1, Math.floor(v.call(null, t, o))));
-            t.layer = n, t.x0 = y + n * r, t.x1 = t.x0 + w, i[n] ? i[n].push(t) : i[n] = [t];
-          }
-          if (e) for (const n of i) n.sort(e);
-          return i;
-        }(o);
-        n = Math.min(x, (p - k) / (t.max(r, n => n.length) - 1)), function (e) {
-          const o = t.min(e, e => (p - k - (e.length - 1) * n) / t.sum(e, c));
-          for (const t of e) {
-            let e = k;
-            for (const r of t) {
-              r.y0 = e, r.y1 = e + r.value * o, e = r.y1 + n;
-              for (const n of r.sourceLinks) n.width = n.value * o;
-            }
-            e = (p - e + n) / (t.length + 1);
-            for (let n = 0; n < t.length; ++n) {
-              const o = t[n];
-              o.y0 += e * (n + 1), o.y1 += e * (n + 1);
-            }
-            V(t);
-          }
-        }(r);
-        for (let n = 0; n < S; ++n) {
-          const t = Math.pow(.99, n),
-            e = Math.max(1 - t, (n + 1) / S);
-          E(r, t, e), j(r, t, e);
-        }
-      }(r), g(r), r;
-    }
-    function j(n, t, o) {
-      for (let r = 1, i = n.length; r < i; ++r) {
-        const i = n[r];
-        for (const n of i) {
-          let e = 0,
-            o = 0;
-          for (const {
-            source: t,
-            value: r
-          } of n.targetLinks) {
-            let i = r * (n.layer - t.layer);
-            e += _(t, n) * i, o += i;
-          }
-          if (!(o > 0)) continue;
-          let r = (e / o - n.y0) * t;
-          n.y0 += r, n.y1 += r, P(n);
-        }
-        void 0 === e && i.sort(u), q(i, o);
-      }
-    }
-    function E(n, t, o) {
-      for (let r = n.length - 2; r >= 0; --r) {
-        const i = n[r];
-        for (const n of i) {
-          let e = 0,
-            o = 0;
-          for (const {
-            target: t,
-            value: r
-          } of n.sourceLinks) {
-            let i = r * (t.layer - n.layer);
-            e += C(n, t) * i, o += i;
-          }
-          if (!(o > 0)) continue;
-          let r = (e / o - n.y0) * t;
-          n.y0 += r, n.y1 += r, P(n);
-        }
-        void 0 === e && i.sort(u), q(i, o);
-      }
-    }
-    function q(t, e) {
-      const o = t.length >> 1,
-        r = t[o];
-      H(t, r.y0 - n, o - 1, e), A(t, r.y1 + n, o + 1, e), H(t, p, t.length - 1, e), A(t, k, 0, e);
-    }
-    function A(t, e, o, r) {
-      for (; o < t.length; ++o) {
-        const i = t[o],
-          s = (e - i.y0) * r;
-        s > 1e-6 && (i.y0 += s, i.y1 += s), e = i.y1 + n;
-      }
-    }
-    function H(t, e, o, r) {
-      for (; o >= 0; --o) {
-        const i = t[o],
-          s = (i.y1 - e) * r;
-        s > 1e-6 && (i.y0 -= s, i.y1 -= s), e = i.y0 - n;
-      }
-    }
-    function P({
-      sourceLinks: n,
-      targetLinks: t
-    }) {
-      if (void 0 === o) {
-        for (const {
-          source: {
-            sourceLinks: n
-          }
-        } of t) n.sort(f);
-        for (const {
-          target: {
-            targetLinks: t
-          }
-        } of n) t.sort(s);
-      }
-    }
-    function V(n) {
-      if (void 0 === o) for (const {
-        sourceLinks: t,
-        targetLinks: e
-      } of n) t.sort(f), e.sort(s);
-    }
-    function _(t, e) {
-      let o = t.y0 - (t.sourceLinks.length - 1) * n / 2;
-      for (const {
-        target: r,
-        width: i
-      } of t.sourceLinks) {
-        if (r === e) break;
-        o += i + n;
-      }
-      for (const {
-        source: n,
-        width: r
-      } of e.targetLinks) {
-        if (n === t) break;
-        o -= r;
-      }
-      return o;
-    }
-    function C(t, e) {
-      let o = e.y0 - (e.targetLinks.length - 1) * n / 2;
-      for (const {
-        source: r,
-        width: i
-      } of e.targetLinks) {
-        if (r === t) break;
-        o += i + n;
-      }
-      for (const {
-        target: n,
-        width: r
-      } of t.sourceLinks) {
-        if (n === e) break;
-        o -= r;
-      }
-      return o;
-    }
-    return z.update = function (n) {
-      return g(n), n;
-    }, z.nodeId = function (n) {
-      return arguments.length ? (m = "function" == typeof n ? n : i(n), z) : m;
-    }, z.nodeAlign = function (n) {
-      return arguments.length ? (v = "function" == typeof n ? n : i(n), z) : v;
-    }, z.nodeSort = function (n) {
-      return arguments.length ? (e = n, z) : e;
-    }, z.nodeWidth = function (n) {
-      return arguments.length ? (w = +n, z) : w;
-    }, z.nodePadding = function (t) {
-      return arguments.length ? (x = n = +t, z) : x;
-    }, z.nodes = function (n) {
-      return arguments.length ? (M = "function" == typeof n ? n : i(n), z) : M;
-    }, z.links = function (n) {
-      return arguments.length ? (b = "function" == typeof n ? n : i(n), z) : b;
-    }, z.linkSort = function (n) {
-      return arguments.length ? (o = n, z) : o;
-    }, z.size = function (n) {
-      return arguments.length ? (y = k = 0, L = +n[0], p = +n[1], z) : [L - y, p - k];
-    }, z.extent = function (n) {
-      return arguments.length ? (y = +n[0][0], L = +n[1][0], k = +n[0][1], p = +n[1][1], z) : [[y, k], [L, p]];
-    }, z.iterations = function (n) {
-      return arguments.length ? (S = +n, z) : S;
-    }, z;
-  }, n.sankeyCenter = function (n) {
-    return n.targetLinks.length ? n.depth : n.sourceLinks.length ? t.min(n.sourceLinks, o) - 1 : 0;
-  }, n.sankeyJustify = r, n.sankeyLeft = function (n) {
-    return n.depth;
-  }, n.sankeyLinkHorizontal = function () {
-    return e.linkHorizontal().source(y).target(k);
-  }, n.sankeyRight = function (n, t) {
-    return t - 1 - n.height;
-  }, Object.defineProperty(n, "__esModule", {
-    value: !0
-  });
-});

package/lib-vendor/d3-sankey/src/align.js

@@ -1,25 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.center = center;
-exports.justify = justify;
-exports.left = left;
-exports.right = right;
-var _index = require("../../../lib-vendor/d3-array/src/index.js");
-function targetDepth(d) {
-  return d.target.depth;
-}
-function left(node) {
-  return node.depth;
-}
-function right(node, n) {
-  return n - 1 - node.height;
-}
-function justify(node, n) {
-  return node.sourceLinks.length ? node.depth : n - 1;
-}
-function center(node) {
-  return node.targetLinks.length ? node.depth : node.sourceLinks.length ? (0, _index.min)(node.sourceLinks, targetDepth) - 1 : 0;
-}

package/lib-vendor/d3-sankey/src/constant.js

@@ -1,11 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = constant;
-function constant(x) {
-  return function () {
-    return x;
-  };
-}

package/lib-vendor/d3-sankey/src/index.js

@@ -1,45 +0,0 @@
-"use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-Object.defineProperty(exports, "sankey", {
-  enumerable: true,
-  get: function () {
-    return _sankey.default;
-  }
-});
-Object.defineProperty(exports, "sankeyCenter", {
-  enumerable: true,
-  get: function () {
-    return _align.center;
-  }
-});
-Object.defineProperty(exports, "sankeyJustify", {
-  enumerable: true,
-  get: function () {
-    return _align.justify;
-  }
-});
-Object.defineProperty(exports, "sankeyLeft", {
-  enumerable: true,
-  get: function () {
-    return _align.left;
-  }
-});
-Object.defineProperty(exports, "sankeyLinkHorizontal", {
-  enumerable: true,
-  get: function () {
-    return _sankeyLinkHorizontal.default;
-  }
-});
-Object.defineProperty(exports, "sankeyRight", {
-  enumerable: true,
-  get: function () {
-    return _align.right;
-  }
-});
-var _sankey = _interopRequireDefault(require("./sankey.js"));
-var _align = require("./align.js");
-var _sankeyLinkHorizontal = _interopRequireDefault(require("./sankeyLinkHorizontal.js"));

package/lib-vendor/d3-sankey/src/sankey.js

@@ -1,401 +0,0 @@
-"use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = Sankey;
-var _index = require("../../../lib-vendor/d3-array/src/index.js");
-var _align = require("./align.js");
-var _constant = _interopRequireDefault(require("./constant.js"));
-function ascendingSourceBreadth(a, b) {
-  return ascendingBreadth(a.source, b.source) || a.index - b.index;
-}
-function ascendingTargetBreadth(a, b) {
-  return ascendingBreadth(a.target, b.target) || a.index - b.index;
-}
-function ascendingBreadth(a, b) {
-  return a.y0 - b.y0;
-}
-function value(d) {
-  return d.value;
-}
-function defaultId(d) {
-  return d.index;
-}
-function defaultNodes(graph) {
-  return graph.nodes;
-}
-function defaultLinks(graph) {
-  return graph.links;
-}
-function find(nodeById, id) {
-  const node = nodeById.get(id);
-  if (!node) throw new Error("missing: " + id);
-  return node;
-}
-function computeLinkBreadths({
-  nodes
-}) {
-  for (const node of nodes) {
-    let y0 = node.y0;
-    let y1 = y0;
-    for (const link of node.sourceLinks) {
-      link.y0 = y0 + link.width / 2;
-      y0 += link.width;
-    }
-    for (const link of node.targetLinks) {
-      link.y1 = y1 + link.width / 2;
-      y1 += link.width;
-    }
-  }
-}
-function Sankey() {
-  let x0 = 0,
-    y0 = 0,
-    x1 = 1,
-    y1 = 1; // extent
-  let dx = 24; // nodeWidth
-  let dy = 8,
-    py; // nodePadding
-  let id = defaultId;
-  let align = _align.justify;
-  let sort;
-  let linkSort;
-  let nodes = defaultNodes;
-  let links = defaultLinks;
-  let iterations = 6;
-  function sankey() {
-    const graph = {
-      nodes: nodes.apply(null, arguments),
-      links: links.apply(null, arguments)
-    };
-    computeNodeLinks(graph);
-    computeNodeValues(graph);
-    computeNodeDepths(graph);
-    computeNodeHeights(graph);
-    computeNodeBreadths(graph);
-    computeLinkBreadths(graph);
-    return graph;
-  }
-  sankey.update = function (graph) {
-    computeLinkBreadths(graph);
-    return graph;
-  };
-  sankey.nodeId = function (_) {
-    return arguments.length ? (id = typeof _ === "function" ? _ : (0, _constant.default)(_), sankey) : id;
-  };
-  sankey.nodeAlign = function (_) {
-    return arguments.length ? (align = typeof _ === "function" ? _ : (0, _constant.default)(_), sankey) : align;
-  };
-  sankey.nodeSort = function (_) {
-    return arguments.length ? (sort = _, sankey) : sort;
-  };
-  sankey.nodeWidth = function (_) {
-    return arguments.length ? (dx = +_, sankey) : dx;
-  };
-  sankey.nodePadding = function (_) {
-    return arguments.length ? (dy = py = +_, sankey) : dy;
-  };
-  sankey.nodes = function (_) {
-    return arguments.length ? (nodes = typeof _ === "function" ? _ : (0, _constant.default)(_), sankey) : nodes;
-  };
-  sankey.links = function (_) {
-    return arguments.length ? (links = typeof _ === "function" ? _ : (0, _constant.default)(_), sankey) : links;
-  };
-  sankey.linkSort = function (_) {
-    return arguments.length ? (linkSort = _, sankey) : linkSort;
-  };
-  sankey.size = function (_) {
-    return arguments.length ? (x0 = y0 = 0, x1 = +_[0], y1 = +_[1], sankey) : [x1 - x0, y1 - y0];
-  };
-  sankey.extent = function (_) {
-    return arguments.length ? (x0 = +_[0][0], x1 = +_[1][0], y0 = +_[0][1], y1 = +_[1][1], sankey) : [[x0, y0], [x1, y1]];
-  };
-  sankey.iterations = function (_) {
-    return arguments.length ? (iterations = +_, sankey) : iterations;
-  };
-  function computeNodeLinks({
-    nodes,
-    links
-  }) {
-    for (const [i, node] of nodes.entries()) {
-      node.index = i;
-      node.sourceLinks = [];
-      node.targetLinks = [];
-    }
-    const nodeById = new Map(nodes.map((d, i) => [id(d, i, nodes), d]));
-    for (const [i, link] of links.entries()) {
-      link.index = i;
-      let {
-        source,
-        target
-      } = link;
-      if (typeof source !== "object") source = link.source = find(nodeById, source);
-      if (typeof target !== "object") target = link.target = find(nodeById, target);
-      source.sourceLinks.push(link);
-      target.targetLinks.push(link);
-    }
-    if (linkSort != null) {
-      for (const {
-        sourceLinks,
-        targetLinks
-      } of nodes) {
-        sourceLinks.sort(linkSort);
-        targetLinks.sort(linkSort);
-      }
-    }
-  }
-  function computeNodeValues({
-    nodes
-  }) {
-    for (const node of nodes) {
-      node.value = node.fixedValue === undefined ? Math.max((0, _index.sum)(node.sourceLinks, value), (0, _index.sum)(node.targetLinks, value)) : node.fixedValue;
-    }
-  }
-  function computeNodeDepths({
-    nodes
-  }) {
-    const n = nodes.length;
-    let current = new Set(nodes);
-    let next = new Set();
-    let x = 0;
-    while (current.size) {
-      for (const node of current) {
-        node.depth = x;
-        for (const {
-          target
-        } of node.sourceLinks) {
-          next.add(target);
-        }
-      }
-      if (++x > n) throw new Error("circular link");
-      current = next;
-      next = new Set();
-    }
-  }
-  function computeNodeHeights({
-    nodes
-  }) {
-    const n = nodes.length;
-    let current = new Set(nodes);
-    let next = new Set();
-    let x = 0;
-    while (current.size) {
-      for (const node of current) {
-        node.height = x;
-        for (const {
-          source
-        } of node.targetLinks) {
-          next.add(source);
-        }
-      }
-      if (++x > n) throw new Error("circular link");
-      current = next;
-      next = new Set();
-    }
-  }
-  function computeNodeLayers({
-    nodes
-  }) {
-    const x = (0, _index.max)(nodes, d => d.depth) + 1;
-    const kx = (x1 - x0 - dx) / (x - 1);
-    const columns = new Array(x);
-    for (const node of nodes) {
-      const i = Math.max(0, Math.min(x - 1, Math.floor(align.call(null, node, x))));
-      node.layer = i;
-      node.x0 = x0 + i * kx;
-      node.x1 = node.x0 + dx;
-      if (columns[i]) columns[i].push(node);else columns[i] = [node];
-    }
-    if (sort) for (const column of columns) {
-      column.sort(sort);
-    }
-    return columns;
-  }
-  function initializeNodeBreadths(columns) {
-    const ky = (0, _index.min)(columns, c => (y1 - y0 - (c.length - 1) * py) / (0, _index.sum)(c, value));
-    for (const nodes of columns) {
-      let y = y0;
-      for (const node of nodes) {
-        node.y0 = y;
-        node.y1 = y + node.value * ky;
-        y = node.y1 + py;
-        for (const link of node.sourceLinks) {
-          link.width = link.value * ky;
-        }
-      }
-      y = (y1 - y + py) / (nodes.length + 1);
-      for (let i = 0; i < nodes.length; ++i) {
-        const node = nodes[i];
-        node.y0 += y * (i + 1);
-        node.y1 += y * (i + 1);
-      }
-      reorderLinks(nodes);
-    }
-  }
-  function computeNodeBreadths(graph) {
-    const columns = computeNodeLayers(graph);
-    py = Math.min(dy, (y1 - y0) / ((0, _index.max)(columns, c => c.length) - 1));
-    initializeNodeBreadths(columns);
-    for (let i = 0; i < iterations; ++i) {
-      const alpha = Math.pow(0.99, i);
-      const beta = Math.max(1 - alpha, (i + 1) / iterations);
-      relaxRightToLeft(columns, alpha, beta);
-      relaxLeftToRight(columns, alpha, beta);
-    }
-  }
-
-  // Reposition each node based on its incoming (target) links.
-  function relaxLeftToRight(columns, alpha, beta) {
-    for (let i = 1, n = columns.length; i < n; ++i) {
-      const column = columns[i];
-      for (const target of column) {
-        let y = 0;
-        let w = 0;
-        for (const {
-          source,
-          value
-        } of target.targetLinks) {
-          let v = value * (target.layer - source.layer);
-          y += targetTop(source, target) * v;
-          w += v;
-        }
-        if (!(w > 0)) continue;
-        let dy = (y / w - target.y0) * alpha;
-        target.y0 += dy;
-        target.y1 += dy;
-        reorderNodeLinks(target);
-      }
-      if (sort === undefined) column.sort(ascendingBreadth);
-      resolveCollisions(column, beta);
-    }
-  }
-
-  // Reposition each node based on its outgoing (source) links.
-  function relaxRightToLeft(columns, alpha, beta) {
-    for (let n = columns.length, i = n - 2; i >= 0; --i) {
-      const column = columns[i];
-      for (const source of column) {
-        let y = 0;
-        let w = 0;
-        for (const {
-          target,
-          value
-        } of source.sourceLinks) {
-          let v = value * (target.layer - source.layer);
-          y += sourceTop(source, target) * v;
-          w += v;
-        }
-        if (!(w > 0)) continue;
-        let dy = (y / w - source.y0) * alpha;
-        source.y0 += dy;
-        source.y1 += dy;
-        reorderNodeLinks(source);
-      }
-      if (sort === undefined) column.sort(ascendingBreadth);
-      resolveCollisions(column, beta);
-    }
-  }
-  function resolveCollisions(nodes, alpha) {
-    const i = nodes.length >> 1;
-    const subject = nodes[i];
-    resolveCollisionsBottomToTop(nodes, subject.y0 - py, i - 1, alpha);
-    resolveCollisionsTopToBottom(nodes, subject.y1 + py, i + 1, alpha);
-    resolveCollisionsBottomToTop(nodes, y1, nodes.length - 1, alpha);
-    resolveCollisionsTopToBottom(nodes, y0, 0, alpha);
-  }
-
-  // Push any overlapping nodes down.
-  function resolveCollisionsTopToBottom(nodes, y, i, alpha) {
-    for (; i < nodes.length; ++i) {
-      const node = nodes[i];
-      const dy = (y - node.y0) * alpha;
-      if (dy > 1e-6) node.y0 += dy, node.y1 += dy;
-      y = node.y1 + py;
-    }
-  }
-
-  // Push any overlapping nodes up.
-  function resolveCollisionsBottomToTop(nodes, y, i, alpha) {
-    for (; i >= 0; --i) {
-      const node = nodes[i];
-      const dy = (node.y1 - y) * alpha;
-      if (dy > 1e-6) node.y0 -= dy, node.y1 -= dy;
-      y = node.y0 - py;
-    }
-  }
-  function reorderNodeLinks({
-    sourceLinks,
-    targetLinks
-  }) {
-    if (linkSort === undefined) {
-      for (const {
-        source: {
-          sourceLinks
-        }
-      } of targetLinks) {
-        sourceLinks.sort(ascendingTargetBreadth);
-      }
-      for (const {
-        target: {
-          targetLinks
-        }
-      } of sourceLinks) {
-        targetLinks.sort(ascendingSourceBreadth);
-      }
-    }
-  }
-  function reorderLinks(nodes) {
-    if (linkSort === undefined) {
-      for (const {
-        sourceLinks,
-        targetLinks
-      } of nodes) {
-        sourceLinks.sort(ascendingTargetBreadth);
-        targetLinks.sort(ascendingSourceBreadth);
-      }
-    }
-  }
-
-  // Returns the target.y0 that would produce an ideal link from source to target.
-  function targetTop(source, target) {
-    let y = source.y0 - (source.sourceLinks.length - 1) * py / 2;
-    for (const {
-      target: node,
-      width
-    } of source.sourceLinks) {
-      if (node === target) break;
-      y += width + py;
-    }
-    for (const {
-      source: node,
-      width
-    } of target.targetLinks) {
-      if (node === source) break;
-      y -= width;
-    }
-    return y;
-  }
-
-  // Returns the source.y0 that would produce an ideal link from source to target.
-  function sourceTop(source, target) {
-    let y = target.y0 - (target.targetLinks.length - 1) * py / 2;
-    for (const {
-      source: node,
-      width
-    } of target.targetLinks) {
-      if (node === source) break;
-      y += width + py;
-    }
-    for (const {
-      target: node,
-      width
-    } of source.sourceLinks) {
-      if (node === target) break;
-      y -= width;
-    }
-    return y;
-  }
-  return sankey;
-}

package/lib-vendor/d3-sankey/src/sankeyLinkHorizontal.js

@@ -1,16 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = _default;
-var _index = require("../../../lib-vendor/d3-shape/src/index.js");
-function horizontalSource(d) {
-  return [d.source.x1, d.y0];
-}
-function horizontalTarget(d) {
-  return [d.target.x0, d.y1];
-}
-function _default() {
-  return (0, _index.linkHorizontal)().source(horizontalSource).target(horizontalTarget);
-}